So I decided to have a little fun today and try to find the answer with the most down-votes on a few Stack Exchange sites. Pretty simple I just search for:     is:answer   Sort by votes and clicked the last page. This seemed to work fine on Stack Overflow, but I noticed it did not when I tried it on Code Review. I figured at first that perhaps deleted answers were somehow included in the pagination, but I also tried this on Meta Stack Overflow and Software Engineering, and noticed the same thing: using my search method, there are no answers found after page 666, no matter how many pages of answers I see.  Have I discovered an obscure bug (feature?), or is my search perhaps cursed?


Design patterns or strategies for complex or large table data in Mobile phones

I want to display a table with 4/5 columns and possibly 100 rows (as in desktop app right now) in smartphones. The table cells are also editable. Now we want to port this desktop app to smartphones (Android / IOS), what will be the most optimized way of showing this on Smartphones.   ** I'm sure many people must've come across this problem by now, Is there some patterns or solution for displaying such kind of large data (editable) on smartphones.


In the EU/Legends material Boba Fett fought his way out of the Sarlacc's guts- Has there been any announcements or anything to suggest he survived getting swallowed by it in the new films (from TFA and beyond)?


What stops lightsabers from becoming super long?

What stops the energy produced at the hilt of the Lightsabers from extending ridiculously far?   The Lightsabers are generally sword length (or spear length for Darth Maul), so what keeps them that way?


As I understand, friction arises from electromagnetic forces. Electric fields, at least static ones, exert conservative forces. So how is it that friction is non-conservative?


$\Bbb{R}^2$ not homeomorphic to $\Bbb{R}^2\setminus \{0\}$

I would like to show that $\Bbb{R}^2$ and $\Bbb{R}^2\setminus \{0\}$ are not homeomorphic without using Algebraic Topology. Is there an elementary way to do this?


I'm trying to install Sticky Notes in Ubuntu 16.04 but I get some errors

pankaj@pankajbhatt:~$ sudo add-apt-repository ppa:umang/indicator-stickynotes >>> /etc/sudoers: syntax error near line 1 <<< sudo: parse error in /etc/sudoers near line 1 sudo: no valid sudoers sources found, quitting sudo: unable to initialize policy plugin pankaj@pankajbhatt:~$


How to find closed formula for the sum of the first n odd perfect squares?

I do know formula for finding sum of squares of n odd numbers but I am not sure how to find closed formula.  Note: From closed formula I mean a reduced fraction in factored form, with no ellipses (“. . .”) in it.


Why do I see a message SQUASHFS ERROR:UNABLE TO READ DATA AND PAGE WHILE INSTALLING UBUNTU

Since 2days onwards iam unable to install ubuntu on my windows 10  i am trying to install 20.04 version of ubuntu its appearing like this SQUASHFS ERROR:UNABLE TO READ DATA AND PAGE


Do we have any possibility that we get , $ p^2 = 2q^2 $, $ \forall p,q \in {N} $ I just reading the properties of Square Numbers on [  ] I found that property no.7:  There are $n$ natural numbers $p$ and $q$ such that $p^2 = 2q^2$. I tried but did not get any pair of numbers. I tried some  examples:  If we have $12^2=144=2(72)$, and $72$ is not perfect square  $10^2=100=2(50)$, and $50$ is not perfect square  $ 22^2=484=2(242)$, and $242$ is not a perfect square  $ 16^2=256=2(128)$, $128$ is not perfect square.   Do we have any possibility with $p,q\in\mathbb{N}$ such that $p^2=2q^2$ holds?


Numeric abbreviations in business quotes

When writing a quote for an order for products, would you write  25K or 25M to refer to 25,000 parts or pounds or units?


$\sum x_n^2$ and $\sum y_n^2$ converge, what does $\sum (x_n + y_n)^2$ do?

So I know that $\sum x_n^2$ converges, and $\sum y_n^2$ converges. ${x_n}$ and ${y_n}$ are both sequences of real numbers. How can I prove that $$\sum(x_n+y_n)^2$$ converges? So far I have $$\sum(x_n+y_n)^2=\sum(x_n)^2 +\sum (y_n)^2 +\sum(2x_ny_n)$$ so I need to prove that $\sum 2x_ny_n$ converges. Is this the right way to approach it? If it is, I am completely lost as to the next step.  I also need to prove that $$\sqrt{\sum(x_n+y_n)^2}\leq \sqrt{\sum(x_n)^2}+\sqrt{\sum(y_n)^2}$$  I assume this will follow pretty easily from a result in the first proof, but I'm stuck on that now, and perhaps it is easier to start with the second one. I have a lot of work I've done on the first problem, but none of it seemed to go anywhere. Any hints?  Thanks!


Bibtex entry to cite an article with unknown author?

Which bibtex entry type should I use to cite an article in a professional/popular (i.e. non peer reviewed) magazine. The article does not state an author, and bibtex article entry requires an author.  I found that the citation should be something like this   ‘Tax-free savings push’, Sunday Mail (4 April 1999), p. 3.


How can the backtick character ` be included in code?

I tried before to post a shell script that contained a ` character as an answer on Stack Overflow. The parser insisted on treating the backtick as formatting instead of part of code.  How can I include it?


representation of double number with .0 at the end

I don't know why but double numbers in program are represented in some format, now exact precision. For example, number 34.3500 may be represented as something like 34.3500000001 or 34.3499998877..  So I have serious question, can double number with .0 at the end for instance 3500.0 be represented in program as something like 35499.99988..?  If you can, please prove your answer. It is very important.Thanks!


As a rule, we don't use the passive voice with "let". "Allow" or "permit" is normally used instead:      We were allowed to do whatever we wanted.      We were permitted to drive the vehicle.   According to the , we don't usually use the passive with "let", but are there any exceptions?


How to I tail the STDOUT of a cat command

Let's say that I start a cat process to wait for some input. e.g.,  $ cat > out.log   In another terminal, I can identify its PID and feed data into its File Descriptor 0 (zero = STDIN), like this:  $  echo "hello" > /proc/2357/fd/0   And then the first terminal reacts:  $ cat > out.log hello   A couple of questions: 1)The "hello" string shows up in the actual terminal instead of being redirected to the file, is that due to the nature of the cat program (it just focuses on the tty/foreground)?  2) I can't tail the STDOUT of that same process:  tail -f /proc/2357/fd/1 ...   Nothing shows up. Any conjectures on what is going on here?


I have a plan to attend conference held in Greece April 2020. I have already purchased return air ticket. However, I have been informed by Greece embassy in Bangkok that obtaining visa for Greece needs to wait for a long queue (until the end of April. I didn't expect this to happen (my big mistake that I didn't check before purchasing air ticket). I have written email to the Greece embassy in Bangkok, but get no response.  My friend suggested me to go for Italy visa instead. Would it be possible to enter Greece with Italy Schengen visa?


How to prove that any two real finite dimensional vector spaces with the same dimension are isomorphic to one another?

As the title says: Prove that any two real finite dimensional vector spaces with the same dimension are isomorphic to one another?  How would you approach this proof?


How to save VF page with lightningstylesheets as PDF to lead record

