I found the term "fellow citizens", but the term I'm looking for should also refer to people who are not be a citizen of the city but are located there.

What are the people who live in the same city are called? Any words for that? I want to use it in the following context:      I and my ____ are happy.


Prove that      $$\left\lfloor{\frac{x}{n}}\right\rfloor=\left\lfloor{\frac{\lfloor{x}\rfloor}{n}}\right\rfloor,$$ where $n \in{\mathbb{N}}.$   My Attempt:  Let $x=nt$.  Then, I need to prove,  $$\lfloor{t}\rfloor=\left\lfloor{\frac{\lfloor{nt}\rfloor} {n}}\right\rfloor.$$  Let $t=n\lambda+r+f$,  where $0\leq{r}\leq{n-1}$ and $0\leq{f}\lt{1}.$  This gives R.H.S as,  $$\left\lfloor{\frac{\lfloor{n^2\lambda+nr+nf}\rfloor} {n}}\right\rfloor.$$  How do I continue?  I also know the property,  $$\lfloor{x}\rfloor=\left\lfloor{\frac{x}{n}}\bigg\rfloor+\bigg\lfloor{\frac{x+1}{n}}\right\rfloor+\left\lfloor{\frac{x+2}{n}}\right\rfloor \cdots \left\lfloor{\frac{x+(n-1)}{n}}\right\rfloor.$$  Can I use that here?

How to prove or disprove $\forall x\in\Bbb{R}, \forall n\in\Bbb{N},n\gt 0\implies \left\lfloor\frac{\lfloor x\rfloor}{n}\right\rfloor=\left\lfloor\frac{x}{n}\right\rfloor$.  So we want to prove $\left\lfloor\frac{\lfloor x\rfloor}{n}\right\rfloor\ge\left\lfloor\frac{x}{n}\right\rfloor$ and $\left\lfloor\frac{\lfloor x\rfloor}{n}\right\rfloor\le\left\lfloor\frac{x}{n}\right\rfloor$  Since $\lfloor x\rfloor\le x$, we can just start from here and prove  $\left\lfloor\frac{\lfloor x\rfloor}{n}\right\rfloor\le\left\lfloor\frac{x}{n}\right\rfloor$  But for $\left\lfloor\frac{\lfloor x\rfloor}{n}\right\rfloor\ge\left\lfloor\frac{x}{n}\right\rfloor$, I have no idea how to start.


Let $n \geq 1$ be an integer and $M \subset \mathbb { R } ^ { n + 2 }$ a smooth $n -$ dimensional submanifold   which is a closed subset of $\mathbb { R } ^ { n + 2 } .$ Prove that for any $x _ { 0 } \in M ,$ there exists a   line $L$ in $\mathbb { R } ^ { n + 2 }$ satisfying the condition:   $$\quad L \cap M = \left\{ x _ { 0 } \right\}$$   How can I use the property of smooth submanifold and closed subset to reveal that each point correspond to a line which have one intersection and the intersection is itself?

Let $n \geq 1$, and $M \subset \mathbb{R}^{n+2}$ be a smooth $n$-dimensional manifold which is closed in $\mathbb{R}^{n+2}$.  Show that for each $m \in M$, there exists a line $L \subset \mathbb{R}^{n+2}$ such that $L\cap M = \{m\}$.   I tried to consider $m$ as the origin of $RP^{n+1}$ space and use Sard's Theorem, but it seems not to work.


I have seen tutorials showing the bevel shader in Blender 2.79b. I cannot get it to show up in the shader menu even after doing a fresh install of Blender. I wonder if it is a Mac issue. I am running Mac OS high sierra 10.13.6, AmD FirePro D700 graphics cards. In the shader node editor I am going Add:Input... bevel shader should appear between Attribute and CameraData but it doesn't.

I'd like to know how exactly to use the new bevel node in Blender 2.79b. It's in the manual now, but I've not yet been able to even locate it. How exactly do you use it?


Default creation of HotSpot in network manager is not able to detected on andriod phones of any version. There is a answer for this question in given link below but its need to install third party repository    How can one make the ubuntu default setting of a hotspot creation to be detected on smartphones ?

How to setup an Access Point (AP) mode Wi-Fi Hotspot?  Point to be noted: Wireless access points aren't the same as ad hoc networks. They differ significantly. In short, ad hoc networks aren't supported on newer devices and most Android, Windows Phone and Blackberry devices (and maybe iOS devices too), whereas AP mode Wi-Fi hotspots are. To get an idea about AP mode hotspots, ad hoc networks and their difference, refer to .


I'm having issues with my 2 child elements both being affected from styles applied to each other. I'm just trying to line up the one with the other better vertically. I pretty much just went to move the img down a few pixels to line up with the  content. Any css thing I'm missing here?

TestingFileName.pdf

        .fileIcon {     text-align: center;     overflow: auto;   }    .iconImg {     display: inline-block;     z-index: 1;     width: 22px;     height: 22px;     padding: 0px 5px;   }      #fileName {     display: inline-block;     z-index: 1;     color: #999;     font-size: 1.1em;     margin: 0;   }

Why won't vertical-align: middle work?  And yet, vertical-align: top does work.   span{   vertical-align: middle; }
      Doesn't work.


I have a Nikon D5300.   Mode: Manual  ISO: 100 (Bright Daylight)  Aperture: f/5.3  Shutter:1/80 Lens: 70-300mm   I am trying to find a way to focus on multiple objects, in my case, a bouquet of flowers. I just want the focus on, lets say 3 roses, and rest is out of focus. I am in manual mode. I tried setting the focus point to 9, 21 and even 39 points. Focus mode is set to AF-A or AF-C. Still I could get only that one rose in focus with rest blurred out.   Is it even possible? Thanks for any advice!

I have a Canon 550D with 70-200 f4 and 50mm prime lenses. Although the camera has built-in 9 focal points, I sometimes face a strange problem. Here's a sample photo:    In reference to the above pic, you can see that both of the faces are NOT in focus. I used 70-200 f4 for this shot at max aperture. Still, I couldn't get both of them in focus. Why? I also try decreasing the aperture to attain a greater DoF but still, I couldn't get both of them into focus.  Another thing: Although the cam has 9 focal points, why can't I use all of them to focus, say, 9 points in a portrait shot? In manual mode, it has the option to select one of the 9 focal points. And in auto mode, it sometimes select more than one focal points.  This is just an example image. I've faced this problem zillions of times.


I tried to use the tipps in this post . But it does not lead to the correct referencing, what is done wrong here and how to i get cref running with algorithm?  \documentclass[]{article} \usepackage{subcaption}  \usepackage{algorithm} \usepackage{algpseudocode}   %\input{Packages} \usepackage{cleveref}   \crefname{algocf}{alg.}{algs.} \Crefname{algocf}{Algorithm}{Algorithms}  \begin{document}     \section{asdja} \cref{alg:a} is a algorithm. \ref{alg:a} is a glrotihm \begin{algorithm}     \label{alg:a}     \begin{algorithmic}[1]         \State x     \end{algorithmic}     \caption{This is an algorithm} \end{algorithm} \end{document}

