I purchased 20 shares of tesla Feb 10th or 11th at $146.63 a share. I had a strong indication that the stock price over corrected with the downturn in the market and also the quarterly reports. I also assumed that with their upcoming Model 3 release the stock price would swing back up.   My exit strategy going into the stock was at $230 a share I was going to get my investment back out and let the rest sit until the end of time. I assumed that at best I could get $230 a share when the new car was announced.   Well on Friday it closed at $232 a share and there is still a week and a half until the announcement. It's very likely that this stock can approach $300 a share.  So here is my question. Does a disciplined investor stick with their original strategy and get out or do they stay in and make more? Also, I anticipate that this stock is worth around $260 a share. So am I silly for not selling it all if it goes above that?   Ehh good problems to have but still tough to decide. I don't want to miss bigger gains.
I have a 10 stock portfolio and considering market conditions that are on the rise when this question in being asked, a few of them did hit their 52-week high price.  I would like to call myself a long term investor and I do not like to trade so much. If I take "Buy low sell high" as gospel then this is in my opinion a good selling position.  On one hand, I think I should lock my profit because stocks don't hit a 52-week high every day, but on the other hand, there is nothing wrong with the company and it is very well positioned to go up even further.  Any suggestions?
How do I bind the tmux prefix to a Super? I find even Ctrl+b to be very emacs like but I understand the point. I'm wondering if I could bind it to a single keypress of a key I don't other wise use? namely Super_L (also known as the left windows key. for why I say Super_L start xev in a terminal and press that key) Simple form validation Am I Running as a Service Run TTY script every time I open a GUI terminal Is a small size block cipher usable? Consider a block cipher with a key of size 128 bits but a small block size, say 32 bits.  Is this kind of block cipher secure?  I would like to know to what extent I can use a small block cipher, like a 32 bit block cipher. What are the constraints so that the use is acceptable in a real life application.  For instance, if we use a one-time key, that is, to encrypt only one message. Besides, the message could be small.  Suppose that when we want so send one file, we perform a key agreement so that we use the key for one message. This scenario is not efficient, but the CPA find-then-guess game is not adequate in this case. How can I prevent iTunes from auto starting when I plug in an iOS device? AuraClientService.postProcess: error in processing [RangeError: Maximum call stack size exceeded] - Client Side Action I have a lightning component that is using ui:inputSelect.   The component code:              &lt;div class="slds-form-element__control"&gt;                 &lt;ui:inputSelect class="slds-select" aura:id="quals" change="{!c.getPreCodes}"&gt;                     &lt;aura:iteration items="{!v.questions}" var="q"&gt;                          &lt;ui:inputSelectOption aura:id="question" text="{!q.Id}" label="{!q.Question_Text__c}"/&gt;                     &lt;/aura:iteration&gt;                 &lt;/ui:inputSelect&gt;             &lt;/div&gt;   The controller:      getPreCodes : function(cmp, event, helper){         var selected = cmp.find("quals").get("v.value");          var action = cmp.get("c.getPreCodes");         action.setParams({             "qualID" : selected         });         action.setCallback(this, function(response){             var state = response.getState();             if (state === "SUCCESS") {                  console.log('precodes: ', response.getReturnValue());              }         });          $A.enqueueAction(action);     }   The basic logic is that the uiSelect is dynamically populated on init (this works fine). When a user makes a selection the "change" parameter function is fired to retrieve a list from the database and pass it to another component.   However, the change function {!c.getPreCodes} seems to be called recursively causing a      "Something has gone wrong. AuraClientService.postProcess: error in   processing [RangeError: Maximum call stack size exceeded] . Please try   again."   error. If I comment out the enqueueAction the function only runs once (nothing is called recursively) so I suspect it has something to do with the controller call. Using Rule of Three to obtain confidence interval for a binomial population I have a large population of data instances (say, 1000 instances) that are either of class1 or of class2. I would like to obtain a confidence interval for how many instances are of class1 without exhaustively checking all instances. I have randomly sampled 50 instances, and all 50 were of class1. I used the  to determine that a 95% confidence interval for the percentage that an instance is of class1 is  [0.94, 1].  From my sampling, I know that at least 50 instances are of class1. For the remaining 1000 – 50 = 950 instances whose classes are unknown, I assume I can apply the [0.94, 1] confidence interval found above. Therefore, can I conclude that, with a 95% confidence, there are at least 50 + (1000 – 50)(0.94) = 943 instances from the population of 1000 that are of class1?  If this conclusion isn’t statistically sound, how can I obtain a confidence interval for class1? This is what happens:  sudo apt-get install vlc Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package vlc   Please help. I would also like to know when this error occurs, I've seen it before too. Do I need to pay in full for hostel reservation to show proof of accommodation for a Schengen visa? I am applying for a Schengen visa to travel to Germany and one of the requirements is showing proof of accommodation. I booked all my hostels via hostelworld.com, but only paid the non-refundable deposit (a couple of dollars for each place) instead of the entire amount. I intend to pay the rest of it on arrival at the hostel (or cancel it and go CouchSurfing, thus saving money).  But for the visa application, will the non-refundable deposit be enough to show proof of accommodation?  The reason I ask is, I emailed one of the hostels requesting a document showing my name and accommodation confirmation, and they replied saying they could only give me such a document once I pay in FULL.  Is this how I'm supposed to book for all places?  Have I been doing it wrong all this while (by only paying the tiny non-refundable deposit instead of full hostel fare)? A challenge on the parabola Good Night ... Here I am editing the question and explaining the purpose of the same ... Mathematics course, and I love this science, I am very curious, and these days, studying a book of calculus found in (book from the library of the University) a sheet full of challenges, to share with a colleague, he gave me this challenge, which he also failed to respond ... I tried, I tried, I used the formulas of quadratic equation, and I've been trying since Friday (here in Brazil is Sunday at 22:33), and could not, and I ask your help, and please believe me, I struggled, tried to make substitutions, tried both, and I'm confused ... I must find the values of $ a, b $ and $ c $?  Consider a parabola whose roots, other are $x'$ and $x''$, and such that $x'=-x''$ where $x'&gt; 0$. Let $$A = (x', 0)$$ $$B = (x'', 0)$$ and $V$ the vertex of the parabola. Suppose that the equation of this parabola is $$y = ax^2 +bx+ c$$. Calculate the value of the discriminant $$\Delta=b^2-4ac$$, so that the triangle is equilateral AVB. Can magnets rotate infinitely? There are many videos on youtube in which people arranged magnets in circle and rotated one placing in middle of that circle on a shaft, and the magnet (magnet motor) starts madly and continues its movement. Do they really rotate infinitely? If so, do they from where they get that extra energy to move so fast and infinitely?    EDIT: This question is about real world scenario  UPDATE: I am unable to find that particular video about which i talked about -- I added them to my favourites, but they are all now deleted :( -- there are hundreds of that that kind of videos. Some example videos links locating latitude-longitude point in a piste-map with matrix transforms I am trying to plot points of a particular latitude longitude on this image of a Swiss mountainous landscape.    What I am doing is I have some 54 known location-points plotted on this image (not visible in the linked image), which is a piste map, and is therefore an artist's impression of the landscape. I found out the latitude-longitudes and also height above sea level for these 54 known points. I opened my piste map in the GIMP, and plotted the 54 points, while at the same time reading their co-ordinates in points, in the piste-map. So, I have x-y coordinates (lat-long) and z coordinate (height above sea level) for all those 54 points (so its a 3d co-ordinate system that I have), and I also have X-Y coordinates of those places in my piste-map (a 2d co-ordinate system), and I assume a Z=1 for all those points.   To locate a particular lat-long on my piste-map(I have the coordinates for this place, i.e. the lat-long but not elevation), I need to calculate their X-Y on the piste-map. My approach is, that I calculate distances between this point which is to be located and those 54 known points , and then I sort them in ascending order. The first two points in this order will be the nearest points to the one which we want to locate. Now, I find my 3rd known point, and for that, I loop over the rest of the points, to get the nearest possible point such that this point forms a triangle with the first two closest points with the point which is to be located falling inside the formed triangle. Now, I have three known points forming a triangle say triangle ABC. For these known points, I have a triangle A'B'C' in the piste map, and the point to be located lies in the latter. I figure out the transform matrix which when multiplied with the 3X3 matrix of the three known points(in this 3X3 matrix, each row corresponds to a point, with the column values x,y and z in the 3d scape) results in a 3X3 matrix of those points in the piste-map. I multiply this transform matrix calculated with a new 3X3 matrix for three points, the first one being the point to be located, and the remaining two are the last two known points in the first 3X3 matrix. This way, the first two elements of my resulting matrix are the X and Y values for the point to be located, and I proceed ahead to draw the point on the piste-map. Is this approach correct with respect to the way I am using the transform matrix? Thanks! I would really appreciate if any alternative approaches are suggested as well! The following you could have seen in  (sorry, I've commented there, so you won't see it anymore) in Chrome 35.0.1916.153 m (current version). Notice how the add comment link overlaps the bounty box:    The same you can observe with a comment box on other sites, e.g. at this time in :    Could you shift it a bit down ?  It seems that it happens on more than just Stack Overflow (maybe all sites ?). Lie algebra and tangent space at the identity are isomorphic Define the Lie algebra $\mathfrak{g}$ of a Lie group G to be the set of all left-invariant vector fields of $G$. I want to prove that   $$          f: \mathfrak{g} \rightarrow T_eG \\              X \mapsto X(e) $$ is a linear isomorphism.  The only thing that I have left to prove is surjectivity.Letting $v\in T_eG$, we set $X\in \mathcal{X}(G)$ such that $\forall x\in G,\,X(x)=L_{x_{*,e}}(v)$ (I still have to show that such an $X$ is indeed a vector field on $G$). We get that  $$ f(X)=X(e)=L_{e_{*,e}}(v)=v $$  where the last equality holds because  $$       L_{e_{*,e}}(v)f = v(f \circ L_e) = v(f \circ id_G) = v(f) $$ for any $f\in C^\infty(G)$. (I am thinking of the tangent vectors as derivations).  Now all we have left to do is prove that such an $X$ is left-invariant, and it is therefore an element of $\mathfrak{g}$, but I do not know how. I tried to prove that  $$            \forall f\in C^\infty(G),\, L_{{x}_*,y}(X(y))f=X(L_x(y))f $$ but with no success. Related:   I know I must describe my past and current research in my personal/research statement or statement of purpose. But do I use technical terms?  I was given the advice that since the people reading my statement are mathematicians (I am applying to US for applied mathematics), they should know what I am talking about.  Although I am applying to applied mathematics, it would also be nice to hear from other fields (biology, computer science, engineering etc) about this. biblatex – et al. beginning from second citation? Basically all I need to know is how I can use "et. al" beginning from the second citation of a source. I am using the following  \usepackage[ natbib=true, style=authoryear ]{biblatex}   I need citations to look like this:  First citation of a source     Drobetz, Schillhofer, and Zimmermann (2004)   Second and further citations     Drobetz et al. (2004)   Right now, every citation looks like the first one. With the biblatex option maxcitenames I can only adjust all citations and not all but the first one. Any help? How do major and minor grooves arise in the DNA helix? I understand that they arise due to the pairing of bases of two opposite stands and are sites through which important proteins needed for replication and transcription of DNA interact. But I don't get how the arrangement of bases really generate the grooves. Is C++ CLI a superset of C++? Would a C++  compiler be able to compile some large sets of C++ classes without modifications?   Is C++ CLI a superset of C++? Given $x_1,x_2,x_3,x_4$ real numbers such that $x_1+x_2+x_3+x_4 = 0$ and $x_1^7+x_2^7+x_3^7+x_4^7 = 0,$ how can I use symmetric functions and Newton's sums to prove that $x_1(x_1+x_2)(x_1+x_3)(x_1+x_4)=0$?  This is what I have so far:   Note that $x_1 = -(x_2+x_3+x_4)$ and the relation between Newton's sums, elementary symmetric polynomials, and power sums gives us that $P_7-S_1 P_6+S_2 P_5-S_3 P_4+S_4P_3=0,$ where $P_k$ denotes the $kth$ power sum and $S_k$ denotes the $kth$ elementary symmetric polynomial of $x_1,x_2,x_3,x_4.$   We want to show that $(x_2+x_3+x_4)(x_2+x_3)(x_2+x_4)(x_3+x_4) = 0.$  But how?