I have a VF page with lightningstylesheets = "true". (This needs to stay this way-- when I take that away the whole page doesn't look right.) I need to save this VF page as a PDF to my Lead record, from an after update trigger. I am seeing that I cannot use renderas="pdf" together with lightningstylesheets="true". I am also seeing that when I try to save the page as is as a pdf, it does not work-- the logs say  Internal Salesforce.com Error.  Does anyone have experience with a similar issue? How can I make this work? Here is the code I'm trying to get the body of the page as pdf:  PageReference pref = Page.SEEK_MVP_PDF_Display;         pref.getParameters().put('id',leadId);         Blob b; if(Test.isRunningTest()) {   b = blob.valueOf('Unit.Test'); } else {    b = pref.getContentaspdf();    system.debug('B: ' + b); } ContentVersion cv = new ContentVersion();         cv.versionData = b;         cv.title = 'SEEK Medicare Eligibility Check';         cv.PathOnClient = 'SEEK_Eligibility_Check.pdf';         insert cv;  ContentVersion Content = [SELECT id, ContentDocumentId FROM ContentVersion where Id = :cv.Id];         ContentDocumentLink contentlink=new ContentDocumentLink();         contentlink.LinkedEntityId= leadId;         contentlink.ShareType= 'V';         contentlink.ContentDocumentId= Content.ContentDocumentId;         insert contentlink;


Entire function constant, where $f(z)=f(z+1)$ and $|f(z)|< e^{|z|}$.

I came across this old exam problem.     Suppose $f(z)$ is entire and $|f(z)|< e^{|z|}$, and also $f(z)=f(z+1)$. Show $f(z)$ is a constant.   I am able to show the singularity at infinity is not a pole.   But I can't rule out it being an essential singularity.


I want to create the shortcuts:    Super: Run dmenu  Super← Left arrow: Move current window to the left   I have both of them working, however when I depress  Super it opens dmenu right away. When I then press ← Left arrow, it moves the window.  Instead, I want pressing  Super and ← Left arrow without releasing  Super to move the window. dmenu should only start when  Super is pressed and released on it's own.  Is this possible? I know that it works well in gnome-shell and cinnamon, so there has to be a way.


Configuration: report document class, Times New Roman text @12pt with footnote number and text @10pt.    Problem: My institution requires a Times New Roman size 12pt based on Word's, but Times New Roman 12pt in Latex is smaller by about 2pt, and the same goes for footnote number and text size.    Question: How can I increase these proportionately by 2pt or just about? I tried some global packages but they modified my line and paragraph spacing and the result actually made it worse. Looked at several threads but could not find a practical solution.


I play minecraft on my xbox 360, and I can't seem to find a way to choose multiplayer, and fill out server info like on YouTube. Can I only play Java Edition mineplex?


Product of $5$ consecutive integers cannot be perfect square

How can we prove that the product of $5$ consecutive integers cannot be a perfect square?


Remote desktop from Vista to Windows 7 - steps to try

I'm trying to Remote desktop from Vista to Windows 7 to two machines on the same home workgroup.   On the Windows 7 box I have:   enabled the 'remote assistance' check box under computer > properties > advanced > remote opened the firewall port started the remote desktop services rebooted   on the Vista client I have   telneted to the IP address on 3389 and got no connection open - I tried repeating this and switching off the firewall on the server and got the same result   I still can't connect. (I can see the machine in my workgroup, and ping it on the command line, and explore it's file directory) (I don't see it in my list of terminal servers when browsing in terminal services client)  What else should I try?


What does "users following" display at question filters?

In the "Filtered questions" tab at the stats there are "users following" displayed. I would think this shows how much users have this filter in there list. Does that mean i can "subscribe" or add someones filter to my own?


A Finite Boolean Ring is Generated by Finitely Many Copies of $\mathbb{Z} / 2 \mathbb{Z}$

I'm trying to prove that every finite Boolean ring, $R$, is isomorphic to a finite number of copies of $\mathbb{Z} / 2 \mathbb{Z}$:  \begin{align} R \cong \mathbb{Z} / 2 \mathbb{Z} \; \times \cdots \; \times \; \mathbb{Z} / 2 \mathbb{Z} \end{align}  I'm aware that there are answers to this question on this website. However, almost all of the answers seem to use facts about modules and vector spaces defined over fields. This question is posed in section 7.6 in Dummit and Foote's Abstract Algebra. This section is part of the chapters which introduces the basics of ring theory (rings, homomorphisms, ideals, Chinese Remainder Theorem etc.).  I'm not even sure how to being answering this question. I know that if $R$ were an integral domain, then we would have that $R \cong \mathbb{Z} / 2 \mathbb{Z} $.   Please only give hints, considering that that the statement has to be proved using the material only included up till chapters 9 in the textbook.


Let$ A$ and $X$ be invertible complex matrices such that $XAX^{−1} = A^2$ . Prove that there exists a natural number m such that each eigenvalue of A is an m-th root of unity.  i was taking the set $\{ \lambda , \lambda^1 , \lambda^{2} , \lambda^{3}, \dots, \lambda^{m} \}$  $\lambda$ is the eigenvalue of $ A$  I don't  know how  to show  that there exists a natural number m such that each eigenvalue of A is an m-th root of unity.  Pliz help  me  Thanks in advance


Yesterday I said, 'there's nothing interesting, I don't think' and I thought about it afterwards. Obviously I do think, but that's not how it's said. It's always "I don't think". Is this an idiom or a corruption of language? Is it used in US English? Would "I don't think" be considered informal language?


Non-parametric alternative for 2-way ANOVA

Suppose I have 2 independent variables whereby normal distribution can be assumed. However, there is unequal variance and interaction between the two factors is unknown.  Could someone suggest an alternative to 2-way ANOVA with the above mentioned scenario.  I know one possible non-parametric test is the Friedman's test.  Are there any other non-parametric test available?


Music that other people play during a Campaign

I usually play some random hits station while we play, but I'd like to play something that more envelops what we do in 5e. My party seems to play better when the music matches the mood.   Instead of, you know, like Taylor Swift's "love story" coming on while trying to have the BBEG come out and seem ominous...   What are some songs or soundtracks that other DMs or players have going during their campaigns?


Recursive N-dimensional array-creating function having problems assigning values

I wrote a function that should be recursively creating n-dimensional arrays that contain a value using nested lists, and on the surface, it is. (Dimensions is a tuple with the n-dimensional dimensions of the array i.e. (3,3,3) is a 3x3x3 array). However, the arrays my function creates have problems with assignment, as they are unable to assign a value to an individual index without also assigning that value to the other nested lists. And weirdly, when I declare an array of the same dimensions and values but using one line of nested lists, even though python states the objects are equal, assignment with the "manual" array, works just fine. def createboard(dimensions,value):     if dimensions[1:]:         return dimensions[0]*[createboard(dimensions[1:],value)]     else:         return dimensions[0]*[value]  example = createboard((3,3,2),0) print(example) manual = [[[0, 0], [0, 0], [0, 0]],     [[0, 0], [0, 0], [0, 0]],     [[0, 0], [0, 0], [0, 0]]] print(manual == example) example[1][1][0] = True print('example =', example) manual[1][1][0] = True print('example =', manual)  Outputs: [[[0, 0], [0, 0], [0, 0]], [[0, 0], [0, 0], [0, 0]], [[0, 0], [0, 0], [0, 0]]] True example = [[[True, 0], [True, 0], [True, 0]], [[True, 0], [True, 0], [True, 0]], [[True, 0], [True, 0], [True, 0]]] example = [[[0, 0], [0, 0], [0, 0]], [[0, 0], [True, 0], [0, 0]], [[0, 0], [0, 0], [0, 0]]]  Thanks for your help.


If I leave the US through an airport, do I have to return through the same airport?

My wife and I are flying to Iceland and we are trying to book tickets but I wasn't sure about the flights.  So I am just asking to clarify. If I leave the US through an airport, do I have to return to the US through the same airport?


I need div bottom to fill the remaining height of the PAGE, not a parent div    body, html {   margin: 0px; }  .top {   background-color: green;   width: 100px;   height: 50px; }  .bottom {   background-color: red;   width: 100px;   height: 100%; }


Could you explain the magic behind (1+3)[a] indexing as in the following code? ()  #include <iostream>  int main(int argc, const char * argv[]) {     int a[] = {1, 2, 3, 4, 5, 6};     std::cout << (1 + 3)[a] - a[0] + (a + 1)[2]; }   Is this indexing some relic of C language? I thought indexing operator [] cannot take an array in it. Would the same work for e.g. std::vector?


what should we do when a user copy answer and did not mention original?

I know something like this has asked before  But my question is slightly different.  What should we do when some user just copied the content from another answer from SO or from other web resources, and they never mention it?  After leaving some comment on the post they mention but again they forget to mention the original post while answering a question. What should we do in that cases?


ps4 controller won't connect on initial startup

My PS4 is on the initial startup screen (when you first buy the system) and the controller doesn't connect to the system. I've tried resetting the controller and using different wires, but still nothing. The controller only connects to the system on safe mode (with any wire), but after I choose an option, it goes back to the initial startup screen and the controller doesn't work anymore. Does anyone know how to fix this?


I understand inversion but I have a difficulty when it comes down to "there."  A: Under the window there stood a vase. B: Under the window stood a vase.  Here my teacher said that option B is correct.  C: Under the window there was a vase. D: Under the window was a vase.  And here he said that option A is correct.  Could someone explain why I can't say option D?


Suppose $\{a_n\}_{n=1}^{\infty}$ is a bounded. Suppose $\lim_{n\to\infty} (a_{2n}+2a_n)=0$. Prove that $\lim_{n\to\infty} a_n=0$

Suppose $\{a_n\}_{n=1}^{\infty}$ is a bounded sequence of real numbers. Suppose $\lim_{n\to\infty} (a_{2n}+2a_n)=0$. Prove that $\lim_{n\to\infty} a_n=0$.  What I learned from class:  Since $\{a_n\}_{n=1}^{\infty}$ is bounded, $\limsup a_n=\alpha\in \mathbb{R}$, and $\alpha$ has the property of being the largest possible subsequential limit of the $a_n$'s. Furthermore, there exists a subsequence $a_{n_k}\to \alpha$.  We want to show $\alpha=0$, so suppose $\alpha>0$ Now,   $\lim a_{2n_k}=\lim (a_{2n_k}+2a_{n_k})-2\lim a_{n_k}=0-2\alpha=-2\alpha$  $\lim a_{4n_k}=\lim (a_{4n_k}+2a_{2n_k})-2\lim a_{2n_k}=0-2(-2\alpha)=4\alpha$  So we found a subsequence with a limit greater than $\alpha$, so this contradicts $\alpha>0$. We can do a similar argument and conclude $\alpha<0$ is also impossible, so we must have $\alpha=0$.   I have gotten this far, but still cannot conclude that $\lim a_n=0$. How do I even know that the $\{a_n\}$ converge?


Set table background hatched and shaded using tikz

I am looking for a convenient way to set the background of tabular cells. I'd like to do two things:  (1) Set the background shaded in a color (2) Set the background hatched  I learned that the TikZ package provides means to do this but I am unable to come up with a solution that does not use matrices (such as here: ) but instead uses the tabular package.  Here's what I'd like to do:  \documentclass{article} \begin{document} \begin{tabular}{|l|l|l|} \hline   1 & \setBGGray 2 & 3 \\\hline   4 & 5 & 6 \\\hline   7 & \setBGHatched 8 & 9 \\\hline \end{tabular} \end{document}   The output should look like this:    Can someone please help me achieving this using tabular (or tabularx) and TikZ?


Why is wizard population much less than muggle population even with their better odds at survival (Law of Natural Selection)?

During 90s, the muggle population was over 5 billion. But, wizard population wasn't even 500k i.e. 0.01%:  That's hell of a monstrous difference.  If we look at wizards, they have better odds of survival. Forget about past, they have better medicines etc even than modern muggle world. They could also dominate other species easily. They could better survive in adverse situations than their muggle counterparts.  Also, we didn't see any kind of impotence disease (even probability of squib birth was very low) or population control campaign (which didn't have any point anyway) in wizarding world. Weasleys had dozens of kids, for example.  Then, why is wizard population much less than muggle population?


Unable to login after password change, having home directory encrypted

I have ubuntu mate. I have recently changed my password using the passwd command. I know now that I have made a mistake because I also have my home directory encrypted with the previous password.  Consequently after enter my new password at login screen it return me back to the login screen.  Can someone please help me?  I am able to enter to grub boot menu and shell, i am also able to log into guest user. Sorry if the topic is duplicate but I haven't found the same question  Thanks in advance.


if we choose a size $25$ subset of the set: $\{1,2,....100\}$ what is the expectancy of the number of sequential pairs in the subset? expectancy still confuses me, can anybody help?


Changing filegroups from primary to user-defined for existing table in SQL Server

I have 10 million records in a table. But the table is created on primary filegroup.All the indexes and primary keys were created in primary filegroup.There 5 partitions on the table which are also on Primary File group. Is there any way to move Table, indexes and primary key and partitions to user-defined filegroup Without loosing or changing the data in the table?


Here is the statement: Let $a,b \in \mathbb{Z}$ positive integers such that $a^2=b^4+b^3+b^2+b+1.$ Prove $b=3.$  I've tried is the following: Let $\Sigma=b^4+b^3+b^2+b+1$. If $a\equiv 0\mod 3$, then  $a^2\equiv 0 \mod 3$. If $a\equiv 1\mod 3$ or $a\equiv 2\mod 3$, then $a^2\equiv 1\mod 3$. In the other hand, $b\equiv 0\mod 3$ or $b\equiv 2\mod 3$, then $\Sigma\equiv 1\mod 3$ and if $b\equiv 1\mod 3$, $\Sigma\equiv 1\mod 3$. Thus $a=3n$ or $a=3n+2$ for some $n\in\mathbb{Z}$, and $b=3m$ or $b=3m+2$ for some $m\in\mathbb{Z}$. In a similar way, I have prove $a$ cannot be even.  If $a=3n$, for some $n\in \mathbb{Z}$ and $b=3m$, for some $n\in \mathbb{Z}$, we arrive at the following equation $(3n-1)(3n+1)=3m(3³m³+3²m²+3m~1).$ So, $a\equiv 0\mod 3$ or $b\equiv 0\mod 3$ but not both at same time.  I think I should use the Legendre symbol. In this case $(\frac{\Sigma}{3})=0 \text{ or }1$.


Why do my photos lack texture/detail/microcontrast?

edit : I have added the relevant EXIF data, Still exploring how to add the EXIF data inline with the photos, please excuse english is not my first language  I am a newbie photographer with Nikon D3300 and the kit lens + 35mm 1.8. Previously I used to have a Sony Nex 5r with 16-50 lens. I "Upgraded" to a D3300 because I wanted cheaper lens, more accessories but also more detail that I thought will come with the increased resolution.  Unfortunately most of my pictures, especially flower pictures lack detail. I am not talking about "Macro" level detail. But textures which were visible previously on the nex5r are no longer visible with the Nikon.  I have already tried the following:   Tried stopping down. Used both kit lens and 35 mm. Tried fill in flash. Tried under/over exposing. Tried changing White balance / Picture control. Tried manual focus.   It seems like either the lens or the sensor are just not resolving enough detail.  I generally shoot in single point Auto Focus mode using the centre point and placing it on my target.  Picture control is set to " Standard" with saturation "+1" and Sharpness "+3" Several members have commented that the first photo is Out of focus. Well the target focus was the white flower, and I took several samples to rule out camera blur. Also Even when taken using manual focus and using In camera Viewfinder focus Indicator, correct focus was indicated by the camera but still the flower does not appear to be in sharp focus in any of the pics.  As I generally use the viewfinder, I may infer that phase detection AF is not as precise as contrast base detection often used by competing non mirror cameras.  Examples:  1st pic : d3300 +18-55 kt lens at 46 mm,Av priority, f/5, 1/125, ISO 100, Centre weighted  2nd pic : d3300 + 18 - 55 kt lens at 52 mm,Manual exp ,  f/5.6, 1/250 , ISo 100 Centre weighted  3rd pic : d3300 + 35 1.8 G DX , Manual Exp ,   f/5, 1/400 , ISO 100 , Centre weighted  4th pic : d3300 + 35 mm 1.8 dx, Av priority, f/5.6, 1/160 , ISO 100, Centre weighted       I know it may be just paranoia , but if it is a lens or a misfocus issue then I must contact Nikon. Please advise.  While It might be true, That the photos may be post processed to look better, Is there some setting I can change to get a decent Jpeg output from the camera itself? To put it bluntly I would like a jpeg as thrown out by mirrorless cameras from Sony?  also I have tried showing the focus point in the first photo (the blurred one) by using a screen shot from the view nx2 software from Nikon:


