I was trying to use the in page search to find a post and... it doesn't work. It just does nothing for a long while, then throws me a we're currently offline for maintenance. While I use an unsupported browser - Vivaldi 3.0.1874.23, another user reports the same issue on firefox on windows. I wish I could give more information, but this is what I have. Jokes about SE search being more broken than usual aside, can we have this fixed please?

Stack Exchange is intermittently failing at random areas. Some issues experienced by me and others:  I got logged out and couldn't log in Stack Overflow intermittently goes down saying it's unavailable Search is broken everywhere Posting was broken at some point/is still broken now


There's a way to setup zsh to not save commands not found to history ?  For example, if by mistake I type:  got push   instead of  git push   then got push entry is added to history file, how to stop this ?

Problem I'm using oh-my-zsh and Antigen to manage my Zsh. Sometimes I will accidentally enter a wrong/failed command into Zsh and it is very annoying when the  throws up these commands. For e.g., say I typed gut status rather than git status. Now, as I attempt to type the correct command again, once I typed g, the autosuggestion plugin will throw up gut status as that is the closest match in recent history. But that is a failed command! What I want to do is to keep these failed commands from "polluting" my history so the autosuggestion plugin will not suggest them. What I have done I've searched for this and the closest match to keeping out entries from the history are that of setting HIST_IGNORE_SPACE, or methods to ignore specific commands, or to delete commands manually after entering them. See  and . But as @Adaephon 52 noted, this takes place after the deed is done. What I'm considering doing What I have in mind right now is to write a function that gets triggered every time a failed command is entered into Zsh to delete the latest entry from history. However, I'm not familiar enough with Zsh to know whether this sort of trigger exists or how to go about doing it.  Note on the accepted solution For those who are interested in this problem, the accepted solution works in the sense that failed commands are not stored in the history file. fc -l or history confirms this. However, it seems that the zsh-autosuggestions plugin is doing its own local caching of sorts (or is generating suggestions using other mechanism), so it will still suggest the failed commands, but only if the session is not over. When the user starts a new instance of the shell, when presumably the plugin has to load the cached history, it no longer suggests the failed commands (unless you enter them again, of course). The proposed solution is technically correct as I (mistakenly) framed my question in such a way that it only requires an answer that stops Zsh from storing the failed commands and the accepted solution does that (albeit in a limited way; See link in solution for details). Anyone who is familiar with shell scripting (I'm not) and motivated enough  can check the .


I have found this post:  My question is more specific >> Can I publish feature layers to ArcGIS server from QGIS using WMS?

Is it possible to connect a QGIS Desktop 1.8.0 to an ArcGIS Server 10.0 ? and of course publish services on it?.   The configuration would be like this Quantum GIS-> ArcGIS Server 10.0 on Amazon EC2+ POstgreSQL (+PostGIS)-> web app.   Is it possible to create a configuration like this? Do you think I could use it for networking?


I know, this problem is quite ordinary, and given enough time, I might be able to figure this one out myself, but I am also a little bit pressed for time. I'd like to include the following sentence in an application paper for a conference:  The philosophical question What is truth?, and the seemingly “moral” question What is good (behavior)?, ultimately refer to the same process...  Simple question: Is the punctuation admissible in formal english?  Thanks and best regards

The goal is to answer questions of the form "is vertex v connected to w?" in constant time.   Should the question mark be there?  A related question is how this sentence might be made better?


Sorry if this is a stupid query, but I spent ages getting the Samsung NP905S3G to boot from usb and eventually got it to work. Wanted to try a dual-boot alongside windows 8 first and the install seemed to work but I now can't figure out how to boot the laptop in ubuntu without the usb. It keeps starting in windows no matter how I configure the BIOS. Any help welcome. Thanks Edited to explain further : I think Ubuntu has installed successfully. My problem now is getting it to boot.

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


Given continuous and Periodic function, How can I prove that it is Uniformly continuous?  Thank you!

A function $f:\mathbb{R}\to \mathbb{R}$ is periodic if there exits $p>0$ such that $f(x+P)=f(x)$ for all $x\in \mathbb{R}$. Show that every continuous periodic function is bounded and uniformly continuous.   For boundedness, I first tried to show that since the a periodic function is continuous, it is continuous for the closed interval $[x_0,x_0+P]$. I know that there is a theorem saying that if it is continuous on a closed interval, then it is bounded. However, I'm not allowed to state that theorem directly. Should I just aim for a contradiction by supposing f is not bounded on the interval stated above?


I was auto-banned from posting new questions in Stack Overflow. I have earnestly tried to improve my questions. Please review them once more. The questions are listed below:

If you are reading this, you may have been affected by one of our post quality bans. If so, it is important that you  to understand what has happened and how to regain the permissions that you lost. While trying to ask a question, one could see:  We are no longer accepting questions from this account. See  to learn more.  Likewise, for answers:  We are no longer accepting answers from this account. See  to learn more.   Why am I getting this message? Are deleted posts taken into account too? Is a question/answer ban the same as a suspension? How do I avoid getting a question ban? How long do I have to wait before I can post again? What can I do to release the ban? How can I reactivate my account? Can I simply create a new account? I'll just ask somewhere else on the SE network, and they'll migrate my question to the correct site! Will a ban on one Stack Exchange site affect my standing on other sites in the network? Does this apply to meta sites too? My account is in good standing. Why am I still blocked?


In Polish typography, one should avoid putting prepositions at the end of the line. Example: Nie wiedziałem, że nie umieszcza się przyimków na końcu strony. - bad Nie wiedziałem, że nie umieszcza się przyimków na końcu strony. - good    Can I force LaTeX to put ~ after every word that is a preposition (e.g. w, z, na, o etc...) so I don't need to put them manually?

This question led to a new feature in a package:      I come from Poland and I'm writing some text in my native language. One of our typography standards is that we do not leave one-letter words at the end of a line. For example:  Mietek poszedl do sklepu i kupil jabola   is illegal, and correctly it should be as follows:    Mietek poszedl do sklepu  i kupil jabola   I don't know if there is such a rule in US/English typography also, but I cannot find any latex setting that would fix such errors. The only solution I've found so far is to add the "~" character, which seems to work as whitespace, but also prevents to break connected words between lines. So I have to write:  Mietek poszedl do sklepu i~kupil jabola   Is there any other way to do so? I've tried with   \widowpenalty10000   \clubpenalty10000    which prevents orphans, but it seems that 'orphans' for us (Polish) is something different than for Americans ;) In the US orphan is the first line of a paragraph on the last line of a page (at least I think so), but for us, 'orphan' is such a single-letter word at the end of a line.


My email address is guerrero.daisy@gmail.com. I have been receiving emails from guerrerodaisy@gmail.com. I am concerned that this user is receiving my emails as I have been receiving her emails. How do I correct this situation?

E.g.: If your Gmail ID is abc.xyz@gmail.com, it considers this the same as abcxyz@gmail.com.  Why is this so?


does 14.04 support all the softwares which work in window 8.1 like photoshop , corel draw, and all games like nfs, xmen, pes ? I don't need any antivirus for this 0S , right ?  Pls reply

Can .exe and .msi files (Windows software) be installed in Ubuntu?


