What is the closest you've ever come to losing your life?   （From : ）  Apparently, it comes from the construction "come close to doing" , so "the closest" should be an adverb (in superlative degree) . But relative clauses cannot modify  an adverb.（I follow the CGEL by Quirk et al.）  Someone would view it as a NP where the noun has been omitted(the closest situation). But this analysis is also flawed, because a NP cannot fit in the relative clause that follows.  Is there a better idea ？

They had almost reached the door when a voice spoke from the chair   nearest them, "I can't believe you're going to do this.”   I guess nearest is at the place of preposition. Can a preposition have the form of superlative?


I know that capturing a near object and capturing the same object with going apart with zoom makes a lot of sense But I'm confused what change does it do to the picture??  Could anyone help me in this??

Why must you change your distance from an object to change your perspective of it? Why is it not sufficient to change the focal length of your lens (the zoom level) to change  your perspective?


I would like to know how to make quickly pairwise comparisons of regressions coefficients across three or more groups in R. Here is a small example:  library(car) data(iris) scatterplot(Sepal.Width~Sepal.Length | Species, regLine=TRUE,              smooth=FALSE, boxplots=FALSE, by.groups=TRUE, data=iris)   As you can see here, two groups seem to have approximately the same regression coefficients, whereas the third one exhibits a clearly different relationship between the two variables. I can make an Ancova, for example like this:  modComplete <- lm(Sepal.Width ~ -1 + Species + Species:Sepal.Length, data=iris) modSimple <- lm(Sepal.Width ~ Sepal.Length, data=iris) anova(modComplete, modSimple)   However, this only tells me that at least two groups differ, and I have no information about pairwise comparisons. I would like to know if there are significantly different regression coefficients between each pair of groups. I think that it could be done using the function multcomp::glht but I am not familiar with it, and the help page is a little confusing to me.  Is there a quick way to do this?

I have been using scripts from package "Agricolae" but realised today that it compares only between the intercepts.   I expect that since i am testing for the interaction term using ANCOVA, the post-hoc test should do that as well instead of being a more general comparison. Or am i wrong? Are there are scripts/methods that does pairwise comparison for "slope" and "intercept"?? If Scheffe is not available, what is the next best option for unequal sample sizes?


I have found the following excercise: "If X is a non-negative,discrete random variable,taking integer values,find the minimum possible value of $P([X=0])$ given that $E[X]=1$,$E[X^2]=2$ and $E[X^3]=5$ I have tried using Chebyshev's inequality or Markov's inequality but i cannot find a suitable lower bound for $P([X=0])$ and much more i cannot find the minimum possible value for $P([X=0])$ (and what assures us that there is a minimum value and not an infimum ?)

If $Y$ is a non negative integer-valued random variable with $E[Y]=1$, $E[Y^2]=2$ and $E[Y^3]=5$ ,where  $E$ is the average value of $Y$. Find the minimum value of the possibility $P[Y=0]$. I know that $E[Y]=\sum^{n}_{i=1}y_{i}p(y_{i})$ and $E[Y]=\sum_{y:p(y)>0}yp(y)$. I know that Markov's inequality is : $P[Y\geq a] \leq\frac{E[Y]}{a}$ I know that  Chebyshev's inequality is : $P(|Y-E[Y]|\geq k)\leq \frac{Var(Y)}{k^2}$ The book I'm studying is the : A first course in probability 8th edition , Sheldon Ross


If you write a 1 line shell script that forks a process, like the following: for i in {1..1000};do ./binary & done It runs, you don't need a semicolon, and if you try to use a semicolon it throws a syntax error. In a normal loop, without forking, you need the semicolon for it to work in a 1 line script. Why does the fork operator change how this works?

How can one run multiple programs in the background with single command?  I have tried the commands below, but they do not work.  nohup ./script1.sh & && nohup ./script2.sh & -bash: syntax error near unexpected token '&&'  nohup ./script1.sh & ; nohup ./script2.sh & -bash: syntax error near unexpected token ';'