I want to prove that $SL(n,\mathbb{R})$ is not simply connected. For this, How can I prove that the fundamental group of $SL(n,\mathbb{R})$ is $\mathbb{Z}$ for $n=2$ and $\mathbb{Z_2}$ for $n>2$.


finding A and B while only product and sum are given

Question:  If      A + B = 54   and  `AB = 629`,  find A and B   I am not sure how to approach this problem since the question itself does not give much clue.


I am not able to sudo apt-get update successfully. I am using Ubuntu 16.04.1 LTS  Error message:  W: GPG error: http://security.ubuntu.com/ubuntu xenial-security InRelease: At least one invalid signature was encountered.   More error messages attached in the screenshot.    How could I fix it?


Initialize an array of structs in C or C99 to all the same values

Lets assume the following in C or C99:  typedef struct {    int x;    double y; } MY_S;  MY_S a[666] = {333, 666.6};   Does this initialize the first object of the array only? If yes, is there a way to initialize ALL elements of the array to all the same values using that syntax (without calling a function/loop and without repeating the initializer)?


Is there an infinite countable $\sigma$-algebra on an uncountable set

Let $\Omega$ be a set.  If $\Omega$ is finite, then any $\sigma$-algebra on $\Omega$ is finite.  If $\Omega$ is infinite and countable, a $\sigma$-algebra on $\Omega$  cannot be infinite and countable.     What about if $\Omega$ is not countable ? Is it possible to find an uncountable $\Omega$ with a $\sigma$-algebra that is infinite and countable ?


JavaScript read private variable from anonymous function

