Hi i am newbie to Drupal, i want to search particular content type only, if any modules or ideas pleases share with some examples please.   Current search module searching whole website and returned results, but i want search option for particular content type only.  Kindly help me.


So I recently purchased Substance Designer and developed a granite material for a blender scene. (Below)   So it's all fine, nothing wrong with the program, but how do I export it? I'm not expecting it to be native to the program, but I couldn't find a single addon for Blender to import a .sbar file. All I could find is how to export substance painter stuff.  So do any of you know how to do it without more paid software?


Proof that if $\mathrm{tr}\,A^k=0$ for all $k=1,\ldots, n$, then $A^n = 0$

Statement. Suppose we have a square matrix $A$ of order $n$ over a field $\mathbb{F}$ of characteristics $0$ or $p>n$. There is a theorem that if $\mathrm{tr}\,A^k=0$ for all $k=1,\ldots, n$, then $A$ is nilpotent and $A^n = 0$. The problem is to prove it.  What I did so far.   Let's consider characteristic polynomial $\chi(x)$ of our matrix $A$. The Newton identities relate $\mathrm{tr}\,A^k$ to the coefficients of $\chi(x)$: $$ s_k = \mathrm{tr}\,A^k $$ Since $\mathrm{tr}\,A^k=0$ for all $k=1,\ldots, n$, then $\chi(x) = x^n$ and (since we a over a field) all roots of $\chi$ are $0$. Therefor the only eigenvalue for $A$ is 0.   Now I have trouble proving first item and going from second to $A^n = 0$, How do I do those things?


Statistical methods for data where only a minimum/maximum value is known

Is there a branch of statistics that deals with data for which exact values are not known, but for each individual, we know either a maximum or minimum bound to the value?  I suspect that my problem stems largely from the fact that I am struggling to articulate it in statistical terms, but hopefully an example will help to clarify:  Say there are two connected populations $A$ and $B$ such that, at some point, members of $A$ may "transition" into $B$, but the reverse is not possible. The timing of the transition is variable, but non-random. For example, $A$ could be "individuals without offspring" and $B$ "individuals with at least one offspring". I am interested in the age this progression occurs but I only have cross-sectional data. For any given individual, I can find out if they belong to $A$ or $B$. I also know the age of these individuals. For each individual in population $A$, I know that the age at transition will be GREATER THAN their current age. Likewise, for members of $B$, I know that the age at transition was LESS THAN their current age. But I don't know the exact values.  Say I have some other factor that I want to compare with the age of transition. For example, I want to know whether an individual's subspecies or body size affects the age of first offspring. I definitely have some useful information that should inform those questions: on average, of the individuals in $A$, older individuals will have a later transition. But the information is imperfect, particularly for younger individuals. And vice versa for population $B$.  Are there established methods to deal with this sort of data? I do not necessarily need a full method of how to carry out such an analysis, just some search terms or useful resources to start me off in the right place!  Caveats: I am making the simplifying assumption that transition from $A$ to $B$ is instantaneous. I am also prepared to assume that most individuals will at some point progress to $B$, assuming they live long enough. And I realise that longitutinal data would be very helpful, but assume that it is not available in this case.  Apologies if this is a duplicate, as I said, part of my problem is that I don't know what I should be searching for. For the same reason, please add other tags if appropriate.  Sample dataset: Ssp indicates one of two subspecies, $X$ or $Y$. Offspring indicates either no offspring ($A$) or at least one offspring ($B$)   age ssp offsp   21   Y     A   20   Y     B   26   X     B   33   X     B   33   X     A   24   X     B   34   Y     B   22   Y     B   10   Y     B   20   Y     A   44   X     B   18   Y     A   11   Y     B   27   X     A   31   X     B   14   Y     B   41   X     B   15   Y     A   33   X     B   24   X     B   11   Y     A   28   X     A   22   X     B   16   Y     A   16   Y     B   24   Y     B   20   Y     B   18   X     B   21   Y     B   16   Y     B   24   Y     A   39   X     B   13   Y     A   10   Y     B   18   Y     A   16   Y     A   21   X     A   26   X     B   11   Y     A   40   X     B    8   Y     A   41   X     B   29   X     B   53   X     B   34   X     B   34   X     B   15   Y     A   40   X     B   30   X     A   40   X     B   Edit: example dataset changed as it wasn't very representative


Book recommendations to understand General Relativity

I just finished Multivariate calculus and I am wondering what sequence of books would allow me to work up to the mathematical knowledge needed to understand General Relativity and the corresponding field equations?


How can I call off a Windows 10 upgrade?

I have a machine with Windows 7 that was set to fully automatic Windows Updates (trusting fool that I was).  Tonight I was unpleasantly surprised by a window that came up seemingly out of nowhere, telling me Windows 10 was ready to install, which looked like this:    The only options, as you can see, were "schedule it for later" and "start the upgrade now" — not even a close button in the corner.  I considered killing the process behind it, but checking Windows Update revealed that it was merely waiting for me to reboot to plow forward, come hell or high water.  I chose "schedule it for later", thinking I'd just set it for sometime next century, but the only date choices were today, tomorrow, and the next day.  Three choices exactly.  So I picked the last possible date and time.  So.  Now the race is on.  How do I abort this unwelcome mess they're trying to shove down my throat before they do it anyway?  Bonus question:  people around the web point out that this thing downloaded gigs of stuff silently, in the background, without asking, in preparation for this attack.  Can I recover that disk space as well (if not my data usage nor my trust)?    Update:  Later that night, I found the C:\$windows.~BT folder as directed, and wiped it out (having to struggle with permissions in order to do so, I might add).  I wondered if that might be the end of it.  Lo and behold, out of nowhere:    The process of this window is C:\Windows\System32\wuauclt.exe — Windows Update.  The folder I wiped out is still gone, though.  And as before, I'm only allowed to put it off by two more days:    It sprung up, counting down from one hour.  If I leave my machine running and miss that one hour window, I'm screwed.  Apparently I just have to keep averting disaster every couple of days for the rest of eternity.  Thanks, Microsoft.  Can anyone tell me how to kill this zombie permanently??  Update 2:  It looks like Windows Update is no longer capable of receiving updates, since the Windows 10 upgrade is pending:    Update 3:  I made the registry changes suggested in the other question as well.  The appointed time came Sunday, and the machine indeed rebooted itself unasked, and there's something in the log about a failed upgrade-to-Windows-10 attempt, but I seem to have averted disaster.  For now…


How to emulate a Number Pad and 3 Button Mouse?

I have a MacBook Pro. Since it's a laptop, it does not have a number pad. It only has the numbers at the top of the keyboard. Can I emulate the number pad so that I can access the hot keys for top view, bottom view, etc...  Also, how can I emulate a 3 button mouse with just my touch pad or a two button mouse?


Selecting Binary Classification Probability Threshold

I have a binary classification problem I have modeled and I'm trying to determine the best way to select my probability threshold. Here was my modeling approach: Create a training and testing set.  My data comes in chronologically so I select data received in say Nov, Dec as my training set and Jan as my holdout (test) set. I train the models using 5 fold cross validation and the metric I'm using is area under the precision recall curve.  Based on my performance with the training set / cross validation, I then train the best model on the full training set (Nov, Dec) and predict on the hold out set (Jan). Now I want to see the confusion matrix in the hold out set (Jan).  My 'optimal' point selection on the Precision Recall Curve plotted on the hold out set (Jan) is where the F1 Score is optimized.  So I select that point and look at my confusion matrix. Now I want to use my final model.  Here are my questions:  February data comes in.  Do I have a 'gap' in that the final model I trained on Nov, Dec data  which I tested on holdout Jan that I now use to predict classes with February data?  or do I somehow incorporate Jan data (so I have Nov,Dec,Jan model) but no validation set to test on since now my model abuts February (which I want to predict)?  Assuming I use the Nov,Dec final model as the model to predict Feb, can I use the max F1 score threshold I calculated on the hold out set (Jan) when making February class predictions?   Thanks in advance.


Confusing title, right?  You can flag a question as a duplicate here.    Now, click on "it should be closed for another reason".    Why is there a duplicate duplicate button?


drawing a perpendicular from a side of a triangle to one of its vertexes

Using tikz. I have an isosceles triangle ABC. BC forms the basis with the distances AC = AB. The two base angles are of the same size.  \begin{tikzpicture};     \draw[thick] (0,0) coordinate (B) -- (65:8cm) coordinate (A) -- ++(65+50:-8cm) coordinate (C) -- cycle;  \tkzLabelPoint[above](A){$A$} \tkzLabelPoint[left](B){$B$} \tkzLabelPoint[right](C){$C$}  \draw[thick] (B) -- (20:6.2cm) coordinate (D); \tkzLabelPoint[right](D){$D$};   \tkzMarkAngle[size=0.8cm,color=red](B,D,C);  \tkzLabelAngle[pos = 0.5, font=\scriptsize](B,D,C){$90^{\circ}$};  \end{tikzpicture}   How do I calculate the Perpendicular from AC to B? I want that the 90° label is true and I need the coordinates where the Perpendicular meets AC.


How are trophies in Clash of Clans calculated?

I've practically browsed the whole Internet, but didn't find any particular formula for calculating the trophy outcomes in a PvP game such as Clash of Clans. This is what I figured out so far:   At some point I thought that the sum of points was always 48, and that it is separated between the winner and the loser, weighted in favor of the one with fewer points. This turned out to be not true, because I myself have been in battles where winning I got like 13 trophies and losing I got 14 (total 27). I thought it is some kind of an ELO rating system, but couldn't confirm it actually is, not just because there is no negative trophy count in CoC, but also because in small differences in rank you could actually gain a lot of trophies (like 30) when winning. As far as I know you're matched against opponents with a rank that is ranged within ~230 trophies compared to your rank Ps: I'm not talking about clan trophies, but the trophies of a single person in normal multiplayer.   I'd like to ask that if anyone more familiar with the subject brang more light into this, preferably a Supercell employee. ;)


Let $G = \langle a\rangle$ a cyclic group of order m. Prove that G is isomorphic with $Z_m$.

Let $f$: $Z_m \rightarrow G$, $f(n)$ = $a^n$. Show that f is a function and an homomorphism.  Doing a review on the whole semester, and a little refresh on this topic would be great.   By definition I know $G$ has the same order of $Z_m$, but not sure how to attack this problem with ease.   I also know that cyclic groups of the same order are isomorphic.   (I cannot use the fact that cyclic groups of the same order are isomorphic, that's why I ask for another approach, because I can't use theorems or lemmas that have not been discussed in class.)


How I can write Database query that shows two words in one stroke?

I have a database    books   id title summary  year  genres   id name  author    id name  books_genres   id_book id_genre  books_author   id_book id_author    i need request that can present 2 or more genres or author in one stroke  Title: lol Summary: lorem Genres: Novell, BDSM Authors: Uncle John, Aunt Dad.  i wrote something like this, but it show two dublicated strokes with different genres  SELECT      books.title, genres.name  FROM      books, books_genres, genres  WHERE books.id = books_genres.id_book AND genres.id = books_genres.id_genre


