Headset fully tightened, but fork still loose and wobbly
Should I be able to 'manually' rotate the headset?
How can an object's instantaneous speed be zero and it's instantaneous acceleration be nonzero? I'm studying for my upcoming physics course and ran across this concept - I'd love an explanation. Intuitive examples of importance sampling My background is computer science. I am fairly new to monte carlo sampling methods and, although I understand the math, I have hard time coming up with intuitive examples for importance sampling. More precisely, could someone provide examples of:    an original distribution one cannot sample from but one can estimate an importance distribution which can be sampled from and adequate for this original distribution. Given a Möbius transformation that maps one pair of concentric circles to another pair of concentric circles, why is the ratio of the radii preserved through the map?   I thought about how Möbius transformations are compositions of rotations, scaling, inversion, and translation, and that intuitively, these types of maps shouldn't change the ratio of radii between two circles.   Would it be correct to just say that if $\frac{r_1}{r_2}$ is the ratio of radii between the two circles, then   1) The radii are invariant under translation, $z \mapsto z+a$, so $\frac{r_1}{r_2}$ stays the same  2) Under scaling by a factor $z \mapsto az$, $\frac{ar_1}{ar_2} = \frac{r_1}{r_2}$   3) Under inversion, $z \mapsto \frac{1}{z}$, $\frac{1/r_1}{1/r_2} = \frac{r_2}{r_1}$  Or is there a different/better way to think about this problem? Good refactoring support for C++ The Visual Studio refactoring support  for C# is quite good nowadays (though not half as good as some Java IDE's I've seen already) but I'm really missing C++ support.  I have seen  and am currently trying it out, but maybe one of you guys know a better tool or plugin?  I've been working with  now for a week or two and got totally addicted. Thanks for the tip, I'll try to convince my boss to get me a license at work too.  I've been bughunting for a few days since Visual Assist X kept messing up my Visual Studio after a few specific refactorings, It took me (and customer support) a week to hunt down but let's say for now that Visual Assist X is not a good combination with . My 1.12 solution can be found . When trying to update command blocks to 1.13, I have the following:  scoreboard objectives add invert dummy   (run at start) then:  scoreboard players set FakePlayer invert 1   (impulse unconditional repeat) chained into:  execute at @e[tag=summoned] run scoreboard players reset FakePlayer invert   (chain unconditional repeat) chained into:  execute if score FakePlayer invert = 1 invert run say "All summoned animals are dead!"   This should reset FakePlayers score continuously until all entities with tag "summoned" are dead, then it should run the final condition. This does not happen, and I can't see why. Pull down resistor on logic gate input I would like to use a pull-down resistor on the input of a NOT logic gate. I am using a 5V microcontroller, and I want to ensure that the input of the gate will never be floating (eg. microcontroller damage).  General information:  The logic gate I am using is a HD74LS04 inverter whose datasheet can be found . I am testing the output by placing my positive multi-meter lead on R4 and the negative lead on GND. With the digital pin floating, the output of 1Y is 4.33V. This is the expected behavior.  The logic gate requires a minimum of 2.0V for Vih. If I understand this circuit correctly, I expect the voltage at pin 1A to be 3.76V since R2 and R3 will form a voltage divider. This value seems plenty to signify a 'high' in the logic gate.  R2 exists to protect the digital pin. Ideally, I would have liked R2 to be 1KΩ. Increasing the value of R2 means I have to increase the value of R3 to maintain the same voltage divider. During testing I found that if R3 was any value over 3.3KΩ, the pin 1A would not get pulled down all the way if I left the digital pin floating.   Tests: If I disconnect everything except GND and Vcc and place the positive lead of my multi-meter on pin 1A (now floating) and the negative lead to GND, I read 1.49V. Placing a pull-down resistor (R3) on pin 1A to GND with a value of 100Ω changes the reading to 0.02V. Increasing the resistor's value to 330Ω increases the reading to 0.07V. At the value I need, 3.3KΩ, the reading increases to 0.60V. Finally, changing the resistor's value to 1MΩ increases the reading to 1.47V and actually changes the output of pin 1Y to low.  The test that uses the 3.3KΩ resistor is concerning. The reading I took (0.60V) seems to be approaching the Vil maximum of the logic gate which is 0.80V.   Questions:  This must be a trivial question, but why does an R3 value of 3.3KΩ not pull pin 1A all the way to GND? Is there a formula for determining the correct pull-down resistor value? Other answers I found on here simply state 10KΩ as a 'good' value for a pull-up resistor. I'm not sure where that value comes from or if it is applicable to a pull-down resistor.         &ndash; Schematic created using   Edit: Although Ignacio's answer technically answers the question, I thought I would share some information I found for others who may come across this question.  User 'Papabravo' on the  states that the calculation for a pull down resistor can be calculated by taking the Vil (0.8V) and dividing it by the "standard TTL load" of 1.6mA. As Ignacio pointed out, my specific logic gate can source up to 0.4mA, so the calculation would be 0.8/0.0004A which equals 2KΩ. For safety, I performed the calculation at 0.5V in order to give myself some headroom.  Other Resources: Why does my Mac OS X 10.6 kernel run in 32-bit mode? I have a MacBook Pro (5,1) with 4GB of memory running 10A432 - but it's running the 32-bit kernel.  Any ideas why it wouldn't be running in 64-bit mode, and how I can get it to do so? Say I had;   \begin{equation}   \begin{cases}      x = 0 \\      y = 0 \\      z = 0     \end{cases}     \qquad \text{and} \qquad     \begin{cases}      x = a \\      y = a \\      z = b     \end{cases}   \end{equation}   How could I insert a brace ( } ) in the second 'cases' to say x and y are equal to a. (i.e. } = a ).   I hope this is clear, if not I can sketch it out - just let me know!  Thanks in advance! If $p$ is a prime such that $p≡1\pmod 7$ then $p ≡1\pmod{14}$ Prove or disprove the following:  1)  if $p$ is odd prime such that $p≡1\pmod 7$ then $p ≡1\pmod{14}$  2)  if $p$ is odd prime such that $p≡4 \pmod 7$ then $p ≡4\pmod{14}$  I think that both statement are true and have a similar proof  1) $p≡1\pmod 7$ so $p≡8\pmod 7$ then $7|p-8$ so $p-8= 7 k$ where $k$ is an integer so $p=8+7k$, so $p ≡1\pmod {14}$  It is that a correct proof? Thank you. Nvidia graphics card no longer works in Windows 10 (error: Code 43) but works in Ubuntu Here's my problem  I'm trying to do a cleanup of my hard drive, and I'm constantly seeing this scenario:  (1) Aggregate folder size: I check the folder size viewing properties right clicking the folder  (2) Individual folder/file sizes: I check the individual file/folder sizes belonging to that folder viewing properties on the individual file/folder sizes, and then adding them up (with hidden and system files shown).   These two figures are always different, sometimes by a large margin.   For instance, my C drive now, by method (1), shows a consumed space of 42.4 GB.   However, by method (2), by inspecting the respective files/folders, the total consumed space adds up only to 33.1 GB. This is a 28% discrepancy (over the smaller file size) and I have no idea where the rest of the space is going.   My hard drive is constantly in danger of being full (it's bootcamp on a mac with 50 GB of partitioned space), and there's not much I've got installed in terms of software, nor do I have large media files like movies, downloads, temp files, application temp files, torrents, etc.   Most of it's just consumed by the files in C:/Windows, but last I checked, I don't know enough to know which files to delete, and I've heard that you really can't do anything about the space boggling winsxs and system32.   Can you guys recommend a starting point to free up disk space?  Thanks!!  Baggio. Why is pruning not needed for random forest trees? Breiman says that the trees are grown with out pruning. Why? I mean to say that there must be a solid reason why the trees in random forest are not pruned. On the other hand it is considered very important to prune a single decision tree to avoid over fitting. Is there some literature available to read for this reason? Of course the trees may not be correlated but there still will be a possibility of over fitting. I am using Ubuntu 16.10 and recently I have not been able to connect to internet using Ethernet. The network manager shows device not managed. The WiFi network is working fine.      I've tried the solution from this questionn  with no use.  My /etc/network/interfaces file:  # interfaces(5) file used by ifup(8) and ifdown(8) auto lo iface lo inet loopback   My /etc/NetworkManager/NetworkManager.conf file:  [main] plugins=ifupdown,keyfile,ofono dns=dnsmasq  [ifupdown] managed=true   Output of nmcli d:  DEVICE  TYPE      STATE      CONNECTION  wlp2s0  wifi      connected  eduroam     enp8s0  ethernet  unmanaged  --          lo      loopback  unmanaged  -- How do I access my Windows partition? I have Ubuntu 12.04 installed on my HP G62-453 TU Laptop. I cannot access the contents of my hard disk partition E. C# 3.0 Auto-Properties - Is it possible to add custom behaviour? I would like to know if there is any way to add custom behaviour to the auto property get/set methods.  An obvious case I can think of is wanting every set property method to call on any PropertyChanged event handlers as part of a System.ComponentModel.INotifyPropertyChanged implementation.  This would allow a class to have numerous properties that can be observed, where each property is defined using auto property syntax.  Basically I'm wondering if there is anything similar to either a get/set template or post get/set hook with class scope.  (I know the same end functionality can easily be achieved in slightly more verbose ways - I just hate duplication of a pattern) How does RNA transcription determine which half of the DNA to use? I feel that I might have a complete misunderstanding here. If DNA has two strands, how does the machinery of RNA transcription determine which one to transcribe? Stack Overflow is not getting refreshed automatically Stack&nbsp;Overflow is not getting refreshed automatically. I have to press F5 explicitly to refresh the website. What might be the issue? A concept of the exterior derivative for functionals Proof that a sequence is convergent I'm asked to prove the convergence of the sequence $$X_n=\left(1+\frac12\right)\left(1+\frac14\right)\left(1+\frac18\right)\cdots\left(1+\frac{1}{2^n}\right)$$   I proved that it is increasing through the ratio test and then I want to prove that it is bounded.  My question is the following : is it enough to say that $X_n&lt;\left(\frac32\right)^n$ for $n&gt;1$ or not ? Namely, can we say that a sequence is bounded if $\forall$  $n$ ,  $\exists$ a $N$ such that $X_n&lt;N$ or do I have to find a N such that $\forall$  $n$ , $X_n&lt;N$?  In other words, can a bound depend on $n$ ?  Thanks for your help. In the simple linear regression case $y=\beta_0+\beta_1x$, you can derive the least square estimator $\hat\beta_1=\frac{\sum(x_i-\bar x)(y_i-\bar y)}{\sum(x_i-\bar x)^2}$ such that you don't have to know $\hat\beta_0$ to estimate $\hat\beta_1$  Suppose I have $y=\beta_1x_1+\beta_2x_2$, how do I derive $\hat\beta_1$ without estimating $\hat\beta_2$? or is this not possible?