Are there any ways to regain the ability to cast Wish after suffering the 33% chance to never be able to cast it again?

Are there any ways to restore your ability to cast  after suffering from the stress described in the final paragraph and losing your ability to cast it?  From the description:     The stress of casting this spell to produce any effect other than duplicating another spell weakens you. After enduring that stress, each time you cast a spell until you finish a long rest, you take 1d10 necrotic damage per level of that spell. This damage can't be reduced or prevented in any way. In addition, your Strength drops to 3, if it isn't 3 or lower already, for 2d4 days. For each of those days that you spend resting and doing nothing more than light activity, your remaining recovery time decreases by 2 days. Finally, there is a 33 percent chance that you are unable to cast wish ever again if you suffer this stress.


Finding the equation of more than one tangent line

I ran into a problem I have no idea how to begin, maybe you guys can help me out. I think maybe it has something to do with parametric equations? But this is just a guess.  Find equations of both the tangent lines to the ellipse $x^2 + 4y^2 = 36$ that pass through the point $(12, 3)$. I can easily find the derivative using implicit differentiation, but what is meant by two tangent lines?


The internal storage of each Android device is separated into partitions such as system and boot. Most devices have only a single copy of each partition, but devices that support seamless updates have two copies of certain partitions—slot A and slot B, hence A/B—so that one copy of the partition lies dormant while the other is in active use. Because each partition is a copy, they can be used interchangeably to boot into Android. This also means that you can update one partition in the background and then swap to it when you reboot—thus your update is seamless!  I need to know more about this for a stock unrooted device:   After OTA system update, does the device install OS to both partitions? Or  install to only one partition.  whether the device continues to same(current) android version until reboot manually?(after installing version update). Or whether it updates current to latest version overnight. When normal reboot(not after update), how can a user identify whether device is booted to which slot (A/B)? Else, will the device continues to current slot on normal reboot(for example if it is A).  If any one slot got corrupted, Is it possible to use other slot only.


Hibernation is still missing from menu in 13.10 after enabling via polkit. How to enable?

I know that since 12.04, we need to add a policykit rule to enable hibernation (see question  and the ).  I can successfully bring my laptop into hibernation mode with sudo pm-hibernate or sudo s2disk, so the rule is in place and works, but the hibernation entry is still missing in the menu.  I can tell from looking through the source of the indicator-session package (but not understanding the whole code) that there is still a hibernation menu entry in the code and it should be displayed when the system is capable of hibernating. Please calm down if you're enraged by this. This is very unlikely to be a conspiracy, but rather a bug/regression on a deeper level, which can happen when you move code around or replace it.  Question: What needs to be done in 13.10 to properly tell indicator-session that the system can hibernate?    Possible duplicate:  - No activity, because saucy was in development at that time, so out of scope for AskUbuntu.  Related bug report:


Ways to make my game world bigger without slowing users CPU

I've been developing  for a little while now, but I've found that I want to make the game world MUCH bigger. It's currently about 300*300 tiles, but has creatures and bad guys running around the whole thing, so I've got to keep track of all the enemies movement and hostile-finding algorithms. I'm wondering how I can scale something like this up? It seems (from code profiling) that enemies are the limiting factor, and it's mainly that for each enemy, I need to scan through all the player-units and creatures to see if they're close enough for the enemies to see/attack. Edit: W,S,A,D,B,Q, if anyone's interested in controls :) Edit 2: Please tell me if there's any way I could improve the question!


Windows 10 shortcuts - onenote vs cortana

I'm happy with my windows 10. It looks just like windows 7, but nicer. There's just this little thing...  I like OneNote snipping tool. At the press of Windows+S it lets you pick a region on the screen and put it on your clipboard. Awesome, using that at least 10 times a day.   Since Windows 10 when I press Windows+S it starts Cortana Search. Which is probably also awesome, I just want it to occupy another shortcut - say - Windows+P or something else far away for now.  Q: Is it possible to move or disable the keyboard shortcuts of Cortana?


I need to prove that $a_{n} = (1^{2} +2^{2} + ...+n^{2})^{n} >n^{n}(n!)^{2}=b_{n}$ for any natural number n.   Proof:  Note that by the arithmetic-geometric mean inequality,$\frac{1^{2} +2^{2} + ...+n^{2}}{n} > (1^{2}\cdot 2^{2}\cdot...\cdot n^{2})^{n/2}$. Then $1^{2} +2^{2} + ...+n^{2} > n(1^{2}\cdot 2^{2}\cdot...\cdot n^{2})^{n/2} = n(n!)^{n}$. This implies that $a_{n} =(1^{2} +2^{2} + ...+n^{2})^{n} >n^{n}(n!)^{2n} \geq n^{n}(n!)^{n}= b_{n}$. Then we conclude that $a_{n} > b_{n}$ for all natural numbers $n$.  Is there anything wrong with my proof?


For those who went through most possible solutions online, I hope this save you from headaches. So a while ago, I had a PDF file that I saved from Google Chrome that had an excessively long name. Little did I know that Windows will mess things up when a certain file name is too long. When I decided to delete the PDF when I'm done with it. It does not budge. Literally No error code/message, No indication, Nothing happened to the file Also when I attempt to change the filename, nothing happened as well. BUT if  I saved the name as it is, it came up with an error message saying it's too long. Tried various methods as well:  uninstall Adobe programs using CMD to delete booting into safe mode using CMD to delete in safe mode changing file extension (result is same as deleting and renaming) archive the file (failed)


How to I print information from a map that has the object as the value?  I have created the following map:  Map<String, Object> objectSet = new HashMap<>();   The object has its own class with its own instance variables  I have already populated the above map with data.   I have created a printMap method, but I can only seem to print the Keys of the map  How to do I get the map to print the <Object> values using a for each loop?  So far, I've got:  for (String keys : objectSet.keySet()) {    System.out.println(keys); }   The above prints out the keys. I want to be able to print out the object variables too.


Currently learning about projective varieties in the classical setting (over algebraically closed fields). I've seen several sources mention that "quasi-projective varieties have the same geometric dimension as their closure", but without really explaining/proving why this is the case. Any references?


I'm modelling a helmet and one of the pieces needs sharp edges. The problem is that the edge loop continues onto a part of the mesh that needs to stay smooth/curved. I'm unsure of how to edit the mesh to fix this whilst maintaining good topology, so any help on how to fix this is greatly appreciated.


Why does `ls -l` count more files than me?

Apparently I cannot count. I think there are three files in /media  $ tree /media /media ├── foo ├── onex └── zanna 3 directories, 0 files   However, ls -l finds 12.  $ ls -l /media total 12 drwxr-xr-x  2 root root 4096 Jul 31 20:57 foo drwxrwxr-x  2 root root 4096 Jun 26 06:36 onex drwxr-x---+ 2 root root 4096 Aug  7 21:17 zanna   And, if I do ls -la I get only . and .. in addition to the above, but the count is total 20  What's the explanation?


This is a simple program to calculate an answer but after rounding off upto 2 decimal places for loop is giving wrong results. #include <iostream> #include <iomanip> using namespace std; int main() {     int t;     cin >> t;     float a, b, c, d;     while (t--)     {         cin >> a >> b >> c >> d;         float speed = (a * b * c * d);         float ans = (100 / speed);         ans = (int)(ans * 100 + .5);         ans = (float)ans / 100;         cout << ans << endl;         if (ans >= 9.58)         {             cout << "NO" << endl;         }         else         {             cout << "YES" << endl;         }     }      return 0; }  input 3 1.0 1.0 1.0 10.45 1.0 1.0 1.0 10.44 1.0 1.0 0.9 10.44  output 9.57 YES 9.58 YES 10.64 NO  As seen in second testcase the if statement for value 9.58 is giving yes as output but should gives no.


sed returns the following error sed: -e expression #1, char 101: unknown option to `s'

I'm writing a script to replace a label <p> with a path in some text files (*.prop). However , when I run it I get the following error:  sed: -e expression #1, char 101: unknown option to `s'   My code is the following:  sed -i --  "s/<q>$(echo $destpath | sed -e 's/\\/\\\\/g' -e 's/\//\\\//g' -e 's/&/\\\&/g')/\ResultsTesting/\/g" *.prop   and if I print the echo of my code:  sed -i -- \ s/<q>\/home-students\/rmorales\/testAPK\/air.air.air.com.tabc.gsn-2014_5_11-dex2jar\/ResultsTesting\//g \ myFile.prop   Can someone help me please?


Should I still post an answer if I see several answers have already been posted while writing an answer or making a fiddle?

It has been happening to me frequently that while I am writing an answer, I get notification that some answers have been posted already, or sometimes I don't even get notifications because of my slower internet and when I finally submit the answer and the page refreshes I see several other answers have already been posted.   What I do more often is that, I read the question (mostly on jQuery tag) go to jsfiddle and try setting up a working fiddle first. Then when I come back with a working fiddle I see some answers have already been posted. What should I do in these cases,   1) Just throw away the working fiddle and move to a new question  2) Post the answer anyway, which may trigger comments like, why are you copying answers or Is there an echo here? etc which I don't like to hear.  3) Check the already posted best answer and in comments suggest the answerer to use the fiddle in the answer if he hasn't added one already.  I also see a trend like people throws in a very short answer asap and continuously edit the answer to add more information and add working fiddle later. Is that something I should be doing too?   I have been active in SO recently, I am just trying to know best practices that the community follow.  Or when I make a working fiddle (which takes some time), and post the answer anyway, and hear things like why did you copy answers, or your are 5mins late with the same answer what should I do in those cases, delete the answer?  I would like someone to clear up these confusions I have.


How common is it for submitted papers to have minor errors?

I am going to submit a paper in these days. I dedicated to it a lot of time, and a lot of effort to check that all the theoretical results in it are correct. Anyway, I am still afraid of having written something wrong without even realizing it, as the deadline is very sharp.  So my question is: how common is in the academia to find submitted papers with minor errors? If there is a minor error that is not invalidating the results, will the paper be rejected, even if the content is considered interesting?


I use  Entity Framework together with Linq to fill my gridviews. I would like to get the same data I get from the Linq in an excel. Also a second tab in the same excel sheet should come from another Linq query.  Whats the easiest and best way to do this?


I am trying to use Stack Exchange Andoid App to use my accounts in Stack Overflow & Area 51.   For the Area 51, there is only Area 51 Discussion. Even Area 51 Discussion isn't working in the App!   VERSION 1.0.51  When adding this site, it's showing the correct full name as in this screen-shot:     However, when I pin this site to my fav sites in Stack Exchange, it is showing: Unknown Site. When clicking it, it shows black screen then just quit the App!  Here is the screen-shot:       Is the site not yet capable with Android? or is it a bug in the App itself?  PS: this question isn't duplicate:   In the previous versions of the App, the site was opening but with Unknown Site name. However, in this version, it quits the app when pressing the area site! It isn't opening at all! This question is also to track this bug in the App. As it's about the site name issue & the content as well.


If I buy or build a computer with no OS, how do I get Ubuntu?  I am looking at building a PC with a tight budget and don't want to blow US$100 on Windows 10.


Prevent VLC from always showing in the sound indicator

VLC, a program I use only rarely, has an entry in the sound indicator. I can remove it using dconf by following instructions from , but each time I start up VLC, despite it being in the "blacklisted-media-players" section, it reappears. I also tired some things listed , but that didn't help either.  The entry "vlc.desktop" keeps appearing under "interested-media-players":   Is it possible to either prevent VLC from showing up in the sound indicator menu entirely, or, preferably, only show up when I'm actively using it?