I am trying to prove  $$\sum_{n\geq1}\frac1{n^2+1}=\frac{\pi\coth\pi-1}2$$ Letting $$S=\sum_{n\geq1}\frac1{n^2+1}$$ we recall the Fourier series for the exponential function $$e^x=\frac{\sinh\pi}\pi+\frac{2\sinh\pi}\pi\sum_{n\geq1}\frac{(-1)^n}{n^2+1}(\cos nx-n\sin nx)$$ Plugging in $x=\pi$ $$e^\pi=\frac{\sinh\pi}\pi+\frac{2\sinh\pi}\pi\sum_{n\geq1}\frac{(-1)^n}{n^2+1}(\cos n\pi-n\sin n\pi)$$ $$e^\pi=\frac{\sinh\pi}\pi+\frac{2\sinh\pi}\pi\sum_{n\geq1}\frac{(-1)^n}{n^2+1}((-1)^n-n\cdot0)$$ $$e^\pi=\frac{\sinh\pi}\pi+\frac{2\sinh\pi}\pi S$$ $$S=\frac{\pi e^\pi}{2\sinh\pi}-\frac12$$ But that is nowhere near to correct. What did I do wrong, and how do can I prove the identity? Thanks.


Flagging VLQ after opening the post in Low Quality queue but prior to recommending deletion

Tagging as  as recommended by Shog   Currently, flagging post as very low quality is designed to work :     If more than one VLQ flag accumulates on the post before the review has ended, a number of "Looks Good" responses equivalent to the number of flags is required to dequeue it...         Review items completed by deletion or closing result in a "helpful" status for the flag   Review items completed by "Looks Good" responses result in a "disputed" status for the flag      As a result, reviewer working in the LQ queue can do as follows:   Open the queue item Open the reviewed post in a separate browser tab Flag VLQ outside of the queue Vote "Recommend Deletion" from the queue   Above opens a way to low-risk increase for the count of helpful flags.  Should something be done about this?   Testing for above using  went as follows: after submitting Recommend Deletion and getting Looks Good from next reviewer, flag has been resolved as  and post has been taken off review queue.     Side note. If this is confirmed as a bug, a fix that naturally comes to mind would be to block review completion if flag is discovered at the moment of submitting "Recommend Deletion". Per my recollection, this would be similar to how things work in CV queue - voting to close from outside of the queue while item is still opened blocks "Close" action (reviewer can only Skip and maybe Leave Open).


How do you prove that $\sum\limits_{n=0}^{\infty}{2n \choose n}x^n=(1-4x)^{-1/2}$? I tried to identify the sum as a binomial series, but the $4$ and the $-1/2$ puzzle me. (This series arises in studying the first passage time of a simple random walk.)


Limit distribution of $\frac1n\cdot \max(X_1,X_2,...,X_n)$ for $(X_n)$ i.i.d. standard Cauchy

Let $X_1, X_2,\ldots $ be independent, Cauchy $C(0,1)-$distributed random variables. Determine the limit distribution of   $$Y_n=\frac 1 {n} \cdot \max{(X_1,X_2,\dots,X_n)}$$   as $n \rightarrow \infty$.    Remark. It may be helpful to know that    $\arctan x + \arctan \frac 1 {x} = \frac \pi 2$ and that  $\arctan y = y - \frac {y^3} 3 + \frac {y^5} 5 - \frac {y^7} 7 + \dots$   I not sure how to attack this question, nor how I should handle the $\max{(X_1,X_2,\ldots,X_n)}$ in order to find the limit distribution. Any advice appreciated.


Prove that the function$\ f(x)=\sin(x^2)$ is not uniformly continuous on the domain $\mathbb{R}$.

If I want to prove that the function$\ f(x)=\sin(x^2)$ is not uniformly continuous on the domain $\mathbb{R}$, I need to show that: $\exists\varepsilon>0$ $\forall\delta>0$  $\exists{x,y}\in\mathbb{R}\ : |x-y|<\delta$ and $|\sin(x^2) - \sin(y^2)|\geq\varepsilon$. So let's take $\varepsilon = 1$. Then I want $|\sin(x^2)-\sin(y^2)|\ge1$. That's the case if $\sin(x^2)=0$ and $\sin(y^2)=\pm1$. Thus $x^2=n\pi$ and $y^2=n\pi + \frac{1}{2}\pi$. Now I'm stuck on expressing x and y, which I want to express in $\delta$, to ensure that $|x-y|<\delta$. Thanks in advance for any help.


Update Manager doesn't ask for a password

Oneiric update manager no longer asks for a password to update already installed software.  This is a change in behavior from previous versions.  Is there a way to revert this behavior and get the Update Manager in Oneiric to ask for a password again?  Thanks!


When should we write the word "church" with a capital C?

When should we write the word "church" with a capital C, Church, and when should we only write it as church?


"What if" math joke: the derivative of $\ln(x)^e$

Randall Munroe, the creator of  in his latest book  writes (p. 175) that the mathematical analog of the phrase "knock me over with a feather" is seeing the expression $ \ln( x )^{e}$. And he writes regarding this expression: "it's not that, taken literally, it doesn't make sense - it's that you can't imagine a situation where this would apply."  In the footer (same page) he also states that "if you want to be mean to first year calculus students, you can ask them to take the derivative of $ \ln( x )^{e}$. It looks like it should be "$1$" or something but it's not."  I don't get the joke. I think I am not understanding something correctly and I'm not appreciating the irony. Any help?


How to tell if a ceiling junction box is braced to hold the weight of a ceiling fan?

My new home is almost done being built, and one of the extras I asked for was for two of the rooms to have junction boxes in the ceiling suitable for hanging a ceiling fan in the future.  The light fixtures haven't been installed yet so I can see inside the junction boxes but can't really distinguish between the braced boxes and the regular boxes.  The attic is extremely limited access so I want to avoid crawling around up there to look for a brace.  Is there a quick or easy way to distinguish between a junction box that is able to carry the weight of a ceiling fan safely versus one that is not?  I could just take their word for it but they haven't had a very reliable track record so far when it comes to following through with my requests even when they tell me they will do it.


Hidden files won't stay hidden in Ubuntu 14.04 LTS

Whenever I open my files, my hidden files show up. I can hide them but when I open up my files again, they're showing again. How do I make the hidden files invisible permanently?


How to convert an object with border as object to an object with border as border?

This file seems to be just an object with large border:  However the border is actually an object with its own border:  How can I convert it to a regular path? I've tried Object to Path but it doesn't work.  Here is the file:  My purpose is to fill the bubble with other objects (images, not texts).


On a VGA connector, there are numerous 'ground' pins. Three of these are Red return, Green return and Blue return; But why does each color component have its own ground pin?


Ipad Air iOS 8.4 Restrictions passcode forgotten

How do i recover/reset/remove restictions passcode on iOS 8.4 ? I have already tried : SBParentalControlsFailedAttempts X SBParentalControlsPIN 1234.  No result obtained . Please advise. Thanks in advance.


I used to think we should say "keep your hands off the wall", but one of the lines in Money, from Pink Floyd, they say "keep your hands off of my stash". That made me confuse.   Do we always say keep your hands off of  something? How does it work for "keep your hands off (of) the wall"?   Thank you


What happens with Lifelink when a creature's power exceeds its blocker's toughness?

Lifelink typically says:     Lifelink (Damage dealt by this creature also causes you to gain that much life.)   Suppose I attack with a 5/5 creature which has Lifelink, and it's blocked by a 1/1 creature.  Do I gain 1 life or 5?


Find a two-term expansion for the root of 1+\sqrt(x^2+\epsilon)=e^x.

I am trying to find a two term expansion for the root of $$1+\sqrt{(x^2+\epsilon)}=e^x$$. Since $$\epsilon << 1$$, I can tell that this equation behaves like $$1+x=e^x$$ which has a root close to zero. That gave me the idea that the root might look like $$x \approx x_0 + \epsilon^{\alpha} x_1 + \dots  $$. I used Taylor expansion for both functions $\sqrt{(x^2+\epsilon)}$ and $e^x$ and then plugged my guess into the Taylor expanded equation and balance of O(1) terms gave me $$x_0=0$$ as expected. My problem begins now. For the higher orders of $\epsilon$. Long story short this expansion ends up with some inconsistencies. So I thought maybe $x \approx x_0+\mu(\epsilon)$. But then again I get nowhere. I am getting frustrated and I would really appreciate some help.  Thank you in advance.


Convergence of integrals implies convergence in $L^1$

I have this problem which is exactly the opposite of what I would find easy to prove! Consider a sequence of Lebesgue measurable non-negative functions $(f_n)$ such that $f_n\rightarrow f$ pointwise for some $f\in L^1$, and also that $\int_{\mathbb{R}}f_n\rightarrow \int_{\mathbb{R}}f$. Prove $||f_n-f||_1 \rightarrow 0$.  This is actually giving me a hard time because it goes against my intuition. How does pointwise convergence and integral convergence imply convergence in $L^1$? Why? How?  Any help would be appreciated... Thanks.


How to perform hard / cold reboot of iPhone or iPad?

I understand that when I press and release the power button on the top of my iPhone or iPad, it stays on but turns off the screen.  Whereas if I press and hold the power button, a "slide to turn off" control appears on the screen.  Sliding this, as I was told, does turn the unit off, but it does so by suspending the RAM to disk (flash memory, actually.) So, when turning on the iPhone or iPad, it isn't so much rebooting the OS as it is resuming it from flash storage.  How to force the OS to completely reboot on these devices?


Let $G$ be a group. Define a relation $\sim$ on $G$ by $a\sim b$ if there exists $g\in G$ such that $a=gbg^{-1}$. Prove that all elements of order $15$ in $S_8$ are related by $\sim$.   I noticed that in order to have order 15 in S8, we need to have a product of 3 cycle and 5 cycle. Then, I am stuck... What should I do?  Thank you in advance.


distribution upgrade 14.04 to 15.04 halted due to multiple errors

During distribution upgrade 14.04 to 15.04, process halts due to many dpkg errors, here are a few of them.  dpkg: too many errors, stopping Errors were encountered while processing:  udev  gnome-bluetooth  systemd  ubuntu-minimal  bluez  indicator-bluetooth  python3-checkbox-support  python3-checkbox-ng  pulseaudio  plainbox-provider-checkbox  mountall  unity-control-center  alsa-base  libcanberra-pulse:amd64  pulseaudio-module-x11  libsolid4  initramfs-tools  udisks2  plainbox-provider-resource-generic  upower  media-player-info  unity-control-center-signon  plymouth  indicator-power  network-manager  ubuntu-drivers-common  kdelibs5-plugins  gnome-user-share  pulseaudio-module-bluetooth  software-properties-gtk  indicator-sound  indicator-network  rhythmbox  ubuntu-desktop  gnome-disk-utility  lightdm  upstart  libconnectivity-qt1:amd64  gnome-session-bin  brltty  linux-image-4.2.0-36-generic  ubuntu-system-settings  dolphin4  unity-greeter  linux-image-generic  checkbox-ng  checkbox-ng-service  libkio5  konqueror  checkbox-gui  gnome-power-manager Processing was halted because there were too many errors.


Should + present infinitive or may + present infinitive? In case of expressing possibilities

Tom should know the address. Tom may know the address. In case of expressing possibilities can should and may be interchangeably used? or  Is there any striking difference between them?


Vector menu tools missing (processing plugin broken)

All of a sudden my vector menu tools are missing. I know this is a common bug but all the instructions on how to fix it didn't work for me.  I checked if the processing plugin is installed but QGIS tells me this plugin is broken.  I tried uninstalling it and deleted the .qgis2 folder but even after reinstalling nothing changed.  I'm using QGIS version 2.18.2 on macOS Sierra.


Instantiate a generic class with reflections

