i took some frozen fish out the freezer Tuesday night and sat it in a sink of water, how ever my parents decided to get pizza and i thought the put it up, but it sat in the sink over night and the next day (Wednesday) it sat in the fridge till the next day. i feel bad for wasting over is so i am wondering is it still good to bake or grill or to just dump out, ive already cleaned it and 10 mins ago? i need help on this.

If I left food out of the refrigerator for some period of time, is it still safe? If I left it out too long, can I salvage it by cooking it more?


So, there are mods, and there are Mods - by which 1 mean the 101 diamonds / actual Stack Exchange employees who have access to the devs, etc.  By playing around regular input and activity on the various sites, I think I know many of the actual SE staff (Shog, Adam Lear, Jon Ericson, Marc Gravell, etc.), but is there a page where I can see all of them?  In some ways it would be really nice just to be able to see their interests and be able to quickly differentiate, say, Shog9's input from <insert your least favorite troll here>.  Ideally, this would be a 'flair page' meaning that the staff directory would show the name, function, and reputation of each individual on staff.    I realize this may be mere voyuerism on my part, but it is still nice to know the players. More importantly, if someone hits the 'contact us' link, it would be nice to know who is answering. (Yes, it's probably Adam or Shog, but again...)

I know Jeff Atwood and Joel Spolsky are the owners or creators because I came by the site from reading their blogs.  Who else works for Stack Overflow in here?  Does Jon Skeet? There's also a fair number of 100k+ users now.  The answers from them are quite informative. It seems that to get that many points in such a short amount of time (the site's only been online for 2-3 years?), you would need to be spending quite a lot of time, regularly on here, so either they   Have a ton of spare time either at work or outside of work Are unemployed (seems unlikely given their breadth of knowledge) Work for Stack Overflow and their job is partially to post answers.   These guys seem too knowledgeable so reason 1 or reason 2 seem unlikely, so I suspect reason 3.


I was reading this  PDF on RELATIVISTIC ADDITION AND GROUP THEORY and on remark 2.4 he says :  I'm trying to prove that remark buy I have no idea how to start

$(\Bbb R,+)$ is a topological group. Is there any other group structure on $\Bbb R$ such that it is still a topological group and this group is not isomorphic to $(\Bbb R,+)$ ?  Refer to  for the general problem. In that problem I have conjectured that there is no such group however I couldn't prove it.


