How do I make the Windows low memory warning less sensitive?

I keep getting this annoying low memory warning/prompt to close games I play. It happens very often and I still have ~6 gigs of ram free. I disabled virtual memory because it was putting stuff on the pagefile when I had 10 gigs free ram so that spiked my disk usage.  Is there any way to disable this warning? I have 16GB ram so it shouldn't be an issue. I would prefer to keep pagefiles off because my HD is very loud so it's nice to keep it spun down as much as possible.  I don't want to disable it completely. Ideally, I would like it to go off when I have ~2GB left rather than 6, but if this isn't viable, I may just disable it completely.


Changing the verbatim font of Latex document to Inconsolata

I have long pieces of \LaTeX code given to me which look lie the following.  \begin{flushleft} \small \begin{minipage}{\linewidth}\label{scrap1}\raggedright\small \NWtarget{nuweb13}{} \verb@"../main.py"@\nobreak\ {\footnotesize {13}}$\equiv$ \vspace{-1ex} \begin{list}{}{} \item \mbox{}\verb@@\\ \mbox{}\verb@import sys@\\ \mbox{}\verb@sys.path.append('src/lib')@\\ \mbox{}\verb@@\\ \mbox{}\verb@import problem_foo\\ \mbox{}\verb@import problem_bar\\ \mbox{}\verb@   @\\ \mbox{}\verb@if __name__=="__main__":@\\ \mbox{}\verb@     if (len(sys.argv)==1):@\\ \mbox{}\verb@          print "Specify the problem"@\\ \mbox{}\verb@          sys.exit()@\\ \mbox{}\verb@@\\ \mbox{}\verb@     elif sys.argv[1] == "--problem-foo":@\\ \mbox{}\verb@          foo.run_handler()@\\ \mbox{}\verb@@\\ \mbox{}\verb@     elif sys.argv[1] == "--problem-bar":@\\ \mbox{}\verb@          bar.run_handler()@\\ \mbox{}\verb@@\\ \mbox{}\verb@@\\ \mbox{}\verb@     else:@\\ \mbox{}\verb@          print "Option not recognized"@\\ \mbox{}\verb@          sys.exit()@\\ \mbox{}\verb@@{\NWsep} \end{list} \vspace{-1.5ex} \footnotesize \begin{list}{}{\setlength{\itemsep}{-\parsep}\setlength{\itemindent}{-\leftmargin}}   I do not like the default font of the verbatim font of \verb that is being  generated in my document. How do I tell \LaTeX to change the verbatim font to  ?   Note: I know, I can probbaly generate better looking output using listings environment for source code, but I am not allowed to edit the code-chunks  I have been given. I just need a way to change the font of \verb to something nicer like inconsolata.


Can the likelihood take values outside of the range [0, 1]?

I got a log-likelihood value of -34.82, so I am not getting whether the answer which I have got is right or not.  Can the likelihood take values outside of the range $[0, 1]$?


How to create svg symbols that have modifiable fill color, stroke color and stroke width?

I want to create some svg symbols for Qgis using Inkscape, those symbols must have attributes as described in the question. For the last two days, I have been experimenting as instructed by  and mimicked some symbols came bundled with qgis that have desired attributes without any success.  Finally I experimented with the simplest form of symbol: I created an svg that contains only a circle in Inkscape and tried to modify it.  The original file () have this line:  <path    sodipodi:type="arc"    style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.01988637;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none"   I modified it into:  <path    sodipodi:type="arc"    style="fill:param(fill) #ffffff;fill-opacity:1;stroke:param(outline) #000000;stroke-width:param(stroke-width) 1.01988637;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none"   Saved as  and selected it as point symbol, but Qgis couldn't change all three parameters at the same time.  What did I do wrong or should do differently?  My system: Qgis 1.8.0 on Ubuntu 12.04 64 bit, Inkscape 0.48, Gedit 3.4.1 text editor.


Restore opacity to portions of a layer in Photoshop CS4

A layer has Opacity 100%.  However, using a soft erase brush to feather the edges of an item, I've accidentally made too much of the layer partially transparent.  My recollection is that there'd be a layer mask that is less than full value, but "Add Layer Mask" is showing a new, fully-white mask.  When I right click on the thumbnail on the Layers palette, the "Add/Subtract/Intersect Transparency Mask" options are grayed out.


Migrating ArcPy scripts from ArcGIS 9.3 to 10?

What changes are needed to migrate scripts from the ArcGis 9.x environment/gp-object to the ArcGis 10/arcpy environment?   Can anyone provide a good overview what the changes are?   Can someone share pitfalls etc from their own experience?


Prove that for any random discrete variable and its median

How to prove that for any random discrete variable and its median, $$\inf_{a\in\mathbb R}\mathbb E|\xi-a|=\mathbb E|\xi-\mu|$$ Where  $\mathbb E=$ mathematical expectation $\xi=$ random variable $\mu=$ median of the random variable


How to use ogr2ogr for batch conversion?

I have a thousand of arc coverage would like to covert to shapefile. How can I use the ogr2ogr to convert it in batch rather than convert it one by one? It takes a lot of time! :( Thanks for any idea!


Mousepad edge scrolling disabled in Ubuntu 18.04

As you can see there is no option for enabling edge scrolling in Ubuntu 18.04. Now I can only scroll with two fingers, which it sucks.  How can I enable edge scrolling in Ubuntu 18.04?


Identify a short story involving a blond that makes a fire poker sag

I found a box of books in the attic of a new house at age 12, the summer of 1963.  It contained 2 sf anthologies.  One was Damon Knight stories.   The other one was a hard bound collection of multiple stories by multiple authors with many different themes.  The  (not Damon Knight) story I recently remembered involved a pathetic guy (with blond roots) who has been trying to seduce a beautiful non-stereotypical blond.  She demonstrates, in the last paragraph, a "trick"  that causes a fire poker to suddenly sag.  I didn't get at age 12, but when something reminded me of the scene a while back I did and started laughing out loud.  It probably would have been funniest when I was a high school sophomore, but I would like to see if I can locate the story and maybe even the anthology.  Ah, retirement.  I think the  was yellow.


Not Important bug found with 5 second comment warning?

This is not an important bug to fix, but just noticed it today. You normaly get the 5 seconds between comment vote warning when you try and vote for too many comments at once.  I deleted two of my comments back to back on the same question and I got that same warning     You can replicate it by making two comments and then delete them both quickly.  Like I said, not important to fix anytime soon, but noted.


Programmatically check the checkbox of an exposed filter

I need to check a checkbox on an exposed filter for a view based on the url. I can't seem to figure out how to do that. If x is detected in the url, I want to set one of the fields of an exposed filter to have the status checked="checked." It seems like that would be pretty easy, but I can't seem to figure it out.  I have tried various ways through:   hook_views_pre_view() hook_views_pre_build() hook_form_views_exposed_form_alter() (I feel like this should be the best way.)   I've found that I can effectively alter the results through hook_views_pre_view(), but I can't figure out how to check that freaking checkbox on the exposed filter.  Varioush failed attempts via hook_form_alter():   $form["field_intended_use_target_id"]["#default_value"] = ['357']; $form_state->input["field_intended_use_target_id"][356] = '356'; $form['field_intended_use_target_id']['widget'][0]['value']['#default_value'] = ['357'];   Can anyone please help?


Possible bug when using tikz to position node using pos command in curves

Runing this simple code:  \documentclass{report} \usepackage{tikz} \begin{document} \begin{tikzpicture}     \draw[-latex]             (0,0) to[out=40, in= 140] (5,0) node [pos=0.5] {en}; \end{tikzpicture} \end{document}   Results in the text "en" not being located in the middle of the path.   Using midway resulted in the same problem.


Prove that exists $\lim_{x\rightarrow \infty }\frac{f(x)}{x}$ and determine its value

Let $f:[0,\infty )\rightarrow \mathbb{R}$ be an increasing function, such that $\lim_{x\rightarrow \infty }\frac{1}{x^{2}}\cdot \int_{0}^{x}f(t)dt=1$.  Prove that exists $\lim_{x\rightarrow \infty }\frac{f(x)}{x}$ and calculate this limit.    If $f$ would be continuous, we'd have $1=\lim_{x\rightarrow \infty }\frac{1}{x^{2}}\cdot \int_{0}^{x}f(t)dt=\lim_{x\rightarrow \infty }\frac{f(x)}{2x}$, therefore $\lim_{x\rightarrow \infty }\frac{f(x)}{x}=2.$ But we don't know if $f$ is continuous or not, and I wasn't able to find any other idea.


PHP Sanitizing string when reading from database

I'm kind of a bit of a noob when it comes to PHP, so apologies if this is very basic. This question has probably been previously asked, but I am unable to find another post with a similar case to mine. An example of a URL on my site is example.com/read.php?id=1. The read.php file contains the following code:  <?php     $id = $_GET['id'];     $sql = mysqli_query($con, "SELECT * FROM pages WHERE id='$id'"); ?>   I know that I need to do some kind of sanitation to this, but what would be the best way of doing this in this case? Performance is critical as well, so I don't want to be adding unnecessary code.


Does Ubuntu run on current Asus Transformer Prime?

I've read instructions about dual boot Android / Transformer Prime (a significant factor in ordering one). Also about not working with /latest/ Transformer Prime (firmware / BIOS?) Also about imminent Ubuntu ARM support.  Will I be able to run Ubuntu in a day or two when Transformer arrives?  Also, am I right to assume I can restore Transformer to factory status if I break something in the attempt?


How can two vectors be dependent in one complex field and independent in real field?

Show that the vectors $v_1=(1, 1+i, i)$, $v_2=(i, -i, 1-i)$, $v_3=(0, 1-2i,2-i)$ in $\mathbb C^3$ are linearly independent in the field of real numbers but dependent over the field of complex numbers.


I know that $|\mathbb{R}| = 2^{|\mathbb{N}|}$, but is there a set $S$ such that $|\mathbb{N}| = 2^{|S|}$?


What is the difference between -ic and -al?

Is there a defined difference between words like "egotistic" and egotistical" or "manic" and "maniacal" in that one could have a manic smile or maniacal laughter and other words that have similar forms?


Anyway to get Brawlhalla(a windows only steam game) to run on Ubuntu?

I've looked around but I'm still unable to get it working. If anyone could help that would be great.


\left/\right, \dots, amsmath, scrartcl are not compatible in TeX Live 2016

In TeX Live 2016 the following simple document fails to compile:  \documentclass[11pt]{scrartcl} \usepackage{amsmath} \begin{document} \[ \left( x+1 \right) \dots \left( x+8 \right). \] \end{document}   Several errors are thrown, the first of which are:  ! Argument of \zap@to@space has an extra }. <inserted text>                  \par  l.6 \[ \left( x+1 \right) \dots \left                                      ( x+8 \right). \] ?  Runaway argument? \left.......... ! Paragraph ended before \zap@to@space was complete. <to be read again>                     \par  l.6 \[ \left( x+1 \right) \dots \left                                      ( x+8 \right). \] ?    In addition, any of the following appear to cause the issue to go away:   Changing from scrartcl to article Removing the line \usepackage{amsmath} Not using \left( and \right) Using an earlier version of TeXLive   I'm assuming this is a bug somewhere, but I'm not sure how to fix it (other than just manually using \cdots instead of \dots, I suppose). Does anyone have any ideas on how to make things behave the way they should?  [EDIT: to clarify, compiling with PDFLaTeX, on TeX Live 2016, Arch Linux.]