\documentclass{article} \usepackage{algorithm}  \begin{document} \setcounter{section}{54} \section{A section with no label} \begin{algorithm} \label{myalg} \caption{An algorithm with the label `myalg'.} \end{algorithm} Reference to myalg: \ref{myalg}. \end{document}   With this code, the reference givens 55 (the section number); if I move the label after the caption command, I get the correct reference (1).  Why should this be the case? I find it confusing: when thinking about an algorithm as an environment, you expect to be able to label it right after you began it. At the very least I would expect some kind of error or "??" to appear, rather than the previous environment or reference-able entity being used.


Let $p$ be a prime number with $p > 5$. Prove that the sum of the squares of the quadratic nonresidues modulo $p$ is divisible by $p$.  My idea is to use the fact that any quadratic residue is congruent modulo $p$ to one integer in the set $\{1^2,2^2,\ldots,\left( \frac{p-1}{2} \right)^2 \}$. And none of the quadratic residues are congruent to each other. So the quadratic nonresidues must all be in the set $\{ \left( \frac{p+1}{2} \right)^2 , \left( \frac{p+3}{2}\right)^2 \ldots, (p-1)^2\}$. So the sum of the quadratic nonresidues must be given by $$\sum_{k=1}^{p-1} k^2 - \sum_{k=1}^{\frac{p-1}{2}}k^2 = \frac{(p-1)p(2p-1)}{6} - \frac{\left( \frac{p-1}{2} \right) \left( \frac{p+1}{2} \right) p}{6} = \frac{p}{6} \left( (p-1)(2p-1) - \frac{1}{4}(p-1)(p+1) \right).$$ Is this the correct approach? Prove that the term in parenthesis is an integer divisible by $6$?

Can you prove that if $p$ is a prime greater than $5$, then the sum of the squares of the quadratic nonresidues modulo $p$ is divisible by $p$?  Note that I have just proved that the sum of the quadratic residues modulo $p$ is divisible by $p$ for $p$ greater than $3$.


I must have done something to my environment in Ubuntu 17.10 as alias in the  terminal no longer works. Probably/Maybe after a apt-get autoremove (I guess).  Open a terminal and running echo $shell shows nothing but an empty row. I run ps -p $$ and it shows that I'm in bash.  .bash_profile and alias are being recognized if I run source .bash_profile.  What could have happened and what can I do to get alias working again without needing to run source?

Just installed Ubuntu 14.04.1 LTS.  According to .profile,  # ~/.profile: executed by the command interpreter for login shells.  # This file is not read by bash, if ~/.bash_profile or ~/.bash_login exists.   There is no ~/.bash_profile or ~/.bash_login.  It does not seem to source .profile when opening a terminal.   Why doesn't it source .profile when opening a terminal? Why is .profile there if it is not sourced? How do I know/control what is sourced when a new terminal is opened? When a new terminal is opened, does it do a "login"? Where is a good place to add $HOME/bin to my path? .bashrc? Will that cause a problem because .profile has the same code?


We just moved into a new house with some iron fencing around the backyard and a large double gate to allow access to the backyard. Unfortunately one side of the gate was damaged at some point in the past and the two sides don't meet anymore and the latch doesn't close. Even worse the gap is big enough for my dog to slip through.    How can I bend that one bar back closer to true so that the two sides meet and my dog won't be able to run away? Trying to save myself the large expense of having to get a whole new gate.  My first thought was to use my car's scissor jack as recommended in , but I don't think I could get it to fit in between the two bars in the right spot. The clamp spreader I feel is probably a good option, but I'm not sure how to use anything that spreads while preventing the bar next to it from bending instead -- which seems like the most likely outcome given the inward bent.

Someone's car hit our metal bar gate, so one of the rods is bent as shown in the photo. What kind of a tool can I use to bend this back, so it's straight? Thank you!


While computing densities for some distributions, I stumbled on the following family of parametrized integrals:  $$ p (x)  := \sqrt{\frac{2}{\pi}} \int_{\mathbb{R}_+} e^{-\frac{x^2}{2 y^2} - y^2} \ d y.$$  They are obtained by playing around with normal distributions and exponential distributions. Using Wolfram Alpha, the following conjecture seems to hold:  $$ p (x)  = \frac{1}{\sqrt{2}} e^{- \sqrt{2} x}.$$  However, I have no idea about how I should prove this equality. I don't think a residue computation may work, because the singularities are essential, but my complex analysis classes are a bit far away, and perhaps there is some nifty trick to solve this problem...  Thank you very much.

How can I evaluate $$I=\int_{0}^{+\infty}\!e^{-ax^2-\frac b{x^2}}\,dx$$ for $a,b>0$?  My methods:  Let $a,b > 0$ and let $$I(b)=\int_{0}^{+\infty}e^{-ax^2-\frac b{x^2}}\,dx.$$ Then $$I'(b)=\int_{0}^{\infty}-\frac{1}{x^2}e^{-ax^2-\frac b{x^2}}\,dx.$$  What the other methods that can I use to evaluate it? Thank you.


If I vote as duplicate the design is broken. It is much worse if the question has no answers yet, then the answer box has a higher z-index.

The "Your Answer" textbox seems to be eating the flagging dialog as shown in Figure A.


Hello everyone I am a high school student and I need help with the proof that $$C(n , 0) + C(n+1 , 1) + C(n+2 , 2) + ... + C(n +  k , k) =C(n+k+1 , k).$$

After reading , the most popular answer use the identity $$\sum_{t=0}^n \binom{t}{k} = \binom{n+1}{k+1}.$$  What's the name of this identity? Is it the identity of the  modified.  How can we prove it? I tried by induction, but without success. Can we also prove it algebraically?  Thanks for your help.    EDIT 01 : This identity is known as the  because, on Pascal's triangle, when the addends represented in the summation and the sum itself are highlighted, a hockey-stick shape is revealed.


I have a Windows 8 64 bit machine (Asus N56VJ) and I was asked to install a 32 bit Linux OS at the university for a programming course.   The main problem is that I'm not able to boot from CD (already downloaded and burned Ubuntu in the CD) and if I try Wubi it will install the 64 bit version. I also tried with a program called easyBCD using the Wubi disk image but it still doesn't work.   If any of you know how I can fix this I'll be in your debt! Thank you very much!

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


Sorry if this is a naive question. We tried finding guidelines, but have failed to find concrete advice.   There are N authors (where N>2) in our publication. Two authors have equal contribution. We are aware of the custom of putting an asterisk and writing a footnote about equal contribution.  However, while arranging the names of authors with equal contribution, how should they be arranged – alphabetically by last name? For instance, if the names are John Foe and Jane Doe, should they be arranged alphabetically by last name: Jane Doe*, John Foe*?

I've seen papers (e.g., in Science) where the first two authors are listed in non-alphabetical order, and yet there are asterisks behind their names to say that they contributed equally.   It seems strange to me, because if the two authors are in alphabetical order, then it could be that the first author contributed more or the two contributed equally, and this can be made clear with asterisks in the paper if it's the latter case. When they're in non-alphabetical order, however, if someone only sees the author list without seeing the paper, he/she will likely assume that the first author contributed most.  So my question is: Are there particular reasons why people do that? (This  is related, but I don't think the answers there get to my question.)


How can I realise this with JSP and JSTL?  int total = 0; for (Article article : list) {     total += article.price; }

I have a Java bean like this:  class Person {   int age;   String name; }   I'd like to iterate over a collection of these beans in a JSP, showing each person in a HTML table row, and in the last row of the table I'd like to show the total of all the ages.  The code to generate the table rows will look something like this:  <c:forEach var="person" items="${personList}">
${person.name}${person.age}
 </c:forEach>   However, I'm struggling to find a way to calculate the age total that will be shown in the final row without resorting to scriptlet code, any suggestions?


Morton's fork is a situation where all outcomes are unpleasant. Is there an expression or term that describes a similar situation, but instead all outcomes are pleasurable/beneficial except only one choice can be made.   Crude example:  If you have the option of either riding a nice train to destination and the fly back on a private plane, or fly in a private plane to destination and then take the nice train back. In both circumstances everything would be the same, and neither would do you a disservice. *That is assuming that neither both are working at 100% and nothing happens, or if something happens it is equally as likely it will happen in both situations.

I am looking for expressions that mean "to decide between two good options." For example, you have to choose between getting a car that you like or a super car that's very expensive but you are not sure if you like it.  I searched on Google and there are some phrases that mean to make decision between two unpleasant options so, I am not sure if there such an expression in English or not.


I want the following figure layout:  How it can be done?

I would like to place the figures as illustrated in the figure below.  The below code can place three figures side by side, but the third one on the right hand side becomes 1c (instead of 2). Any suggestions? Thank you in advance.  \begin{figure*}[tp!]   \centering   \begin{minipage}{.315\linewidth}     \centering     \subcaptionbox{\footnotesize 1a. \label{fig:1a} }     {\includegraphics[width=\textwidth]{figures/1a.pdf}}   \end{minipage}\quad   \begin{minipage}{.315\linewidth}     \centering     \subcaptionbox{\footnotesize 1b. \label{fig:1b}}     {\includegraphics[width=\textwidth]{figures/1b.pdf}}   \end{minipage}\quad   \begin{minipage}{.315\linewidth}     \centering     \subcaptionbox{\footnotesize 2. \label{fig:2}}     {\includegraphics[width=\textwidth]{figures/2.pdf}}   \end{minipage}   \caption{\footnotesize Main caption here. }   \label{fig:main} \end{figure*}


Would the professors of Hogwarts be paid a salary for their teaching?  There's obviously Gringot's where the wizarding world (at least in the UK) would store their riches. I seem to recall there being mention of folks at the Ministry of Magic being paid (I think Ron's dad mentions something about his salary at one point in the movies).  But there's no real mention, as far as I know, of Hogwart's professors being paid, I would assume they'd just live at the school and have their needs met through the 'government'.  It also begs the question of would they be paid in the currency of the local 'muggle world'? Harry visits his parent's vault shortly before heading to Hogwarts and takes out a bunch of galleons to pay his tuition. In the muggle world, this seems like it would be a strange interaction when buying something, ex. paying for groceries using some galleons.

Just kind of a curious question that came to mind while looking at  about who gifted Harry the Nimbus 2000 (a fairly expensive broom at the time, I would imagine) which says it was McGonagal who gave it to him (although apparently through the school, while reading more and the linked non-dupe question).    Although I suppose she didn't pay for it herself, it still got me thinking... Compared to other professions in the wizarding world, how well are the professors paid? I cannot recall anything in either the books (which I have not read in some time) or the films, where they ever talk about their salary.


This was brought to my awareness on a Facebook D&D forum.    This fellow, George Duckett, has published 378+ books by gathering the content from Stack Exchange, dumping it into some semblance of a document, and then selling Stack Exchange content on Amazon and Barnes and Noble to profit directly.

So, this guy has made . Making books of SE stuff is okay, but two rules need to be followed:   Attribution License the work under CC-BY-SA as well   This  claims that the books do attribute properly. I find it unlikely that he has properly licensed the books under CC-BY-SA though, given that he's selling them as eBooks. It's possible, but it's dubious (why do people buy them if they can get them for free?)  Could someone investigate. CC-BY-SA is important, it what keeps things open.  Again, I'm fine with him selling books, but not violating creative commons.  (P.S. The other problem I have with it is the covers are really bad.)


I have been reading your articles on power supply in readiness for starting to build a home automation system using Loxone equipment.  I feel confident in the project but the power supply situation leaves me a bit perplexed.  I am intending to use 8 TDK Lambda (DRF240-24-1) power packs to drive the 24V DC LED lighting in my new house.  Each power pack has a rated input of 100 – 240 VAC 2.7A. The output is 24 – 28 V DC 10 – 8.6A.  So that is a power requirement of 648W for an output of 240W.  My first question is where is the missing 408W?  I realise that the pack itself will require some energy to work, but I would have thought that would be around 20% of the input.  Secondly; if the input is rated at 2.7A x 8 power packs then I will need an RCB in the consumer unit rated at over 21.6A, - or more likely several lower rated RCBs to split the load into zones.  Am I missing something here?    From the 8 Power packs there is a total power available at 24V DC x 80 A  =  almost 2,000W whereas to provide this I have to supply 21.6A x 240VAC = over 5,000W.  Am I going wrong somewhere?  Any observations would be appreciated especially if I am completely failing to understand this issue.  Thanks in anticipation.

I was trying to figure out how much power I actually use when I am charging my phone. Here are the specifications of my charger:   Input: 100/240 V, 50–60 Hz, 0.15 A Output: 5 V, 0.7 A   I've heard that in order to calculate this, you need to pay attention to the input.  $$P = V\cdot A = 240\ \mathrm V\cdot 0.15\ \mathrm A = 36\ \mathrm W$$  I charge my phone for 4 hours a day at most. In that case, I use 144 watt-hours a day, and 51840 Wh a year, or 51.84 kWh. And that seems awfully lot, considering that all the articles I've read about the power consumption of chargers stated that they used about 2 kWh a year. I know I charge my phone too much (I really need a new battery), but it still doesn't add up. Are my calculations wrong? And if they are, what is the correct number?


What is the correct way of pluralizing acronyms in which the last word is either irregular or a foreign word?  For example: radiation transparent medium (RTM)  What would be the plural of the acronym RTM? RTMs or RTM considering that the plural of medium is media?

In computer science we discuss an abstract machine called a "deterministic finite automaton". The standard initialism for this term is "DFA". This makes sense in the singular usage of the initialism.  However, the pluralization of the word "automaton" is "automata". One speaks of "an automaton" or "many automata". Consequently, it seems intuitive to form an initialism of the phrase "deterministic finite automata" as "DFA".   This does not seem correct, as "DFA" could be either plural or singular. On the other hand, "DFAs" also does not seem correct because it would seem to expand to "deterministic finite automatons", a phrase which no self-respecting computer scientist would ever utter.   This appears to be a duplicate of the question here   But that question was never clearly resolved. What to do?


I recently noticed that my Galaxy S9 was running low on space. While using the 'My Files' app that comes with the phone to do some spring cleaning, I noticed that my Internal Storage shows a usage of about 47GB. However, something doesn't add up. I open that folder, turn on display of hidden files, and select EVERYTHING that is listed. The result is only 13.72GB!?!?!?!?!!! This is WAY WAY off. I have a huge amount of space getting used (over 30GB) and no idea what is actually using it, nor how to clear it out.  I have tried using cache cleaners, like Norton Clean, but those only found about 1GB of residual files, etc. I have also tried restarting the phone, but this doesn't help either... Other than a factor default reset, I can't think of anything else to try. Can anyone help me figure out what is going on?

I have critical low storage level and can't understand what takes much of it and how that's possible that the installed applications can use 7 GB? I only use a few social media clients without any games or soft like Photoshop. Also on the second screenshot it indicates that the apps are using just 1.13 GB and so I can't understand the situation. Also what is the "Other"?


I'm new to C++ and the project in which I'm working contains many header files which contain some macros in the beginning (particularly for defining the size of the array variables along with the header guards). The macros contain underscores and double underscores in the beginning and end, whose use seem random to me.  Is this acceptable or something to be avoided.

It's common in C++ to name member variables with some kind of prefix to denote the fact that they're member variables, rather than local variables or parameters. If you've come from an MFC background, you'll probably use m_foo. I've also seen myFoo occasionally.  C# (or possibly just .NET) seems to recommend using just an underscore, as in _foo. Is this allowed by the C++ standard?


Based on the , are they innately evil? The creature type listing for them does not list it, but its mentioned in the things that everyone knows about the undead. But does that mean that each one actually has an evil alignment or is that section just flavor text?

My question is:  Where can I reference the RAW as to (1) that summoning undead is always an evil act, and (2) why summoning undead is always an evil act?  Some of the players in my game keep coming up with the theory that they can make an army of undead and only use it for good deeds, and it won't be evil.  My response is that no, summoning undead is always evil.  You are dealing with negative energies, it taints the soul beyond the veil even if you're only dealing with the body, and it's a desecration of body and soul.  The problem is that even with the big [evil] descriptor on the spells, they don't understand why it would be evil. It seems arbitrary to them, and they don't want to accept any flavor I might give for it that they can't read in the book. They have a knee-jerk reaction to being told something is evil without a good reason.  So they said, "No, you don't do anything to the soul, you're just using the body as raw materials."  I said, "Then you're not using negative energy, you're not using necromancy, and you're not making undead, you're making a golem."  They said, "What's the difference?"   Enter infinite loop until one of them said, "Where in the rules does it say that?"  And we're back to the question.


I am searching for a reference book that details numerical methods for solving differential equations, their rate (order) of convergence,  their cost, and if possible some applications.  Any suggestion is appreciated.   Thank you in advance.  Edit: solving partial differential equations.

I am currently taking a course on Numerical PDE. The course covers the following topics listed below.   Chapter 1: Solutions to Partial Dierential Equations:  Chapter 2: Introduction to Finite Elements:


I've been trying to locate this television series (I'm almost positive it was series) for years. I only distinctly remember one scene where a pilot of a small space fighter (a heavy set guy that might have robotic parts) has some sort of cardiac attack and he opens his flight suit and can directly massage his heart to return it to normal function. I guess that being able to do that suggests it is his heart that's robotic... but I can't be certain.  This is almost certainly not older than 20 years, and not more recent than the last 10, possibly even 15.  Any help would be greatly appreciated!

I don't recall much about the show, and I think I only ever saw one episode, and my Google Fu is not up to snuff today.  The episode, most likely the pilot, came out around the same time as Babylon 5 and then just disappeared.  From what I remember the show was about the (small) crew of a ship. The cockpit of the ship was a upright bed-like contraption, and the cast were investigating a ship that had a radiation leak or something adrift in space.  There was a cast member who could shape-shift, similar to Odo from Deep Space 9, and another member was a barbaric warrior.  There was some sort of mystic stuff, but I may be confusing that with Babylon 5.  Overall the show was very similar, in my memory, to Deep Space 9 and Babylon 5 so I may be confusing things, but I do remember how I saw the similarities in the show to those shows and knew it wasn't the same show.  Any help?


On Stack Overflow, I have been question banned, and it seems nearly impossible to get unbanned. A moderator keeps deleting my downvoted questions...

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


I know that you can transfer your data in Destiny from Xbox 360 and Xbox One, but I have two question for this transfer:    Can you go back and forth for this transfer? ex. playing Xbox One and your data will go back to the Xbox 360 in case you wanna play Destiny on the 360 with friends. Do you have to buy the game on disc or download it from the Xbox store for the transfer to work?

So I really like Destiny and I can see myself playing it for quite a while. I'm curious to know that, because it's all 'online' are characters linked to the console or to the PSN account?  Will I be able to level up my Guardian on PS3 and when I eventually buy a PS4, and a copy of Destiny PS4 will my characters still be available?


I am making a structural latticework, the kind of supports you see on the back of radio telescopes or radar dishes. It is a lot of small struts in triangular and square configurations.   It would be much easier if I could place the 3D cursor where a joint should be, and then make the end faces on the right struts all snap to the cursor.   But when I do that, they all collapse to a single point. It seems like if I do it right, I should be able to prevent that. It is in face select mode, pivot center in individual origin mode.

Is there any way to snap an entire selection to the 3d cursor in edit mode?  Shift+S > Selection to Cursor snaps each individual vertex to the cursor, so the shape is lost:


I've done a full system update of Manjaro Linux, but the laptop has shutted down due to low battery. After turning it on again, everything was working well, so I restarted the update and this time has been completed. Next, I restarted laptop to use Windows and it wasn't on boot menu anymore.  I can read all Windows's partition from Linux (can even use them), but I can't boot it.  The BIOS is UEFI with secure boot off  P.S.: Linux and Windows were in dual boot

I've been reading a lot about dual-booting, and it seems as easy as loading Windows and then loading Linux with GRUB, but everybody says that Windows loves to trash GRUB when it gets the opportunity. What are some steps I can take to prevent this from happening (other than using Windows' bootloader, I want to keep this as simple as possible)?


In recent crypto there has been a trend to design ciphers using only the  - i.e. additions (modulo $2^{32}$ or $2^{64}$), rotations (by a fixed constant) and XORs, examples include , .   One of the nicer, claimed properties of such ciphers is that they are supposedly easier to implement in a side-channel resistant fashion.  Assuming one would want to implement Threefish (on a multitude of architectures such as ARM, x86 and x64), which precautions does one need to take to avoid side-channel attacks for such implementations? And are there any precautions which would be applicable to ARX designs specifically? If, which precautions against side-channel attacks can/should be taken?  What I don't count here: attacks that would work by exploiting unproperly erased/freed memory. I'm looking for the standard cryptographical side channels: cache-timing, "normal" timing and maybe (differential) power (/EM) analysis.  What I would consider "pre-cautions": any code solely intended to defeat side channel attacks while not being documented in the original specification (which usually gives only a mathematical approach).

Is there any cryptographic algorithm immune to side channel attacks based on scan chain? In VLSI point of view.


(This is a follow up on another question .)  I struggle when I condition several variables on another. My question is how to find the distribution of: $(y_1, y_2|y_3)$ where  \begin{align} Y &\sim MVN_3(μ, Σ)  \\[5pt] \text{where } μ &= (0,0,0)  \\[5pt] \text{ and covariance matrix is }Σ &= \begin{bmatrix}1 &\rho_{12} &\rho{13}  \\ \rho_{12} &1 &\rho_{23}  \\ \rho_{12} &\rho_{23} &1 \end{bmatrix} \end{align}  Can I use the same form as in the question above?   The other way would also be interesting: $(y_1|y_2, y_3)$...

We have a multivariate normal vector ${\boldsymbol Y} \sim \mathcal{N}(\boldsymbol\mu, \Sigma)$. Consider partitioning $\boldsymbol\mu$ and ${\boldsymbol Y}$ into  $$\boldsymbol\mu = \begin{bmatrix}  \boldsymbol\mu_1 \\  \boldsymbol\mu_2 \end{bmatrix} $$ $${\boldsymbol Y}=\begin{bmatrix}{\boldsymbol y}_1 \\  {\boldsymbol y}_2 \end{bmatrix}$$  with a similar partition of $\Sigma$ into $$  \begin{bmatrix} \Sigma_{11} & \Sigma_{12}\\ \Sigma_{21} & \Sigma_{22} \end{bmatrix} $$ Then, $({\boldsymbol y}_1|{\boldsymbol y}_2={\boldsymbol a})$, the conditional distribution of the first partition given the second, is  $\mathcal{N}(\overline{\boldsymbol\mu},\overline{\Sigma})$, with mean $$ \overline{\boldsymbol\mu}=\boldsymbol\mu_1+\Sigma_{12}{\Sigma_{22}}^{-1}({\boldsymbol a}-\boldsymbol\mu_2) $$ and covariance matrix $$ \overline{\Sigma}=\Sigma_{11}-\Sigma_{12}{\Sigma_{22}}^{-1}\Sigma_{21}$$  Actually these results are provided in Wikipedia too, but I have no idea how the $\overline{\boldsymbol\mu}$ and $\overline{\Sigma}$ is derived. These results are crucial, since they are important statistical formula for deriving Kalman filters. Would anyone provide me a derivation steps of deriving $\overline{\boldsymbol\mu}$ and $\overline{\Sigma}$ ? Thank you very much!


I have a number of symlinks created on my Windows 7 system. Is there a way to create a backup of all symlinks so after i reinstall Windows to restore them with one click and not recreate them one by one?

Is it possible to backup and restore the created symbolic link paths? Where Windows 7 stores the data for the symbolic links? I looked in the registry but i couldn't find any data there.


The matrix formulation of multiple regression for $n$ observations is $$ \mathbf{Y} = \mathbf{X}^T \beta + \varepsilon, $$ where the error $\varepsilon$ has finite variance $\sigma^2$. Let $\mathbf{b}$ be the estimated coefficients found when we solve the multiple regression problem with least squares. In Theorem 4.3 of the book Econometric Analysis by William H. Greene it says that asymptotically $\mathbf{b}$ is distributed as $$ \mathbf{b} = \mathcal{N}\bigg(\beta,\frac{\sigma^2}{n}Q^{-1}\bigg), $$ where $Q$ is defined in equation 4.19 as \begin{align*} Q := \text{plim}_{n \to \infty} \frac{\mathbf{X}^T \mathbf{X}}{n}. \end{align*} which is a positive definite matrix. Suppose we write the covariance matrix of $\mathbf{X}$ as $$ \text{Cov}[\mathbf{X},\mathbf{X}] =  \begin{bmatrix} \sigma_{X_1 X_1} & \sigma_{X_1 X_2} & \dots \\ \sigma_{X_2 X_1} & \sigma_{X_2 X_2} & \dots \\ \vdots & & \ddots \\ \sigma_{X_n X_1} & \dots & \dots & \sigma_{X_n X_n} \end{bmatrix}, $$ where $$ \sigma_{X_i X_j} =  E[(X_i-E[X_i])(X_j-E[X_j])], $$ I want to know how the matrix $(\mathbf{X}^T \mathbf{X})^{-1}$ relates to the covariance matrix $\text{Cov}[\mathbf{X},\mathbf{X}]$. For example, if we modify the elements of $\mathbf{X}$ to make them more collinear, the off-diagonal elements of $\text{Cov}[\mathbf{X},\mathbf{X}]$ will increase in magnitude and $(\mathbf{X}^T \mathbf{X})^{-1}$ will become 'harder' to invert. But I am looking for a precise mathematical expression that relates the two matrices. Can $(\mathbf{X}^T \mathbf{X})^{-1}$ be expressed in terms of $\text{Cov}[\mathbf{X},\mathbf{X}]$ somehow? E.g., can the elements of $(\mathbf{X}^T \mathbf{X})^{-1}$ be written in terms of the elements of $\text{Cov}[\mathbf{X},\mathbf{X}]$?

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.


Doing a discrete math review and am trying to solve problem 1.6 in the text found here:  - I believe I've gotten parts (a) and (b) correctly, but (c) is a bit tricky for me. Would appreciate a review of a/b and a hint for c if possible. Restatement here:  For n = 40, the value of polynomial $p(n)::=n^2 + n + 41$ is not prime, as noted in Section 1.1. But we could have predicted based on general principles that no nonconstant polynomial can generate only prime numbers.  In particular, let $q(n)$ be a polynomial with integer coefﬁcients, and let $c::=q(0)$ be the constant term of q.  (a) Verify that $q(cm)$ is a multiple of c for all $m \in Z$  Proof: Since q is a polynomial, it will be of the form: $q(x) = a_nx^n+a_{n-1}x^{n-1} + ... + a_1x + c$  If $x = cm$, then notice that cm will be inside every term of the polynomial, and since the final term is c, c can be factored out of every term. Hence, q(cm) is a multiple of c for all $m \in Z$.  b) Show that if q is nonconstant and c > 1, then as n ranges over the nonnegative integers, $N$, there are infinitely many $q(n) \in Z$ that are not primes.  Proof: Continuing from the result found in (a), it is easy to see that for all $m \in Z$, there will be an infinite number of multiples of c that will be generated by q. Since c > 1, these multiples are guaranteed not to be prime.  c) Conclude that for every nonconstant polynomial, q, there must be an $n \in N$ such that $q(n)$ is not prime. Hint: Only one easy case remains.  c = 0 is trivially easy to prove using the (b) above.  I assume the "easy" case is referring to c = 1, but in this case I'm not sure how to continue, since the result of (a) and (b) don't apply: I can't use them since adding 1 to any even number may make it prime. If the result of the terms not including c is odd, then adding 1 to that result makes it even and it is not prime. However, if the terms add up to an even number, I don't see a way of using the knowledge I have so far to prove conclusively that that number + 1 will NOT in fact be prime.

I recently encountered this following proposition:  For every polynomial, there is some positive integer for which it is composite.  What is the most elementary proof of this?


I am planning to migrate from Ubuntu 16.04 to Ubuntu 18.04 with a fresh install.. Has anyone tried the final stable release of Ubuntu 18.04? and Did anyone encounter any errors/issues while installing it? In other words, is it safe enough to try it now, or shall I give it more time before I install it?  Update: This is not about "new release missing or not found", it is about user experience while trying the new release.

Does anyone know the (specific) reasons that it is recommended that old LTS server users wait until the point release to upgrade?  Is it just a matter of bug fixes and waiting for improved stability for production servers, or is there something more fundamental than that?


I'm pretty new to Python and I'm trying to make a discord bot using discord.py and the idea is that you can earn coins that are showed on your profile. The problem is that I need to store the profiles in a single file so it looks like this  userID1,10 userID2,20 userID3,30   Expected output:  userID1,10 userID2,120 userID3,30   Basically "discord id of a user,amount of coins" and I'm trying to replace the line but with a different amount of coins and I have no idea on how to do this without making another file.  This is all I have right now.  def addExp(userID,Points):     with open(fname) as f:         for line in f:             if userID in line:                 info = line.split(',')                 newPoints= int(info[1]) + Points   UserID is the ID of an user so it's different for each user and Points is the amount of points I want to add

I want to loop over the contents of a text file and do a search and replace on some lines and write the result back to the file. I could first load the whole file in memory and then write it back, but that probably is not the best way to do it.  What is the best way to do this, within the following code?  f = open(file) for line in f:     if line.contains('foo'):         newline = line.replace('foo', 'bar')         # how to write this newline back to the file


The csv for the dataframe is . Basically the column Mode represents the transportation choice available for the user to go to the airport, Choice represents the user's choice, and all the other columns depict the variables affecting the choice. I am posting some code below. the mFormula function just segregates the variables into 3 parts separated by a '|' i.e   alternative dependent w generic coefficients | individual specific w alternative specific coefficients | alternative dependent w alternative specific coefficients  I tried two formulas with the mFormula function one of which outputs the coefficients(f1) but doesn't model the variables for the utility function as it should(f).  library(mlogit)  path=""  a<-read.table(path,sep=",", header=TRUE)   Ta<-mlogit.data(a,shape="long",alt.var="Mode",choice="Choice")    f <- mFormula(Choice ~ CostPersonal+CostTrainBus+CostCarpool+CostTaxi+CostSharedTaxi+CostCS+CostSCS+DistSYR+DistNYC+DistALB+DistEWR+SafteyPersonal+SafteyTrainBus+SafteyCarpool+SafteyTaxi+SafteySharedTaxi+SafteyCS+SafteySCS+PrivacyPersonal+PrivacyTrainBus+PrivacyCarpool+PrivacyTaxi+PrivacySharedTaxi+PrivacyCS+PrivacySCS+ConviniencePersonal+ConvinienceTrainBus+ConvinienceCarpool+ConvinienceTaxi+ ConvinienceSharedTaxi+ConvinienceCS+ConvinienceSCS+payUticaSYR+payUticaALB+flightsYear+daysBreturn+incomeB+familySize+ageB|Airport+TimePersonal+TimeTrainBus+TimeCarpool+TimeTaxi+TimeSharedTaxi+TimeCS+TimeSCS+luggage+ownVehicle+shuttleMaxPersonsB)  f1<- mFormula(Choice ~ 1| +0+CostPersonal+CostTrainBus+CostCarpool+CostTaxi+CostSharedTaxi+CostCS+CostSCS+Airport+DistSYR+DistNYC+DistALB+SafteyPersonal+SafteyTrainBus+SafteyCarpool+SafteyTaxi+SafteySharedTaxi+PrivacyPersonal+PrivacyTrainBus+PrivacyCarpool+PrivacyTaxi+PrivacySharedTaxi+ConviniencePersonal+ConvinienceTrainBus+ConvinienceCarpool+ConvinienceTaxi+ConvinienceSharedTaxi+TimePersonal+TimeTrainBus+TimeCarpool+TimeTaxi+TimeSharedTaxi+flightsYear+daysBreturn+luggage+ownVehicle+incomeB+familySize+ageB+shuttleMaxPersonsB+payUticaSYR+payUticaALB)   ml.a<-mlogit(f,Ta)#does not output coefficients ml.a<-mlogit(f1,Ta)#does output coefficients summary(ml.a)`  The error is:  Error in solve.default(H, g[!fixed]) :    Lapack routine dgesv: system is exactly singular: U[3,3] = 0   although mlogit with f1 does output the coefficients with a   Likelihood: -2.2039e-07   Clearly I don't understand which variables should and should not be included and co-relation between which ones is causing the issue.

Fitting a logistic regression using  ends with   Error in mer_finalize(ans) : Downdated X'X is not positive definite.    A likely cause of this error is apparently rank deficiency. What is rank deficiency, and how should I address it?


I would like to integrate Windows 8 integrate into grub without its loader. Can I do this? If yes, how? Loader loads slowly.

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


Trying to prove by induction in a non-math course and I feel like I'm getting the steps but I'm just stuck on the math.   $$G_1 = 1$$  $$G_2 = 1$$  $$G_n = 2G_{n−1} + 3G_{n−2}, \quad n \geq 3$$  Using mathematical induction, prove that for every $n ≥ 1$, $G_n ≤ 3^n$.  I used $G_1$ as my base case, since it’s given.   My induction hypothesis is to assume $G_n \leq 3^n$ for some arbitrary $n$. Thus I should prove $G_{n+1}\leq  3^{n+1}$.  Using the given formula I simplified down to $2G_n + 3G_{n-1} ≤ 3^n3$.  I feel like I'm pretty much there, but I just don't see how to solidify the proof from here. Any hints would be greatly appreciated!

The question: The terms of a sequence are given recursively as  \begin{cases} a_0 = 1,\\ a_1 = 1 \\a_n=2a_{n-1} + 3a_{n-2} \quad\text{ for } n \geq 2  \end{cases} prove by mathematical induction $a_n = \frac12(3^n) +\frac12(-1)^n$ for all $n \geq 0$  I've started by proving that the formula works e.g $$a_0= 1\implies a_0 = \frac12(3^0)+\frac12(-1)^0 = 1 \\a_1=1\implies a_1 = \frac12(3^1) + \frac12(-1)^{1} = 1$$  Therefore $p(1)$ and $p(2)$ are true  Now I have to do the hard part.. the inductive step suppose $p(1), p(2),\ldots, p(k)$, that is $a_{k+1} = 2a_{k} + 3a_{k-1}$ Im not sure where to really go from here.


I am trying to run the following longtable:  \documentclass[12pt]{article}  \usepackage{amssymb,amsmath,latexsym,booktabs,float,graphicx,longtable} \usepackage{array} \newcolumntype{L}[1]{>{\raggedright\let\newline\\\arraybackslash\hspace{0pt}}m{#1}} \newcolumntype{C}[1]{>{\centering\let\newline\\\arraybackslash\hspace{0pt}}m{#1}} \newcolumntype{R}[1]{>{\raggedleft\let\newline\\\arraybackslash\hspace{0pt}}m{#1}}  \begin{document} \begin{center} \begin{longtable}[pt]{l C{3.5cm} C{3.5cm} C{3.5cm}}  \caption[Average statistics]{Average statistics} \label{tab:sumstats} \\ \hline \hline \  & \multicolumn{3}{c}{Total variation} \\ \cline{2-4} \textbf{Tests} & \textbf{Test 1} & \textbf{Test 2} & \textbf{Test 3}\\ \hline \endfirsthead \multicolumn{4}{l}% {{\bfseries \tablename\ \thetable{} continued}} \\ \hline \hline \  & \multicolumn{3}{c}{Total variation} \\ \cline{2-4} \textbf{Tests} & \textbf{Test 1} & \textbf{Test 2} & \textbf{Test 3}\\ \hline \endhead \hline \endfoot  \hline \hline \multicolumn{4}{l}{\footnotesize Note: aaa}\\ \endlastfoot  \textbf{Experiment 1} \\ A (\%) & 0.89 & 0.90  & 1.23\\ B (\%) & 14.25 & 14.31  & 14.76\\ C (\%) & 0.21 & 0.22  & 0.25\\ \hline \end{longtable} \end{center}  \end{document}   However, I need this table to start in a new page and to fill the previous page with text.   Currently I can only put the table in a new page with \clearpage or \newpage, but I get an empty space in the previous page if I do so.  Do you know how can I solve this issue?  Thank you very much.

I want to use the longtable environment for a table. However, I do not know how to place it at the top of the next page, as I can do with the table environment. Do you know how to do it?


In R, when we use glmnet package. We use cv function as cross validation in finding the value of lambda. In the package, we will find two options in the bottom, lambda.min and lambda.1se. If I use Lasso selection, which lambda should I pick in Multinomial Logistics Regression using Lasso?   Some recommended in using lambda.1se as it is simpler and comparable to the best model. Yet, I cannot find one reliable citation.  Please help, thank you.

I understand what role lambda plays in an elastic-net regression. And I can understand why one would select lambda.min, the value of lambda that minimizes cross validated error.   My question is Where in the statistics literature is it recommended to use lambda.1se, that is the value of lambda that minimizes CV error plus one standard error? I can't seem to find a formal citation, or even a reason for why this is often a good value. I understand that it's a more restrictive regularization, and will shrink the parameters more towards zero, but I'm not always certain of the conditions under which lambda.1se is a better choice over lambda.min. Can someone help explain?


When can we reasonably assume a sequence of r.v.'s is IID in real life scenarios? My question is based off the following example from Wasserman's All of Statistics:  Suppose we test a prediction method, a neural net for example, on a set of $n$ new cases. Let $X_i=1$ if the predictor is wrong and $X_i=0$ if the predictor is right. Then $\bar{X}_n = n^{-1}\sum_{i=1}^n X_i$ is the observed error rate. Each $X_i$ may be regarded as a Bernoulli with unknown mean $p$. Intuitively, we expect that $\bar{X}_n$ should be close to $p$. How likely is $\bar{X}_n$ to be within $\epsilon$ of $p$? We have that $V(\bar{X}_n)=V(X_1)/n=p(1-p)/n$ and $$P(|\bar{X}_n-p|>\epsilon \leq V(\bar{X}_n/\epsilon^2) = p(1-p)/n\epsilon^2 \leq 1/4n\epsilon^2$$ where the last equation follows from Chebyshev's inequality.  In the above example, the variance of the sum of Bernoulli variables is calculated by assuming they are IID. Why is it reasonable to make this assumption?

The i.i.d. assumption states:  We are given a data set, $\{(x_i,y_i)\}_{i = 1, \ldots, n}$, each data $(x_i,y_i)$ is generated in an independent and identically distributed fashion.   To me, physically this means that we can imagine that the generation of $(x_i,y_i)$ has no affect on $(x_j,y_j)$, $j \neq i$ and vice versa.  But does this hold true in practice?  For example, the most basic machine learning task is prediction on MNIST dataset. Is there a way to know whether MNIST was generated in an i.i.d. fashion? Similarly for thousands of other data sets. How do we "any practitioner" know how the data set is generated?  Sometimes I also see people mentioning shuffling your data to make the distribution more independent or random. Does shuffling tangibly create benefit as compared to a non-shuffled data set?   For example, suppose we create a "sequential" MNIST dataset contained digits arranged in an increasing sequence 1,2,3,4,5,6,..obviously, the data set was not generated in an independent fashion. If you generate 1, the next one must be 2. But does training a classifier on this data set has any difference as compared to a shuffled dataset?  Just some basic questions.


Find the maximum value of $x_1x_2+x_2x_3+\cdots+x_nx_1$ if $x_1+x_2+\cdots+x_n=0$ and $x_1^2+x_2^2+...+x_n^2=1$.  I can get by Cauchy-Schwarz that $x_1x_2+x_2x_3+\cdots+x_nx_1 \leqslant 1$, but can expression $x_1x_2+x_2x_3+\cdots+x_nx_1$ be smaller?

To seek the maximum value of $S=x_1x_2+x_2x_3+\cdots+x_nx_1$ on this domain:  $x_1+x_2+\cdots+x_n=0$ and  $x_1^2+x_2^2+\cdots+x_n^2=1$.  I have made some trivial observations:  1) $S\in[-1,1)$ by the rearrangement inequality.  2) We can make $S$ arbitrarily close to $1$ by increasing $n$.  3) An equivalent problem is to minimise $(x_1-x_2)^2+\cdots+(x_n-x_1)^2$.  But does the maximum have a meaningful closed form  for each $n$?


I am trying to understand the concept of p-value.   mentions:     The p-value is defined as the probability, under the assumption of hypothesis $H$, of obtaining a result equal to or more extreme than what was actually observed.   Though, I found quite vogue the term extreme, I'm taking it as the values beyond the observed value of the test statistic; by that I could somewhat conceived the definition.  Then, like my book, the wiki article writes:     The smaller the p-value, the larger the significance because it tells the investigator that the hypothesis under consideration may not adequately explain the observation. The hypothesis $H$ is rejected if any of these probabilities is less than or equal to a small, fixed but arbitrarily pre-defined threshold value $\alpha,$ which is referred to as the level of significance [...]   Hmmm... I couldn't get that point; why does the smaller p-value means a higher significance viz, the null hypothesis is on the verge of extinction?  Also, as this  summarises:           High P values: your data are likely with a true null.   Low P values: your data are unlikely with a true null.      I'm not getting why it is so- why does the lower p-values means the the significance is high?  Wikipedia seems to reason saying this: 'the hypothesis under consideration may not adequately explain the observation'. Can anyone tell me why it is so?  Please help me explaining why lower the p-value, higher is the significance.

After taking a statistics course and then trying to help fellow students, I noticed one subject that inspires much head-desk banging is interpreting the results of statistical hypothesis tests.  It seems that students easily learn how to perform the calculations required by a given test but get hung up on interpreting the results.  Many computerized tools report test results in terms of "p values" or "t values".  How would you explain the following points to college students taking their first course in statistics:   What does a "p-value" mean in relation to the hypothesis being tested?  Are there cases when one should be looking for a high p-value or a low p-value? What is the relationship between a p-value and a t-value?


I thought a few good options would be "amble"; "slog"; "plod" - but they are mostly used in context of walking.  I want to use the word in a sentence like -       I (insert word) over a book for days.

Sometimes we read books rather quickly and don't give them much (or any) thought, so the action 'reading' does not necessarily imply that we have given enough thoughts to any book we read.   Is there a word that describes reading a book with great care; usually but necessarily slowly over a long period of time.


I'm using SharePoint Online modern UI.  And, I want to hide Quick edit, Sync, Export to Excel, PowerApps, Automate from my site.  Please check below picture.   Could you tell me how to hide that menu?

I'm using SharePoint Online modern UI.  And, I want to hide Quick edit, Sync, Export to Excel, PowerApps, Automate, Share, Copy Link, Copy to from my site.  Please check below picture.     I found the easy solution about PowerApps, Automate, Sync buttons in below URLs.        But I can't find solution other buttons. I don't want to use SPFX if possible, but is there no choice to use SPFX?


Centripetal force is directed towards the center, then why does an object placed on a rotating disc move outwards?  On the other hand,  when a particle is placed in a cylindrical container containing water that rotates, the particle moves towards the center. Why does this happen?

If some object is kept in a radial groove made on a disk and the disk is rotated with say constant angular velocity.   Now as we know that the object moves outwards ie away from the centre of the disk. I want to know which force is it which throws the object outwards.   As centrifugal force is a pseudo force and hence when the observer is in ground frame it shouldn't be present so which force exactly pulls it out.


I am the beginner of LaTeX and I have tried the below code to make table in appropriate place. But when I compile the code table moves down to end of the page.  \documentclass[12pt,a4paper]{article} \usepackage[hmargin=2cm,vmargin=2cm]{geometry} \title{Tutorial on Tables and Figures} \date{\today} \begin{document} \maketitle \centering \begin{table} \caption{Cost of fruits in India} \begin{tabular}{||l|c|c|c|c||}\hline \multicolumn 2 {||c|}{Fruit details} &  \multicolumn 3 {c|}{Cost calculations} \\ \hline Fruit & Type & No. of units & cost/unit & cost (Rs.) \\ \hline Mango & Malgoa & 18 & 50 & \\ \cline{2-4} & Alfonso & 2 & 300 & 1,500 \\ \hline Jackfruit & Kolli Hills & 10 & 50 & 500 \\ \hline Banana & Green & 10 & 20 & 200 \\ \hline \multicolumn 4{||r|}{Total cost (Rs.)} & 2,200 \\ \hline \end{tabular} \end{table} \end{document}

How to influence the position of float environments like figure and table in LaTeX?   This is a general question and should collect useful answers for all users. I hope we can use this as a reference


The $L_p$ norm $||A||_p$ is defined as  $$\sup_{x \neq 0} \frac{||Ax||_p}{||x||_p} = \max_{||x||_p = 1} ||Ax||_p \tag{1}$$  I'm not quite getting why the LHS uses $\sup$ but the RHS uses $\max$. I know how both are defined but somehow I don't get it. The maximum requires the solution to be contained in the candidate set while the supremum does not. Thus, why does (1) hold?

I have been given the definition of a subordinate (operator or matrix) norm: $$\lvert\lvert A \rvert\rvert=\sup_{x\in V}\frac{\lvert\lvert Ax \rvert\rvert}{\lvert\lvert x \rvert\rvert},$$ where $V$ is a vector space, and $A$ is a linear operator. I have been told that in the case of a finite-dimensional vector space, we can replace $\sup$ with $\max$, giving $$\lvert\lvert A \rvert\rvert=\max_{x\in V}\frac{\lvert\lvert Ax \rvert\rvert}{\lvert\lvert x \rvert\rvert},$$ and I am wondering why this is true. It seems reasonable to me, but how can I be convinced that it's true?


I'm trying to sending email from nagios monitoring to some email addresses. But I have a problem with setup my from domain when I'm sending an email every time my from email address seems like this:    from=<root@patrik-VirtualBox>   and format like this some mail servers are rejecting.  so I need replace @patrik-VirtualBox to my domain @onedata.sk  here is my /etc.postfix/main.cf:  alias_database = hash:/etc/aliases alias_maps = hash:/etc/aliases append_dot_mydomain = no biff = no config_directory = /etc/postfix home_mailbox = Maildir/ inet_interfaces = all mailbox_command = mailbox_size_limit = 0 mydestination = mail.onedata.sk, localhost.localdomain, localhost, yourdomain.com myhostname = onedata.sk mynetworks = 127.0.0.0/8 [::ffff:127.0.0.0]/104 [::1]/128 readme_directory = no recipient_delimiter = + relayhost = smtp_tls_session_cache_database = btree:${data_directory}/smtp_scache smtpd_banner = $myhostname ESMTP $mail_name (Ubuntu) smtpd_tls_cert_file = /etc/ssl/certs/ssl-cert-snakeoil.pem smtpd_tls_key_file = /etc/ssl/private/ssl-cert-snakeoil.key smtpd_tls_session_cache_database = btree:${data_directory}/smtpd_scache smtpd_use_tls = yes   from log:  Feb  3 01:55:56 patrik-VirtualBox postfix/pickup[10655]: E2FFA66C36: uid=0 from=<root@patrik-VirtualBox> Feb  3 01:55:56 patrik-VirtualBox postfix/cleanup[10963]: E2FFA66C36: message-id=<20150203005556.E2FFA66C36@onedata.sk> Feb  3 01:55:56 patrik-VirtualBox postfix/qmgr[10656]: E2FFA66C36: from=<root@patrik-VirtualBox>, size=340, nrcpt=1 (queue active) Feb  3 01:56:35 patrik-VirtualBox postfix/smtp[10965]: E2FFA66C36: to=<patrik.kristel@onedata.sk>, relay=mailhub.nextra.sk[195.168.1.42]:25, delay=38, delays=0.03/0.01/30/8, dsn=5.0.0, status=bounced (host mailhub.nextra.sk[195.168.1.42] said: 517 Syntax error. (in reply to MAIL FROM command))   I have also tried to set up relayhost or , but it didn't help.  I have configured it in another server like this and there it works fine, so I don't understand why it doesn't work.

Hi currently Nagios sends notifications from nagios@server.domain.com, How do I go about configuring this? Thanks


I'm using Javascript and I'm wondering how can I use regex to match an element after certain word, and before another sign.  For instance, return 1  from this string  localhost:8080/user/1/somethingelse/   I've tried  /user\/([0-9]*)+\/g   but it returns  user/1/   Any help would be hightly appreciated.

I want to match a portion of a string using a  and then access that parenthesized substring:  var myString = "something format_abc"; // I want "abc"  var arr = /(?:^|\s)format_(.*?)(?:\s|$)/.exec(myString);  console.log(arr);     // Prints: [" format_abc", "abc"] .. so far so good. console.log(arr[1]);  // Prints: undefined  (???) console.log(arr[0]);  // Prints: format_undefined (!!!)   What am I doing wrong?    I've discovered that there was nothing wrong with the regular expression code above: the actual string which I was testing against was this:  "date format_%A"   Reporting that "%A" is undefined seems a very strange behaviour, but it is not directly related to this question, so I've opened a new one, .    The issue was that console.log takes its parameters like a printf statement, and since the string I was logging ("%A") had a special value, it was trying to find the value of the next parameter.


I don't know what the reason of existence of the star feature is, but intuitively I star questions to express interest in it.  I think it would be nice to be able to get notifications on the questions I've starred (=expressed interest in, in my understanding of the feature).

I was reading one of  and was surprised that what he described in a comment still hasn't been implemented.     well, don't thank me yet -- this functionality was pulled, and we   haven't quite figured out a way to change it yet. Current thinking is   for the star click to trigger a "do you want to be notified about this   question?" with some "always do this" options. –  Jeff Atwood♦ Jan 3   '12 at 9:03   This sounds like the best idea since toasted waffles, so why hasn't it been implemented yet?  I often find questions that intrest me greatly or I feel may greatly help me in the future. Often these questions might have a good answer at the time or the answer may change due for other reasons (ex. software updates).  I would like a way to recieve updates in my inbox for super-special questions that I designate (a sort of super-favorite). I find the "favorites" tab to be inconvenient and can easily become cluttered if you favorite a lot of questions.


I'm trying to access a method of my parent class, see the code:  #include <wx/wx.h> #include <wx/taskbar.h> #include <iostream> #include "appicon.xpm"  class MyFrame; // forward  class mywxTaskBarIcon : public wxTaskBarIcon {     private:         MyFrame *m_parent;     public:         mywxTaskBarIcon (MyFrame *parent, const wxIcon& icon) :             wxTaskBarIcon (), m_parent (parent)         {             SetIcon (icon, wxT("Listos"));         }         virtual ~mywxTaskBarIcon () {             std::cout << "died" << std::endl;         }     protected:         virtual wxMenu *CreatePopupMenu () {             return m_parent->getFileMenu (); // invalid type         } };  class MyFrame : public wxFrame {     private:         wxIcon main_icon;         wxSharedPtr<mywxTaskBarIcon> tray;     public:         MyFrame (const wxString& title) :             wxFrame (NULL, wxID_ANY, title), main_icon(appicon)         {             SetIcon (main_icon);             wxMenuBar *menubar = new wxMenuBar;             menubar->Append (loadFile(), wxT("&Aplicación"));             SetMenuBar(menubar);             tray = wxSharedPtr<mywxTaskBarIcon>(new mywxTaskBarIcon (this, main_icon));             Centre ();             Show ();         }         wxMenu * getFileMenu () {             return loadFile ();         }     protected:         wxMenu* loadFile () {             wxMenu *file = new wxMenu;             file->Append (wxID_EXIT, wxT("&Salir"));             return file;         } };  class MyApp : public wxApp {     public:         virtual bool OnInit() {             new MyFrame (wxT("Hola"));             return true;         } };  wxIMPLEMENT_APP (MyApp); wxDECLARE_APP (MyApp);   As you can see it's a wxWidgets project. After I forwarded the class, I want to access a method of my class, but I get this error about using an invalid type..any ideas?

I am looking for the definition of when I am allowed to do forward declaration of a class in another class's header file:  Am I allowed to do it for a base class, for a class held as a member, for a class passed to member function by reference, etc. ?


E: GPG error: http://www.geekconnection.org karmic/ InRelease: Clearsigned file isn't valid, got 'NODATA' (does the network require authentication?)   "I am constantly encountering above error while updating. Please help me to solve this problem."

I can use my mobile broadband to access Internet with Firefox but when I want to install any package from terminal or make 'apt-get update' command I got the following error:  got 'NODATA' (does the network require authentication?)   apt-get update output:  Get:1 extras.ubuntu.com trusty InRelease [213 B] 98% [1 InRelease gpgv 213 B] [Connecting to archive.ubuntu.com] Splitting up /var/lib/apt/lists/partial/extras.ubuntu.com_ubuntu_dists_trusty_InRelease into data Ign extras.ubuntu.com trusty InRelease E: GPG error: extras.ubuntu.com trusty InRelease: Clearsigned file isn't valid, got 'NODATA' (does the network require authentication?)    output of `cat /var/lib/apt/lists/partial/extras.ubuntu.com_ubuntu_dists_trusty_InRelease  <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <html> <head> <title>404</title> <meta http-equiv="Cache-Control" content="no-cache"/> </head> <body> <p> Not Found </p> </body> </html>   output of wget:  wget -O - http://extras.ubuntu.com/ubuntu/dists/trusty/InRelease  --2014-06-01 09:23:35--  http://extras.ubuntu.com/ubuntu/dists/trusty/InRelease Resolving extras.ubuntu.com (extras.ubuntu.com)... 91.189.92.152 Connecting to extras.ubuntu.com (extras.ubuntu.com)|91.189.92.152|:80... connected. HTTP request sent, awaiting response... 200 OK Length: 213 [text/html] Saving to: ‘STDOUT’   0% [                                       ] 0           --.-K/s              <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <html> <head> <title>404</title> <meta http-equiv="Cache-Control" content="no-cache"/> </head> <body> <p> Not Found  </p> </body> </html>


I don't know how to do this I'm just curious how can I.

Can an irrational number raised to an irrational power be rational?  If it can be rational, how can one prove it?


When browsed in IE6, the left part of each question is wrongly aligned.  How to fix it?  Don't tell me to abandon IE6, seriously.  Be technical, thanks.

Which browsers are officially supported by Stack Exchange?  Also, what else is needed in order to use every feature of the site?


I just found out that I overpaid my taxes by a significant amount last year.  I suppose I need to file an "amended return" in order to get my money back.  The problem is that if I just fill out the new return, it will show what I should have paid, not what I did pay. How do I enter what I paid, so I can get back the difference? I looked in the "Payments" section of the 1040 and nothing listed is "amount you already paid", except withholding but this is not withholding.

How can I fix a mistake I made on my income tax filing?


I am a Pakistani citizen and applied for PLAB 2 UK visa (for 6 months) on 15th October 2015 and was refused a visa based on the fact that the visa officer was not satisfied that I would leave the UK at the end of my visit.   My contract at work expires 2nd December 2015 and my exam is on 6th January 2016. I stated in the application form I will be staying for 3 months and I will be flying to UK on 1st December 2015. I work on an annual contract basis and according to the hospital policy the contract is renewed only a month before expiry.   So there was no way for me to show them my new contract which would be renewed in November 2015. Now my exam fee and the my career are at jeopardy. I assumed they would understand that I will be staying for at least 3 months because in case I fail my exam I will re-apply from within UK within that valid 6 month period of the visa.   I have not been given any right of appeal or administrative review. Please guide on when can i make my new application. My new contract is ready now.

I am from Nigeria and I'm doing a one year Internship program with The Marriott hotel in Wisconsin, I applied for the UK visitor visa two weeks ago to visit my fiance who lives and work in the UK, but I was refused the visa because the letter of my workplace that I provided was back dated of 2014 which they say they are not satisfy it accurately reflects my current employment circumstance. I also provided my pay slips, but they said they were not satisfied with it demonstrating the terms and conditions of my employment, and they also said I did not present any evidence to satisfy me having sufficiently strong ties and commitments in my country of habitual residence or elsewhere to motivate my timely departure from the UK. They said the documents my fiance presented were OK.  How soon can I re-apply for a UK visa after getting a refusal?


I am a citizen of Cameroon living in Cameroon. Can I apply for a US visa in a neighboring country?

I am a Indian passport holder. I am in Myanmar (Burma). Can I get a visa for the USA from here?


Today I was deleting some of my answers on StackOverflow. After deleting 5 answers it started giving me an error stating that :     You have already deleted 5 of your own posts today; further deletes are blocked   So my question is, how can we delete more than 5 answers in a day? Also, why is there a limit of only 5 answers to delete.

I can't delete more than 5 of my own posts in a single day. Is this a bug, or intended behavior? I'm trying to clean up old, crappy posts of mine.    Similar-looking problem, but it claims to be :


What are the unit elements in $\Bbb{Z}[i]$, where $\Bbb{Z}[i]$ is defined to be the set of Gaussian integers ? My progress: My mentor gave this problem and he said to use determinants and scalefactor. Then I was able to proceed and got the unit elements in $\Bbb{Z}[i]=1,-1,i,-i$ , which is correct . However, I wonder if there is some other way to proceed . Any solution or hint is appreciated . Thanks in advance.

How can we show that $\pm 1, \pm i$ are the only units in the ring of Gaussian integers, $\mathbb Z[i]$?  Thank you.


Let me explain. For some time I developed some code. Now I want to separate a part and make it open-source. My main problem is to save all commit history, which concerns that files.

I have a  repository which contains a number of subdirectories. Now I have found that one of the subdirectories is unrelated to the other and should be detached to a separate repository.  How can I do this while keeping the history of the files within the subdirectory?  I guess I could make a clone and remove the unwanted parts of each clone, but I suppose this would give me the complete tree when checking out an older revision etc. This might be acceptable, but I would prefer to be able to pretend that the two repositories doesn't have a shared history.  Just to make it clear, I have the following structure:  XYZ/     .git/     XY1/     ABC/     XY2/   But I would like this instead:  XYZ/     .git/     XY1/     XY2/ ABC/     .git/     ABC/


Suppose a set A has n number of elements and a set B has m number of elements. Then why the number of one to one functions is n!?  And also, how many functions in total are possible? Are they n*m?  I think, they should be, nm. Because, nm would be total number of elements in A cross B. And since, you can't have a functions where an element of A won't be mapped to any element in B. Therefore, for every elements in A, you have m number of choices from B. That would make Product Rule applicable. And hence, they should be n*m. Correct me if I'm wrong. Thanks. :)

I have a homework question I have been struggling with  which is:   How many one-to-one functions are there from the set $A$ into the $B$ if $|A|=n$ and $|B| = k$?  I can't seem to think of the way to attack this problem help will be appreciated :)  Thanks


[image of an executed code in keil]    I've written above code to move an array( msg[ ] ) to Port 0(I'm using Keil µvision), in which 'unsigned int y' gets the size of the array and displays it to Port 1(Port-1 output is shown in the image, whereas Port-0 output is not)  Question:   Why am I getting double the value of the specified array?

