Can Sneak Attack be used when hitting with an improvised weapon?

The Mastermind rogue in my game was well hidden when he threw a flask of holy water at a shadow demon that attacked his ally. In the moment, it made the most sense to me to allow him to use Sneak Attack while hitting the fiendish creature with the flask.  The description of  says:     As an action, you can splash the contents of this flask onto a creature within 5 feet of you or throw it up to 20 feet, shattering it on impact. In either case, make a ranged attack against a target creature, treating the holy water as an improvised weapon. If the target is a fiend or undead, it takes 2d6 radiant damage. [...]   The rogue's  feature says:     [...] Once per turn, you can deal an extra 1d6 damage to one creature you hit with an attack if you have advantage on the attack roll. The attack must use a finesse or a ranged weapon. [...]   Now, post-session, I'm wondering whether Sneak Attack can actually be applied to an improvised weapon. I ruled it as a ranged weapon attack since he threw it, but now that I'm thinking about it: an improvised weapon might not be considered as a ranged weapon. And that would mean that a Sneak Attack could not have triggered when hitting with the flask. Unless an improvised weapon is also a ranged weapon when used as such. In that case, it could trigger.   I'm not sure which interpretation is correct according to the books. So, can Sneak Attack be used when hitting with an improvised weapon?


I just read about the coupon collector's problem where you're trying to find out how many coupons you need to collect on average before you get one complete set. This turns out to be $nH(n)$. I was wondering, how would you go about generalizing this problem to figure out how many coupons you would need on average to get N complete sets?


How can I merge properties of two JavaScript objects dynamically?

I need to be able to merge two (very simple) JavaScript objects at runtime.  For example I'd like to:  var obj1 = { food: 'pizza', car: 'ford' } var obj2 = { animal: 'dog' }  obj1.merge(obj2);  //obj1 now has three properties: food, car, and animal   Does anyone have a script for this or know of a built in way to do this?  I do not need recursion, and I do not need to merge functions, just methods on flat objects.


What can I remove from os 10.7.5 but still keep it running? I'd like to use the iMac as an extra peripheral hard drive, and want to make as much space as possible available for files instead of applications.


How can I check installed program versions in terminal. Is there any command for that, for example ver or something similar?


is it possible to display a Google Earth map INSIDE Excel?

Is there any way, using the scripting available to Excel 2007 to display a Google Earth map inside a sheet?  I've used Excel to house the data that I've then gone and generated a KML file to load into Google Earth, but now they want to see a pretty little cell with a client address mapped out in Excel directly to pretty up the presentation.


Regression in $p>n$ setting: how to choose regularization method (Lasso, PLS, PCR, ridge)?

I am trying see whether to go for ridge regression, LASSO, principal component regression (PCR), or Partial Least Squares (PLS) in a situation where there are large number of variables / features ($p$) and smaller number of samples ($n<p$), and my objective is prediction.   This my understanding:     shrinks the regression coefficients, but uses all coefficients without making them $0$.  also shrinks the coefficients, but also makes them $0$, meaning that it can do variable selection too.  Principal component regression truncates the components so that $p$ becomes less than $n$; it will discard $p-n$ components. Partial least square also constructs a set of linear combinations of the inputs for regression, but unlike PCR it uses $y$ (in addition to $X$) for dimensionality reduction. The main practical difference between PCR and PLS regression is that PCR often needs more components than PLS to achieve the same prediction error ().   Consider the following dummy data (the actual data I am trying to work with is similar):    #random population of 200 subjects with 1000 variables   M <- matrix(rep(0,200*100),200,1000) for (i in 1:200) { set.seed(i)   M[i,] <- ifelse(runif(1000)<0.5,-1,1) } rownames(M) <- 1:200  #random yvars  set.seed(1234) u <- rnorm(1000) g <- as.vector(crossprod(t(M),u)) h2 <- 0.5  set.seed(234) y <- g + rnorm(200,mean=0,sd=sqrt((1-h2)/h2*var(g)))  myd <- data.frame(y=y, M)   Implementation of four methods:      require(glmnet)   # LASSO   fit1=glmnet(M,y, family="gaussian", alpha=1)   # Ridge     fit1=glmnet(M,y, family="gaussian", alpha=0)   # PLS  require(pls)  fit3 <- plsr(y ~ ., ncomp = 198, data = myd, validation = "LOO")  # taking 198 components and using leave-one-out cross validation   summary(fit3)  plot(RMSEP(fit3), legendpos = "topright")   # PCR   fit4 <- pcr(y ~ ., ncomp = 198, data = myd, validation = "LOO")   The best description of the data is:    $p > n$, most of times  $p>10n$; Variables ($X$ and $Y$) are correlated with each other with different degrees.   My question is which strategy may be best for this situation? Why?


Trouble in overriding the equals(...) method in Java

I have a superclass Order which has a subclass OrderBook. The equals(...) method is overridden in the OrderBook. The method implementation is as follows:-  public boolean equals(Order o)     {         if(o==null){             System.out.println("object is null.");             return false;         }         if(o==this){             System.out.println("The object is itself.");             return true;         }         if(o instanceof OrderBook)         {             OrderBook o1 = (OrderBook)o;             if(!(o1.productId.equals(productId))){                 System.out.println("productId mismatch.");                 return false;             }             if(!(o1.customerId.equals(customerId))){                 System.out.println("customerId mismatch.");                 return false;             }             if(o1.book!=book){                 System.out.println("book mismatch.");                 return false;             }         }         return true;     }   I am encountering an unexpected output if I give the following statement:-  Order order1 = new OrderBook("Algorithms","Kunal",false); Order order2 = new OrderBook("Algorithms","Kunal",false); System.out.println(order1.equals(order2));   It should display true but its displaying false. Also, if I change the parameter in the equals(...) to Object o, then the whole program runs without any problem.   My doubt is that why are we using Object when we should be using Order?


how to properly save an architecture in a fpga ic forever

Considering I made an architecture to do some specific thing, wrote in vhdl, for example.  Can I 'burn' it in a fpga chip, forever? Or how should I do it, protecting the intelectual property knowing the fact it can be read from the serial flash memory?


Does entropy always increase with temperature?

For any system can we always say that entropy increases with temperature. In other words: $$\left(\frac{\partial S}{\partial T} \right)_{\{\alpha\}}\ge0$$ where $\{\alpha\}$ is the set of parameters held constant. Either way  can it be proved?


Deciding between Pre-Tax 401(k) and Roth 401(k)

Suppose I want to put 10% of my income in a 401(k). There are two options: (i) put it in a pre-tax 401(k) of a a Roth 401(k). If I expect the tax rates to be higher in the future, would this be a good strategy:   Put 2% of income into Pre-Tax 401(k) Put 8% of income into Roth 401(k)   Would this be better than putting 10% of income into a pre-tax 401(k) assuming that the tax rates go up in the future?


measure of set such that value of series is less than 1

Let $b_1,b_2,...$ be a given sequence of real numbers. Denote $a_n(x)$ by the summation from 1 to n of $\frac{1}{4^k|x-b_k|}$. Define a function $f$ from $\Bbb R$ such that $f(x)=\lim a_n(x)$ if the limit exists, else $f(x)$ equals infinity. Prove the measure of the set of value $x$ such that $f(x)<1$ is infinite. I am stuck on this problem since at first, I could not see that the set the problem asked is even nonempty! How do we even show this set has an infinite measure. How do we proceed with this problem? This one was from a problem set about Egorov and Lusin theorem. Any help would be appreciated.


A movie where coffee acts like alcohol on aliens

I'm trying to work out the name of a Science Fiction movie from the 80's where the female alien ( in human form ) drinks coffee by mistake and gets very drunk. It's all I remember from the film but I seem to remember it was really enjoyable! Any ideas?  EDIT - I remember space and spaceship were involved too!


If I give a user full modify access to folder 'foobar' located in path  foo/bar/foobar  Do I also need to manually give the user read access to foo and again to bar?  Or will the client only receive access to foobar when they manually map directly to /foo/bar/foobar?


Not able to sudo after running `chown -R username:usergroup /*`

I am fairly new to Ubuntu. I am currently using Ubuntu 14.04 version. I am stuck into a problem that my primary user account is not functioning after i ran a command chown -R username:usergroup /* on a secondary user.  I have two users in my machine. Both are administrator functionality. One  name is abc and other is root. abc is the primary user and i had run the command by the other user. Thereafter i am having this problem.    I can't able to login with the second user. Guest account is working fine but the other account is not. Sudo command is not working. Primary user UI is very slow and keep blinking every time. Shut down option not working.   Getting error message as "sudo: /usr/bin/sudo must be owned by uid 0 and have the setuid bit set" after running the sudo command


In my textbook, the inequality $$|a+b|^r\leq 2^{r-1}(|a|^r+|b|^r)$$ for any real number $a$, $b$ and $r\geq 1$, is called "elementary". It is not elementary to me, how do you prove it? I see that the inequality reduces to the triangle inequality if $r=1$ so I am more interested in $r>1$.


I cannot get to open my Python scripts saved in default directory: ....\QGIS\QGIS3\profiles\default\processing\scripts in QGIS 3.0 Processing Toolbox. There is no folder called Scripts like in 2.18.  Anybody knows how to open my Python script in Processing Toolbox of 3.0?


Prove that if a and b are integers, then there are unique integers q and r such that $a = bq + r$, $-|b|/2 < r \le |b|/2$

Prove that if a and b are integers, then there are unique integers q and r such that $$a = bq + r,$$ with the restriction that$$-|b|/2 < r \le |b|/2$$


Pages: How to put a word between horizontal rules

How can I make something that looks like this?  --------   Text   ---------  where the horizontal rules extend to the margin on either side?


Permissions issue when trying to update WordPress

I'm upgrading multisite to 3.5.1 and it did not allow me to do automatic upgrading I see this message:     "To perform the requested action, WordPress needs to access your web   server. Please enter your FTP credentials to proceed. If you do not   remember your credentials, you should contact your web host."   So I add the FTP credentials in wp-config.php but still does not work. I investigate and found out that Wordpress core files are owned by the root and not by my ssh username. Example of these files are the files in the wp-includes and wp-admin.  Is there a way to perform automatic upgrade of Wordpress multisite without having a root access?


First need to tell you that I am using this code:      .text.ellipsis {   position: relative;   font-size: 14px;   color: black;   font-family: sans-serif;   width: 250px; /* Could be anything you like. */ }  .text-concat {   position: relative;   display: inline-block;   word-wrap: break-word;   overflow: hidden;   max-height: 3.6em; /* (Number of lines you want visible) * (line-height) */   line-height: 1.2em;   text-align:justify; }  .text.ellipsis::after {   content: "...";   position: absolute;   right: -12px;    bottom: 5px; }   because I need to have multy-line ellipse for titles. And this part of code works.  but now I need to center vertically div inside div, and this part of code works partially.... I really tried everything but still cant fix the problem.  you can see here the live example:   Inside the blue div everything is fine, but below inside white div title for some reason sank, or in other words is not centered.  So I hope you can help me to center vertically div inside div, and it needs to work in IE8+  Thank you


Not quite an Attribute, not quite a Method. Stereotypes? <<get>> <<set>>?    I'm retro-modelling an existing system, so I need to clearly reflect that this is not the same as a readonly field or a methods pair (regardless of what the IL says), so I think I'll go with the stereotype, but I'll accept the language independant get_ set_ as a general solution. Thanks all for the sanity test.


In IE 9 you can type in whatever number you want to get the perfect zoom but in Chrome all I see is the + and - in the drop menu.  How do I choose a custom zoom and set it as the default?


