My essay speaks of de-orbit "debris" falling to Earth's surface. Like as with the shuttle, it will be strewn in parts across the continent. Follow-on reference to the debris (items) would seem, in the strictest (collective-singular) sense for instance, to require the singular pronoun, it; but the word, they, seems more intuitive...so as not to imply that the debris item(s) all or for the most part would be landing upon one and the same ground location. Your thoughts?

"Debris are called toxins."  In this sentence, should I use "is" or "are"? I understand "debris" is an uncountable noun, so normally I would use "is". But I am referring to different kinds of debris. Toxins are referring to a collection of debris. So is "are" the correct way?  Or should I reformat this sentence?


I made a great bone broth recipe in slow cooker. Well I strained it and put in an air tight container. It wasn’t cooled to much. So is it ruined? Can I reheat to a certain temperature to make sure there aren’t any bad bacteria?

I heard that putting really warm food in the fridge right after cooking it is not the right thing to do. It might cause bacterial growth? Is this true?


I am in the process of trying to rewrite my website, and I have limited experience in HTML/CSS/Javascript. It is a photography website using galleries. I am wanting to make the default view to be using Flash, but I know that iPad/iPhone etc do not support Flash. I am looking for a way to determine what the OS is so I can direct the iWhatevers (and others if there are any), to a purely HTML site, and the non-iWhatevers to the Flash site.  I presume it would be done in the Heading part of the HTML, but what script would I use to do this? Thank you in advance...

Does anyone have an example of script that can work reliably well across IE/Firefox to detect if the browser is capable of displaying embedded flash content. I say reliably because I know its not possible 100% of the time.


I know there are a plethora of people asking this question because I've read a number of them and am still confused. I have an i3-2100 with 16gb of memory, and an i5-560m with 4gb in a different computer. If I want full 64 bit processor support, and full memory support, should I be using the AMD64 or the Intel x86? I've been using the AMD64 because I saw 64 and assumed that's the one I want for my 64 bit processor. However, reading the descriptions, it sounds like I may have wanted to use the other one. I figured if I used the wrong one it just wouldn't install.  Which one is the correct version for my uses?

What is the difference between standard i386 download and the amd64 download of Ubuntu 11.04? I am currently running the i386 on an amd machine, would my system work better with the amd64 download instead? (my machine was running Windows 7 64bit, but I neglected to look at that prior to installing Ubuntu).


I have several figures in my thesis which need a footnote in their caption. However, I could not find an efficient way to do it looking into the others' inquiries in the forum. In fact, using the \footnotetext , \footnotemark as the following code, makes the footnote to be appeared in the page before the float. I tried some suggestions such as the minipage, \clearpage, etc., to adjust the problem, but they did not work. Anyone could help me? Would appreciate it!  \begin{figure}  \centerline{\includegraphics[width=6.5cm]{./chapter2/Figures/couche2.png}}  \caption{Lithostratigraphic profile of clay \protect\footnotemark.}  \label{fig:couche2} \end{figure} \footnotetext{Lithostratigraphic ....}

I had the issue of having two footnotes appear in \caption in a figure-environment.  Fortunately, this answer () provided a solution.  My code is as follows:  \begin{figure}   \begin{minipage}{\textwidth}   \includegraphics[width=0.5\textwidth]{ReportMenu}   \caption[The report submenu]{Each of the pre-defined reports appear as a menu item in the \textbf{Reporting} submenu.  Some installations have custom reports made special by Innovative for them, and only appears on installations that request it.  ``Report queue'' is the only item not a report,\footnotemark{} while ``Fleet statistics'' is a special report for fleet handling and only available for installations with the fleet module.  In this example, all available (at writing) custom reports appear, none of which have been translated into English as they are designed for Danish and Norwegian installations.  These custom reports will not appear on new installations.}   \footnotetext{Since iv2.9e, another item for report scheduling has appeared underneath the report queue and is also not a report.}   \label{fig:menu}   \end{minipage} \end{figure}   Which yields the following result:    You'll notice that while the 5 for the inline note appears (this is correct at this point in the document), it does not appear the footnote itself.  How do I make the number (re-)appear on the footnote itself without having to manually force it?  I have a feeling I have missed something obvious.


So I've read about the latest largest prime number discovery (M74207281), but I find it hand to understand what's the big deal because using Euclid's proof of the infinitude of primes we can generate primes as large as we want.  I'll be happy to know what I'm missing

So a couple of days ago the $17$ million digit number $2^{57885161}-1$ was beaten by the $22$ million digit number $2^{74207281}-1$ at being the largest known prime number.  Are there any specific (purely mathematical) implications of the fact that this particular number is prime? In particular, does this resolve something other than the question if $2^{74207281}-1$ is prime, in the style of some newly discovered theorem resolving previous conjectures? Is it perhaps a counterexample to something so far believed to be true?  Edit: I'm aware of the many non-(strictly mathematical) practical implications and reasons to continue the search for large primes (cryptography etc), but I'm not aware of any strictly mathematical uses of particular numbers being prime, which is why (and what) I'm asking.


I've had to load test HTTP servers/web applications a few times, and each time I've been underwhelmed by the quality of tools I've been able to find.  So, when you're load testing a HTTP server, what tools do you use? And what are the things I'll most likely do wrong the next time I've got to do it?

This is a  about capacity planning for web sites. Related:      What are some recommended tools and methods of capacity planning for web sites and web-applications? Please feel free to describe different tools and techniques for different web-servers, frameworks, etc., as well as best-practices that apply to web servers in general.


I installed Ubuntu 18.04 and I enabled the UI option for creating a new file(add file in Templates folder). But is there a way when click on 'New Document' (I named it in that way) to create file and focus you on its filename to directly edit it? Not I have to create file, click on it to rename it and then to enter the new name.  Thanks in advance!

I know this is some how silly and ridiculous, but it is really annoying! I recently installed Ubuntu 18.04.. With Ubuntu 16.04, I was able, when I create a new empty document, to rename it directly: I didn't need to :     step1:  create the document. step 2: click on it with the right button and choose rename    Everything was done in one step. However, in Ubuntu 18.04, I can not do this (creating and renaming) in one step: every time I want to create an Empty document, I have to:   Create the empty document Right click on it then choose rename.   Is there anyone who faced the same problem? And is there a fix for this?  PS: It is not about how to create an empty document in Ubuntu 18.04, it is about how to create and rename, in one step, an empty document.


I have tried to improve the inequality by AM-GM. Here is what I have done: Since $$\sum_{cyc}{xy}\ge3\sqrt[3]{x^2y^2z^2}$$ $$\Rightarrow \left(\sum_{cyc}{xy}\right)^2 \ge3xyz\sqrt[3]{xyz}$$  That means we got to prove$\sqrt[3]{xyz} \ge x+y+z$. However that is false in the case $x=1$,$y=2$,$z=3$. Any help?

Prove that if $a,b,c$ are non-negative real numbers, then   $(ab + bc + ca)^2 \geq 3abc(a+b+c)$.   I tried to compute from $(a-b)^2 + (b-c)^2 + (c-a)^2 \geq 0$.


I occasionally need to check some file's location and copy it to the clipboard. I used to use Finder -> Cmd-I then I used to copy the content of "Where" section.  Ever since updating to macOs Mojave, the format of the path displayed in the "Where" section has changed. Instead of "/" forward slash character now I see "triangle" character.    How to solve this?  Thanks!

In Windows it is possible to right-click on a file. Then select "properties". In "properties" the file-system path is shown. Can then be copied by marking and storing (into the clipboard).  I couldn't figure out a way to do that in Mac.   Therefore my question:  Can I retrieve the file-system path of a directory or file via the GUI of the Mac Finder?


Let $f: \mathbb{R}^{2} \to \mathbb{R}$ of class $C^{\infty}$, with $f(x,0) = f(0,y) = 0$ for any $x,y \in \mathbb{R}$. Show that there is a function $g: \mathbb{R}^{2} \to \mathbb{R}$ of class $C^{\infty}$ such that $f(x,y) = g(x,y)\cdot x\cdot y$ for any $(x,y) \in \mathbb{R}^{2}$.  My idea is to define a function $\varphi \in C^{\infty}$ by $\varphi(x,y) = f(x,y) - g(x,y)\cdot x \cdot y$ such that $\varphi \equiv 0$. But for this, I need to have a "candidate" to be the function $g$. The book hint me to use the Taylor Formula, but I don't know how it helps.  Thanks in advance.

I'm trying to solve the following exercise  Let $f: \mathbb{R^2} \to \mathbb{R}$ a $C^\infty$ function such that $f(x,0)=f(0,y)=0$ $\forall x,y \in \mathbb{R}$. Then there exists a $C^\infty$ function $g:\mathbb{R^2} \to \mathbb{R}$ satisfying $f(x,y)=xy\, g(x,y)$ $\forall x,y \in \mathbb{R}$  I thought first about expanding $f$ using the taylor theorem, we would have $$f(x,y)=f(0,0)+f'(0,0)(x.y)+\frac{f''(0,0)(x,y)^2}{2!}+r(x,y),$$ but $f(0,0)=0$ and $f_x(0,0)=f_y(0,0)=0$ since $f$ is zero on the $x$ and $y$ axis. $f''(0,0)(x,y)^2=f_{xx}(0,0)x^2+f_{xy}(0,0)xy+f_{yy}(0,0)y^2$, now we have a term that has a product of $x$ and $y$. But I don't know how (and if it is possible) to proceed from here.


I am using a PIC to drive the gate of a logic level MOSFET. Although the 5V logic output of the pic is sufficient to exceed the threshold voltage I would like to drive the gate using 12V to reduce the Drain-Source resistance.   In order to achieve this I have drawn up the following circuit using two MOSFETs in series (as highlighted). Will this design work, and is it the best approach (keeping in mind i want to minimize the number of components).

I would like to drive a MOSFET gate using 12V (in order to reduce the drain-source resistance). Using the answer from a few post i've read I have come up with the following circuit. Will this circuit work for an application where i will be switching the motor on and off one every 10 minutes?  Further more is this the best method of driving the FET? and is there any type of "MOSFET driver IC" i can use to reduce space on my PCB?


I am trying to execute a java program which basically invoke test cases prepared in SOAP UI. but unable to successfully execute the program.

I am getting a NoClassDefFoundError when I run my Java application.  What is typically the cause of this?