How to create a double arrow line with a variable on its top. Something like this.


On Meta, have Community ignore posts with a [status-*] tag when bumping

Just ran across , which was bumped by  for having been unanswered. However, it was answered by Jeff (no upvotes), along with a  tag. I gave an upvote so that it wouldn't be bumped again. But, Community should ignore those posts, since they have an official answer.  Possible exceptions, as pointed out by random, are the statuses planned and deferred.  Statuses bydesign, completed and declined should be ignored by Community.


Convergence of the series $\sum_n \frac{n^{\log(n)}}{\log(n)^n}$

I have a rough outline of a proof. Is this correct?  $$\sum_{n \geq 2} \frac{n^{\log(n)}}{\log(n)^n} \to a \in \mathbb{R} \iff  \sum_{n \geq 2} 2^n \frac{(2^n)^{\log(2^n)}}{\log(2^n)^{2^n}} \to b \in \mathbb{R}$$ via dyadic criterion (or Cauchy condensation test).  Analyzing the right-hand side:  $$\sum_{n \geq 2} 2^n \frac{(2^n)^{\log(2^n)}}{\log(2^n)^{2^n}} = \sum_{n \geq 2} 2^n \frac{(2^n)^{n\log2}}{(n\log2)^{2^n}} = \sum_{n \geq 2} \frac{(2^n)^{n\log2 + 1}}{(n\log2)^{2^n}} = \sum_{n \geq 2} \frac{2^{n^2\log2 + n}}{(n\log2)^{2^n}} = (\ast). $$  We know for some sufficiently large $N$, $n \log 2 \ge 2$ for all $n\ge N$, so we can bound the series above by:  $$(\ast) \leq C_N + \sum_{n \geq N} \frac{2^{n^2\log2 + n}}{2^{2^n}} = \sum_{n \geq N} 2^{n^2\log2 + n - 2^n} = (\ast\ast),$$  where $C_N$ is the finite sum of the original series until $N$. And once again, for sufficiently large $M$, $m^2\log2+m - 2^m \leq -m^2$ for all $m \ge M$. Hence  $$ (\ast\ast) \leq C_{\max(N,M)} + \sum_{n \geq \max(N,M)} 2^{-n^2} < \infty.$$  We then use the $p$-test to conclude that the sequence does converge.


How to assign different faces of the same object different materials?

I have subdivided a plane into 50 x 50 faces,  then I random selected some of those faces and saved them as a group,  I hid them with h and random selected among the other faces and made them another group.   I repeated this a couple of time, so that I had one objected which contained several groups of faces.   From this point on, I tried to select one group and assign to them one material and to another group another material and so on...basically to achieve a floor of tiles with different kind of tiles.  But, it did not work.


Sort list of dictionaries according to index

I am trying to sort a list with dictionaries.  I have the following example:  test = [{'index':'22','text':'a'},{'index':'21','text':'b'},{'index':'28','text':'c'}]   I tried sorting this list in increasing order of the key "index" with the following code:  sorted(test,key = lambda k:k['index'])   But I get the error "builtin_function_or_method object is not iterable".   Can someone help me?


I am rookie in Mac and I came from Ubuntu  On my previous Dell laptop if I needed to mark some part of text in order to copy or delete it I just made one short touch on touchpad and immediately second touch (not click) and second touch I keep my finger on touchpad and than I can just move mouse and mark text.  or for example how I deleted files:  I have a file on desktop I need to trash it. I put mouse on the file make one short touch and immediately second touch and keep touch on file and now I am able to move file to trash on somewhere on the desktop.  But with mac touchpad I need make click (not just touch) and keep click with one finger and another finger I can move the file somewhere I need. Just remember how you move you file on the desktop, you use two fingers for this.  I hope I describe my problem clearly but feel free to ask  Question is : if there is some settings how to change behavior of touch click?


How to color the space between three linear functions?

I know that here on TeX.SX a plethora of similar questions has been answered, but strangely I couldn't find the one suiting my purpose. To that end I apologise if this post is a duplicate of some other I don't know of.  The MWE is as following:  \documentclass{article} \usepackage{mathtools} \usepackage{tikz} \usepackage{pgfplots} \usepackage{xcolor}  \setlength{\parindent}{0cm}  \begin{document}  \begin{tikzpicture} \begin{axis}[xlabel=$x$,ylabel=$y$, xmin=-15,xmax=15,ymin=-10,ymax=10, axis lines=center, axis equal, scale=1.6]  \addplot[domain=-15:15, color=blue, samples=400](\x,{\x + 1}); \addplot[domain=-15:15, color=red, samples=400](\x,{4}); \addplot[domain=-15:15, color=green, samples=400](\x,{-1/2*\x - 2});  \node at (axis cs:-2,-1) [circle, scale=0.4, draw=black!80,fill=black!80] {}; \node at (axis cs:3,4) [circle, scale=0.4, draw=black!80,fill=black!80] {}; \node at (axis cs:-12,4) [circle, scale=0.4, draw=black!80,fill=black!80] {};  \node at (axis cs:-2,0) {$P_1$}; \node at (axis cs:3,5) {$P_2$}; \node at (axis cs:-12,5) {$P_3$}; \end{axis} \end{tikzpicture}  \end{document}   Which produces:    I would like to know how to color the polygon (or simplistically the triangle) defined by these three linear functions. All of the answers to similar questions only discussed the relationship between two "objects", not three. I've tried many methods, but without success. I would be gratified if you helped me out.


Find the minimum value of the expression $|z|^2 +|z-3|^2 +|z-6i|^2$

I have this question as homework:      Find the minimum value of the expression: $|z|^2 +|z-3|^2 +|z-6i|^2.$   Here's what I did: I plotted the points (0,0), (0,6), and (3,0) on the argand plane and joined them to make a triangle.   Now here is where I doubt myself. I found it centroid (1,2) and this should be the centre of mass if unit masses are kept at every vertex. Yes, centre of mass. Now the Moment of Inertia of a planar object is minimum about the axis passing perpendicular through its centre of mass and also from the parallel axis theorem  $ I = Icom + md^2$ where $ Icom = (1)|z|^2 + (1)|z-3|^2 + (1)|z-6i|^2$ I is the moment of Inertia about any axis parallel to Icom at a distance d from it.  So the minimum value of expression must be minimum about this point only. My answer is also correct.  If I am correct how do to explain it mathematically or using mathematic theorems or axioms. Otherwise how do I do it.  Thanks.  I can shift this to Physics Stack Exchange if this doesn't fit here. Sorry for no LaTeX as I have just started using Stack Exchange from mobile. Please edit whatever required.


How to determine the direction of a wave propagation?

In the textbook, it said a wave in the form $y(x, t) = A\cos(\omega t + \beta x + \varphi)$ propagates along negative $x$ direction and $y(x, t) = A\cos(\omega t - \beta x + \varphi)$ propagates along positive $x$ direction. This statement looks really confusing because when it says the wave is propagating along $\pm$ x direction, to my understanding, we can drop the time term and ignore the initial phase $\varphi$ while analyzing the direction, i.e. $y(x, 0) = A\cos(\pm\beta x)$, however, because of the symmetry of the cosine function, $\cos(\beta x)\equiv \cos(-\beta x)$, so how can we determine the direction of propagation from that?  I know my reasoning must be incorrect but I don't know how to determine the direction. So if we don't go over the math, how to figure out the direction of propagation from the physical point of view? Why $-\beta x$ corresponding to the propagation on positive x direction but not the opposite?


I am trying to find a function such that   $\dfrac{d}{dx}f(x)=f(x-1)$   Is there such function other than $0$ ?


I have problems when using XMLHttpRequest. One occurs in Chrome; the other in firefox  xhttp = new XMLHttpRequest(); xhttp.onreadystatechange = function() {     if (this.readyState == 4) {         if (this.status == 200)              elmnt.innerHTML = this.responseText;         }         if (this.status == 404) {             elmnt.innerHTML = "Page not found.";         }     } } xhttp.open("GET", file, true); xhttp.send();   I'm working locally, i.e. all protocols are file://  In chrome, where I have added parameter --allow-file-access-from-files, this.status is 0. Why?  In firefox, the status is 200, but there will be a XML parsing error when the included file has code like this:  <script> alert(-1<1); </script>   and an XML parsing syntax error occurred indicating 10th character.  Why? I guess firefox does not recognize '<' between script.  Are they bugs or some issues I don't know yet?


Do features that allow you to add twice your proficiency bonus, under some other name, stack with Expertise?  For instance, , with  as applied to History checks, to identify the origin of stonework.  The text of Stonecunning is reproduced below:     Whenever you make an Intelligence (History) check related to the origin of stonework, you are considered proficient in the History skill and add double your proficiency bonus to the check, instead of your normal proficiency bonus.   And, for good measure, the relevant portion of Expertise:     Your proficiency bonus is doubled for any ability check you make that uses either of the chosen proficiencies.


Best app to switch between all open windows

After 4 years of being a Mac user, there is only one thing that I still miss from the Windows world, and that is being able to switch with a single keystroke between all open windows in the computer.  What is the best app or utility, free or not, for accomplishing that?  I've used , but I never was completely satisfied with it. It's a bit slow and the switcher UI is not very pretty.  Do you know any alternative?    EDIT (2016): This question keeps getting views and upvotes after 6 years. When I asked this question in 2010 I was still transitioning from being a Windows user. Eventually, I got used to Mac OS X UI and nowadays I don't use any third party utility for managing app windows, just Mission Control and the native keyboard shortcuts. So, although this question is no longer relevant for me I hope it is useful to new Mac users making the switch (Including this comment).


How do I customise automatically-generated script?