Word for a person who talks without content

What is a word for a person who reiterates without adding any new content? (This person is not necessarily talkative per se.) Example of a conversation by such a person would be:     "You know if we do this xyz, it will be good. No one has done xyz so it is going to be great if we finish xyz, I don't think anyone has done this.  By summer if this is done then we can send xyz, of course we have to do it before and it's gonna be great and we have to keep doing xyz unless someone will do it, but no one has done it yet, it is going to be great if we do xyz."   It is not overzeal; it is just my example which came out to be like this.


How do I verify whether a population distribution is a power-law?

given a population of discrete values (not a sample), is there any way to check whether the distribution is a power-law, and with what parameters? Of course I can just plot the distribution and see its shape, but that does not allow me extract the power-law parameters.  Any help on how to do that is highly appreciated.


Is there anything special to know before using powdered vanilla?  I use the liquid vanilla extract quite a bit in making a lot of things, especially chocolate and key lime puddings but am looking for alcohol free and organic form. It sounds like the powdered form provides a stronger flavor which sounds good to me. Thank you for being there.  This is a tremendous offering for people who want to create great foods...


Please advise how I can install Ubuntu as a non-superuser. I am trying to install Ubuntu 14.04.3 onto my PC with Window 7 with dual boot. However, I see that the installation says that I am installing as a superuser after I selected Something Else as the Installation Type. I did not get the simple option to install Ubuntu Alongside Windows where I can select the partition size. Instead, I had the screen with multiple options/partitions.  Thanks


I've downloaded a blender file off Sketch-fab and I knew it was created with an older version of blender. I opened the file and every texture except for some blue emission thing.


How to set predefined screen Resoloution ( Display screen not connected )

I use Ubuntu MATE +Raspberry Pi 3.  While RPI is connected to an external display via HDMI, resolution is adapted automatically to screen res. BUT when ext. screen is not connected ( remote control via VNC ), screen res probably takes a default\ minimal res - 720X480.  How can I define a default res to be 1920X1080 if no ext display is detected ?


How do I counter the 7 roach rush build?

I recently saw an  that's even faster than the popular 5 roach rush build. This build gets to 7 roaches in about 4:40. How would I counter this build? I'm mostly Toss, but please suggest counters for any of the races.    Update: Apparently the original creators of the build optimization program are working on Protoss and Terran versions -


Scheduling 12 teams competing at 6 different events

I have a seemingly simple question.  There are 12 teams competing in 6 different events.  Each event is seeing two teams compete.  Is there a way to arrange the schedule so that no two teams meet twice and no teams repeat an event.  Thanks.  Edit: Round 1: All 6 events happen at the same time.  Round 2: All 6 events happen at the same time.  And so on until Round 6.


Show that for $\eta > 0$, $\alpha_\eta=-\infty$ and for the Cauchy problem $z'=x-z^2,z(0)=\eta$ the saturated solution is defined up to $+\infty$.

We consider the differential equation $y'=x+y^2$ and for any $\eta \geq 0$ we denote by $\phi_\eta:(\alpha_\eta,\beta_\eta)\rightarrow\mathbb{R}$ the unique saturated solution of the Cauchy Problem $y'=x+y^2$, $y(0)=\eta$. I am required to do the change of variable $z(x)=y(-x)$ and I succeded here, obtaining $y'(-x)=y^2(-x)-x$ and so $z'(x)=x-z^2(x)$, then I was required to represent the $0-isocline$ and it was also simple as I obtained a parabolla and also I was required to write the equation of the tangent in the point $(0,\eta)$ which was also pretty simple as I obtained $\phi'_\eta(0)=\eta^2$ and the equation of the tangent is $y=\eta+\eta^{2}x$. Now, I am required to find $\phi^{(5)}_0(0)$( that $5$ indicates the number of differentiations), which puzzles me as I don't know the form of the solution and if it can be found out and also I am told to show that $\frac{1}{\eta}\geq\beta_\eta$ What I did not prove after the first edit : and that for $\eta > 0$, $\alpha_\eta=-\infty$ and for the Cauchy problem $z'=x-z^2,z(0)=\eta$ the saturated solution is defined up to $+\infty$. At this last ones I am lost. Any help, please? Edit: I have passed beyond finding $\phi^{(5)}_0(0)$ and I think I did show that $\frac{1}{\eta}\geq\beta_\eta$, now it remains to prove the last questions.


This one was flagged in a random tag wiki editing I was doing:    I totally agree it's a useless tag. If anyone is curious as to what anti-golf supposedly is, before putting on my burninate useless tags cap, I'd come up with this:     Anti-golf is a hypothetical programming game, with the objective being   opposite to that of code golf.      The real and popular code golf programming game, involves finding   solutions in code to problems using the minimal amount of characters.      Anti-golf is a suggested counter model to the common game, by   implementing rules such as requiring longer code and ensuring the   program will fail if any single character is removed.      First evidenced proposal of the game was in 2002, by Peter Makholm on   the Perl Programming lists.


If diary Tom Riddle had succeeded, would there have been two Voldemorts?

As teenager Tom Riddle is speaking to Harry Potter in the Chamber of Secrets, both he and Harry are refering to the real Voldemort in the third person. If Tom Riddle had succeeded in sucking all the life energy out of Ginny and had come back alive, wouldn't that have meant there were two Voldemorts in the world? The wraith one which had lived in Quirrell, and the newly constituted one?  This Tom Riddle clearly doesn't have the memories of the wraith version.   As a bonus: If they both existed, would they have competed against each other?


is it possible to get app code from apk and customize it?

is it possible to get android socurce code from apk.  i had seen on some tutorial that shows the way to get code from apk just guessting if we can do it really .  please guide they way to do it if possible  i was able to get source code but issue is that when i try to run it in eclipse i see lots of error .


Left and right braces on different lines of align

\documentclass[a4paper,12pt]{article}  \usepackage{amsmath}  \begin{document}  \begin{align} A = \max\left{B \\     & C \right}.  \end{align}   \end{document}   My expressions B and C are so long that they need to be on different lines. But then TeX doesn't accept left and right braces being on different lines. What can I do?


Is it possible to synchronize userscripts between Google Chrome installations?

I've noticed that userscripts aren't automatically synchronized like (regular) extensions in Google Chrome.   Is there any way to ensure that userscripts are synchronized between Chrome installations?


If $f:(a,b)\to \mathbb{R}$ is differentiable in a point $x\in (a,b)$,   show that $\lim\limits_{h\to 0}\frac{f(x+h)-f(x-h)}{2h}$ exists and   that it is equal to $f'(x)$.   I figured that since the change in $x$ is described trough $2h$ that there is a $\delta$-neighbourhood around $x$ such that $|x-h|=|x+h|$. Sadly, I don't know how to make use of that argument in my proof. I know for a fact that the quotient describes to neighborhoods that, when $h\to 0$, squeeze the point.


Splitting a large document into several files

Why is it recommended to split a large document into several parts and include them with \include? Is it only a relic of the past times when computers and LaTeX compilers were slower, or is it still up-to-date? What are the pros and cons of this practice, also in terms of interaction with other external tools (version control, find/replace, et cetera)?  Motivation: I've found a recent discussion that mentions this practice ( , ), as well as a comment that criticizes it in an answer to . A couple of months ago, I asked the same question in a comment to , but it's probably better to ask this here again as a "real question".


Question on multiple entry Schengen visa

I'm an Indian residing in the UK. I have multiple entry short term Schengen visa which I have used multiple times to visit many Schengen countries as tourist. Is it possible for me to use the same visa to visit a Schengen country for attending a conference? Should I carry any specific documents?


Frequency dependence of electromagnetic reflection

I was surprised to see that the Fresnel equations for reflection depends on refractive index and angle of incidence, but they do not depend on frequency. Why is this case? Are they restricted to regions that do not show frequency dependence?


Replace text in file with variable using sed

I need to replace a string in a file by another string which is stored in a variable. Now I know that   sed -i 's|sourceString|destinationString|g' myTextFile.txt   replaces a string but what if destination String was a combination of a hard coded string and a variable?  myString="this/is_an?Example=String" sed -i 's|sourceString|${myString}destinationString|g' myTextFile.txt   The latter doesn't work, since $myString is not interpreted as a variable.


Can we prove that {U1+U2} (fractional part of sum of two uniforms(0,1) ) is also uniformly distributed in [0,1]?


cd command to navigate to external hard disk which is already mounted

I m new to ubundu and need help. I plugged an external USB hard drive into my laptop and its icon is shown on desktop with name 'New Volume'. how to navigate into this drive using cd in linux. I tried cd New Volume and got error as bash: cd: too many arguments . I tried df -hk and found my disk as dev/sdb5       1.9T  1.9T  2.7G 100% /media/alok/New Volume I also tried cd media/alok/New Volumeand got the same error bash: cd: too many arguments kindly provide the command to navigate. Thanks


Using a diode to ensure current flows in only one direction, without causing a voltage drop

To power my microcontroller (ATmega8), I am using a ~5.4V voltage source. I want to ensure that I don't accidentally connect the voltage source in reverse, and figured a diode would be a nice way to accomplish this as from what I have learned so far, a diode allows current to flow in one direction, and blocks it in the other.  But what I also learned is that diodes create drops in voltage. I have a few of the typical diodes (1N4001, 1N4148, etc.), and would like to use them to achieve the aforementioned result without dropping the voltage as it would be too low to power the IC.  My question is, is there any way to do this with a diode? Or do I need some other component (if so, what would you recommend)?


How do you effectively disinfect a large amount of toys?

I work at a nursery and I have a hard time managing the toys that the kids play with. I watch them put things in their mouths, cough and sneeze on the toys, and throw everything on the ground. Even though I see all of these things, it is hard to find the time to clean all of the toys, simply because there are too many and I do not have that much time. Any input would be appreciated!


Other ways to say 'take your time' / 'whenever you can' / 'no rush'?

Are there other ways to say Take your time?  I know:   Whenever you can It's not (terribly) urgent No rush   Any other ideas?


Recommendation for a Download Manager for ubuntu?

I've heard about:   JDloader,  ,   etc.    But what are the pros and cons of these softwares? Which one would you suggest to me to be the most reliable and fastest?  Thanks Jye


Is $\mathcal{O}_{\mathbb{Q}(\sqrt{5})} = \mathbb{Z}[\phi]$?

Is $\mathcal{O}_{\mathbb{Q}(\sqrt{5})} = \mathbb{Z}[\phi]$, where $\phi={1+\sqrt{5}\over 2}$ is the golden ratio?  I know that $5 \equiv 1 \mod 4$, so that then $\mathbb{Z}[\sqrt{5}]$ is not closed as far as integers go. But I'm a little confused cause  $\mathcal{O}_{\mathbb{Q}(\sqrt{-3})} = \mathbb{Z}\left[-\frac{1}{2} + \frac{\sqrt{-3}}{2}\right]$? So how do I know when to use $\frac{1}{2}$ rather than $-\frac{1}{2}$? Which one applies for $\mathcal{O}_{\mathbb{Q}(\sqrt{5})}$?


Wi Fi Sleep policy doesn't work on Galaxy Mini

Set the WiFi Sleep policy as 'never' but when my new Galaxy Mini is in sleep mode wi-fi is turned off. I tried with a few apps like 'Keep WiFi' without success. Is anybody out there who actually got the same problem and solved it?


What does +-? mean in the output of service

I would like to know what does +, - and ? mean in the output of  service --status-all. For example:   [ + ]  acpid  [ - ]  anacron  [ - ]  apparmor  [ ? ]  apport  [ + ]  atd


