I have a graph in tikz, using \draw ... to[out=...,in=...] for arcs. It seems that mirroring and rotating does not work properly regarding the anchors of the to-node. Is this to be expected, or is it a bug? Is there a work-around?    \documentclass{standalone} \usepackage{tikz} \begin{document} \begin{tikzpicture} \node[circle,draw] (A) at (0,0) {A}; \node[circle,draw] (B) at (0,2) {B}; \draw (A) to[out=45,in=-45] (B); \end{tikzpicture} \quad \begin{tikzpicture}[scale=-1] \node[circle,draw] (A) at (0,0) {A}; \node[circle,draw] (B) at (0,2) {B}; \draw (A) to[out=45,in=-45] (B); \end{tikzpicture} \quad \begin{tikzpicture}[yscale=-1] \node[circle,draw] (A) at (0,0) {A}; \node[circle,draw] (B) at (0,2) {B}; \draw (A) to[out=45,in=-45] (B); \end{tikzpicture} \quad \begin{tikzpicture}[rotate=90] \node[circle,draw] (A) at (0,0) {A}; \node[circle,draw] (B) at (0,2) {B}; \draw (A) to[out=45,in=-45] (B); \end{tikzpicture} \quad \begin{tikzpicture}[rotate=180] \node[circle,draw] (A) at (0,0) {A}; \node[circle,draw] (B) at (0,2) {B}; \draw (A) to[out=45,in=-45] (B); \end{tikzpicture} \end{document}

Trying to convert a coment into a complete answer for  I think that my solution there worked by chance and that MWijnand  found a wrong behavior in to path library when {x|y}scale has negative values.  Take a look at this example:  \documentclass[tikz,border=2mm]{standalone} \usepackage{bondgraph}           \usetikzlibrary[petri]   \begin{document} \begin{tikzpicture}[thin,>=stealth, every place/.style={draw,thick,minimum size=6mm}]     \node[place] (pG) {$p_G$};     \node[place,right=3cm of pG] (pR) {$p_R$};     \draw[->] (pR) to [out=150, in=30] (pG);     \begin{scope}[yscale=-1]     \draw[->,blue] (pR) to [out=150, in=30] (pG);     \end{scope}      \begin{scope}[xscale=-1]     \draw[->,red] (pR) to [out=150, in=30] (pG);     \end{scope}      \begin{scope}[scale=-1]     \draw[->,green] (pR) to [out=150, in=30] (pG);     \end{scope}  \end{tikzpicture} \end{document}   and its strange result.    What I would expect was that pR.center was the paths origin and pG.center was the path end. The path would have a out angle affected by scale factor and the drawn path would start on corresponding intersection point over pR border. This is what happens with out angle as you can see around pR node.  But this doesn't happen with in angle (pG node). in angle fixes final anchor at  pG.30 and not at pG.center as expected. It also changes incidence angle for which scale factor is applied.   I think this is wrong and I'll fill a . If I'm wrong or you have a better solution, please let us know.


I have installed numpy for python 2.6.5. I want to use it for python 3.1.2 and I don't know how to install it. I'm new to ubuntu and I don't know how to install it from  file. I am using Geany for programing in python3.  If I managed to installed it from there would it work in Geany?

Python3.4.0  on Ubuntu 14.04.01 LTS. We can use it by typing on Terminal `python3.  I want to use Numpy for Python3.4.0. I run import numpy  but I had anImportError.So sudo apt-get install python-numpy. Then I typed on Terminal:python3`. Then import numpy. I got this error:  >>> import numpy Traceback (most recent call last):   File "<stdin>", line 1, in <module> ImportError: No module named 'numpy' >>>    Nevertheless, Numpy is now working for Python-2.7:  begueradj@begueradj-Bill:~$ python Python 2.7.6 (default, Mar 22 2014, 22:59:38)  [GCC 4.8.2] on linux2 Type "help", "copyright", "credits" or "license" for more information. >>> import numpy >>>    How can I make Numpy work for Python 3.4.0 ?


For example, 2.0**53 == 2.0**53 + 1 returns True. I understand it's something related to floating numbers representation, but can someone explain?

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


What numbers $n$ can be written as a sum of odd squares:  $$a^2 +b^2 = n$$ Where $a$ and $b$ are odd.  It is easy to see that all such numbers must be of form $2(4k+1)$ and if $4k+1$ is prime it can be written as a sum of $2$ squares. Beyond that, I am stumped.

I know the following theorems:   A number can be represented as a sum of two squares precisely when $N$ is of the form $n^2 \prod p_i$ where each $p_i$ is a prime congruent to 1 mod 4 If the equation $a^2 + 1 \equiv a (\text {mod} p)$ is solvable for some $a$, then $p$ can be represented as a sum of two squares.  A positive integer $n$ is the sum of two squares iff each prime factor $p$ of $n$ such that $ p \equiv 3 (\text{mod} 4)$ occurs to an even power in the prime factorization of $n$   My problem is often which one to use and exactly how to use it.  Here is an example of a question:  Determine whether the following integers can be written as the sum of two squares. a) 363 b) 700 c) 34300 d) 325  For example, I figures 363 can not be written as a sum of two squares as it is of the form $4k +3$ where $k = 90$  For 700, which is not in the above stated form, I found $ 700 =2^2 \cdot 5^2 \cdot 7$ and 7 is the only factor $ p \equiv 3 mod 4$ and it is definitely not to an even power. Does this mean I'm done showing it is not the sum of two squares?  c) $34300 = 7^3 \cdot 5^2 \cdot 2^2$; again the power of 7 is not even.  d) Then I have $325 = 13 \cdot 5^2$ which has no prime factors congruent to 3 modulo 4. BUT $325 = 5^2(13)$ where $13 \equiv 1 mod 4$ and 5 is the $n$ mentioned in the first theorem. Is this enough to conclude that 325 is a sum of two squares?


I want to inherit every new file from my group so that I can have execute permissions, and no one else, but when I try to create new ones, it gives me 664 permissions how can I fix this??  sudo adduser $USER cyber_espionage   sudo chown $USER:cyber_espionage ~/Documents/tool sudo chmod 775 ~/Documents/tool sudo chown $USER:cyber_espionage -R ~/Documents/tool sudo chmod 2700 -R ~/Documents/tool sudo find ~/Documents/tool -type d -exec chmod 775 "{}" \; sudo find ~/Documents/tool -type f -name "*.py,*.sh" -exec chmod +x "{}" \; sudo find ~/Documents/tool -type f -name "*.sh" -exec chmod +x "{}" \;

When I create a file, the permission is 644 (user rw, group r, other r). How can I make the default file generated to have permission as 664?


I've been playing Fallout 4 for quite a while now and I haven't got any X-01 power armor pieces yet. I've only got the helmet from the brotherhood ship. I'm level 32 and I haven't got one set yet.   I've checked the following locations: 35 Court, Federal Surveillance Center K-21B in the Glowing Sea, the pond around Jamaica Plain and Nordhagen Beach. What I found was T-51, T-45 and T-60. Where can I find X-01 pieces scattered around the map?