I try to create something like an object mapper. For this, I need to instantiate classes at runtime. This is quite easy with 'normal' classes, however, I also have generic classes like Terminal which I need to instantiate at runtime:  public class Terminal<T extends ConductingEquipment> extends ACDCTerminal {   private T conductingEquipment;   ... }   When I read the document, which I try to map to an object, I know the class/type for T. I try to achieve at runtime something like the following where ACLineSegment is just an example and could be one of 38 classes (in the moment):  Terminal<ACLineSegment> terminal = new Terminal<>(); terminal.setConductingEquipment(new ACLineSegment());   Is it possible to do something similar with reflections without knowing that T should be ACLineSegment in beforehand? At the moment I only can instantiate the Terminal without the Type Parameter:  terminalClass.newInstance();   UPDATE: To specify the difference between my post and : Is it possible to instantiate a generic class with reflections without previously implementing all possible classes. (And how.)


How can I have my own Stack Exchange site?

Is it possible for me to make a Q&A site like Stack Overflow for a different topic? How much money will it cost?  I have my own VPS; can I host the site there?


Showing that $\lim\limits_{x \rightarrow 0} \frac{1}{x}$ does not exist.

Forgive me if this has been asked before, but I searched and could not find an answer.  I am trying to show that $\lim\limits_{x \rightarrow 0} \frac{1}{x}$ does not exist. If the limit did exist, and was equal to $l$, then for every $\varepsilon > 0$ there would exist some $\delta > 0$ such that for all $x$,  $$0 < |x| < \delta \implies \left| \frac{1}{x} - l \right| < \varepsilon$$  If the limit doesn't exist, then for every number $l$, there exists some $\varepsilon > 0$ such that for all $\delta > 0$,  $$0 < |x| < \delta \implies \left| \frac{1}{x} - l \right| \geq \varepsilon$$  So, in my efforts to find some unattainable $\varepsilon$, I have found that  \begin{align} \varepsilon &\leq \left| \frac{1}{x} - l \right| \\\ &= \left| \frac{1}{x} - \frac{lx}{x} \right| \\\ &= \left| \frac{1-lx}{x} \right| \\\ &= \frac{|1-lx|}{|x|} \\\ &\implies \varepsilon |x| \leq |1 - lx| = |1 + (-lx)| \leq |1| + |-lx| \\\ &\implies 1 \geq \varepsilon |x| - |l| |x| = (\varepsilon - |l|) |x| \\\ &\implies |x| \leq \frac{1}{\varepsilon - |l|} \end{align}  So I have found that if $|x| < \frac{1}{\varepsilon - |l|}$, then $\left| \frac{1}{x} - l \right| \geq \varepsilon$, for any $\varepsilon$. But, I need this to be true for any choice of $\delta$, for some specific $\varepsilon$.  Intuitively, I can think "as $\varepsilon$ gets closer to $|l|$, then the quotient becomes larger, meaning that $|x| < \frac{1}{\varepsilon - |l|}$ is satisfied for more choices of $\delta$", but I don't know how to formalize this. Any ideas for a next step? Am I completely off base with my reasoning?


How to combine 2 lists into 1 dictionary using a function

These are the 2 lists I am trying to use: names = ['joe', 'tom', 'barb', 'sue', 'sally'] scores = [10, 23, 13, 18, 12]  and I'm using a function I created named makeDictionary with the parameters (list1, list2). I do not want a direct answer in code, but how would I make the names list the keys in the dictionary, and the scores list the values in the dictionary? Example output dictionary: {'joe': 10, 'tom': 23, 'barb': 13, 'sue': 18, 'sally': 12}


Detecting a range of items in an inventory

I'm making a datapack, and I've been meaning to find out for a long time on how to test for a range of numbers of counts of items in a players inventory, not an exact amount. What I'm trying to do is detect, in this case, if a player has 5 or more golden nuggets in their inventory, i've tried using many things, like using the .. after the number, and even trying to use min and max among other things...


Number of genitive object in a nominal compound

Which of the following options is better? Do the two choices reflect any difference in meaning?  "Matters regarding comments deletion"  or  "Matters regarding comment deletion"  --Assuming the intended meaning is "Matters regarding [deletion of comments]"?    Running list of related and duplicate questions:


Un-downvote due to deletion does not calculate in your reputation changed

The green banner next to my reputation counter showed I gained 39 reputation since I last visited the reputation tab. When I look at the reputation events this is not true, I gained 40 reputation. The culprit is easily deductable in this instance, the "removed" downvote is not calculated correctly into the total.


Prove that $(\frac{bc+ac+ab}{a+b+c})^{a+b+c} \geq \sqrt{(bc)^a(ac)^b(ab)^c}$

Prove that $$\left( \frac{bc+ac+ab}{a+b+c} \right)^{a+b+c} \ge \sqrt{(bc)^a(ac)^b(ab)^c}$$   where $a,b,c>0$   My attempt:    I couldn't proceed after that.  Please help me in this regard, thanks!


Evaluating $\sum_{n \geq 0} \frac{x^{8n}}{(8n)!}$

$$\sum_{n \geq 0} \frac{x^{8n}}{(8n)!}$$   Here's my try:  $$\sum_{n \geq 0, \text{even}} \frac{x^{4n}}{(4n)!}$$  $$=\sum_{n \geq 0} \frac{(-1)^n+1^n}{2} \frac{x^{4n}}{(4n)!}$$  By convergence I can split the sums.  $$=\frac{1}{2} \sum_{n \geq 0} \frac{x^{4n}}{(4n)!}+\frac{1}{2} \sum_{n \geq 0} (-1)^n \frac{x^{4n}}{(4n)!}$$  Now consider,  $$\sum_{n \geq 0} \frac{x^{4n}}{(4n)!}$$  $$=\sum_{n \geq 0, \text{even}} \frac{x^{2n}}{(2n)!}$$  $$=\sum_{n \geq 0} \frac{(-1)^n+1^n}{2} \frac{x^{2n}}{(2n)!}$$  $$=\frac{1}{2} \left( \cos(x)+\cosh (x) \right)$$  Now if I find,     $$\sum_{n \geq 0} (-1)^n \frac{x^{4n}}{(4n)!}$$   I'll be done with the problem. How do I do that?     Bonus question:   Compute  $$\sum_{n \geq 0} \frac{x^{3n}}{(3n)!}$$  For this one I'm out of ideas.


Should column labels for numbers be aligned right?

In a grid structure, I understand you should right-align numbers in the cells.  Should you also right-align the headers for these columns?


I've been trying to play the Dragonborn DLC for Skyrim on the PS3. In order to advance the story, I need to talk to Frea and her dad. But every time I go near the village they try and murder me for slaughtering the village back when I was like level 15 (I'm level 43 now).  I've tried yielding but they won't accept it and I don't know how to make them stop, all I want to do is finish the story. Does anybody know how to fix this issue?


I'm writing something and there are several places where I need to use multiple adjectives.  I've always learnt that multiple adjectives should always be separated by a comma, but my supervisor said that they should only be separated by a comma if they are different.  So whereas I would say:     We present a novel, industry-inspired problem [...]   He argues it should be:     We present a novel industry-inspired problem [...]   What is the complete rule regarding multiple adjectives and commas? Thank you.


I am trying to have sections of my algorithm highlighted like the figure below. I am using algorithm2e on sharedlatex. Is there a simple solution ?


Find all values of a for which $\{v_1,v_2,v_3\}$ form a basis for ${\bf R}^3$

Question is: Find all values of a for which $S=\{v_1,v_2,v_3\}$  form a basis for ${\bf R}^3$, where $v_1=(a^2,0,1)$, $v_2=(0,a,2)$, and $v_3=(1,0,1)$.  My thoughts: I put it into a matrix to help visualize:  $$ S=\begin{bmatrix} a^2 &0 &1\\  0& a &0\\  1 &2 &1 \end{bmatrix}. $$  Well, I can see right away that if $a=\pm1$ then we have 2 equal vectors $\implies$ linearly dependent. I also see that if $a=0$ we have a row of zeros $\implies$ Not spanning ${\bf R}^3$. So, I know that a cannot equal $-1$, 0, or 1  My problems: 1. I'm not sure how to show that any other value will form a basis. 2. I don't know what how would I solve similar questions like this, where it's not as obvious.  Thank you!


I accidentally removed myself from sudoers, how can I fix this?

I have one admin account and recently I have accidentally added myself to a single group (usermod -G without -a).   So, I am not in the sudoers file any more. However, it is not possible to log in to root by default on Ubuntu. Do I  the password for root during the boot process?


Looking for a textbook on electromagnetism

I am looking for a free physics textbook on electromagnetism that wouldn't throw at me things to remember rather I'd love to have something which builds notions block by block, deriving coulomb's law instead of just presenting it as is for example.


Does being forced to make a Saving Throw count as a "Hit" for the purpose of Assassinate?

Let's say we have a multiclass Rogue (Assassin) + Sorcerer named Adam. Adam manages to attack a Surprised Target, and chooses to cast Fireball instead of making a Ranged Attack.  Assassinate is worded as the Following:     Assassinate:    Starting at 3rd level, you are at your deadliest when you get the drop on your enemies. You have advantage on attack rolls against any creature that hasn’t taken a turn in the combat yet. In addition, any hit you score against a creature that is surprised is a critical hit.   A Spell that forces a Saving Throw is obviously not an Attack, so you wouldn't get "Advantage" on it (since you as the Assassin aren't rolling). However, Assassinate doesn't explicitly state that it relies on an attack; all it says is that hits on a Surprised Target are Critical Hits.  When someone is forced to make a Saving Throw against a spell like Fireball, is that considered a "Hit" for the purpose of being doubled?  Using common definitions, it would be, since a Hit is, according to Merriam Webster:     Hit: to strike or be struck by (someone or something) forcefully   In this case, the enemy would be "struck" by the Fireball.  Or is there RAW that states that only Attacks can "Hit", or redefines the term "Hit" so that common definitions do not apply?


What's the best RAID array for fault tolerance

When setting up a server, I was told it needs to have really good fault tolerance. What RAID array would give me the best fault tolerance?


I ordered 13.04 on eBay, but when I installed it the application launcher was missing. I could only open applications from the terminal. I installed CCSM, but it didn't make any difference.


Updating list inside of a list affects other sublists as well, can someone explain this behaviour?

I am trying to create a list of lists, and want to update only a particular sublist by indexing, but when i try to do it via the following approach, all other sublist's also get updated.  times=[0]*4 shows_times=[] for i in range(4):     shows_times.append(times)  shows_times[0][0]+=1 shows_times[0][1]+=1 shows_times[0][2]+=1 print(shows_times)   Output:  [[1, 1, 1, 0], [1, 1, 1, 0], [1, 1, 1, 0], [1, 1, 1, 0]]   But when i use the following code, i get the desired output.  shows_times=[] for i in range(4):     shows_times.append([0,0,0,0])  shows_times[0][0]+=1 shows_times[0][1]+=1 shows_times[0][2]+=1 print(shows_times)   Output:  [[1, 1, 1, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]   Please explain me why this behavior happens, has this anything to do with pass by value or pass by reference or something like that?


The sum of the fourth powers of the first $n$ positive integers

I am studying mathematical induction and most of the times I have to prove something. Like, for example:  $1 + 4 + 9 + ...+ n^2 = \frac{n(n+1)(2n+1)}{6}$  This time I found a question that ask me to find a formula for   $1 + 16 + 81 + .... + n^4$  How can I do this with induction? And is there really a formula for this sum?


Do gravitational waves lose energy through interaction with i.e. matter or magnetic fields?

Gravitational waves dilute while traversing space like any other radiation, and their amplitudes are proportional to r-2, that's a basic. But do they lose energy while traversing through matter or something else (i.e. space with magnetic fields, or whatever), too, by interaction with it ?  (The question "Where does gravitational waves' energy go?" doesn't focus on traversing matter of fields)


Why do we age? or Do we have a theory of senescence?

There seem to be a number of ideas about why we age. Hypotheses include the gradual accumulation of cell metabolic products affecting organism function and the reduction of  during cell division. My hand-wavey idea would be "wear and tear".  Are we anywhere near a consensus theory of senescence?


How can I have colored and underlined links with hyperref?

I would like the internal hyperlinks generated by  to be colored and underlined.    Reading some of the package documentation, I know that these \hypersetup keys exist:   colorlinks: when true, color the link; when false, draw a border around the link and color that. linkcolor: the color of the link (requires colorlinks=true to have any effect) linkbordercolor: the color of the link border color (requires colorlinks=false to have any effect) pdfborderstyle: keys for the pdf borderstyle dictionary.  I don't know what keys and values exist for this dictionary, but I do know that pdfborderstyle={/S/U} or pdfborderstyle={/S/U/W 1} can change the link border from a box to an underline.   But it seems impossible with this key structure to have colored links (requiring colorlinks=true and colored borders (requiring colorlinks=false.)  Here is a minimal (non)-working example ():  \documentclass{article} \usepackage{xcolor} \usepackage{hyperref}  \hypersetup{colorlinks=false,linkbordercolor=red,linkcolor=green,pdfborderstyle={/S/U/W 1}}  \begin{document} \section{To See}\label{tosee} \vskip2cm \hyperref[tosee]{just to see} \end{document}   With colorlinks=false (the default), the text is black and the border is red.  With colorlinks=true the text is green and there is no border.


I'm sure we're all aware now that when we see a greyed-out button, it either means that 1) we cannot click it, or 2) its current state is off - or false.  In my application, I have a square, which acts as a button, next to a list item. This button, when clicked, will either mark the selected item as Important or Not Important. When you hover over this "button", a tooltip appears.  My question is, what should the tooltip say?  If the button is greyed out, should it say "Important" or "Not Important"?  A grey button indicates a not important item, while a blue one indicates important.