I have this in my css file  and html file.    .prodhome-boxshadow{     padding: 10px;     box-shadow: 5px 10px 18px #888888; }  .prodhome-category {      width:22%;      float:left;      margin:0 1.65% 3.55%; } .prodhome-category img {      max-width:60%;      height:auto;      margin:0 5%;      align-content: center; }

Product-title

     what I get is the box shadow does not encompass the product title and image. Instead I get the box shadow display above where the products are and ends before the Producttiles are displayed.   How can I accomplish this?

I'm pretty accustomed to clearing my floats by using <br style="clear:both"/> but stuff keeps on changing and I am not sure if this is the best practice.   There is a  (from positioneverything) available that lets you achieve the same result without the clearing div. But... they claim the hack is a little out of date and instead you perhaps should look at . But.. after reading through 700 pages of comments :) it seems there may be some places the latter hack does not work.   I would like to avoid any javascript hacks cause I would like my clearing to work regardless of javascript being enabled.   What is the current best practice for clearing divs in a browser independent way?


On a game show, the Monty Hall problem is being played. The contestant is told to pick a door, and he does, but just before being able to tell the host which door he picked, one of the doors that the contestant had not chosen gets knocked over by a poorly-hung light post, revealing a goat.   The host decides to continue the game, and asks the player to pick a door.  Does the player now have a 1/3 chance, a 2/3 chance, or a 1/2 chance of winning if he switches?    I don't understand why the chance after the event would be 1/2. Imagine that two Monty hall games are being played at once: one where the host picks randomly (chance of winning before entry of 1/2), and one where the host picks a door with a goat that the player has not picked (chance of winning before entry of 2/3).  In the random game, the contestant is asked to pick a door, and he picks door A where there's a goat. In the logical game, the contestant picks door A too, where there's another goat.  In the random game, the host (or the accident) randomly opens door B, revealing a goat. In the logical game, the host opens door B because he knows the other goat is there.  Now, both players are asked to choose a door. Why does the random game's player have a different chance of winning than the logical game's player?

Many of us know the   But the other day I was asked a variation of this riddle.  The answer of the original question is, of course, $ 66\% $ in favor of changing doors, but this is based on the fact that the game show host knows where the prize is.  Suppose he does not know where the prize is, and after you make your pick, he opens one of the other two doors and it happens to be a goat. Is it still better to change doors when he asks?   I believe it is. (After all it still leaves us with two chances instead of one.) But some of my friends think otherwise. We are not mathematicians, just a couple of riddle-likers, so we are not sure of the correct answer. So I thought to post it here.  Edit :   I read this on wikipedia and if I understand it correctly it seems to support my answer:  Morgan et al. (1991) and Gillman (1992) both show a more general solution where the car is (uniformly) randomly placed but the host is not constrained to pick uniformly randomly if the player has initially selected the car, which is how they both interpret the well known statement of the problem in Parade despite the author's disclaimers. Both changed the wording of the Parade version to emphasize that point when they restated the problem. They consider a scenario where the host chooses between revealing two goats with a preference expressed as a probability q, having a value between 0 and 1. If the host picks randomly q would be 1/2 and switching wins with probability 2/3 regardless of which door the host opens. If the player picks Door 1 and the host's preference for Door 3 is q, then in the case where the host opens Door 3 switching wins with probability 1/3 if the car is behind Door 2 and loses with probability (1/3)q if the car is behind Door 1. The conditional probability of winning by switching given the host opens Door 3 is therefore (1/3)/(1/3 + (1/3)q) which simplifies to 1/(1+q). Since q can vary between 0 and 1 this conditional probability can vary between 1/2 and 1. This means even without constraining the host to pick randomly if the player initially selects the car, the player is never worse off switching. However, it is important to note that neither source suggests the player knows what the value of q is, so the player cannot attribute a probability other than the 2/3 that vos Savant assumed was implicit.  What are your thoughts?


I know ∇f(x,y) is perp. to a graphs contour lines and points in the direction of greatest ascension implying it lies along the surface and pointing up the slope at each point. So I cant understand how ∇f(x,y) can be the normal vector to the surface at a point as well as shown in image 2.

I'm having some trouble trying to visualize and physically understand what's happening with the gradient.  I understand that the following is true:   The gradient of f (grad(f)) points in the direction of maximum increase of f   However, later on, we are told that a gradient of a surface f (grad(f)) gives us the surface normal vector (i.e pointing away). How can that be? From the first statement, I thought that the gradient must be pointing in the direction of maximum increase of f - surely the direction of maximum increase of f should be a vector pointing in some direction on f itself. How can it be pointing outward as a surface normal vector?


Let $a>0$ and $b>0$. Prove that $\sqrt{ab} \le (a+b)/2$.  Here is what I have tried: Let $a \le b$. Multiplying both sides of this inequality by $a$ results in $a^2 \le ab$. It follows that $a \le \sqrt{ab}$. We can do the same process with $b$ to find that $a \le \sqrt{ab} \le b$.  Similarly we can add $a$ to both sides, then divide by 2 to give this inequality: $a \le (a+b)/2 \le b$.  However, I have no way to compare $\sqrt{ab}$ and $(a+b)/2$.

I am having trouble with this problem from my latest homework.  Prove the arithmetic-geometric mean inequality. That is, for two positive real numbers $x,y$, we have $$ \sqrt{xy}≤ \frac{x+y}{2} .$$ Furthermore, equality occurs if and only if $x = y$.  Any and all help would be appreciated.


I am to prove by induction for the fibonacci numbers $F_1 = 1$, $F_2 = 1$, $F_n = F_{n-1}+F_{n-2}$ the following $P(n)$ is true: $$\left(\forall n \in \mathbb{N}^{+}\right)\left[\left(F_{n+1}\right)^{2}-\left(F_{n+2} \cdot F_{n}\right)=(-1)^{n}\right]$$ So far, I have written and expanded out $P(n+1)$, but I cannot find where I am to use the inductive hypothesis of $P(n)$ to reach any conclusion. I start with $$P(n+1) = (F_{n+1})^2+2F_{n+1}F_n+(F_{n})^2-F_{n+2}F_n-F_{n+2}F_{n-1}-F_{n+1}F_n-F_{n+1}F_{n-1}$$ and this eventually reduces to $$F_{n+1}F_n-F_{n+2}F_{n+1}$$ with my inductive hypothesis applying for $P(n)$ and $P(n-1)$ to make some terms go away. However, as I continue with this method, I make no progress towards my goal of simplifying to $(-1)^n$. How can I make progress without simplifying this endlessly?

I can't seem to solve this problem. It is:     The Fibonacci numbers $F(0), F(1), F(2),\dots $ are defined as follows:      \begin{align} F(0) &::= 0 \\ F(1) &::= 1 \\ F(n) &::= F(n-1) + F(n-2)\qquad(\forall n \ge 2)\end{align}      Thus, the first Fibonacci numbers are $0, 1, 1, 2, 3, 5, 8, 13,$ and $21$. Prove by induction that $\forall n \ge1$,      $$F(n-1) \cdot F(n+1) - F(n)^2 = (-1)^n$$   I'm stuck, as I my induction hypothesis was the final equation, and I replaced n in it with n+1, which gave me:  $$F(n) \cdot F(n+2) - F(n+1)^2 = (-1)^{n+1}$$  I then tried simplifying this using the first equation, which gave me: $$[(F(n-1) + F(n-2)]\cdot F(n+2) - F(n+1)^2 = (-1)^{n+1}$$  I then tried replacing $n$ in the first equation with $n+1$, but that just gave me   $$2F(n-1) + F(n-2)$$  I'm really not sure how to proceed, and I was hoping for some help. I'm new to induction and I'm hoping this is just an algebra problem and not a problem with the method, but any help would be greatly appreciated.


when I ran TOP command in Busy box, I just wanted to know if VSZ% is MEM%, if not how can get MEM% with TOP command in Busy box

I am using BusyBox on a small embedded ARM system.  I'm trying to read the "top" output, in particular for the Python process listed.  How much real memory is this process using?  Also what does VSZ stand for?  The system only has 64MB of RAM.   Mem: 41444K used, 20572K free, 0K shrd, 0K buff, 18728K cached CPU:   3% usr   3% sys   0% nic  92% idle   0% io   0% irq   0% sirq Load average: 0.00 0.04 0.05 1/112 31667   PID  PPID USER     STAT   VSZ %VSZ %CPU COMMAND   777   775 python   S     146m 241%   3% /usr/bin/python -u -- dpdsrv.py


I'm toying around with statistics and calculus for a project of mine and I'm trying to find the simplest/fastest way to integrate this formula :   $$\int_{-\infty}^{+\infty} e^{-x^2/2} dx$$   I do not want to use a table. I'm taking this opportunity to get more practice with my new calculus skills It seems that a Taylor series approx is the only way to go   Best Regards

How to prove  $$\int_{0}^{\infty} \mathrm{e}^{-x^2}\, dx = \frac{\sqrt \pi}{2}$$


I've computed (using standard complex analysis techniques) the sum $$ \sum_{n\ge1}\frac{\cos n}{n^2} $$ and I found $\pi^2/6+1/4$ which is strictly greater than $\pi^2/6$, and this is impossibile, since my series is less or equal than $\sum_{n\ge1}1/n^2$.  So I must have done some mistake, somewhere. I won't write all details of my computation because it would be boring for me and for you too; I only need to know where can I find the sum of this series: in this way I could look at my computations and find the mistake.  Many thanks

Is it true that for $x\in[0,2\pi]$ we have $$\sum_{n=1}^{\infty}\frac{\cos(nx)}{n^2}=\frac{x^2}{4}-\frac{\pi x}{2}+\frac{\pi^2}{6}$$ How can I prove it? For other intervals what is the value of above series if is convergent?


Notice: I have already read  and followed the steps in it, but I can't figure out what is causing the leak. What I'm looking for here is help in singling out the problem.  As you can see from the title of the question I've encountered a memory leak in Windows 10 after the latest update (Creator's Update I believe). The first thing I did was open the task manager, where I've noticed unpaged memory taking up about 13GB of RAM.   I went through the Poolmon/Pooltag/findstr process only to get garbage on the cmd   I then tried to use Xperf to find out what was happening, but I'm still unsure as to what I'm looking at. The root cause seems to be the kernel image, and I find that hard to believe. Here's the output of Xperf as seen in WPA:   I've had a similar problem in the past on Windows 10 that was caused by Killer Networking drivers, but this time around that doesn't seem to be the culpript.   If anyone is able to help me out it would be greatly appreciated!  EDIT: I state in the first paragraph that this question is different from the one being suggested by the mod (I even link that very question). I had already taken all the steps in the answer to that question and still couldn't track down which driver was causing the issue, hence I was asking for users to help me find which one was the problematic one.

A few days ago I updated my PC to Windows 10. However, after some use my PC started to slow down until it was impossible to use – it was due to high memory usage. After a restart, everything came back to normal (total usage around 25% of 8GB of RAM). However, during a few hours of usage the memory builds up again to 70%, and if not restarted it further goes to 100%, and later on even freezes. Task manager does not help very much as it does not show all the processes (added screenshots below). Also tried RAMMap but it gives an error: "error refreshing database". I tried Googling this question, yet without much success.  I do not know much about PCs, but maybe some of you know this issue, or could help to find out what is using my RAM.


I always believed that there were no limits in the world and then I learned that a minimum temperature exists, and maybe a maximum speed. And now I am wondering about the boundaries of the world.  Is there a minimum amount of space? Is the world like a chessboard and something can't move less than a specific distance or occupy less than a specific amount of space? I suppose this can't be proved practically, but is there an answer to this theoretically?

Is the spacetime continuous or discrete? Or better, is the 4-dimensional spacetime of general-relativity discrete or continuous? What if we consider additional dimensions like string theory hypothesizes? Are those compact additional dimensions discrete or continuous?   Are there experimental evidences of continuity/discreteness?  When particles move inside space do they occupy spacetime by little chunks? What would imply if spacetime is discrete on continuous theories?  I've found little information on the web and books.  Probably my question is ill-posed and I apologize for this.


Using the answer from , I have implemented a simple stack with a push and a pop function.  I would like to use the pop function in conjunction with newfile's addtostream so that I can export the latest item on the stack onto a file.  I am however unable to figure out how to make this work. The stack functions work fine in the text, but when inside addtostream everythings goes to hell...  Here is a MWE:  \documentclass{article}  \usepackage{etoolbox} \usepackage{newfile}  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Stack functions %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  % push #1 onto #2 \newcommand{\push}[2]{%    \begingroup\toks0={{#1}}    \edef\XXX{\endgroup\global#2={\the\toks0 \the#2}}\XXX } % pop from #1 \newcommand{\pop}[1]{%    \begingroup\edef\XXX{\endgroup\noexpand\splitList\the#1(tail)#1}\XXX } \def\splitList#1#2(tail)#3{%    \ifx#1\empty Can't pop an empty stack.\else#1\global#3={#2}\fi } % creation of #1 \newcommand{\newstack}[1]{   \newtoks#1   #1={\empty} }   \begin{document}  \section*{Testing the stack function}    \newstack{\stackb}   \push{{HHHH}}{\stackb}%   \push{{XXXX}}{\stackb}%   \push{{WWWW}}{\stackb}%   if this: \pop{\stackb} shows "WWW", then it worked.  \section*{Testing the stack function popping to a file}    \newoutputstream{AStream}   \openoutputfile{criss.dta}{AStream}   \newcommand{\bibi}{A simple macro can be sent to a file}    \addtostream{AStream}{\bibi}   %\addtostream{AStream}{\pop{\stackb}} % This one not working...   \closeoutputstream{AStream}  \end{document}   Thanks for the help.

I'm trying to combine a stack data structure with a \newcounter{} definition so that I can automatically pair together a collection of points scattered throughout my text.   Each point is either marked as an \openbracket or a \closebracket, and automatically paired to an oppositely defined point in order to form \openbracket-\closebracket pairs. Closed pairs may be nested within other closed bracket pairs, and each pair of open/closed points are marked with the tikz nodes \node(openX) {}; and \node(closeX) {}; respectively [where X is an integer defined by an external counter].   For example:  \openbraket First tier     \openbraket Second tier A         \openbraket Third tier         \closebracket      \closebracket      \openbracket Second tier B     \closebracket  \closebracket    should automatically pair the above \openbracket \closebracket points into 4 closed bracket pairs; one First tier bracket, containing two Second tier brackets, the first (A) of which contains a single Third tier bracket. My MWE should also pop data from the stack structure so that the tikz nodes in the above example are defined as:   (open0) First tier (open1) Second tier A (open2) Third tier  (close2) (close1) (open3)  Second tier B (close3) (close0)   Using the help of , , and , I have managed to defined a working stack data structure and have figured out a method with which to correctly pass stack data to my \tikzmark macro.   However, the MWE below does not explicitly push the current value of the bracketpairingcounter onto the bracketpairingstack, and pushes the verbatim command string instead of the required integer number. Thus when each \node(closeX) {}; tikz mark is popped from the data stack, each node number is evaluated at the last value of bracketpairingcounter, instead of the different integers sequentially pushed onto the stack.   I'm hoping that the numbering problem can be fixed by somehow forcing my LaTeX code to immediately evaluate the value of \openbracketname below, but I can't for the life of me get \expandafter or \edef{} to work in this case...   MWE  \documentclass[openany]{article} \usepackage{tikz}  %Define stack data structure commands (\push, \pop, \splitstack) \newtoks\braketpairingstack \braketpairingstack={\empty}      \def\push#1#2{%         \def\tmp{{#1}}%          \expandafter\expandafter\expandafter%         #2\expandafter\expandafter\expandafter{\expandafter\tmp\the#2}%     \ignorespaces}      \def\pop#1#2{%         \expandafter\splitstack\the#1\stop{#1}{#2}%     }      \def\splitstack#1#2\stop#3#4{%          \def\tmp{#1}         \ifx\tmp\empty          \else             \def#4{#1}\global#3={#2}%         \fi     }   %Define \tikzmark command \def\tikzmark#1{%     \tikz[remember picture, overlay]\node[red](#1) {#1};% }  %Define bracket pair counting commands (\openbracket, \closebracket) \newcounter{bracketpairingcounter}      \newcommand{\openbraket}{%         \expandafter\edef\csname openbracketname\endcsname{\thebracketpairingcounter}%         \push{\openbracketname}{\braketpairingstack}%         \tikzmark{open\openbracketname}%         \stepcounter{bracketpairingcounter}%     }      \newcommand{\closebraket}{%         \pop{\braketpairingstack}{\closebracketname}%         \tikzmark{close\closebracketname}%     }  %Begin MWE document \begin{document}     \openbraket Open first bracket.\\ %Correctly marked as open0     \openbraket Open second bracket.\\ %Correctly marked as open1      Close second bracket. \closebraket\\ %Correctly marked as close1      Close first bracket. \closebraket\\ %Incorrectly marked as close1 \end{document}


Is there a way that I can make my Table header fixed without using any Javascript, by using just CSS?

Is there a cross-browser CSS/JavaScript technique to display a long HTML table such that the column headers stay fixed on-screen and do not scroll with the table body. Think of the "freeze panes" effect in Microsoft Excel.  I want to be able to scroll through the contents of the table, but to always be able to see the column headers at the top.


Suppose $x,y \in \mathbb{R}^n $. Find a diffeomorphism $F:\mathbb{R}^n \rightarrow \mathbb{R}^n$ and $r>0$ such that $F(x)=y$ and $F(z)=z$ for any $z\in \mathbb{R}^n-B(x,r)$ .

$\phi:\mathbb{R}\to\mathbb{R}$ be a diffeomorphism with the following property  $a\in\mathbb{R},|a|<\frac{1}{10}$  (i)$\phi(a)=0$  (ii) $\phi(x)=x$ when $|x|>1$  and how to generalize that in $\mathbb{R}^n$   please help.


My Family Member permit was approved - Civil Union Partnership with separate Surnames.  Can I join my partner at the EU Customs queue when entering the UK?

I'll be arriving at Heathrow in June 2015 with my current girlfriend for a holiday in the UK. I've been trying to find out which immigration queue to join at Heathrow Passport Control without much luck. I have a British passport, my girlfriend has a non-EU passport.     Should I join the EU queue and she the non-EU queue or should we both queue together (and if so, which of the queues should we join)?


How to send Hyper Link in mail body. I am not able to send a link it is taken as a string. Using code:  string tempurl = "http://jcr.vidyoeval.ril.com/flex.html?roomdirect.html&key=j8XPnetS2l"; var mail_body = "mailto:" + "" + "?body=" + tempurl + "&subject=" + "Let us talk on JioHuddle";  // string mailto = string.Format("mailto:{0}?Subject={1}&Body={2}", "", "Let us talk on JioHuddle", tempurl); System.Diagnostics.Process.Start(mail_body);

I have not had to mess with mailto links much.  However I now need to add a link in the body of a mailto if it is possible.    Is there a way to add a link or to change the email opened to an html email vs a text email?  Something like:  Link text goes here


I've been trying to find a good solution to this problem for 2 hours, but I haven't found anything useful.   I have method that gets IssueData from mantisApi for use later in the code. It also catches any exceptions thrown:  try {      IssueData issue = mantisApi.getIssue(issueId, user);      task = prepareMantisTask(issue);     } catch (Exception e) {      System.out.println(e.getMessage());     }     return task;   The problem is when I get the IssueData I expect null because it might be an empty field. However when it returns, an exception is caught in this try/catch block. I tried to ignore using the following code:  public String getProjectNotNull(MantisTask mantisTask) {     if (mantisTask == null){         return null;     }     try{     String project = mantisApiCache.getProject(mantisTask.getProject()).getName();         return project;     }     catch(NullPointerException npe){     log.info("TaskService.getProjectNotNull() throws controled null");     return "-"; }   But it looks stupid when I have 20 or more records to check. Is there any other way to ignore nulls? Thank you for your time.  I'm sorry I'm at home now, and i cannot copy code.  prepareMantisTask looks like:  MantisTask mantisTask; mantistask.setId = issue.getId();   so example. if i do mantistask.setDueData = issue.getDueData(); it is null because not all issues have this parameter. So when the debugger get to this point, it returns to  } catch (Exception e) {          System.out.println(e.getMessage());  }    and left prepareMantisTask with task null.  This two pieces of code are from different parts of my program, I just wanted to show how it works.

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 have seen both in Cygwin and in Linux the [ command under /bin. Whenever I run it I get an error saying: missing ].   I never understood what this command does, I just one day found it wanted to find out what it does (and whether it is useful or not)  NOTE: I would have checked the man entry, for an answer, but sadly, there is no entry in it for [

I was looking at coreutils and found this as one of the files included as part of coreutils:  /usr/bin/[. What is [ and what does it do? It is an executable. I just don't know what it does or how to use it. $ file /usr/bin/[   /usr/bin/[: ELF 32-bit LSB executable, Intel 80386, version 1 (SYSV), dynamically linked (uses shared  libs), for GNU/Linux 2.6.15, stripped    When I try to run it, I think it is defaulting to the bash built in line expansion. Instead of actually running the file. $ "/usr/bin/[" /usr/bin/[: missing ‘]’ $ /usr/bin/\[ /usr/bin/[: missing ‘]’


Before this century I had never heard the word optics used to refer to the way a situation is perceived.  E.g., "The official hiring his son created terrible optics."  And when I first heard it used that way I found it quite grating – perhaps because I have an engineering background and often discuss the science of optics and optical devices.  Can anyone find indications of the emergence or earliest acceptance of the use of the word to mean "appearance?"

Here’s an example from RealClearPolitics:     But the optics bode well for a party whose chances of winning the White House depend on attracting many more Hispanic voters than it did four years ago. [emphasis added]


systemd on my box is listening to port 111 for the  service.  Lets say I wanted to allow some other computers to connect to it, but not all. Is there any way besides a firewall to control what can connect to this service?  Poking around I see that the rpcbind binary is linked against the  tcp_wrappers-libs library, meaning it can use .  However, I don't know if systemd immediately hands connections to port 111 over to the rpcbind binary, or if it does some of its own processing first.  My system is a standard desktop install of Fedora 25.

I've got a Fedora 25 x86_64 stand alone workstation. Something is listening on port 111 (identified with an nmap scan):  $ sudo lsof -i :111 COMMAND PID USER   FD   TYPE DEVICE SIZE/OFF NODE NAME systemd   1 root   36u  IPv4  15170      0t0  TCP *:sunrpc (LISTEN) systemd   1 root   37u  IPv4  15171      0t0  UDP *:sunrpc systemd   1 root   38u  IPv6  15172      0t0  TCP *:sunrpc (LISTEN) systemd   1 root   39u  IPv6  15173      0t0  UDP *:sunrpc   I disabled the Sun gear on the port with the following commands:  $ sudo systemctl disable rpcbind $ sudo systemctl disable sunrpc Failed to disable unit: No such file or directory   After reboot the port is still open.  It appears something other than Sun gear wants to listen on port 111. Or maybe systemd is not respecting my wishes to disable the unused service. Or maybe something else...  How do I determine what is trying to listen on the port, and how do I disable it?    From below:  $ sudo systemctl -a | grep -E "rpc|port"   var-lib-nfs-rpc_pipefs.mount          loaded    active   mounted   RPC Pipe File System   abrtd.service                         loaded    active   running   ABRT Automated Bug Reporting Tool   auth-rpcgss-module.service            loaded    inactive dead      Kernel Module supporting RPCSEC_GSS   fedora-import-state.service           loaded    active   exited    Import network configuration from initramfs   fedora-readonly.service               loaded    active   exited    Configure read-only root support   rpc-gssd.service                      loaded    inactive dead      RPC security service for NFS client and server   rpc-statd-notify.service              loaded    inactive dead      Notify NFS peers of a restart   rpc-statd.service                     loaded    inactive dead      NFS status monitor for NFSv2/3 locking. ● rpc-svcgssd.service                   not-found inactive dead      rpc-svcgssd.service   rpcbind.service                       loaded    inactive dead      RPC Bind   rpcbind.socket                        loaded    active   listening RPCbind Server Activation Socket   rpc_pipefs.target                     loaded    active   active    rpc_pipefs.target   rpcbind.target                        loaded    active   active    RPC Port Mapper


everytime I keyed in Y at the end of the do-while loop, it will not let me key-in for the "Enter name for appointment" I tried changing c = input.next(); to c = input.nextLine(); but is still didnt work. WHy? please help  import java.util.Scanner; import APP.*; public class AppointmentTest { public static void main(String[] args) {     Appointment app = new Appointment();     String m, y;     double st, et;     //char c;     String c;     Scanner input = new Scanner (System.in);      do     {         System.out.print("Enter name for the appointment :");         m = input.nextLine();         app.setName(m);         System.out.print("Enter day appointment :");         y = input.nextLine();         app.setDay(y);         System.out.print("Enter start time :");         st = input.nextDouble();         app.setStartTime(st);         System.out.print("Enter end time :");         et = input.nextDouble();         app.setEndTime(et);         System.out.println("Duration of appointment :");         System.out.print("Do you have any other appointment? (Y/N) :");         //c = input.next().charAt(0);         c = input.next();       }while (c != "N" && c != "n");  }   }

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


We can set low/critical battery sound notification but I don't know how to set a full  battery sound notification, Is there any way to do that?  EDIT : I agree to the point that not all laptops charge to 100%, then my question rephrases from 100% to 95%, or maybe to get a notification at some specified %age...

I would like to get an alert (with sound) when my laptop battery is fully charged.  How can I do that?


As default Windows (or in my case Windows 7) creates the Thumbnails for Files based only on the "current view position" of the Explorer Window. And you need to scroll for more Thumbnails being created. But I want it to create all of the Thumbnails for the Files inside a Directory when I open this Directory in Explorer so I dont need to trigger it manually by scrolling down and wait for them to be created. Is there a way to configure Windows or by using a Extension to make this work?

Is there some way to get explorer to generate thumbnails without actually having to navigate and scroll through every folder?  All I could get was a command prompt script that would load an explorer window for all subfolders, however only images that were visible would have thumbnails created.


This has been a constant source of annoyance for me. Scattered around the castles are darker walls where projectiles and - occasionally - players can squeeze through. Often there is the explicit expectation that you should be able to squeeze through such an opening, but nothing I've done so far seems to do the trick.    A specific room in the Forest that would have you go up and then down at the other side has such an area at the bottom that you can dash through. This seems to work nowhere else, however.  So: how do you do that? Is it the flexibility perk? Is it some kind of NG+-only rune? Is it some weird input combination? Is it something awfully obvious?

I keep running into areas where I see a chest in a section of the room that seems completely walled-off. Is there any way to get to these, or is that just the randomly generated dungeon being a tease?  I had to splice two screenshots together to show an example of what I'm talking about:   Is there any way to get in there?


i followed the instruction given in the sourceforge forum but it didn't work.Pls tell me some solutions.  cd xdman/ chmod +x xdman.sh  ./xdman.sh ./xdman.sh: 2: ./xdman.sh: java: not found sudo ./xdman.sh [sudo] password for nishant:  ./xdman.sh: 2: ./xdman.sh: java: not found   How can i resolve this?

I want to install Oracle's JRE and to update to the latest version with the Software Updater when they released. Is there a Ubuntu package that is provided by Canonical or Oracle?  Before release Java 7, I followed  to install Java 6.  But it doesn't work for Java 7. There is no package sun-java7-xxx. How can you install Java 7?


It is known that the exponential map is surjective for compact, connected Lie groups. This is generally proved through the introduction of some bi-invariant metric etc. etc. My question is related to the following: Can this be shown using only Lie theory and not deferring to other concepts like Riemannian geometry, etc.? In particular, can I use some properties of the Lie algebra of compact Lie groups? Details:  Let $G$ be a compact, connected Lie group.  We know $\exp:\mathfrak{g}\to G$ is a local homeomorphism. So I can find a subset of the Lie algebra, $S$, containing $0$ such that $\exp{S}\subset G$ is open in $G$. Now, consider an open subset of $\exp{S}$, $U$, with the property that $U^{-1}:=\{g^{-1}:g\in U\}=U$ and $e\in U$. Then, with a bit of work, you can show $\exists n\in\mathbb{N}$ such that $G=U^n$ (length $n$ words in the elements of $U$). This fact is equivalent to compactness (finite subcover).  So, given $g\in G, \exists g_1,...,g_n\in U$ such that $g=g_1g_2...g_n$. By local homeomorphism property of $\exp$, $\exists x_1,...,x_n \in \exp^{-1}{(U)}\subset S\subset \mathfrak{g}$ such that $e^{x_i}=g_i \forall i$. Therefore, $g=e^{x_1}...e^{x_n}=e^{\Omega_n(x_1,...,x_n)}$   where $\Omega_n$ denotes the Baker-Campbell-Hausdorff formula of $n$ elements. In particular, $$\Omega_2(A,B):=A+B+\frac{1}{2}[A,B]+\frac{1}{12}[A,[A,B]]+...$$   However, if $\exp$ is to be surjective, $\Omega_n$ must converge for all $x_1,...,x_n$ in $\exp^{-1}{(U)}$. But in order to prove surjectivity, is there any way I can use the properties of Lie algebras of compact Lie groups to show convergence of the BCH formula in this set?  Please let me know if this question is ill-posed/ill-formed. Thanks!

A  made me realize I didn't know any proof that exponential of a Lie algebra $\mathfrak g$ of a compact connected Lie group $G$ is surjective. After a bit of thinking I've come up with two proofs. First is based on relation between exponential curves and geodesics. This is rather technical but also gives us other useful information. This is not what I want to talk about here though.  The second proof (which I find slicker) is based only on topology and goes like this: Since $\exp$ is a local homeomorphism, it is both open and closed. Therefore $\exp(\mathfrak g)$ is clopen and so equal to $G$.  The trouble with this "proof" is that it also proves the statement for $G$ non-compact (which is false). So I wonder (and this is my question) what precisely went wrong.     Can the above mentioned "proof" be made into a real proof?   My thoughts on this are that $\exp$ is closed and open only when $G$ is compact because then we can pick a bounded open subset $C \subset \mathfrak g$ such that $\exp(C) = G$  and we can use the relation $\exp(A+\epsilon B) \approx \exp(A)\exp(\epsilon B)$ to conclude that $\exp$ is a local homeomorphism everywhere in $C$ (not just around $0$). This implies that $\exp$ is open (since it is locally open) in $C$. Also, since any closed subset of $C$ is compact, it's image is also compact and therefore closed in $G$.     Where exactly does this argument break down when $G$ is not compact.


In Star Trek: First Contact, once the Enterprise's crew found out that the Borg were on board, could they have beamed the Borg off the Enterprise out into outer space, or do the Borg have the capability to block transporter beams?

Seems like this is the most powerful weapon of all: transport your enemy into a bulkhead, planet, etc. Transport your enemy's ship inside a planet, etc.  Is there some technical reason that it can not be used this way?


Communities need to pass some critical mass and quality criteria in order to come out of Area51 into StackExchange proper, and be "born". But do sites ever "die" ?   Put another way - is the number of StackExchange sites over time strictly a monotonically increasing function ?   A simple "yes/no" answer would be fantastic, but if this generates discussion, I'm all the happier.   Note : I'm explicitly referring to sites that have already exited Area51 and public beta.   does not seem to answer my question.

For Beta sites, it is not uncommon to get closed if they for example don't fullfill the desired activity criteria as explained in Stack Exchange blog post  (2012-04-24). My question is, can something like this happen to graduated Stack Exchange sites too, if for example their activity drops too much or does not grow fast enough? Are there other criteria or conditions that would make a graduated Stack Exchange site closable? If so, what are such close reasons? The only things apart from the (lack of) activity, which spontaneously comes to my mind, that could kick a graduated site out of its comfortable stable equilibrium is a drop in the quality of the content in the course of time, or that the site can no longer fulfill its mission as often stated in the "About" for some reason. But maybe there are other things I am not able to think of... If a graduated site is getting into serious problems, would Stack Exchange give them some timely warnings, such that people would have a fair chance of trying to solve the issues and avoid the site getting closed? Did something like this ever happen in the past?


I have been searching the web for setting up the Content-Type (header) of soap server response PHP (non-wsdl mode) but I cannot find any clear solution. I want to change the Content-Type from text/html to text/xml. I tried to set up header(mime) to text/html but the handle of SOAP service set it up to the default value. I appreciate any help.

I've got a php script. Most of the time the script returns html, which is working fine, but on one occasion (parameter ?Format=XML) the script returns XML instead of HTML.  Is there any way to change the returned mime type of the php output on the fly from text/html to text/xml or application/xml?


I often confuse these two things: "I reached home" and "I have reached home". Once my friend asked me, "Where are you? "  I messaged him: "I have reached home". He told me not to use "have reached "...     reached = past tense, have reached = present perfect   Can someone please clear this doubt so that I don't make the mistake again.

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


I need to find the folders that are modified on a particular date, month and year  i was able to find the files modified based on date and month. I also want to include the search based on year ls -ltr | awk '$6 == "Aug" && $7 >=01 && $7 <= 31 &&  {print $9}'

Is it possible to find all php files within a certain directory that have been modified on a certain date  I'm using   find /var/www/html/dir/ -mtime -28 | grep '\.php'    to get files modified within the last 28 days, but I only need files that have been modified on the following date: 2011-02-08


A pure chocolate bar will always melt at 33 Celsius, as several of my books assure me.   But an answer to another question .   What kind of chocolate can do this? What does it contain? How much actual chocolate would be inside it, and what is the rest made of? What is the highest melting temperature which can be achieved by such a product? What would be some generic terms for it - if I wanted some and went to a chocolate shop, what would I have to ask for?

Is there something that can be done to chocolate which will raise its melting point?  I ask because  wanted a way of getting space dust into a cake, which might be able to be done by encasing it in chocolate chips, but to have the best chance of success the chocolate needs to have a higher melting point.  So can this be affected, and if so by what?


Evaluate if the following series is convergent or divergent: $\sum\limits_{n=1}^\infty \ln({1+\frac 1 {{n}}})$.   I tried to evaluate the divergence, applying the Weierstrass comparison test:  $\sum\limits_{n=1}^\infty \ln({1+\frac 1 {{n}}})>\sum\limits_{n=1}^\infty \ln({\frac 1 {{n}}})$. Since the function is decreasing then as $1+\frac{1}{n}$ is closer to $0$ then the inequality follows.  Obviously $\sum\limits_{n=1}^\infty \ln({\frac 1 {{n}}})$ diverges since $\lim_{n\to\infty}\ln({\frac 1 {{n}}})=-\infty$.  Questions:  1) Is my answer right? If not why?  2) What other kind of approach do you propose?  Thanks in advance!

Show that the following sum is divergent   $$\sum_{n=1}^{\infty}\ln\left(1+\frac1n\right)$$   I thought to do this using Taylor series using the fact that $$ \ln\left(1+\frac1n\right)=\frac1n+O\left(\frac1{n^2}\right) $$ Which then makes it clear that $$ \sum_{n=1}^{\infty}\ln\left(1+\frac1n\right)\sim \sum_{n=1}^{\infty}\frac1n\longrightarrow \infty $$ But I feel like I overcomplicated the problem and would be interested to see some other solutions. Also, would taylor series be the way you would see that this diverges if you were not told?


My account became administrator by default, but then I changed it to standard. From that instant, I'm asked for the root password  to upgrade software, for authentication and also to edit user settings.  How can I resolve this?

I clean-installed Ubuntu 11.10 today, and then installed VirtualBox.  This required me to add myself to the vboxusers group, and since 11.10 seems to no longer have a graphical app to add users to a group, I ran the following command:  sudo usermod -G vboxusers stephane   This is a problem.  I now see what I should have run instead is:  sudo usermod -aG vboxusers stephane   The end result is I'm no longer in the groups I should be in.  Including whatever group is required to run "sudo".  When I run any command as sudo now, I get the following:  $ sudo ls [sudo] password for stephane:  stephane is not in the sudoers file.  This incident will be reported.   Is there a way to fix this, or do I need to re-install from scratch again?


I am doing this Java question :     Jalaj purchased a table for Rs.200.4 and due to some scratches on its   top he had to sell it for Rs.176.5. Find his loss and loss%.      LOSS : Cost Price - Selling Price      LOSS% : (LOSS/Cost Price)*100      a. Declare four double variables i.e. costprice, sellingPrice, loss,   lossPercentage      b. Assign 200.4 to costPrice and 176.5 to sellingPrice.      c. Print loss and lossPercentage according to the given formulas like:   823.67 8.23 d.      For printing upto two decimal places use  System.out.printf("%.2f\n", loss);       Note:         output for both should be upto two decimal places   Output should be displayed in two different lines      My code:  /*Write your code here */ import java.util.Scanner; class bkws{     public static void main(String args[]){         double costPrice,sellingPrice,loss,lossPercentage;         costPrice=200.4;         sellingPrice=176.5;         loss=costPrice-sellingPrice;         lossPercentage=(loss/costPrice)*100;         System.out.print("%.2f",loss);         System.out.println("%.2f",lossPercentage);     } }   Now I am thinking of using Math.round but for rounding off to 2 decimal places it should be:  Math.round(number*100)/100;   But it is giving error and I also want to know that if there is any easy way to round off to n decimal places without using Math.round in Java.

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?


When I try to install it, the following result comes up:  Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  mono-complete : Depends: mono-devel (= 3.12.1-0xamarin1) but it is not going to be installed                  Depends: mono-4.0-service (= 3.12.1-0xamarin1) but it is not going to be installed                  Depends: libmono-cil-dev (= 3.12.1-0xamarin1) but it is not going to be installed E: Unable to correct problems, you have held broken packages.

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


Should I include URLs that redirect in my site's XML sitemap?   If page X is permanently redirected to page Z, would I include the page X, or only page Z?

I noticed that I have three warnings when I submitted my Sitemap. They all say this:      When we tested a sample of URLs from your Sitemap, we found that some   URLs redirect to other locations. We recommend that your Sitemap   contain URLs that point to the final destination (the redirect target)   instead of redirecting to another URL.   I'd like to try and resolve this issues but I'm not sure what to do.  Sitemap url for reference:


Is it important to scale all the features into a common range (normalized) when using random forests (bagging) in classification. Or can random forests handle features in different ranges without problems (bias to the larger values). Some features may have a value in the 1000-range and others in the 0-1 range.

My input variables have different dimensions. Some variables are decimal while some are hundreds. Is it essential to center (subtract mean) or scale (divide by standard deviation) these input variables in order to make the data dimensionless when using random forest?


I was reading an article that said when we display a map in WGS84 many people call it no projection. But most definitely when you see the map it has been distorted on a 2D surface.  Which got me to thinking is there such a thing as a "map" with no projection. If I'm looking at a 3D digital globe it is representing how it would look as if I were out in space. So then it wouldn't be projected. But if I'm looking at the globe on a screen then it is being rendered on a 2D screen so it is projected.  Is there such a thing as no projection?

WGS84 is a reference ellipsoid that determines coordinates of every point on Earth using latitude, longitude and height about the its surface.  This ellipsoid is often used as a base to make maps. Though, to make a map on a flat paper or a flat digital screen you need a projection too. An example of a popular projection would be UTM.   Mainstream GIS software give plethora of projection alternatives to display your data layers. Among them, they also let you display your data using WGS84 only.  I think they are using a certain projection but what projection is that?


If there are no centrifugal forces in reality then how to explain weight loss due to rotation of earth or dynamic balancing of a rotating mass?

As I was trying to work out the expression for the apparent "g"-in case of the rotation of Earth-I was considering the centripetal force (m$w^2$r) and the weight (mg) all the time, thinking these were the forces that were acting on the body.     But later I found out that it should have had used centrifugal force instead of centripetal force. But why? We should be considering the forces acting on the body right? And it's the centripetal force that is acting on the body (with direction towards the center of the small circle).


Is there a way to restart the device automatically after windows recognizes errors with It? Sometimes when I start the PC I see onboard sound chip Realtek what ever mic and headphone/speaker however the speaker doesn’t work. Earlier I restarted the whole PC but now it’s not necessary. I just go as described to the device manager and deactivate then activate the devices. The same I do for bluetooth. it's just a bluetooth dongle usb backsite ob the pc. Nice thing when I discovered I can not only connect my smartphone but also my headset with It. I had troubles with wifi 2.4 ghz and bluetooth and solved it with changing the wifi channel on the tp link accesspoint router to 4 and the channel width to 20 mhz. now one problem remains. After some time the bluetooth dongle or some driver gets problematic then I go to device manager and activate the deactivate the bluetooth dongle, then immediately the headset even connects with bluetooth wow! How can this procedure happen automatically? Windows recognizes problem with hardware and driver, then I don’t need to restart it manually with mouse but windows restarts it automatically?

Wondered if it is possible to use  to  a display device as a stop-gap solution to artifacts left over from a graphics card malfunction?  In particular it leaves  very un-user-friendly:     I found out the hardware ID of my display adapter through device manager (below)    [(windows key + pause break) -> device manager -> display adapters -> right click your display adapter -> properties -> details -> hardware ids.]    I tried the commands (opened with admin privileges) devcon restart "PCI\VEN_1002" and devcon restart =display but it always come back with .  Is it even possible to restart the graphics card without a system reboot?


I'm working with some code that uses JQuery's $(document).ready functionality to set up a jqGrid instance. It appears that the code is fired even when returning to the page via a back-button click.   In a stripped-down test page, a similar ready function is not called when reached via a back-button click:
Index View
      Detail     Can you give me some hints of where to look for what is causing this difference in behavior?  I found some related information in an answer to , but the page with the overactive ready event doesn't have an event handler registered for unload.

For all major browsers (except IE), the JavaScript onload event doesn’t fire when the page loads as a result of a back button operation — it only fires when the page is first loaded.  Can someone point me at some sample cross-browser code (Firefox, Opera, Safari, IE, …) that solves this problem? I’m familiar with Firefox’s pageshow event but unfortunately neither Opera nor Safari implement this.


I am trying to print a picture on a canvas, I would like the canvas to be 16x24 in size. I was told that my picture is 75 DPI, is the resolution good enough for the canvas to be nice and clear?

I would like to create a 60 inch x 20 inch canvas print using an image with a resolution of 4759x1798 (240 pixels per inch) and I would like to know if the image quality will still be good at that size.  To generalise the question, what is the recommended maximum size of an enlargement at varying image resolutions?  e.g. 3 megapixel, 5 megapixel, 8 megapixel, etc


I am using the extract function from the raster package in R. The extract function is taking incredibly long to assign the values to the polygon. In ArcMap, this process is much faster (but of course more time consuming to set up). CVsteepslope is the raster (100m resolution) and grids (3,000,000 objects) is my polygon. Here is the code: CVsteepslope <- CVsteepslope %>%    projectRaster(CVsteepslope, crs="EPSG:3035") # here I am reducing the raster to the polygon extent in an attempt to speed things up CVsteepslope <- crop(CVsteepslope, extent(gridsdiss), snap="out")   CVsteepslope <- rasterize(gridsdiss, CVsteepslope)     CVsteepslope <- mask(x=CVsteepslope, mask=CVp)  grids$steepslope <- as.numeric(extract(CVsteepslope, grids, method='bilinear', small=TRUE, fun=mean))  Side note: I am using a virtual environment with 128 gb memory, R is only using a third of this.

I am trying to extract the values of a multiband raster to a polygon in R. ACVheatingdegreedayS <- stack("location/multibandraster.tif") ACVheatingdegreedayS <- ACVheatingdegreedayS %>%    projectRaster(ACVheatingdegreedayS, crs="EPSG:3035")  ( zCVhdd1 <- CVheatingdegreedayS[[1]] )  I want to avoid that last line of code where I break the multiband into a single band. There are 70 bands, so creating separate rasters would be very time consuming. Anyone know of a way to extract all bands of a multiband raster to a polygon?


I'm trying to sequence frames into video, and I noticed all of my output is a bit darker than it should be. So I set up a pure white render through the compositor, and that's gray too.  compositor setup (through testing, "Use Alpha" and the Alpha slider do not impact the result)    compositor is enabled    nodes are active in the compositor    and this is what I get, a gray render    I don't have film transparency enabled. This seems super odd  EDIT: it does appear that the output is white, w/ values of R:1 G:1 B:1, but clearly it is gray

When I tried rendering the scene with white background in filmic blender, I'm getting grey coloured background. But I'm able to achieve this with standard colour management options.  P.s: I have edited light source to match the filmic blender.


A linear transformation is a function $f:V\to W$ from vector space $V$ to vector space $W$ such that linear combinations (alternatively vector addition and scalar multiplication) are preserved.  An affine transformation is similarly a between from an affine space to another such that all affine combinations are preserved.  Could we use this as an alternate definition: A linear(/ affine/ etc) transformation is a function from one l(/a/e) space to another such that the image of the function is also a l(/a/e) space?

Linearity is a ubiquitous concept in mathematics; however, each branch of mathematics appears to have its own definition of what a linear map (function, functional, functor, transformation, form, operator, or whatsoever) is. These different definitions can lead to confusion, especially when people apply conflicting definitions of linearity to the same mathematical object (just  to figure out what I mean).  One of my favorite examples with potential for conflict is the natural logarithm $\ln : \mathbb{R}_{>0} \to \mathbb{R}$, which the majority of people, as I could learn during hot disputations not only  but also with colleagues in my field, regard as clearly non-linear, even though it fully complies with the definition of a linear map from the vector space $\mathbb{R}_{>0}$ to the vector space $\mathbb{R}$ (cf. Definition 4 below). A similar conflict arises analogously for the exponential function $\exp :\mathbb{R} \to \mathbb{R}_{>0}$.  I do not want to initiate yet another discussion here, about what the right and what the wrong definition of linearity is! Rather, ...  ... I would like to compile a list of existing definitions, to get a better overview of the different uses of the term "linearity" across the different branches of mathematics and levels of education.    Let be begin with the following four, which are certainly far from constituting a complete list. What about bilinear or multilinear forms, linear morphisms and linear functors in category theory, linear metrics, or other concepts of linearity? I am looking forward to see your answers.  At school I was taught that     Definition 1:   A function $f$ is linear if it is of the form $f(x) = ax + b$.   Later I learned that $f(x) = ax + b$ is affine, rather than linear, because     Definition 2:   A function $f$ is linear if it is of the form $f(x) = ax$.   From real analysis and systems theory, I know the following     Definition 3:   A map $f$ is linear if         $f(x + y) = f(x) + f(y)$   $f(a \cdot x) = a \cdot f(x)$.      This definition also applies to the expected value in statistics, as        $\mathrm{E}(X + Y) = \mathrm{E}(X) + \mathrm{E}(Y)$   $\mathrm{E}(a \cdot X) = a \cdot \mathrm{E}(X)$.      In a linear algebra course, I learned for the first time that we must not forget to take into account that the vector-space operations of the domain and the codomain of a map $f$ may be dissimilar. In fact, if $(V, \oplus, \odot)$ and $(W, \boxplus, \boxdot)$ are two $\mathbb{K}$-vector spaces, then     Definition 4:   A map $f : V \to W$ is linear if         $f(x \oplus y) = f(x) \boxplus f(y)$   $f(a \odot x) = a \boxdot f(x)$.         Notice that I deliberately used distinct symbols for the operations in both vector spaces, to emphasize how this definition differs from Definition 3.   Correct me if I am wrong, but this definition should also apply to maps between two modules.    Updates:


I cannot figure out why the bullet points are not showing up.   \documentclass{beamer} % % Choose how your presentation looks. % % For more themes, color themes and font themes, see: % http://deic.uab.es/~iblanes/beamer_gallery/index_by_theme.html % \usepackage{fourier}  \usepackage{array} \usepackage{makecell} \usepackage{longtable} \usepackage{enumitem} \usepackage{comment}  \mode<presentation> {   \usetheme{CambridgeUS}      % or try Darmstadt, Madrid, Warsaw, ...   \usecolortheme{beaver} % or try albatross, beaver, crane, ...   \usefonttheme{structuresmallcapsserif}  % or try serif, structurebold, ...   \setbeamertemplate{navigation symbols}{}   \setbeamertemplate{footline}[frame number]   \setbeamercovered{transparent} }   \usepackage[english]{babel} \usepackage[utf8x]{inputenc}   \title[Your Short Title]{Post-Circumcision Risk Compensation: A Systematic Review} \author{Dana Ivanova, Njeri Kamau} \institute{Topics in Epidemiology} \date{15 January 2019}  \begin{document}  \begin{frame}   \titlepage \end{frame}  % Uncomment these lines for an automatically generated outline. %\begin{frame}{Outline} %  \tableofcontents %\end{frame}   \section{Background}   \begin{frame}{sub-Saharan Africa}     \begin{itemize}      \item globally 35 million people are  HIV positive      \item role of sub-Saharan Africa     \end{itemize}

I thought I had tamed enumitem. I had this  and this .  Then I tried a [<+->] construct. It failed. Commmenting the enumitem section prevents errors but I'd rather not have to do this.  On its current state, this code produces two errors, one because of the [<+->] and another because of the \onslide.   \documentclass{beamer}   \usepackage{enumitem}  \setitemize{label=\usebeamerfont*{itemize item}%    \usebeamercolor[fg]{itemize item}    \usebeamertemplate{itemize item}}%https://tex.stackexchange.com/a/24491  \setenumerate[1]{%    label=\protect\usebeamerfont{enumerate item}%          \protect\usebeamercolor[fg]{enumerate item}%          \insertenumlabel.}%https://tex.stackexchange.com/a/45950   \begin{document}  \begin{frame}  \begin{itemize}[<+->]  \item 1  \item 2  \end{itemize}  \onslide<2>{text}  \end{frame}  \end{document}


Why does  KeyEvent.getKeyText(0).substring(0, 7) == "Unknown"   return false when  System.out.print(KeyEvent.getKeyText(0).substring(0, 7));   prints exactly "Unknown"?

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


Nothing happens when I select update, the update just hangs Both for apps and main OS updates.  I've tried opening terminal and typing   sudo apt-get update    and   sudo apt-get upgrade   But i get an error:  E: Unable to lock directory /var/lib/apt/lists/   I have this system dual booting with Windows 10, I wish I'd never put it in now.  People keep telling me it runs better, but it wont even update.  Now I am stuck with it anyway, so I try to use it sometimes, but usually have little success.  Any ideas?

I get this error when trying to use apt-get:  E: Could not get lock /var/lib/dpkg/lock - open (11 Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/) is another process using it?     How can I fix this?


Not that their charges are opposite! "+" & "-" are the signs we named them. By nature Why do they attract each other? And Why do they repel each other?

I know plus pushes another plus away, but why, really, do they do that? On the other hand, molecules of the same type are attracted to each other. I find that weird.  I do know some stuff about four universal forces. But why in general the general "rule" is that opposite charges pull each other?   Yes, I do realize this could be connected to very basic stuff that science is still trying to figure out, and can be traced to the Higgs,  but still, there must be something to tell.


I'm writing a document in Swedish, and appendices are then called 'bilaga' which is a translation of 'appendix' not widely used in my field. Hence, I'd like the title in appendix A to read 'Appendix A' and not 'Bilaga A'. I've tried using \renewcommand\appendixname{Appendix} but it changes nothing. The toc is fine as it is - doesn't use the word Appendix or Bilaga at all, just A, B and so on.  EDIT: Don't know what a MWE is, but here are pieces of my latex code that I think may be relevant:  \documentclass[a4paper,11pt,fleqn,twoside,openright]{report} \usepackage[swedish]{babel} %...{lots of other stuff related to figures and page layout} \usepackage{appendix}  \renewcommand\appendixname{Appendix}  \begin{document}  \chapter{oneone}  bla1 bla1  \chapter{twotwo}  bla  \appendix \chapter{titel first appendix}  appendix text  \end{document}

I am trying to change the name of the Appendices. This is what I've done:  \begin{appendices} \input{muonSF} \input{Wmass} \input{BDTCrossCheck} \end{appendices}   using the package appendices. My problem is that I need to change the name of appendix to Anexo (spanish for appendix), and also I need a page before all appendices with only the word Anexo.  How can I do that?


I have Installed following modules;          Enabled these modules and created one services view for one content type(content type name: employees).  Then opened structure->services, created an endpoint and enabled view service(employee).  Service accessing Url Ex:     Now data is accessing well.  But how can I do web services CRUD operations for this content type?

I have referred many links including the following:      -    I tried several ways to POST a new node to a Drupal site, but I have failed. I have created a sample CCK for storing students data with name, age, gender, DOB, and added some list.  I have installed and configured the Services module (D7), and created a service end point at services. As expected, GET is the easiest way to get details of a node in JSON. http://localhost/drupal/services/node simply listed all nodes.  I still can't figure out how to use the POST method.   I would like to search for the students whose name contains john. I tried localhost/drupal/services/node&node[name]=john. I used  POST Man plugin for Chrome without success. I also tried some other ways. I tried adding a new student to the site without success.   Can anyone guide me to make the above work fine?  UPDATE :  I tried adding new nodes of type article . It worked fine. but when i am trying to add nodes of type Department CCK It is showing "s:22:"CSRF validation failed";"  Here are the screen shots  I have gone through the link   I followed session = session_name=session_id but i still get an error.


I keep going back and forth between Ubuntu and Windows 10. I want to use Ubuntu for good but I keep getting two main problems. Here's the worst one that happened yesterday.  Once in a while, Unity freezes completely. My mouse doesn't move or anything. This is on a 2 days old install. Everytime that happens, I don't even have access to a TTY. So I'm forced to turn off the computer with the power button. Yesterday though, Ubuntu didn't like it. When I started my computer, I was greated with a blinking cursor. Grub didn't start. I even tried reinstalling Grub from a live DVD but that didn't work. So I had to reinstall everything.  That being said, I'd like to get this freezing problem solved.  At first I thought it might have been Chrome using up all my 4 GB of RAM. So I installed an extension to shut off all my inactive tabs. But when it froze yesterday I had one or two tabs and Firefox opened with 3 tabs. Normally, on my Windows install, I never have any issue. Right now, I have Android Studio running and am writing this from Chrome with 10 active tabs opened. So that's not the problem.  I thought it may have something to do with my graphic card. I have some issues with it. It's an Intel. On Ubuntu but mostly on Ubuntu Gnome and LinuxMint, once in a while, the screen goes completely black for a split second, usually when I'm using the terminal. Also, my computer becomes a lot hotter on Ubuntu than on Windows when the lid is closed.  Oh and this happens with swappiness at 60, 10 or 0.  Anyone know what I can do to solve this? I my computer is a laptop, HP EliteBook 8440p with 4 gb or RAM.   Thanks!

I am fairly new to Ubuntu and I was wonder what a good way is to debug when something crashes?   For example: I installed 11.04 and the default media player banshee makes my laptop crash after a few minutes of playing music. Since the system completely freezes and there is not error message it's hard to find out what is wrong.  Second problem I have is that sometimes the system crashes to login. I am suspecting it to be a Chromium or Flash but I am not 100% sure.  So anybody got some tips on how to debug stuff like this?


I have gotten a laptop with Ubuntu installed on it. I have got an account with a password that I indeed do remember, but when I try to install some things, I cannot install it without entering the root password ( and sometimes sudo or something). The weird thing is that I am able to install a few things like OpenArena and Musescore, but I can't install other games/software like PlayOnLinux. I don't even know what root password means but I've tried entering my user password and it didn't work. The word "root" or "sudo" also doesn't work. I have no clue what this password could be. I got the laptop from someone who I can't contact at the moment. Is there any way of resetting the password or making it visible for me so I can actually do anything on this currently useless laptop? Thanks!

I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there.  I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution?


How can I install (or hide) the following Windows 10 Desktop Apps: Calendar, Mail, Maps, People?  I use the Google versions of all of these apps.

Windows 10 is working out well for me. However, there are some modern apps that are built in such as Mail and Calendar that don't have an uninstall option.    Calendar is one such modern app. As far as I am concerned, the Outlook desktop application and web application are much more powerful and seemingly updated more frequently.  Is it possible to get rid of these?


I don't know if this is considered as a bug, but I've noticed on Stackoverflow that questions that have been posted like two days ago, still have the title "yesterday" on them, eg :    Regards

Looking at , I see "asked yesterday" (which I really hate; I'd like to see an exact time specification rather than this vague one, especially in the list of questions). But it was not asked yesterday! When I hover over it to show the exact time, it shows it was actually the day before yesterday!  This snapshot was taken at 2012-03-31 15:00 UTC (plus or minus a few minutes):    Whatever different opinions you may have on the implementation, yesterday is a word with a certain meaning. Redefining it is not a good idea. At least rephrase this as "1 day ago" or something.


We have GP tools in GP toolbox OurServices.tbx and some of them are written in Python. We access them via geoprocessing services. However some Python functions are just copy-pasted from one GP function script to another.  The question is: Is it possible to embed a Python script, say our_utils.py, into the toolbox file (tbx) so in all our Python tools we are able to access shared functions like this:  import our_utils our_utils.sharedFunc()   We don't want pack shared functions as separate GP tools and then use ModelBuilder; this approach is too heavyweight for the issue.  Bounty edit 1 (2015-05-05)  I feel I have to give a bounty to someone participating here. At least three beautiful minds were attracted by it so I don't want my bounty going to dust.  I don't have ArcGIS at my fingerprints at the moment but I've spent 30 to 40 mins today checking if @mr.adams hacks can be extended to server installations (geoprocessing rest services). And, surprisingly, it worked with some additional hacks!  The hacks were: after packaging to .sd file (still a mystery for me how to pack more than one tool) rename that file to .zip and add libraries folders (import mylib => you must add mylib folder into zip). Then rename .zip back to .sd.  So my modest bounty goes to @mr.adams. I won't mark his answer as true answer; I still need to find a simpler way.  For pure Pythonistas @Farid_Cher gave an excellent .pyt template. I hope many copypasters will use it.

I had posted a  last week about customizing a ToolValidator class and got some very good answers.  In working with the proposed solutions, I have created a custom module that performs queries on a db, and will be called by both the ToolValidator class (to provide values for the drop-down lists) and later in the geoprocessing script (to get other parameters based on items selected in drop-down lists).  However, I can't seem to actually call the custom module in the ToolValidator class.  I have been trying to append to path with no luck.  When I try to apply these changes to the script, I get a runtime error:  [Errno 9] Bad file descriptor.  If I comment out import line, no errors.  sys.path.append('my_custom_module_directory') import my_custom_module   Many of you may be asking why don't I just implement a custom tool with ArcObjects.  The reason is that my end users don't have the privleges necessary to register ANY dlls on their computer.  UPDATE:  This was happening to me in ArcGIS 10.  Interestingly enough, I was initially appending to the path inside of the initialiazeParameters function of the ToolValidator class.  If I do the append outside (i.e., on top of) of the ToolValidator class, everything works as expected.  sys.path.append('C:/Working/SomeFolder') import somescript -------->THIS WORKS  class ToolValidator:   """Class for validating a tool's parameter values and controlling   the behavior of the tool's dialog."""    def __init__(self):     """Setup arcpy and the list of tool parameters."""     import arcpy     sys.path.append('C:/Working/SomeFolder')     import somescript -------> THIS DOESNT WORK     self.params = arcpy.GetParameterInfo()   UPDATE 2:  I think I found the true cause of my problem.  In the code snippets in this post, I have been appending what appear to be real paths (ex C:/Working/SomeFolder) to the sys.path.  In my actual ToolValidator class, I was constructing a relative path using os.path.dirname(__file__) +"\my_special_folder...".  I was anticipating that os.path.dirname(__file__) would return the path of the toolbox, since that contains the ToolValidator class.  I have come to find this is not the case.  As far as I can tell, the ToolValidator class is never actually written to a .py file, and I speculate the the this code is passed to the python interpreter in memory, so __file__ is useless, or some temp script is persisted and then execfile(path_to_script) is called, again rendering __file__ useless.  I'm sure there are other reasons I am missing as well.    Long story short, if I use a hardcoded path, the sys.append works anywhere, relative paths don't work so well in the ToolValidator class.


The following is a big question, but I am really confused by the use of conditional in this Shakespearean excerpt.   From The Taming of the Shrew, Act I, Scene I:     142   I am agreed; and would I had given him the best      143 horse in Padua to begin his wooing that would      144   thoroughly woo her, wed her and bed her and rid the      145   house of her!   Can someone help me parse out this conditional sentence? It seems that the modern English equivalent would be "I would give the best horse to him who could woo her if I found this chosen man who can do so successfully."   If my reading is correct, here is my doubt: Shakespeare uses  A) would I had given as if he means it as the dependent clause whereas we, in MoE, usually change the word order this way in the dependent clause, as in: "Had I known of the matter, I . . ." Is there something I don't understand?   B) Since the time reference is the future, why would . . . had in the first place? Shouldn't it be "I would"?   D) would . . . had? Was this an 16th century equivalent to would . . . have?

There is a place in Bram Stoker’s Dracula where I can’t quite parse the grammar:     8 May. — I began to fear as I wrote in this book that I was getting too   diffuse. But now I am glad that I went into detail from the first, for   there is something so strange about this place and all in it that I cannot   but feel uneasy. I wish I were safe out of it, or that I had never come. It   may be that this strange night existence is telling on me, but would that   that were all!   I understand the meaning of the text in bold (it’s equivalent to if only that was all!), but I don’t understand the grammar being used. What kind of construct is this?


I have a non-salesforce application that needs to send POST requests to my org. From a  by Salesforce, there is much talk of having to do back and forth redirects on the webpage till you get the access token and I presume a refresh token.  My problem, the non-salesforce app is only asking for a POST url to send the requests to. There is no way to code in the authorization steps that I'm aware of. In addition, there is no way to store a token or refresh token in my non-salesforce app. All there is is a field to save a POST url.  Is it possible to create a HTTP POST url to a salesforce org that uses OAuth that never needs to change?

Can I have a public APEX REST API e.g. APEX REST api that is accessible without authentication?


have been trying to wrap my head around solving this. So far this is what I got. But for some reason I keep getting the wrong answer. According to some research I need the multiply the number of combinations of the last two cards(not the three of a kind) by 4 choose one * 4 choose one, and not 4 choose one. Now what I don’t understand is why do I multiply it by 4 choose one twice and not one][1][1]. [1]:  image description here]()

This question has probably been asked before, but just to be clear here, I am NOT asking for the answer, I know the answer.  What i want to know is why my solution is not equivalent to the actual solution.  Three of a kind in a deck means you draw 3 cards of the same rank, and 2 other cards each of different ranks.  So. The solution in my book is the following: (13 C 1)(4 C 3) * (12 C 2)(4 C 1)(4 C 1)  The logic is the following:  1) Choose 1 out of the 13 ranks, then for the 4 cards in the chosen rank, pick 3.  2) Choose a combination of 2 ranks from the remaining 12, then for the 4 cards in each rank, choose 1.  Total combinations: 54912  My solution is the following:  ((13 C 1)(4 C 3)) * ((12 C 1)(4 C 1)) * ((11 C 1)(4 C 1))  1) My logic for the 3 of a kind is the same as the solution.   2) Choose 1 of the remaining 12 ranks, and 1 card from the 4 cards in the rank.  3) Choose 1 of the remaining 11 ranks, and 1 card from the 4 cards in the rank.  Total combinations: 109824  My solution says that the combinations are exactly double of the book's solution.  I'm just very confused as to why this is. If anyone could explain this to me I would be very appreciative, thank you.