Using TeXstudio, the icons and menus are almost invisible on my 4k display (3840 x 2160 pixels, 28").  Is it possible to adjust the graphics so that TeXstudio could be usable on my 4k display?

What editors/IDEs are available for easing the process of writing TeX/LaTeX documents? Please state some useful features like code completion, spell checking, building final DVI or PDF files, etc.  This question is undergoing a systematic refurbishment, see  on Meta. If you’d like to see another editor feature covered here or to take care of an editor that’s not covered yet, share your ideas in that meta question.  List of editors Links to answers.


I have a form in fragment A, after the user enters their information and presses on submit, they should get redirected to fragment B.  I can manage to call the fragment method, however I'm getting a NullPointerException error:   Attempt to invoke virtual method 'java.lang.Object android.content.Context.getSystemService(java.lang.String)' on a null object reference   How I am calling the method in fragment B:  (new FragmentB()).infoSubmitted();   How could I effectively call the method in fragment B?

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I get an error -      xdvipdfmx:fatal: sfnt: Freetype failure...   - when trying to use Google Noto fonts. How should I proceed?  MWE:  \documentclass[a4paper,12pt]{article} \usepackage{xeCJK} \setCJKmainfont{Noto Sans CJK JP}  \begin{document}  すもももももももものうち。  \end{document}

I was trying to find a font which has obsolete jamo and the right combining behaviour. Yesterday I found out about , which seems to have both of these. However, when I use it in XeTeX, I get some seemingly-arbitrary hanja (or blank spaces) instead of the expected characters.  (I’m guessing the composing behaviour will fix itself when the right characters are selected. And yes, I know that Code2000 is working perfectly in this example, but unfortunately it is the ugliest font in the world. :p)  MWE:  \documentclass{article} \usepackage{fontspec}  % 1. precomposed: U+BB47 % 2. separate jamo: U+1106, U+116E, U+11BA % 3. obsolete [separate jamo]: U+113B, U+119F, U+11EB \newcommand\test[1]{#1 & {\fontspec{#1}{뭇; 뭇; ᄻᆟᇫ}} \\}  \begin{document}  \begin{tabular}{rl} \test{Arial Unicode MS} \test{Batang} \test{Code2000} \test{Gulim} \test{GungSeo} \test{HeadLineA} \test{Nanum Brush Script} \test{Nanum Myeongjo} \test{Nanum Pen Script} \test{Noto Sans Korean} \test{PCMyungjo} \test{PilGi} \test{Adobe Gothic Std} \test{Adobe Myungjo Std} \test{Apple SD Gothic Neo} \test{AppleGothic} \test{AppleMyungjo} \end{tabular}  \end{document}


Let $(a,b)$ denote the GCD of $a$ and $b$, and let $[a,b]$ denote the LCM of $a$ and $b$. Prove $\frac{[a,b,c]^2}{[a,b][b,c][c,a]}=\frac{(a,b,c)^2}{(a,b)(b,c)(c,a)}$.


According to , when we compute the CNF of propositional logic, we substitute  $P \rightarrow Q$ with $\lnot P \vee Q$. However, it seems to that when $P$ is False and $Q$ is True, then  $P \rightarrow Q$ is not true but $\lnot P \vee Q$ is true, so those two don't seem equivalent.

I am studying entailment in classical first-order logic.  The Truth Table we have been presented with for the statement $(p \Rightarrow q)\;$ (a.k.a. '$p$ implies $q$') is: $$\begin{array}{|c|c|c|} \hline p&q&p\Rightarrow q\\ \hline T&T&T\\ T&F&F\\ F&T&T\\ F&F&T\\\hline \end{array}$$  I 'get' lines 1, 2, and 3, but I do not understand line 4.      Why is the statement $(p \Rightarrow q)$ True if both p and q are False?  We have also been told that $(p \Rightarrow q)$ is logically equivalent to $(~p || q)$ (that is $\lnot p \lor q$).  Stemming from my lack of understanding of line 4 of the Truth Table, I do not understand why this equivalence is accurate.       Administrative note. You may experience being directed here even though your question was actually about line 3 of the truth table instead. In that case, see the companion question  And even if your original worry was about line 4, it might be useful to skim the other question anyway; many of the answers to either question attempt to explain both lines.


Evaluate: $$\sum_{k=1}^\infty\left(\zeta(2)-\sum_{n=1}^k\frac1{n^2}\right)^2$$  Recognizing that $\zeta(2)-\sum_{n=1}^k\frac1{n^2}$ can be written as $\psi_1(1+k)$ where $\psi_1(z)$ is the , What remains to be done is to evaluate: $$\sum_{k=1}^\infty\psi_1^2(k+1)$$ Mathematica could not evaluate it in a closed form but the source assures that it exists.  If you liked this problem check out .

Applying the , I found: $$S=\displaystyle\sum_{k=1}^{\infty }\left(\Psi^{(1)}(k)\right)^2\lt\dfrac{2}{3}\pi^2$$ where $\Psi^{(1)}(k)$ is the polygamma function. Is it known any sharper bound for the sum $S$? Thanks.


I followed some instructions to uninstall Ubuntu on my HDD because I would like to reinstall Ubuntu on an external HDD.   I burned the image on a dvd. Unfortunately when starting the computer with the DVD, Windows was was completely uninstalled (I was trying to uninstall Ubuntu).  Therefore is it possible to go back and restore windows?

I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them.


What are the differences between idioms and proverbs?

I think I have a notion what is what but maybe you know a good definition what is what? For example "Hindsight is always 20:20" — is that a proverb or an idiom?


I study plain TEX and i need a way to draw a frame around each hbox and vbox in order to undestand how TEX works .. is it possible to do this? thanks !

I'd like to use a sequence of boxes to show how TeX works. I read some time ago that everything (or almost) in TeX are boxes.  So, how to show only the TeX boxes that surround each character, each line, each paragraph?  I'd like something similar to the image below, not fbox which contains blank space around it.


Is there some quality of the Collatz Conjecture that has made it so difficult to prove or disprove? Besides just using a computer to calculate lots and lots of values of $n$, of course.

I have been fascinated by the  since I first heard about it in high school.     Take any natural number $n$. If $n$ is even, divide it by $2$ to get $n / 2$, if $n$ is odd multiply it by $3$ and add $1$ to obtain $3n + 1$. Repeat the process indefinitely. The conjecture is that no matter what number you start with, you will always eventually reach $1$. [...]      Paul Erdős said about the Collatz conjecture: "Mathematics is not yet ready for such problems." He offered $500 USD for its solution.   How important do you consider the answer to this question to be? Why?  Would you speculate on what might have possessed Paul Erdős to make such an offer?  EDIT: Is there any reason to think that a proof of the Collatz Conjecture would be complex (like the FLT) rather than simple (like PRIMES is in P)?  And can this characterization of FLT vs. PRIMES is in P be made more specific than a bit-length comparison?


If the party rolls but our first man through is not first in order, may the other characters defer their spot to follow the tank in and proceed with their turns? Or would they just have to skip their turn? IF the PC skips theirs, do the mobs on the inside take turns to wait or lose theirs as there is no combat yet because the players have not entered the room yet? The squishy ones won’t enter first ahead of tanks ones...and funneling through a doorway to be cut off or overwhelmed would have the tanks and crowd control players enter in a prescribed prepared action/sequence. (Hopefully this makes some sense...)

In D&D 4e there was an option to Delay your initiative:     Perform your actions as desired and adjust your initiative to your new   position in the order.   Does this rule to change initiative order still exist in 5th edition? I cannot find it in the PHB.


Can we use "the" (definite article) with nouns to refer to a group of that name?  For example, on learnenglish.britishcouncil.org and  said:      to say something about all the things referred to by a noun:         The wolf is not really a dangerous animal (= Wolves are not really dangerous animals)     The kangaroo is found only in Australia (= Kangaroos are found only in Australia)     The heart pumps blood around the body. (= Hearts pump blood around bodies)      Is that really right?  Because I only saw in that site and I know that when "the" comes before adjectives it refers to a group of people.

My mother language does not have articles, so I still struggle to choose when to use the indefinte and definite article. The other day, I learned:   "The dog is an animal" is acceptable. "The iron is a metal" is not acceptable. (By the iron, I mean the metal, not the device.)   Is that true? If so, could anyone explain why?


I have referenced a tech report that has as its author a committee name with a number in it. In the rendered references, the number is removed. I want the number included, since otherwise the reference is erroneous.  My relevant bibliography settings:  \bibliographystyle{abbrv} \bibliography{sigproc}    The tech report entry in my bibliography file:  @techreport{KCS12,  author = {K-12 Computer Science Framework Steering Committee},  title = {K-12 Computer Science Framework},  year = {2016},  isbn = {978-1-4503-5278-9},  publisher = {ACM},  address = {New York, NY, USA}, }   The resulting reference text, formatting aside, looks like this:  K.-. C. S. F. S. Committee. K-12 computer science framework. Technical report, New York, NY, USA, 2016.  I want it to say "K-12 Computer Science Framework Steering Committee", like this:  K-12 Computer Science Framework Steering Committee. K-12 computer science framework. Technical report, New York, NY, USA, 2016.  Is this possible?

I want to list a company name in the author field of a bibliographic entry:  @book{CUDA,   author    = {NVIDIA Corporation},   title     = {NVIDIA CUDA Compute Unified Device Architecture Programming Guide},   publisher = {NVIDIA Corporation},   year      = {2007} }   But the entry keeps showing up "N. Corporation".  Is there a way to get the full author name to show up?  I'm currently using the siam BibTEX style.


My laptop Thinkpad Edge e320 got out of standby with bluetooth and wireless disabled. WiFi got enabled normally in unity but bluetooth says that "bluetooth is disabled by hardware switch".  There is no hw switch on my laptop. I tried:  # echo 1 > /sys/devices/platform/thinkpad_acpi/bluetooth_enable  bash: echo: write error: Operation not permitted   but as you see no results.  Fn-F9, which is radio control, does not work. Any help?

I'm trying to use the built-in bluetooth device of my Lenovo Thinkpad E320. It seems to be hard blocked, but i can't find any possibility to unblock it.  rfkill list returns:  0: tpacpi_bluetooth_sw: Bluetooth    Soft blocked: yes    Hard blocked:yes   cat /proc/acpi/ibm/bluetooth returns:  status:     disabled commands:   enable, disable   I tried to enable it by:   Pressing Fn+F9 (Radio controll) echo enable | tee /proc/acpi/ibm/bluetooth rfkill unblock bluetooth Trough the BIOS. But it's not mentioned at all   None of the actions influenced the ouputs above.


Note $\alpha$ and $\beta$ are complex numbers and $\overline{\alpha}$ is the conjugate of $\alpha$. I've tried using variations of the triangle inequality and I couldn't find anything to work.

This is the question I'm stumbling with:   When $|\alpha| < 1$ and $|\beta| < 1$, show that:  $$\left|\cfrac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| < 1$$    The chapter that contains this question contains (among others) the triangle inequalities:   $$\left||z_1| - |z_2|\right| \le |z_1 + z_2| \le |z_1| + |z_2| $$  I've tried to use the triangle inequalities to increase the dividend and/or decrease the divisor:  $$\left|\cfrac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| < \cfrac{|\alpha| +|\beta|}{\left|1-|\bar{\alpha}\beta|\right|}$$  But it's not clear if or why that would be smaller than one.  I've also tried to multiply the equation by the conjugated divisor $\cfrac{1-\alpha\bar{\beta}}{1-\alpha\bar{\beta}}$, which gives a real divisor, but the equation does not appear solvable.  Any hint would be much appreciated.


I am trying to solve an integral in $k$-space where I want to calculate the ratio of the average energy of an arbitrary electronic band ($E(k)=k^n)$ to the square of average group velocity of electrons($v_g   = k^{n-1})$ approximately in the form of this expression given by $$L=\frac{\frac{\sum_{\mathbf{k}}k^{n}f(k)}{\sum_{\mathbf{k}}f(k)}}{\left(\frac{\sum_{\mathbf{k}}k^{n-1}f(k)}{\sum_{\mathbf{k}}f(k)}\right)^2}\;.$$    Where $f(k)$ is the Fermi-Dirac distribution given by $f(k) = \frac{1}{1+e^{\frac{k^n}{k_B T}}}$ and $k_B$ is the Boltzmann constant and $T$ is the temperature.  Now, I want to do this for $d$-dimensions, so I convert $L$ sum to integral and it results in the expression  $$ L = \frac{\dfrac{\int_{0}^{\infty}k^{n}\left(\frac{1}{1+e^{\frac{k^n}{T}}}\right) \mathrm d^d k}{\int_{0}^{\infty}\left(\frac{1}{1+e^{\frac{k^n}{T}}}\right) \mathrm d^d k}}{\left(\dfrac{\int_{0}^{\infty}k^{n-1}\left(\frac{1}{1+e^{\frac{k^n}{T}}}\right)\mathrm d^d k}{\int_{0}^{\infty}\left(\frac{1}{1+e^{\frac{k^n}{T}}}\right) \mathrm d^d k}\right)^2} $$ where $ \mathrm d^dk  = \dfrac{\pi^{d/2}}{\Gamma(\frac{d}{2}+1)}k^{d-1} \mathrm dk $ is the volume element in $ d $-dimensional space.  I want to get a simple expression for $ L $ and how it depends on $ T, n $ and $ d $. Any physical/geometrical insight into this integral could also be helpful. What can I do in Mathematica to understand these terms? I specially want to understand what happens at very low and very high $T$.

I am trying to solve an integral in $k$-space where I want to calculate the ratio of the average energy of an arbitrary electronic band ($E(k)=k^n)$ to the square of average group velocity of electrons($v_g   = k^{n-1})$ approximately in the form of this expression given by $$L=\frac{\frac{\sum_{\mathbf{k}}k^{n}}{\sum_{\mathbf{k}}1}}{\left(\frac{\sum_{\mathbf{k}}k^{n-1}}{\sum_{\mathbf{k}}1}\right)^2}\;.$$  Now, I want to do this for $d$-dimensions, so I convert this sum to integral.  $$L=\frac{\dfrac{\int_{0}^{k_f}k^{n} d^d k}{\int_{0}^{k_f}1d^d k}}{\left(\dfrac{\int_{0}^{k_f}k^{n-1}d^d k}{\int_{0}^{k_f}1d^d k}\right)^2}$$ where $d^dk  = \dfrac{d \pi^{d/2}}{\Gamma(\frac{d}{2}+1)}k^{d-1}dk$ is the volume element in $d$-dimensional space.  I want to get a simple expression for $L$ and how it depends with $k_f,n$ and $d$. any physical insight into this integral could also be helpful.


In 2018, Skynet has Kyle Reese at the top of its kill list. Why?  I first thought it was because Kyle is John Connor's father. But only John and his mother know about that. (Even Kyle himself doesn't know ;)  This element is central to the plot of Terminator Salvation, but I can't remember it ever being explained or justified in any way in Salvation or the other movies.

In 2018, Kyle Reese (a normal civilian who wasn't part of Resistance) was on the top in the hit list of Skynet. It means that Skynet of that time had information from future about Kyle Reese being father of future leader of human resistance. Right?  Why didn't Skynet kill Kyle Reese instantly after his detection kicking John Connor out of existence?


when I try to compile   \documentclass[bibother]{asl} \begin{document} foo bar baz \end{document}   I get the error: "file 'asl.cls' not found". According to some postings it seems that asl.cls must be installed via running initexmf utility, e.g.,     initexmf --admin --update-fndb   but did not help me. I got the following error: 'Option --admin requires admin privileges' and if I do      initexmf --update-fndb   there are no errors, but I still can't compile tex code (same latex error).  Any suggestions?

I know how to define a package or a class, but how do I make it available (to myself) at all times?  Say I have the package file commonstuff.sty (or myprettyclass.cls), that I want to be able to include in any .tex file I create on my computer. Where do I put it? Do I need to run some installer on it, or is it enough to keep it in a certain folder?  Note: I know I can just place it in the same folder as the .tex file, but that's not what I'm after here. I'm looking for a way to "install" the package centrally on my computer.


I've noticed the use of "don't" in place of "doesn't" in upper class dialogue in Georgette Heyer's historical romances, which take place around the regency of George IV (1811-1820). For example, the following appeared in Friday's Child (2008):     ‘He don’t keep devilish good company,’ Mr Ringwood said stolidly.   I saw the same construct in The Moonstone (1868) by Wilkie Collins:     "It don't want a word, sir, from you."   While not correct in current usage, it appears that these phrases were correct at the time.  There are plenty of other posts about "don't" vs. "doesn't", but they seem to be about current usage, not historical usage. For example,  refers to the use of "don't" in place of "doesn't" as non-standard English.  I would like to know when and where (and ideally why) "don't" was considered correct in place of "doesn't" and how/when it was supplanted.

The following extract  from M-W Learner's Dictionary comments on the usage of "don't":           is occasionally used in American English speech and in historical writing as a contraction of does not (as in, "He don't know where he is going."), but this use is now considered improper and should be avoided. Remember that in modern speech and writing, don't cannot be used in the third person singular.       actually confirms the historical usage, but this ungrammatical expression appears to be relatively common still nowadays, and not only in spoken language.  Questions:   Was the usage of "don't" for the third singular person considered grammatical/correct in the past? If so,  When and why did the "does" form become considered to be the only correct expression?   Is its current usage still and AmE thing or is it used as nonstandard expression also in other English dialects?


When I go shopping for network infrastructure, I see lots of different kinds of racks available and I don't understand the difference between them. What are the different types of racks you would typically see in a datacentre?

I'm looking to purchase a rack/enclosure for some servers. As this is my first time shopping for this type of equipment, I need to know what to look for. I'm asking not only about how to buy the rack, but also what accessories will I need? What can I do without? What should I look for in terms of delivery and assembly? What do I need to prepare for in terms of power? Cooling inside the cabinet? Anything else I might be overlooking?  I'll share some back story in case anyone finds it helpful, but really generic answers for anyone who is shopping for rack equipment is helpful.  Where I'm at we used to have mainly tower servers... even a number of glorified desktops that lived in our server room. We do have a couple two-poster racks for switches, but everything sits in a wooden bench made of 2x4's and plywood that's been here much longer than I have. Over the last three years I've been able to virtualize the desktop "servers" and as items have come up for refresh I've purchased rackmount servers, with rails. I put the servers on their sides in the old space, and set the rails aside in the store room, biding my time.   We are now (at last!) to the point where in the next six months I'll be down to only a single tower server, and it just happens to be 19 inches high, so I'm thinking 1U shelf. Everything else except the the UPS equipment should mount in a rack. In anticipation of that event, I'm looking to spec out a server rack enclosure to purchase and install this summer. I want to be get preliminary shopping done over the next month or two so I can get it put into the budget for next fiscal year, in time to actually execute the project late this summer.   For size, we should fit comfortably inside a single 42U height-wise, even including mounting our existing switches, so I'm pretty sure one rack will handle it. ... I just need to know what to look for in that rack.


As far as I'm aware a probability distribution only requires that some function $p(x)$ is non-negative over the reals, and integrates to unity.   If this is all it takes to define a probability distribution is it valid of me to normalise a likelihood function and call it a probability.   I have looked at the example from here:    where the integral of the given Bernoulli likelihood function is given to be 1/2.   If I then take this knowledge and divide this parameter (the 1/2 value) through my previous integral this will ensure that the likelihood function integrates to unity. However since the requirements for a valid probability distribution seem so relaxed (non-negative and integrate to unity), does this not mean I'm now dealing with a justifiably valid probability distribution? Or is there something else that I'm missing?

What is the reason that a likelihood function is not a pdf (probability density function)?


I have some issues with my SEO. The goal of the web site I am creating is to display all of my products by category and then by sub-category. My question is: if I display my products in archive category pages and in archive subcategory pages, will google see it duplicate content? Please excuse me for my English. Thanks in advance !

This is a general, community wiki question regarding duplicate content.  If your question was closed as a duplicate of this question and you feel that the information provided here does not provide a sufficient answer, please open a discussion on .     What does Google consider to be duplicate content? Will the way I am presenting my content result in a duplicate content penalty? How can I avoid having my site's content treated as duplicate content?


I need know if wget is a default command in Windows 10, because I want to run a .bat file in some customer's computers to run a script. I would prefer not to install wget separately, just use it.  So, is it available by default in Windows 10?

I know I can download and install the aformentioned library (wget for Windows), but my question is this:   In Windows PowerShell, is there a native alternative to wget?  I need wget simply to retrieve a file from a given URL with HTTP GET. For instance:  wget http://www.google.com/


I am using a cloud server of godaddy & I don't have root password. My master user has root access through sudo. I was trying to create another user and set permission for a specific directory. I've created a news user testuser & created a new directory named "test" under var/www/html/. I was trying to set permission:  chmod -R 0777 /var/www/html/test   but unfortunately i press enter before mentioning the directory. That means I just change the whole permission  chmod -R 0777 /   Now, unfortunately I don't have root password & sudo, su are not working anymore. changing permission is showing  Operation not permitted   and sudo is showing the following error:  "effective uid is not 0, is sudo installed setuid root?"   I've several project live on the server. is there any way to restore the user permission. I don't want to reinstall the whole cent OS.  I've checked the ls -l and all permission are set to drwxrwxrwx  Please help me solve the problem.

This is a  about File Permission and Why 777 is "destructive".   I'm not asking how to fix this problem, as there are a ton of references of that already on Server Fault (reinstall OS). Why does it do anything destructive at all?  If you've ever ran this command you pretty much immediately destroy your operating system. I'm not clear why removing restrictions has any impact on existing processes. For example, if I don't have read access to something and after a quick mistype in the terminal suddenly I now have access well... why does that cause Linux to break?


I moved to close this. The question has been aksed and answered before:  Suppose you have a Poisson process with intensity $\lambda$, and let $N(t)$ be the number of events that have occurred at time $t$. I can prove, and have seen many references on the internet, for the fact that $\mathbb{E}[N(t)] = \lambda t.$ I'm trying to find a proof for the fact that $$\lim_{t \to \infty} \frac{N(t)}{t} = \lambda$ almost surely. I saw this once, but cannot find a good reference.

Let $N = \{N(t) \}_{t\geq 0 }$ be a Poisson process. I already know that $N(t)- \lambda t$ is a martingale where $\mathbb{E} [ N(t) ] = \lambda t$.   I want to prove that $$ \frac{N(t)}{t} \rightarrow \lambda, \quad t \rightarrow \infty \quad \text{ a.s.}. $$  To prove this I received a hint that I should use the martingale law of large numbers which states that:  Theorem: (Martingale LLN)  Let $S= (S_n = \sum_{k=1}^n X_k)_{n=1,2,\ldots}$ be a martingale with respect to the filtration $(\mathcal{F}_n)_{n=1,2,\ldots}$. Then $\sum_{k=1}^n X_k/k$ converges almost surely on the set $\left\{ \sum_{k=1}^\infty k^{-2} \mathbb{E}\left[ X_k^2 \mid \mathcal{F}_{k-1} \right] < \infty \right\}$. Hence $S_n/n \rightarrow 0$ a.s. on the same set.  Now to use this theorem I think I need to use Doob-Meyer to decompose $N(t)$ as the sum of a martingale and an increasing process. Which would be the martingale $M(t) = N(t) - \lambda t$ and increasing process $A(t) = \lambda t$. But how is $M(t)$ the sum of a martingale? And I do not know how this exactly relates to the thing I have to prove. Thanks for any help.


If $a,b,c,d,e$ are positive reals, such that $a+b+c+d+e=8$ and $a^2+b^2+c^2+d^2+e^2=16$,then the range of $e$ is?  I dont even know how to proceed with problems like these. I have an idea that $A.M-G.M$ might be helpful. Is it true? If yes, then how to go about it?

$a,b,c,d,e$ are positive real numbers such that $a+b+c+d+e=8$ and $a^2+b^2+c^2+d^2+e^2=16$, find the range of $e$.   My book tells me to use tchebycheff's inequality $$\left(\frac{a+b+c+d}{4}\right)^2\le \frac{a^2+b^2+c^2+d^2}{4}$$  But this not the Chebyshev's inequality given in wikipedia. Can someone state the actual name of the inequality so I can read more about it?  (I got $e\in\left[0,\frac{16}{5}\right]$ using the inequality)


I have read what KL Divergence is about: assess differences in probability distributions between two sets.   I have also read, and digested, that it is emphatically not a true metric because of asymmetry.   Now I have been wanting to ask: I cannot find a simple textbook example of KL Divergence. Can someone point to me how it is used and demonstrated? Just to its main intuitive insights? Say for example, two $P$ and $Q$ that are of discrete distributions, or from the very simple distributions like uniform, gaussian, etc.   I would appreciate your contributions.

I have learned about the intuition behind the KL Divergence as how much a model distribution function differs from the theoretical/true distribution of the data. The source I am reading goes on to say that the intuitive understanding of 'distance' between these two distributions is helpful, but should not be taken literally because for two distributions $P$ and $Q$, the KL Divergence is not symmetric in $P$ and $Q$.   I am not sure how to understand the last statement, or is this where the intuition of 'distance' breaks down?   I would appreciate a simple, but insightful example.


I have heard in a talk given at the Fermilab (on Youtube) that we typically detect a neutrino burst from a core-collapse supernova CC SNR explosion 2 hours before we detect its electromagnetic radiation. When the question was raised about whether this violates the principle that nothing can travel faster than light, the answer given by the speaker was that when the collapse is happening, the neutrinos are expelled, whereas light from the supernova comes AFTER the explosion, not during the collapse. But doesn't it take about 1 second for the iron core to collapse completely? Why is there a 2 hours difference between our receiving the neutrino burst and light from the explosion?  Thank you  P.S. I read around and found that the reason is because light has to travel a lot of distance within the star which "slows" it down, however, as mentioned earlier, it takes only 1 second for the entire iron core to collapse, right?

A while back I read about the super Kamiokande detector detected a large neutrino flux and then several hours later a supernova was seen. Anyone know of this with sources? I don't recall the source at the moment.


recently i am trying to build an application that can open existing SQLite database using Android Studio, and i am still a newbie on android programming...when i was searching for the way to open the database, i found this link :    btw i still don't know how to implement the code on that link into my project...is there anyone here who is kind enough to help make the examples (or at least give some direction) about how to use it? Just a simple example is really enough for me...thx before :)

If your application requires a database and it comes with built in data, what is the best way to ship that application? Should I:   Precreate the SQLite database and include it in the .apk? Include the SQL commands with the application and have it create the database and insert the data on first use?   The drawbacks I see are:   Possible SQLite version mismatches might cause problems and I currently don't know where the database should go and how to access it. It may take a really long time to create and populate the database on the device.   Any suggestions? Pointers to the documentation regarding any issues would be greatly appreciated.


Let's say I want to reference a member in a question. The member would probably be a significant contributor to the field or a known expert in the field relating to my specific question, so they might be interested in joining in on the problem to find an answer. Good for them, good for me. Can this be done currently in SO? Perhaps using the @ in front of their name.  There is potential for abuse and members could become annoyed by such tags. However, the notifications could be separate from the inbox, or filtered out if desired. This feature will appeal to members who recognize that a tag to an expert (with a large reputation) might not be as effective as a tag to an expert of a field with a much smaller scope. The feature will draw out those members and could further the richness of answers on SO. And the tags could be required to be added separate from the question (so as not to distract from the question itself), limited to only a few in number, and an initial rep requirement before the feature can be used.

Possible Duplicates:             There come times where you have an advanced question about a platform (not a problem/error). Typical developers watching that tag won't be able to answer it, or the few expert developers might miss it.  Example: C# expert , VSTO expert , Symbian expert   Some experts like Jon Skeet / Marc Gravell watch their respective tags, but that's no guarantee that your tough question will be seen by them.  So a way to request a specific user to answer a question will be useful. An implementation:   Every question has "inform" link below it Clicking "inform" asks you for a specific user ID, eg. "23354" for Marc Marc then sees an alert on his Recent Activity page. Marc answers the tough question, and helps devs when they need him most


Is there already a standard way for introducing syntax highlighting for a language (and tag) that did not previously have it?  I would like to have syntax highlighting for the  tag, since code is sometimes hard to read without it.

I noticed that sometimes my code gets highlighted in different colors when rendered.   What is syntax highlighting? How does it work? Why isn't my code being highlighted correctly? How do I report a bug or request a new language? How do I use syntax highlighting? What languages are currently available on Stack Exchange?


I just recovered from Nvidia driver failure after an update was pushed a few hours ago from Xedger ppa. There is not much insight from what I can search from the web. Currently, my system is running on Nouveau but this means a no-go for steam games.....  my gpu is GTX 650 TI  I'm still fairly new to Linux and I'm not sure what is the next step. Any suggestions? Should I wait for some time before trying to install it again?

After several years of using dual boot (windows to play and Ubuntu to work) I decided to just use ubuntu, but I have a problem after installing nvidia-drivers 331.20 and rebooting the screen is black, I have seen many solutions for this problem, in particular I have run the following command sudo apt-get purge nvidia* then sudo reboot after which I am ready to use ubuntu.  How can I fix this problem since I really want to play but the latest drivers (331.20) are the ones that are optimized for the 700 series.


Consider $a$ and $b$, both positive integers. Is it true that $a^a$ divides $b^b$ implies $a$ divides $b$?   I can't seem to figure out this proof. My intuition is to use the fundamental theorem of arithmetic to break each number into its prime components, however I haven't been able to come up with a solution. Any help would be appreciated.

I'm not sure I've got this right. When proving $a^n \mid b^n \Rightarrow a \mid b$, can we do this indirectly? In short,  "Suppose $a$ does not divide $b$, this implies that $a^n$ does not divide $b^n$. But $a^n \mid b^n$, hence $a$ divides $b$."  How about $n^n \mid m^m \Rightarrow n \mid m$? Can we do this the same way?


How do I figure out what version of Ubuntu I have?  Is there a command I can use in terminal?  Thank you for any help.  I am an extreme newbie.

I installed some version of Ubuntu on my VMware, but I don't know what version exactly it is. How can I find it out?


Situation 1:  A regular $n$-gon is inscribed in a circle. As $n$ increases without bound, the area of the $n$-gon approaches the area of the circle and the perimeter of the $n$-gon approaches the circumference of the circle.  Situation 2: Consider a $1$ by $1$ square with one side labeled South and the other labeled North East and West as in a map.  A path is constructed from the Southwest corner to the Northeast corner.  If the path runs east on the south side for a distance $\frac{1}{2^n}$, then goes north for the same distance, then east again for distance $\frac{1}{2^n}$. And so on.  Then the total length of the path is $2$  As $n$ increases without bound the area under the path and above the south side of the square approaches the area under the diagonal, but the length of the path remains $2$ and does not approach the length of the diagonal.  Why is there a difference?

What is wrong with this proof?    Is $\pi=4?$


I have an MS Word document on Google Drive.  I want to edit this file and save it (overwrite the file).  But every time it gets opened by Google Docs a new Google docs document is created. Is there a way to just edit and save it? I could not find a save item on the menu.

So, I installed "Backup and Sync" (the replacement for deprecated "Google Drive for PC") and created an MS Word Doc in the drive folder. I understand that I can edit this word doc from any PC where I have set up and synced my docs using "Backup and Sync".  But what if I want to edit this word doc (saved in my Google Drive from any other PCs that don't have "Backup and Sync"?  I tried to open the doc using online application. It made a copy of the document and changes were saved to the copy only. Is there any way to sync back those changes to the original word document?


Let $m, n$ be nonzero natural numbers. Define $K_{mn}$ to be the complete bipartite graph, which has vertex set $V = V_0 \cup V_1$ such that $ |V_0| = m, |V_1| = n, V_0 \cap V_1 = \emptyset$, and edge set consisting of all edges {$a, b$} with $a \in V_0, b \in V_1$.   a) How many edges does $K_{mn}$ have?  b) What is the average degree of $K_{mn}$?  c) For which values of $m, n$ does $K_{mn}$ have an Euler circuit?  Can someone show me how to solve these? For $K_{mn}$ to be the complete bipartite graph.