Proving that $U(n)$ is a smooth manifold

In order to prove that  $U(n, \mathbb C) := \{A \in M_n(\mathbb C): A^*A = I\}$ is a smooth manifold we can define a function $ F : M_n(\mathbb C) \to H_n(\mathbb C)$ where $F(A)=A^{\dagger}A$ and prove that it is the preimage of a regular value, the identity. In order to be a regular value we must prove that the differential of this function is surjective. I've already seen this post:  but how do we prove that the differential of this function is surjective. EDIT: When I try to compute the differential, given the definition: $$ F(A+V) = F(A)+d_AF+Q_A(V)$$ ignoring the quadratic term, and plugging in the definition of our function $F$ I arrive at: $$ d_AF(V)=F(A+V)-F(V)$$ $$ d_AF(V)= (A+V)^{\dagger}(A+V)-V^{\dagger}V$$ $$ d_AF(V)= (A)^{\dagger}A + (A)^{\dagger}V + (V)^{\dagger}A$$ what happens to the first term, in order for the differential to be the same as the one stated in the post?


Find the limit:   $$\lim_{x\to 0} \frac{1}{x} \int_{0}^{x} (1+ \sin(t))^{1/t} dt.$$   A hint that has been given is to use L'Hospital's Rule. Moreover, it must be substantiated why we can use L'Hospital' Rule in this situation. It is also important to mention that $(1 + \sin(t))$ has a removable point of discontinuity at $0$ and therefore the integral can be interpreted as a Riemann integral.


Is it bad practice to have a function that doesn't return if it throws an exception?

I have some computational functions for configurations for software that will drive a hardware setup. In some cases, the user may input invalid configuration values. I handle this by throwing an exception if invalid values are used, or simply returning my calculated value if the configuration works:  def calc_exhale_dur(breath_rate, inh_dur, breath_hold_dur):     """Calculate exhalation duration.      Args:         breath_rate (float): animal breath rate (br/min)         inh_dur (float): animal inhalation duration (ms)         breath_hold_duration (float): animal breath hold duration (ms)     """      single_breath_dur = calc_breath_dur(breath_rate)     exhale_dur = single_breath_dur - (inh_dur + breath_hold_dur)      if (inh_dur + breath_hold_dur + exhale_dur) > single_breath_dur:         raise error.ConfigurationError     elif exhale_dur <= 0:         raise error.ConfigurationError     else:         return exhale_dur   Is it considered bad practice to do it this way? Do I always need to have some valid return value if there is a return value to begin with? I'm trying to learn how best to write Pythonic code while still satisfying the needs of my computational methods.


Is there a shorthand for matrices that doesn't use an environment

I understand that environments are very nice where the content is complex.  But for simple cases, the \begin and \end and duplication of the environment name gets quite wordy and dominates the actual content.  Is there a non-environment command to create a matrix, like exists for \frac?  Compare:  \begin{bmatrix}       \chi_2 \\       \chi_3 \end{bmatrix} = \chi_1 + \begin{bmatrix}                              t_2 - t_1 & 0 \\                              t_3 - t_1 & t_3 - t_2                          \end{bmatrix} \begin{bmatrix}                                             \nu_1 \\                                             \nu_2                                        \end{bmatrix}   to a hypothetical  \bcolvec{\chi_2}{\chi_3}        = \chi_1 + \inbmatrix{t_2 - t_1 & 0}{t_3 - t_2 & t_2 - t_1} \bcolvec{\nu_2}{\nu_3}


Use laptop as second monitor for another laptop