How do I show that the set of natural numbers $\mathbb{N}$ has the same size as $\mathbb{N}\times\mathbb{N}$? I know that for two sets to have the same size, there must be an injection from the set $\mathbb{N}$ to the set $\mathbb{N}\times\mathbb{N}$ and there must be and injection from the set $\mathbb{N}\times\mathbb{N}$ to the set $\mathbb{N}$.  But I have no idea on how to prove this.

How can I prove that the Cartesian product of two countable sets is also countable?


Many years ago I read a story about a guy working for an organisation that would influence time-lines by traveling through time using a sort of elevator. The objective of the operators was to influence the time-line by making the smallest change possible. Can anyone identify the name and author of the story?

I originally read this book in the mid- to late '70s.   The premise was a bureaucracy whose job it was to manipulate events in human history by making the smallest possible change that would effect the desired outcome. Not time cops in the sense of going after law breakers.  The intent was to maintain a policy of non-interference as much as possible but when interference was warranted then to make the least possible change and to do so invisibly.  For example, they might take someone's keys off the dresser and put them just out of sight underneath the dresser where they plausibly might have fallen.  The subject would never know of the manipulation but would then be delayed getting out of the house and the ripples grew from there to avert a war or otherwise affect events on a large scale.  After reading that, whenever I would lose something - especially in an improbable way such as dropping a screw at my feet and then finding it on the other side of the room half an hour later - I would take some consolation in the thought that I had just averted some global catastrophe.  I was pretty scatterbrained as a kid (we call that ADHD nowadays) so I experienced this a lot.  Given that I've spent so much time pondering the ideas from the book, I'd love to re-read it.


In a Twin Peaks  you can hear the following question: "So, Mr. Wheeler, what is it exactly you do do?". It seems to me quite weird. Is it correct? I suppose that the purpose of the second do isn't to emphasize something.

Is it grammatically correct to use the word "do" twice in a row? Examples: We do do what you are talking about. instead of... We do what you are talking about.  or  Our process does do what you are talking about. instead of... Our process does what you are talking about.  Is the meaning any different?


I am trying to specify the constant in a regression model using SPSS. Does anyone have an idea on how to do this?

I know how to perform a linear regression on a set of points. That is, I know how to fit a polynomial of my choice, to a given data set, (in the LSE sense). However, what I do not know, is how to force my solution to go through some particular points of my choosing. I have seen this be done before, but I cannot remember what the procedure was called, let alone how it was done.   As a very simple and concrete example, let us say that I have 100 points scattered on the x-y plane, and I choose to fit a whatever-order polynomial through them. I know how to perform this linear regression very well. However, let us say that I want to 'force' my solution, to go through, say, three of my data points at x-coordinates $x=3$, $x=19$, and $x=89$, (and their corresponding y-coordinates of course).  What is this general procedure called, how is it done, and are there any particular pitfalls I need to be aware of?  Edit:  I would like to add, that I am looking for a concrete way to do this. I have written a program that actually does the linear regression in one of two ways, inverting the covariance matrix directly, or through gradient descent. What I am asking is, how, exactly, step by step, do I modify what I did, such that I force the polynomial solution to go through specific points?   Thanks!


I Would like someone to verify this proof, since I could not find it in my professors notes on properties of isomorphic groups.  Again, the statement: is $G\cong H$. $G$ is cyclic if and only if $H$ is cyclic. I will only demonstrate ($\Rightarrow$)  Proof. $G\cong H$. Suppose $G$ is cyclic. Then $G=\langle a\rangle $ for some $a\in G$, i.e. $c\in G\Rightarrow c=a^{s}$, for some $s\in \mathbb{Z}$. We want to show that $H=\langle b\rangle$ for some $b\in H$.  Pick any $h\in H$. Then $h=\phi (g)$ where $g\in G=\langle a\rangle$, i.e. $g=a^{k}$ for some $k\in \mathbb{Z}$.   Now, since $G\cong H$ we have that $h=\phi (g)=\phi (a^{k})=\phi (a\cdot a\cdots a)=\phi (a)\phi (a)\cdots\phi (a)=\bigl(\phi (a)\bigr)^{k}$. Furthermore $\phi (a)\in H$ since $a\in G$ and $\phi \colon G\rightarrow H$. Put $b=\phi (a)$ and we finally have that $h=\bigl(\phi (a)\bigr)^{k}=b^{k}$ for some $k\in \mathbb{Z}$. Thus $H=\langle b\rangle$, meaning $H$ is cyclic.

Is it true that if an isomorphism $f$ maps a cyclic group $G$ to group $H$ that $H$ must also be cyclic?  It seems intuitive but until I can actually prove it I'm always a bit dubious to believe it.


Invert the $2\times 2$ matrix:   \begin{bmatrix} \cos\theta & -\sin\theta  \\ \sin\theta &  \cos\theta \end{bmatrix}    My thought was to append the  $2\times 2$ identity matrix to the right of the trig matrix and use row operations to get the answer.    I have to show all steps, so I cannot just flip it and call it a day.

I don't have a clue of what's going on. We haven't learn this in class so I need all the help possible. The more detailed of an explanation, the better. Thanks in advance. The only info I have is that this matrix is Orthogonal. Which means I know the answer, just don't know how to get it.  \begin{bmatrix}        \cos\theta & -\sin\theta \\        \sin\theta & \cos\theta       \end{bmatrix}


On my exam, we had to solve this problem:     message matrix is: [20, 19, 14; 17, 0 10]   and the ciphertext matrix is: [18, 15, 16; 3, 24, 24].   Find key matrix.   I couldn't solve this problem, because I tried to find key matrix by multiplying  [20, 19, 14; 17, 0 10]^-1 and [18, 15, 16; 3, 24, 24], but I wasn't able to calculate [20, 19, 14; 17, 0 10]^-1, because it's not a square matrix.  How can I decode a Hill Cipher without a key?

I know a plaintext - ciphertext couple of length 6 for a hill cipher where its key is a [3x3] matrix.  Based on what I've read and learned, to attack and crack keys of [n x n], if we know a plaintext - ciphertext duo of length $n^2$ then we have our set of n equations with n variables, and this is generally solvable. However in my case there is only length of $6$ instead of $n^2 = 9$ .   My question is, how will I solve this problem and find the key? Or, since this is an obvious homework question, what should be my way of thinking? I cannot think of anything else but matrix multiplications and inverses but they do not help me at all.


I am getting the error  'ping' is not recognized as an internal or external command, operable program or batch file. when I try to run ping www.google.com. I think this has to do with the path environment variable. I changed it to C:\Program Files\Java\jdk1.8.0_112 to make Java run on the command line, but now simple commands are not working. What should I change the path variable back to in order for this to work? (assuming that is the problem). I have Windows 10 installed. Thank you

After having poorly handled the PATH system variable (resulting in deletion), I'm now looking to reinstate the variable with the original value. I found answers like  about Windows 8 and below, but not for Windows 10. I guess values are virtually identical, but I'd like to know the exact string so I'm not missing anything. EDIT: Also, Regedit tree have changed and I'm not able to locate the variable


First of all, I am not a WP superuser. Recently a friend of mine got hacked, by hacked I mean he didn't update his WP for a long time and got malicious code injected which sent spam, so his hoster blocked him. He only has the infected files, which were already checked and cleaned by a developer...by hand. Now I should setup a new server running his code. But I would like to let a tool check the code of the theme at least and DB. I will setup a fresh installation and re-install the plugins, to make sure that these are free of bad code. So what I have is only the hand-cleaned code, so I don't know what injection we had before, so I can't search for the same pattern or anything.  I found some tools, which check the WP-Website for bad code, like sucuri - sitecheck, but this is not an option for me. I would like to check the code locally. What do you guys recommend me to do?

My for-fun WordPress blog at  (running WordPress 3.1.1) got hacked -- it was showing an <iframe> on every page like so:  <iframe src="http://evilsite.com/go/1"></iframe> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">  <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">    I did the following   Upgraded to 3.1.3 via the built-in WordPress upgrade system Installed the  (lots of critical warnings on unusual files) and  (this showed all green and clean, so I uninstalled and removed it after running) Changed MySQL password. Changed all WordPress user passwords. Connected via FTP and downloaded the whole filesystem (not large, this is a WordPress-only Linux shared host) Diffed the filesystem against an official ZIP of WordPress 3.1.3 and removed or overwrote anything that did not match.   I am quite sure that    all the files on disk are official WordPress 3.1.3 files there are no "extra" files on disk other than my one /theme, the Exploit Scanner plugin (which I just downloaded), the /uploads folder, and a tiny handful of other expected files. My other plugin, wp-recaptcha, matches the current official downloaded version. I also checked the .htaccess file and nothing looks wrong there     I did not touch the database, but I am struggling to think how anything in the database could be malicious without special PHP code to make it work?  My WordPress blog appears OK and hack-free now (I think), but is there anything else I should check?


OK this is purely out of curiosity: I was expecting the following markup to be valid inside an HTML document:    <script>   var test = "<script>why? </script>"; </script>     But no: this results in an "unterminated string constant" error, the first occurrence of </script> terminating the block, even though it's enclosed with quotes.  Can someone explain why this is happening (links to a specification appreciated :)?

Why do some sites (or advertisers that give clients javascript code) employ a technique of splitting the <script> and/or </script> tags up within document.write() calls?  I noticed that Amazon does this as well, for example:  <script type='text/javascript'>   if (typeof window['jQuery'] == 'undefined') document.write('<scr'+'ipt type="text/javascript" src="http://z-ecx.images-amazon.com/images/G/01/javascripts/lib/jquery/jquery-1.2.6.pack._V265113567_.js"></sc'+'ript>'); </script>


I am new to Ubuntu. I have Windows XP Professional 32-bit on one 300GB IDE hard drive and Ubuntu 14.04 running on another 61GB IDE hard drive, and I cannot get my Windows XP to boot with Grub! When I select Windows XP from the boot menu, Grub just restarts my computer. The computer I have with those two hard drives is a Dell Optiplex GX240, so the hardware is old, and its BIOS won't let me change the boot priority on the two IDE hard drives.  What can I do now? Is there a step I missed when installing Ubuntu? Can I edit Grub to boot Windows XP without messing with the BIOS? Do I have to downgrade to an older release of Ubuntu to make it work? I am willing to reinstall Ubuntu, if that's what it takes.