This is such a hard question to get my head around. Can anyone help solve this?


I've been trying to install the latest Kubuntu from USB flash drive on my PC. Once I choose the default installation at the boot menu I end up with an error:  [   4.347654] nouveau 0000:01:00.0 bus: MMIO write of 80000102 FAULT at 10eb14 [IBUS]   The USB drive is fine; the Kubuntu installation menu shows up properly on laptop.  From what I searched, it has something to do with nvidia drivers, but I haven't found any proper explanation of how to fix this. Got latest drivers on NVIDIA GeForce GTX 970.  unetbootin menu:    error content:

I just ordered the Nvidia GTX card. I have a dilemma, though. Should I keep using the driver which is available in "additional drivers" in Ubuntu, or should I install the driver from the Nvidia site?  So which driver is the best for me?


For a few days now I've been looking for a solution to display UTF8 on my webpage.  The character currently causing trouble is į (unicode: \u012f  decimal: 303) however, there are over 10,000 records in my database and I cannot guarantee that all others are displaying correctly. So I'm looking for a solution that should cover all characters.  The į is displaying as a ? in the HTML.  My setup is a HTML page, which uses AJAX to send a request to a PHP file. The PHP then queries a MYSQL database to find a specific entry,  it then takes a lithuanian word from that entry and echoes it as a response to AJAX. Back in the Javascript, the response is set as the innerHTML of a HTML element. This current setup is not using JQuery.  Below is my progress on attempting to fix the issue.  First, I verified that all files I was working with are correctly encoded to UTF8, not UTF8BOM.  Then I opened the MYSQL database in phpMyAdmin to view the entries. Seeing characters replaced with ? in the entries, I done some research and found the database had the wrong collation. After changing the collation to utf8_general_ci for the database/table nothing changed, so I looked into it further and found that changing it for individual columns of a table was another solution. This worked and my database is now displaying the characters correctly.  Next the character š (unicode: \u0161   decimal: 353) would not display in my webpage,  I fixed this by using the following code in PHP which I found on stackoverflow.  function encode_string($string){      $encoded = "";      for ($n=0;$n<strlen($string);$n++){          $check = htmlentities($string[$n],ENT_QUOTES);         $string[$n] == $check ? $encoded .= "&#".ord($string[$n]).";" : $encoded .= $check;      }      return $encoded;  }    I can't say I completely understand this code but it caused the character š to display correctly when it got to my HTML. However this did not work for the character į.  I have also tried $conn->set_charset('utf8'); to set the connection to use utf8 however this resulted in į being displayed as Ä¯ instead, same result for $conn->query("SET NAMES UTF8;");  I have found that hardcoding the į into the Javascript or PHP, allow it to be sent back and displayed correctly, for example echo "į"; works. So I believe the issue may be related to the database or in the PHP before the echo. However I don't have the knowledge to identify the problem.  Here is my php code below:  <?php header('Content-Type: text/html charset=utf-8'); //Connection to database is made. Referred to as $conn  $sql = "SELECT * FROM Words"; $result = $conn->query($sql);  if ($result->num_rows > 0) {      //Loop through the results to find a word with the status of 1     while($row = $result->fetch_assoc()) {          $status = $row["status"];          if($status == 1){             //respond to AJAX with the word              $ltword = trim($row["lt"]);               echo utf8_encode(encode_string($ltword));             //Has also been tested as              //echo encode_string($ltword);             //with no noticeable difference.               break;         }     }  }   function encode_string($string){      $encoded = "";      for ($n=0;$n<strlen($string);$n++){          $check = htmlentities($string[$n],ENT_QUOTES);         $string[$n] == $check ? $encoded .= "&#".ord($string[$n]).";" : $encoded .= $check;      }      return $encoded;  }  ?>   At the core my question is, given my current setup,  how do I correctly get an encoded UTF8 character from my database to display on my webpage?  EDIT: The mb_check_encoding() function of php, verifies that the data received from the database is valid utf8.  php.ini is using utf8 as it's default charset.  Using $conn->character_set_name(); returns the result latin1. Using $conn->set_charset("utf8"); causes it return utf8, however į is then displayed as Ä¯ which is still incorrect.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