Scenario: driving to tampa, have two laptops (win 7 and win xp) and vga to vga cord (the blue one used to connect pc's to their monitor) Screen on win7 laptop is broken to the point of no visibility. I want the win xp laptop to show the win 7 laptop's screen. Is there a program i can download or a setting in the control panel to do this?


Does anyone know of any free tensor manipulation software for use in General relativity? e.g GR tensor (this includes software that needs programs such as mathematica or matlab to use)


Is the series $\sum\limits_n\frac{(-1)^n}{\ln(n)+\cos(n)}$ convergent?

What is the nature of the series $\displaystyle \sum_n \dfrac{(-1)^n}{\ln(n)+\cos(n)}$?   Since the sequence of general term $$\frac{1}{\ln(n)+\cos(n)}$$ does not decrease, the critera for alternated series cannot be applied. In these topics  and  however, we manage to show that its nature is the same as that of $$\sum_n \dfrac{\sin(2n+\frac12)}{(\ln(2n)+\cos(2n)) (\ln(2n+1)+cos(2n+1))}$$ but what next? An asymptotic expansion does not fit either.


I visited the USA in May this year, on an ESTA which I applied for in April. It was approved and I was allowed entry into the country.    I'm re-visiting again this November for two weeks. Am I able to use the same ESTA again or do I need to re-apply for a new one? I know it says it's valid for two years, but is that valid for every use within those two years, or I have to use it within two years, and once I have visited on that visa, it's invalid?


how to slice bytes object when i try to slice it give me int number?

I am trying to get live tick from google finance site using  urllib,request but  it returns a lot of data but I want to select the only price so how do I select that without using loops **I want that thing from HTML ["INFY","Infosys Ltd","894.70","-0.90","chr"]  import urllib.request response = urllib.request.urlopen('https://www.google.com/finance?q=NSE:INFY') html = response.read()


I know that there are formulas for the first n squares,cubes,..., but is there a formula for the first n powers of a single non-integer?  For example,  $$\sum_{i=0}^{n}1.1^i$$  Does a formulas to compute this sum exist or do i have to manually go in and find each power?


From Euler's identity $e^{i\pi} = -1$ ⇒ $e^{2\pi i} = 1$ ⇒ $[e^{2\pi}]^i = 1$ ⇒ $i = \log_ {e^{2 π }}1$ ⇒ $i = 0$ But how is this possible? Please help me in finding that where i am going wrong.


Bonus Reputations for starters, new users

Starters on Stack Overflow tend to lose interest as soon as their first question starts getting downvotes. Their first question also sometimes gets closed because it was either not framed properly or it missed some very common things.  There should be way to cope with this for instance give some starter bonuses to new users.


When refering to 2 people, do you use "have" or "has"?

Example -      If you or Theresa has time, let me know.   If you or Theresa have time, let me know.    Which one is correct?


Proof that $x^2-y^3=1$ has only one solution in the domain of $N^+$?

How can I prove that $x^2-y^3=1$ has only one solution in the domain of $N^+$? Namely $x=3, y=2$. My try: $x^2-1=y^3  => (x-1)(x+1)-1=y^3$. $gcd(x-1,x+1)$ is 2 if $x$ is odd and $1$ if $x$ is even.  In the case x-even the only possible solution would be if $x=1$ but $y>0$. Therefore $x$ is odd.  Let $x=2p+1$. We can rewrite the equation as $4p(p+1)=y^3$.  $gcd(p,p+1)=1$, therefore $p(p+1)=2$. Therefore $x=3$.  Is that correct ?


How to use possessive form for proper nouns that already have an apostrophe

How would one write a possessive form for a proper noun that already has an apostrophe-s in it? For example, I want to use the possessive form of "McDonald's" maybe in the sentence "The Market Street McDonald's' employees are friendly."  I realize the possessive form may not be entirely necessary there, but in a case where it is, what is correct?


What is the intuition behind the formula $$P(A\mid B)=\frac{P(A\cap B)}{P(B)}$$ I have seen this formula around, but every site/book I look at does not really have a clear & cut explanation behind this formula.


I'm new to Ubuntu server and I'm having a little trouble with a project.  I need to add a user account, add a comment, create and set the home directory, add primary group to user, and set the password for the user.    I have no problem doing these individually, but for my project I need to use a single command to create the user with the properties listed.    Can anybody help me with this?


How can I continue using apt-get on Lubuntu 16.10

Today apt-get has stopped working on my Lubuntu 16.10. Whenever I try to install packages using apt-get install  nothing happens after "reading packages list" has been printed out.  I guess that is due to end of support for that version of Ubuntu, but I am happy with using this system and would like to avoid reinstallation, if possible.  Edit: I've already seen the question for which mine has been marked as a duplicate and it didn't solve my problem (after executing the command given as the solution only a message about the package not being found is getting printed out).


How to find file without knowing the name of it

So I've finally given up after searching/trial and error for an hour now on how to find a file given specific criteria (none of which is the name of the file or the extension).  The file info provided is the following:   human-readable    1033 bytes in size     not executable  I've gotten find commands to take but nothing was returned. I am using Kali linux. The objective is to find the file in the directory that matches these criteria without simply opening them all. Files are visible but there is one hidden one that I'd like to include in the search. Basically I want to search an entire directory that I'm in using the above criteria.


Why does rainwater form moving waves on the ground? Is there a name for this effect?

A while ago it was raining and I noticed that, on sloped pavement, water was flowing in very regular consistent periodic waves, as you see below.  However, I realized I had no idea why this should be happening. There was nothing uphill actually creating these waves, and they continued down as far as the pavement went, despite the rain that was falling on them along the way. Why wasn't the water flowing down smoothly, or irregularly? What causes the noticeable wavelike patterns? Is there a  name for this phenomenon?


Copy text from co-authored paper into thesis

I am the third author in a journal paper that is accepted but not published. I am wondering if it is acceptable to copy text from the paper to my master's thesis.  I have read from many places that it is common to take texts from papers that I wrote to form my thesis. However, in my case, after many rounds of editing, my texts in that journal paper were intertwined with texts from the other authors and there's no easy way to separate a block of text that is exclusively written by me. In this case, how do I reuse texts from such paper.


Malformed line in the source list /etc/apt/sources.list (dist parse), don't let me use update manager?

Here is the error hope i can get some help, i show you the update manager and the line of the error, if you need something else just ask for it.  E: Malformed line 59 in source list /etc/apt/sources.list (dist parse) E: The list of sources could not be read.   Error line:  deb http://archive.canonical.com/ partner


Light clock with mirrors on a moving train

I am reading a new popular science book where a thought experiment proposed by Albert Einstein is explained.  It is a thought experiment with a light clock. The light clock is emitting light straight into a mirror, the mirror reflects the light and when the light makes the round trip clock-mirror-clock this registers the passage of a certain amount of time, e.g. 1 millionth of a second.  In the first part of the experiment the clock is standing in a train which is not moving so the clock and the mirror are still. As seen in the first picture (below).    In the second part of the thought experiment the train is moving and the book suggests that the light travels a longer distance because the train is moving and therefore it kind of travels on a diagonal as presented in the second picture (below).    Now I disagree with this suggestion. I see no reason for the light to change trajectory or travel a longer distance. I argue that even when the train is moving the first picture still holds true.   There is also one more thing that it seems to me is wrong with that picture. There is no mirror against the clock at t0, no clock against the mirror at t1 and again no mirror against the clock at t2. This placement of the clock and mirror in time is crucial because it results in the longer diagonal path of the light but the clock and the mirror are moving at the same time! So the only illustration that makes sense is one where the clock is always against the mirror.  In the experiment it is said that light travels a longer trajectory with reference to an observer outside of the train standing still beside the railway.  I think that the train travels with reference to the still observer but the light travels with reference to the train. So I argue that regardless of whether the train is moving or not the light travels the same distance for the same time.  After all when it comes to measuring distances the reference is central.  More food for thought: It could just as well be a ping pong (table tennis) ball clock. If you are playing table tennis on a train the ball travels directly along the length of the table while the train is moving, would you suggest that the ball is traveling on a diagonal trajectory? I think not.  Please share all your arguments.


Help me identify this insect from Bangladesh

I have seen this insect flying literally everywhere in Dhaka city (Bangladesh) over the last two months. It's small -- around 1-1.5 inches long. It's not an agile flyer and can be easily grabbed by hand during flight.


I have 8 individual SQL Server 2008 R2 machines, each hosting 1 database. Each database has an identical table structure and schema, and entirely unique data.  I would like to establish a reporting server (may be 2008 or 2012), that consolidates the rows  from selected tables across the 8 source servers into a single instance of those tables on the reporting server. This is one-way replication (no changes will be made to the reporting server). I will need to replicate changes from the source databases with relatively low latency (say 20-30 seconds).  Furthermore, I'd like to find methods to achieve this with as little impact to the source servers as is practical.  3rd-party agents, triggers, or schema mods to those servers are difficult in my environment.  My questions:   What are promising architectures and technologies for  achieving this goal?  I've looked at SQL Server Merge Replication, but I am concerned about latency. Is this an appropriate technology for this goal? Are there many-to-one architectures for transactional replication?   Should I be looking at 1-to-1 replication into 8 databases on my reporting server, followed by some custom merge function (a 2-step replication)?   Thanks, John


Extension of Arzela-Ascoli Theorem in $\mathbb R\;$

One version of Arzela-Ascoli theorem can be stated as follows:     Consider a sequence of real-valued continuous functions   $\;\{ f_n \}_{n \in \mathbb N}\;$ defined on a closed and bounded   interval $\;[a, b]\;$ of the real line. If this sequence is uniformly   bounded and equicontinuous, then there exists a subsequence $\; \{ {f_n}_k \}_{k \in \mathbb N} \;$ that converges uniformly.   I am trying to extend the theorem for sequences of real-valued functions defined on $\; \mathbb R\;$. One hint I've got , is to use a diagonal argument...but I'm not very familiar with this.  EDIT: I need to derive that a sequence of real-valued functions defined on $\; \mathbb R\;$ which satisfy the conditions of boundedness and equicontinuity on a closed interval of $\; \mathbb R\;$, has a uniformly convergent subsequence on compact intervals.  How do I proceed?  I would appreciate if somebody could enlighten me about this. Any help would be valuable!   Thanks in advance!!!


How do I do a search in File Explorer that includes subfolders of zip archives?

In File Explorer, I can enter search terms in the upper-right search box to search the current folder and all subfolders. I can also navigate the folder tree of zip archives like any other folders. However, if I want my searches to include files in a zip archive I have to navigate to the specific folder in the zip archive where the file is located. My searches never include files in zip archives if I'm not in the archive, and when I am in the archive my searches don't include files within the archive's subfolders.  Is there a way for my searches to include zip archive subfolders?


Computing Confidence Intervals for Coefficients in Logistic Regression

After fitting a logistic regression model in R using model <- glm(y~x,family='binomial') I can obtain the confidence intervals for the fitted coefficients using confint(model), but I want to know how to manually compute these values. In the case of a linear model lin_mod <- lm(y~x) I can just do the following to obtain a 95% confidence interval for the slope coefficient:  CI_lower <- coefficients(lin_mod)[2] - 1.96*summary(lin_mod)$coefficients[2,2] CI_upper <- coefficients(lin_mod)[2] + 1.96*summary(lin_mod)$coefficients[2,2]   Where coefficients(lin_mod)[2] is the estimated value of the coefficient, and summary(lin_mod)$coefficients[2,2] is corresponding standard error.  However when I use this same process to compute the confidence interval of the fitted coefficients of a logistic regression, the values don't agree with the output from confint. Below is an example using some randomly generated data:  x <- rnorm(n=100, mean=5, sd=2) y_prob <- plogis(x, location=5, scale=1) y <- sapply(y_prob, function(p) rbinom(1, 1, p)) model <- glm(y~x, family='binomial')  summary(model)$coefficients #               Estimate Std. Error   z value     Pr(>|z|) # (Intercept) -3.8998231  0.8838826 -4.412150 1.023490e-05 # x            0.7963213  0.1746632  4.559183 5.135303e-06  CI_lower <- coefficients(model)[2] - 1.96*summary(model)$coefficients[2,2] # = 0.4539815  CI_upper <- coefficients(model)[2] + 1.96*summary(model)$coefficients[2,2] # = 1.138661   confint(model) #                  2.5 %    97.5 % # (Intercept) -5.8044657 -2.313925 # x            0.4843258  1.173998   As you can see, manually computing the 95% CI around the x-coefficient yielded (0.4539815,1.138661) whereas computing it using confint yielded (0.4843258,1.173998). So my question is, how is confint computing this confidence interval, and why does my estimate differ? From some additional tests on larger samples I can see that the two estimates converge in the large-N limit, but I'm interested in what's going on for small N, in particular why the CI produced by confint is not symmetric about the coefficient estimate.


Ubuntu 18.04 install on an old Intel motherboard

The Ubuntu 18.04 official download website has the amd64 (64-bit) .iso file only. A 32-bit Ubuntu 18.04 .iso file is not available.   I have 2 Dell Latitude E6420 laptops with Intel motherboards. On one motherboard, the Ubuntu 18.04 installation seemed to work OK, but not on the other. Is there a download specifically for Intel motherboards, and how do I get it? Any other tips are appreciated. Specifically, in one motherboard, the one with issues, the wifi switch will not activate and the wifi will not turn on.


While comparing the equations in the align* environment using the & sign before the = sign, it is giving error "! Misplaced alignment tab character &"

\documentclass {article} \usepackage {geometry} \usepackage {amsmath} \begin {document} With align* command :-\\ \\ \\ \begin {align*} a = b + c \\ abcd = f + g + h \end {align*}\\ \\ \\ \\ Without align* command :-\\ \\ \\ a = b +c \\abcd = f + g + h \\ \\ \\ With align* command and ''and'' symbol used:-\\ \\ \\ \begin {align*} a & = b + c \\ abcd & = f + g + h \end {align*}\\ \\ \\ \\ Without align* command and `'and'' symbol used :-\\ \\ \\ a &= b +c \\abcd &= f + g + h \\ \\ \\ \end {document}


I want to know which sentence is correct

Which question in is past simple tense grammatically correct?      Who called you?   or      Who did call you?


Possible to "build world" in FreeBSD without root?

The FreeBSD  has instructions on building a jail distribution tree:   D=/here/is/the/jail  cd /usr/src  mkdir -p $D  make world DESTDIR=$D  make distribution DESTDIR=$D   Is it possible to do this with a non-root account? Right now, with a regular user account, I get:  $ make world DESTDIR=/jails/base/ [Creating objdir /usr/obj/usr/src/amd64.amd64...] mkdir: /usr/obj/usr: Permission denied make: "/usr/src/share/mk/auto.obj.mk" line 69: could not use /usr/obj/usr/src/amd64.amd64: .OBJDIR=/usr/src   If I'm building into a jails directory, I don't see why root privilege is necessary. Is it possible?


I am currently trying to create an article in elsarticle style, twocolumn. The title and text end up in two columns, the abstract however is made two columns wide. Any ideas what I am doing wrong? Obviously I want my abstract to also be only in the first column.  \documentclass[a4paper,10pt,twocolumn,preprint]{elsarticle}  \usepackage{lipsum}  \journal{TexExchange}   \begin{document}     \begin{frontmatter}       \title{Two-column abstract}       \begin{abstract}         \lipsum[1]      \end{abstract}       \begin{keyword}        abstract      \end{keyword}    \end{frontmatter}   \section{Outline}    \lipsum[2-3]  \end{document}


I have about a hundred fonts that I need to install. Manually right clicking every font file and clicking install, then selecting "personal" vs "system" in a dialog that appears, and then closing it is tedious. Is there a command that will let me achieve the same effect in one shot? (I am using KDE.)


Can you take a feat that you can not use at the current level if there are no prerequisites?

Quicken spell feat doesn't have any prerequisites to take. Can I take it at an earlier level than I can use it and have it for when I can?


In the math competition  of my university, it was asked to prove this result, I have been trying to do it using polar coordinates, but this path has not led me to something concrete $$\int_{-\infty}^{\infty} e^{-\xi^2t}e^{i\xi x}d\xi=\sqrt{\frac{\pi}{t}}e^{-x^2/4t} \quad \forall \ x\in \mathbb{R},t>0$$


I'm drawing a fairly complex picture with many overlapping areas. Is there a way to pass each \draw snippet to a layer specified in the options? Or even better, based on its axis position?  I know of the backgrounds library but only offers two layers. In the  section 108.3 (pg. 1080) pgfonlayer is introduced. That would meet my needs but it requires encapsulating each command (or block of commands) with a begin{pgfonlayer}{<layer>}…\end{pgfonlayer} so that is cumbersome and reduces readibility. I want something like \draw[layer=<layer>], in the way the backgrounds library does. How would I go about achieving that?    A small MWE to illustrate:  \documentclass[tikz,border=10pt]{standalone} \begin{document} \pgfdeclarelayer{backlayer} \pgfdeclarelayer{backlayer2} \pgfdeclarelayer{frontlayer} \pgfsetlayers{backlayer,backlayer2,main,frontlayer} \begin{tikzpicture} \begin{scope}[xshift=-5cm] \draw (0,0) rectangle (2,2); \fill[red] (1,1) rectangle (3,3); \fill[blue] (-1,-1) rectangle (1.5,1.5); \fill[green] (0,0) circle (1.5); \end{scope} %with layers \begin{pgfonlayer}{frontlayer} \draw (0,0) rectangle (2,2); \end{pgfonlayer} \begin{pgfonlayer}{backlayer} \fill[red] (1,1) rectangle (3,3); \end{pgfonlayer} \begin{pgfonlayer}{main} \fill[blue] (-1,-1) rectangle (1.5,1.5); \end{pgfonlayer} \begin{pgfonlayer}{backlayer2} \fill[green] (0,0) circle (1.5); \end{pgfonlayer} \end{tikzpicture} \end{document}     Note the order change even though the code is still ordered in the same way.


Removing small spaces (slivers) between polygons?

I have a set of polygons representing administrative districts.  The districts were digitized by hand, and there are small spaces (slivers) between polygons where the polygons should be touching. How can I have the polygons snap together, removing the spaces?


SQL server 2008 Express x64 in windows 8.1 fail

I've been download sql server express x64 version in   I just install new windows 8.1 x64 vl version and install trial KIS for anti-virus. After i install sql server but it's not working     and    i uninstall KIS, SQL server and install avast and sql server again but the same :(.  How to fix that thanks.


I'm using Overleaf. The following example appears to compile correctly:  references.bib  % Encoding: UTF-8 @Article{Creasy1981,   author    = {R. J. Creasy},   title     = {The Origin of the {VM}/370~{T}ime-Sharing System},   year      = {1981},   volume    = {25},   number    = {5},   pages     = {483--490},   issn      = {0018-8646},   doi       = {10.1147/rd.255.0483},   url       = {http://dx.doi.org/10.1147/rd.255.0483},   journal   = {{IBM} Journal of Research and Development},   publisher = {{IBM}},   type      = {Journal Article}, }   main.tex  \documentclass[11pt,a4paper,english,twoside,openany]{report} \usepackage[english]{babel} \usepackage[utf8]{inputenc} \usepackage[autostyle]{csquotes} %\usepackage{listings} \usepackage[backend=biber,style=ieee]{biblatex} \addbibresource{references.bib} \begin{document} A reference \autocite{Creasy1981} \printbibliography \end{document}   However, when the commented-out listings package is added back in, it complains at the \printbibliography line, asserting that /370z (I'm guessing in the title field of the bib entry - not sure where the z comes from though?) is some sort of control sequence.  ./main.tex:11: Undefined control sequence. <recently read> /370z  l.11 \end          {document}    I've removed the tilde, and there is now no problem, but I'm guessing the pre-filled DOI data had a non-breaking space there for a reason, so I'd rather it isn't removed. Why doesn't listings play nicely with this bib entry?


Trouble in understanding a proof of a theorem related to UFD.

Theorem :  In a UFD $R$, for any $a,b \neq 0$ prove that $ab \sim \gcd (a,b) . \operatorname{lcm} (a,b)$.  Proof : Let $d$ be a gcd of $a$ and $b$ respectively. Let $a = dx$ and $b = dy$.We show that $c = dxy$ is the lcm of $a$ and $b$.Clearly $a|c$ and $b|c$.Let $u \in R$ such that $a|u$ and $b|u$.Then $dx|u$ and since $y|b$, we also have $y|u$.Thus $c = dxy | u$. Therefore $c$ is a lcm of $a$ and $b$.  Now $ab = dx . dy = d^2 xy = dc$. Also since any two gcds are associates and the same is true for lcms, we have $ab \sim \gcd (a,b) . \operatorname{lcm} (a,b)$ as required.  But I fail to understand the logic that why $dx|u$ and $y|u$ $\implies dxy|u$?I think it should be $dxy | u^{2}$.Would anybody please help me understanding this concept.Then it will help me a lot.  Thank you in advance.


Difference between one-way ANOVA and all pairwise comparisons with Bonferroni correction

If you have five groups and you wish to know if there is a significant difference between any of the group means, you would have to do 10 pairwise comparisons to test all possible pairs of means.  You would have to test    Mean for group 1 vs. mean for group 2    Mean for group 1 vs. mean for group 3    Mean for group 1 vs. mean for group 4    Mean for group 1 vs. mean for group 5    Mean for group 2 vs. mean for group 3    Mean for group 2 vs. mean for group 4    Mean for group 2 vs. mean for group 5    Mean for group 3 vs. mean for group 4    Mean for group 3 vs. mean for group 5    Mean for group 4 vs. mean for group 5   If you do each of these tests at the alpha = .05 level, you have 5 chances in a hundred of concluding the difference is significant when it is really just due to chance.  If you 10 such tests you have             10 times .05 = .50 or  a 50/50 chance that one will be significant just by chance.  This is an unacceptable error rate. We could use a Bonferroni correction to adjust the significance levels we're hoping to detect such that we won't have a false Type I error being alerted.  Alternatively, we could also use ANOVA to compare all of these groups.   Aside from computational limitations, what advantage does ANOVA have over pairwise Bonferroni corrected t-tests?


How can I prevent an application (or user) from changing the screen resolution?

I am searching for an option to disable resolution changes by certain programs or users.  In example I have a media player who automatically changes the resolution depending on the inserted medium. Since the results are poor, I want to disable this functionality. Since there is no according option in the player settings, I thought about creating a user who is lacking the rights to change the resolution.  But I have no idea how to do that. Alternatively I would also be completely satisfied if you know a way of restricting these rights on a per-program basis. Actually any solution is welcome.  I'm am running Win7 Professional.


A name for a well-informed person who is not believed?

Is there a term for a well informed person who is not believed, or not listened to, or is even ridiculed?  I do not necessarily mean some one before their time... I am thinking in more general terms.  (I have googled this but the question is too broad and has too many keywords and if I try to narrow it down I lose the original meaning.)


Acting on a different display when using SSH

I am connecting to a Linux CentOS 2.6 computer via SSH wit the display deported on my screen (using MobaXterm). It is also possible to access to this computer "physically".  However, I would like a way to inform people that may want to access "physically" to the computer that I am currently using it via SSH.  One way would be for them to make who in a terminal and see whether someone is connected from another computer. However, I don't want them to have to check this manually each time (they may - and will - forget this check).  Thus, I would like a way to open a window on THEIR display (i.e. the screen plugged to the computer) with a message for them. Somthing like a text into gedit would do the work.  Can I do that? Can I open an application on a different display than mine?


How do I prove that the 2 ranks are equivalent

Let A be a diagonalizable matrix and $\lambda$ an eigenvalue of A $\DeclareMathOperator{\rank}{rank}$ Show that $$\rank(\lambda I - A)= \rank((\lambda I - A )^2)$$  Iam not sure whether this is allowed but i tried premultiplying by P and P^{-1}  such that   $$\rank(P(\lambda I - A)P^{-1})= \rank(\lambda PIP^{-1} -PAP^{-1}) $$  but is this even correct?


Can I make Firefox 20+ downloader behave like before?

I have the impression that Firefox 20 is heavier (on an older computer with 1 GB of RAM running Ubuntu-Xfce) than v. 19. There may be small features that change the way it interacts with that system; anyway, subjectively I see a difference that I do not like. (On a newer system with 4GB I see no difference.) But I want to be up-to-date, so I will try to disable the most obvious difference: the way downloads look.  Can I make the download manager look like before?  (Is there a big change involved with 20+? Is  this just a false impression?)


a linear algebra multiple choice problem

Let $A$ belongs to $M_3(\mathbb R)$ which is not a diagonal matrix. Pick out the cases  when $A$ is diagonalizable over $\mathbb R$:  a. when $A^2 = A$; b. when $(A - 3I)^2 = 0$; c. when $A^2 + I = 0$  (a) is certainly true as eigen values are distinct. (c) is certainly not true as eigen values are imaginary not real. but i am not sure about (b). can anybody help? thanks.


All the planets in our solar system rotate 'Anticlockwise', except Venus. Why is the only planet that rotate' clockwise'?

All the planets in our solar system rotate 'Anticlockwise', except Venus. Why is the only planet that rotate 'Clockwise'?


Hairy Ball Theorem: homotopy from the identity to the antipodal map

I'm having trouble to prove the following statement:     If the $n$-sphere $S^n\subset\mathbb{R}^{n+1}$ admits a (continuous) nonvanishing tangent vector field, then $n$ is odd.   The idea of the proof is pretty clear on my mind: we use the fact that the antipodal map has degree $(-1)^{n+1}$ and that the Brouwer degree is invariant under homotopies.  We have a (continuous) nonvanishing tangent vector field $v\colon S^n\to\mathbb{R}^{n+1}$ that can be supposed unitary (otherwise, just consider $u=v/\|v\|$). Paraphrasing Hirsch: "a homotopy of $S^n$ from the identity map to the antipodal map is obtained moving each $p\in S^n$ to $-p$ along the great semicircle in the direction $v(p)$".  My question is: is there an explicit formula for this homotopy?


I keep getting a response of 0 instead of string, which is my function echoes. Why?  code from functions.php  // enque test.js function add_script() {     wp_enqueue_script(         'test',         get_stylesheet_directory_uri() . '/js/test.js',         array( 'jquery' )     );     wp_localize_script('test', 'ajax_object', array( 'ajax_url' => admin_url( 'admin-ajax.php' ))); } add_action( 'wp_enqueue_scripts', 'add_script' );  // ajax function function my_AJAX_processing_function(){    echo 'string'; } add_action('wp_ajax_nopriv_ACTION_NAME', 'my_AJAX_processing_function');   code from test.js  $(function () {      var data = {         action: 'ACTION_NAME'     };      jQuery.post(ajax_object.ajax_url, data, function(response) {         alert('Got this from the server: ' + response);     });  });


Program SIGNIFICANTLY slower when used from the TTY

So I have a program written in C++.  It can tell me how long it took to do all the calculations and it does a lot of quite heavy, multi-threaded calculation.   I've just noticed that if I run the program on the exact same machine, it takes around 20-21 seconds to do all the calculations if started from the TTY, and only about 0.2 seconds if I start it from GNOME terminal.  What is causing that? It's literally the exact same file on the same machine.


Mean centering and setting standard deviation to 1 in data

I was wondering if it is necessary to mean center and set std to 1 to the both my xs and ys in linear regression or doing that to just xs is fine enough.  Lets say I use a different model, say neural networks, is it necessary to standardize. I want to know if it is good to standardize both xs and ys, whatever model I use


Number of elements in a finite field extension for finite fields

Given an arbitrary finite field $K$ (not necessarily $\mathbb{F}_p$ with $p \in \mathbb{P}$) with $|K| = q$ and an irreducible polynomial $f$ with $\alpha$ as root and degree of $n$. Is $|K(\alpha)| = q^n$ and why? Its clear to me for $K$ isomorphic to $\mathbb{Z}_p$ with $p$ is a prime number.


I have a script in which I am trying to use subprocess.call to execute a series of shell commands, but which appears to have some commands omitted when executed.    Specifically:  #!/usr/bin/python import tempfile import subprocess import os import re   grepfd, grepfpath = tempfile.mkstemp(suffix=".xx") sedfd,  sedfpath  = tempfile.mkstemp(suffix=".xx")  # grepoutfile = open( grepfpath, 'w') sedoutfile  = open( sedfpath,  'w' )  subprocess.call(['cp','/Users/bobby/Downloads/sample.txt', grepfpath])  sedcmd = [ 'sort',             grepfpath,            '|',             'uniq',            '|',            'sed',            '-e',            '"s/bigstring of word/ smaller /"',            '|',            'column',            '-t',            '-s',            '"=>"' ]  print "sedcmd = ", sedcmd subprocess.call( ['ls', grepfpath ] ) subprocess.call( ['sort', '|', 'uniq' ], stdin = grepfd ) subprocess.call( sedcmd,  stdout = sedoutfile )   And it generates this as output:  python d3.py  sedcmd =  ['sort', /var/folders/3h/_0xwt5bx0hx8tgx06cmq9h_4f183ql/T/tmp5Gp0ff.xx', '|', 'uniq', '|', 'sed', '-e', '"s/bigstring of word/ smaller /"', '|', 'column', '-t', '-s', '"=>"'] /var/folders/3h/_0xwt5bx0hx8tgx06cmq9h_4f183ql/T/tmp5Gp0ff.xx sort: open failed: |: No such file or directory sort: invalid option -- e Try `sort --help' for more information.  The first 'sort: open failed: |:No such file... is from the first subprocess call ['sort','|','uniq'], stdin = grepfd ) The 'sort: invalid option -- e  .. is from the second subprocess call (sedcmd).  I have seen a lot of examples that use pipes in this context -- so what am I doing wrong? Thanks!


