How do I upgrade a hardware driver with no internet connection. can I do it from a usb stick?
How can I install software or packages without Internet (offline)?
If $M$ isn't Noetherian, $M$ has a submodule maximal with respect to being not finitely generated. I'm answering this question:     Let $M$  be a module. Show that if  $M$ is not Noetherian then $M$ has a submodule $N$ such that $N$ is not finitely generated but $A$ is finitely generated whenever $N &lt; A ≤ M$.   The solution starts as follows (I'm following a given solution): Let $Y$ be the set of non-finitely-generated submodules of $M$. If $(N_α)$ is a chain in $Y$ then $Q= \bigcup_αN_α $ is in $Y$, else $Q$ is f.g., which implies $Q=N_α$ for some $α$, whence $N_α$  is f.g., contradiction.  I don't understand why if $Q$ is f.g., then $Q=N_α$ for some $α$? Am I missing some fact?  Thanks! I've discovered a new pattern.  Is this pattern well known or what is the opinion about it?  Basically, I have a hard time scrubbing up and down source files to figure out what module imports are available and so forth, so now, instead of  import foo from bar.baz import quux  def myFunction():     foo.this.that(quux)   I move all my imports into the function where they're actually used., like this:  def myFunction():     import foo     from bar.baz import quux      foo.this.that(quux)   This does a few things.  First, I rarely accidentally pollute my modules with the contents of other modules.  I could set the __all__ variable for the module, but then I'd have to update it as the module evolves, and that doesn't help the namespace pollution for code that actually lives in the module.  Second, I rarely end up with a litany of imports at the top of my modules, half or more of which I no longer need because I've refactored it.  Finally, I find this pattern MUCH easier to read, since every referenced name is right there in the function body. What's the 'correct' way of registering/installing an Assembly to the GAC? There seems to be lots of different ways to register assemblies with the GAC, as in, they 'work'.  However, what's the "proper" way of doing it?  In response to Lou Franco (and gacutil):  I'm using Gacutil for development, but it seems to me to be not the proper way to install it, since gacutil isn't included in the basic .NET utilities past .NET 1.1 - it's only a developer tool.  Additional: Gacutil (as seen in responses below) is not redistributable, and therefore should not be used in any app that you intend to give to people who are not developers.  AKA, customers.  See .  In response to using WIX:  WIX might be great and all, but how does it work under the hood?  What details makes the way WIX installs the assembly the right way to install it?  How does it look it up?  Is it a system/.NET call?  Is there some call in a dll buried somewhere in System32 that needs to be made?    (Edit: it looks like WIX uses MSI under the hood.  See my comments in the accepted answer.)  Final edit: It looks like the correct way to install an assembly to the GAC is using windows installer, and nothing else.  I'm going to give Wix a try.  Thanks all! Benefits & Practicality of Virtual Machines I have been living under a rock for the past 5 - 8 years, and am just now getting up to speed with virtualization, virtual machines and platforms like VMware or VirtualBox.  I think I am starting to get them, but there are two concepts about VMs that I'm just choking on for some reason; one has to do with their intrinsic benefit to the enterprise, and the other has to do with their practicality when being used.  So I understand that you can have multiple VMs running on the same physical machine, all doing their own "thing" as if they were separate machines. So let's say I want to make a nice little virtual network of servers in my home office so I can have a big sandbox to play inside of for all my projects. I set up 2 physical machines as servers, and on each of them I have, say, 4 virtual machines running (1 might be an app server, another might be a RDBMS, another might be a message broker, etc.).   Besides saving me money (as I only have to provide 2 physical machines instead of buying 8 servers), what instrinsic benefit/purpose do these VMs serve here? I don't care how clever virtual machines are, if my computer only has 8GB of RAM, and I have 4 VMs running on it, those VMs only get 8GB of RAM to share between them. Putting 4 VMs on my server doesn't endow it with 4 times that amount of RAM! So, as far as I see it, VMs save you money on hardware, but just end up bogging down that hardware as you have multiple machines competing over the same pool of resources. What am I missing here? Can VMs communicate with each other over your network using high-level protocols like TCP/IP, HTTP, FTP, etc.? Otherwise, it just doesn't make sense to implement all these VMs if you have to feed them separate and independent chunks of data/requests to process. In English, the number 0 is treated as plural. It is then:   0 seconds 1 second    1.2 seconds   2 seconds     Shouldn't it be "nobody want to go there," instead of "nobody wants to go there"?  I also saw in TOEFL that "any __" should be used with a singular.  But I see it very common that it is a plural also.  Why is that?  (updated: example, "we don't have any apples any more" vs "If you get any apple, please let me know.") How can I move an object towards another along a straight line /usr/sbin/grub never finishes I did apt-get upgrade it never finishes at this point:  Searching for GRUB installation directory ... found: /boot/grub Searching for default file ... found: /boot/grub/default Testing for an existing GRUB menu.lst file ... found: /boot/grub/menu.lst Searching for splash image ... none found, skipping ... Found kernel: /boot/vmlinuz-3.2.0-24-virtual Updating /boot/grub/menu.lst ... done  You already have a NoLOADER configuration in /etc/grub.conf Running boot loader as requested Running /usr/sbin/grub  ...    The system does not freeze (Ctrl-Z works, I get my console back) just that that /usr/sbin/grub seems to never complete.  What should I do? Why doesn't the tilde (~) expand inside double quotes? Without using Axiom of Choice, prove that $$\forall\alpha\geq\omega,~~|L_\alpha|=|\alpha|,$$  in which $\alpha$ is an ordinals, $\omega$ is the set of natural numbers, $L_\alpha$ is the $\alpha$-th constructiable set, $|x|$ is the cardinals of $x$.  I am learning a set theory, and I have read a proof by using AC. The AC is used only when $\alpha$ is a limit ordinals during the transfinite inductive method for $\alpha$ . I wonder if there is a proof without AC. 　THANKS! Photoshop CS6 Resize Rectangle with Rounded Corners This question is about Photoshop CS6. Hopefully the feature was added in this version. Before posting I looked up Google and  and  but didn't find an answer for CS6.  So the question is: Is there a feature within CS6 or a script that allows to resize a vector element with rounded corners without using the Direct Selection Tool (white arrow tool) and not changing the border radius? What would be great would be something like simply using the transform tool or something like a grid resize tool. Is "chutzpah" used by non-Jewish English speakers? Which pseudo-$R^2$ measure is the one to report for logistic regression (Cox & Snell or Nagelkerke)? I have SPSS output for a logistic regression model. The output reports two measures for the model fit, Cox &amp; Snell and Nagelkerke.  So as a rule of thumb, which of these $R^²$ measures would you report as the model fit?  Or, which of these fit indices is the one that is usually reported in journals?    Some Background: The regression tries to predict the presence or absence of a bird (capercaillie) from some environmental variables (e.g., steepness, vegetation cover, ...). Unfortunately, the bird did not appear very often (35 hits to 468 misses) so the regression performs rather poorly. Cox &amp; Snell is .09, Nagelkerke, .23.    The subject is environmental sciences or ecology. Find an example where Markov's inequality is tight in the following sense: For each positive integer $a$, find a non-negative random variable $X$ such that $P(X\ge a)=E(X)/a$.   How to do this problem, I am really confused. Also, what is the definition of Markov's inequality? How do I get started creating an Ubuntu Desktop App? Mobile web refresher, part 3 What should be the intuition when working with compactness? I have a question that may be regarded by many as duplicate since there's a  one at MathOverflow. The point is that I think I'm not really getting the idea on compactness. I mean, in $\mathbb{R}^n$ the compact sets are those that are closed and bounded, however the guy who answered this question and had his answer accepted says that compactness is some analogue of finiteness. That's the first problem: In my intuitive view of finiteness, only boundedness would suffice to say that a certain subset of $\mathbb{R}^n$ is in some sense &quot;finite&quot;. On the other hand there's the other definition of compactness (in terms of covers) which is the one I really need to work with and I cannot see how that definition implies this intuition on finiteness. Also, I feel it's pretty strange the covers people use when they want to deal with compact sets. To prove a set is compact I know they must show that for every open cover there's a finite subcover; the problem is that I can't see intuitively how one could show this for every cover. Also when trying to disprove compactness the books I've read start presenting strange covers that I would have never thought about. I think my real problem is that I didn't yet get the intuition on compactness. So, what intuition should we have about compact sets in general and how should we really put this definition to use? Can someone provide some reference that shows how to understand the process of proving (and disproving) compactness? What is this element on the far right of schematic described as "270 OHM"? Is this some kind of inductor? What is its purpose in this device (this is a reference design of dc-dc power supply of sim900 taken from its datasheet) and what would be an exemplary part number? Move rigidbody using WASD keys but rotate it based on camera/mouse movement I am very new to unity and my scripts are based on some scripts found on the web.   I want to make a first person view so the camera is attached to my rigidbodys head. Then i want to move my rigidbody based on keyboard input (wasd) and rotate it using the mouse movement.  Until now, i used the following code for moving my rigidbody:  void Update() {      /* calculate rigidbody movement */     movement = new Vector3( Input.GetAxisRaw("Horizontal"), 0, Input.GetAxisRaw("Vertical")).normalized;      /* calculate mouse look to rotate the rigidbody*/     mouseDelta = new Vector2(Input.GetAxisRaw("Mouse X"), Input.GetAxisRaw("Mouse Y"));     mouseDelta = Vector2.Scale(mouseDelta, new Vector2(sensitivity * smoothing, sensitivity * smoothing));     smoothV.x = Mathf.Lerp(smoothV.x, mouseDelta.x, 1f / smoothing);     smoothV.y = Mathf.Lerp(smoothV.y, mouseDelta.y, 1f / smoothing);     mouseLook += smoothV;  }  void FixedUpdate() {         /* apply rigidbody movement from Update() */     transform.Translate( movement * moveSpeed * Time.deltaTime );             /* apply rigidbody rotation from Update() */     transform.localRotation = Quaternion.AngleAxis(mouseLook.x, transform.up);             /* apply camera rotation from Update() */     Camera.main.transform.localRotation = Quaternion.AngleAxis(-mouseLook.y, Vector3.right);    }   I learned today that i dont have to move a rigidbody's transform but now i am totally confused and it seems i have to restart my whole (first!) project.  So when i use MovePosition and MoveRotation, how do i rotate it based on the camera perspective/mouse movement?  I think the movement Vector is ok so i can simply rewrite the FixedUpdate to something like  rigidbody.MovePosition(movement * speed * Time.deltaTime)   but i am totally stuck on how to apply the camera rotation to my rigidbody to use it like  void FixedUpdate() {      /* move the rigidbody */                rigidbody.MovePosition(movement * moveSpeed * Time.deltaTime);     /* rotate the camera */     camera.transform.localRotation = Quaternion.AngleAxis(-mouseLook.y, Vector3.right);      /* but how can i rotate the rigidbody based on the cameras rotation??? */     rigidbody.MoveRotation(?????);  }   I hope its clear what i want, thank you! Presumably after an update, google chrome has very serious problems with page rendering. I want to downgrade it. (Switching to vmlinuz.old and initrd.img.old did not help).  $ apt-cache policy google-chrome-stable google-chrome-stable:   Installed: 35.0.1916.153-1   Candidate: 35.0.1916.153-1   Version table:  *** 35.0.1916.153-1 0         500 http://dl.google.com/linux/chrome/deb/ stable/main i386 Packages         100 /var/lib/dpkg/status   on a computer where google chrome works ok:  $ apt-cache policy google-chrome-stable google-chrome-stable:   Installed: 34.0.1847.132-1   Candidate: 35.0.1916.153-1   Version table:      35.0.1916.153-1 0         500 http://dl.google.com/linux/chrome/deb/ stable/main amd64 Packages  *** 34.0.1847.132-1 0         100 /var/lib/dpkg/status   (If I had the .deb on the 2nd computer, everything would be easier. But there's no .deb. And no old .deb's on the google site.)  So I try:  $ sudo aptitude install google-chrome-stable=34.0.1847.132-1 Unable to find a version "34.0.1847.132-1" for the package "google-chrome-stable" Unable to find a version "34.0.1847.132-1" for the package "google-chrome-stable" No packages will be installed, upgraded, or removed. 0 packages upgraded, 0 newly installed, 0 to remove and 0 not upgraded. Need to get 0 B of archives. After unpacking 0 B will be used.   You see, it does not work. The Synaptic manager also shows no version that I could set.  So, how do I downgrade google-chrome-stable?  Probably someone knows an archive of old google-chrome .deb's? How to derive the conjugate prior of an exponential family distribution I am trying to derive the conjugate prior of the univariate Gaussian distribution over both the mean and the precision. I know that the prior I'm looking for is the normal-gamma distribution, but the idea is to derive this result.  It seems that you can write down the conjugate prior of an exponential family distribution immediately if you represent it in the canonical exponential family form.  suggests a way to do just that. So far I have written the Gaussian probability function in this form and equated the following, but I don't see how the form of the conjugate prior is immediately obvious.  $$p(\mu, \lambda | D) \propto p(\mu,\lambda)p(D | \mu, \lambda)$$