my table char set is utf8 and it's collation is utf8.now i have this code:     $mysqli = new mysqli("localhost", "root", "", "Amoozeshgah");              if (mysqli_connect_errno()) {                   printf("Connect failed: %s\n", mysqli_connect_error());              }           if (!$mysqli->set_charset("utf8")) {     printf("Error loading character set utf8: %s\n", $mysqli->error); } else {     printf("Current character set: %s\n", $mysqli->character_set_name()); }         mysql_set_charset('utf8');             if ($stmt = $mysqli->prepare("SELECT About_Title FROM Tbl_About WHERE About_Id=?")) {                 $city = 8;                 /* bind parameters for markers */                 $stmt->bind_param("s", $city);                /* execute query */                 $stmt->execute();                 /* bind result variables */                    $result = $stmt->get_result();               /* fetch value */             while ($myrow = $result->fetch_assoc()) {          // use your $myrow array as you would with any other fetch         printf("%s is in district %s\n", $city, $myrow['About_Title']);         print("shod");      }   but out put is:  Current character set: utf8 8 is in district Ù†ØªÙ…Ù†ØªØ´Ø³ shod   what can i do? Edit: i replaced:  if (!$mysqli->set_charset("utf8")) {         printf("Error loading character set utf8: %s\n", $mysqli->error);     } else {         printf("Current character set: %s\n", $mysqli->character_set_name());     }             mysql_set_charset('utf8');   with   $mysqli->set_charset("utf8")   but no difference.


From Lagranges'celebrated four-squares theorem we know that any number is the sum of four squares ( not necessarily nonzero and distinct). But it's an existence theorem and gives no idea of how to generate this expression. In a similar vein, one of Fermat's theorem states that a prime of form 4k + 1 is the sum of two squares. But how do we go about finding the pair of squares ? On a more general scale, given some number N expressible as a sum of two squares a^2 + b^2, what is the method for computing pair(s) (a, b) ?

The web is littered with any number of pages () giving an existence and uniqueness proof that a pair of squares can be found summing to primes congruent to 1 mod 4 (and also that there are no such pairs for primes congruent to 3 mod 4).  However, none of the stuff I've read on the topic offers any help with actually efficiently finding (ie other than a straight search up to sqrt(p)) the concrete values of such squares.  What's the best way to actually find them ?


I realize this question has been asked before, but I'm still confused about the answers, so bare with me.  I was asked this question on an Exam recently, and tried to prove it by constructing the graph: "Start with a vertex $v_0$ which is the only vertex with degree 1, then it's neighbour $v_1$ must have degree at least 2, such that it must be connected to a vertex $v_2$ and $v_2$ $\ne$ $v_0$, and now $v_2$ having degree 2, either has an edge back to $v_1$, forming a cycle or is connected to another vertex $v_3$, and giving that the number of vertices is n, vertex $v_n$ must be connected to a vertex belonging to the set S, such that S={$v_1$, $v_2$, ........, $v_{n-1}$}, thus, the graph must have a cycle". My proof was dismissed as it didn't cover all possibilities, and i was told to never construct graphs in problems, always destruct them, which didn't make any sense, and still doesn't.  What irritated me even more was that the proof that got the highest points, started with, and i quote: "Suppose that g is a connected acyclic graph, which has exactly 1 vertex of degree 1, so by definition of a tree, g must be a tree". Completely wrong, since a tree must have 2 vertices of degree 1. Which brings me to my second point. I saw other proofs that start with "Let G be a graph with exactly 1 vertex of degree 1, and let's assume it's acyclic" and then they go on to show that it contradicts with a tree having the longest path containing 2 vertices of degree 1. Now if we assume it's acyclic, doesn't that straight away contradict the theorem that says "A graph with 1 vertex of degree 1 must have a cycle" and we're done, nothing more to proof.   One more proof i managed to come up with is as follows: "Since every vertex in this graph G has degree at least 2, then there must be 2 distinct paths between any 2 vertices in G, except for $v_0$ ($v_0$ being the only vertex with degree 1), and thus the graph must contain a cycle.  I'm really confused about this question, it looks straight forward, but clearly not, apologies for ranting a bit, it's just frustrating. I hope somebody can clear the confusion.