Linear Operators satisfying $S^n=0$ but $S^{n-1}\neq 0$

I need help with part (c). I could do part (a) and part (b).


Is the world of "A Song of Ice and Fire" round or flat?

It's unclear from "A Song of Ice and Fire" (AKA Game of Thrones), at least from what I remember, if the world is flat or round. Westeros is at the west of the "known world" - but if you kept going west, what would you find? Would you end up at the other side, like in our world?


How do I stop my Mac OS X from going to sleep?

In settings, I don't see a way to stop the PC from going to sleep.


Did other Star Wars species see into the ultraviolet?

I understand from  article on the Star Wars Wiki page that Clone Trooper armor was only white to human eyes, not the Kaminoans who built it (they could see ultraviolet light and so thought it was colored).  Assuming the Kaminoans aren't stupid, this would only make sense if many races can also see into the ultraviolet so are there many Star Wars races who have ultraviolet vision and is the issue of how they view clone trooper armour addressed in any canon?


The Pop-Up occurs, why is giving bounty to a deleted answer not prevented (is it really not)?

When I try to give a bounty to a deleted answer, a pop-up occurs:    Nope, I didn't try - I didn't dare to. But why is it not prevented (or rather, is it really not prevented)?  I read up  but the answer seems to focus more on why the answer got deleted rather than whether it is possible to give bounty to a deleted answer.


