When you are on the GPS screen, showing the roads and that etc. you can tap any where on the screen and a blue ring appears with a strange noise at the same time, what does this actually mean? has it got anything to do with locating/revealing Pokemon or the leaves that move about occasionally?

When I tap the map (by map I mean the map the character walks on - the ground), it glows a bit.     What happens when I click the map? Is it just an visual effect or does it cause anything else?


I'm trying to add list items with links and when i'm trying to remove them nothing happens. But if i create the li items in my HTML they do get removed..  My append code-  fileInput.append('
' + fileurl + '
');   My remove code-  jQuery('li a').click(function() {     jQuery(this).parent('li').remove(); });   When i use the same append code as static HTML, i can remove it without a problem. But when i add these lines using append nothing happens. How can i fix this please? :)

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


Well, I have come to understand persons with the following traits will be usually be Sorted to Slytherin   Resourcefulness  Cunning Ambition Leadership Qualities Self-Preservation Determination  Cleverness Fraternity  Power   On which trait(s) was Snape Sorted into Slytherin?  One more point: Lily Evans was Sorted before Snape, and when she was placed in Gryffindor, obviously Snape wanted to be in Gryffindor too, because Lily is his only friend.   So why is he Sorted into Slytherin? Is there a stronger reason for the Sorting Hat to override his preference and Sort him into Slytherin?

In the epilogue of Deathly Hallows, when Harry’s son expresses trepidation about being sorted into Slytherin, Harry says:     “Albus Severus, you were named for two headmasters of Hogwarts. One of   them was a Slytherin and he was probably the bravest man I ever knew.”     Bravery is the trait typically associated with Gryffindor.   If Snape was so brave, why was he sorted into Slytherin instead?


My son was given a game for his birthday but it runs on window 95. I tried downloading the windows 95 emulador but it didn't work. Is there any way i can make it work on Ubuntu?

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


Why, in some instances, do some (desktop) web pages open the navigation drawer on the right hand side of the page? Is there a specific reason why the left side isn't always preferred?  If yes:    Why so?  What research is there to prove this?   Here are the examples below of right-sided navigation drawers:

Hamburger menus (the three small horizontal bars: the new menu icon). Should they be on the right or left?  I'm only thinking of mobile and tablet applications.    The pattern I see the most is on the left side: Youtube app, Evernote app, and many more. However, I've seen the argument of the right being more user-friendly because when you're grabbing the phone with your right hand, it's easier to reach the menu.    What do you guys think? Should I go with the flow and implement the menu on the left side?


I want to make my own matrix solution code. I having problem when taking values. my code is below:  ask_r = int(raw_input("How many rows: ")) ask_c = int(raw_input("How many columns: "))  """ [1,2,3] [3,4,5] [7,8,9] """  """  matrix = [[1,2,3],[4,5,6],[7,8,9]]  """ col_m = [0]*ask_c row_m = [col_m]*ask_r  for i in range(ask_r):     for j in range(ask_c):         val = input("Put in: ")         row_m[i][j] = val print row_m   What's wrong there as the input changes the value of all the three inner lists(considered as columns).

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


We have two independent samples, with skewed distribution from two different populations x, and y. When we compute the summary for these numeric vectors, we get following output,  summary(x)  Min. 1st Qu.  Median    Mean 3rd Qu.    Max.  1.000   1.000   1.000   2.219   3.000 116.000  length(x)=25312 summary(y)  Min. 1st Qu.  Median    Mean 3rd Qu.    Max.  1.000   1.000   1.000   1.129   1.000  19.000  length(y)=49832   As seen, they have equal sample medians with this data. But the intuition is that median for population1(from which sample x is taken) should be greater than median for population2(from which sample y is taken). Though sample medians are same, will it be worthwhile running Wilcoxon Ranksum test for this example? And, can I also get help with the syntax for one-sided Wilcoxon(in R). To be more precise, when we write   wilcox.test(x,y,alternative="greater",paired = FALSE)   Does this mean that median of x is greater than median of y or the other way around? Help is appreciated.

I've received a results from a Mann-Whitney rank test that I don't understand.  The median of the 2 populations is identical (6.9). The uppper and lower quantiles of each population are:   6.64 & 7.2 6.60 & 7.1   The p-value resulting from the test comparing these populations is 0.007. How can these populations be significantly different? Is it due to the spread about the median? A boxplot comparing the 2 shows that the second one has far more outliers than the first. Thanks for any suggestions.


I have made a scene with many Rigid Body objects (1500 rectangular solids), which all operate correctly. However I now want to lengthen the animation period from the default 250 frames to a more reasonable range of around 2000. The issue I am having is the timeline continues like normal, but the Rigid Body animation hangs on the 250th frame. Is it possible fix this issue, and preferably be able to to change all of these objects at once?

I've set up the physics of a swinging wrecking ball and set the animation to run for 240 frames.  This was not long enough for the entire "swing" of the ball-and-chain.   I'm unable to reset the timeline, but I can set the end frame to (say) 1000 frames, but when I try to play the animation, the animation progress halts at frame 240 and I cannot get it to go any further.   There are no markers or keyframes in the timeline.  What should I do to "force reset" the animation-timeline, to allow changes to the length?


I want a book that discuss all these things practically. I don't require it for any exam. Just for applying it confidently anywhere (want to Analyse fluids,thermo etc.) Want a book that explain how to apply these in real world considering every aspect(considering real world problem s). Discusses the ideas behind these laws. builds confidence in these laws.

What are some good books for learning the concepts of Kinematics, Newton laws, 2D Motion of Object etc.?


(disclaimer: I am not a physicist).  I have been taught about the concept of energy in a fairly ad-hoc way. i.e. I was simply "told" that kinetic energy equals $\frac 1 2 m v^2$, and similarly I was told what potential energy is. Then I was shown how energy is conserved over time (in a classical system).  The concept of energy sort of intuitively makes sense to me, but I'd like a better understanding than just this ad-hoc one. At one point I thought of energy as "a basic quantity that is preserved over time in physical systems as the result of the underlying equations of motion". This seems true, but there are other quantities that are preserved, such as momentum, or the function $f(s)=5.6$ which maps every element of state space to $5.6$. Hence it doesn't really help me understand the concept.  Moreover, the concept of energy emerges in wildly different areas of physics (e.g. in classical, quantum, and general relativistic physics), where the concept seems to have the same general meaning despite the differences. I can even imagine that the concept of energy could apply to dynamical systems that have absolutely nothing to do with the physical world, such as certain completely artificial simulations, so long as they satisfy certain properties.  What is the most general conception/definition of energy? i.e. one that makes the least amount of assumptions about the underlying system (perhaps even so that the underlying system is not a "physical" system but an element from some more general set of dynamical systems).   I know that energy is conserved, but this doesn't distinguish it from other conserved quantities. Noether's theorems imply that there is a quantity that is conserved due to time translation invariance. Is it conceptually insightful to see this as the "definition" of energy? If not, what is the most general definition of energy? And why does time translation invariance induce a conserved quantity that has such an important role in physics?

Some physical quantities like position, velocity, momentum and force, have precise definition even on basic textbooks, however energy is a little confusing for me. My point here is: using our intuition we know what momentum should be and also we know that defining it as $p = mv$ is a good definition. Also, based on Newton's law we can intuit and define what forces are.  However, when it comes to  many textbooks become a little "circular". They first try to define work, and after some arguments they just give a formula $W = F\cdot r$ without motivating or giving intuition about this definition. Then they say that work is variation of energy and they never give a formal definition of energy. I've heard that "energy is a number that remains unchanged after any process that a system undergoes", however I think that this is not so good for three reasons: first because momentum is also conserved, so it fits this definition and it's not energy, second because recently I've heard that on general relativity there's a loss of some conservation laws and third because conservation of energy can be derived as consequence of other definitions.  So, how energy is defined formally in a way that fits both classical and modern physics without falling into circular arguments?


Let $X$ a set, $M$ a $\sigma$–algebra and $\mu$ a measure. We have known that $L^p(X,M,\mu)$ is a Banach space if $p\geq 1$. In particular when $p=2$, $L^p(X,M,\mu)$ is a Hilbert space,(which are classical theorems.)  My question is, if $L^p(X,M,\mu)$ is a Hilbert space can we conclude that $p=2$?  Or maybe we will add some conditions on $X$ or $(X,M)$ or $(X,M,μ)$?  Help me, please. This question has bothered me for a long time.

It is known that the parallelogram law  $\|x-y\|^2+\|x+y\|^2 = 2(\|x\|^2 + \|y\|^2)$  holds in any space with an inner product (the norm being induced by this inner product). Is this formula valid in general Banach spaces? Or are there counterexamples?  Thank you! :)


Let G be a group, where $(ab)^3=(a^3)(b^3)$ and $(ab)^5=(a^5)(b^5)$. Prove that $G$ is abelian group.  Thank you in advance. Any help is appreciated.


Attempt (so far):  Assume there exists a non-constant polynomial $p: \mathbb Z \to \mathbb Z$ with integer coeffecients that only takes on prime values. Let notate it as  $$p(n)=d_j n^j + d_{j-1} n^{j-1}+ \dots +d_1 n + d_0 $$  where $j\in \mathbb N$.  Let $k$ be some composite number with $r$-many factors. Then $$\begin{array} \ k &=& p(n_1)^{i_1} p(n_2)^{i_2} \dots p(n_r)^{i_r} \\ &=& (d_j {n_1}^j + d_{j-1} {n_1}^{j-1}+ \dots +d_1 {n_1}+d_0)^{i_1} \dots (d_j {n_r}^j + d_{j-1} {n_r}^{j-1}+ \dots +d_1 {n_r}+d_0)^{i_r} \end{array}$$    I don't really see how to progress from here unless I want to start doing ungodly amounts of computation. Could someone provide a hint of a path I should be taking?

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


I ssh into an ubuntu machine from a MAC. I have some screens running on the ubuntu machine. I attach to a screen using screen -r <name of screen> command. How do I look at the output of previous commands I have run on the screen? For example, when I use the scroll bar, I do not see the previous output. Following are what I have tried so far -  Cmd + A, :scrollback 1000  Cmd + A, ESC, Up Arrow  Created ~/.screenrc file and added shell "/usr/bin/bash" termcapinfo xterm* ti@:te@   Cmd + A, Cmd + F to search for previous outputs. This worked but it only searched in text that was on the screen. I need to search for previous text that is not visible on the screen.