Could anyone give a counter example for that theorem :     A graph G has exactly one vertex of degree $1$, then it contains a cycle.   I am so confused. I wonder that may I give a counter example which considers trees.


Voldemort clearly had a good thing going for him when Fudge was in denial about his return. This allowed him free reign to move, manipulate and organise without Ministry interference. In his pursuit of the prophecy, Voldemort purposefully crafted his plan in such a way as to protect that secret. By operating at a distance he could get what he wanted by forcing Harry to take it for him. The risk of disclosure here is next to nil. The idea that Voldemort might show up was so fanciful that Bellatrix laughed at the suggestion.     "Why couldn’t he come and get it himself?”   “Get it himself?” shrieked Bellatrix on a cackle of mad laughter. “The Dark Lord, walk into the Ministry of Magic, when they are so sweetly ignoring his return? The Dark Lord, reveal himself to the Aurors, when at the moment they are wasting their time on my dear cousin?”   (Order Of the Phoenix, Chapter 35, Beyond the Veil)   This makes it all the more surprising when Voldemort does show up in the Atrium a short while later. The Ministry find him and his return is revealed.  I'd understand his thinking if he wanted to bypass Harry altogether, sneak into the Ministry using stealth (who'd doubt that he'd be capable of this?) and take it himself in the middle of the night, causing the minimum of fuss.  I'd understand his thinking too if he'd stuck with his original plan - make Harry take the prophecy, entrust the Death Eaters to collect it and keep his distance.  What I don't understand is encouraging a fight with Harry and co followed by a personal appearance that blows his cover.  Why did he pursue this course of action?  (Related questions  and  in my view don't fully address Voldemort's stated desire to remain undercover).

During Order of the Phoenix, Voldemort tries his best to lure Harry to the Ministry so that Harry retrieves the prophecy for him. In the aftermath, while Harry follows Bellatrix towards the exit, he raises a valid question:  ”Why couldn’t he (Voldemort) come and get it (the prophecy) himself?”  This is a valid question, the prophecy is labeled as referring to the Dark Lord and maybe Harry Potter. Only those mentioned can retrieve the prophecy, so Voldemort should have been able to get it, assuming he is the Dark Lord of the prophecy. Bellatrix gives a good answer:  “Get it himself?” shrieked Bellatrix on a cackle of mad laughter. “The Dark Lord, walk into the Ministry of Magic, when they are so sweetly ignoring his return? The Dark Lord, reveal himself to the Aurors, when at the moment they are wasting their time on my dear cousin?”  Despite the cackle of mad laughter, the reasoning is sound, Voldemort didn't want to reveal himself. Yet he does exactly that when he appears in the Ministry and is seen by the Minister himself, and he exposes himself for no gain. Bellatrix may or may not have been able to escape without his help, but he couldn't know that before he came, and his other followers that were captured were freed again a few months later, so it wouldn't have mattered much, he would have freed her, too. So why did he go to the Ministry and reveal himself?


Let $S$ be a subspace of an n-dimensional vector space $V$. Prove that $dim(S)\leq\ n$.  Let $B = \{v_1, v_2, v_3,...v_n\}$ be the basis set for vector space $V$.   Let $B_s = \{v_1, v_2, v_3,...v_n, v_{n+1}\}$ be the basis set for the subspace $S$.  Then $span(S) > V$ because $B_s$ has more vectors than $B$ and $span(S)$ can potentially reach a vector that is outside of the vector space $V$. But this cannot be the case because $S$ is a subset of $V$. Hence it must be the case that $B_s \leq\ B$ and therefore, $dim(S) \leq\ n$.  Note: If the proof is incorrect can you point out where I went wrong?

Suppose $W$ is a subspace of the finite-dimensional vector space $V$ and $\dim W = \dim V=n$  Let $\{\overrightarrow w_1,\ldots,\overrightarrow w_n\}$ be a basis for $W$ and $\{\overrightarrow v_1,\ldots,\overrightarrow v_n\}$ be a basis for $V$.  The set $\{\overrightarrow w_1,\ldots,\overrightarrow w_n,\overrightarrow v_1,\ldots,\overrightarrow v_n\}$ still spans $W$. Since $W$ is a subspace of $V$, $W\subset V$ and all the $w_i$'s can be written in terms of $\{ \overrightarrow v_{1},\ldots,\overrightarrow v_n\}$.  $\therefore$ We can remove one by one all the $w_i$'s from the set $\{\overrightarrow w_{1},\ldots,\overrightarrow w_n,\overrightarrow v_1,\ldots,\overrightarrow v_n\}$ while still having it span $W$, which leaves us with the set $\{\overrightarrow v_1,\ldots,\overrightarrow v_n\}$. We know it to be linearly independent since it is a basis for $V$. Therefore the basis of $V$ is also a basis of $W$. From there on, it is trivial to prove double inclusion $W\subset V$ and $V\subset W$ which gives us $W=V$.  Is my approach correct?


I was looking at  to find his posts on each pre-graduation meta site about the design choices. However, his Top Questions section includes no meta posts. His activity tab showed some meta activity, but I believe that may also be incomplete. Where can I access his top Meta posts?

When I look at my own , I can see all my top questions and answers by their score on there. Even MSO is there. But some of my best posts are on . Looking at others, it seems all per-site Meta's are not included. Why are they excluded from this? And if there isn't a reason why, can we have them added? Some of the best answers and questions users post are on their own sites meta, and they need some time to shine.


Does there exist a real-valued function of a real variable which is continuous at every rational point and discontinuous at every irrational point?

I have a question about subsets $$ A \subseteq \mathbb R $$ for which there exists a function $$f : \mathbb R \to \mathbb R$$ such that the set of continuity points of $f$ is $A$. Can I characterize this kind of sets? In a topological,measurable or in some way? For example, does there exist a function continuous on $\mathbb Q$ and discontinuous on the irrationals?


Can anyone please tell me if there is any need to backshift the tense?  Here is the example:     Yesterday, as a consultant I went to meet my friend Peter who has been found guilty of fraud. He claimed that he is/was not guilty of any fraud.   Can I use the 'simple present' too?

I know the past tense carries the past tense in every dependent clause, but referring specifically to places or to things that are eternal, like the Earth, seems a bit weird and therefore we sometimes (I believe incorrectly) say     He didn't know that New Jersey was actually on the East Coast.   Because it still is. Or     He thought the Earth was round.   So is it square now?  Logically speaking, would you consider the use of past tense here a bit confusing in a day-to-day speech in these examples? Would you instinctively opt for using the present tense?


I have watched . The idea is that gravity pulling it is just lots of mass bending space-time, and natural direction of movement becomes moving towards the mass, and since we have earth already there we get to sit on top.  This got me thinking what about lack of matter to bend space-time, could it be that space-time bends in the 'opposite' 'direction' like create a slope where everything's natural movement direction is away. Could this be used to explain dark energy's anti-gravity properties?   EDIT: Duplicate is about dark matter while this one is about dark energy that are two completely different things...

Could Dark Matter actually just be spacetime with curvature "leftovers" from the big bang or the inflationary epoch?