Norm Equals Supremum of Inner Product when ||w||=1?

Let $V$ be an inner product space, and $v\in V$. I want to show that $$||v||=\sup\{\langle\,v,w\rangle:||w||=1\}$$  What I know:  Since this is a generic inner product, $||v||=\sqrt{\langle\,v,v\rangle}$. So, if $||v||=0$ then $v=0$. The equality is trivial if $v=0$, so I know I need to consider when $v\neq 0$. Also, we have that $||w||=1$ this implies that $w=\frac{v}{||v||}$ if we use it in terms of $v$.  I am not sure if I am pulling the correct information, but I am confused on how to proceed to prove the equality statement.


How to check option is set to bash script?

I'm creating a basic bash script which deploy a simple webapp. My current code is as follows.  #!/bin/bash clear  echo "********************************************"; echo "Hello, I'm going to deploy the QuizProject"; echo "********************************************";  git pull --all;  #Only need to execute if option is present composer install;  echo "********************************************"; echo "All the jobs done! Cheers"; echo "********************************************";   At the moment I'm running this script in the command as  bash deploy.sh   But this will execute all the commands in the bash file.  I want to make it if specific command is passed then only run the "composer install"  bash -composer deploy.sh


Prove that $7\mid n^7+7n^3-n$ for every positive integer n.

Let $P(n)=7\mid n^7+7n^3-n$ for integers $n\ge 1$. Then $P(1)$ is true because $1+7-1=7$ is multiple of $7$. Assume that $P(n)$ is true and $n\in \mathbb{Z}$ and $n\ge 1$. Then $P(n+1)$ is true because; $n^7+7n^3-n=7m$ for some natural number $m$ So, $$(n+1)^7+7(n+1)^3-(n+1)=...$$ I'm stuck here, and I can't continue the proof. Can you help?


Problem in proving that the radical of an ideal is an ideal

Copy from my exercise book:     Let $R$ be a commutative ring (not necessarily with identity). For an   ideal $A \subseteq R$ we define the radical $\sqrt{A}$ of $A$ by   $$\sqrt{A}:=\{x \in R : x^n \in A \text{ for some } n \in  \mathbb{N}\}$$   Now I should show that $\sqrt{A}$ is an ideal in $R$. Everything is easy except the part where I should show that if $x \in \sqrt{A}$, then also $-x \in \sqrt{A}$. My idea was to show, that $x^n \in A$ for some $n \in \mathbb{N}$, then also $(-x)^n \in A$. Intuitively we should end up with something like $(-x)^n = \pm$ but I am not sure how to prove it. The solutions in the book are rather confusing, since they say something like since $R$ has identity...what was not assumed in the exercise.


RAW, Can two weapon fighting be used with nets?

Two weapon fighting has a clause that seems to imply the weapon need not be a melee weapon, if it has the thrown property.     When you take the Attack action and attack with a light melee weapon that you're holding in one hand, you can use a bonus action to attack with a different light melee weapon that you're holding in the other hand. You don't add your ability modifier to the damage of the bonus attack, unless that modifier is negative. If either weapon has the thrown property, you can throw the weapon, instead of making a melee attack with it.   Can you two weapon fight with non melee thrown weapons, such as a net?  Assume that that the attacker has the dual wielder feat.


Using SQL functions in conditionals in Drupal 7 db_select()

I am trying to write a condition into a SQL WHERE clause that forces the column comparison to a variable to be compared in lowercase. However the addExpression function isn't accomplishing this (since that is putting the expression in the field selection, not the where clause.  Here is what I have tried:  $category = 'mobile wifi'; $query = db_select('taxonomy_term_data', 'ttd')     ->fields('ttd', array('tid')); $query->innerJoin('taxonomy_vocabulary', 'tv', 'ttd.vid = tv.vid'); $query->addExpression("LOWER(ttd.name) = $category"); $result = $query->condition('machine_name', 'images_cat', '=')     ->execute()     ->fetchAssoc();   And this:  $category = 'mobile wifi'; $query = db_select('taxonomy_term_data', 'ttd')     ->fields('ttd', array('tid')); $query->innerJoin('taxonomy_vocabulary', 'tv', 'ttd.vid = tv.vid'); $result = $query->condition('machine_name', 'images_cat', '=')     ->condition('LOWER(ttd.name)', $category, '=')     ->execute()     ->fetchAssoc();   The second one becomes invalid and the first one causes the problem I mentioned above. Any thoughts or suggestions?  Thanks, Patrick


Understanding the shape of confidence interval for polynomial regression (MLR)

I have difficulties to grasp the shape of the confidence interval of a polynomial regression.  Here is an artificial example, $\hat{Y}=a+b\cdot X+c\cdot X^2$. The left figure depicts the UPV (unscaled prediction variance) and the right graph shows the confidence interval and the (artificial) measured points at X=1.5, X=2 and X=3.  Details of the underlying data:   the data set consists of three data points (1.5; 1), (2; 2.5) and (3; 2.5). each point was "measured" 10 times and each measured value belongs to $y \pm 0.5$. A MLR with a poynomial model was performed on the 30 resulting points. the confidence interval was computed with the formulas $$ UPV=\frac{Var[\hat{y}(x_0)]}{\hat{\sigma}^2}=x_0'(X'X)^{-1}x_0 $$ and $$ \hat{y}(x_0) - t_{\alpha /2, df(error)}\sqrt{\hat{\sigma}^2\cdot x_0'(X'X)^{-1}x_0}  $$ $$ \leq \mu_{y|x_0} \leq \hat{y}(x_0) + t_{\alpha /2, df(error)}\sqrt{\hat{\sigma}^2\cdot x_0'(X'X)^{-1}x_0}  . $$ (both formulas are taken from Myers, Montgomery, Anderson-Cook, "Response Surface Methodology" fourth edition, page 407 and 34)   $t_{\alpha /2, df(error)}=2$ and $ \hat{\sigma}^2=MSE=SSE/(n-p)\sim0.075 $ .  I am not particularly interested in the absolute values of the confidence interval, but rather in the shape of the UPV which only depends of $x_0'(X'X)^{-1}x_0$.  Figure 1:    the very high predicted variance outside the design space is normal because we are extrapolating but why is the variance smaller between X=1.5 and X=2 than on the measured points ?  and why does the variance gets wider for values over X=2 but then diminishes after X=2.3 to become again smaller than on the measured point at X=3?   Wouldn't it be logical for the variance to be small on the measured points and big between them ?  Edit: same procedure but with data points [(1.5; 1), (2.25; 2.5), (3; 2.5)] and [(1.5; 1), (2; 2.5),  (2.5; 2.2), (3; 2.5)].  Figure 2:   Figure 3:   It is interesting to note, that on figure 1 and 2, the UPV on the Points is exactly equal to 1. This means that the confidence interval will be precisely equal to $ \hat{y} \pm t_{\alpha /2, df(error)}\cdot \sqrt{MSE} $. With an increasing number of points (figure 3), we can get UPV-values on the measured points which are smaller than 1.


SQL Server 2012 with large log file, what choice to take?

i have a windows application that connects with a SQL Server 2012 database. This database is huge and yesterday, all the query's of the application give time out and we found that the log file was in the max size that was configured. So we change the size (it was in 8gb) to 16gb but we think that this was a temporary solution.   What solution should i take with this?  Edit: Because the "marked as duplicate question" appear i wanna edit this post to remark that i don't want to ask how to clear the transaction log. My question points to what is the best option to take in this scenario, maybe is to clear the transaction log but maybe there are another options too. Sorry if the users misunderstood the question.


How do I set executable permissions on a removable drive?

I'm using Ubuntu 10.10 and using a usb drive but I'm finding that I can't chmod any programs on the drive to +x. It is being auto-mounted by Gnome (using udev, I think?) so I imagine the problem is a mount option but I can't seem to find a way to modify the default mount options any where. There are no entries in fstab. Anybody encounter this problem?


Proving that every set $A \subset \Bbb N$ of size $n$ contains a subset $B \subset A$ with $n | \sum_{b \in B} b$

If $n\in \Bbb N$, $A\subset \Bbb N$, $|A|=n$, how to prove that there exists a subset of $A$ such that the summation of its element is divisible by $n$?


How can I boost my download speed for the softwares I download from ubuntu software centre?

I have a lan connection with average download speed of about 5-6 MBps. But ubuntu software centre doesn't download at that speed. I even checked my speed by downloading from other sources but they were giving a download speed in Mbps. Is there a way I can boost up speed because downloading packages as big in Giga Bytes can become cumbersome at speed of 70-100 Kbps.


Getting Response size exceeded 15MB organization limit on VF page

I am getting the Response size exceeded 15MB organization limit error when i clicked a button from VF page which is not able to trace in debug logs and the debug log as follows:  Number of SOQL queries: 1 out of 100   Number of query rows: 550 out of 50000   Number of SOSL queries: 0 out of 20   Number of DML statements: 0 out of 150   Number of DML rows: 0 out of 10000   Maximum CPU time: 0 out of 10000   Maximum heap size: 0 out of 6000000   Number of callouts: 0 out of 100   Number of Email Invocations: 0 out of 10   Number of future calls: 0 out of 50   Number of queueable jobs added to the queue: 0 out of 50   Number of Mobile Apex push calls: 0 out of 10  07:56:46.406 (3406940521)|CUMULATIVE_LIMIT_USAGE_END


Edge browser stopped working after upgrading to Windows 10 October 2018 Update (version 1809)

After upgrading to Windows 10 October 2018 Update (version 1809), Microsoft Edge browser can't load any web site or even resolve a DNS name. IE11, Chrome and Firefox still work OK.


How do you access the command line or run option to put the commands into the system?


Anyone know of a way to remove Steam from Ubuntu 12.04? Looked around the net but could not find an straight forward solution.    Thanks.


Interpretation of the expiry date on a Schengen visa

I am South African and intend visiting Greece and my existing Schengen visa, but the visa expires on the day I fly back - my question is technical, my visa expire on the 7th, does the visa expire at 12pm on the 6th or 12pm on the 7th - If I board my plane on the 7th will I still be "legal" or do I need to change my flight to the 6th?


Emacs - regular expressions in Lisp need to be double-escaped - why?

I've been playing around with emacs lisp, and I wanted to write a little function to do a regular expression search and replace.  I had a heck of a time getting the regular expression to work correctly because I didn't realize that all the special characters need to be double escaped when writing lisp code (but not when using query-replace-regexp interactively!).    So for example, using query-replace-regexp interactively you can use   ^\(.*\)[\t]-.*$   but when writing elisp code you need to double escape everything like so:   ^\\(.*\\)[\t]-.*$     I finally found a reference to this in a Steve Yegge , but I was wondering if anyone knew why this is?


How can we prove that $\displaystyle \frac{n^2!}{(n!)^2}\in \mathbb{Z}\;,$ Where $n\in \mathbb{N}$  $\bf{My\; Solution::}$ Using The formula $n^2! = (2n)!\cdot (2n+1)\cdot(2n+2)\cdot\cdot \cdot \cdot n^2$  So $\displaystyle \frac{n^2!}{(n!)^2} = \frac{(2n)!\cdot (2n+1)\cdot (2n+2)...........(n^2)}{n!\cdot n!}=\binom{2n}{n}\times \bf{Integer\; quantity}\in \mathbb{N}$  My Question is How can we solve combinatorial way or any other way.  Plz explain me  Thanks


Short story about astronauts being killed one by one by a non-corporeal alien entity on a deserted planet