I use  for my command-line tasks while managing the servers where I work. I usually run small commands (mostly file-system tasks) but sometimes I run more extensive tasks (like DBA).  The output of those tasks is important to me. Since I use Ubuntu and OS X (both Terminal Windows) for my tasks, yet I need to use screen, the scrolling is not available, so any long output (think a 500-row table from a select) is invisible for me. Mouse-wheel is out of the question.  When I say "scroll is invisible for me, I mean this:    I was thinking about two options:   Pause (think paginate) the output of a certain command. When the output begins, it would let me read what's happening, then I press "Enter", then the output continues until there's nothing more to show. Scroll inside screen. But I don't know if this is possible.   Of course, I don't know if those options are actually possible. If they are, how can achieve them? Other alternatives will be well received.


I recently noticed on Ask Ubuntu that Community ♦ casts upvotes and downvotes.  I read in  that Community can cast downvotes in some cases, but I haven't found any information on upvotes.  Here's a screenshot from Community's profile on AU:    I checked on a few other sites; here is mechanics.stackexchange's Community profile:    And Stack Overflows:    And last but not least, IoT beta:    So my question is, under what situations can Community vote on posts?

If Community is a background process and not a real person then why does its profile show that it has votes cast, and how does it cast them?  How can it decide which answers to upvote or downvote?  See the massive number of upvotes and downvotes cast in its profile:


I'm using Dataloader to Upsert a Child Account to Parent Account using an external ID.  When the Upsert is complete, it's creating a new account, it's not not connecting the Child Account to the Parent Account.  ((See Answer Below))

I'm using Dataloader to Upsert a Child Account to Parent Account using an external ID.  When the Upsert is complete, the Child overwrites the parent, it's not not connecting the Child Account to the Parent Account.  ((See Answer Below))


$$ \sum_{p \, \in \text{ primes}} \frac{1}{2^p} $$  My friend came across a book which claimed this to be irrational and claimed it could be solved using the pigeonhole principle.

Let $\mathbb{P}$ be the set of prime numbers, and consider $m=\displaystyle\sum_{p\in\mathbb{P}} \frac{1}{2^{p}}$. Is $m$ irrational?  In the following  , the author recalls several sufficient criteria for irrationality. When applying some of this criteria to $m$ I arrive that the condition of some of the criteria are not satisfied by means of Bertrand´s Postulate.  I found a similar result by Sándor:  Let $\lbrace a_m\rbrace$, $m\geq 1$ be a sequence of positive integers such that $$\text{lim sup}\frac{a_{m+1}}{a_1a_2\cdots a_m}=\infty \;\;\;\;\text{and}\;\;\;\;\;\;\text{lim inf}\frac{a_{m+1}}{a_m}>1$$ Then the series $\displaystyle\sum_{m} \frac{1}{a_m}$ is an irrational number.  I have yet to prove that if $f$ is a continuous function then $\text{lim sup} \;f(a_m)=f(\text{lim sup}\, a_m)$. Assuming this;  $$\text{lim inf}\; P_{m+1}-P_{m}>1$$ where $P_m$ is the $m$-th prime.  But I have trouble with $$\text{lim sup}\; P_{m+1}-\sum_{j=1}^{m}P_{j}$$ my guess is that $$\text{lim sup}\; P_{m+1}-\sum_{j=1}^{m}P_{j}\neq\infty$$ so $$\text{lim sup}\frac{2^{P_{m+1}}}{2^{P_1}\cdots 2^{P_m}}\neq\infty$$   and this theorem will result useless to tell if $m$ is irrational.   How can I prove (or disprove) that $m$ is irrational (are there any other simpler criteria)? How can I use Dirichlet criterion  or Hurwitz criterion? What is its ?    Any help is highly appreciated.      Edit: That $m$ is irrational is clear by the criteria provided in the comments, namely that if $x$ is rational then the binary representation of $x$ is periodic. The number $m$ in binary expansion has $1$ in the $P$-th position and zero elsewhere. As there are arbitrarily large gaps between primes; then the binary representation fails to be periodic.  So the question that remains unsolved is:   What is its irrationality measure?


I am a little bit confused about  truncated distributions such as truncated normal distribution. I have a code in FORTRAN where the function gen_rnorm(mean,sigma) returns random normal value. Now I want to write a code for  truncated normal distribution with $a=-3$ and $b=3$. My question is does truncated normal distribution mean that I run the function gen_rnorm(mean,sigma) and check if the returned value is between $a$ and $b$. If not then ask for another value. Is this what truncated normal distribution means?.  I hope my question makes sense.

What is the interpretation/logic of this formula:     It's probability density function $f$, for $a<x<b$, is given by      $$ f(x;\mu,\sigma^2,a,b) = P(x|a<x<b) = \frac{p(x,  a<x<b)}{P(a<x<b)}=\frac{p(x)}{P(a<x<b)} \\  = \frac{\tfrac{1}{\sqrt{2\pi}\sigma} \exp\{-\tfrac{(x-\mu)^2}{2\sigma^2}\}}{\Phi(\tfrac{b-\mu}{\sigma})  -\Phi(\tfrac{a-\mu}{\sigma})} = \frac{\tfrac{1}{\sigma} \phi(\tfrac{x-\mu}{\sigma})}{\Phi(\tfrac{b-\mu}{\sigma})  -\Phi(\tfrac{a-\mu}{\sigma})} $$   EDIT: I was confused with what goes in the numerator and denominator and the rationale behind it in order to be able to explaint it to myself. I was reading about conditional probability P(B|A) formula and I was confused because I thought that numerator equals Probability of X being in the range [a, b] times probability of X given its in the range.   Since I am learning this all by myself there are lots of things I am confused with and have no one to ask, except you guys here. As a result, this was the cause of a vague question at first.


How can I space the lines in the whole  document ?

I would like to typeset a draft of my document with double linespacing so that my collaborators have space to write in their edits (with a pen).  How do I do it?


is the exact question I want to ask.  The accepted answer is wrong.  So I want to put a bounty on it to bring the attention of someone who provide a correct answer.  How does it work with putting a bounty on someone else's question, specifically if it has already been answered?  Will it just award the bounty to that person who gave the wrong answer, or will it bring some attention for a right answer?

It's possible to offer and award bounties of reputation on questions.   What is a bounty? How can I find questions that have a bounty attached? How do I start a bounty? When can I start a bounty? Why is the system requiring me to choose a bounty amount that's higher than the minimum? Can I use Markdown formatting in the bounty remarks? Can I edit the remark? How long is the bounty period? How do I award a bounty? Can I award a bounty to my own answer? Can I award a bounty to an old answer? If I offer a bounty on someone else's question, can I award the bounty to their answer? After awarding the bounty, can I remove it or move it to another answer at a later time? What happens if there's no answer after the bounty period? What happens if I feel my question is still unanswered? What is automatic awarding? Are bounty awards exempt from the 200 points/day reputation limit? How does Community Wiki mode affect bounties? How does user deletion or post dissociation affect bounties? Can I award a bounty to an answer from a deleted user or one where the author was dissociated? Can I offer a second bounty after the first one has expired? Can I raise my bounty? What happens if a bounty question is closed or deleted? Why can't I vote to close or migrate a bounty question? What happens if I delete my account while I have an active bounty? Do I keep an awarded bounty when I delete my answer? What happens if a question where I awarded a bounty later gets deleted or migrated? Can I cancel my bounty? Can I affect / divide / share part of my bounty to two (or more) users? How many outstanding bounties can a single user have?      See also:  in the Help Center


I'm soon going to change my infrastructure when I buy a new server. I'm going to replace my D-Link DIR-655 router with an pFsense router (and probably use the 655 as an AP) using my old server hardware (Intel Atom 330, 1GB ram, Intel Pro Server MT Dual Gigabit nic).  My new server will be SandyBridge based and run Apache+Samba.   Now while I'm setting up this new infrastructure at home I want to experiment with DDoS protection, I know there are some modules and stuff for apache that let me do it but since I will have an BSD based router the best solution would seem to set something up already in the router thus putting less strain on network hardware behind the router.   So basically with that background information I would like to ask how would I set up such a configuration and would it be the best solution?  Is it smart to set up DDoS protection in pFsense or should such a thing be handled by the webserver? One would think that it's best to drop the packages as early as possible.  Even though I probably won't be subject to an DDoS attack it's better to be safe then sorry.  Edit: I understand that my servers probably wont be able to handle a serious DDoS attack but by maximising the protection so that my infrastructure can handle a little bit bigger attacks then without protection I would probably be able to stop some script-kiddies with smaller "bot-nets" from brining down the server. So what I want to do is to have as good protection as possible software wise.   Even if it's not software related the fact that I'm only using Intel Pro Server nics should raise my odds some since they consume less cpu power then the average Realtek nics you'd see in the compromised systems. I don't want someone to be able to bring down my system just because it's not properly configured. But as mentioned earlier I will most likely never be subject to such an attack and this is mainly because I want to experiment with my options.

This is a  about DoS and DDoS mitigation.   I found a massive traffic spike on a website that I host today; I am getting thousands of connections a second and I see I'm using all 100Mbps of my available bandwidth.  Nobody can access my site because all the requests time out, and I can't even log into the server because SSH times out too!  This has happened a couple times before, and each time it's lasted a couple hours and gone away on its own.  Occasionally, my website has another distinct but related problem: my server's load average (which is usually around .25) rockets up to 20 or more and nobody can access my site just the same as the other case.  It also goes away after a few hours.  Restarting my server doesn't help; what can I do to make my site accessible again, and what is happening?  Relatedly, I found once that for a day or two, every time I started my service, it got a connection from a particular IP address and then crashed.  As soon as I started it up again, this happened again and it crashed again.  How is that similar, and what can I do about it?


so I am not new to interactive graphics programming, but I wanted to try out advanced techniques. Currently I am struggling to understand how the author of the 2011 paper "Interactive Indirect Illumination Using Voxel Cone Tracing" (Crassin et al) manages to solve the rendering equation. Specifically in section 6 he claims that the hemisphere can be partitioned into a sum of integrals. I know about the Riemann sum, but this doesn't look like it. So my question: How does cone tracing as explained in the paper solve the rendering equation?

Assume that we have voxelized a 3D scene into a regular 3D grid of cubes, storing the average (diffuse) radiance and some flag indicating whether or not a voxel is empty. Next, the finer levels of the 3D texture (voxels) are downsampled to get coarser levels ("pre-integrated") which will be stored as MIP levels for that texture. (I know that some sparser structures can be used instead, but a regular grid is conceptually the most easiest to master first.)  Now, given that we have our surface position (and thus also the voxel we are in), how does voxel cone tracing work and how is it applied?


In Harry Potter, we only know 2 children of Aurors, namely Harry and Neville. We know that Harry borders on obscenely rich, is there any evidence that Neville is similar? Or is Harry's fortune, to some extent, a family fortune?  Basically, how much money do Aurors actually earn?