I sent this to boot.repair@gmail.com, still no response thought I could get a faster solution here.  I am running Windows 7 64-bit and Ubuntu 12.04 LTS on separate partitions.  The message is sent is:  Boot-Repair URL:    Originally I was unable to access Ubuntu after a windows update (Ubuntu was installed using wubi). Rather than logging into Ubuntu from the Windows 7 Bootloader, it lead to the grub> command prompt.  No matter what I did here, it would not log me into linux.  As a result I uninstalled Ubuntu from the Add/Remove Programs application in Windows 7.  I then re-installed Ubuntu 12.04 LTS using a liveCD-USB.  This time however, I created a partition.  I then restarted and got the GRUB bootloader which loads Ubuntu 12.04 LTS with no problems, however when I select windows (listed as "Windows 7 (loader)"), it just refreshes the grub bootloader instead of loading Windows 7.  I then used the Windows 7 repair disk to run bootrec/fixmbr and bootrec/fixboot.  This led to no bootloader coming up when I started my computer.  Instead I got a blank black screen with a flashing white cursor.  I went on to do a bootrec/buildbcd and bootrec/scanos.  These did nothing to change the situation.  When I ran bootrec/scanos it said that no Windows 7 installations were present.  After this I decided to reinstall WIndows 7 only for this to do nothing to change the situation.  Afterwards I did a boot-repair in which I began to get the GRUB bootloader, which would load ubuntu 12.04 LTS, but still would not load Windows 7.  I also did a sudo update-grub which recognized Windows 7 as being installed, but still didn't fix the issue of loading Windows 7.  While running Ubuntu I have no problem accessing my WIndows 7 partition which is formatted as NTFS.  It shows all the files and folders reflecting that the re-install did take place, and it also shows all of my old applications and folders in the Windows.old folder.  I am completely stuck at this point and have no clue what I should do next.  Any help you can offer me will be greatly appreciate.  Thank You  --gap


I have a PDF file with 120 pages. How can I extract only pages 20-30 and save it as another PDF file? I am using free version of Foxit Reader. It doesn't have this facility. Any solution?

Acrobat Reader allow us to easily save a copy of the PDF document. How can I save only from page 5 to 10 without purchasing a PDF editing tool?


What is a simple way to solve this problem? I can solve the problem by counting all possibilities.     How many distinct values can be obtained for the expression $1/2/3/5/7/11/13/17$ if an unlimited number of parentheses may be placed in the expression?

I solved this problem by manually adding parentheses and counting them, and got correct answer of 32. Is there a simple to find the answer? Thanks.     The value of the expression $1÷2÷3÷5÷7÷11÷13$ can be altered by including parentheses. If we are allowed to place as many parentheses as we want, how many distinct values can be obtained for this expression?


I've a problem with GPU activation in blender. I've found same problem  already, however it didn't help.  I've a GeForce 750Ti graphics card with proprietary drivers installed (not from site but from repo) version 334.  I've also installed nvidia-cuda-toolkit package. Nothing helps.  Is there any way to run blender in a verbose mode from console to find out what's wrong in cuda detection?

I want to enable GPU rendering, but there is no option in User Preferences > System:    Why is this? How can I get cycles to render using my GPU?


Is time continuous or discrete? Is even this question a valid question? If you say, it all depends on resolution then assume the best possible resolution achievable. If it is discrete, then what about space? More specifically, what about space-time?

I was coding a physics simulation, and noticed that I was using discrete time. That is, there was an update mechanism advancing the simulation for a fixed amount of time repeatedly, emulating a changing system.  I though that was interesting, and now believe the real world must behave just like my program does. It is actually advancing forward in tiny but discrete time intervals?


Say I have a laptop and an Ubuntu server. There is a heavy task that I want to perform on Ubuntu server.  So far, I connected to the server through SSH and perform it. However, when I need to shut down the laptop (leaving the office), the SSH session is lost and I have no idea what is going on with the process.  Is there a solution that I can let the process run on Ubuntu server, and tomorrow morning when I turn my laptop on I can resume checking what's happening with the process?

I have a bash script that takes several hours to run.  While it's running, I would like to do other things, which may involve logging out or disconnecting from the internet (my script runs network tests on various computers).  I understand that there is a command that would allow me to run my tests from a remote terminal and logout of the terminal while it runs.  Does anyone know what this command is?


Kindly tell me what is the value of:  $\sqrt{1+2\times\sqrt{1+3\times\sqrt{1+4\times\sqrt\cdot.....}}}$  According to ramanujan ,it is equal to 3  I want to know how...

How does one prove the following limit? $$   \lim_{n \to \infty}   \sqrt{1 + 2 \sqrt{1 + 3 \sqrt{1 + \cdots \sqrt{1 + (n - 1) \sqrt{1 + n}}}}} = 3. $$


With my reputation on Stack Overflow, I am allowed to make edits to questions and they will become immediately visible. However, sometimes there is a question and someone edited it, I call up the edit and approve it. But then it needs three more approval votes before the edit becomes visible. Seems a contradiction?

I already have the "Edit Questions And Answers" privilege. Yet, if I approve someone else's edit, I'm told that more votes will be required before the edit is accepted.  This seems a bit peculiar to me, since I could just copy the edited version and paste it myself.


I'm trying to learn Google's c++ compression library Snappy. It requires that data be loaded into an std::string to compress or decompress it. How can I go about opening a file and loading the data into an std::string. Thanks.

How do I read a file into a std::string, i.e., read the whole file at once?  Text or binary mode should be specified by the caller. The solution should be standard-compliant, portable and efficient. It should not needlessly copy the string's data, and it should avoid reallocations of memory while reading the string.  One way to do this would be to stat the filesize, resize the std::string and fread() into the std::string's const_cast<char*>()'ed data(). This requires the std::string's data to be contiguous which is not required by the standard, but it appears to be the case for all known implementations. What is worse, if the file is read in text mode, the std::string's size may not equal the file's size.  A fully correct, standard-compliant and portable solutions could be constructed using std::ifstream's rdbuf() into a std::ostringstream and from there into a std::string. However, this could copy the string data and/or needlessly reallocate memory.    Are all relevant standard library implementations smart enough to avoid all unnecessary overhead?  Is there another way to do it?  Did I miss some hidden Boost function that already provides the desired functionality?     void slurp(std::string& data, bool is_binary)


So, I am attempting to add an image to a post and I get an error the image of which, ironically, I have posted along with this post.   What is causing this error ??    Link here:

^^^^^^ Here is an image.   I've just tried to upload the screen shot for this question and I've seen that the upload image from computer doesn't work.  It must be fixed.  Clicking the image link I receive the following error on the page:     DNS Points to Prohibited IP You've requested a page on a website   (img.stack.imgur.com) that is on the CloudFlare network.   Unfortunately, it is resolving to an IP address that is creating a   conflict within CloudFlare's system. If you are the owner of this   website, you should login to CloudFlare and change the DNS A records   for img.stack.imgur.com to resolve to a different IP address.      Timestamp: Fri, 28-Jun-13 05:23:58 GMT      Your IP address: XXX.X.XX.XXX      Requested URL: img.stack.imgur.com/qhEV9.png0      Error reference number: 1000      Server ID: FL_11F1      Process ID: PID_1372397038.656-1-9635161      User-Agent: ....


I get the following from sudo fdisk -l  Device       Start        End   Sectors   Size Type /dev/sda1     2048    1050623   1048576   512M EFI System /dev/sda2  1050624 1000214527 999163904 476.4G Linux filesystem   but my ADATA SU800 should have 512 GB total.   My last Ubuntu install got corrupted or something and now I can't seem to delete it.

I created an ext4 partition to back-up my files to, and partitioned it for 102GB in Gparted using a live USB. After I booted into Ubuntu, I opened Disk Utility, and it said that the partition was actually 108GB. Confused, I opened the mounted partition in Nautilus, and it said the partition was only 98GB.  Which is correct? Did I partition it wrong?


I have two JSON objects as follows.  var j1 = {name: 'Varun', age: 24}; var j2 = {code: 'NodeJS', alter: 'C++'}   I need to update JSON j1 with j2.  Desired output   {name: 'Varun', age: 24, code: 'NodeJS', alter: 'C++'};   Is there any inbuild function in NodeJS to do this, instead of writing our own code.  Thanks and Regards,  Varun

I need to be able to merge two (very simple) JavaScript objects at runtime.  For example I'd like to:  var obj1 = { food: 'pizza', car: 'ford' } var obj2 = { animal: 'dog' }  obj1.merge(obj2);  //obj1 now has three properties: food, car, and animal   Does anyone have a script for this or know of a built in way to do this?  I do not need recursion, and I do not need to merge functions, just methods on flat objects.


In my local repo I have 3-4 branches and when I work on one of these, the changes I do in it spread across all my other ones. In fact if I git reset --hard origin one of these, it reset every single local branch.   How should I keep my changes restricted in only one branch?  Note that I'm noob on git.

I am working on a git repository with a master branch and another topic branch. I have switched to topic branch and modified a file. Now, if I switched to master branch that same file is shown as modified.   For example:  git status in git-build branch:  # On branch git-build # Changes to be committed: #   (use "git reset HEAD <file>..." to unstage) # #       modified:   cvsup_current #   Switch to master branch  [root@redbull builder_scripts (git-build)]# git co master M       builder_scripts/cvsup_current Switched to branch "master"   git status in master branch  [root@redbull builder_scripts (master)]# git status # On branch master # Changes to be committed: #   (use "git reset HEAD <file>..." to unstage) # #       modified:   cvsup_current #   Why is that the file is shown as modified in master branch even though it was modified in git-build branch?   My understanding was that the branches are independent of each other and when I change from one branch to another the changes do not "spill over" from one branch to another. So I am obviously missing some thing here.   Anyone got a clue stick?


Maybe I am not the first one who got this idea.  There are many programming questions asked and answered on these sites. My idea is when the question or answer consists of a lot of code and the user wants it, he must copy-paste it. So how about providing a download button which will download the code as a file?

I might just be lazy, but do you ever find it tiresome to select all the source code from a large post on Stack Overflow to copy it?  I would like a feature, possibly a Firefox extension, but preferably a JavaScript script, for automatically copying source examples to the clipboard. It's no big deal for a small snippet, but a 1000+ line posting is cumbersome to copy.  Do you guys have a better way of copying large source posts? I'm using Firefox 3.5.5 on Windows 7.


I'm having trouble with the following problem     If you toss 1000 fair coins 10 times, what is the probability that some coin will get 10 heads?   I have tried to use the binomial distribution, but I think I'm missing something since we have multiple coins.