This science fiction short story is about a team of astronauts/space explorers who land on an alien planet. An alien entity, that exists in a gaseous state, is lurking at the bottom of a well or hole. It briefly inhabits the body of each astronaut it encounters, seeing from their POV and causing them to go crazy/die/kill the others. When one man dies the entity jumps into the body/mind of another.  The story is narrated by the alien entity, and everything is from its point of view. It overhears the astronauts' conversations as they try to figure out what is happening.   It is a stand-alone short story (maybe 6 or 7 pages), and it is not part of a larger novel. I have a feeling this may be one of Ray Bradbury's later short stories (but I could be wrong). I must have encountered this story in an anthology of relatively well-known scifi stories. I read it around 2007, but the story is probably from the 1960s/1970s.


suppose I have a script file "display.sh" which displays some output.  Name -Xander   Age-29       //   Step 1           I want to add something extra to this output.  Name -Xander Age-29 occupation-Cricketer //extra stuff   Now when I give command display.sh, only Step 1 should display But when I give command (display.sh -t or -f or anything) both step 1 and extra stuff should display  How this last part can be achieved??


Number of restricted ways to two-color a necklace

There are $n$ beads placed on a circle, $n\ge 3$. They are numbered in random order as viewed clockwise. Beads for which the number of the previous bead is less than the number of a next bead are painted in white color,and others - in black.  Two colorations that can be made equal by rotation are considered identical. How many different colorations can occur?


How to AES encrypt a link within Marketing Cloud and decrypt it in a third Party system

I currently have the following problem: I am working in a Marketing Cloud Email and need some of my customers attributes to be stored in a Json and then to be aes-256 encrypted. The resulting string should then be a part of a link and decrypted by a third party system to use in their part of the customer journey. I am currently struggling to find a way to encrypt the Json I created in a way that it can be decrypted by the third party system. I tried using the EncryptSymmetric function with a password or with a symmetric key but I can’t seem to get the decryption done afterwards. Is there a „best way“ on how to handle such a problem? Thanks for any help. Best regards, Felix


Proving by induction that $\sum\limits_{k=2}^n \frac1{k^2}\le 1$

I'm having trouble proving this by induction. We need to show that $P(k+1)$ is true: $$\sum_{i=2}^{k+1} \frac{1}{i^2}\leq 1.$$  Don't know where to go from here. Any help?


Entry into US with unpaid medical bills and ticket for careless driving

While on vacation in the US last year, my wife and I was in a traffic accident. My wife had to spend more than a week in hospital before we could fly home. Our insurance is covering everything, but we keep receiving more bills in the mail. We are forwarding the bills to our insurance company, who tells us that they are taking care of them, but they are probably not paying them immediately (I expect there are a lot of paperwork involved). We can see that some of the invoices have strange addresses on them and have taken a long time to reach us, so we are a bit worried that there might be others that haven't reached us yet.  Also, since the accident was partly my fault, I received a ticket for careless driving, which I have paid.  We are going back to the US in a few weeks on vacation. Can any of this give us problems in immigration or elsewhere? Is there anything we should do or special papers we should bring?


fsck also doesn't work, there's just a black screen with the process saying started and starting, and it doesn't do anything from then on. Ubuntu worked fine when I installed it, but when I restarted it didn't work. I have 3 hard drives, and I used one for Ubuntu the other two for my Windows 10. I have saved files on Ubuntu that I don't want to lose.  When I boot normally this happens. I used a USB to install Ubuntu 19.04 from the official Ubuntu website, and I used Rufus to create the Ubuntu 19.04 live USB.


In a camera ready paper (has been accepted), how to cite my own paper that is still under blind review?