So, at the beginning of Harry Potter, Harry is found to have a large vault of gold at Gringotts. Where did all of that money come from? What did James (I assume it came from him, as Lily was muggle-born, and they were both young) do to get all of that cash?


That's the question- could two people fly on the same broomstick together? Or would they be too heavy?

In Harry Potter, how does the broomstick know who to listen to when there is more than one person on it?  Is it the person in the front? The person using hands holding it? The first person to get on? Or is it its owner?  If not, can two people control a broomstick at the same time?


I'm reading Kenneth Falconer's "Fractal Geometry" and it mentions on page 35 that box-counting dimension is not finitely stable. That is, in general it is not always the case that  $$ \dim_B (E \cup F) = \max (\dim_B E, \dim_B F)$$  But rather, this property is only true for the upper box-counting dimension (box-counting dimension defined by taking the upper limit).  I've been trying to think of a counter example to see why this is, but I can't think of one. Is there any simple example? Or does it require complicated constructions to show it's not true in general.

Here the lower box dimension and the upper box dimension are exactly what Falconer talks about in his book "Fractal Geometry". I already know that the upper box dimension is finitely stable since $N_\delta(A\cup B)\le N_\delta (A)+N_\delta(B)$, where $N_\delta(A)$ is defined as usual, and Falconer gives an example to show the box dimension may not be countably stable. (We know that, however, the Hausdorff dimension is countably stable).  But now I want to find the example to show the lower box dimension may not even be finitely stable.It seems that we can use von Koch curve to illustrate this, but what is the explicit explanation for this? Since the lower box dimension is monotonic, we need to find set A and B and show that   $\underline{\dim}_B(A\cup B)>\max\{\underline{\dim}_B(A),\underline{\dim}_B(B)\}$.


I'm using the package;  \documentclass[a4paper, twoside, 11pt]{report} \usepackage[sorting = none, backend = bibtex]{biblatex} \addbibresource{Refs.bib}   to get my references. But I want to refer to multiple references so it looks like [1-5], but I get only [1,2,3,4,5].  What must I do to get the citations to look like [1-5] instead of [1,2,3,4,5]?

I would like the reference citation to appear like [1-4], rather than [1], [2], [3], [4].  Here is my MWE  \documentclass[a4paper,10pt]{book} \begin{document}   Some text  \bibliographystyle{unsrt}    \bibliography{refer}     \end{document}   How to solve this pooling of citations?


Once again unable to understand the arrows. Can any one guide with example?

I have problem with the feed back from bottom block to on top of top block. Can anyone help?


I have Server 2003 running in a Virtual Box guest VM. The host is Ubuntu 14.04. I have a mail service running in the guest.  Logged into the guest and  telnet localhost 110   responds with  +OK POP3   The Virtual Box VM is setup with NAT and port forwarding for 110. I have made sure the NIC has a unique MAC address. I have checked that no other VMs are port forwarding 110. Ubuntu firewall is not on. I am able to see the host from other machines and can connect to the guest via Remote Desktop through port forwarding it just won't connect to 110 or 143  In the host (Ubuntu) I type   telnet localhost 110   and it returns  telnet: Unable to connect to remote host: Connection refused   Tried  sudo tcpdump -n icmp   and it didn't show anything being blocked  tried  sudo netstat -tnlp | grep :110   and it showed nothing listening on that port.  EDIT: This is different to the "duplicate" question in that the problem is with VirtualBox. It would seem that VB is not listening and forwarding those ports, however it is port forwarding for other ports.  ANSWER: I thought that if VB was refusing to forward port 110 (for whatever reason) then I should try forwarding some other port (1100) and then change the email client. I did that and that resolved the problem though it would have been better to get a proper answer as this was not a "duplicate" question.

This is a  about Connection Refused    We see a lot of questions to the effect      When I try to connect to a system I get a message      Connection refused      Why is this ?


Is time really a 1-dimensional object that we traverse || is it possible that time can also be traversed horizontally.  I think the later would also put it on a 2 dimensional plane.

It’s easy, relatively speaking, to develop an intuition for higher spatial dimensions, usually by induction on familiar lower-dimensional spaces. But I’m having difficulty envisioning a universe with multiple dimensions of time. Even if such a thing may not be real or possible, it seems like a good intellectual exercise. Can anyone offer an illustrative example?


I met a problem to prove or disprove that: a. If a curve is both an asymptotic curve and a line of curvature, then it must be planar. b. If a curve is planar and an asymptotic curve, then it must be a line.  For a, I show that the derivative of the shape operator along the curve is 0 and concluding that it is true, although I am not fully convinced by my argument. However, for b, I am totally off.   This question is different from . The condition here is asymptotic, line of curvature and planar, but not geodesic. Please carefully reading the questions.

Show that if a curve $C ⊂ S$ is both a line of curvature and a geodesic, then $C$ is a plane curve.  Give an example of a line of curvature which is a plane curve and not a geodesic. (My thoughts: Take a sphere for $S$ and let the curve $C$ be any of the latitudes of $C$ that are not the equator or the poles.  Then $C$ will be a plane curve.  Additionally, since the curvature is constant on the whole of $S$, every direction is a principle direction (of sorts; this might be the flaw in my argument), so any curve is a line of curvature.  But, $C$ is not a segment of a great circle on $S$, so it is not a geodesic.)  Prove that a curve $C ⊂ S$ is both an asymptotic curve and a geodesic if and only if $C$ is a (segment of a) straight line.    Can I have some hints?  I am not very good at covariant derivatives yet, so hand-holding with detailed examples there would be nice.