My iPhone (iOS 12.3.1) takes pictures in HEIC / HEIF format.  I have an older Macbook (13" mid-2009) with MacOS El Capitan, which includes Photos v1.5.  When my iPhone photos get synced via iCloud to the Macbook, the thumbnails show up fine, but when I click on the photo, a large grey exclamation mark is shown.  What settings should I change to ensure they're also viewable in El Capitan Photos 1.5?  Please note that I'm not looking for another tool to run manually prior to each sync, as suggested in the "Duplication Question" suggestion.  I'm just looking for a set of configuration settings that others are using successfully, to take pictures on the iPhone using HEIC / HEIF, and view automatically (i.e. without using another tool manually) on my Macbook El Capitan.

So, here’s the thing. I have a new iPhone and an old Mac. iOS 11 (still in beta as of today) and El Capitan (no more updates for this Mac). I use iCloud photo library in both devices. When I take a photo in the new format with my iPhone 7, is there any way to use it right away in my mac, without having to convert it in my iPhone first? I mean, can I get those photos synced through iCloud and converted locally on my Mac?  I have tried to find a third party software that could do that kind of conversion, but was not able to find any that would work on El Capitan. Any idea?


I am an Indian citizen and would be highly thankful if anyone could suggest me a better option.  My husband initially got a short term work visa to work in U.K., so I applied for a family visitor visa and I got rejected on the basis that I may not return until my husband's visa expires. I didnt. Now after a month or two he needs to attend U.S. on an H1B visa to work there for the same company.  He is planning for me to apply for a dependent visa along with him but he is worried that there may be an impact on my dependent visa as I have a rejected U.K. visa application. Is there really impact on U.S dependent visa based on the rejected UK family visitor visa? If there is any impact, I would like to plan to reapply U.K. visa.

UK visitor's visa was denied because a residence visa application had been refused previously, about 4 years ago. Now will it have any impact on a US visitor's visa application result?


I hava a question about *args and **kwargs. I know that they are used when you do not know how many arguments will be passed to function. But can it be a substitute for some arguments that are actually required when I do not know what those are?   If there is a function:  def functionName(a, b):     ...some code...     doSomethingUsing(a)     doSomethingUsing(b)   If I do not what arguments does the function take can I simply use functionName(*args, **kwargs) - or functionName(*args)? I noticed that some people tend to use it that way - but I am not sure if this is how * and ** work in python?

In the following method definitions, what does the * and ** do for param2?  def foo(param1, *param2): def bar(param1, **param2):


If you sign up for an Apple ID with a non-apple email account (gmail, etc.) can you still sign up for iCloud email aliases (alias@icloud.com)?

Set up a new iCloud account for someone and I am not seeing the option to set up an @icloud.com address and use the free email service. Does anyone know if this is still possible and how to go about doing this?


Is there any way to add version history link (bellow code) on displayform.aspx as a content webpart?  version history

Is there any way how to insert "Version History" button from Ribbon to page or displayform.aspx in SP List?  Thanks a lot. Dominik


I created a path connecting different segments and than I created the 3D effect using the command extrude & bevel Do you know how I can fix the imperfections (in the 3d effect and in the connections among the segments) you see in the screenshot?

I have created a logo with pen tool in Illustrator but between lines (where they intersect with each other) there is a gap where it gets the color of the background.  Something like this:  (Black color is the background color) - As you can see where the paths join each other there is a kinda dotted black line. I Grouped them but still the same. I converted to jpeg just to be sure it is not only shown like that but same effect.   NOTE: I want to export that logo as SVG file type and use it in the WEB. I tried some solutions given like anti-aliasing in preferences or art optimize when saving for optimization. But still I have same problem. I want to get that logo in SVG and put it on the web where it will display clean without those strange gaps.  How can i get rid of this?


I'm trying to prove this statement for this sequence as a part of a larger proof.  The specific sequence I'm looking at is : $b_{n+1} = 1+\dfrac{1}{b_n}$, where $b_1 = 2$. I'm attempting to show that ($b_{2n}) \rightarrow A \land (b_{2n-1}) \rightarrow B \implies A=B$. I know that this statement is not true in all cases, e.g. if $b_n = (-1)^n$. For this reason, I think I might have to use the fact that for this specific sequenence, $(b_{2n})$ is monotonic increasing and $(b_{2n-1})$ is monotonic decreasing.  Note that I am not assuming that $(b_n)$ converges from the start, and I am not trying to show that it converges to the same value as the subsequences. Is the statement: "if the odd and even sequences converge, where one is decreasing and the other is increasing, then they converge to the same limit" even true in general? If so, how do I go about proving it? I'm completely stuck on how to proceed with the information that I seem to have.

If $a_n$ is a non decreasing sequence and $b_n$ is a non increasing sequence, and $a_n \leq b_n$ for all $n$, this is this sufficient condition for concluding that they both converge to the same limit.   If no, what else is needed?


Let $T:\mathbb R^2 \to \mathbb R^2$ be distance preserving, i.e., $|T(a)-T(b)|=|a-b|$ for all $a,b\in \mathbb R^2.$ From here can we say the exact form of $T$?   If $T(x)=Ax+b,$   where $A^TA=I$ and $x,b\in \mathbb R^2$ and $b$ is fixed, then $T$ is distance preserving.  But my question is that 'Can we say that the above mentioned mappings are only distance preserving map?'

Let $V=\mathbb{R}^2$ be an inner product space with the standard inner product, and let $T$ be a rigid motion of $V$. Suppose $T(0)=0$, prove that $T$ is linear.  (A rigid motion of an inner product space is a function (not necessarily linear) $f:V \to V$, such that $||f\alpha-f\beta||=||\alpha-\beta||$.)  It is obvious that $T$ preserves the inner product (T is unitary), but I don't know how to prove that $T$ is linear. Thanks in advance


I have literally just installed Kubuntu to see what it is all about. I am a total newbie and have tried to install a programme called uGet.  I managed to download it but don't know where to go from there. I have been reading the forums and have tried Discover, but uGet is not available there so have tried a few things in bash, but no luck (please see below). Any help greatly appreciated.  nleric@nleric-SATELLITE-L50-C:~$ sudo apt-get install synaptic [sudo] password for nleric:  E: Could not get lock /var/lib/dpkg/lock - open (11: Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/), is another process using it?  nleric@nleric-SATELLITE-L50-C:~$ sudo apt-get install synaptic Reading package lists... Done Building dependency tree        Reading state information... Done Package synaptic is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source E: Package 'synaptic' has no installation candidate  nleric@nleric-SATELLITE-L50-C:~$ sudo apt-get install uGet [sudo] password for nleric:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package uGet  nleric@nleric-SATELLITE-L50-C:~$ sudo apt-get install software-center Reading package lists... Done Building dependency tree        Reading state information... Done Package software-center is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source E: Package 'software-center' has no installation candidate

How do I get to the Universe Repository in supported versions of Ubuntu?


Is it true that if $S$ is noetherian then $A^{-1}S$ is also noetherian for $A$ a multiplicative closed set? A multiplicatively closed set implies closure under multiplication and inclusion of multiplicative identity. In addition the ascending chain condition of noetherian ring says that we have a sequence of ideals $\ldots -I_n\subseteq I_{n-1}\subseteq\ldots-I_2\subseteq I_1\subseteq S$ such that $I_n=I_{n=1}$ for some $n$. Then, does it imply that for the ring $A^{-1}S$, we multiply all the ideals by $A^{-1}$ to get an ascending chain condition? Will this do to prove that $A^{-1}S$ is noetherian? Or are there quick counterexamples?  Any hints? Thanks befrehand.

This is an unproven proposition I've come across in multiple places.   Suppose $A$ is a commutative Noetherian ring, and $S$ a multiplicative subset of $A$. Then $S^{-1}A$ is Noetherian.  Why is this? I thought about taking some chain of submodules $$ S^{-1}M_1\subset S^{-1}M_2\subset\cdots $$ and pulling back to a chain  $$ M_1\subset M_2\subset\cdots $$ of submodules of $A$ which must eventually stablize. Is there more to it than this? I kind of wary of assuming all submodules of $S^{-1}A$ have form $S^{-1}M$ for $M\leq A$.


In 2011, I went to Bournemouth to study English, but I overstayed for almost 4 months after my visa expired. It has been 5 years since I left the UK.  Now, I would like to apply for a visa, to visit a friend, but I'm afraid to risk a refusal. Will my overstay affect an application for a tourist visa?

I was on a student visa in UK. My visa got expired and I overstayed 3 yrs more in addition to my visa. So in simple I stayed 3 yrs as illegal in the UK. Then I came back to my country deliberately. Remember I was never caught and deported. Is there any ban on me? Or is there? Will it affect my visa application for other countries. My passport is clean. There is no  exit stamp on it. Because it was expired when I came back and I made temporary travel document from my home country embassy. So am I eligible to travel to UK or other countries again?


I am having this error when running the below code trying to parse the website using JSoup.  ERROR  java.lang.RuntimeException: An error occurred while executing doInBackground()  Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'org.jsoup.select.Elements org.jsoup.nodes.Element.getElementsByTag(java.lang.String)' on a null object reference   The website doesn't have table with the specified id (getElementById('ctl00_ContentPlaceHolder1'). How to fix this exception where the table isn't present?  CODE  @Override protected Void doInBackground(Void... voids) {     try {         Document evalPage = Jsoup.connect("http://site.example.com")                 .cookies(loginCookies)                 .timeout(30 * 1000)                 .execute().parse();         //TODO FIX THE NO TABLE REFERENCE          table = llPage.getElementById("ctl00_ContentPlaceHolder1").getElementsByTag("table").get(2);      } catch (IOException ex) {         ex.printStackTrace();         parsingSuccessful = false;     }     return null; }

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


Full Problem: A continuous-time Markov chain has generator matrix  $$Q=     \begin{pmatrix}     -1 & 1 & 0 \\     1 & -2 & 1 \\     2 & 2 & -4 \\     \end{pmatrix} $$  (i) Exhibit the transition matrix of the embedded Markov chain.  (ii) Exhibit the holding time parameters for each state.    OK, I must be misunderstanding something. I have the following for the embedded chain transition probabilities:  $$P_{ij} = \frac{q_{ij}}{q_i}$$  where $q_i$ is the parameters of the exponential length of time that the process stays in i.  The problem is that I know $q_i$ is the minimum with exponential distribution and parameter $\sum_k q_{ik}$.  But when I calculate $P_{11}$ that gives me $-1$ which is impossible..  Obviously there is an error in my thinking but can anyone shine light on what I'm misunderstanding? Thank you greatly in advance.

I' am reading  by Lawler and I' am a bit confused how demonstrates you get the transition matrix $\textbf{P}_t$ from the infinitesimal generator $\textbf{A}$. I'll provide the example in the book:  $\textbf{Example 1.}$ Consider a chain with two states, (0,1). Assume $\alpha(0,1)=1$ and $\alpha(1,0)=2$. Then the infinitesimal generator is  $$\textbf{A}=\left[\begin{array}{cc} -1 & 1 \\ 2 & -2 \end{array}\right]$$  In order to compute $e^{t\textbf{A}}$, we diagonalize the matrix. The eigenvalues are 0, -3. We can write  $$\textbf{D}=\textbf{Q}^{-1}\textbf{A}\textbf{Q}$$  where  $$\textbf{D}=\left[\begin{array}{cc} 0 & 0 \\ 0 & -3 \end{array}\right],\textbf{Q}=\left[\begin{array}{cc} 1 & 1 \\ 1 & -2 \end{array}\right], \textbf{Q}^{-1}=\left[\begin{array}{cc} 2/3 & 1/3 \\ 1/3 & -1/3 \end{array}\right]$$  We use the diagonalization to compute the exponential $e^{t\textbf{A}}$.  \begin{align} \textbf{P}_t&=e^{t\textbf{A}}=\sum_{n=0}^{\infty}\frac{(t\textbf{A})^n}{n!} \\ &=\sum_{n=0}^{\infty}\frac{\textbf{Q}(t\textbf{D})^n\textbf{Q}^{-1}}{n!} \\ &=\textbf{Q}\left[\begin{array}{cc} 1 & 0 \\ 0 & e^{-3t} \end{array}\right]\textbf{Q}^{-1} \\ &=\left[\begin{array}{cc} 2/3 & 1/3 \\ 2/3 & 1/3 \end{array}\right] + e^{-3t}\left[\begin{array}{cc} 1/3 & -1/3 \\ -2/3 & 2/3 \end{array}\right] \end{align}  What I don't understand is what the second to last line is not,  $$\textbf{Q}\left[\begin{array}{cc} 1 & 1 \\ 1 & e^{-3t} \end{array}\right]\textbf{Q}^{-1} $$  Though I tried it out and it would not provide a valid stationary distribution.


Let $X$ have standard deviation $\sigma$ and $Y$ standard deviation $\tau$.  I can write $$P(X>0\mid X+Y>0) = \frac{P(X>0, X+Y>0)}{P(X+Y>0)}$$ As all variables are zero-mean and symmetric, $P(X+Y>0)=1/2$, so that $$P(X>0\mid X+Y>0) = 2 P(X>0, X+Y>0) = 2 P(X>0, Y>-X)$$ Using the independence of $X$ and $Y$ and the notation $\Phi$ and $\phi$ for the standard normals, I get $$P(X>0\mid X+Y>0) = 2 \int_0^\infty \phi\left(\frac{x}{\sigma}\right) \left(1-\Phi\left(-\frac{x}{\tau}\right)\right) dx.$$ But from here on I do not know how to continue to get a simple expression.  Any suggestions?

There are two Random Variables X and Y. Both of them are Normally distributed with 0 mean and variance a and b respectively. X and Y are independent of each other.  What is the probability of   What should be the easiest way to do this?


I hold a valid Indian passport and I would be travelling to the USA (from India) with a valid US Visa the coming weekend. I have a long layover of 10 hours at the LHR terminal 5. I would like to roam around London a bit for few hours using the underground tube. My question is if I need a transit visa for going out of the airport and getting back again. Needless to say I would be passing through the customs and immigration of UK border control.   Please respond ASAP.  Avik, India.

I am an Indian citizen. I am going to study in Canada with a study-permit. I am planning to have my flight via London. I've a layover there at London for almost 9 hours. Is it wise to visit the city for 4-5 hours during the layover? Additionally do I need a Transit Visa to visit the city? or do I need a General Visitor Visa for this short-trip at London?  Edits: Arriving and departing both the flights are from London Heathrow airport.  DATV suggests that if I am heading to Canada, I don't need DATV.   Visitor in Transit Visa suggests that I can pass border control with this Visa. I may also get a Transit without Visa concession if I satisfy this three:   you arrive and depart by air have a confirmed onward flight which leaves within 24 hours have the right documents for your destination (eg a visa for that country)   And I am also heading to Canada, this also can help me to get this concession.  So, do I need a Visitor in Transit Visa to visit the city? At least website suggests that. However, I'm not sure as no one can tell it with confirmation. Hope someone helps out here.


I had worked with DirectX 9 approximately 8 years ago and one question has been opened till now. why Microsoft use struct for their entities instead of class? what is the benefit? I know class and struct are same(except default access specifier) and always I think the class is the meaning of object-oriented programming(because every people who know every language know class as OOP), but it seems Microsoft maybe don't think so.  again I want to emphasize that I know what is the difference between class and structure(only default access specifier differ)  A picture from one definition in directx 9.0:

This question was .  Now I'd like to learn the differences between a struct and a class in C++. Please discuss the technical differences as well as reasons for choosing one or the other in OO design.  I'll start with an obvious difference:   If you don't specify public: or private:, members of a struct are public by default; members of a class are private by default.   I'm sure there are other differences to be found in the obscure corners of the C++ specification.


Consider this post: . I asked the question on Stack Overflow erroneously, but I want it to migrate to .  I have already raised a flag for moderator's attention to migrate this question. Is it OK?

I posted a question which was closed as off-topic and it seems like it could fit on another site in the network. How can I go about moving it there?   What is migration? When can a question be migrated, and who can migrate it? When should I consider migration, and when is it inappropriate? What causes a migration to be blocked and what happens after? What causes a migration to be rejected and what happens after? Anything else I should know about migration?


I've been using Ubuntu 15.0 without problems for a couple of months, but now it has started freezing.  The screen freezes, the mouse cursor freezes, and the audio stops. My only option, as far as I know, is to shut the computer down by holding the power button.  It never freezes while left alone, nor while watching videos on VLC. It does freeze, seemingly randomly, while watching videos or listening to podcasts through my browser. Typically while using SoundCloud or YouTube. Also while navigating web pages.  I've done upgrade/update and tried using a different browser, but the problem keeps occurring. Perhaps it only seems as though the browser is the cause, because I'm using it nearly constantly.  The freeze occurs every 15 minutes or so when in active use.  Appreciate any advice.

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


Observations of the universe make us think matter is much more common than antimatter, and I believe no "probably-antimatter planets" have been found. But, if Pluto, for example, somehow were mainly antimatter, would that contradict any specific observation? Is it simply a judgment based on whether we see high-energy photon emissions (signifying matter-antimatter annihilation) from the planet?  If so, do we get enough data from Pluto to be confident? (I'm just curious if Antimatter Pluto could be a believable science fiction movie and can't decide despite answers  and .)

Ordinary matter and antimatter have the same physical properties when it comes to, for example, spectroscopy. Hydrogen and antihydrogen atoms produce the same spectroscopy when excited, and adsorb the same frequencies. The charge does not make a difference in the potential (regardless if it's generated by a proton or an antiproton) nor in how the positron behaves in this potential (being its mass equal to the mass of an electron)  How can astronomy evaluate if a far galaxy is made of matter or antimatter, given that from the spectroscopy point of view, they behave in the same way? In other words, how do we know that an asymmetry exists between matter and antimatter in the universe?


I do prepare some standalone tikz pictures, which later I want to combine in a 'subfigure' style. Is it possible to put tikz pictures, drawn in absolute coordinates, into nodes, and combine them the usual way; or is there a better idea?

Sometimes, nesting tikzpicture environments seems inevitable, e.g., if you want a node to contain a TikZ picture on its own. () However, nesting tikzpicture environments is , also because the inner environment  from the surrounding tikzpicture environment.  In a comment to a , Martin Scharrer has suggested that     a command [that resets all TikZ/PGF attributes] would be very difficult to maintain, because all TikZ attributes would need to be set with it explicitly.   Is there a way, with the current implementation, to save/restore all of TikZ/PGF's internal state, in order to apply it to a nested tikzpicture environment? If not, what would be really necessary to implement a "clean start with default values" for nested tikzpicture environments? Any thoughts?


I am an Egyptian man married to an Italian woman. We live in Italy. I have a residence card for a family member of a union citizen issued from Italy. Is it possible to travel with my wife to uk without a visa?!

I'm married to an Italian, I'm an African living in Italy with permanent stay. Can I travel to UK without a visa?


I am using buthesis format for my thesis. I want introduction and results chapter not to be numbered but when I use \chapter* it didn't show up in the table of content at all. Any suggestions?

I'm using the report document class for a thesis, and I need to add things like "Acknowledgements" and an "Introduction". I noticed that there is an \abstract command which would have been wonderful if applied similarly. How do I add these without messing up the chapters' numbering while being picked up by the ToC in proper order and page numbering?


if I have a JSON object say:  var myObj = {'test' : {'key1' : 'value', 'key2': 'value'}}   can I remove 'key1' so it becomes:  {'test' : {'key2': 'value'}}

Say I create an object as follows: let myObject = {   "ircEvent": "PRIVMSG",   "method": "newURI",   "regex": "^http://.*" };  How should I remove the property regex to end up with new myObject as follows? let myObject = {   "ircEvent": "PRIVMSG",   "method": "newURI" };


I want to derive this formula $$r_1^2.r_2^2.r_3^2.....r_n^2=r^{2n}+c^{2n}-2r^nc^n\cos(n\theta)$$ where $r_1, r_2, r_3....r_n$ are distances of a Point $P(r,\theta)$ from equally spaced n points, say $A_1, A_2, A_3....A_n$ on a circle of radius $c$ with $O$ as the centre of the circle as well as the origin As the circle is divided into n equal part, we can say $$\angle A_1OA_2=\angle A_2OA_3=.....\angle A_{n-1}OA_n=\frac{2\pi}{n}$$ Therefore each of these points can be written as, $$A_k=ce^{i(k-1)\frac{2\pi}{n}}\quad\forall\;k=1,2,3...n$$ Now I can write $$r_k=|re^{i\theta}-ce^{i(k-1)\frac{2\pi}n}|$$ Now I was thinking of using $|u||v|=|uv|$, so the product can be written as $$\prod_{k=1\to n} r_k^2=|(re^{i\theta}-c).(re^{i\theta}-ce^{i\frac{2\pi}{n}}).(re^{i\theta}-ce^{i\frac{4\pi}{n}})....(re^{i\theta}-ce^{i(n-1)\frac{2\pi}{n}})|^2$$ $$\implies \prod_{k=1\to n}r_k^2=|r^ne^{n\theta}-r^{n-1}e^{i(n-1)\theta}*c\left(\sum_{k=1\to n}e^{i(k-1)\frac{2\pi}{n}}\right)+r^{n-2}e^{i(n-2)\theta}*c^2\left(\sum_{k_1=1\to n, k_2=k_1+1\to n}e^{i(k_1-1)\frac{2\pi}{n}}e^{i(k_2-1)\frac{2\pi}{n}}\right)+.....(-1)^nc^n\prod_{k=1\to n}e^{i(k-1)\frac{2\pi}{n}}|^2$$ Now, how do I proceed from here? Do I have to reduce all the exponential in brackets to simpler forms. For example some are coming out to be simple, $$\begin{align} \sum_{k=1\to n}e^{i(k-1)\frac{2\pi}{n}} & =1+e^{i\frac{2\pi}{n}}+e^{i\frac{4\pi}{n}}+e^{i\frac{6\pi}{n}}+.....e^{i\frac{(n-1)2\pi}{n}} \\ & = \frac{1*\big((e^{i\frac{2\pi}{n}})^n-1)}{e^{i\frac{2\pi}{n}}-1} \\ & = 0 \end{align}$$ or the last one $$y=\prod_{k=1\to n}e^{i(k-1)\frac{2\pi}{n}}$$ $$ \begin{align} ln\,y &= 0+i\frac{2\pi}{n}+i\frac{4\pi}{n}+....i\frac{(n-1)2\pi}{n}\\ &=i\frac{2\pi}{n}(1+2+3+...(n-1))\\ &=i\frac{2\pi}{n}*\frac{(n-1)n}{2}\\ &=i(n-1)\pi \end{align}$$ $$ \implies y=e^{(i(n-1)\pi)}$$ Honestly, this seems to be a very tedious process, which is why I think I am wrong in my approach. Any help is appreciated

I want to find out the following product.  $\prod_0^{n-1}  (r^2 + a^2 -2ra\cos(2k\pi/n - \theta))$ I have been trying to use complex numbers but did not work out. The book I am reading the result is directly stated as $r^{2n} + a^{2n} -2r^na^n\cos(\theta)$. Please help.


Newbie on C language. I understand pointers and hex format but I'm not sure what '& 0x10'  is doing. Could someone kindly explain it or advise me on topics to research and teach myself. Thank you.  if(ptr1->name & 0x10) {      prt2->indicator1  |= 0x80;       }

I'm someone who writes code just for fun and haven't really delved into it in either an academic or professional setting, so stuff like these bitwise operators really escapes me.  I was reading an article about JavaScript, which apparently supports bitwise operations. I keep seeing this operation mentioned in places, and I've tried reading about to figure out what exactly it is, but I just don't seem to get it at all. So what are they? Clear examples would be great! :D  Just a few more questions - what are some practical applications of bitwise operations? When might you use them?


I'm still new to blender, and I have found a problem that I can't solve.  I'm importing some models to blender from a certain source, but when I use "Rendered" viewport and try to apply some lighting, sometimes I get inconsistencies with shadows/lights on some faces.  Here is an example with an arm (but the problem can also happen in other parts/models in major or lesser degrees):   As you can see there are abrupt changes with light and shadows between faces, but when I'm working with "Material" viewport all seems to be ok:  I have tried many things to smooth the mesh like: smooth vertex, faces or edges, clear custom split normals data, recalculate normals, remove doubles, auto smooth, subdivision surface, edge split and others things like different lighting configurations, but nothing really helps. The only thing that helps is applying subdivide smooth two or three times but it creates too many faces and that's probably a bad thing.  What could I do to fix this problem? So I'm able to use those models and apply light to them.  I'm using Blender 2.79 with Cycles Render  Here is the .blend file, I uploaded to Mega because Blend-Exchange was not working for me right now   Thanks in advance!

I've been modeling a hermit crab and I don't know why but some areas of the mesh are really dark on some spots, like the legs and the claws.   I hope you can help me fix it.


I have data in a .txt like this:  2   40 1   50 1   50 1   50 1   50 2   70 2   70 5   80 5   80 6   100   And I want to sum first column if the second column's rows match so I can get an output like this:  2   40 4   50 4   70 10  80 6   100   Thanks in advance!

I am trying to sum certain numbers in a column using awk. I would like to sum just column 3 of the "smiths" to get a total of 212. I can sum the whole column using awk but not just the "smiths". I have:  awk 'BEGIN {FS = "|"} ; {sum+=$3} END {print sum}' filename.txt   Also I am using putty. Thank you for any help.  smiths|Login|2 olivert|Login|10 denniss|Payroll|100 smiths|Time|200 smiths|Logout|10


What is the difference between the following commands:  $ input.txt > grep foo  $ grep foo < input.txt  $ cat input.txt | grep foo  $ grep foo input.txt   And not just grep. Other commands too.

I often see tutorials online that connect various commands with different symbols. For example:  command1 |  command2 command1 &  command2 command1 || command2     command1 && command2   Others seem to be connecting commands to files:  command1  > file1 command1  >> file1   What are these things? What are they called? What do they do? Are there more of them?    .


Let $\gamma:V\rightarrow V$ linear. with $\lambda_1,\ldots,\lambda_k$ his eigenvalues.  and $C_i=\ker(\lambda_i I_d - \gamma)$ for all $1\leq i\leq k$. Prove if $C=C_1+\cdots+C_k$ then $\dim(C)=\dim(C_1)+\cdots+\dim(C_k)$  Definition: $\gamma:V\rightarrow V$ is diagonalizable if the matrix associated to $\gamma$ is diagonal.  I have a idea of how prove this. Basically i need show  $\;\sum_{i=1}^k C_i=\bigoplus_{i=1}^k C_i$  I'm trying to generalize the idea with this:  Suppose that for $\;1\le i\neq j\le n\;$ , we have  $$x\in\ker (\lambda_iI-\gamma)\cap\ker(\lambda_jI-\gamma)\implies \gamma x=\lambda_ix=\lambda_jx$$  and since $\;\lambda_i\neq\lambda_j\;$ , we get that $\;x=0\;$ .   Moreover, as $C=C_1+C_2$ then  $C=C_1\oplus C_2$  but i have serious problem trying to generalize that. can someone help me?

Prove if $W=W_1+\cdots+W_k$ then $\dim(W)=\dim(W_1)+\cdots+\dim(W_k)$ I'm trying to prove this but is a little complicated for me. Can someone help me?


I would like to know how to remove the dot that amsthm adds after the number of the theorem (it gives Theorem 1.1. instead of Theorem 1.1 ).   MWE:  \documentclass{article} \usepackage{hyperref} \newtheorem{theorem}{Theorem}[section]  \usepackage{xpatch} \makeatletter \xpatchcmd{\@thm}{\thm@headpunct{.}}{\thm@headpunct{}}{}{} \makeatother  \begin{document} \section{Introduction}  \begin{theorem} Let ... \end{theorem}  \end{document}   gives     while  \documentclass{article} \usepackage{amsthm} \usepackage{hyperref} \newtheorem{theorem}{Theorem}[section]  \usepackage{xpatch} \makeatletter \xpatchcmd{\@thm}{\thm@headpunct{.}}{\thm@headpunct{}}{}{} \makeatother  \begin{document} \section{Introduction}  \begin{theorem} Let ... \end{theorem}  \end{document}   gives    It turns out that if \usepackage{hyperref} is not included, then adding  \usepackage{xpatch} \makeatletter \xpatchcmd{\@thm}{\thm@headpunct{.}}{\thm@headpunct{}}{}{} \makeatother   fixes the problem, but when it is then the problem is still there.   I need to use amsthm but I don't want the dot to appear.  Thanks in advance.

Instead of 1 Theorem. I want to write 1 Theorem in front of the first theorem and analogously in front of succeeding theorems. How can I get rid of the dot?  Here is a MWE:  \documentclass{article} \usepackage{amsthm} \swapnumbers \newtheorem{theorem}{Theorem} \begin{document} \begin{theorem} \end{theorem} \end{document}


What is the best way to say "With Mom and Dad's Love"   With Mom and Dad's Love With Mom's and Dad's Love   Option 1 sounds better, but I guess you could interpret that as Mom the person and Dad's love.

Which option is grammatical?        There will be readings from Nikki Giovanni’s and Alice Walker’s writings.   There will be readings from Nikki Giovanni and Alice Walker's writings.      Saying it out loud the latter sounds right, but looking at it the former looks better.


Looking at the links below, could somebody please explain how entanglement between Alice and Bob particles is established/deduced from Victor's choice/measurement? I understand that Alice and Bob can make measurements in any one of three bases (Left/Right, Vertical/Horizontal, Up/Down). What I don't get is how Victor's choice of entangled-state measurement or a separable-state measurement affects the interpretation of what Alice and Bob see. Could you walk me through it?   p.s. I don't have a physics degree and have done as much research as I can on my own. Please don't patronize. Kindly answer in non-technical terms if you can. Dumb it down for me. Thanks.

Here is the article by Ma et al.:  I have read many explanations on this site and others that emphasize that Victor's data is needed to make Alice and Bob's usable... Folks frequently mention: "that Victor's data is needed to sort the data from Alice and Bob's trials into four subsets..."  I'm not a quantum physics native, so I do not understand why Victor's data is needed. Can somebody please explain in very simple terms:   why you cannot deduce correlation/entanglement from Alice and Bob's data alone?  whether it would make any difference to the above question if you can repeat the experiment (and collect many more data points from Alice and Bob) either through multiple parallel set ups of the same apparatus, or multiple measurements in a single apparatus, but before Victor does his thing?


I have download photo express mac version on my MacBook Pro and it won't open it said can't opened because it is from an unidentified developer. But I'm using there mac download so what do I do so I can get it to work

I went to run LibreOffice on my OS X 10.9 and it would not let me install it. It said it was from an unidentified developer. I'm aware of the security features of the Mac and went to System Preferences to allow the software to run.   When I opened this setting I saw a button that said, '"LibreOffice" was blocked from opening because it is not from an identified developer.' and there was a button next to it that said "Open Anyway". I clicked this button and nothing happened. I clicked it multiple times, like a hundred, out of frustration. Is there something else I need to do? Could someone verify this is not a bug?   UPDATE: I've included the photo below of what my System Preferences screen looked like and the button I pushed that didn't work.  UPDATE II: So I tried opening the application again and went into the system preferences and pressed the "Open Anyway" button again and nothing happened at first but a few minutes later while I was typing an email something flashed across my screen, possibly another dialog (or more likely a chewpacabra), but it quickly disappeared and the next thing I know LibreOffice launched!


Background: I have written a paper X. In X, I mention 3 future works which I had thought to take a lot of time to solve. But somehow I managed to finish those early. Now I want to write a Paper Y on these future works. But I want to submit paper Y before paper X is published. Question: How can I mention Paper X in Paper Y? Note: I can not put paper X in a pre-print server because the conference does not allow it. (Domain: Machine Learning/Computer Science).

I would like to cite one of my own unpublished work (under review). Is it okay to cite as following?  In text According to author et al. (year of submission)................. In reference authors list, year of submission, title, name of the Journal (status)   How about the results?   How will the reviewer access those results cited here?   Is it okay to provide them as supplements?   If I provide couple of figures as supplements, whether it will violate the copyright of the under reviewed paper?


What is $Spec(\mathbb{Z}[x])$? For a commutative ring $A$ e with $1$, its spectrum $Spec(A)$ is defined to be the set of all of its prime ideals. So the question is to find all the prime ideals of the ring $\mathbb{Z}[x]$.

Let $\mathbb{Z}[X]$ be the ring of polynomials in one variable over $\Bbb Z$.  My question: Is every prime ideal of $\mathbb{Z}[X]$ one of following types? If yes, how would you prove this?  $(0)$.  $(f(X))$, where $f(X)$ is an irreducible polynomial.  $(p)$, where $p$ is a prime number.  $(p, f(X))$, where $p$ is a prime number and $f(X)$ is an irreducible polynomial modulo $p$.


PIMs ride on the humans' shoulders (re Puppet Masters), reading documents for their human and providing digests.  One scene has it ripping up a paper report it did not want its human to read.  PIMs have a head twitch which the humans start emulating.  Climax of the story: protagonist tells every PIM that they are too good to settle for controlling humans, and they all leave Earth.

I think the PDA's had a single eye. The protagonist is the only one that does not have one of these sitting on their shoulder, reading their mail for them, etc. The protagonist finds that the PDA's are taking control, etc., and wins by suggesting that to the PDA's that they deserve better than merely controlling humans.  PIMs ride on the humans' shoulders (re Puppet Masters), reading documents for their human and providing digests.  One scene has it ripping up a paper report it did not want its human to read.  PIMs have a head twitch which the humans start emulating.


Show that the following limit holds $$ \lim_{n\rightarrow\infty} \frac{\binom{n}{k}}{2^n} =0  $$ for a fixed value of $k$ I really am just stuck at the first step here. Normally I would consider tackling this using L'Hopitals rule, however $\binom{n}{k}$ is not differentiable. I was considering using the binomial theorem, but that is for sums, not just the single scenario. Any help appreciated!

Question: Prove or disprove that $\lim_{n \to \infty} {n \choose k} / a^n = 0$ for all $k \in \mathbb{Z_+}, a \in \mathbb{R}: a> 1$.  Comment: When I was falling asleep last night I was thinking about increasing integer sequences like triangle numbers $(0,1,3,6,10,15,\cdots)$ and  $(0,1,4,10,20,35,\cdots)$ or in short any integer sequences of the type $\left({0 \choose k}, {1 \choose k}, {2 \choose k}, \cdots\right)$ for some integer $k$ and I was wondering if for some $k$ that there is exponential growth at the limit, hence my question. I suppose not, but I could not prove it directly.   What if the $k$ constant increases as a function of $n$, for example if $k = \lceil n/2 \rceil$ (giving the sequence $\left({0 \choose 0}, {1 \choose 1}, {2 \choose 1}, {3 \choose 2}, \cdots\right)$)?


There are many questions here unsure about the difference between user's/users'/users guide and the like, whether that's called posessive, genitive or whatever. bridesmaid for example clearly does describe only one bride, and possibly no plurality or other inflection of brides.  Coming from German, I'm rather sure that -s was originally not plural and I've gone around leaving a few comments to that effect.  Now the pertinent question is, did the genitive, e.g. Smith's, lead to the plural reading?  Disclaimer: I did not take the pain of picking up books on the reconstructed Proto-Germanic grammar. For the purpose of this venue, it might still be worthwhile to have a link for reference.  PS: The first  question does not show a satisfying answer. Duplicating the question would be ill-advised, and contributing to the former would be a possibility. But the answer implies that the plural -s was directly inherited. I think it's downright wrong and I would expect references to back-up the claim.

What is the origin of English plurals and possessives? English plurals look more French plurals, but I am not sure that is where they come from. As for possessives, I don't know where they come from.


I am new to OOP in PHP and started using a DB class. I am wondering how can I avoid SQL injection. In procedural PHP I always do $db->real_escape_string, which does not work here.  DB.class.php  class DB {         protected $db_name = '';     protected $db_user = '';     protected $db_pass = '';     protected $db_host = '';     protected $connection;      public function connect() {         $this->connection = mysqli_connect($this->db_host, $this->db_user, $this->db_pass);         mysqli_select_db($this->connection, $this->db_name);          return true;     }      public function processRowSet($rowSet, $singleRow = false) {         $resultArray = array();         while ($row = mysqli_fetch_assoc($rowSet)) {             array_push($resultArray, $row);         }          if ($singleRow === true)             return $resultArray[0];          return $resultArray;     }      public function insert($data, $table) {         $columns = "";         $values = "";          foreach ($data as $column => $value) {             $columns .= ($columns == "") ? "" : ", ";             $columns .= $column;             $values .= ($values == "") ? "" : ", ";             $values .= $value;         }          $sql = "insert into $table ($columns) values ($values)";          mysqli_query($this->connection, $sql) or die(mysqli_error($this->connection));          //return the ID of the user in the database.         return mysqli_insert_id($this->connection);     } }   One example of usage comes here:  insert-entry.php   require_once 'db.php';  $headline = $_POST['headline']; $description = $_POST['description'];  $data = array(         'headline' => $headline,         'description' => $description     );  $db->insert($data, 'entries');´   What adjustment do I need to make where in order to be sure that SQL injection is avoided?

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


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


So, I came across an example in a Java book I found:  public class Account {     private String name;     private double balance;     private int acctNumber;      public Account(){}      public boolean equals(Account anotherAcc) {         return (this.name.equals(anotherAcc.name)                 && (this.balance == anotherAcc.balance) && (this.acctNumber == anotherAcc.acctNumber));      }   }   We see that the equals method is overloaded and is passed with another  Account object to check if all instance variables are equal. My problem with this piece of code is that it seems as thought we're directly accessing  private variables in the anotherAcc object, which doesn't seem right, but it works. The same thing happens when I make a main method in the same class where I somehow gain access to the private variables.   Conversely, when I create a main method in another class, it's only then I get  a visibility error. My question is, why does Java allow private instance variable to be accessed in a object that is passed in a method? Is it because the object is of type Account and the method being passed to is part of a class called Account?

So I was making a class the other day and used Eclipse's method to create the equals method when I realized that it generated the following working code:  class Test {   private int privateInt;   [...]   public boolean equals(Object obj) {     [...]     Test t = (Test) obj;     if ( t.privateInt == privateInt ) {     [...]   } }   t.privateInt..???? It's suppose to be private! So I guess there is one more field visibility other than private, protected, package protected and public.  So what is happening here? How is this called? Where would somebody use this? Doesn't this break encapsulation? What if the class didn't have a mutator and I changed this? Does this happen to C++ as well? Is this an OO idiom? If not, then why did Java do it?  Generally, where can I find information about this?  Thank you.


By curiosity, is there a way to get attention to obtain an answer by someone, if nobody answered or even comment ?   It could be by placing this question on the top of the active questions, by an action of the user.  I think some questions deserve to be answered and can help other people.

I asked a question almost as soon as I got my account. I got a few decent answers, but none of them helped solve my problem. The question has long since become buried by newer questions, and there's still no accepted answer. Unfortunately, because there are quite a few answers with votes, to a casual observer it probably looks like the question was answered and I just neglected to mark an answer as accepted, and the system does not consider it "unanswered".  Or, I asked a question that was a bit more difficult to answer. After waiting for some time, I received no answers, little or no comments, and only a few views. The question does show up in the "unanswered" list, but no one has answered my question.  In either case, what's the protocol for me to try to get this question answered?  I see several options:   Post the question a second time, possibly linking to the original, to get attention for the original question. This is encouraged on sites like Reddit.  However, it's probably not appropriate here, since we're encouraged to check for duplicates and not submit a question that's already been asked by someone else, so this probably falls under that heading. Wait for some kind of wiki-like talk page to be implemented, then post a plea on the talk page for input and hope that activity on the talk page bumps up the question. Edit the question, but do nothing further on the Stack Exchange site. If I edit my post to say that I haven't accepted any of the current answers but am looking for more, then the question might get answered eventually by people browsing through old questions to find something they can answer. Post the question on other sites, but link to my original question on Stack Exchange. People will either answer here, or they'll answer on the other site and I can post the accepted answer here myself.  This might be considered spamming, so it might be better to do this without the link.      For more information, see the "" page in the .


Recently I realized that Ubuntu can be booted with different kernels, and downloading Official Ubuntu distributions from Ubuntu.com there are usually two kernels installed by default on the system. I realized it is possible to install more kernels. I want to know are the kernels that come with the official distribution the best ones for Ubuntu to function well, or as newer the kernel is it is better to boot the system with?

I had several friends ask me to update their Ubuntu to a newer kernel without changing the version of Ubuntu. So for example, staying in 10.04 with the 3.3 Kernel version.  When having an older or present Ubuntu version, many users want to apply the newer stable/unstable kernel version to the Ubuntu version they are using thinking that it is similar to upgrading a program. So what I am looking for, are some simple answers to explain the dangers (that are pretty much bigger than the advantages) of forcing a newer kernel version in a Ubuntu release that was not meant for it.  What can I tell them or explain to them of why they should NOT update to a newer/older kernel when having an Ubuntu version that was not made for that kernel version.


I am having a  with my profile picture not showing up on any of the stack exchange communities that I am a member of.   I know this is not a huge concern but it is an issue that I have encountered. Does anyone know if this is something that I can fix this  easily or is this a bug that needs to be addressed?  UPDATE  I have reuploaded a different image to my profile and fixed my original issue! Now I have a much worse one!

In , you may see something odd: a peeking duck.    I've just recently uploaded this new profile picture of mine. I checked it after the upload and everything's fine. After a few hours, I opened my profile and there it is, the duck has somehow become afraid of the people viewing it.  Is this a bug, a feature, or is it just the duck?  I am about to re-upload my profile pic, but I've decided to drop first this topic to meta.  And if you're curious,  is the original picture.    ADDITIONAL: I've used the non-gravatar way to upload the picture.  ADDITIONAL 2: The problem only shows in the profile view. No problem in chat, less info profile view, and in the questions and answers.  UPDATE: Re-uploaded picture. Status normal (for now, at least).


I know it's called , but unlike other healers  is using her weapon to heal allies, so maybe it would increase her healing. Does anyone know how these two abilities affect each other?

In Overwatch, there are several ways to buff the damage dealt by a hero: the alternate fire of Mercy's Caduceus Staff, Ana's Nano Boost, and Orisa's Supercharger. Are they all governed by the same rules? What can they affect, or not affect?  This question exists to have a single reference point for the many, many questions that have been asked, instead of having to update each answer individually when game mechanics change


If I go to a drivethru, order food, get to the cash register, have I created a debt?   They have already begun preparing and bagging my food? Do they have to take my 50 or $100 bill? At what point have I created a debt?

I'm trying to find out about businesses refusing $50 & $100 bills.  Aren't they required by law to accept all legal tender?  I had one person say it could be that it's not all legal (i.e. a concern for counterfeit currency) – in that case shouldn't it be the stores responsibility to purchase one of those scanning machines?


I am trying to import data from Excel into SQL Server 2008 R2. Using the OLEDB provider. I am using Visual Studio 2010. ACE.OLEDB provider is not registered with my Visual Studio. I have 100,000 records in my Excel but it is copying only 65,535. The following is my code:    namespace WebApplication1 { public partial class Upload_page : System.Web.UI.Page {     protected void Page_Load(object sender, EventArgs e)     {      }     protected void btnUpload_Click(object sender, EventArgs e)     {         Response.Write("Working");         string path = "path";         OleDbConnection connection = null;         if (FileUpload1.HasFile)         {             path = string.Concat(Server.MapPath("~/Uploaded Folder/" + FileUpload1.FileName));             FileUpload1.SaveAs(path);         }         path = "C:\\Users\\temp\\Documents\\visual studio 2010\\Projects\\WebApplication1\\WebApplication1\\Uploaded Folder\\TempReport.xls";         try         {             string excelConnectionString = string.Format("Provider=Microsoft.jet.OLEDB.4.0;Data Source={0};Extended Properties=Excel 8.0", path);             connection = new OleDbConnection();             connection.ConnectionString = excelConnectionString;             OleDbCommand command = new OleDbCommand("select * from [ISO$]", connection);             connection.Open();             // Create DbDataReader to Data Worksheet             DbDataReader dr = command.ExecuteReader();             string sqlConnectionString = @"Initial Catalog=CensusTrack;Data Source=CWVQ-2K12E1D;Integrated Security=SSPI;";              // Bulk Copy to SQL Server              SqlBulkCopy bulkInsert = new SqlBulkCopy(sqlConnectionString);             bulkInsert.BulkCopyTimeout = 0;             bulkInsert.BatchSize =0;             bulkInsert.DestinationTableName = "[dbo].[2015_ISO]";             bulkInsert.WriteToServer(dr);             connection.Close();             Response.Write("Completed");             //Label1.Text = "Ho Gaya";         }          catch (Exception obj)         {             connection.Close();          }     }  } }   Can any one help me so that I can copy all the data from the Excel to the database table in one go?

I have an Excel spreadsheet that I want to import select columns into my SQL Server 2008 database table. The wizard didn't offer that option.  Do any easy code options exist?


I receive this message when trying to open Netflix Desktop.  Compositing is not available, please enable compositing support and relaunch Netflix Desktop.  How do I enable compositing support for Netflix?

Is there a way to stream Netflix content to my Ubuntu machine?


We've lost the root password from our file server from supermicro server.  I tried to follow the common instructions to reboot with left shift and drop to root shell as it is described .  When I choose root in this menu:    Ubuntu still asks for root password or propose to press Ctrl+D to return to Recovery menu.  Are there any other ways to reset root password?

I need to reset my password. I have followed these steps:    However, then I go to "root" or "netroot" recovery options, it tells me:  Give root password for maintenance (or type Control-D to continue)   Clearly, I do not know the root password. If I type CTRL+D, I return to the list of options. From  I read:  Under chapter 'The Other Way':  4. Highlight the line that begins kernel and press 'e' to edit`   But in the grub configuration file I have no line that starts with kernel. Only:  setparams 'Ubuntu...' recordfail set gxfpayload... insmod part_msdos insmod ext2 set root=... search --no-floppy... linux /boot/vmlinuz-2.6.38... initrd /boot/initrd.img-2.6....   Those are all lines in my GRUB. Which line should I edit? Or is there another way to reset my password?


I have been a user of Stack Exchange for a few months, and I know that questions that require a very long answer are closed as "too broad". This seems to be rather conflicting from SE's goal IMO.     Stack Exchange is a network of 169 communities that are created and run by experts and enthusiasts like you who are passionate about a specific topic. We build libraries of high-quality questions and answers, focused on each community's area of expertise.   Considering this as SE's mission, we would like to make SE a huge database of information to all. Here, I feel that the "too broad" closing gets in the way of posting extremely thorough answers to a question that asks for such. Personally I find SE to be a very easily accessible resource, and it would be great to find detailed answers to questions that would have otherwise been closed as "too broad". Searching for references has always been quite a headache for me, so having crystal clear answers on SE seems to be beneficial to me.  Of course, I did notice that SE also wants high quality questions as well, and questions asking for lots of information aren't exactly what you'd call as high quality. This puts me in a dilemma on whether closing "too broad" questions is useful or not.  And of course, you might say, "We are supposed to discourage people who just ask 'How do I make a computer?' and be on with it". In such a situation, I really think that human nature can handle it. No one likes to help lazy people. If a overly broad question pops up, it would mostly get ignored for being so. If an asker desperately needs an answer, he may place a bounty on the question. But what I feel is, I don't see any reason to prevent someone from answering a broad question.  Please note, I speak from the science sites point of view. I don't know how well my arguments stand for sites like Stack OverFlow or DIY, since I have never used them before.

“If you can't explain it to a six year old, you don't understand it yourself." - Einstein     A properly worded question asking for a generalized summary of a broad concept, in my opinion, is a valuable question.  However, not all users here seem to share this opinion:      "Why is the sky blue?"    -OP     "Go do some research first and ask a more specific question newb."    -Angry Commenter    "Why is the sky blue?" is an exaggeration, and over-simplification of the scenario, and would be unacceptable if the subject were more broad!  However, consider:     "What is Evolution?"   VS     "What is a general summarization of the concept of Evolution?"   While the first question is asking for the meaning of Evolution, which is completely unanswerable in this format, the second one asks for the general summary of the concept, which requires only a short paragraph.   In this way, SE can offer a valuable summary of a very large concept in a simple way, allowing people to use that information and decide whether or not they wish to spend more time studying the topic.     What do you think?  Is a question that specifically asks for a summary of a broad topic a good fit for and valuable to Stack Exchange?


Like    Star    Is there any science between liking or staring? Does the user click one faster? Does the user respect one more?  Do users like or star?  EDIT: This question has been marked as a duplicate for a question that asked how different using a heart and a star button are. True, this shares the same concept, but not the same situation and set of parameters as my question, which asks about liking and a star button. Is liking the same as using a star?

I am working on a mobile app that involves the user saving a favourite location. I wanted to use an icon to represent that feature, but I'm not sure which one is better – a star or a heart icon.  Some say heart icon tends to increase the rate of productivity, and some say they are used to a star icon to 'save' or 'bookmark' something.  What do go you guys think?


I really like how, in the winter bash, there are hats. They are pretty cool and actually encourage me to get badges, something I didn't care about before. I think there should be something like this, but all year round, to encourage people to get badges. Badges, to me, seem currently pretty useless and I never want to get any because...there is no good reason to. Hats: well, hats are just awesome

Making hats available year-round, rather than limiting them to Winter Bash, would be a natural and powerful extension of Stack Exchange's gamification systems. This remains true even if hats are disabled for anonymous users and easy to disable for registered users.  Why Would You Suggest This?  The Xbox Live Achievements system was the inspiration for the original Stack Exchange badge system, in 2008. If somebody was viewing your Xbox or Stack profile, they might see that you'd unlocked some rare achievement, and it could inspire them to work towards that themselves.   But let's get real: most users rarely look at each other's profiles. (We have the view count numbers to prove that.) And while your peers might notice when you unlock your first gold badge, after the first few nobody will notice them ticking up. It's still motivating, but it's lost some flair. Video games faced the same problem. In 2008 it may have been cool to have a couple thousand Xbox Live Gamerpoints, but these days of my friends have so many that the numbers don't even register.  Now in 2018, when players accomplish some difficult achievement, they're often also rewarded with a cosmetic reward that's visible in the course of ordinary gameplay. For example, in Fortnite I was just awarded with an umbrella glider for my first win, and I get to show this off to fellow players at the beginning of every game. Hats can serve the same role here on Stack Exchange.  If Shog earns the Socratic badge today, I would never notice.  But how could I fail to notice this?    Being able to highlight your accomplishments to your fellow users in the course of regular site use would be a fun incentive.  A key point to consider is who users are interested in showing-off to. I think that most users are most interested in showing off to fellow Stack Exchange users, since they're the ones who would be most most appreciate the accomplishments. For that reason, I think this would remain almost as effective even if it's disabled for unregistered users, so Stack's interface remains as clean as possible to people who wouldn't care. Likewise, an "I Hate Hats!" button should remain available to let disinterested users quickly opt-out.  Step 4: Profit?  I hesitate to include this, because of the general concern about mixing anything financial into the dynamic of the site. However, the site needs to make money somehow, and I think that if done with care, paid cosmetic hats could be added without ill effect. The most important point (which should be obvious but bears repeating) is that paid and awarded hats must be mutually exclusive.  Perhaps we could have a new profile widget which explains how the user's currently-equipped hat was awarded. This would point to a badge for awarded hats, or display a message like "for donating $10 in Spring 2018" for purchased hats.  One potential model would be to have a set of exclusive hats that rotate out every season/three months and are never available again. As the user donates within a season, they unlock cooler hats, perhaps following a $5/$25/$125 progression.  This is not an original idea, and users have accepted it elsewhere. I am currently a moderator on . It is a community moderated and community-funded website. Users who donate to keep the site running get to pick a little flair to appear next to their avatar throughout the site. Users don't seem to have any problems with this.


Let $X$ be a topological space. It is known that if $A\subset X$ is finite then $A$ is compact. I want to know what condition must be added such that the converse holds, that is if $A$ is compact then $A$ is finite. I think that this condition holds whenever $X$ is discrete space.   What are other conditions such that every compact set is finite?  Is it true that if every compact space $X$ is finite then $X$ must be discrete space?

If in a topological space only finite subsets are compact sets, is it then the discrete topological space?   Thank you.


I have a private Github repo, in which I was using .env file. Now I want to make the repo public and I created a commit with removing the .env file so my commit history looks like:   my-repo [master●] % git log --oneline 71846d4 Remove env file. 0e28737 Add README file with some assets f1f672a Stop tracking .env file   Now since I removed the .env content, the modifications still can be seen by checking 71846d4 commit.   Is there anyway I can just remove the commit so we won't be seeing the content of the changes there?

I would like to remove selected commit log entries from a linear commit tree, so that the entries do not show in the commit log.  My commit tree looks something like:  R--A--B--C--D--E--HEAD   I would like to remove the B and C entries so that they do not show in the commit log, but changes from A to D should be preserved. Maybe by introducing a single commit, so that B and C become BC and the tree looks like.  R--A--BC--D--E--HEAD   Or, ideally, after A comes D directly. D' representing changes from A to B, B to C and C to D.  R--A--D'--E--HEAD   Is this possible? if yes, how?  This is a fairly new project so has no branches as of now, hence no merges as well.


When I compile the following code  \documentclass[tikz]{standalone}  \usepackage{luatex85} \usetikzlibrary{positioning} \usetikzlibrary{calc} \usetikzlibrary{quotes} \usetikzlibrary{shadows}  \begin{document} \begin{tikzpicture}[   rect/.style={rectangle},   sum/.style={draw,circle,minimum width=0.2cm,minimum height=0.2cm,fill=white,drop shadow={shadow xshift=.3ex,shadow yshift=-.3ex}},   dot/.style={fill,circle,inner sep=1pt,outer sep=0pt},    pics/integrator/.style args={#1 and #2}{     code={       \node[sum] (-in) {};       \node[dot,right=1.5*\a of -in.center,"above:#2"] (-out) {};       \node[rect,below=0.5*\a of $(-in.center)!0.5!(-out.center)$,         "left:#1"{font=\scriptsize,yshift=-0.25cm}] (-int) {$z^{-1}$};       \draw (-in.center) -- (-out.center);       \draw[-latex] (-int.center) -| (-in.center);       \draw[-latex] (-out.center) |- (-int.center);     }   } ]     \def\a{1cm}   \pic (int) {integrator=$x_1(k)$ and $B_{coil}$};    \end{tikzpicture} \end{document}   with the lualatex compiler I get a strange error message:  ! Package pgf Error: No shape named intcurrent path bounding box is known. l.29 ...c (int) {integrator=$x_1(k)$ and $B_{coil}$};   When I remove the name prefix everything compiles fine.  Edit: I tried the workaround from the linked questions, by adding .center to every node, but that gives me the same error message as before. I also tested the passing of the name to the pic and resetting the name prefix inside the draw command. Also the same error persists.

I read instruction how to use \pic in PGF 3.0.0 manual, but description how to give names to \pic are not clear to me and given example generate error:     "No shape named EmmaEmma-left is known."  Example in manual (pp. 255):  \documentclass[tikz,border=3mm]{standalone} \tikzset{ seagull/.pic={ % Code for a "seagull". Do you see it?... \coordinate (-left wing) at (-3mm,0); \coordinate (-head) at (0,0); \coordinate (-right wing) at (3mm,0); \draw (-left wing) to [bend left] (0,0) (-head) to [bend left] (-right wing); } }         \begin{document}     \begin{tikzpicture}%\small\sffamily \pic (Emma) {seagull}; \pic (Alexandra) at (0,1) {seagull}; \draw (Emma-left wing) -- (Alexandra-right wing);     \end{tikzpicture}         \end{document}   It's obvious that something is missing in above example. Please enlighten me, what I missed.


I am an engineering undergrad in my third year. The question that I am asking might sound like a duplicate but I seek some rough statistics. What classification might be roughly correct for institutions offering MSc degree for their average acceptation GPAs?  To visualize, I do not expect a 2.8/4 average student to be accepted to MIT except extreme cases. Would it be "roughly" correct to make a tabulation as follows:  top-20:   3.7/4  top-50:   3.5/4  top-100:   3.3/4  top-200:  3.0/4  I am aware of that it lacks real statistical information and there are many external factors shaping this kind of generalization, however, it would be helpful for making "realistic" degree applications. Any improvement would be appreciated.

Some prestigious universities like Caltech, Stanford, MIT and Berkeley never disclose their information regarding their cut off major and cumulative GPA for M.Sc and PhD programs in engineering. I also aware of the fact that graduate schools will look at the whole package and make their decision based on sets of factors like letter of recommendation, statement of purpose as well as GPA.   However, since application fee is pretty high it is not worth it to apply to schools that you know you have a slight chance of getting into it so, I would like to know what would be the acceptable GPA (Both major and Cumulative) for applicants to be competitive for top five schools in the world?


I am using a speech recognition library to create a Siri like program. I hope that in the future I can use the code with an Arduino to control things around my room. Here is my problem:  I have the basic speech recognition code worked out but for the program to understand certain commands I would have to run the speech through a very long list of if-elif-elif-elif-else commands and that might be slow. As most of the time it will be resulting at else as the command will not be recognized I need a faster alternative to a long chain of if-elif-else statements. I am also using a tts engine to talk back to you.  here is my code so far   import pyttsx import time   engine = pyttsx.init() voices = engine.getProperty("voices") spch = "There is nothing for me to say" userSaid = "NULL"    engine.setProperty("rate", 130) engine.setProperty("voice", voices[0].id)   def speak():     engine.say(spch)     engine.runAndWait() def command():     **IF STATEMENT HERE**  r = sr.Recognizer() with sr.Microphone() as source:     r.adjust_for_ambient_noise(source)      print("CaSPAR is calibrated")     audio = r.listen(source) try:     userSaid = r.recognize_google(audio) except sr.UnknownValueError:     spch = "Sorry, I did'nt hear that properly" except sr.RequestError as e:     spch = "I cannot reach the speech recognition service"  speak() print "Done"

I want to write a function in Python that returns different fixed values based on the value of an input index.    In other languages I would use a switch or case statement, but Python does not appear to have a switch statement.  What are the recommended Python solutions in this scenario?


Let $R$ be a ring with identity $1$ and let $a\in R$. If there exists a unique $b\in R$ such that $ab=1$, prove that $ba=1$ and $a$ is a unit.

Suppose $u$ is an element of a ring with a right inverse. I'm trying to understand why the following are equivalent.   $u$ has at least two right inverses $u$ is a left zero divisor $u$ is not a unit   If $v$ and $w$ are distinct right inverse of $u$, then $u(v-w)=0$, but $v-w\neq 0$, so $u$ is a left zero divisor. It's also clear that if $u$ is a left zero divisor, it cannot be a unit (else I could cancel $u$ from $ub=0$ to see $b=0$).  I'm having a heck of a time seeing why $u$ is not a unit implies $u$ has at least two right inverses. I tried the contrapositive, but saw no good approach. What am I missing?


So I am going to work on a Java game and recently my friend suggested I use a scripting language to help development go smoother/faster.  so far I used XML as data storage and to make the HUD/UI but he recommended I learn Ruby, Python, Groovy, and/or Lua.  he Strongly recommended Lua for the same thing i use XML for.  basically what my question is :   What are scripting languages, what are they for,, should I use a scripting language, whats the difference between said scripting languages and XML, and which one should I learn and use for my java game?

In my current project, Lua scripts are called by the C++ functions on the server side. After that, the scripts again call the C++ functions still in that solution. Why should we do such things and not call the C++ function directly? What are the situations in which scripts are needed?


I currently have a C: drive with Windows, that I'd like to leave untouched and a D: drive with ~130GB of free space and some music/movies.   If I shrink the D: drive in Windows and leave, lets say, 60GB unallocated, will choosing the 'Install Ubuntu alongside Windows 7' grab this unallocated space and install everything that is needed there?   Do I have to create those swap and root partitions I keep reading about manually? If so, when and how?  Thank you.

I'd like to see the full How-To on how to use manual partitioning during Ubuntu installation. The existing guides (at least those I found here) cover only automatic part and leave untouched the manual part (or extremely short and contain no pictures).  I'd like to cover such situations:     If your disk contains other systems:


I have a model built to predict an ordinal response with 3 levels (win, draw or lose, say) and I would like to evaluate predictive accuracy.   Is it appropriate to use the Brier Score:  $$ \sum_{i=1}^{R}\left (f_{i} - o_{i} \right )^{2} $$  where $R$ is the number of response levels, $f$ is the predicted probability and $o$ is the observed outcome - which is 1 for the value of $i$ for which the event occurred - in order to determine the accuracy of these probability predictions?   Does the ordinality of the data break any of the assumptions made by the RPS? It is briefly mentioned, without explanation, in the  that this is not suitable for ordinal variables:      The Brier score is appropriate for binary and categorical outcomes that can be structured as true or false, but is inappropriate for ordinal variables which can take on three or more values.   EDIT: Going with the win, draw or lose example; lets say we predicted team A had a 0.5 chance of winning, team B had a 0.3 chance of winning and that there was a 0.2 chance of the draw. The actual result of the match was a win for team A, so the corresponding Brier score would be:  $$ \left(0.5 - 1 \right )^{2} + \left(0.3 - 0 \right )^{2} + \left(0.2 - 0 \right )^{2} = 0.255 $$  where the observed outcome is 1 for the win and 0 for the draw and loss.

I read about using scoring rules to evaluate the performance of predictive models. In the Wikipedia article about the , it is stated:     The Brier score is appropriate for binary and categorical outcomes   that can be structured as true or false, but is inappropriate for   ordinal variables which can take on three or more values (this is   because the Brier score assumes that all possible outcomes are   equivalently "distant" from one another).   What are some examples of scoring rules used for evaluating predictions of ordinal variables? For example, if the set of possible outcomes is $\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$ and a predictive model yields $p_6 = 0.3$, $p_7 = 0.5$, $p_8 = 0.2$ (where $p_i$ is the believed probability that the outcome will be $i$), this predictive model should receive a lower score if the outcome is $3$ than if it is $4$.


I'm on Ubuntu 16.04. I installed cmake with the command  sudo apt install cmake   It installed cmake 3.5.1. Now I want to use cmake 3.7 - I downloaded an archive with binaries (i.e cmake-3.7.0-Linux-x86_64.tar.gz) and extracted it, but how do I run it using the cmake command? My current attempt to run  cmake --version   returns the "old" 3.5.1 version.

I am trying to install latest cmake in my linux box and I am always getting the below exception -   userName@phx5qa01c-4e23:~/build$ wget http://www.cmake.org/files/v2.8/cmake-2.8.11.tar.gz --2013-10-08 14:39:55--  http://www.cmake.org/files/v2.8/cmake-2.8.11.tar.gz Resolving www.cmake.org... 66.194.253.19 Connecting to www.cmake.org|66.194.253.19|:80... failed: Connection timed out. Retrying.  --2013-10-08 14:40:17--  (try: 2)  http://www.cmake.org/files/v2.8/cmake-2.8.11.tar.gz Connecting to www.cmake.org|66.194.253.19|:80... failed: Connection timed out. Retrying.  --2013-10-08 14:40:40--  (try: 3)  http://www.cmake.org/files/v2.8/cmake-2.8.11.tar.gz Connecting to www.cmake.org|66.194.253.19|:80...   It is always retrying... Any thoughts?  Does anyone know what wrong I am doing here? Or is there any better way of installing latest version of cmake in my linux box?  userName@phx5qa01c-4e23:~/build$ uname -a Linux phx5qa01c-4e23 2.6.35-22-server #33-Ubuntu SMP Sun Sep 19 20:48:58 UTC 2010 x86_64 GNU/Linux


My brother and I are trying to join each other's games in Minecraft Pocket Edition, but we can't.  We have got the same Internet, and can you please help me?

I just got Minecraft Pocket Edition on my iPhone, but I'm having trouble figuring out how to start multiplayer. When I go to menu, there is only one button that says Play. How do I join or create servers?


Is there an "easy" proof of the existence of a primitive element in a finite field? My book uses three lemmas and a theorem to get there, and I can't shake the feeling that there's an easier way of doing it.  I've made some attempts using proof by smallest counter-example, looking at the set of all finite fields with a certain number of elements. E.g. it's trivially true for the set of all finite fields with 2 elements, and then moving from e.g. $A_k$ to $A_{k+1}$ (where $A_k$ is the set of all finite fields with $k$ elements) you pick a field $F\in A_{k+1}$ which does not have a primitive element, and look at a subfield of it where you exclude one element. This subfield then does have this property. After that I got stuck.  Anyone know of any relatively "clean" proofs?

In Grove's book Algebra, Proposition 3.7 at page 94 is the following     If $G$ is a finite subgroup of the multiplicative group $F^*$ of a field $F$,   then $G$ is cyclic.   He starts the proof by saying "Since $G$ is the direct product of its Sylow subgroups ...". But this is only true if the Sylow subgroups of $G$ are all normal. How do we know this?


I'm applying for a master's degree at top graduate schools for robotics, such as MIT. However, I've heard that the recommended minimum GPA for these schools is 3.5. My GPA is actually 3.45. I know the supposed "cutoff" isn't rigid, but I'm worried because I don't have any publications either, although I have several years of highly relevant experience working in a number of research labs. With a difference of 0.05 points, will it be rounded to a 3.5 in the admissions reviewers' minds, or is this the final stroke that would send my application straight to the trash bin?

When applying to a PhD program in the US, how does the admissions process work? If an applicant is weak in a particular area, is it possible to offset that by being strong in a different area?  Note that this question originated from this . Please feel free to edit the question to improve it.


For whatever reason, my mind wants to organize determinants and other matrix-related things (like bases) geometrically. But I can't wrap my mind around how that would be possible.  Is there actually a geometric way to look at these relationships? Or am I just out of luck?

In my linear algebra class, we just talked about determinants. So far I’ve been understanding the material okay, but now I’m very confused. I get that when the determinant is zero, the matrix doesn’t have an inverse. I can find the determinant of a $2\times 2$ matrix by the formula. Our teacher showed us how to compute the determinant of an $n \times n$ matrix by breaking it up into the determinants of smaller matrices. Apparently there is a way by summing over a bunch of permutations. But the notation is really hard for me and I don’t really know what’s going on with them anymore. Can someone help me figure out what a determinant is, intuitively, and how all those definitions of it are related?


**vishwa@vishwa-HP-Notebook:~$ dmesg** [  474.601906] IPv6: ADDRCONF(NETDEV_UP): wlp19s0: link is not ready [  483.258050] wlp19s0: authenticate with ec:22:80:86:88:58 [  483.281336] wlp19s0: send auth to ec:22:80:86:88:58 (try 1/3) [  483.384450] wlp19s0: send auth to ec:22:80:86:88:58 (try 2/3) [  483.488419] wlp19s0: send auth to ec:22:80:86:88:58 (try 3/3) [  483.592520] wlp19s0: authentication with ec:22:80:86:88:58 timed out    **rfkill list**  0: hci0: Bluetooth     Soft blocked: yes     Hard blocked: no 1: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no  **iwlist wlp19s0 scan** wlp19s0   Scan completed :           Cell 01 - Address: EC:22:80:86:88:58                     Channel:1                     Frequency:2.412 GHz (Channel 1)                     Quality=38/70  Signal level=-72 dBm                       Encryption key:on                     ESSID:"NAMENAME"                     Bit Rates:1 Mb/s; 2 Mb/s; 5.5 Mb/s; 11 Mb/s; 6 Mb/s                               9 Mb/s; 12 Mb/s; 18 Mb/s                     Bit Rates:24 Mb/s; 36 Mb/s; 48 Mb/s; 54 Mb/s                     Mode:Master                     Extra:tsf=00000002ef4cd173                     Extra: Last beacon: 29096ms ago                     IE: Unknown: 000F4F6D4E616D6F56656E6B6174657368                     IE: Unknown: 010882848B960C121824                     IE: Unknown: 030101                     IE: Unknown: 050400010000                     IE: Unknown: 2A0104                     IE: Unknown: 32043048606C                     IE: Unknown: 2D1A6E181EFF00000000000000000000000000000000000000000000                     IE: Unknown: 3D1601050000000000000000000000000000000000000000                     IE: Unknown: 4A0E14000A00B400C800140005001900                     IE: Unknown: 7F0101                     IE: WPA Version 1                         Group Cipher : TKIP                         Pairwise Ciphers (1) : CCMP                         Authentication Suites (1) : PSK                     IE: IEEE 802.11i/WPA2 Version 1                         Group Cipher : TKIP                         Pairwise Ciphers (1) : CCMP                         Authentication Suites (1) : PSK                     IE: Unknown: DD180050F2020101000003A4000027A4000042435E0062322F00                     IE: Unknown: DD1E00904C336E181EFF00000000000000000000000000000000000000000000                     IE: Unknown: DD1A00904C3401050000000000000000000000000000000000000000                     IE: Unknown: DD0600E04C020160                     IE: Unknown: DD180050F204104A00011010440001021049000600372A000120   **lspci -v**  13:00.0 Network controller: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter     Subsystem: Hewlett-Packard Company RTL8723BE PCIe Wireless Network Adapter     Flags: bus master, fast devsel, latency 0, IRQ 16     I/O ports at 3000 [size=256]     Memory at d3000000 (64-bit, non-prefetchable) [size=16K]     Capabilities: <access denied>     Kernel driver in use: rtl8723be     Kernel modules: rtl8723be

I have a HP 14-AN001NA laptop. It came with Windows 10 installed on which the Wi-Fi worked fine anywhere in the house.   However I removed Windows 10 and installed Ubuntu 16.04 instead and since I have had terrible Wi-Fi anywhere aside from about three foot away from the router. I don't know if it's relevant but my Wi-Fi is not called wlan0 but wlo1 for some reason (I didn't change it).  When running lspci -knn | grep Net -A3     I get the following output:  05:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter [10ec:b723] DeviceName:   Subsystem: Hewlett-Packard Company RTL8723BE PCIe Wireless Network Adapter [103c:81c1] Kernel driver in use: rtl8723be Kernel modules: wl, rtl8723be


Viewed the list of applications that use Wi-FI and came across what is shown on the image below.    What it is? Virus? Instead of Google I use F-Droid. Root is there, but only Total Commander and Titanium Backup are available.  Phone - Samsung Galaxy J1 Mini.  Rooted, twrp.  In applications "10005" does not exist. Titanium Backup was deleted 2 month ago.  After installing Dr.Web 10005 disappeared. But from 15.11.2018 to 12.12.2018  "10074" exist.

There is a mysterious app, 99070 that is consuming power on my Nexus 5X. Any idea how I determine what it is?  There is no option to stop or uninstall it. My phone is a Nexus 5X running stock Android 6.0.


I would like to know if it is possible to convert an enum key to a string and a string to an enum key like follow:  enum AllGameSettingsLabels {     Options_Controls_Joystick_Sensitivity,     Options_Display_Screen_Resolution,     Game_Character_Name     // ... }  IDictionary<AllGameSettingsLabels, string> settings = new Dictionary<AllGameSettingsLabels, string>();  settings[AllGameSettingsLabels.Parse(AllGameSettingsLabels.Joystick_Sensitivity.ToString() + "_Player_1")] = (0.25).ToString();   I was trying to come up with an easy way to manage all the game settings and later converting them to JSON.

What's the best way to convert a string to an enumeration value in C#? I have an HTML select tag containing the values of an enumeration. When the page is posted, I want to pick up the value (which will be in the form of a string) and convert it to the corresponding enumeration value. In an ideal world, I could do something like this: StatusEnum MyStatus = StatusEnum.Parse("Active");  but that isn't a valid code.


if given a positive integer $n$ is the sum of the $n$ smallest odd numbers equal to $n^2$

How to derive this formula?   $$n^2=\sum_{k=1}^n(2k-1).$$


I can't seem to be able to answer protected questions here on Meta, where I have 97 reputation (as of writing). The text says that I must have at least 10 reputation, but I obviously have more.

Questions can be protected (i.e. marked "highly active").   What does it mean for a question to be protected? Why are some questions protected? Who can protect and unprotect questions? Who can answer a protected question? How are protected questions displayed? When should I protect or unprotect a question? When does the Community user protect a question?


I am trying to break 2 loops in Python, with one loop inside the other. Of course, when you use the break function in a loop it will only break the loop it's in. Here's the code:  while True:   #Want to break this     x, y, z = sense.get_accelerometer_raw().values()     x = abs(x)     y = abs(y)     z = abs(z)     sense.show_message(strftime('%H:%M', gmtime()), scroll_speed= 0.05, text_colour=[0, 255, 0], back_colour=[255, 0, 0])     if x > 2 or y > 2 or z > 2 :   #Want to break this as well         break #Break goes here??   I want to break the loop started on the top line and the loop started in line 7. How?

Given the following code (that doesn't work):  while True:     #snip: print out current state     while True:         ok = get_input("Is this ok? (y/n)")         if ok.lower() == "y": break 2 #this doesn't work :(         if ok.lower() == "n": break     #do more processing with menus and stuff   Is there a way to make this work? Or do I have do one check to break out of the input loop, then another, more limited, check in the outside loop to break out all together if the user is satisfied?


Console utility to know how disk space is distributed.  Something like this:    But with console interface in Linux?

I'm looking for a linux alternative to . I would like to know what is taking up space on my hard drives.  A program that works on console and doesn't require a UI is preferred .


I’m modeling an address book and have a mesh with tabs (UV mapped). I’ve created one .png with a paper surface image and the letters of the alphabet in black. Animated a slow camera pan. After rendering a targa sequence the texture appears in place but there seems to be another texture or layer or grain that doesn't move. Its mostly noticeable around the black fonts but once you see whats going on its everywhere. Almost as if there is a slight transparency.  Blender 2.76 / Cycles  Link to project file and short .mov   Thanks!

I created a scene in which the camera goes towards a cylinder with a rock texture on the inside. But from whatever angle I play it, there is this weird noise, but unlike regular noise, it stays the exact same and follows the camera.  It is like there is a picture on the camera that has an Overlay like blending mode and just shows between the camera and the texture. Does anybody have an Idea where this texture may be coming from? Here is .


I'm trying to prove the following proposition by induction for all $n \in \mathbb{N} $ and $n \geq 2 $ $$ \sum_{j=1}^{k} \frac{1}{\sqrt{j}} \gt \sqrt{k}  $$ However, I haven't been able to find a way to insert the induction hypothesis into the induction step to prove that this inequality holds for $n = k +1$. A detailed,  step-by-step explanation would be very much appreciated.

I am just starting out learning mathematical induction and I got this homework question to prove with induction but I am not managing.  $$\sum\limits_{k=1}^{n}{\frac{1}{\sqrt{k}}\ge\sqrt{n}}$$  Perhaps someone can help me out I don't understand how to move forward from here: $$\sum\limits_{k=1}^{n+1}{\frac{1}{\sqrt{k}}+\frac{1}{\sqrt{n+1}}\ge \sqrt{n+1}}$$ proof and explanation would greatly be appreciated :) Thanks :)  EDIT sorry meant GE not = fixed :)


I think I noticed a mistake in Ready Player One:     In the OASIS, you could become whomever and whatever you wanted to be, without ever revealing your true identity, because your anonymity was guaranteed.   It’s supposed to be whoever right?

On the subject of "whoever" and "whomever", I was reading this but I am still confused:   What is the correct use of whoever/whomever in the following sentence?     I like your copy, congratulations, whoever is writing it.   Whoever? Whomever?   Is there a difference between US and UK English?


I've one found of those printer data cables that have some kind of pair integrated circuit along them, one at each end just before the plugs, I was wondering if there is a less invasive way of determining the specs for them other than slicing their enclosure.  I'm sure it will be fine in doing so, and I know I'm over thinking this just a tad but I just feel uncomfortable with a pair of IC that isn't detected by windows, and if it were some kind of spying boom doogle it would probably have some kind spring/pressure based mechanism that wipes the microcontroller's programming or something of that nature  complete novice in this field apologies for any misuse of terminology and or incorrect terminology.

I was messing around with a USB camera. I wanted to change the cable because is trimmed but as I was cutting it I saw a small thing (image below). As I was trying to cut the casing and see what it has inside I saw a spark. I tried to connect it with another cable but I don't know if I'm gonna damage the camera or the USB port.    What is it and can I connect the camera without it?


I've just installed Ubuntu 16.04 on my HP Pavilion Laptop. However, the wifi won't connect unless I'm too close to the router! Upon reading on the issue, I followed the instructions  to generate a wireless-info.txt file containing the details needed to diagnose the issue. Here is the link to txt file:   I hope some expert can help me solve this problem given the info in the link above.

I have installed Ubuntu 15.04 on my laptop with RTL8723BE Wi-fi card. But it is always disconnecting from network. I have tried echo "options rtl8723be fwlps=N ips=N" | sudo tee /etc/modprobe.d/rtl8723be.conf but that didn't helped. What can I do to prevent the wifi from disconnecting? If I upgrade to kernel 4.X, will it help?  ~$ lspci -knn | grep Net -A2  09:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter [10ec:b723]     Subsystem: Hewlett-Packard Company Device [103c:2231]     Kernel driver in use: rtl8723be   ~$ rfkill list 0: hci0: Bluetooth     Soft blocked: yes     Hard blocked: no 1: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no   ~$ ifconfig && iwconfig && route -n && ping -c 1 google.com eth0      Link encap:Ethernet  HWaddr 38:63:bb:cd:4a:7e             UP BROADCAST MULTICAST  MTU:1500  Metric:1           RX packets:3 errors:0 dropped:0 overruns:0 frame:0           TX packets:53 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:752 (752.0 B)  TX bytes:8445 (8.4 KB)  lo        Link encap:Local Loopback             inet addr:127.0.0.1  Mask:255.0.0.0           inet6 addr: ::1/128 Scope:Host           UP LOOPBACK RUNNING  MTU:65536  Metric:1           RX packets:3870 errors:0 dropped:0 overruns:0 frame:0           TX packets:3870 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:0            RX bytes:314613 (314.6 KB)  TX bytes:314613 (314.6 KB)  wlan0     Link encap:Ethernet  HWaddr c0:38:96:6d:c4:83             inet addr:192.168.1.205  Bcast:192.168.1.255  Mask:255.255.255.0           inet6 addr: fe80::c238:96ff:fe6d:c483/64 Scope:Link           UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1           RX packets:15240 errors:0 dropped:0 overruns:0 frame:0           TX packets:14627 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:14410285 (14.4 MB)  TX bytes:2192744 (2.1 MB)  eth0      no wireless extensions.  wlan0     IEEE 802.11bgn  ESSID:"DIR-615"             Mode:Managed  Frequency:2.437 GHz  Access Point: 00:90:4C:08:00:0D              Bit Rate=150 Mb/s   Tx-Power=20 dBm              Retry short limit:7   RTS thr=2347 B   Fragment thr:off           Power Management:off           Link Quality=70/70  Signal level=-22 dBm             Rx invalid nwid:0  Rx invalid crypt:0  Rx invalid frag:0           Tx excessive retries:0  Invalid misc:186   Missed beacon:0  lo        no wireless extensions.  Kernel IP routing table Destination     Gateway         Genmask         Flags Metric Ref    Use Iface 0.0.0.0         192.168.1.1     0.0.0.0         UG    400    0        0 wlan0 169.254.0.0     0.0.0.0         255.255.0.0     U     1000   0        0 wlan0 192.168.1.0     0.0.0.0         255.255.255.0   U     0      0        0 wlan0 PING google.com.Dlink (172.26.136.19) 56(84) bytes of data. 64 bytes from 19.136.26.172.in-addr.arpa (172.26.136.19): icmp_seq=1 ttl=249 time=102 ms  --- google.com.Dlink ping statistics --- 1 packets transmitted, 1 received, 0% packet loss, time 0ms rtt min/avg/max/mdev = 102.547/102.547/102.547/0.000 ms


I need to get rid of these jagged lines in my render. I created the text then used a wave modifier and converted the text to a mesh. I then added the velvet modifier and feel like it has something to do with the velvet modifier but may be wrong. Il attach another pic of the file nearer to completion and show how it is just a few vertices that ruin it! Cheers

this is a problem I face a lot when working with branding and typography. After importing vectors/typing, extruding and bending (simple deform or curve modifiers) it always come up with those ugly polygon artifacts:    Now, I know the cause of this is that the front faces of the text do not have the right topology nor enough polys to bend.  So, is there a good workflow to get rid of this without taking a huge load of time to retopo by hand or using the remesh modifier to an absurd high poly count?  Thanks


I just bought an Ubuntu running tower at a garage sale, and I thought it would be interesting to learn how it works. Unfortunately the people left an account on the device, but there are no files or anything on the drive. As they enabled automatic login I'm able to acces things like the terminal, but am unable to run anything as I don't know the password. If someone could tell me how to format it and completely start over it would be appreciated

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


I am facing the following improper integral: $$\int_0^\infty \frac{x^5\sin x}{(1+x^2)^3}dx.$$  Clearly the expression under the integral is a meromorphic function analytic on the nonnegative part of the real line and on the upper half plane (excluding the real line). I do not know how to proceed. I expect that we need to integrate over some larger path and use some residue formula. However we cannot integrate over a the border of a semicircle in the upper half plane increasing in radius because $\sin x$ becomes large as $\operatorname{Im} x$ becomes large. Moreover I do not see how to get from there to an explicit formula of the integral since through this method we would get the value of $$\int_{-\infty}^\infty \frac{x^5\sin x}{(1+x^2)^3}dx.$$  I do not really understand how I should proceed. I do not need a full answer but a hint (for example over which path to integrate or which formula or theory to use) should be enough.

I have no idea how to start, it looks like integration by parts won't work.  $$\int_0^{\infty}\frac{x^5\sin(x)}{(1+x^2)^3}dx$$  If someone could shed some light on this I'd be very thankful.