Consider the Riemann $\zeta$ function. We know that $\zeta(2n)$ is a rational multiple of $\pi^{2n}$ (in particular is transcendental). We also know that $\zeta(3)$ is irrational, and we expect $\zeta(n)$ to be irrational (if not even transcendental) for every $n\in\mathbb{N}$, or at least I would be amazed if - say - $\zeta(5)$ turned out to be rational.     Are there known instances of rational numbers appearing where we would not have expected them?   Of course the notion of "expectation" here is very subjective, so this is a soft question just out of curiosity, since I have the feeling that usually (in my limited experience always) complicated expressions yield irrational ($\mathbb{C}-\mathbb{Q}$) numbers.  As a non-example, we have the series $\sum_{n=1}^\infty 2^{-n}=1$. A series is complicated enough (compared to say a finite arithmetic expression), but of course here we have the explicit formula for geometric series so the resulting $1$ is not really a big surprise.


I need to split a single line containing multiple words separated by spaces returned by a command. I tried using read but it acts completely strange. For example:  Why does running echo "Hello World!" | read -ra lines; echo "${lines[@]}" in Bash results in an empty line, but running echo "Hello World!" | read -ra lines; do echo "${lines[@]}"; done results in Hello World!?  If I run echo "Hello World!" | tee /dev/stdout | read -ra lines; echo "${lines[@]}" it also results in an empty line.  Even simple echo "Hello World!" | read hello; echo "$hello" doesn't work.


Biblatex: Get rid of ISSN, URLs and DOIs in references

My .bib files are generated by Mendley desktop and usually contain URLs, ISSN and DOIs, but I don't want those to be displayed in my list of references. How can I get rid of them (short of deleting those from the entries, I just want to not display them...) I am using biblatex.


Correct Order to play ALL Half-Life games

I fully understand that posts have been made that already address this question. Just give me a chance to differentiate.  I am in love with the Half-Life series ever since I finished the first game (Half-Life 1).  I bought the rest of the Half-Life series on Steam. I want to play ALL of them, no matter if it is source, a tech demo, a multiplayer game, or a fan-made remake. I was just wondering what order I should go about playing them.  So far, the recommendations I have read do not include all of the games from Steam.  The games I have are:   Half-Life -- [finished already] Half-Life: Opposing Force Half-Life: Blue Shift Half-Life: Source Half-Life Deathmatch: Source Half-Life 2 Half-Life 2: Lost Coast Half-Life 2: Episode One Half-Life 2: Episode Two Half-Life 2: Deathmatch Black Mesa   (I have already played Portal and Portal 2, if that is useful info)  Thanks, I really appreciate your feedback


What is the default set of packages installed with Trusty?

Where can I find a list of all the packages that get installed by default with Ubuntu 14.04?


I receive every push notification from the iOS app twice on iPhone. The second comes immediately after the first. This happens every single time.   I also have the app installed on an iPad and signed in to the same account - could this be a possible cause?   App Version: 1.4.0 Device: iPhone7,2 OS Version: Version 9.1 (Build 13B143)


Error message: "Could not load file or assembly or one of its dependencies"

Full error messsage: Could not load file or assembly 'LimitlessSoft.Buffer, Version=4.0.0.0, Culture=neutral, PublicKeyToken=null' or one of its dependencies. A strongly-named assembly is required. (Exception from HRESULT: 0x80131044) First of all I have looked at these questions and all of their answers:      I haven't found any solution that is working for me. Here is my situation. I have winform .NET Framework 4.0 project (no I cannot update to higher version). I had some code in it which I wanted to separate in dll so I can use it in some other project. I have created new .NET Framework 4.0 Class Library project which has only one class and it looks like this: using System;  namespace LimitlessSoft.Buffer {     /// <summary>     /// Used to buffer data     /// </summary>     /// <typeparam name="T"></typeparam>     public class Buffer<T>     {         /// <summary>         /// Delegate that returns object that is buffered         /// </summary>         /// <returns></returns>         public delegate T SetBuffer();         /// <summary>         /// SetBuffer that returns object that is buffered         /// </summary>         private SetBuffer UpdateBuffer;          /// <summary>         /// Indicates when has buffer been updated last time         /// </summary>         public DateTime LastUpdate { get; set; }         private T Value { get; set; }           /// <summary>         /// Initializes new buffer         /// </summary>         /// <param name="updateBuffer">Delegate that returns object being buffered</param>         public Buffer(SetBuffer updateBuffer)         {             UpdateBuffer = updateBuffer;         }           /// <summary>         /// Gets item from buffer that has been last time updated not greater than maximumObselence.         /// If it cannot be found, he will do as updateIfNotFound says.         /// If it cannot be foudn after updateIfNotFound, you will get default(T)         /// </summary>         /// <param name="maximumObselence">Maximum obselence for buffered item</param>         /// <param name="updateIfNotFound">Indicates if buffer need to be updated if it has not been found at given period</param>         /// <returns></returns>         public T Get(TimeSpan maximumObselence, bool updateIfNotFound = true)         {             if (Value != null)                 if ((LastUpdate - DateTime.Now).TotalMilliseconds < maximumObselence.TotalMilliseconds)                     return Value;              if (updateIfNotFound)             {                 Value = UpdateBuffer();                 LastUpdate = DateTime.Now;                 return Value;             }              return default(T);         }         /// <summary>         /// Sets item into buffer         /// </summary>         /// <param name="item"></param>         public void Set(T item)         {             Value = item;             LastUpdate = DateTime.Now;         }         /// <summary>         /// Updates data in buffer         /// </summary>         public void Update()         {             Value = UpdateBuffer();             LastUpdate = DateTime.Now;         }     } }  When I import this class library in my project it drops error. Then I created new empty .NET Framework 4.0 winform application, imported this dll, initialized class, called function from it and poof it is working. Why does same dll works in new empty project but drops error on other one?


usage of "the" in "the English language"

I am interested in the English language.   I  am interested in English language.      I want to know whether I need to put the definite article "the" before the word "language".


Tried to install Ubuntu, now computer won't boot, HELP!

I have a new Acer Aspire S7. I tried to install Ubuntu, alongside with Windows 8, but i messed up in the middle, and now i can't even run Windows 8. I'm desperated, when i turn the computer on, it asks me to enter a bootable device. I made a backup with the Acer tool, but it doesn't seem to work. I don't know what to do.  I leave you the report of what boot-repair returned:


Is the usage of 'Due to urgent personal errands' valid?

I see in my company mails, there is a lot of usage of the statement Due to urgent personal errands (..I may not report to office today) which, by hunch, I guess is not a proper usage.   What is the correct way to use it,if I am right?


apache user can not write to .python-eggs

I have read that I need to set the PYTHON_EGG_CACHE environment variable, or install the python library as an uncompressed .egg  Which do you suggest?


How not to get drowned in details and questions?

Hi I am a perfectionist electrical and electronics student who struggles with studying because I cannot focus on the subject or context as I cannot let go of the questions or details that trouble me. I always feel like I must be an expert regarding the subject and be able to answer all the questions that one might raise no matter how stupid or unrelated those questions are. That is why I am not academically successful and satisfied. What mindset should I adopt to overcome this situation? I feel totally frustrated and hopeless. I tried out psychological help but it keeps coming over and over.


Methods for printing without adding control characters in python

I have been using the function sys.stdout.write(string) but I was wondering if there is another method for this purpose. Thanks in advance!


Firefox browser opens but URL is not launched

I am working on selenium. I am using linux os. I am using firefox driver for automated testing my app. My firefox version is 53.0.3 (64 bit). When I run the code the Firefox browser open and don't pass the URL, meanwhile getting an error.   My selenium code:  //Firefox driver      System.setProperty("webdriver.gecko.driver","pathToGeckodriver");     driver =new FirefoxDriver();   Console error:  java.lang.IllegalStateException: The driver executable does not exist: /home/naveen/IdeaProjects/QberTestCase/pathToGeckodriver     at com.google.common.base.Preconditions.checkState(Preconditions.java:199)     at org.openqa.selenium.remote.service.DriverService.checkExecutable(DriverService.java:121)     at org.openqa.selenium.remote.service.DriverService.findExecutable(DriverService.java:116)     at org.openqa.selenium.firefox.GeckoDriverService.access$000(GeckoDriverService.java:37)     at org.openqa.selenium.firefox.GeckoDriverService$Builder.findDefaultExecutable(GeckoDriverService.java:95)     at org.openqa.selenium.remote.service.DriverService$Builder.build(DriverService.java:296)     at org.openqa.selenium.firefox.FirefoxDriver.createCommandExecutor(FirefoxDriver.java:277)     at org.openqa.selenium.firefox.FirefoxDriver.<init>(FirefoxDriver.java:247)     at org.openqa.selenium.firefox.FirefoxDriver.<init>(FirefoxDriver.java:242)     at org.openqa.selenium.firefox.FirefoxDriver.<init>(FirefoxDriver.java:238)     at org.openqa.selenium.firefox.FirefoxDriver.<init>(FirefoxDriver.java:127)     at util.DriverManager.<init>(DriverManager.java:39)     at steps.LoginSteps.<init>(LoginSteps.java:13)     at user.userTest.initDriver(userTest.java:25)     at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)     at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)     at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)     at java.lang.reflect.Method.invoke(Method.java:498)     at org.testng.internal.MethodInvocationHelper.invokeMethod(MethodInvocationHelper.java:100)     at org.testng.internal.Invoker.invokeConfigurationMethod(Invoker.java:515)     at org.testng.internal.Invoker.invokeConfigurations(Invoker.java:216)     at org.testng.internal.Invoker.invokeConfigurations(Invoker.java:143)     at org.testng.SuiteRunner.privateRun(SuiteRunner.java:307)     at org.testng.SuiteRunner.run(SuiteRunner.java:270)     at org.testng.SuiteRunnerWorker.runSuite(SuiteRunnerWorker.java:52)     at org.testng.SuiteRunnerWorker.run(SuiteRunnerWorker.java:86)     at org.testng.TestNG.runSuitesSequentially(TestNG.java:1284)     at org.testng.TestNG.runSuitesLocally(TestNG.java:1209)     at org.testng.TestNG.runSuites(TestNG.java:1124)     at org.testng.TestNG.run(TestNG.java:1096)     at org.testng.IDEARemoteTestNG.run(IDEARemoteTestNG.java:72)     at org.testng.RemoteTestNGStarter.main(RemoteTestNGStarter.java:127)   Test ignored.


Is their any track changes option available in LaTex, similar to word. If some other person want to mark comments in my LaTex document, is that possible?


Every search I have done for this, the answer involves \bar or \overline but those are math mode and thus result in the math font being used, which often differs from the main text font.  Ēostre - note the E has a bar over it. A Pagan Goddess. If I use math mode then the upper case E is a different font than the ostre which is typographically wrong.  How, using TeXLive with pdflatex compiler, so I add a horizontal bar over a latin letter without using math mode?  Thank you for suggestions.


Trying to join Minecraft servers. my internet is up but no servers will allow access

I cannot join any Minecraft servers. My internet is fine as all apps that require internet have been working fine. but when I go onto Minecraft, and try to connect to a server, it gives me this error message:   io.netty.channel.ConnectTimeoutException: connection timed out:  and I have no idea what the problem is, it's not all Minecraft, as I can play single player.


Greatest common divisor and relative primes

For a proof in my textbook it is asserted that if $d=(n,a), n=db, a=dc$ for suitable $b,c\in\mathbb{Z}$ then $(b,c)=1$. I am not very good with number theory and this boggles me a bit. I am sure it is not so difficult to realize but I am stumped right now. Could someone please help me out?