When you create a script via the Unity editor, it generates a script with some pre-formatted code.  using System.Collections; using System.Collections.Generic; using UnityEngine;  public class GenericClass : MonoBehaviour {      // Use this for initialization     void Start () {      }      // Update is called once per frame     void Update () {      } }   When I create a script, I am generally guaranteed to use additional code, such as a namespace or a custom editor. Furthermore, I almost always delete content from the automatically-generated script. Is there a way to change the automatic code generated by Unity?


What is the best way to clear the CSS style "float"?

I'm pretty accustomed to clearing my floats by using <br style="clear:both"/> but stuff keeps on changing and I am not sure if this is the best practice.   There is a  (from positioneverything) available that lets you achieve the same result without the clearing div. But... they claim the hack is a little out of date and instead you perhaps should look at . But.. after reading through 700 pages of comments :) it seems there may be some places the latter hack does not work.   I would like to avoid any javascript hacks cause I would like my clearing to work regardless of javascript being enabled.   What is the current best practice for clearing divs in a browser independent way?


Ubuntu 16.04 does not recognize sublime as a text editor

I've installed it, I can run it via the terminal, I also can find it via search (comes up as untitled - Sublime Text) and lock it to the launcher, but when I right click a file and try to choose sublime as the application it's not in the list. I've tried setting it as default via the instructions given  , but that didn't help. I've set it as the default editor for git commits, but that doesn't work either. I've checked that it's in the path: subl sits in /usr/bin and echo $PATH returns:  /usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin   Anyone having the same issue?


Show that $f_n(z)=z^n$ converges locally uniformly on $|z|<1$ but not uniformly(?)

Show that $f_n(z)=z^n$ converges locally uniformly on $|z|<1$ but not uniformly.   I am really confused. I saw a seemingly reliable reference stating that $z^n$ does not converge uniformly to $0$ on $\{|z|<1\}$ but it does converge uniformly on $\{|z|\le r,r<1\}$. What is the nuance between the two former sets? With $r_n<1,r_n\to 1$, shouldn't one conclude that $f_n(z)$ uniformly converges on $\{|z|<1\}$? And besides, this source tells me what I have to prove for Homework is disproved, which really makes it more frustrating.  I would appreciate any help.


Why don't dictionaries include the most common meaning of the word "punt"?

Why don't dictionaries include what is, in my opinion, the most common meaning of the word "punt", which is to "(strategically) give up"      They punted on the hard problem.   Neither Oxford's, nor M-W list this meaning. In fact, M-W lists ten different meanings, many of which I never encountered.


My bash script won't execute commands after kill command

I am trying to make a bash script that is killing a process and then it's going to do other stuff.  PID=`ps -ef | grep logstash | grep -v "grep" | awk '{print $2}'` echo $PID kill -9 $PID echo "logstash process is stopped" rm /home/user/test.csv echo "test.csv is deleted." rm /home/example.txt echo "example.txt is deleted."   When I run the script, it kills logstash as exptected but it terminates also my whole script.  I've also tried: kill -9 $(ps aux | grep 'logstash' | awk '{print $2}'). With this command, my script will be terminated as well.


Reference or a mathematical equation for R squared and adjusted R squared for panel models used in the R package plm

I'm using  in  and I'm trying t o find out exactly how R squared and adjusted R squared is calculated for panel models in .  I looked at , on which I can , but it did not have any references or further links. The source code is a bit complex for me to deconstruct. Normally the man pages are very good with references or links, but I can't seem to find my way here. Any help would be appreciated. I realize this might be incredibly simply.


Ongoing problems with "ask a well-received question" counter

I have asked 9 well-received questions over 8 days, yet my count is still 6/30 on the Inquisitive badge:    I've had this problem before:    The answer, it turns out, was some kind of caching issue.  Is that still the case?


How to check if Win 7 disk is 64bit and what version?

I've got a DVD that I've burnt from an MSDN ISO. I'm not entirely sure if its Windows 7 64bit or 32bit.   How can I be sure?


From the Wikipedia entry on the  (emphasis mine),     From the CMB data it is seen that the earth appears to be moving at 368±2 km/s relative to the reference frame of the CMB (also called the CMB rest frame, or the frame of reference in which there is no motion through the CMB). The Local Group (the galaxy group that includes the Milky Way galaxy) appears to be moving at 627±22 km/s in the direction of galactic longitude l = 276°±3°, b = 30°±3°.[82][10] This motion results in an anisotropy of the data (CMB appearing slightly warmer in the direction of movement than in the opposite direction).[83] From a theoretical point of view, the existence of a CMB rest frame breaks Lorentz invariance even in empty space far away from any galaxy.[84] The standard interpretation of this temperature variation is a simple velocity red shift and blue shift due to motion relative to the CMB, but alternative cosmological models can explain some fraction of the observed dipole temperature distribution in the CMB.[85]   What does the bold sentence mean?


Using Rasterio to work with two rasters of different extent and resolution?

I have two spatial rasters of different extent and different cell size and I want to do a conditional statement with them. I decided to use rasterio for that. I use this code:  with rasterio.open('A.tif') as src: A = src.read()  with rasterio.open('B.tif') as src: B = src.read()  C = np.where ((A == 2) & (B == 1), 1, 0)   This is the error message:      operands could not be broadcast together with shapes (1,982,1042)   (1,701,851)   What is the method to deal with this?


Most of the questions here are about creating a live/installation bootable USB key, but what I need is different and I can't find an answer. I have a Linux installation on the hard drive, which, after installing Windows 10, is (obviously) not bootable. "Start with a liveCD and reinstall grub" I hear you say, but I don't want to do that: I don't want to install grub because the Linux installation is only temporary. What I need is really just a way to boot (once or twice, to run some tests) into the Linux partition. I'm pretty sure what I have to do is start from a LiveCD and enter some custom boot parameters, but I'm pretty ignorant in the matter so I have no idea what the command line should look like. Help please!


"Machine Learning: A Probabilistic Perspective by Kevin Patrick Murphy" in page 31 says     iff there exist function g and h such that      p(x, y|z) = g(x, z)h(y, z) ...   I guess exist here should be exists, is it?


Downloading entire web pages within domain

My computer in on LAN. I'm connected to the local domain at MyDomain. Within that domain exists something like WIKI for a training (http://training-wiki/). I would like to download entire WIKI into my PC to make it available for chosen clients. I found something called HTTrack but it doesn't seem to work. Our domain needs a login and password. Is there any tool that handles such a case?  I tried some other programs, but the same problem. Maybe I'm doing something wrong? I get:      401 Unauthorized   I tried wget:  wget --http-user=MyDomain\UserName --http-passwd=MyPassword --mirror -p --html-extension --convert-links http://training-wiki/   but getting the same 401 Unauthorized.  [EDIT]    It's not a duplicate. I said I want to download entire web site within domain using login/password. Programs listed in "duplicated" thread don't solve my problem at all... Please, READ the question before you mark it as a duplicated one...


Axiom of Choice: Family of non-empty sets mutually disjoint or not?

I have noticed that the family of non-empty sets referred to in statements of the Axiom of Choice is sometimes required to be mutually disjoint, and sometimes not. Why is that?


I have buffer of 16 bytes that encrypt with AES 128 cbc with IV =000000......(all IV is 0)  I have the encrypted buffer, and I know 7 bytes from 16 bytes before the encryption , I dont know the key .  I want to find out the key.  Is that help to find out the key? Less option than 2^128?


How can I convert a tag to being a synonym?

For example, there are 3 tags on Stack Overflow:        How can I merge all 3? It is not interesting to have different versions. I would like to keep xacml and have the others as synonyms. Is that possible?  EDIT - Version synonyms  I cannot follow the instructions in the answer to the duplicate question. See below...


Show address bar w. full path in Nautilus instead of breadcrumbs bar

Unfortunately, Gnome's  address bar is not showing the full path in its top bar. How can I change this behavior?  I'm looking for a solution to display a editable text field instead, like in the good old days.


Finding Stack Overflow/Exchange users based on geographic area?

I want to find Stack Overflow/Exchange users in my area.   Is there an easy way to do that?


My best friend and I will fly from Basel (BSL) to London Gatwick (LGW) in October. We booked our flight tickets separately and neither of us reserved a seat. As I understand, the system will assign us a seat at check-in (which we will do online simultaneously).  How are the chances that we will be assigned conjoined seats if we check in at the very same moment?  Would it be possible to change seats after bording (as in asking a seat neighbour to switch seats) or is that prohibited?


Add Image to Static Resources using Apex code

Is it possible to add an image to static resources using apex code and metadata?  On a detail page I want to click a button that says upload image and store that Url in metadata Field and than pass it to Static resource rather than in attachments on the individual record.  Is the possible and if so do you have any sample code?


Indirect constraints (foreign keys amongst three/four tables)

I have the next layout of tables:  table COMPANY: - primary key pk_company  table USERS: - primary key pk_users,  - foreign key (fk_company) references COMPANY (pk_company)  table GROUPS: <br> - primary key pk_group, - foreign key (fk_company) references COMPANY (pk_company)  table ROLES: - primary key pk_role  table RELATIO_UGR: - foreign key (fk_user) references USERS (pk_user) - foreign key (fk_group) references GROUPS (pk_group) - foreign key (fk_role) references ROLES (pk_role) - Also: UNIQUE KEY [fk_user,fk_group]    This is:  USER ---(n:m)--- GROUP ---(m:1)--- COMPANY USER ------------(n:1)------------ COMPANY 1 company can have N users (workers) 1 company can have M groups M groups can have N users (each worker can be in more than one group) 1 user can have only 1 role (read / read-write / admin) in each group.   The thing is that all constraints seem to work in the individual tables, however, the RELATIO_UGR table fails to establish constraints.  Let's suppose we have:   USER1 from GROUP1 and COMPANY1  USER2 from GROUP2 and COMPANY2   The RELATIO_UGR shouldn't allow me to establish (for example) the relationship:   USER2-GROUP1-COMPANY2    Yet, I CAN insert it...   How do I restrict it?


I'm learning a bit of c++ and came across  that implements the SHA256 hashing algorithm. This project has all its code in a header file. This confuses me a little. According to (unofficial), the header file is sort of definition(interface) of which methods are available and the cpp file has the implementation of these methods.  Questions:     Is it "correct" to do the implementation inside your header like the github project?     If so, when do you put the implementation in the header?   If not, does this mean that the sha256 project could be improved by splitting in a header and cpp file?


Template specialization based on inherit class

I want to make this specialized w/o changing main. Is it possible to specialize something based on its base class? I hope so.  -edit-  I'll have several classes that inherit from SomeTag. I don't want to write the same specialization for each of them.  class SomeTag {}; class InheritSomeTag : public SomeTag {};  template <class T, class Tag=T> struct MyClass { };  template <class T> struct MyClass<T, SomeTag> {     typedef int isSpecialized; };  int main() {     MyClass<SomeTag>::isSpecialized test1; //ok     MyClass<InheritSomeTag>::isSpecialized test2; //how do i make this specialized w/o changing main()     return 0; }


I have the below  foo = ['a', 'b', 'c', 'd', 'e'] from random import choice while True:     print choice(foo)   The output is:  a c a e ...   I want the terminal output to overwrite the old output on the same line  thanks


Is there a VB.net equivalent for C#'s ! operator?

After two years of C#, I'm now back to VB.net because of my current job. In C#, I can do a short hand testing for null or false value on a string variable like this:  if(!String.IsNullOrEmpty(blah)) {    ...code goes here }   however I'm a little confused about how to do this in VB.net.  if Not String.IsNullOrEmpty(blah) then    ...code goes here end if   Does the above statement mean if the string is not null or empty? Is the Not keyword operate like the C#'s ! operator?


Umlaut character not accepted via keyboard (codepage 65001, UTF-8) to be read by perl script

Please let me state first that this problem is strictly related to the perl diamond operator accepting input that has been directly typed on the keyboard.  Had I talked about the perl diamond operator accepting input that that has been piped or otherwise from text from a file, then yes, this would be a duplicate of question 519309 -- .  However, this is not about piped or file data, but rather about input that has been directly typed on the keyboard. Therefore, I argue, this question is not a duplicate of 519309.  Here are the details of my question:  I am trying to use umlaut characters ('ä', 'ö',' ü', ...) on my keyboard.  I have a very simple perl script that accepts a line from the keyboard and then immediately prints it out again to screen:  If I use umlaut characters with codepage 1252, then everything works as expected:  C:\>chcp 1252 & perl -CS -we"print '*** '; $txt = <>; print '--- ', $txt;" Page de codes active : 1252 *** ü --- ü   However, if I use the same umlaut characters with codepage 65001 (UTF-8), then I get a warning uninitialized value and the umlaut is not accepted:  C:\>chcp 65001 & perl -CS -we"print '*** '; $txt = <>; print '--- ', $txt;" Page de codes active : 65001 *** ü Use of uninitialized value $txt in print at -e line 1. ---   If I pipe the umlaut into my perl program, then I have no problem:  C:\>chcp 65001 & echo ü | perl -CS -we"print '*** '; $txt = <>; print '--- ', $txt;" Page de codes active : 65001 *** --- ü   Why do I get this warning with codepage 65001 (UTF-8)?  I am using Windows 7 x64, with Strawberry Perl 5.22.  Just for the record, if I use pure batch commands (that is I don't use perl), then I can successfully key in umlaut characters with codepage 65001 (UTF-8).  C:\>chcp 65001 & set /p txt=*** & echo --- %txt% Page de codes active : 65001 *** ü --- ü   The question really is: Why is perl not able to accept umlaut characters by keyboard with codepage 65001, whereas the very same keyboard input, same codepage 65001, works ok as a pure dos batch command?  There seems to be something fundamently different between piping umlaut characters and typing umlaut characters directly from the keyboard.  Why is typing an umlaut character on the keyboard not working, whereas the same thing works perfectly fine as a piped character?


$F=\mathbb{Q}(\alpha_1,\alpha_2, ... , \alpha_n)$, where $\alpha_i^2 \in \mathbb{Q}$ implies $\sqrt[3]{2} \notin F$

Let $F=\mathbb{Q}(\alpha_1,\alpha_2, ... , \alpha_n)$, where $\alpha_i^2 \in \mathbb{Q}$ for $i=1,2,...,n.$ I want to show that $\sqrt[3]{2} \notin F$. I am trying to prove by contradiction assuming $\sqrt[3]{2} \in F$. However, I am not able to complete the proof. How should I obtain a contradiction from the assumption?


Redirect all users, except network administrators, from the main site to a subsite

I have a WP Multisite / Multi Network installation. What I need is to redirect all non-logged and also all logged in users, except logged in network administrators, from the main site example.com (including all nested pages, posts, categories etc.) to the subsite.example.com, that is a segregated multisite network. They share the same database. The network administrator will have access to the main site only after they will log in on the subsite.example.com. In this way, only the logged in network administrators must have access to the main site example.com.  UPDATE  The @seamus-leahy solution works, but only partially. I use his function in a multisite multi-networks installation and all networks in this configuration works like separated WP installations, so the network example.com will not recognize and log in automatically the network administrator when he/she is already logged in on the subsite.example.com (network 2), but logged out from the example.com (network 1). This means that the network administrator, in this context, also cannot access the main network example.com. How to solve this?


What happened to Neo in the last part of the Matrix trilogy?

What happened to Neo in the last part of trilogy when the machine gave him the power to battle with Agent Smith. Was he dead?


Lens correction in darktable when my lens isn't known?

I took some raw (CR2) photos and want to edit them in darktable. The focal length is quite low and the distortion high.  Usually I correct the distortion by using darktable's lens correction module which automatically chooses the right values based on the exif information. It works for DSLRs but for this very camera the values are not known.    My question:   What's the way to correct the distortion in darktable, if I cannot choose the right objective from the drop down menu in the lens correction module? How do I determine the values? Which values should I choose?


How can I Perform Jquery Onclick on data came through ajax

I am trying to perform onclick on Data came through ajax In my website I have a list of online users which is refresh every second And I want that If some one click on any name and it calls another javascript function.  function get_list(){      college = 'college='+college_id;      $.ajax({         url: "_includes/msg_list.php",         type:   "POST",         data:   college,         success: function(result){             $("#see_msg").html(result);         }      });   }  this is my ajax function                                       ">                                          12:28 PM


Which countries require a 24-hour transit visa in China?

I'm transiting through China in Kunming, China.  I'm a South African national and do NOT fall under the 72-hour visa free program. However on [their official (travelchina) website][1] it says:     Nationals of most countries are eligible for the 24-hour direct   transit, while a visa is needed for the passengers transiting on   Afghanistan, Azerbaijan, Iran, Iraq, Kazakhstan, Kyrgyzstan, Malaysia,   Nigeria, Oman, Pakistan, Saudi Arabia, Sri Lanka, Thailand, Turkey,   United Arab Emirates and Yemen passports.   I'm sorry if I'm missing this, but the above is rather badly worded for me does "nationals of most countries" include ALL countries except those mentioned in the list shown?  Also again sorry if I'm missing this but again it is rather badly worded for me. I will fly via Thailand to China and then via China to Canada with an 8-hour layover in China. I see Thailand is mentioned on the list. I have a Thailand residency permit where I currently reside... Would that affect me at all?  Also, any idea if I can exit the airport in China and come back under the 24-hour visa exemption (should I be exempt)?  Many thanks.


Do we have a well defined mathematical expression denoting the size of a fundamental particle with no internal structure (electron for example) ? If we do, how does it fit in with the uncertainty principle ? And if we don't then what exactly do the experiments reveal claiming radius of electron is of the order $10^{-18} m$ or something like that ? Also in this particular case, does this mean that the probability of the electron being within that radius is 1 and zero outside ? A proper clarification would be very helpful.


How do you capitalize a proper noun such as "iPhone"?

I was always taught to capitalize the first letter of the first word in a sentence, and also the first letter of proper nouns. In the last few years it's been common for certain firms to name their brands something that is always spelled with a small first letter and a capital second letter. It is almost as if they demand the rules of usage are changed. What do you do about this? Where is the inquisition when you need it? Should you start a sentence with "IPhone"? Should you use "iphone" in the middle of a sentence?


How do you track an email which has already been received by us?

Is it possible to track an email sent to me already? I want to track the IP address of the person who sent me the email using the email just sent. Is it possible, or is email anonymous?


What is different python array in this code?


Why does it throw NullPointerException in this Case?

I have known NullPointerException to be caused by using an uninitialized object for example Button button;and then try to use it before button= new Button(). However, in this case I cant see why and where have I gone wrong.  I have my Main class:  public class Main extends Application { private Stage primaryStage; private BorderPane mainLayout;  @Override public void start(Stage primaryStage) throws IOException {     this.primaryStage=primaryStage;     this.primaryStage.setTitle("Employee App");     showMainView();     showMainItems(); }   public void showMainView() throws IOException{      FXMLLoader loader= new FXMLLoader();      loader.setLocation(Main.class.getResource("view/MainView.fxml"));      this.mainLayout=loader.load();      Scene scene= new Scene(this.mainLayout);      this.primaryStage.setScene(scene);      this.primaryStage.show();  }   public void showMainItems() throws IOException{      FXMLLoader loader= new FXMLLoader();      loader.setLocation(Main.class.getResource("view/MainItemsView.fxml"));      BorderPane mainItems=loader.load();      mainLayout.setCenter(mainItems);  }  public void showEletricalScene() throws IOException{      FXMLLoader loader= new FXMLLoader();      loader.setLocation(Main.class.getResource("electrical/ElectricalDeptView.fxml"));      BorderPane eletricalDpet=loader.load();      mainLayout.setCenter(eletricalDpet);  } public static void main(String[] args) {     launch(args); } }   And my controller where I am trying to call a method in Main class to show/load another view.  public class MainItemsController { private Main main; @FXML private void gotEletrical() throws IOException{     this.main.showEletricalScene();     }    }   Everything has been working fine until the time I am trying to call showEletricalScene. I have pinned my controllers and everything is fine except this nasty error below:  Caused by: java.lang.reflect.InvocationTargetException at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(Unknown Source) at sun.reflect.DelegatingMethodAccessorImpl.invoke(Unknown Source) at java.lang.reflect.Method.invoke(Unknown Source) at sun.reflect.misc.Trampoline.invoke(Unknown Source) at sun.reflect.GeneratedMethodAccessor1.invoke(Unknown Source) at sun.reflect.DelegatingMethodAccessorImpl.invoke(Unknown Source) at java.lang.reflect.Method.invoke(Unknown Source) at sun.reflect.misc.MethodUtil.invoke(Unknown Source) ... 51 more Caused by: java.lang.NullPointerException    at   employee.view.MainItemsController.gotEletrical(MainItemsController.java:11) ... 60 more   Any help, thanks.


Creating ADO.NET mapping for custom type

I have a custom type that I created, which should be persisted in a database (in this case, SQL server) as a guid (though this question is just as valid for an object that could be stored as a string, integer, etc).   When I pass this type as a parameter to a DbCommand object, I get an exception:     ArgumentException: No mapping exists from object type [...] to a known managed provider native type.   I have CType operators on the class that allow implicit conversion to a string, or a guid, but .NET doesn't use these since it doesn't know it should convert the type.  Is there a way to add a type to the internal mapping, or otherwise tell .NET how to store my custom type in the database?  I obviously can convert the type myself when passing it to the .NET stuff, but I'd like this to happen automatically, like it does for most of the built-in types.    I've tried to implement a TypeConverter class for my type (inherits from TypeConverter, overrides CanConvertFrom, CanConvertTo, ConvertFrom, ConvertTo, IsValid, and added the System.ComponentModel.TypeConverter attribute to my class), but this still doesn't work.   I'm assuming it's missing a piece telling .NET what type to convert to when storing the value in the database.     My workaround for this, for now, is that I intercept the list of parameters, before I pass them to SQL server, and have a method that changes my custom type into a guid. This is dirty, but it does work for now, but I still think this question is unanswered.


Quantum gates with respect to phase angles

We can say that $X (\cos \frac{\theta}{2} |0\rangle + e^{i \phi}\sin \frac{\theta}{2} |1\rangle) = \cos \frac{\pi-\theta}{2} |0\rangle + e^{-i \phi}\sin \frac{\pi-\theta}{2} |1\rangle$, a fact that can be derived by multiplying the $X$ matrix and the state vector and using angle identities: $X (\cos \frac{\theta}{2} |0\rangle + e^{i \phi}\sin \frac{\theta}{2} |1\rangle) = e^{i \phi}\sin \frac{\theta}{2} |0\rangle + \cos \frac{\theta}{2} |1\rangle = e^{i \phi}\cos \frac{\pi - \theta}{2} |0\rangle + \sin \frac{\pi - \theta}{2} |1\rangle = \cos \frac{\pi-\theta}{2} |0\rangle + e^{-i \phi}\sin \frac{\pi-\theta}{2} |1\rangle$ Is there a writeup somewhere or a standard way to derive this identity for other gates, i.e. $Y, Z, H, \sqrt{Y}$?


Texlive doesn't detect any files found under TEXMFHOME, even though kpsewhich -var-value TEXMFHOME returns the correct path (~/.texlive2017/texmf-var/).  Running Texlive 2017 on Ubuntu, installed from the ppa ().


Prove all real polynomials of degree $n(n \geq 1)$ can be factorized to the product of k linear factors and l quadratic factors following holds   $k$ and $l$ are integers ($k \geq 1, l \geq 0$) All linear factors and quadratic factors are real polynomial Every quadratic factor has no real root($b^2-4ac < 0$ at $ax^2+bx+c)$   How can I prove this? It seems that I can use mathematical induction but I have no idea about details.


Is "can it" used to express meaning like "shut up"?

I'm reading Peter Orner's The Raft and find a sentence as this  I told the boy to can it.   From the Chinese translation, it seems "can it" means "close your mouth" just liking "shut up". Is it truly? And what is the difference of "can it" and "shut up"?


Problem with 10.4.11-MariaDB (MySql) and PHP 7.2.29 UTF-8 Encoding

I have a Problem getting UTF-8 encoded Strings out of a MariaDB-Database. Today I updated my XAMPP-Distro to 10.4.11-MariaDB (MySql) and PHP 7.2.29 and now a strange Problem arised wich had not occoured with the older version.  Preliminary informations: I am importing data from a database dump from a working MariaDB-Database (productive system) to my local Database. And on the local Database the problem occours.  When I send a query on the local system to the database via PHP (mysqli) (the code is the same as on the production system) I get the wrong encoding:    If I wrap the text from the database with the following php function  utf8_decode($textFromTheDatabase);   everything works fine.  I also tried the following lines before every query but this does not change anything:  $dbConnection->set_charset('utf8'); $dbConnection->query("SET NAMES 'utf8'");   As mentioned above everything works on the production system but not on the new XAMPP installation. When I still had the old XAMPP version on my local system everything worked fine. So I think something is wrong with the configuration of my local Database or PHP or Apache?


Disk still full after deleting some files

I have an AWS linux instance with a root drive of 32GB. I have an EBS mount of 20GB  On my root I ran out of space, so I cleared out some files. However my root drive is still full. I can't find out why because when I look at sizes of the directories using du and ncdu they show the drive should have a lot of space.    df   I get the following results   Filesystem     1K-blocks     Used Available Use% Mounted on /dev/xvda1      32894812 31946092    848472  98% / devtmpfs         2017224       60   2017164   1% /dev tmpfs            2025364        0   2025364   0% /dev/shm /dev/xvdh       20511356  4459276  15003504  23% /mnt/ebs   My /dev/xvda1 is still full  After some research I installed a great tool ncdu to display disk space and the results are:  ncdu 1.10 ~ Use the arrow keys to navigate, press ? for help                                                                                --- / -------------------------------------                 4.2GiB [##########] /mnt                                1.5GiB [###       ] /var      1.2GiB [##        ] /usr    684.9MiB [#         ] /opt    464.3MiB [#         ] /home    141.7MiB [          ] /lib     53.5MiB [          ] /boot     21.2MiB [          ] /lib64     10.8MiB [          ] /sbin      8.1MiB [          ] /bin      7.1MiB [          ] /etc      2.7MiB [          ] /tmp     60.0KiB [          ] /dev     48.0KiB [          ] /root  e  16.0KiB [          ] /lost+found  e   4.0KiB [          ] /srv  e   4.0KiB [          ] /selinux  e   4.0KiB [          ] /media  e   4.0KiB [          ] /local  .   0.0  B [          ] /proc      0.0  B [          ] /sys      0.0  B [          ]  .autofsck   If I du -h my total is  8.3G    /  So why would my disk be 95% full when it clearly has a lot of space. Am I missing something to do with the mounts and is there any other tool I can run to find out why it is 95% full?


How can I track the reopen votes / reopen status of my question?

I have . It got closed. I edited it to get it to be reopened. Now I am not sure if my edits are sufficient.   How can I track the reopen votes for my question?  Is there a way to differentiate between "My edits are not good enough to get the question reopened" and "Nobody reviewed my question in the reopen review queue yet"?


I'm currently scrubbing some numbers and converting numbers if they are 66.1K to be 66100 using   df['number'].replace({'[kK]': '*1e3', '[mM]': '*1e6', '[bB]': '*1e9', },regex=True).map(pd.eval)   can replicate by just doing a simple print(pd.eval('64.1*1e3'))  However the return for 64.1K is 64099.99999999999.   Does anyone know why this happens? How would you use pandas to get 64100.0?  I have tested with 65.1K and it is the same result 65099.99999999999 but if I do 66.1K it equals to 66100.0.


How does current flow in a conductor if the electric field in a conductor is always 0?

How do EM waves propagate inside waveguides made of conductors and how does current flow inside a conductor from a high voltage to a low voltage if the Electric field inside a perfect conductor is = 0 ? What is the driving force that causes the charges to move ?


How to remove wine and its dependencies?

i want to remove wine1.7 from my Ubuntu 14.04 trusty tahr. But when i typed in sudo apt-get purge wineit didn't worked i gives me package not installed so i typed sudo apt-get purge wine(tab)and it showed the packages so i did sudo apt-get purge wine1.7 wine1.7-amd64 wine1.7-i386 wine-gecko2.34 wine-mono4.5.4 winetricks   i uninstalled wine but told me to do sudo apt-get autoremove  to remove the orphaned packages but when i did autoremove it broke my system.Fortunetly i had a clonezilla partition backup so i got back my OS from a week ago but it had wine installed so im back to where i started.So my question is how to remove wine and its dependencies without breaking my system ? and here are the packages that are orphaned according to apt but as i said when i do sudo apt-get autoremove it breaks my system here are the packages The following packages were automatically installed and are no longer required:   fonts-horai-umefont gcc-4.8-base:i386 gnome-exe-thumbnailer icoutils   libasn1-8-heimdal:i386 libasound2:i386 libasound2-plugins:i386   libasyncns0:i386 libavahi-client3:i386 libavahi-common-data:i386   libavahi-common3:i386 libcapi20-3 libcapi20-3:i386 libcups2:i386   libdrm-intel1:i386 libdrm-nouveau2:i386 libdrm-radeon1:i386 libelf1:i386   libexif12:i386 libexpat1:i386 libffi6:i386 libflac8:i386 libfontconfig1:i386   libfreetype6:i386 libgcrypt11:i386 libgd3:i386 libgif4:i386   libgl1-mesa-dri:i386 libgl1-mesa-glx:i386 libglapi-mesa:i386   libglib2.0-0:i386 libglu1-mesa:i386 libgnutls26:i386 libgpg-error0:i386   libgphoto2-6:i386 libgphoto2-port10:i386 libgssapi-krb5-2:i386   libgssapi3-heimdal:i386 libgstreamer-plugins-base0.10-0:i386   libgstreamer0.10-0:i386 libhcrypto4-heimdal:i386 libheimbase1-heimdal:i386   libheimntlm0-heimdal:i386 libhx509-5-heimdal:i386 libice6:i386   libieee1284-3:i386 libjack-jackd2-0:i386 libjbig0:i386 libjpeg-turbo8:i386   libjpeg8:i386 libk5crypto3:i386 libkeyutils1:i386 libkrb5-26-heimdal:i386   libkrb5-3:i386 libkrb5support0:i386 liblcms2-2:i386 libldap-2.4-2:i386   libllvm3.4:i386 libltdl7:i386 libmpg123-0 libmpg123-0:i386 libodbc1   libogg0:i386 libopenal1:i386 liborc-0.4-0:i386 libosmesa6 libosmesa6:i386   libp11-kit0:i386 libpcap0.8:i386 libpciaccess0:i386 libpng12-0:i386   libpulse0:i386 libroken18-heimdal:i386 libsamplerate0:i386 libsane:i386   libsasl2-2:i386 libsasl2-modules:i386 libsasl2-modules-db:i386 libsm6:i386   libsndfile1:i386 libspeexdsp1:i386 libsqlite3-0:i386 libssl1.0.0:i386   libstdc++6:i386 libtasn1-6:i386 libtiff5:i386 libtxc-dxtn-s2tc0:i386   libusb-1.0-0:i386 libv4l-0:i386 libv4lconvert0:i386 libvorbis0a:i386   libvorbisenc2:i386 libvpx1:i386 libwind0-heimdal:i386 libwrap0:i386   libx11-6:i386 libx11-xcb1:i386 libxau6:i386 libxcb-dri2-0:i386   libxcb-dri3-0:i386 libxcb-glx0:i386 libxcb-present0:i386 libxcb-sync1:i386   libxcb1:i386 libxcomposite1:i386 libxcursor1:i386 libxdamage1:i386   libxdmcp6:i386 libxext6:i386 libxfixes3:i386 libxi6:i386 libxinerama1:i386   libxml2:i386 libxpm4:i386 libxrandr2:i386 libxrender1:i386   libxshmfence1:i386 libxslt1.1:i386 libxt6:i386 libxxf86vm1:i386   ocl-icd-libopencl1:i386 odbcinst odbcinst1debian2 p11-kit-modules:i386 p7zip   unixodbc wine-gecko2.34:i386 Use 'apt-get autoremove' to remove them.


What is the optimum list of previous Star Wars movies that I should watch before December 18

I'm really fascinated about Star Wars movies.I'm passing the 3rd decade of my life time on Earth, however I've never actually see or had any chance to watch at least a single Star Wars movie. But my ambition is to rise up early at December 18th and walk straight to the theater to watch "Star Wars: The Force Awakens"  I assume the first movie is  "Episode IV: A New Hope (1977)"  And the latest one will debut on December 18th "Star Wars: The Force Awakens (2015)"  So there's too much to catch up. But if any STAR WARS die hard fan could give me the optimum list of previous movies that I should watch before December 18, it would be really appreciated.


I have a Ubuntu 20.04 server which is reporting relatively low free RAM: top - 11:28:31 up 5 days, 20:12,  3 users,  load average: 0.18, 0.26, 0.27 Tasks: 268 total,   1 running, 267 sleeping,   0 stopped,   0 zombie %Cpu(s):  0.1 us,  0.3 sy,  0.0 ni, 99.5 id,  0.0 wa,  0.0 hi,  0.1 si,  0.0 st MiB Mem :   7786.5 total,    506.1 free,   1329.4 used,   5951.1 buff/cache MiB Swap:   4096.0 total,   3965.5 free,    130.5 used.   6020.5 avail Mem      PID USER      PR  NI    VIRT    RES    SHR S  %CPU  %MEM     TIME+ COMMAND  373096 root      20   0    8200   3996   3316 R   1.0   0.1   0:01.04 top     872 mysql     20   0 2843736 480140  15652 S   0.7   6.0  87:22.66 mysqld     563 root      rt   0  280136  17940   8200 S   0.3   0.2   1:37.67 multipathd     745 syslog    20   0  224320   4812   3396 S   0.3   0.1   1:28.21 rsyslogd       1 root      20   0  169488  10424   6264 S   0.0   0.1   1:44.98 systemd       2 root      20   0       0      0      0 S   0.0   0.0   0:00.12 kthreadd       3 root       0 -20       0      0      0 I   0.0   0.0   0:00.00 rcu_gp       4 root       0 -20       0      0      0 I   0.0   0.0   0:00.00 rcu_par_gp       6 root       0 -20       0      0      0 I   0.0   0.0   0:00.00 kworker/0:0H-events_highpri       9 root       0 -20       0      0      0 I   0.0   0.0   0:00.00 mm_percpu_wq      10 root      20   0       0      0      0 S   0.0   0.0   0:03.55 ksoftirqd/0  The server has 8GB of physical RAM and only 1.3GB free.  The rest seems to be tied up in the buffer/cache.  However, a list of running processes show that the highest consumer is the mysql daemon which is using only 6% of total RAM. Is there a way to report the true memory consumption and how can I free up the buffer/cache?


I m having such type of XML with me   <?xml version="1.0" encoding="UTF-8"?> <ArrayOfCustomer  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"  xmlns:xsd="http://www.w3.org/2001/XMLSchema"  xmlns="http://tempuri.org/">  <Customer> <Customer_id>143</Customer_id> <Cust_last_name>Deutsch</Cust_last_name> <Cust_first_name>Leslie</Cust_first_name> <Gender_id>2</Gender_id> <Email>ldeutsch16@univ.demo</Email> <Income_id>3</Income_id> </Customer>  <Customer> <Customer_id>327</Customer_id> <Cust_last_name>Marko</Cust_last_name> <Cust_first_name>Shelby</Cust_first_name> <Gender_id>1</Gender_id> <Email>smarko75@free.demo</Email> <Income_id>5</Income_id> </Customer>  </ArrayOfCustomer>   Can u suggest how to parse it ?


Did the shellshock bash fix break basic command line tools like echo and cat?

I used to be able to do things like:  X=123 cat <<EOF X is $X EOF   or even simpler:  X=123 echo $X   The first one still seems to work on Mac OS X after install the bash fix, however neither seem to work on my Ubuntu 14.04 instance in AWS anymore. What makes it that echo or cat no longer have access to these environment variables? Stranger still, when I pass the env vars to a NodeJS app I don't seem to have any issues:  cat <<EOF > test.js console.log('X is ' + process.env.X); EOF X=123 node test.js   This seems to work in bash scripts as well:  cat <<EOF > test.sh echo X is \$X EOF chmod +x test.sh X=123 ./test.sh


What is the best way to convert a string type to an int type as Industry standard?

In C++, what is the best way to take input string and convert it to a number type. I was messing around with literal strings and was having a difficult time doing this, I am imagining that using a C String is easier? What is the best way for co-workers and fellow students to follow and make it easy and simple? Any thoughts?   What is the industry standard on this? Using STOI?


What is the purpose of group "wheel" on FreeBSD (FreeNAS) OS?

I am setting up a new server based on , a FreeBSD-based operating system. The system has a group, wheel. I have a vague idea that sysadmins should be added to group wheel, and that the group confers ability to use su (superuser). However, I can't find this written down anywhere.   What is the purpose of group wheel? Under what circumstances I should add my users to it? Please also cite FreeBSD documentation which explains this.


Short story about failed mind transfer with loss of speech

I'm looking for a short story whose title I can't remember.  In it a wealthy man practices cloning and consciousness transfer to achieve immortality, often parading older bodies around his estate naked (not a nice guy). The story follows a final transplant, which doesn't go as expected. The man is left trapped with his memories and no ability to speak, while the clone walks off behaving exactly as he would.


Is there a sorted collection type in .NET?

I'm looking for a container that keeps all its items in order.  I looked at SortedList, but that requires a separate key, and does not allow duplicate keys.  I could also just use an unsorted container and explicitly sort it after each insert.  Usage:   Occasional insert Frequent traversal in order Ideally not working with keys separate from the actual object, using a compare function to sort. Stable sorting for equivalent objects is desired, but not required.  Random access is not required.   I realize I can just build myself a balanced tree structure, I was just wondering if the framework already contains such a beast.


Why wasn't the Separatist Army more lightsaber resistant?

In older galactic wars, when lightsabers are prevalent on both fronts, it was the norm for militaries, private security forces, bounty hunters and other adventurers alike to arm themselves with weapons and armour protected by a cortosis weave. So cortosis is not exactly rare, since it can be used in mass manufacturing by the war industry and is accessible to common use by private individuals too.  Since the Separatists are preparing for war with the Republic and its Jedi guardians, and the Sith plan to use the Clone Wars to help wither the Jedi down by attrition, why aren't lightsaber resistant troops more prevalent? I would expect super battle droids or at least more elite droids like destroyers, commandos, magnaguards etc to be so.


What happens when devices request different voltages from a USB hub?

I'd like to charge two devices with one USB charger, one requests 5V, the other 9V. I plug an USB hub (potentially an old USB 2.0 one) in the (9V capable) charger and plug the two devices in the hub. How would this be handled? Would it potentially kill the 5V device or the USB protocol somehow assures that both devices will be powered from 5V?


input/output error that come back just fine. How to make sure it doesn't happen again?

root@host [/backup/2013-08-15/accounts]# cd /home1 root@host [/home1]# ls /bin/ls: reading directory .: Input/output error root@host [/home1]#   Suddenly /home1 doesn't work. It used to work just fine. Yes I put one of my most demanding sites there. Then I started getting these errors. Is it possible that the disk can't handle the load?  My provider insist that it's user's error though     Actually, I think this was a case of user error. Your hard drives are   all fine, and I've confirmed I am able to read and write files to all   mounted partitions (/home, /home1, /home2, /home3 and /home4). I did   need to run an fsck to fix several errors on your filesystem, and it   also appears you have a whole load of unresolved links leading all   over your system (fsck tried to clear some of these manually, all may   not have been fixed). This system appears to have been very poorly   maintained, however as of right now all disks and all filesystems are   accessible. I will put this system back online shortly and let you   know when I've confirmed it is back online.   So we have a system that's working just fine for now and then suddenly crash for no reason.  After doing some check my host provider says that NOTHING is wrong with the server. I got my server back and yea everything is working.  How can this happen?  So after all those checks and reboot, the server is running fine, including the drive. However, I am afraid of moving stuff to the server again. If it broke again it can cost me hundreds of dollars.  What should I do to make sure nothing else go wrong? How com input/output is in error but then it works again just fine now?  What kind of error is this that works now and then fail latter?  Call dmesg and got this:  I run dmesg and this is what I see:  EXT4-fs (sda1): warning: mounting fs with errors, running e2fsck is recommended EXT4-fs (sda1): mounted filesystem with ordered data mode. Opts:   Here is the stuff in context  EXT3-fs (sdd1): using internal journal EXT3-fs (sdd1): mounted filesystem with ordered data mode EXT4-fs (sda1): warning: mounting fs with errors, running e2fsck is recommended EXT4-fs (sda1): mounted filesystem with ordered data mode. Opts:  EXT4-fs (sdb1): warning: maximal mount count reached, running e2fsck is recommended EXT4-fs (sdb1): mounted filesystem with ordered data mode. Opts:  EXT4-fs (sdc1): warning: maximal mount count reached, running e2fsck is recommended EXT4-fs (sdc1): mounted filesystem with ordered data mode. Opts:  Adding 4194296k swap on /dev/sdd2.  Priority:-1 extents:1 across:4194296k SSD kjournald starting.  Commit interval 5 seconds EXT3-fs (loop0): warning: maximal mount count reached, running e2fsck is recommended EXT3-fs (loop0): using internal journal EXT3-fs (loop0): mounted filesystem with ordered data mode   What should I do?


If $A$ and $B$ are positive definite, then is $B^{-1} - A^{-1}$ positive semidefinite?

I've found this while googling some properties of  matrices. (Unfortunately, I cannot remember where I've discovered it.) If this is true, it'll greatly save my time in my work. Is it true? How can you prove it?    Let's say I have two real symmetric and positive definite matrices $\mathbf A$ and $\mathbf B$ of the same size. Also, assume that $\mathbf A - \mathbf B$ is positive semidefinite too. Then, $\mathbf B^{-1} - \mathbf A^{-1}$ is also positive semidefinite.


How to Drag and Drop files to open application?

Since Ubuntu 18.04 I can't drag a file e.g. image file to an open application such as Inkscape or  email message window. In Ubuntu 17.10 I was able to select the image file by clicking on it, and while holding down left mouse button I would hit the supper key displaying all open windows where for there I could then drop the file in any open app or folders. This is no longer possible/default behaviour since Ubuntu 18.04. Is there a workaround that would allow me to achieve this or even a way to recreate the same behaviour like in 17.10?


Bibtex - authors with titles i.e. military rank

Is there support for including an author's title in citations, i.e. their military rank or other title?  Examples include:  (Blackadder 1917) in-text and Blackadder, Captain E. (1917) in the bibliography. (Blackadder 1648) in -text and Blackadder, Sir E. (1648) in the bibliography.  The problem I currently have is that completing the Author field in Bibtex as Sir Edmund Blackadder results in:  Blackadder, S. E. (1648) in the biblio.  I'm using BibDesk 1.6.2  Edit: Request for MWE.  Not sure how to, as it's Bibtex, but just insert this into the Author field:  {Sir} Edmund Blackadder   Or any positioning of the braces. BibDesk gives previews that are replicated in my real file.


Add value to field using hook_webform_submission_presave()

I am at my wits end trying to use the hook_webform_submission_presave function on a webform that I have created for a Drupal 7 site. Ideally I would like to capture a list of nodes that a user has flagged and transfer that data into a field before the user submits their form. But the function is just not adding the data.  First I get the flags:  $flags = flag_get_user_flags($node->type);   Then I want to transfer that variable into a field with a component ID of 32.  // Update some component's value before it is saved.   $component_id = 32;   $submission->data[$component_id]['value'][0] = $flags;   Here is the full function:  function get_flags_webform_submission_presave($node, &$submission) { $nodes_list = array(); $title = '';   // Get the flags.   $flags = flag_get_user_flags($node->type);    // Get the nodes.   if (!empty($flags)) { foreach ($flags as $flag) {     $nid = $flad->entity_id;     // Get node data. Delete to not get node titles.     $node = node_load($nid);     $title = $node->title;     // Combine data.     $nodes_list[] .= 'node/' . $nid . ' ' . $title . ",\n";     }   }    // Update some component's value before it is saved.   $component_id = 32;   $submission->data[$component_id]['value'][0] = $nodes_list; }   What am I doing wrong? I'd love some help!


Find the determinant of a matrix definition

Let $A$ be a matrix that is defined like this:  $$A_{ij}=\begin{cases} \alpha,  & \text{if i=j} \\ \beta , & \text{if i $\ne$ j} \end{cases} $$ So I realized this matrix looks somehow like this $$         \begin{pmatrix}         \alpha & \beta & \beta \\         \beta & \alpha & \beta \\         \beta & \beta & \alpha \\         \end{pmatrix} $$  I tried to manipulate the rows to get an upper triangular matrix but couldn't succeed, am I in the right direction... some help?:)


.net Convert three letter timezone code and datetime to UTC

I am processing a file with a time in its content that I want to capture as a UTC.  In my example file it expressed like this:     Sat Oct 13 16:45:23 EDT 2018    "EDT" expresses the local timezone where (and when) the file was created - "Eastern Daylight Time".  But my code may have to process files from different places and seasons so I cannot assume that will always be the code.  Is there are way in .Net of starting with a three letter timezone code and a date and getting back a UTC?


Is an American “r” sound retroflexed or retracted?

Ok, there are two different ways to make the American r sound. They both think they are right and that the other is wrong.   Make the r sound by retroflexing the tongue:      Make the r sound by retracting the tongue:     Note: Both methods agree that the tongue should not touch anything in the mouth.  I think the retroflexed r is more natural. I have no way to make the retracted tongue because it is very uncomfortable for me.  So which one is correct?


Show this holomorphic function is constant

I have a holomorphic function $f$ defined on a neighborhood of the closed unit square.  Further $f(z+i)-f(z)$ is real and not negative on $[0,1]$ and $f(z+1)-f(z)$ is real and not negative on $[0,i]$.  How do I show that $f$ is constant?


How do I prove that a definition of an ordered pair does not satisfy the required property?

It is to my knowledge that any definition of an ordered pair, (a, b), must satisfy this condition: $\quad (a,b) = (c, d) \iff a = c \land b = d$ However, I chanced upon this definition of an ordered pair: $\quad (a, b) = \{a, \{b\}\}$ which I know does not satisfy the condition. However, how do I prove this formally?


Displaying timestamp in Google Chrome browsing history

Google Chrome allows to view the browsing history. Is there any way to display a more complete timestamp i.e. having the hour, minute and second instead of having just the date?


How to interpret Vgs(th) min/max in a MOSFET datasheet?

This is a screenshot of IRF9640 MOSFET datasheet. Will you please tell me, what is meant by max and min value of Vgs threshold voltage. Also what they mean by test condition.  Whether the max and min values are only applicable for specified test condition? What will be the threshold voltage for a switching circuit and how the range varies?  My doubt is, for p channel mosfet to turn on Vgs < Vgs(th). For IRF9640 in what volt it will turn on -3 or -5? When i used in my application Vs is 6v and Vg is 3v hence Vgs=-3v but it won't turned on, Why? It turned on when Vgs=-3.3v.  If we consider -2v as threshold, it should turn on when Vgs=-3v. Why they given a range for threshold voltage. Whether we have to test each mosfet to know their threshold. What i am pointing is that, if we have two IRF9640, will Vgs(th) is differ from each other?


JAX-RS / Jersey how to customize error handling?

I'm learning JAX-RS (aka, JSR-311) using Jersey. I've successfuly created a Root Resource and am playing around with parameters:  @Path("/hello") public class HelloWorldResource {      @GET     @Produces("text/html")     public String get(         @QueryParam("name") String name,         @QueryParam("birthDate") Date birthDate) {           // Return a greeting with the name and age     } }   This works great, and handles any format in the current locale which is understood by the Date(String) constructor (like YYYY/mm/dd and mm/dd/YYYY). But if I supply a value which is invalid or not understood, I get a 404 response.  For example:  GET /hello?name=Mark&birthDate=X  404 Not Found   How can I customize this behavior? Maybe a different response code (probably "400 Bad Request")? What about logging an error? Maybe add a description of the problem ("bad date format") in a custom header to aid troubleshooting? Or return a whole Error response with details, along with a 5xx status code?


Itō isometry from :     Let $W : [0, T] \times \Omega \to \mathbb{R}$ denote the canonical   real-valued Wiener process defined up to time $T > 0$, and let $X :  [0, T] \times \Omega \to \mathbb{R}$ be a stochastic process that is   adapted to the natural filtration $\mathcal{F}_{*}^{W}$ of the Wiener   process. Then $$      \mathbb{E} \left[ \left( \int_{0}^{T} X_{t} \, \mathrm{d} W_{t} \right)^{2} \right] = \mathbb{E} \left[ \int_{0}^{T} X_{t}^{2} \,  \mathrm{d} t \right], $$ where $\mathbb{E}$ denotes expectation with   respect to  $\gamma$. In other words, the Itō   stochastic integral, as a function, is an isometry of normed vector   spaces with respect to the norms induced by the inner products $$      ( X, Y )_{L^{2} (W)} := \mathbb{E} \left( \int_{0}^{T} X_{t} \, \mathrm{d} W_{t} \int_{0}^{T} Y_{t} \, \mathrm{d} W_{t} \right) =  \int_{\Omega} \left( \int_{0}^{T} X_{t} \, \mathrm{d} W_{t}  \int_{0}^{T} Y_{t} \, \mathrm{d} W_{t} \right) \, \mathrm{d} \gamma  (\omega) $$ and $$      ( A, B )_{L^{2} (\Omega)} := \mathbb{E} ( A B ) = \int_{\Omega} A(\omega) B(\omega) \, \mathrm{d} \gamma (\omega). $$   I was wondering what the two normed spaces are and what their norms are, so that the two normed spaces are isometric wrt their norms?  Thanks and regards!


What book would you recommend for non-statistician scientists?

What book would you recommend for scientists who are not statisticians?  Clear delivery is most appreciated. As well as the explanation of the appropriate techniques and methods for typical tasks: time series analysis, presentation and aggregation of large data sets.


I'm writing a novel and still getting use to rules for commas. In my novel I have this:   "Well, she better not eat any of my customers,or I’ll be having cougar tonight."  does this comma before the well look correct? I'm confused because I thought you could only have commas between independent clauses but at the same time it feels right.


Local Users and Groups Management on Windows 7 Home?

The Local Users and Groups Manager doesn't like running on the Home versions of Windows...    Is there an alternative program which can provide the same amount of flexibility for editing users/groups?  (Control UserPasswords2 doesn't have nearly as much flexibility, so that doesn't count.)


My fire simulation on a match tip is producing very weak flames so they aren't visible in the render. I'm not sure what is going wrong so I just included the entire file. Plz help, thank you.


Analyzing include directives for slow builds of translation units

I've been doing a lot of googling to figure out various ways I could analyze my include directives per translation unit to determine why my overall build is so slow. The entire project consists of around 800 translation units, and when combined with the number of header files we maintain and use (e.g. third party) it's difficult to track exactly what we're including at the top-level that may be included by most translation units being built that do not even need it. I feel like eliminating needless includes will help bring our build times down.  Can anyone suggest any techniques or tools that may be useful in analyzing unnecessary includes? For example, maybe something that prints which headers are included the most in descending order across the whole project build (all translation units)? It would be even better if such a tool could provide statistics such as " included by 600 translation units and not needed by 90% of them". I do not want to use precompiled headers, so I feel like this is my only option (eliminate unnecessary includes and redesign headers to make use of the pimpl idiom to improve build times).  Note I'm using clang as my compiler on linux & android (NDK). I also build with MSVC on the Windows platform.


In the films, we've seen Yoda fly in military transports and escape pods, but has he ever flown a starfighter? Most Jedi do, and he's one of the oldest of them all. I would imagine he has in his youth, but his early days have barely been chronicled yet.  Is there any mention of this in any EU material? Legends or Disney canon accepted.


I want to know that since in bjt's saturation state base and collector junction is forward bias why we take saturation voltage (Vce) as 0.2 Volts? Base and collecor junction is PN so voltage must be 0.7.What is the reason behind this ?


Repeated jQuery POST ajax calls to a php file with output only works once

So I have a few links that's values are stored in jQuery and then are used as a variable for the PHP file it calls. In that PHP file, it outputs the same exact links so the process can continue without refreshing the page. But, the second time clicking the links does not produce the jQuery POST ajax call to the php file.   Here is my jQuery code  jQuery('.wantedStatus').on('click', function(event) {     var anime_id = <?php echo $anime_id; ?>;     var anime_list_entry_id = <?php echo $anime_list_entry_id; ?>;     var wantedStatus = jQuery(this).tex        jQuery.post("/path/to/php/file/updateStatus_animelist.php", {firstParam : anime_id, secondParam : anime_list_entry_id, thirdParam : wantedStatus}, function(data) {          //this is your response data from serv          console.log(data);          jQuery('#anime_list_update').html(data);     });     return false; });   The links that activate this function.  Watching Plan to watch On hold Dropped   Now these exact links are outputted from the updateStatus_animelist.php and so when they are clicked again, they don't work.


size of structure node in linked list with pointer as member in C

how to calculate the size of this structure: struct Node{     int data;     char b;     char *c; };  when I run, it gives 16 bytes. can anyone explain?


Why are there still useless traits/mutations in our body

Why is it that through decades of evolution , some seemingly useless body traits such as earlobes and pubic/chest hair still remains while other traits are generally replaced through evolution?


Customizing the height of the cells in a table

I have the following table construction in LaTeX:  \begin{center} \begin{minipage}[c]{0.3\textwidth} \vspace{0pt} \begin{tabular}[b]{l||c|c|c|c|c|c}               \textbf{0} & \textbf{1} & \textbf{2} & \textbf{3} & \textbf{4} & \textbf{5} & \textbf{6}\\ \hline  \hline \textbf{1}       & $\frac{1}{1}$ & $\frac{1}{2}$ & $\frac{1}{3}$ & $\frac{1}{4}$ & $\frac{1}{5}$ & $\frac{1}{6}$ \\ \hline \textbf{2}       & $\frac{2}{1}$ & $\frac{2}{2}$ & $\frac{2}{3}$ & $\frac{2}{4}$ & $\frac{2}{5}$ & $\frac{2}{6}$ \\ \hline \textbf{3}       & $\frac{3}{1}$ & $\frac{3}{2}$ & $\frac{3}{3}$ & $\frac{3}{4}$ & $\frac{3}{5}$ & $\frac{3}{6}$ \\ \hline \textbf{4}       & $\frac{4}{1}$ & $\frac{4}{2}$ & $\frac{4}{3}$ & $\frac{4}{4}$ & $\frac{4}{5}$ & $\frac{4}{6}$ \\ \hline \textbf{5}       & $\frac{5}{1}$ & $\frac{5}{2}$ & $\frac{5}{3}$ & $\frac{5}{4}$ & $\frac{5}{5}$ & $\frac{5}{6}$ \\ \hline \textbf{6}       & $\frac{6}{1}$ & $\frac{6}{2}$ & $\frac{6}{3}$ & $\frac{6}{4}$ & $\frac{6}{5}$ & $\frac{6}{6}$ \\ \end{tabular} \vspace{0pt} \end{minipage} \end{center}   The problem is clear by viewing the following output:     How can I modify the height of a cell in table? I know that I can do p{' '} for the width what about the height?   Thanks for all the help!


Issue in the confirmation page icon, when joining a new community

When I'm trying to join a new community by clicking on the "Join this community" button on the non joined community, I'm receiving the following confirm page. In that I'm seeing the description about the login account. There the icon for the Stack Exchange is displayed as Stack Overflow icon.    When I checked with  in my edit user profile, the Stack Exchange account contains the Stack Exchange icon only.     So it is a bug or the expected behaviour, or I'm overseeing that as an issue?


How to number two-line function definitions

Lets say we have a two line function definition, for example, a translation  \begin{align}     t_{p,q}\text{ : }&\mathbb{R}^2 \longrightarrow \mathbb{R}^2 \\     &(x,y) \longmapsto (x+p, y+q) \notag \end{align}   What/how is the correct way of numbering this? I personally just number the first line, but is it possible to have this number vertically centred? Or is there a better way?


Calculate the determinant of the matrix, which is obtained by crossing out crossing out columns i and j.  $$ \left(\begin{array}{ccccc} 1 & x_{1} & \cdots & x_{1}^{n} & x_{1}^{n+1} \\ 1 & x_{2} & \cdots & x_{2}^{n} & x_{2}^{n+1} \\ \vdots & \vdots & \vdots & \vdots \\ 1 & x_{n} & \cdots & x_{n}^{n} & x_{n}^{n+1} \end{array}\right) $$


I would like to prove this by induction.  How can I approach this, or maybe give me an answer and show me how you did this in detail? I'm struggling with using induction and would like to expand my knowledge. Would really appreciate your help, Thanks


Question closed before I updated it. Do I need to just write a new one or just wait?

I recently asked this question:   I just now updated the question, and honestly I don't know if it's an acceptable question even now, but it's one of those things where I simply don't have anywhere else to go for help so I hope that with my update it will be acceptable "enough". Although that's not why I'm writing this...   I received feedback that I needed to update the question, but it was closed before I was able to update it (I was still trying some other things and wanted to wait until I could update with results of all my own troubleshooting). Now that I've updated, will it possibly be reopened or should I just create a new question?


I am practicing proving things with index notation in order to get a good grasp of the way it works. One of the problems that I came up against is $\nabla(\frac{1}{2}v^2) = \vec{v}\times(\nabla\times\vec{v})+(\vec{v} \cdot \nabla)\vec{v}  $  You can write the right hand side as $\epsilon_{ijk}v_i\epsilon_{xyj}\partial_xv_y + v_i\partial_iv_k$ this comes down to $v_iv_i\partial_k - v_i\partial_iv_k + v_i\partial_iv_k$ the last two terms cancel so you are left with $\nabla v^2$ but where is the half?


Why can't all pointwise continuous functions preserve Cauchy sequences?

If $f$ is a real-valued uniformly continuous function on $A$, then for every Cauchy sequence $(x_n)$ in $A$, $(f(x_n))$ is a real Cauchy sequence.   But why do we need the uniform continuity of $f$ for this?  If $f$ is continuous on $A$ then for any point $c$ in $A$, and any Cauchy sequence $(x_n)$ converging to $c$, $(f(x_n))$ converges to $f(c)$, thus making it a Cauchy sequence.


I'm thinking about getting an neutral density filter to shoot some silky waterfalls and smooths waves on the beach.  What would you recommend in terms of: 1. Brand - quality, durability, price 2. Darkness - what do I need to slow a direct sunlight shot (sunset, sunrise) down to 10-20s exposure? 3. Type - uniform or gradual?


Problems with restricting the allowed inputs of a textbox

I'm having a little problem! I want to restrict the users of my programm from using anything but letters in certain textboxes, which currently looks like this  private void textBox_Ansprechpartner_Name_TextChanged(object sender, EventArgs e) {     if (!System.Text.RegularExpressions.Regex.IsMatch(textBox_Ansprechpartner_Name.Text, "^[a-zA-Z ]"))     {         MessageBox.Show("This textbox may only contain letters.");         textBox_Ansprechpartner_Name.Text = string.Empty;     }             }   Which works just fine, until you actually want to use backspace for example, which makes it empty the textbox again with the same message. Another problem I have is, that it shows the message box when it detects that the input is disallowed aswell as when emptying the field itself.   I tried allowing backspaces by adding \b but the only thing that does is disallowing letters all together.   I'm in a bit of a weird situataion as nothing I've tried so far has worked out.  Help would be greatly appreciated


Prove that the range of the entire function $z^2+\cos(z)$ is all of $\mathbb{C}$.   I'm aware this question has been  already, but the explanations were a little shakey and referenced a google sample preview of a text of whose terminology I wasn't very familiar with, so I would like some more input if possible.  Here's my attempt:  Let $f(z)=z^2+\cos(z)$. Through the power series of the cosine function $$ f(z)=z^2+1-\frac{z^2}{2!}+\frac{z^4}{4!}-\cdots=1+\frac{z^2}{2!}+\frac{z^4}{4!}-\cdots, $$ so $$ g(z):=\frac{f(z)-1}{z} $$ has a removable singularity at $z=0$ and is effectively an entire odd function. Picard's little theorem asserts that the range of $g$ is all of $\mathbb{C} $: if there exists some $z_0$ such that $g(z)\neq z_0$ for all $z\in\mathbb{C}$, then $-z_0$ is also missed by oddness of $g$, which is a contradiction (since $g(0)=0$ we rule the possibility that $z_0=0$). (I'm not sure about the following step) It follows that $zg(z)$ and so $zg(z)+1=f(z)$ is surjective.  Is this method valid? Would I need further justification to show that $z\mapsto z$ and $z\mapsto g(z)$ surjective imply its product -- $z\mapsto zg(z)$ -- is also surjective (if this is even true). Any input is greatly appreciated.  Edit: After thinking about this for a moment longer, I realize this logic would also show that the range of any entire even function is all of $\mathbb{C}$, which seems like quite a strong conclusion. This makes feel like there are holes in my logic.


What could be the Customs duty at Chennai (MAA) airport for Panasonic 55 inch used (>3 years) TV

I bought a TV (Panasonic 55 inch NON-Smart TV) like 3 years back and using it. The airline says, extra baggage will be $200 which I can do, but I'm not sure how much will be the custom duty at Chennai airport (or India in general). If anyone took similar TV before to India/Chennai, let me know please. I have the receipt of the TV purchase with me.


Prove Combinatorical and Algebrical $\displaystyle\sum_{k=0}^\mathbb{n}$ ${2n+1 \choose k}$ = $2^{2n}$

stuck at this question. My friend told me to use Newton's Binominal formula but I don't understand how -_- $\displaystyle\sum_{k=0}^\mathbb{n}$ ${2n+1 \choose k}$ = $2^{2n}$ Also , in the combinatorical way I know that $2^{2n}$ is the amount of subsets that exist in a set with 2n elements. but I don't understand why its equal to the Left-hand-side? Thank you very much!


apt-get does not work after a failed install

I installed 16.04 the other day.  Today I decided I'd rather use KDE than the default desktop, so I ran  sudo apt-get install kubuntu-desktop   This failed in the dependency kde-config-telepathy-accounts, apparently because the file /usr/share/accounts/services/google-im.service is also part of the package account-plugin-google.  Using the -f flag does not help.  The problem now is that apg-get will not install anything any more because of this broken dependency.  Nor will it remove or purge kubuntu-desktop.  How do I either fix the dependency problem, or otherwise fix apt-get?  Thanks.


As a non-developer, how do I download logs so I can help diagnose why an app is crashing?

I am not an Android developer, but one of the apps I use is now saying "Unfortunately ... has stopped." I would like to look at the system logs to help figure out why, but all I can find is references to  and it would be a lot more convenient if I didn't have to download Android Studio just to do this one thing. Is there a way to get the logs without using Android Studio?


Integrate: $\int (x^2+a^2)^{-3/2} \cdot dx$        My Approach:       $\int (x^2+a^2)^{-3/2} \cdot dx$ $\int (x^2+a^2)^{-3/2} \cdot d(a^2+x^2)\cdot \frac{dx}{d(x^2+a^2)}$       But this doesn't give the right answer. I showed this to my friend and he said $d(x^2+a^2)$ is not possible which makes sense since you can't take a small element of the  form $(x^2+a^2)$. How can I then solve this integration without using trigonometry?


NullPointerException in inserting values JDBC Netbeans And MySQL

When Entered Manually in MySQL, The Code Runs But When The Application Is Used To Insert The Values It Gives The Error java.lang.NullPointerException


System.CalloutException: Callout from scheduled Apex not supported. Event after allowcallouts used

I have created a schedule class with AllowCallouts interface used and invoking my batch Apex from It and also my Batch Apex has allowcallouts interface used. But still i am getting CalloutException. i am doing a callout in start method of batch apex and execution methods from re usable BAL helper class     Scheduler   global class KanbanizeCardActivitySchedule implements Schedulable, Database.AllowsCallouts {   global void execute(SchedulableContext sc) {  //small code blocks of getting  //username,pswd,others from custom setting  //Inovoke of batch apex         if(string.isNotBlank(userName) && string.isNotBlank(paswd) ){             ID jobID = database.executeBatch(new KanabanizeCardActivityBatch(fieldsSet, wherClause, userName, paswd ), 200);             system.debug('--jobID for Kanabanize Data Check--'+jobID);                   } }      Batch Apex   global class KanabanizeCardActivityBatch implements Database.Batchable<sobject>, Database.AllowsCallouts {       global KanabanizeCardActivityBatch(set<String> qFields, String whClause, string kanbanUserName, string kanbanPswd){        KanabanizeService_BAL.doLoginKanbanize(kanbanUserName, kanbanPswd);         if(KanabanizeService_BAL.isStatusOkForLogin()){          //setting some final variables here, based on response        }     }   global Database.QueryLocator start(Database.BatchableContext BC){       return Database.getQueryLocator(queryString);    }     global void execute(Database.BatchableContext BC, List<sObject> scope){     //making a callout in execute method, some heavy lines cant share here    }    global void finish(){}   however when i call my batch apex outside scheduler pulling everything perfectly. Not sure this behaviour even after using allowcallouts interface. As per sf documentation we can call batch apex with allow callouts implemented.


Help me prove   $$\binom{n}{r} + \binom{n}{r-1} = \binom{n+1}{r}.$$


I've made a research and found out that without dedicated graphics games use max 50% of each processor's core. And it seems to be an artificial limitation. For a  powerful processor 50% is a very big number compared to a powerful graphics card.  So if you could buy 1 car engine vs. 10 motorcycle engines that apply twice the power for half the cost and weight, which would you buy?  I dont need your long lectures about the cpu and gpu architectures You cant answer the simple question why I must buy 10 motorcycles when I already have an universal car (processor) fastened with prediction and loaded only at 50% that can turn into 10 motorcycles and a car. And by the way today motorcycles (gpus) costs almost as much as cars (cpus)  Sure, some people and companies write inefficient code.  There is no problems to make a code which will use 100% of a processor's capacity. So it is rather the artificial limitation than unwilling.


I've recently noticed that I keep writing "an 1973 coin", and similarly for all the other dates that start with 1 (e.g. "an 1639 coin"). This does not only apply to coins, obviously, it's just the most common context (in my writing, at least) where an indefinite article comes immediately before a digit numeral. It also does not apply to dates starting with 2 (so "a 2015 coin"). (What's the correct word here for "digit numeral", incidentally?)  It sounds correct in my mind, but I suspect that I might be mentally sounding out digit numerals in my native language (or a form of it) rather than English, and apply the articles based on that. Can that actually happen, what should I do to prevent it, and what is the correct English form (so that, if needed, I could apply it manually)?


Prove that $\forall x \neg P(x) \iff \neg \exists x P(x)$

I am reading Velleman's "How to Prove it", and in one example he proves  $\neg \exists x P(x)  \implies \forall x \neg P(x)$    in the following way:    Suppose $\neg \exists x P(x)$. Let x be arbitrary. Suppose $P(x)$. Since we have a specific $x$ for which P(x) is true, it follows that $\exists x P(x)$, which is a contradiction. Therefore $\neg P(x)$. Since $x$ was arbitrary, we can conclude that $\forall x \neg P(x)$, so $\neg \exists x P(x)  \implies \forall x \neg P(x)$    What makes me confused is the line in bold text, that is "Suppose $P(x)$". The reason is that he writes that he is doing proof by contradiction, but $P(x) \not\iff \neg\forall x \neg P(x)$. He is not treating all possible cases where $\forall x \neg P(x)$ is false by assuming $P(x)$, does he? So how can this be a valid proof by contradiction?    Edit: I deleted my first example since it was clearly not representative for the problem.  Edit 2: So the thing that I am opposing I guess is that $\neg \forall x \neg P(x)$ is not $P(x)$. And from what I have undestood, a proof by contradiction should use the negation of the consequent which I do not think that Velleman does.


Do messages from feeds prevent freezing/deleting a chat room?

According to the :  Rooms will exist indefinitely, so long as there is at least one person actively talking in the room. ... Rooms not worth retaining which are inactive for 7 days will be deleted. Rooms worth retaining which are inactive for 14 days will be frozen.  I wonder if the room is considered inactive if there are messages in the room posted from feeds (not from users). My guess is that messages from feeds did not influence freezing/deletion. One reason why I think this is the formulation "there is at least one person actively talking in the room" from the faq. Also when looking at  for some site and also at the , the last activity shown there is the time of the last message shown by actual user not the last message from the feed. (I have on purpose put here a link to a room which is not very active, so it is possible to observe this thing there. Although at this very moment the last messages in that room do not come from the feeds, but from users.) So I am pretty confident that the messages from feeds do not count for the purposes of chatroom pruning. But since I did not find a place in documentation/on meta where this was clearly stated, I decided to ask this also here.