Please Note I am asking how to cite a paper under blind-reviewed in an accepted paper, NOT a new paper to be submitted.   Chronologically,   First, I submitted paper A that requires double-blind review.  Then, I cite it in another paper B. (In paper B, I explained that paper A is not available since it is under a double-blind review process) Paper B is accepted while paper A is still under review. Now I have to submit the camera ready version of Paper B before the notification of Paper A.   Solution I  Put my blind review article into a pre-print archive (e.g. arXiv) so that it can be available for citing. But, would it "spoil" the blind review process?  Solution II  place an anonymized version of paper A in a dropbox folder and cite it with a link to that dropbox file in the reference.  (Inspired by dsfgsho's answer to )  What's the better solution? Is there any other solutions?    Related Questions:    (for a new paper)


Foreword.  Since light can't escape from a black hole, we can assume that light is influenced by gravity.  So I can imagine that light that would otherwise escape from a black hole is in fact restrained/slowed from the gravity in the black hole.  A light ray/photon that is going in direction of a black hole can also be accelerated from black hole gravity? In this case is light going faster that light speed?  Argue each point if i'm wrong.


Is the wavefunction of particles inside a gas spread or localized?

For an individual free particle that starts localized, the wave function packet spreads over time, so the particle becomes less localized.  Suppose now that we have a gas of those particles inside a box, and we allow them to collide (using some potential): will the wave function of each particle still spread indefinitely, or do collisions act as a source of decoherence and the wave function relocalizes again? I have heard both arguments by different colleagues, even in textbooks. Has anybody made a computer simulation that shows what would be the best picture?


I have jobs installed in my system and it works indeed. However, when I typed   man jobs   and pressed enter, the terminal told me   No manual entry for jobs   Do you have the same problem? Or how can I solve it?


I am experimenting with multiple integrals and volume (and area) elements.  I can write the integral,   $A = \int_a^t{\left|f\left(x\right)\right|dx} $,    as   $A = \int_a^t{\int_0^{\left|f\left(x\right)\right|} dy \, dx} $    but writing it as   $A = \int_{ {a \le s_x \le t} \; \wedge \; {0 \le s_y \le \left|f\left(s_x\right)\right|}} ds$    gets ugly and long and I would like to collapse the conditions into a column sort of like with   $A = \int_{ \overset{a \le s_x \le t}{0 \le s_y \le \left|f\left(s_x\right)\right|}} ds$    but with both conditions being the same size.  How do I stack multiple conditions in a column in math mode?


Galois Extension and Galois Group for $Q(\sqrt{2+\sqrt{2}})$

I just need a little bit of help verifying and finishing this problem off:  Show that $\mathbb{Q}(\sqrt{2+\sqrt{2}})/\mathbb{Q}$ is a Galois Extension, and determine the structure of the Galois group.  proof:   Note that char$(\mathbb{Q})=0$, thus $\mathbb{Q}$ is perfect, that is, all irreducible polynomials in $\mathbb{Q}[x]$ are separable. Consider the polynomial $$p(x)=x^4-4x^2+2 \in \mathbb{Q}[x]$$ This is the minimal polynomial of $\sqrt{2+\sqrt{2}}$   over $\sqrt{2+\sqrt{2}}$. We also know that $$p(x)= \bigg(x-\sqrt{2+\sqrt{2}}\bigg)\bigg(x+\sqrt{2+\sqrt{2}}\bigg )\bigg(x+\sqrt{2-\sqrt{2}}\bigg)\bigg(x-\sqrt{2-\sqrt{2}}\bigg)$$ over $\mathbb{R}[x]$. So $p(x)$ is irredcible and has no repeated roots, i.e., $p(x)$ is separable. Now we show that $\mathbb{Q}(\sqrt{2+\sqrt{2}})$ is a splitting field over $\mathbb{R}$ for $p(x)\in \mathbb{Q}[x]$ in order to show that $\mathbb{Q}(\sqrt{2+\sqrt{2}})/\mathbb{Q}$ is a Galois Extension. Again for $$p(x)= \bigg(x-\sqrt{2+\sqrt{2}}\bigg)\bigg(x+\sqrt{2+\sqrt{2}}\bigg )\bigg(x+\sqrt{2-\sqrt{2}}\bigg)\bigg(x-\sqrt{2-\sqrt{2}}\bigg)$$ let $\alpha_1= \sqrt{2+\sqrt{2}}$, $\alpha_2=-\alpha_1$,  $\alpha_3=\sqrt{2-\sqrt{2}}$  and  $\alpha_4=-\alpha_3$. It is obvious that $\alpha_1,\alpha_2 \in \mathbb{Q}(\sqrt{2+\sqrt{2}})$. To show that $\alpha_3 \in \mathbb{Q}(\sqrt{2+\sqrt{2}})$, first consider $\alpha_3$ to be a element of $R$. Observe that $$\sqrt{2-\sqrt{2}}=\frac{\sqrt{2}\sqrt{2-\sqrt{2}}}{\sqrt{2}}=\frac{\sqrt{2}\sqrt{2-\sqrt{2}}}{\sqrt{2-\sqrt{2}}\sqrt{2+\sqrt{2}}}=\frac{\sqrt{2}}{\sqrt{2+\sqrt{2}}}$$ That is $\sqrt{2-\sqrt{2}}=\sqrt{2}(\sqrt{2+\sqrt{2}})^{-1}$. Since $\mathbb{Q}(\sqrt{2+\sqrt{2}})$ is a field, so we have that $\big((\sqrt{2+\sqrt{2}})^2-2\big)\in \mathbb{Q}(\sqrt{2+\sqrt{2}})$. However $$(\sqrt{2+\sqrt{2}})^2-2=\sqrt{2}$$ which means $\sqrt{2}\in \mathbb{Q}(\sqrt{2+\sqrt{2}})$. So $\sqrt{2-\sqrt{2}}=\sqrt{2}(\sqrt{2+\sqrt{2}})^{-1}\in \mathbb{Q}(\sqrt{2+\sqrt{2}})$ and $\alpha_i\in \mathbb{Q}(\sqrt{2+\sqrt{2}})$ for $i=1,..,4$. So $$\mathbb{Q}(\sqrt{2+\sqrt{2}})=\mathbb{Q}(\alpha_1, \alpha_2, \alpha_3, \alpha_4)$$ and so $\mathbb{Q}(\sqrt{2+\sqrt{2}})$ is a splitting field over $\mathbb{Q}$ for $p(x)$, hence $\mathbb{Q}(\sqrt{2+\sqrt{2}})/\mathbb{Q}$ is a Galois Extension.   For the seconed part Let $G=Gal(\mathbb{Q}(\sqrt{2+\sqrt{2}})/\mathbb{Q})$. We have that $|G|=[\mathbb{Q}(\sqrt{2+\sqrt{2}}):\mathbb{Q}]=4$.  This is everything I have up to now. I am very new to Galois Theory so guidance and help will be very beneficial to me. Also if you can let me know if my proof of the Galois Extension holds.


What makes the Thread.activeCount() print the "wrong" number?

So i'm doing a little project to understand how Threads work. And i think i'm just about to get the hang of it. There is just one little problem that keeps me frustrated since i don't get reason behind it happening. Here it comes. I really dont get why the Thread.activeCount() method outputs 3 when i only create a single thread inside the Main method. Can someone please explain what i am overseeing? public class Main implements Runnable{      private int threadsAlive = 0;     private static int priority = 5; //Default     private String threadName;     private Thread t1;      public Main(String threadName){ //Constructor         this.threadName = threadName;         System.out.println("Creating thread: " + threadName);     }      public void start(){ //Starting the thread         System.out.println("Starting " +  threadName);         if (t1 == null) {             t1 = new Thread (this, threadName);             t1.start ();         }     }      @Override     public void run() { //Running the thread         System.out.println("Running " +  threadName );         aliveCount(true);         System.out.println("^According to the activeCount method: "+ Thread.activeCount()); // Why is this 3?          try {             Thread.sleep(750);             System.out.println("Lets sleep for a while ...zZZZ");             Thread.sleep(2000);             System.out.println("Im awake! But not for long :(");             Thread.sleep(2000);         } catch (InterruptedException e) {             e.printStackTrace();         }          System.out.println("Thread " +  threadName + " exiting.");         aliveCount(false);     }      private void aliveCount(boolean up) {         if (up) {             threadsAlive++;         } else {             threadsAlive--;         }         System.out.println("Threads alive: " + threadsAlive);          if (threadsAlive == 0) {             System.out.println("No threads is alive.");         }     }      public static void main(String[] args) { //Running threads         Scanner scanner = new Scanner(System.in);          System.out.println("Please enter a name for the thread.");         String name = scanner.nextLine();         System.out.println("A thread with the name: " + name + " is saved for creation.");          System.out.println("Please enter the priority level for the thread.");         priority = scanner.nextInt();         System.out.println("A thread with the priority level of: " + priority + " is saved for creation");          System.out.println("*****************************************************");          Main obj = new Main(name);         obj.start();          System.out.println("Setting the priority of " + name +" thread to " + priority);         setPriority(priority);         System.out.println("Priority is now set to: " + priority + " successfully");     }      public static void setPriority(int priority) {         Main.priority = priority;     } }  The output: Please enter a name for the thread. t1 A thread with the name: t1 is saved for creation. Please enter the priority level for the thread. 10 A thread with the priority level of: 10 is saved for creation ***************************************************** Creating thread: t1 Starting t1 Running t1 Threads alive: 1 ^According to the activeCount method: 3 Setting the priority of t1 thread to 10 Priority is now set to: 10 successfully Lets sleep for a while ...zZZZ Im awake! But not for long :( Thread t1 exiting. Threads alive: 0 No threads is alive.


In Carroll's derivation of the geodesic equations (page 69, ), he starts with $$\tau=\int\left(-g_{\mu\nu}\frac{dx^{\mu}}{d\lambda}\frac{dx^{\nu}}{d\lambda}\right)^{1/2}d\lambda$$ and arrives at$$\delta\tau=\int\left(-g_{\mu\nu}\frac{dx^{\mu}}{d\lambda}\frac{dx^{\nu}}{d\lambda}\right)^{-1/2}\left(-\frac{1}{2}\partial_{\sigma}g_{\mu\nu}\frac{dx^{\mu}}{d\lambda}\frac{dx^{\nu}}{d\lambda}\delta x^{\sigma}-g_{\mu\nu}\frac{dx^{\mu}}{d\lambda}\frac{d\left(\delta x^{\nu}\right)}{d\lambda}\right)d\lambda.$$  He then changes the curve parametrization from arbitrary $\lambda$   to proper time $\tau$   by plugging $$d\lambda=\left(-g_{\mu\nu}\frac{dx^{\mu}}{d\lambda}\frac{dx^{\nu}}{d\lambda}\right)^{-1/2}d\tau$$  into the above to obtain  $$\delta\tau=\int\left(-\frac{1}{2}\partial_{\sigma}g_{\mu\nu}\frac{dx^{\mu}}{d\tau}\frac{dx^{\nu}}{d\tau}\delta x^{\sigma}-g_{\mu\nu}\frac{dx^{\mu}}{d\tau}\frac{d\left(\delta x^{\nu}\right)}{d\tau}\right)d\tau.$$  I cannot see how that substitution works. I've been told it uses the chain rule, but I just can't see it. Can anyone help? Thanks.


Mounting Other partitions like windows does

I have Ubuntu 15.04 and windows 8.1 dual booted in my dell laptop, whenever I boot my Ubuntu OS i have to manually click on the drive [say D drive on windows] to mount and open it. So all i have to do is keep those drive mounted permanently and I cannot even unmount or eject them like in windows.


How can I render these edges more realistic?

I would like to have a realistic rendering with this hard surface. These edges appear too soft to look realistic, so I applied a 'Mark Sharp' but they appear with the same rendering as if I didn't apply any Mark Sharp. What am I doing wrong?    I tried many things. On the middle crease of 0.44 and on the right, a bevel with two edges. Is there a better way or if not what is the more realistic option?


I'm doing IELTS preparation tests. One of the tasks is to read a text and compltete the summary by filling the gaps. I did it without mistakes.  Text:     Before committing yourself to postgraduate course, weigh up the options. Perhaps the best route might be to take a job now and plan to do an MBA a few years down the line? Try to get sponsorship from A company. Or go for a well researched and thoroughly thought through masters that will help you land a good job.   Summary:     First, however, it is important to consider the .... (options): whether to start right away on a carefully chosen postgraduate course, or to do so after a few years' work, preferably with financial assistance from THE ... (company).   My question:   Why it's not A company in the summary?   Thank you in advance


My Server has Total RAM 200GB.  I have set 80% of total RAM for SQL Server as it needs more memory.  Just want to know if there is any fixed number or method to finalise amount of memory to be set for SQL Server and then lock pages for SQL Server (or) it depends completely on resource utilization,workload?


How do I find stylesheet & javascript handles?

I am new to php and am just learning the basics. I'm dequeuing some stylesheets & scripts in WordPress using the following code:   function dequeue_scripts() {     wp_dequeue_script( 'handle' ); } add_action( 'wp_print_scripts', 'dequeue_scripts' );   My question is how do I know what the script's / stylesheet's handle name is? Where can I find it?   I appreciate any help!! :)


Proof that $\exp(ikx)$ forms an orthogonal basis of $L^2[-\pi,\pi]$

This is likely to be asked in the past, but I cannot find any answers about how to prove $B=\{e^{ikx}:k\in \mathbb Z\}$ is an orthogonal basis of $L^2[-\pi , \pi]$. I find a proof . This proof is very computational.  Are there any other less computational proofs that doesn't rely on much algebraic calculations? For example, can I prove that the span of $B$ is dense by using the result that if $\langle x,e\rangle=0,\forall e\in B$ then $B$ is an orthonormal basis, or something like that?


Use second argument for optional first argument if not provided in macro

I'm trying to construct a command with one optional and one mandatory argument and I'd like the default if the optional argument is not provided to be #2.   Why does this not work?  (error: Illegal parameter number ...)  \documentclass{article}  \newcommand{\mycommand}[2][#2]{\label{#1}#2} \begin{document} \mycommand{mytext} \end{document}   And what would be a way around it?   EDIT: For clarification of my specific use case: I'm trying to define a command that passes a variable on as an option to an environment along those lines, where myenv can have options like optionone=X or optiontwo=Y so the default for the optional #1 should be optionone=#2 (not literally #2).   \newcommand{\mycommand}[2][optionone=#2]{\begin{myenv}[#1]\input{#2}\end{myenv}}   Maybe there's generally a better approach?   (The environment definition I'm using is from .)


Can someone help me on how to charge this Battery?

I have a ES cordless drill and it has a Li-Ion battery (model is ES GB118L20).  The original battery charger is missing and there is almost no way for me to get one in my country.  The Battery has 5 Samsung INR18650-20R 3.7v cells connected in series.     The battery pins are BATTERY+, BATTERY- and 4 pins marked BATTERY1, BATTERY2, BATTERY3 and BATTERY4 which are connected between + and - of batteries (probably used for balanced charging). Also there are T, BS and ID pins which I'm not sure of their role.  I tried charging the cells one by one by connecting a TP4056 charger to each battery pin (for example [BATTERY- and BATTERY1] or [BATTERY1 and BATTERY2], but was not successful. It didn't even start charging it.  Can anyone help me how to charge this thing?


Im very stuck on where to go with this question. The examples in class used complex numbers, where as this doesn't seem to need them. Im aware that Zs = Zl, but does Zl=Cl+Rl? Any help with how to approach this question would be great


What do I do when a question can't be answered?

The FAQ mentions bounty, but sometimes a question just doesn't really have a right answer:   No solution exists The question as written is unanswerable and unsalvageable There may be a technically correct answer, but the asker is unable to utilize it for some reason.   In these cases, a bounty, and more answers, won't really help. What is the appropriate etiquette in these cases? Should the question be closed? Left hanging?


"I wish there were," or "I wish there was," which sounds most natural?

Given the choice of these two, which sound most natural?  I wish there were something I could do for you. I wish there was something I could do for you.   If both sound equally natural, I'd prefer the first.


This is PDE Evans, 2nd edition: Chapter 8, Exercise 2:     Find $L=L(p,z,x)$ so that the PDE $$-\Delta u + D\phi \cdot Du = f \quad \text{in }U$$ is the Euler-Lagrange equation corresponding to the functional $I[w] := \int_U L(Dw,w,x) \, dx$.      (Hint: Look for a Lagrangian with an exponential term.)   First, one must note that $U \subset \mathbb{R}^n$ and $L(p,z,x)=L(Du,u,x)$, where $Du=\nabla u =\sum_{i=1}^n u_{x_i}$.   One should also note that the Euler-Lagrange equation associated with the energy functional $I[w]:=\int_U L(Dw(x),w(x),x) \, dx$ is $$-\sum_{i=1}^n (L_{p_i}(Du,u,x))_{x_i}+L_z(Du,u,x) = 0 \quad \text{in }U.$$  Here is my work so far:  I set $(L_{p_i})_{x_i}:= (p_i)_{x_i}-\phi_{x_i} p_i$ and $L_z:=-f(x)$ so that the LHS of the Euler Lagrange PDE is  \begin{align} 0 &=-\sum_{i=1}^n (L_{p_i}(Du,u,x))_{x_i}+L_z(Du,u,x) \\ &=-\sum_{i=1}^n\left[(p_i)_{x_i} - \phi_{x_i} p_i \right] - f(x) \\ &= -\sum_{i=1}^n \left[u_{x_ ix_i} - \phi_{x_i} u_{x_i} \right] - f(x) \\ &= -\sum_{i=1}^n u_{x_ ix_i} + \sum_{i=1}^n  \phi_{x_i} u_{x_i} - f(x) \\ &= -\Delta u + D\phi \cdot Du - f(x). \end{align} This gives us the PDE $-\Delta u + D\phi \cdot Du = f$ as written in Exercise 2.  Now, how can I write $L(p,z,x)$? I was thinking $$L(p,z,x)=\frac 12|p|^2 - \qquad \qquad - zf(x),$$ so that, upon taking the derivative with respect to $p_i$ or with respect to $z$, we would obtain both the $L_{p_i}$ and $L_z$ that I have, respectively. However, I have trouble writing the middle term, which is why I left a blank space. The textbook author did say "look for a Lagrangian with an exponential term".


Does a photon exert a gravitational pull?

I know a photon has zero rest mass, but it does have plenty of energy. Since energy and mass are equivalent does this mean that a photon (or more practically, a light beam) exerts a gravitational pull on other objects? If so, does it depend on the frequency of the photon?


Dualshock 4 key stopped working and the controlller dont reset

Well... basically I matched my  dualshock 4 on my cellphone to play a Nintendo emulator... done a couple of times already actually... Problem is, after the last time I done it, the controller stopped to behave normally with my ps4, the L2 key stop working at random times and the controller refuse to reset (tried about 5 to 6 times already)... Done some research to fix the problem, but to no avail till now... Can anyone help me?


Values of two variables print as same but aren't actually equal?


Is there a symbol that looks like the element sign $\in $ but instead of being curved, looks more like a less than sign $< $? I have trawled through hundreds of symbols and tried detexify.


Wireless Broadcom BCM43228 on an Acer Aspire v5-571p does not work

My built-in wireless card doesn't switch on. I have run out of ideas to enable it, or install the driver. When I run rfkill, it shows no hard block or no soft block. I have been trying this for days, and I don't know what to do now. I have also looked for instructions; no help there.  lspci -v returns the following:  03:00.0 Network controller: Broadcom Corporation BCM43228 802.11a/b/g/n  Subsystem: Foxconn International, Inc. Device e04b  Flags: bus master, fast devsel, latency 0, IRQ 19 Memory at f0500000 (64-bit, non-prefetchable) [size=16K]  Capabilities: <access denied> Kernel driver in use: bcma-pci-bridge


How strong is this second-order version of ZFC?

Below, the  of second-order logic is used.    My question is about a second-order analogue of $ZFC$ other than the usual "second-order $ZFC$." Rather than define the latter, I'll just state that its (set-sized) models are exactly the $V_\kappa$s with $\kappa$ strongly inaccessible (or if you prefer, the uncountable Grothendieck universes).  Specifically, I'm interested in the second-order theory consisting of the usual (first-order) axioms of Pairing, Extensionality, Union, Choice, Infinity, and Powerset, and the Separation and Replacement schemes ranging over second-order formulas. I'll call this "$ZFC_2^{scheme}$."    Specifically, for each formula $\varphi(x, y_1,...,y_k)$ of second-order logic with only the displayed variables, each of which is first-order, we have a corresponding Separation and Replacement instance. We do not allow second-order parameters here, so formulas with second-order free variables don't yield Separation/Replacement instances.   The passage from $ZFC$ to $ZFC_2^{scheme}$ has a nice uniformity: it's an example of a more general operation $\mathcal{ZFC}$ which spits out a $ZFC$-analogue given a logic at least as strong as first-order logic.    This is the reason for the parameter restriction above: I want $ZFC_2^{scheme}$ to look just like $\mathcal{ZFC}(\mathcal{L})$ for any other logic $\mathcal{L}$, and not take into account the particular feature that we now have a new kind of variable at our disposal - and in particular, take as "syntax-free" an approach to logics as we can get away with. (This is a choice of arguable value, but it's the one I'm making for now.)   It's easy to show that every model of $ZFC_2^{scheme}$ is well-founded, so to understand its models we only need to look at transitive sets. A natural hope at this point is that $ZFC_2^{scheme}$ is just second-order $ZFC$ in disguise, that is, that for a transitive set $M$ we have $M\models ZFC_2^{scheme}$ iff $M=V_\kappa$ for some strongly inaccessible $\kappa$. However, this isn't at all obvious to me (although it is easy to show the right-to-left direction).     Question. What are the (set-sized) models of $ZFC_2^{scheme}$?   (Note by contrast that the "arithmetic analogues" $PA_2^{scheme}$ and second-order $PA$ are equivalent since each pins down $\mathbb{N}$ up to isomorphism - although that leads to .)  (I'm happy to drop Choice if that would help.)  EDIT: As Hanul Jeon pointed out below,  shows that consistently $ZFC_2^{scheme}$ (there called "$ZFC_2^{def}$") has countable models, so we have a partial answer. However, I don't see at the moment a way to get an outright $ZFC$ proof that $ZFC_2^{scheme}$ is strictly weaker than second-order $ZFC$.


