I am including a chapter without a number using \chapter*{...}. However, for some reason, when I do this it displays the wrong header on the next page. See the MWE below. On page 2 it should say 'Introduction' at the top right hand corner. But instead, it says 'List of Tables' currently. Is there a solution to this?    My code:  \documentclass[12pt,twoside,openright]{report} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage[T1]{fontenc} \usepackage{microtype} \usepackage{blindtext} \usepackage{emptypage} \usepackage{newtxtext}  \usepackage[a4paper,top=30mm,bottom=30mm,inner=30mm,outer=20mm]{geometry} \usepackage{titlesec} \usepackage{sectsty}  \usepackage{fancyhdr} \usepackage{setspace} \setstretch{1.36} \usepackage{tocbibind} \usepackage[titles]{tocloft} \usepackage{hyperref}% load after the other packages  \renewcommand{\cftchapfont}               {\usefont{T1}{qhv}{b}{n}\selectfont}  \titleformat{\chapter}[display] {\normalfont\huge\bfseries\fontfamily{qhv}\selectfont}{\chaptertitlename\ \thechapter}{15pt}{\Huge}[\vspace{0.8ex}{\titlerule[2pt]}]  \allsectionsfont{\fontfamily{qhv}\selectfont}  \makeatletter % Removes the word 'Chapter' \renewcommand{\@chapapp}{} \makeatother   \pagestyle{fancy} \fancyhead[LE,RO]{\thepage} \fancyhead[RE]{\nouppercase{\leftmark}} \fancyhead[LO]{\nouppercase{\rightmark}} \fancyfoot[CE,CO]{} \fancyfoot[LE,RO]{} \setlength{\headheight}{30pt}  \begin{document} \pagenumbering{roman} \tableofcontents \listoftables  \cleardoublepage \pagenumbering{arabic}  \chapter*{Introduction} \addcontentsline{toc}{chapter}{Introduction}   \blindtext[5]  \chapter{First Numbered Chapter} \section{Example section} \subsection{Example subsection} \blindtext[10] \end{document}

When using book.cls and using \chapter* after a \chapter, the header used in \chapter* is wrong. An example is pasted below.   Is there any known workaround for that? I have tried quite some tricks without success.   \documentclass[]{book}  \begin{document}  \chapter{First Chapter} aslkjdf  \chapter*{Unnumbered Chapter} The GNU General Public License is a free, copyleft license for software and other kinds of works.  The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too.  When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things.  To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others.  For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights.  Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it.  For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions.  Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users.  Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free.  The precise terms and conditions for copying, distribution and modification follow.  \end{document}


, expansion of space is considered, and it is explained that gravity and electomagnetic forces prevent matter from expanding.  The idea I get in my head is something like a weight attached to a spring, dragged behind a car. The movement of the car will try to expand the distance between the weight and the car, but the spring (gravity, or other forces) will counteract the drag force created by the ground.  Thus, I imagine that if we have a very long string of say nano-tubes in space, the expansion of space will assert a pull on both ends, but it will most likely not be strong enough to break the string.   This tension however, can it be used to produce energy, perhaps something like piezoelectricity?