I need to access a private variable from an anonymous function. This anonymous function is set by the following:  coolObject = new (function(){     this.public = "public";     var private = "secrets";      // General functions here, no getter or setter for private })();   I can easily read and write to coolObject.public by doing console.log(coolObject.public) or coolObject.public = "newValue", but how can I do the same to the private variable? Another thing is that I cannot add code to the constructor, coolObject will always be initially defined like this.  So, to sum everything up, is there a way I can access a private variable from a anonymous function in JavaScript, and if so, how?  Edit: I have tried creating getters and setters by doing coolObject.getPrivate = function(){return private;};, but that doesn't work.


Permutations with categories (Multinomial Coefficients): formula proof

I am searching for the proof of the multinomial coefficients formula (formula in the picture)  Any help please?


Can I work in the US if I have a B visa?

Can I get lifeguard work with my B1-B2 visa?


Redefine \big, \Big, etc. dimension locally

I'd like to redefine \big, \Big etc. commands to change their dimensions for single equations. E.g.  {\makeatletter\renewcommand{\big}{\bBigg@{2}}\makeatother% \begin{equation} \big(\frac{1}{2}\big) \end{equation}}\relax   For practical reasons I'd like to define, in the preamble, a command like this:  \newcommand{\mybig}[1]{\makeatletter\renewcommand{\big}{\bBigg@{#1}}\makeatother}   so to have something like:  {\mybig{2}% \begin{equation} \big(\frac{1}{2}\big) \end{equation}}\relax   But it doesn't work. Where am I wrong?


Asymptotic behavior of a trigonometric series

Consider the following series $$S_N = \sum_{k=1}^N \frac{\sin[k\pi/(N+1)]}{k}.$$ What is the asymptotic behavior of this series for $N \to \infty$?  If we replace the sine function with the factor $1$, we get the standard harmonic series which diverges $\sim \ln N$. However, if we replace the sine function with $(-1)^k$, we get a convergent series with the result $\ln 2$. Therefore, I think that $S_N$, defined above, should diverge, but more slowly than the logarithm. Am I correct?


Recursively rename all the files without changing their extensions?

How to recursively rename all the files in several layers of subdirectories without changing their extensions?  Below's a toned down version (to save room) of what I've got.  For argument's sake, I want all the files to have the same title, yet retain their original extension. There's never more than a single file per directory, so there's no chance of doubling up.  For simplicity, we'll just call them all foo, followed by their current extension.    So just to clarify: Asset\ 1.pdf, Asset\ 1.png, Asset\ 1@4x.png, Asset\ 1.svg Will become: foo.pdf, foo.png, foo.png, foo.svg And so on in that fashion.    I would typically use parameter expansion and a for loop, like:    for f in */*; do mv "$f" "${f%/*}/foo.${f##*.}"; done     But it's not recursive. So I would prefer to use something with find..-exec or similar.    ~/Desktop/Project/Graphics/ ├── Huge │   ├── PDF │   │   └── Asset\ 1.pdf │   ├── PNG │   │   ├── 1x │   │   │   └── Asset\ 1.png │   │   └── 4x │   │       └── Asset\ 1@4x.png │   └── SVG │       └── Asset\ 1.svg ├── Large │   ├── PDF │   │   └── ProjectAsset\ 2.pdf │   ├── PNG │   │   ├── 1x │   │   │   └── ProjectAsset\ 2.png │   │   └── 4x │   │       └── ProjectAsset\ 2@4x.png │   └── SVG │       └── ProjectAsset\ 2.svg ├── Medium │   ├── PDF │   │   └── ProjectAsset\ 3.pdf │   ├── PNG │   │   ├── 1x │   │   │   └── ProjectAsset\ 3.png │   │   └── 4x │   │       └── ProjectAsset\ 3@4x.png │   └── SVG │       └── ProjectAsset\ 3.svg ├── Small │   ├── PDF │   │   └── ProjectAsset\ 4.pdf │   ├── PNG │   │   ├── 1x │   │   │   └── ProjectAsset\ 4.png │   │   └── 4x │   │       └── ProjectAsset\ 4@4x.png │   └── SVG │       └── ProjectAsset\ 4.svg └── Tiny     ├── PDF     │   └── Asset\ 5.pdf     ├── PNG     │   ├── 1x     │   │   └── Asset\ 5.png     │   └── 4x     │       └── Asset\ 5@4x.png     └── SVG         └── Asset\ 5.svg  30 directories, 20 files


I have played pathfinder 3 times, and have really come to like it. However, the family that introduced me moved away, and now I am looking for free locations to play. I have looked on the Pathfinder society website, but have found only paid campaigns.  Is there a website that includes free one night games?    I am looking for free locations that have one-shots and mini campaigns.    I am looking for a website that lists all of the local places in my area that host free Pathfinder sessions. Looking up the websites of the individual hobby shops takes too much time, plus I am not 100% sure if I have all the games then (libraries that host these events would be missed for example).


Why does the following latex document:  \documentclass{minimal} \usepackage{tikz}  \begin{document}     \noindent     \begin{tikzpicture}         \draw (0,0) -- (\textwidth,0);     \end{tikzpicture} \end{document}   give an overfull \hbox of 0.4pt? The line cap option has no effect. An ultra thick line gives a larger overfull \hbox of 1.6pt.  Is there a better (more TikZ-like) way to achieve the same effect, i.e., draw a line to the edge of the text box? Ideally I'd like to do this without scaling the figure.


Calculating work done or energy expended difference in two biomechanics examples

I have a biomechanics question regarding how much work is done (or energy consumed) by a person moving at a constant speed from point $A$ to $B$.  In the first scenario, $A$ to $B$ is $100 \; \text{m}$ along flat ground. Assume the weight of the man is $70 \; \text{kg}$.  For some reason I get work done to be $0$, because $W = f \cdot d = 0$ since the person is moving at a constant speed. But of course this isn't the case, since the person must have expended energy moving from $A$ to $B$. Is the work done $W = f \cdot d = 70 \; \text{kg} \cdot 9.81 \; \text{m/s}^2 \cdot 100 \; m = 68,760 \; \text{J}$.  In the second scenario, $A$ to $B$ is $100 \; \text{ m}$ but there is an incline, by $50 \; \text{m}$ of horizontal travel you would have risen $10 \; \text{m}$, and then back down $10 \; \text{m}$ to $B$, making the tangent ratio of the angle $\tan(\theta) = \frac{1}{5}$.  Again, when I do the calculation, $W = 0$, due to the up and down movement against gravity cancelling each other out. But, this isn't the case since the person has done work (used energy) in going from $A$ to $B$.  How would I go about calculating the work done?


The result set has no current row error (Database automation testing using selenium webdriver

I am using the following code in selenium, but I am not able to retrieve data from database. I am getting the error "The result set has no current row"   public class Auto {      public static void main(String[] args) throws InterruptedException, SQLException, ClassNotFoundException, InstantiationException, IllegalAccessException     {         Class.forName("com.microsoft.sqlserver.jdbc.SQLServerDriver");         System.out.println("Driver loaded");         Connection con=DriverManager.getConnection("jdbc:sqlserver://192.168.*****\\SQLEXPRESS/*****_DW/EPS:****;user=******;password=******; ");          System.out.println("Driver loadedd");          java.sql.Statement stmt= con.createStatement();         ResultSet rs=stmt.executeQuery("select * from [*****_DW].[dbo].dim_grantee ");          System.out.println("Query executed");          while (rs.next());         {             String Name=rs.getString("NAME");             System.out.println("Name is");         }     } }


I'm looking for an operating system to put on a second hand web server I have just bought, I am wanting primarily to use the server as a humongous Nas with raid facilities to avoid loosing all my mp3 ect, I believe it's raid 5??mirroring?? Redundant??   I also want to play about abit with remote desktop ect but have no experience with Linux or ubuntu. Is there a version that would suit an amateur to accomplish all of the above and someone who wishes to learn, and play with remote desktop??  I pick Android stuff quite quickly, are there any similarities?? Thanks in advance. Dan


How to set auth_basic for one file in NGINX?

Here is my config:  server {         #...         location ^~ /wp-login.php {            auth_basic           "Restricted";            auth_basic_user_file /var/www/.htpasswd;         }          location / {             try_files $uri $uri/ /index.php?_url=$uri;         }          location ~ \.php {             fastcgi_index  /index.php;             fastcgi_pass unix:/var/www/php-fpm/fpm.sock;             include fastcgi_params;             fastcgi_param  QUERY_STRING    $query_string;             fastcgi_split_path_info       ^(.+\.php)(/.+)$;             fastcgi_param PATH_INFO       $fastcgi_path_info;             fastcgi_param PATH_TRANSLATED $document_root$fastcgi_path_info;             fastcgi_param  APPLICATION_ENV dev;             fastcgi_param SCRIPT_FILENAME $document_root$fastcgi_script_name;             fastcgi_intercept_errors on;              try_files    $uri =404;         }         #...     I}   All works perfect except wp-login.php. If wp-login.php was initiated it will be downloaded as php file even with declined auth_basic authorization. It means I auth_basic window appered and after that wp-login.php will be downloaded.  What is incorrect in configuration?


How to iterate through UV faces via Python code

I have a model and I have unwrapped its faces using simple cubic unwrap. I would like to iterate through the unwrapped faces and select and apply a few operations from external addons to each of them. But I don't quite see in the examples from the documentation how can I make such iteration. How can I achieve this?


'tell me what I should do' vs 'tell me what should I do'

These are questions and with questions you put the verb first and then the pronoun.   For example:  Affirmative : You can.  Question: Can you?  But sometimes when speaking I hear people not applying this rule.  Maybe it's correct in speech but incorrect in writing?!     Tell me what I should do?      Tell me what should I do?      Do you know what you can do to...      Do you know what can you do to...


How to properly "uncurve" those UV wrapping projections?

I can't figure out how to "uncurve" those UV wrapping projections. Any idea?


Is it possible to "detach" child popup windows in Ubuntu 18.04?

I just installed and started to use 18.04 (finally! I got a computer that supports it especially...)  When I open certain windows, such as Thunderbird and Virtualbox, they at times open child windows and those appear on top of the parent window completely obstructing it. So... I'd like to move the child window out of the way and ... that means the parent window along. In other words, the window in the background remains obstructed. Who thought of this beautiful feature?! (Yes. Sarcasm.)  I'm wondering whether this is something I can turn off. Maybe a parameter in the gconf-editor?


If $\int_a^b \left |{f^{\prime}}\right |=V\left. [ a,b \right ]$, $f$ of bounded variation, then $f $ absolutely continuous.

I need a little help with this.  If $f:\mathbb{\left. [ a,b \right ]}\longrightarrow{\mathbb{R}}$ is a function of bounded variation on $\left. [ a,b \right ]$, and if $\int_a^b \left |{f^{\prime}}\right |=V\left. [ a,b \right ]$, where $V\left. [ a,b \right ]$ is the variation of $f$ on $\left. [ a,b \right ]$. Show that $f$ is absolutely continuous on $\left. [ a,b \right ]$  I think this must be easy, but I don't see the way of prove it. Thanks.


For a new account with an existing login, cookie requirement lacking action method

I had an account on a Stack Exchange site, not Law or Meta. I wanted to post on Law, so I had to confirm and create a new account with the existing login.  Clarification: My browser was and is set to accept cookies on a session basis, not persistently, but I don't want persistent cookies. Evidently, the website didn't notice.  Law said, "Law Stack Exchange requires cookies for authentication -- are your browser cookies enabled for this domain?" Fine, but there's no way to respond, except by refreshing the page, which can be risky, and that got me a 404 error and I had to log in again.  So I emailed Stack Exchange, was told to go to Meta, and essentially the process repeated in the last hour or so, with "Meta Stack Exchange requires cookies for authentication -- are your browser cookies enabled for this domain?" and a 404 error. This behavior makes the site look broken and probably should be repaired.  Additional info: I read the other thread newly linked to in this one, near the top. If users should know that procedure, please state it in the message, although I think fixing it altogether would give users a better experience.


I have done a little study on stackoverflow like  [they talk on OOP perspective] and others. But, none adequately answer my question. I would also like to know the pros and cons of each. What I have now is a DB class as:  class DB extends DBWrapper{      private static $pdo = null;      public static function getInstance(){         if(self::$pdo == null){             self::PDOConnect();         }         return self::$pdo;     }      private static function PDOConnect(){         try{             self::$pdo = new \PDO('mysql:host='.DB_HOST.';dbname='.DB_NAME, DB_USER, DB_PASS);             self::$pdo->setAttribute(\PDO::ATTR_ERRMODE, \PDO::ERRMODE_EXCEPTION);             self::$pdo->setAttribute(\PDO::ATTR_EMULATE_PREPARES, false);         } catch (\Exception $e){             die("Database Connection Failed");         }     } }


What did the emperor do before becoming the Emperor?

What do we know about what the Emperor did before the Unification of Terra? He was born 8000 BC in Anatolia.  I don't really care about how he was born, either the reincarnation of shamans or just a freaky accident of nature, sent by a passing Old One seeing potential in humanity or whatever.   Thing is, not much is known about until the year 30k, when he is a Warlord on Terra and starts to unify mankind. So, what happened during the 38k years between his birth and when he starts unifying mankind? It is always said that he observed humanity and acted from the background. But are there any stories known about him? Special things he did, where he was during what time etc?  E.g., in the Horus Heresy novel Mechanicum, it is described that he was a knight slaying a dragon.     Dalia almost wept at the sight of the knight, a being of a fairer presence than any she had seen and one whose wondrous power was undimmed by the passage of years. The knight spurred his horse and swiftly overtook the procession, riding towards the dark scar in the earth. No sooner had he halted his mount and set his shield upon his arm than the Dragon surged from its lair, roaring with a sound louder than thunder. Dalia’s hands flew to her mouth and she cried out as she saw the Dragon’s monstrous form. In shape it was half crawling beast, half loathsome bird, its scaled head immense and its tail twenty metres long. Its terrible winged body was covered with scales, so strong and bright and smooth that they were like a knight’s armour. The light of devoured stars shone at its breast and malignant fire burned in its eyes. The warrior knight leapt to meet the Dragon, striking the monster with his lance, but its scales were so hard that the weapon broke into a thousand pieces. From the back of his rearing horse, the warrior smote the dragon with his sword, but the beast struck at him with talons like scythe blades. The warrior’s armour split open and Dalia saw blood pouring down his leg in a bright stream. The Dragon towered over its foe, dealing him fearful blows, but the knight caught them upon his shield and thrust his sword against the Dragon’s belly. The scales of the beast were like steel plates, rippling like liquid mercury as they withstood the knight’s every attack. Then the Dragon, infuriated by the thrust, lashed itself against the knight and his horse, and cast lightning upon him from its eyes. The knight’s helmet was torn from him and Dalia saw his face shine out from the battle, pale, lit by some radiance that shone from within. As he thrust at the Dragon, that radiance grew in power, so that at last it was like the light of a newborn sun.   Are there any other stations of the Emperor documented except birth and Terran Warlord at the end of Age of Strife?


Construct a compact set of real numbers whose limit points form a countable set.

I searched and found out that the below is a compact set of real numbers whose limit points form a countable set. I know the set in real number is compact if and only if it is bounded and closed. It's obvious it is bounded since $\,d(1/4, q) < 1\,$ for all $\,q \in E.$  However, I'm not sure how this is closed.  Is there any simpler set that satisfies the above condition?  Thank you!  $$E = \left\{\frac 1{2^m}\left(1 - \frac 1n\right) \mid m,n \in \mathbb N\right\}.$$


Ghosts/almost dead had their hearts ripped out and now have to pump them by hand and never sleep?

I know I didn't come up with this but I can't remember where it's from.  The story is that I think some soldiers or knights maybe were walking through a forest and were attacked by someone/something. Their hearts were ripped out but they didn't die so now they walk around the forest, carrying and pumping their hearts, not living or dead.   I feel like it was a story told to the main character, probably in a book but maybe not, as a sort of incidental/local colour tale that was not relevant to the plot.  Please help, where have I got this from?


Value of number from oracle get 0.000003 extra on C# DataSet

I have a strange problem on getting data from DB  I use C# and Oracle.DataAccess with stored procedure.  In the DB I have a NUMBER(10,2) type field named TotalPayout and when dumping it on the DB I get this data  select a.totalpayout, DUMP(a.totalpayout)    from   tbla a    where a.totalpayout > 17 and a.totalpayout < 18;   returns:  TOTALPAYOUT , DUMP(A.TOTALPAYOUT)   17.40            , Typ=2 Len=3: 193,18,41 17.50            , Typ=2 Len=3: 193,18,51 17.60            , Typ=2 Len=3: 193,18,61 17.70            , Typ=2 Len=3: 193,18,71   But when running the progrem on the DataSet into column type Double I get this values   Total Payout           17.400000000000002 17.5 17.7 17.6   The first value get extra 00000000000002 Can’t find any clue why this happening.  this is the code i use to get the data     public static DataSet ExecuteDataset(OracleConnection connection, CommandType commandType, string commandText, params OracleParameter[] commandParameters)     {         if (connection == null) throw new ArgumentNullException("connection");          // Create a command and prepare it for execution         OracleCommand cmd = new OracleCommand();         bool mustCloseConnection = false;         PrepareCommand(cmd, connection, (OracleTransaction)null, commandType, commandText, commandParameters, out mustCloseConnection);          // Create the DataAdapter & DataSet         using (OracleDataAdapter da = new OracleDataAdapter(cmd))         {             DataSet ds = new DataSet();             ds.Locale = CultureInfo.InvariantCulture;              // Fill the DataSet using default values for DataTable names, etc             da.Fill(ds);              // Detach the OracleParameters from the command object, so they can be used again             cmd.Parameters.Clear();              if (mustCloseConnection)                 connection.Close();              // Return the dataset             return ds;         }     }   If anyone has any advice or suggestion I would appreciate it. Would really like to fix this issue.


Since it's not "focal length", what is the term for the distance at which things are in focus?

I was under the impression that the “focal length” of a lens is the distance at which stuff appears in-focus. (E.g., perhaps I set the camera so that objects 3 meters away appear sharp, and anything nearer or further than that is blurry.) But everything I've read seems to suggest that focal length is actually a slightly odd way of describing the field of view of the lens, and actually nothing to do with focus at all. (?)  So what's the correct term for “stuff at this distance will be in focus” then? (I.e., the thing you change with the focus ring.) If I want stuff 3 meters away to appear sharp, what parameter have I set to 3 meters?


Let $R$ be a ring such that for all $a,b$ in $R$, $(a^2-a)b=b(a^2-a)$. Then $R$ is commutative.   I am having difficulties making the connection. Any help would be appreciated.


How do you forcefully remove apps in Windows 10?

How can I remove apps that Windows doesn't seem to allow to be uninstalled, like Xbox and Groove Music?


Why is subshell created by background control operator (&) not displayed under pstree

I understand that when I run exit it terminates my current shell because exit command run in the same shell. I also understand that when I run exit & then original shell will not terminate because & ensures that the command is run in sub-shell resulting that exit will terminate this sub-shell and return back to original shell. But what I do not understand is why commands with and without & looks exactly the same under pstree, in this case sleep 10 and sleep 10 &. 4669 is the PID of bash under which first sleep 10 and then sleep 10 & were issued and following output was obtained from another shell instance during this time:  # version without & $ pstree 4669 bash(4669)───sleep(6345)  # version with & $ pstree 4669 bash(4669)───sleep(6364)   Should't the version with & contain one more spawned sub-shell (e.g. in this case with PID 5555), like this one?  bash(4669)───bash(5555)───sleep(6364)   PS: Following code was omitted from output of pstree beginning for better readability:  systemd(1)───slim(1009)───ck-launch-sessi(1370)───openbox(1551)───/usr/bin/termin(4510)───bash(4518)───screen(4667)───screen(4668)───


13.10 black screen after wake from suspend

I am running 13.10, when I try to wake my computer from suspend the screen doesn't seem to activate. Any pointers as to where I am going wrong? I just have to manually reboot the computer for it to come to life again!


Uninstall Windows 10 on Ubuntu 18.04 dual boot

I Installed Ubuntu 18.04(LTS)  alongside Windows 10 (Dual Boot), and now I want to uninstall (Delete) Windows 10 from my laptop. I have seen many ways to delete Ubuntu , but none to Delete Windows 10.  Any Help would be most appreciated.  Zuli


Why does a preincrement act differently whether in an inequality or an equation?

I'm getting into fully understanding programming basics and despite having good knowledge in OOP. I'm learning C right now and these simple equations have me stumped: Why in this example, i = 3; j = 4; k = 5; printf("%d ", i < j || ++j < k); printf("%d %d %d", i, j, k);  Answer: 1, 3, 4, 5, does it keep the 'j' as its original value despite there being a pre-increment in the expression but in i = 10; j = 5; printf("%d ", i++ - ++j); printf("%d %d", i, j);  Answer: 4, 11, 6, it keeps the expression incremented 'j', as its new value. Is it simply because one is an inequality expression while the other doesn't have a comparison?


Problem with "fuzzying the number" of the Close Votes queue

According to the , the number of items in the queue has been  to avoid scaring people off with a daunting number that makes the task seem like trying to stop a flood with a bailing bucket.  I'm not sure exactly how the "fuzzying" is being done, but based on Shog9's explanation and the fact that the queue keeps dwindling and then suddenly jumping up by several thousand, I take it there's some kind of cyclical prioritizing process going on, in which a batch is selected according to certain criteria, and when that batch is completed, a new set of criteria is applied to select a new batch of reviews on the next rung down the priority scale.  This seems to be a good idea, but there's one problem with that approach:    I thought the maximum daily number of Close Votes reviews was supposed to be 40. Why was it suddenly knocked down to 20? It can't be that the bonfire was so destructive that we no longer need a higher limit in the queue, can it?   Well, apparently the higher limit isn't particular to close vote reviews; .  So, whenever the number of a selected batch drops below 1,000, reviewers are temporarily capped at 20 per day until the next heaping plateful is served up. This is probably not the desired behavior when it's only the fuzzied number that's under 1,000, and there are really tens of thousands of reviews waiting in the wings. Perhaps the script should be changed to allow 40 Close Votes reviews regardless of how many items, or the next batch should be appended whenever the number drops close to 1,000?    UPDATE  @rene cleared this up in a comment, so I'm adding the explanation here. The cyclical process is simple: It's based entirely on a minimum number of close votes, and each time the queue goes to zero, a new batch is selected by reducing minimum by 1. We're now on 2 close votes and up, so it's the last cycle until the number is unfuzzied. I raised the issue because it seemed to me as if they were being served up ~10K at a time, so I thought this would keep happening over and over. Given rene's explanation, this will only happen one more time in the next 30K (the size of the new batch), so it's not a significant issue.  BTW, even though the number went up to 30K a couple of hours ago, it appears that the 20 review cap still applies to people who reached it when the number was < 1K:    I'm wondering, if someone has done more than 20 but fewer than 40 reviews when the number in queue drops below 1K, are they capped at that point, or can they continue to 40 if they've already crossed a threshold at 20? (Not really a problem or concern, just idle curiosity about how it works. Plus it's an excuse to add more freehand red circles to my post.)


I am taking the course on Machine Learning and unable to grasp the concept of MLE for linear regression. Can anyone give some numerical example ? Most of the content I read on internet was theoretical.  Following is my understanding : For estimating MLE I will need input variable vectors (say X ), Output variables (Y), and σ². If Model is Y = (A1) + (A2)X + e, then I have to maximize P(Y|X,σ²) and find out value for A1 and A2 is this correct?  Thanks.


Find equation of a plane throw two given point and orthogonal to another space

I have $\pi:4y-3z-4=0 \quad A=(2,4,4) \quad B=(2,-2,-4)$. I have to calculate the equation of the plane $\sigma$ throw $A$ and $B$ and orthogonal to $\pi$. What is the solution? Thanks in advice!


How do I embed a JPG thumbnail to a ogg/opus audio file with a script?

I am using youtube-dl to download ogg audio files with their respective thumbnail, but I am not sure how to embed the thumbnail into the audio file.


Is there any such thing as a change in acceleration (ex: 3 m/s/s/s)?

If there exists something like that, then in $distance/time/time/time$, how is it expressed?


Print start and end between two patterns excluding end of range

I want to use sed -n "/START PATTERN/,/END PATTERN/p" file.txt pattern to search in a file.  file.txt content is  ~keyword~, ~output~. ~1.~ ~output~. ~2.~ ~output~. ~keyword~, ~output~. ~1.~ ~output~. ~2.~ ~output~. ~3.~ ~output~. ~keyword blablabla~, ~not the output~. ~1.~ ~not the output~. ~2.~ ~not the output~. ~keyword blablabla2~, ~not the output~. ~1.~ ~not the output~. ~2.~ ~not the output~. ~3.~ ~not the output~. ~4.~ ~not the output~. ~blablabla~, ~not the output~. ~1.~ ~not the output~. ~2.~ ~not the output~. ~3.~ ~not the output~. ~4.~ ~not the output~.   What I expect as output is  ~keyword~, ~output~. ~1.~ ~output~. ~2.~ ~output~. ~keyword~, ~output~. ~1.~ ~output~. ~2.~ ~output~. ~3.~ ~output~.   So start pattern is keyword in between ~ followed by any char . so it is /~keyword~./  End pattern is ~ followed by any alphabetic characters and then any char ..   When I run sed -n "/~keyword~./,/[~][[:alpha:]]./p" file.txt the output is  ~keyword~, ~output~. ~1.~ ~output~. ~keyword~, ~output~. ~1.~ ~output~.   2nd and 3rd lines is not printing in output so my question is what is wrong with my approach?  I inspired this by using the solution provided   I also tried sed "/~keyword~./,/[~][[:alpha:]]./!d;//d" file.txt which results in empty output ()  This question is different with the question marked as duplicate because I asked specifily about use of sed for regular expression. Considering this, if you think it means it is duplicated, please mark it as duplicate.


How did the Asgardians survive? I've been trying to noodle this through for a while now after seeing Avengers: Endgame. At the End of Thor: Ragnarok, the Asgardians are all on Thor's ship looking for new lands.   At the beginning of Infinity War, Thanos attacks the ship and comes aboard. There's been a slaughter and only a few Asgardians are left. Those are either killed directly by Thanos (Helmdal, Loki) or, well, basically Thor, who is picked up by the Guardians of the Galaxy.  In Endgame we find out that there are some Asgardians still alive,      including Valkyrie, the Rock guy, and presumably enough to populate a town.   Where did they all come from? How'd they survive? Did I miss an explanation?   Edit: To be clear, in addition to whatever other Asgardians there might be in the universe (which might have been 50% decimated with the snap), I'm asking about the Asgardians on the ship at the end of Thor Ragnarok.


Difference between zoom and focal length?

Until now I thought that focal length is just another way of measuring how much a lens zooms: The higher the number the more it magnifies, the smaller the number the wider the angle and thus the less it magnifies. The Canon 70-200 f2.8 and the Tamron 70-200 f2.8 VC USM both have the same focal length, but the canon zooms more. Reviews say that the Tamron is equivalent to a 170mm Canon. So obviously zoom and focal length can't be exactly the same. So are they two different things or is Tamron selling a 170mm as a 200mm lens?


Will the types of Pokemon attracted to a lure module always be the types displayed as "nearby"?

If you press on the bottom right of your screen you can see what Pokemon are nearby. I'm wondering if a lure module will exclusively attract those Pokemon or if any type can randomly appear at a Pokestop with a lure module?


ECS: Should Systems access only one component-type

Let's say I have a Transform-component-type, and a Color-component-type (to keep things simple). I also have an entity E that is assigned both of these component-types. To render E, my engine will internally have to bind a uniform-buffer containing both a mat4-transformation-matrix, and a vec3-color. Now I think I heard conflicting opinions about whether there should be a strict 1-to-1 component_type-to-system relation, or whether it is considered more appropriate to have systems which act on multiple component-types. In the latter case I'd know how to do things. I would have a RenderSystem, which only considers entities which have both a Transform, and a Color component. For the first case I don't have a solution though.. Both the TransformSystem and the ColorSystem wouldn't know how to render the entity, since they only hold a subset of what is required by the shader. So I would just jump head-first into implementing my ECS as having one system potentially acting on multiple component-types, but I first wanted to hear from people having more experience with ECSs. Are there good solutions in an ECS that maps systems 1-to-1 to components to achieve behavior that is the effect of the presence of multiple different component-types, or is a solution in which one system requires the presence of multiple component-types generally preferable?


Error while trying to upgrade from Ubuntu 18.04 to 18.10: "Please install all available updates for your release before upgrading."

On a Lenovo laptop, I want to upgrade from Ubuntu 18.04 to Ubuntu 18.10 (budgie).  When I select upgrade on the update manager, the dialog box disappears and nothing happens. The upgrade doesn't start.  Note- I went through the same procedure this morning on my other laptop and Ubuntu successfully upgraded.   do-release-upgrade fails to upgrade and throws this error:  Please install all available updates for your release before upgrading.   What can I do to upgrade the system successfully?


Any bash magic to reference the previously typed parameter?

This question is a variant on a previously asked     Many a time, I find myself wanting to slightly rename a file name in the shell, e.g.:  $ mv test_1.py _test_1.py   or  $ mv test_1.py test_1.py.org   I could use the suggestions in , but   is there any bash magic that will allow me to just reference the previously typed parameter?  e.g., if the magic is $M, then - for the above - I'd use:  $ mv test_1.py _$M.py $ mv test_1.py $M.org


Can child under 18 with grandparents exit Uk without grandparents?

My query is to find out if a child (Under 18) is travelling with his grandparent,  upon entry I understand he needs to make with his grandparent, as his visa will have the name of The grandparent.  My question is, can he exit UK without them, if he wants to come back earlier then his/her grandparents.


Adding Day to Date to Make Current Date Tomorrow - Javascript

Hi Everyone and thanks in advance for the help. I'm having an issue with getting my Javascript date code to advance from the current date to tomorrow's date. I've searched here in previous posts but the answers don't seem to be working.  <SCRIPT LANGUAGE="JavaScript"> // Get today's current date. var now = new Date();  // Array list of days. var days = new Array('Sunday','Monday','Tuesday','Wednesday','Thursday','Friday','Saturday');  // Array list of months. var months = new Array('January','February','March','April','May','June','July','August','September','October','November','December');  // Calculate the number of the current day in the week. var date = ((now.getDate()<10) ? "0" : "")+ now.getDate();  // Calculate four digit year. function fourdigits(number) {     return (number < 1000) ? number + 1900 : number;                             }  // Join it all together today =  days[now.getDay()] + ", " +      months[now.getMonth()] + " " +      date + ", " +      (fourdigits(now.getYear())) ; </script>   Where would the + 1 be inserted in order to make the date tomorrow's date?


ERROR 1045 (28000): Access denied for user 'root'@'localhost' (using Password:YES)

root@test-2:/usr/local# mysql -u root -H 192.168.x.xxx -p Enter password: ERROR 1045 (28000): Access denied for user 'root'@'localhost' (using password: YES)


This is a nice problem on series convergence that I recently stumbled upon. Given a non-negative sequence of real numbers $(a_n)$ such that $$\sum_{n=1}^\infty a_n < \infty,$$ show that there exists a non-decreasing sequence of non-negative numbers $b_n$ such that $$b_n \to \infty \quad\text{ and } \quad \sum_{n=1}^\infty a_n b_n < \infty.$$ In other words, for every convergent series with non-negative terms, there is another convergent series with "substantially larger" terms.  I have a solution (see below), but maybe someone else has a different, simpler, and/or more elegant solution.


Does $a(a^{-1} \bmod b) + b(b^{-1} \bmod a) < ab + 2$ hold?

Here we assume $(a,b) = 1$ and $a^{-1}$ and $b^{-1}$ are canonical (e.g.  $0 < a^{-1} < b)$. Counter example or proof are appreciated!


How do I stop vertices being hidden by the Subsurf modifier in Edit mode?

So I'm trying to do a model and I noticed when in Edit mode the vertices and edges are being hidden by the smoothed surface view:     How do i fix this?


How can you make normal map part of the mesh

Its basically reverse baking so can you do that ? I'm not going to upload my blend file cause I believe in this case it is unnesecarie


Insert transaction Record into MsAccess with VB.Net

I am trying to insert multiple record into my Access Database. Currently I can insert a single transaction record with the code below  Try     sql = "INSERT INTO  tblINV_SalesRecord " &_            "(transID, itemcode, itemname, itemunits ) " &_            "VALUES ('TGR011111','Cheese','INV0234','5')"      Using con1 As New OleDbConnection(dbProvider & dbSource)        Dim command As New OleDbCommand(Sql, con1)        con1.Open()        command.ExecuteScalar()         MsgBox("Record Inserted")     End Using Catch ex As Exception       MsgBox("An Error Occured")       MessageBox.Show(ex.Message & " - " & ex.Source) End Try   Now what I am trying to do is to insert multiple items purchased by customer in a single SQL statement. My code is shown below.  Try     sql = "INSERT INTO  tblINV_SalesRecord " &_            "(transID, itemcode, itemname, itemunits ) " &_            "VALUES ('TGR011111','Cheese','INV0234','5')," &_                   "('TGR011111','Cake','INV0114','2')," &_                   "('TGR011111','Burger','INV0217','3')" &_       Using con1 As New OleDbConnection(dbProvider & dbSource)        Dim command As New OleDbCommand(Sql, con1)        con1.Open()        command.ExecuteScalar()         MsgBox("Record Inserted")     End Using Catch ex As Exception       MsgBox("An Error Occured")       MessageBox.Show(ex.Message & " - " & ex.Source) End Try   But it returns Error. Please how do I get this resolved?


How to upgrade from 16.04 LTS to 16.04.1 LTS

How can I upgrade Ubuntu from 16.04 LTS to 16.04.1 LTS? For some reasons, I don't seem to be able to do it. The main reason why I would like to do the upgrade is that the Nautilus shipped with 16.04 is affected by the .  Just in case someone asks, I have set upgrade to ANY new release and I have issued a do-release-upgrade to no avail. Also, the system is fully up-to-date.  If I do do-release-upgrade -d then yakkety gets installed and if I restrict to only new LTS releases nothing happens.


The way suggested edits are handled in questions seems oddly inefficient

I recently visited a question with unformatted code. Before I could format it however, a low-rep user made an edit that was basically what I was going to do.  Here's the problem: I'm now not given the opportunity of just fixing the question like I normally could. I can only approve their edit, .  Why is it that I'm now blocked from simply fixing a question because someone else made an edit before me that requires approvals? If I can be trusted to carry out arbitrary edits on a question, it seems to follow that I should also be trusted to single-handedly approve an edit (or at least be allowed to still make my own). It's the same result: a single user allowing/causing an edit to happen to someone's post.  I think posts should be allowed to be edited as normal, even if there are pending suggested edits. I also think any user capable of making unchecked-edits to a post should also be allowed to single-handedly approve other edits.    I'll note though that this problem only seems to exist on the desktop site. When there's a pending edit, the edit button is replaced with a edit(#) button that brings up a review window instead of a direct editing screen.  In the app however, I can still make edits freely even when there's a pending suggested edit. The functionality doesn't change (likely due to limitations of the app).    (This stemmed from SO, but I believe it applies to the entire network.)


Solve the following limit as $\lim_{x \to 0}$

$$\lim_{x \to 0} \frac{x\sin(\sin x) - \sin^2 x}{x^6}$$   **My Attempt: **  I started with L'Hopital's rule. But it quickly became messy. So, I did not continue.   I tried to write the Taylor series of $\sin x$ to see if that $x^6$ gets canceled anywhere. But got stuck because of that $\sin(\sin x)$ term.  I have no Idea how do I approach this problem further.  Any help would be appreciated.


Does my save data carry over if I switch from card to download?

I bought Super Smash Bros. Ultimate on day one and I got the physical release, meaning I have the game card. So whenever I want to play the game, I need to insert the game card first. Now I want to get rid of some of the game cards I have, including the Smash Bros. copy. I want to instead buy them online and download them to my Switch. If I do that, will I still have access to the save data I created using the physical game card? I fear that if I download the game, it will be kept separate and I have to start all over again.


Why is my exported fbx not importing with textures?

I made an image mesh on my terrain model. I export this work in fbx format, but when I import it again, only the model comes on and the picture I dress it on does not come. The situation is like the attached pictures. I want my work to look like the first picture when I import it, but I couldn't do it. Where am I making mistakes?


How to find the square root of a permutation

Observe that  $$\begin{pmatrix} 1 & 2 & 3 & 4 & 5 \\  2 & 4 & 1 & 5 & 3 \end{pmatrix} \begin{pmatrix} 1 & 2 & 3 & 4 & 5 \\  2 & 4 & 1 & 5 & 3 \end{pmatrix} =  \begin{pmatrix} 1 & 2 & 3 & 4 & 5 \\  4 & 5 & 2 & 3 & 1 \end{pmatrix},$$  so $\begin{pmatrix} 1 & 2 & 3 & 4 & 5 \\  4 & 5 & 2 & 3 & 1 \end{pmatrix}$ is the square of a permutation. More generally, how do I check if a permutation is square and how can I find its root?


How do you find out which version of Gnome Desktop ships with a certain version of Ubuntu without installation?

How do you most reliably and accurately correlate which version of GNOME Desktop a certain version of Ubuntu ships with, without installing that version of Ubuntu? I'm referring here to more recent versions of Ubuntu, e.g. 18.04 and up. I'd like to know either what version comes with the base version of Ubuntu, or, any patch version that comes with the official updates for that version of Ubuntu. Using the rmadison command from  I don't fully follow what is the answer to my question ― I see nothing for Focal Fossa (20.04) in the outputs: On Ubuntu 20.04: $ sudo apt install devscripts   ... $ rmadison gnome   gnome | 1:3.0+6ubuntu3  | precise/universe | amd64, armel, armhf, i386, powerpc  gnome | 1:3.8+4ubuntu3  | trusty/universe  | amd64, arm64, armhf, i386, powerpc, ppc64el  gnome | 1:3.14+3ubuntu1 | xenial/universe  | amd64, arm64, armhf, i386, powerpc, ppc64el, s390x  gnome | 1:3.22+9        | bionic/universe  | amd64, arm64, armhf, i386, ppc64el, s390x  gnome | 1:3.30+1ubuntu1 | disco/universe   | amd64, arm64, armhf, i386, ppc64el, s390x  gnome | 1:3.30+2        | eoan/universe    | amd64, arm64, armhf, i386, ppc64el, s390x  gnome | 1:3.30+2        | focal/universe   | amd64, arm64, armhf, ppc64el, riscv64, s390x  gnome | 1:3.30+2        | groovy/universe  | amd64, arm64, armhf, ppc64el, riscv64, s390x   $ rmadison gnome-desktop   gnome-desktop | 1:2.32.1-0ubuntu9 | precise         | source  gnome-desktop | 1:2.32.1-2ubuntu1 | trusty/universe | source  I think this command-line tool pretty much mirrors the same information that's available on a launchpad search , which which does not explicitly relate to Focal Fossa, and neither does Launchpad relate to GNOME in general for Focal Fossa, assuming I am searching Launchpad well.


I'm working with the article document class:  \documentclass[a4paper, twoside, openleft, showtrims]{article}   I need to print a page that has color on the edges. The people who need to print this asked to add a 3mm on each page so they can cut it.  Solution (by Christian Hupfer) for the crop marks:   \usepackage[a4,frame,axes,cross,pdftex,center]{crop}


In the following loop is the complexity O(1) or is it O(n)?  for(int j = 0; j < Math.random() * 1000 + 1; j++)   I don't know the number of times it would run through the loop so shouldn't it be O(n)?


Why does a fourier series have a 1/2 in front of the a_0 coefficient

I am reading up on the fourier series, and I keep seeing it as being defined as:  $$ f(\theta)= \frac{1}{2}a_0 + \sum_{n=1}^{\infty}(a_n \cos(n\theta) + b_n \sin(n\theta)) $$  where  $$ a_n = \frac{1}{\pi}\int_{0}^{2\pi}\cos(n\theta)f(\theta)d\theta $$  and   $$ b_n = \frac{1}{\pi}\int_{0}^{2\pi}\sin(n\theta)f(\theta)d\theta $$  I understand the derivation of the coefficients using trig integral identities, but I can't find a clear explanation of why $\frac{1}{2}$ is in front of $a_0$. Can anyone help show my why this is the case? Why can't we just have $a_0$ with no number in front of it. Thanks!  edit: corrected summation term


Limit of the sequence $nx_{n}$ where $x_{n+1} = \log (1 +x_{n})$

Suppose $x_{1}>0$, and consider the sequence, $\{x_{n}\}$ defined as follows: $$x_{n+1}=\log(1+x_{n}) \quad n\geq 1 $$ Find the value of $\displaystyle \lim_{n \to \infty} nx_{n}$  I am having trouble solving it. One thing is clear, that since $x_{n}>0$ and $x_{n+1} < x_{n}$, we can have a sequence which converges an $f$ which satisfies $f=\log(1+f)$, so that $f=0$. Any way as to how we can proceed from here.


How to open none .qgs files in QGIS Wien?

I have tried tried to open my older qgis files made on a mac on my new PC.  Wien(2.8) only seems to allow .qgs files so all my folders appears empty when I access them from QGIS on the PC.


How do I remove YouTube sidebar integration?

I accidentally agreed to allow Firefox to 'integrate' YouTube with my desktop sidebar and now I want to get rid of it. How do I do this?


We have < and \ll. What about double \prec, i.e. something like \prec\prec but with spacing as in \ll?  Remark. I could not find an answer in  or . I am not interested, how to construct this symbol from two \prec's (I know how to reduce the distance), but I am searching for a symbol from some package, even so strange as MnSymbol.


Well-ordered sets, properties of an element that is not largest in the set

Can anyone please help me in this question:     $(X,\leq )$ is a well-ordered set. $\forall x\in X$, either $x$ is the largest element of $X$ or there exists $y\in X$ such that   (i) $x<y$ and   (ii) if $x_0\in X$ such that  $x\leq x_0\leq y$, then either $x = x_0$ or $x_0 = y$.   Will this be sufficient to start the proof:  If $x$ is the largest element then there is nothing to prove. Suppose $x$ is not the largest element. $$A=\{ z\in X \mid x<z\}\neq \emptyset$$ How do I proceed?


Get random numbers that sum to a value N and have a specific variance

As the title says, I need numbers that sum to a value N lets say 0.9 and have a specific variance. My background is not in mathematics so please be gentle with the terms.  Any help is appreciated.


Will a HTC hard reset also reset the firmware?

I am about to buy a second-hand HTC One S for development mucking around. The seller says it needs to have its firmware reset, but won't say why.  I intend to hard reset it anyway and wipe everything. Will doing this also reset the firmware, or is the firmware "lower level" than the factory default settings?


Execute each command in terminal from top line / Execute clear before each command

I would like to ask if it is possible to set up in bash so that each command is executed from of the top of terminal window. In other words if it is possible to execute clear before each command.   Also I wonder if it is possible to do this without using preexec() hook since I have history disabled anyway in bash.


I was watching a movie 21, and I saw this interesting expression. Check this out,please.  Mike and Tom, two best buddies, are playing basketball when a gorgeous girl passes by. Mike takes quite a shine to her, and his heart keeps pumping.  Tom suggests Mike ask her out but he's hesitant 'cause Mike believes she's out of his league.  Trying to encourage his friend, Tom says to Mike, with his finger pointing at the girl,      'You know, you say you want a life experience, right? Well, I'd say getting down with that would definitely qualify.'   Not knowing what 'get down' with something means, I checked the dictionary and found out  that it means to become good friends with somebody.  So, let me rephrase what Tom said:     'You know, you say you want a life experience, right? Well, I'd say if you become one of her good friends, it will surely meet the requirement of a life experience.'   I guess Tom was saying, like,     'You want a life experience, and asking her out is the very experience that you've been looking for. Go for it!'   Especially I wonder if he meant 'getting down with that girl'  when he mentioned 'getting down with that'.   Hoping that I could find an idiom 'get down with someone', I tried to look up all the dictionaries, which was fruitless.  I'd appreciate any comment. Thank you.


Could a method of preventing flag spam/abuse on chat be implemented?

I was wondering if there could be an addition of some kind of system on chat that would prevent a user from flagging for X amount of time in the instance that their last Y flags in Z time had been invalidated by the community.   At times it seems that some users do not understand the meaning of "offensive" or "spam" when flagging posts made by their fellow users and it can result in a lot of flags that just end up getting invalidated.  I'm not saying that this is consistently the case, sometimes I can go days without seeing a single flag pop up but then at times, there will be a sudden stream of flags for silly things that shouldn't be flagged all come through at once - I would speculate that it could be the same user taking offence to something when perhaps they should step back and take a deep breath... but I digress.  I'm not sure what the X, Y and Z would be in this instance, although my thought on it was 3 invalidated flags would result in a day without being able to flag, or something along those lines - something that would prevent the occasional invalid flag from locking you out from being able to raise more.  Think of it as a question ban but for flagging on chat I guess...


I am trying to understand what could be the possible reason which would have caused tempdb ldf file grow full and went out of space on the drive it resides.  Compared the pattern for last month and today was the unusual behaviour of tempdb.   From third party tools i have all the SQl that were running in that 8 hour window but what exactly is the correct way to find the culprit process?


Association Bonus Should Be Revoked for Accounts Caught "Cheating"

was recently caught plagiarising a significant number of answers on both Stack Overflow and on . Many of the plagiarised answers were deleted by a moderator.  Apparently this user wanted to regain his lost rep so badly that he engaged in voting fraud, and had his answers serially upvoted to the point where he gained an association bonus for all of his Stack Exchange accounts on September 16th:    The system reversed the serial upvotes, but it appears that his association bonus remains for his Stack Exchange accounts. The user's SO rep before his suspension totaled about 65 (minus the 100 bonus), while his rep on Share Point only totals 125 (again, not including the 100 bonus).    Additionally, this user's  was plagiarised, though a moderator recently edited it to include somewhat better attribution.  Users should not retain association bonus from voting fraud  It is my understanding that the association bonus  well enough to be trusted with skipping new user restrictions on other Stack Exchange sites.  However, this user has quite literally cheated his way to "earning" his association bonus. He did not, in fact, actually earn it. Yet the system appears to be letting him keep it.  I was about to suggest a change in the system to allow moderators to revoke the bonus, but I suppose that this sort of thing happens infrequently, to the point where it's probably not worth the devs' time to implement such a moderator tool. Would it be possible to just make the appropriate change in the database manually, this one time?  I considered the case that the retention of the bonus , but it does not appear that way to me.  Related: .


I've just upgraded my OS to Sierra and have turned on the "optimize storage" option for iCloud Drive. But strangely I now get a "your iCloud storage is full" message.    When I checked my local drive, it seems the total size of all folders inside wasn't the same as the iCloud Drive information. When I dive into iCloud preferences the Document size is insanely huge. How do I find out which ones are the large files?    [UPDATE]  I don't have any large files in my Documents folder. But it's strange:


L'Hopital rule to solve $ \lim\limits_{x\to 0} \left(\frac{\sin x}{x}\right)^{\frac{1}{x^{2}}} $

I am trying to solve the following limit:  \begin{equation} \lim_{x\to 0} \left(\frac{\sin x}{x}\right)^{\frac{1}{x^{2}}} \end{equation}  I tried using $ \ln $ to get a exponential expression for the equation as follows:  \begin{equation} \text{Let} \,\, y = \left(\frac{\sin x}{x}\right)^{\frac{1}{x^{2}}} \end{equation}  Apply $ \ln $ to bring down power and apply exponential:  \begin{equation} y = \exp\left(\frac{1}{x^{2}}\ln\left(\frac{\sin x}{x}\right)\right) \end{equation}  I have no idea how to solve the limit for $y$. From what I read, it can be done using l'Hopital  rule but I am unable to get an indeterminate form no matter how I try. Could somone please assist me?


What are the performance implications of Hyper-threading for single Nehalem+ CPU?

I am choosing between two models of servers, the major difference between them being the the availability of Hyper-Threading.  Servers in question are SYS-E32-1 and SYS-E32-3  (an  brand) and use either Intel Xeon  or , both  ( Core-i Xeon CPU):   SYS-E32-1:       4c / 4t 3.2 GHz+ SYS-E32-3:       4c / 8t 3.4 GHz+   The big difference between them is that the first has 4 core/4 threads configuration, while the latter has 4 core/8 threads, due to Hyper-Threading being enabled.  I am going to run CentOS 6 and other OS guests on a CentOS 6 host with KVM virtualization. Currently I assign 1 virtual CPU per virtual machine, as that's enough for my current loads. Our normal load is the usual web services.  How much should the performance differ for me? Is it close to having twice more computing power or nearly the same computing power, distributed over twice more cores?


What is the least residue of 49^4 modulo 23

This is what I got so far but for some reason I feel like I am wrong. 49 is congruent to 26 mod(23). Therefore we have 49^4 is congruent to 26^4 = 456976 which is congruent to 456923 mod(23)but this doesnt seem like the least residue  due to the issue of the theorem stating that 0 < r < m but here r is bigger than m


As we know wavelength of a particle is equal to (Planck's constant / momentum), so here momentum $= mv$ where $m$ is a mass of an object and $v$ is the velocity of an object.  What will happen when velocity tends to zero?  Wavelength of a particle can be observable? Here velocity tends to zero not exactly equal to zero.


Oldish Sci-Fi film where a crew is stuck on a ship and slowly die off only to find out it was a trick at the end

Trying to identify this movie I saw a long time ago.  I watched it in the 90s but it was probably from the 80s and not terribly well done either.  Probably B-Movie levels.  I can only remember a few points: There's a ship in deep space and there's a crew of a maybe ~6-8 characters. Stuff happens where characters are slowly killed off.  The only one I remember was a VR machine they use for relaxation.  One guy uses it for VR sex but gets killed during the session. Everyone is tense about the mysterious deaths. Something happens (I think the life support breaks?) and this causes a lot of strife among the crew members who slowly kill each other off. Finally there's like 2 people left after everyone else is dead and they are close to death and they just decide to space themselves so they open the hatch and find out they were on earth (or some planet anyway) all along.  Iirc, the planet looked like a post-apocalyptic one with ruined cities.  It was a simulation to test them or something like that.  Any ideas?  NB: It's not 'Alien Intruder' from '93, that one has the VR aspect, but the film I'm thinking about had the VR as only a minor thing.


How to obtain Hamiltonian formalism and phase space for Lagrangian with second-derivatives?

This is a special case of , which, I think, might have drawn little attention because it was too general. In this question, I would like to consider a specific case.  Take a classical system given by the action $$ S[x] = \int dt \left[ \frac{\alpha}{2} \ddot{x}^2 + \frac{\beta}{2} \dot{x}^2 + \frac{\gamma}{2} x^2 \right]. $$  This action is Lagrangian, but it is not what we are usually dealing with in physics, because the Lagrangian contains second time derivatives.  The equations of motion are:  $$ \alpha \ddddot{x} - \beta \ddot{x} + \gamma x = 0. $$  This can be solved as usual by employing Fourier transform:  $$ x(t) = a_1 e^{i \omega_1 t} + a_1^{*} e^{-i \omega_1 t} + a_2 e^{i \omega_2 t} + a_2^{*} e^{-i \omega_2 t}, $$  where $\omega_1^2$ and $\omega_2^2$ are the two roots of $\alpha \omega^4 + \beta \omega^2 + \gamma$, given by  $$ \omega_{1,2}^2 = \frac{- \beta \pm \sqrt{\beta^2 - 4 \alpha \gamma}}{2 \alpha} .$$  Now by definition the phase space is the space of solutions of equations of motion. In this case it is parametrized by two complex co-ordinates $a_{1,2}$, meaning that it is 4-dimensional.  I would like to know if there's a natural way to associate the symplectic structure (Poisson bracket) on this phase space. I.e.,  $$ \{a_1, a_1^{*}\} = ? $$ $$ \{a_1, a_2^{*}\} = ? $$ $$ \{a_2, a_1^{*}\} = ? $$ $$ \{a_2, a_2^{*}\} = ? $$ $$ \{a_1, a_2\} = ? $$ $$ \{a_1^{*}, a_2^{*}\} = ? $$


iPhone and SQLite introductory articles or tutorials

What resources are great to provide information on using SQLite for beginner iPhone developers?   Where to download the SQLite software for the iPhone?  Are there multiple versions, and do they have substantial differences? Where can I find some introductory tutorials?   I'm working on an iPhone project where the instructions are to store PLISTs into SQLite. My PLIST would be a read/write file. Is this possible?  As of now my PLISTs are read-only, so it very important to make it a read/write PLIST. The only method my lecturer suggested is storing it in SQLite, where reading/writing would be done there.  Please, any suggestions on intros for SQLite for the iPhone?


Is the Canon 7D compatible with all EF and EF-S lenses?

Are all the lenses compatible with 7d? Especially EF-S?  Anyone having a autofocus issue with 55-250mm IS lens?


I just learnt about the expression "to bite the bullet", meaning Accept the inevitable impending hardship and endure the resulting pain with fortitude (as seen in  in phrases.org).  I have read about its origin, but it looks a bit unclear or disputed, since different historical reasons appear in .  Is there any authoritative or more relevant source to get to know its origin? Does it always mean "show courage" or it depends on the region?


Why it keeps throwing NPE on mock object

[UPDATE]:    I know what NPE is,but I don't know why it appears here.So I think this is totally not a duplicated question as .But any way I have found the answer.To use Mockito in instrumented test,addition dependencies dexmaker and dexmaker-mockito are also required:    androidTestCompile "com.google.dexmaker:dexmaker:1.2" androidTestCompile "com.google.dexmaker:dexmaker-mockito:1.2"   And if you don't run yout test under MockitoJUnitRunner,addition initialization is also required as below answer has mentioned:    MockitoAnnotations.initMocks(this);   See also  for futher discussion.     I want to write a simple test that checks if user's data is shown on the UI.The Activity retrieves the data stored in sharedPreferences within onResume() and shows it on the UI.The following is my code for the test:    @RunWith(AndroidJUnit4.class) public class EditProfileActivityTest {  @Mock private UserPreference userPreference; private String FAKE_NAME = "Test";  @Rule public ActivityTestRule<EditProfileActivity> activityTestRule = new ActivityTestRule(EditProfileActivity.class,true,false);  @Before public void setUp(){      //Set fake SharedPreferences     when(userPreference.getName()).thenReturn(FAKE_NAME);      //Start Activity     Intent intent = new Intent();     activityTestRule.launchActivity(intent); }  @Test public void showUserData() throws Exception{     onView(withId(R.id.name_tv)).check(matches(withText(FAKE_NAME))); } }     where UserPreference is a custom class which simply wraps SharedPreference class and contains lots of getters and setters.This is its constructor     public UserPreference(Context context) {     this.context = context;     sharedPreferences = this.context.getSharedPreferences("Pref", Context.MODE_PRIVATE);     prefEditor = sharedPreferences.edit(); }     and one of its getter     public String getName() {     return sharedPreferences.getString(context.getString(R.string.pref_name), "Guest"); }     But when I run the test,it keeps showing NullPointerExceptiions on this line     when(userPreference.getName()).thenReturn(FAKE_NAME);   I've searched for related topics but I still can't see why.I think the concept of mock is to re-define a method's behavior no matter what the real implementation is. I am new to testing,so I am sorry in advance if this is a silly qustion.  By the way the test runs perfectly with the following code    @RunWith(AndroidJUnit4.class)     public class EditProfileActivityTest {      private UserPreference userPreference;     private String FAKE_NAME = "Test";      @Rule     public ActivityTestRule<EditProfileActivity> activityTestRule = new ActivityTestRule(EditProfileActivity.class,true,false);      @Before     public void setUp(){         //Start Activity         Intent intent = new Intent();         activityTestRule.launchActivity(intent);     }      @Test     public void showUserData() throws Exception{         onView(withId(R.id.name_tv)).check(matches(withText(FAKE_NAME)));     } }   But the preference data it retrieves is from the "real" device.In this case i can't make an assertion about what will be displayed so I can't tell whether the test is passed.This is why I want to mock the preference to make it predictable.


How to install VIM on Linux when I don't have root permissions?

I've got some troubles when I try to install Vim on Linux while I don't have a root account. The error information is shown below:    How can I solve this? Can I install it in another directory other than /usr/local/bin/vim?


For $a, b \geq 0$, $0 < x < 1$, show $(a+b)^x \leq a^x + b^x$

Let $a, b$ be positive real numbers. Let $0 < x < 1$. Show that  $(a+b)^x < a^x + b^x$.  The function $f(x) = (a+b)^x -a^x - b^x$ has $f(0) = -1$, $f(1) = 0$ and it seems to be an increasing function. But I am unable to show that it is increasing function.


i have a question, for example i have a website for example of score results, you can say that is my main website, with scores, news, whathever. But i buy new domains  where is searched a lot on google, if i create in this new domain a 301 redirect to my main website will this have any impact in terms of SEO? Example: Main domain: scoreresults.com  Other domains: scoreresultsintennis.com


Get EditText value on button click and do math with that value?

I am creating a program that is supposed to 1. Get the value of a spinner, either "Fahrenheit to Celsius" or "Celsius to Fahrenheit" 2. Get the value of EditText and convert it into an integer 3. Multiply that integer by 100 4. Set TextView text as that integer. The problem is that I'm getting java.lang.NumberFormatException. Here is my code:   package org.infinitech.degreescalculator.app;     import android.app.Activity;     import android.os.Bundle;     import android.view.Menu;     import android.view.MenuItem;     import android.view.View;     import android.widget.Button;     import android.widget.EditText;     import android.widget.Spinner;     import android.widget.TextView;     public class MainActivity extends Activity{         public Spinner spinner;         public String selectedItem;         public EditText input;         public Button button;         public String inputValue=findViewById(R.id.input).toString();         public Integer num=Integer.parseInt(inputValue);         public String num2;         public TextView answer;         @Override         protected void onCreate(Bundle savedInstanceState){             super.onCreate(savedInstanceState);             setContentView(R.layout.activity_main);             spinner=(Spinner)findViewById(R.id.options);             selectedItem=(String)spinner.getSelectedItem();             input=(EditText)findViewById(R.id.input);             button=(Button)findViewById(R.id.button);             answer=(TextView)findViewById(R.id.answer);             button.setOnClickListener(new View.OnClickListener(){                 public void onClick(View v){                     if(selectedItem.equals("Fahrenheit to Celsius")){                         num=num*100;                         num2=num.toString();                         answer.setText(num2);                     }                 }             });         }         @Override         public boolean onCreateOptionsMenu(Menu menu){             getMenuInflater().inflate(R.menu.main,menu);             return true;         }         @Override         public boolean onOptionsItemSelected(MenuItem item){             return super.onOptionsItemSelected(item);         }     }   Here is my logcat:      Caused by: java.lang.NumberFormatException: Invalid int: "" I fixed it! Here is my new modified code:   package org.infinitech.degreescalculator.app;  import android.app.Activity;  import android.os.Bundle;  import android.view.Menu;  import android.view.MenuItem;  import android.view.View;  import android.widget.Button;  import android.widget.EditText;  import android.widget.Spinner;  import android.widget.TextView;  public class MainActivity extends Activity{      public Spinner spinner;      public String selectedItem;      public EditText input;      public Integer num;      public Button button;      public TextView answer;      @Override      protected void onCreate(Bundle savedInstanceState){          super.onCreate(savedInstanceState);          setContentView(R.layout.activity_main);          spinner=(Spinner)findViewById(R.id.options);          selectedItem=(String)spinner.getSelectedItem();          input=(EditText)findViewById(R.id.input);          button=(Button)findViewById(R.id.button);          answer=(TextView)findViewById(R.id.answer);          button.setOnClickListener(new View.OnClickListener(){              public void onClick(View v){                  if(selectedItem.equals("Fahrenheit to Celsius")){                      num=Integer.parseInt(input.getText().toString())*100;                      answer.setText(num.toString());                  }              }          });      }      @Override      public boolean onCreateOptionsMenu(Menu menu){          getMenuInflater().inflate(R.menu.main,menu);          return true;      }      @Override      public boolean onOptionsItemSelected(MenuItem item){          return super.onOptionsItemSelected(item);      }  }


How to migrate MongoDB 2.4.14 file to MongoDB 3.6?

I have a database file from MongoDB 2.4 and we want use this on mongodb 3.6.  note: the file is original from the db path. Not from mongodump. This process is messy as it requires doing so on many of our clients.  Any advice will be welcomed as I'm a bit lost in this process.  Thanks


Defrosting at room temperature only one hour and then thaw in the refrigerator safe or not?

I know that it is unsafe to defrost frozen items at room temperature longer than 2 hours, but is it okay to leave frozen meat at room temperature for 1-2 hours and then move to fridge to continue thawing safely? Trust leaving frozen meat at room temperature for less than 2 hours won't make the bacteria to grow yet and believe it is still out of Temperature Danger Zone.


a submodule of a noetherian module is also noetherian?

I was studing some algebra by my own and I was wondering if this propiety is true:  Let $M$ be a module over a ring $A$ and $S\subseteq M$ a submodule, if $M$ is Noetherian, then $S$ is Noetherian.  I think I could use this prop:  Let $0\rightarrow M^\prime \rightarrow M \rightarrow M^{\prime\prime}\rightarrow 0$ be an exact sequence of $A$-modules. Then:  $M$ is Noetherian if and only if, $M^\prime$ and $M^{\prime\prime}$ are Noetherian.  and clearly I have $S\rightarrow M\rightarrow 0$ if I consider inclusion. But I can't find the other side homomorphism.   Thanks for your help.


Putting .sty file into ~/texmf-dist/tex/latex But still getting Error

I installed texLive 2013 on a mac. And I am using texmaker to typeset my documents. I have my threads regarding where to locate .sty files in mac. And I located my stackengine.sty in the following path   \usr\local\texlive\2013\texmf-dist\tex\latex  This is where all the packages are. So I believe putting my stackengine.sty in there will make sense, which is what I did.   I then tried to compile my tex file. But it failed miserably with the following error message in the log:   (/usr/local/texlive/2013/texmf-dist/tex/latex/base/latin9.def File: latin9.def 2008/03/30 v1.1d Input encoding file )) ! LaTeX Error: File `stackengine.sty' not found.   I already placed the stackengine.sty in that path already. I even placed the entire stackengine there as well. Still, the same error kept coming up. What have I done wrong here ?


Pressure exerted by a liquid on the bottom of a submerged object

I understand that pressure increases with depth in a liquid and that it is the difference in pressures at the top and bottom of an object submerged in a liquid that provides the buoyant force. What I do not understand is how the liquid exerts a pressure on the bottom of a completely submerged object. Isn't all the liquid displaced at this point? (No liquid remains underneath the object???) And if the pressures exerted horizontally are equal and opposite, it seems there is a net pressure directed downward. How then is the buoyant force still dependent on pressure differences and directed upward?


Development on the Android app seems ... kind of dead

I do realise that it's a free application, and there's been .  It's 2017. We're having new bugs kicked up by the HTTPS upgrade. I personally have had issues with it opening posts in my browser, and well...  At the very least, another status update would be nice. I'm primarily relying on it for notifications (which breaks for some people) and we've gone through 2–3 major Android revisions so far.  If it's abandoned, it would be nice to know. Otherwise, essentially, it feels a lot like the application is going to gradually bleed users through neglect.   I've noticed the iOS app gets fixed so... can we see some love for our Android users?


LaTeX parenthesis problem with multline environment

I have a problem with the different size of parenthesis with multiline (see image). Actually i don't care about the different size of the square parenthesis on M and \bar{M} but I really care about the round square one! I want the same size (and I don't wanna avoid \left and \right since I need the last parenthesis as big as the integral!). Some help?    Code:  \documentclass{article} \usepackage{amsmath} \begin{document} \begin{multline} \left\lbrace q\left( t\right) \right\rbrace = \left[ \Phi \right] \left( \left[ C\left( t\right) \right] \left[ \bar{M}\right] \left[ \Phi\right]^{\textrm{T}}  \left[ M\right] \left\lbrace q_{0} \right\rbrace + \left[ \Omega\right]^{-1} \left[ S\left( t\right) \right] \left[ \bar{M}\right] \left[ \Phi\right]^{\textrm{T}}  \left[ M\right] \left\lbrace \dot{q}_{0} \right\rbrace + \right. \\ \left. \left[ \bar{M}\right] \left[ \Omega\right]^{-1}  \intop_{0}^{t}  \left[ S\left( t-\tau \right) \right] \left[ \Phi\right]^{\textrm{T}}  \left\lbrace e \left( \tau\right) \right\rbrace d\tau  \right) . \end{multline} \end{document}