Im trying to run the following code  \documentclass[border=10pt]{standalone} \usepackage{pgfplots} \pgfplotsset{width = 7cm, compat = 1.8} \begin{document} \begin{tikzpicture} \begin{axis}[domain = -2:2, domain y = 0:2*pi] \addplot3[contour gnuplot = {output point meta = rawz, number=10, labels=false}, samples = 41, z filter/.code=\def\pgfmathresult{-1.6}] {exp(-x^2) * sin(deg(y))}; \addplot3[surf, samples = 25] {exp(-x^2) * sin(deg(y))}; \end{axis} \end{tikzpicture} \end{document}   and I'm getting the error  Package pgfplots Error: sorry, plot file{Utitlled_contourmp0.table} could not be opened   through a quick search I found out that contour maps require pgfplots and gnuplot to talk to each other. In theory the way to make them interact is adding  !TEX option = --enable-write18   or   %!TEX option = --enable-escape   at the top of the file. Unfortunately this has not worked for me. Any suggestions?


I set a password on an Excel 2013 spreadsheet but now I don't remember it.  Is there any way that I can remove or recover it? It is an .xlsx document


I'm going to have a new PC and I will uninstall everything on my old PC (reset to factory setting). I need to know if this affect my Steam installation on the new PC in any way. Will I still have my games on my new PC? I know they'll not be installed but will they still be in my library?


difference between node* ptr= new node(); vs node* ptr=new node;?

I am new to Object Oriented Programming and i am not able to find correct explanation for following:- //type-1:   #include <bits/stdc++.h>  using namespace std;   class node {  public:      int data;      node* next;  };   // This function prints contents of linked list  // starting from the given node  void printList(node* n)  {      while (n != NULL) {          cout << n->data << " ";          n = n->next;      }  }    int main()  {      node* head = NULL;      node* second = NULL;      node* third = NULL;       // allocate 3 nodes in the heap      head = new node;      second = new node;      third = new node;       head->data = 1; // assign data in first node      head->next = second; // Link first node with second       second->data = 2; // assign data to second node      second->next = third;       third->data = 3; // assign data to third node      third->next = NULL;       printList(head);       return 0;  }   type-2: #include <bits/stdc++.h>  using namespace std;   class node {  public:      int data;      node* next;  };   // This function prints contents of linked list  // starting from the given node  void printList(node* n)  {      while (n != NULL) {          cout << n->data << " ";          n = n->next;      }  }    int main()  {      node* head = NULL;      node* second = NULL;      node* third = NULL;       // allocate 3 nodes in the heap      head = new node();      second = new node();      third = new node();       head->data = 1; // assign data in first node      head->next = second; // Link first node with second       second->data = 2; // assign data to second node      second->next = third;       third->data = 3; // assign data to third node      third->next = NULL;       printList(head);       return 0;  }   Both the code are working absolutely fine. please tell me the difference between (head= new node) vs (head=new node()) on line 6 in both the code inside main function , what value does parenthesis add here? What is suggested or which one is better to use?


My text claims that Gauss's Law has been proven to work for moving charges experimentally, is there a non-experimental way to verify this?


Let $F$ be an infinite field and let $f(x) ∈ F[x]$. If $f(a) = 0$ for infinitely many $a ∈ F$, show that $f = 0$.

Step 1: Suppose that $F$ is an infinite field and $f(x) \in F[x]$. To claim the statement, "If $f(a)=0$ for infinitely many elements $a$ of $F$, then $f(x)=0$". To prove this statement using proof by contradiction. Suppose that $f(x)=a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{1}x+a_{0}$ with $\deg (f(x))=n$. May I have your idea about the next steps?


Suppose I have a complex figure made with TikZ. How do I use it several times without having to repeat all the commands?  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage{tikz}  \begin{document}  Base figure  \begin{tikzpicture}   \draw[blue] circle (2);   \foreach \i in {0,10,...,350}     \draw[blue] (\i:1.9) -- (\i:2.1); \end{tikzpicture}  Using base figure.  \begin{tikzpicture}   \draw[blue] circle (2);   \foreach \i in {0,10,...,350}     \draw[blue] (\i:1.9) -- (\i:2.1);   \foreach \i in {0,10,...,350}     \node at (\i:2.7) {\tiny $\i^\circ$}; \end{tikzpicture}  Using base figure.  \begin{tikzpicture}   \draw[blue] circle (2);   \foreach \i in {0,10,...,350}     \draw[blue] (\i:1.9) -- (\i:2.1);   \foreach \i in {0,10,...,350}     \draw (0,0) -- (\i:2); \end{tikzpicture}  \end{document}


Is Time travel in "Star Trek: Enterprise" totally illogical?

Normally Star Trek seems to based on some sort of logic, but the time travel in "Star Trek: Enterprise" seems to have no logic at all, or  am I just missing it?  Example: If they go back in time to change something it takes time until it has any effect in the future? I can't see any reason for this.


How to make a count to show a dynamic block

In SFMC we need to show a block after the customers 4th purchase. This means when the customer have bought: 4, 8, 12 and so on. I know I could use a dynamic content block and then you add the numbers manually, but I was wondering if it was possible to use ampscript that do the count for me. If so, how would that look like?


Locating shapefile of European railways for goods transportion

We are trying to make a project about European goods trade so we need railway data in shapefile format.   More specifically, we are trying to find the potential of mine products being exported from Turkey to Europe by using Geomarketing tools.   Basically, we need a European railways layer for ArcGIS (excluding passenger-only railways).


i'm trying to add about 50 points in certain areas in QGIS and they all have the same exact value,  so i figured i can just have the placed without entering the data and then select them and add the value through a formula  i just have on issue that i have to confirm using "enter" after placing each point .. so is there any way to add a point with just a click without going through the attribute dialogue and pressing "Enter"?


In *nix based systems, how does LaTeX recursively look for classes / styles?

Broadly speaking, how does LaTeX look for class and styles in a *nix based system?  More specifically, export TEXMFHOME='~/.config/texmf' followed by texhash ~/.config/texmf is not referenced when I call one of my own classes or styles. Interestingly, even if TEXMFHOME remains as I have just described, LaTeX will still search ~/texmf/tex/latex/local/ for classes and styles. That leads me to believe that it will always look there but perhaps I am wrong.  So, how does LaTeX search for classes / styles? Which folders does it look within, and how do you edit those settings?  EDIT: Unlike other questions, I am also wondering how to edit these recursive settings, either by declaring variables or editing config files.


How to get a version of \autoref that uppercases the first letter

So I'm using hyperref for all my referencing needs because it works very, very nicely. However, what I would like is to be able to choose whether the reference text is capitalised or not, so e.g.  see \autoref{fig:graph} for an example. \Autoref{fig:othergraph} shows the particular case   would produce     see figure 3.4 for an example. Figure 3.5 shows the particular case   Now, the best way I can see for doing this is to let hyperref define \autoref as normal, and then define \Autoref by taking the text generated by \autoref and uppercasing the first letter thereof. But I cannot make this work!  Playing around with some code (and for now just trying to get any uppercasing at the level I want), I tried  \newcommand\foo[1]{foo #1} \newcommand{\bar}[1]{\expandafter \MakeTextUppercase\expandafter{\foo{#1}}  }   for which \foo{aaa} \bar{aaa} produces     foo aaa FOO AAA   as expected; I read this code as "first expand \foo{#1}, then apply uppercasing to the result". But with \autoref:  \newcommand{\Autoref}[1]{\expandafter\MakeTextUppercase\expandafter{\autoref{#1}} }   I get the error     LaTeX Warning: Reference `LEM1' on page 1 undefined on input line 27.   Perhaps there are multiple levels of macro expansion going on here? But adding more \expandafters doesn't seem to help, and moreover feels like a fairly blunt thing to do :P.  I also tried the \Capitalise macro from  question, but it doesn't do anything at all to \autoref!  I think once I can get this working, making it only uppercase the first letter should be relatively trivial! But, does anyone have any advice here?


Let $n$ be a natural number, and set $f(x)=1+\frac{x}{1!}+\frac{x^2}{2!}+...+\frac{x^n}{n!}$ in $\mathbb{Q}[x]$. Determine the gcd of $f(x)$ and $f'(x)$. Then, determine for which natural numbers $n$ the polynomal $f(x)$ has multiple roots. I've calculated $f'(x)=1+\frac{x}{1!}+\frac{x^2}{2!}+...+\frac{x^{n-1}}{(n-1)!}$. I then tried to do polynomial long division by examining just a few of the highest degree terms and a few of the lowest degree terms, but that didn't seem to be getting me anywhere.


What is the relation of differential geometry to General Relativity and Quantum Field Theory?

We know that Yang Mills Theory forms the basis of the Standard Model of Physics, which describe the interaction of elementary particles at high energies, of course not including gravity. Yang Mills theory (gauge theory) and gravity are described by local invariance. String theory unifies gauge theory and gravity, what is the relation between gauge theory and gravity?.


I have a .tiff and a .tfw file that I want to change into a GeoTIFF. When I try to open the file in ArcMap and ENVI 5.0, it is successful. However, in Google Earth it is not.  Is there anyway to create the GeoTiff in ArcMap or ENVI?


Almost everywhere convergence does not imply uniform convergence.

By definition, a sequence of functions $f_n$ converges to $f$ almost everywhere in a set $D$ if $m(\left\{x\in D \text{ such that } f_n(x) \text{ does not converge to } f(x)\right\}) = 0$ where $m$ is the Lebesgue measure. My question here is how do we relate this kind of definition to uniform convergence? Can we show by example that almost everywhere convergence doesn't imply uniform convergence? In other words, an example of a sequence of functions that converges almost everywhere but does not converge uniformly, and why it fails to converge uniformly.


Integration help plz I need help proving this integral

We are asked to prove the following integral;  $\int_0^x(\int_0^tf(u)du)dt=\int_0^xf(u)(x-u)dx$  We have to use integration by parts and then by this apply the fundamental theorem of calculus which I believe need to be applied to the derivative part of the one done by parts. I haven't seen anything like this before.   Any help would be greatly appreciated  Thanks in advance!


since I have installed Windows 10 a notepad opens when I start up my computer and log in. It is empty and shows a Message-Box with the Message "Access Denied".   It happens every single time and I'm not sure why this is happening.   Edit: Thanks to the comments, I found that in the Startup-Folder there is a file called desktop.ini which seems to be the file that is getting opened. Can I delete it without breaking anything?


Showing that $\int^{t}_{0}B^{2}_{s}dB_{s}=\frac{1}{3}B^{3}_{t} - \int^{t}_{0}B_{s}ds$, without Ito formula

I am trying to prove the following via the direct definition of Ito integrals (i.e. without the use of the Ito formula).     $$ \int^{t}_{0}B^{2}_{s}dB_{s}=\frac{1}{3}B^{3}_{t} - \int^{t}_{0}B_{s}ds$$   Progress so far     So Using the Definition of the Ito integral we can write    $$\int^{t}_{0}B^{2}_{S}dB_{s}=\lim_\limits{\Delta t_{j} \ \to 0}\sum_\limits{j}B^{2}_{j}\Delta B_{j}$$    Where $\Delta B_{j}=[B_{j+1}-B_{j}]. $      From here i then started by trying to calculate $\Delta(B^{3}_{j})$ which i got       $$ \Delta(B^{3}_{j}) = B^{3}_{j+1}-B^{3}_{j} = (B_{j+1}-B_{j})^{3}+3B_{j}B_{j+1}\Delta B_{j}$$   However this doesn't really get the desired result i'm not sure how to proceed i assume i have calculated $\Delta (B^{3}_{j})$ incorrectly?