Here is the complete mail.log  Jul 14 16:48:20 rezocoquin sendmail[5861]: v6EEmKCT005861: from=www-data, size=194, class=0, nrcpts=1, msgid=<201707141448.v6EEmKCT005861@rezocoquin.com>, relay=www-data@localhost Jul 14 16:48:20 rezocoquin sm-mta[5863]: v6EEmKvf005863: from=<www-data@rezocoquin.com>, size=419, class=0, nrcpts=1, msgid=<201707141448.v6EEmKCT005861@rezocoquin.com>, proto=ESMTP, daemon=MTA-v4, relay=rezocoquin.com [127.0.0.1] Jul 14 16:48:20 rezocoquin sendmail[5861]: v6EEmKCT005861: to=yarekc@gmail.com, ctladdr=www-data (33/33), delay=00:00:00, xdelay=00:00:00, mailer=relay, pri=30194, relay=[127.0.0.1] [127.0.0.1], dsn=2.0.0, stat=Sent (v6EEmKvf005863 Message accepted$ Jul 14 16:48:20 rezocoquin sm-mta[5868]: STARTTLS=client, relay=gmail-smtp-in.l.google.com., version=TLSv1/SSLv3, verify=FAIL, cipher=ECDHE-RSA-AES128-GCM-SHA256, bits=128/128 Jul 14 16:48:20 rezocoquin sm-mta[5868]: v6EEmKvf005863: to=<yarekc@gmail.com>, ctladdr=<www-data@rezocoquin.com> (33/33), delay=00:00:00, xdelay=00:00:00, mailer=esmtp, pri=120419, relay=gmail-smtp-in.l.google.com. [IPv6:2a00:1450:400c:c07::1b], d$ Jul 14 16:48:20 rezocoquin sm-mta[5868]: v6EEmKvf005863: v6EEmKvf005868: DSN: Service unavailable Jul 14 16:48:21 rezocoquin sm-mta[5868]: v6EEmKvf005868: to=<www-data@rezocoquin.com>, delay=00:00:01, xdelay=00:00:00, mailer=local, pri=30000, dsn=2.0.0, stat=Sent   -> No email is received: any idea ?

I've been having trouble getting my server to send email and I haven't for the life of me figured out how to fix it. If anyone could give me some simple pointers, that would be muchly appreciated!  May 19 15:36:03 ubuntu-12 sm-mta[2484]: s4JFa3jp002484: from=<www-data@ubuntu-12.04-     production>, size=412, class=0, nrcpts=1, msgid=<201405191535.s4JFZw4c002483@ubuntu-12.04-  production>, proto=ESMTP, daemon=MTA-v4, relay=ip6-localhost [127.0.0.1] May 19 15:36:03 ubuntu-12 sendmail[2483]: s4JFZw4c002483: to=myname@mycompany.com, ctladdr=www-data (33/33), delay=00:00:05, xdelay=00:00:05, mailer=relay, pri=30123, relay=[127.0.0.1] [127.0.0.1], dsn=2.0.0, stat=Sent (s4JFa3jp002484 Message accepted for delivery) May 19 15:36:03 ubuntu-12 sm-mta[2487]: s4JFa3jp002484: to=<myname@mycompany.com>, ctladdr=<www-data@ubuntu-12.04-production> (33/33), delay=00:00:00, xdelay=00:00:00, mailer=esmtp, pri=120412, relay=mailserver.mycompany.com. [213.171.216.115], dsn=5.0.0, stat=Service unavaila$ May 19 15:36:03 ubuntu-12 sm-mta[2487]: s4JFa3jp002484: s4JFa3jp002487: DSN: Service unavailable May 19 15:36:03 ubuntu-12 sm-mta[2487]: s4JFa3jp002487: to=<www-data@ubuntu-12.04-production>, delay=00:00:00, xdelay=00:00:00, mailer=local, pri=30000, dsn=2.0.0, stat=Sent


suppose a body is moving back and forth about a mean position in irregular intervals of time. Is this motion is an oscillation or not?

For example, if a pendulum system in the real world oscillates its amplitude and period will eventually decrease. Does that still count as a periodic motion? Since the motion doesn't have the same amplitude at equal time periods.


import java.util.ArrayList; import javax.swing.*; import java.awt.*; import java.io.*;  public class Login  {     private JFrame theWind;     //private JPanel thePane;     private JLabel title;     private JButton ok;     //private JButton cancel;     private JTextField theText;      public Login(){     }      public void open(){         theWind = new JFrame("Login");         title = new JLabel("Please Enter Your Voter ID:");         ok = new JButton("OK");         //cancel = new JButton("Cancel");         theText = new JTextField();         theWind.setLayout(new BorderLayout());         theWind.add(title,BorderLayout.NORTH);         theWind.add(theText,BorderLayout.CENTER);         theWind.add(ok,BorderLayout.SOUTH);          theWind.pack();          theWind.setVisible(true);     } }   I apologize this isn't the complete programs so some of the variables are not used yet. So when i click a button on another JFrame, this JFrame is supposed to open up. The problem occurs when it hits the line that sets the value for the Jframe. (the code below).  theWind = new JFrame("Login");   I get a run time error claiming a  NullPointerException on that line. I checked to see if the the JFrame was declared, and it is.  This is weird considering that my other JFrame runs fine, and I have all of the necessary java libraries imported. I have a JPanel and a JButton commented because I was trying to figure out if those things were messing up with the borderlayout but I don't think that's the problem. It's a relatively short code and I'm really stumped on this. I would be glad to receive any inputs/advice. thank you!

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I tried all option whatever is available whether it's for lenovo or Hp but my wifi is not working on my laptop neither is it working on Ubuntu mounted on vm or installed as dual boot with Windows 10.  My secure boot is disabled and OS is loaded in UEFI mode.  I tried both 18.04 and 19.04 version of Ubuntu but same result   I tried the option given here as answer but it didn't work at all.

We just bought a Lenovo  (which is supposed to have the Intel 8265 for wireless). This laptop was bought in part because it is certified to run Ubuntu and as such to me at least it would make sense for things to work out of the box... but no such luck.  First, I installed Ubuntu 17.10 and after installation realised Wi-Fi was not working. I also tried Ubuntu 16.04 from a USB drive since that is the version of Ubuntu it is certified for, but no luck there either.  The wireless chip is not detected by lshw (or even lspci by the looks of it), ip link does not show a wireless interface, and the iwlwifi kernel module is not loaded at boot (I can load this myself using modprobe iwlwifi but this does not make Wi-Fi work). I think it is a combined Wi-Fi/Bluetooth chip, and Bluetooth does appear to work (or at least Bluetooth shows up in Gnome and rfkill list).  modinfo iwlwifi | grep 8265 shows me a file ending in -34 is supposedly loaded but only a file ending in -33 (and some other lower numbers) is present in /lib/firmware, if that helps).  I have also installed the Linux 4.14.9 kernel in an attempt to get things to work, but this did not resolve the issue either.  Further information  root@ThinkPad-E570:~# modinfo iwlwifi | grep 8265 firmware:       iwlwifi-8265-34.ucode root@ThinkPad-E570:~# rfkill list all 0: tpacpi_bluetooth_sw: Bluetooth     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no root@ThinkPad-E570:~# dmesg | grep iwl root@ThinkPad-E570:~# lspci -nnk | grep 0280 -A3 05:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. Device [10ec:c821]     Subsystem: Lenovo Device [17aa:c024]   Update  I just noticed that the laptop does not have an Intel wireless chip at all, but in fact has a Realtek one... which means that the  of the shop I bought this laptop at were not accurate... Sigh. Same problem stands, however, just with a crappier wireless chip.


I had a problem with my USB drive. When i plug it in windows 7, what happens is when I click on USB the message "Please insert a disk into drive X:". The drive properties show:  Type: Removable Disk File system: Unknown Used space 0 bytes Free space 0 bytes Capacity 0 bytes  I usually remove it without 'ejecting' or 'safely removing' it, can this be related? How can I solve this problem?

I have a USB flash drive which is no longer recognized by my computer. Windows Disk Management and DiskPart report No Media with no storage space (0 bytes) on the drive and I cannot partition or format the drive:     If the drive appears in Windows Explorer, trying to access it returns an error message indicating that there is no disk inserted, such as the following:     Please insert a disk into drive X:.   Various disk partitioning and data recovery utilities don't recognize the drive or only give a generic name for the drive and cannot access the contents of the drive.  What can I do? How do I recover data from the drive?     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this problem. Feel free to edit the answer to add additional details.


Is it the case that $A \times (B \times C) = (A \times B) \times C$ if and only if one of the factors is the empty set? I am talking about strict equality, not isomorphism. The duplicate question did not answer my question, because it never said when the associative law is true.

I have a basic doubt about the associativity of the cartesian product. Well, first wikipedia says that the cartesian product isn't associative, and there's a good argument for it: if $x\in E$, $y\in F$ and $z \in G$ the identity $((x,y), z)=(x,(y,z))$ would imply that $(x,y) =x$ and $(y,z) = z$ so that $((x,y),z)=(x,y,z)$ would mean nothing.  That's fine, I like this argument. However, in his book Calculus on Manifolds, Spivak says that the cartesian product is associative. He says: if $A \subset \mathbb{R}^m$, $B\subset \mathbb{R}^n$ and $C \subset \mathbb{R}^p$ then $(A\times B)\times C = A \times (B \times C)$, and both of these are denoted simply by $A \times B \times C$.  Well, this confuses me because Spivak is always very rigorous, so that he wouldn't state something that's not true in such way. Is Spivak or Wikipedia right ? Or Spivak's statement only works for subsets of euclidean spaces ?  Thanks in advance and sorry if this question is too basic.


I am trying to run a binary that I have downloaded (it's part of flutter). Whenever I'm trying to run it, I get the error:    I have already disabled gatekeeper checks globally with sudo spctl --master-disable. What else can I do to get this to run?

I'm running macOS 10.15 Catalina Beta.  When I try to install Spotify I see the following error:    Is this a Spotify issue or a Catalina issue?  Thanks.


Prove the inequality by induction:  $3^n > n^3\ $ for $\ n \geq 4$  Edit:  1) Base case: $n=4$, $3^4>4^3, 81>64$   2) Assume true for n=k: so $3^k>k^3$ 3) Consider $(k+1)^3$, $(k+1)^3 = k^3 + 3k^2 +3k + 1 < k^3 + k^3 + k^3$, i.e. $(k+1)^3 < 3k^3$  For $k \geq 1$, $3(3^k) \geq 3(k^3)$, therefore $\ 3^{k+1}>3k^3>(k+1)^3$  And nowhere has the fact that $k \geq 4$ been used.., so I don't think this a complete, or at all a proof by induction of that inequality

Prove by mathematical  induction that:   $$\forall n \in \mathbb{N}: 3^{n} > n^{3}$$  Step 1: Show that the statement is true for $n = 1$:  $$3^{1} > 1^{3} \Rightarrow 3 > 1$$  Step 2: Show that if the statement is true for $n = p$, it is true for $n = p + 1$  The general idea I had was to start with $(p+1)^{3}$ and during the process substitute in $3^{p}$ for $p^{3}$ as an inequality.  $$(p+1)^{3} = p^{3} + 3p^{2} + 3p + 1 < 3^{p} + 3p^{2} + 3p + 1$$  Now, if it can be shown that:  $$\forall p \in \mathbb{N}: 3p^{2} + 3p + 1 \leq 2 \cdot 3^{p}$$  ...the proof is complete. This is because $3^{p+1} = 3 \cdot 3^{p}$ and one of those three have already been used.   We do this by mathematical induction. First, the base case of $n = 1$:  $$3\cdot 1^{2} + 3 \cdot 1 + 1 \not \leq 2 \cdot 3^{1}$$  ..which turns out to be false.  What are some more productive approaches to this step?


On page 96 of the Monster Manual (Young Green Dragon), it's stated that:     On initiative count 20 (losing initiative ties), the dragon takes a lair action...   Does this mean the 20th round of combat (unlikely, as that would be a much easier way of saying it), does it only happen if the dragon rolls exactly 20, or does it happen every round as initiative passes down through 20?   It seems a crazily powerful thing to happen every round, or am I just being too nervous about killing my Starter Set players?

The Monster Manual describes Lair Actions as occurring "On initiative count 20 (losing all ties)..." (p 11).  What does "initiative count 20" mean? I can't find that phrase anywhere in the PHB or in any other context in the MM...


I want to implement a image editing program, but I can not display the Bitmap in my WPF.  For the general editing I need a Bitmap. But I can not display that in a Image.  private void MenuItemOpen_Click(object sender, RoutedEventArgs e) {     OpenFileDialog openfiledialog = new OpenFileDialog();      openfiledialog.Title = "Open Image";     openfiledialog.Filter = "Image File|*.bmp; *.gif; *.jpg; *.jpeg; *.png;";      if (openfiledialog.ShowDialog() == true)     {         image = new Bitmap(openfiledialog.FileName);     } }   I load the Image with a OpenFileDialog into the Bitmap. Now I want to set the picture in my WPF. Like so:  Image.Source = image;   I really need a Bitmap to get the color of a special pixel! I need a simple code snipped.  Thank you for your help!

I have an instance of a System.Drawing.Bitmap and would like to make it available to my WPF app in the form of a System.Windows.Media.Imaging.BitmapImage.  What would be the best approach for this?


Who does Kiba marry?    Who does Tenten marry?  I've searched so many times and I'm still confused about this.

In the last chapter of Naruto, some characters got married, and some of them had kids. What is the entire husband-wife-kids set?


I am trying to blow up a directory in my docker container to test maintenance scripts. I've tried logging to a file in an indefinite while loop -- this was extremely slow. Fast way to do this programmatically?

How can I quickly create a large file on a Linux () system?   will do the job, but reading from /dev/zero and writing to the drive can take a long time when you need a file several hundreds of GBs in size for testing... If you need to do that repeatedly, the time really adds up.  I don't care about the contents of the file, I just want it to be created quickly. How can this be done?  Using a sparse file won't work for this. I need the file to be allocated disk space.


I've been thinking about Einstein recently, and I came back to the famous equation e=mc^2.  Why does this work?  It's saying the difference between mass and energy happens to be the speed of light squared?  I'm sure there's a larger explanation behind it, but the simplicity of the equation seems improbable.