The answer to this is supposedly close to $0.63$. However, I get approximately $0.9765625$ for the following reason:  The probability of a fair coin flipped $N$ times resulting in all heads is $1/2^N$. In this case, $1/2^{10}=1/1024$. If I flip $M$ coins, $N$ times each, there are $M$ ways for some coin to result in all heads (from the binomial coefficient "$M$ choose $1$"), so the probability of some coin resulting in all heads is $M(1/2^N)$. In this case, $1000\times 1/1024 \approx 0.9765625$.  Can someone please explain the flaw in my reasoning?


I want to download an older version of the Disney Now iOS app. The version I have installed is currently up to date, but I want one that is older.  Is there a way to do that?

I want to install the  on my iPhone. On the phone I have iOS 7. When I try to install the App, it tells me it needs at least version 8 of iOS.  I do not want to upgrade my iOS version, especially for the sole purpose of installing an App. However, I do want to use it, it's kind of important.  I searched for a while about how to do this, but I could only find solutions that would work if you installed the App before and it shows up on the "Purchases" page in iTunes or something like that. And this doesn't apply to this case.    How can I install an older version of the App (one that requires "only" iOS 7) without having to upgrade the operating system on my iPhone ?


We are forced to install ClearPass OnGuard which seems to require gksu which was removed from Linux distributions. Is there a way to get it from some 3rd party PPA or other source? Preferably, updated to work well with Ubuntu Disco 19.04.

I downloaded the Upwork desktop App on ubuntu 18.04. When I open it with Gdebi package installer I saw this error:    I tried to install gksu manually via sudo apt install gksu but I got this error  Building dependency tree        Reading state information... Done Package gksu is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'gksu' has no installation candidate   How can I install this software on ubuntu 18.04 (I download it yesturday so it is the most recent version on upwork website) ?


I'm experimenting with loop-able worlds that have a height-map for terrain data.  While I can easily create loop-able .BMP textures for this in Photoshop and just load the terrain from them, but that limits the size and variance of the worlds to whatever I pre-generate for the player.  I would like to proceduralize the process. I have got a simplex terrain and a perlin terrain generator and I'd like to wrap them so that the world loops back around to the same place if you travel in a straight line in any direction North East South West  What would be the best techniques to use to wrap the noise to a tillable terrain.  This question Different as it is for both perlin AND simplex. It is also different as I forgot to mention I am using 3D noise for some of my work.

Related:       I'd like to generate tileable Perlin noise.  I'm working from  PerlinNoise*() functions, which are like this:  // alpha is the "division factor" (how much to damp subsequent octaves with (usually 2)) // beta is the factor that multiplies your "jump" into the noise (usually 2) // n is the number of "octaves" to add in double PerlinNoise2D(double x,double y,double alpha,double beta,int n) {    int i;    double val,sum = 0;    double p[2],scale = 1;     p[0] = x;    p[1] = y;    for (i=0;i<n;i++) {       val = noise2(p);       sum += val / scale;       scale *= alpha;       p[0] *= beta;       p[1] *= beta;    }    return(sum); }   Using code like:  real val = PerlinNoise2D( x,y, 2, 2, 12 ) ; // test  return val*val*skyColor + 2*val*(1-val)*gray + (1-val)*(1-val)*cloudColor ;   Gives sky like    Which isn't tileable.  The pixel values are 0->256 (width and height), and pixel (0,0) uses (x,y)=(0,0) and pixel (256,256) uses (x,y)=(1,1)  How can I make it tileable?


Context: I'm writing a translator from one Python API to another, both in Python 3.5+. I load the file to be translated with a class named FileLoader, described by Fileloader.py. This file loader allows me to transfer the file's content to other classes doing the translation job. All of the .py files describing each class are in the same folder I tried two different ways to import my FileLoader module inside the other modules containing the classes doing the translation job. One seems to work, but the other didn't and I don't understand why. Here are two code examples illustrating both ways: The working way import FileLoader  class Parser:     #     def __init__(self, fileLoader):          if isinstance(fileLoader, FileLoader.FileLoader)              self._fileLoader = fileLoader          else:              # raise a nice exception  The crashing way class Parser:      import FileLoader     #     def __init__(self, fileLoader):          if isinstance(fileLoader, FileLoader.FileLoader)              self._fileLoader = fileLoader          else:              # raise a nice exception  I thought doing the import inside the class's scope (where it's the only scope FileLoader is used) would be enough, since it would know how to relate to the FileLoader module and its content. I'm obviously wrong since it's the first way which worked. What am I missing about scopes in Python? Or is it about something different?

What exactly are the Python scoping rules?  If I have some code:  code1 class Foo:    code2    def spam.....       code3       for code4..:        code5        x()   Where is x found?  Some possible choices include the list below:   In the enclosing source file In the class namespace In the function definition In the for loop index variable Inside the for loop   Also there is the context during execution, when the function spam is passed somewhere else. And maybe  pass a bit differently?  There must be a simple reference or algorithm somewhere.  It's a confusing world for intermediate Python programmers.


I understand the principle of image convolution. Maybe. I think it is this:  You use a small matrix with numbers in it,  Then take a sample of an image with as many pixels as you have numbers in your matrix,  Then do a dot product, then add up all the terms and   then use the result as the new value for the pixel located in the center of your image sample.  Now, my question is this:  Does it make sense to think about an image kernel for convolution whose values actually depend on the image? For example, consider a 'sharpen' kernel:   0  1  0  1  4  1 0  1  0   I want to change the value in the center to be a number between 1 and 5 depending on the brightness of the pixel which is two places to the left.  The reason I ask this is because I've noticed that when I look at an image, I actually look at 'neighborhoods'. not just individual pixels. While bright spots might catch my attention. I recognize parts of an image before it 'clicks'. So if I am using some parts of an image to inform me about the 'neighborhood' that part lives in, I am wondering if this sort of 'dynamic kernel' could produce a matrix that informs us more meaningfully about the image. Obviously I am naive and know very little about image processing but a lot of papers on image convolution get technical very fast and then I'm lost. I am afraid to ask this on stack overflow because there is no specific code I am asking about..  EDIT: The link you posted does not have any mention of the signal processing site. As the question has no specific coding it is therefore not a question for stack overflow. Whether it belongs in math, signal processing or other section is not immediately obvious to a neophyte. I appreciate the recommendation to post on signal processing.

There seems to be more than a few computer science/programming Stack Exchange networks (is that the correct term?). Stack Overflow, being the first, has by far the most users, questions, and answers.  What is the reasoning for creating the others, and are there clear guidelines for which kinds of questions should be posted? I can see a large amount of potential overflow, many cases of people not getting a good answer to their question, because the person who has the answer isn't browsing that particular network at the moment.  I understand that they were probably created for organizational purposes, but wouldn't it almost make more sense to just have them as categories under Stack Overflow, keep them separated but still connected, instead of making people have to create multiple 'account's, one for each network?  I am sure there was a very good reason to break them up, but as someone that is new to SE, it can be somewhat intimidating to decide which one to post in to ensure you get a good answer. For example, if I am a computer science student, my first instinct might to be to post in the computer science network, until I see that it literally has 1% of the users as the Stack Overflow network, which still seems to be for programming/computer science related questions.  So my second instinct would then to be to post it into the Stack Overflow site on the basis that I have a significantly higher chance of my question being seen and getting a good answer. Then I notice that there is also a 'programmers' network, and I don't even begin to know where that fits in. I, and I am assuming most people, will probably just post on Stack Overflow to be safe.  My question is, other than the short little description blurb of each one, is there a clear cut set of guidelines which what each network is intended for, what kinds of questions should go to each one, and is anything being done to encourage people to post in these newer, smaller (more specialized?) networks as opposed to just posting in big daddy Stack Overflow?  Now again, this is for computer science/programming/"why isn't this code doing what I want?" related questions, I am not saying that if I had a question about Linux or WordPress or something I would have the same confusion.


I am using plank dock so I want to completely disable the unity launcher in ubuntu 16.04.  I used the autohide method and set the reveal pressure very high. But there are there are two problems with this method:   When I open unity dash by pressing the Super key, the launcher reveals. When I minimize an application then the app icon pops out from left side of the hidden launcher.    I want to completely disable it.

I would like to modify unity to not show the launcher (left side bar) at all. I'm not looking for any solution that would let the launcher be in some cases visible. I really want it to completly disappear. It's a gift for my fiance and I want to achieve the highest possible Woman Acceptance Factor for her linux laptop which is running a docky dock with fancy icons that make it look like being from that known and fruity company.  Any hints about which packages and which source files I should study?   I'm hoping it to be as easy as commenting out the line with "unity.launcher.show()" and recompiling :-)  Thank you!


First of all I followed the advice given in the links:    Just like they asked I repaired the grub using an ubuntu live disk  and boot repair. And I uploaded the log to   And for some weird reason it got deleted.    If I reinstalled Ubuntu, that would technically repair the boot right?  UPDATE: Reinstalling 17.04 doesn't work, it still loads into Windows.

I've just upgraded to Windows 10 from Windows 8.1 on my partitioned laptop that has Ubuntu 14.04 installed. Grub no longer appeared on boot so I ran boot-repair from an Ubuntu liveUSB. This didn't seem to have any effect. I've checked and secure boot is still disabled. Log from boot-repair:  So what's next?  Update: I've attempted to use chroot to update grub from my Ubuntu partition. update-grub runs successfully finding both linux and windows boot manager but the process still doesn't have any effect. grub-install complains that it cannot find EFI directory (but I have mounted everything correctly).  Update2: Just discovered that running efibootmgr after chroot into ubuntu shows ubuntu as not being in the boot order at all. I manually changed the order and rebooted to discover that the bootorder was reset. I run in windows: bcdedit /set {bootmgr} path \EFI\ubuntu\shimx64.efi But this has no effect either even after reporting 'Operation Successful'.


I'm looking for a short story about how scientist aliens look at earth from afar and see a violent race bent only on killing each other. The aliens decide to destroy earth as to eradicate the threat to the galaxy/universe.  The weapon (a laser) takes some time (hundreds of years?) to reach Earth, meanwhile, the aliens see that humanity has evolved and has become peaceful towards itself and start to regret their impending doom.  After Earth is destroyed, most(?) of the planets of our system light up in mourning and a human fleet is sent towards the source of the laser.  The last thing I remember is a quote that is sent to the aliens at the end stating "We see you" or something along those lines.