Finding a median in a union of sets given as sorted arrays

You are given $k$ sorted arrays $A_1, A_2, ..., A_k$, each containing $n$ elements.  How fast can you compute the median of $A_1 \cup A_2 \cup ... \cup A_k$ ?   I have a solution running in $\Theta(k\log k\log n)$, but this seems rather inefficient if $k=\Omega(2^\frac{n}{\log n})$, as we can always ignore the order, think of it as a unsorted array of $nk$ elements, and solve it in $O(nk)$ time.  Assuming $k=\omega(1)$ (hence the fact the arrays are sorted give us some information), is there a sub-linear median finding algorithm (regardless of the ratio between $k$ and $n$)? Assuming $k=\text{poly}( n)$, can we beat $O(k\log k\log n)$? Can we prove a lower bound for the problem (maybe $\Omega(k\log n)$?)?


Xcode - SQLite different rounding between simulator and device

How is possible that executing this query (I replaced the fields with the used numbers) gives 0.80 on the device and 0.81 on the simulator?  "SELECT 1.15 - round((1.15*30.000000/100),2)"  I really can't figure out. Same code, same databases. Seems that the device round 0.805 to 0.80 and the simulator (correctly) to 0.81.


I have notification menu icon. I need that to be animated when onCreateOptionsMenu() called.  While implementing, i have been facing issue like below -   Attempt to invoke virtual method 'void  android.view.View.setAnimation(android.view.animation.Animation)' on a  null object reference.   Java code :  private Animation animation; @Override public boolean onCreateOptionsMenu(Menu menu) {     getMenuInflater().inflate(R.menu.home_screen,menu);      animation =   AnimationUtils.loadAnimation(getApplicationContext(),R.anim.notify);  menu.findItem(R.id.notifications).getActionView().setAnimation(animation);      return super.onCreateOptionsMenu(menu); }   home_screen.xml :   <?xml version="1.0" encoding="utf-8"?>  <menu xmlns:android="http://schemas.android.com/apk/res/android"  xmlns:app="http://schemas.android.com/apk/res-auto">  <item     android:id="@+id/notifications"     android:title="@string/action_settings"     app:showAsAction="ifRoom"     android:icon="@drawable/notifications"/>   </menu>   notify.xml :   <?xml version="1.0" encoding="utf-8"?>  <rotate xmlns:android="http://schemas.android.com/apk/res/android" android:fromDegrees="0" android:toDegrees="180" android:pivotX="50%" android:pivotY="50%" android:duration="500" android:interpolator="@android:anim/accelerate_interpolator" />   Kindly let me know the solution to resolve the issue. Thanks in advance.


Text wrap with shapepar (insert image between text)

How do insert image between text and text wrap with shapepar or other package?


Are booleans made pointers? I had this weird case:  visited = [[False]*4]*4 visited[0][1] = True print visited >>> [[False, True, False, False], [False, True, False, False], [False, True, False, False], [False, True, False, False]]   How do I avoid this?  Thanks!


Change .jpg quality of terminal screenshots

I’m using a terminal script to capture my screen at set intervals. However, the resulting .jpg files are rather large. I’d like to control the quality of .jpg files being generated by this script:  while [ 1 ];do vardate=$(date +%d\-%m\-%Y\_%H.%M.%S);  screencapture -t jpg -x ~/Desktop/AutoScreenCap/$vardate.jpg;  sleep 600; done   How can I control the .jpg quality of the resulting files?


I saw a friend make lightning come out of dispensers or they made it seem like it came out of dispensers. I know they used a command block.   How can I summon a lightning like that?


How to make sure that values written in a textfield are the same using a simple loop function?

I wrote a simple code just to check the values between textfields and compared whether they are the same or not. I want them to be the same, if not it will produce an error. It's about rewriting an email.      String a = studentemail.getText();     String b = rewritestudentemail.getText();      if(a != b){          JOptionPane.showMessageDialog( null, "Student Email rewritten incorrectly.","Error!",JOptionPane.OK_OPTION);      }   The program persists that there is an error even though I indicated the same string values in both of the fields. Why's that?


I'm trying to fracture my statue object. I looked everywhere  but couldnt make the fracture work well. this is the blend file  anyone can help me? Thank you!!!


Why is there a minus in the Gauge Field Lagrangian kinetic term?

For vector Gauge fields we usually write the kinetic term:  $$ \mathcal{L} ~=~ - \frac{1}{4} F_{\mu \nu} F^{\mu \nu}$$  while for matter fields e.g. for a real scalar:  $$ \mathcal{L} ~=~ \frac{1}{2} D_\mu \phi D^\mu \phi $$  with Minkowski sign convention $(+,-,-,-)$.  Why is the sign different for the two and what physical difference does it make? Is it only the relative sign important or the absolute one?


How can I stop my function from looping?

Basically, I have an HTML and JS code that makes few input tags on the page (text boxes). Those boxes appear when I press the buttons on the screen (just some JS configuration (playing with hide(), show() and append())).  Well, I wanted them to append their value to some tags in HTML when I press specific button on the screen. So I did. But I can't make them do that by pressing "Enter" and the "arrow enter" (mobile devices).  I tried .keyup(), but that does the thing only if the boxes are static, but I gave them the option to appear and disappear. (In the beginning I press a button - one appends to HTML with another 2 buttons (first to hide it, second is like "enter")). Pressing enter doesn't help when they are dynamic.  Well, I need this "enter" functionality (better on keyup() some how).  I've tried this code:  $(document).keyup(function() {     $('#myText').keyup(function(e) {         if (e.keyCode == 13) {             alert("Enter pressed");         }     }); });   Then:  $(function () {     $('#myText').keyup(function(e) {         if (e.keyCode == 13) {             alert("Enter pressed");         }     }); });  $(#myText).keyup(function() {     if (e.keyCode == 13) {         alert("Enter pressed");     } });   and many others. It works only on static ones.


Controlling cell width and height simultaneously in a table

