I am novice to Lyx. I have used standard report for the document class. I created a gather equation. The equation numbering includes the number of the chapter which I do not want. I just want to number my equations 1,2,3 .........
I have an equation, such as:  \documentclass{report}  \begin{document}  \chapter{hello} \begin{equation} x=1 \end{equation}  \end{document}   And the equation appears as "x=1 (1.1)".    What I want is "x=1 (1)" ignoring the chapter number.  How do I get that?  Thank you.
Has anyone had any success using twitters typeahead.js within visualforce pages? I am trying to get  to work within salesforce visualforce pages.  I have a basic vf page from  example, but it does not respopnd, I suspect there may be some "unknown" workaround needed? Does anyone know?  &lt;apex:page standardController="Contact" showHeader="false" sidebar="false" docType="html-5.0"  standardStylesheets="false"&gt;  &lt;script src="https://ajax.googleapis.com/ajax/libs/jquery/1.10.2/jquery.min.js"&gt;&lt;/script&gt; &lt;script src="http://twitter.github.io/typeahead.js/releases/latest/typeahead.bundle.js"&gt;&lt;/script&gt;      &lt;div id="the-basics"&gt;   &lt;input class="typeahead" type="text" placeholder="States of USA"/&gt; &lt;/div&gt;  &lt;script&gt;     var substringMatcher = function(strs) {       return function findMatches(q, cb) {         var matches, substrRegex;          // an array that will be populated with substring matches         matches = [];          // regex used to determine if a string contains the substring `q`         substrRegex = new RegExp(q, 'i');          // iterate through the pool of strings and for any string that         // contains the substring `q`, add it to the `matches` array         $.each(strs, function(i, str) {           if (substrRegex.test(str)) {             // the typeahead jQuery plugin expects suggestions to a             // JavaScript object, refer to typeahead docs for more info             matches.push({ value: str });           }         });          cb(matches);       };     };      var states = ['Alabama', 'Alaska', 'Arizona', 'Arkansas', 'California',       'Colorado', 'Connecticut', 'Delaware', 'Florida', 'Georgia', 'Hawaii',       'Idaho', 'Illinois', 'Indiana', 'Iowa', 'Kansas', 'Kentucky', 'Louisiana',       'Maine', 'Maryland', 'Massachusetts', 'Michigan', 'Minnesota',       'Mississippi', 'Missouri', 'Montana', 'Nebraska', 'Nevada', 'New Hampshire',       'New Jersey', 'New Mexico', 'New York', 'North Carolina', 'North Dakota',       'Ohio', 'Oklahoma', 'Oregon', 'Pennsylvania', 'Rhode Island',       'South Carolina', 'South Dakota', 'Tennessee', 'Texas', 'Utah', 'Vermont',       'Virginia', 'Washington', 'West Virginia', 'Wisconsin', 'Wyoming'     ];      $('#the-basics .typeahead').typeahead({       hint: true,       highlight: true,       minLength: 1     },     {       name: 'states',       displayKey: 'value',       source: substringMatcher(states)     }); &lt;/script&gt; Can I see why a package is installed? For a specific package, can I find out why it is installed?  So, can I see or it's manually installed, or that it is installed as a dependency of another package? Or that it is installed as part of the distro? How to prove that there are finitely many $n$ such that $f(1+1/n) = \frac{1}{n+1}$? Let $f : \mathbb{C} \to \mathbb{C}$ be analytical. How does one prove that there are finitely many positive $n$ such that $f(1+1/n) = \frac{1}{n+1}$ ? A hint is given: think of the expression $\frac{z-1}{z}$.  I think this is a pretty hard homework assignment. Here's what I tried so far: Let $g(z) = \frac{z-1}{z} $ . Then $g(1 + 1/n) = \frac{1 + 1/n - 1}{ 1 + 1/n} = \frac{1/n}{1+1/n} = \frac{1}{n+1} $. So the given hint is probably indeed useful, but I'm not sure yet how.   Another thing I tried to use to obtain the solution was the given fact that $f$ is analytical. Let $f = g$. Then $f(z) = f(x+iy) = \frac{ x + iy - 1}{x+iy} = \frac{x+iy-1}{x+iy} \cdot \frac{x-iy}{x-iy} = \frac{x^2 - 2 i x y + y^2 + iy}{x^2 + y^2} = 1 + i \frac{y(1-2x)}{x^2 + y^2} $ . Now I have written $f$ in the form $ f = u + i v$, with $u,v$ being real-valued functions. So now we can use the Cauchy-Riemann Integral formulas: $ \frac{d}{dx} 1 = 0 = \frac{d}{dy} \frac{ y(1-2x) }{x^2+y^2} \implies \frac{y(1-2x)}{x^2+y^2} = c $. The other formula yields a similar result.   But now what? I still have no idea how to prove that there are finitely many positive $n$ such that the aforementioned equality holds. Should I use any of the results I already obtained? If so, how? If not, do you know how to prove this? Animating eye texture in a head mesh I'm trying to animate a mesh with different eye textures but it's not working.     This is a texture made by me to animate but I still couldn't figure out how to do it. I've seen tutorials on the internet but they don't work to me. I'm working on a large c++ system that is has been in development for a few years now. As part of an effort to improve the quality of the existing code we engaged on a large long-term refactoring project.  Do you know a good tool that can help me write unit tests in C++? Maybe something similar to Junit or Nunit?  Can anyone give some good advice on the methodology of writing unit tests for modules that were written without unit testing in mind? Fake News Detection problem I would like to work on a project for Fake News Detection especially for Indians news which are in different languages and different formats.   Fake news as image with no or very less text Fake news on a blog site Fake news as Tweets Fake news in Hindi Fake news in the watsapp group and shared across.   Need your help on the approach. One approach I can think of is using OCR we can read the content of the post, then search those content in the google. If the news is not present in any of the famous print media then we can tag it as fake. However there can be many challenges in this. What if the print media itself gives any fake news shared by someone.  How to handle the scenario where there is no text in the image but the information shown as image is fake.  How to handle posts written in Hindi. ?  And even if we detect fake news, is there any way to make the person accountable for sharing it. ? I know it is little difficult problem to solve. But is there any work currently done by any company on this. ?  Any starting point for me to get into this domain ? I am trying to install  under Wine. The program setup continually requests proxy settings. My broker tells me this shouldn't happen, and is a problem on my end. Here is what I have tried to attempt to solve this error:   I have gone into Network settings and proxy is set to none. I have looked in Wine Regedit and proxy_enable is set to 0. I have checked the firewall settings on my modem. I have tried reinstalling wine. I have installed lib32nss-mdns I can log on to my modem in iexplore using the gateway ip but thats it I've set my DNS to 10.0.0.138 to reflect the gateway I've set up a 32 bit Wine prefix   How should I proceed in solving this? How to add days to current Date using JavaScript. Does JavaScript have a built in function like .Net's AddDay? Is there a correct gender-neutral singular pronoun ("his" vs. "her" vs. "their")? Is it possible to speed up the gzip process?  I'm using  mysqldump "$database_name" | gzip &gt; $BACKUP_DIR/$database_name.sql.gz   to backup a database into a directory, $BACKUP_DIR.  the manpage says:     -# --fast --best             Regulate  the  speed  of compression using the             specified digit #, where -1  or  --fast  indi‐             cates  the  fastest  compression  method (less             compression) and -9 or  --best  indicates  the             slowest compression method (best compression).             The default compression level is -6 (that  is,             biased  towards high compression at expense of             speed).    How effective would it be to use --fast? Is this effectively lowering the CPU usage on a modern computer?   My test results  I didn't notice any acceleration:   7 min, 47 seconds (with default ratio -6) 8 min, 36 seconds (with ratio --fast ( = 9 ))   So it seems it takes even longer to use the fast compression?  Only higher compression really slows it down:   11 min, 57 seconds (with ratio --best ( = 1 ))   After getting the Idea with lzop I tested that too and it really is faster:   6 min, 14 seconds with lzop -1 -f -o $BACKUP_DIR/$database_name.sql.lzo How to change horizontal alignment of \frac? Typing \frac{W+W^*}{2} gives a fraction in which the denominator appears to the eye to be in the wrong position. Is there a way to correct this, i.e. place the 2 in under the + (without using arbitrary negative spacing)? Android app - can I see interesting questions? On the website the default list of questions displays interesting tab (which I believe has questions based on my highest scoring tabs). That's very convenient and allows me to check new questions that are relevant for me easily.   Can the same view be added to the mobile app? locating latitude-longitude point in a piste-map with matrix transforms I am trying to plot points of a particular latitude longitude on this image of a Swiss mountainous landscape.    What I am doing is I have some 54 known location-points plotted on this image (not visible in the linked image), which is a piste map, and is therefore an artist's impression of the landscape. I found out the latitude-longitudes and also height above sea level for these 54 known points. I opened my piste map in the GIMP, and plotted the 54 points, while at the same time reading their co-ordinates in points, in the piste-map. So, I have x-y coordinates (lat-long) and z coordinate (height above sea level) for all those 54 points (so its a 3d co-ordinate system that I have), and I also have X-Y coordinates of those places in my piste-map (a 2d co-ordinate system), and I assume a Z=1 for all those points.   To locate a particular lat-long on my piste-map(I have the coordinates for this place, i.e. the lat-long but not elevation), I need to calculate their X-Y on the piste-map. My approach is, that I calculate distances between this point which is to be located and those 54 known points , and then I sort them in ascending order. The first two points in this order will be the nearest points to the one which we want to locate. Now, I find my 3rd known point, and for that, I loop over the rest of the points, to get the nearest possible point such that this point forms a triangle with the first two closest points with the point which is to be located falling inside the formed triangle. Now, I have three known points forming a triangle say triangle ABC. For these known points, I have a triangle A'B'C' in the piste map, and the point to be located lies in the latter. I figure out the transform matrix which when multiplied with the 3X3 matrix of the three known points(in this 3X3 matrix, each row corresponds to a point, with the column values x,y and z in the 3d scape) results in a 3X3 matrix of those points in the piste-map. I multiply this transform matrix calculated with a new 3X3 matrix for three points, the first one being the point to be located, and the remaining two are the last two known points in the first 3X3 matrix. This way, the first two elements of my resulting matrix are the X and Y values for the point to be located, and I proceed ahead to draw the point on the piste-map. Is this approach correct with respect to the way I am using the transform matrix? Thanks! I would really appreciate if any alternative approaches are suggested as well! Question:   Prove that a norm is always non-negative.   Assume that the norm is negative.   Define: $f: \mathbb{R}^{n}\rightarrow \mathbb{R}^{-}_{0}$  $v \mapsto \left ( \vec{v} \right )f=\left \| \vec{v} \right \|$  $\left ( \vec{u}+\vec{v} \right )f=\left \| \vec{u}+\vec{v} \right \| \in \mathbb{R}^{-}_{0}$ and  $\left ( \vec{u} \right )f=\left \| \vec{u} \right \|,\left ( \vec{v} \right )f=\left \| \vec{v} \right \|=\left \| \vec{v} \right \| \in \mathbb{R}^{-}_{0}$  At this point I am unable to progress further.  Any help is appreciated. Java Round up Any Number How to disable notifications for a single mailbox in Mail? How to write a unit-test / test class for trigger? How do I write a unit-test / test class for a trigger?  What are my options?   Inline with the trigger?  New Class? For $a, b \geq 0$, $0 < x < 1$, show $(a+b)^x \leq a^x + b^x$ Let $a, b$ be positive real numbers. Let $0 &lt; x &lt; 1$. Show that  $(a+b)^x &lt; a^x + b^x$.  The function $f(x) = (a+b)^x -a^x - b^x$ has $f(0) = -1$, $f(1) = 0$ and it seems to be an increasing function. But I am unable to show that it is increasing function. I read this at least 20 years ago, and I believe it was originally published in the '60s.   The main character is a human, but somehow "inherits godhood" from an alien, whose species is very long lived. IIRC this is one of the old-style god thingies, i.e. "god of thunder" not "omniscient omnipotent omnipresent transcendent being".  The plot somehow revolved around identifying and fighting some enemy which, I believe, was in turn a member of the alien species who acted as the avatar of the opposite god in the alien pantheon.  The only thing I remember for sure is that the enemy was identified as "green green" or "gringrin" (sadly, I read this in translation so I am not sure what the original meant) Variation of the Kempner series – convergence of series $\sum\frac{1}{n}$ where $9$ is not a digit of $1/n$. It is easy to argue that the  converges:  $$  \sum\limits_{\substack{n \text{ s.t. 9 is}\\\text{ not a digit} \\\text{ of } n}}  \frac{1}{n} &lt; \infty$$  Let $E \subset \Bbb N_{&gt;0}$  the subset of the positive integers  such that $9$ is not a digit of the decimal expansion of $1/n$ (the decimal expansion is not allowed to have a trailing infinite sequence of "$9$"s. For instance $0.24999...$ is not allowed).  Here are the  that don't belong to $E$ : $11,13,17,19,21,23,29,31,34,38,41,…$ (not known by the OEIS, by the way).  My question is:     Does the series    $$ \sum\limits_{n \in E} \frac{1}{n} \tag 1$$ converge?   My attempt is :   Let $1/n = 0,a_1 a_2 \dots a_k \overline{b_1 b_2 \dots b_m}$ with $n \in E$. Since $1/n$ has no digit "9", we have at most $9^{k+m}$ possibilities for the $a_i$'s and $b_j$'s. Moreover, $1/n ≥ 0,00...0\overline{00...01}≥1/10^{k+m}$. But then I can only bound my series $(1)$ from below, by some real number. So, this is not a clue for the divergence of the series. Apparently, the numbers of the form $n=10k+1$ don't belong to $E$. Maybe we can find sufficiently many numbers that have $9$ in the decimal representation of their reciprocals, so that $(1)$ could converge...   Any comment will be appreciated !