Here is my code:  public class Main extends JFrame{  static int NoOfUsers; static String[][] Accounts = new String[NoOfUsers][2];  public static void main(String[] args){     Login(); }  private static void Login() {     final String FileName = "F:/TextFiles/loginaccs.txt";     try {         BufferedReader file = new BufferedReader(new InputStreamReader(new FileInputStream(FileName)));         int NoOfUsersL = Integer.parseInt(file.readLine());         String[][] Accounts = new String[NoOfUsersL][2];         NoOfUsers = NoOfUsersL;         for (int i=0; i<NoOfUsersL; i++) {             Accounts[i][0] = file.readLine();             Accounts[i][1] = file.readLine();         }         for (int i=0; i<NoOfUsersL; i++) {             System.out.println(Accounts[i][0]);             System.out.println(Accounts[i][1]);         }         file.close();      } catch (IOException e) {         System.out.println("ERROR: unable to read file.");         e.printStackTrace();        }          String username = null;     String password = null;     JTextField usernamejtf = new JTextField(username);     JPasswordField passwordjtf = new JPasswordField(password);     String[] buttons = {"Login", "Create new account"};     Object[] InputDialog = {             "Username: ", usernamejtf, "Password: ", passwordjtf     };      do {      int option = JOptionPane.showOptionDialog(null,              InputDialog,              "Login",              JOptionPane.DEFAULT_OPTION,              JOptionPane.PLAIN_MESSAGE,              null,              buttons,              buttons[0]);     System.out.println(option); //Check      if (option == JOptionPane.CLOSED_OPTION ) {         return;     }     else if (option == 0) {         if (CheckAccount(username,password)) {             System.out.println("Logged in");         } else {             System.out.println("Wrong Password/Username");         }     } else if (option == 1) {         System.out.println("Create Account.");         }      } while (!(CheckAccount(username,password))); }   private static boolean CheckAccount(String username, String password) {     for (int i=0; i>NoOfUsers; i++) {         if ((username == Accounts[i][0]) && (password == Accounts[i][1])) {             return true;          }     }     return false; }   }  In "main", I called the Login() method, and Eclipse is forcing me to put the word "static" in front of the method name. Is there anyway I can modify the program so that the line can be written as:  private void Login() {...}; private boolean CheckAccount(...) {...} etc.?  [Extra question:  Because of the word "static", I can't put something like the word "public" before String[][] Accounts = new String[NoOfUsersL][2]; Which makes the Accounts array can't be accessed by CheckAccount. How can I modify the program to fix this problem as well.] Thx everyone in advance.

To be specific, I was trying this code:  package hello;  public class Hello {      Clock clock = new Clock();      public static void main(String args[]) {         clock.sayTime();     } }   But it gave the error      Cannot access non-static field in static method main   So I changed the declaration of clock to this:  static Clock clock = new Clock();   And it worked. What does it mean to put that keyword before the declaration? What exactly will it do and/or restrict in terms of what can be done to that object?


Say I have 2 dictionaries:              var dict1 = new Dictionary<string, int> {                 { "key1", 1 },                 { "key2", 2 },             };               var dict2 = new Dictionary<string, int> {                 { "key2", -3 },                 { "key3", -4 },             };   Is there a simple way to "add" them? The result would be:              var dict3 = new Dictionary<string, int> {                 { "key1", 1 },                 { "key2", -1 },                 { "key3", -4 },             };   Keys are merged and values are summed up by key

What's the best way to merge 2 or more dictionaries (Dictionary<T1,T2>) in C#? (3.0 features like LINQ are fine).  I'm thinking of a method signature along the lines of:  public static Dictionary<TKey,TValue>                  Merge<TKey,TValue>(Dictionary<TKey,TValue>[] dictionaries);   or  public static Dictionary<TKey,TValue>                  Merge<TKey,TValue>(IEnumerable<Dictionary<TKey,TValue>> dictionaries);   EDIT: Got a cool solution from JaredPar and Jon Skeet, but I was thinking of something that handles duplicate keys. In case of collision, it doesn't matter which value is saved to the dict as long as it's consistent.


I've been buying food for my 1k+ citizen city but seems not enough, dropping from 100k food to 50k  I've planed to buy livestock and kill it rightaway for food, my first impression is: Cattle gives 200 food, (i don't know how much leather) u can sell this for 3 each, and buy vegetables, means u get 600 for doing it. looks like is not worth it, but i don't know with sheeps and chickens, any help?.  My question is different, because im not willing to make fences to farm livestock, I want to kill livestock as soon as i get em. The question is: Is it worth it? considering ships only trading animals are a "waste" in the sense i can't buy food from them, making food gathering slower.

Given chickens, sheep, and cattle, which livestock provides the most efficient (i.e. highest yield) source of food given a 20x20 field.   Does the answer change given different sized field?   Is one livestock type more efficient for any period of time (i.e. Chickens are more efficient for the first 5 years, after that cattle).


I have been thinking about equivalence principle (EP) for a while and I am intrigued about the following.  A classical example to explain EP:    On the one hand, imagine we have an elevator (e_1) located in space and it is uniformly accelerated (a) with someone inside.  On the other hand, imagine we have an elevator (e_2) located in the surface of the earth and it is subjected to earth's gravity (g).   It is accepted a = g, so theoretically we can not distinguish between e_1 and e_2.  But wait a second.  If we analyse e_1 we will realize the entire elevator and the person inside are uniformly accelerated equally. That is okey, what we expected.  But if we analyse e_2 the entire elevator will not be subjected to the same g! I confess it was a beautiful moment for me when I realized.  g = GMe/Re^2 As we increse elevator's height, g dicreases. Doing some research, I learnt this phenomena is called tidal force.  So if I am not wrong, I guess the law of the equality of inertial and gravitational mass is not valid in all cases. We could only accept it when elevator (in this example) is small enough (g will not suffer a significant change).  Could we avoid tidal force rotating e_2?

Is Einsteins Equivalence theorem in General Relativity correct? It seems to me that it neglects the fact that gravitational acceleration depends upon separation distance squared, thus neglecting the effect of tidal forces.   For example, as I sit on earth, I experience the affect of earth's gravity; Although the acceleration on my head is slightly less than the acceleration acting on my feet. If I make the claim that my frame is equivalent to me being in a space ship traveling at g, doesn't that mean my whole body is accelerating at g uniformly? This is contrary to the previous statement though.


Some background on this question:  In S05E04, "The Time of Angels", a looped recording of an angel locks eyes with Amy and enters her mind in such a way that she thinks she is turning into stone. Additionally, the following phrase is repeated multiple times:  That which holds the image of an angel becomes itself an angel.  Fast forward to S06E11, "The God Complex". Gibbis' worst fear are weeping angels, and are clearly manifested in the room with them:    Could these "images of angels" have done harm to anyone had they lingered in the room?

In episode  there is a remark about Weeping Angels:     that which holds the image of an angel becomes itself an angel   Is there any reason why in the later episode  they met the Angels hologram which are impalable by Doctor?


I've searched Stackoverflow, and there are many answers - but not to the exact problem that I'm seeing (using gcc on macOS, if that makes a difference - Mac specific suggestions won't do though because I need this to be cross platform).  I know how to convert a string to Hex into a buffer - or, at least, I thought I did.  I do it like this:  unsigned char* buffer_from_hexstring(char* string) {     unsigned char* HexBuffer = (unsigned char *)malloc( (strlen(string) / 2) * sizeof(unsigned char) );      for (size_t count = 0; count < strlen(string); count++) {         sscanf(string, "%2hhx", &HexBuffer[count]);         string += 2;     }      return HexBuffer; }   I call my function as follows:  int main(int argc, char *argv[]) {     char* hexstring = "beefcafebeefcafebeefcafe";      unsigned char* buffer = buffer_from_hexstring(hexstring);      printf("Result: ");     for(size_t count = 0; count < (sizeof(buffer) * sizeof(*buffer)); count++) {         printf("%02x", buffer[count]);     }      free(buffer); }   And the result that I get is beefcafebeefcafe. I'm missing a beefcafe.  In fact, whatever I do I only get 16bytes back - which is no useful if I want to convert more bytes.  I'm sure that it's an obvious error - but I can't see it.  Can you?

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


I want to know when the first known use of the phrase *fun fact" was.  When, where, or who first used the phrase fun fact to mean a small tit-bit of information?

Where does the term "fun fact" originate?-- namely, not with the compositional meaning but rather with the idiomatic usage to introduce some sort of unusual, esoteric, absurd or otherwise "controversial" fact?


Gravitational waves were theorized a century ago and recently discovered, leading to the awarding of the 2017 Nobel Prize in Physics. According to :     Gravitational waves transport energy as gravitational radiation, a   form of radiant energy similar to electromagnetic radiation.   The comparison to electromagnetic radiation makes me think that gravitational waves must be describable in  as well. It also makes me think that the particle form must be the long-rumored . Yet, about the graviton, Wikipedia has to say:     the graviton is a hypothetical elementary particle   I understand that relativity and quantum mechanics are not well integrated, and that this gravitational wave is a macro-scale phenomenon that, experimentally, doesn't have much to do with particles. But I have basically no understanding of how gravity is interpreted in quantum mechanics (it seems like you can ignore it at such small scales).  Shouldn't the detection of a gravitational wave be evidence in favor of the existence of its corresponding particle? Can gravitational waves be used to 'prove' the existence of the graviton particle?

I studied the theoretical part about the Gravitational waves in General Relativity (linearization of gravity and small perturbations of the metric and so on).  But I was wondering about: since electromagnetic radiation is composed/carried by Photons (or better:the EM force), shall gravitational waves be composed/carried by Gravitons?   In the end:do gravitational waves imply the existence of gravitons? Or it's something unrelated and off topic?


Seems a stupid problem, but I can't find solutions on previously answered questions here on tex.stackexchange. I have the following table (pretty simple):  \begin{table}[h]   \centering   \begin{center}   \begin{tabular}{ | p{2.5cm} | p{2.5cm} | p{1.5cm} | p{2cm} | p{1.2cm} | p{3cm} | p{1cm} |}      \hline     Id\_String &    Date &  E\_prod & MaxPm & FragPm & Tmax & Tprod \\ \hline     blah &      blah &       blah &       blah &     blah &     blah &     blah \\     \hline    \end{tabular}   \caption{Blah blah blah.}   \label{table:blah}   \end{center}  \end{table}   Which results in the following:    So as you can see the table is not in the center of the sheet (which is as wide as the screenshot), but it "overflows" on the right. I'd like it to start a little bit on the left in order to be perfectly centered in the pdf.  tex.stackexchange, what to do?  EDIT: The solution proposed in  does not solve the issue. The result I obtain by applying such solution is exactly the same as shown here.

I have some tables and figures which are (slightly) wider than the text width. This results in them aligning with the left side of my text and going far out in the right side instead of actually being centered.  I understand that using memoir and adjustwidth can solve the problem, but is there any options when using the article class?


I'm trying to create a debossed effect in a small scale. It's a coin-like layout, but not using metallic gradients:    I've been working across Photoshop for image isolation/clean up, but ultimately want to create a vector in Illustrator. The design will be printed at 1" and I'm struggling to find a combination of text, shadow and deboss effects that will be visible at such a small size.  I've tried drop shadow, inner glow, and bevel and emboss.  Is this achievable, and if so how, or should I just use text fill/stroke that provide sufficient contrast instead?

I'd like to create a realistic debossed (indented), recessed or engraved effect. Often seen on tactile commercial products, particularly for embellishing text and symbols. Here's an example of a gear stick that I'd like to illustrate (birdseye view or whatever is fine); with the gear numbers and shifting pattern debossed on the top:   Another prevalent example is hand-tools, like this open-ended spanner, featuring a combination of both debossed and embossed styling:   It has a bit of a 3D look and feel to it, but can be represented in 2D.


The question about the GeForce RTX2070 Super (8Gb) video card: I want to ask - why is it on the render in a blender with CUDA enabled, GPU enabled in Cycles render tabs, Featura support set - gives out only 10-40 percent of power (40% - at the time of launch, through 3 seconds falls less than 10% (I look at the loading of the video card in the task manager))? Is it possible to give her a load close to 100%? My system: Windows 10 Enterprise LTSC, up-to-date graphics card driver, blender 2.92

let me just preface this by saying I am new to Blender and have a very minimal knowledge pf it as of now.  The problem happened as I was following along with a tutorial and while doing a cloth simulation, I was getting about 0.4 fps (this was my first time running an animation), I checked blender's usage of system resources via task manager and everything was under utilised, with blender using memory 6-7%, cpu 8-12%, gpu 2-4% and no other major applications running. I have looked for ways to make it use more of these resources but couldn't find any that made much difference, I did in the end get it to 2 fps but that was due to a post that said scaling small objects up makes blender process the simulation better. I am hoping someone here can tell me how to optimize blender to better use these resources. I am running the animation in viewport and solid shading, this isn't with regards to rendering speeds although even then the system resources remain under-utilised.  My specs:  Dell XPS 15 9560 | Windows 10 v. 1909 64-bit  GPU - Nvidia GeForce GTX 1050  CPU - Intel Core I&-7700HQ @ 2.80Ghz (8-core)  RAM - 32 GB  Please let me know if the information is incomplete.


I understand that the torque on a dipole due to a non uniform electric field is given by the same expression as that of in a uniform electric field i.e. pEsinθ. Now,how do you calculate the work done in rotating this dipole. I tried to integrate pEsinθ.dθ from limits say θ1 to θ2. But since the electric field is not uniform how do you go about integrating the thing, or is E to be taken constant?   I was trying to calculate the potential energy of a dipole in a NON UNIFORM field and got stuck here. Also, since the force acting is non zero, work would have to be done in keeping the dipole at its position, apart from the work done in rotating it, how do you calculate that?

For an electric dipole $p$ in a uniform field $E$ we write the work done by an external agent in rotating dipole as $\text{d}W = pE\sin\theta \, \text{d}\theta$.   I'm having trouble understanding where this equation comes from and why $W = \int_{\theta_i}^{\theta_f} pE\sin\theta \,\text{d}\theta$ is true, as the only definition of work I know is $W=Fs$. How does the above equation follow?


Im trying to get all the posts and all of their images in order of index separated by a comma. So the idx could be 0,1, or 2 meaning a post can have up to three pictures.  My tables are Posts and Post_Pictures  Post  postId: (PRIMARY KEY) fullName: (VARCHAR)   Post_Pictures  postPictureId (PRIMARY KEY) image (STRING) idx (INT) post_id (FOREIGN KEY)   The final query should look like this for images belonging to the same postId:  postId | fullName |            imagesInOrder         |      1       Sam       (Img Url), (Img Url), (Img Url)   This is my current query which returns only ONE post instead of all of them and puts every image concatenated into one column instead of only the images that belong to that post:  SELECT p.*, GROUP_CONCAT(pp.image SEPARATOR ',') as photos FROM Posts as p LEFT JOIN Post_Pictures as pp ON p.postId = pp.post_id;

I need to run a query like:  SELECT p.id, p.name,         (SELECT name            FROM sites s           WHERE s.id = p.site_id) AS site_list   FROM publications p   But I'd like the sub-select to return a comma separated list, instead of a column of data.  Is this even possible, and if so, how?


I have been tying to make a device with arduino that would use two gps modules. So one sends gps cords and the other receives and compares its current location to the location of the sender and once the receiver gets a few meters from the sender an indicator led would turn on indicating the send is nearby and if you were to walk away from the sender the led would turn off. So my problem is i cant figure out how to compare the received and current values of cords to work accurately. This is what i have been trying to get to work i dont know if im going completing the wrong way with this i dont know if you can do some sort of radius and use that if someone could help me solve this i would greatly appreciate it. Example data received from sender Lat: 12.76433041 Lon: -54.74539143 from receiver Lat: 12.76433854 Lon: -54.74539435.     int destLat;  int currLat;  int destLon;  int currLng;    currLat = gps.location.lat();   destLat = Lat;   currLng = gps.location.lng();   destLon = Lon;     bool AreSame(float currLat, float destLat)     if fabs(currLat - destLat) < EPSILON;     {       if fabs(currLng - destLon) < EPSILON;       digitalWrite (4, HIGH);     }

How do I calculate distance between two GPS coordinates (using latitude and longitude)?


Why do I get a NullPointerException, when I try to execute the method "temperaturEingeben"? I hope you can understand my code because it´s in German.  public class Temperaturanzeige{                                      private int[] temperatur;                                         public Temperaturanzeige(){                                          int[] temperatur=new int[24];                                    for(int i=0; i<temperatur.length;i++){                               temperatur[i]=-100;         }      }      public void temperaturEingeben(int tempNeu,int tageszeit){         temperatur[tageszeit]=tempNeu;     }  }   Thanks for your answer!

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


How do academics (faculty members, PhD students, etc.) balance their work and life? I am a PhD student and I find myself spending at least 10-11 hours working everyday. Sometimes even 10 hours is not enough for the day, I need to burn midnight oil. However, everyone (mostly my parents and friends, who are non-academics and do not have PhD degree) is telling me that I am working too much and that I shouldn't burn out myself by doing so much work. When I hear these comments, I can't help myself but thinking 'Yeah, but that's only because you are not working in academia...you don't really understand my situation'. For those who are working in academia, do you think I am working too much as a PhD student? How much time do you typically spend a day working? If you think that I am working too much, how can I possibly strike the balance between my academic work and my personal life? I am genuinely asking because I really do not know "how to take care of myself properly" while I am constantly facing a huge workload. I do think that this will hurt me in a long run, especially if I am to pursue a career in academia. Thank you,

I'm finishing a PhD in Sweden this year and seeking a post-doc in the United States (atmospheric remote sensing).  It is clear that a job in academia is not a nine to five job; nor do I want it to be.  I often work late in the evening when I'm on a productive spur.  When an important dead-line is coming up, one needs to work harder, and there is no overtime paid.  I accept that.  However, no matter how much I'm interested in my research, I do enjoy and need a reasonable amount of spare time, too; relaxing on the weekends, occasionally a long weekend away, and sometimes a longer trip, such as three weeks in the wilderness.  Regarding the normal work ethos for early-career academics in the United States, I have a hard time judging what is normal and what is excessive.  Some examples:    warning post-docs that he expects all of the members of the group to work evenings and weekends. My apparent naïveté in believing that , despite Wikipedia  as a rest from work, or a hiatus, often lasting from two months to a year.  I was thinking of my friend, who spent a year between his PhD and his first post-doc travelling from France to Mongolia mostly on foot. Someone  I am not a good role model, but when I don't work on a Sunday, I count that as a vacation day.  having no employment-related benefits such as paid vacations, sick leave, or unemployment compensation. Question    We don't have such a work-ethos where I'm at.  I belief that working too hard risks stress and burn-out, and does not increase productivity in the long run, nor human well-being.  I want to do science.  Doing science makes me happy, but having time to relax while not doing science is important for me.  Does the selection of examples I gave above represent a normal situation in U.S. early-career academia?  Should I expect an attitude where asking for a 3-week holiday during the summer is considered as being not serious, or is the situation in practice usually not as bad as the examples above make it sound?  How hard to early-career academics in the United States work, really?


Is it possible to compile two different pdf outputs from the same .tex file?  For example, let's say I have a document main.tex which contains questions for students, and answers only for teachers, which I want to hide from the students. Is it possible to compile the student and teacher versions of the document from the command line with different options?  pdflatex '\documentversion{student}' main -o student.pdf # output is student.pdf pdflatex '\documentversion{teacher}' main -o teacher.pdf # output is teacher.pdf

I've found a number of answers online, and plainly none of them have seemed to be able to execute any conditional code.  answer looked particularly promising.  One thing I noticed is that in the command line help, xetex (and similarly pdflatex) claim that the COMMANDS part of      xetex [OPTION]... [TEXNAME[.tex]]   [COMMANDS]   is latex code that will be processed after the file TEXNAME.tex. Now it occurs to me that this would cause any conditionals which rely on the value of the flags set in COMMANDS to fail, due to the processor not finding the flag value until the end of the file, at which point it is too late. How do I get a command line argument to be interpretted as xetex/latex code which is to be inserted into the document at some point before the \begin{document} element?  The specific problem that I have, is that I want a document that may contain hyperlinks to different parts of the document, but only if I flag it as an electronic copy upon compilation.


I try to get the comand blocks but it says can't give can mojang help

I went to my friends house, and he was playing Minecraft on the PC. He showed me a command block, but when I went home and opened Minecraft pocket edition, I went to the crafting table but I could not find any command blocks to craft.  What are command blocks and how do I craft them?


Given HTTP supports various methods like GET, PUT, POST, DELETE ( and more like PATCH, HEAD, OPTIONS etc). I am thinking which of these methods does a AJAX request use. Or does we have the option of saying which of these methods we want to use while making AJAX requests.

I've seen a couple questions around here like , which mentions:     Unfortunately that same browser won't allow me to test HTTP PUT, DELETE, and to a certain degree even HTTP POST.   I've also heard that browsers support only GET and POST, from some other sources like:        However, a few quick tests in Firefox show that sending PUT and DELETE requests works as expected -- the XMLHttpRequest completes successfully, and the request shows up in the server logs with the right method. Is there some aspect to this I'm missing, such as cross-browser compatibility or non-obvious limitations?


I need some help in understanding the pots pictured above. How does this 4pin pot work? What is the function of the 4th pin?  Would this be the correct replacement if I want to replace the centered pot with plain resistors?

I'm reading .  In it, there's a application circuit schematic with two potentiometers that have a fourth terminal in it. See below:    The components I'm talking about is P3 and P4. I understand the terminals across the "resistor" (going to the input and ground) and the terminal with the arrow, that goes to the amplifier, but I couldn't figure out what is that terminal going to the left, connected to the 2.2 nF capacitor and 2.7 kΩ resistor.  What does it mean? What type of potentiometer is that?


I am from India and I have heard and read about Ubuntu. I am really sick of using Microsoft products. I want Ubuntu as a replacement. will it solve my needs.  I have tried downloading ubuntu. But I am facing problem. I can't locate the exact webpage or link. I think there are many version of ubuntu. Can someone help me in finding the link and also a step by step guide for installing it.  I have some other doubts. Will it have Office applications and internet browsers in its bundle or I have to download it separately.

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


I want to encode my array contents with base64 if possible in javascript (and then decode later). Example: var array = ["stack", "overflow"] // base64.encode(array)

I have a PHP script that can encode a PNG image to a Base64 string.  I'd like to do the same thing using JavaScript. I know how to open files, but I'm not sure how to do the encoding. I'm not used to working with binary data.


I'm looking for a story (probably a novel, but could have been something shorter) about a boy who always had to stay aligned in a particular direction.  He always had to undo turns he made, and then eventually had to start compensating for the earth's rotation, revolution around the sun, and so forth.  This was probably published in the sixties or seventies, but could have been older than that.  Does this sound familiar?

What is the title of the book I read in the 1960s or 1970s about a boy that somersaulted and spun throughout the day?  As he grew it became worse. The boy claimed he had a need to do this to feel right. His parents convinced him to "save it all up" till the end of the day and do it all at once in the privacy of their home.  In the end they discovered that the boy, being born in weightless space, was affected by earth's rotation / gravity (?), and that made him feel tangled up. I can't remember details and may have some of this incorrect. The book may have been targeted at young readers (teens).


How to calculate the following limit?$$\lim\limits_{n\to\infty}\sum\limits_{k=1}^n\left(\frac{k}{n}\right)^n$$ It is easy to seem the limit's existence.  But I don't know how to calculate its value.

I'm asked to find $\displaystyle\lim_{n\to \infty}\sum_{k=1}^n \left(\frac{k}{n}\right)^n$.  It seems that the sum converges.  I managed to prove that $\forall n,1<\sum_{k=1}^n \left(\frac{k}{n}\right)^n<e$  But I don't know how to prove convergence, nor find the value of the limit.


I want the div to sit in the middle of the page vertically as well as horizintally. Im looking for a css solution. I took out the margin and margin-top because they messed with the header I have.    /* CSS */  .mainDiv {   background: #fff;   padding: 20px;   width: 450px;   margin: auto;   /*margin: 0px auto;   margin-top: 200px;*/   box-shadow: 0 0 20px #333; }

Firebase Web App
   <textarea placeholder="Enter text here ..."></textarea>
     FIDDLE

How can I horizontally center a
 within another
 using CSS?

Foo foo


I've seen this technique for calling a Javascript function based on the value of a string variable.  function foo() {     alert('foo'); }  var test = 'foo';  window[test]();  //This calls foo()   Is this the accepted way to do it or is there a better way?  Any cross-browser issues to worry about?

I have the name of a function in JavaScript as a string. How do I convert that into a function pointer so I can call it later?  Depending on the circumstances, I may need to pass various arguments into the method too.  Some of the functions may take the form of namespace.namespace.function(args[...]).


The Fate Core book doesn't seem to indicate when free invocations expire; seemingly they stay around forever. This feels rather broken to me as I could carry several throwing daggers with me, add “Sharpened” aspect to all of them with free invocations, and get +2 to my roll with all of my dagger throws.  Do they actually expire at any point? Is there anything that might prevent me from doing this?

I have looked in several different Fate games' rulebooks, including Fate Core, DFRPG, Atomic Robo, FAE, and Jadepunk, which all describe Boosts as temporary Aspects you get to invoke for free, one time, and which disappear after being invoked.  In the other "invoke for free" situation I'm aware of (on Aspects newly-created via the Create Advantage action), they aren't singled out as "temporary."  I looked in many books but I'm interested in Fate Core.  So I haven't been able to figure out whether Boosts need to be invoked immediately or they disappear, without having been invoked at all?


I wanted to start a new Stack Exchange site for questions and answers related to only one country (India in my case) thereby creating a knowledge bank and inquiry site for India.  Some of the Indian people would like to ask in their native language Hindi and might want answers also in Hindi. Do Stack Exchange sites support the Hindi language and can I make such a Stack Exchange site?

The first site using internationalization, , is now online for over 7 months.   What are the plans for other sites like this waiting to be launched at ? Will this be happening soon?


On 18.04: when I do sudo apt install ttf-mscorefonts-installer & say Yes to the EULA question, it fails:  Err:1 http://downloads.sourceforge.net/corefonts/arial32.exe   Redirection from https to 'http://downloads.sourceforge.net/mirrorproblem?failedmirror=netix.dl.sourceforge.net' is forbidden [IP: 87.121.121.2 443] E: Failed to fetch https://netix.dl.sourceforge.net/project/corefonts/the fonts/final/arial32.exe  Redirection from https to 'http://downloads.sourceforge.net/mirrorproblem?failedmirror=netix.dl.sourceforge.net' is forbidden [IP: 87.121.121.2 443] E: Download Failed

How to install Microsoft fonts on Ubuntu 16.10? I tried with $ sudo apt install ttf-mscorefonts-installer but unsuccessfully. Here is the screenshot:  $ sudo apt install ttf-mscorefonts-installer ... Reading package lists... Done Building dependency tree        Reading state information... Done The following packages were automatically installed and are no longer required:   libc++1 libjemalloc1 linux-headers-4.8.0-26 linux-headers-4.8.0-26-generic   linux-headers-4.8.0-27 linux-headers-4.8.0-27-generic   linux-image-4.8.0-26-generic linux-image-4.8.0-27-generic   linux-image-extra-4.8.0-26-generic linux-image-extra-4.8.0-27-generic   linux-signed-image-4.8.0-26-generic linux-signed-image-4.8.0-27-generic Use 'sudo apt autoremove' to remove them. The following additional packages will be installed:   cabextract libmspack0 The following NEW packages will be installed:   cabextract libmspack0 ttf-mscorefonts-installer 0 upgraded, 3 newly installed, 0 to remove and 86 not upgraded. Need to get 89,2 kB of archives. After this operation, 362 kB of additional disk space will be used. Do you want to continue? [Y/n] y Get:1 http://nl.archive.ubuntu.com/ubuntu yakkety/main amd64 libmspack0 amd64 0.5-1 [38,2 kB] Get:2 http://nl.archive.ubuntu.com/ubuntu yakkety/universe amd64 cabextract amd64 1.6-1 [21,4 kB] Get:3 http://nl.archive.ubuntu.com/ubuntu yakkety/multiverse amd64 ttf-mscorefonts-installer all 3.4+nmu1ubuntu2 [29,5 kB] Fetched 89,2 kB in 0s (577 kB/s)                    Preconfiguring packages ... Selecting previously unselected package libmspack0:amd64. (Reading database ... 321446 files and directories currently installed.) Preparing to unpack .../0-libmspack0_0.5-1_amd64.deb ... Unpacking libmspack0:amd64 (0.5-1) ... Selecting previously unselected package cabextract. Preparing to unpack .../1-cabextract_1.6-1_amd64.deb ... Unpacking cabextract (1.6-1) ... Selecting previously unselected package ttf-mscorefonts-installer. Preparing to unpack .../2-ttf-mscorefonts-installer_3.4+nmu1ubuntu2_all.deb ... Unpacking ttf-mscorefonts-installer (3.4+nmu1ubuntu2) ... Setting up libmspack0:amd64 (0.5-1) ... Processing triggers for update-notifier-common (3.175) ... ttf-mscorefonts-installer: processing... ttf-mscorefonts-installer: downloading http://downloads.sourceforge.net/corefonts/andale32.exe Err:1 http://downloads.sourceforge.net/corefonts/andale32.exe   404  Not Found W: Can't drop privileges for downloading as file '/var/lib/update-notifier/package-data-downloads/partial/andale32.exe' couldn't be accessed by user '_apt'. - pkgAcquire::Run (13: Permission denied) E: Failed to fetch https://downloads.sourceforge.net/project/corefonts/the?download&failedmirror=heanet.dl.sourceforge.net  404  Not Found E: Download Failed Setting up cabextract (1.6-1) ... Processing triggers for man-db (2.7.5-1) ... Setting up ttf-mscorefonts-installer (3.4+nmu1ubuntu2) ... Processing triggers for fontconfig (2.11.94-0ubuntu2) ... Processing triggers for libc-bin (2.24-3ubuntu1) ...


In TikZ, how do you change the position of the "highlight" in the shading of a circle, such as   \documentclass{article} \usepackage{tikz} \begin{document}     \tikz \shade[ball color=red] (0,0) circle (1); \end{document}    so that the highlight appears in the exact middle of the circle? The default position of the highlight seems to be a bit to the northwest.

TikZ shading=ball creates a perfect 3D ball perspective, but it has no option to change the lighting angle, the contrast, radius of light, etc (or I am not aware of). I tried to create a 3D ball by radial shading. However, I still do not know how to change the place of inner color.  \documentclass{article} \usepackage{tikz} \usetikzlibrary{shapes} \begin{document}  \begin{tikzpicture} \node[circle,shading=ball,minimum width=3cm] (ball) at (0,0) {}; \node[circle,outer color=blue!60!black,inner color=white,minimum width=3cm] (radial) at (4,0) {}; \end{tikzpicture}  \end{document}     Which is the standard method to customize the 3D lighting?


I've been using Google Scholar search engine for a while in order to find scientific articles for my master thesis, but I've come to notice that the search algorithm is not as good as the real google search engine.   I feel that Scholar requires quite specific search terms in order to find the right articles. Does anybody share my experience and is it true that the Google Scholar search engine is worse at searching than the main Google Engine?

How is Google Scholar compared to other academic search engines and catalogues such as ScienceDirect, Scopus, and universities' own online catalogues--in terms of the following?   comprehensiveness of search (i.e. can fetch all the ever published relevant titles, whether the user have access to full-texts or not) accuracy and precision of results advanced search features usability  Are there good reasons for (or against) using Google Scholar as the only literature search tool for PhD research? Does the answer of (2) depend on the research discipline?


I have two paths:  \\10.11.11.130\FileServer\Folder2\Folder3\ \\10.11.11.130\d$\Main\FileServer\Folder2\Folder3\   And I want to detect if the both paths are the same.  I want it because I'm trying to move one file to another directory. So for the paths above, an exception is thrown.  I know I can use try and catch, but there is another way?  I thought about removing d$\Main from the second path and then compare, but it's not always true..  Any help appreciated!

In the upcoming Java7, there is a  to check if two file object are same file reference.  Are there similar API provided in the .NET framework?  I've search it over MSDN but nothing enlighten me.  I want it simple but I don't want to compare by filename which will cause problems with hard/symbolic links and different style of path. (e.g. \\?\C:\, C:\).   What I going to do is just prevent duplicated file being drag and dropped to my linklist.


We ordinarily apply above and over in place of each other.  Is there an accurate difference between them? If so, what is it? When do we use above and when do we use over?  what is the similarities between them?  we want to know what are differences exactly and accurately among them? I need a response which accurately draw these differences?

Is is possible to say that "Above" means "over" and "Under" means"below", but not the opposite?  According to my grammar:  Over - In a higher position (close or touching) Above - In a higher position  Under - In a lower position (close or touching) Below - In a lower position  Example:     There's a helicopter flying round above / over the school.   I would interpret this sentence as "above" meaning almost touching the school or not. And If I hear "over", the helicopter is almost touching school.  This makes me think about "over" and "on". "On" means that something is touching something, but if "over" can mean also "touch".Well, I would never use "over" to mean "touching something", I would use "on" instead.


I am interested in showing  that: $$\int_0^{\pi /2}\frac{dx}{\sqrt{\cos{x}}}=\int_0^{\pi /2}\frac{dx}{\sqrt{\sin{x}}}=\frac{\Gamma^2(\frac{1}{4})}{2\sqrt{2 \pi}}$$ I've come across this equality without anything else, would you please help me what I should do?

Compute the Riemann integral  $$\int_0^{\frac\pi2}\frac{\mathrm d \theta}{\sqrt{\sin \theta}}$$  It seems very difficult, I don't know how to go ahead.  Thank you very much for your help!


I was trying to prove this statement in a formal way although intuitively it sounds true.  is there any better and fast way to conclude this other than trying to see if the cumulative distribution function of $X, Z$ is equal to that of $X, Y$?

It's a really simple question. However I didn't see it in books and I tried to find the answer on the web but failed.  If I have two independent random variables, $X_1$ and $X_2$, then I define two other random variables $Y_1$ and $Y_2$, where $Y_1$ = $f_1(X_1)$ and $Y_2$ = $f_2(X_2)$.  Intuitively, $Y_1$ and $Y_2$ should be independent, and I can't find a counter example, but I am not sure. Could anyone tell me whether they are independent? Does it depend on some properties of $f_1$ and $f_2$?  Thank you.


I am trying to find $[\mathbb{Q}(\sqrt [3] {3},\sqrt [3] {2}):\mathbb{Q}]$. My guess is it is $9$. There are 3 possibilities-3,6,9. If it is not 9 then $X^{3}-3$ is not irreducible over $\mathbb{Q}(\sqrt [3] {2})$ hence it has a root in $\mathbb{Q}(\sqrt [3] {2})$. But $\mathbb{Q}(\sqrt [3] {2})$ is real field so the only possibility is that it contains $\sqrt [3] {3}$. To show this is not the case I assumed that $\sqrt [3] {3}=a+b\sqrt [3] {2}+c\sqrt [3] {4}$ and cubed both side. I have not yet completed it , but seems this methode is very long. Is there a better approach?  I WANT A SOLUTION WHICH DOES NOT USE ANY GALOIS THEORY/ALGEBRAIC NUMBER THEORY.

I've tried solving $\sqrt[3]{3} =a + b* \sqrt[3]{2}+c* \sqrt[3]{4}$, but there is no obvious contradiction, even when taking the norms/traces of both sides. I can't think of another approach.  This is part of a proof, it seems obvious, but it's really bothersome I can't prove it.


I am trying to open the E(called New Volume) drive of windows in Ubuntu 14.04 and it gives me this error message  Error mounting /dev/sda5 at /media/nisarg/New Volume: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,dmask=0077,fmask=0177" "/dev/sda5" "/media/nisarg/New Volume"' exited with non-zero exit status 14: The disk contains an unclean file system (0, 0). Metadata kept in Windows cache, refused to mount. Failed to mount '/dev/sda5': Operation not permitted The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option.   It used to be perfectly accessible only now its not.What's wrong? I logged into windows and did a shutdown as well but the same message crops up. Help .

Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount.  When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens.    Here's my partition table, if any more data is needed please let me know.     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048    20000767     9999360   83  Linux /dev/sda2        20002814   478001151   228999169    5  Extended /dev/sda3   *   478001152   622532607    72265728    7  HPFS/NTFS/exFAT /dev/sda4       622532608   625141759     1304576   82  Linux swap / Solaris /dev/sda5        20002816   478001151   228999168   83  Linux


I use a spreadsheet with a date in a row per column. I would like to have the sheet open on the current date when opening. How can I make this?

I'm trying to adjust this code so that I can jump to today's date which are all across row 2 in my spreadsheet.  function onOpen() {  var ss = SpreadsheetApp.getActiveSpreadsheet();  var sheet = ss.getActiveSheet();  var range = sheet.getRange("A:A");  var values = range.getValues();    var day = 24*3600*1000;    var today = parseInt((new Date().setHours(0,0,0,0))/day);    var ssdate;   for (var i=0; i<values.length; i++) {    try {      ssdate = values[i][0].getTime()/day;    }    catch(e) {    }    if (ssdate && Math.floor(ssdate) == today) {      sheet.setActiveRange(range.offset(i,0,1,1));      break;    }      } }    is from Marshmallow  I tried changing sheet.getRange("A:A") to sheet.getRange("2:2") and sheet.getRange("C2:PB2") but neither work.


If USB 3 is backwards compatible, why do they place USB 2 ports with USB 3 ports on motherboards?  Also, do USB3 External drives not work with USB2 ports?

I want to buy a USB 3.0 pen drive. But in my pc there is only a USB 2.0 port.   Would a USB 3.0 pen drive work on my pc?


Following  easy guide I was able to create a .desktop file. my goal was to pin this desktop file to the launcher and add two commands to it as quick list items here is what I did :  [Desktop Entry] Name=Launcher2Dock Comment=Turnes you laucher intoto dock Exec=gsettings set com.canonical.Unity.Launcher launcher-position Left Icon=/home/mushir/Desktop/icon.svg Terminal=false Type=Application Categories=Utility;Application; Actions=Move bottom;Move left [Desktop Action Move bottom] Name=Move bottom Exec=gsettings set com.canonical.Unity.Launcher launcher-position Bottom OnlyShowIn=Unity;  [Desktop Action Move left] Name=Move left Exec=gsettings set com.canonical.Unity.Launcher launcher-position Left OnlyShowIn=Unity;    everything worked just fine but I found that the mouse cursor turns into the wheel shape for about 15 seconds after runing the command from the .desktop file quick list pinned to the laucnher

To have a "minimize window" option through right click on an icon in the Unity launcher (Ubuntu 14.04), I followed the detailed instructions  about changing a .desktop file and made a custom Firefox launcher in ~/.local/share/applications/ folder. The relevant part of the .desktop file is:  Actions=NewWindow;NewPrivateWindow;Minimize  [Desktop Action NewWindow] Name=Open a New Window Exec=firefox -new-window OnlyShowIn=Unity;  [Desktop Action NewPrivateWindow] Name=Open a New Private Window Exec=firefox -private-window OnlyShowIn=Unity;  [Desktop Action Minimize] Name=Minimize Windows Exec=sh /home/myusername/Documents/xdotool_sh/minimize.sh firefox OnlyShowIn=Unity;   The desktop action "Minimize" invokes a simple shell script, minimize.sh that has the following content:  #/bin/bash name=$1 for i in $(xdotool search --class "$name"); do     xdotool windowminimize $i done   The script uses xdotool, that can be installed from the official repositories, to find all the firefox windows, iterate over them and minimize them.  The script works and the launcher right menu option "Minimize Windows" works as well, but as soon as the windows are minimized, the mouse pointer gets in "busy" mode and stays like this for about 20 seconds (although the mouse actions are still responsive).   Does anyone know why starting a shell script from a right menu option in Unity could lead to this behaviour?  EDIT: Apparently the wait period is inevitable, as explained in Jacob Vlijm's answer. Since the mouse remains responsive, avoiding the transformation of the pointer in the spinning wheel is a partial esthetic workaround, as explained on .  EDIT2: giving the system a fake window is a better solution, as explained by Jacob below.


In particular, I am interested in seeing an example of a rational function defined on a integral variety $X$ that is regular on the complement of a codimension $2$ closed set, but so that there is no extension to a regular function defined on all of $X$.

If $R$ is a Noetherian normal domain, then it is equal to the intersection of its localizations at height one primes.      What is an example of a non-normal domain that is strictly contained in such an intersection?    I'd prefer an example that is a finitely generated $\mathbb{C}$-algebra, and all I want is a candidate suggested. I'd prefer to verify it myself.


If light was infinitely fast, we could just send a light signal from Earth to the planet. But I was wondering, if we made a perfectly non-elastic rope as long as the distance between earth and the far-away planet. Could somebody pulling the rope from the earth send an instant signal to a person holding the end of the rope on the far-away planet? Will the rope side on the other planet move at the exact same moment as the rope side on the Earth? Of course, we should ignore the obvious factors making this means of communication impossible -_-

Is it possible for information (like 1 and 0s) to be transmitted faster than light?   For instance, take a rigid pole of several AU in length. Now say you have a person on each end, and one of them starts pulling and pushing on his/her end.   The person on the opposite end should receive the pushes and pulls instantaneously as no particle is making the full journey.  Would this actually work?


I have a Scott Speedster 30 Aluminum bike 2016 with 10speed Shimano Tiagra Flat pedals stock wheels...  I seek advice What reasonable upgrades can I make and benefits  Thanks

Earlier this year I purchased my first road bike (a 2013 - Felt F75). I had never really ridden before, so I didn't want to spend too much money up front not knowing how much I would actually ride. All in all, I think I'm riding more than I really ever thought I would.  My question is this:  If I wanted to start upgrading components on my bike, generally speaking, where can I get the most bang for my buck right off the bat? I've heard that getting new wheels can make a night-and-day difference in some cases, but didn't hear much evidence to back that up.  What do you guys think? Here is the spec list for the F75 for reference:  broken link. For the 2016 edition see


Earlier I posted .  I finally found an installer that seemed to work.  Now I have the TeXworks icon on my desktop.  So I ran it on a .tex file.  I got this console output:  Sorry, but "MiKTeX Configuration Utility" did not succeed.  The log file hopefully contains the information to get MiKTeX going again:    C:/Users/Yarb/AppData/Local/MiKTeX/2.9/miktex/log/initexmf.log  You may want to visit the MiKTeX project page (http://miktex.org), if you need help.  Sorry, but C:\Program Files (x86)\MiKTeX 2.9\miktex\bin\texify.exe did not succeed.  The log file hopefully contains the information to get MiKTeX going again:    C:/Users/Yarb/AppData/Local/MiKTeX/2.9/miktex/log/texify.log  You may want to visit the MiKTeX project page (http://miktex.org), if you need help.  ----  I went to that log file and found this:  ----  2015-09-10 18:28:20,953-0500 INFO  texify - running 'initexmf --quiet --update-fndb' to refresh the file name database
 2015-09-10 18:28:20,999-0500 FATAL texify - The operation failed for some reason.
 2015-09-10 18:28:20,999-0500 FATAL texify - Info: C:\Program Files (x86)\MiKTeX 2.9\miktex\bin\initexmf.exe
 2015-09-10 18:28:20,999-0500 FATAL texify - Source: Libraries\MiKTeX\Core\Process.cpp
 2015-09-10 18:28:20,999-0500 FATAL texify - Line: 290
 2015-09-10 18:29:56,841-0500 INFO  texify - running 'initexmf --quiet --update-fndb' to refresh the file name database
 2015-09-10 18:29:56,884-0500 FATAL texify - The operation failed for some reason.
 2015-09-10 18:29:56,884-0500 FATAL texify - Info: C:\Program Files (x86)\MiKTeX 2.9\miktex\bin\initexmf.exe
 2015-09-10 18:29:56,884-0500 FATAL texify - Source: Libraries\MiKTeX\Core\Process.cpp
 2015-09-10 18:29:56,884-0500 FATAL texify - Line: 290
 2015-09-10 18:30:00,495-0500 INFO  texify - running 'initexmf --quiet --update-fndb' to refresh the file name database
 2015-09-10 18:30:00,544-0500 FATAL texify - The operation failed for some reason.
 2015-09-10 18:30:00,545-0500 FATAL texify - Info: C:\Program Files (x86)\MiKTeX 2.9\miktex\bin\initexmf.exe
 2015-09-10 18:30:00,545-0500 FATAL texify - Source: Libraries\MiKTeX\Core\Process.cpp
 2015-09-10 18:30:00,545-0500 FATAL texify - Line: 290 2015-09-10 18:30:43,457-0500 INFO  texify - running 'initexmf --quiet --update-fndb' to refresh the file name database
 2015-09-10 18:30:43,503-0500 FATAL texify - The operation failed for some reason.
 2015-09-10 18:30:43,503-0500 FATAL texify - Info: C:\Program Files (x86)\MiKTeX 2.9\miktex\bin\initexmf.exe
 2015-09-10 18:30:43,503-0500 FATAL texify - Source: Libraries\MiKTeX\Core\Process.cpp
 2015-09-10 18:30:43,503-0500 FATAL texify - Line: 290

I installed a new hard drive on my computer this summer and I'm trying to install MiKTeX on it now. There were no problems when I was using my old hard drive. My OS is Windows 8.1. I'm trying to compile the following very basic file with pdfLaTeX:  \documentclass{article} \begin{document}   hi   \end{document}   Here's the first error I get:  Sorry, but "MiKTeX Configuration Utility" did not succeed.     The log file hopefully contains the information to get MiKTeX going again:   C:/Users/Tyler/AppData/Local/MiKTeX/2.9/miktex/log/initexmf.log  You may want to visit the MiKTeX project page (http://miktex.org), if you need help.   With the following errors in the log:  2015-09-03 22:23:51,625-0400 INFO  initexmf - starting: MiKTeX Configuration Utility 2.9.5700 (MiKTeX 2.9 64-bit)    2015-09-03 22:23:51,631-0400 FATAL initexmf - Windows API error 32: The process cannot access the file because it is being used by another process. 2015-09-03 22:23:51,631-0400 FATAL initexmf - Info: C:\Users\Tyler\AppData\Local\MiKTeX\2.9\miktex/data/le\1e0c0e04cb3be262fbb8e6e7ace14b67.fndb 2015-09-03 22:23:51,631-0400 FATAL initexmf - Source: Libraries\MiKTeX\Core\win\winFile.cpp 2015-09-03 22:23:51,631-0400 FATAL initexmf - Line: 520   The second error:  Sorry, but C:\Program Files\MiKTeX 2.9\miktex\bin\x64\miktex-pdftex.exe did not succeed. The log file hopefully contains the information to get MiKTeX going again:   C:/Users/Tyler/AppData/Local/MiKTeX/2.9/miktex/log/miktex-pdftex.log  You may want to visit the MiKTeX project page (http://miktex.org), if you need help.   with the following errors in the log:  2015-09-03 22:16:18,715-0400 INFO  miktex-pdftex - running 'initexmf --quiet --update-fndb' to refresh the file name database 2015-09-03 22:16:18,746-0400 FATAL miktex-pdftex - The operation failed for some reason. 2015-09-03 22:16:18,746-0400 FATAL miktex-pdftex - Info: C:\Program Files\MiKTeX 2.9\miktex\bin\x64\initexmf.exe 2015-09-03 22:16:18,746-0400 FATAL miktex-pdftex - Source: Libraries\MiKTeX\Core\Process.cpp 2015-09-03 22:16:18,746-0400 FATAL miktex-pdftex - Line: 290   Things I've tried:   Uninstalling and reinstalling MiKTeX Downloading all packages whose name starts with miktex (which is a solution that worked for someone else in a different thread) Having nothing open but TeXworks when trying to compile Looking for processes that may be related to MiKTeX in the task manager (I didn't find any)   How can I stop these errors? I apologize if my formatting is bad; this is my first stackexchange question. Thank you for your help.


I need to run the following command (with real parameters) after login:  ssh -f user@example.com -L 54321:example.com:54321 -N   I need it only for my user, not all users on the machine. Also, I need it to run whether I login via the GUI or via SSH to a plain shell terminal. I would even like to know how to do this on machines without a GUI installed.  Where would I put the above line to be run as explained?

How can I make an application automatically start when I have logged in?


Here's how, all of a sudden, my Ubuntu desktop started to look like:    A Windows-like task bar appeared at the bottom after more than a year of using the same Ubuntu without any such surprises. Does anyone know what that is and how to get rid of that thing?

How do I disable "Workspace dock" (a bottom panel with the list of open windows and a workspace indicator-cum-switcher), the one that is over "Plank" in the screenshot below?    I'm using Ubuntu 17.10.


I'm trying to strip the last character in a string if when the string is split by spaces the last element has a length of 1. I then want to put that letter in front of the rest of the other elements.   So, if I had a value of 1st Street W, I would like to convert it to W 1st Street  I'm using this code in the "Pre-Logic Script Code" box in ArcMap field calculator:  def getPrefix(Street_Name):   if len(!Street_Name!.split(" ")[-1])==1:     !StreetName2! = !Street_Name!.split(" ")[-1] + " " + !Street_Name!.split(" ")[0:-1]   And in the box below that:  def getPrefix(!StreetName2!)   I'm getting an error 000989, syntax indention error, but I have everything at two spaces in cascading from calling the function. Pretty sure that's the ESRI specification for the field calculator.

I'm trying to used the Python syntax in ArcGIS 10's field calculator and am thoroughly confused. So far the most basic calculations are failing me, and I don't understand why. I'm trying to create a function to just set the values of all cells in a column to be a multiple of the argument that I pass in ( I wanted to try something simple to test it out, as anything more complicated I tried also failed).   However, the error messages are telling me that my syntax is incorrect:    but I can't understand what is incorrect.     As an aside, I'm also horrified at how hard it is to write readable python in the field calculator box as there is no syntax highlighting, or clear indentation. It would be quicker, and easier to write an external Python script to do this calculation, but I want to try to figure out how this new function worked within the program.


I looked at an answer for a question and I don't know how they came to this conclusion.  $(k+1)!-1 + (k+1)!(k+1) = (k+2)! - 1$  What are the stepps behind it?

I know that   $$(k+1)! - 1 + (k+1)(k+1)! = (k+2)! - 1$$  thanks to wolframalpha, but I don't understand the steps for simplification, and I can't seem to find any rules about factorial manipulations on google.  Can someone explain this please?


While run in NetBeans it runs perfectly but when build and go to dist and run executable jar file report cannot run. Then I tried to run in cmd I got an error  java.lang.NoSuchMethodError: org.objectweb.asm.ClassWriter.<init> (Z) V

I'm getting a NoSuchMethodError error when running my Java program.  What's wrong and how do I fix it?


Spock was the only Human-Vulcan half breed because he was genetically created, not born. In an interview between Gene Roddenberry and Sarek (played by Mark Lenard, of course) on the album Inside Star Trek, Sarek reveals the origins of Spock through casual conversation. He was a test-tube child, incubated outside of his mother because humans and Vulcans are naturally incompatible.  So, would Spock even be able to have children? Is it possible that Spock is actually sterile, like most species cross-breeds in biology?

Like full blooded Vulcans, the hybrid Spock is driven by the urges brought on by pon farr. Can hybrid Vulcan/Humans reproduce, or are they like horse/donkey hybrids on Earth, physically willing, but biologicaly unable to create offspring?


Solve for $x$ where: $$x^2=2^x$$  Graphing the function ($f(x)=x^2-2^x$) it is clear that there are three solutions.  Two of them are nice solutions. i.e. $x=2,4$  The graph shows a third solution at $x=-0.76666...$  I found this using the Newton-Raphson method but it took quite a few iterations.  What other methods are there for solving such a question?

Possible Duplicate:          I obtained a question asking for how to solve $\large x^y = y^x$. The given restraints was that $x$ and $y$ were both positive integers. By a bit of error an trial we quickly see that $x=2$ and $y=4$ is one solution.   My question is: How do one show that $(2\,,\,4)$ is the only non trivial, positive solution to the equation?   Now my initial approach was as follows: We have   $$\large x^y = y^x$$  The trivial solution is obviously when $y=x$, so let us focus on when $y \neq x$.  Let us make a more general statement. Firstly I take the log of both sides  $$\large y \log x = x \log y $$  Let us divide by x and \log x (We now assume $x\neq 0$ and $x\neq 1$ since 0 is not a positive number, and 1 gives us a trivial solution)  $$\large \frac{y}{x} = \frac{\log y }{\log x}$$  For these sides to be equal, we must remove the logarithms on the right hand side, this is achived if $y$ is on the form $x^a$. Now This gives  $$\large \frac{x^a}{x} = \frac{\log \left(x^a\right) }{\log(x)}$$  $$\large x^{a-1} = a$$  So finaly we obtain that $ \displaystyle \large x=\sqrt[ a-1]{a}$ and $\displaystyle \large y = \sqrt[a-1]{a^a}$  Now setting $a=2$ gives us $x = 2$ and $y=4$ as desired.  My question is, how do we prove that $x=2$ and $y=4$ is the only integer solutions? My thought was to show that $ \displaystyle \large \sqrt[ a-1]{a}$ and $\displaystyle \large \sqrt[a-1]{a^a}$ are both irrational when a>2, but I have not been able to show this.   Any help is greatly appreciated, cheers =)


I'm a bit confused concerning photolysis. During the light reactions, photons are used to excite the chlorophyll molecules so they are passed to the primary electron acceptor. The electrons initially come from a split water molecule. Is water split by the photons?

In chemistry, I studied the decomposition of water as being $2H_2O_{(l)} \rightarrow 2H_{2(g)} + O_{2(g)}$. However, when water is split, the equation is $2H_2O_{(l)} \rightarrow 4H^+ + 4e^- +O_{2(g)}$. Why is that? How does $H_2$ just ionize?  Moreover, what is the mechanism for photolysis? I would have thought that splitting water molecules requires a ton of energy; yet it can be accomplished simply with light energy during photosynthesis?


Consider this special form of an alternating sum  $$s=1-(\frac{1}{2})+(\frac{1}{3}+\frac{1}{4})-(\frac{1}{5}+\frac{1}{6}+\frac{1}{7})+(\frac{1}{8}+\frac{1}{9}+\frac{1}{10}+\frac{1}{11})-(\frac{1}{12}+...+\frac{1}{16})+...$$  Notice that the ranges of equal signs increase linearly.  I wonder if the sum is convergent or not, and if it is convergent what is the result.  Edit by Rushba Mehta:  The explicit form of the series is $$1 - \sum\limits_{n=2}^\infty (-1)^{\lfloor\frac{\sqrt{8n-15}-1}2\rfloor}\cdot\frac1n$$  My Edit  I find that the sum can be written as  $$s=1+\sum_{n=0}^\infty (-1)^{n+1}(H_{n(n+3)/2+2}-H_{(n^2+n+2)/2})$$  Where $H_{k}=1+1/2+1/3+...+1/k$ is the harmonic number.  Convergence follows from the asymptoptic expansion of $H_{k}$ which leads to a series similar to that of log(2).

How would you test for convergence with a series such as this using the alternating series test?  $1-\frac{1}{2}-\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}-\frac{1}{7}...-\frac{1}{10}+\frac{1}{11}...+\frac{1}{15}-....$  I have attempted to find a summation equation for this by grouping in different ways in order to use the alternating series test but I can't find a way to group these in a logical way. Is there a grouping that would allow for analysis of this series using the alternating series test?


I am editing the following sentence, and having an issue with identifying the proper pronoun.      “Her and her husband’s journeys and careers have allowed them to travel extensively.”   I know the rule about taking away the other subject to determine the proper pronoun, and if I do that here, it’s clearly “her”. Her journey, her career. However, I just can’t shake the feeling that “she and her husband’s” just “sounds” correct. I often get this feeling about a sentence (and usually I’m correct), but can’t put my finger on the grammar rule that would back up my “feeling”.   Any help would be appreciated. I’m kind of going around in circles on this sentence.

I want to talk to someone about the house that my wife and I own.  Saying, for example, "My wife's and my house is awesome," sounds a bit funny to me.  What's the best way to express this?  Clarification  I'm asking specifically about the grammar of multiple nouns in possessive form.  I'm particularly curious if it's possible to do this with a first-person pronoun (me).  I am capable of rephrasing this in other ways - my question is not how to express the idea, but about this particular grammatical construction, if it is even legal.


I have an issue where a stored procedure will run properly when executed from SQL Management Studio, but when the stored procedure is called from an application, it doesn't return the results to the application.  This application regularly utilizes stored procedures as part of it's operation, so why this specific SP isn't returning results is odd.  Since the application works fine otherwise and since the stored procedure works just fine when run in SQL, what I'd like to do is setup sql profiler to monitor just that stored procedure, while I try to execute/call it from the application.    I'm hoping to avoid both the extra load on the system and sifting through a ton of irrelevant data that a generic profiler run would provided on a busy database like this one.  Thank you in advance for any advice on this.

I am using SQL Server 2012 and was wondering how to profile stored procedures  For instance can profiler capture each individual SQL statement in a stored procedure, what it is, and how long it takes to run etc?  I am trying to diagnose merge replication stored procedures, and this must be captured a part of a full run of the merge agent. It doesn't seem possible to grab the stored procedure with performance issues and run it again because at that point it is not slow.