Analytically solving the conditional normal distribution

I'm trying to derive the gaussian conditional distribution for a 2 variable gaussian. I'm doing this as I'm studying Gibbs and need to learn how to derive conditionals the analytic way; practice makes perfect. The joint dist of x1 and x2:  The dist of x2:  The conditional dist:  I'm completely lost on simplifying the equation. I understand that the conditional of a normal is also a normal, but I'm not "seeing it" or even seeing how to move forward. My best guess is simplifying terms in the exponents. Buy in order to do so, I need to make the constant -1/2(1-P^2) go away in the joint. I'm not sure but I believe I can pull this out, as the natural log of this value. If so, this would allow the terms to consolidate somewhat. Is this the right direction? Am I thinking about it wrong? (I am trying to solve this brute force analytically, not through a short cut which requires a proof of its own to understand.) Edit: When I do as described above, factor the multiplied term out of the exponent, I end up with:  Not sure that this is beneficial. However, it does look slightly improved..


root password found changed. Did someone break into my server?

This morning I found myself unable to log into the root account on one of my (CentOS 6) servers. I booted into single user mode and reset the root password. Everything seems to be working normally now.   I have a number of monitoring metrics that watch behavior on this server and have seen no evidence of nefarious activity. However, I am not sure I can trust the security of this server without doing a full OS reinstall.   What steps can I take to diagnose the cause of this?  In theory someone may have had root access to my machine. Is there any way I can rule this possibility out?


Adjusting position of individual nodes in bar chart

The labeling of the bars is sometimes behind the error bar. Lifting them all isn't elegant but I haven't found a way to adjust the positions of the individual nodes. I included the third set of bars just to show that not all bars are not labeled (if that would make a difference). Perhaps there is another way of setting the labels than the nodes near coord and point meta.        \documentclass{book}       \usepackage{caption}       \usepackage{pgfplots}       \usepackage{booktabs}       \usepackage{pgfplotstable}        \begin{document}       \definecolor{gray}{cmyk}{0,0,0,0.1}       \definecolor{gray1}{cmyk}{0,0,0,0.3}       \definecolor{gray2}{cmyk}{0,0,0,0.5}       \definecolor{gray3}{cmyk}{0,0,0,0.7}        \begin{figure}[htb]       \begin{minipage}{\textwidth}       \pgfplotstableread{        x    y1  y1_err  y2  y2_err  y3  y3_err  y4  y4_err meta1 meta2 meta3 meta4        A    100 0.1 100 0.1 81  7   87  5 a a b b         B    100 0.1 100 0.1 83  8   97  2 a a b a         C    84  2   87  2   86  4   93  1 \phantom{} \phantom{} \phantom{} \phantom{}          }\loadedtable         \pgfplotsset{width=18cm,compat=1.9}         \centering         \begin{tikzpicture}         \begin{axis}[ybar,         ylabel={\%},          symbolic x coords={A,B,C},         xtick={A,B,C},         ymin=0,         ymax=110,         nodes near coords,          every node near coord/.append style={yshift=0.2cm},             point meta=explicit symbolic,           ]         \addplot+[error bars/.cd,         y dir=both,         y explicit         ][black,fill=gray]table[         meta index=9,         x=x,         y=y1,         y error=y1_err,         ]{\loadedtable};         \addplot+[error bars/.cd,         y dir=both,         y explicit         ][black,fill=gray1]table[         meta index=10,         x=x,         y=y2,         y error=y2_err,         ]{\loadedtable};         \addplot+[error bars/.cd,         y dir=both,         y explicit         ][black,fill=gray2]table[         meta index=11,         x=x,         y=y3,         y error=y3_err,         ]{\loadedtable};         \addplot+[error bars/.cd,         y dir=both,         y explicit         ][black,fill=gray3]table[         meta index=12,         x=x,         y=y4,         y error=y4_err,         ]{\loadedtable};        \end{axis}       \end{tikzpicture}      \end{minipage}     \end{figure}     \end{document}


How to NOT store credentials for WPA enterprise?

I'm connecting to some enterprise wireless network (eduroam).  The thing is that it saves the User/Password in the wireless settings, anyone can click 'Show password' and see my university account password.  What I want is that it prompts me everytime the credentials inputs when I try to connect to the network and don't save it under the 'settings' page.  Is this possible? If yes, how?  Thanks  Ubuntu 18.04 LTS


I am booting Ubuntu 15.10 from a Transcend Jetflash USB drive. getting kernal vesamenu.c32 not found

I am booting Ubuntu 15.10 from my flash drive, and I am getting the error for kernel image vesamenu.c32 (i cant recall the exact error message. The original OS on the C:/ drive is Windows XP.  Can I find the vesamenu.c32 on the internet, download it, and copy it to the correct directory? If so, how many places is it used? Also, if its possible, can you write me a batch (.bat) file for windows to copy it to all the right places? (Or tell me how to write one?)  Thx  Addition to question:  What I am saying is 'is it possible to find the vesamenu.c32 on the internet, download it, and copy it to the appropriate directories? If so, pls tell me where


Fiz Dualboot Mais queria Almentar o Espaço do Ubuntu

Fiz DualBoot Recentemente Com xiuindows 10 e Ubuntu 20.04 Mais Deixei Apenas 50gb Para o Ubuntu E Queria Aumentar Para 100gb English:  I did Dual Boot recently with windows 10 and Ubuntu 20.04 but I left only 50gb for Ubuntu and now want to increase it to 100gb


About linear regression and polynomial functions

Can I apply linear regression to any function to the x's.  For example:  Polynomials with one variable: y = w_0 + w_1 * x + w_2 * x2 + ... + w_D * xD  Polynomials with multiple variables (let's say there are 2 variables and the order of the polynomial is also 2, so it's easy to write): y = w_0 + w_1 * x_1 + w_2 * x_2 + w_3 * x_1 * x_2 + w_4 * (x_1)2 + w_5 * (x_2)2  Radial basis functions: y = w_0 + w_1 * f(x_1) + w_2 * f(x_2) + ... + w_D * f(x_D), where f(x) is a radial basis function.


I have the following code in my php file:           session_start();         include "connect.php";         if (isset($_POST['email']) && isset($_POST['password'])) {             $email = htmlspecialchars(mysqli_real_escape_string($conn, $_POST['email']));             $password = htmlspecialchars(mysqli_real_escape_string($conn, $_POST['password']));           function process() {              include "connect.php";             if  (isset($_POST['email']) && isset($_POST['password'])) {                 $email = $_POST["email"];                 $password = $_POST["password"];             }              mysqli_select_db($conn, "users");             $sql = "SELECT * FROM users WHERE email='$email' AND password='$password'";             $result = mysqli_query($conn, $sql);             $count = mysqli_num_rows($result);              if ($count >= 1) {              $_SESSION['id'] = $id;             $_SESSION['email'] = $email;             $_SESSION['password'] = $password;             header('location:index.php');     } else {         echo "Email/Password is incorrect";     } }         if ($email != "" or $password != "") {             if (isset($_POST['submit'])) {                 process();             } else {                 echo "Error: " . mysql_error();             }  } }   How would I go about preventing sql injection in my login page? I searched on the internet and most sites said I must use the mysqli_real_escape_string() function, but this did not seem to change things at all when I used the sql injection in my site again. please help :)


shell to print modification date of all directories name match pattern

I want to write a shell program which will go through all folders whose names match a pattern like this:  sudo sh  shell.sh   pub    When run, the script will look for all folders whose name contains pub and print its modification date. I wish to have code which will print results like in this image:  I have this code but it is not giving me the result I expect.  echo  'the folder '$1' was modified at ';  find  -type d -name 'kam*'  -exec stat -c '%y %n' '{}' \;   I must go through every folder and output text echo 'the file '$1' was modified at '; and print the date like in the image.  I would like a result like this:  netcom@hotspot:~$ bash script.sh testRegex Pub the folder testRegex was modified on may 15 01:19  the folder Public was modified on may 19 01:19    the folder Pubos was modified on may 19 01:19


Error - Package 'pulseaudio' has no installation candidate

I have just recently upgraded to Ubuntu 18.04 on Dell Vostro 15 laptop. I had some problems related to pulseaudio, so I ran these commands as it is shown  sudo apt-get purge pulseaudio sudo apt-get clean && sudo apt-get autoremove  After executing these commands I ran sudo apt-get install pulseaudio and even tried running sudo apt install pulseaudio but these errors occured : Reading package lists... Done Building dependency tree        Reading state information... Done Package pulseaudio is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'pulseaudio' has no installation candidate  Any ideas how do I fix this?


How do I convert and 14.04 ISO DVD to the installation Disk?

How do I convert my ISO DVD of Ubuntu 14.04 Desktop 64 version to a DVD that will install the 14.04 Ubuntu operating system?


What are the particular limitations of Hexadecimal storage on a hard drive?

I'll preface by saying I am not a computer specialist. My question is posted as a point of curiosity.    Scouring the web for answers, I have seen posted that hexadecimal could be used to store numerical information on hard drives. I have even asked on this site and received very well written and logical answers.  But there are many sites where there are those that allege that hexadecimal can be used to store numerical information on a hard drive.  Note: store, not display.    The prevailing logic in these cases is since hex digits are half bytes, or nibbles, they only occupy have the size of regular numerical value from a character set.    For every 100 bytes used to represent a number a 100 digits long, built from a character set, only 42 bytes may be used to store the same number sequence as hex digits. The equation: [100 log 10/log 16] is utilized to support this notion.    Yet, others have alleged that the actual storage of information in hexadecimal on a hard drive is not that efficient because the hex digits (A-F) would be stored as full characters requiring 8-bits, or 1 byte.  For example, to store 1A34B7 would actually require at least two hex digits to represented with full bytes on the hard drive instead of half bytes for the numerical portions. It can display the value in half-bytes, but once storage comes into play, the character hex digits must use full bytes.   What is the reality of this scenario?    Thank you.


Why is this sequence of functions not uniformly convergent?

For the following sequence of functions and its limit function, we can see that $f_n(x)$ is clearly pointwise convergent  $$f_n(x) = x^n\text{ }\forall x\in[0,1]\text{ and }\forall n\in\mathbb N^*\\ f(x) = \begin{cases}0&\text{if } x\in[0,1)\\1&\text{if } x=1\end{cases}$$  However, I was wondering why this is not uniformly convergent. The condition for uniform convergence is:  $$|f_n(x) - f(x)| < \epsilon,\ \ \ \forall x \text{ when } n > N$$  Now most sources present an argument along the lines of: assume that $f_n(x)$ is uniformly convergent and that $0 < x < 1$, this means that $x^n<\epsilon$ whenever $n>N$. Specifically, this would mean $x^{N+1}<\epsilon$ for some fixed $N$. But if we now pick $x$ such that $1 > x > ε^{\frac{1}{N+1}}$, then this would lead to a contradiction, therefore $f_n(x)$ is not uniformly convergent.  However, I was wondering why couldn't we take $n$ to infinity. If $0 < x < 1$, then $\lim_{n\rightarrow \infty} |f_n(x) - f(x)| = 0$ (which is less than $\epsilon$). Now since $|f_n(x) - f(x)|$ will always be $0$ if $n > \infty$, then wouldn't this be uniformly convergent?