When compiling the following try19A.tex file I get the following error as message:  Could not start Recompile Bibliography:PdfLatex: pdflatex.exe -synctex=1 -interaction=nonstopmode "try19A".tex   The file try19A.tex is:   \usepackage{filecontents}   \begin{document}  \begin{abstract}  \end{abstract}  \section{Introduction}  \newpage  \bibliography{TRY19}{}  \bibliographystyle{plain}  \nocite*   \end{document}   Where the file TRY19.bib is:  @article{kargupta2004fourier,   title={A fourier spectrum-based approach to represent decision trees for mining data streams in mobile environments},   author={Kargupta, Hillol and Park, Byung-Hoon},   journal={Knowledge and Data Engineering, IEEE Transactions on},   volume={16},   number={2},   pages={216--229},   year={2004},   publisher={IEEE} } @article{mukherjee2006privacy,   title={A privacy-preserving technique for Euclidean distance-based mining algorithms using Fourier-related transforms},   author={Mukherjee, Shibnath and Chen, Zhiyuan and Gangopadhyay, Aryya},   journal={The VLDB Journal—The International Journal on Very Large Data Bases},   volume={15},   number={4},   pages={293--315},   year={2006},   publisher={Springer-Verlag New York, Inc.} }

I have a bib file in txt format in the same directory of all the rest of Latex files. Here is an example of my file named: Bibliographyforpaper.txt content:   @article{kargupta2004fourier,       title={A fourier spectrum-based approach to represent decision trees for mining data streams in mobile environments},       author={Kargupta, Hillol and Park, Byung-Hoon},       journal={Knowledge and Data Engineering, IEEE Transactions on},       volume={16},       number={2},       pages={216--229},       year={2004},       publisher={IEEE}     }  @article{mukherjee2006privacy,   title={A privacy-preserving technique for Euclidean distance-based mining algorithms using Fourier-related transforms},   author={Mukherjee, Shibnath and Chen, Zhiyuan and Gangopadhyay, Aryya},   journal={The VLDB Journal—The International Journal on Very Large Data Bases},   volume={15},   number={4},   pages={293--315},   year={2006},   publisher={Springer-Verlag New York, Inc.} }    In the LATEX file I use:    \usepackage{filecontents}  \begin{document} \begin{abstract} \end{abstract} \section{Introduction} \newpage     \bibliography{Bibliographyforpaper}{}     \bibliographystyle{plain} \nocite*  \end{document}   And there is only headline of References and no list of the bibliography. If I add \printbibliography and I get an error.