How do I determine the size of my array in C?   That is, the number of elements the array can hold?


When I am asked "what time is it", when should I say "It is 1 o'clock" and when I should say "It is 1 AM /PM"? and in addition, could it be that both of them can be said continuously (It is 1 AM / PM o'clock)?

I get up at 6 o'clock in the morning. I get up at 6 in the morning.   Can I use sentense 2?  When can I use only number without o'clock am pm etc?


despit i specified that the image must be place inline "among the text" using [h] command, at run time, the image is place at the end of the section how to set it right?  latex:   \subsection{item1 Vs item2} in this comparison...... ...... ...... ...... \begin{figure}[h] \centering \includegraphics[width=100mm,scale=0.7]{osm_vs_wikipedia_2} \caption{caption} \end{figure}  the rest of the text goes here.. ...

I have a problem when a lot of figures are in question. Some figures tend to "fly around", that is, be a paragraph below, although I placed them before that paragraph. I use code:  \begin{figure}[ht] \begin{center} \advance\leftskip-3cm \advance\rightskip-3cm \includegraphics[keepaspectratio=true,scale=0.6]{slike/visina8} \caption{} \label{visina8} \end{center}\end{figure}   to place my figures. How can I tell latex I REALLY want the figure in that specific place, no matter how much whitespace will be left?


Given that we have a $\sigma$-algebra $\mathcal{F}_1$ such that $\mathcal{F}_1 =$ {$X \subset \mathbb{R}: X \textrm{ or }   \mathbb{R} \setminus X \textrm{ is countable}$ } Is $\mathcal{F}_1$ countably generated? If it is not countably generated, how can I show it? Thanks,

I am trying to prove that the countable, co-countable sigma algebra on $\mathbb{R}$ cannot be countably generated.   In more precise terms.   Let $\Sigma$ be the $\sigma$-algebra generated by countable subsets of $\mathbb{R}$, that is $$ \Sigma = \sigma (\{A\subseteq  \mathbb{R} \:|\: A \textrm{ is countable}\})$$   It is easy to see that $A\in \Sigma$ iff $A$ is countable or co-countable.    Question: Is there a countable family $\{A_n\}_{n\in\mathbb{N}}$ such, for all $n\in\mathbb{N}$, $A_n\in \Sigma$ and $$ \Sigma = \sigma (\{A_n \:|\: n\in\mathbb{N}\})?$$   I think the answer is NO, and I am trying to prove it. Can someone please help me in proving this?    My attempt is to prove by contradiction. That is assuming that the countable generating set exists then to show that sigma algebra generated by this set would miss some singletons of $\mathbb{R}$. Since the given sigma algebra contains all singletons this leads to contradiction. I am following this approach because I know that the set of all singletons generate the given sigma algebra and they are uncountable.


Dear English teachers, I have a question. I noticed that news articles tend to use the definite article "the" when describing a three-letter acronym, e.g. the NFL, the NBA, the NHL, the MLB... etc. However, when describing a four(or more)-letter acronym, the definite article "the" has been omitted, e.g. NASA, FIFA, UNCCD, UNESCO... etc. Since all these acronyms are describing similar entities like government agencies or international associations, I wonder why different rules have been applied to those four(or more)-letter acronyms? Thank you for your help.

I've read  and  I know that  1. The article is often used with initials that are pronounced letter by letter (initialisms).  2. The article is often NOT used with initials that are pronounced as a word (acronyms).  I used 'often' because I'm not sure about possible exceptions.  In my field of study (Operations Research), initials are frequently used to represent optimization problems (e.g., the TSP). I discussed this point with my university supervisor who makes comments on my reports (English is not his native language). He responded that:  "What I learned from [...] was that whenever we use (specific) acronyms, we don't use 'the' when they are within a sentence, and we use 'the' when a sentence starts with them. For instance,  (i) The HCP is an NP-Complete problem.  (ii) We developed a new algorithm to solve HCP."  HCP stands for the Hamiltonian Cycle Problem. It is really confusing me because I do not know when to use and when not to use the article. For example, on , the author Jane Watson writes:     Use a definite article with an initialism if the spelled out term begins with “the” but is not covered in the initialism.   which implies that I should use the article with "HCP". What do you think?


I am looking to determine if two or more raters have statistically different observations of the same data, which is continuous in nature.  I am thinking a reasonable approach to this problem is to do a paired t-test if there are two raters and a one-way repeated measures ANOVA if there are more than two raters.    I've never seen a t-test or F-test used to look at rater disagreement in this way.  We're also using an ICC and Bland-Altman plotting to explore this agreement/disagreement between raters of continuous data, but would like to be able to say that the raters 'were' or 'were not' statistically different from each other.  Does our approach seem reasonable or do others have suggestions?

I'm a little confused regarding the intraclass correlation coefficient and one-way ANOVA.  As I understand it, both tell you how similar observations within a group are, relative to observations in other groups.  Could someone explain this a little better, and perhaps explain the situation(s) in which each method is more advantageous?


I'm trying to get hashcat running, but seem to be having some issues.  I'm following this guide for Ubuntu:   Using this installer:   In addition to the guide, I did:  install ocl-icd-libopencl1 apt-get update && sudo apt-get upgrade   I get this error on the included example files:  root@ip-139-28-11-15:~/new/hashcat-3.10# hashcat example0.hash example.dict hashcat (v3.10) starting...  Generating bitmap tables with 16 bits...  ERROR: clGetPlatformIDs(): CL_UNKNOWN_ERROR   My OS is:  Linux ip-139-28-11-15 3.13.0-57-generic #95-Ubuntu SMP Fri Jun 19 09:28:15 UTC 2015 x86_64 x86_64 x86_64 GNU/Linux   I don't know what to do.  Any help?

I've downloaded HashCat 4.0.1 form its official website. Running it show following error:  root@mstehr:~/hashcat-4.0.1# ./hashcat64.bin -I hashcat (v4.0.1) starting...  clGetPlatformIDs(): CL_PLATFORM_NOT_FOUND_KHR   I'm using Ubuntu 14.04. I can run this command successfully on another Ubuntu box.  Result of head /proc/cpuinfo:  root@mstehr:~# head /proc/cpuinfo processor       : 0 vendor_id       : GenuineIntel cpu family      : 6 model           : 58 model name      : Intel(R) Core(TM) i3-3210 CPU @ 3.20GHz stepping        : 9 microcode       : 0x15 cpu MHz         : 3192.864 cache size      : 3072 KB physical id     : 0   Result of ls lspci:  root@kmstehr:~# lspci 00:00.0 Host bridge: Intel Corporation Xeon E3-1200 v2/3rd Gen Core processor DRAM Controller (rev 09) 00:02.0 VGA compatible controller: Intel Corporation Xeon E3-1200 v2/3rd Gen Core processor Graphics Controller (rev 09) 00:16.0 Communication controller: Intel Corporation 6 Series/C200 Series Chipset Family MEI Controller #1 (rev 04) 00:1a.0 USB controller: Intel Corporation 6 Series/C200 Series Chipset Family USB Enhanced Host Controller #2 (rev 05) 00:1b.0 Audio device: Intel Corporation 6 Series/C200 Series Chipset Family High Definition Audio Controller (rev 05) 00:1c.0 PCI bridge: Intel Corporation 6 Series/C200 Series Chipset Family PCI Express Root Port 1 (rev b5) 00:1c.4 PCI bridge: Intel Corporation 6 Series/C200 Series Chipset Family PCI Express Root Port 5 (rev b5) 00:1c.5 PCI bridge: Intel Corporation 82801 PCI Bridge (rev b5) 00:1d.0 USB controller: Intel Corporation 6 Series/C200 Series Chipset Family USB Enhanced Host Controller #1 (rev 05) 00:1f.0 ISA bridge: Intel Corporation H61 Express Chipset Family LPC Controller (rev 05) 00:1f.2 IDE interface: Intel Corporation 6 Series/C200 Series Chipset Family 4 port SATA IDE Controller (rev 05) 00:1f.3 SMBus: Intel Corporation 6 Series/C200 Series Chipset Family SMBus Controller (rev 05) 00:1f.5 IDE interface: Intel Corporation 6 Series/C200 Series Chipset Family 2 port SATA IDE Controller (rev 05) 02:00.0 Ethernet controller: Realtek Semiconductor Co., Ltd. RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller (rev 06) 03:00.0 PCI bridge: Integrated Technology Express, Inc. Device 8892 (rev 41) 04:01.0 Ethernet controller: D-Link System Inc DGE-528T Gigabit Ethernet Adapter (rev 10)   Result of ls /etc/OpenCL/vendors/:  root@kmstehr:~# ls /etc/OpenCL/vendors/ ls: cannot access /etc/OpenCL/vendors/: No such file or directory


My wife is an Thai national with an Thai passport. She holds an spouse/partner leave to remain in the UK residence permit. Does she need to apply for a Schengen visa before travelling to France or any other Schengen countries? And if so does she need to apply for a separate Schengen visas for each planned trip (eg France in May, Austria in July, Malta in September etc)

I am a British national resident in the UK. My wife is Jordanian, resident in the UK with me. She has a UK biometric residency permit. We were married in the UK and the marriage is registered in the UK.   Does my wife need visas to travel with me on holiday in France and Spain? I understand from EU Directives that she does not. Would we be able to leave the UK by ferry to France if my wife does not have a French visa but can prove that she is married to me and resident in the UK? If visas are necessary but the French or Spanish consulates were NOT to grant the visas, would this be in contravention of EU Directives/Law? If the answer to question 3 is "Yes, it would be unlawful", what action can one take to get the visas?


I read in twitter that: $$\displaystyle\sum_{k\geq 0}^{} \binom{n}{2k} = \sum_{k \geq 0}^{} \binom{n}{2k+1}$$ So far I've noticed that if $n$ is odd then $n=2k+1$ and we have that $$\binom{2k+1}{k-i} = \binom{2k+1}{k+1+i} $$ for $i= 0,1,\dots,k$  Since we must have that one of $k-i$ , $k+1+i$ must be odd and the other even for all $i=0,1,\dots,k$ then we must have that $$\displaystyle\sum_{l\geq 0}^{} \binom{2k+1}{2l} = \sum_{l \geq 0}^{} \binom{2k+1}{2l+1}$$ I don't know what to do when $n$ is even or if there's a way to prove this without breaking it into cases.

Let $A$ be a non-empty set and $n$ be the number of elements in $A$, i.e. $n:=|A|$.  I know that the number of elements of the power set of $A$ is $2^n$, i.e.  $|\mathcal{P}(A)|=2^n$.  I came across the fact that exactly half of the elements of $\mathcal{P}(A)$ contain an odd number of elements, and half of them an even number of elements.  Can someone prove this? Or hint at a proof?


Which is the correct version, Rebels Outpost or Rebel Outpost? Doesn't the "s" signify that its multiple rebels? And rebel meaning "To rebel"? Rebel could also be used as plural couldn't it, in third person context? Used in a sentence. Become part of the Rebels Outpost team or Become part of the Rebel Outpost team.

Is the singular or plural form of a property required when describing an object which has a count of N for that property?  For example, a two-mode or a two-modes analog filter?


I want to prove the following, however, not sure where to start.  $\int\Phi(a)\mathcal{N}(a|\mu,\sigma^2)da=\Phi\left(\frac{\mu}{\sqrt{1+\sigma^2}}\right)$  Where $\Phi(\cdot)$ is the probit function, defined as $\Phi(a)=\int_{-\infty}^a\mathcal{N}(x|0,1)dx$

I'd like to prove the following but not sure where to start:  $$\int_{-\infty}^\infty\int_{-\infty}^a\frac{1}{\sqrt{2\pi}}\exp\left(-\frac{x^2}{2}\right)dx\frac{1}{\sqrt{2\pi\sigma^2}}\exp\left(-\frac{(a-\mu)^2}{2\sigma^2}\right)da\\ =\int_{-\infty}^{\frac{\mu}{\sqrt{1+\sigma^2}}}\frac{1}{\sqrt{2\pi}}\exp\left(-\frac{x^2}{2}\right)dx$$  Note that the hard part is due to the fact that the $a$ is a variable limit,   If it helps, the first term inside the integral is $\mathcal{N}(x;0,1)$ the second term is, $\mathcal{N}(a;\mu,\sigma^2)$


Task Manager shows my total memory usage at 90% of my 6 GB total, but no single process is using more than 250 MB RAM, and the sum of RAM use of all running processes is less than 2 GB. I've tried:   Looking at the numbers in the "Memory" column on the "Processes" tab of Windows 8 Task Manager. Looking at the "Working Set", "Private Working Set", "Shared Working Set", and "Commit Size" columns on the "Details" tab of Task Manager. Looking at similar memory-related columns in Process Explorer. I've tried running Sysinternals RAMMap, but while I'm having the low-memory crisis, it crashes at launch. Once I resolve the problem, RAMMap runs normally, but at that point it's too late.   All show a pretty small amount of memory being used.  There are lots of people asking variants of this question, with various versions of windows, all over the Internet. Some of them manage to solve their low-memory problems, often by re-installing software; sometimes by re-installing windows from scratch. I'm looking for an answer to the general questions that these all share, and that never seem to get answered elsewhere:   Why is total used memory much higher than the memory used by all listed processes, no matter how I try to count them? How could windows "know" that memory is used without knowing what program is using it? What processes might possibly use up memory but not show up on the list? Is there any software out there that can give more information about used memory?   Details specific to my own problem: Since upgrading to Windows 8.1, The problem occurs as soon as I log in. I run out of memory as soon as I ran any program. I noticed in Process Explorer that several instances of iexplore.exe were running, apparently started automatically. One particular instance was only using a few MB of RAM, but showed hundreds of millions of page faults. On a whim, I killed that specific process, and memory usage immediately dropped by 70%.  Leading to one specific question:   How could killing one process that supposedly only used a few MB free up several GB?   And a (presumably hard) bonus question:   Short of re-installing Windows, how might I avoid having to go through this every time I reboot my computer?

I have noticed this on many different Windows machine, on many different occasions: the RAM usage reported by Task Manager or Resource Monitor often seems to add up to an amount which is significantly lower than the actual amount in use.  For example, many times on my laptop or my desktop, I have seen something like 7GB in use, and yet the total of the Working RAM Set is more like 3GB. I just can't figure out where it's being used!  Here's an extreme example I noticed today in Resource Monitor on a server:    If you right-click the image and open in a new tab, and view the numbers, you'll notice that the Working Set (which doesn't include nonphysical virtual memory) add up to about 1.7GB. I get similar numbers by adding up RAM usage in Task Manager when "Show processes from all users" is enabled.  Now here's a screenshot of task manager's Performance tab:    This says 7.6GB of physical memory is in use.  I see this all the time, on personal computers, laptops, and now servers: the total RAM usage reported by system tools only accounts for about 1/4 of the RAM usage I observe. WTF is going on???  Is there any satisfying explanation of where all my RAM is? What is gobbling it up, and why is it leaving no trace?  EDIT: Here's a picture of the graphical RAM use, as user whs asked for:    EDIT 2: In response to James' response, here's a picture of the nonpaged processes in poolmon.exe, sorted by size:    These results confuse me. poolmon correctly states that I have 6GB of nonpaged pool in use, but all the nonpaged pool processes are less than 8MB in size.  What could this mean? Is poolmon failing to detect some of the processes using the nonpaged pool?


I have a dataset of 223 multilabels. I'm sure some of those labels are correlated so I want to merge them. For that I'm using sklearn tSNE to reduce the dimensions.  How can I "describe" the new dimensions in terms of the former ones, I need something like this:  0.5(rock) + 0.1(pop)       generated popRock     0.2(rock) + 0.5(christian) generated christianRock

I'm currently trying to wrap my head around the  math. Unfortunately, there is still one question I can't answer satisfactorily: What is the actual meaning of the axes in a t-SNE graph? If I were to give a presentation on this topic or include it in any publication: How would I label the axes appropriately?  P.S: I read  Reddit question but the answers given there (such as "it depends on interpretation and domain knowledge"), don't really help me to understand this.


I understand when we say current, we mean charge (protons/electrons) passing past a point per second. And the charges have energy due to the e.m.f. of the power supply.  Now tell me, if a lamp has resistance and you hook it in the circuit, how will the current stay the same? The charges obviously lose energy in the lamp and so become SLOWER, which should mean current decreases, right?  [Edit] All answers explained a bit of everything, so it was hard to choose one. If YOU are looking for an answer, please check the others too, in case the accepted one doesn't answer your question.

It took me a long time to understand that current is constant throughout the circuit. And now I am stuck at one last thing: The speed of charge. Here is what I am thinking:  Current is defined as quantity of charge passing through a point at a given time, and from this we can deduce that current is constant throughout a circuit. But, if this is true, then wouldn't the speed of charge through a resistor be increased? Let us think about an analogy, water flowing through a pipe. Suppose water is flowing through a broader pipe(analogous to a less-resistance wire), and  a greater quantity of water can flow past a point because of larger cross-sectional area. Now, suddenly water encounters a smaller pipe(analogous to the resistor). So, less quantity of charge can flow through it because of less cross-sectional area. But, if the volume of water flowing in a time $T$(analogous to current) is same, won't the rate of flow of water in the narrower pipe(the resistor) be more?  I am asking this question because while seeing some answers for the question that "Why is current constant?" , I saw some people saying that speed of charge slows down a bit through a resistor, which seems incorrect to me.


I have just installed Ubuntu 16.04.1 LTS on my Desktop PC that has a built in wireless adapter in the motherboard (Broadcom 802.11ac 14e4:43b1).  Right now I do not have the installation disk nor access to ethernet so the below post did not work for me.   I found this drivers   and i am wondering how do i install this offline.   Please help, I am a complete beginner and would be really helpful if you can elaborate.  Thanks Avinash

I have installed Ubuntu alongside Windows 8.1. But the wifi is not working in Ubuntu (perhaps the drivers are not present), which worked fine in windows. Also I cant connect with Ethernet since my laptop does not have an Ethernet port. So is there any way for me to connect to the internet in ubuntu? Edit: Output of the terminal command  lspci -knn | grep Net -A2:  vikram@vikram-Inspiron-11-3148:~$ lspci -knn | grep Net -A2 01:00.0 Network controller [0280]: Broadcom Corporation BCM43142 802.11b/g/n [14e4:4365] (rev 01)     Subsystem: Dell Device [1028:0018]     Kernel driver in use: bcma-pci-bridge vikram@vikram-Inspiron-11-3148:~$    I did what Pilot6 suggested. Here is the output:    vikram@vikram-Inspiron-11-3148:~$ sudo dpkg -i *.deb [sudo] password for vikram:  Selecting previously unselected package bcmwl-kernel-source. (Reading database ... 163804 files and directories currently installed.) Preparing to unpack bcmwl-kernel-source_6.30.223.141+bdcom-0ubuntu2_amd64.deb ... Unpacking bcmwl-kernel-source (6.30.223.141+bdcom-0ubuntu2) ... Selecting previously unselected package dkms. Preparing to unpack dkms_2.2.0.3-1.1ubuntu5.14.04_all.deb ... Unpacking dkms (2.2.0.3-1.1ubuntu5.14.04) ... Setting up dkms (2.2.0.3-1.1ubuntu5.14.04) ... Setting up bcmwl-kernel-source (6.30.223.141+bdcom-0ubuntu2) ... Loading new bcmwl-6.30.223.141+bdcom DKMS files... First Installation: checking all kernels... Building only for 3.16.0-30-generic Building for architecture x86_64 Building initial module for 3.16.0-30-generic ERROR (dkms apport): kernel package linux-headers-3.16.0-30-generic is not supported Error! Bad return status for module build on kernel: 3.16.0-30-generic (x86_64) Consult /var/lib/dkms/bcmwl/6.30.223.141+bdcom/build/make.log for more information. modprobe: FATAL: Module wl not found. update-initramfs: deferring update (trigger activated) Processing triggers for man-db (2.6.7.1-1ubuntu1) ... Processing triggers for initramfs-tools (0.103ubuntu4.2) ... update-initramfs: Generating /boot/initrd.img-3.16.0-30-generic vikram@vikram-Inspiron-11-3148:~$


New for oracle, Facing compile time error while making procedure , so could anybody help me to rectify that error.  Code Snippet:  Create or replace Procedure prc_DropUselessTables(userID number:=0) as ncount number:=0; Begin  Select count(*) from User_Tables where table_name='DummyTable';  if(ncount>0) then  Drop table DummyTable;----Error Line  end if;  end prc_DropUselessTables;   Thanks

When I run the following in an Oracle shell it works fine  truncate table table_name   But when I try to put it in a stored procedure  CREATE OR REPLACE PROCEDURE test IS BEGIN     truncate table table_name; END test; /   it fails with  ERROR line 3, col 14, ending_line 3, ending_col 18, Found 'table', Expecting:  @   ROW  or   (   or   .   or   ;   :=   Why?


I would like a certain cell of mine to display today's date when I starts a new row.   Is it possible?

I've got a spreadsheet in Google Drive and one column is meant for the date the entry is made. Is there a button to do this? I'm aware of the functions =NOW() and =TODAY() but their description says "the value is updated when the document recalculates". However I reopened the document a few minutes latter and it still had the same time. Why is this?  It would be even easier that when I start typing in a new row the column for the date auto-populates.


I apologize if this has been answered already. I've spent several hours searching through the WordPress directories and documentation, and I haven't been able to find the code for the default Gutenberg blocks. Could anyone point me in the right direction? To clarify, I am specifically wondering where in the directory tree of a WordPress installation the blocks are defined.

Apparently, at one time, there was a directory of core-blocks for building Gutenberg templates on GitHub, but I'm not finding it anywhere. I talking about core/paragraph, etc.     array( 'core/paragraph', array(         'placeholder' => 'Content goes here',     ) ),     array( 'core/image', array(         ...  Thanks!


I am new to cryptography. As I was reading a note regarding S-box construction, I found a step mentioning multiplicative inverse of a number in the finite field GF(2^8). I couldn't understand it!! Can anybody help me by explaining the procedure(step by step) to find multiplicative inverse of a number(say 95 in hex) in the finite field GF(2^8) ?

I know how to do multiplication over ${\rm GF}(2^8)$:  uint8_t  gmul(uint8_t  a, uint8_t  b) {     uint8_t p=0;     uint8_t carry;     int i;     for(i=0;i<8;i++)     {         if(b & 1)             p ^=a;         carry = a & 0x80;         a = a<<1;         if(carry)             a^=0x1b;         b = b>>1;     }     return p; }   So, I tried to create a ${\rm GF}(2^8)$ multiplication table using this code. I've given below the values in the 3rd row of the table, but I don't think they're correct:      0  1  2  3  4  5  6  7   8  9  A  B  C  D  E  F 0 1 2   0  2  4  6  8  A  C  E  10 12 14 16 18 1A 1C 1E  3 . . E F   I don't know what went wrong. I built the table by multiplying the values in the first row with those in the first column.  E.g. in the third row, I multiplied 2 × 0, 2 × 1, …, 2 × E, 2 × F.  How can I create a multiplication table for arithmetic in ${\rm GF}(2^8)$?    Also, how can I find the multiplicative inverse of a number in ${\rm GF}(2^8)$?  For example, how can I determine that the inverse of 95 is 8A?  I tried to do this using the multiplication table above, but when I took 9th row and the 5th column in the multiplication table I got 2D, not 8A.


This is probably really simple, but currently I've been writing installer packages for OSX.   As of now, I was just writing things using specified paths that were always set (I.E /Users//Shared) But I'd like for these to run anywhere as long as the files are in the same directory.   Here is what I've been trying:  pushd `dirname $0` > /dev/null SCRIPTPATH=`pwd` popd > /dev/null  BASEDIR="$( dirname "$0" )"  dmgpath=$(cd "${0%/*}" && echo $PWD   All three of the above are different variations I've tried. I've found most of these here but none seem to work, not sure what I'm doing wrong. Here is a sample of actual code I'm working with:   dmgpath=$(cd "${0%/*}" && echo $PWD)  cp $dmgpath/<install>.plist /Library/Preferences installer -pkg $dmgpath/<Install.pkg> -target / shutdown -r now   I've tried a few things, but keep getting the same error return "path resolved to null value" or "directory not found", "command not found". I've tried placing "" around areas where I'm using the variable, but no go. Most of the scripts are like that.   First time posting here, but I've always found most threads to be super helpful! Thanks in advance!

How do I get the path of the directory in which a  script is located, inside that script? I want to use a Bash script as a launcher for another application. I want to change the working directory to the one where the Bash script is located, so I can operate on the files in that directory, like so: $ ./application


I'm trying to center the text along side the image with CSS. I thought the transform tag would center it along the image but that must've been for a different circumstance.    <!DOCTYPE html>               <meta charset="utf-8">
        Center text

Why won't vertical-align: middle work?  And yet, vertical-align: top does work.   span{   vertical-align: middle; }
      Doesn't work.


I have done many nice things for a relative (e.g. reorganize the outdoor deck space) and upon seeing whatever I try & do nice for her she replies "Good for Me!"    I find this offensive—am I wrong?  What is she actually saying when she says "Good for me", so I can explain it to her?

What does this phrase mean? And in what cases is it appropriate to use it?