I'm using VMware player 16 on win10. As soon as my mouse moves outside of the VM I can no longer type in the VM. My expectation is that I should have to click on another window before I can no longer type in the VM. If I move the mouse outside of the window I can no longer type, but once the mouse moves back inside of the window I can type again. Can anyone advise on how to retain the ability to type when the cursor is outside of the window?
I am having issues with input in VMware Workstation Player 12 in windowed mode or on multiple screens. When typing something in the VM and moving mouse cursor out of the VM without clicking on anything (for example on the second screen with host OS), the typing in that VM stops until I move the cursor back into VM.  Can this feature be disabled somehow so I am able to type in the virtual machine even when cursor is outside of it?  Both guest and host are Win10 x64 OS.
Why do all Winforms programs require the [STAThread] attribute? I've just finished running my first session with only one player, and it felt pretty different from running a session for a group.  Could someone with more experience in this talk about what one should do differently in that situation?  I'm not referring to mechanics like encounter-building, but just how to handle the change to the social dynamics. Why is uniform prior on log(x) equal to 1/x prior on x? I'm trying to understand Jeffreys prior. One application is for 'scale' variables like the standard deviation $\sigma$ (or its square, the variance $\sigma^2$) of Gaussian distributions. It is often said that using a uniform prior over $\sigma$ is not really non-informative and instead one should either:   Use instead $\ln \sigma$ as the free parameter, with a uniform prior (this is often called a log-uniform prior) Or keep using $\sigma$ as the free parameter but use $1/\sigma$ as the prior (which is not uniform).   Why are the above two methods/priors equivalent? I feel it has something to do with the fact that the derivative of ln $\sigma$ is $1/\sigma$ but I can't take the next step.   Also, why does this even matter, in simple language with minimal jargon? I see all these complicated explanations online involving the Fisher information matrix but in the end all I see is that the above log-uniform or $1/\sigma$ priors preferentially weight lower values of $\sigma$ more highly. Why? If possible, a simple analytic example or python snippet would be very helpful. Proper to add tense to acronyms, abbreviations and initialisms I'd like to be able to find out which process is currently using a certain port in Linux. Is there any way to do this? Err http://archive.canonical.com natty InRelease     Err http://security.ubuntu.com oneiric-security InRelease                Err http://extras.ubuntu.com natty InRelease                             Err http://security.ubuntu.com oneiric-security Release.gpg   Temporary failure resolving ‘security.ubuntu.com’ Err http://archive.canonical.com natty Release.gpg   Temporary failure resolving ‘archive.canonical.com’ Err http://extras.ubuntu.com natty Release.gpg   Temporary failure resolving ‘extras.ubuntu.com’ Err http://gb.archive.ubuntu.com oneiric InRelease Err http://gb.archive.ubuntu.com oneiric-updates InRelease Err http://gb.archive.ubuntu.com natty-backports InRelease Err http://gb.archive.ubuntu.com oneiric Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’ Err http://gb.archive.ubuntu.com oneiric-updates Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’ Err http://gb.archive.ubuntu.com natty-backports Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’  Reading package lists... Done W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric/InRelease       W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric-updates/InRelease   W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/natty-backports/InRelease   W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/oneiric-security/InRelease   W: Failed to fetch http://archive.canonical.com/ubuntu/dists/natty/InRelease   W: Failed to fetch http://extras.ubuntu.com/ubuntu/dists/natty/InRelease   W: Failed to fetch http://archive.canonical.com/ubuntu/dists/natty/Release.gpg  Temporary failure resolving ‘archive.canonical.com’ W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/oneiric-security/Release.gpg  Temporary failure resolving ‘security.ubuntu.com’ W: Failed to fetch http://extras.ubuntu.com/ubuntu/dists/natty/Release.gpg  Temporary failure resolving ‘extras.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric-updates/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/natty-backports/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Some index files failed to download. They have been ignored, or old ones used instead.   This is what I'm seeing when I try to run sudo apt-get update. I did an update on my instance yesterday and am now experiencing this. I'm looking to implement a phase lock in an FPGA without using any external components (other than the ADC). For simplicity locking to a simple binary pulse is adequate. The frequency of the signals is ~0.1-1% of the clock. I can't use the onboard clock PLL's because they are typically:   Not configurable (set during synthesis). Jittery. Don't support the frequency I need.   I've been sorting through the literature and found a few binary phase locked loops. Most notable a "pulse steal" design that I can post a link to if desired. I have implemented and synthesized with some success, but its jitter and lock range was not as good as advertised. I've also had success using a external DVCO, but I would prefer if I can implement everything on chip.  A digital circuit design or even a hint in the right direction would be helpful (I've been banging my head against this for a while), a proven FPGA implementation would be wonderful but not expected.   ADDED 10-27-2010   The actual DPLL design that I used has a "Random Walk Filter" as the loop filter (not the "pulse steal" described earlier, going through my notes that didn't work to well), which then drives the clock pulses to the DCO. The lock-in range is set via divider in the DCO. The sensitivity of the loop is established by varying the length of the random walk.   The paper in which this is found is cited at the end of this post. After implementing parts of it myself, I found that it was actually already implemented on OpenCores, however it turns out that in the last few months the project was deleted but I have the Verilog files saved if anyone wants them.  Yamamoto, H.; Mori, S.; , "Performance of Binary Quantized All Digital Phase-Locked Loop with a New Class of Sequential Filter," Communications, IEEE Transactions on , vol.26, no.1, pp. 35- 45, Jan 1978  doi: 10.1109/TCOM.1978.1093972  URL: Of Half-elven and mortal life Get referenced node fields in twig In Drupal 8, I have a content type, that has an "entity_reference" field and I wish to access the referenced node's fields in twig template. the kint() output for the field is:   In this list I can't find the referenced node's field values. How can I (if at all possible) load the node or node fields/values in twig?  Best,  Alari Let's say I am building a logistic regression model where the dependent variable is binary and can take the values $0$ or $1$. Let the independent variables be $x_1, x_2, ..., x_m$ - there are $m$ independent variables. Let's say for the $k$th independent variable, the bivariate analysis shows a U-shaped trend - i.e., if I group $x_k$ into $20$ bins each containing roughly equal number of observations and calculate the 'bad rate' for each bin - # observations where y = 0 / total observations in each bin - then I get a U shaped curve.  My questions are:   Can I directly use $x_k$ as input while estimating the beta parameters? Are any statistical assumptions violated which might cause significant error in estimating the parameters? Is it necessary to 'linearize' this variable through a transformation (log, square, product with itself, etc.)? Is the Formula Logically Valid? I have a question for my exam and I find it hard to understand.  I have to prove that the following formula is logically valid:    The professor told me to "push" all the symbols inside the brackets, and use the deduction theorem.  But I don't know how to do it, because I can't find the identities to push the "exist" symbol inside the brackets.  Your help is appriciated, thank you.  Alan In Java, what is the best way to determine the size of an object? I have an application that reads a CSV file with piles of data rows.  I give the user a summary of the number of rows based on types of data, but I want to make sure that I don't read in too many rows of data and cause OutOfMemoryErrors.  Each row translates into an object.  Is there an easy way to find out the size of that object programmatically?  Is there a reference that defines how large primitive types and object references are for a VM?  Right now, I have code that says read up to 32,000 rows, but I'd also like to have code that says read as many rows as possible until I've used 32MB of memory.  Maybe that is a different question, but I'd still like to know. Cleveref with counters with same name I am trying to use the  package.  I have the following counters defined (hopefully this is the right way to do it!)  \newtheorem{thm}{Theorem}[section] \newtheorem{lemma}[thm]{Lemma} \newtheorem{cor}[thm]{Corollary}   This works as I would like (i.e. Theorem 1.1, Corollary 1.2, Lemma 1.3, etc.)  My problem is \cref always returns Theorem 1.2, Theorem 1.3. I   Perhaps this is not right? (In my preamble)  \crefname{thm}{theorem}{theorem's} \crefname{lemma}{lemma}{lemma's} I am not sure what caused this error, but here is what the whole error says, and also this is sitting as a notification, and preventing me from updating any software using Update Manager - Please provide some assistance or tell me how to figure out what to do to fix it.  Could not calculate the upgrade  An unresolvable problem occurred while calculating the upgrade.  Please report this bug against the 'update-manager' package and include the following error message: 'E:Error, pkgProblemResolver::Resolve generated breaks, this may be caused by held packages.' Tristate Checkboxes in Java I am Sri-Lankan staying in Bangladesh working in well established company in Bangladesh. I, my wife and two kids applied for Schengen visa from German embassy in Dhaka. I got only sponser letter from my paternal uncle in Germany. We submit all company letter, bank account, school letters, insurance, booking air tickets, etc.  Our visa refused and the reason given "your intention to leave the territory of the member states before the expiry of the visa could not be ascertained" so I want to know what it mean. And how I apply again fix by this reason? Our annual vacation starts on 15 July for one month. I applied visa for 15 days. We plan to stay 15 days in Germany and travel to Sri Lanka and back to Bangladesh. Let $a$ and $b$ be two integers such that $\left(a,b\right) = 1$. Prove that $\left(a+b, ab\right) = 1$.   $(a,b)=1$ means $a$ and $b$ have no prime factors in common  $ab$ is simply the product of factors of $a$ and factors of $b$.  Let's say $k\mid a+b$ where $k$ is some factor of $a$.  Then $ka=a+b$ and $ka-a=b$ and $a(k-l)=b$.  So $a(k-l)=b, \  a\mid a(k-1)$ [$a$ divides the left hand side] therefore $a\mid b$ [the right hand side].  But $(a,b)=1$ so $a$ cannot divide $b$.  We have a similar argument for $b$.  So $a+b$ is not divisible by any factors of $ab$.  Therefore, $(a+b, ab)=1$.  Would this be correct? Am I missing anything? Given two date ranges, what is the simplest or most efficient way to determine whether the two date ranges overlap?  As an example, suppose we have ranges denoted by DateTime variables StartDate1 to EndDate1 and StartDate2 to EndDate2. How do i install drush for a drupal site which is on shared hosting? I am new to compact sets, and I had some hard time trying to solve this:  Let $X$ be an infinite set; $T$ the discrete topology on $X$ .Prove that $(X,T)$ is not compact.  I know that I may consider the open cover $\{\{x\},x \in X\}$ and prove that it doesn't have a finite subcover,but I don't know how to write it exactly.  Moreover, I seriously can't understant why $X$ itself cannot be considered as a finite subcover?  Any help is appreciated.