Hi I want to read a line from a .txt file using the Bufferd reader everything works perfect and I get my result but in the same time I get a Nullpointer exception at the end.  I want to reed this line from a .txt : 4 4;3 5 4 8 ;3 5 21,3 4 17,4 5 13,8 3 29,  public static void DateiLeser(){            BufferedReader br = null;         try {              br = new BufferedReader(new FileReader(new File("dat.txt")));             String line = null;   while(!((line = br.readLine()).isEmpty())) {     //<-Nullpointer                 //reading tasks             }         } catch(FileNotFoundException e) {             e.printStackTrace();         } catch(IOException e) {             e.printStackTrace();          }          catch(ArrayIndexOutOfBoundsException e) {              e.printStackTrace();          }          finally {             if(br != null) {                 try {                     br.close();                 } catch(IOException e) {                     e.printStackTrace();                  }             }         }      }


I've read some things in some forums however they usually tell me to add a PPA third, to update and run the command apt to install the cinnamon, but it never works. When running the command returns the terminal saying it is impossible to install due to lack of dependencies, and which I can not download and install individually. I've tried adding the repositories of Linux Mint to Ubuntu, nothing bad.  I wonder how to do that or compile the source code.


What is an example of a Lie algebra L and its non-semisimple representation? I need this for study so any help would be appreciated.


I'm new to bash and I have been having hard time to understand and implement this flock logic in python. (  flock -e 200   echo "locked"   sleep 5  ) 200>/tmp/blah.lockfile  echo "lock released"  I have a python script in which I would like to incorporate something like above that acquires a lock on volume. I understand that 200 is used a file descriptor but is that needed in python? Is the .lockfile something that will be created or is it a existing file?


Why is the second column of my tabu not vertically aligned to the middle?

I'm trying to create a SWOT (strengths, weaknesses, opportunities, threats) table, which is a basic 4x2 table. The cells that aren't part of the header will contain itemized text. All cells have to be vertically and horizontally aligned to the center.  I've managed to get it nearly working, as such:  \begin{tabu}{|X[c,m]|X[c,m]|} \tabucline-  \rowfont{\bfseries} \cellcolor[HTML]{009925} STRENGTHS & \cellcolor[HTML]{D50F25} WEAKNESSES \\[5pt] \tabucline-  \begin{itemize}     \item Hello     \item This is an item     \item This is another item \end{itemize}  & \begin{itemize}     \item Hello     \item This is an item     \item This is another item \end{itemize} \\ \tabucline-  \rowfont{\bfseries} \cellcolor[HTML]{3369E8} OPPORTUNITIES & \cellcolor[HTML]{EEB211} THREATS \\[5pt]  \tabucline-  \begin{itemize}     \item Hello     \item This is an item     \item This is another item \end{itemize}  & \begin{itemize}     \item Hello     \item This is an item     \item This is another item \end{itemize} \\  \tabucline-  \end{tabu}   This outputs the following table:    The headers of the second column are not vertically aligned (like with the first). However, the itemize of the second column are vertically aligned, which leads me to think I've made a small mistake. However, I can't manage to figure out what the issue is. Please help.


If you finish a world without fighting the Broodal, can you still fight them later?

I've just seen that in a speedrun: If you collect enough moons to move on to the next world, and cash them in at the ship, the broodal ship just leaves.  Does that mean that the Broodal fight wont happen, so you missed the triple moon it gives? Or if you go to the arena, even without the ship you will have the fight happen?  Clip where this happens :


Ansible uses OpenSSH as the bottomed network communicative implementation, but does it support multi-hop login?   I mean, if Ansible can login a server directly, but can it log in server_a then from server_a login server_b for config the server_b?


I want to display the node count along with the filter in views exposed filter same feature like facets can any one help me out in this.


If $X_1, X_2 $ are independent RVs. then are ${X_1}^2$ and ${X_2}^2$ are independent?

If $ X_1 , X_2 $ are independent RVs, then are ${X_1}^2 \,and\, {X_2}^2 $are independent?  P.S: this came up when i was working on the condition for which $Var({X_1 X_2})=Var({X_1}) Var({X_2})$  My Intuition says yes , but Covariance formula doesnt seem to work.


How much of Zion's population was Red Pills?

The majority of characters in The Matrix films were born in the Matrix and freed later, no doubt because this allows them to enter the Matrix, and thus, you know, be in most of the film.  But there are a few characters who are, as Tank puts it, "pure, old-fashioned, home-grown human."  We know from the Architect that Zion is re-founded in each cycle by "23 individuals: 16 female, 7 male", plus the One, all of whom are from the Matrix.  But by the time that the next "One" emerges, Zion has swelled to a population of 250,000 or so (if I recall), many of which are the descendants of Red Pills, but are not themselves from the Matrix.  For example, Tank.  Are there any stats about how the population of Zion breaks out, between these two categories?  Is the majority of Zion's population still being rescued from the Matrix, or has the natural birthrate of the city overtaken the "unplugging" process?  Are Red Pills common within the city, or are they disproportionately concentrated in the fleet because they are the only ones who can jack in?


Can you win a game of Splendor if you still have cards in reserve?


How do I "flag a moderator" to get control of my now-orphaned account?

I initially set up my account --  -- in the summer of 2008 when the site was still very much in beta. Since I used myopenid.com for authentication and myopenid.com is no longer with us, I would like to apply the credentials I created for this account to my former account so I can keep using that account.  In another question --  -- it was mentioned that all you need to do is 'flag a moderator' to get access to an account which can't authenticated anymore (because the authentication services is gone).  How do I flag a moderator to get access to my old account?


Should a question with a significant negative score be automatically closed?

We have two tools for community moderation of questions: downvotes and close votes. Both are used to indicate a question is not "good", yet they work in isolation. Why is this? The tooltip for a downvote says:  This question does not show any research effort; it is unclear or not useful.  I downvote questions that I don't welcome. Either because they are unclear (which ties nicely to a close reason) or because they show no research effort (not a close reason, but desired by many). If a question has reached a score of -5, -7 or -10, is this really a question that should be open? It will probably be closed eventually, for reasons relating to the downvotes, but why do we have to act twice? Note: these scores are just examples, clearly different sites would have different typical scores for poor questions. I'm beginning to wonder if a low question score should trigger a question to be on hold. I haven't figured out the finer details yet, it's just an early thought. But I wanted to start a discussion about the pros and cons of keeping the two moderation tools separate, as they are now. I'm not suggesting we do away with close votes, I'm just questioning whether a low question score is another way a question could be closed. Based on a  looking at Stack Overflow, it seems there are thousands of questions with a negative score that are still open:  Score        Open Questions ===========================  -4                  17,258  -5                   7,116  -6                   2,983   -7                   1,322  -8                     693   -9                     261  -10                    189  Does this data mean anything? I'm not sure. It perhaps proves there is a benefit to having open questions with a low score. Or perhaps this shows just how many crap questions could be closed if an auto-closure system kicked in. Here's  but for questions with at least one answer. The numbers are smaller but still significant.


i need to understand, what is meant by allow unsafe code?    and there is safe and unsafe code ?


If photon is massless, then how can it interact with gravity?

Photons are considered massless so how do they interact with gravity? According to Einstein Relativity, only curvature of space is responsible for bending of light rays. If so, and mass to mass interaction is useless, is considering gravitation a force pointless?


installation 14.04 - Machine does not restart - stopping early crypto disks ok

This is my first time to install Ubuntu version is 14.04 desktop.   After installation on a virtual machine (Hyper V), It says to restart.  IT will stop at:  stopping early crypto disks      ok  Then it will stop here and it seems I have to shutdown the virtual machine to restart Ubuntu.   I am not sure if my installation is complete or not.  Thanks for any help.


How can I efficiently form terrain from a large number of cubes in XNA?

I have a project with a floor built from with small cubes (100x100 of them). If I exceed that size, the performance of my game suffers. How can I efficiently draw a larger number of identical models?  Here's how I'm currently drawing the ground:      //Function to draw my ground ( 100 X 100 X 1)     public void DrawGround(GameTime gameTime)     {         // Copy any parent transforms.         Matrix[] transforms = new Matrix[this.model.Bones.Count];         this.model.CopyAbsoluteBoneTransformsTo(transforms);          //loop 1 cube high         for (int a = 0; a < 1; a++)         {             //loop 100 along cube             for (int b = 0; b < 100; b++)             {                 //loop 100 cubic wide                 for (int c = 0; c < 100; c++)                 {                     // Draw the model. A model can have multiple meshes, so loop.                     foreach (ModelMesh mesh in this.model.Meshes)                     {                         // This is where the mesh orientation is set, as well                          // as our camera and projection.                         foreach (BasicEffect effect in mesh.Effects)                         {                             effect.EnableDefaultLighting();                             effect.World = transforms[mesh.ParentBone.Index] * Matrix.CreateTranslation(this.position);                             effect.View = this.view;                             effect.Projection = this.projection;                           }                          // Draw the mesh, using the effects set above.                         mesh.Draw();                     }                 }             }         }     }   I think it is better to use the a vertex buffer, but I have not found a tutorial for that I want to do. Can you explain how I can do this?


Is there a way to establish what version a Windows 7 product key is?

I have a Windows 7 product key that I foolishly did not label.  Rather than downloading and creating disks for however many different ISOs exist (Basic, Pro, Ultimate, 32-bit/64-bit, upgrade, full version) and testing each one until one works, is there a way I can discover what the key is for specifically?


Does a similar easy to read introduction like David Mc Mohan's Demystified books exist for LQG? I'd like something easier to start with than a paper but deeper than a popular book.


SF book from the 80's or 90's about a Space Cop who is made into a slave with a pain/pleasure implant?

When I was rather young I had picked up a bunch of SF books at the library,  one had a kind of interested plot about an undercover Space Cop of some sort who had somehow been turned into a slave.  It might have been part of a series.  The main character was female and she had some sort of pain / pleasure implant.  She had been turned into the slave of some sort of Space Pirate whom she was intent on bringing to justice or something.  It was rather a graphic book, both sexually and when it came to violence.  It also wasn't what you would call well written.  Though at the time the idea of a future with some sort of Space Patrol going undercover to capture Space Pirates had fascinated me.  Recently someone mentioned the same book and neither of us could remember its name.    We were both pretty sure it was written in the 80's or 90's and most of it took place on a space ship where the girl was kept hostage.  We think that the Pirates hadn't known she was an undercover Space Cop and she may have been drugged and implanted with this device.  She might have been a crew member at first (maybe an engineer) that the Captain turned into a slave, we're really not sure about that.  We can't even remember how it ends for sure...  Can anyone help us?


How can I remove the background and replace with transparency (as represented by checkered background in PS)? And are there any limitations in the file type I can then export the image to?


Why Electric current is considered fundamental quantity

It seems to me electric charge is more fundamental than electric current. Can anybody explain why electric current is taken as fundamental quantity and not electric charge?


My /boot partition is nearly full and I get a warning every time I reboot my system. I already deleted old kernel packages (linux-headers...), actually I did that to install a newer kernel version that came with the automatic updates.  After installing that new version, the partition is nearly full again. So what else can I delete? Are there some other files associated to the old kernel images?  Here is a list of files that are on my /boot partition:  :~$ ls /boot/ abi-2.6.31-21-generic         lost+found abi-2.6.32-25-generic         memtest86+.bin abi-2.6.38-10-generic         memtest86+_multiboot.bin abi-2.6.38-11-generic         System.map-2.6.31-21-generic abi-2.6.38-12-generic         System.map-2.6.32-25-generic abi-2.6.38-8-generic          System.map-2.6.38-10-generic abi-3.0.0-12-generic          System.map-2.6.38-11-generic abi-3.0.0-13-generic          System.map-2.6.38-12-generic abi-3.0.0-14-generic          System.map-2.6.38-8-generic boot                          System.map-3.0.0-12-generic config-2.6.31-21-generic      System.map-3.0.0-13-generic config-2.6.32-25-generic      System.map-3.0.0-14-generic config-2.6.38-10-generic      vmcoreinfo-2.6.31-21-generic config-2.6.38-11-generic      vmcoreinfo-2.6.32-25-generic config-2.6.38-12-generic      vmcoreinfo-2.6.38-10-generic config-2.6.38-8-generic       vmcoreinfo-2.6.38-11-generic config-3.0.0-12-generic       vmcoreinfo-2.6.38-12-generic config-3.0.0-13-generic       vmcoreinfo-2.6.38-8-generic config-3.0.0-14-generic       vmcoreinfo-3.0.0-12-generic extlinux                      vmcoreinfo-3.0.0-13-generic grub                          vmcoreinfo-3.0.0-14-generic initrd.img-2.6.31-21-generic  vmlinuz-2.6.31-21-generic initrd.img-2.6.32-25-generic  vmlinuz-2.6.32-25-generic initrd.img-2.6.38-10-generic  vmlinuz-2.6.38-10-generic initrd.img-2.6.38-11-generic  vmlinuz-2.6.38-11-generic initrd.img-2.6.38-12-generic  vmlinuz-2.6.38-12-generic initrd.img-2.6.38-8-generic   vmlinuz-2.6.38-8-generic initrd.img-3.0.0-12-generic   vmlinuz-3.0.0-12-generic initrd.img-3.0.0-13-generic   vmlinuz-3.0.0-13-generic initrd.img-3.0.0-14-generic   vmlinuz-3.0.0-14-generic   Currently, I'm using the 3.0.0-14-generic kernel.


Where and when is the best time to see the tulip fields in the Netherlands?

I would like to see the tulip fields in the Netherlands.  Where and when is the best time to do it? (after the flower blooms and before the crop) Is it possible to go by public transportation or is it better to do it by car?     Is there a train that crosses those fields?


Making my calculator loop until the user tells it to stop?

I have a little difficulty writing code for my class, and I've been working on this one for about a week. I just can't get it to loop and redo the calculator block until the user types "Yes". I solved the running total problem I had, but no matter what I input when the calculator asks "Are you finished?", doesn't loop back and run the calculator again.   import java.util.Scanner; public class Lab4InputRunningTotal {   public static void main (String[]args)   { int addTotal = 0; int subTotal = 0; int multiTotal = 0; int divTotal = 0; int remTotal = 0; String finished;  double numberOne; // First user input double numberTwo; // Second user input char operator; // Operator Input  do // Start of calculator block {   System.out.println("Enter your first number"); // Prompt for first number    Scanner number = new Scanner(System.in);   numberOne = number.nextDouble();    System.out.println("Enter your second number."); // Prompt for second number   numberTwo = number.nextDouble();    Scanner operatorIn = new Scanner(System.in); // Declare a char scanner to read the operator   System.out.println("Enter an operation: +, -, *, /, %");   operator = operatorIn.next().charAt(0);    switch (operator) // Switch is neater and more compact than multiple if and else if statements.   {     case '+':   System.out.println("The sum of " + numberOne + " plus " + numberTwo + " is " + (numberOne + numberTwo)); // Addition     addTotal += 1;     break;      case '-':  System.out.println("The difference of " + numberOne + " minus " + numberTwo + " is " + (numberOne - numberTwo)); // Subtraction     subTotal += 1;     break;      case '*':  System.out.println("The product of " + numberOne + " times " + numberTwo + " is " + numberOne * numberTwo); // Multiplication     multiTotal += 1;     break;       case '/':        if (numberTwo == 0.0)       System.out.println("We're sorry. We cannot display the quotient of your numbers. \n  You cannot divide by zero, because that would implode the universe. "); // In case of zeroes       else        {         System.out.println("The quotient of " + numberOne + " divided by " + numberTwo + " is " + numberOne / numberTwo); // Division         divTotal += 1;       }       break;      case '%':        if (numberTwo == 0.0)       System.out.println("We're sorry. We cannot display the remainder of your numbers. \n  You cannot divide by zero, because that would implode the universe. "); // Also in case of zeroes       else       {         System.out.println("The remainder of " + numberOne + " divided by " + numberTwo + " is " + (numberOne % numberTwo)); // Remainder         remTotal += 1;       }       break;       default: System.out.println("Uh Oh. Something went wrong. Please try again.");     break;   }    System.out.println("Are you finished with your calculations? Yes or No.");   finished = operatorIn.next().toLowerCase(); } while ( finished == (String)"no"); // End of calculator block  System.out.println( "You used addition " + addTotal + " times. \nYou used subtraction " + subTotal + " times. \nYou used multiplication " + multiTotal + " times. \nYou used division " + divTotal + " times. \nYou used remainder " + remTotal + " times.");       } }   And from there, I really don't know how to fix it.


Finding sum of residues of a rational function

This question is part of an assignment of an institute in which I don't study .  Question: If p and q are polynomials with deg(q)>deg(p)+1 prove that sum of the residues of p/q at all its poles is 0.  Attempt: Question is related to Residue theorem . But no information is given about roots of q . Also If we try to use residue theorem at $C_{\infty}$ then p can have a root z =0 which will create problem as it is a pole at $\infty$ . So , $\sum_{k=1}^nRes[p/q;z_k]=-Res[p/q,\infty] $ which will be 0 only if $Res[p/q,\infty]$ =0 . So , kindly tell how should I approach this problem.


Can I Write A Story Within The Forgotten Realms And Publish it?

If I were to use a character, say a Deva, and create a story using them can I publish it?  For things like town names, God titles and small amounts of lore I can change them. But the real question is, are Deva (a playable race within the 4e and 3.5e games) copyrighted?  I have a premise of a Deva losing his Ancestral Memories and trying to figure out why his connection with Selune, the moon Goddess, is missing. But at the same time this also means that I would need some kind of idea on if Selune, Deva's and other such things are copyrighted.


Eigenvalues of Angular Momentum in Quantum Mechanics

The eigenvalue equation of the $L^2$ operator is given by  $$L^2f_l^m = \hbar ^2l(l+1)f_l^m$$  Side: So a determinate state for some observable $Q$ is a state where every measurement of $Q$ returns the same value (let this value be $q$). Then the standard deviation of $Q$ in a determinate state would be zero, i.e.  $$\sigma ^2 = \big\langle (\hat{Q} - \big\langle Q \big\rangle )^2\big \rangle = 0$$  if every measurement gives $q$, then $\big\langle Q \big\rangle$ = $q$. Then using the rules of Hermitian operators, we can get  $$\hat{Q}f = qf$$  So my question is, given the very first equation, why is the magnitude of $L$, in units of $\hbar$, $\sqrt{l(l+1)}$? The eigenvalue of $L^2$ in units of $\hbar$ is $l(l+1)$.   From what I wrote above, $\big \langle L^2 \big \rangle = l(l+1)$.   In general, $\sqrt{\big \langle L^2 \big \rangle} \neq L$. So why is it that, $L = \sqrt{l(l+1)}$?   I'm trying to understand the magnitude of the $\vec{L}$, which in the common illustration shown to demonstrate that $L_z$ can never be greater than $L$, is said to be $\sqrt{l(l+1)}$. But all they did in Griffiths was take the square root of the eigenvalue of the $L^2$ operator.


I need help with creating these sun sail shapes, I wasn't able to find a solution on the internet.


Symmetrical twin paradox in a closed universe

Take the following gedankenexperiment in which two astronauts meet each other again and again in a perfectly symmetrical setting - a hyperspherical (3-manifold) universe in which the 3 dimensions are curved into the 4. dimension so that they can travel without acceleration in straight opposite directions and yet meet each other time after time.  On the one hand this situation is perfectly symmetrical - even in terms of homotopy and winding number. On the other hand the Lorentz invariance should break down according to , so that one frame is preferred - but which one?  So the question is: Who will be older? And why?  And even if there is one prefered inertial frame - the frame of the other astronaut should be identical with respect to all relevant parameters so that both get older at the same rate. Which again seems to be a violation of SRT in which the other twin seems to be getting older faster/slower...  How should one find out what the preferred frame is when everything is symmetrical - even in terms of GRT?  And if we are back to a situation with a preferred frame: what is the difference to the classical Galilean transform? Don't we get all the problems back that seemed to be solved by RT - e.g. the speed limit of light, because if there was a preferred frame you should be allowed to classically add velocities and therefore also get speeds bigger than c ?!? (I know  is only a local theory but I don't understand why the global preferred frame should not 'override' the local one).  Could anyone please enlighten me (please in a not too technical way because otherwise I wouldn't understand!)  EDIT Because there are still things that are unclear to me I posted a follow-up question:


I wrote a program that compiles and runs an external program(prog1.c). And I want to get the output of the prog1.c somehow. for example if prog1.c is printf("HELLO"); and prints HELLO to the terminal, I want this output to get to a variable in my program or a file. I saw somewhere something about pipe, but I dont know this command much and dont know if this is the right way.  Anyone can help me, direct me or show me an example? Thank you!


I am doing a minuteman quest name Taking Independence and it wants me to power up a radio transmitter. I built a small generator and attached the cables, but it doesn't seem to work. Any advice?


Dystopian novel where the last city moves on a giant track

Probably published late 1970s or early 1980s. A large group of people are organized into a small city that is in a huge contraption that has to keep moving around the earth after some apocalyptic event. They might call the conveyance "Earth City." They have to keep pulling up track behind and placing it in front to proceed.   They are following electromagnetic pulses in the earth's crust that provides motive power for the thing.   The direction in which they are heading is called "up future," whilst the direction from which they have come is called "back past." Any ideas would be much appreciated.


I have currently been introduced to relativity of simultaneity with the following thought experiment:  Consider a train in which there are two presidents, one sitting at the front and the other at the back of the train. The two presidents must sign an agreement simultaneously for everyone to be happy. The way that they are going to carry this out is by having a laser shoot a light beam simultaneously towards each of the presidents and when the light beam gets to each president they will sign the agreement. Now consider this train moving from left to right and we will analyse this situation from the two inertial reference frames "train frame" and "platform frame". It then follows that from the "platform frame" the two presidents have not signed the agreement simultaneously while regarding this situation from the "train frame" the presidents did sign the agreement simultaneity. Until this point I understand everything  Q: Now consider that there is a bomb in the middle of the train and that bomb would blow up if the two presidents don't sign the agreement simultaneously and won't blow up if they do (this can be achieved via sensors added at the back and front of the train). Now this experiment is carried and from " platform frame" train blew up while in "train frame" train didn't blow up. Now this poses a paradox as the train can't blow up and not blow up in the same time even if its a matter of reference frames, since reality is connected. How can this paradox be resolved?   Moreover from this paradox I get the feeling that, even though observers in different inertial reference frames don't agree on simultaneity, they must agree on something, maybe cause of their action on nature around them? I don't know how to call this agreement. Because if they wouldn't agree on this (idk how to put it into words) then we would get paradoxes as the one above. Thank you for any help  ps: The though experiment with the presidents was presented by Brian Greene in his course on special relativity


Is there a way to teleport to a type of specific block in Minecraft in Windows 10 Edition?

I lost my house and buildings, and spawned very far away. Luckily, my house is rather gaudy, with an enchantment table, crying obsidian; the works. Many, many hours into this world and really don't want to start over. I broke my bed while remodeling and forgot to replace it... Is there a command to teleport to a certain type of block in Minecraft Windows 10 Edition? And if so, what is it?


Why does voltage not increase when batteries are connected in paralell?

Having seen this question often on this platform, but never read a statisfying answer.


Temperature of the Sun via Stefan-Boltzmann law

Let's calculate the sun's surface temperature using the Stefan-Bolztman law in the form  $$\langle w\rangle=\frac{4\sigma}{c}T^4$$   where $\sigma=5.67\cdot10^{-8}$ W$\cdot$m$^{-2}$/K$^4$ is the Stefan–Boltzmann constant, $\langle w\rangle$ is the timep-average of the energy density of the sun's radiation, and $T$ the temperature we are looking for.  I am given the value $I_0=1.35$ kW/m$^2$ of the solar constant (the power per unit area of the solar radiation on a panel oriented perpendicular to the sun's rays in the high Earth atmosphere).    From electromagnetism we know that the magnitude of the Poynting vector is simply $wc$ and the power per unit area $I_0$ is the time-average of the magntitude Poynting. Hence $I_0=\langle w\rangle c$.  We thus have $T=\left(\dfrac{I_0}{4\sigma}\right)^{1/4}=277$ K  which is obviously false as the real value is $5760$ K.  What is wrong with this temperature calculation?


Practical application for linear transformations

Can anyone help me with a practical application of linear transformations? I am very curious about how can be an application in real life that can be solved with a linear transformation.


Why / has a wrong answer but // has a correct answer in python?

Run these two commands in Python:  print(int(822981260158260520/2)) print(int(822981260158260520//2))   The second one prints a correct answer but the first one does not. The difference is as big as 20. How did this happen? Is it a Python bug?


Use Gmail in Google Chrome for mailto links in Windows 8

When I log into Gmail for the first time in Chrome on my Windows 8 computer, Chrome asks if I want to use Gmail for mailto links.  When I click yes, Windows pops up a dialog to "Choose a program to use for mailto links," with the only option being "Look in the Windows Store."  When I go to the "Default Programs" => "Set Associations" window, there is no entry for mailto.  How can I set Gmail as the handler for mailto links in Windows 8?


How to set dtypes when converting a dataframe to a numpy array?

I have a numpy structured array that looks like this:  >>> arr array([(b'00:59:59.785634', 60.87), (b'01:00:00.187634', 60.88),     (b'01:00:00.188634', 60.88), ...,     (b'23:59:58.668559', 60.93), (b'23:59:58.668559', 60.92),     (b'23:59:58.668559', 60.93)],     dtype=[('Date', 'S15'), ('Value', '<f4')])   When I convert it to a pandas dataframe, The values of Value column change their form.  >>> df = pd.DataFrame( arr )                     Date      Value   0       b'00:59:59.785634'  60.869999      1       b'01:00:00.187634'  60.880001     2       b'01:00:00.188634'  60.880001      3       b'01:00:00.189634'  60.860001     4       b'01:00:00.190634'  60.860001    >>> df.Value Name: Value, Length: 176195, dtype: float32       It's still OK, because it prints out the same value as the array.  >>> str( df['Value'][0] ) '60.87'   But a problem occurs when I have done modifying the dataframe and try to convert the dataframe to an array again.  >>> new_arr = df.values array([[b'00:59:59.785634', 60.869998931884766],     [b'01:00:00.187634', 60.880001068115234],     [b'01:00:00.188634', 60.880001068115234],     ...,     [b'23:59:58.668559', 60.93000030517578],     [b'23:59:58.668559', 60.91999816894531],     [b'23:59:58.668559', 60.93000030517578]], dtype=object)  >>> str( new_arr[0][1] ) '60.869998931884766'        # != '60.87'   I think the original dtype(float32) is lost during the last conversion. How can I still get '60.87' even after converting the dataframe to an array with .values attribute?  My question is why it prints out different results('60.87' and '60.869998931884766') and how to keep the type. I think if the values can be the same when converting an array to a dataframe, there should be some ways to preserve the values when converting them the other way around.


EDIT: Given link of another thread suggest that newer kernel do not have this issue but I am using latest kernel i.e. 4.18.5. Hence, this issue is either new or newer kernel have this bug  In my setup, I need to mount least 200 Loop devices. Mounting 200+ loop device is not an issue. But I observed that mounting 200+ devices eats up almost 300+ MB of RAM. All these loop devices are of squashfs type.  Few devices are of size 1MB while few are of 50+MB.  top command also don't show anything about RAM consumption. echo 3 > /proc/sys/vm/drop_caches also doesn't free up memory.  I would like to know that:   Is this normal that mere mounting loop devices eats up memory ? Mounting 200 devices takes up almost 15 Sec. Is there any way to speed up this ? I am using the command:  mount -o loop,nodev Sample.sq    /mnt/loop1


ISVForce vs. Force.com Embedded for Appexchange

I'm having a tough time trying to determine the differences between the  program models for creating an app on the AppExchange.  A couple questions.  1. Are Embedded/OEM the same thing?  On , there's a comparison chart of different OEM versions.  To me, this looks like a comparison of the options listed in the  I posted above.  In constrast,  (which is referenced by other answers on this forum), states in step (3) that the Embedded version is synonymous with OEM.  Does anyone out there have a clarification on the difference?  2. Do Embedded users pay for a Salesforce license + an additional fee?  Based on the answer I , it seems that a customer would have to pay for full-price Salesforce licenses in addition to any extra fees that my company would charge.  Then Salesforce would take a 25% cut of that extra fee.  Am I right?


Flagging upvoted comment is not possible in iOS App

I tried to flag a previously upvoted comment in the iOS App and I couldn't find the option to Flag. I then checked on other comments and on different SE-communities.  Here is what I observed everytime:   As soon as I tap Upvote, the button Flag disappears:  When I tap Undo Upvote, the button appears again:    I was able to flag the comment normally on the website itself, so it must be a bug in the iOS App.Or is this intended behavior? If yes, how do I flag an upvoted comment using the iOS App?


Do eggs really need to be refrigerated? If so, how long can they last without refrigeration? Obviously eggs come out of the chicken at body temperature, so there must be some amount of time they can survive without spoilage.  I once attended a catering school in Hungary, and families there store eggs at room temperature for days with no (apparent) ill-effects, particularly in rural areas. But the idea seems anathema to almost everyone in the US.


Why my program doesn't return the count integer in my public int method?

I am writing a program that generates 10k random integers in the main class and then bubble-sorts it and returns the count of how many times the array was sorted. The problem is that even though I got the method to be public and return the count, it always shows up to means 0 after running it. METHOD   public int bubbleSort(int bub[], int count){     int n = bub.length;     for(int i=0;i<n-1;i++)       for(int j=0;j<n-i-1;j++)         if(bub[j]>bub[j+1]){           int temp = bub[j];           bub[j] = bub[j+1];           bub[j+1] = temp;           count++;         }         return count;   }       void printArray(int bub[]){         int n = bub.length;         for(int i=0;i<n;i++){         System.out.print(bub[i] + " " );         }       } }  MAIN CLASS import java.util.Random; class Main{   public static void main(String args[]){     Random rd = new Random();     Bubble ob = new Bubble();     int count=0;     int[] bub = new int[10000];     for(int i=0;i<bub.length;i++){     bub[i] = rd.nextInt(100);     }     ob.bubbleSort(bub, count);     System.out.println(count);     System.out.println("sorted array");     ob.printArray(bub);    System.out.println("number of times array was sorted " + count);   } }


Why does Denoising take up so much memory?

I tried to render my scene with the new 2.79 Denoiser.  During the Rendering Process everything was fine, my memory peak was about 1000M but as soon as the Denoising started it suddenly shot up to ~2000M and gave me the "Out of memory in CuMemAlloc[...]" error.  Is Denoising usually taking up so much memory and why?


Its been some time since I've turned on my Dell XG-600 lap-top. When I finally turned it on, I discovered that for the life of me I cannot remember the password, let alone the pass phrase, which is a mystery to me.Can anybody be of assistance in helping me resolve this small, but annoying problem?


I'm given a table  Class  |  Probability P         .95 N         .85 P         .78   and so on. I'm asked to construct a ROC. As I understand, a ROC has TP for the Y axis and FP for X, but how can I get the TP/FP for the records in class N? For records in class P, TP is e.g. .95 and FP is .05, right? But what about records in class N? How can I find the TPR and FPR?


Given the integral $\int_{0}^{\infty} \frac{e^{ax}-e^{bx}}{(1+e^{ax})(1+e^{bx})} dx$  How can I evaluate it? Thanks!


Is there an accepted best practice when it comes out to laying out code?

Many languages, such as python, have strict rules as to how best to lay out the code. I have looked around but I can't find anything that details this for Latex. For example when looking at creating lists there are a number of ways it could laid out:  \begin{enumerate}     \item Point one     \begin{enumerate}         \item SubPoint One         \item Subpoint Two     \end{enumerate}     \item Point two     \item Point Three     \item Point four     \item Point five \end{enumerate}   Or  \begin{enumerate}     \item Point one \begin{enumerate}         \item SubPoint One         \item Subpoint Two \end{enumerate}     \item Point two     \item Point Three     \item Point four     \item Point five \end{enumerate}   or   \begin{enumerate}     \item Point one         \begin{enumerate}             \item SubPoint One             \item Subpoint Two         \end{enumerate}     \item Point two     \item Point Three     \item Point four     \item Point five \end{enumerate}   Is there a best practice for how to lay out Latex code or is it up to the individual to decide?


Exporting Processing Modeler as Python script in QGIS 3?

How do I export my model from Processing Modeler as .py so that I can edit its code?  This does not seem as intuitive as in previous QGIS versions.


Flask: Dumping "request.data" in middleware?

I know that at the middleware level the concept of "request" doesn't exist yet because the request object hasn't been initialized.   However, I find it very helpful if I can dump request.data in the middleware layer so I don't have to liter pprint(request.data) all over my application file.   Can someone tell me a way to do this at the middle layer level?


Is there a grammar mistake in "Ball Don't Lie"?

There is a novel titled 'Ball Don't Lie', and a film also based on the novel with the same name (visit: ). Then the sentence becomes more famous in sports world after Rasheed Wallace used it in one of NBA games (watch YouTube video ).  So I'm just curious, isn't there clearly a grammar mistake in this term? Shouldn't it be "Balls Don't Lie", or "Ball Doesn't Lie"?


Is it wrong to fully charge your android phone in general to 100% will it hurt battery life? and is it also to drain your battery to below 20% will it also hurt the battery life?


Jquery function inside dynamically inserted element doesn't work

I have an index which shows a list of orders with a button that calls a function (to simplify i've reduced the function that button calls to just an alert), but also every minute an ajax function executes that searches for new orders and appends them on top, with the exact same code as the ones initially loaded. The button works perfectly in the elements that are loaded initially but doesn't work at all in the elements generated dynamically.  This is the index with one initial order inside, BEFORE newOrders runs for the first time. The button on that order functions properly

Pedido 4126
     <button id="btn4126">Alert</button>

    And this is the index when the function has executed once and appended a new order on top:

Pedido 4255
     <button id="btn4255">Alert</button>

Pedido 4126
     <button id="btn4126">Alert</button>

    As you can see, the button and function are exactly the same, but the one on the new order brought by the ajax call, doesn't work, and the other one still works properly.  EDIT: I have seen the  on event binding to dynamically generated elements, and am in fact already applying what I saw in those answers, by binding the function to the descendants of a a static ancestor:   $("body").on("click","#btn4126",function(){       alert("Pedido 4126");     });


Changing Symbology of Multiple Layers using ArcMap/ArcPy?

Is there a way to change symbology for multiple layers in ArcMap or ArcCatalog. I want to change the symbology of multiple layers at once.


Is it possible to have a point estimate outside of confidence interval? Could anyone give me an example?


The minimum perimeter and maximum height of a triangle under constraints

I'm developing a web application that consists of a calculator triangles. Although I am not a mathematician, with paper, derive and Geogebra I managed to get a lot of formulas to calculate a triangle with the minimum number of data possible. Maybe some is unpublished, and limits to be introduced only correct data.  I do not get the following formulas :   The minimum perimeter of any triangle (abc) once known the heights corresponding to the $a$ and $b$-sides. The maximum height corresponding to the side $b$ of any triangle (abc) once known the value of its perimeter and height corresponding to the $a$-side.   I am looking for an answer in a way that could be implemented in php (programming language).


How exactly does The Doctor's aging work? It appears to be all over the place. From revived Doctor Who alone:   In The Sound of Drums, The Doctor is aged 100 years and becomes an old man. In The Last of The Time Lords, The Doctor is aged a further 900 years and becomes a tiny Dobby-like creature. In The Impossible Astronaut, Amy and Rory see a 200 years older Doctor than the one they last saw and he looks exactly the same as the one they saw earlier who was 200 years younger. In The Time of the Doctor, The Doctor ages for 900 years and looks like a normal, older human.*   And this isn't even counting all the Classic DW aging shenanigans, so what's up?  *I know that was asked  but none of the answers really worked for me.


$M_{a} = \lbrace f \in R : f(a) = 0 \rbrace$ is a maximal ideal for the ring of every continuos functions $f : [0,1] \to \mathbb{R}$

If $R$ is the ring of every continuos functions $f : [0,1] \to \mathbb{R}$  For every $a\in [0,1]$, how I can proof that, the set   $M_{a} = \lbrace f \in R : f(a) = 0 \rbrace$ is a maximal ideal for R?


Decode a few times escaped XML characters in C#

I have an input string with a few times escaped XML inner text. E.g.:  <anode>some &amp;quot;inner&amp;quot; text</anode>   I'd like to have (in a variable) value:  some "inner" text   How can I do it in C#?  I want the solution to handle triple-encoded cases (and N-encoded cases). I.e. &amp;amp;quot; Not only &quot is interesting me, but any other encoded symbol (e.g. lt, gt etc).


so I recently had some lessons in induction and I feel pretty comfortable with it, but there is just this one exercise that I for some reason can't figure out.  I got this so far:  $1^3 + 2^3 + 3^3 + .... + n^3 = \frac{n^4}{4} + \frac{n^3}{2} + \frac{n^2}{4}$ is what I need to proof, I already did the $n = 1$ and the induction hypothesis step but after that I'm stuck. I got the point where I used induction to replace the $n^3$ for the $\frac{n^4}{4} + \frac{n^3}{2} + \frac{n^2}{4}$ and made it all one big $\frac{p}{4}$ but I just can't get it to work.  If someone could help me out that would be great!


I want to publish my app as free app on Salesforce AppExchange. I have already joined ISV partner portal through  and selected "AppExchange Partner Program". And I have read in salesforce packaging guide that for releasing the app I only need to register on partner portal which I had already done.   I also created a case through it but I got replied "Have you looked at our partnerships yet? You need to sign up for one in order to list on the AppExchange." and they provided  link.  Now do I have to register for AppExchange Partner Program Model separately, if yes then please guide me where can I do so because I didn't find any register link on there AppExchange Partner Program Models page.  Thanks in advance.


What Star Wars canon works relate to the time period between Return of the Jedi and The Force Awakens?

Back in the pre-Disney days, there was a wealth of canon works of various stripes that dealt with the Star Wars galaxy after the events of Return of the Jedi. From the Dark Forces / Jedi Knight / Jedi Academy games to the books (I had a personal preference for the X-Wing series).  Since the relegation of all of this to Legends status, what works remain in canon to cover the time period between Return of the Jedi and The Force Awakens?  I am aware of  (which is somewhere on my future reading list). I'd be specifically interested in any that deal with the development of the New Republic.


database management system vs database vs tables vs file

I have been trying to understand the way a database system works. Digging through the internet, I have come to following picture.  Database system is required because we need a way to store data, mainly on large scale, so that we can update it, query it, delete it, manipulate it plus perform other operations easily. The traditional file system is not designed for this and fails to serve the purpose. We can implement the above database system in different ways, which leads to different data models, RDBMS being the most dominant one. There is a database management system, which is a software and is in a way like file management system, and it manages the requests of creation, deletion, insertion of data etc. Eg. SQLite. We interact with database using an interface, which is provided by database management system, and a language which is compatible with the database management system. Eg. SQL.  I hope my understanding till now is correct. Now, the database management system interacts with database and I am not able to understand what database is exactly. I used to think the collection of all the tables is termed a database and is just a name. But then I found out there are several databases possible and a database can be created using DBMS just like files. Further research indicated me that database is a file. My doubts are following:  If database is a file, how does it differ from ordinary files (in terms of implementation)? I believe that tables are also files. But tables are stored in a database. How can a file be inside a file and both can be considered separate. The implementation of different data models, like relations to store data in rdbms, objects to store data in OOP based database systems, are they implemented in database management system or database?  And if database is not a file what is it exactly and how tables, database and database management system are related in terms of implementation? I have tried to find answers to these but it seems like the content on these are not much and I have had no luck. Also, please explain it avoiding very involved code snippets, as I am an analys


Could someone give me a suggestion to solve this problem?  Let $\frak{g}$ a nilpotent Lie álgebra. Prove that there is an ideal  $\frak{h}\subseteq\frak{g}$ such that $\dim(\frak{g}) = \dim(\frak{h}) + 1$


How to know whether a Gibbs sampler is irreducible?  I know that the Gibbs sampler in e.g. two variable case constructs a sequence of r.v.s $(X_1^{(i)}, X_2^{(i)})$ by sampling from the related conditional distributions, rather than the joint distribution of these r.v.s  However, how would I infer, whether the Markov chain in this is irreducible or not? I've only seen examples reading that from the transition matrix, but I don't know how to even construct such matrix in this case.


I've been looking for over 10 minutes and I can't find where to do this. Where can I change my password?


I would like to somehow use LaTeX to automatically number constants.   Some background  As a mathematician, in my daily work there are a lot of throw-away constants which are not extremely important in the discourse. So I will sometimes write inequalities like  \[ f(x) \leq c_1 g(x) \leq c_2 (g'(x) + h(x)^2 -3) \leq c_3 \int h(x)^2 \]   Since the constants themselves tend not to be important, to conserve alphabets, I call them all 'c' with a subscript. Now, it is a bit of a hassle to   keep track manually which numbers I've used up to a given point in the paper, especially if I am working on a large document renumber the constants if I modified an argument. Say if I remove the middle inequality from the example above, for aesthetic purposes it'd much better to have \[ f(x) \leq c_1 g(x) \leq c_2 \int h(x)^2 \] instead of c_3 in the last term. But then I'd have to go back through the document to renumber all the constants.    Now sometimes I can solve the problem using the convention that 'c' with no subscripts stands for a constant that can change from line to line. But often that is not feasible (suppose I do need to refer to individual of those constants and verify that they are indeed 'constant' enough for my purpose).   What I'd like  Now I am aware of the newcounter command to define a new counter. I even know how to use it to automatically increment the counter. So I can define a command that prints c_\thecounter and increments the counter so I get a running list of constants. So that solves half the problem.   The other half of the problem that I don't know how to deal with is how to refer to a constant defined previously. Naively using label and ref, of course, doesn't work. (I actually don't quite understand the inner workings of those two commands; so an explanation of why they don't work will also be helpful.)  As an illustration of what I'd like, it'd be great to have a pair of commands \newconstant and \oldconstant which can be used like this  % Create some new constants \[ f(x) \leq \newconstant g(X) \leq \newconstant h(x) \] % Create a new constant with a label \[ m \geq \newconstant[cnst:m] m' \] % Refer to an already defined constant The constant $\oldconstant{cnst:m}$ defined above is actually 1.    Which will display something like  f(x) <= c_1 g(x) <= c_2 h(x) m >= c_3 m' The constant c_3 defined above is actually 1   What I know how to do is to define, say  \newcounter{cnstcnt} \newcommand{\newconstant}{\ensuremath{c_\thecnstcnt}\addtocounter{cnstcnt}{1}}   and this will print the running list.      Is there already a package that does this? If not is there a way to get the behaviour I described? (Especially the ability to refer back to a previous constant.)


' showing up as ? on Wordpress site live server only

I have a wordpress site which I have set up on my localhost. I've just uploaded it to my hosting and imported the database but all the ' are displaying as � . I thought it might just be my posts as you can see from this example .  However if you look at the below image you can see that its even happening in the wordpress admin panel.    I thought it might be related to the way the database is set up but I have checked and they have all the exact same settings. I tried setting up a new database and importing the data to that and it didnt help.   Does anyone have any ideas would could be causing this as its the exact same as the localhost server? They both have utf8mb4_unicode_ci set up on all tables.  SOLUTION:  Cannot post this as an answer since this question was closed as a duplicate.  However, for anyone else who has this problem the below fixed it for me. It wasn't related to the database. The wp-config.php needed updating. I changed define('DB_CHARSET', 'utf8mb4'); to define('DB_CHARSET', 'utf8');


Is there an intuitive reason that explains Fermat's Last Theorem?

In number theory, Fermat's Last Theorem (or Fermat's conjecture) states that no three positive integers a, b, and c satisfy the equation $a^n + b^n = c^n$ for any integer value of $n$ greater than 2.   I know that there are math intensive proofs for this. But is there a more holistic reasoning as to why this isn't possible?


Getting "Exception in thread "main" java.lang.StackOverflowError" and a lot of errors

I'm really new to programming, and I'm working on a java assignment for school and I know That i got most of the code I've written wrong, but it's the first time I've really attempted anything like this.  I'm trying to trouble shoot, but i get the error      Exception in thread "main" java.lang.StackOverflowError      at a07.Time.(Time.java:27)      at a07.Time.(Time.java:27)      at a07.Time.(Time.java:27)   This continues for quite some time.  I was hoping someone could tell me the cause of the problem so i could start fixing.      Public class Time {          private int hour;         private int minute;         public static final int MIN_HOUR = 0;         public static final int MIN_MINS = 0;          public Time(int hours, int mins) {             minute = mins;             hour = hours;             Time t = new Time(hour, minute);             t.fixME();         }          private void fixME() {             int minEx = minute / 60;             int minLeft = minute % 60;             int newHour = hour + minEx;              minute = minLeft;             hour = newHour;          if (minute < MIN_MINS) {             int subHour = hour - 1;             int minNew = minute + 60;             hour = subHour % 24;             minute = minNew;              if (hour < MIN_HOUR) {                 int hourUp = hour + 24;                 hour = hourUp;             }         }     }      public int getHour() {         return hour;     }      public int getMinute() {         return minute;     }      public Time addMinutes(int mins) {         int newMinute = minute + mins;         minute = newMinute;         Time g = new Time(hour, mins);         return g;      }      public void print() {         if (hour == 0) {             System.out.printf("12:" + "%02f", minute + " AM");         }         if (hour != 0 && hour < 10) {             System.out.printf("0" + hour + ":" + "%02f", minute + " AM");         }         if (hour >= 10 && hour < 12) {             System.out.printf(hour + ":" + "%02f", minute + " AM");         }         if (hour >= 12) {             int pmHour = hour - 12;             if (pmHour == 0) {                 System.out.printf("12:" + "%02f", minute + " PM");             } else if (pmHour < 12) {                 System.out.printf(pmHour + ":" + "%02f", minute + " PM");             }          }      } }   Sorry it's not formatted very well. Any ideas? Thanks.


What happens if I pocket my last c/m along with striker? Opponent's n C/m are still on board.   Will I win with minimum n points? Will it be a double-due? Will I lose the game?


Is there any command that mimics the double tab list in bash?

I would like to get the same possible autocomplete list as hitting [Tab][Tab] in bash but with a command. Is there anyway to do that?


PNP high-side transistor switching with microcontroller

Up to this date I was working with NPN transistor  with micro controller and it was working fine. But here I need a PNP transistor.     Does any one can tell me is that the above configuration is correct and that the circuit can be used safely ?


Is it possible to import VLC Codex used in LinuxMint 17.3 Cinnamon to Ubuntu 14.04.1 ?  I tried to play my new DVD from Billy Blanks ( Taebo Boot Camp ) in VLC -  it wouldn't play.  Then I tried it again on a different System running with LinuxMint ( Rosa )17.3 Cinnamon.  The DVD played perfectly !!!  Can anyone tell me if I can import a Codex,  or should I rather install Cinnamon ?


Flagging a question if I don't have high enough reputation

I am currently getting "Sorry, we are no longer accepting questions from this account.” when I try to ask a question and have tried my best to edit my questions and have gotten rid of the the poor ones. I have recently tried fixing , and have made a case as to why it is not a duplicate, but since I do not have a high enough reputation, I cannot flag it for a moderator to reevaluate it.  I am trying to lift the ban on my account and it seems editing my questions is not enough as noted from  in the Help Center. Because I am very new to this site, I wasn't aware of many of the full particulars and conventions of the Stack Exchange sites. I am making an earnest effort to lift the ban on my account and do not have the clout to flag a question because my reputation is not high enough. What can I do to solve this issue?


Proof that if $z = 1$, then $|z-w| = |1- \overline{w}z|$, $\forall w \in$ $\mathbb{C}$  My attempt below:  $(z-w)\overline{(z-w)} = |z-w|^2$ $(z-w)\overline{(z-w)} = (z-w)(\overline{z}-\overline{w}) = |z|^2 -z\overline{w} -\overline{z\overline{w}} +|w|^2 = |z|^2 - 2Re(z\overline{w}) + |\overline{w}|^2*1 = 1 - 2Re(z\overline{w}) + |\overline{w}|^2*|z|^2 = 1 - 2Re(z\overline{w}) + |\overline{w}z|^2 = 1 - 2Re(\overline{w}z) + |\overline{w}z|^2$  $|z-w|^2 = 1 - 2Re(\overline{w}z) + |\overline{w}z|^2$  I was trying identfiy a remarkable product, but I didn't have success. Someone can help me with this question?


Considering the following code :  #include <vector> #include <iostream> #include <array>  using namespace std; int main(){  int* ptr; ptr = new int(3);  int* stock = *&*&ptr;   ptr = nullptr; cout << *stock<< endl;  cout << *ptr << endl;   }   that declares a pointer that allocates dynamic memory. when another var stocks the adress of the memory. Then, the pointer is deleted but the memory is not erased.  You can still access the memory using the copy of the pointer. If you then try to access the memory using the pointer, the programs crashes. I would like to know, if it is possible, knowing that the program will crash, to make a function that : in case of crash, stop the program from closing, and just cout << "some message".   thank you   ps: i know that crash means "unrecoverable error", so my question is more a creative nature.


Is it possible to create bootable linux on USB drive using windows command line?

we can create bootable windows 7 on usb drive using windows command line, is it possible to create bootable linux using windows command line? ( i.e. not using any software)  I've entered the following commands in diskpart and copied the linuxmint files in usb falsh drive , but cannot boot from it.


Ubuntu 16.04 LTS "suspend error at second"

please help me, i have problem with the suspend. what ever i do to suspend via close lid or klik suspend button it running well at first. but the second suspend my laptop can't suspend properly, it just turn the lid black but my laptop isn't turn to suspend. please help me.


Remove "www" and redirect to "https" with nginx

I want to create a rule in nginx that does two things:   Removes the "www." from the request URI Redirects to "https" if the request URI is "http"   There are plenty of examples of how to do each of those things individually, but I can't figure out a solution that does both correctly (i.e. doesn't create a redirect loop and handles all cases properly).  It needs to handle all of these cases:  1. http://www.example.com/path 2. https://www.example.com/path 3. http://example.com/path 4. https://example.com/path   These should all end up at  (#4) without looping. Any ideas?


is $\sqrt{n!}\notin\mathbb{Z}$ for $n>1$ true?

Is it true that $\sqrt{n!}\notin\mathbb{Z}$ for $n>1$? This is what I did: By induction: for $n=2$ its trivial ($\sqrt{2}$ is irrational). Suppose its true for some $n\in\mathbb{N}$, then the primefactorization has to be $n=p_1^{a_1}\cdots p_m^{a_m}$ for some $m\in \mathbb{N}$ where there has to be a $a_i$ such that $2\nmid a_i $ and $1\leq i\leq m$. If $n+1$ is prime, then we are done. suppose its not prime, then $n+1=q_1^{b_1}\cdots q_l^{b_l}$ for some $l\in \mathbb{N}$. From here on I got stuck. First: is the statement actually true (give counterexample)? If its true, can you give me hints? Thanks.


How does removing +1/+1 counters during combat affect abilities granted from having that counter?

If I block a flyer with a non-flying non-reach card granted reach by having a +1/+1 counter and the card longshot squad on battlefield and then remove the counter with retribution of the ancients before damage is dealt, is that card no longer able to block?  Or if the same creature attacks with abzan falconer and then has the counter removed after blockers are declared?  Would they be able to redeclare a blocker?


Is 'Seldom I am wrong' correct or wrong?

Please advise if 'Seldom I am wrong' correct or wrong?


Does equality of characteristic polynomials guarantee equivalence of matrices?

I have a qualifying exam coming up in a couple days and I am just trying to understand some pathological examples I have in my notes. I will list a similar problem which I know the solution to and then the question.  True or False:   let $A,B \in \mathbb{Q}^{n \times n }$  Suppose $xI-A$ and $xI-B$ are equivalent then $\det(xI-A) = \det(xI-B)$.     I wrote in my notes this is true because any two matrices are equivalent in $\mathbb{Q[x]}^{n \times n}$ if and only if they have the same invariant factors.  Since the characteristic polynomial is a product of the invariant factors it follows that $\det(xI-A) = \det(xI-B)$.        True or False:   let $A,B \in \mathbb{Q}^{n \times n }$. If $\det(xI-A) = \det(xI-B)$ (in $\mathbb{Q}[x]$) then $xI-A$ and $xI-B$ are equivalent  in $\mathbb{Q}[x]^{n \times n}$   I think this is false because of the fact that equality of determinants is not strong enough to guarantee all invariant factors are equal but I do not have an example.


How to show a binomial random variable dominates another binomial random variable with a smaller success value?

Let $X\sim B(n,p_h)$ and $Y\sim B(n,p_\ell)$ be two random variables following a respective binomial distribution, where $p_h>p_\ell$. I want to show that  $$P(X\ge\alpha)\ge P(Y\ge\alpha),$$ for any $\alpha\in\{0,1,\dots,n\}$. In other words, I want to show  $$P(X\ge\alpha)=\sum_{i=\alpha}^{n}\binom{n}{i}p_h^i(1-p_h)^{n-i}\ge P(Y\ge\alpha)=\sum_{i=\alpha}^{n}\binom{n}{i}p_\ell^i(1-p_\ell)^{n-i}.$$  The statement to be proven is obviously true, but proving it is extremely difficult (at least for me). Can anyone give me some guidance on proving it?  It would be nice if someone can give an algebraic proof too, that is, show that  $$\sum_{i=\alpha}^{n}\binom{n}{i}p_h^i(1-p_h)^{n-i}\ge \sum_{i=\alpha}^{n}\binom{n}{i}p_\ell^i(1-p_\ell)^{n-i}.$$  Thank you very much!


How to map foreign key entity field value to tableview in javafx it gives me null error

kindly let me know what is wrong with my methods & how to get this done correct.  i have tried to load product details to the table view once the method invoke.  private void initColumn() {     colPluCode.setCellValueFactory(new PropertyValueFactory<>("prd_id"));     colPrdDesc.setCellValueFactory(new PropertyValueFactory<>("p_desc"));     colPrdName.setCellValueFactory(new PropertyValueFactory<>("p_name"));     colCategory.setCellValueFactory(             (TableColumn.CellDataFeatures<Products, String> catData) -> new SimpleStringProperty(                     catData.getValue().getCategory().getCategoryName()));     colSuppler.setCellValueFactory(             (TableColumn.CellDataFeatures<Products, String> supData) -> new SimpleStringProperty(                     supData.getValue().getSupplier().getComName()));     colPackSize.setCellValueFactory(new PropertyValueFactory<>("pack_size"));     colPackPrice.setCellValueFactory(new PropertyValueFactory<>("pack_price"));     colUnitPrice.setCellValueFactory(new PropertyValueFactory<>("unit_price"));     colUnitCost.setCellValueFactory(new PropertyValueFactory<>("unit_cost_price"));     colDiscount.setCellValueFactory(new PropertyValueFactory<>("discount"));     colReorderLevel.setCellValueFactory(new PropertyValueFactory<>("reOrderLevel"));     colVat.setCellValueFactory(new PropertyValueFactory<>("vat"));     colOhQty.setCellValueFactory(new PropertyValueFactory<>("onHandQty")); }  void loadItems() {     if (productList.isEmpty()) {         productList.addAll(productModel.getProductList());     }     itemTableView.setItems(productList); }   its gives me following error  Exception in thread "JavaFX Application Thread" java.lang.NullPointerException at pharmacySystem.productController.ProductController.lambda$0(ProductController.java:179) at com.sun.glass.ui.InvokeLaterDispatcher$Future.run(InvokeLaterDispatcher.java:95) at com.sun.glass.ui.win.WinApplication._runLoop(Native Method) at com.sun.glass.ui.win.WinApplication.lambda$null$148(WinApplication.java:191) at java.lang.Thread.run(Thread.java:748)


I have a schengen visa can I enter to london

I have a schengen short stay  visa can I enter to london I have examine pte acedemic test  in london


I have some trouble understanding the concept of a covariance matrix. For instance, I'm going over this question that says: assume that we have U1, U2 and U3 as independent zero-mean, unit-variance Gaussian random variables. Furthermore, we have X = U1, Y = U1 + U2, and Z = U1 + U2 + U3. We're asked to find the covariance matrix for (X,Y,Z).  I just require some guidance/hints on how to solve this sort of a problem. And I'd really appreciate any help on this matter.


Blender 2.8 resize single edge where rest follow proportionally

I'm trying to resize a rectangular cubiod, currently 5 meters on it's longest sides and 2 meters on it's shortest sides (as shown in the diagram) I'd like a method that allows me to just set a new length of one edge that proportionally sets the length of the rest of the edges in the cuboid.    So for example: I'd like to be able to type in a new length for one of it's 5 meter edges and make it 2.5 meters. After I do so I need the rest of the edges all to shrink by a half.  The result of this example will make the 4 of the edges 2.5 meters long and the remaining 8 edges 1 meter long.


I have Tamron 90mm f/2.8 Macro Lens on my Nikon D5500. I’m trying to get my aperture to go to its lowest which is 2.8, however, I can’t get it to go lower than 3.0 or 3.5 (its lowest changes often and I’m not sure why). I’ve tried it both Aperture priority mode and Manual.  Any advice would be greatly appreciated.


In an nginx configuration file, you might configure a list of SSL ciphers like this  ssl_ciphers                HIGH:!aNULL:!eNULL:!LOW:!ADH:!RC4:!3DES:!MD5:!EXP:!PSK:!SRP:!DSS;   What's the syntax of this cipher string?  That is, I know (or think I know, correct me if I'm wrong) that this string is meant to provide a list of possible SSL ciphers, as well as provide a priority for them.  What  is less great at is explaining the format of this string.   Specific questions   Is the ! a negation?  That is, does !DSS means don't use DSS?  Or is !DSS the same of a cipher? Are the : characters separators? That is is teh above a list of ciphers "HIGH, !aNULL, !eNULL, etc...", or does the : mean something else Are HIGH and LOW the same of ciphers, or are they special meta-directives of some kind Not pictured above, but  strings like this AES256-GCM-SHA384:ECDHE-RSA-RC4-SHA:. Are the - characters part of the cipher name, or do they have a special meaning?   Is there a resource that explains how this string works, or is this a case where the people expected to work with the string are also expected to read the nginx source to figure out how it works?


Almost all of our websites within our server is redirecting to a porno scammy sites

We are having a problem within our server. After transferring the files to a new dedicated server, within only one or two weeks almost every website under our server is redirecting to a porno scammy sites (to be blunt to adultfinder website). Once you enter the url it will redirect to it and once you enter it once again you are now in the original website.


Prove that $p^j q^i$ cannot be a perfect number for $p, q$ odd, distinct primes.

Define $\sigma(m) = \sum$ d : d|n.  Prove that $p^j$$q^i$ cannot be a perfect number for $p, q$ odd, distinct primes.  Attempt at Solution: I have shown that $p^k$ can never be a perfect number, and im trying to use the multiplicative property of $\sigma$ to generalize to $p^j$$q^i$


Is it known what the necessary and sufficient conditions are for the existence of a "3+1 split" (by means of a foliation) of a (Lorentzian) manifold?

When trying to do physics on a more general pseudo-Riemannian manifold we want to require that there is a foliation of this manifold into three-dimensional subspaces. By this I mean we would like to have a way of splitting our spacetime $M$ into a part that we call space and one we call time. This is necessary, for example, in order to write the two-form $F$ that represents the electromagnetic field as $F = E \wedge dt + B$. I know that this is possible if we assume $M$ to be compact, but this implies that there are closed time-like geodesics (I have been told I would not know a proof). What are the necessary and sufficient conditions for such a foliation to exist? I would also appreciate it if you could inform me about books/resources that go into these sorts of questions. I have looked into books about GR, but they don't seem to talk about these sorts of things.


What happens if I use Dispel Magic on a magic item?

I saw  question recently and I was wondering if a magic item, such as a , could be dispelled with dispel magic such that it would it lose the +1?  A common item would require a formula, 100 gp in components, and a minimum of a 3rd level spell caster with a similar spell to be made so it could be treated as a lvl 3 spell.    The  spell description states:     Choose one creature, object, or magical effect within range. Any spell of 3rd level or lower on the target ends. For each spell of 4th level or higher on the target, make an ability check using your spellcasting ability. The DC equals 10 + the spell's level. On a successful check, the spell ends.     So if somebody cast dispel magic on that Longsword +1 would its effects be negated, or would the caster lose a spell slot?


Integral of Schwartz function over probability measure

Let $X$ be a set, $\mathcal F$ a $\sigma$-field of subsets of $X$, and $\mu$ a probability measure on $X$. Given random variables $f,g\colon X\rightarrow\mathbb{R}$ such that $$\int_\mathbb{R}hd{\mu_f}=\int_{\mathbb{R}}hd\mu_g$$ for any Schwartz function $h$. Is it necessarily true that $\mu_f=\mu_g$?


Rejection of text containing SQL statements

OK, I've been having weird problems for the last 1/2 hour trying to  on StackOverflow, and I keep getting this result (on Firefox 3.6)     The connection was reset      The connection to the server was reset while the page was loading.         The site could be temporarily unavailable or too busy. Try again in a few        moments.   If you are unable to load any pages, check your computer's network        connection.   If your computer or network is protected by a firewall or proxy, make sure        that Firefox is permitted to access the Web.      The problem seems to occur when I try to post some code with 'd--- table' in it, where 'd---' is replaced by the word drop.  I cannot post the following 3 lines, in either SO or this site, if they include the well-known SQL statements DROP.  stat.executeUpdate('d--- table if exists people;'); stat.executeUpdate('create table people (name, occupation);'); prep = conn.prepareStatement(...     'insert into people values (?, ?);');   test again:  'dro* table' 'drop ball' drop the table drop fable drop    t*ble droptable   drop a table  The evil words for me are "drop" and "table"... how come you guys can post? :(  edit: Could someone please suggest another online site that is not stackoverflow that is a quick way to try out a POST request of a text field?  UPDATE: Never mind. I don't know what the answer is, but the same problem occurs on Google's website. So it's not stackoverflow. Now to go to my IT Dept...


1) A group of boys is playing football.   or     2) A group of boys are playing football.   My teacher told me the first sentence is correct since of boys can be ignored to make:      A group is playing football.   It feels very awkward in my mouth to say boys is.


PHP Memory Error error? Installing Flarum

I am getting the following error when I run setup for Flarum  Fatal error: Allowed memory size of 33554432 bytes exhausted (tried to allocate 64 bytes) in **[redacted]/flarum/vendor/oyejorge/less.php/lib/Less/Tree/Ruleset.php** on line 497   This is not making any sense to me... its been a long time sense I used php but this makes no sense doesn't that mean that php has 33554432 bytes available and it tried to use 64 bytes and couldn't...


Why is frequency used in the formula of energy that was invented by Planck?

If we observe the formula $E=hf$ which solved the ultraviolet catastrophe. We know that before Planck proposed the solution to the ultraviolet catastrophe, light was considered as continuous stream of energy.   But Planck discovered that light is made of individual packets of energy, at the rate of $hf$, which can only be absorbed, or emitted, in quite discrete amounts.  But my question is that if light is made up of quanta, one quantum of electromagnetic energy is called a photon. Then how can photons have a frequency since photon is a particle. So how can the formula $E=hf$ be used?


Where does "on X's dime" originate from?

Phrases like "on the company's dime" or "on your parent's dime" are used to indicate a form of payment responsibility on the party in question.  My question is where does "on X's dime" originate from?  Why was the word "dime" specifically used as opposed to say "on the company's quarter/nickel/penny"?


The following is an real analysis qualifying exam problem that I cannot solve:  Suppose $X$ is a Banach space and that $(x_n)$ converges weakly to $x$. Show that $\liminf ||x_n|| \geq ||x||$.  Using the Uniform Boundedness Principle I can show that $\sup_{n \in \mathbb{N}} ||x_n -x||$ is finite. Using Alaoglu's Theorem I can show that some subset of $(x_n)$ converges in norm to $x$. I feel like I am close with this but cannot seem to finish the problem.


How does Python assign and retrieve a DLL's global variable?

DLL written in C  extern int32_T myinput; extern int32_T myoutput;  extern void initialize(void); extern void run(void); extern void terminate(void);  void run(void) {     myoutput = myinput * 2; }   Python script  from ctypes import* mydll = cdll.LoadLibrary("C:\\myDLL.dll") mydll.myinput = 10    # Question1 mydll.initialize() mydll.run() print(mydll.myoutput) # Question2 mydll.terminate()   My expectation  20   The actual output  <_FuncPtr object at 0x00000000023646C8>   My Question   How to assign global variable in the DLL? How to retrieve global variable in the DLL?   In short, could you modify my script to make the output be 20?


Connect A 3 way swotch to an existing three way switch

I have a 3 way switch (switch A) that controls a device. I have another three way switch (switch B) that is not connected to anything. I would like to connect switch B to switch A so that it can be part of the same circuit, and control the same device. Is this possible?


Please take a look at the sleeve notes of the revolving paint dreams lp "off to heaven"creation lp a great record by the way.     The last story I heard that Alan Mc Gee (boss label) had tried to organise a come back concert. After hearing about the plans, however, the band had gone to the studio and burned all the tapes they had ever recorded, then demolished everything in the studio. By the time Mc Gee got there, the studio was a smouldering ruin. After that .....silence      Silence, that is until late last year.   Are "burned" and "demolished" past perfect or are they past simple? Note "had" is not written, but I think it might be left out to avoid repetition.   So if they are past perfect: is it because the destruction happened before McGee arrived (the time reference)?   And if they are not past perfect but past simple, I dont see the necessity of the first past perfect "had gone over."   Is it be possible to write       the band went to the studio, burned all the tapes they had ever recorded and then demolished everything in the studio.    So, again, if it is past perfect to emphasize their intention to destroy what they did. Or maybe is it because the time reference is "burned." As the arrival in the studio was before the destruction I would understand the use of past perfect "had gone over."


How to mark the matches separately as expected?

I know what is happening, but I do not know how to solve it because I am a novice in regular expressions.  The regular expression, takes all the expression, because it takes the initial brackets of {{username and the end of day}}, then it wraps all the code between them.  How should the regular expression be?    var str = "Welcome back {{username}}, how are you ? today is {{day}}",     regex = /{{.+}}/g,     matches = str.match(regex);       console.log(matches); // I was waiting for : [{{username}}, {{day}}]


Can we preserve the search textbox's value while moving between tabs?

When we visit this page user's page  , If you write any user's name and then move another tag suppose from reputation to new user then it is clearing the textbox's previous value.         Abra ka dabra Search Textbox is blank when you switch the tab.        If I want to search then again I need to write down user's name . Can we change this to preserve the search textbox's value while moving between tabs of reputation,new users,votes,editors,moderatos ?


Do I need a passport to return from Canada?

If I am a US citizen, do I need a passport to go visit Canada at Niagara Falls for 3 days and then reenter the USA?


Animated series from 80s or 90s involving Space ships and an orange tree farm in a canyon

I am looking for the name of a sci-fi cartoon. Key plot points  There were Space ships flown by some American voiced crew. They were some kind of rescue squad or maybe space police. In one episode they went to an orange tree farm in a canyon which used mirrors on the canyon walls to direct sunlight to the oranges. They had a force field that protected the canyon but some bad guys came and shot the mirrors. The heroes came back and saved the day. Another episode was set in an underground ancient tomb of some kind that was covered by a sandstorm once they escaped.  Chronology and other relevant information It had kind of 80s or 90s animation. I don't think I ever saw it on TV. I only ever watched the same 3 episodes on VHS.


prove that $[5, 7, 11, 13, 17, 19, 23]$ are the only possible variants of the remainders (read context) when dividing the prime number $p$ by 24

The problem is following:     Given that $p$ is a prime number, $p > 3$. Prove that $(p^2 - 1)$  is divisible by $24$.   I started writing down the possible remainders of dividing $p$ by $24$ and got the following row:  ${5; 7; 11; 13; 17; 19; 23}$  But am i even right at this point? If i am how do i prove that these are the only possible remainders?


Why closed in the definition of a symplectic structure?

Why do we want the 2-form $\omega $ to be closed? What if it is not?


@future method: Unsupported parameter type

I am trying to copy records from one org to other via web services. I am calling a class which has logic written into a trigger. But @ future method is not taking sObject  list as a parameter. Can someone suggest me an alternative?  The Code:  public class webServicesTriggerClass   {     @future public static void webServicesMethod(list<MyFriend__c> mfList)     {         partnerSoapSforceCom.Soap sp = new partnerSoapSforceCom.Soap();       partnerSoapSforceCom.LoginResult lr = sp.login('hitesh.kumar.singh@accenture.com.varun','4Rajyavardhan');      soapSforceComSchemasClassNiralaapp.SessionHeader_element ses = new soapSforceComSchemasClassNiralaapp.SessionHeader_element();      ses.sessionId = lr.sessionId;       soapSforceComSchemasClassNiralaapp.MyFriendsDetailSoapApi vNapp=new soapSforceComSchemasClassNiralaapp.MyFriendsDetailSoapApi();      for(MyFriend__c mf:mfList)       {        string  s1= mf.myEmail__c;        string  s2=mf.friendName__c;         string  s3=mf.friendEmail__c;        string  s4=mf.aboutFriend__c;        integer i1=Integer.ValueOf(mf.age__c);        boolean result=vNapp.addFriendDetails(s1,s2,s3,s4,i1);        system.debug('################' +result);           }     }    }     Trigger-->  trigger webServicesTrigger on MyFriend__c (after insert)     {      webServicesTriggerClass.webServicesMethod(trigger.new);    }     Error--    Error: Compile Error: Unsupported parameter type LIST at line 3 column 30


Function of a Function Differential Equation

Is there any function, $f(x)\neq x$, for which $f(f'(x))=f'(f(x))$?


command line: start program by alacarte as sudo in folder/tree

i have installed a program via github in: /home/user/folder/program.    to get this to run via the terminal i use the following commands. cd folder sudo ./program    but i would like to have a short cut and tried to make one via alacarte. filled in the following data:   name: programname (is not the same as the actual name of the program in the folder) command: /home/user/folder/program. icon: changed the icon into a local file. icon.ico clicked the: launch in terminal?   i now find the "programname" with the correct icon but when i try to run it a icon appears in the nautilus taskbar that starts to blink for a while and then disappears. Also no terminal is opened.   i assume this has to do with an error in the command line: just don't know how to correct it.   hope someone is willing to enlighten me on my error.    Kind regards   Matthieu


Wait for document.querySelector('div#test').innerHTML to fill in the html befor doing something else

I have the following javascript/jquery function that on click of a button it fills the div with id=test with an image. document.querySelector('div#test').innerHTML = "

";  Right after in the same function I have the following code that reads the hight of the img element in the divs and passes it to the position-relativ div. $(".slotpar").height($(".slotimg").height());  The function is not working properly though and I believe that the problem is that this code that passes the hight to the relative div does not wait for the document.querySelector('div#test').innerHTML to properly load the html and the images. I have tried using a timeout of 1 second and it works so I am prety sure the the problem is the one I mentioned. Is there a way to wait for the html and the image to be completly loaded on click and then take pass the hight of the image to the relative div? Please help me


I am reading over this code and the article on  about closures:  function outer() {      var reference = 0;      return function() {         reference += 1;         return reference;     } }  var x = outer(); x(); x() x() console.dir( x() );   Yet, I am baffled at how this code remembers state. For some reason the author of the code decided to name a variable reference. Only thing that comes to mind is the, "physical address" meaning in this context.  When I see the lines of code from var x = ... I am thinking the following:   assign the anonymous function to the variable x. At this time of execution the reference variable of the outer function is 0 and so is it in the inner function execute the inner function adding the variable reference to 1 then I loose track   From running the code all I can see is that the inner function creates some type of reference/pointer ,if you will, to the outer functions reference variable which is updated each time the closure is executed. For some reason the reference variable's value persists upon further execution almost like a static variable in php. Is this why MDN says that a closure "remembers" its environment?  Any step by step explanation would help.


Answer deleted because it came from MSDN?

On Stack Overflow, I'm a pretty frequent contributor with over 3K in reputation. Almost all of which earned by answering real user questions about Windows programming and other topics.  Last night, somone posted a .  I knew the easiest thing to do would be to direct him to an appropriate documentation page on MSDN that I thought would help. And I literally did this:   Copied the URL directly into the post. Below the URL, copied two lines of content from that page that was relevant. Small code snippit below that.   Literally, this is what the answer looked like:           This warning is automatically promoted to an error. If you wish to   modify this behavior, use #pragma warning. For example, to make C4235   into a level 2 warning, use the following line of code  #pragma warning(2:4235)    I felt that by cutting and pasting a quote from the website, and attributing it with the URL was proper form. Such that it's not ambiguous where the answer originated from - both from a copyright perspective as well as a courteous to the content owner.  About an hour later, I observed two things:   One moderator downvoting the answer and flagging it because "Copy/pasting. Nice. Did you see "© 2011 Microsoft. All rights reserved" at the bottom of that page" Another moderator deleted it with just a link to the FAQ - which says nothing about cut and paste or copyright rules.   Well that was disappoining. It wasn't like I was pasting a writeup without giving credit to the original author. Just a small quote from a well known reference site.  So here's my questions:   What is the policy around answers coming from other online reference sources? Is pasting a URL to a page with an answer OK? Is pasting content from the URL OK?  Even if it's attributed? Is there a proper way to attribute content when it originates from another site? Is there a proper way to attribute an answer if it originates elsewhere? Was I wrong to paste a snippet of content from MSDN, or was I wronged by aggressive moderators?   Now here's the real kicker - my day job is a software engineer at Microsoft. I am certain that my employer would not take issue at all with me helping the Windows development community by referencing pages they publish. So in some sense, the Stack Overflow communinity is just making it harder for the Windows experts to help the Windows community. It seems odd.


As the title says; What is the secret of making a really juicy burger?