is the famous mass-energy equation of Albert Einstein. I know that it tells that mass can be converted to energy and vice versa. I know that $E$ is energy, $m$ is mass of a matter and $c$ is speed of light in vacuum.   What I didn't understood is how we will introduce speed of light?  Atom bomb is made using this principle which converts mass into energy; in that the mass is provided by uranium but where did speed of light comes into play? How can speed of light can be introduced in atom bomb?


Unsure how to describe this. I am currently working on a particle cannon effect with a core and 3 lightning "tubes" around it. Take a look:  First, The elements:   The inner core is a simple cylinder, distorted by a noise texture. I made sure that there is no clipping in the mesh. If rendered by themselves, as seen in this first picture, there is no issue.  The Material for the core:    The Material for the Lightning bolts    When you render them together...    It appears, that as soon as two or more of the "creases" of the inner core overlap, the tubes that should be transparent get rendered. Is there any possibility to "increase" the threshold or otherwise solve this problem?  Thanks for any help!

I have encountered an issue with Cycles Volumetrics in a recent scene. I am using Blender 2.72, and both CPU and GPU render options. In both I get a solid black artifact when I have two volumes overlapping, as in this campfire smoke test:    I have a solid cube, with a volume scatter and volume absorption material, duplicated by a particle system. As you can see, when the particles get higher up and farther apart, and are no longer overlapping, the artifacts disappear.


I am using the schedule python package and would like to run a job every hour at the :00 mark.  Is this possible?  This is the code I have right now:  def schedule_jobs(self, loop):     logging.info('Starting scheduler...')      schedule.every(1).hours.do(self._pldown_runner.run_pldown_job, loop)      while True:         schedule.run_pending()         time.sleep(1)   The problem with this is that it runs the job every hour starting from the minute it was actually executed.

I'm looking for a library in Python which will provide at and cron like functionality.  I'd quite like have a pure Python solution, rather than relying on tools installed on the box; this way I run on machines with no cron.  For those unfamiliar with cron: you can schedule tasks based upon an expression like:    0 2 * * 7 /usr/bin/run-backup # run the backups at 0200 on Every Sunday  0 9-17/2 * * 1-5 /usr/bin/purge-temps # run the purge temps command, every 2 hours between 9am and 5pm on Mondays to Fridays.   The cron time expression syntax is less important, but I would like to have something with this sort of flexibility.   If there isn't something that does this for me out-the-box, any suggestions for the building blocks to make something like this would be gratefully received.  Edit I'm not interested in launching processes, just "jobs" also written in Python - python functions. By necessity I think this would be a different thread, but not in a different process.  To this end, I'm looking for the expressivity of the cron time expression, but in Python.   Cron has been around for years, but I'm trying to be as portable as possible. I cannot rely on its presence.


I am currently writing my thesis and for that I use a default template found on internet. It use \cleardoublepage apparently. I have an issue because this template add empty page by default and my company ask me to put the default text "This page is empty" for security reason.   I am wondering if it possible, by adding a simple code some where, to add that text on all empty pages ?  Thanks a lot,  Cheers,  Eliott

I have a scrbook document with an openright option, i.e. every once in a while a blank left page appears in the document. Not that I really want to do this, but how could I include the infamous "This page has been intentionally left blank" in those blank pages cleanly, i.e. without too many hacks?  Bonus points for including a different famous quote on each blank page instead of the dull default ;)


I have 8 independant variables and 2 dependant variables.Iam using multiple linear regression.I just finished the regression topic so iam a starter in this.Can anyone say how to approach this one??

Is it possible to have a (multiple) regression equation with two or more dependent variables?  Sure, you could run two separate regression equations, one for each DV, but that doesn't seem like it would capture any relationship between the two DVs?