I'm trying to create a multi-page table with all cells having the same height (as well as certain fixed widths) so that certain manual cut-and-paste operations are a lot easier.  One issue is that one column in particular is text-heavy and should line-break within the cell.  As I don't want it justified, I looked into alternatives such as .  This is doing exactly what I want for horizontal alignment.  For vertical alignment, I've looked at  and the \vphantom method detailed in the above link doesn't seem to be working.  Here's what I'm currently working with:  \documentclass[11pt]{article} \usepackage{array}  \newcolumntype{P}[1]{>{\raggedright\hspace{0pt}\arraybackslash}p{#1}} \def\Z{\vphantom{\parbox[c]{1.7in}{\Huge Something Long}}}  \begin{document} \begin{tabular}{| c || P{0.5in} || P{0.5in} || P{5in} |}\hline  1.  \Z &&& Long long long long long long long long long             long long long long long long long text  \\\hline 2.  \Z &&& More long long long long long long long long             long long long long long long long text  \\\hline \end{tabular}   When I compile, the cells do not have a uniform height, and none of them are as large as 1.7 inches vertically.  So this suggests that somehow the \vphantom method is failing.  Does anybody know of a relatively straightforward solution to this problem?


Maclaurin Expansion for $e^{e^{z}}$ at $z=0$

I need to find terms up to degree $5$ of $e^{e^{z}}$ at $z=0$.    I tried letting $\omega = e^{z} \approx 1+z+\frac{z^{2}}{2!}+\frac{z^{3}}{3!}+\cdots$, and then substituting these first few terms into the Taylor series expansion for $e^{z}$ as follows:     $e^{\omega} = \sum_{n=0}^{\infty}\frac{\omega^{n}}{n!} = 1 + \omega + \frac{\omega^{2}}{2!}+\frac{\omega^{3}}{3!}+\cdots = 1 + (1+z+\frac{z^{2}}{2!}+\frac{z^{3}}{3!}+\frac{z^{4}}{4!}+\cdots) + \frac{1}{2}\left(1+z+\frac{z^{2}}{2!}+\frac{z^{3}}{3!}+\frac{z^{4}}{4!}+\cdots \right)^{2}+ \frac{1}{3!}\left( 1+z+\frac{z^{2}}{2!}+\frac{z^{3}}{3!}+\frac{z^{4}}{4!}+\cdots\right)^{3}+\cdots$   But, then when I try to multiply this all out (using Maple), I find that going even further out than I have here, the terms of degree $\leq 5$ do not terminate. So, then I tried putting the command into Maple, and it came out to be something long and horrible with $e$ coefficients for each term.  I must be missing something here.  Could somebody please tell me how to finish this problem? I would ask for a complete solution, not hints or leading questions. I've been working on this for hours and am beyond frustrated. The most edifying thing for me at this point would be to see the correct, full way it's supposed to be done, work backwards, take it apart, and then be able to apply it to other situations.  Thank you.


What is the most portable method of launching a terminal emulator?

Say I need to write a script that will launch a terminal and execute a command and I need that to work on various systems. How can I do that in a safe and portable manner?  Is xterm always installed? I assume that any *nix with a GUI must have some terminal emulator. How can I get to it? Debian systems  x-terminal-emulator but that, apparently,  in Red Hat, let alone non-Linux *nixes.


What is the difference between char* s and char *s?

As per the title. I see certain people declaring a pointer as char* s, and others declaring it as char *s. Also I see some people doing, say, s = (char*) malloc(5) instead of doing *s = malloc(5). Is there a difference between that as well? Apologies if this question is repeated, I understand the concept of pointers, but have great difficulty understanding the syntax used to represent pointers in C.


What is the access level of variables in enums by default

Recently I've come across the following piece of code:  enum Animals {     DOG("woof"), CAT("meow"), FISH("burble");     String sound;      Animals(String s) {         sound = s;     } }  class TestEnum {     static Animals a;     public static void main(String[] args) {         System.out.println(a.DOG.sound + " " + a.FISH.sound);//Expected compilation failure     } }   I would expect the code to fail to compile because of this a.DOG.sound part. But to my surprise it doesn't. I've searched all around including the  to find out the access level but found nothing. Is it public or default?


Show that the polynomial has at least one zero in the interval $(0,1)$.

Let $a_0, ... , a_n$ be real numbers satisfying  $$\frac{a_n}{n+1}+\frac{a_{n-1}}{n}+ ... + \frac {a_1}{2}+a_0 = 0.$$ Show that the polynomial $$p(x) = a_nx^n + a_{n-1}x^{n-1} + ... + a_1x + a_0$$  has at least one zero in the interval $(0,1)$.  The solution is that let $$f(x) = \frac{a_n}{n+1}x^n + \frac {a_{n-1}}{n}x^{n-1}+ ...+\frac {a_1}{2}x + a_0$$ ,and then apply the Rolle's theorem.   But, I am wondering how the existence of root of $f(x)$ implies the existence of root of $p(x). $


Since Ubuntu relies on upstart for some time now, I would like to use an upstart job to gracefully shutdown certain applications on system shutdown or reboot. It is essential that the system's shutdown or reboot is stalled until these applications are shut down.  The applications will be started manually on occasion, and on system shutdown should automatically be ended by a script (which I already have). Since the applications can't be ended reliably without (nearly all) other services running, ending the applications has to be done before the rest of the shutdown begins.  I think I can solve this by an upstart job which will be triggered on shutdown, but I am unsure which events I should use in which manner. So far, I have read the following (partly contradicting) statements:   There is no general shutdown event in upstart Use a stanza like start on starting shutdown in the job definition Use a stanza like start on runlevel [06S] in the job definition Use a stanza like start on starting runlevel [06S] in the job definition Use a stanza like start on stopping runlevel [!06S] in the job definition   From these recommendations, the following questions arise:   Is there or is there not a general shutdown event in Ubuntu's upstart? What is the recommended way to implement a "shutdown hook"? When are the events runlevel [x] triggered; is this when having entered the runlevel or when entering the runlevel? Can we use something like start on starting runlevel [x] or start on stopping runlevel [x]? What would be the best solution for my problem?   Thank you very much


For any positive integers p and q, prove that p + q ≤ 1 + pq

I am currently studying discrete math and I am unsure of how to format this proof in such a way to get my point across. If anyone could write it out for me that would be very appreciated!


My do-while loop does not continue no matter the input at the end

Below is my code. It is a simple class exercise in beginner level Java.  I am to compute the distance between points for as long as the user wants to enter points.  When I run my code (aside from formatting decimals) it works perfectly, but it terminates after the first run.  Can anyone assist? Here is my code:  import java.util.Scanner;  public class Distance{     String a;  public static void main( String[] args){     Scanner input = new Scanner(System.in);     String a = "y";     do {         System.out.print("Enter x1:");         double x1 = input.nextDouble();         System.out.print("Enter y1:");         double y1 = input.nextDouble();          System.out.print("Enter x2:");         double x2 = input.nextDouble();         System.out.print("Enter y2:");         double y2 = input.nextDouble();          double distance = Math.pow(Math.pow(x2-x1,2)+(y2-y1), 0.5);         System.out.println("The distance between your points is "+distance);           System.out.print("Do you want to continue? ");         a = input.next();     }while(a == "y"); }   }


How do you parse through a subdirectory where the path contains spaces?

I'm trying to parse through a set of files in a directory on a mapped drive. However, I can't seem to resolve an issue that seems to be because of spaces in the path to the subdirectory. Would appreciate any help! Thank you.  #!/bin/bash FILES=/home/user/.gvfs/analysis\$\ on\ server.university.edu/users/username/m/BED_files/* #FILES=/home/user/Desktop #this works  for f in "${FILES}" do     echo $f done


Can you give a Django app a verbose name for use throughout the admin?

In the same way that you can give fields and models verbose names that appear in the Django admin, can you give an app a custom name?


In Harry Potter, Do Spells Travel in a Straight Line?

In the Harry Potter world, when a magical person casts a spell, sometimes they target a specific object, like when Harry has a wand only and needs his broom, he casts "Accio Firebolt" and his broom comes to him.  But a lot of the time people point their wands just in the direction of someone to cast a spell.  One example would be in a duel.  When they do this, are they casting a spell on a particular person or at that person?  It seems, from what I remember of the movies, that some spells travel in a straight line while others specifically target a person or object.  Do any spells travel in one direction, like a laser beam?  What kind of spells are directional (instead of focusing on a particular person or object)?  And can directional spells be deflected or blocked by something like a mirror or another physical object?  (By "directional," I could have said linear, but didn't want to start sounding mathematical or scientific.  In other words, do they travel in one direction, like a laser beam would, or will they change direction to hit the intended target?)


How to display parent category name and link for custom breadcrumb

I'm currently trying to figure out how to display a categories parent / grand parents name and url for a custom breadcrumb I'm working on.   I simply need to know how to show the parent categories information on a child category page.   For example  if parent blog  else if child  blog > parent_category  else if grandchild blog > grand_parent_category > parent_category


Is there an English term for "L'esprit de l'escalier"?

or l'esprit d'escalier (literally, staircase wit) is a French term that describes the predicament of thinking of the perfect comeback too late.  Merriam-Webster dictionary defines it as follows:     Definition:      A witty remark thought of too late, on the way home; the clever   comment you wish you had delivered      Example:      "When he bragged about sleeping like a baby, I should have added the   bit about waking up crying every two hours, but that's just esprit de   l'escalier. At the time I just nodded and said nothing."   Is there an English term for that?


Statistics of logstash memory consumption

I want to install it on a really small server and I want to see if it will be capable of running it with some dignity. So, does anyone have any memory and CPU consumption statistics of running logstash? I understand it depends a lot on the usage, but a reference on the usage could be helpful as well.


What values can kbd_backlight files take?

, and I have discovered the files kbd_backlight and kbd_backlight_timeout in /sys/devices/platform/sony-laptop. Both say '-1' when opened in gedit. What values can I change these text files to, what do these values mean, and where do you go to learn such information?  A comment below indicates .


While building things I want to see the overlays from other modes so I can make better decisions. Can I lock an overlay somehow?  For example: When building roads I want to see the natural resources overlay. When zoning I want to see the wind overlay


Constant receiving UDP packets from other local PC and firewall failed to block that specific IP address

Is it normal for a PC to keep sending out UDP packets to other local devices using random source ports? In my case, I'm using Wireshark to monitor my own Windows PC network and I found there is one IP address constantly sending a UDP packet to my PC port 2054. The source port is almost random as I hardly find any repeated port numbers. I checked the ports' activity but I do not know how to log it into some kind of text file. So I do not know what application is using port 2054. Netstat results do not show this port number. I also tried blocking IP address inbound and outbound but my PC is still receiving the packet. I configured this using Windows Defender Firewall with Advanced Security. Since I am using a public Wi-Fi network, I only block the inbound and outbound of IP address of the device sending me packets. Set block by Any program, Any local port and Any remote port. Any idea on this case?


Download El Capitan Installer now that Sierra is out

I have recently been having issues with my mac and want to do a clean install. I still have Yosemite and thought it’s a good time to upgrade the OS. However, I am wary of jumping directly to Sierra when it’s so fresh.  My specific circumstances:    Sierra could run on my computer (early 2015 Macbook Pro), but I would prefer to install El Capitan I have not previously downloaded the El Capitan installer   I realize apple provided  to install El Capitan from Snow Leopard. However, when I follow the links to the app store to get the install file, I am met with this message:     This version of OS X 10.11 cannot be installed on this computer.   Is there a way to download the El Capitan installer now that Sierra is out, for more modern computer? Searching El Capitan on the app store yields no results for the installer.


If I am at x arena and I am demoted to x arena then I go in the shop and buy a chest there can I get cards from the arena I was in

Do I get the cards from the highest arena I was in if I get a chest from the shop


I have this problem while running GNOME Maps ~$ gnome-maps  (org.gnome.Maps:10414): Gjs-WARNING **: 19:43:34.553: Some code called array.toString() on a Uint8Array instance. Previously this would have interpreted the bytes of the array as a string, but that is nonstandard. In the future this will return the bytes as comma-separated digits. For the time being, the old behavior has been preserved, but please fix your code anyway to explicitly call ByteArray.toString(array). (Note that array.toString() may have been called implicitly.) 0 <TOP LEVEL> ["resource:///org/gnome/Maps/js/osmTypes.js":32] 1 <TOP LEVEL> ["resource:///org/gnome/Maps/js/osmEditDialog.js":35] 2 <TOP LEVEL> ["resource:///org/gnome/Maps/js/osmEdit.js":25] 3 <TOP LEVEL> ["resource:///org/gnome/Maps/js/contextMenu.js":33] 4 <TOP LEVEL> ["resource:///org/gnome/Maps/js/mainWindow.js":33] 5 <TOP LEVEL> ["resource:///org/gnome/Maps/js/application.js":35] 6 <TOP LEVEL> ["resource:///org/gnome/Maps/js/main.js":43] 7 start() ["resource:///org/gnome/gjs/modules/package.js":209] 8 <TOP LEVEL> ["/usr/bin/gnome-maps":2]   (org.gnome.Maps:10414): Gdk-WARNING **: 19:43:36.525: Native Windows taller than 65535 pixels are not supported Gdk-Message: 19:43:36.574: Error 71 (Protocol error) dispatching to Wayland display.  19:43:36.574 (This message has changed many times) What's this?


Determine the general form of $u_0, u_1 ~\text{and} ~ u_2$ if a system of difference equations of the form  $$x_{n+1} = Ax_n  + Bu_n,$$  where:  $A = \begin{pmatrix}   3 & 2 & 2  \\   -1 & 0 & -1 \\    0 & 0 & 1   \end{pmatrix}$  and:  $B = \begin{pmatrix}   0 & 0  \\   0 & 1 \\   1 & 0   \end{pmatrix}$  is to be controlled for $x_0 = 0 ~ to ~ x_3 = [2, 1, 2]^T$ .  Show this target could have been achieved at  $x_2$   Solution So far I have caculated the controlability matrix to be $ C =\begin{pmatrix} 0&0&2&2&6&6\\ 0&1&-1&0&-3&-2\\ 1&0&1&0&1&0 \end{pmatrix}. $ Thus the system is controlable Now putting Cv=x3 i have the 3 equations $$ 2c+2d+6e+6f=2\\ b-c-3e-2f=1\\ c+e+f=2\\ $$ which i have then put into  row echleon form which i have found to be $$ a+c+e=2\\ b-c-3e-2f=1\\ c+d+3e+3f=1\\ $$  I proceeded to put these in terms of c,e and f to get the general terms  $a=2-r_1-r_2  ,  b=1+r_1+3r_2  , c=r_1   , d= 1-3r_3-3r_2-r_1  ,  e=r_2   ,  f=r_3,$  however when i substitue this back into my equation to check by doing  $$x_1=Ax_0+Bu_0, x_2=ax_1+Bu_1, x_3=Ax_2+Bu_2$$  i dont get $x_3=(2,1,2)^T$


Suppose $u$ and $v$ are continuous on $[a,b]$ and differentiable on $(a,b)$, and assume that for all $t\in(a,b)$, at least one of $u'(t)$ and $v'(t)$ is nonzero. Let $C$ be the curve given by $(u(t),v(t))$ for $t \in [a,b]$. Let $A = (u(a),v(a))$ and $B = (u(b),v(b))$ be the endpoints of the curve, and assume $A\ne B$. Show that there is some point $c \in (a,b)$ such that the tangent line to $C$ at $(u(c),v(c))$ is parallel to $\overline{AB}$.  I've been stuck on this question for a while now without any idea on how to get started. Any whatsoever help is appreciated!


I am unable to format my usb (4GB SanDisk). It says it's write protected.   Whenever I attach it to my PC, I get an alert about a virus infection (auto-run.inf + recycler) but no action is taken due to the write protection. How do I fix this?  In regedit I was unable to find HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Control\**StorageDevicePolicies**  I tried:   diskpart regedit formatting tools


Vertical Spacing for Table with Equations

So I have a table with equations, below. It's a bit crunched up and I want to add vertical space in the rows. I'm using booktabs package for heavy lifting.  \begin{table} \begin{tabular}{lcc}   \toprule   Name & Function & Derivative & \\   \midrule   Sigmoid & $\phi(x) = \ddfrac{1}{1+e^{-x}}$ &  $\phi'(x) = \phi(x)(1-\phi(x))$\\   TanH    & $\phi(x) = \ddfrac{2}{1+e^{-2x}} - 1$ & $\phi'(x) = 1-\phi(x)^2$ \\   ReLU    & $\phi(x) = \begin{cases}                             0 & x \leq 0 \\                             x & x > 0                           \end{cases} $                            & $\phi'(x) = \begin{cases}                                             0 & x \leq 0 \\                                             1 & x > 0                                            \end{cases} $ \\   Leaky ReLU & $\phi(x) = \begin{cases}                             \alpha x & x \leq 0 \\                             x & x > 0                           \end{cases} $                            & $\phi'(x) = \begin{cases}                                             \alpha & x \leq 0 \\                                             1 & x > 0                                            \end{cases} $ \\   \bottomrule \end{tabular} \caption{Activation functions and their derivatives.}  \label{tab:activation-functions} \end{table}   Here's the produced output.   I tried adding: \renewcommand{\arraystretch}{2} before I write the table but it messes up more. Here's the result.    So any idea how to make it look pretty with the equations? Looking for a relatively quick solution because this is the only table I'll have with equations. But open to anything that works.


Find all solutions to $x^2\equiv 1\pmod {91},\ 91 = 7\cdot 13$

I split this into $x^2\equiv 1\pmod {7}$ and $x^2\equiv 1\pmod {13}$.  For $x^2\equiv 1\pmod {7}$, i did: $$ (\pm1 )^2\equiv 1\pmod{7}$$ $$(\pm2 )^2\equiv 4\pmod{7}$$ $$(\pm3 )^2\equiv 2\pmod{7}$$ Which shows that the solutions to $x^2\equiv 1\pmod {7}$ are $\pm1$.  For $x^2\equiv 1\pmod {13}$, i did: $$ (\pm1 )^2\equiv 1\pmod{13}$$ $$(\pm2 )^2\equiv 4\pmod{13}$$ $$(\pm3 )^2\equiv 9\pmod{13}$$ $$ (\pm4 )^2\equiv 3\pmod{13}$$ $$(\pm5 )^2\equiv {-1}\pmod{13}$$ $$(\pm6 )^2\equiv 10\pmod{13}$$Which shows that the solutions to $x^2\equiv 1\pmod {13}$ are $\pm1$.  Thus, I concluded that the solutions to $x^2\equiv 1\pmod {91}$ must be $\pm1$. I thought that $\pm1$ were the only solutions, but apparently I am incorrect! How do I go about finding the other solutions to this congruence?


How to get in or out of an chipkaart-gated station with an e-ticket?

I recently purchased tickets for an international trip from France to the Netherlands. The itinerary included an international ticket to Rotterdam, and a local ticket to my final destination. I accessed the ticked via the NS International app on my phone.  Everything went fine until I arrived at my destination, Voorschoten station. This was not a large station, and I found a line of people scanning their OV Chipkaart to open a gate and exit. There didn't appear to be any way out without a card. I didn't have one, so I made a dash behind someone else when the next train arrived.  Now I need to make my return trip from the same station. Is there a legal, standard way to use my electronic ticket to open the OV card gate?


I am new to ubuntu and trying to install Cisco Packet Tracer (downloaded it from netacad.com 7.3.1 version). When I installed it, I got a .deb file and extracted it with GDebi package installer. After I successfully extracted it, but now I can't find the Packet Tracer app to start using it. I tried to install with the default installer "Software installer" but it gave me an error "exit status 1". Please help me with this! Thank you in advance!


if find ext then cp parent dir else echo not found

So far I have come up with this.  if ls -1 ~/Downloads/*.mkv >/dev/null 2>&1 then         echo 1 else         echo 0 fi   But what I would like to do is to then copy the parent dir of the found file to another location.  I have a feeling that I should just use the find command.


Is "To [Adverb] [Infinitive]" Still a Valid Infinitive form?

This question is specifically for I work to nearly get success, but the question is also asking in general.  I shouldn't use nearly to get because that would detract from from my purpose of working.


I want to calculate the RMSE of two grids based on their z-value: a calculated and a reference grid. I do have the statistics: Cells, Range, Min, Max, Sum, Mean, Variance, St.dev.  How could I solve the problem using e.g. ArcGIS or SAGA Gis?


why dna polymerase 3 requires a primer for replication

Why DNA polymerase 3 needs a primer to star replication.And whats happens when there is no AUG sequence on entire DNA.


Are there any real ways at least in theory to manipulate quantum vacuum for propulsion or energy generation?

US Navy was granted a patent for polarised vacuum propulsion using microwave radiation and high em energy resonating cavities. It seems to be a polarasible vacuum theory analog of alcubierre drive.   How far fetched are such ideas and is there any other way to pertrube vacuum modes like Casmir effect that could have potential application?  The point is why would rapidly spinning charges produces disturbances in vacuum as specified in the article?


Is there any way to restore the distribution name?

I installed Ubuntu on my desktop years ago, and decided to add the BunsenLabs repository and install Bunsen desktop there. However there is one little thing: the package also replace the /etc/os-release. My question is how do I restore my os-release and also the lsb-release(which was also modified) back to it's original?  Original OS info: Ubuntu 16.04 64-bit Xenial Xerus  New OS info: BunsenLabs GNU/Linux 8.6 (Hydrogen)  My current os-release  ANSI_COLOR="0;34" BUG_REPORT_URL="https://github.com/BunsenLabs" HOME_URL="https://bunsenlabs.org" ID=bunsenlabs ID_LIKE="debian" NAME="BunsenLabs GNU/Linux" PRETTY_NAME="BunsenLabs GNU/Linux 8.6 (Hydrogen)" SUPPORT_URL="https://forums.bunsenlabs.org" VERSION="8.6 (Hydrogen)" VERSION_ID="8.6"   My current lsb-release  DISTRIB_ID="BunsenLabs" DISTRIB_DESCRIPTION="BunsenLabs GNU/Linux 8.6 (Hydrogen)" DISTRIB_RELEASE="8.6" DISTRIB_CODENAME="bunsen-hydrogen"   Output of apt-cache policy base-files  base-files:   Installed: 9.4ubuntu4.3   Candidate: 9.4ubuntu4.3   Version table:  *** 9.4ubuntu4.3 500         500 http://opensource.xtdv.net/ubuntu xenial-updates/main amd64 Packages         100 /var/lib/dpkg/status      9.4ubuntu4 500         500 http://opensource.xtdv.net/ubuntu xenial/main amd64 Packages


Does a 4GB + 8 GB DIMM outperform a single 8GB DIMM?

I observed a Windows 10 x64 + OS build consuming 3 GB of the installed 4 GB RAM when idle (before I ran much of anything else).    When I initially opened the case, I thought I only saw one slot so I ordered one 8 GB DIMM figuring doubling down would solve my problem. After I removed the Fan-shroud as I went to replace the DIMM I saw that there was actually two slots so I left the already installed DIMM in and also installed the new one. and Windows 10 corroborated 11.9 GB in Task Manager.    Now, I have read that I might get better performance if I had a pair of identical DIMMs installed so it would have been most cost effective just to buy a second 4 GB..  However, correct me if I am wrong but 12 GB of RAM still beats merely using the one 8 GB DIMM as 12 GB at single dimm speeds is still way faster than having to swap/page out to disk for additional virtual memory, right?


JS: How to add negative numbers in javascript

supposing I have variable ex1 equal to -20 and variable ex2 equal to 50. I try to add it in javascript as alert(ex1+ex2); but it alerts -20+50. I'm really confused with this. THanks for the help, even though it might be a really silly question.


Prove the following inequalities,$$ (n!)^2 ≤ n^n(n)! <(2n)!$$   My attempt  I proved one of the inequality using mathematical induction.  To prove -   $ (n!)^2 ≤ n^n(n)!$  For $ n = 1 $,  LHS $≤$ RHS.  Let us assume that for $ n = k$ the inequality is true.  $\therefore$ $(k!)^2 ≤ k^k(k)!$ –––––> [1]  Now let us prove that $ ((k+1)!)^2 ≤ (k+1)^{(k+1)}(k+1)!$ for $ n = k+1$.  Taking LHS,  $=>(k+1)^2(k!)^2 $  $≤(k+1)^2k^k(k)!$     –––––>             [From [1]]  $≤(k+1)(k)^k(k+1)!$  From above we can deduce that,  $LHS≤RHS$.  How to prove the second inequality given in the question?


If $abc(a+b+c)=3$, prove that $(a+b)(b+c)(c+a)\geq 8$


I'm currently doing a research on generating functions, but I have only found few books on this topic. Can anyone provide references (if possible, trying to assess the level of math competence required) on generating functions?   Ideally, what is the context of the referenced book and further details to help to put the book itself in context would be much appreciated.


How to display an array in reverse order in objective C

I want to display data in UITableView in reverse order. I manage to do it with little effort but can any one provide a better way to do it. Thanks in advance.


Let $f:(-1,1) \rightarrow \mathbb{R}$ be smooth on $(-1,1)$, $f(0) = 1$. Find $f(x)$.

Let $f:(-1,1) \rightarrow \mathbb{R}$ be infinitely differentiable on $(-1,1)$, $f(0)=1$ and   $|f^{(n)}(x)| \le n!$ for every $x\in(-1,1)$ and for every $n\in \mathbb{N} $  $f'(\frac{1}{m+1})=0$ for every $m \in \mathbb{N}$  Determine the value of $f(x)$ for every $x\in(-1,1)$.  I guess $f(x)=1$ for every $x\in(-1,1)$.


Is it possible to set a global Blender preference so that all keyframed motion is linear by default?

I've been working on some animations recently, and I've noticed that I'm having poor luck with certain things, namely the fact that I don't really use Blender's graph editor very well.  One of the major issues that I have is pretty widespread among 3D graphics programs; when I create an animated object, it defaults to using a curved graph instead of a linear graph, which means that the most movement is at the middle of the animation, and stuff just practically stops near the beginning or the end. While this helps with organic camera movements or such, it's also not what I usually want. Can I set animation curves to default to linear?


How do I completely delete all files of pre-installed apps in Windows 10?

How do I completely delete all the files for pre-installed applications (e.g. CandyCrush) in Windows 10?   e.g. I want to remove the directory for CandyCrush C:\Program Files\WindowsApps\king.com.CandyCrushSaga_1.1380.6.0_x86__kgqvnymyfvs32 but Windows won't let me.   It says SYSTEM isn't giving me permission.  I have tried running a Windows PowerShell as Administrator and I tried running the command:  Remove-AppxPackage king.com.CandyCrushSaga_1.540.1.0_x86__khqwnzmzfus32   But I get "Deployment failed"  Background: I want to get rid of all the stupid .JPG files associated with CandytCrush. I deeply resent the high-handed approach of Microsoft giving us all this bloatware that none of us asked for and also making it so hard to get rid of. It is wasting the space on my hard disk. And I don't want to see those .JPGs cluttering up my search results when I use Everything Search.   EDIT01: CandyCrush does not appear to be installed. But I want to delete the installation files(!)


Compact Metric Spaces and Separability of $C(X,\mathbb{R})$

Let $(X,d)$ be a compact metric space. Show that $C(X,\mathbb{R})$ is a separable metric space (space of continuous functions from $X$ to $\mathbb{R}$).    I first showed that if $(X,d)$ is compact, then it must be separable, so we have a dense subset $\{x_{1},x_{2},...\}$ which is countable of $X$. Then, I'm not so sure on how to move forward. I was thinking of using the Stone Weierstrass Theorem for the set of functions:  $F=\{1,f_{1},f_{2},...\}$  Where $f_{n}(x)=d(x,x_{n})$ for $x \in X$. Then, this implies that the above set is dense in $C(X,\mathbb{R})$ and countable, so $C(X,\mathbb{R})$ is separable if $F$ is a unital separating subalgebra.  Clearly $F$ is unital, but I'm not sure on how to show it is separating and a subalgebra of $C(X,\mathbb{R})$ (it is a subset of the former set since the distance function is continuous). How would one proceed with this step?  Thank you for your help.


Is there a mechanism for gaining proficiencies or skill improvements in play?

So if in play, my character spends a lot of time trying to learn a new skill, or a new language, or learn how to use a tool, is there a mechanic for adding that on the sheet? Or does 5E streamline away all such customization with blanket modifiers? I haven't found anything that reflects the ability to grow or develop in a focused way, just blanket improvements as stats increase, proficiency bonus goes up, levels rise, or as multiclassing happens?  The core question is: Is there any focused spot improvement for characters in D&D 5e, or is it all blanket modifier increases?  Most other games have this kind of thing. Take Improv classes? Improve your Performance skills. Go running a lot? Improve your Athletics skills. Practice at the gun range? Improve your firearms skill, all at the cost of some earned resource like XP. D&D seems like characters can sit on the couch between combats and improve as much as other characters who actively work on their skillsets.


I'm trying to model a tower for a castle with shingles that wrap around it evenly. I keep encountering a problem where the faces of my unwrapped mesh will triangulate themselves and cause unwanted warping in my textures. Example: Before scaling  Afer scaling  I've tried adding a triangulation modifier, but that only reverses the direction of the warping. Does anybody have a workaround for this? I would deeply appreciate any help or explanation!


Making polygons from lines (polyline to polygon) in QGIS?

I'm trying to remember how to do polygons from lines, I remember it was a very simple procedure. have a layer of lines intersecting or touching, use the tool and voila, qgis took the lines layer  and created a layer of polygons  with the spaces between the lines. very simple tool with Polygonize here   However today I try, I can not get a good result. For this exercise I made a layer of lines with different shapes as you can see below.    A= it is a single line that does not close (in the table object id 0)  B= a square with lines in, that joined to form a single object (in table object id 1)  C= a triangle made of different lines that are touching, for this I used the snapping tool (in the table objects id 2,3,4)  This is the result of: vectorial-> Geometry Tools -> lines to polygon    As observed the tool close the object A to forms a good polygon (table object id 0), object B is formed with errors and under a single polygon (table object id 1) and the C object (the triangle) is completely ignored  This is the result of: processing-> vectorial geometry -> lines to polygons    As observed the tool close the object A to forms a good polygon (table object id 0), object B is formed with errors and under a single polygon (table object id 1) and the C object (the triangle) is completely ignored  This is the result of processing-> vectorial geometry -> poligonize    the poligonize tool gives a different result, only a general polygon shape without taking into account the interior lines of the B object and the table is filled with the area and perimeter of this.  As you can see the results are not what I expected, as I recall it was very easy to make and very good results were obtained and usually had to make small adjustments to the polygons.  and I read this answer from 2014:     with a very similar problem where the possibility that the tool is BROKEN , however I dont know if this will be the case or I doing something wrong with the tool  QGIS: 2.14.3  Installer: standalone QGIS-OSGeo4W-2.14.3-1-Setup-x86_64 OS: Windows 10 64bits (1115 10586.318)


Conditional formatting rule to apply to across row

I have set a conditional rule so that if a specific cell equals "y" then the cell background is changed to green.  Is there a way to apply this rule so that it will change the background colour for the row the cell is on?


Use Map instead of For loop in my Apex Trigger

I'm new to coding and I need help in modifying the apex trigger below to the correct one. Can you also help me in creating a test class for this? Thank you so much! trigger UpdateLadderedFields on OpportunityLineItem (before insert, before update)  {    for (OpportunityLineItem oli: Trigger.new)    {       string OppprodSKUID;       OppprodSKUID = oli.SKU_ID__c.substring(0,15);              If(oli.Q4_Laddered__c != null)       {          List<Ladders_RDP__c> lr = [SELECT ID, SKU_ID__c, Total_Laddered__c, OE_Qtr__c                                        FROM Ladders_RDP__c WHERE SKU_ID__c = :OppprodSKUID];          for(Ladders_RDP__c l: lr)          {              If(l.OE_Qtr__c.contains('Q4')) {                  oli.Q4_Laddered__c = l.Total_Laddered__c;}              else If(l.OE_Qtr__c.contains('Q3')){                  oli.Q3_Laddered__c = l.Total_Laddered__c;}              else If(l.OE_Qtr__c.contains('Q2')){                  oli.Q2_Laddered__c = l.Total_Laddered__c;}              else IF(l.OE_Qtr__c.contains('Q1')){                  oli.Q1_Laddered__c = l.Total_Laddered__c;}          }       }    } }


Shrinkwrap doesn't warp object around a target

I have problem with the Shrinkwrap modifier when I'm trying to warp an object around a target object. In most cases Shrinkwrap places an object to warp inside a target object instead of warping. Please see attached examples.   There I tried to warp the black pattern around the cylinder. You can see the result. If I try to warp a Plane around a cylinder, it is just getting placed into the cylinder. I am a really new in Blender. I spent a while trying to find solution but nothing. Here is the source file:


stream does not exist in the current context using try

I am attempting to read some data off of a server for a built in update function and I am getting a compile time error. Is there any way I can get around this? I need this to check if the user has a working internet connection and if not skip the update check. (Unless there are more reliable ways in .Net 4.5)  WebClient client = new WebClient(); try  {     Stream stream = client.OpenRead("http://repo.itechy21.com/updatematerial.txt");  } catch (Exception ex) { MessageBox.Show(ex.Message); }  StreamReader reader = new StreamReader(stream); // <-- error here String content = reader.ReadLine();   Error:     stream does not exist in the current context


Can I exchange 'not better' and 'no better'?

You are not better than me, or You are no better than me. Do they mean the same? If yes, what is their difference?


Inspired by this question.   Magnetic flux of a magnet cannot enter a perfect conductor.  Again moving electrons ,protons produce magnetic field(and thus magnetic flux). So what about the magnetic flux of the charged particles inside the perfect conductor(those protons and electrons which make the perfect conductor)? can magnetic field exist inside the conductor and just cannot enter from outside? If the question is not clear please inform me.


Need a theoretical textbook for calculus, proof based

The course descriptions is : A theoretical course in calculus; emphasizing proofs and techniques. Trigonometric identities. Limits and continuity; least upper bounds, intermediate and extreme value theorems. Derivatives, mean value and inverse function theorems. Integrals; fundamental theorem; elementary transcendental functions. Techniques of integration. Taylor's theorem; sequences and series; uniform convergence and power series.  This course is using Spivak's calculus, but I'm also looking for another proof based book accompany with Spivak, thx


Secure and reliable way to check external USB drive health?

I've seen two external drives die without any "notice", lack of speed, performance, nothing, out of the blue, in the past 2 years.  For the current ext. usb drive I have, what would be the most secure and reliable way to check the drive health?


Is there a specific order to the Infinity Stones?

In Avengers: Infinity War,      Thanos obtains the Power Stone, Space Stone, Reality Stone, Soul Stone, Time Stone and Mind Stone in that order.   Each object seems to go into the next notch with no rhyme or reason.   Is there an order to the acquisition or is it a matter of which one(s) become available?      It bears mentioning that the Mind Stone appears larger in the Infinity Gauntlet but appears the same size as the other stones before it's placed.


Can someone provide an explanation of the intuition behind De Rham Cohomology, and what exactly one is trying to achieve?  Assuming the audience knows of manifolds, tangent spaces, cotagent spaces, and differential forms, what is a proper and insightful reasoning to give of the set-up of De Rham Cohomology and how it came to be?  In essence, what is the elevator pitch? And if you have a moment to expand on said pitch, that would also be quite appreciated.  I know, for example, that there's some game going on with exact and closed forms that relates to the existence of holes in a manifold, but would be quite happy to hear a further explanation.


EDIT2: I just looked up the oath online, and it seems the confusion has been caused by a loss in translation. The wording in my copy did not speak of "granting resistance to damage from spells" but it said "taking half damage from spells" which is pretty close to the wording if you succeed in your saving throw against a fireball. So this question is indeed a duplicate and can be closed and forgotten.  I know that stacking the same resistance accomplishes nothing. But what happens when different resistances affect the same damage event?  Let's say the random evil warlock Doomdoom shoots a fireball at the bear totem barbarian Fuzzyface who is raging through his minions. But Fuzzyface is standing right next to Evl-b-gon who is a paladin that took the oath of the ancients.  Bear totem halves damage(=grants resistance) from pretty much all damage types, including fire. Which a fireball undoubtedly would deal. The oath of the ancients aura does the same for spell damage. The fireball is without a doubt also a spell.    So, how much damage does Fuzzyface take? RAW preferred, but RAI with an argument about why it is intended that way would be appreaciated as well.  EDIT: Apparently this is taken as a duplicate by a lot of people. While pretty similar, I do not think those questions ask the same thing.  There is no damage type "spell" in the game. The barbarian has resistance to the damage type, but the Paladin halves damage from a source. Solving this with PHB 197 by accepting "spell" as a damagetype would effectively remove the benefit of the bear, since the damage types he gains resistances to will be almost always be caused by a spell.


Why exactly can't a single resistor be used for many parallel LEDs?

Why can't you use a single resistor for a number of LEDs in parallel instead of one each?


Can I use z-score for data that doesn't belong to a normal distribution but passes some normality tests?


what does each runlevel number stand for

Cause Ubuntu uses Upstart instead of init, there is some different from Red Hat. But How can I get the list of each runlevel number standing for, such as init 0 means shutdown. man init can't show the list. So which command or man page cant print the list. Thx!


How to remove last part of a path in bash?

Possible Duplicate:          Is there a short-cut in bash that lets you delete the last part of a path?  Example: /usr/local/bin should become /usr/local/ (or /usr/local)  I know of Ctrl+w but it deletes the complete last word and I'd like to retain that functionality, too.


A little script of mine on a mounted windows partition refuses to be executed directly (shebang is #!/bin/bash), but interestingly calling it with bash/sh works. The script is simply a collection of grep and sed commands.  The drive is mounted with full rights:  defaults,windows_names,rw,auto,user   Hence, for the the file got   -rwxrwxrwx 1 root root   for the file.  What's going on there?


How to find and replace a string given the prefix and the suffix of a string in Javascript?

Given :   A string e.g.   Username="don" Password="somethingcalledpassword" Url="someurl"  Prefix of the search-string Password=" Suffix of the search-String suffix="   Aim: Search and replace all the substrings of the main string that start with the prefix and end with the suffix (first occurrence).  E.g.  var str = "Username=\"don\" Password=\"somethingcalledpassword\" Url=\"someurl\"";   //replace somethingcalledpassword with new password.


Smoke Simulation does not appear in Eevee viewport

I was learning how to do smoke simulations today, but when I applied object -> quick smoke, and pressed play, no smoke could be seen coming out. I then tried baking the simulation, and it finally showed up, but only for a few frames. Now I want to remove the bake, and the manual tells me there is a button in the cache settings of the fluid simulation, called "free bake" which is not there. If anyone could please tell me how I could:   Remove the bake of the smoke simulation and  see the smoke in the Eevee realtime viewport.


Is there a way to change variable in an array of objects?

I have a object variable representing a vector: let pos = {x: 0, y: 0}. Then i have an array to put those vectors. If i change the x and y from the object pos every element in the array changes to the recent value. Why is this? let pos = {x: 0, y: 0}; let arr = []; arr.push(pos); // arr: 0: {x:0 , y: 0} pos.x = 5; pos.y = 9; arr.push(pos); // arr: 0: {x:5 , y: 9} 1: {x:5 , y: 9}  And i want arr: 0: {x:0 , y: 0} 1: {x:5 , y: 9}


Soaked chick peas (overnight) smell like sour milk

I put chickpeas in cold water last night and let them soak overnight, at room temperature, about 14-16 hours total. Today when I took the cover off, there was white foam on top of the water. I dumped the beans in a colander and got a whiff of a really strong, foul odor, like sour milk or a strong cheese. I know beans can sometimes smell funky, but this was something else.  The beans themselves looked fine and normal, but it took a lot of rinsing to get rid of that bad smell. Is this normal? I rarely soak my beans and I don't think I've ever soaked chick peas, so I haven't encountered this before.  This might be important: I did not rinse them before soaking. I just put them in a pot, filled it with cold water, and set it on the counter to soak. Could that be the reason they smelled so bad after the soak? Are they OK to eat? Or should I throw them out and start over with different chick peas? Thanks.


When i'm in Insert mode at vim, and press Shift+Insert to paste  my code to my file, vim disassembles my indentation , Such as:    Question: How can i solve this problem?


So I am demanded to offer a continuous bijection between two homeomorphic spaces that is not a homeomorphism. As a beginner for topology, I am completely stuck. Can anyone offer me a hint?


Me and my group just finished the essentials red box, and are looking at moving to the full 4e game. I'm doing some preliminary reading of the books and one thing is confusing me a little.  The characters from the red box are up to level 2 now, and I don't know where I'd find the information on what EXP they level up at. Furthering that, whilst I've found (in the PHB) how many hit points a class would gain at a certain level, I can't find where it says what amount should be added to other attributes, like perception, dexterity, etc.  Many on forums say move to Heroes of Forgotten Kingdoms, but the same character classes (Cleric, Warrior, etc.) don't reappear in that book - it just adds some new ones.  Which book would I find this information in? Or am I just missing it?  TL;DR: Where do I find attribute increases for classes by level & where do I find leveling up EXP?  Thanks in advance, Joe


Simple present tense VS present perfect tense

What is the difference between these two sentences?  a) Amount has been paid to you as basic salary. b) Amount is paid to you as basic salary.  Further to my query  A) He is appointed as Deputy Manager. B) He has been appointed as deputy Manager.


How to find $\lim_{n \to \infty}|\left( 1+\frac{z}{n}\right)^{n}|$?

This is a step on the way to proving  $$ \lim_{n \to \infty}\left(1 + \frac{z}{n}\right)^{n} = e^{z}.$$  I'm looking for an answer without  1) a summation or  2) a logarithmic function.   So far, I have that  $$ \lim_{n \to \infty} |z_{n}| = \lim_{n \to \infty} \vert\left(1+\frac{z}{n}\right)^{n}\vert = \lim_{n \to \infty} \left(\sqrt{\left(1+\frac{x}{n}\right)^{2} +\left( \frac{y}{n}\right)^{2} }\right)^{n} = \lim_{n \to \infty}\left(\left( 1+\frac{x}{n}\right)^{2} + \left(\frac{y}{n} \right)^{2} \right)^{n/2} = \lim_{n \to \infty} \left( 1 + \frac{2x}{n} + \left(\frac{x}{n}\right)^{2} + \left( \frac{y}{n}\right)^{2}\right)^{n/2}. $$ Now, I was given the following hint, and I would like to use it, but I don't know how:     Hint: Argue that you can discard terms with $1/n^{2}$; for example, by showing that the limit $\displaystyle \lim_{n \to \infty} \frac{\left(\left( 1 + \frac{x}{n}\right)^{2} + \left(\frac{y}{n}\right)^{2}\right)^{n/2}}{\left(1 + \frac{2x}{n}\right)^{n/2}} = 1$.   How would I show this ($\epsilon$-definition?), and how would it help me here with what I've already done?


Why doesn't SQL Server CE support varchar?

I was creating a table in SQL Server CE and realized it doesn't support varchar.   Looking this up, I found that "non-Unicode text columns (varchar, char, text) and smallmoney are not supported; although nvarchar, nchar, ntext, and money are supported" as .  Is this true? Why is this, exactly? It would seem that a compact database would support data types that take less bytes to store...I'm assuming it takes more space to save the Unicode characters.   What is the reasoning behind this?


Estimating the arrival rate for a Poissonian process

I have run into some difficulty in understanding how poissonian rates are estimated from experimental data.  Consider the following scenario. I stand at the side of the road and start counting the number of cars driving past at time $t=0$. $N$ cars pass me by at times $T_{1}, T_{2}, ..., T_{N}$ where $T_{i} < T_{i+1}$. I stop counting the cars at time $T_{stop}$.  I see a number of different methods for estimating the poissonian rate for this situation:   I divide the total time spent acquiring the data by the number of counts: $\lambda = N/T_{stop}$ I consider the moment I count the first car as the "meaningful" start of this experiment and don't include the first car in the rate estimation: $\lambda = (N-1)/(T_{stop}-T_{1})$ Building on the assumption in 2., I consider the time the final car passes as the "meaningful" end time for the experiment: $\lambda = (N-2)/(T_{N}-T_{1})$   Whilst a poissonian process is memoryless (an argument for method 1.), I believe that time intervals between consecutive poissonian events should be  exponentially distributed. If this is the case, then isn't the definition of the time interval as $[0, T_{stop}]$ rather arbitrary? I don't think the intervals $T_{1}$ and $T_{stop}-T_{N}$ are exponential - they are completely defined by when I start and stop my stop watch, not by the process I am trying to measure.  What is the correct estimate for this process's arrival rate?


Is it ok to leave a slow cooker unattended?

Is it safe to leave a slow cooker (Crock-Pot) on unattended (for example, while you're at work and no one is home)? Or is that a fire hazard?


How to control a direction of a one way road when upgrading from two way road?

I have a two way road which I want to upgrade to a one way road, how can I choose the direction?  This is a specific question about change the direction of already exiting one way road.


Can we express a trigonometric function for the product of two angles as a function of trigonometric functions of its factors?  For example: Is there a formula for $\sin(xy)$ as a function of $\sin x$ and $\sin y$ or other trigonometric functions of $x$ and $y$.


How does return (string.splice(" ").join"") in a function differ from string.splice(" ").join("") and then return string?

I try to understand a conceptual difference between:  var x = '8aaaaa dddd r     '  function noSpace(x){   return (x.split(" ").join("")); } noSpace(x) //Results in "8aaaaaddddr"   AND  var x = '8aaaaa dddd r     '  function noSpace(x){   x.split(" ").join("");   return x; }  noSpace(x) //Results in "8aaaaa dddd r     "   Why does the second version don't work as the first one?


Is this a valid way to factorize polynomials?

So in the examples of my math textbook there is the problem of factoring polynomials:  Factor $-3x^2 -2xy +8y^2 +11x -8y -6$   And the way they solved it is as follows: Solution:  If we only take terms with $x$ and constants we get $-3x^2 + 11x - 6$  $-3x^2 + 11x - 6  \equiv (-3x +2)(x-3)$ or $(3x - 2)(-x +3) ......(1)$ If we only take terms with $y$ and constants we get $8y^2 - 8y - 6$  $8y^2 - 8y - 6 \equiv (4y + 2)(2y -3)$ or $(-4y - 2)(-2y +3) ......(2)$ We will get the factors of the given polynomial if we combine the factors of $(1)$ and $(2)$ , but the constants $+2,-3$ or $-2,+3$ have to be the same in both equation just like the coefficient of $x$ and $y$. $\therefore$ The factors are $(-3x + 4y + 2)(x +2y -3)$ or $(3x - 4y -2)(-x -2y +3)$ We can test if the calculated factors are valid by matching the coefficient of $xy$  $-3.2 + 4.1 = -2$ or $3.(-2) - 4.(-1) = -2$. (QED) I have read it many times but still couldn't get how this method even works.So I have some questions:  (1) Is this a valid way to factorize polynomials ?  (2) Is there any reference where this method is used ?


If every divergent curve has unbounded lenght then the manifold is complete.

A divergent curve on a noncompact Riemannian manifold $M$ is a curve $\alpha:[0,\infty)\to M$ where given any compact $K\subset M$ we have there exists $t_{0}$ such that $\alpha(t) \notin K$ for $t>t_{0}$. Subsequently the length is defined in the usual sense for curves on a manifold:  $L(\alpha)=\int_{0}^{\infty} ||\alpha′(t)||dt$.  The problem is  Prove that a noncompact manifold is complete if and only if every divergent curve has unbounded (i.e. infinite) length.  I proved that if M is Complete ⟹ Every divergent curve has unbounded length. But i don't know how i prove the reciprocal.  Thanks


What type of Collider should I add to a LineRenderer?

I am currently building a game where I need to generate some wires (as Bézier curves) using LineRenderer. After changing the width of each line  lineRenderer.SetWidth (0.15f, 0.15f);   I am attaching an EdgeCollider2D to the same game object (specifying the same points used in generating the Bézier curve). This seems to work. However, I would like to be able to know if the Mouse Pointer is at any time over the EdgeCollider2D (something similar to the popular Fruit Ninja game). I'm using Raycast as follows:  void CastRay() {     Ray ray = Camera.main.ScreenPointToRay (Input.mousePosition);     RaycastHit2D hit = Physics2D.Raycast (ray.origin, ray.direction, Mathf.Infinity);      if (hit) {         Debug.Log (hit.collider.gameObject.name);     } }   I'm calling the CastRay method inside the Update method. Because EdgeCollider2D does not have width (as expected), the log message is never produced.  Do I need to use a different type of Collider? Do I need to call CastRay somewhere else?


Is there a website that lets you shop for hotels with taxes and fees included in search results?

Every time I book a hotel online, the price increases by 25% in "taxes and fees" at checkout, compared to the price featured in search results.  This does not occur when booking flights (I actually think there's a regulation against it for flights).  Is there a website that lets you compare the ACTUAL price of hotels with taxes and fees included, and also lets you book?


$\left|x_{n+1} - x_n\right| < C\left|x_n - x_{n-1}\right|$ prove this is Cauchy

Suppose that for the sequence $\{x_n\}$ there exists $0 < C < 1$ such that  $$\left|x_{n+1} - x_n\right| < C\cdot \left|x_n - x_{n-1}\right|.$$  Prove that ${x_n}$ is Cauchy.


Searching from Database having billion records, which database should i use

We are having 1 billion phone numbers and we have to search them against numbers which we send for promotion to filter out which are not promotional registered. That is we have lets say 1 million record which we need to search against 1 billion database records.   What would be best and optimized way to search these records and which database should we use?  We are currently using SQL Server and in a batch of 10000 searches it gives result in 20 minutes.  We want real time searching.


A number is divisible by $11$, when the difference between the sum of the digits in the odd positions counting from the left (the first, third, ....) and the sum of the remaining digits is either 0 or divisible by 11. Why is that?


I'm getting a new pc without an OS, so can I download Ubuntu onto a CD on a separate laptop, then put that CD into the disk drive on the new PC?

I'm getting a new pc without an OS, and I'm wondering if I could download Ubuntu onto a CD, on a separate laptop, then put that CD into the disk drive on the new PC? Can I do that? Thanks.


Confusion of limit when doing in two ways.

This limit question is an eye opener for me.where is the problem in attachment .guide


Relations question - need clarification to understand better

Please see the question which shows you two questions and two answers. Are the 2 answers contradicting each other? Can someone clarify please.    Question 1 Answer says "DOES NOT IMPLY THAT ALL X and Y...." but Question 4 answers says "IMPLIES FOR ALL X and Y