I want a table whose first column is aligned top, second column is aligned middle, and third column is aligned bottom; like this:    I wrote the following code:  \documentclass{article} \usepackage[english]{babel} \usepackage{array}  \begin{document}  \begin{tabular}{| p{1cm} | m{1cm} | b{1cm} |}     \hline     x &     A long text comes here &     x \\ \hline \end{tabular}  \end{document}   Yet, to my surprise, the outcome was "all columns aligned middle," as follows:    What did I do wrong?


Reproduce a confidence interval of linear regression in Excel

After a series of tests and exploratory analysis, I have design a linear model in R, the model is the following:  summary(gn)  Call: lm(formula = NA. ~ I(PC^0.25) + I(((PI)^2)), data = DSET)  Residuals:     Min      1Q  Median      3Q     Max  -425.22  -87.46   -2.30   79.11  396.14   Coefficients:               Estimate Std. Error t value Pr(>|t|)     (Intercept) -2.047e+03  1.094e+02  -18.71  < 2e-16 *** I(PC^0.25)   1.206e+03  4.231e+01   28.52  < 2e-16 *** I(((PI)^2)) -5.242e-02  1.233e-02   -4.25 2.81e-05 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  Residual standard error: 127.2 on 319 degrees of freedom Multiple R-squared:  0.7475,    Adjusted R-squared:  0.746  F-statistic: 472.3 on 2 and 319 DF,  p-value: < 2.2e-16   Then, for example, I calculate the interval confidence for a certain input:  > a<-data.frame(PC=58,PI=12) > a<-predict(gn,newdata=a,interval="prediction",level=0.95) > a        fit      lwr      upr 1 1274.515 1022.976 1526.054   Finally, given the coefficients of the model and the same input, I try to calculate the same confidence interval in EXCEL. Using the formula for the 95% interval of each coefficient, <estimate coefficient - 1.96*error, estimate coefficient + 1.96*error>, the fitted value is reasonable but the extremes are far different.  So, the results are : fitted value=1274.499125 , lower=826.5811979 , upper=1722.417051. As you see, the extremes are different from the output of R.  What's my error? What should I do to get the same intervale I got in R?


Why is AcceptedAnswerId null for a question that has an accepted answer?

This StackExchange  attempts to get the first 10 unanswered bounty questions: SELECT TOP 10 Posts.AnswerCount, Posts.AcceptedAnswerId, Posts.Id AS [Post Link] FROM Posts     JOIN Votes ON Votes.PostId = Posts.Id       and Posts.PostTypeId = 1 -- questions       and Votes.BountyAmount > 0       and Posts.AnswerCount = 0       and Posts.AcceptedAnswerId IS NULL ORDER BY Posts.CreationDate DESC  ...but it returns a list of questions that already have accepted answers:  I would've expected AnswerCount and AcceptedAnswerId to be nonzero for those answered questions. Why are these posts showing up in my results? (I think it's a bug, but maybe my query is wrong.)


Trying to understand the difference between $\Delta t$ and $dt$

I'm trying to gain a more conceptual understanding of derivatives and would appreciate your feedback on this.  Say I have a quantity, $x$, at time $t$. Now $x$ moves to a different location $x'$ in time $t'$ =  $t + \Delta t$.   Where I get confused is when we start talking about shrinking $\Delta t$ down to zero. I keep seeing people say that it represents an infinitesimal quantity, which confuses me even more. Similarly, people will say it "simply" represents a very small quantity.   I get that much but where I get lost is how small does $\Delta t$ have to be before we start treating it as $dt$ and not $\Delta t$?  In other words, is it correct to simply substitute numbers in to a quantity like $dt$? Could I say that at a certain instant in time, $dt$ = 4 seconds?   I've seen this done before in a few books and well, frankly it irritates me because I'm seeing the $d$ operator used in many different contexts. Some are saying you can substitute numbers in for something like $dt$ and others say no.


Most common C# bitwise operations on enums

For the life of me, I can't remember how to set, delete, toggle or test a bit in a bitfield. Either I'm unsure or I mix them up because I rarely need these. So a "bit-cheat-sheet" would be nice to have.  For example:   flags = flags | FlagsEnum.Bit4;  // Set bit 4.   or  if ((flags & FlagsEnum.Bit4)) == FlagsEnum.Bit4) // Is there a less verbose way?   Can you give examples of all the other common operations, preferably in C# syntax using a [Flags] enum?


I have a list of files:  ➜ ls 1_test.txt  3_test.txt  5_test.txt  7_test.txt  9_test.txt   otherfiles_1  otherfiles_3 2_test.txt  4_test.txt  6_test.txt  8_test.txt  10_test.txt  otherfiles_2    I want to select all the files except {1-5}_test.txt.  I can successfully glob {1-5}_test.txt via: <1-5>_test.txt or even just <1-5>[^0-9]*.  But ^<1-5>_test.txt doesn't work:  ➜ ls ^<1-5>_test.txt zsh: no matches found: ^<1-5>_test.txt   Any ideas what to change?  Edit:  See duplicate/similar question here:   Solution is to setopt extendedglob.


Emittors and Collectors in a transistor, what exactly makes them different?

For my high-school physics class, we are studying the theoretical basics of transistors. I have not been able to understand which side of the transistor is the collector and which side is the emitter by looking the current flow in the circuit. I know that the doping and the size are different, but that doesn't help me when I try to calculate the base current / current at the emitter.    Can you explain me which how I should name Currents I1, I2 and I3 in the drawing? Thanks!


JQuery click event not firing off click event?

I've been looking over and over this one for a while and just can't see where the issue is. This should be a simple thing. What I'm doing is putting a link in a table header column to "Select All" and that would check all of the checkboxes. I've found code to do that but for some reason I can't get the click to even show a simple alert. When I click on the link nothing happens and there are no errors in the DevTools console either.   This is the basic code. I've copied and pasted the ID to make sure there wasn't an misspell but I'm thinking I'm overlooking something simple. I even wrote out the $(document).ready instead of using the $ short cut...grasping for anything.   $(document).ready(function () {      //$("#checkAll").change(function () {     //    $("input:checkbox").prop('checked', $(this).prop("checked"));     //});      $("#checkAll").click(function () {         alert("clicked");     });  });        Select All 	   Not sure if this has something to do with it but the table is in a MVC partial view that get's loaded by Ajax. Also, the JS code is in a separate file and not in the page. I know that the reference to that JS file is good because it also contains the Ajax code and that piece is working.   Any ideas on what I can try?


Is it possible to get a notification when one of our flags has been resolved? This request is similar to , but I think it would be good for all users, not just the first few flags. Aside from many new users not knowing where they can see all of their flags, it gets annoying to go back and check on the status every so often.  I figure one option is just to have a simple notification that says "Your flag has been resolved." Another option is to specify the outcome - "Your recent flag was marked helpful/disputed/declined." and maybe include any moderator messages in the notification. Any of these would be fine, but it would just be nice to be told when a flag rather than having to actively check on the status. This seems like a pretty simple functionality that should be possible.


Change in F vs x graph if spring is torn in half?

The force required to stretch a spring varies with the distance as shown in the figure. If the experiment is performed with the above spring of half the length, the line OA will:   (a) shift toward F-axis  (b) shift towards X-axis  (c) remain as it is  (d) become double in length  If we cut the spring into half the length, the new force constant $K_{new}=2K_{org}$.  Since force is proportional to force constant(the new one). So the force must have doubled. So the line OA should shift to F. But the answer in the book is given to be (b). Can anyone explain this.


I need a Step By Step guide for Installing Oracle Database Express Edition version 11g Release R2 on Ubuntu Desktop 12.04.1 LTS 64 bit Edition


Show that the algebraic extension $K(\alpha,\beta)/K$ is simple if $\alpha$ is separable over $K$