I have a strange problem regarding null pointer exception. I'm posting the problematic code piece below :  public static void main(String[] args) {  BetHistory testObject = new BetHistory(6);  testObject.addResponse(2, 1, 0); //  ERROR HERE  ...  }  public class PlayerResponses {      public List<Integer> response;      public PlayerResponses() {         super();         response = new LinkedList<Integer>();     }  ...  }  public class BetHistory {      PlayerResponses [][] responses;      int nPlayer;      public BetHistory(int totalPlayers) {         super();         responses = new PlayerResponses[4][totalPlayers];         nPlayer = totalPlayers;          }     public void addResponse(int response, int playerNo, int roundNo)     {         responses[roundNo][playerNo].response.add(response); // DUE TO HERE     }  ...  }   Thanks in advance for your time.

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I have used db=this.getWritableDatabase(); in the constructor itself, so I havent used a specific open or close function. Should I?   public void changeCabLocation(String to_loc, String cab_id2) {     // TODO Auto-generated method stub     ContentValues val=new ContentValues();     val.put(cab_location, to_loc);     db.update(TB_cabs, val, cab_id+"="+cab_id2, null); }  public void changeDriverLocation(String to_loc, String driver_id2) {     // TODO Auto-generated method stub     ContentValues val=new ContentValues();     val.put(driver_location, to_loc);     db.update(TB_drivers, val, driver_id+"="+driver_id2, null); }


So I am struggling to understand the purpose of the Automatic properties in classes.   See examples below:   This code lets me set the name of the test class, and read it. All works fine, I can set it to "tom" and read "tom" from it.   namespace ConsoleApplication1 {     class test     {         public string name;     }     class Program     {         static void Main(string[] args)         {             test tom = new test();             tom.name = "tom";             Console.Write(tom.name);         }     } }   now this code, using the automatic property does exactly the same thing:   namespace ConsoleApplication1 {     class test     {         public string name { get; set; }     }     class Program     {         static void Main(string[] args)         {             test tom = new test();             tom.name = "tom";             Console.Write(tom.name);         }     } }   So, what is the benefit of using one over the other? Since both seem to work the same way, as far as I can see.   Thanks in advance for any help people can give me!

In C#, what makes a field different from a property, and when should a field be used instead of a property?


If on my turn I cast a damage spell that requires concentration, can I keep it up on subsequent enemy turns then drop it before it damages an ally at the start of their turn?   For example, this is the initiative order in a round: my Wizard > Enemy Stirge > Ally Fighter. On a previous turn the Stirge has attached itself to the Fighter using Blood Drain. On my turn I cast Cloud of Daggers in the area that the Stirge and Fighter both occupy.      You fill the air with spinning daggers in a cube 5 feet on each side, centered on a point you choose within range. A creature takes 4d4 slashing damage when it enters the spell’s area for the first time on a turn or starts its turn there.    Therefore when I finish my turn, the Stirge's turn starts and immediately takes 4d4 damage killing it immediately as it has a 2 HP. Then I would like to drop my concentration immediately before the Fighter's turn so that he wouldn't take the subsequent damage.      If a spell must be maintained with concentration, that fact appears in its Duration entry, and the spell specifies how long you can concentrate on it. You can end concentration at any time (no action required).   According to the emphasised sentence in the above quote, I can drop concentration at any time, which I assume to mean even out of my turn. However the Fighter was encased in the Cloud of Daggers, so how does the spells description interact with the concentration rule here?  My understanding from a purely RAW interpretation is that the Fighter takes no damage as I can drop the concentration before the start of his turn. Can anyone confirm if I'm missing any other rules that might effect this sequence of events, as my common sense tells me the Fighter probably should take some damage by being in the cloud for a brief period of time?

From the :  Some spells require you to maintain concentration in order to keep their magic active. If you lose concentration, such a spell ends. If a spell must be maintained with concentration, that fact appears in its Duration entry, and the spell specifies how long you can concentrate on it. You can end concentration at any time (no action required).  The rule is very short and only says "at any time (no action required)". How is this "any time" defined? An example scenario:  I cast levitate on an enemy to remove them from the battle. Later, on his turn, he raises a crossbow. The DM declares the attack, but then I interrupt him and say that I end my concentration, so he will fall down and become prone.  Another example scenario:  I cast levitate on myself and fly 30 ft. The enemy then flies and spends all his movement to fly to me, to attack me in melee. After he reaches me, I declare I am ending my concentration, so I can fall back to the ground, preventing him from attacking me.  Is this allowed? Can I end concentration conveniently any time, interrupting any currently declared action/event?


This answer here has a broken link:    The standard procedure seems to be to comment on this answer for the author to correct the link. But then, I'll have to somehow track it in order to remove my obsolete comment, once the OP corrects the link.  Instead, it would be very useful if I could simply flag the question for a broken link. This flag would then send a message to the OP's inbox asking them to fix the link. If the OP doesn't fix (= edit or delete) the answer in about 1-2 weeks, this would become a regular moderator flag (or just a regular comment).  In addition to the OP seeing this, these questions / answers could also be featured in the review tab...  Some related meta questions:

I keep finding broken links in posts, currently I add a comment in the hope someone will return to update it or if I find a link I edit the answer.   I imagine this will only increase over time so I wonder if there could be a standard way to manage this?  My idea is adding a new flagging reason like "contains broken links", then it will go to a review queue where people will be able to have a look and fix the broken links.


I want to share my single player world with my friend, Can someone tell me how but in a simple way (I'm on a mac)  I'm really having trouble and I want to share my world with my friend.

I've got some funky minecraft maps that I'd like to share with my friends. However, they're, more often than not, far away and unable to stop by my computer and see what I've wrought.  I was wondering if there was a way to transform a singleplayer map into a multiplayer one, such that I could share my singleplayer creations remotely?


Does anyone know of a bash or similar script that will pull stats from a Linux server and display them on a centralized web page or send a report via email every "x" hours?  I've found services that offer something close but they are cost prohibitive and missing some of the stats I'd want and some functions just don't work, etc.  The idea would be to pull: - CPU load - RAM and SWAP - Disk used / free - TX and RX for a given time period (year to date, month, week and day) - Active processes - IPs attempting login (failures from secure log on my CentOS boxes)  I'd like to pull the reports to a central server and display them on a web page but having the reports emailed on a timed basis would be better than nothing.

For a more comprehensive list of monitoring tools and their features, check out .   As the question states, what are the most commonly used tools used for this task and what are their strengths and weaknesses?


On many of the Stack Exchange sites, a significant proportion of questions are asked by unregistered users who are then unable to accept an answer to their question as correct. This is a massive disincentive to answering questions from unregistered users, given that the probability of reputation gain from that answer is significantly lower.  I have  that has been left un-accepted despite receiving 35 upvotes (and 0 downvotes) because the OP is unregistered and thus has no means of accepting it.   Could there be a way to automatically accept answers to unregistered users' questions once they reach, say, +5 votes? This rule would remove the disincentive of answering many of the posted questions, and get users well-earned reputation points.

As a disclaimer, I must admit this may benefit me (I haven't checked), but probably not as significantly as most others. This issue is also something that has prevented me from answering questions by users with 1 rep in the past, especially if they are poorly fashioned. The Problem New users with a programming question find SO from various methods, such as google. They ask a question with haste, hoping for a quick answer -- which they usually receive. Many of these users have no interest in Stack Overflow itself, but are simply interested in getting the solution they require. As a result of this, they'll check the site regularly for the first day or two until a sufficient answer has been posted. Once they get what they need, they bail; without the required rep or understanding that they should up-vote and select a response as the answer. The Result A great many questions on SO are abandoned by users with no intention of ever coming back. The answer they require has been provided, but for one or more reasons they have neglected their duty of contributing back by way of awarding reputation. The Reach (Since Jeff loves Datum) Some queries on the data dump examine the reach of this 'problem'. The query I used is based on extensions of the following base query; SELECT p1.Id, p1.Score, p1.OwnerUserId, p2.OwnerUserId, p2.Score FROM posts p1  INNER JOIN posts p2 ON (p1.Id=p2.ParentId) LEFT JOIN users ON (p1.OwnerUserId=users.Id) WHERE p2.Score >= 2  AND p2.Score = ( SELECT MAX(p3.Score) FROM posts p3 WHERE p3.ParentId=p1.Id ) AND users.Reputation < 15 AND p1.PostTypeId = 1 AND p1.AcceptedAnswerId = 0  Result: 3,288 Questions by users with under 15 rep which have answers with 2+ up votes that have no accepted answer. Adding: AND (users.LastAccessDate-p1.LastActivityDate) < 604800 // 1 week AND p1.CreationDate < 1249084800 // 1249084800 is 1 week before latest dump data  to the where clause further reveals that 877 questions that have answers with 2+ up votes have no accepted answer, and the owner of the question has not returned since the week the question was asked. Modifying there where clause, and removing the left join: AND p1.OwnerUserId = 0    Reveals a staggering 3,675 questions with answers of 2+ votes by deleted users.  These are questions that were probably answered but the users who did the work can never be recognized. Building off the previous and using an even more restrictive WHERE clause WHERE p2.Score >=5  Still 1,178 posts that can never have an accepted answer. How many posts are there with over 5 up votes that don't provide the correct answer? Modifying the where clause for Reputation to AND users.Reputation = 1  Still reveals 388 questions by users with 1 rep have been abandoned. Solution Similar to how bounty questions work, if a user has abandons the site (not active since x time after the question was asked) with a question that has answers with 2+ up votes, force the answer with the most up votes to be the selected answer. This will reduce the amount of questions that are unanswered, and also give users more of an incentive to answer questions by new users without extra hesitation.  Update Added more statistics for deleted users.  Please feel free to add/remove rules to make this a truly practical feature.


The pictures on my Instagram (not my account) are all blurry, and the videos won't work. Not all pictures and videos do it though, just some.

I recently updated to iOS9 on my iPad4, and ever since then the pictures on Instagram have been blurry (It looked fine previously). Is this an Instagram bug, old Hardware, or something else?    Let me know if this is the wrong site to ask on.


I need new GPU for my computer and must buy it from Finland. I am travelling with AirBaltics from Finland.  I would like to take the following GPU in my hand luggage because they break easily:    Can you get get GPU in hand luggage?

As I will be travelling to the US in July, I was thinking of buying two graphics cards (R9 390X) over there and bring them back to Switzerland, as computer components are mostly a bit cheaper over there.  I know that the US has some really high security standards regarding international flights. If I take these two GPU's in my carry-on luggage (so they don't break), how would a security officer at LAX react when they see those Graphics cards? I do realise that most people don't actually know what a GPU is or how it looks like. So I am concerned that a security officer might take them from me at an airport when trying to board an international flight.  Believe it or not, I read some really strange stories in forums from people that claim the security officer did not know what a GPU is and thought it might be some sort of a bomb.  Note: By "GPU" I am referring to the whole graphics card (with circuit board, coolers, etc.) and not just the processing unit.


In The Matrix, Agent Smith has this quote during his monologue with Morpheus.  Smith: I realized that you're not actually mammals. Every mammal on this planet instinctively develops a natural equilibrium with their surrounding environment, but you humans do not.  Leaving aside the fact that this is not true, has Morpheus ever seen an animal (of any kind) outside of the Matrix, or are the Humans that are kept alive by the machines  the only life that survived? It’s unlikely they have animals for food, given Dozer’s quote  Dozer: It's a single-celled protein combined with synthetic aminos, vitamins, and minerals. Everything the body needs.  alongside the fact that Cypher apparently sold out the crew for a steak. But that just tells us that there aren’t cows or chickens. Is there any evidence of non-human (multicellular) life outside the Matrix?

It is apparently canon that  in Neo's day.  However, in the first movie, The Matrix, Morpheus tells Neo that one of the things known for certain is that humans "burned the sky" in order to deny solar engery to the machines, which in turn led to the humans who survived the War being plugged into the Matrix to provide bioelectric energy to supply the machines.  If there's not enough sunlight for solar power, how can there be enough to grow plants to serve as food for animals?  Low levels I can understand -- house plants, at least, thrive in conditions too dim for solar panels to produce cost-effective power -- but every surface scene we see in the trilogy is as dark as a cloudy night; light coming only from the machines.  That wouldn't begin to support photosynthesis, which means all animal life would starve in, at most, a matter of a few years.


If I have a int i = 15; I know  it is 0x00 00 00 0F in binary is 0000 0000 0000 0000 0000 0000 0000 1111 has 4 1 in binary.   I want to count the sum of 1 in a int variable.  I write this:  int count1(int i) {     int j = 0,num = 0;     for(;j<32;j++)         if((i<<j )&0x80000000)             num++;     return num; }   It can work, but I think it is too slow,I mean maybe I have millions int data. Dose some one have a more effective way to do this?

8 bits representing the number 7 look like this:  00000111   Three bits are set.     What are algorithms to determine the number of set bits in a 32-bit integer?


I was looking over Chrome and the task manager feature and really wishing something like this was in Firefox (as i have lots of addons [probably too many] and lots of tabs open). I looked for an addon or something but perhaps I have missed something? Anyone know of something like Chrome's task manager but for FF?

Is there anything in the current Firefox similar to the Task Manager in Google Chrome? (Shift + Esc)  There is something that occasionally takes up enough CPU to make Firefox unresponsive - but with multiple windows, each with a dozen or so tabs open, trial & error is going to take a while.


I want to validate an email field using regex in such a way that my email has to has @moore in it. like a@moore.af, b@moore.sg, and so on. how can I write its pattern? I am using typescript and angular reactive form. Your help is much appreciated.

Over the years I have slowly developed a  that validates MOST email addresses correctly, assuming they don't use an IP address as the server part.  I use it in several PHP programs, and it works most of the time.  However, from time to time I get contacted by someone that is having trouble with a site that uses it, and I end up having to make some adjustment (most recently I realized that I wasn't allowing 4-character TLDs).  What is the best regular expression you have or have seen for validating emails?  I've seen several solutions that use functions that use several shorter expressions, but I'd rather have one long complex expression in a simple function instead of several short expression in a more complex function.


I've posted a question to  on Google Spreadsheets that I would like to move to .  I think adding a function for moving the question to another Stack Exchange site (for the user who wrote the question) could be useful.  As , a user with 250 reputation  could ask other users to vote to move his own question to another Stack Exchange site, so why not just let the user move his own question?  Since users with 3000 reputation can move any question to any Stack Exchange site, experienced users can fix any inappropriate moves by inexperienced users, avoiding the delay of a vote.

I remember Jeff saying, when they announced Server Fault, that it was going to be possible to move questions between sites. I'd find that feature very nice as since then I've found at least 10 questions on either site that belonged to the other one.


If I have a continuous, injective function mapping the real numbers, then it is either increasing or decreasing.  This seems intuitively obvious but I can't come up with a neat proof for it.

I would like to prove the statement in the title.  Proof: We prove that if $f$ is not strictly decreasing, then it must be strictly increasing. So suppose $x < y$.  And that's pretty much how far I got.  Help will be appreciated.


I have a Matrix Y of Kind : $n\cdot I$  where $I$ is the identity Matrix of size  $n\times n$  , I need to find Matrix $X$ if it exists such that all elements are either 1 or -1 and satisfies $XX^t$ = $Y$. Please Help

How to create a $N \times N$ matrix with $1$ and $-1$ as its elements, such that when this matrix is multiplied with its transpose the resultant matrice is $N \times \mathbb{I}_N$. Where $N$ is a scalar and $\mathbb{I}_N$ is the $N \times N$ identity matrix. Examle for 2x2 matrix $-1$ $1$ $1$ $1$  Example for 4x4 matrix $-1$ $1$ $1$ $1$  $1$ $-1$ $1$ $1$  $1$ $1$ $-1$ $1$  $1$ $1$ $1$ $-1$


Actually on Stack Overflow most of the time we delicately ask one problem at a time.  But what if I or some one other have a list of problems and really want to know?  Mainly I focused on how to ask a list of questions.  A list of programs that based on what is the output of this code. How this program really work. etc.

This question has been asked several times in similar (yet often slightly different) ways.  The general consensus seems to be that it's best to ask multiple questions individually in multiple Question posts so that each can be addressed separately. This is as it should be...in general (and in theory!). See related posts for some context and discussion:        In practice, however, it can be more useful to ask a few similar questions if they work together to express a single fundamental concern.   I propose that there are some situations when it is best to ask several questions together, rather than in multiple posts.  For example, sometimes the question-asker finds it difficult to ask something in one question and instead asks it in two or three similar questions to "beat around the bush". This often helps the poster express their fundamental concern more clearly or thoroughly and helps the community understand what the poster is thinking, and why.   Here are a few examples of multiple questions used effectively in a single post:        In these examples, answering one of the questions almost requires answering one of the accompanying questions as well. For this reason, it's better for all if the questioner and answerer each ask and answer these related questions together. Importantly, it also makes the question a much better resource for somebody who stumbles on that that question later, or has a similar question. As pointed out in , asking a cluster of questions can help distinguish one question from a near-duplicate and avoid an incorrect flagging as a duplicate.  In other cases (such as ), it's probably best to split the questions into multiple posts, but the end result can be a highly-useful repository of knowledge that is a "one-stop-shop".   I'm not satisfied with some SX users demanding separate posts for similar questions if the questions are essentially expressing the same concern. I'm also not satisfied with the prevalence of posts with multiple, disparate questions.   My question is this:    When is it okay to post multiple questions?  How can we distinguish between multiple questions that ought to be split vs. multiple questions that work together to express a single fundamental concern?  What guidelines or standards can we give and enforce for the community?    This is different than the related posts I've seen because I'm looking for guidelines. Whereas  was asking about how the user should frame his questions in the future, I'm asking what the SX guidelines should be.