The story is basically told from an alien's point of view. Essentially they observed us from far off, deemed us as violent and a danger to the universe, and set course (asteroid or something) to kill us. They kept observing and saw all the art and beauty we created and realized we were actually not so bad, but by then they couldn't stop it. So it was sort of also an apology letter to Earth in the end.  First read it like a year ago online and I can't find any trace of it anymore, nor can I recall the site it was on. Anyone know what short story this is?


Its not duplicate. Where can i find old fligh status free of charge? I need to check BA 677 flight on 31 July 2016. Flightstats and flightAware are with payment.

Where can I find historical data on flights, specifically Delta international flights?  I need to find out about cancellations, diversions and any other flight data pertaining on particular route at a given time.  This source has to be official and stand up to legal scrutiny.


Let $n$ be any natural number. Prove that $\left[\dfrac n1\right]+ \left[\dfrac n2\right] + \left[\dfrac n3\right]+\cdots+\left[\dfrac nn\right]+\left[\sqrt n\right]$ is even.    I tried this by taking two different cases, when, $n$ is even and when $n$ is odd. But I could not establish any relation between the two. Please help to solve this problem and thanks a lot in advance.  P.S. Although nothing is mentioned in the question I think $[\ ]$ stands for greatest integer function as otherwise the sum would be in a fraction which is not even as only natural numbers are regarded as even.

Let $n$ is a natural number. Prove that $$\left\lfloor\frac{n}{1}\right\rfloor+\left\lfloor\frac{n}{2}\right\rfloor+....+\left\lfloor\frac{n}{n}\right\rfloor+\left\lfloor{\sqrt{n}}\right\rfloor$$   is even.   I used induction and the inequality $$x-1<\lfloor{x}\rfloor\le{x}$$ to prove it.  Is there any other, nicer way to do it?


for a user (user A) I have several tables (table1, table2, ..., table n) that have the same fields (field1, field2, field3, field4), I would like to know the name of the table containing the value x for field 4 (where field4 = x)

Is it possible to search every field of every table for a particular value in Oracle?  There are hundreds of tables with thousands of rows in some tables so I know this could take a very long time to query. But the only thing I know is that a value for the field I would like to query against is 1/22/2008P09RR8. <  I've tried using this statement below to find an appropriate column based on what I think it should be named but it returned no results.  SELECT * from dba_objects  WHERE object_name like '%DTN%'   There is absolutely no documentation on this database and I have no idea where this field is being pulled from.  Any thoughts?


Why it's so that in convolutional neural networks we generally take the image dimensions of input image to be generally a square? We even do padding to make it happen. Why not different dimensions?  What I understood is that computer computes multiplication and division (by 2) much faster than the rest.  Can someone shed some light on this?   Any link or reference will be appreciated. I already have CS231n notes and lecture slides.

Most of the advanced deep learning models like VGG, ResNet, etc. require square images as input, usually with a pixel size of $224x224$.  Is there a reason why the input has to be of equal shape, or can I build a convnet model with say $100x200$ as well (if I want to do facIAL recognition for example and I have portrait images)?  Is there increased benefit with a larger pixel size, say $512x512$?


I was really excited, cause I hit 1k on elu today, and was looking forward to seeing the breakdown of upvotes and downvotes, when I realized it doesn't seem like there's a way to do this on the mobile version of the site.  Is there a way to do this?  Or is the privilege reserved for the full desktop site.

On the mobile site, can there be a button directly below the vote up/down buttons for viewing vote counts? When I am using the mobile site and I want to view vote counts, I have to switch to the full site to do it which is very inconvenient.   It could be a small link that says "vote counts," because I don't know what the button would be (the letter "V?" a "+/-" thing? I have no idea).  Related:  , but I am requesting an additional button below the vote buttons. That way you won't accidentally click a vote button.


I am trying to install JRE 8 to use minecraft, but I got a .tar.gz file. I have extracted the file, it is called JRE1.8.0_201 on my desktop, but I don't know what to do. Can I please have some help here? The guides I have looked at don't show what to do in a clear way.

How do I install Java, including in my browser, so websites with Java work?


Related to   I'm wondering if it's okay to include another person's comments in your answer. See this:     If the person answering the question were to get their answer accepted because of copying another person's comment into their answer, it seems like that might be "rude" (or some such related adjective) to the commenter. Is this a permissible practice?

I have answered . My answer had links to valuable information in context of the problem, but the conclusion was useless (striked through in my answer). Another user gave correct solution to the problem in question, in the comment to the answer.  I decided to quote his comment, so my answer would be more likely upvoted. (I could say also: to make my answer complete and more informational; but to be honest, in the end it is because of the reputation :) )  Although I quoted it, because of the reputation issue, I'm not sure how ethical it is. On the other hand, reputation is just a mechanism for getting quality answers to clearly stated practical questions, in short for the site to have the qualitiy and valuable practical information.   So, my questions are:   is this action ethical? is this action acceptable? does this action indeed add to the quality of solution of the problem in question (e.g for some unknown (probably, but not neccessary, non SO user) surfer who stumbles upon it searching for the solution)?


There are too many parameters while building an artificial neural network. Some of which that comes to my mind are:  Number of layers Types of layers Number of nodes in each level of layer Activation functions in each layer Ordering of the layers Different types of optimizers Different types of loss functions Batch size while fitting Epochs while fitting  The lone fact that the number of layers might be in the order of tens and the number of nodes might be in the order of thousands implies that we can end up with billions of different combinations. Considering all the parameters in the list above, how can one know that their model is close to the optimum ? The cases I study on does not require me to be too precise in terms of r2_score. In other words, it would not make a huge difference if the r2_score is 0.85 or 0.87. But the question is how do I know if I am real close to the saturation point of the r2_score for the given data, i.e. the optimum model would yield an r2_score of 0.90 and I am not stuck at 0.80?

Is there a standard and accepted method for selecting the number of layers, and the number of nodes in each layer, in a feed-forward neural network? I'm interested in automated ways of building neural networks.


I wanted to know is, is it violate any rules if I wrote a blog post for a given question and post it as a answer for that question.  There might be many reasons that answer is more suited as a blog post, like answer can be too long, have strong links to previous set of posts, etc.

I know that putting a link to your blog in a signature is frowned upon and rightly so.  Is it okay to link to your blog in an answer if that blog post answers the question?  Are there other situations where it would be acceptable to promote your own web site in a question or answer?  Related:


I'm looking for an object like a ConcurrentQueue which will allow me to await the Dequeue operation if the queue is empty so I can do something like the following:  public static async Task ServiceLoop() {      var awaitedQueue = new AwaitedQueue<int>();      while (!cancelled) {         var item = await awaitableQueue.Dequeue();         Console.WriteLine(item);     }  }   I've written the following class, but if an item is added to the queue between the time Dequeue is called and a new awaiter is Enqueued, terrible things will happen.  public class AwaitedQueue<T> : IDisposable {      ConcurrentQueue<TaskCompletionSource<T>> awaiters = new ConcurrentQueue<TaskCompletionSource<T>>();      ConcurrentQueue<T> items = new ConcurrentQueue<T>();      public AwaitedQueue() { }      public void Enqueue(T item) {         if (!awaiters.TryDequeue(out TaskCompletionSource<T> awaiter)) {             this.items.Enqueue(item);         } else {             awaiter.SetResult(item);         }     }      public async Task<T> Dequeue() {         if (items.TryDequeue(out T item)) {             return item;         } else {             // If an item is enqueued between this call to create a new TaskCompletionSource.             var awaiter = new TaskCompletionSource<T>();             // And this call to actually enqueue, I believe it will cause me problems.             awaiters.Enqueue(awaiter);             return await awaiter.Task;         }     }      public void Dispose() {         while (awaiters.TryDequeue(out TaskCompletionSource<T> awaiter)) {             awaiter.SetCanceled();             awaiter.Task.Wait();         }     } }   I'm sure a robust and well-tested implementation of this concept already exists, but I don't know which combination of English words I need to type into Google to find it.

I have a scenario where I have multiple threads adding to a queue and multiple threads reading from the same queue. If the queue reaches a specific size all threads that are filling the queue will be blocked on add until an item is removed from the queue.  The solution below is what I am using right now and my question is: How can this be improved?  Is there an object that already enables this behavior in the BCL that I should be using?  internal class BlockingCollection<T> : CollectionBase, IEnumerable {     //todo: might be worth changing this into a proper QUEUE      private AutoResetEvent _FullEvent = new AutoResetEvent(false);      internal T this[int i]     {         get { return (T) List[i]; }     }      private int _MaxSize;     internal int MaxSize     {         get { return _MaxSize; }         set         {             _MaxSize = value;             checkSize();         }     }      internal BlockingCollection(int maxSize)     {         MaxSize = maxSize;     }      internal void Add(T item)     {         Trace.WriteLine(string.Format("BlockingCollection add waiting: {0}", Thread.CurrentThread.ManagedThreadId));          _FullEvent.WaitOne();          List.Add(item);          Trace.WriteLine(string.Format("BlockingCollection item added: {0}", Thread.CurrentThread.ManagedThreadId));          checkSize();     }      internal void Remove(T item)     {         lock (List)         {             List.Remove(item);         }          Trace.WriteLine(string.Format("BlockingCollection item removed: {0}", Thread.CurrentThread.ManagedThreadId));     }      protected override void OnRemoveComplete(int index, object value)     {         checkSize();         base.OnRemoveComplete(index, value);     }      internal new IEnumerator GetEnumerator()     {         return List.GetEnumerator();     }      private void checkSize()     {         if (Count < MaxSize)         {             Trace.WriteLine(string.Format("BlockingCollection FullEvent set: {0}", Thread.CurrentThread.ManagedThreadId));             _FullEvent.Set();         }         else         {             Trace.WriteLine(string.Format("BlockingCollection FullEvent reset: {0}", Thread.CurrentThread.ManagedThreadId));             _FullEvent.Reset();         }     } }


I am trying to install git-all using the following commands:  sudo apt update sudo apt install git-all   and I get the following results:  jonathan@Aristotle:~$ sudo apt install git-all Reading package lists... Done Building dependency tree        Reading state information... Done git-all is already the newest version (1:2.7.4-0ubuntu1). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 2 not fully installed or removed. After this operation, 0 B of additional disk space will be used. Do you want to continue? [Y/n] y Setting up runit (2.1.2-3ubuntu1) ... start: Unable to connect to Upstart: Failed to connect to socket /com/ubuntu/upstart: Connection refused dpkg: error processing package runit (--configure):  subprocess installed post-installation script returned error exit status 1 dpkg: dependency problems prevent configuration of git-daemon-run:  git-daemon-run depends on runit; however:   Package runit is not configured yet.  dpkg: error processing package git-daemon-run (--configure):  dependency problems - leaving unconfigured No apport report written because the error message indicates its a followup error from a previous failure.                                                                                Errors were encountered while processing:  runit  git-daemon-run E: Sub-process /usr/bin/dpkg returned an error code (1)   I found this response to a similar question:  but none of the solutions mentioned in it worked for me. Any ideas on how I can proceed from here?

I am using 15.04.   So I'm working with git and I installed the standard version. I set up the ssh keys and was able to clone one of my repositories to the correct folder. Everything was working great and then I decided it was a good idea to install more packages. I ran sudo apt-get install git-all. I'm looking at error codes now having to deal with upstart.  start: Unable to connect to Upstart: Failed to connect to socket /com/ubuntu/upstart: Connection refused No apport report written because the error message indicates its a followup error from a previous failure. dpkg: error processing package runit (--configure):  subprocess installed post-installation script returned error exit status 1 dpkg: dependency problems prevent configuration of git-daemon-run:  git-daemon-run depends on runit; however:   Package runit is not configured yet.  dpkg: error processing package git-daemon-run (--configure):  dependency problems - leaving unconfigured Errors were encountered while processing:  runit  git-daemon-run E: Sub-process /usr/bin/dpkg returned an error code (1)   This is what happens when I even update/upgrade my system. At this point all I'm looking to do is be able to install software and update my current software. Is there any way I can potentially reverse this issue or at least correct it?   Edit: Thankfully this issue was solved only a day or two after it happened. The accepted answer worked perfectly and took care of my issue


Are there any libraries in Ubuntu for converting video files into another format??

I need a good video converter application that can convert from/to many video formats. On Windows I found  to be good. I would like its equivalent or something better on Ubuntu.


I am in for a requirement where I need to use EE to capture the Objects Accessed by a particular SQL User. I want to avoid the action sqlserver.sql_text, if I use this, I will need to manually scan though the data which may be prone to missing some data or incorrect results. Is there an alternative to using sqlserver.sql_text

I often see questions where people want to know if a certain thing happened, or when it happened, or who performed the action. In a lot of cases, SQL Server just doesn't track this information on its own. For example:   Who last executed stored procedure dbo.MyProcedure? Who updated the salary column in the dbo.Employees table? Who last queried the dbo.Orders table from Management Studio?   But there are several other events that SQL Server does track temporarily by default, and can natively answer questions about, such as:   When was the last time an auto-grow happened in the AdventureWorks database, and how long did it take? Who deleted the dbo.EmployeeAuditData table and when? How many memory-related errors have happened today?   How do I get this information, and how long does it stay available?


This question differs from e.g.    since if it is known that the cause of the described problem is "the difference between g++ and gcc", there's no need to look for an answer anymore. In other words, though the answer is the same, the question is different.  I have the following program test.cpp:  struct CircuitElement {     bool value;     const char *name;     CircuitElement *next;      CircuitElement (const char *name);         virtual void evaluate () = 0;        };  struct Button: CircuitElement {     Button (const char *name);     virtual void evaluate (); };  CircuitElement::CircuitElement (const char *name): name (name), next (0) { }  Button::Button (const char *name): CircuitElement (name) { }  void Button::evaluate () {     // Some statements }  Button button ("button");  int main () {     return 0; }   It compiles alright on www.cpp.sh, but if I compile it with locally with:  gcc test.cpp   I get the following errors:  C:\Users\info_000\AppData\Local\Temp\cceVLVFd.o:test.cpp:(.rdata$_ZTV14CircuitElement[_ZTV14CircuitElement]+0x10): undefined reference to `__cxa_pure_virtual' C:\Users\info_000\AppData\Local\Temp\cceVLVFd.o:test.cpp:(.rdata$_ZTI6Button[_ZTI6Button]+0x0): undefined reference to `vtable for __cxxabiv1::__si_class_type_info' C:\Users\info_000\AppData\Local\Temp\cceVLVFd.o:test.cpp:(.rdata$_ZTI14CircuitElement[_ZTI14CircuitElement]+0x0): undefined reference to `vtable for __cxxabiv1::__class_type_info' collect2.exe: error: ld returned 1 exit status   I must be doing wrong something trivial, and I've been Googling for an answer quite some time, but to no avail.  What am I missing?

What is the difference between g++ and gcc?  Which one of them should be used for general c++ development?


In Thor, it's revealed that Loki knows of non-Bifrost ways to go from one realm to another.  In Thor: The Dark World, we see one of them in action.  How do these inter-realm paths work?  What makes these locations able to transport people between realms?

During Thor's interrogation, Agent Coulson exits the room and Loki enters and informs him that his father Odin had passed away and that he cannot undo his banishment. Not only does he communicate with Thor, but he goes to the area where Mjölnir is embedded in the rock and attempts to lift it, with SHIELD scientists and agents completely oblivious to his presence. Loki shows a similar ability when he converses with 'The Other' and when he manipulates Erik Selvig. Is this a part of Loki's illusion powers or another one of his abilities that has not been addressed? How was he able to visit Earth without using the Bifrost?


Let $f\in L^1(\Bbb R)$ How can I prove that: $$\int_\Bbb R f(x)dx = \int_\Bbb R f(x-\frac{1}{x})dx$$  In fact the changes of variables $u=\phi(x) = x-\frac{1}{x}$ seems correct but the image of zero : $\phi(0)$ does not exists.  How can I avoid this issues? thanks

If $f(x)$ is a continuous function on $(-\infty, +\infty)$ and $\int_{-\infty}^{+\infty} f(x) \, dx$ exists. How can I prove that $$\int_{-\infty}^{+\infty} f(x) \, dx = \int_{-\infty}^{+\infty} f\left( x - \frac{1}{x} \right) \, dx\text{ ?}$$


This question originates from this terrific  by Qiaochu Yuan. For convenience, I copy it here.     Proposition: Any isometry[isometric mapping] $f : X \to X$ of a compact metric space is bijective.      Proof. $f$ is clearly injective. Suppose $f$ is not bijective. Then $f(X)$ is compact, so given $x \in X \setminus f(X)$ the distance   $\text{dist}(x, f(X))$ is positive. Pick $\epsilon < \text{dist}(x, > f(X))$. Let $N$ be the smallest positive integer for which $X$ admits   a cover by $N$ open sets of diameter less than $\epsilon$. No such set   containing $x$ can intersect $f(X)$, but by pulling back along $f$ it   follows that we can find a cover of $X$ by $N-1$ open sets of diameter   less than $\epsilon$; contradiction.   The answer assumes that there exist $x$ such that $\text{dist}(x, f(X))$ is positive, that is to say, $X\backslash f(X)$ has an non-empty interior. This assumption is true due to the fact that $X$ is compact and thus complete.   However, the rest of the proof does not rely on the fact that $X$ is compact. It's true that compactness implies the existence of a cover by $N<\infty$ open sets of diameter less than $\epsilon$, but the latter does not imply compactness. To ensure the existence of such a cover, we just need $X$ to be totally bounded, i.e. $\forall \epsilon,\exists a_1,\ldots,a_n\in X, X\subseteq \cup_{i=1}^nB(a_i,\epsilon)$.  So can anyone give a (counter)example, showing that if $X$ is not compact but is totally bounded, then $f$ can FAIL to be surjective?

Is there an example of a bounded not closed set $A\subset \mathbb R^n$ for some $n\in \mathbb N$ and an isometry $f:A\rightarrow A$ ($\forall x,y\in A\space;\space d(x,y)=d(f(x),f(y))$ where $d$ is the euclidean metric) such that $f$ isn't surjective?


Recently, I discovered the unicode-math package that permits to insert unicode characters inside math environment. This permits, even in its basic configuration, to use all the greek letters and most of the math operators directly in the source file reducing the amount of code like \alpha, \gg, \leq, etc. inside your equation making even complex equation readable directly in the code. This is obviously an huge advantage IMHO but is it without any risk and without drawbacks?  The risk that comes to my mind is to confuse one character for another very similar. While there isn't this possibility using macro, it could happen typing it directly.  The drawback that comes to my mind is that the symbol is fixed, in the sense that its appearance is glued to its semantic meaning. This is a things that usually one should tries to avoid, if possible. i.e. amsmath package gives us six different dots (\dots,\dotsc,\dotso,\dotsb,\dotsi,\dotsm) that have the same appearance but different semantic meaning and one can change the appearance of the symbol of one semantic meaning without affecting the others.  Probably I wrote something wrong or there are more things to say on the subject but my question still remains: is it a bad practice to use unicode-math? If not, what is the best way to use it? There are risks? If yes, what they are? There are drawbacks? If yes, what they are?   I know that that discussion should be posted on meta but this is a discussion about a package, so I think that it's better to post it here. If this isn't the place where asking such a things, please move the question or write in the comments where should I post it.  Edit: As pointed out in by Ulrike Fischer in , I completely miss the whole picture about unicode-math. But my question still remain even if it should be reformulated into this one: What are the pros an cons of using unicode inside math instead of LaTeX macros?  As pointed out in the comments, this could be read as on opinion based question, it is not. I'm not asking which solution is the best in your opinion. I'm asking what are pros and cons of using unicode inside math instad of the classical macros that LaTeX offers.

Is there any pros and cons for using of Unicode (and vice versa) in LaTeX equations?  Consider two examples:  \lim_{h→0}∫_{x_0}^{x_0 + h}\frac{f(t)}{h} = f(x_0)  x_0 ⇔ ∀ 𝜀 > 0, ∃ 𝛿 > 0,(|x-x_0| < 𝛿 ⇒ |f(x)-f(x_0)| < 𝜀)   And without Unicode:  \lim\limits_{h \to 0}\int\limits_{x_0}^{x_0+h}\frac{f(t)}{h}=f(x_0)  x_0 \Leftrightarrow \forall\epsilon > 0, \exists\delta>0,(|x-x_0|<\delta \Rightarrow |f(x)-f(x_0)|<\epsilon)   With latest XeLaTeX the result is the same, so!, what's better?


I built a logistic regression model.  How can I choose the optimal threshold by looking at the ROC?  I want to be able to make the decision if the observation has the event.  acc = read.csv("path to data") View(acc)  set.seed(1) index  <- sample(1:nrow(acc), round(0.75*nrow(acc))) train  <- acc[index,] test   <- acc[-index,] fitTrn <- glm(isOneday~., data=train, family=binomial(link="logit"))  fitted.results <- predict(fitTrn, newdata=test, type='response')  library(ROCR) p   <- predict(fitTrn, newdata=test, type="response") pr  <- prediction(p, test$isOneday) prf <- performance(pr, measure="tpr", x.measure="fpr") auc <- performance(pr, measure="auc")

The plot below was created by R package Epi::ROC for a binary classification problem. There is an optimal cut off or threshold for the classification probability at which sensitivity and 1-specifitiy are balanced in some optimal way (called ps3 in the plot). My question is how this point is defined mathematically in this case and if there are other ways to define it.


i press F3 and it brings up everything except coordinates.Ive tried to start mine craft 1.8 but doesn't work.

When I press F3 to see the debug screen in I use Minecraft 1.8.1, some information is missing.   Most notably, there are no X, Y, Z coordinates.     What happened to my debug overlay?


I normally use the below function to sanitize my form inputs and get values. But this is suddenly stopped working and understand that get_magic_quotes_gpc() feature has been removed from PHP since version 5.4. and cannot enable or configure it anymore, it is permanently set to "off". Right now i'm using PHP 5.6, can somebody suggest me a function like this to sanitise data and prevents SQL injection.  function clean($str) {     $str = @trim($str);     if(get_magic_quotes_gpc()) {         $str = stripslashes($str);     }     return mysql_real_escape_string($str); }

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


I have point of sale system i am working on. C# and MySQL. As I capture a new sale I want to use two tables namely sale and sale_item.   the sale table has the major details of the sale, whilst the sale_item has the individual products being bought with the actual sale as a foreign key.  On clicking save, How do I create a sale record and immediately get its reference to add it on the sale product.  I thought of select max(saleID) but there should be a better way to go about it.

I have a query to insert a row into a table, which has a field called ID, which is populated using an AUTO_INCREMENT on the column. I need to get this value for the next bit of functionality, but when I run the following, it always returns 0 even though the actual value is not 0:  MySqlCommand comm = connect.CreateCommand(); comm.CommandText = insertInvoice; comm.CommandText += "\'" + invoiceDate.ToString("yyyy:MM:dd hh:mm:ss") + "\', " + bookFee + ", " + adminFee + ", " + totalFee + ", " + customerID +  ")"; int id = Convert.ToInt32(comm.ExecuteScalar());   According to my understanding, this should return the ID column, but it just returns 0 every time. Any ideas?  EDIT:  When I run:  "INSERT INTO INVOICE (INVOICE_DATE, BOOK_FEE, ADMIN_FEE, TOTAL_FEE, CUSTOMER_ID) VALUES ('2009:01:01 10:21:12', 50, 7, 57, 2134);last_insert_id();"   I get:  {"You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'last_insert_id()' at line 1"}


I am using a Huawei P10 Lite. This is absolutely insane and I desperately need a solution, I can't even begin to imagine what's causing this. I've been getting the whole "storage space running out" message for a while now, so yesterday I went ahead and I ported 4GB worth of space to my SD card, leaving tons of free local space on my phone. The message dissappeared after this. And yet today I suddenly get the same "storage space running out" message, I go look up the amount of storage I have in settings, and suddenly it says there's only 400mb left, and a few hours later now there's only 200mb left. How is this possible?? I freed up 4GB and now suddenly there's only 200mb left?? Something's very wrong here. I DID NOT DOWNLOAD A SINGLE THING IN THIS TIME PERIOD, NOT ONE THING Some things worth mentioning: -I have auto-updates off, so that's not the issue here -When I check my local folders it all amounts to about 5GB, not even close to 32GB which is the total internal storage of my phone -I already uninstalled updates of built-in apps I don't use, it didn't change this problem -I use Clean Master to delete cache and free up space, but it keeps increasing more and more regardless -Due to certain circumstances I cannot do a factory reset right now and need a different solution If there is any other information you need please don't hesitate to ask This is a massive problem for me and I am desperate for any solution or just fidning the culprit behind this for that matter... thank you all very much for your attention.

I have critical low storage level and can't understand what takes much of it and how that's possible that the installed applications can use 7 GB? I only use a few social media clients without any games or soft like Photoshop. Also on the second screenshot it indicates that the apps are using just 1.13 GB and so I can't understand the situation. Also what is the "Other"?


Here is a small code example :  template <typename T> class A {      // }  class B {     friend class A<..> }   In this case, I want A to be declared as a friend class but without specifying the template parameters...

I have code like this:  template <typename T, typename U> struct MyStruct {     T aType;     U anotherType; };  class IWantToBeFriendsWithMyStruct {     friend struct MyStruct; //what is the correct syntax here ? };   What is the correct syntax to give friendship to the template ?


I'm trying to match a number between 1 and 3 in a string using a regex:  import re  print(re.match(r'[1-3]{1}', 'a1')) # Prints None print(re.match(r'[1-3]{1}', '1a')) # Prints <re.Match object; span=(0, 1), match='1'>    While my regex seems to be working correctly both on regex101.com and in JS, for some reason I cannot get it to work in Python3.  Can someone point me to what is wrong here?

What is the difference between the search() and match() functions in the ?  I've read the  (), but I never seem to remember it.  I keep having to look it up and re-learn it.  I'm hoping that someone will answer it clearly with examples so that (perhaps) it will stick in my head.  Or at least I'll have a better place to return with my question and it will take less time to re-learn it.


When is a == b is true but a.equals(b) is false, or vice versa?  I know that equals() is used to compare the values of the Strings and the == to check if two variables point at the same instance of a String object. But in which case will these two be different ?

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


Special relativity tells us that a fast-moving object with sufficient speed will appear more massive that it would at rest relative to an observer.  Since the strength of an object's gravitational field is proportional to its mass, wouldn't a fast-moving object also appear to the observer to have a stronger gravitational field?  How would this manifest itself to an observer at rest in terms of it's gravitational interaction with other nearby objects and with light?  As a thought experiment, I am imagining two very fast moving objects moving in tandem along a straight line, separated by a short distance.  They would appear to be much more massive to an observer at rest.  Yet relative to one another, the objects are near motionless.  Could an observer at rest measure a stronger gravitational field between the two fast moving objects than an observer riding along with them?

I'm a big fan of the podcast Astronomy Cast and a while back I was listening to a Q&A episode they did. A listener sent in a question that I found fascinating and have been wondering about ever since.   From the show :      Arunus Gidgowdusk from Lithuania asks: "If you took a one kilogram mass and accelerated it close to the speed of light would it form into a black hole? Would it stay a black hole if you then decreased the speed?"   Dr. Gay, an astrophysicist and one of the hosts, explained that she'd asked a number of her colleagues and that none of them could provide a satisfactory answer. I asked her more recently on Facebook if anyone had come forward with one and she said they had not.  So I thought maybe this would be a good place to ask.


My document contains section titles that are formatted by the listings package. (The section names are names of configure script switches.)  \subsection{\lstinline!--enable-so-version!}\label{enable-so-version}   I am getting the following warning when processing the LaTeX source:  Package hyperref Warning: Token not allowed in a PDF string (Unicode): (hyperref)                removing `\lstinline' on input line 231.   Can I avoid it anyhow? I would be willing to duplicate the title string without the listings formatting decoration if there were a directive to set the PDF TOC entry string manually (instead of automatically).

When compiling a beamer presentation and using the following \author command  \author{Name \\ \texttt{my.email@domain.com}}   I get the following hyperref warning in my logfile  Package hyperref Warning: Token not allowed in a PDF string (PDFDocEncoding): (hyperref)                removing `\\' on input line 15.   Package hyperref Warning: Token not allowed in a PDF string (PDFDocEncoding): (hyperref)                removing `\new@ifnextchar' on input line 15.   I understand that this has to do with hyperref setting the PDF metadata, where the linebreak does’t make much sense and should be removed.  Trying to set  \hypersetup{pdfauthor={Name}}   does’t change the situation, seems like hyperref is still looking at the author command.  How do I get the desired display of author name with email and still keep hyperref happy?


I have conducted a PCA to reduce the dimensionality of kinematic performance. This has produced eight components. I now want to plot the trajectory across different age groups. For five of the tasks, the trajectory is as expected, however for three of these, the direction of the relationship is completely opposite. I have read that the sign is arbitrary but how can I justify inversing the sign of some scores but not others? Any help would be greatly appreciated!

I performed principal component analysis (PCA) with R using two different functions (prcomp and princomp) and observed that the PCA scores differed in sign. How can it be?  Consider this:  set.seed(999) prcomp(data.frame(1:10,rnorm(10)))$x              PC1        PC2  [1,] -4.508620 -0.2567655  [2,] -3.373772 -1.1369417  [3,] -2.679669  1.0903445  [4,] -1.615837  0.7108631  [5,] -0.548879  0.3093389  [6,]  0.481756  0.1639112  [7,]  1.656178 -0.9952875  [8,]  2.560345 -0.2490548  [9,]  3.508442  0.1874520 [10,]  4.520055  0.1761397  set.seed(999) princomp(data.frame(1:10,rnorm(10)))$scores          Comp.1     Comp.2  [1,]  4.508620  0.2567655  [2,]  3.373772  1.1369417  [3,]  2.679669 -1.0903445  [4,]  1.615837 -0.7108631  [5,]  0.548879 -0.3093389  [6,] -0.481756 -0.1639112  [7,] -1.656178  0.9952875  [8,] -2.560345  0.2490548  [9,] -3.508442 -0.1874520 [10,] -4.520055 -0.1761397   Why do the signs (+/-) differ for the two analyses? If I was then using principal components PC1 and PC2 as predictors in a regression, i.e. lm(y ~ PC1 + PC2), this would completely change my understanding of the effect of the two variables on y depending on which method I used! How could I then say that PC1 has e.g. a positive effect on y and PC2 has e.g. a negative effect on y?    In addition: If the sign of PCA components is meaningless, is this true for factor analysis (FA) as well? Is it acceptable to flip (reverse) the sign of individual PCA/FA component scores (or of loadings, as a column of loading matrix)?


I've tried this example from OpenBSD   it works fine, but with Mozilla Firefox 6.0 it's possible to use both http and https, while I want to force users to use only HTTPS. How can I achieve this?  Thanks!

As title says,  I want to set my apache to listen on 443, and will configure SSL.   So, My Question  is :-  1). Does that mean, i will not have port 80 or any other port which is no ssl ? 2). My site can only be accessed via https and no http ? Thanks


Is Converting bitmaps to byte[] and saving it to Database better performance and management or saving the bitmaps to Files and handling the paths in the Database ?  By better I mean as performance and management.  I have started a new application and i want to know if anybody has faced such a problem, and which solution is preferable for Android apps ?  Note: I am using Greendao as ORM.

So I'm using an app that stores images heavily in the DB. What's your outlook on this? I'm more of a type to store the location in the filesystem, than store it directly in the DB.  What do you think are the pros/cons?


I've been trying to solve this problem, but i don't know what technique i should be applying and my answers are coming out to be wrong. I've tried putting them in different groups but non of them give me the answer.  Question: There are 10 people standing in a straight line. Find the number of ways to choose 3 of them such that the no 2 of them consecutive.  Please help!

During self-study, I ran across the question of how many ways six numbers can be chosen from the numbers 1 - 49 without replacement, stipulating that no two of the numbers be consecutive.  I can obtain a simple lower bound by saying that, in the worst-case scenario, when you choose a particular number, there are now three numbers that cannot be chosen next.  For example, if I first pick 17, then I can't choose 16, 17, or 18 for the remaining choices.  This gives me the lower bound  $$\frac{49*46*43*40*37*34}{6!} = 6,773,770 \frac{8}{9}$$  This is about 48% of ${}_{49}C_6 =  13,983,816$.  The real answer must be bigger (and an integer).  I haven't found a way to calculate it, though.  The original problem asked to show that the probability of having non-consecutive integers when you choose six is greater than 50%, so if the problem is complicated to count exactly, better approximations that show the answer is above 50% would also be appreciated.   Of course, I can use a computer to do the counting, but I'm interested in learning what methods I'm missing.


I'm using JasperReports with Eclipse Plugin in a Java project.  In JasperReports I'd like to stretch a field horizontally and move the next element to the right if the text field is too long.  Even if I set all the elements with position float nothing happens.  If I set the text field with isStretchWithOverflow="true" I get vertical stretch, like this.    What I'm looking for is something like this:  1   X   11111   Campo di Testo 1   X   12345678901234567890123456789012345678901234567890  Campo di Testo

I have some Jasper reports which are displayed in HTML format. I would like the width of the columns in the HTML tables to automatically resize to fit the content of the widest cell (in that column), such that all the data is displayed.  Currently this does not happen because the HTML generated by Jasper specifies fixed widths for the
 and some  elements, e.g.     foo-bar-baz@examp 	   I can't simply remove all these width properties (using JavaScript), because (as shown in the HTML above) any data that would be hidden when using these widths is not even returned to the client-side  Cheers, Don


I am using sony erricson xperia ray mobile phone. I heard that Ubuntu is available for smart phones. Is it possible to install ubuntu in my phone? I am very eager to try ubuntu in my phone. if it is possible where could I downald and install in my smartphone.

With the announcement of the Ubuntu Phone OS I'd like to know what phone (and tablet) models are supported at this time.  Note from foss & Oli: We are making this the master question for all future "Will this work on <insert random tablet/phone/device here>?!" questions


When I access to the TWRP (version 3.2.1-0) and select the Wipe button, the screen says:  Wipes Data, Cache, and Dalvik (not including internal storage) Most of the time this is the only wipe that you need  But the description of the slider says:  Swipe to Factory Reset  Is Factory Reset the same with Data, Cache, and Dalvik wiping? What is the difference between the data it is about to wipe and internal storage?

I'm trying to completely wipe all personal data from my Nexus 4 with CM installed. I've seen different advice on different sites for making sure all my data is gone:   Just do 'Factory Reset'. Do 'Factory Reset' at least 3 times. Do 'Factory Reset' and wipe dalvik cache. ...   and so on... I'm interested in erasing all traces of my personal data from the device. It's a Nexus 4, so there is no removable storage to worry about.  My guess would be to 'wipe data/factory reset' and 'wipe cache partition' in the main recovery menu. In the mount/storage menu, I would choose 'format /cache', 'format /data', and 'format /data and /data/media (/sdcard)'. Finally, in the advanced menu, I would choose 'wipe dalvik cache'.   Is this thorough enough? Should I also choose 'format /system', 'format /firmware', etc? Are there any options I should steer clear from? I would like the phone to boot to a fresh Cyanogenmod after clearing all data.


All the laws of classical mechanics are time-reversible. But the experiments that we carry out on systems, mostly measure macroscopic parameters which are time-irreversible. We know for a reason that due to the loss of information from coarse-graining the microscopic laws, the macroscopic laws (of thermodynamics) are time-irreversible.   My question is, can we directly carry out experiments that can validate time-reversibility of classical mechanical laws (without involving measurement of macroscopic parameters)?  Secondly, if this is not possible, have there been attempts to make time-irreversible microscopic laws that describe all the other results that classical mechanics predict?

I guess the title says it all: how could/would you experimentally test whether our universe is truly , without relying on the ? What experiments have been proposed to check this? Have any of them been performed?  I know that there are indirect tests of time reversal invariance by observing , in the decay $K_L \to 2\pi$ for example. Then if you assume that the necessary conditions for CPT symmetry are satisfied in our universe, that means there must be time reversal symmetry violation as well. But I'm curious about ways to test time reversal invariance without relying on CPT.  Basically, how could we distinguish between the Standard Model, which predicts T violation, and some hypothetical other theory that matches current experimental results as well as the SM, but in which CPT symmetry does not hold?


A question I asked has been flagged as a duplicate, I believe incorrectly. When I looked up what to do here the advice was to edit it to explain why it wasn't, which I did, and then flagged it when that didn't seem to work. However, I have gotten no response at all, either removing the duplicate flag or reaffirming that it should be there. What is the procedure in these situations?

I asked a question regarding a very specific feature of a program and whether or not it works with a larger program.  Within hours someone had marked it with "This question may already have an answer here of a similar question, but not related to my question.  The question I asked IS NOT ADDRESSED in the referred-to question. It's frustrating to spend half an hour putting together an intelligent and specific question, and then have someone mark it as a duplicate (or possible duplicate), which apparently causes people to skip over my question. I haven't received any more responses since the question was flagged.   Two questions:  (1) How do I get this flagging removed and (2) what's the best way to prevent these "helpful" flaggings in the future?


I recently got a circuit added to my spare room to grow some tomatos, the lighting I am going to be using is 8amp on each plug, I noticed the electrician didnt install a 20A rated receptacle with the side blade but installed a 15amp instead. I am wondering if this is safe, it is the only receptacle on the line. Pretty simple fix to swap it out if need be

OK, the one answer I got was way off target, and another commenter couldn't figure out what I was asking, so I'm restating the question...  Are 15A 3-prong grounded outlets actually rated to 20A, allowing them to be used on 20A circuits? And if so, why, when the outlet can never be asked to supply more than 15A by anything that would be plugged into it?  More info:   had a comment that 15A outlets were actually rated to 20A. However, by design, there is nothing that will plug into a 15A outlet that will draw more than 15A. An appliance that draws more than 15 amps would have a "T-blade" plug that wouldn't go into a standard 15A outlet.   In addition, outlets are always wired in parallel, meaning that a 15A outlet would never have to transmit the amperage draw of a "downstream" outlet; you never "daisy-chain" outlets by connecting hot to neutral, for a number of reasons.  So, there is AFAIK no situation in which a 15A receptacle would ever have to handle more than 15A, even if installed on a 12AWG, 20A-breaker circuit.  If all the above is true, why would a 15A receptacle even have to be rated to 20A?


Would it be possible to get a desktop notification for achievements and the inbox for Stack Overflow?  To get   Desktop/ browser notification    For    Achievements reputation Inbox messages

I noticed that chat supports desktop notifications to notify you when someone pings you, which made me think that maybe the main site has this functionality as well, and I'd really like to use it in that case. But I couldn't find an option to turn them on anywhere.  Chrome notifications look like this:


I am making a web scraper that has a loop that goes from page to page. The only problem is that it is running too fast and I got temporarily banned from the website. (The website allows robots to access their content). Is there any library/command that I can add to my code to make it run slower?

I would like to know how to put a time delay in a Python script.


Im trying to model: Y~x0+x1+x2+x3+x4, were Y is a continous variable (cost), x0 is the intercept, x1 is a continous variable (days) and x2-x4 are categorical variables with mulitple levels. The categorical variable x2 have 156 levels (each level representing a different diagnosis code, i.e. lung cancer, migraine etc). I want to include x2 in the model but I dont want 156 different dummy variables, were each dummy variable represent a diagnosis code.   Here is a picture of the frequencies of each level (censored):   About 2/3 of the levels are significant at 0.05, when Y~x2.  What is the best way to deal with this kind of problem in R?

What techniques are available for collapsing (or pooling) many categories to a few, for the purpose of using them as an input (predictor) in a statistical model?    Consider a variable like  (discipline chosen by an undergraduate student). It is unordered and categorical, but it can potentially have dozens of distinct levels. Let's say I want to use major as a predictor in a regression model.  Using these levels as-is for modeling leads to all sorts of issues because there are just so many. A lot of statistical precision would be thrown away to use them, and the results are hard to interpret. We're rarely interested in specific majors -- we're much more likely to be interested in broad categories (subgroups) of majors. But it isn't always clear how to divide up the levels into such higher-level categories, or even how many higher-level categories to use.  For typical data I would be happy to use factor analysis, matrix factorization, or a discrete latent modeling technique. But majors are mutually exclusive categories, so I'm hesitant to exploit their covariance for anything.  Furthermore I don't care about the major categories on their own. I care about producing higher-level categories that are coherent with respect to my regression outcome. In the binary outcome case, that suggests to me something like linear discriminant analysis (LDA) to generate higher-level categories that maximize discriminative performance. But LDA is a limited technique and that feels like dirty data dredging to me. Moreover any continuous solution will be hard to interpret.  Meanwhile something based on covariances, like multiple correspondence analysis (MCA), seems suspect to me in this case because of the inherent dependence among mutually exclusive dummy variables -- they're better suited for studying multiple categorical variables, rather than multiple categories of the same variable.  edit: to be clear, this is about collapsing categories (not selecting them), and the categories are predictors or independent variables. In hindsight, this problem seems like an appropriate time to "regularize 'em all and let God sort 'em out". Glad to see this question is interesting to so many people!