This question is a more concrete reincarnation of an .  Are there mechanisms to extract energy from the cosmic rate of expansion? putting some extremely long ropes across the universe and extract work from their increase of separation?  assuming this is possible ( i don't see why it would not ), what form would take the back-reaction force? in all physics, every time you extract work from some system by some force, this system will exert a force back. Can we slow down cosmic expansion by variations of these mechanisms?


The "Grid" placement plugin in Compiz/Unity seems to mostly work like Windows' window management, in that I can bind Super-Right to place on the right half of the display, etc.  But, with more than one display, I ran into a difference in behavior from Windows:  Say you have a system with two displays side-by-side.  In Windows, if you have a window positioned (for example)  on the right half of the left display, and press Super-Right, the window moves to the left half of the right display.  That is, Windows considers the display layout as one big grid, and the shortcut keys can move the windows across displays.  This doesn't seem possible in Compiz?  (I know you can use different hotkeys to move between displays, but that's not what I'm asking for here)

I frequently use Ctrl+Super+Arrow -Keys to move windows around. However, with a multiple monitor set up, the shortcuts only move the windows on the current screen.  **Example of my situation:  I have 3 monitors and I have an instance of Chrome open in my center monitor.    When I hit Ctrl+Super+Arrow (left)the window splits to the left half of my center monitor. When I repeat, the window does not move.   What I'd like to see instead is that in [2.], the window moves to the right half of the left most monitor, and so on  How do I achieve this behaviour?


I wanted to google it and learn about the connector; with the ultimate goal of learning how to turn it into a DVI, VGA or HDMI  (To turn a naked laptop LCD into an ad hoc monitor)  But when I started, I realized I didnt even know what I was googling.

In a desktop I connect monitors through DVI, VGA or HDMI post that is there on motherboard of the CPU box. What interface is there in laptops? Is it the same (with different physical look and feel) Or there is any other standard for laptops ?


I have the followoing code to create a folder inside a document library:-      ListItemCreationInformation listItemCreationInformation2 = new ListItemCreationInformation();      // Below are options.     // (1) File - This will create a file in the list or document library     // (2) Folder - This will create a foder in list(if folder creation is enabled) or documnt library     listItemCreationInformation2.UnderlyingObjectType = FileSystemObjectType.Folder;      // This will et the internal name/path of the file/folder     listItemCreationInformation2.LeafName = listItem["Title"].ToString() + i["Level1"].ToString();             try                {                  ListItem listItem2 = templatelsit.AddItem(listItemCreationInformation2);                }            catch { }   currently i am wrapping the code to add the folder inside a try/catch, so is there a way to check if the folder exists before trying to add it?

Is there any way other than looping through the Files to check whether the folder or files exist in document library using clientcontext - client object model..  Can someone confirm me whether the below code will work or not. Or will it create any exception??  using(var clientContext = new ClientContext(site))  {  Web web = clientContext.Web;  Microsoft.SharePoint.Client.File file = web.GetFileByServerRelativeUrl("/site/doclib/folder/filename.ext");  bool bExists = false;  try { clientContext.Load(file);  clientContext.ExecuteQuery();   bExists = file.Exists;  } catch{ }  if (bExists ) { . .  }


I know answers are $4$ and $2$ but can't solve this.

We know that $2^4 = 4^2$ and $(-2)^{-4} = (-4)^{-2}$. Is there another pair of integers $x, y$ ($x\neq y$) which satisfies the equality $x^y = y^x$?


My 5-year-old has been an absolute nightmare. He hits his 2-year-old sister and blames it on her, argues back saying "no way" all the time, and will not do as he is told to.   He keeps having major tantrums all the time. He gets up at 5 in the morning, gets a chair, climbs up and starts rummaging the cupboard. I'm worried that it's a bit dangerous.   I have tried just about everything: the 123 magic system, time out on a naughty step,  taking away his favourite toys for a while. But he just laughs it away. A few days later, after telling him off for his bad behaviour, he promises never to repeat that but goes on to do the same things over and over again.   I am just about at the end of my tether as nothing seems to be working and my 2-year-old girl is now starting to take up some of his nasty habits.   How can I possibly deal with such an incorrigibly naughty 5-year-old?

My 5 year old son receives and fears punishment but repeatedly exhibits the same unacceptable behaviors.  He's always been strong-willed, and is usually the kind to view a statement like "Don't do that" as an open invitation to do it.  We've tried redirection or distraction tactics, but he is still so narrowly focused on doing the original behavior.  Even worse, he will typically do the prohibited behavior and flagrantly tell us or show us that he's done it.  Repeatedly, even after punishment.  (He's in time out right now for this very thing).  He's consistently punished, yet he continues down the same self-destructive path each time.  When he is punished, we explain what he did wrong, why he's being punished, and why he shouldn't do what he was told not to do.  Sometimes he'll even tell us first why he's in trouble, so it makes me wonder if he's acting out for the inevitable negative attention he gets.  I think he gets plenty of love and positive attention- he's an only child and stays with a relative during the day.  We're trying to give him a good, fun childhood, but we need to figure out how to effectively discipline him.    His repeated misbehavior includes:   Yelling at the top of his lungs in public (stores, friends' houses, etc) Running away from us (at parks, stores, parking lots, etc) Talking back and disrespecting authority figures Hurting animals even after we explain why it's wrong Repetitive nuisance behaviors (repeating himself, banging his fists, kicking walls, intentionally crumbling food on floors, etc) Repeatedly asking us why he can't do something even after it's been explained to him Basically, most bad behaviors that young children may do, but repeated over and over again, even after discipline   He gets a warning to stop the behavior, then depending on the severity of what he's done (and where we are), he'll either go to time out or lose a privilege (such as taking away a favorite movie or missing out on an activity).  Going to time outs and losing privileges really upset him, but still do not ultimately deter him from the bad behavior.  It's like he can't help himself.  My spouse and I are getting worn down.  We try to model good behavior and encourage him to be well-mannered and respectful.  This behavior mortifies us.  It seems we can't even enjoy life as a family because our son is so disruptive and unresponsive.  Most public outings have to be cut short or eliminated because he consistently misbehaves and doesn't respond to our discipline.  After he's misbehaved, when we try to have heart-to-heart talks with him about his behavior and why we expect him to mind us, he usually has a little trouble expressing himself, and a lot of times we get the same nonsensical responses from him (Us: Why did you do [bad behavior]?  Him: Because I didn't want to).  He also doesn't like to make eye contact.  We don't usually feel like we've gotten through to him.  Is there another discipline tactic we could try?  Or does it sound like we need to see a professional at this point?  We're at a loss, and don't want things to spiral further out of control as he gets older (and even begins school).  We just want him to understand that his behavior isn't always acceptable.  Thanks for reading.  Update (from comments below): My spouse and I disagree on spanking, as we had different experiences with it. He feels it's necessary sometimes. Since our son failed to improve after time outs and taking away items/privileges, I grew to agree with him and we used it for select bad behaviors. It didn't work any better. However, when he was spanked, he was always told why. I didn't mention that we have used it because I was afraid it would distract from the original question, but since it has already come up [in comments], yes, it has been explored, but with no better results than our other tactics.


If  $G_1,G_2$ are groups, $\varphi:G_1 \rightarrow G_2$ is a homomorphism and $a \in Z(G_1)$, is it true that $\varphi(a) \in Z(\operatorname{im}\varphi)$?  My attempt so far: I define $\varphi:G_1 \rightarrow G_2, \varphi(a)= \frac1a, a\in\mathbb Z$. which is not an integer. Also, $\varphi$ is a homomorphism since $a,b\in \mathbb Z :\varphi(ab)=\frac1a\frac{1}{b}$. Is this a valid counterexample?

I am working on a school assignment and have been stuck on this question for some time.   Let $f : G \rightarrow G_1$ be a surjective homomorphism (also called epimorphism) from $G$ to another group $G_1$. Prove that $f(Z(G)) \subseteq Z(G_1)$  I know we start by assuming we have an element in $f(Z(G))$ then showing it is also in $Z(G_1)$. Also, $Z(G)$ is the center of $G$, so $Z(G)$ is all the elements of $G$ that commute with all elements in $G$. But how do we know that if we map the elements of $Z(G)$ to $G_1$, then their image will also commute with all the elements in $G_1$? Does it have something to do with using commutativity with the homomorphism? i.e. $f(gz) = f(g)f(z) = f(zg) = f(z)f(g)$.


(it's not a duplicate, but hey. I guess as per some of the comments, the answer is "you can't, Microsoft hasn't made it possible". It's annoying to see people incorrectly directed to a wrong resource at the top of the page, but I don't have any options for un-breaking the wrong filing, so I'll leave it here. Sorry, future visitors!) I have created some hard links (Directory Junctions) - they show up in Windows File Explorer with a little shortcut-like icon overlaid on the normal folder icon. But how do we edit them (and implicitly: see where they are pointing) in Windows Explorer? Worst case, dropping down to the command line, even mklink doesn't appear to have editing as an option () and I can't find anything in Windows File Explorer to see info on them (let alone edit it). Do you have to manually delete each one and recreate it, rather than edit it? Is there literally nothing in MS's own file explorer to view them? (the shell extensions I could find don't show where they point to, and don't let you destroy them, but do let you create them).

The command dir /a displays a list of all the files,folders in a given location. But it displays the type  for Junction Points as well as Symbolic Links to Folders. Is there any command which will differentiate and tell me which of these  are Junction Points and which are Symbolic links as well as which of the files are hard links ?


I have a set of distributions and I have combined (programmatically, not mathematically) them with weights, for example: Dist1, Dist2, Dist3, Dist4 p=.25, p=.20, p=.20, p=.35  Unless I am mistaken, the overall mean of this combination can be determined as:  mean(dist1) * 0.25 + mean(dist2) * .20 + mean(dist3) * .20 + mean(dist4) * .35   the probability of any value (e.g. pdf(x)) is calculated in much the same way:  pdf(x, Dist1) * .25 + pdf(x, Dist2) * .20 + pdf(x, Dist3) * .20 + pdf(x, Dist4) * .35   But the standard deviation cannot be determined like that. Other answers I have found on this site are for working with samples of finite length, but here I already know the standard deviations of my distributions and want to somehow combine them. I also saw somewhere that I can combine standard deviations by doing sqrt(std1^2 + std2^2) but I don't know how the weighting would come into this.  How can I do this? (and does what I have already done work mathematically - it almost seems too simple to be correct).

Say I have two normal distributions A and B with means $\mu_A$ and $\mu_B$ and variances $\sigma_A$ and $\sigma_B$. I want to take a weighted mixture of these two distributions using weights $p$ and $q$ where $0\le p \le 1$ and $q = 1-p$. I know that the mean of this mixture would be $\mu_{AB} = (p\times\mu_A) + (q\times\mu_B)$.  What would the variance be?    A concrete example would be if I knew the parameters for the distribution of male and female height. If I had a room of people that was 60% male, I could produce the expected mean height for the whole room, but what about the variance?


Split-core (micro-threading) support was put in the upstream kernel version 3.15, and dynamic split-core in 4.3. What version of Ubuntu includes this support?

Is there a list of Ubuntu versions with default corresponding Linux kernel versions somewhere?  I would specifically like to know the most recent version of Ubuntu that still used Linux Kernel 2.x.


Today I saw this limit and I was baffled by  it.  $$e=\lim_{ n\to \infty} \sqrt[n]{\operatorname{lcm}(1,2,3,4,\ldots,n)}$$  Is there an elementary proof of the result?

I computed the LCM for all natural numbers from 1 up to a limit $n$ and plotted the result over $n$.  Due to the fast-raising numbers, I plotted the logarithm of the result and was surprised to find a (more or less) identity curve ($x=y$).  In other words, $LCM(1, 2, 3, ..., n)$ appears to be roughly the value $e^n$.  Is a there a simple explanation on why this is so?  $LCM(a, b, c, …)$ shall be defined as the least common multiple of all arguments $a, b, c, …$


I use Ditto in Windows, and often use the custom keyboard shortcuts for pasting the 2nd or 3rd previously copied clipboard entries. Is there a way to do this in Ubuntu? I have tried all the clipboard managers and don't see a way to do it in any of them. Whichever clipboard manager which allows this will be the one I choose. Many thanks.

I am looking for a clipboard manager, but I don't want one that just keeps a list so I can select an item to bring it to the front of the clipboard, nah, that's too easy.  What I am looking for is a clipboard manager where I can assign say Ctrl+Shift+1 to paste the first item in the clipboard, Ctrl+Shift+2 to paste the second item in the clipboard ... Ctrl+Shift+9 to paste the ninth item in the clipboard Ctrl+Shift+0 to paste the tenth item in the clipboard    why? As we web developer I am often pasting alternating lines of code (remember, not all browsers support CSS3!),
...

...

...

...
   So, the ability to just sit there doing Ctrl+Shift+1 Enter    Ctrl+Shift+2 Enter    Would be a huge help,  I am using 12.10 with gnome-shell 3.6.2.  I have looked into gPaste and such, but none seem to have this feature.


Where can I ask questions about  ?  (for those who do not know,  Catia is a very powerful 3D CAD/CAM/CAE drawing software)

Which Stack Exchange site is best for AutoCAD questions like using Blender for graphical design?


Singular or plural?  Would it be "make" or "makes" in this case:     I believe my experience in program management and evaluation, along with my Master’s degree in Sociology with a specialization in migration, makes/make me an ideal candidate for this position.

Is a subject singular or plural with a modifying prepositional phrase that has plural objects?  Would it be "has" or "have" in this case:     The earthquake, along with its subsequent aftershocks, has/have created an atmosphere of panic among the city's residents.


Yesterday I changed my Xubuntu 16.04 user password using passwd in the terminal. I continued working all day, everything was fine.  Today I turn on my machine, try to log in and I'm stuck in a log-in-loop. Every time I log in, the screen goes black, then it puts me back to the log in screen. It turns out that my ecryptfs password hadn't been updated, so I had to manually 'rewrap' it. 15 minutes wasted...  Then, I opened Chromium, and it asked for my keyring password. I entered my new password, and it wasn't accepted. I entered my old one, and it accepted that. Unfortunately because of this it seemed to have deleted all of my cookies, so every single website had been signed out. As somebody who uses Chromium all day every day, this was a big problem. 30 minutes wasted...  I then tried to change my password with the 'Users and Groups` GUI app, and upon clicking 'Change password', it hung like Windows Explorer often does... 15 minutes wasted.  So the question is - how do I change my password without causing these problems? As far as I know I didn't do anything out of the ordinary like manually editing /etc/shadow, so what went wrong?

I have ubuntu mate. I have recently changed my password using the passwd command. I know now that I have made a mistake because I also have my home directory encrypted with the previous password.  Consequently after enter my new password at login screen it return me back to the login screen.  Can someone please help me?  I am able to enter to grub boot menu and shell, i am also able to log into guest user. Sorry if the topic is duplicate but I haven't found the same question  Thanks in advance.


Link "Goods" click event is not working after "Shops" clicked

Goods

Shops

   Full code:

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I have 2 320 GB drives on my computer. I have Windows 7 installed on Drive C:  How do I install Ubuntu onto Drive D, and still have dual boot capability?

Okay, so here's the story.  I am trying to install Ubuntu 13.04.  I currently have a 2TB drive in my computer where Windows 7 boots from, and a secondary 500GB drive that also has a bootable installation of Windows 7, because the version on the 2TB is a clone of what was on the 500.. I do not need any information on the 500 as I already have it moved over to the 2TB.  What I want is to completely reformat the 500 so that it has about 300GB for NTFS and the rest for Ubuntu.  However, I can't seem to find a straightfoward way to do that in the Ubuntu installer.  If I click on "Install Ubuntu alongside them," it does not give me the option to select my 500GB drive, only my 2TB.  I do NOT want any linux partitions on my 2TB drive.  I do not want to click, "Erase disc and install Ubuntu" for obvious reasons.  Finally, clicking "something else" brings up a menu that is quite confusing.  I can kind of figure out how to use it, but it's not as straightfoward as I'd like..  Further, I know that Ubuntu requires a SWAP partition, but I do not know how much, or even how, to allocate that with the stupid dropdown menus it gives me.  So, to get to the point..  What is the easiest, safest way to do what I want to do?  That is, allocate approximately 200G for Ubuntu on my 500G drive, and be able to choose between Windows 7 on my 2TB drive and Ubuntu at startup - all, of coarse, without touching the 2TB drive at all.  Thanks!


I want to show that $p(x,y)=x^2+y^2-1$ is irreducible in $\mathbb{Q}[x,y]$. There is already a similar problem posted:    but this question uses the irreducibility of $p(x)$ to show that it is prime and therefore an integral domain. The part of the problem I am stuck on is showing that $x^2+y^2-1$ is irreducible over $\mathbb{Q}$ in the first place.  I have considered taking the approach used in the above link except for backwards, but I am unsure of whether or not the converses of the theorems used still apply.  Edit: I see that this question has been marked as a duplicate, but I think I have explained how I am asking a different question than the one that was posted previously.

How can I prove that $\mathbb{Q}[x,y]/\langle x^2+y^2-1 \rangle$ is an integral domain?  Also, I need to prove that its field of fractions is isomorphic to the field of rational functions $\mathbb{Q}(t)$?    (The question is taken from )


I have to write something under the symbol \bullet in Latex. Is it possible? I'm using the class beamer. Here it is an example of a frame:  \begin{frame} \begin{itemize} \item<1-> Products Market\mbox{}\\ \footnotesize{where $p_{i,t}=u_{i,t}$, with $u_{i,t}\sim u[0,2]$} \vspace{0.5cm} \item<2-> Credit Market \mbox{} \vspace{0.2cm} \\ \footnotesize{where \hspace{0.1cm} $\bullet_{bank} \xrightarrow{loan} \bullet$} \vspace{0.5cm} \item<3-> Interbank Market\mbox{} \vspace{0.08cm} \\ \footnotesize{where \hspace{0.1cm} $\bullet \xrightarrow{loan} \bullet$} \end{itemize} \end{frame}   In particular I want to write "bank" under the bullet, whilenow it is only in subscript.  Thanks

I have to write something under the symbol \bullet in Latex. Is it possible? I'm using the class beamer. Here it is an example of a frame:  \begin{frame} \begin{itemize} \item<1-> Products Market\mbox{}\\ \footnotesize{where $p_{i,t}=u_{i,t}$, with $u_{i,t}\sim u[0,2]$} \vspace{0.5cm} \item<2-> Credit Market \mbox{} \vspace{0.2cm} \\ \footnotesize{where \hspace{0.1cm} $\bullet_{bank} \xrightarrow{loan} \bullet$} \vspace{0.5cm} \item<3-> Interbank Market\mbox{} \vspace{0.08cm} \\ \footnotesize{where \hspace{0.1cm} $\bullet \xrightarrow{loan} \bullet$} \end{itemize} \end{frame}   In particular I want to write "bank" under the bullet, while now it is only in subscript.  Thanks


I have the following paragraph;  \usepackage[backend=biber,style=nature,natbib=true]{biblatex} \begin{document} Open Multilingual WordNet~\cite{bond_survey_2012} set out to discover the effect of choosing the correct license for wordnets. \ldots Thankfully, \textcite{bond_survey_2012} have standardized the wordnets and are currently hosting them from a single source. \end{document}   Assuming bond_survey_2012 exists on my .bib file;  @article{bond_survey_2012,   title = {A {{Survey}} of {{WordNets}} and Their {{Licenses}}},   abstract = {This paper surveys currently avail-able wordnets. We measure the ef-fect that license choice has on their us-age, measured by the number of cita-tions. Finally, we discuss methods to make wordnets more generally accessi-ble, starting with a shared online server for freely distributable wordnets.},   date = {2012-01-01},   author = {Bond, Francis and Paik, Kyonghee}, }   I would like to have an output similar to below;     Open Multilingual WordNet [1] set out to discover the effect of   choosing the correct license for wordnets.   ...   Thankfully, Bond &   Paik have standardized the wordnets and are currently hosting them   from a single source.   Note that [1] is not repeated.  Edit: Embarrassingly found the answer under biblatex documentation, the question did not appear on search engines which is why I asked the question in the first place, sorry.

How do I cite authors in LaTeX?  I tried using natbib package  ---- doc.tex ----  ... \usepackage{natbib} ... \citeauthor{736184} ...   ---- doc.bib ----  @inproceedings{736184,      author = {Broder, Andrei Z.}, ...   but all I get is (author?) (in bold).


I am studying a set of uniformly generated points, more concretely the distance between the points. When the set is unsorted the histrogram shows it is normally distributed and that matches my intuition: hist(diff(runif(100,0,100)))  However, when the set is sorted the histogram resembles an exponential distribution: hist(diff(sort(runif(100,0,100))))  The way my intuition works this  means that the most common distance between 2 consecutive endpoints is the smallest one of all the distances which seems odd to me, my intuition when looking at the problem was driving me more towards an inverse-gaussian, I understand the most common distances will be close to the bottom but I was not expecting it to be straight the smallest one. What property of this system makes this happen?

Let $U_1, \cdots, U_n$ be $n$ i.i.d continuous uniform random variables on $(0,1)$ and their order statistics be $U_{(1)}, \cdots, U_{(n)}$.  Define $D_i=U_{(i)}−U_{(i−1)}$ for $i=1, \cdots, n$ with $U_0=0$.  I am trying to figure out the distribution $\lim_{n\to\infty} \#\{i = 1, \cdots, n \mid nD_i \geq z\}/n$. This must be very well known, but I cannot find a reference.


I have an html page:-

Info

View Details
   My Jquery code is:-                    $("#ViewTable").on('click', function (e) {                  $('.modal-footer .btn-danger').prop("disabled", true);                });   My above code is not working can anybody tell me why?


I have come across comments such as below.   Which contains link to external website but http url does not show up in the comment instead user provided word come up, upon clicking that word will lead to external website(example "help center", "Minimum, Complete and Verifiable example").

Across the Stack Exchange network you may leave comments on a question or answer.  How do comments work? What are comments for, and when shouldn't I comment? Who can post comments? Who can edit comments? How can I format and link in comments? My comment doesn't contain some of the text I typed in it; why? My comment appears to be long enough, but I can't post it because it's too short; why? Who can delete comments? When should comments be deleted? Why can't I comment on specific posts even if I have enough reputation to comment? When can comments be undeleted? What are automatic comments? How can I link to comments? Anything else I should know about comments?  Also see the FAQ articles on  and .


Disk /dev/sda - 1000 GB / 931 GiB - CHS 121601 255 63      Partition               Start        End    Size in sectors >  HPFS - NTFS              0  32 33 12876  51 39  206854144    Linux                    0  32 33 121094 253 55 1945389056    Linux                  429 254 18 120588 194 54 1930350592    HPFS - NTFS          12876  84  9 33399  41 50  329699328 [DOCUMENTS]    HPFS - NTFS          12876  84 16 33399  41 50  329699321    HPFS - NTFS          33399  74 20 59022  11 61  411629568 [PICTURES]    HPFS - NTFS          33399  74 27 59022  11 61  411629561    HPFS - NTFS          59022  44 31 89745 254 45  493578240 [AUDIO n VIDEO]    HPFS - NTFS          59022  44 38 89745 254 45  493578233    HPFS - NTFS          89746  32 15 121601  57 56  511752192 [SOFT n OTHERS]    HPFS - NTFS          89746  32 22 121601  57 56  511752185    Linux Swap           120588 227 24 121601  57 56   16263168 Structure: Ok.  Use Up/Down Arrow keys to select partition. Use Left/Right Arrow keys to CHANGE partition characteristics: *=Primary bootable  P=Primary  L=Logical  E=Extended  D=Deleted Keys A: add partition, L: load backup, T: change type, P: list files,      Enter: to continueubuntu@ubuntu:~$  NTFS found using backup sector, blocksize=4096, 105 GB / 98 GiB

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


I am having issues installing Windows 7 through Bootcamp on my Mac. I want to be able to natively boot into my Windows installation so Parallels or VMWare will not work for me. I am using an early 2013 MBP with retina.  Here's what happens: I am able to partition the drive with the Bootcamp assistant, download the support software, and have the machine reboot into the Windows installer. Upon installation however, it seems like the USB controller for my MBP is not active and it's not able to find my installation media. The specific error that I'm getting is:  "A media driver your computer needs is missing. This could be a DVD, USB, or Hard disk driver. If you have a CD, DVD, or USB flash drive with the driver on it, please insert it now."  I made a video reproducing what happens:   Hopefully someone out there has run into this as well, I could really use some unblocking!

I have been trying for days to get Windows 7, 64 bit installed on my late 2013 Macbook Retina using bootcamp and always run into the same problem - when the Windows installation starts it gives an error message saying "No device drivers were found for my CD/DVD device..." and prompts be to try to browse to a location to find the drivers.   When I try to browse for the drivers I see two drives:   BOOTCAMP (C:) BOOT (X:)  Program Files sources Users Windows    (C:) is my bootcamp partition and I am assuming that (X:) is my install drive, but the file structure looks nothing like what it looks like from Mac OS X.  I never get the prompt asking me which partition to install Windows on.  I am using a USB drive and a Windows 7 64 bit ISO with Bootcamp Assistant. Everything goes smoothly in BCA. I have tried several different ISOs including one recommendation to use a specific ISO that is supposed to be a "full" version which includes additional drivers, but still with no luck.


I would like to have a beamer frame such that it shows an image, but stretches it across the whole slide so that it fits exactly, leaving no margin or no title. The image is indeed the right proportions for a beamer slide.  MWE:  \documentclass{beamer}  \begin{document}  \begin{frame} \includegraphics{fullslide.png} \end{frame}  \end{document}   I suppose I either need to (or both):   change the style of the beamer frame to have no margin, no title, etc. stretch (hopefully automatically) the image on the slide.

I have a beamer presentation with a custom style which creates a red bar along the bottom of each slide. When I change the geometry and then revert it with restoregeometry, the red bar is now shifted to the right.  The aim is just to have the picture full width.  \documentclass{beamer}    \mode<presentation>  { \usetheme{myslides}  }  \begin{document}  \begin{frame}[fragile] \frametitle{}  \begin{center} \huge Introduction? \end{center} \end{frame}  \newgeometry{margin=0pt}  \begin{frame}[fragile, plain] \frametitle{} \includegraphics[width=\paperwidth, width=\paperwidth]{picture} \end{frame}  \restoregeometry \begin{frame}[fragile] \frametitle{} \begin{center} \huge Next slide? \end{center} \end{frame} \end{document}   How can I restore back to exactly the state it was in before the newgeometry command?  My question seems related to  as well where there is a similar problem with \restoregeometry in one of the answers.


I am self-studying Linear Algebra from Hoffman and Kunze. The Exercise $6$ on page $5$ asks to show that if two homogeneous systems of linear equations in two unknows have the same solutions, then they are equivalent.  Let $\left\{\begin{array}{c} A_{11}x + A_{12}y = 0 \\ A_{21}x + A_{22}y = 0 \\ \vdots\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,  \vdots\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, \vdots\\  A_{n1}x + A_{n2}y  = 0 \end{array}\right.$ and $\left\{\begin{array}{c} B_{11}x + B_{12}y = 0 \\ B_{21}x + B_{22}y = 0 \\ \vdots\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, \vdots \,\,\,\,\,\,\,\,\,\,\vdots\\  B_{m1}x + B_{m2}y  = 0 \end{array}\right.$ be the two homogeneous systems of linear equations in two unknows. I wrote the fisrt equation of first system as linear combination of the equations of the second system and I get the following:  $\left\{\begin{array}{c} c_{1}B_{11}+c_{2}B_{21}+\cdots+c_{m}B_{m1} = A_{11} \\ c_{1}B_{12}+c_{2}B_{22}+\cdots+c_{m}B_{m2} = A_{12} \end{array}\right.$  I know that I am supposed to find $c_{1},\dots,c_{m}$, but all I know so far is the following: The definition of system of linear equations, solution of the system, homogeneous system of linear equations, and equivalent system and the definition of equivalent system:     Two systems of linear equations are equivalent if each equation in   each system is a linear combination of the equations in the other   system.   After bgins and Parsa's hints, I was able to solve this question.  PS. The same question appears , but it was solved by using more than I have so far in the book.

I've just begun to work learn Linear Algebra on my own through Hoffman and Kunze's book and the first problem set already has a question that I can't solve:  Prove that if two homogeneous systems of linear equations in two unknowns have the same solutions, then they are equivalent.  I can't seem to figure out how to prove this without resorting to case work where you account for the cases where one of the coefficients are zero and when both are.  Is there an elegant way to prove in general that when two systems of linear equations have the same solutions, they are equivalent? The converse is obvious enough though.  Definition of equivalence from the text :     Let us say that two systems of linear equations are equivalent if each equation in each system is a linear combination of the equations   in the other system.


In my probability class we saw an amazing proof using the CLT (central limit theorem), I'm wondering what's a more straightforward way to do this.

I'm supposed to calculate: $$\lim_{n\to\infty} e^{-n} \sum_{k=0}^{n} \frac{n^k}{k!}$$ By using WolframAlpha, I might guess that the limit is $\frac{1}{2}$, which is a pretty interesting and nice result. I wonder in which ways we may approach it.


for (double i = 0; i < 0.05; i+= 0.001) {             //do something }  In this for loop, I thought the count would go as follows: 0, 0.001, 0.002, 0.003, etc., but it becomes 0.0090000000000000011 instead of 0.009. Why is such conversion possible?

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


I asked in this site before, but apperantly I don't quite understand. I want to make a digital counter circuit which it counts to 15 minutes for my big project in my campus . When the circuit counts to 10 minutes, it will give a signs a buzzer. Same when it continues to 15 minutes, it will give a signs a buzzer again. (the circuit is for public speaking, so the speaker knows that he or she already went speak for 10 minutes and 15 minutes). We weren't allowed to use an Arduino, Microcontroller, PLCs, and IC NE555. The requirements of this project is to use breadboard or PCB, LED (this LED acts as a sign buzzer), each IC Decoder and each IC counter (not a built-in IC Counter and Decoder, so it's a seperate Counter and Decoder), any type of flip-flop (SR/D/JK) wether it's counter UP or DOWN, 7 segments display and 12 V battery. I'm kinda stuck here and I'm thinking it's impossible to make such a thing. Do you have any idea guys? I had an idea to use crystal oscillator, but I still don't understand

Basically, I have a big project going on in my campus which we were told to make digital counter. So when the timer counts reach at 10 minutes (by this case, the timer counts is shown by 7-segment display), it will produce alarm sound or buzzer sound, and when it continues and reach to 15 minutes, exactly doing the same by how the timer goes to 10 minutes. Any ideas guys on how to make the circuit? I'm kinda stuck here. (We aren't allowed using an IC NE555, but we are told to use 7-segment display, logic gates IC like IC 7408, any basic IC. And I'm on Digital Electronics course, I'm still learning about basic logic gates, boolean algebra, XOR and XNOR gates, multiplexer and duplexer. My reference book is Digital Electronics, a practical approach with VHDL by William Keiltz)


Is ubuntu supports on Lenovo g5070 and how to install...

I would like to see a full how-to guide on how to install Ubuntu.


Stock market noob here.  Can I invest in a stock prior to it's ex-dividend date, then sell after and still get the dividend payout?  Let's say for example the ex-dividend date for Stock ABC is Aug 31st. Can i buy stock in it Aug 30th, turn around and sell Sept 1st and still get the dividend payout?  Is there any benefit to buying the stock way earlier -- say, in January?    Thanks for the responses!

Dividends are paid to share holders based on ownership of shares before the “ex-dividends” date.  Example: Stock A has an ex-date of July 1st Stock B has an ex-date of July 15th Stock C has an ex-date of August 1st  Is it legal to buys Stock A on June 30th, sells it on July 2nd, then buy Stock B on July 14th,   sells it on July 16th, then buys Stock C on July 30th, sells it on August 2nd... and continues this process to “mine” dividend payouts? Is this a strategy that is used by investors? Why or why not?


Recently, I overreacted over a question ban thanks to this question     (Question Deleted), but I  was searching for a little while, and I found this.    While it was closed once, it was reopened, and has not gotten any bad criticism. I was trying to communicate almost the exact same thing in my question, but it was closed, deleted, and down-voted. Why was this question not attacked like mine??

I am posting this question just to get a better understanding of the questions that can be asked on Stack Overflow.  I find that  can several answers based on users opinion and cause a discussion.  Why is this a good question when several other requests for books and tutorials are not acceptable?


public static void main(String args[]){     System.out.print("Type new, wil display TRUE:");     Scanner sc = new Scanner(System.in);     String userInput = sc.nextLine();      if(userInput=="new"){         System.out.println("TRUE");     }else {         System.out.println("FALSE");     } }   I have no idea why new not equals to new.   Please give me some hints :)

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?


I could understand the closing of  if I hadn't done anything, because it wasn't posted very clearly, so I significalty reworded my question. What do I have to do, post it again?  Thank you for any suggestions

Questions can be closed or marked as duplicates.  What does it mean for a question to be "closed"? What does it mean for a question to be marked as a "duplicate"? Who can close a question? What are the reasons for closing a question ? Is closure the end of the road for a question? When are closed questions eligible for deletion?   Related        For more information, see "" in the .


I am looking for a way to add a banner image after first post across the website.  If it was about adding a banner on one page only, homepage or category page, then I could have done this in WordPress loop.  if ( $wp_query->current_post == 0 ) {    echo '

'; }   And this works but can't we do something with pre_get_posts or use some other function to achieve this across the website. On homepage, authors, archive, categories, search and tags pages.

How can I insert a DIV just below the first search result (between result #1 and #2)?


How to post pictures with the mobile app?  I wanted to answer a question with a diagram on my mobile.  How should I do that?  I am currently on iPhone, using the Stack Exchange application.  If this feature is not present, I would like to request for it.

So this is pretty obvious. Image upload?    How about allowing to attach images in questions from the photo gallery, by perhaps sending the image for off-site storage like done from the full-web version?


Give two integers $m$ and $n$ such that $n^2$ is a multiple of $m$, $n$ is not a multiple of $m$ and $n > m.$   I think that such two integers don't exist, but even if that were true, I'm having trouble with proving that. I have found clear examples when I neglect the last condition ($n > m$).  Any help on this problem would be much appreciated. The observation that I did make is the fact that since $n^2$ is a multiple of $m$ we can write it as $k * m$, which means that $k$ has to be larger than $n$.  I think that could be a starting point of some sort, but I wasn't capable of going any further.

I am looking to prove the following statement false:  Let $k$ be a positive integer, then $k\mid n$ if and only if $k\mid n^2$.  So I am trying to find a $k$ where this does not hold but after aimlessly trying numbers I was curious if there is a methodical way to find $k$.


I'm working on SharePoint 2016 OnPremise, Workflow 2013 and I'm trying to set a MultiLookupField with one ore more values. I tryied to set 1;#2;#3;#4 and 1;#;#2;#;#3;#;#4, or for one single item 1;#;# and 1;#. Then I tryied to add the correct lookupValue 1;#Test1 and 1;#Test1;#2;#Test2;#3;#Test3 but nothing worked. The Worklows tells the following error:  An unexpected 'PrimitiveValue' node was found when reading from the JSON reader. A 'StartObject' node was expected.   I already read post like  and , they did not help.  A possible solution would be to create a WF2010 and start it from the current WF, but I'd avoid the need of a second WF...

I'm trying to set the value of a field in a lookup column using a SPD 2013 workflow. The column is set to allow multiple values in the lookup.  I've seen many sources stating that the syntax for achieving this is either id1;#;#id2;#;#id3 or id1;#value1;#id2;#value2;#id3;#value3, where id and value are the ID of the list item and the value from the lookup field respectively. However, people are usually referring to SPD 2010 workflows, and  suggests that this syntax cannot be used in 2013 workflows.  I want to use a native SPD 2013 workflow but when I tried the methods above they both fail with the following error:  "An unexpected 'PrimitiveValue' node was found when reading from the JSON reader. A 'StartObject' node was expected."  From this I assumed that I should be providing some kind of JSON object of the form {"results":[id1,id2,id3]} or {"results":[{"Id":id1,"Value":value1"},{"Id":id2,"Value":value2},{"Id":id3,"Value":value3}]}, which is what you get if you retrieve an existing field as a string. I attempted to build a dictionary with some test values, but I still got the same error.  Am I heading in the right direction here? Is this even possible with SPD 2013 workflows? I'd appreciate any advice on this subject.  Thanks, Jon


Let c denotes the unit circle centered at the origin in C then $\frac{1}{2i\pi}\int_c|1+z+z^2|^2dz$ where the integral is taken anti clockwise along C equals  0  1  2  3 I tried this by considering the properties of the complex numbers $|z|^2=z\bar{z}$, by considering $z=Re^{i\theta}$ and by substituting $z=x+iy$ but i didn't get how to solve this

On the generalization of a , I have shown, by analytic and numerical means, that  $$\frac{1}{2\pi i}\int_\mathcal{C} |1+z+z^2+\cdots+z^{2n}|^2~dz =2n$$  where $\mathcal{C}$ is the unit circle. Thus, $z=e^{i\theta}$ and $dz=iz~d\theta$. There remains to prove it, however.  What I have done: consider the absolute value part of the integrand,  $$ \begin{align} |1+z+z^2+\cdots+z^{2n}|^2 &=(1+z+z^2+\cdots+z^{2n})(1+z+z^2+\cdots+z^{2n})^*\\ &=(1+z+z^2+\cdots+z^{2n})(1+z^{-1}+z^{-2}+\cdots+z^{-2n})\\ &=(1+z+z^2+\cdots+z^{2n})(1+z^{-1}+z^{-2}+\cdots+z^{-2n})\frac{z^{2n}}{z^{2n}}\\ &=\left(\frac{1+z+z^2+\cdots+z^{2n}}{z^n} \right)^2\\ &=\left(\frac{1}{z^n}\cdots+\frac{1}{z}+1+z+\cdots z^n \right)^2\\ &=(1+2\cos\theta+2\cos 2\theta+\cdots+2\cos n\theta)^2\\ \end{align} $$  We now return to the integral,  $$ \begin{align}\frac{1}{2\pi i}\int_C |1+z+z^2+\cdots z^n|^2dz &=\frac{1}{2\pi}\int_0^{2\pi}(1+2\cos\theta+2\cos 2\theta+\cdots+2\cos n\theta)^2 (\cos\theta+i\sin\theta)~d\theta\\ &=\frac{1}{2\pi}\int_0^{2\pi}(1+2\cos\theta+2\cos 2\theta+\cdots+2\cos n\theta)^2 \cos\theta~d\theta \end{align}$$  where we note that the sine terms integrate to zero by virtue of symmetry. This is where my trouble begins. Clearly, expanding the square becomes horrendous as $n$ increases, and even though most of the terms will integrate to zero, I haven't been able to selectively find the ones that won't.  The other thing I tried was to simplify the integrand by expressing it in terms of $\cos\theta$ only using the identity  $$\cos n\theta=2\cos (n-1)\theta\cos\theta-\cos(n-2)\theta$$  but this too unfolds as an algebraic jungle very quickly. There are various other expressions for $\cos n\theta$, but they seem equally unsuited to the task. I'll present them here insofar as you may find them more helpful than I did.  $$ \cos(nx)=\cos^n(x)\sum_{j=0,2,4}^{n\text{ or }n-1} (-1)^{n/2}\begin{pmatrix}n\\j\end{pmatrix}\cot^j(x)=\text{T}_n\{\cos(x)\}\\ \cos(nx)=2^{n-1}\prod_{j=0}^{n-1}\cos\left(x+\frac{(1-n+2j)\pi}{2n} \right)\quad n=1,2,3,\dots $$  where $\text{T}_n$ are the Chebyshev polynomials. Any suggestions will be appreciated.


$|a_1\cdots a_m - b_1\cdots b_m|\leq \sum\limits_{j=1}^m|a_i-b_i|$  Where $|a_i|\leq 1, |b_i|\leq 1$, and they are any complex number satisfying the condition.

The constraints are   $0 \le a_1,a_2....a_n,b_1,b_2....b_n \le 1$. $|a_i-b_i|< \delta$ for all $1 \le i \le n $   How do I go about proving the following $$|\prod_{i=1}^n a_i-\prod_{i=1}^n b_i| < n\delta$$  I tried reducing it to two terms where one term is like $(a-\delta)^n$ so that I can get the $n\delta$ term from binomial,but I am stuck. I would really appreciate just hints.


Currently I'm reading a book named "Grokking Deep Learning" and I'm confused with the way author takes derivative from function. Let me explain. We have loss function, where pred is prediction and goal_pred is goal prediction (constant value that is equal to 1)  Author of the book writes that the derivative is weight_delta  But! $   \begin{cases}     error(weight) = (pred - goalPred)^2   \\     pred = input \cdot weight  \\   \end{cases}  => error(weight) = (input \cdot weight - goalPred)^2 $ $error(weight)' = 2(input \cdot weight - goalPred) \cdot input$  $error(weight)' = 2(pred - goalPred) \cdot input$  $error(weight)' = 2 \cdot delta \cdot input$ Here is the question: why the derivative in the book is not correct or I'm wrong somewhere?

Per wiki, the mean squared error (MSE)  like:  $$ \operatorname {MSE} ={\frac {1}{m}}\sum _{i=1}^{m}(y_{i}-{\hat y_{i}})^{2} $$  The  added a $1\over2$ in front of the formula and explained it a little bit. I am a little bit confused. How does putting a $1\over2$ in front of the squared error make the math easier?


How would you search a log file for a date range?  Log file looks like this:  01/14 00:00:01  INFO:     received connect request from 10.10.10.10    I need to condense the log to 10 minutes starting at 8:25 and going until 8:35  When I use the following egrep I find too many results, such as00:08:25 01:08:25 ... 08:25:00..  How can I just get 08:25:00 through 08:35:59  What I've tried  cat foo | egrep "08:2[5-9]|08:3[0-5]" cat foo | egrep "08:2[5-9]:??|08:3[0-5]:??" cat foo | egrep "08:2[5-9]:[0-9][0-9]|08:3[0-5]:[0-9][0-9]"

I have to read log file between and my question is how to get only the text in the file wich is between two dates using unix commands? Every line contain date and I want to get the text in the file which dates are equal or bigger that the FROM date and lower or equal than the TO date. The format of the date is 13/05/23 01:58. The second date is for an example 13/05/13 07:50. Example  13:41:55,110  INFO HellowordlsThis text is generated by me


I want to print a sequence of characters one by one in the same place. I print one letter, then wait 1 second with sleep, move cursor one column left using console code, print next letter and so on. The problem is as a result program waits the sum of all sleeps (2s in my example) and then prints only the last character ('y'). Same goes with nanosleep, waiting for a signal instead of sleeping. How to make it work?  #include <stdio.h> #include <stdlib.h> #include <unistd.h>  int main() {     printf( "H" );     sleep( 1 );     printf( "\033[1D" );     printf( "e" );     sleep( 1 );     printf( "\033[1D" );     printf( "y" ); }

I'm just learning C with Kernighan and Ritchie's book; I'm in the basics of the fourth chapter (functions stuff). The other day I became curious about the sleep() function, so tried to use it like this:  #include <stdio.h> #include <unistd.h>  int main(void) {   printf(" I like cows.");   sleep(5);   return 0; }   The problem is the output of the program, it looks like it does the sleep() first and then the printf(), in other words, it waits five seconds and then prints the string. So I thought, maybe the program gets to sleep() so fast that it doesn't let printf() have his work done like I want, that is print the string and then sleep.  How can I show the string and then put the program to sleep? The compiler is GCC 3.3.5 (propolice) in OpenBSD 4.3.  PS I don't know how you put here the preprocessor lines correctly.


I'm trying to create a method that checks if this file ( todayfile.txt)  is created if not I need it to create it. Here is what I thinking of :  private void ReadWater()     {         try         {             StreamReader inputFile;              // I want to check if there is a file named ( Todayfile.txt )              if (// if this file ( Todayfile.txt) is founded)             {                 // Do this             }              else // if there is no file in this nmae ( Todayfile.text )             {                 // create a new file              }          }         catch (Exception ex)         {          }      }

I am working on an application. That application should get the resume from the users, so that I need a code to verify whether a file exists or not.  I'm using ASP.NET / C#.


(First of all, I know that \[ \] should be used instead of $$ $$ and I do it.)  I'd like to know about the vertical spacing around math display blocks.  According to texdef -t latex \[ we have   \[: macro:->\relax \ifmmode \@badmath \else \ifvmode \nointerlineskip \makebox [.6\linewidth ]{}\fi $$\fi    and texdef -t latex \] returns  \]: macro:->\relax \ifmmode \ifinner \@badmath \else $$\fi \else \@badmath \fi \ignorespaces    So I didn't see any command for vertical spacing.   Since the command $$ appears in the code above I tried also texdef -t tex $$ and texdef -t latex $$ with no success.  If I'm not wrong I remember something related with \abovedisplayskip or something similar.   Well, my question is: Are the vertical spaces above and below the command \[ \] the same as the ones inserted by \begin{equation}\end{equation} (and its stared versions)? How to check this reading the macros and codes?

I've heard that you should use \[ ... \] for displayed equations instead of  $$ ... $$, but why is that?  I'd assumed that it's so that you can more easily tell which are starting and which are ending delimiters, but if I always use a syntax-highlighting text editor, I can see that easily based on the color of the symbols.  Is there any reason for this suggestion?


We bought my 87 year old mother a Toshiba laptop. She uses it to check emails and do crossword puzzles.  After about 6 weeks, she turned it on and a weird screen came on and it asked for a PW. I was told by a friend that it wants a BIOS password.   There is no way that she set this up. She can barely put in her regular password. Spent 2 hrs on the phone with a foreign lady at Toshiba who insisted that it's a software problem and not under warranty.   Toshiba said there is a charge to do this. I have to also pay to send it to them and they don't know the cost 'til they actually fix it. All this for a $400 laptop for an old lady. The computer isn't booting at all  I've tried all of her passwords, none work. Is there a way that I can find out this password?

I want to rescue this 7 year old laptop that has been crippled by a glitch in its BIOS:     'A "Password =" prompt may be displayed when the computer is turned on, even though no power-on password has been set. If this happens, there is no password that will satisfy the password request. The computer will be unusable until this problem is resolved. [..] The occurrence of this problem on any particular computer is unpredictable -- it may never happen, but it could happen any time that the computer is turned on. [..] Toshiba will cover the cost of this repair under warranty until Dec 31, 2010.' -   As they stated, this machine is "unusable." The escape key does not bypass the prompt (nor does any other key), thus no operating system can be booted and no firmware updates can be installed. After doing some research, I found solutions that have been suggested for various Toshiba Satellite models afflicted by this glitch:   "Make arrangements with a Toshiba Authorized Service Provider to have this problem resolved." -. Even prior to the expiration of Toshiba's support (see above), there have been reports that this solution is prohibitively expensive, labor charges accruing even when the laptop is still under warranty, and other reports that are generally discouraging:     "They were unable to fix it and the guy who worked on it said he couldn’t find the jumpers on the motherboard to clear the BIOS. I paid $39 for my troubles and still have the password problem." - .   Since the costs of the repairs can now exceed the value of the hardware, it would seem this is a DIY solution, or a non-solution (i.e. the hardware is computer graveyard material). Build a Toshiba parallel loopback by stripping and soldering the wires on a DB25 plug to connect connect these pins: 1-5-10, 2-11, 3-17, 4-12, 6-16, 7-13, 8-14, 9-15, 18-25. -. According to a list of supported models on pwcrack, this will likely not work for my Satellite A55-1065, as well as many other models of similar age. - Disconnect the laptop battery for an extended period of time. This laptop already sat in a closet for several months without the battery connected. The poor thing! Clear the CMOS by short circuiting a specific pair of solder pads. Examples given for other Satellite models:   Toshiba Satellite 1800:     "Underneath the RAM there is black sticker, peel off the black sticker and you will reveal two little solder marks which are actually 'jumpers'. Very carefully hold a flat-head screwdriver touching both points and power on the unit briefly, effectively 'shorting' this circuit." -  Toshiba Satellite A105:     "You will have to jump the two solder squares at label C88." -  Toshiba Satellite L300:     "Short the B500 solder pads on the system board." -     Wiping the CMOS might clear the password prompt issue, but I cannot locate a jumper or a battery on this board. Nothing that looks remotely like a battery can be removed (everything is soldered). See for yourself:      Update: Matt located a pair of solder pads marked "reset." I shorted the circuit several times, but the password prompt still remains.   Possibly related questions:


I've been thinking about his Mangekyo and how it seems to have had no impact on his eye sight and how he could have escaped the effects. After much thought on the topic I think I might have the solution and am wondering if this is a valid theory or not. My theory is you need both Mangekyo to hurt your vision. Since he had only 1 eye this effectively allows him to use part of its power for no effect compared to people like Itachi and Sasuke who do have both and had issues with this. Basically if I didn't make it clear enough with only 1 eye he couldn't get Susanoo or the other great abilities but also didn't have the downside of losing his sight. So do you think this is a valid theory? I know its unprovable either way just trying to see if I'm the only one who thinks this is a possible solution.

It's been said that excessive use of the Mangekyo Sharingan causes blindness and eye-bleeding, as demonstrated by Itachi. However, Obito used his Mangekyo almost constantly nearly every time he's made an appearance. How come he has shown no signs of pain, blindness or eye-bleeding?   My own theory on this is that the Senju DNA Madara used to rebuild his body has something to do with it, but I have never seen this explicitly stated. If it has, can you tell me where or explain how this works in more detail.


For example if I do  if ("11" == 11) this will give true because the string will be converted to number so it will be like testing if (11 == 11) and that is true  It I instead use if ("11" === 11) this will give false because no conversion is made.  I can understand this but now to my question.  So because of my test previously it seems like we should always use === to prevent any automatic conversion when testing for equality.  So what guideline exist when to use == for equality and when to use === for equality.

I'm using  to go through JavaScript, and it's returning many suggestions to replace == (two equals signs) with === (three equals signs) when doing things like comparing idSele_UNVEHtype.value.length == 0 inside of an if statement.  Is there a performance benefit to replacing == with ===?   Any performance improvement would be welcomed as many comparison operators exist.  If no type conversion takes place, would there be a performance gain over ==?


Do we know from the books if there is a limit to the number of victims one can control through the Imperius curse?  In Deathly Hallows, after the defeat of Voldemort, it's implied that all the Imperius victims were under his influence:     The Imperiused up and down the country had come back to themselves   If so is it because Voldemort is an exceptionally powerful wizard or is there no limit? I was thinking maybe the magical numbers (3, 7, 12…) could be the limits.  I'm digressing a bit, but can the Imperius victims be ordered to cast the Imperius curse without losing effectiveness, thus creating a chain reaction? (A sort of “Russian doll” effect)


I've spent a couple of hours looking through several the similar answers before posting my problem.  I'm retrieving data from a table in my database, and I want to encode it into a JSON. However, the output of json_encode() is only valid when the table has one single row. If there is more than one row, the test at  returns an error.  This is my query:  $result = mysql_query($query);      $rows = array();      //retrieve and print every record     while($r = mysql_fetch_assoc($result)){         $rows['data'] = $r;          //echo result as json         echo json_encode($rows);     }   That gets me the following JSON:  { "data":      {         "entry_id":"2",         "entry_type":"Information Relevant to the Subject",         "entry":"This is my second entry."     } }   { "data":{         "entry_id":"1",         "entry_type":"My Opinion About What Happened",         "entry":"This is my first entry."     }  }   When I run the test at , it returns this error:      Parse error on line 29:     ..."No comment"    }}{    "data": {         ---------------------^     Expecting 'EOF', '}', ',', ']'   However, if I only use this first half of the JSON...  { "data":      {         "entry_id":"2",         "entry_type":"Information Relevant to the Subject",         "entry":"This is my second entry."     } }   ... or if I only test the second half...  {     "data":{         "entry_id":"1",         "entry_type":"My Opinion About What Happened",         "entry":"This is my first entry."     }  }   ... the same test will return "Valid JSON".  What I want is to be able to output in one single [valid] JSON every row in the table.  Any suggestion will be very much appreciated.

How do I use the json_encode() function with MySQL query results? Do I need to iterate through the rows or can I just apply it to the entire results object?


I asked one person 'Why you did that' referring to something he did in the past, and he responded something like 'Why are you saying that, are you a little kid?'. I was confused and asked him why would he say that, he responded that I need to use 'Why did you do that' instead.   Why 'Why you did that' was incorrect and why he was referring to a little kid thing?

very often we see the description like this:  Many people realize that they didn't do any wrongdoings, so they cannot understand why they have to be punished. or ...., so they cannot understand why do they have to be punished.   or we ask "why do you fight?" can we omit the "do",  say "why you fight?"  Thanks!!


I have studied calculus, linear algebra, some naive set theory, some analysis. These were not satisfactory at all. I want to find a way to understand the mathematical system in an axiomatic way.  The most difficult thing I have is "$p\to q$". There was no book that gave satisfactory explanation about this.  For example     $1+1 = 2 \to \sqrt 7$is irrational.    This is a true statement, but does not make sense to me. How does $1+1 = 2$ imply that $\sqrt7$ is irrational?!   I can't accept the definition of $p \to q$'s truth table, especially "vacuous truth".   Would you recommend me books regarding foundations of mathematics?  Would you recommend me a book that explains $p \to q$ well?

I am trying to get an intuition (ohh, the irony) about the logical truth tables. In particular, I am looking at the basic conditional P->Q with the following truth table:  P  Q  | P -> Q  T  T      T  F  T      T  T  F      F  F  F      T  How does one obtain this truth table? If it is an axiom, what is the motivation behind this particular form?


Is anyone perhaps aware of an application, or ideally a website (always accessible) to keep track of personal notes on ones research?  This would be similar to a physical personal research journal (e.g. a simple hardcover book with ones notes), but in electronic format. I'm looking for something a bit more structured and standardised than an MS Word or Excel document, although if there's no alternative, that will have to do.

I want to keep a research notebook for my computational "experiments". Basically, I should at least be able to write text and attach images like plots. Other nice features to have would be   linking to past experiments/pages latex equations uploading papers, or other urls being able to transfer data dating and version control open-source tool   I am already familiar with trello and tiddlywiki. Trello is good for attaching stuff and organising tasks, but I need a notebook where I attach a plot, write stuff around it, attach another below it. It doesn't have a paper or canvas. Tiddlywiki is a little painful for attaching pics and equations, the file bloats, it seems I am keeping a blog.  What is a good, free electronic notebook tool for research/lab work?


I am flying Delhi-Lisbon and have a transit in Heathrow. My jet flight from Delhi arrives at terminal 4 at 5:40 PM and I have a TAP Portugal flight from Terminal 2 at 7:55 PM. This is single e ticket with both flight segments listed on the same ticket, so I am assuming my baggage will be checked through to Lisbon.  Do I need a Visa transiting at Heathrow and also is this enough time to make the connection? I am an Indian citizen with a valid US visa, so technically I am expecting as per UK website. But I am not sure given the fact that I need to take a train/bus to change terminals.

Is there a website or some other way to find out if I need a transit visa for a short stop in the UK on my way somewhere else? Ideally this should give me the answer for all nationalities, and take into account any other visas I may have.


if force acts on a wheel away from the centre does it have both translatory and rotatory motion?( the wheel is not fixed.)  And  as per my knowledge,if force acts away from the line of axis it produces same acceleration as it produces when it is acting through the centre,so if in the 1st case if it produces rotation (due to torque) from where does the extra energy is getting to it??

Assume there is a rigid body in deep space with mass $m$ and moment of inertia $I$. A force that varies with time, $F(t)$, is applied to the body off-center at a distance $r$ from its center of mass. How do I calculate the instantaneous acceleration, rotational acceleration, and trajectory of this object, assuming it starts from rest?


Update : I was able to install it with aptitude, which automatically fixed the version of a bunch of packages. However, some ricotz packages are still making problems in other areas.  I tried to install vlc on a rather fresh installation of ubuntu 16.10 but I'm getting this error :   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:  vlc : Depends: libgles1-mesa (>= 7.8.1) but it is not going to be installed or                 libgles1 E: Unable to correct problems, you have held broken packages.   So I tried   sudo apt-get install libgles1-mesa   Which in turn gives me   The following packages have unmet dependencies:  libgles1-mesa : Depends: libglapi-mesa (= 12.0.3-1ubuntu2) but 12.1~git20161011.fc8b358b-0ubuntu0ricotz is to be installed E: Unable to correct problems, you have held broken packages.   I've tried  sudo apt-get install libglapi-mesa=12.0.3-1ubuntu2   as well, but that basically just tells me that no component is going to be installed.

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.


Consider an array of values {3,2,8,4,7,6,1}. I need an algorithm to find the L-th max/min in each length K subarray.  For example, for the above array, let K = 5, L = 3. I need to find the 3rd minimum of each length K subarray.  Expected output:  Subarray: [3,2,8,4,7] = Third minimun is 4. [2,8,4,7,6] = Third minimum is 6. [8,4,7,6,1] = Third mininum is 6.   Kindly help me find the algorithm.

I believe there's a way to find the kth largest element in an unsorted array of length n in O(n).  Or perhaps it's "expected" O(n) or something.  How can we do this?


I have a fixed position ascii file that I need to parse.  The file gets passed in as a text document with hundreds or thousands of rows.  Each row is about 100 characters wide.  Each data element is varying length.  I really do not want to manually parse each data element.  I remember way, way back in the day when I coded in "C", that we could take some data, and overlay a struct, and then reference the data elements in the struct.  I have done some research, and I don't see any solid examples on how to do this in C#.  Any suggestions on how to parse this data?  This is an example of what the data could look like:  Mr John      Doe       123 Main St.        New York       NY11111 MrsMelissa   Schwartzen4444 Mississippi St.Philadelphia   PA11111   Title - Starts at column 0, has a lenth of 3. FirstName - Starts at column 3, has a length of 10. LastName - Starts at column 13, has a length of 10. Address - Starts at column 23, has a length of 20. City - Starts at column 43, has a length of 15. State - Starts at column 58, has a length of 2. Zip - Starts at column 60, has a length of 5.  The first thought to parse this data might be to iterate through each line in the file and get substrings for the Title, FirstName, LastName, Address, etc.   But there has to be a more elegant way to parse this data.  That is why I am asking if there is a way to use a pointer and overlay the data with a struct.  This is an unmanaged solution, but I can't think of any better ways to approach this.  Unless one of you smart and clever people can suggest something.

I've got a text file full of records where each field in each record is a fixed width.  My first approach would be to parse each record simply using string.Substring().  Is there a better way?   For example, the format could be described as:  <Field1(8)><Field2(16)><Field3(12)>   And an example file with two records could look like:  SomeData0000000000123456SomeMoreData Data2   0000000000555555MoreData       I just want to make sure I'm not overlooking a more elegant way than Substring().    Update:  I ultimately went with a regex like Killersponge suggested:  private readonly Regex reLot = new Regex(REGEX_LOT, RegexOptions.Compiled); const string REGEX_LOT = "^(?<Field1>.{6})" +                         "(?<Field2>.{16})" +                         "(?<Field3>.{12})";   I then use the following to access the fields:  Match match = reLot.Match(record); string field1 = match.Groups["Field1"].Value;


I want to print each number from 1 to 10 on the cleared screen with some time between them. I tried this code: #include <iostream> using namespace std;  int main() {   for(int i = 1; i <= 10; i++)   {     cout << i;     system("cls");     for(int j = 1; j <= 10000000; j++)         continue;   }   return 0; }  But it doesn't work as intended, instead:  How to get what I actually wish? Any help is appreciated.

I am trying to add a timed delay in a C++ program, and was wondering if anyone has any suggestions on what I can try or information I can look at?  I wish I had more details on how I am implementing this timed delay, but until I have more information on how to add a timed delay I am not sure on how I should even attempt to implement this.


I’ve done a my research, though I have not been able to find an adequate explanation as to whether or not $$0^0$$ exists as a real number, and why or why not? I must credit this question to “.”  This  entry lists a (seemingly?) exhaustive list of indeterminate forms of limits, with which I take no issue. All of which involve $\infty$ or a ‘multiple’ of $1/0$ and are therefore undefined as real numbers—that is, all except $0^0$.   clearly claims that $0^0=1$; however, my TI-84 returns ERROR: DOMAIN in both real and complex mode. So, which is it? Is $0^0$ defined or not?   I wasn’t quite sure what other tags apply, so feel free to edit.

Could someone provide me with a good explanation of why $0^0=1$?  My train of thought:  $x>0$  $0^x=0^{x-0}=0^x/0^0$, so  $0^0=0^x/0^x=\,?$  Possible answers:   $0^0\cdot0^x=1\cdot0^0$, so $0^0=1$ $0^0=0^x/0^x=0/0$, which is undefined   PS. I've read the  on mathforum.org, but it isn't clear to me.


What are the differences between "sudo -s" and "su root"? As they both can provide root permission.

What is the difference between the following commands:  su sudo -s sudo -i sudo bash   I know for su I need to know the root password, and for sudo I have to be in the sudoers file, but once executed what is difference?  I know there is a difference between su and sudo -s because my home directory is /root after I execute su, but my home directory is still /home/myname after sudo -s. But I suspect this is just a symptom of an underlying difference that I'm missing.


I have just installed TexStudio and when I start typing "(" the ")" appears but it's also squared. If I delete it and type it manually everything's fine. TexStudio's version is 2.12.6 so I don't have any advanced editor here.

I cannot stand the auto-completion of TeXStudio (formerly TexMakerX) regarding parentheses, braces, etc. I agree auto-completion is useful sometimes, but here it does just not work as I would like. How can I remove it completely?  Under configuration -> completion nothing is checked. From where do I remove the auto-completion of these?


It's easy to find where you rank for keywords that you want to measure.  But how do you find out what other keywords you rank for that you don't know about?

I'd just like to know, if for a keyword, or a sentence, my website is in the search pages, and if so, where? Is there a way to do this?


Okay so listen to this example.  In Attack of the Clones, when Yoda was battling Dooku, Dooku crushed the bottom of that large pipe structure to make it fall on Obi-Wan and Anakin.  Yoda then used the force to stop it.  In this scene it looked like Yoda struggled to lift it with two hands.    Now fast forward (or rewind if your going by when they were released) to The Empire Strikes Back where Yoda uses the force to get Luke's X-wing out of the swamp.  Now, ignoring how this was a puppet and episode II was CGI, Yoda in episode V seemed to somewhat "effortlessly" pull his fighter out with one hand.  Based on these observations I assume that a jedi becomes stronger with the force over time.  But then look at skills with the lightsaber.  Same example, Yoda fighting Dooku, and Yoda on Dagobah. Episode II/III Yoda had some serious skills, but Yoda on Dagobah could hardly move (again, ignoring the fact that he was a puppet so his movement looked a little stiff).  On the same subject of lightsaber skill, do you think young Yoda was even better with a lightsaber than what he showed in II and III?  Also, does this mean young Yoda was more powerful than old Yoda?  Like if young Yoda was to battle Darth Sidious in III, would he have won?

@Valorum said     ...not to mention the sheer strain that comes from continually using the Force at an advanced age.   To my feeble mind, this doesn't make sense. Approaching 900 years old, Yoda is still as strong as any whippersnapper in terms of Force power and usage. Despite his old age, Obi Wan shouldn't have any problems with using his Force powers.  This got me to thinking, does the Force begin to leave you as you age? Is it a flow of Force power that goes down based on (I hate to say this) a decrease in midichlorian count as you approach your expiration date?


Today I tried to import an mp3 file to Logic, but it was weirdly speed up. I've tried both drag and drop AND Command+I, but it didn't help. Later I tried to import the file to the Logic through Garage Band, but the same problem occurred - in Garage Band, the file was in higher speed. Then, I tried to import in through Adobe Audition, but Logic doesn't want to read files imported through Audition at all. No idea what to do.

I have Logic Pro X 10.2.4.  I never noticed this problem before today:  I started having the same problem as shown in :     everytime I try to upload an mp3 file into logic, it speeds up the audio by a whole lot. I've made sure that the sample rate of the audio file and the project is the same but it still doesn't make a difference. All the previously saved projects that had audio imported into them don't have a problem but if I try to upload a new audio file into those projects, I am encountering the same problem   I have noticed that this doesn't affect only mp3 files (downloaded from the internet), but also m4a files recorded in my iPhone (with the factory voice recorder app) and sent to my MacBook.  The sample rate of Logic (in Project Settings > Audio) is 44.1kHz, as is the sample rate of all the files I try to import (except potentially the m4a files, soxi doesn't work on m4a though so I don't know their sample rates).  Here is an example of an audio file which I may attempt to import:    here it is after dragging and dropping from Finder into Logic:     It sounds like some parts are just ... skipped. It sounds the same in Logic playback and after exporting (bouncing).    I'm temporarily using the 'fix' that the reddit OP noted:     I managed to bypass the issue by just converting all of my mp3 files to wav files.   I just ran a few quick  ffmpeg -i originalrecording.m4a originalrecording.wav ffmpeg -i originalrecording2.mp3 originalrecording2.wav   etc.  Drag and drop the WAV files instead of the original files, and logic no longer chops them up weirdly.    How come this happens though?  What's the root of this problem, and how can it be resolved?


I'm trying to install the gnome desktop environment on my Ubuntu 14.04LTS using the command line:  $sudo apt-get install gnome-shell       but the terminal keeps saying:      "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:  gnome-shell : Depends: gnome-settings-daemon (>= 3.4.0) but it is not going to be installed                Recommends: gnome-control-center but it is not going to be installed E: Unable to correct problems, you have held broken packages."     how do i fix this?

Occasionally, when I'm installing stuff, I get an error like the following:  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:  package1 : Depends: package2 (>= 1.8) but 1.7.5-1ubuntu1 is to be installed E: Unable to correct problems, you have held broken packages.   How can I resolve this?


Is there any way to view all tag synonyms that I can vote on, with my tag scores?  I can't find anything in the main interface, but perhaps there's a data query I can't find?

Inspired by the brave efforts in  I went to check out the voting on synonyms.  I'm eligible with respect to reputation, and I'm certain I'm eligible to vote on some synonyms, but there seems to be no way to tell which ones without going back and forth between my profile and the synonyms screen (or attempting to vote on each of them and getting the rejection notice).  Is there a quicker way to tell at a glance on which synonyms I can vote?


So, i'm kinda new into JavaScript and i was creating a test script just to see how it works to apply style through JS, in case applying display none to the divs in the document, this is the test code: <!DOCTYPE html>   <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>Document</title>
Test DIV 1

Test DIV 2

Test DIV 3

<input type="button" value="hide DIV" onclick="hideDiv()">
     But the onclick returns this: Uncaught TypeError: Cannot set property 'display' of undefined at hideDiv (test.html:18) at HTMLInputElement.onclick (test.html:13)  And this one works well: <!DOCTYPE html>   <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>Document</title>
Test DIV 1

Test DIV 2

Test DIV 3

<input type="button" value="hide DIV" onclick="hideDiv()">
     So what is the difference beetween: for(let i in test){     test[i].style.display = 'none' }  And for(let i=0;i<test.length;i++){     test[i].style.display = 'none' }

I've been told not to use for...in with arrays in JavaScript. Why not?


I am working on a logistic regression model. The ratio of 1s to 0s in the train dataset is 7:2 (14,000 1s and 4,000 0s)  The model performance is:  Accuracy - 83%  True Positive rate - 84%  True Negative rate - 74%  Area under the curve (ROC plot) is 0.78  Couple of questions:   Do I have to treat the class imbalance in this case? I have read somewhere that the proportion of 0s to 1s does not matter, the number does. Is the number of rare events in this case (4,000) good enough? Is AUC of 0.78 acceptable? I have added all possible variables and adding more variables to the model is not an option.

Okay, so I think I have a decent enough sample, taking into account the 20:1 rule of thumb: a fairly large sample (N=374) for a total of 7 candidate predictor variables.   My problem is the following: whatever set of predictor variables I use, the classifications never get better than a specificity of 100% and a sensitivity of 0%. However unsatisfactory, this could actually be the best possible result, given the set of candidate predictor variables (from which I can't deviate).   But, I couldn't help but think I could do better, so I noticed that the categories of the dependent variable were quite unevenly balanced, almost 4:1. Could a more balanced subsample improve classifications?


Does anyone know if there's a general expression for the jth slope coefficient from a multiple regression with K independent variables, in terms of variances and covariances? Obviously, the expressions in the case where K=1 and K=2 are straightforward, but is there a more general expression?  And yes, I know how to find the betas using matrix algebra ... but that's not appropriate in the context I'm looking at.

For simple linear regression, the regression coefficient is calculable directly from the variance-covariance matrix $C$, by  $$ C_{d, e}\over C_{e,e} $$ where $d$ is the dependent variable's index, and $e$ is the explanatory variable's index.  If one only has the covariance matrix, is it possible to calculate the coefficients for a model with multiple explanatory variables?   ETA: For two explanatory variables, it appears that $$\beta_1 = \frac{Cov(y,x_1)var(x_2) - Cov(y,x_2)Cov(x_1,x_2)}{var(x_1)var(x_2) - Cov(x_1,x_2)^2} $$ and analogously for $\beta_2$. I'm not immediately seeing how to extend this to three or more variables.


I am referencing the action you can make by dragging a tab out of the top bar, which creates a new window wherein to put the dragged tab.

In FF, I can move a tab to a new window by either dragging the tab out of the browser, or right clicking the "move to New window" option from the context menu. is there a shortcut key to move the current tab to a new window without dragging or using the context menu, or a way to set one up?  Often, I like to look at 2 tabs side by side, so I drag one out, then hit WINDOWS KEY+→ to put the detached tab on the right, then ALT+TAB to tab back to the main window, then WINDOWS KEY+← to put the main window on the left. It would be great if I could do the whole process on the keyboard.  I checked  documentation and did not find any shortcut key for detaching a tab:


In Grease Pencil this is how the image looks with a nice white background.  When the same is imported to video sequencer I get a solid grey background. I tried putting a white solid behind to see if there was any transparency issue but the grey remains. I need a proper white background, how to achieve the same.

I already searched the internet but could not find a solution to this. Maybe it is the same question as  but there was no answer.  I want to render a video with tracking, but the output "loses" color information and gets kind of greyish. I first thought that it is related to the renderer, but it happens in Cycles and Eevee. Therefore i made a sample image, added it to the image sequence editor and rendered it as 1 frame. Resulting in the same problem.  I placed the original image beside blenders output so that you can see the difference. The only idea I came up with is that something with the lighting is not correct but I can't find a setting for that.  I am using Blender 2.80 with the default settings. Only set the output resolution to match the input resolution.


I have Linux PC, for which monitor is not working. But I am able to log in through SSH. I want to take a backup of all the directories from this PC. Instead of changing directories one by one and getting the files using FTP, is there any direct method to get all the files in the system at one time?

I need to backup all my data from a server (in 10 minutes), preferably keeping the symlinks.


I need to prove the theorem     If $\lim_{x \to c} f(x)$ does not exist and $\lim_{x \to c} g(x)$   does not exist, then $\lim_{x \to c} (f(x).g(x))$ does not exist.   but I stuck.  First, I said that this statement is equivalent to the statement      If $\lim_{x \to c} (f(x)g(x))$ exists, then $\lim_{x \to c} f(x)$   exits or $\lim_{x \to c} g(x)$ exists.   but after assuming $\lim_{x \to c} (f(x)g(x))$ exists, I could not reach anywhere.  Any help would be appreciated.  Edit: From the answer, I saw that it is a wrong statement, but still without giving a counterexample, how can we prove it that it is wrong ?

Show an example where neither $\lim\limits_{x\to c} f(x)$ or $\lim\limits_{x\to c} g(x)$ exists but $\lim\limits_{x\to c} f(x)g(x)$ exists.  Sorry if this seems elementary, I have just started my degree...  Thanks in advance.


Assuing that our current understanding that the speed of light can't be matched or breached is correct, if you were travelling at the fastest possible speed in a space ship, say 99.99% of light speed, what would then happen if you were to fire a rocket out from the front of the ship?  Would it fire out normally from the ships prospective, in that case is it going faster than the speed of light for someone looking in from another angle? Or would the energy propelling the rocket forward be converted into mass, in which case the rocket would remain where it is and get heiver?

Let's say I fire a bus through space at (almost) the speed of light in vacuum. If I'm inside the bus (sitting on the back seat) and I run up the aisle of the bus toward the front, does that mean I'm traveling faster than the speed of light? (Relative to Earth that I just took off from.)


So I have a problem with my asus computer: everything went just fine until today,  my computer shows me the grub menu when I start up like it usually does. But when I choose a version of linux the only thing I get is a  purple screen or a black one if I use the recovery mode.  I have been using ubuntu 12.04 for about a month and I did not download a single update the day before it started to act like this. It was also running perfectly fine on start up until today.  I tried to replace quiet splash with nomodeset but that didn't help, running an older version of linux didn't help either, as I have the same problem on every version.  I have an Asus motherboard 8 Gb DDR3 Ram  Nvidia GTX 560 graphics card Intel i7 quad core processor  (Someone posted a similar question here:  but nobody answered :/)  Edit Boot repair didn't solve the problem, here is the link it gave me:   Second Edit:  ctrl alt delete who worked before the boot repair doesn't work anymore... :/ (I could use it when I had the purple/black screen)  3th edit: The Grub commandline works, so maybe it's a problem with graphics?  (Even though I didn't change anything when I last used my laptop on Ubuntu..)  Last edit: Seems like this was marked as a duplicate, the answers provided didn't solve the problem at all.. As I couldn't find the source of the problem I reinstalled ubuntu...  (Wich completely crashed my computer, due to a fatal error while trying to install the grub, it couldn't find the device.. But that's not part of the question anymore :).)  But thanks for your fast answers! :)

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


I am new to ubuntu and linux, not a programmer, and I would like to fix background noise that I am getting from mic. I found other people had the same issue with the same soundcard (ALC892) and tried applying the following fix:    Unfortunately, probably due to my computing limitations, I was unable to do it. My issues so far were: 1) I don't know if I have "libjack-jackd2-0" or "libjack0". I assumed I had "libjack-jackd2-0" and ran the commands suggested and things seemed to work, but not sure if this was correct. 2) When I get to "building the package" and run "dpkg-buildpackage -d -us -uc -nc" I get the following error:  debian/rules:60: *** comandos começam antes do primeiro alvo.  Pare. dpkg-buildpackage: erro: debian/rules build deu erro de saída estado 2  I am running Ubuntu in portuguese but the translation of the error would be: debian/rules:60 *** commands begin before first target. Stop. dpkg-buildpackage: error: debian/rules build got an exit state 2 error  Any help would be apreciated. Thank you.

Is it possible to do realtime noise-removal with PulseAudio, so the sound output that's coming out is smoother?


How can I access the Skyrim save data on Windows 8? I need to delete some saves.  I've read this question: "" - but there are no specified directories for Windows 8. (I couldn't find the save files at the mentioned directories in the current answer.)

I can't find those that I need to delete. What's the location of those files?  How can we manage them?


I'm basically asking if it's "turn on the lights" vs "turn the lights on."

I have often heard the following statements when someone talks about shoes, cloths, etc. I don't know which one is more appropriate or grammatically correct.   Hey, put your shoes on.  Hey, put on your shoes.  Take off your coat, please.  Take your coat off, please.    Any thoughts? Can we also say "take out your coat"?