How to modify horizontal spacing between equation elements globally, or for a single equation?

I've noticed that by default, the horizontal spacing between equation elements is pretty tight, and that I can use .   Still, I don't want to expand the spacing manually for each element, if I know I just want some constant horizontal space increase between each element of each equation I write. This means I will repeat what I did for the second equation, all over my text:  \documentclass{minimal}  \usepackage{amsmath}  \begin{document}     \begin{equation}         \mathcal{C} := \{i : \forall i \exists \mathcal{V}(i) \neq \emptyset\}     \end{equation}      \begin{equation}         \mathcal{C} := \{i : \forall \, i \, \exists \, \mathcal{V}(i) \, \neq \, \emptyset\}     \end{equation}  \end{document}   Is there a way to globally, or for a single equation at least, modify the default horizontal spacing between each element of each equation in LaTeX?


exporting variables from environment file with spaces in values

Say I have this .env file:  A=1 B=2 C="3 4 5"   If I run set -x; echo $(cat .env | xargs):   ++ cat .env ++ xargs + echo A=1 B=2 C=3 4 5 A=1 B=2 C=3 4 5   If I run set -x; export $(cat .env | xargs):  ++ cat /tmp/test.env ++ xargs + export A=1 B=2 C=3 4 5 + A=1 + B=2 + C=3 bash: export: `4': not a valid identifier bash: export: `5': not a valid identifier   Then I tried a lot of other tricks to try and keep or add quotes around the C value:  $ set -x; export $(cat /tmp/test.env | xargs printf %q) + set -x ++ cat /tmp/test.env ++ xargs printf %q + export ''\''A=1'\'''\''B=2'\'''\''C=3' 4 '5'\''' bash: export: `'A=1''B=2''C=3': not a valid identifier bash: export: `4': not a valid identifier bash: export: `5'': not a valid identifier   No matter what I do, the C value is always split on spaces.  Edit: To clarify, a solution based on naively sourcing the .env file(most solutions from ) is severely unsafe, if the file contains any string that can be interpreted as command executon. I want my environment files to be interpreted only as key-value data.


Is a linear operator on $\ell^2$ defined by the inner product necessarily bounded?

If $a=\{a_n\}\in \ell^\infty(\mathbb{R})$ and $\langle a,x \rangle<\infty$ for all $x\in \ell^2(\mathbb{R})$,  (where $\langle a, x\rangle=\displaystyle \sum_{k=1}^\infty a_kx_k$), then is $a\in \ell^2$?   So, $a$ defines a linear operator $T_a$ on $\ell^2$ by $T_a(x)=\langle a,x\rangle$. If the operator is bounded, then $a\in \ell^2$, since $\ell^2$ is a Hilbert space. But I don't see if $T_a$ should necessarily be bounded.


How to run 32 bit programs on 64 bit Fedora 17?

Although the Android Development Tools (ADT) bundle is available as a zip package for 'Linux 64 Bit' it :     64-bit distributions must be capable of running 32-bit applications.   And indeed, just running the packaged eclipse on a Fedora 17 64 bit system results in errors, because it can't 'find' several development tools, e.g. adb or aapt:     Error executing aapt: Cannot run program "/home/juser/local/adt-bundle-linux/sdk/platform-tools/aapt": error=2, No such file or directory: error=2, No such file or directory   The 'no such file' is misleading because it is there (under $HOME/local):  adt-bundle-linux/sdk/platform-tools/aapt   But I can't execute it on the shell:  ~/local $ ./adt-bundle-linux/sdk/platform-tools/aapt  zsh: no such file or directory: ./adt-bundle-linux/sdk/platform-tools/aapt   Looking at the file  $ file adt-bundle-linux/sdk/platform-tools/aapt adt-bundle-linux/sdk/platform-tools/aapt: ELF 32-bit LSB executable, Intel 80386,  version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.6.8,  not stripped   we see that it is a 32 binary. And it seems that my system (currently) is not capable of running 32-bit applications.  How do I change that? How do I make a current Fedora 64 bit system capable of running 32 bit applications?  (Of course one could also ask why someone ends up putting 32 bit binaries into a binary package called 'Linux 64 bit' ...)


How to upload local file to server through Linux terminal

I am trying to upload local files to server by using Putty or SSH but not getting upload there.  Is there any direct method to upload file from local to server from Linux terminal without using FTP etc ?


I'm using angular js views and routing to load different HTML inside a div. But when i change an partial html and reload it stil shows up the cached version.  According to my reasearch this is not due to angular js template caching, cause on load of html i tried to get the cached HTML like this $templateCache.get('loadedPage.html') and the result was undefined so its not angular js that is caching the html.  then when i saw in chrome i could find my html cached . i tried with following  <meta http-equiv="Cache-Control" content="no-cache, no-store, must-revalidate"/> <META HTTP-EQUIV="Pragma" CONTENT="no-cache">     <meta http-equiv="Cache-Control" content="no-store" /> <meta http-equiv="cache-control" content="max-age=0" /> <meta http-equiv="cache-control" content="no-cache" /> <meta http-equiv="expires" content="0" /> <meta http-equiv="expires" content="Tue, 01 Jan 1980 1:00:00 GMT" /> <meta http-equiv="pragma" content="no-cache" />   but still i could see browser caching the html.  any other way of doing it ?


User in sudo group, but still being asked for password

I'm running Ubuntu 20.04 LTS on my home server. I have just one user which I want to be able to use sudo, but I can't get it to work. I already ran sudo usermod -aG sudo rlommers. the output of id rlommers also states that I'm in the sudo group. However, when I run sudo apt-get update, I'm still required to enter the password. Why is that?  rlommers@server [~]$ id rlommers uid=1000(rlommers) gid=1000(rlommers) groups=1000(rlommers),4(adm),24(cdrom),27(sudo),30(dip),46(plugdev),116(lxd),117(docker) rlommers@server [~]$ sudo apt-get update [sudo] password for rlommers:   EDIT Sorry! For future reference: I already solved it by adding rlommers ALL=(ALL) NOPASSWD: ALL to the sudo file.


DLink dwa 131 H/W ver :E1 F/W ver : 5.1 how do i install it's wifi driver in UBUNTU 16.04

The wifi adapter doesnt work on my laptop lenovo Z51 UBUNTU 16.04 info about the adapter DLink dwa 131 H/W ver :E1 F/W ver : 5.1   lsusb   Bus 001 Device 002: ID 8087:8001 Intel Corp.   Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub  Bus 003 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub  Bus 002 Device 005: ID 0489:e079 Foxconn / Hon Hai   Bus 002 Device 004: ID 5986:0670 Acer, Inc   Bus 002 Device 003: ID 0bda:0129 Realtek Semiconductor Corp. RTS5129    Card Reader Controller  Bus 002 Device 002: ID 2001:3319 D-Link Corp.   Bus 002 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub


Can someone please explain how I can install  in the following ways?   By using the package manager? By downloading and installing a pre-built package?


I am learning math proofs for the first time. So I cannot discern the reason for all the details in a proof. Here's the statement of mathematical induction:     For every positive integer $n$, let $P(n)$ be a statement. If:           (1). $P(1)$ is true and          (2). If $P(k)$, then $P(k+1)$ is true for every positive integer $k$     then $P(n)$ is true for every positive integer $n$.      Here's the proof the author gave.     Assume that the theorem is false. Then conditions (1) and (2) are satisfied, but there exist some positive integers $n$ for which $P(n)$ is a false statement. Let   $$S=\{n\in {\rm N}~{\rm :}P\left(n\right)~is~false\}$$Since $S$ is a non-empty subset of ${\rm N}$, it follows by the well-ordering principle that $S$ contains a least element $s$. Since $P(1)$ is true, $1\notin S$. Thus $s\ge 2$ and $s-1\in {\rm N}$. Therefore, $s-1\notin S$ and so $P(s-1)$ is a true statement. By condition (2), $P(s)$ is also true and so $s\notin S$. This however contradicts our assumption that $s\in S$.   My questions are:   Where did $s-1\in {\rm N}$ and $s-1\notin S$ pop from ? Why is the well-ordering principle important for this proof ?


I'm providing the following sentences as representatives of other similar instances.     The survival of a TV channel depends on it attracting as many viewers   as possible.      The survival of a TV channel depends on its attracting as many viewers   as possible.    Which one would be preferable?   I've seen both of the forms before. What is the related grammar/usage called so I can study further?


How do you evaluate this limit - $\lim_{n \to 0}\frac{cos(n)-1}{n}$?

How do you prove that $$\lim_{n \to 0}\frac{\cos(n)-1}{n}$$ equals to $0$? I can't use L'Hôpital's rule because when differentiting cosine using $$\lim_{h \to 0}\frac{\cos(x+h)-\cos(x)}{h}$$ we get that exact limit at some point. I assume we have to use the squeeze theorem.


Possible Duplicate:             According to , Win 7 only supports 4 GB of RAM. I, however have been reading some forums and some say they are using 8 GB RAM with good performance. I am wondering if I can use 8 GB before I purchase.


Not able to determine how a UI app automatically starts after a reboot

I have a Windows 10 computer that was originally upgraded from a Windows 7.  About a year ago I got a Samsung External SSD drive and installed its accompanying software.  Whenever I attached the SSD harddrive, I would get a prompt asking for my password.  Everything worked fine.   However a month or 2 ago after the latest Windows 10 patch, I would get a prompt for password whenever I rebooted and logged in and not wait for me to attache the SSD harddrive.   I am trying to figure out how this is possible.  I can always rename the executable to prevent the popup, but I want to know how this executable is being initiated.  Knowing this would also ensure other programs are not being started without my knowledge.  I have checked my startup tag, searched registry settings and reviewed the Task scheduler, without success.  Is there any place else to check?  Also, I think when I installed the latest patch, I clicked on the option to auto login to complete the installation.  Thanks,  I figured out how this was happening.  Windows 10 "shut down" is different than the past.  Now when you "shut down", any program that is currently running automatically starts next time you reboot.  To prevent this from occurring you have to do a force shutdown.  One way is using this command:  Shutdown –s –f.


Is db_set_active() need to work with a Drupal database or can I use it with a database that doesn't contain any drupal tables ?


Find all index of list containing a value Python

I have 2 lists  lst = [1,2,3,4,5,1,2,1,2,3] lst2 = [1,2,3]   I am trying to see the index elements in lst are in lst2. Currently I am doing;  ind = [] for x in lst2:     if x in lst:         ind.append(lst.index(x))   I realize the problem is that lst.index(x) only returns the first occurrence of the element so x=1 will always return lst.index(1) = 0.   Is there a way to return all the indexes that contain the element?


Denesting infinite nested radicals: $\sqrt{1+ \sqrt{2+ \sqrt{4 + \sqrt{8 + \sqrt{\dots}}}}}$

I tried to denest the infinite nested radical   $$\sqrt{1+ \sqrt{2+ \sqrt{4 + \sqrt{8 + \sqrt{\dots}}}}} \; .$$  My first try was to find a functional equation for $$\alpha(x) = \sqrt{1+ \sqrt{x+ \sqrt{x^2 + \sqrt{x^3 + \sqrt{\dots}}}}} \; .$$   This did not work for me. Firstly, finding a functional equation is difficult and secondly, I didn't manage this even for   $$\sqrt{x + \sqrt{x^2 + \sqrt{x^4 + \sqrt{x^8 + \dots}}}} = f(x)$$  $$\Rightarrow f(x)^2 - x = f(x^2),$$  where I choosed the nested radical expression such that the functional equation is easy to find. When I found a bunch of functions that solve this equation for example  $$\tilde{f}(x) = \sqrt{x+ \frac{1 + \sqrt{1+4x^2}}{2}}$$  I could discover some nested radicals like $\sqrt{\frac{3+\sqrt{5}}{2}} = \frac{1+\sqrt{5}}{2}$ for $x=1$ or $\sqrt{\frac{9+\sqrt{17}}{2}} = \frac{1+\sqrt{17}}{2}$ for $x=2$, but the value $\tilde{f}(2)$ does not coincide with a numerical approximation for the infinite nested radical. It seems that I didn't found the right solution for the functional equation. I wonder if this is even the right way, since we are talking - formally - of a limit of a sequence. Nevertheless, it works for the easy case $\sqrt{x+\sqrt{x+\sqrt{x+\dots}}} = y \Rightarrow y^2-x = y$ by just solving this equation for $y$.  Then, I found the formula (18) on , that yields  $\sqrt{2} = \sqrt{1+\sqrt{\frac{1}{2} + \sqrt{\frac{1}{8} + \sqrt{\frac{1}{128} + \sqrt{\frac{1}{2^{15}} + \dots}}}}}$ .  This looks a little similar to the expression $f(2)$ and maybe it is possible to choose the parameters such that we can evaluate $f(x)$. Nevertheless, this is still a formula with double exponential growth of the radicands. It seems to be much harder to denest $\alpha(x)$.  Maybe someone here has more experience on infinite nested radicals or knows where I can find material that could help me solving this problem. I appreciate any solutions, hints or comments. Many thanks in advance.


Language of language names in the language selector?

Imagine a site that's available in multiple languages. The language is detected automatically by looking at the IP or the browser header. But that's not bulletproof, so a few users might end up on a page in language they don't understand.  I am wondering what the best way is to present the language selection?          – Wireframes created with   Q: Should the languages in the language selection be listed   translated into current language, used to display the site in (good if the detected language was correct)? native name of the language, so everybody looking for their language could see it in the very same language (good if the detected language was not correct and users don't know the current language)? always in English assuming most users would understand this?   Feel free to add if I missed something!


Issue Populating Listview in Fragment with ListAdapter causes Error

Im trying to populate a listview in a Fragment, however im getting a NullPointerException.  I believe i may be implementing the ListAdapter incorrectly below:  ListAdapter adapter = new SimpleAdapter(                                        getActivity(), inboxList,                                         R.layout.women_list_item, new String[] { TAG_ID, TAG_FROM,TAG_DATE,TAG_EMAIL,TAG_SUBJECT},                                         new int[] { R.id.from, R.id.subject, R.id.date,R.id.mail,R.id.roundscore });                                 // updating listview                          list1.setAdapter(adapter);   View Full Fragment Code here:   Error:  09-22 07:11:33.723: E/AndroidRuntime(1707): FATAL EXCEPTION: main 09-22 07:11:33.723: E/AndroidRuntime(1707): java.lang.NullPointerException 09-22 07:11:33.723: E/AndroidRuntime(1707): at info.androidhive.slidingmenu.PagesFragment$LoadInbox$1.run(PagesFragment.java:291) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.app.Activity.runOnUiThread(Activity.java:4673) 09-22 07:11:33.723: E/AndroidRuntime(1707): at info.androidhive.slidingmenu.PagesFragment$LoadInbox.onPostExecute(PagesFragment.java:273) 09-22 07:11:33.723: E/AndroidRuntime(1707): at info.androidhive.slidingmenu.PagesFragment$LoadInbox.onPostExecute(PagesFragment.java:1) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.AsyncTask.finish(AsyncTask.java:631) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.AsyncTask.access$600(AsyncTask.java:177) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.AsyncTask$InternalHandler.handleMessage(AsyncTask.java:644) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.Handler.dispatchMessage(Handler.java:99) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.Looper.loop(Looper.java:137) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.app.ActivityThread.main(ActivityThread.java:5103) 09-22 07:11:33.723: E/AndroidRuntime(1707): at java.lang.reflect.Method.invokeNative(Native Method) 09-22 07:11:33.723: E/AndroidRuntime(1707): at java.lang.reflect.Method.invoke(Method.java:525) 09-22 07:11:33.723: E/AndroidRuntime(1707): at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:737) 09-22 07:11:33.723: E/AndroidRuntime(1707): at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:553) 09-22 07:11:33.723: E/AndroidRuntime(1707): at dalvik.system.NativeStart.main(Native Method)  View Code:


Does the 50 foot extension cord my refrigerator is hooked up to cost me double the electricity?

Does the 50 ft extension cord my refrigerator is hooked up to cost me dbl in electricity?


Classically, how would an electron orbiting a proton in a perfectly circular orbit emit photons?

Obviously, with quantum mechanics, we know particles don't really orbit in electric fields.  From what I know, clasically, Bremsstrahlung radiation would occur if an electron was deflected or accelerated around a proton, and the energy of that photon would be equivalent to the energy lost.  But if an electron did classically orbit a proton in a perfectly circular orbit, it would never change energy and could never emit a photon, yet it would be accelerated to form a circular path.  How would the electron emit any radiation if it was not changing energy in a circular path?


Convert 0-5DC to low current high voltage AC signal

I'm experimenting with electro vibrations. This principle is about simulating textures using low current electricity on an insulated conductive surface (see Wikipedia: ).  I've started to use some EL-wire IC's to create a AC signal from a DC powersupply since i need a high voltage AC signal (max 115 vpp). With the IC's i got some results but i'd like to have more freedom in the output (the ic gives a fixed voltage and frequency).   Actually what i'm looking for is a high voltage, low current signal generator circuit. 80-115 Vpp (AC) and 80-400 HZ. I'd like to control it with arduino. So ideally it would be a way to amplify and convert the 0-5 DC signal to a 80-115Vpp AC signal.  What's the best way to do this?  Cheers,


What data type, scheme, and how many bits should be used to store a FOREX price?

A typical FOREX price would be carried out to the 4th decimal place; for example, the current price of the GBP against the USD today is 1.2515. I have seen this price carried out to more decimal places.  This is really a two-part question.    First  There are two schemes that I am considering:  a) A floating-point type; double jumps to mind. I'm a bit concerned about rounding error here. b) An integer type, storing the decimal and integer pieces separately.  Any other realistic options?  Of those ( above ), which one is correct?    Second  In either scheme, I would precisely specify the number of bits used via the <cstdint> library.  How many bits makes sense?   I'm looking to balance accuracy, memory/storage cost, and (of course) performance.  Thx, Keith :^)


Does the association bonus count for Running Ragged hat?

From       Running Ragged      earn 150 reputation points on three different sites (not including   Stack Overflow) within 15 days.   So my query is: association bonus going to be counted for it?


Let $x$ be a positive integer. I have the following iterated sums:  $$f(x)=\sum_{i_{u-1}=1}^{x}\sum_{i_{u-2}=1}^{i_{u-1}} \cdots \sum_{i_2=1}^{i_3} \sum_{i_1=1}^{i_2}i_1$$  What is the asymptotic behavior of the total?  Thank you


Manganese has more unpaired electrons than Iron so why is Iron ferromagnetic Manganese paramagnetic?

Manganese has five unpaired electrons, but Iron has four, then why is Iron ferromagnetic and Manganese paramagnetic? What's that property I'm missing?


I want to ask a bash question but this can be generalised to other programming related questions that go for managing an operating system via scripting or programming language that is kinda cross platform.  The reason for the confusion is when I search for bash related problems, solutions equally come from Stack Overflow, Unix & Linux, Ask Ubuntu, Super User or Server Fault. I would say they are all on-topic.


Given text is not properly appearing on a button

My question is "how to center a span class on button?". See this, arrow-up is behaving in it's own way and not at the center of button. If the code works correctly, An equilateral trinagle will appear in the left of button following with the words Go back to top. And my code has errors which is limiting that to appear in the above mentioned manner. This is running example,    .arrow-up {   width: 0;   height: 0;   border-left: 5px solid transparent;   border-right: 5px solid transparent;   border-bottom: 5px solid #101010; } <button>Go back to top</button>


Something is beeping in my house intermittently. It is not the smoke or carbon monoxide detectors!

We are having a very infrequent beep occur in the house.  It lasts about one second and then stops for a long time, about once an hour or so.  I can't tell what direction it is coming from but we have checked all the smoke and carbon monoxide detectors.  We can hear it pretty clearly from the living room and dining room.


Work around an issue or workaround an issue?

I'm writing an essay for college admissions, and this snippet is highlighted by my auto-correct as incorrect:  There are many obstacles I face while working on a project, most of which take a lot of time and energy to fix or work around.  I can't see anything wrong with using work around in this context, but I'd like to know how to correctly use this phrase.


None of the edit is approved in last 2 days

From last 2 days I have edited almost 30-35 question but none of them is being approved. Is there a limit on edit or any other reasons Why my edits are not being accepted.


403 Forbidden -You don't have permission to access / on this server

I know that the question was asked thousand times.  I'm trying to install Wordpress. My folder is in /www/html/wordpress. I have downlowded the project manually from wordpress site.  In wp-in config.php my configuration is fine (I have other project with the same configuration, just db name is different). I set all the permissions to 755. I have configured the sites-avaiable (the virtualHost works when I test with some random index.html). Can someone tell me what else I can check ?


How to make an integer vector ignore white space and add 2 to every element in C++

I have a weird problem, so my instructor told us to create a simple program using vectors that will first ask the user how many integers they want to enter, and after the numbers were entered via a space as a delimiter the output should add 2 to each vector element.  Ex -   How many numbers are you going to enter = 4 (Lets assume the user enters 4)       Enter the numbers = 11 45 71 24 (Lets assume the user entered these 4 numbers)  THE OUTPUT SHOULD BE THIS = 13 47 73 26 (with spaces added 2)   Since using vectors is a must, i know how to add add 2 with a normal integer vector output but when it comes with spaces i have no idea, so far the program i wrote will accept everything before the space into the vector and will add 2 to it.   #include <iostream> #include <vector> #include <algorithm> using namespace std;  int main() {     vector <int> userInput;     int input;     int number;     int num1;     cout << "How many numbers are you going to enter ? :";     cin >> number;     cout << "Enter the Numbers : " << endl;     cin >> input;      userInput.push_back(input);     cout << "Vector Contains : ";     for (unsigned int i = 0; i < userInput.size(); i++)     {         cout << userInput[i] + 2;     }        system("pause>nul");     return 0; }


Can't access Windows drive: “Windows is hibernated, refused to mount”

I'm using Fedora 20 along with Windows 8. However, I'm unable to access the contents of the drive in which Windows 8 is installed. It shows:  Error mounting /dev/sda2/ The NTFS partition is in unsafe state Windows is hibernated, refused to mount   even though I had shutdown the Windows properly.


TV show pilot with red-haired, cat-eyed alien girl

I watched the pilot for a series I thought I would like but now I can't find it, I can't remember what it was called.  It had a young woman with bright red hair(I think) and her eyes were like a cats. She was traveling with a human man who treated her like a daughter but he had 'adopted' her. I remember they went to a settlement and there were different types of aliens there.   At the settlement, the son of the rulers fell for a girl of a different breed.


How to pick a launcher to install software

New to Ubuntu 14.04. Want to install adobe flash plug-in which I picked from the Ubuntu Software Center. After clicking on Install I have a choice of what application I want to use. When I choose the appropriate software i.e. (APT for Ubuntu 10.4+) the System is asking what launcher I will use to install. I have no clue what to answer/pick. Any assistance would be greatly appreciated.


How to go about computing an ideal in a polynomial ring

I am stuck on how to characterize the elements in $(5,x+7)$ in the polynomial ring $\mathbb{Z}[x]$. I seriously can't even figure out if $x$ is in this ideal. I know that elements in the ideal look like $5h(x)+(x+7)g(x)$ for $h(x),g(x)\in \mathbb{Z}[x]$, and then I tried to expand this out, but I got some huge mess that I didn't know how to work with. In particular I am trying to figure out whether this ideal is maximal or prime or neither, and I thought the best way to do that was to find some elements that are not in the ideal so I could maybe find some zero divisors in $\mathbb{Z}[x]/(5,x+7)$.


Matter waves? what does de Broglie mean?

What is the physical meaning of somethings matter wave?  I mean its not like were all vibrations in spacetime, right?


Does subgroup have element that's conjugate don't have?

I'm trying to prove that   there is Group G and subgroup of G, which name is H.   $a \in G $  if H is not normal subgroup of G,   $$H - \bigcup_{H \neq aHa^{-1}} aHa^{-1}$$ has at least one element.  but I can't prove this is true or not  how can I prove it?  for example  G = S_4   H = <(1 2),(3 4)>  then H = 1234 -> 1234, 2134, 1243, 2143  if a = (1 2)  $ aHa^{-1} = 1234, 2134, 1243, 2143 = H $  if a = (2 3)  $ aHa^{-1} = 1234, 2314, 1423, 2413 \neq H $  because 1234 is on H but 2314, 1423 and 2413 is not on H


What part of the damage is halved/doubled for Damage Resistance/Vulnerability?

If a creature has "damage resistance" to non-magical weapons how does the final damage number break down?  Is the weapon damage halved only?  Is the total damage (weapon, STR/DEX dmg. bonus) halved?  Would a rogue attacking with a non-magical weapon and using Sneak Attack get the Sneak Attack dmg. halved?  Same question applies to "damage vulnerable" when damage is doubled.


When using Google and Facebook for social login, how to prevent misattributed session referrers and goal conversions in Google Analytics?

I am seeing quite a few conversions which have as source "accounts.google.com" (almost 40%).  AFAIK, in the new Universal Analytics as soon as a user has a Referrer set a new session is started. So if a user is getting on my page, and creates an account using social auth (e.g. Google accounts) when being redirected back, will this create a new session? I guess this would explain that there are many conversions coming from accounts.google.com - is it safe to enter accounts.google.com into the Referral Exclusion List? And more - what about Facebook logins, those would show up as facebook.com, but i probably don't want to exclude facebook.com as referrer?  Any ideas how to deal with UA referrers and social logins?


How to make the Gnome Terminal transparent

I have been having to use the Xfce 4 Terminal because I want to have a see through background, and I couldn't get it working in the Gnome Terminal, but as there are some disadvantages of using the Xfce 4 Terminal over the Gnome one, I was wondering if there is in fact a way to make the Gnome Terminal transparent?  People have previously told me to go to the preferences section, then to the background tab, and change the transparency settings there, but I am unable to find the background section.    OS Information:  Description:    Ubuntu 15.04 Release:    15.04   Package Information:  gnome-terminal:   Installed: 3.14.2-0ubuntu3   Candidate: 3.14.2-0ubuntu3   Version table:  *** 3.14.2-0ubuntu3 0         500 http://gb.archive.ubuntu.com/ubuntu/ vivid/main amd64 Packages         100 /var/lib/dpkg/status


How to hide or remove (not disable) the Show Desktop button at the end of the taskbar in Windows 10?

Edit: This question has already been answered  for Windows 7, the answer remains the same, however people looking specifically for how to fix it for windows 10 may never see it so I am leaving this one here as well.    I konw you can disable the peek functionality from the settings, but I was wondering if you could remove it completely. In previous versions of windows if I'm not mistaken, when you disabled peek it would remove that area altogether, and it would be nice to be able hide it in Windows 10 as well. I'm talking about this area right here:


Appropriate Statistical test for Analysis

I have built and tested a computer application, which involved two participant groups (Group-A with existing knowledge of databases and Group-B without knowledge of databases).  I was required to apply test of statistical tests to determine if the rating and perception of built application was same among both groups. I used the system log file and questionnaire tools for collecting information used for histograms, means, skewness and kurtosis values.  The question I am looking to ask, Is the use of statistical tests (histograms, means, skewness and kurtosis) values used for measuring the differences of data / rating / perception between both groups were appropriate?


Is there a way to with jQuery keyCode to detect Command + C? The keycode only sends one key, not the pressed combo. I'm looking to setup a binding to detect Command + C. I've seen some keyboard shortcut plugins but would like to avoid adding an additional library for one simple binding.


I have difficulty understanding dialogue in movies when the characters speak fast.  For example, I was watching The Lord of the Rings and became frustrated with my listening comprehension. I could not understand many sentences Gandalf said; when I turned on the subtitles there was not a word I did not know, but when he said it I just could not understand it.   This happens in other movies and even daily conversations. I tend to be better at catching the end of a sentence than the beginning. I’ve been in the UK for ten years now, so I don’t know what could be causing this, and since I don’t know its cause, I have no idea what to do to fix or improve it.  How can I improve my comprehension of rapid dialogue?


access built in HDD from formated windows to ubuntu SSD

1) I wish to install ubuntu on my SSD, I have windows 10 on it atm, I wish to erase and install ubuntu on it. All my data have been stored on the internal HDD on my laptop, shall I move the data to external HDD and format both drivers then install ubuntu on SSD, or will I be able to access the internal HDD without any errors after formating and installing ubuntu on the SSD?   2) What partitions do I need on Ubuntu installation to make the HDD as my data directory as well?


what is the best way to do a multiply with overflow check in C?

I want to multiply two unsigned numbers and I want to know if the result has overflowed. For example I may be calculating the size of a memory block to allocate.  I could use a type for the multiplication that is at least twice as large as the types I am multiplying so that overflow simply cannot happen but such a type may not be available.   I could do a division after the multiplication and compare the result with the original operands but divisions is a relatively slow operation  Is there a better way?


java.lang.reflect.InvocationTargetException without using FXML

I have to deal with a problem. I followed a tutorial to create a Game Menu and I'm really close it builds but I can't run it. It uses javafx. It says :  Exception in Application start method java.lang.reflect.InvocationTargetException at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at javafx.graphics/com.sun.javafx.application.LauncherImpl.launchApplicationWithArgs(LauncherImpl.java:464) at javafx.graphics/com.sun.javafx.application.LauncherImpl.launchApplication(LauncherImpl.java:363) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at java.base/sun.launcher.LauncherHelper$FXHelper.main(LauncherHelper.java:1051)     Caused by: java.lang.RuntimeException: Exception in Application start method at javafx.graphics/com.sun.javafx.application.LauncherImpl.launchApplication1(LauncherImpl.java:900) at javafx.graphics/com.sun.javafx.application.LauncherImpl.lambda$launchApplication$2(LauncherImpl.java:195) at java.base/java.lang.Thread.run(Thread.java:834)     Caused by: java.lang.NullPointerException at BomberBallMenu.addBackground(BomberBallMenu.java:59) at BomberBallMenu.createContent(BomberBallMenu.java:44) at BomberBallMenu.start(BomberBallMenu.java:122) at javafx.graphics/com.sun.javafx.application.LauncherImpl.lambda$launchApplication1$9(LauncherImpl.java:846) at javafx.graphics/com.sun.javafx.application.PlatformImpl.lambda$runAndWait$12(PlatformImpl.java:455) at javafx.graphics/com.sun.javafx.application.PlatformImpl.lambda$runLater$10(PlatformImpl.java:428) at java.base/java.security.AccessController.doPrivileged(Native Method) at javafx.graphics/com.sun.javafx.application.PlatformImpl.lambda$runLater$11(PlatformImpl.java:427) at javafx.graphics/com.sun.glass.ui.InvokeLaterDispatcher$Future.run(InvokeLaterDispatcher.java:96) at javafx.graphics/com.sun.glass.ui.win.WinApplication._runLoop(Native Method) at javafx.graphics/com.sun.glass.ui.win.WinApplication.lambda$runLoop$3(WinApplication.java:174)   I tried to search every where and I can't figure out where is the problem. I tried to do it under linux or windows it's the same problem. The guy don't have any issue when he lunches it


How to restart X server with the old key combination (ctrl -alt - backspace) in 14.04

I know that since 11.04 the keyboard short-cut of Ctrl+Alt+Backspace has been disabled by default.  However at least as recently as 12.04 you were able to enable it via the Keyboard GUI:    The Keyboard options in 14.04 are much more limited and there appears to be no way to re-enable this function:    Is there any way to re-enable this function?  All my searches of AU as well as a full internet search have provided no workable answers for 14.04.