Let $L=K(\alpha,\beta)$ be an algebraic field extension, with $\alpha$ separable over K.      Show that $L/K$ is simple.   My attempt:  If we could show that $L/K$ is finite and separable then the claim would follow by the primitive element theorem.  Since $L/K$ is algebraic and finitely generated, it is a finite extension.  Since $\alpha$ is separable the minimal polynomial of $\alpha$ in $\overline{K}$ is of the form:  $m_{\alpha}(X)=(X-\alpha_1)(X-\alpha_2)\cdot....\cdot(X-\alpha_n)$ with pairwise distinct $\alpha_i$ and $\alpha=\alpha_i$ for one $i$.  Then $f_{\alpha,\beta}(X)=(X-\alpha_1)(X-\alpha_2)\cdot....\cdot(X-\alpha_n)\cdot(X-\beta)$ is a separable polynomial with $f_{\alpha,\beta}(\beta)=0$, hence $\beta$ is also separable. The conclusion follows because then $K(\alpha,\beta)$ is separable, since it's generated by separable elements.    Can someone go through it? I also have some questions about the proof:   Our definition of a separable element $\alpha$ is: the minimal polynomial of $\alpha$ is separable. In the proof above I used that $\alpha$ is separable because there exists a polynomial $f$ with $f(\alpha)=0$. Are these two characterizations equivalent?   $(\Leftarrow)$ If $f$ is separable with $f(\alpha)=0$ then $m_\alpha\cdot g=f$, hence $m_\alpha$ can't have a multiple zero, because of the degrees.  But how does the other direction work?   The polynomial $f$ in the proof: is it already the minimal polynomial of $\beta$? If yes, why?   Thanks a lot!


Prove that in a full oriented connected graph there is a cycle passing through all the vertices. I tried to find contradictory example.But there are not any contridictions. I tried also to put vertexes side by side, doesn't help.


Basically, How to port following function in Drupal 8?  drupal_add_http_header('Content-disposition', 'attachment; filename=' . $filename);   Note: I went through "", but my requirement is different. I need to download a file on form submit button.


How can I search in Label[] for item.Text?

I'm new to programming so I guess this question is kinda stupid. I want to check if current Text exists in Array of Labels, because I get same name twice sometimes.   for (int i = 0; i < DM.checkedListBox1.CheckedItems.Count; i++) {     labels[i] = new Label();     for (int j = i; j < DM.dataGridView1.Columns.Count; j++)     {         if (DM.dataGridView1.Columns[j].Visible)         {                                     if (labels.Contains(DM.dataGridView1.Columns[j].HeaderText))             {                 labels[i].Text = DM.dataGridView1.Columns[j].HeaderText;                 break;             }         }     } }   Thank you!


Is there a noun for addressing a problem (but not quite a "solution")?

There is a problem that has a way to address it.  However, the way to address the problem is not a solution because it doesn't completely solve the problem, and perhaps it is not even a partial solution because it doesn't really solve it. It also introduces complications that may have to be dealt with separately.  The best thing that comes to my mind is "addressing the problem", and it would be great if there was a noun for it.  I would suppose that "mitigation" is an appropriate word, but perhaps there is something more precise?


Coupon Collecting Problem using Inclusion-Exclusion

I am very new to probability and combinatorics. I am trying to solve Coupon Collection Problem using Inclusion-Exclusion formula.  I found a lot of references her a some:       but they all seem concern with expected time to collect all N coupons form what my problem is asking the following:  Suppose there are N coupons after buying n boxes what is the probability that at least one each type has been collected.   Thanks


Was Sybil Trelawney actually making a correct prediction here?

Towards the end of Half-Blood Prince, Sybil Trelawney mentions having warned Dumbledore that the cards kept showing her the "Lightning-Struck Tower." The chapter in which Dumbledore is killed is actually called the Lightning-Struck Tower, and Dumbledore is killed on top of the Astronomy Tower by the same curse that gave Harry his lightning-shaped scar.  Was she making a real prediction here?


I went to  to remove the album but it still won't go away! I signed in with my apple ID and when i hit "sign in" it just prompts me to sign in again straight after. It also did prompt me to sign in on my phone 4 but that also didn't do anything. when will it go away??


Do downvotes on Meta truly mean something different?

It is often said that voting on Meta means something different than voting on regular sites. Upvotes mean "I agree", and downvotes mean "I disagree".  However, I submit that this is not the case. Downvoting of a question has one effect in particular: censorship.  Once a question reaches -8 votes, it disappears from the front page. It can still be found; it isn't deleted. But all it takes is a net 8 downvotes for a question to be more or less lost without a direct link.  You might say that a net 8 downvotes obviously means that the community doesn't agree or want that. Well... does it? Particularly on polarizing issues, a question can temporarily get -8 votes as different people come online and see it. Maybe certain people with a certain belief all see it at once and downvote it a lot.  The front page is how most people find stuff they want to talk about, vote on, or answer. Removal from the front page means that most people will not find it without being pointed directly to it. Once a question hits -8, it is unlikely to be upvoted again. Edits will be irrelevant, new answers won't matter. The question is basically exiled.  The problem is that, on polarized topics, fast mass downvoting can quash any idea that is not popular with the most active members. After all, the most active members are the ones who are most likely to be online and see it. If a bunch of MSO regulars see it and downvote it, it goes away. Someone who checks MSO maybe once a day is less likely to be able to catch the question before it is exiled. This gives undue power to members who are most active on MSO, simply because they have more free time to spend on MSO.  I think this is a significant problem for polarized topics. It becomes very difficult to adequately discuss something that a significant number of active members dislike, even if the community at large doesn't mind.  Consider . It currently stands at +9/-8. Initially, in the first few hours, the question was heavily downvoted and even closed. However, after a day, it was upvoted and reopened.  This shows that a question can initially have a negative response, but later get a positive one. And you can check; any edits I did to the question were relatively minor. The question posted as is was initially negative, but ultimately positive.   If that -8 happened to all come first, odds are good that the +9 and the reopen would never have happened. Those 9 people would never have had the chance to weigh in on the subject. And that's wrong.  It is wrong for someone's potential vote to not matter just because they don't visit MSO multiple times in a day. It is wrong for someone's potential vote to not matter just because they have a different sleep schedule from many of MSO's members.  The problem is one of timing. Heavy dislike from active members who quickly see the question and downvote it can kill a question before someone who might upvote it ever even sees it.  I suppose the best suggestion would be to either lower the -8 threshold (or remove it altogether) or keep it from kicking in until 1-2 days has passed. If the question isn't active, it'll already be off the front page. And if it is active, then enough people will have seen it to know if the threshold represents a real consensus or just the fast-acting few.


Assign Domain names to devices in my network

I need to set up domain names for devices inside my network, but I can't find how to configure this in my router.  I have found the following , but it doesn't apply to my D-LINK router.    Does anyone know more about D-LINK routers to be able to find the equivalent configuration menu?  Thanks in advance.


Why isn't Captain America worthy of Mjolnir?

I haven't see the movie yet, but in the , we can see Cap trying to lift Mjolnir in the humorous scene where every Avenger gives it a try.  Mjolnir even moves just a tiny bit and at this very moment we see Thor's smile disappearing. This, of course, is intended as a humorous and lighthearted scene.  But it got me thinking: why isn't Captain America worthy of Mjolnir? He seems to be the most "perfect" human being anyone can be: brave, not selfish, legitimate leader, prompt to sacrifice (as seen in the first movie, when he jumps on a fake grenade).  I ask this question in light of this very specific scene, but I'm interested in the Marvel Universe (and Marvel Cinematic Universe) as a whole. Maybe Captain America did wield Mjolnir once? Maybe he has some individual flaw I am not aware of that makes him unworthy?


Does Coulomb's Law Hold for Particles in Motion?

I'm trying to develop simple computational tools to study the dynamics of electric particles. I asked a question about my implementation of particle dynamics using differential equations derived from Coulomb's law.   , but on .  This material is not covered in my physics class and due to the special case (relative to what I have learned) of particles in motion I am hoping someone can explain what the kind answerer on Stackoverflow might have meant?


I'm trying to define a hangindent (I managed that) which is repeated for each new line or each new paragraph or something. Do I really have to repeat that before each entry or is there a way of setting that generally for each line / paragraph in this particular chapter? The idea is that if an entry is longer than a line the later lines should have a hanging indentation.  (And yes, I'm aware that writing the bibliography manually is totally silly but my department is very peculiar about how the bibliography has to look like and I wasted 2 days already trying to get a custom style to work (and failed obviously) so I figured doing it manually would in the end be quicker.. -.-)  thx a lot in advance :)  \chapter{Bibliography} \addcontentsline{toc}{chapter}{Bibliography} \label{Bibliography}  \hangindent=\parindent \hangafter=1  Adams, Ansel. \emph{Die neue Ansel Adams Photobibliothek: Das Negativ}. Ed. Robert Baker. 9th ed. München: Christian Verlag GmbH, 1998.\\ Kiefer, Roland. \emph{Nikon Fotoschule}. Schaffhausen: Verlag Photographie, 1981.


Number of occurrences of k consecutive 1's in a binary string of length n (containing only 1's and 0's)

Say a sequence $\{X_1, X_2,\ldots ,X_n\}$ is given, where $X_p$ is either one or zero ($0 < p < n$). How can I determine the number of strings, which do contain at least one occurrence of consequent $1$'s of length $k$ ($0 < k < n$).   For example, a string $\{1, 0, 1, 1, 1, 0\}$ is such a string for $n = 6$ and $k = 3$.   I have found an answer for arbitrary $n$ and $k = 2$, ($k = 1$ is trivial), but I need a more general answer for any natural number  $k$ smaller than $n$.


Converting TIFF file to LAS file in QGIS?

I've been asked by a client to compile LiDAR files (currently in GeoTiff format) into a LAS dataset.   Is this possible within QGIS?   I have downloaded LAStools, but I'm still fairly new to LiDAR so I'm not sure what all the tools do!  I know this is possible in ArcGIS, but I don't currently have access to the software. I see a lot of questions already asked concerning opening LAS files in QGIS, but here I am wanting to convert TIFFs into LAS format.  I don't have the raw data - I only have asc files from which I've made the GeoTiffs from.


How to fix overheating and battery low life on ASUS K56CM?

I have an ASUS K56CM ubuntu 12.04 runs well, but the temperature in idle is about 55-65 °C. And also my battery have a half less life then on windows7. I tried Jupiter but it doesn't work. Should I try a another version of Linux?


If an opponent unsummons my Goblin, does it spoil my Goblin Grenade?

If I'm launching a  (that requires the sacrifice a Goblin) and my opponent uses an  on the Goblin (or similar effects like the ability of a ) does this effectively counter my spell?


stix font error: PK font stix-mathrm could not be created

I can't compile the document with stix font.   \documentclass[10pt,a4paper]{book} \usepackage[utf8x]{inputenc} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{graphicx} \usepackage[T1]{fontenc} \usepackage{stix}  \begin{document}     Package stix.     \[y=X\beta+\varepsilon\] \end{document}   Error message:  miktex-makemf: The stix-mathrm source file could not be found. Running ttf2pk.exe...  miktex-makepk  : PK font stix-mathrm could not be created.  Process exited with error(s)   Any help?


Install Ubuntu / on SSD and /home on HDD

I'm trying to install Ubuntu 18.04 on my computer. I have an SSD and an HDD. I want to install the Ubuntu root / on my SSD (and my swap too), but install my /home on my HDD.  I didn't find how to do it during the Ubuntu install, so I installed Ubuntu on my SSD and I'm trying to move /home to my HDD.  What I have done:  Created an ext4 partition for my newHome with GParted. Then sudo mount /dev/myNewPartition /media/stockFolder Then sudo cp -av /home/. /media/stockFolder    I'm in trouble because Alt+F2 and gksudo nautilus don't work (command not found), but I need it to rename /home in /oldHome and then mkdir /home and mount /dev/myNewPartition /home and cp -av /media/stockFolder/. /home  If there is a solution to do it during installation it would be nice. Please help me to run gksudo nautilus?


Adding materials to more than one object

Is it possible to add a texture or material to more than one object at a time?