The reason of my question is that I have built a one-page website, but if people who knows a bit of drupal patterns wants to try to request the site by editing the url with a path like domain.tld/node/12 (for ex.), they will be redirected to the clean url and it will work, but this behavior is not intended and the theming customized in a way which is not made for direct requests on nodes.  Apart from the one-page, all the other content is in views and blocks, with a few colorbox links to open one content type in detail.  What I want to do is find a way to disallow node/* requests in path, just to "keep some control" of the way anonymous users visit the site (and potentially test it).   I have tested  which gives a partial answer, but it disallows all node's requests in colorbox.   I tried  but same issue as internal nodes.   Any idea to help me?

I've found that there are times I have a node that simply contains content that will be displayed somewhere else, but shouldn't be viewed directly. That is, no one should ever go to node/1234, but the content in node 1234 should be displayed somewhere else. For example, I create an about page with tabbed content using views. So there are "About Me", "About Us" and "About Them" pages. All of these are displayed in a single page with tabs using Views. So I don't want people to get directly to the "About Us" node because then they wouldn't see the tabs for the other pages. At the same time, I don't want Google giving people a direct link to this node, I want to limit access so users can only get to it through the View (i.e., the tab).  So I need to restrict access to the node, remove it from the Drupal search results, and make sure Google doesn't pick up on it. Any suggestions?


I am able to move the mouse cursor around for a bit after sign-in, the system soon freezes - keyboard or mouse does not work. The activity light at front of computer flashes. The only way to bring the system down is by unplugging the power cord.

All operating systems freeze sometimes, and Ubuntu is no exception. What should I do to regain control when...   just one program stops responding? nothing at all responds to mouse clicks or key presses? the mouse stops moving entirely? I have an    In what order should I try various solutions before deciding to pull the power plug?  What should I do when starting up Ubuntu fails?  Is there a diagnostic procedure I can follow?


(anonymized image URLs) for all external images that appears on GitHub, like when rendered in a README file, in a document, or in issues/pull requests. Using a proxy for images provides several benefits:  Performance: Less traffic through the image server - for popular images the "camo" cache does its job almost all the time.  Functionality: What if the origin server is misconfigured and makes a small (but critical) mistake in, for example, handling CORS?  Durability: The origin server is down - okay, the "camo" cache is available for serving. Worse, what if the image is later changed on the server (under the same URL) to something else? Best they tell you they're not hosting your images, or just replace your image with terrible ads they can make 💰💰💰 out of. .  : The image server can't track users directly, or even get to know how many visitors there are.   That said, a "camo" service is going to be beneficial all the way, but SE is still linking to whatever images directly. Since SE is already using Imgur for image hosting, why not just detect all external images, and before the post is submitted, automatically fetch and store them onto Imgur? This will directly address the following issues:    and more...

I have added a picture to my answer. I did so by providing a link from my own web server and pasting the link to the image into the form ("from the web"). The software in the background silently however takes the image off my server, copies it over to imgur.com an hosts it from there - without informing me about it, and subjecting my image to the copyright and publishing rights of imgur - without my consent.  I think this is highly controversial. In my opinion one or more of the following should be happeneing:   Linked images should not be re-hosted at a 3rd party There should be a notice about that when uploading an image there should be a notice about the distribution/copyright issues when uploading an image   Further I see an issue with linking images from 3rd-party websites to SE. I wonder how this is an issue in terms of copyright. I have myself linked pictures in answers from 3rd party sites. And I am not sure how this action is legal from my side, and how it is legal from imgur to host these images, as well how the situation for SE is.


Why do planets revolving around the Sun not stop revolving? Note I am not asking why planets do not collapse with Sun.

The force of gravity is constantly being applied to an orbiting object.  And therefore the object is constantly accelerating.  Why doesn't gravity eventually "win" over the object's momentum, like a force such as friction eventually slows down a car that runs out of gas?  I understand (I think) how relativity explains it, but how does Newtonian mechanics explain it?


I’ve just upgraded to a much newer Mac after having been on an old MBP running Snow Leopard. There’s a lot to learn in the major jump from 10.6 to 10.12. One change is that my user’s Library folder is invisible.  I did Google this and see I can hold down the option key to make the Library folder visible when I need it to be, but is there a way to always make it visible so I don’t have to do this extra step every time?

I thought there was a checkbox to suppress the hiding of my user Library folder on Mavericks, but I can't seem to find it. I appreciate hiding Library by default, but  have missed it being easily accessible.  How can I get the library folder to be visible in Finder, the Finder go menus / file save dialogs without needing to hold down shift?


When a user visits the link of a deleted questions, he can still see the title in the address bar. For example, when I go to , which is a deleted question, it redirects the user to , showing the question's title. Is this a (non-critical) security issue?

Alternative and much more boring title: Should a 404 result reveal the post title?  I ran across some odd behaviour today. When manually entering a Stack Exchange URL into the address bar1, if you pick a post number that has been deleted then you still see the old post title along with the 404.  For example, I entered:   http://webapps.stackexchange.com/questions/34 and the resolved address came back as http://webapps.stackexchange.com/questions/34/what-is-the-best-empire-avenue-stock-to-buy And http://stackoverflow.com/questions/3 came back as http://stackoverflow.com/questions/1/where-oh-where-did-the-joel-data-go/3#32   Note, I'm obviously not a 10k+ user on either of those sites, which is why they 404'd  It's not that big of a deal, but it seems like this leaks information about the site(s) that we may not want exposed.  And since a picture is worth N words:   Stuff I probably shouldn't be able to see is highlighted.  1And why was I manually entering posts like that? Because I was trying to find a benign 404 example from  that I could share with others because I think their 404 image is hilarious.  2And where did this fabled Joel data go?  Inquiring minds want to know!


I'm creating a new table and in the process creating two foreign keys. The tables with the primary keys referenced exist but Intellisense is giving the error message: "Foreign key. . .references invalid table 'ROLES'."  Why does SQL Server Management Studio not recognize these tables?

IntelliSense in SSMS isn't updating unless I shut it down and restart. I've tried disconnecting from the server and reconnecting while the SSMS session is active, but that isn't working.  Steps to recreate:    Create a table  Select something from that table SSMS displays squiggly red lines under it with the tip "invalid object name" Execute the query   How can I force IntelliSense to update without restarting SSMS?


First of all, thanks for taking your time to look at this. Text from my database tables is being printed with a question mark or � for symbols like č, ę, ė, į, ų, ū, ž etc...  What I've tried:   Setting default_charset "utf-8" in my php.ini. Setting meta tags. Using mb_detect_encoding($mystring, "UTF-8, iso-8859-1, iso-8859-2) on a string returns iso-8859-1. BUT collation in my DB is set to utf8. And the symbols in the text should be UTF8 (Lithuanian). Setting charset to iso-8859-1 or iso-8859-2 in php.ini loads SOME symbols, but still lots of them are question marks, although the black squares disappear. I also used Windows-1252, didn't help.   I also checked the files in Notepad++, for the encodin, and they seem to be UTF-8 without BOM.      If I do this the text disappears altogether:  iconv('ISO-8859-1','UTF8',$string)   I ran out of ideas on what to do, help me. I'll give any more info I can provide.

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.


Hey guys so I was trying to implement a simple hash table in Python and was just curious about why this doesn't work so when I initialize my map variable I first use this.   class HashMap:     def __init__(self):         self.size = 10         self.map = [[] for _ in range(10)] #What to focus on       def getHash(self, key):         return key % self.size      def add(self,key, value):         #Get hashed bucket index         bucket = self.getHash(key)         self.map[bucket].append(value)   #To test my function.  h = HashMap()  h.add(1, "Swag")  print(h.map)   When I do this my hash-map works perfectly fine getting the desired result:  [[], ['Swag'], [], [], [], [], [], [], [], []]   However, when I do this:   self.map = [[]] * 10 #What to focus on   I then get this output:  [['Swag'], ['Swag'], ['Swag'], ['Swag'], ['Swag'], ['Swag'], ['Swag'], ['Swag'], ['Swag'], ['Swag']]   Does anyone know why this occurs? I'm a python newbie so anything would be nice Thanks!

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?