I've found and looted most of the power armor frames in the Wasteland. Where can I find X-01 armor pieces?  This game is weird, to me, in that they slap you with the level dependent bit, AND random number generator, and I had the locations of the frames too early. Some of them, like 35 Court, or whatever, are just as hard, regardless of my level, but the prize is less.   I found a suit with X-01 parts, in the Glowing Sea, but it only had three parts. The only people I've fought wearing PA are Raiders, who have junk suits, and if I did fight BoS (I'm allied with them, this playthrough), I expect they all have T-60.   Will the Atom Cats ever sell X-01? Are there any other places to just find some parts lying around, even without the frame? Did I shoot myself in the foot, and am SOL, due to my exploring?   I found one by Jamaica Plains, but it was still T-60, at level 32; it might've level-locked from when I first went to Jamaica Plains, I don't know. I really wish some loot was "we made this hard, but if you can get it...", rather than "this will be post-game armor, almost no matter what? I spent a lot of time looking for the "surefire" locations for X-01 armors, and wasn't aware that they were level-dependent, so I think I've found most of them (11 frames, never bought or stole one), and this might mean I can't get the whole suit, as I was too quick to get them.   Can anyone assist?


I am using Math.round(). This is the sample code:  double value = 0.14499999970197677;  value = Math.round( value* 100.0) / 100.0;   My expectation is it should return 0.15 but it is returning 0.14 Also, if the value is 0.13499999970197677, then it is returning 0.13, why not 0.14  I have already gone through the link   Please tell me clearly that why this is happening with both the numbers?

What I would like is a method to convert a double to a string which rounds using the half-up method - i.e. if the decimal to be rounded is 5, it always rounds up to the next number. This is the standard method of rounding most people expect in most situations.  I also would like only significant digits to be displayed - i.e. there should not be any trailing zeroes.  I know one method of doing this is to use the String.format method:  String.format("%.5g%n", 0.912385);   returns:  0.91239   which is great, however it always displays numbers with 5 decimal places even if they are not significant:   String.format("%.5g%n", 0.912300);   returns:  0.91230   Another method is to use the DecimalFormatter:  DecimalFormat df = new DecimalFormat("#.#####"); df.format(0.912385);   returns:  0.91238   However as you can see this uses half-even rounding. That is it will round down if the previous digit is even. What I'd like is this:  0.912385 -> 0.91239 0.912300 -> 0.9123   What is the best way to achieve this in Java?


I have two really long equations that don't fit into one line. I would like to display them as  first_eq LHS, super super super super long =                                         first_eq RHS, aligned right, also not short second_eq LHS, not as long as first eq =               second_eq RHS, aligned right, pretty loooooooooooooooooooooooooong too   Note that all lines are aligned to a side, either left or right. How can I achieve this within latex? I'm somewhat familiar with align, so if I wouldn't have to learn new packages that'd be great, but not a deal breaker.   I'm not sure whether the two equation signs should be vertically aligned, that could potentially look neat.  Neither of the solutions in the closed-as question work here. For example,   \begin{multline} (\rho + \delta  + (1-\beta)f(m(a, \bar u, l))J(a, \bar u, l) = \\ \left((1 - \beta)(p(a, \bar u, l) - b) + dJ(a, \bar u, l)\mathbf z(a, \bar u, l)\right)\\ \rho U (a, \bar u, l) = \\ b + f(m(a, \bar u, l))\frac{\beta}{1-\beta}J(m(a, \bar u, l))  + \eta \underbar U + dU(a, \bar u, l)\mathbf z(a, \bar u, l) \\  \perp \underbar U \leq U(a, \bar u, l) \leq \bar U(a, \bar u, l) \end{multline}   does not align them as I want to but equations rather hover weirdly in the center. Wrapping it around in dmath has no impact whatsoever.

I am having the following equation:  \begin{equation}   Q(\lambda,\hat{\lambda}) = -\frac{1}{2} P(O \mid \lambda ) \sum_s \sum_m \sum_t \gamma_m^{(s)} (t) \left( n \log(2 \pi ) + \log \left| C_m^{(s)} \right| + \left( \mathbf{o}_t - \hat{\mu}_m^{(s)} \right) ^T C_m^{(s)-1} \left(\mathbf{o}_t - \hat{\mu}_m^{(s)}\right) \right) \end{equation}   which does not very well fit on one line. How can I split this over two lines? What I have in mind is that I specify the splitting place, and that the first line is left aligned and the second line right aligned to make clear that it is still the same equation.  The linebreak \\ does not work.


Given $n \in \mathbb{N}$ how many ways can one write $n=a+2b+3c$ for $a,b,c \in \mathbb{N}$.  I have an idea as if I use a a 3-tuple to represent $(a,b,c)$, I can list all of them using two functions $f((a,b,c)) = (a-2,b+1,c)$ and $g((a,b,c)) = (a-1,b-1,c+1)$. Which makes a nice pattern that should be easy to compute for any n however I'm struggling finding an actual equation that works everytime. Right now I have one that works sometimes being; Let $x = \left \lfloor{n/2}\right \rfloor  $, $y = \left \lfloor{n/6}\right \rfloor  $ and $z = x-y$. Then the function $f(n)$ is the count. $f(n) = 1+x+(c/2)(c+1)+bc-b(b+1)$. However I know it's wrong.  EDIT: Sorry forgot to add that f(n) should be a function of just n.

I want to find number of the non negative integer solutions of $a+2b+3c = 200$ (answer can contain $a,b,c = 0$)  Example one of the solutions is $a = 100, b = 50, c = 0$  I used stars and bars trick and here i get is  $\dfrac{\dbinom{200+2}{2}}{2 \times 3}$ but it is incorrect  any type of math is welcomed    what I have learnt from stars and bars technique is to find the solutions of $x+y = n , x,y,n > 0$ are positive integers but I am confused with equation of type $ax+by = n$ where $a , b> 1$


I have Debian 8 installed on my 32-bit laptop, and I want to install Windows 10 on it (because reasons). How can I do that? It meets the minimum requirements, I want it to appear in GRUB, and I want it to not overwrite my Debian installation (obviously).

I've been trying for a month now to dual boot Windows 8.1 and Debian Jessie now. I thought it was about time I asked for help as I'm becoming a little crazy.  I've tried following a lot of tutorials, I'll link a few:      I can't post more links, a shame, because I've tried a lot. There were some really easy tutorials, like the first one, where I couldn't continue, because sudo modprobe efivars failed. sudo modprobe efivarfs did succeed though. But when I continued after using efivarfs, there wasn't a new entry.   I also tried using EasyBCD, setting it on GRUB 2 and "automatically choose and load", but it would choose "/NST/AutoNeoGrub0.mbr". Which is of course is not correct. So basically, to sum up my problem: modprobe efivars doesn't work, and because a lot depends on that, every tutorial I follow, fails.  How I can start Linux and some background information: I had Windows 8 first and still want to keep it and use its bootloader, because it already loads windows 8 a bit. I've got Secure Boot off and UEFI on with Legacy boot options on. I can boot Debian by going into boot menu and choosing Hard Drive under Legacy Boot.  Oh yeah, Almost forgot, when I wanted to install Debian, using an USB stick with some nice Windows programs didn't work, so I had to use a DVD+RW to install it.  I've tried this order a few times now:  sudo mount /dev/sda1 /boot/efi sudo modprobe efivarfs sudo grub-install /dev/sda sudo update-grub   Sometimes I had to use --force, I don't remember why anymore, I have tried so much stuff...  I really hope some of you have got a solution for me!


In chat, most often the stars are entirely black. But sometimes I see a white star which has a black border. As I saw, they leave the messages for a long time in the starboard. Are those white stars featured? Who can add one?

I was on chat in Stack Overflow and noticed that some of the message had grey stars with a black border while others were just black stars. What is the difference between the 2 star types?


Say I'm holding a rod composed of an incomprehensible solid, and this solid rod is 1 light second long. Then say I poke you with the rod and at the same time I flash a light on you. If light is the universal speed limit, then you should see the light before you feel the annoying poke. But if the rod is incompressible, where is the delay?

Is it possible for information (like 1 and 0s) to be transmitted faster than light?   For instance, take a rigid pole of several AU in length. Now say you have a person on each end, and one of them starts pulling and pushing on his/her end.   The person on the opposite end should receive the pushes and pulls instantaneously as no particle is making the full journey.  Would this actually work?


I am working on a page that uses JavaScipt to send data to a PHP script via AJAX POST. The problem is, if the input is in a language that is not Latin based I end-up storing gibberish in the MySQL table. Latin alphabet works fine. The page itself is capable to rendering UTF-8 characters, if they are in a data provided on page load, it's the post that I struggle with.  اختبار  and save. See the Network POST request in browser's dev tools. The post is made through the following JS function function createEmptyStack(stackTitle) {     return $.ajax({         type:'POST',         url:'ajax.php',         data: {             "do": 'createEmptyStack',             newTitle: stackTitle         },         dataType: "json"     }); }  Here's my PHP code. header('Content-Type: text/html; charset=utf-8');  $newTitle = trim($_POST['newTitle']);  $db->query(" INSERT INTO t1(project_id, label)  VALUES (".$_SESSION['project_id'].", '".$newTitle."')");  When I check for encoding on the page like this: mb_detect_encoding($_POST['newTitle'], "auto");  I get result: UTF-8 I also tried the following header: header("Content-type: application/json; charset=utf-8");  MySQL table collation where the data is supposed to go is set to utf8_general_ci I have another page that has a form where users populate the same table and it works perfectly fine with ANY language. When I check on the other page why it is capable of inserting similar data into db successfully I see the following above insert query: mysql_query("SET NAMES utf8");  I've attempted putting the same line above my query that the data still looks gibberish. I also tried the following couple alternatives:  mysql_query("SET CHARACTER SET utf8 ");  and mysql_set_charset('utf8', $db);  ...but to no avail. I'm stomped. Need help getting it figured out. Environment:  PHP  5.6.40 (cgi-fcgi) MySQL    5.6.45   UPDATE I ran more tests. I used a phrase "this is a test" in Arabic - هذا اختبار It seems that ajax.php code works properly. After db insert it returns UTF-8 encoded values, that look like:  "\u0647\u0630\u0627 \u0627\u062e\u062a\u0628\u0627\u0631" and the encoding is set to:"UTF-8", however the inserted data in my db table appears as: Ù‡Ø°Ø§ Ø§Ø®ØªØ¨Ø§Ø± So why am I not jumping to converting my db table to different collation? Couple of reasons: it has nearly .5 mil records and it actually works properly when I go to another page that does very similar INSERT. Turns out my other page is using ASCII encoding when inserting the data. So it's only natural I try to conver to ASCII on ajax.php. The problem I end-up with blank data. I am so confused now... Thanks  FIXED: based on a few clues I ended-up rewriting all functions for this page to PDO and it worked!

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


Noob linux here trying to understand wildcard matching when using find. #find /opt/spark/jars -name data* #find /opt/spark/jars -name datan* /opt/spark/jars/datanucleus-rdbms-3.2.9.jar /opt/spark/jars/datanucleus-core-3.2.10.jar /opt/spark/jars/datanucleus-api-jdo-3.2.6.jar  How come data* doesn't match anything but datan* does?

I am running the following command, but it is not performed recursively:  find . -name *.java   I know there are java files further down in the current directory but it is performing the find on the current directory only. I am using OS X, 10.9.


While running the standalone tool in ArcMap, the optional parameter TemplateExtent is a wonderful shortcut, as it autofills 10 other parameters. However, I need to run it in a standalone script, and have been unsuccessful in using the parameter as it's used in the tool: leaving these fields to be autofilled using the TemplateExtent layer's info. Instead, as seen in  (courtesy of radouxju), the best solution seems to involve using Describe to find and enter each parameter explicitly:  desc = arcpy.Describe(fc) arcpy.CreateFishnet_management(fc[:-4]+"_c200.shp",str(desc.extent.lowerLeft),str(desc.extent.XMin) + " " + str(desc.extent.YMax + 10),"200","200","0","0",str(desc.extent.upperRight),"NO_LABELS","#","POLYGON")   That approach squares with the fact that the first of these parameters are required. If I'm understanding it correctly, when run in ArcPy it has no utility since all other fields are required.   Question: So should I always ignore this paramter in the ArcPy environment, just using '#' as a placeholder; or is there some other utility?  Following PolyGeo's and Midavalo's suggestions below, here's the Python snippet that results from running CreateFishnet as a tool:  arcpy.CreateFishnet_management(out_feature_class="[path]/test_fishnet", origin_coord="447677.5 3111557.5", y_axis_coord="447677.5 3111567.5", cell_width="50", cell_height="50", number_rows="0", number_columns="0", corner_coord="482222.5 3142082.5", labels="LABELS", template="mid_5m", geometry_type="POLYLINE")

I can’t use the tool arcpy.CreateFishnet_management because define the parameter “templateExtent” with a shapefile it is not filling automatically the  parameters “originCoordinate” and “yAxisCoordinate”.   import arcpy from arcpy import env env.overwriteOutput = True env.workspace = r"D:\Users\julia\erste_aufg"  #Process: Create Fishnet outFeatureClass = r"D:\Users\julia\erste_aufg\at001l_wien\at001l_wien\wien.shp" cellSizeWidth = '200' cellSizeHeight = '200' templateExtent = r"D:\Users\julia\erste_aufg\at001l_wien\at001l_wien\at001l_wien.shp"  arcpy.CreateFishnet_management(outFeatureClass, "", "", cellSizeWidth, cellSizeHeight, '0', '0', "", "NO_LABELS", templateExtent, "POLYGON")     It is working in the ModelBulider, so something is running in the background of the ModelBulider that it could create the parameters “originCoordinate” and “yAxisCoordinate” when it has a “templateExtent”.  How can I get this tool running in ArcPy by having just the parameter “templateExtent”?  I would be really happy if someone has a solution because I need the Fishnet in a scripttool and cannot go one without because in the end there is a loop so the values of the extent are always different.


The speed of light in any medium besides vacuum is smaller than $c$. In a classical way, I just look at that as a wave that propagates less fast, the change in EM-field is passed on slower. How should I imagine that when thinking of light as being photons? Are they slowed down and accelerated again? What is the consequence of accelerating a massless particle?

So light travels slower in glass (for example) than in a vacuum. What causes light to slow down? Or: How does it slow down? If light passes through the medium, is it not essentially traveling in the "vacuum" between the atoms?


In my animation, I want the destructable object to replace the non destructable clone right before the impact frame, but I cant seem to keyframe the renderability of the collection, any way to fix this or to make a collection dissapear and reappear?

I have an object which has been fractured, it has over 100 pieces. I wanted to animate the visibility of each piece. Unfortunately you cannot animate the disable in renders icon (camera icon in ref image below) for a whole collection, but you can for each object.  As there are a lot of objects, is there any way I can add a keyframe to each one without doing them all individually?


let $f\in L^2({\mathbb{R}})$ in ,I want to prove the following inequality  which it is Incertitude Heisenberg principle $$\dfrac{1}{4}\le  \int_{\mathbb{R}} |x f|^2dx \int_{\mathbb{R}} |\xi \hat{f}|^2 d\xi^2$$ satisfies :$\int_{\mathbb{R}} |f(t)|^2dt=1$. Attempt: Let $u = \frac{1}{\| f \|^2_{L^2}} \int_{-\infty}^{+\infty} t |f(t)|^2 dt $ and $v = \frac{1}{2 \pi \| f \|^2} \int _{-\infty}^{+\infty} w |\hat{f}(w)|^2 dw $ which are present middle position and quantum momentum respectively , then: $\sigma_t^2 =  \frac{1}{\| f \|^2}  \int_{-\infty}^{+\infty} (t-u)^2 |f(t)|^2 dt $ and $\sigma_w^2 = \frac{1}{2 \pi \| f \|^2} \int _{-\infty}^{+\infty} (w-v)^2 |\hat{f}(w)|^2 dw $, Then I want the inegality of the product : $\sigma_w^2\sigma_t^2 \geq \frac14$ using integration by part but i can't realise that after substitution.Any Help ? and how I can establish this inegality in $\mathbb{R^n}$ ?

Scrolling in a book on real analysis I found, as a last exercise, the request to prove the Heisenberg uncertainty principle. The exercise states      Let $f\in \mathcal L_{1}^{2}(\mathbb R)$, such that $\|f\|_{2}=\|\hat f\|_{2}=1$. Prove that $$\left(\int_{\mathbb R}|x|^{2}|f(x)|^{2}\,\mathrm dx\right)\cdot\left(\int_{\mathbb R}|\xi|^{2}|\hat f(\xi)|^{2}\,\mathrm d\xi\right)\geq \frac{1}{(4\pi)^{2}}$$       Hint: suppose that $f\in C_{c}^{\infty}$ and use the following identities: $$\int_{\mathbb R}x\overline{f}(x)f'(x) = -{1\over 2} \|f\|_{2}^{s}$$ Plancherel's identity and Cauchy-Schwarz inequality.   The book states that $$\mathcal L^2_s(\mathbb R^d) := \{f:\mathbb R^d\rightarrow\mathbb C \text{ measurable} \text{ : }(1+|x|^2)^{s\over 2}f\in L^2(\mathbb R^d)\}$$ which calles it weighted $L^2$ spaces.   I was very curious on how to solve this problem because I don't have nearly as much knowledge as it's needed to solve this! So I'm here to ask you if you could give me the solution.   I can't give you my working because, as just stated, I don't know much about real analysis and I was just very curious to see the solution! Probably I'll understand it if I see one but searching on the internet didn't gave me any help.


I recently watched a video on youtube by a group called Numberphile. Theyre were discussing the Riemann Hypothesis and I was confused when they brought up 'Analytical Continuance' and 'Holomorphic Functions'.  Now where I am confused is when they bring up the analytical continuance of this function.  How does  $$ \zeta(-1)=\frac{1}{1^{-1}}+\frac{1}{2^{-1}}+\frac{1}{3^{-1}}+...=1+2+3+...=-\frac{1}{12}$$ Doesnt this series diverge since the sum of the natural numbers diverges??

$\displaystyle\sum_{n=1}^\infty \frac{1}{n^s}$ only converges to $\zeta(s)$ if $\text{Re}(s) > 1$.  Why should analytically continuing to $\zeta(-1)$ give the right answer?


I would like to see some detailed solution for $$\frac{n!}{\sqrt{2\pi n} \left(\frac{n}{e}\right)^n}$$ as $n\to\infty$. I know that the answer is 1 but i am not sure why? Here is what is tried:   I rewrote the stirling's formula like this. $$\frac{(e/n)\cdot (2e/n)\cdot (3e/n)\cdots (ne/n)}{\sqrt{2\pi n}}\to 0$$ as $n\to \infty$. I am not sure where I went wrong.

Suppose we want to show that $$ n! \sim \sqrt{2 \pi} n^{n+(1/2)}e^{-n}$$  Instead we could show that $$\lim_{n \to \infty} \frac{n!}{n^{n+(1/2)}e^{-n}} = C$$ where $C$ is a constant. Maybe $C = \sqrt{2 \pi}$.   What is a good way of doing this? Could we use ? Or maybe take the log of both sides (e.g., compute the limit of the log of the quantity)? So for example do the following $$\lim_{n \to \infty} \log \left[\frac{n!}{n^{n+(1/2)}e^{-n}} \right] =  \log C$$


When an object, say a shoe, falls from a height (under the influence of gravity), it rebounds after hitting the ground. For an object to move upwards, it requires a force to overcome its weight. When the shoe hits the ground some of its energy is lost and the ground pushes back with a force less than its weight, so why does it rebound, since the upward force is not large enough to overcome its weight?

Some things don't bounce like rubber balls do.  For example, books don't bounce much when dropped.  Why is it that some things bounce while others don't?


Need Help to Change My Os from Windows Phone in nokia 710 to Any Android Os

Many people want to try/use Android without buying a new Android phone.  How can I install Android on my current phone or device running Nokia Symbian, Maemo, or MeeGo; Microsoft Windows Mobile or Windows Phone 7/8/10; Apple iOS (iPhone); RIM's BlackBerry OS; Palm's WebOS; Samsung's Bada; HP's WebOS; Mozilla's Firefox OS; or other phone / operating system?


I saw some command such as sudo su ls, and I just wonder what's the deference between sudo ls?

To launch a root shell on machines where the root account is disabled, you can run one of:   sudo -i : run an interactive login shell (reads /root/.bashrc and /root/.profile) sudo -s : run a non-login interactive shell (reads /root/.bashrc)   In the Ubuntu world, I very often see sudo su suggested as a way to get a root shell. Why run two separate commands when one will do? As far as I can tell, sudo -i is equivalent to sudo su - and sudo -s is the same as sudo su.  The only differences seem to be (comparing sudo -i on the left and sudo su - on the right):    And comparing sudo -s (left) and sudo su (right):    The main differences (ignoring the SUDO_foo variables and LS_COLORS) seem to be the XDG_foo system variables in the sudo su versions.   Are there any cases where that difference warrants using the rather inelegant sudo su? Can I safely tell people (as I often have) that there's never any point in running sudo su or am I missing something?


Using SQL Server 2012, with over 200 tables.  I need to implement soft-delete so that I can give my users the ability to "restore or undelete" deleted records. The tables from which the users delete records are user-defined with variable number of relationship (foreign keys) to other tables.  I have seen so far two methods:   IsDeleted column on all tables Having mirror archived tables   however both methods seems to work well on a standalone table, when it comes to tables with relationships, I think neither of the methods are practical.  Method 1: complicates queries, and causes in incorrect query results.  SELECT Id,Name FROM User Left Join Group ON Group.Id = User.GroupId AND Group.IsDeleted=0 WHERE User.IsDeleted=0 AND ISNULL(Group.IsActive,0) <> 0   This above query returns invalid results because of the joined table IsDeleted filter. In other posts, it is suggested that IsDeleted=0 is enough, however as I demonstrated above that is not the case.  SELECT Id,Name FROM User Left Join Group ON Group.Id = User.GroupId WHERE User.IsDeleted=0 AND Group.IsDeleted=0   This above query too, won't work correctly in some cases depend on how the user filters the records (the problem appears when there are more joins). In below example:   User has GroupId field (lookup to Group)   User has RoleId field (lookup to Role)   Role has GroupId field (lookup to Group)  SELECT Id,Name FROM User LEFT JOIN Group ON Group.Id = User.GroupId LEFT JOIN Role ON Role.Id = User.RoleId WHERE User.IsDeleted=0 AND Group.IsDeleted=0 AND Role.IsDeleted=0 AND /* ...user defined filters...*/ Role.Name is not null   The query above too won't return the correct results if the group is deleted, but not the role related to the group, the role record will also get filtered out.  (I know there are ways to fix the queries in case by case basis, but that would not work for my use case, I need a solid pre-defined pattern to apply to all generated queries - the database queries are not predefined and they are generated on the fly.)  Method 2: very hard to implement, at the time that a record is being deleted and archived, need to figure out what other records in other tables reference it and track them somehow to be able to update them back when the record is undeleted.  Anyone has a suggestion what is the best method to implement soft delete in a relational database effectively?

Working on a project at the moment and we have to implement soft deletion for the majority of users (user roles). We decided to add an is_deleted='0' field on each table in the database and set it to '1' if particular user roles hit a delete button on a specific record.  For future maintenance now, each SELECT query will need to ensure they do not include records where is_deleted='1'.  Is there a better solution for implementing soft deletion?  Update: I should also note that we have an Audit database that tracks changes (field, old value, new value, time, user, ip) to all tables/fields within the Application database.


I'm trying to vertical align some element without destroying the responsivness in a row here is my code :    #navbar{     height: 80px;     border: 1px solid red; }  #logo{     width: 40px;     height: auto; } <link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css">

         TEXT         TEXT         TEXT         TEXT

TEXT RIGHT

     Here is the expected output :    I'm using Bootstrap 3  I would also like to vertical align inside a navabar :     .navbar-header{     height: 80px; } <link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css">
         <button type="button" class="navbar-toggle" data-toggle="collapse" data-target=".navbar-ex1-collapse">             Toggle navigation                                                </button>

TEXT

TEXT

I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers?

testing...


This code does not work correctly and returns time using timezone from computer and ignoring timezone stored in WordPress options:  date_default_timezone_set( get_option( 'timezone_string' ) ); $hours = date( 'H', strtotime( $timestamp ) ); date_default_timezone_set(@date_default_timezone_get());   WordPress saves timezone in options section but 'timezone_string' option in wp_options table is empty. Also the code generates warnings.  How to get date using timezone saved in options correctly?  Where does WordPress store an Timezone which can be edited in options section?

Can someone tell me how to get the time zone that is set in the WordPress Admin?  For example, if the blog is set to Eastern time, I need this exact string to print out:     US/Eastern   This is for a function that lives in functions.php in my theme.


As the title says, how do we disable it?  It maybe promising for low memory devices but not on a 32 Gig Ram, it consumes about 50% of disk access and it slows down other access on local disks.  There were few answers discussed in  but it does not work now on Windows 10 Build 1511

my former wrong assumption: it drains my notebook battery and I've no shortage of RAM. In Task manager you see ntoskrnl.exe is eating more CPU time than any other process. this feature does not appear to be optional and came 2 days ago with the 1st Win10 Update (Win10Pro in my case).  Edit:  I want to disable it, at least to exclude it as a culprit for my (unproven) assumptions. That process never came to my attention in the last 2 months and in task manager's long name it's called "system memory and compressed memory".


Hi I am trying to solve this question I don't know where to begin but I have an idea so we have   $$Z(G) = \{x \in G \space  |\space  xy = yx \space\forall y \in G\}$$  We must show that for all $\sigma$ $\in S_n$ such that $\sigma \neq (1)$ Then there exists y $\in S_n$ such that $\sigma * y$ $\neq$ $y * \sigma$. However I don't know how to proceed further.   I was thinking I could use conjugation somehow but I don't know what would I do with them.

Find the center of the symmetry group $S_n$.   Attempt:  By definition, the center is $Z(S_n) = \{ a \in S_n : ag = ga \forall\  g \in S_n\}$. Then we know the identity $e$ is in $S_n$ since there is always the trivial permutation. Suppose $a$ is in $S_n$, but not equal to identity. Now we can imagine the permutation as bijective function that maps from $\{1,2,\dotsc,n\}$ to $\{1,2,\dotsc,n\}$.  So suppose $p$ is a permutation map. Then $p$ maps from a location $i$ to a location $j$. Take $p(i) = j$ where $i\neq j$. Let $k$ be in $\{1,2,\dotsc,n\}$, where $k$, $i$ and $j$ are all different elements. The cycle $r = (jk)$, then we will see if this commutes.  $rp(i) = rj$    Can someone please help me, I am stuck?  Thank you.


I am wondering what the conditions (if any) are for the derivative of an expectation to be equal to the expectation of a derivative: $$ \frac{d E[X(t)]}{dt} = E \left[\frac{dX(t)}{dt} \right] $$  where X(t) is some random variable.

Let $ (X_t) $ be a stochastic process, and define a new stochastic process by $ Y_t = \int_0^t f(X_s) ds $. Is it true in general that $ \frac{d} {dt} \mathbb{E}(Y_t) = \mathbb{E}(f(X_t))  $? If not, under what conditions would we be allowed to interchange the derivative operator with the expectation operator?


I installed npm and tried to install a package:  npm install -g reaction-cli   I got an error like:  Error: EACCES: permission denied, access '/usr/lib/node_modules'   So, I tried to add permission with:  sudo chown -R $USER /usr/lib   But when I try to install other software, for example  sudo apt-get install git-core   I get:  sudo: error in /etc/sudo.conf, line 0 while loading plugin  "sudoers_policy" sudo: /usr/lib/sudo/sudoers.so must be owned by uid 0  sudo: fatal error, unable to load plugins   Is there any method to resolve my problem?  I also using sudo chown -R $USER /src/http to access source in Apache server to edit files. Then I don't get this error.

Whenever I try to do anything at all that requires my password it returns this:  u7ur7l3@ubuntu:~$ sudo sudo: /usr/lib/sudo/sudoers.so must be owned by uid 0 sudo: fatal error, unable to load plugins u7ur7l3@ubuntu:~$   So I can't install anything from the Software Center / package manager or run any commands in terminal that require my password. I can log in, but that's pretty much it.  I accidentally changed the permissions of some files, then changed some more trying to fix it :/. Now I'm completely lost as to what to do.  This is what happened when I tried to get sudo working again using pkexec:  u7ur7l3@ubuntu:~$ pkexec chown root /usr/lib/sudo/sudoers.so Error getting authority: Error initializing authority: Error calling StartServiceByName for org.freedesktop.PolicyKit1: GDBus.Error:org.freedesktop.DBus.Error.Spawn.ExecFailed: Failed to execute program /usr/lib/dbus-1.0/dbus-daemon-launch-helper: Success   u7ur7l3@ubuntu:~$ sudo ls sudo: /usr/lib/sudo/sudoers.so must be owned by uid 0 sudo: fatal error, unable to load plugins   And to change permissions I was using Root Actions as a dolphin service/ plugin thing, so history doesn't show me the permission changes.  I just realized that sounds don't work at all anymore. When I go into Phonon my default settings and playback devices aren't even there. Also I don't have the option to shutdown, I can only log out or leave.


Two questions:  Prove $a_n$  is bounded by 2 if $a_1=0, a_2=\sqrt2,\ldots,a_{n+1}=\sqrt{2+a_n}$  Prove (I've already proven $s_n$ is monotonically increasing and bounded above by 3) $\lim_{n \to \infty} s_n=e$ for $s_n=(1+\frac1n)^n$.

(Fitzpatrick Advanced Calculus 2e, Sec. 2.4 #12)  For $c \gt 0$, consider the quadratic equation $x^2 - x - c = 0, x > 0$.  Define the sequence $\{x_n\}$ recursively by fixing $|x_1| \lt c$ and then, if $n$ is an index for which $x_n$ has been defined, defining  $$x_{n+1} = \sqrt{c+x_n}$$  Prove that the sequence $\{x_n\}$ converges monotonically to the solution of the above equation.  Note: The answers below might assume $x_1 \gt 0$, but they still work, as we have $x_3 \gt 0$.    This is being repurposed in an effort to cut down on duplicates, see here: .  and here: .


Sorry for my English. I try to generate local Visual Studio project from shared (Samba) sources and libs. I have linker error: "cannot open file \samba_path\somelib.lib". Real path is "\\samba_path\somelib.lib". It's valid path, that I see in linker settings in Visual Studio and in Cmake variables. Why linker don't understand this path?

We just did a move from storing all files locally to a network drive. Problem is that is where my VS projects are also stored now. (No versioning system yet, working on that.) I know I heard of problems with doing this in the past, but never heard of a work-around. Is there a work around?  So my VS is installed locally. The files are on a network drive. How can I get this to work?  EDIT: I know what SHOULD be done, but is there a band-aid I can put on right now to fix this and maintain the network drive?  EDIT 2: I am sure I am not understanding something, but  has the right idea. I'll work with the lead web developer when he gets back into the office to figure out a temporary solution until we get some sort of version control setup. Thanks for the ideas.


Take this c++ code:  double d = 0.3028 + 0.0028; cout << d << endl; if (d == 0.3056)     cout << "match" << endl; else     cout << "not a match" << endl;   Why is the output "not a match"?

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I'm trying to create an SQL query that will combine rows where a row sharing an ID is found, but print normally if now. I have a Computer and Harddisk database. The Computer DB has a Id and the Harddisk DB har a Id and a ComputerId for the associated computer. Some computers have more harddisks so I'd like to combine these into the same column. I've attached a image below explaining the two tables and the desired output:  My current query reads: $queryHDDS = "SELECT *,CONCAT(ComputerId) FROM HardDisk GROUP BY Id"; Trouble is it is no combining two harddisks that are associated by a shared ComputerId Hope someone is able to help me out with this!

Using MySQL, I can do something like:  SELECT hobbies FROM peoples_hobbies WHERE person_id = 5;   My Output:  shopping fishing coding   but instead I just want 1 row, 1 col:  Expected Output:  shopping, fishing, coding   The reason is that I'm selecting multiple values from multiple tables, and after all the joins I've got a lot more rows than I'd like.  I've looked for a function on  and it doesn't look like the CONCAT or CONCAT_WS functions accept result sets.  So does anyone here know how to do this?


We know that the entire matter has a property called mass. Charge is also a property of matter. If negative charge can exist, why don't negative mass exist?  Also, like charges repel each other. Then why like masses attract each other?

Since Newtonian gravity is analogous to electrostatics shouldn't there be something called negative mass? Also, a moving charge generates electric field, but why doesn't a moving mass generate some other field?


I'm programming a microcontroller in C and since the compiler or chip doesn't handle Floating Point numbers very well, it is recommended to scale the floating point value up enough to get rid of the decimal and then when outputting the number, scale it back down with a proportional division and use modulus to find and display the fractional part. Here's an example: Start with number 25.0625. Multiply by 10000 to get 250625. Good now we don't have a float anymore. Now to display this we use a line like this:  sprintf(buffer, "%li.%i", Temp / 10000, abs(Temp % 10000));   So we first get the 25 back out by / 10000, then we get the 0625 out by % 10000. Here's the problem though: It appears my modulus result ignores the leading zero in 0625 so when it concatenates the number back together, it becomes 25.625 instead of 25.0625. I can't count on there always being a leading zero, so stuffing a zero in there isn't the answer, and there could at other times be several leading zeros. My question is, how do I suppress the modulus from excluding leading zeros ? Thanks.

I'm trying to find a good way to print leading 0, such as 01001 for a . While the number would be stored as 1001, what is a good way to do it? I thought of using either case statements or if to figure out how many digits the number is and then convert it to an char array with extra 0's for printing, but I can't help but think there may be a way to do this with the printf format syntax that is eluding me.


I was trying to write a translate function that could automatically convert some text file in English into Chinese. There is a dictionary saved and the key values are in Chinese characters. However, an error occurred when Python was trying to write to a new text file because it couldn't write in unicode. Here is my function: def translateDesc(fileName):     # Opens the file that we're trying to translate     textFile = open(fileName, "r")     print(textFile)     fileLines = textFile.readlines()     textFile.close()      # Creates an output list and translate line by line     outputList = []     for line in fileLines:         outputList.append(translateLines(line)) #outputList now contains some string in Chinese      # Creates an output file and writes in it     outputFile = open("output.txt", "w+")     outputFile.writelines(outputList)        # THE ERROR OCCURRED HERE     outputFile.close()  Here is the error message: UnicodeEncodeError: 'charmap' codec can't encode characters in position 0-6: character maps to <undefined>  How could I allow Python to write Unicode in a text file?

I'm having some brain failure in understanding reading and writing text to a file (Python 2.4).  # The string, which has an a-acute in it. ss = u'Capit\xe1n' ss8 = ss.encode('utf8') repr(ss), repr(ss8)      ("u'Capit\xe1n'", "'Capit\xc3\xa1n'")   print ss, ss8 print >> open('f1','w'), ss8  >>> file('f1').read() 'Capit\xc3\xa1n\n'   So I type in Capit\xc3\xa1n into my favorite editor, in file f2.  Then:  >>> open('f1').read() 'Capit\xc3\xa1n\n' >>> open('f2').read() 'Capit\\xc3\\xa1n\n' >>> open('f1').read().decode('utf8') u'Capit\xe1n\n' >>> open('f2').read().decode('utf8') u'Capit\\xc3\\xa1n\n'   What am I not understanding here? Clearly there is some vital bit of magic (or good sense) that I'm missing. What does one type into text files to get proper conversions?  What I'm truly failing to grok here, is what the point of the UTF-8 representation is, if you can't actually get Python to recognize it, when it comes from outside. Maybe I should just JSON dump the string, and use that instead, since that has an asciiable representation! More to the point, is there an ASCII representation of this Unicode object that Python will recognize and decode, when coming in from a file?  If so, how do I get it?  >>> print simplejson.dumps(ss) '"Capit\u00e1n"' >>> print >> file('f3','w'), simplejson.dumps(ss) >>> simplejson.load(open('f3')) u'Capit\xe1n'


I want to ask whether it is possible to install arduino ide or avr-tools to ubuntu touch. Is it ?

tl;dr: I'm looking for a "canonical" or "recommended" way to install (cli) .deb packages on Ubuntu touch  I've been using Ubuntu on my Desktop and Server for a year and I'm very satisfied. Now I bought the first Ubuntu phone, the BQ Aquaris e4.5 Ubuntu Edition. However, I found out that I can't install normal .deb packages or install things using apt-get. How can I "root" my phone so that I can install "normal" .deb packages?  I tried it myself. I know the first thing is to make your filesystem writable. I did the following steps but then I got stuck because of a dpkg error.  # Desktop: sudo add-apt-repository ppa:phablet-team/tools sudo apt-get update sudo apt-get install phablet-tools  # Phone: Security & Privacy: Lock phone: Lock when idle: Never About this phone: Developer Mode: Developer Mode ON  # connect phone to PC via USB  # Desktop: adb devices # no device detected so I've manually added file touch /home/username/.android/adb_usb.ini # with content: 0x2a47 sudo adb kill-server sudo adb start-server adb devices # now my phone is on the list  # Phone: sudo test -w filename && echo "Writable" || echo "Not Writable" # verified it is writable sudo add-apt-repository ppa:phablet-team/ppa sudo apt-get update && sudo apt-get upgrade   And this is the place where error starts to block me:  dpkg: error processing archive /var/cache/apt/archives/powerd_0.16+15.04.20150430-0ubuntu1_armhf.deb (--unpack): unable to make backup link of `./usr/share/powerd/device_configs/config-default.xml' before installing new version: Invalid cross-device link   So I tried    sudo apt-get install -f   But it got stuck on "Bluetooth main config". I restarted the phone, but it didn't want to turn on anymore. I tried the Recover boot option. That worked. I tried install -f again, and this time it worked. But after doing upgrade I still had the same error.


I'm tryng to stress a web server with requests, I used vmstat to get the memory usage of the server, but I don't understand few things.   When the requests start, the free memory decreases and the swpd increases, but after a while, even if the requests continue at the same rate, the free memory goes up. I think it's because the system goes out of free memory, or at least to avoid that before it's to late, allocates new memory with swap memory, am I right? Is there a way to limit the swap memory allocation?

I thought the whole essence of swap was to act as a temporary storage safety net when RAM was full but my swap partition is constantly being used even though I sometimes have as much as 3GB free RAM. Is this normal?


I used Ubuntu via Live CD  on my lenovo laptop which had Windows 8.1 installed on it. Then I decided to install Ubuntu and while doing that I accidentally click next when it said wipe Windows and install Ubuntu, after which my whole HDD got formatted in some weird partition and all my data (250 GB) got lost.   So I tried putting my HDD in an external case and connecting it to another laptop to recover my data with software like (Get Data Back) but when I connected my laptop HDD to another computer and went to management page to initialize the disk it keeps showing data redundancy error, I've tried every single way to get my HDD showing on windows but its not working. Although it still shows in Ubuntu which means my HDD is in good state, so can someone please tell me how to get my Windows partition back so that I can recover my data ?

I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them.


Using Selenium webdriver with chrome browser for automation - Junit or java programming - how to upload a file from desktop(or any folder in pc) to application

I have a complicated interface where uploading a file is three step ( The forum is not allowing me to add screenshots of my window so please try to visualise it) step 1 click on browse tab and select a file to upload( This will create progress bar) step 2 click on start upload button Step 3 click on finish button firebug information about the elements on the page have been pasted at the bottom of the page. Id of my browse button is fileInputUploader  The code I am using to try and upload the file is ( within my test class)  WebElement upload = driver.findElement(By.id("fileInputUploader")); upload.sendKeys("C:/Users/Deepankur/Desktop/Deepankur Folder/selenium Test Cases/test12.jpg");   But it's not doing anything  I am not able to see that upload progress animation in step 2, so I can click on start upload and finish it. Any help will be much appreciated.  Here is the html for this section of my page
  <input width="110" type="file" height="30" id="fileInput" name="fileInput" style="display: none;"><object width="110" height="30" type="application/x-shockwave-flash" data="/core/webcore/swf/uploadify.swf" id="fileInputUploader" style="visibility: visible;"><param name="quality" value="high"><param name="wmode" value="opaque"><param name="allowScriptAccess" value="always"><param name="flashvars" value="uploadifyID=fileInput&amp;pagepath=/core/root/&amp;script=/core/application/pApproval/uploadify.cfm&amp;folder=//192.168.100.51/client_data/CPM_ConcretePlatform_DEV/userUploads&amp;scriptData=project_id%3D19%26client_id%3D2172%26project_file_type%3D2%26file_zone_id%3D104%26file_zone_group_id%3D17%26parent_project_file_id%3D0%26approval_rule_id%3D10%26job_id%3D519%26status_id%3D17&amp;width=110&amp;height=30&amp;wmode=opaque&amp;method=POST&amp;queueSizeLimit=20&amp;simUploadLimit=1&amp;fileDesc=Please see the list of allowed file extensions under More Help Uploading&amp;fileExt=*.jpg;*.tif;*.pdf;*.qxd;*.eps;*.psd;*.zip;*.doc;*.ppt;*.xls;*.pdf;*.mov;*.ai;*.png;*.bmp;*.ait;*.dwg;*.dxf;*.flv;*.indd;*.txt;*.inx;*.gif;*.cad;*.docx;*.xlsx;*.pptx;*.mpp;*.m2v;*.avi;*.vob;*.mpg;*.wmv;*.mp4;*.m4v;*.misc;*.ppsx&amp;multi=true&amp;sizeLimit=26214400&amp;fileDataName=Filedata"></object>

  Start Upload


I am looking to purchase a new laptop but do not want to run Windows. In order to utilize both the new laptop and Ubuntu to their fullest, I want to verify that the hardware is fully compatable with the OS.  Is there a compatability matrix available that can be used to verify this? Does the hardware need to support open drivers or something similar?

Before I buy my next laptop, I'd like to make sure that it will work perfectly with Ubuntu. Is there a list of completely supported computers anywhere?


My understanding is that if a problem is in NP, there is a nondeterministic polynomial-time Turing machine that decides it. That is to say, if an NP problem has a solution, the NP machine has a poly-length computational path on its computation tree (length < p(n) for some polynomial p, input length n)).  But doesn't that imply that NP = coNP? Because the definition of coNP is that there is an NP machine that decides if the problem's answer is false. We can design such an NP machine easily: run the first NP machine for p(n) steps, and if it hasn't accepted yet, output TRUE. But if a path accepts, output FALSE.

Suppose a language L is in NP. I think that means a nondeterministic Turing machine M can decide it in polynomial time. But then shouldn't it be in co-NP, because can't we define a new Turing machine M' that accepts whenever M rejects and rejects whenever M accepts? Why doesn't NP equal co-NP?  Thanks!


I have a Drupal 8 site on an Ubuntu 18.04 server and want to move my site to a new server with Ubuntu 20.04. With Drupal 7 I did these steps Create a set of keys (on the new server) : $ sudo ssh-keygen -t rsa -b 4096 -C root@www-example-com $ sudo cat /root/.ssh/id_rsa.pub  Add the public key (on the old server) : $ sudo nano /root/.ssh/authorized_keys  Export the database (on the old server) : mysqldump -u root -p www_example_com > /var/www/www-example-com/share/www-example-com_$(date +%F).sql  Repatriate the site file (on the new server) : $ sudo scp -r -p root@xxx.xx.xxx.xx:/var/www/www-example-com/ /var/www/www-example-com/  Import the database (on the new server) : mysql -u root -p www_example_com < /var/www/www-example-com/share/www-example-com_2020-08-10.sql  That's all, with these intructions, the Drupal 7 site works. The problem Now with Drupal 8 there is Composer with a new folder and file tree present in the var directories and in home. How to move a Drupal 8 site to a new server ?

I am attempting to upgrade my Drupal 8.9.2 multi-site installation to D9. I was hoping to work this all out on a development installation, that is located in a subdirectory of my home directory on my NameCheap Shared Hosting plan. When I first installed this installation, I did so using the tarball method from years ago. I then followed the instructions given here (). I was able to get the current running prod version converted to use composer with out an issue. Before I go and start messing with the files, and attempting to upgrade to D9 through composer on a prod installation, I wanted to copy these files over to another installation where I can use it as a sandbox. To do this I:  copied the files on my server to a new directory made clone databases for the new installation truncated all the cache tables in the cloned DB changed all the database settings in the settings files to point to the cloned databases  I've done this before without any issues, and now I seem to be getting a WSOD error on all the sites running from the new installation. The error I'm getting is  PHP Fatal error:  Uncaught Error: Class 'Drupal\Core\Cache\DatabaseBackend' not found in ~/{new installation dir}/public_html/index.php:16.  If anyone has any thoughts what's going on I am all ears. Thank you in advance


Is there an official (ie, FX Cop, Guidance on MSDN, etc) way to organize the Properties, Methods and Events in a class file?  I know this can be seen as a "preference" and I have seen it done many different ways, typically:   Constructor Properties Events Methods, in alphabetically order.   My goal is to have a well organized class file which becomes important as the size of the class file gets rather large.  (Therein is a different topic, splitting a class which is too large.)  It also becomes important when multiple developers are working together so there is an agreed upon standard.  So I am looking for something "official" I can use as a reference for this.

Is there an official C# guideline for the order of items in terms of class structure?  Does it go:   Public Fields Private Fields Properties Constructors Methods ?   I'm curious if there is a hard and fast rule about the order of items? I'm kind of all over the place. I want to stick with a particular standard so I can do it everywhere.  The real problem is my more complex properties end up looking a lot like methods and they feel out of place at the top before the constructor.  Any tips/suggestions?


Let's say, that I'm at a sleepover and got put in the corner with no direct way of getting to the door without disturbing other people. If I wake up, having to use the restroom or get a drink, I get extremely anxious and have to find some complicated way of getting around the other people without waking up, which can get so bad that I start sobbing. I have always had this problem ever since I was a kid and I would get really scared to wake my mom up if I threw up or she slept in too long. Is there a phobia-suffix word for this or a way to get over it?  Duplicate of

I usually come home after basketball at like 12:30 a.m. and at this time my mom and sister usually sleep (my Dad though is usually up). When I come home, I don't go to sleep right away and will sometimes eat or do something else. When I do so, I do it in stealth, so that I don't wake up anyone. I do out of two things, to be polite as I do not want to wake anybody up and also the fact that if I make a loud noise and wake my mom up, my mom will get mad and lecture me. Does this count as a phobia? In addition, if it does what would the name of it be.


I am testing gcc version 8.2  gcc seems to be treating long long int as int. Is there any way to fix this?   Here is the code:  #include <stdio.h> #include <stdlib.h> #include <limits.h> #include <float.h>  int main(int argc, char** argv) {      printf("INT_MAX     :   %d\n", INT_MAX);     printf("INT_MIN     :   %d\n", INT_MIN);     printf("LONG_MAX    :   %ld\n", (long) LONG_MAX);     printf("LONG_MIN    :   %ld\n", (long) LONG_MIN);     printf("UINT_MAX    :   %u\n", (unsigned int) UINT_MAX);     printf("ULLONG_MAX   :   %lu\n", (unsigned long long int) ULLONG_MAX);     printf("Big Integer   :   %lu\n", (unsigned long long int) 1234567890123456);      printf("%d\n", sizeof(long long int));     return 0; }   output:  INT_MAX     :   2147483647 INT_MIN     :   -2147483648 LONG_MAX    :   2147483647 LONG_MIN    :   -2147483648 UINT_MAX    :   4294967295 ULLONG_MAX   :   4294967295 Big Integer   :   1015724736 8   C:\prog_c\c_pro>gcc --version gcc (MinGW.org GCC-8.2.0-5) 8.2.0 Copyright (C) 2018 Free Software Foundation, Inc...

#include <stdio.h> int main() {     unsigned long long int num = 285212672; //FYI: fits in 29 bits     int normalInt = 5;     printf("My number is %d bytes wide and its value is %ul. A normal number is %d.\n", sizeof(num), num, normalInt);     return 0; }   Output:  My number is 8 bytes wide and its value is 285212672l. A normal number is 0.   I assume this unexpected result is from printing the unsigned long long int. How do you printf() an unsigned long long int?


If you have access to Wish, you can use this spell is to duplicate any other spell of 8th level or lower. You don't need to meet any requirements in that spell, including costly Components. The spell simply takes effect. And Glyph of Warding specifies that you can store a prepared spell of 3rd Level(8th level for up cast) or lower in the glyph by casting it as part of creating the glyph. Does Wish simply allow you to duplicate the full effect of both the spell of Glyph of Warding as well as the spell you would have prepared, or as per using Wish to create a glyph, would you be left with a Glyph of Warding that has no spell stored in it? I have yet to find any mention of the interaction between these two spells other than storing Wish into a glyph, no where have I seen mentioned the question of if you can Wish for a Glyph of Warding pre-loaded with something like Simulacrum. Alternatively, would it work, but just end up requiring you to spend the 12 hours casting time to load Simulacrum in the Glyph and still require you to have it under your prepared spell list?

Suppose I want to use  to cast an 8th-level  (for free) and store a spell in it. Do I still need to supply the spell to be stored by casting it using another one of my spell slots? If so, this would limit me to only storing spells I can cast, and would require expending a second spell slot as normal.   Or does the wish spell take care of all of that, allowing me to wish the ward into existence with only a 9th level spell slot and choose any valid spell from any class's spell list?


The horse I bought from the stables next to Whiterun starts to walk away when I dismount it. I bought another horse to fix this problem. It is the palomino one from one of the northern Holds. This one does not run away when I dismount it, but the other one still does. Is there any way to fix this?  I know it is not necessary to fix the Whiterun horse since the other one is working, but I'm just curious as to why this is happening. I have tried loading previous saves, but that hasn't worked.

I purchased a horse in Skyrim, and he simply refuses to wait for me. At first I thought it was because I was near a city. But even in the wildest part of Tamriel, it still trots away whenever I stop riding him. I tried with another horse, same thing. They basically act like wild horses when I gave hardly and honestly (kinda) gained money for them. It's not due to any mods, I started a game without any and still the same thing.  So yeah... Any idea how to fix that bug?


Can i enlarge an image without losing quality? You know, like in cool movies people do. Like so:

So I watched the following .  In the clip, using what seems to be the recording from a standard bank camera, they zoom in at least 100, and see the image of the culprit in the reflection of the eye of the girl.  Now, I thought this was completely ridiculous, so much so that I thought it was actually really funny.    However, my friend argued that there are very good tricks for image enhancement, such as "super resolution" a procedure where multiple frames of a video to produce a much higher single resolution image.   He did think the show bends the truth quite a bit, but how much?  Honestly, I don't actually know anything about these things, so my question is:     How good is modern image resolution enhancement?  Also, how far off are the CSI television programs?    Thank you,  Remark: This is  on the Skeptics site.  I was told I might receive better answers here.


I have an arduino uno and want to use a non MLX90614. I plan to used more than one sensor on the same Arduino but I don't know how to use two MLX90614 on the same I2C bus.

I have multiple devices with the same address, and only one I2C bus. If I don't want to/can't use an address multiplexer, will the following arrangement work? (sorry for the messy schematic)          – Schematic created using   SW1 and SW2 are microcontroller I/O, and are pulled low when we don't want to talk to the corresponding IC, and set to high impedance when we do want to talk to that IC. Can anyone see any problems with this, apart from with clock stretching? Assuming you choose diodes with a small voltage drop, like a schottky.  Edit:   Also assuming that the VIH and VIL all worked out with the diode drop and the VOH VOL.   The diodes could also go on the data lines instead, not sure if there would be any benefit/difference (maybe some I2C devices do something special when the clock goes low even if it's not their address? It's probably safer to not clock at all i.e. have the diodes on the clock lines.


I have multiple kernels installed. I'm trying to create a script that would temporarily set the the next boot to the stock Ubuntu kernel. From my online research, I understood that the kernel order is the result of the following command awk -F\' '/menuentry / {print $2}' /boot/grub/grub.cfg, where the first line is 0. This is the output when I run the command: root@server150:~# awk -F\' '/menuentry / {print $2}' /boot/grub/grub.cfg   Ubuntu Ubuntu, with Linux 4.9.24 Ubuntu, with Linux 4.9.24 (recovery mode) Ubuntu, with Linux 4.4.0-81-generic                    # <- I want this Ubuntu, with Linux 4.4.0-81-generic (recovery mode) Memory test (memtest86+) Memory test (memtest86+, serial console 115200)  Since I need the fourth line, I ran grub-reboot 3. However, this boots into a memtest. Am I doing something wrong? How can I create a script that when executed, would always set the next boot to the stock kernel? PS: I'm eventually doing it in ansible, but since I couldn't find a module for it, I'm using bash. Thanks ahead!

I'd like to ask for help getting grub-reboot to work.  The theory: According to  (and other sources) I should be able to choose the kernel for the next reboot, using grub-reboot. However, this does not work for me; grub always boots to the default kernel.  Here's what I tried:  $ grep GRUB_DEFAULT /etc/default/grub GRUB_DEFAULT=saved $ grep "menuentry " /boot/grub/grub.cfg  menuentry 'Ubuntu' --class ubuntu --class gnu-linux --class gnu --class os $menuentry_id_option 'gnulinux-simple-f3a807d1-3fd6-4970-b741-5382e9801060' {     menuentry 'Ubuntu, with Linux 4.4.0-43-generic' --class ubuntu --class gnu-linux --class gnu --class os $menuentry_id_option 'gnulinux-4.4.0-43-generic-advanced-f3a807d1-3fd6-4970-b741-5382e9801060' {     menuentry 'Ubuntu, with Linux 4.4.0-43-generic (recovery mode)' --class ubuntu --class gnu-linux --class gnu --class os $menuentry_id_option 'gnulinux-4.4.0-43-generic-recovery-f3a807d1-3fd6-4970-b741-5382e9801060' {     menuentry 'Ubuntu, with Linux 4.4.0-36-generic' --class ubuntu --class gnu-linux --class gnu --class os $menuentry_id_option 'gnulinux-4.4.0-36-generic-advanced-f3a807d1-3fd6-4970-b741-5382e9801060' {     menuentry 'Ubuntu, with Linux 4.4.0-36-generic (recovery mode)' --class ubuntu --class gnu-linux --class gnu --class os $menuentry_id_option 'gnulinux-4.4.0-36-generic-recovery-f3a807d1-3fd6-4970-b741-5382e9801060' {  # Version 1, using the name $ sudo grub-reboot "Ubuntu, with Linux 4.4.0-36-generic"  # Version 2, using the id $ sudo grub-reboot gnulinux-4.4.0-36-generic-advanced-f3a807d1-3fd6-4970-b741-5382e9801060  # Version 3, counting $ sudo grub-reboot 3   Neither of these commands seem to have an effect; after reboot, I always end up with the 4.4.0-43 kernel.  Note: This is on Ubuntu 16.04 Xenial. It is a server machine and I don't have access to the console during boot, so I can't look at the grub menu :(


java.lang.NullPointerException: Attempt to invoke virtual method 'java.lang.String java.lang.String.substring(int, int) Fatal Exception main

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


As you know there are two forms of lowercase letter A: 'a' and 'ɑ'. I am writing a linguistics article and use IPA where the two characters denote different things. There are cases where I want to type an italic 'a' but the italic form of this letter (at least in my Latex) looks like an italic 'ɑ'. Is there a way type a proper italic 'a'? I'm using Xelatex (I'm willing to switch if necessary). Is there maybe a font that can handle the issue?

I am writing a document with XeLaTeX in which I use IPA characters in italicized text. After trying a few fonts with extensive IPA support like Gentium Plus, Brill or Charis SIL, I encounter the same problem: the vowels a and ɑ are given the same character in italics, even though they are differentiated in plain text.  While not a tragedy, this is both quite shocking and a little troubling. I assume that a number of people will also have come across this issue.   Is there a straightforward way in TeX to get actually different italic shapes for the two characters?  -- Edit for clarification:  One would think that losing the distinction between two characters is grave enough in and of itself. Still, it does have actual implications: you become completely unable to capture the distinction between words like 'Sam' /sam/ and 'psalm' /sɑm/ (in some English varieties).  Let's see it in action in a French gloss to realize that this can indeed be a big issue:  Le chien a mis sa patte dans ma pâte.     /lə ʃjɛ̃ a mi sa pat dã ma pɑt/     the dog has put its paw in my dough     "The dog put its paw in my dough."   In italicized text (for many reasons: an italicized line in glosses, a transcribed word quoted in italics, etc.), because of the problem reported in this post the /pat/ - /pɑt/ distinction is completely lost.


I have an external hard drive that was used on a linux system to store a bunch of data.  I no longer have access to that linux system any more but would like to view the files on a Windows machine.  Is there a way to view these files without the use of a virtual machine, or booting into a linux distro?

Is there a way to read ext4 partitions from Windows? If so, what can I do?


I'm new to Ubuntu. I'm running Ubuntu 14.04.1 LTS.   My problem is that when I try to access my desktop or any folder at my home directory, it always gives me this error   No such file or directory   even though the folder exists and I can see it with the ls command

How do I change directories to downloads, from the home folder, in the latest version Ubuntu 12.10? I tried cd /downloads, but it gave an error saying that there is no such directory.


I am making a project using at89c51. I used my mobile charger (output: 5V, 1A)  as the power supply. Will my IC get damaged due to the high current?  I asked cause, without loading the program I connected the pin40(Vcc) and pin20(gnd) just to check whether all the port pins except port0 give output 1 or not, which is as I believe by default. And I got haphazard values which changed everytime I turned the supply off and on.  I also couldn't find the supply current range in the datasheet so got more confused.  Please advise.

Power supplies are available in a wide range of voltage and current ratings.  If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify?  What if I don't know the device's specs, but am replacing a previous power supply with particular ratings?  Is it OK to go lower voltage, or should it always be higher?  What about current?  I don't want a 10 A supply to damage my 1 A device.


I'm on Yosemite at the moment I want to upgrade but I fear it will break my applications. I have a MacBook Pro (Late 2011) 15''. The last time I updated my Logic Pro 8 broke and I was forced to pay $200 for Logic Pro X (it is my theory that Apple did that on purpose) but either way, what is your suggestion on the Operating System nonsense?

I understand the move past Snow Leopard meant losing Rosetta, and compatibility with any PPC apps.   Since there are some apps that can't be replaced (for example, old years of TurboTax that I might need to reference) I have a drive to boot Snow Leopard, and one for Yosemite. I was considering the jump to El Capitan, when I saw the question  which got me wondering the question -     Before installing a next generation OS, is there any way to find, in   advance, which apps I have that would be orphaned by the move?   Edit, the answer below from Jean Valjean was what I needed. One app concerning me appeared as follows:    It might be tedious to search many apps, but at least this gives me a chance to view the top ones that will cause me grief.


Could it be done or not?  E.g. I want to be ble to upload an image when creating a new taxnomy term.  So, when I create a new term called Mercedes in my custom made taxonomy called brands how can I add a file picker field to that term so I can upload an image of Mercedes logo?  Is it even possible to upload a file for taxonomy?

I couldn't find the solution anywhere else, so I believe is a valid question for this website. I think my problem is divided in two parts. I created a custom taxonomy called "Type" and within it, I have terms (tags) like "cool", "sad", "amazing"..and so on.   1) I want to associate an icon for each one of my terms. 2) I want to display those icons (within link to the term archive) in my front page, like a feature image for each post.  No idea how to do that. Help please.


Once upon a time on Stack Overflow I remember I was able to check my editor status. I.e. how many more edits I needed to be awarded editor badges, a summary of the proposed edits and the percentage of the accepted ones. I now cannot find that summary any more.  It may sound like a kind of stupid question, but can you point it out to me, if it still exists?

I am trying to obtain more badges on Stack Overflow. For example, to gain Archaeologist I need to edit 100 inactive posts but I am not keeping track of the number of posts I've edited. For Deputy I need to raise 80 helpful flags, etc. How can I view all my statistics about the badges, such as how many more edits I need to do, etc. I'm not doing it for badges, but I can spend a bit more effort if I'm close to getting a badge.


I have ONE VM instance (16 simulated cores) in a cloud provider with Windows Server 2019 Standard on it.  I do NOT want to install VMs inside it. I only want to use OS itself.  Cloud provider is charging me ~3,300 EUR/year for this license (only OS, no remote access CAL's).  This seems like really really expensive just for one OS license.  They say I can not buy and use my own license (~1000EUR one time cost) because it is virtual machine and I will need Datacenter edition. Are they giving me correct info? At the same time other clouds offer Standard edition for ~550EUR/year on dedicated servers.

This is a  about Licensing.    Questions on licensing are off-topic on Server Fault.  If your question has been closed as a duplicate of this question, then this is because we want to help you understand why licence questions are off topic rather than just telling you "it just is". In all likelihood, this question will not address your question directly, it was not meant to.    I have a question regarding software licensing. Can the Server Fault community please help with the following:   How many licenses do I need? Is this licensing configuration valid? What CALs do I need to be properly licensed? Can I run this product in a virtual environment? Can I downgrade this product to an earlier version? Am I entitled to feature X with license Y?


In my code I have two line sections. But I want it in 1 line in header . What can I do?  \documentclass{biditufte-handout} \usepackage{ptext}  \usepackage{fancyhdr}  \pagestyle{fancy} \fancyhf{} \fancyhead[L]{\leftmark} \renewcommand{\headrulewidth}{0pt}  \usepackage{xepersian} \settextfont{Yas} \reversemarginpar   \begin{document}  \section{یک عنوان \\ بخش} \ptext[1] \end{document}     This picture is my goal:

How can I format the header on every page displaying the title of the current chapter? In one of my chapters the title is too long so it is running out of the page.  Here's a minimal example of my document:  \documentclass[bibliography=totoc,version=first,listof=totoc,BCOR5mm,DIV12,index=totoc,numbers=noenddot]{scrbook} \usepackage{bibgerm} \usepackage[english,german]{babel} \usepackage[utf8]{inputenc} \usepackage{a4wide} \usepackage{wrapfig} \usepackage{caption}  \begin{document} \frontmatter \mainmatter \chapter{Very long title} \backmatter \end{document}   Here's a screenshot of my problem:


I have a small assignment for uni which I seem to be stuck with. The application is suppose to be a quiz program which reads questions and answers from a text files and stores them like a flash card. My problem is that my buffered reader seems to be returning the nullPointer exception when it tries to read from the file. I'm unsure why this is. I will provide all code and highlight the error in bold. After doing a bit of debugging I found that the readLine method was returning null. Any thoughts? Thanks a lot. Error is at String[] line = getLine().split(":");  text file is in the format question:answer  import java.io.IOException; import java.util.ArrayList; import java.util.Scanner;  public class Quiz {     private ArrayList<FlashCard> flashCards;     public static void main(String[] args){         Quiz quiz1 = new Quiz();     }     public Quiz(){         FlashCardReader cardReader = new FlashCardReader();         try {             if(cardReader.isReady()==true){             flashCards = cardReader.getFlashCards();             play();             }         } catch (IOException e) {             e.printStackTrace();         }     }     private void play(){         Scanner userInput = new Scanner(System.in);         String answer = userInput.nextLine();         for(FlashCard card: flashCards){              System.out.println(card.getQuestion());             System.out.println("********************");             sleep(10000);             System.out.println("Enter your answer:");             answer = userInput.nextLine();             if(card.getAnswer() == answer){                 System.out.println("Correct.");             }else{                 System.out.println("Incorrect. The correct answer is " +     card.getAnswer() + ".");             }          }     }     private void sleep(int x){         try {             Thread.sleep(x);         } catch(InterruptedException ex) {             Thread.currentThread().interrupt();         }     } }     import java.io.BufferedReader; import java.io.FileNotFoundException; import java.io.FileReader; import java.io.IOException; import java.util.ArrayList;  public class FlashCardReader {     BufferedReader reader;     public FlashCardReader(){         try {             reader = new BufferedReader(new FileReader("Questions.txt"));         } catch (FileNotFoundException e) {             System.err.println(e.toString());         }       }     public String getLine() throws IOException{         return reader.readLine();     }     public Boolean isReady() throws IOException{         return reader.ready();     }     public ArrayList<FlashCard> getFlashCards(){         ArrayList<FlashCard> flashcards = new ArrayList<FlashCard>();         try {             for(int i = 1; i <= reader.lines().count(); i++){                 **String[] line = getLine().split(":");**                 System.out.println(line[0]);                 flashcards.add(new FlashCard(line[0],line[1]));             }         } catch (IOException e) {             System.err.println(e);             e.printStackTrace();         }             return flashcards;      } }     public class FlashCard {     private String question;     private String answer;     public FlashCard(String question, String answer){         this.question = question;         this.answer = answer;     }     public String getQuestion(){         return question;     }     public String getAnswer(){         return answer;     } }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I'd like to write something very similar to the algorithm shown below, but using the algorithmicx package.  (This example comes from p. 152 of the book  by Boyd and Parikh.)  How can I have a "repeat" statement without a corresponding "until" statement using algorithmicx?  (I mention the algorithmicx package specifically because I think it's more customizable than other algorithm packages.)

algpseudocode lets me write code such as:  \documentclass{article} \usepackage{algpseudocode} \begin{document}  \begin{algorithmic} \While{$n>3$}    \If{$m>n$}       \State ...       \State ...    \EndIf    \If{$m>2$}       \State ...    \EndIf \EndWhile \end{algorithmic}  \end{document}   Yielding results similar to  while n>3    if m>n        ...        ...    end if    if m>2        ...    end if end while   I'd like all of that "end if", "end while", "end procedure" text to disappear and everything to compress upwards such that the result is:  while n>3    if m>n        ...        ...    if m>2        ...   That is, I'd like a Pythonic-style where indentations indicate blocks.  Can algpseudocode do this? Or is there another package with similar functionality?


How some standard package (eg R, SAS or Excel) calculate Standard error for the estimated parameters for a model.     my understanding : While using gradient descent optimization method( as performed in Machine learning tutorial from Andrew Ng) we get a point estimate (right?) But suppose I have to find the confidence interval of the estimated parameters we'll have to form multiple samples using bootstrap(or any other method?) to find parameters for each sample. Then we can calculate the sample mean , std error and thus call Z-score to calculate the confidence interval of the estimate.  Am I thinking in the correct direction?

I'd like to know what technique or techniques are used by regression packages, (in particular the lm function of R) to minimize the sum of squares.   Does it use gradient descent?  Thanking in anticipation.


I have a simple donut chart that I created using d3. My code is very simple and I have a text inside the donut chart that I added using <text> element. Something similar like this example , but much simpler.           var style = {                 'font-size': fontSize,                 'text-anchor': 'middle'             };              svg.append("text")                 .attr("dy", dy)                 .style(style)                 .attr("class", "dataText")                 .text("100%");         }   Everything works fine, however when I tested in Windows high contrast mode (alt + left shift + Print screen) this text doesn't show up. If I change my text to yellow, this will show in high contrast. However, for normal user, I need this to be black.  What I tried so far: 1) I tried to detect high contrast mode using @media query suggested in  and change fill color to be yellow during high contrast mode only, but seems like FF has a bug about this. 2) From this , they suggested to set color / border to be transparent. No luck still.  Anyone encountered this issue before? What did you do to make this accessible? I tried to open NVD3 (using D3) examples page in high contrast and looks like they are having issue for their text element as well.  Pie chart in normal mode:   Pie chart in high contrast mode (text doesn't show):

I just want a simple SVG image that has some arbitrary text on an angle, which I can do.  Thing is, I also want the text to have a sort of "outline" effect.  Like rather than a solid D, the inside and outside edges of the letter D are drawn with a line of a specified thickness and the rest of the D isn't drawn at all, so as to look almost "hollow".  Can SVG do this?


Can Intel® Core™ i5-4210U Processor support Ubuntu 16.04 LTS? My laptop is Dell Inspiron 3542.

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


I read on this site, that we put the words "in which" instead of "where". (Now I don't find the cite). Is that true?

Should it be:     Campus is a place in which children study.   or     Campus is a place where children study on.   Which one is correct, or are they both incorrect? Why?   Is there a better version?


I have a only survey level background in network science but am interested in it. I was browsing wikipedia and read this page, (.)  In that article nodes are described as probabilistic.  Is it because of the non discrete time in DNA, or something else? I don't really know why.

From my understanding, dynamic networks are similar to traditional models except that they function in continuous time and have edges and nodes that evolve over time? Is this a correct understanding? Also why are they probabilistic?


I'm trying to reverse a LinkedList using recursive calls, please let me know where I'm going wrong, I'm not able to catch reversed LL head. LLNode is a linkedlist node and ReverseLLRecursively.reverse is the function I wrote for reversing.  Here is my code:  public class LLNode {     private int data;     private LLNode next;      public LLNode(int data, LLNode next) {         this.data = data;         this.next = next;     }      public int getData() {         return data;     }      public void setData(int data) {         this.data = data;     }      public LLNode getNext() {         return next;     }      public void setNext(LLNode next) {         this.next = next;     }      @Override     public String toString() {         return data + "->[" + (next!=null?next.data:"") + "]";     } }  public class ReverseLLRecursively {      public static LLNode newHead = new LLNode(-1, null);      public static LLNode reverse(LLNode head, LLNode newHead) {         if(head==null || head.getNext()==null) {             newHead = head;             return head;         }          LLNode node = reverse(head.getNext(), newHead);         node.setNext(head);         head.setNext(null);         return node.getNext();     }      public static void main(String[] args) {         LLNode ll = new LLNode(1,new LLNode(2, new LLNode(3,  new LLNode(3, new LLNode(2,  new LLNode(3, null))))));          reverse(ll , newHead);         System.out.println(newHead);      }  }

I have been working on a Java project for a class for a while now. It is an implementation of a linked list (here called AddressList, containing simple nodes called ListNode). The catch is that everything would have to be done with recursive algorithms. I was able to do everything fine sans one method: public AddressList reverse()      ListNode:    public class ListNode{   public String data;   public ListNode next; }   Right now my reverse function just calls a helper function that takes an argument to allow recursion.  public AddressList reverse(){   return new AddressList(this.reverse(this.head)); }   With my helper function having the signature of private ListNode reverse(ListNode current).  At the moment, I have it working iteratively using a stack, but this is not what the specification requires. I had found an algorithm in C that recursively reversed and converted it to Java code by hand, and it worked, but I had no understanding of it.  Edit: Nevermind, I figured it out in the meantime.  private AddressList reverse(ListNode current, AddressList reversedList){   if(current == null)        return reversedList;   reversedList.addToFront(current.getData());   return this.reverse(current.getNext(), reversedList); }   While I'm here, does anyone see any problems with this route?


If $X$ and $Y$ are i.i.d. exponential as $f_X(x)=\lambda e^{-\lambda x}$ and $f_Y(y)=\lambda e^{-\lambda y}$, and $Z=\min(X,Y)$, then we may say that probability of event $Z=X$ or $Z=Y$ is $\frac 1 2$. This may be valid for any kind of distribution.   If $X$ and $Y$ are independent but not identical exponential as $f_X(x)=\lambda_x e^{-\lambda_x x}$ and $f_Y(y)=\lambda_y e^{-\lambda_y y}$, and $Z=\min(X,Y)$, then how I can find the probability of event $Z=X$ or $Z=Y$ ?.  Most importantly, I need how to find this probability when $X$ and $Y$ have any kind of continuous distributions which are independent.

Let $X, Y$ be an exponentially distributed random variables with parameters $a, b$. Then $X$ has pdf:    $$f_X(x) =\begin{cases} a e^{-a x},& x\geq 0\\ 0,& \text{otherwise}.\end{cases}$$ Suppose $X$ and $Y$ independent. Show that $$\mathbb P(X>Y) = \frac{b}{a+b}.$$   Now I thought the following: $$f(x,y) = f_X(x)\ f_Y(y) = abe^{-ax -by},\qquad\text{for } x,y > 0.$$ And then $$\mathbb P(X>Y) = \int_0^\infty \int_0^x a b e^{-ax -by}\,dydx$$ However, if I solve this (manually or using Wolframalpha), I can't seem to end up with $\frac{b}{a+b}$. Any ideas?


The easiest/simplest understanding of the web is   a. When you connect to your ISP, the ISP gives a dyanmic address (like a temporary telephone number) only for the duration of that connection, the next time you connect, you will again have a different dynamic IP Address.   b. You use the browser to to different sites which have static IP Address (like permanent numbers or/and permanent address of an establishment).   Now is there a way to get self's IP address instead of going to a web-service like whatismyipaddress.com.   The connection is as follows :-  ISP - Modem/Router - System    Edit - The Modem/Router is a D-Link DSL-2750U ADSL router/modem.   I did see  but that also uses an external web-service, it would be better/nicer if we could do without going to an exernal URL/IP address for the same.

This question:  ""  Solves the question with a call to dig:  dig +short myip.opendns.com @resolver1.opendns.com;   that is the fastest resolution possible, as it involves a single udp packet.  However, that is only one site: OpenDNS, Is there any alternative?  And, makes use of dig, that is not available by default. Again, Is there an alternative?    Note: I needed to solve this problem as the OpenDNS service didn't work locally due to a (also local) redirect of port 53. I finally found out the reason (I had forgotten about the redirect). First, by using this command to find if dnssec is working (locally missing ad flag):  dig pir.org +dnssec +multi   And also using this command to find out if your ISP is redirecting OpenDNS resolutions:  host -t txt which.opendns.com 208.67.220.220   If being redirected, you will get an answer of: "I am not an OpenDNS resolver."


Find all real solutions for the following system:   $$ \left\{  \begin{array}{l} x+y-z=-1 \\  x^2-y^2+z^2=1\\  -x^3+y^3+z^3=-1 \end{array} \right.  $$   From a math olympiad (IberoAmericana, 1992). This was taken from a book, with no answer provided.  My usual tricks using symmetric polynomials appear not to work here (or I'm don't know how to apply them). A possible solution (by inspection) is $(x,y,z)=(-1,-1,-1)$, but there might be others.   Hints and full answers demonstrating all possible solutions are appreciated.

"Find all the possible solutions $(x,y,z) \in$  $\Bbb R$ that satisfies the following equation system".  My teacher gave me this problem and i got some clues in how to solve it. I evaluated $1$ and $-1$ and i got these solutions $(1,-1,1)$ and $(-1,-1,-1)$. I think these are the only ones but i can't prove it.  Am i wrong?, are there more solutions?.   Thanks  $$ \left\{  \begin{array}{c} x+y-z=-1 \\  x^2-y^2+z^2=1\\  -x^3+y^3+z^3=-1 \end{array} \right.  $$


I want to study Riemannian geometry but I don't know a perfect book for beginners, can you give me  references in riemannian geometry for beginners?

Could you recommend some beginner books for Riemannian geometry to me?  I am completely new to Riemannian geometry, but have some basic knowledge of differential geometry.   I am looking for a book in Riemannian which is similarly as light as Tu's "Introduction to Manifolds" for differential geometry. I know that the classical reference is the book of do Carmo, but I have heard some students complaining that its not a book for the absolute beginner.  For the moment, I am just looking for a source to introduce me Riemannian metrics, Riemannian manifolds, curvature, geodesics in a way as clear as possible.  Thank you


I used console commands to have a lot of health, now I can't seem to reset it, I am almost invincible and it takes the fun out of the game please help

I'm pretty sure there isn't a way-explicitly-offered-by-the-game to unset and reinvest health, stamina, and/or magicka advancements, but I'm also curious about exploits, console commands, and/or mods.


I'm investigating floating point accuracy in Fortran 95 and I have the following code:    PROGRAM MAIN   IMPLICIT NONE   integer, parameter :: dp = SELECTED_REAL_KIND(15,307)   REAL(dp), PARAMETER :: DEG2RAD = ATAN(1.d0)/45.d0  ! ---- Calculate sine and cosine   WRITE (*,*) COS(60.d0*DEG2RAD) - DBLE(0.5)   WRITE (*,*) SIN(60.d0*DEG2RAD) - SQRT(3.d0)/2.d0    END PROGRAM MAIN   I'm expecting both of the printed lines to be zero, but only the latter one is. Could anyone explain why that is? Of course I understand that the errors are smaller than double precision, but still the first one prints 1e-16, while the second one shows only zeros. Is there a way to make them both "exactly" zero?

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I have to prove that if $f:X \to Y $ is a continuous function, where $(X, \tau_{X})$ is $T_2$ and first countable and let $D$ dense in X such that $f|_D : (D, \tau_D) \to (f(D), \tau_{f(D)})$ is a homeomorphism, then $f(D) \cap f(X-D)= \emptyset$ My idea: Suppose that $ y \in f(D) \cap f(X-D)$ then exists $a \in D$ such that $f(a)=y$ and exists $b \in X-D$ such that $f(b)=y$. Since $a \in D$ and $b \in X-D$ then $a \neq b$ and since $X$ is $T_2$ exist $U$ and $V$ open in $X$ such that $a \in U$ and $b \in V$. Then $a \in D \cap U \in \tau_D$ and since $f|_D$ is open we have $f|_D (D \cap U) \in \tau_{f(D)}$ And this is what I've done and I don't know how to continue

It is a Dugundji's exercise:  Show that if $X$ is $T_2$, $f \colon (X, \tau) \to (Y, \sigma)$ continuous in $X$ and $f|_{D}$ homeomorphism with $D$ dense in $X$ then $f(X - D) \cap f(D) = \varnothing$.  If I suppose that there is $y \in f(X-D) \cap f(D)$ then exists $x_1 \in D$ and $x_2 \in X-D$ s.t $f(x_1) = y$ and $f(x_2) = y$.  For every nbd $V \in \tau$ of $x_2$ $V \cap D \mapsto U \cap f(D)$ with $U \in \sigma$ because $f|_{D}$ maps open sets in $D$ to open sets in $f(D)$.   Because $f$ is continuos and $y \in U$ then I can find a nbd of $x_2$: $V_1$ s.t. $f(V_1) \subset U$.


If particles are simply regions of space where certain quantum fields have non-zero divergence, are anti-particles simply the corresponding regions of opposite divergence?  This seems like the intuitive answer, especially when considering the process of annihilation. I have heard before that anti-particles are analogous to particles moving through time in reverse, which seems to indicate that an annihilation event is just a point of symmetry in that (arguably, single) particle's history. This analogy breaks down, however, when it comes to gravitation, since there seems to be no evidence of a negative-mass particle.  So what then is the meaning of an anti-particle, when their symmetry is preserved across certain fields, but not other?