When I get to distribute exp to party members, should I give the same amount of EXP to everyone or split it by monsters killed/fight contribution?


TeXworks can't find MinionPro.sty file and subsequent default to TU

I run the following MWE using LuaLaTeX in TeXworks  \documentclass[11pt,twoside,a4paper]{article} \usepackage{MinionPro}  \begin{document}     \textsc{Hello World.} \end{document}    and it gives an error      File MinionPro.sty not found.  If I now input the file name with the full path,       C:/texlive/2017/texmf-dist/tex/latex/MinionPro/MinionPro.sty   it finds the file, but produces an output that isn't in small caps so there seems to be a substitution at work.  The log file says      Try loading font information for TU+MinionPro-OsF" and "No file TUMinionPro-OsF.fd    which is correct - there are OT1, OT2 fds (among others) but no TU file.  So where should the .sty (and Fd) files be put so that TeXworks will find them?  And will the TU issue then resolve itself?


Will a low grade in my final year of an undergraduate program affect my chances of being accepted into graduate school?

I am currently taking a course where my final mark is determine by 2 papers worth 50% each. I really hoped to get at least a B on my first paper. Unfortunately, I got a B- (71%?). I worked for 2-3 weeks on this very short paper and got help from both my TA and the writing clinic. I am in my final semester of undergrad (have not applied to grad school yet) and now I am considering dropping this course. If I drop this course, I will not be able to graduate in June and will have to take a course in the summer. This also means that I will only have 3 courses on my transcript this semester (if I drop it). This is a philosophy course and thus there is no positive correlation between how hard one studies and their mark (professors have told my class this many times). I will need a B+ on my second essay. I want to graduate in the top 10% of my class and, in order to do that, I need at least a 75% in this class. However, I am not sure how possible this is no matter how much I study or how much help I get. My other marks on my transcript are good, especially the ones that relate to the program I am interested in doing graduate work in. I am not studying philosophy in graduate school. My cGPA is a 3.5 and my GPA for the past 2 years of study is a 3.6-3.7. Graduate schools usually require at least a 3.3 for the last 2 years and a 3.0 overall.   I am not sure whether or not to drop this course. Will a low mark (high 60s/low 70s) in my last year affect my chances for grad school?  EDIT: "Good" GRE scores will not be able to "make up" for an discrepancies in my transcript since I am not required to take the GRE (nor is it accepted by most places).


Can we prove that the set of irrational numbers is uncountable without Cantor?

If we try to map the rational numbers that terminate $\left[0,1\right)$ with the irrational numbers $\left[0,1\right)$, we could do it like this.  $$ 0.1 \to 0.\mathbf1271828182845 \dots $$ $$ 0.14 \to 0.1\mathbf41421356237 \dots $$ $$ 0.16 \to 0.16\mathbf1803398874 \dots $$ $$ 0.13 \to 0.131\mathbf4159265359 \dots $$ $$ 0.101 \to 0.1010\mathbf0100010 \dots $$ $$ 0.2 \to 0.20200\mathbf20002000 \dots $$ The idea is to match each irrational with the shortest prefix from each irrational number that has not been used yet. Since the numbers are irrational we can always find some rational number to pair with each irrational.  The problem is that we can't list all the irrational numbers, because we can diagonalize a new number. In this case we can take the diagonal $0.141402 \dots$ and change every digit to something else $0.251513 \dots$then we will know that this number can't be on the list.  But, we can still use our idea to find a rational number to match with the new diagonal number, in this case the rational number $0.25$, and since the new irrational number will always be different from all the other numbers, at some finite point, we can always find a rational number to pair with it.  My question is "How can we prove that the set of irrational numbers is uncountable, without invoking Cantor's diagonal argument?"


Parse JSON in javascript, from external URL and save a value into a variable

I have an API in JSON.  I want to use JS to, parse it via its url, get one value from one of the objects in JSON, and save them into a string variable. My API  {"code": 1000, "data": {"page-name": [{"link": "rules", "order": 0, "title": "\u91d1\u5e01"}], "InfinitePage": [{"sort": 14, "category": "Infinite", "DownloadUrl": "http://hot.haima.me/infinite/201611/1618/com.ea.sims3deluxe.ipa", "IdnAme": "com.ea.simsdd"}]}}   Basically I want a variable in javascript to get the value of DownloadUrl  var link="http://hot.haima.me/infinite/201611/1618/com.ea.sims3deluxe.ipa"   How to achieve this?? Sorry, but I am extremely new to this Already tried     var scmAPI = "http://theurl.com/..."  $.getJSON(scmAPI, function(json) {     document.getElementById("testjson").innerHTML = "Prie: " + json.DownloadUrl; });    But I get undefined I don't want a http request, or whatever, I want to use an external api to get data!


Movie Identification - Spaceship, earth destroyed but not really

I saw a movie on TV a long time ago that I can't seem to find.  Plot is basically this:  Earth is going to be destroyed (known or maybe unknown) and a crew is on a spaceship flying somewhere.  During their trip they receive notice that Earth has been destroyed and the plot centers around how they handle it.  The twist is, after some of them die, the survivor's 'wake up' and find out they were in a simulation that was trying to discover what people would do when confronted with that information.


Determine that $\Sigma^{\infty}_{n=1}\frac{n!}{n^n}$ is convergent.

This is the question from my book.  Is the series $\Sigma^{\infty}_{n=1}\frac{n!}{n^n}$ convergent or divergent?  Actually I know the answer is convergent by plotting but I can't complete the proof.  This is my workings:  $$\lim_{n->\infty}\frac{U_{n+1}}{U_n}=p$$  $$p<1 (convergent) ,p>1(divergent)$$ $$=\frac{\frac{(n+1)!}{(n+1)^{n+1}}}{\frac{n!}{n^n}}$$ $$=\frac{(n+1)n!}{(n+1)^n(n+1)}.\frac{n^n}{n!}$$ $$=\frac{n^n}{(n+1)^n}$$ $$=\left(\frac{n}{n+1}\right)^n$$ This is where I am stuck. Where do I go from here?


Controlling the terminal while in the middle of a pipe

Say I have 3 commands linked through pipes:  A | B | C   I would like B to output error messages to stderr and some progress to the terminal. If stderr is the same as the terminal, then that is easy: Simply send the progress information to stderr. But what if stderr is redirected?  A | B 2>/tmp/file | C   Then I still want the progress information to go to the terminal, while error messages go to the file.  Can I now somehow identify the terminal that stderr would have ended up on had it not been redirected?  My initial idea would be to find the tty using tty and then opening that and writing to it. However, if I call tty from inside B tty says: not a tty, which I believe is because of the pipe between A and B.  I would like to do this from Perl.


Why does a star with its core collapsing and about to undergo a supernova, explode, instead of rapidly collapsing all of its matter into a black hole?

I am guessing this has something to do with density.   I would assume that a massive star that has its core collapsing would be a prime candidate for having its core turn into a black-hole. If the core then turned into a black-hole, it would follow that subsequent mass would rapidly pass its event horizon and feed the black hole resulting in a rapidly expanding event horizon.  So why does a supernova occur at all? Why does the star not simply completely collapse into a black hole with no explosion when a star's core collapses?


I just tried to edit the tags of a question through the mobile app, but wanted to check the tag wiki excerpt for usage guidance first. If there is a way to see it in the app, I haven't figured it out.  I hereby request that tag wiki excerpts/usage guidance be shown in the mobile app. As hovering is not really a thing on touch screens, I suggest that the excerpt be shown on a long press while on the tag search/adding screen. (I'm amenable to other options, like adding a small button to the tag name when it shows up as a search result, so long as it's shown.)  This long press functionality can also be applied to tags shown on questions already asked, but I think it's more important to see the usage guidance when asking and editing.


Difference between opening a file in binary vs text

I've done some stuff like:  FILE* a = fopen("a.txt", "w"); const char* data = "abc123"; fwrite(data, 6, 1, a); fclose(a);   and then in the generated text file, it says "abc123" just like expected. But then I do:  //this time it is "wb" not just "w" FILE* a = fopen("a.txt", "wb"); const char* data = "abc123"; fwrite(data, 6, 1, a); fclose(a);   and get the exact same result. If I read the file using binary or normal mode, it also gives me the same result. So my question is, what is the difference between fopening with or without binary mode.  Where I read about fopen modes:


Does "user profile views" contain/constitute the  and ?

I referred the "profile views" question related to ,  and ; but couldn't find the answer.   Are repeat views from SO users added to profile views ? If yes then at what frequency/interval they are added (i.e. per minute, per day, per week) ? If a profile is viewed by unregistered SO viewer, will it be added ?


Filling in the area under a normal distribution curve

I'm trying to fill the area between the two $z$-scores but I'm not having any luck. Could someone please help me with this?  \begin{tikzpicture} \begin{axis}[   no markers,    domain=0:6,    samples=100,   ymin=0,   axis lines*=left,    every axis y label/.style={at=(current axis.above origin),anchor=south},   every axis x label/.style={at=(current axis.right of origin),anchor=west},   height=5cm,    width=12cm,   xtick=\empty,    ytick=\empty,   enlargelimits=false,    clip=false,    axis on top,   grid = major,   hide y axis   ]  \addplot [very thick,cyan!50!black] {gauss(x, 3, 1)};  \pgfmathsetmacro\valueB{gauss(1,1,7)} \pgfmathsetmacro\valueA{gauss(1,1,1.7)} \pgfmathsetmacro\valueC{gauss(1,1,1)}  \draw [very thick, red]  (axis cs:1,0) -- (axis cs:1,\valueB); \draw [very thick, red]  (axis cs:2,0) -- (axis cs:2,\valueA); \draw [very thick, red]  (axis cs:3,0) -- (axis cs:3,\valueC);  \node[below] at (axis cs:3, 0)  {$\mu$};  \node[below] at (axis cs: 2, 0) {$z=-1.8$}; \node[below] at (axis cs: 1,0) {$z=-2.97$}; \end{axis} \end{tikzpicture}


Consider the binomial coefficients $\binom{n}{k}=\frac{n!}{k!(n-k)!}\ (k=1,2,\ldots n-1)$. Determine all positive integers $n$ for which $\binom{n}{1},\binom{n}{2},\ldots ,\binom{n}{n-1}$ are all even numbers.   The answer is $n\in\{2^k|k\in\mathbb{N}\}$, but we have to show two things. First, if $n = 2^k$ then $\binom{n}{1},\binom{n}{2},\ldots ,\binom{n}{n-1}$ are all even numbers and second if $n \neq 2^k$ then $\binom{n}{1},\binom{n}{2},\ldots ,\binom{n}{n-1}$ are not all even numbers. I think we can use  for the first part but what about the second part?


Identifying anomalies in spatial (latitude, longitude, time) data?

I'll start off by prefacing this with the fact that I'm not even sure if I'm asking the right question and what I'm really looking for is some guidance to dig in the right direction. I have a set of 3D spatial data (latitude, longitude, time) on a regular spatial grid. I expect there to be anomalies/outliers in this data that are of interest. They may be spatial or temporal in nature. Are there machine learning or statistical methods that are tailored towards identifying such anomalies? I think I'm struggling as it's such a vague question so some direction (even just the name of a method to go and google) would be really helpful.


Documented health effects when exposed to solder / flux smoke?

I run a repair shop and occasionally we do soldering work, but nothing too crazy. I was wondering what are the documented health effects when exposed to solder smoke. We do have an open space with low ceilings. I'd say we solder maximum of about 10 minutes a day at most. I do have the smoke absorber, but techs don't tend to turn it on if  your just soldering a few points on the board.   What are some documented health effects when exposed to solder smoke 10 minutes a day. I mean we aren't inhaling this stuff directly, its just in the same work area.


Why was this question deleted by Community?

I understand question deletion by moderators, but I cannot understand why this question was deleted by the Community user:   Please could somebody explain this to me.


No surjective bounded linear map from $\ell^2(\mathbf{N})$ to $\ell^1(\mathbf{N})$

The second part of an exercise asks that I show:     There does not exist a surjective bounded linear map from $\ell^2(\mathbf{N})$ to $\ell^1(\mathbf{N})$.     The first part was to show that these two spaces are separable in their respective $L^p$ norms.    I've really hit a wall on this one.  I know, in fact, that there does exist a surjective bounded linear map from $\ell^1(\mathbf{N})$ to $\ell^2(\mathbf{N})$.  So my intuition says that if there were also one going the other way, then the two spaces would have to be isomorphic, which is false .  But I don't know of any such theorem that I could apply to "the category of Banach spaces".    My only other idea is to argue by contradiction using the open mapping theorem, but nothing is coming to me...  My guess is that separability is also going to be important, given the first part of the exercise.  -Thanks.


$Aut(G)$ is abelian if and only if $G$ is cyclic.

Problem says:     Let G   be an abelian group. Prove that Aut(G)   is abelian if   and only if G   is cyclic.   And I solved $(\Leftarrow)$ direction as follow:  Suppose that $G$   is cyclic.   Then $Aut(G)=\{\varphi_{1},\cdots,\varphi_{n}\}$   where $\varphi_{i}(g)=g^{i-1}$  . Thus, for $\varphi_{i},\varphi_{j}\in Aut(G)$  , $\varphi_{i}\varphi_{j}(g) = \varphi_{i}(g^{j-1})  = (g^{j-1})^{i-1}  = (g^{i-1})^{j-1}  = \varphi_{j}(g^{i-1})  = \varphi_{j}\varphi_{i}(g)$  Therefore, $\varphi_{i}\varphi_{j}=\varphi_{j}\varphi_{i}$   for $1\leq i,j\leq n$  . Hence, $Aut(G)$   is abelian.   But I worried about the case where $G$ is infinite and the other direction.


How do I evaluate: $\lim_{m \to \infty} \left(1 + \frac{1}{m}\right)^m$?

I'm trying to evaluate what compound interest approaches when the number of compound periods approaches infinity. That is, I'm interested in analytically evaluating Euler's number $e$: $$\lim_{m \to \infty}   \left(1 + \frac{1}{m}\right)^m$$ Do you have any suggestions or ideas regarding how I can approach evaluating this? Also, is there a general approach to solving this kind of limit?


SSH to a host and enter password with shell script

I want to create a file like this : sshTOhost :  #!bin/bash ssh -D 1500 user@host #enter password (I don't know how)


Does the closedness of a subgroup $H$ of $G$ imply that for $h\in H, g\in G \setminus H : hg \not \in H$?

Does the closedness of a subgroup $H$ of $G$ imply that for $h\in H, g\in G \setminus H: hg \not \in H$?  I'm new to abstract algebra and this would appear to be a useful result. However, by definition, a subgroup is nearly closed, and I don't think this directly implies that for any element $g$ from $G$ not in $H$, the composition $gh \not \in H$.  Is this in fact a true statement?


What is the right container for an array in modern c++

I want to do some data-analysis, so I need at compile time unknown sized (large) arrays (of double or complex double). The number of dimensions is know at compile-time. What is the "right" way to do this in modern c++.


Why must an int have a memory address that is divisible by four on most current architectures?

I'm going over some notes from Berkeley's CS61C  and there is a part that is talking about memory addresses.     On most current architectures, including the MIPS architecture, an int must have an address that's divisible by 4. So if you think of memory as being full of integers, it looks like this        but if you think of memory as full of characters, it looks like this:        Saying this another way, the rightmost two bits in any int address are zero.   The reason for this last statement is that the two rightmost bits represent 2^0 and 2^1 which are not divisible by four; the entire integer will be divisible by four if and only if those rightmost two bits are zero.  Question: why must the address be divisible by four?  This is my interpretation   addresses are 32 bits, so they go from 0 to 2^32-1 the smallest addressible unit of memory is a byte so each of those addresses refers to one of these bytes but an integer is 32 bits, so four bytes, ie it fits into four addresses lets assume address number 4 points to a integer; this integer will be represented in memory positions 4, 5, 6, 7; therefore, the next available address for an integer is address 8 therefore, as long as the smallest address is divisible by four, all the others will be divisible by four necessarily.  if the first address of an int had been address 3, then this property that the rightmost two bits are zero wouldn't hold. is this correct?


Awaiting editorial office processing for more than 22 days, Is it appropriate to contact?

I have recently submitted an article to a tylor & francis journal which uses ScholarOne.  My co-author submitted the article 22 days ago, and since then, the status has remained as "Awaiting Editorial Office Process".  Is it alright that it hasn't been changed for so long? Should I contact the editor?  How long does the process take normally?  NOTE: thank you for suggesting this page "What does the typical workflow of a journal look like?", I have read this topic. Unfortunately in this paper the average time for "Awaiting Editorial Office Process" was considered to be "A FEW WORK DAYS". My problem is I have waited for 22 days. If anyone have had the same experience, I would really appreciated answering me. Thank You.


jquery onclick new element not created properly

<!DOCTYPE html>       <meta charset="utf-8">     <title>jQuery UI Button - Icons</title>     <link rel="stylesheet" href="http://code.jquery.com/ui/1.10.3/themes/smoothness/jquery-ui.css">               <link rel="stylesheet" href="/resources/demos/style.css">
         VOLVO B9R
     Here when i click on the first div, the program creates another div. the newly created div is not responding to on click event. in the current code i have specified that the newly created div should give an alert on click but its not working. Thanks!


Why does my multimeter show a wrong voltage over a large resistor?

I am having a hard time answering one particular question about our experiment.. In our experiment, R1 and R2 were set to 1Meg each and later to 10k... I understand the need for R1 and R2 a bit. Without R1 and R2, the voltage sharing wouldn't exactly be 50-50 for both D1 and D2 because no two diodes are completely identical. D1 and D2 will both have the same leakage currents (without R1 and R2) since they are just in series. However, they probably will have non-identical IV curves, so this particular leakage current will result to V@D1 /= V@D2.  The question I am having a hard time is that, why is V@R1 + V@R2 /= 10v when R1 = R2 = 1Meg?... One the other hand, those two voltages add up (to 10v) when R1 = R2 = 10k... I included the 60 ohm source resistance in my diagram for completeness. However, as I can see, both D1 and D2 are reversed biased and thus, they offer a very large (reverse resistance) which should be much greater than the 60 ohms. Even with the parallel combination of 1Meg and D1 reverse resistance, it should still be much greater than the 60 ohms. I tried thinking of an answer in terms of the RD1reverse//R1 = Req1 and RD2reverse//R2 = Req2. Req1 + Req2 (series) should still be much more than 60ohms and I thought that the 10v should still show up at the node of D1 cathode. Yet in our experiment, V@R1 + V@R1 < 10v.  Can anyone point me out if I am thinking this in a wrong way? Some tips/first step hint would really be appreciated  Edit: question answered thanks to @CL. Assuming D1 and D2 are open during reverse bias for simplicity and noting that Rmultimeter = 10Meg, V@R2 (shown on multimeter) = 10v * (1Meg//10Meg)/((1Meg//10Meg)+1Meg+60) = 4.76v measured.


number of integral values for which $x^2+19x+92$ is a perfect square.

number of integral values of x for which $x^2+19x+92$ is a perfect square=?   I have no idea how to do this. Please help.


VPN that works in China as of October 2017

I’m going to China and want to access my Gmail/Facebook account from time to time. Can somebody recommend a VPN provider or protocol that is not blocked by the Chinese firewall.  I have a private VPN based on OpenVPN and I’m not sure if I can use it in China. As I read, in the recent months they start blocking the OpenVPN protocol completely.  It would be helpful if somebody who is in China now and uses a VPN could give me some advice. Links to blog post older than a month are not helpful.


Save record in database and get its referance immediately in C# and MySQL

I have point of sale system i am working on. C# and MySQL. As I capture a new sale I want to use two tables namely sale and sale_item.   the sale table has the major details of the sale, whilst the sale_item has the individual products being bought with the actual sale as a foreign key.  On clicking save, How do I create a sale record and immediately get its reference to add it on the sale product.  I thought of select max(saleID) but there should be a better way to go about it.


Error in  arcpy.SelectLayerByLocation_management

I am writing a Python code and have trouble adding a layer to the program. I face this problem below:  Traceback (most recent call last):   File "G:\arcpy workspace\python learning codes\loc.py", line 5, in <module>     arcpy.SelectLayerByLocation_management('inf1', 'WITHIN_A_DISTANCE', 'inf2' , '5000 Meters' , 'NEW_SELECTION')   File "C:\Program Files (x86)\ArcGIS\Desktop10.0\ArcPy\arcpy\management.py", line 4381, in SelectLayerByLocation     raise e ExecuteError: Failed to execute. Parameters are not valid. ERROR 000824: The tool is not licensed. Failed to execute (SelectLayerByLocation).   What's the problem with adding a layer or anything else that makes it go wrong?


Extracing IP addresses as whole words with POSIX BRE/ERE regex

I am trying to match IP addresses found in the output of traceroute by means of a regex. I'm not trying to validate them because it's safe enough to assume traceroute is valid (i.e. is not outputting something like 999.999.999.999. I'm trying the following regex:  ([0-9]{1,3}.?){4}   I'm testing it in  and it does validate an IP address. However, when I try   echo '192.168.1.1 foobar' | grep '([0-9]{1,3}.?){4}'    I get nothing. What am I missing?


Blank lines in an equation and some other similar function

Why blank lines between equation makes error? there are a lot of commands in latex and almost for all of them these blank lines are not important,  but why in this case is important and is there any similar function?


Unity: How can I make Alt+TAB browse through all my windows without grouping them?

When I use ALT+TAB to cycle through my apps I would like to have icons for all my open browsers. I use the ` (Grave or the key above TAB) but I really find that hard to use.  Anyway I can just use ALT+TAB only?


What is bet way to Join two tables with many to many relationship

I am having two tables as  Table 1  UserName| MessageId|Message U1|1|First U2|2|Hi U1|3|hello U4|4|temp   Table 2  UserName|UnitName U1|Unit1 U1|Unit2 U2|Unit3   I need result Like  UserName|MessageId|Message|UnitName     U1|1|First|Unit1,Unit2     U2|2|Hi|Unit3     U1|3|hello|Unit1,Unit2     U4|4|temp|NULL   Can you please help me to find efficient query?


Why is my code returning false in a check between two equal strings?

I am trying to build a Palindrome finder class that uses an ArrayStack of characters to find palindromes in any word or phrase passed to it. However, when I pass a palindrome as a string to my code, it returns false.  I have debugged my code several times and even wrote the program over, but I cannot figure out why my code isn't working properly. I think it may be something simple that I am overlooking in the isPalindrome() method, the constructor or instance variables.  public class PalindromeFinder {     ArrayStack<Character> charStack = new ArrayStack<>();     String strVerify = "";     private String strCheck;      public PalindromeFinder(String strCheck) {         strCheck = strCheck.toLowerCase();         pushStr(strCheck);         strVerify = popStr();     }      public void pushStr(String strToPush) {         for (int chVal = 0; chVal <strToPush.length(); ++chVal) {             char ch = strToPush.charAt(chVal);             ch = Character.toLowerCase(ch);             if (Character.isAlphabetic(chVal)) {                 charStack.push(ch);             }         }     }      public String popStr() {         while (!charStack.empty()) {             strVerify += charStack.pop();         }         return strVerify;     }      public boolean isPalindrome() {         return strVerify == strCheck;     } }   The following lines of code return false in the main method of my program:  PalindromeFinder p = new PalindromeFinder("mom"); System.out.println(p.isPalindrome());  Any help or improvements on my code would be greatly appreciated.


How do I put OEM installation into live usb?

What I want to do is customize Ubuntu through OEM, then, flash said OEM installation to an ISO so I can install it on others computers without having to redo my customization later. (also so that other can download said ISO and install it with my customizations)


Just got a second monitor, and I'm not sure how to adjust them

So I got a second monitor and it's color greatly differs from my current one. The new one is a Samsung PLS monitor, the older one an ASUS model (no idea which); both have a Full HD resolution, the first one is connected over HDMI, the latter over DVI. Both are in a ~200 € price range, so no professional design monitors with fully adjustable displays.  At first sight, my old monitor looked better in comparison (much more vibrant, generally a bit brighter; also, this might have just been the force of habit). However, this one has several display modes, of which the 'scenery mode' was selected. In the 'standard mode', the overall look is much closer to the new monitor. So I'm assuming this scenery mode just adds some vibrance and similar adjustments to make the picture look better for consumers - which might not be what I want for design work.   By adjusting both monitors manually, I got both to look somewhat similar, which means less vibrance and saturation than I'm used to. However, I'm kind of confused now, I'm actually not sure if these settings are actually better for design work than the 'scenery mode' which subjectively looks better to me.  Not sure how to put it into words, but here are my questions:   Is it beneficial to adjust my two monitors so that both look roughly the same? Or should I adjust both individually so that they 'look best'? (This way, I would actually see how my design looks on different monitors, wouldn't this be beneficial at least for screen design? I don't do print design anyway ...) How do I know which settings are 'best'? I can of course adjust my old monitor to fit my new monitors appearance, but how can I know what are the correct settings - if such a thing even exists - without some kind of reference? How far can I trust my subjective perception? (I ran the 'calibrate display colour' helper provided by Windows 10 on both monitors, but that didn't help that much. I've cranked up the brightness of my new monitor, but the background of this page, for example, still looks kinda grey-ish even though it's close to white ... or that might just be my perception, because I'm used to the vibrant and brightened scenery mode of my old monitor ... I'm so confused.) I have an nVidia GTX 970. In the Control Panel's colour options, I can choose between 'Other applications control colour settings' and 'Use nVidia settings'. If I choose the latter, I can adjust Brightness, Contrast and Gamma on OS-level (as opposed to the monitor settings itself). Is that a good idea or should I always leave the other applications in control, as to not interfere with Creative Cloud Software?   Sorry I know those questions are kind of convoluted, I'm just confused because I never had a second monitor to work with and now I'm not even sure I can trust my own perception, so I have no idea how to find optimal settings ...  Thanks!


When whoever vs. whomever fails the he/him test

The following example fails the he/him test for whoever/whomever:     Please give the key to whoever needs to open that cabinet.    Give the key to him or he? Give the key to him.   However, when asking who opened that cabinet, he works instead.   So the question, then, is which part of the sentence do we perform the trick on? The predicate is "open that cabinet," which would mean whoever does take on the subject and is correct here. But why isn't "give the key" the predicate?


Is "quantum superposition" just a fancy way of saying that a system is in one state or another with some probabilities?

When we say that an electron is in a quantum state that is a linear combination of two eigenstates, one with the probability of 75% and the other 25%, what is actually happening?   Is the electron "really" somehow magically in these two eigenstates at once?    OR   The electron is in only one of these eigenstates at a time point, we just can't tell which one it is without observing it. And when we observe the electron many times, we find it in one eigenstate in 75% of the time, and in the other eigenstate in 25% of the time, because the electron switches between these two states and just spends three times more time in one eigenstate than the other?   Obviously, I think the second case is correct.   But which case is correct? The 1st or the 2nd?  My reactions to your possible answers:    If the 1st case is correct: That's insane, thank you!    If the 2nd case is correct: Then, isn't the principle of superposition just an "assumption" that should not be taken literally? That is, the electron is not at two eigenstates at once, but one of them at a certain time point, and we just have no way of finding out which state, before observing it? So we just say that it is in an eigenstate X with a probability P(X), such that the sum of probabilities for all eigenstates equal to 1?  I could also, for example, say: I don't know where my friend Max currently is. He could be at school with a probability of 75% and at a bar with a probability of 25%. We all know that Max is not at school and the bar simultaneously, and we can just call him to find out where he is. But before calling him, for the sake of being able to conduct our calculations, we can "assume" that he is at school and the bar simultaneously, with the assigned probabilities, but we actually know that we just made this assumption to be able to carry on with our calculations about Max.   Isn't it just a fancy way of saying that something is in state X with P(X) and state Y with P(Y), and it is in only but only one of these states at all times, however, we just can't find out which state before observing that something, but can merely say with which probability we're likely to find it at a certain state?   Then why is everyone so surprised about the superposition principle?


Inverse image of a union equals the union of the inverse images

I just wonder if my following solution is true. Let $X,Y$ be sets, let $f:X\to Y$ be a function, let $\{Y_i\}_{i\in I}$ be a family of subsets of $Y$. (Note: I use equalities instead of mutual containment) $$\begin{align}f^{-1}\left[\bigcup_{i\in I} Y_i\right]  &= \{x \in X: \mbox{there exists an}\quad i \in I\mbox{ such that } y \in Y_i,f(x)=y\}  \\&=\bigcup_{i \in  I} f^{-1}\left[Y_i\right] \end{align}$$ I initially do not know how to get from the left to right, but when I put both sets in set notation, they turn out to be the same, hence the one line proof. Something go ultimately wrong?


DES: Initial permutation position decreases by 8 - what is the significance?

I'm a beginner in the complex world of cryptography. Doing some basic course on DES, and I found a peculiar (to me) pattern within DES' Initial Permutation table.  The table is built as an 8x8 matrix with shift position:    The pattern graphically presented on the wiki page happens to decrease by 8 in every row. What's also interesting, is that the values between neighbouring rows, but different columns seem to differ by 2.  This may be "just randomly selected", but assuming that DES has been thoroughly designed, implemented and - most importantly - tested, this seems on purpose. Hence: What is the significance of the pattern within IP?  (my wild guess is that it's of rather little importance, as IP is easily reversible)


adding days to historical dates in app script

I am trying to pull some historical data, which has a variety of time stamps. I want the use to a user selected date, and then pull all days + some additional days. Date1 is var Date1 = "Thu Oct 22 00:00:00 GMT-04:00 2020" var startDate = new Date(Date1)  var Enddate = new Date(); Enddate.setDate(startDate + 10);  This doesn't work. I cant seem to figure out how to add the "10 days" to the Date1 variable.


Stop rewriting trailing exclamation marks as question marks

was originally titled     Parsing irregular prototypes? Need an advice?   Because I'm hilariously funny, I commented: "No, I don't need any advice. Cheers, though"  But as it turns out, the OP had in fact entered:     Parsing irregular prototypes? Need an advice!   I confirmed via my own edit attempts that the trailing exclamation mark is converted into a question mark automatically on post submissions.  Now, OK, the title is not great. But this seems like a broken "feature" to me; what percentage of poor question titles with a trailing exclamation mark are fixed (rather than made more broken) by rewriting that punctuation as a question mark?  I vote we kill this feature.


I would like to implement an example of abstract factory, however concrete factories must be served as singletons. Giving the example of Mr. Banas here :  I should modify UFOEnemyShipFactory and UFOBossEnemyShipFactory right ? I tried something for UFOEnemyShipFactory but I'm not sure to be right : public class UFOEnemyShipFactory implements EnemyShipFactory{      private UFOEnemyShipFactory(){};      private static UFOEnemyShipFactory firstInstance = null;      public static UFOEnemyShipFactory getInstance(){              if(firstInstance == null){                      synchronized(UFOEnemyShipFactory.class){                              if(firstInstance == null){                                      firstInstance = new UFOEnemyShipFactory();                                  }                          }                  }              return firstInstance;          }      public ESWeapon addESGun(){         return new ESUFOGun();     }      public ESEngine addESEingine() {         return new ESUFOEngine();     }  It seems a bit weird, I think that I'm not applying the needed modification in the correct class. If I'm totally wrong could you please give me a brief explanation (why am I wrong and which class(es) I have to modify and why ?) Thanks In advance.


I am new to Adobe illustrator. There are 13 Paths available in the above Picture. My Question here is to can we make the above Paths into three closed Paths. As joining mentioned below  Path one 1 , 2 , 3 , 4 , 5 Path two 8 , 5 , 6 ,7,10 ,9 Path three 9 , 12 , 13 , 11  How can we do that in Adobe illustrator. Thanks in advance


So far I have logged 24 hours in FF VII and I just finished disc 1. Anyway, keeping that in mind, how long can I expect it to take me to get through disc 2, and then disc 3?


What are the big differences among the D&D editions?

I've been out of the loop for a while, and I used to play AD&D 2nd ed, but today I find there are a lot of different versions that have fairly different gameplay.   Can anyone summarize the really big differences, the ones (maybe top three?) that are the 'killer features' of the different editions? What makes each edition play differently than the others?


Where can I find ROM images for Samsung Galaxy Tab 2 10.1 (GT P5113)?

I've stopped using my tablet several years ago out of frustration. Ever since Kit Kat/4.4.4 everything has slowed to a near unusable crawl. I tried rectifying this by flashing it with a SlimRoms OS (SlimKat) but it only improves things moderately and some applications, like YouTube, crash often.   I'm looking to see if maybe Jelly Bean runs better, but so far I've had no luck with it. The Samsung downgraded firmware just puts it into a boot loop and I cannot find a compatible SlimRom, Lineage OS, or Cyanogenmod. Does anyone know if one exists?


I'm trying to deactivate this trigger but the test class is erroring and it wont let me deploy. Its showing this error:     System.AssertException: Assertion Failed: Expected:   0035E000008yLU5QAM, Actual: null      Class.TestDeduper.testDupes: line 19, column 1   The Trigger is:  // Populate a Contact Lookup field if there's a dupe! trigger DetectDupes on Lead (before insert, before update) {     for (Lead l : Trigger.new) {         if (l.Email != null) {             String leadEmail = l.Email;             List<Contact> dupeContacts = [SELECT Id FROM Contact WHERE Email = :l.Email];             if (dupeContacts.size() > 0) {                 l.Dupe_Contact__c = dupeContacts[0].Id;             } else {                 l.Dupe_Contact__c = null;             }         } else {             l.Dupe_Contact__c = null;         }       } }   The test case is:  static testMethod void testDupes() {     // Principle #1: Create records from scratch!     Contact dupeContact  = new Contact();     dupeContact.LastName = 'Spiderman';     dupeContact.Email    = 'spiderman@gmail.com';     insert dupeContact;                  Lead dupeLead = new Lead();     dupeLead.FirstName = 'Peter';     dupeLead.LastName  = 'Parker';     dupeLead.Company   = 'Daily Bugle';     dupeLead.Email     = 'spiderman@gmail.com';     insert dupeLead;      // Principle #2: Use System.assertEquals()     dupeLead = [SELECT Id, Dupe_Contact__c FROM Lead WHERE Email = :dupeLead.Email LIMIT 1];     System.assertEquals(dupeContact.Id, dupeLead.Dupe_Contact__c);      // Principle #3: Test things that shouldn't work!     Lead uniqueLead = new Lead();     uniqueLead.LastName = 'Xavier';     uniqueLead.Company  = 'X-Men';     uniqueLead.Email    = 'theprofessor@xmen.com';     insert uniqueLead;      uniqueLead = [SELECT Id, Dupe_Contact__c FROM Lead WHERE Email = :uniqueLead.Email LIMIT 1];     System.assertEquals(null, uniqueLead.Dupe_Contact__c); }


Connect via ssh to one of the multiple clients on same network

let's imagine i am at school with an android phone. I have a computer at home and that computer has a virtual machine working on it. here is the scenario, client and virtual client has ssh-client and ssh-server both and they can communicate each other in the local network.  when i want to connect to my virtual client from school by android phone through internet there must be an ip address.  the problem is virtual machine and client has the same public ip. so how do i connect one of the two machines?


Best placement for a "Go Back" button: top or bottom?

I know that it is bad practice to use a "Go Back" button (since the browser has such a function) but when it can't be avoided for some reason, is it better to put it on top (similar to how the back buttons on browsers are on top) or at the bottom (similar to "cancel" buttons on forms)?  Let's say the page is not a form but rather a "Preview" / "View" page of some sort where user can view data.


PCs and enemies were on two sides of a closed door. Both parties readied actions in case someone opens the door - mostly attacking whoever is on the other side.  Finally one enemy opened the door and triggered the readied actions.    Do all attack sumultaneously? If not, is the initiative modifier the tie-breaker? In case the combatants attack in order of their initiative modifier: Which bonuses on initiative would be taken into account? Clearly ability modifiers and the feat Improved Initiative. What about the bonus Team Initiative  provided by the prestige class Dread Commando (Heroes of Battle)? All combatants with readied actions got a new initiative count directly before the enemy who opened the door in order of their initiative modifier. Which bonuses on initiative would be taken into account for this order?


How to scale up an image for print. How large can i go?

I have an approximately 2500 pixel x 3500 pixel image. How do I figure out the largest print that I can get from it? At the 300 dpi printing standard that would only yield about 8x12" but I need something larger. Larger than A4.


Playing/Pausing iTunes while another app plays media

While browsing on Safari and listening to iTunes I come across a video and then press the "play" button on the keyboard (to stop the music while I watch the video) it starts/stops the video instead of the music (I have no control over the music).  How can I quickly play/pause my music without affecting the video?


How does River Song know The Doctor's name?

In series 6, The Doctor lies that he told River his name (which River falsifies in the end of the episode). Yet in The Name of The Doctor she knows The Doctor's real name and even opens The Doctor's tomb with it. Also, The Tenth Doctor says that there was only one situation where he could possibly tell her his name. What of it?   So where, when & how exactly does River come to know The Doctor's name?


A converse proposition to the Mean Value Theorem

This is just a question that popped up in my head while going through basic real analysis. The ordinary Mean Value Theorem (MVT) is given as follows.     Let $f:[a,b] \to \mathbb{R}$ be a function satisfying the following conditions: $(i)$ $f$ is continuous on $[a,b]$ and $(ii)$ $f$ is differentiable on $(a,b)$. Then $\exists c \in (a,b),$ such that $$f(b)-f(a)=f'(c) \cdot (b-a)$$   Of course, we can restrict $f$ to any interval $[x,y] \subset [a,b]$ and apply the theorem on $f|_{[c,d]}$ to state that $\exists z \in (x,y)$ such that $f(y)-f(x)=f'(z) \cdot (y-x)$  Can I formulate a converse proposition as follows?     Let $f:[a,b] \to \mathbb{R}$ be a function satisfying the following conditions: $(i)$ $f$ is continuous on $[a,b]$ and $(ii)$ $f$ is differentiable on $(a,b)$. Then $\forall c \in (a,b), \exists x,y \in [a,b]$ such that $$f(y)-f(x)=f'(c) \cdot (y-x)$$   Does it hold?  If yes, how do I prove it? (How does one find out the points $x$ and $y$, which need not be unique, that work for a given point $c?)$ Does it hold under weaker assumptions on the function?  If no, can you provide me a counter example? Can I impose stronger conditions to make it work?  Any help would be much appreciated. Thank you.  EDIT : As pointed out by @Henrik, the proposition does not hold with it's current assumptions. On the other hand, @MANMAID claims that it does hold with the additional assumption that $f$ has no point of inflection. It seems very interesting. I require a formal proof, though.


Let $A$ and $B$ be to $n \times n$ matrices. My question is:  Is $\operatorname{rank}(A-B) \geq \operatorname{rank}(A) - \operatorname{rank}(B)$ true in general? Or maybe under certain assumptions?


Virtual Assistants: A drain on the community?

I've noticed a recent glut of so called "Virtual Assistants" asking for help within a few different Google Sheets / Excel related tags on StackOverflow. I'm fine to help such folks if it's just help, but lately it feels more and more that they are trying to farm out their work to volunteers. What is the best way to handle this problem/suspicion? I'm relatively new to the Stack Community so maybe this is a commonly discussed problem and someone could point me to a discussion thread?


I'm really stuck on paraphrasing the sentences bellow using gerund.        That she is so fussy is not a little unpleasant.   What surprised everybody was that he was able to do it.      Here are some of my variants:         It's not a little unpleasant of being her so fussy.   Everybody was surprised by his managing to do it.      I'm not sure if it is correct or not.


Finding element with highest value in a dictionary without using built-in functions

I recently started to learn Python and my latest assignment is to find element with highest (or lowest) value inside a dictionary which looks like:  Vals = {'a':11, 'b':10, 'c':12, 'a1':12, 'b1':13, 'c1':10, 'd':9}   My code was:  Maxm = 0  for Idx in range (0, len (Vals) - 1):     if Vals [Idx] > Vals [Idx + 1]:         Maxm = Vals [Idx]     elif Vals [Idx] < Vals [Idx + 1]:         Maxm = Vals [Idx + 1]     else:         pass   Then I received a key error. I used something similar to find maximum (minimum) in lists or tuples. I thought it might work with some modification for dictionaries.  NOTE: I can't use Python's built-in functions to find maixmum or minimum. It's unacceptable for us, you know.


Where is the User's Admin Bar Preference stored? I want it to default to off for new users

In the profile.php admin page there is a checkbox for the Toolbar: Show Toolbar when viewing site.  I can't seem to find where this option is stored in the database.  I would have thought it would be in the wp_usermeta table ... but I don't see it.  My goal is to set the default value of this to "off" for new users.  Then, of course, they would have the option to turn it on if they wanted.


how do you specify the opening of a file folder path

im trying to make a program that is password protected and once the password is entered correctly it opens a file. when i try to run the program i get a syntax error saying "EOL while scanning string literal" where i put the file path'  heres my code.  import os while True:     print("9. exit")     print("0. close")     choice = int(input("enter password: "))     choice = int(input("enter option: "))     if (choice>=1124):         if choice ==1124:                 os.starfile('C:\restriced_access\')   os.starfile('C:\restriced_access\') this is where the problem is. its supposed to open a file folder in my Windows(C:)


How to check an application's checksum or hash on Google Play?

Some free applications on Google Play are limited to the United States so the rest of the world has to use dodgy sites to get them. However the security of such sites are questionable as the apps might be modified and contain some kind of malware. Is there a way to get the SHA or MD5 hash of the apk file from the play store so it can be compared with the downloaded one to make sure that it's safe?


Evaluate the limit of $\lim_{n\to\infty}\frac{1}{n^2}\left(\frac{2}{1}+\frac{9}{2}+\frac{64}{9}+\cdots+\frac{(n+1)^{n}}{n^{n-1}}\right)$

$$\lim_{n\to\infty}\frac{1}{n^2}\left(\frac{2}{1}+\frac{9}{2}+\frac{64}{9}+\cdots+\frac{(n+1)^{n}}{n^{n-1}}\right)$$    My try:  The limit can be written as follows:  $$\lim_{n\to\infty}\left(\frac{1}{n^2}\cdot\sum_{k=1}^{n}\frac{(k+1)^{k}}{k^{k-1}}\right)$$  Evaluate the following series:  $\sum_{k=1}^{\infty}\frac{(k+1)^{k}}{k^{k-1}}$  $\frac{(k+1)^{k}}{k^{k-1}}=k\cdot\frac{(k+1)^{k}}{k^{k}}=k\cdot\left(1+\frac{k+1}{k}-1\right)^k=k\cdot\left(1+\frac{1}{k}\right)^k$  Then:  $\lim_{k\to\infty}\frac{(k+1)^{k}}{k^{k-1}}=\lim_{k\to\infty}k\cdot\left(1+\frac{1}{k}\right)^k=e\cdot\infty\neq0 \Longrightarrow \sum_{k=1}^{\infty}\frac{(k+1)^{k}}{k^{k-1}}$ diverges.  Therefore:  $$\lim_{n\to\infty}\frac{1}{n^2}\left(\frac{2}{1}+\frac{9}{2}+\frac{64}{9}+\cdots+\frac{(n+1)^{n}}{n^{n-1}}\right)=0\cdot\infty$$  What to do next?


Question on the limit of a sequence if the sum of the sequence converges

Suppose I have a sequence $\{a_i\}_{i=1}^{\infty}$. I know that $a_i \geq 0$  for all $i$ and $\sum_{i=1}^{\infty}a_i < \infty$. Can I say that  $$ \lim_{i \to \infty} a_i = 0$$  Intuitively, I think this is true. If the limit tends to a positive number, the sum would explode as well. However, I'm having a hard time proving it formally. Can I get a hint?


How to Convert Java to Python using anonymous object function and overriding a method

There were other stackoverflow  similar to this, but is not specific to my problem where I need to override a function.  I want to convert the following Java code into Python:  import Someclass;  Someclass obj = new Someclass("stringarg") {     @Override     void do(x) {       // Do extra stuff on function       super.do(x);     } }   Do I need to explicitly create a dummy class for this? Can this be converted into Python just in a single statement like this Java code?  Used: Python 2.7.6, Java 1.8  P.S. This is to be done in Jython, where Someclass is an imported Java library.  Any help would be appreciated. Thanks.  UDPATE:   For those who have same problems as mine, but the import class is an abstract class:   Thanks to DNA's , I managed to make it work by also just adding a super statement in his method like the following:      def patch(self, x):        # do something        print 'goodbye'        super(Someclass, self).do(x)      obj = type('DummySomeclass', (Someclass, object), {"do": patch})("hello")    For those whose import class is not abstract, either DNA and algrebe's code works already but also just adding the missing super:  ... super(Someclass, self).do(x)


I've been trying to install ubuntu 11.04 on Asus k50IJ notebook. All via Wubi went without problem. After a reboot, everything starts but during veryfying the installation, this error appears:     "No root system file defined"   I tried to run chkdsk because I thought there might be some HDD problems, yet nothing has been found.


Numbering in 2 Dimensional grid using beamer and dividing the slide into two halves as shown in figure

Hello,  I'm trying to number the elements in the grid as follows. I'm wondering if I can get some help. Thank you. I'm confused to write the logic.  \documentclass{beamer} \usepackage[english]{babel} \usepackage[document]{ragged2e} \usepackage{utopia} %font utopia imported \usepackage{graphicx} %package to manage images \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{blkarray, bigstrut} \usepackage[utf8]{inputenc}%codification of the document \usepackage{tikz} \usetheme{Warsaw} \usecolortheme{beaver} \usetikzlibrary{decorations.markings}  \title[Module 8]{MODULE 8 \\ Data Matrix : Generation } \author[aa]{by\\aa } % START add slide number \newcommand*\oldmacro{}% \let\oldmacro\insertshorttitle% \renewcommand*\insertshorttitle{%   \oldmacro\hfill%   \insertframenumber\,/\,\inserttotalframenumber} % END add slide number   \date  \begin{document}   %1 %Here begins the body of the document \begin{frame} \titlepage \end{frame} %13 \begin{frame} \frametitle{Re-numbered 2-D grid} \begin{center} \begin{tikzpicture}[thick,scale=0.4, every node/.style={scale=0.6}]  \draw (0,0) grid[step=2cm] (6,8); \foreach \X [count=\x] in {0,...,3}  {\foreach \Y [count=\y] in {0,...,4}  {  \ifnum\Y=0   \node[anchor=north west] at (2*\X,2*\Y) {\x};  \else   \ifnum\Y=1     {    \node[anchor=south east] at (2*\X,2*\Y) {\number\numexpr\x+4};     }  \else   \ifnum\Y=2     {    \node[anchor=south east] at (2*\X,2*\Y) {\number\numexpr\x+8};     }  \else   \ifnum\Y=3    {    \node[anchor=south east] at (2*\X,2*\Y) {\number\numexpr\x+12};     }   \else   {    \node[anchor=south east] at (2*\X,2*\Y) {\number\numexpr\x+16};   }   \fi  \fi  \fi  \fi  } } \end{tikzpicture} \end{center} \end{frame}


Prove $$\sum^{\infty}_{n=1} \frac{a_{n}-a_{n-1}}{a_{n}}=\infty$$ Where $a_{n}$ is an increasing sequence of positive terms that goes to infinity.  I tried to approach it with $\log(a_{n})$ like a classical version of this problem but i could not show that the difference with respect to the logarithm is finite. Any help or hint will be appreciated


How do I determine which application handles a global shortcut?

I have some global shortcut that does nothing apparent, but is overriding the combination in all applications. The shortcut is Command+Alt+F, which overrides the "Google Search" in Safari, and the Replace in Sublime Text 2.  Is there any way to determine which application this shortcut is actually being handled by, or what action it is triggering?


Show that the set of all $n \times n$ orthogonal matrices, $O(n)$, is a compact subset of $\mbox{GL} (n,\mathbb R)$

I have only concept in topology, metric space, and functional analysis. How do I tackle this? Also  I want to know that is the set connected?


Train a neural network for tic tac toe with a genetic algorithm

I was trying to implement a genetic algorithm for the game 'tic tac toe'. How I am doing it at the moment is the following:   Initiliaze 50 random networks Let each network play against each network. After that, each network will have played 98 games (against each player on each side) the fitness of each network is calculated this way: fitness = wins + draws -loses Apply the genetic algorithm:  5.1. Select the 5 best networks by using their fitness value.  5.2. Copy these 5 networks onto the other 45 networks. (So 10 times the first, 10 times the second...)  5.3. Change p percent of the weights with a random gaussian multiplied with a factor of s.  if(p < Random(0,1)){     weight/bias += Random.gaussian() * s; }   My values that I am using right now is:  p = 0.05 s = 0.05   And my network is making decisions the following way:     I am using a minimax algorithm with a depth of 2 (not a lot, I know).   The evaluation of the board is being done by the network.   My problem right now is that it does not work as expected. When I play against it afterwards, it usually does stupid moves and let's me win or does not win itself when I let it.  I am very happy if someone could help me with this one.  Greetings, Finn


I changed ownership away from root in /usr/local/bin and in /usr/bin.  However, now I am unable to use sudo. The message I get when trying to use sudo is:  sudo: /usr/bin/sudo must be owned by uid 0 and have the setuid bit set   I have looked online and have tried the solutions using chown but nothing works.  When I type this command:  ls -l /usr/bin/sudo   I get the output:  -rwsr-xr-x 1 swirlydino root 136808 May 29 06:32 /usr/bin/sudo   Also when I type this command:   ls -ld /usr /usr/bin   I get this output:  drwxr-xr-x 10 root  root  4096 Jun 14 10:15 /usr drwxr-xr-x  2 datax root 36864 Aug 18 14:26 /usr/bin   So, how can I change back the ownership from swirlydino to root?


Consider $Z=(Z_1,\ldots,Z_n)^T\sim N(\mu,V)$ with $\mu=(\mu_1,\ldots,\mu_n)^T$ and $V=\text{Cov}(Z)$. Show that for $d\in\mathbb{R}^n$ it is      $$ d^TZ\sim N(d^T\mu,d^TVd). $$      For me it is not clear how to show that $d^TZ$ is multivariate normal distributed. If that would be the case then because of $$ E(d^TZ)=d^TE(Z)=d^T\mu $$ and $$ \text{Cov}(d^TZ)=d^T\text{Cov}(Z)(d^T)^T=d^T\text{Cov}(Z)d $$ everything would be shown.    I've read that $d^TZ$ is multivariate normal distributed exactly then when for each $b\in\mathbb{R}$  $$ bd^TZ $$ is univariate normal distributed.  So I choose an arbitrary $b\in\mathbb{R}$ and would have to show that $$ bd^TZ=\sum_{i=1}^{n}bd_iZ_i~~~(*) $$ is univariate normal distributed. If the $Z_i$ were independent then it would be clear because a linear combination of independent univariate normal distributed random variables is itself univariate normal distributed.  But here the $Z_i$ are not independent, what to do now to show that (*) is univariate normal distributed?


How do I generate random numbers between a range in cells?

I'm wanting to create a button that generates a string of 10 random numbers into cells, and pulls the range for these random numbers from, for instance, in B1 and B2. Basically, I'm looking to use the INDIRECT() function in VBA. Is there a way to do this?


Why the letter "g" discrepancy between *giant* and *gigantic*?

A little look through an etymology dictionary shows that the root is Latin gigas with adjective form gigant.  So in its derivation to English, why did the second "g" get retained in gigantic but was dropped from giant?  I have an inkling that the word giant may have travelled through French on its way to English, where it may have been pronounced "gee-yant" or "jee-yant" with a change to the second "g" that was then dropped when taken into English.  However, the "g" is retained as a hard "g" in gigantic.


I learned today in class that photons and light are quantized.  I also remember that electric charge is quantized as well.  I was thinking about these implications, and I was wondering if (rest) mass was similarly quantized.  That is, if we describe certain finite irreducible masses $x$, $y$, $z$, etc., then all masses are integer multiples of these irreducible masses.  Or do masses exist along a continuum, as charge and light were thought to exist on before the discovery of photons and electrons?  (I'm only referring to invariant/rest mass.)


Where to put my file of personal macros (TeXShop)

I just got a new MacBook and downloaded TeXShop, and I have a file full of macros and stuff I want to put in the place where TeXShop looks for it so I can input it into every document without having a massive preamble. I successfully did this on my previous computer!   But now I can't figure it out again, and my googling is not giving useful results.    Specifically, I read that I need a folder in my Library called texmf/tex/latex and I should put my stuff in there.  When I do that, TeXShop tells me it can't find the file.  All advice appreciated!


I plug in the printer, the system recognizes it, but when I try to print something nothing happens.   OS: Ubuntu 18.04 LTS


How to change scoreboard score if player does not have item in his inventory?

I want to make a killstreak award system. for that I need to be able to make a player choose to use his killstreak points to get an ability/potion effect or open a certain gate.  I wanted to make the player use a bottle of enchanting to get to level 1 and then make a commandblock test for those players and execute the killstreak ability and then reset the system.  But what if the player does not reach level 1. what if another player gets the XP from the bottle.  Is there a more secure way to acheve the remote activation of a command block for a certain player? Do I have to use a scoreboard variable?  EDIT: I tried to setup a way to see if players are not having a custom named item in their inventory (if they dropped it) and then according to that, preform an action.  I got to the point in which I can tell if none of the players have that item (Red command blocks), kill the item if they throw it on the ground (Yellow + Blue command blocks) and give the item back to the player who has a score for objective execute of 1.    Commands used in the command blocks: one row for each item (TNT called:"Choose Class" and TNT called:"Launch Killstreak")   RED: clear @a minecraft:tnt 0 0 {display:{Name:"Choose Class"}} BLUE: testfor @e[type=Item] {Item:{id:"minecraft:tnt",tag:{display:{Name:"Choose Class"}}}} YELLOW: kill @e[type=Item] {Item:{id:"minecraft:tnt",tag:{display:{Name:"Choose Class"}}}} GREEN: give @a[score_execute_min=1] minecraft:tnt 1 0 {display:{Name:"Choose Class",Lore:[Change your class when you get killed]}} WHITE: Command to set the score of execute,a scoreboard objective, to 1 for all players that don't have the item in their inventory.   Now the problem is that I don't know how to give a point to a scoreboard objective of a player does not have the item in his inventory. How do I do that?


I ran recently top and see that fwupd is taking more than 200% CPU whole the time. Can any one say what this firmware update is and what should i do to make him leave the CPU? I am on 16.04.


Partially Ordered Set that is NOT a lattice?

So, I'm looking at partially ordered sets and lattices and I can find a ton of examples of sets that are lattices, but I cannot find any examples of a partially ordered set that is NOT a lattice. What would be an example of a partially ordered set that is not a lattice?


Why "Multiple definitions linker error" when nm only sees one definition

When linking some object files together I get a bunch of errors like:  obj-ia32/ShadowRoutine.o: In function `InitializeMap(unsigned int*)': ShadowRoutine.cpp:(.text+0x0): multiple definition of `InitializeMap(unsigned int*)' obj-ia32/ShadowRoutine.o:ShadowRoutine.cpp:(.text+0x0): first defined here   with compilation and linking commands of:  g++ -DBIGARRAY_MULTIPLIER=1 -Wall -Wno-unknown-pragmas -fno-stack-protector \     -DTARGET_IA32 -DHOST_IA32 -DTARGET_LINUX  -I../../../source/include/pin \     -I../../../source/include/pin/gen -I../../../extras/components/include \     -I../../../extras/xed-ia32/include -I../../../source/tools/InstLib -O3 \     -fomit-frame-pointer -fno-strict-aliasing -Wno-unused-variable \     -Wno-unused-function -I. -Ishadow-memory -m32 -c \     -o obj-ia32/ShadowRoutine.o ShadowRoutine.cpp g++ -DBIGARRAY_MULTIPLIER=1 -Wall -Wno-unknown-pragmas -fno-stack-protector \     -DTARGET_IA32 -DHOST_IA32 -DTARGET_LINUX  -I../../../source/include/pin \     -I../../../source/include/pin/gen -I../../../extras/components/include \     -I../../../extras/xed-ia32/include -I../../../source/tools/InstLib -O3 \     -fomit-frame-pointer -fno-strict-aliasing -Wno-unused-variable \     -Wno-unused-function -I. -Ishadow-memory -m32 -c \     -o obj-ia32/Jikes.o Jikes.cpp g++ -shared -Wl,--hash-style=sysv -Wl,-Bsymbolic \     -Wl,--version-script=../../../source/include/pin/pintool.ver \     -m32 -o obj-ia32/Jikes.so obj-ia32/ClientReq.o obj-ia32/Server.o \     obj-ia32/ShadowRoutine.o obj-ia32/FncnMap.o obj-ia32/Trace.o \     obj-ia32/Jikes.o obj-ia32/ClientReq.o obj-ia32/Server.o \     obj-ia32/ShadowRoutine.o obj-ia32/FncnMap.o obj-ia32/Trace.o \     -L../../../ia32/lib -L../../../ia32/lib-ext -L../../../ia32/runtime/glibc \     -L../../../extras/xed-ia32/lib \     -L/home/karl/r/git/pin/source/tools/Jikes/zmq/inst/lib \     -lpin -lxed -lpindwarf -ldl -lzmq   The only two object files with InitializeMap are Jikes.o and ShadowRoutine.o:  $ nm obj-ia32/Jikes.o  | grep InitializeMap          U _Z13InitializeMapPj $ nm obj-ia32/ShadowRoutine.o | grep InitializeMap 00000000 T _Z13InitializeMapPj $ nm obj-ia32/* | grep InitializeMap          U _Z13InitializeMapPj 00000000 T _Z13InitializeMapPj   So why am I getting "multiple definitions of InitializeMap" if it's only "defined" in one object file and "undefined" in the only other object file that required it using extern?  This is what the declarations, definitions, and uses look like:  $ grep -r InitializeMap * Jikes.cpp:  if (rtn_name == "sysInitializeMap") {       RTN_INSERT_1(InitializeMap); Binary file obj-ia32/Jikes.o matches Binary file obj-ia32/ShadowRoutine.o matches ShadowRoutine.cpp:VOID InitializeMap(ADDRINT *smID) { init_map(*(int*)smID); } ShadowRoutine.hpp:VOID InitializeMap(ADDRINT *smID);   where both the cpp files #include "ShadowRoutine.hpp".  EDIT: My question is why does the linker command (the third g++ command in the second code snippet above) not work even though nm says that the function is only defined in the text of ShadowRoutine.o and undefined in Jikes.o?


How to determine the direction of induced current flow?

There are three ways of inducing current in a loop/coil of wire as shown in my book. We can have a magnet approach a coil of wire, or a wire approaching a magnet. Both can be understood in the same way.    On the other hand, we can also change the magnetic flux by pushing a loop of wire into a magnetic field.    This confuses me. Two vertical lines are cutting across the field. But since they are connected, the induced current, I conjecture, would cancel each other.  I saw in a YouTube video that to determine the direction in such situations as 2, one curl the fingers of their right hand along the wire, with the thumb pointing in the direction of the field. So the curled fingers are in the direction of the current. Basically the directions of current indicated by the thumb is always opposite the direction of the changing field.


I want to export materials from my object so that for example in unity I can open it, add lighting and that it actually changes according to the lighting. So basically i want to export my materials with the bumps, reflections and transparancy. I made it in cycles.


How did Harry get the Sword of Gryffindor back after he had given it to Griphook to get Hufflepuff's Cup?

How was Harry Potter able to get the Sword back after giving it to Griphook in exchange for him getting Harry into the Vault to get Hufflepuff's Cup?


consequences of `sudo rm` apps that shipped with the OS (like Photos, Messages, Mail)

I've got numerous OSes installed on my Macintosh laptop for certain reasons. So I'd like to be as lightweight in my OS X as possible. What are the consequences of sudo rm -rf'ing  the following application that are allegedly unmodifiable/deletable because it’s required by OS X?  I am not a photographer so I don't really need  Photos.app Maps.app "Image Capture.app" "Photo Booth.app"   For communication I use emails mainly and I much prefer mutt so I'd like to get rid of  Mail.app Messages.app Contacts.app   I use vim mainly (and atom & Xcode occasionally) so I'd also like to get rid of   TextEdit.app Notes.app "Utilities/Script Editor.app"   I also don't see myself ever using  Calculator.app Calendar.app Dashboard.app "DVD player.app" "Game Center.app"  iBooks.app Reminders.app Stickies.app "Time Machine.app"   These are what I use OS X mainly for    iOS development (sometimes) Web development: mainly to test browser compatibility Updating the firmware   So would I break anything important if I delete all the applications mentioned above?


Object glitching/dissapearing in render due to parenting problems

I have completed my animation but I realised when I render it that one of the propellers blades starts to glitch. On some frames it is in shot and some it is out of shot and this is really strange. These 'blades' are both parented to the same 'propeller' and the 'propeller' is parented to the middle ball. I have baked the animation through so this shouldn't be a problem. These propellers are passive rigid bodies. I have tried to figure out this problem and I just can't get to a solution. I've never had it where a rigid body object glitches out like that in the rendered animation, it's almost like it's jumping, which on the render these frames show the object as invisible. The video attached will show.   If anyone has experienced problems like this or knows an answer to my dilemma that would be greatly appreciated, thanks!


Showing there are no nontrivial ring homomorphisms from $\mathbb{Z}\to\mathbb{Z}$

I have:  If $\phi:\mathbb{Z}\to\mathbb{Z}$ is a homomorphism, then $f(1)=f(1\ast1)=f(1)\cdot f(1)$. Then $$0=f(1)\cdot f(1)-f(1)=f(1)\cdot\left[f(1)-\epsilon\right]$$ implies that $f(1)=0$ or $f(1)=1$, since there are no zero-divisors in $\mathbb{Z}$.  How should I show that this leads to the fact that $\forall x\in\mathbb{Z}$, we have $f(x)=0$ or $f(x)=x$?


I know I need to have (although I don't know why) a GROUP BY clause on the end of a SQL query that uses any aggregate functions like count, sum, avg, etc:  SELECT count(userID), userName FROM users GROUP BY userName   When else would GROUP BY be useful, and what are the performance ramifications?


Approximation algorithms for min vector subset-sum over GF(2)

In  vzn asked about the following problem, which I'll call Vector-Subset-Sum.     Given a set of vectors $v_i$ over GF(2) and a target vector $y$, is there a subset of the $v_i$ summing to $y$?   In the answers, comments, and referenced papers I noted   The decision problem is in P. The natural minimization problem (finding the smallest subset) is NP-hard. It's related to the problem of finding sparse codewords in a linear code.   My question is: are there any known polynomial-time approximation algorithms for the minimization problem in (2)? I know very little about coding theory, so there may be some obvious or well-known approximation-preserving reductions to (3) that I have not seen.


Book with a female main character and a male protector after a nuclear or chemical fallout

I thought it was a Stephen King book but I can't find it in his list. I can't remember the exact plot but I know the main character and her protector, as well as many humans, developed growths on their bodies, after time the growths eventually break off and reveal they were transformed, specifically one of the bad guys of the book is turned into this lizard/snake thing as he is very manipulative towards people; the transformations are meant to reflect their inner personality. The girl's growths reach the point where she can barely see and breathe, but when they break off she has some kind of aura or something and inspires those around her. I'm not sure about the cover, the year would have been late 90s, early 2000s, and it was a known book at that time.


Applying for phd with flunked course in master

Well, here's the thing. I'm a 2nd year ME master but enrolled in a CSE course and got flunked. So up to now, I enrolled 8 course in my first year (4+4). Without the failed course, I get GPA 3.52 for the rest seven courses. My GPA drops to 3.0, if that course is included. So I plan to take one more course to balance my GPA in this semester. Actually, I feel confident about the courses in this semester.  Meanwhile, I'm gonna apply for phd in this semester. So how will the failed course affect on my application for phd? Am I supposed to submit transcript with 7 or 8 courses?


Should toggling icon indicate current status or new status?

I'm working on a data-mgmnt app and came across this deeply philosophical question: I have an icon to represent if a record is locked or not. And if the record is not locked, it can be locked by clicking on that icon. In the same way, if the current user is the locking user, he can unlock the record by clicking that icon.  Now the question is: should the icon for unlocked records be an icon of an open lock or a closed lock? In other words: should it represent the current status or the action it will trigger???


I am trying to install python 3.6 idle. I have used sudo apt-get install python3.6 but keep getting the same error:  Reading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package python3.6 E: Couldn't find any package by regex 'python3.6'   Please help


I want to rent a program in Python but I don't want my customers to see the source code I made.  So, how do I let them run the file without seeing the source code? I was thinking about python-crypto AES But it requests a password to decrypt the code to run it, so.. any ideas?


Is there a way to stop the vertical spread of multiple super- and sub-scripts?

I'd like to be able to place multiple sub and superscripts (in maths mode) on an element without having them expand vertically.  That is, so that in the output of ${x^2_4}^6_8$, the 2 and 6 were aligned, as were the 4 and 8 (obviously, I'd expect to do this with a macro rather than the super- and subscript commands).  As a bonus, it'd be nice to be able to control whether or not this appeared like $x^{26}_{48}$ or $x^{2\phantom{4}6}_{\phantom{2}4\phantom{6}8}$.  And it would be nice to truly be able to do this incrementally, so that each subscript or superscript could be added without having to know all the previous ones (useful for adding stuff via macros).  Simply writing $x^2_4{}^6_8$ wouldn't work as the latter super and subscripts wouldn't know the difference between x and X and ∏.  (see also )


How do I combine 5 pdf documents I created in Word and put in one pdf file? I have tried several things, none of which work.


About definite article before "Earth", "Moon" and "Sun"

In what cases do we have to put the definite article the before each of these words:   Sun Moon Earth   and in what cases do we not need to?


So I've set public IP on the hosts file for a certain public IP address, but it picks up private ip from nowhere or from DNS.       Content of windows hosts file C:\Windows\System32\drivers\etc\Hosts             210.210.210.10 my.domain.com     nslookup my.domain.com             10.10.10.10             10.10.10.11             10.10.10.12   I want it to resolve to Public IP i assigned in the file, instead of the private IP it shows when I lookup my.publicdomain.com.   Anyway to fix this? Has anyone experienced such issue? ipconfig /flushdns does not help. Just saying.


Theorem : The number of bitstrings with the length $x$ that begin with $1$ and/or end with $0$ is  $3 \times 2^{x-2}$.  I know there are easier ways to prove this but I must figure out how to do it with induction.


Our two-year ESTA will expire on the plane journey home to Australia. Will this be considered OK at point of entry?


What is the real answer for this geometric series?

I recently read a book about Data structures, int that book I found this equation under topic, "the average number of probes for an unsuccessful search":        but when I was trying to prove this I found another expression, here is how I tried:                So my proof led me to this equation    So what did I do wrong, I can't find any error above?  Or Am I right?


What is year and model of my Diamondback?

I have a Diamondback frame I'm guessing around 1984 or 85 serial # F4042789


I watched a tv show, a quiz program, the name of the program is "Who wants to be a millionaire". Well I don't want to be a millionare, at least not right now, but the title always makes me curious somehow, I thought the correct sentence would be "Who does want to be". What are their differences then ?


What is the symbol ''$\divideontimes$'' (DIVIDE TIMES) for?

I looked "$\divideontimes$" up on Google and now I know that it's Unicode U+22c7 but when would it be used?  I am guessing that $5 \divideontimes 5 = 25$ and $1$...?


Application of Pigeonhole Principle - non-constructive

Claim: every sequence of $m^2 + 1$ distinct numbers has an increasing or decreasing subsequence of length $m+1$.  Proof:  Idea  Associate every position $ 1 <= l <= m^2 +1 $ with a pair of lengths of longest increasing (decreasing) subsequences $(i_{l}, d_{l})$ beginning at position $l$.  ==> Assume claim is false.  ==> There are at most $ m^2 $ pairs $(i_{l}, d_{l})$ that can occur  ==> $m^2+1 - m^2 = 1$ ==> $1$ pair two indices $s < t$ with an equal $(i,d)$ pair.  ==> Since numbers are distinct. 2 cases          If $a_s < a_t$:         Then  longer subsequence $ i_{t} $ can be built with sequence up to $s + a_s + a_t$ sequence contradicting that pairs are equal.  ==> Analogous for $a_t < a_s$      ==> Claim is true  My problem is seeing how one goes from Claim is false to There are at most $m^2$ pairs that can occur.


Prove $S \doteq \sum_{n=1}^{\infty} p_n  0$ assuming $0 \leq p_n < 1$.

Prove $S \doteq \sum_{n=1}^{\infty} p_n < \infty \to \prod_{n=1}^{\infty} (1-p_n) > 0$ assuming $0 \leq p_n < 1$.  : Show that $S < 1 \to \prod_{n=1}^{\infty} (1-p_n) \geq 1 - S$.    Assuming the hint is true:  If $S \geq 1$ but $S < \infty$, then $\exists k \in \mathbb{N}$ s.t. $\sum_{n=k}^{\infty} p_n < 1$.  Define $T \doteq \sum_{m=1}^{\infty} q_m = \sum_{n=k}^{\infty} p_n < 1$ where $q_1 = p_k, q_2 = p_{k+1}, ...$  By hint, $T \doteq \sum_{m=1}^{\infty} q_m < 1 \to \prod_{m=1}^{\infty} (1-q_m) > 0 \to \prod_{n=k}^{\infty} (1 - p_n) > 0 \to \prod_{n=1}^{\infty} (1 - p_n) > 0$ (a reason why $p_n < 1$, I guess)  QED  Is that right?


How to test a batch that executes based on CaseHistory records?

I have written a batch class that updates a field on Case object with the owner name which is assigned by Case assignment rule. When I try to test this batch class, a part of the code which runs after case history retrieval , is not covered. Could it be because of the delay in case assignment rule that there is no history record? How to overcome this issue? Any suggestions appreciated.


Can I use bpy load big .blend file gradually? My 3D format file are always several Gbs big. If load whole file all at a single time, it takes time.


Proving that $9$ is a divisor of $x \in \Bbb N$ if the sum of digits of $x$ is divisible by $9$.

Suppose x is a positive integer with $n$ digits, say $x = d_1d_2d_3\ldots d_n.$ If $9$ is a divisor of $d_1 + d_2 + \ldots d_n$, prove then $9$ is a divisor of $x$.  My attempt: suppose $x = 4518.$ Therefore $d_1 = 4, d_2 = 5, d_3 = 1, d_4 = 8$ those added together equals $18$, where $9$ is a divisor.   With that in mind $4518$ can be written as $4000 + 500 + 10 + 8.$ How do you show that $9$ is a divisor of this entire number from the information given?


get emacs to automatically use biber instead of bibtex

I was reading the question titled .  In that question, user @PLK mentions that as of auctex 11.87, auctex should automatically check if you are using biblatex and if so, switch to using biber.  I have auctex 11.87 installed and running, but I am not getting this automatic switching behavior.    Say I have two files (borrowed from ).  test.tex  \documentclass{article} \usepackage[backend=biber]{biblatex}  \addbibresource{test.bib} \defbibheading{bibliography}{}  \begin{document}     \nocite{*}     \subsection*{Journal Publications:}     \printbibliography[type=article]      \subsection*{Conference Publications:}     \printbibliography[type=inproceedings]  \end{document}   and test.bib  @ARTICLE{abc,   author = {A Author},   title = {the article title},   journal = {the journal},   year = {2012},   volume = {1},   pages = {1--2},   number = {1},   month = {1},   doi = {1234/5678} }  @INPROCEEDINGS{def,   author = {A Author},   title = {the proceeding title},   journal = {the conference},   year = {2012},   volume = {1},   pages = {11--12},   number = {1},   month = {1},   doi = {5678/1234} }   If I run the following commands:  pdflatex test.tex biber test pdflatex test.tex   I end up with a properly processed document.  In emacs, when I press C-c C-c and select the BibTeX command, emacs runs bibtex test instead of biber test.  I am then greeted with errors about no \citation \bibdata or \bibstyle commands.  My bibtex-dialect variable is automatically getting set to biblatex, LaTeX-biblatex-use-Biber is set to t, TeX-command-Biber is set to Biber, but for some reason TeX-command-BibTex variable is still set to BibTeX.  Should this automatically get changed to Biber?  Do I have to set it using a local variable?  Is this a bug, or am I doing something wrong?  EDIT  According to  in the AUCTeX 11.87 manual:      In case you use biblatex in a document, AUCTeX switches from BibTeX to Biber for bibliography processing.   So I feel like this automatic switch should already be happening.


How to clone a bootable Ubuntu USB stick into a larger one?

I have a bootable 32 GB Ubuntu USB stick with persistent storage.  The 32 GB USB stick is getting full, so I want to clone it into a 64 GB USB stick and increase both the casper-rw and the usbdata partition.  How can I do it without losing any data?  Here is how I cloned the 32 GB USB stick into the 64 GB USB stick. First, I issued the following command:  lsblk   and got this result:   Second, I used the DD command:  sudo dd if=/dev/sdb of=/dev/sde status=progress   Third, I powered-off the computer, removed the 32 GB stick and powered on the computer. The system booted correctly from the new USB stick and it seems that all the files are there.  Forth, I loaded the GParted utility and here is the snapshot:   Now back to my original question: How do I proceed in order to increase the casper-rw and usbdata partitions using the free/unallocated space without losing any data?


Shrinking or splitting some equations in a group of equations

I have a group of equations, such as  /begin{gather} Eq1 // Eq2 // Eq3 // Eq4 /end{gather}   Unfortunately, some of the equations in the group are too long to fit on the page.  For equations that are only slightly too long, is there a way to slightly decrease the font size of that equation only?  For equations that are much too long, is there any automated way to split the equation (where the computer decides where and how to split it to fit the page width), or would this split need to be defined by the user?  Thank you, Kevin  P.S.  Here is my code where the matrix is too wide and goes off the end of the page:  \documentclass{article} \begin{document} \[ \mathbf{L} = \left[ \begin{array}{*{6}{c}} {{L_S}}&{ - {L_{SS}}}&{ - {L_{SS}}}&{M\cos \theta }&{M\cos \left( {\theta  +       \frac{{2\pi }}{3}} \right)}&{M\cos \left( {\theta  - \frac{{2\pi }}{3}}   \right)}\\ { - {L_{SS}}}&{{L_S}}&{ - {L_{SS}}}&{M\cos \left( {\theta  - \frac{{2\pi }}{3}} \right)}&{M\cos \theta }&{M\cos \left( {\theta  + \frac{{2\pi }}{3}} \right)}\\ { - {L_{SS}}}&{ - {L_{SS}}}&{{L_S}}&{M\cos \left( {\theta  + \frac{{2\pi }}{3}} \right)}&{M\cos \left( {\theta  - \frac{{2\pi }}{3}} \right)}&{M\cos \theta }\\ {M\cos \theta }&{M\cos \left( {\theta  - \frac{{2\pi }}{3}} \right)}&{M\cos \left( {\theta  + \frac{{2\pi }}{3}} \right)}&{{L_R}}&{ - {L_{RR}}}&{ - {L_{RR}}}\\ {M\cos \left( {{\theta} + \frac{{2\pi }}{3}} \right)}&{M\cos \theta }&{M\cos \left( {\theta  - \frac{{2\pi }}{3}} \right)}&{ - {L_{RR}}}&{{L_R}}&{ -     {L_{RR}}}\\ {M\cos \left( {{\theta _2} - \frac{{2\pi }}{3}} \right)}&{M\cos \left( {{\theta _2} + \frac{{2\pi }}{3}} \right)}&{M\cos \theta }&{ - {L_{RR}}}&{ - {L_{RR}}}&{{L_R}} \end{array}\right] \] \end{document}


For what value of $f(x)$ the given integral equation have solution

let the integral equation is  $$\phi (x)-\frac{e}{2}\int_{-1}^{1}xe^{t}\phi(t)dt=f(x)$$  then  1).there exist a continous function $f:[-1,1]\to (0,\infty)$ for which solution exist. 2).there exist a continous function $f:[-1,1]\to (-\infty,0)$ for which solution exist. 3).for $f(x)=e^{-x}(1-3x^2)$ ,a solution exist 4).for $f(x)=e^{-x}(x+x^3+x^5)$ ,a solution exist  how to solve this question ,i can only solve simple questions in integral equations but this very tough , $\text{EDIT}$ After so much of reading of integral equation,i try to solve the question $\textbf{the solution i tried}$-$$\phi (x)=\frac{e}{2}\int_{-1}^{1}xe^{t}\phi(t)dt+f(x)$$ $$\phi (x)=\frac{e}{2}x\int_{-1}^{1}e^{t}\phi(t)dt +f(x)$$ $$\phi (x)=\frac{e}{2}xC+f(x)    \;\;\;\;\;\;\;....1$$ where $C=\int_{-1}^{1}e^{t}\phi(t)dt$ $\textbf{from (1)}$ $$C=\int_{-1}^{1}e^{t}(\frac{e}{2}tC+f(t))$$ $$C=\int_{-1}^{1}e^{t}\frac{e}{2}tCdt+\int_{-1}^1 e^tf(t)dt$$ $$C=\frac{e}{2}C\int_{-1}^{1}e^{t}tdt+\int_{-1}^1 e^tf(t)dt$$ further doing calculation i get $$C=C+\int_{-1}^1 e^tf(t)dt$$ $$\implies \int_{-1}^1 e^tf(t)dt=0$$ after that i pick the option  'c' and 'd' and they satisfied the integral so they are sutiable for $f(x)$ and my option are also right but still don't know how to work for option 'a' and 'b' please help. Thankyou


recompute mean and standard deviation adding observed data to my sample

I need your help in order to clarify a doubt...I have two samples:  sample $A$ with mean $\mu_A$ and standard deviation $\sigma_A$   sample $B$ with mean $\mu_B$ and standard deviation $\sigma_B$   I know the observed values from the sample $B$ but I don't know anything on sample $A$, is there a way to find mean and standard deviation of the combined sample $A \cup B$ ?  We can assume that the two samples are i.i.d within and between them, so I think I can compute:  $\mu_{A \cup B}$ = $\mu_A + \mu_B$  $\sigma_{A \cup B} = \sqrt{\sigma_A + \sigma_B}$  am I right? Thank you!!!


Can I say "Coming!" for "I am coming!", and why?

In some languages we can remove the subject (and sometimes a verb too) from a sentence. In Toy Story 3, the kid says "Coming!" instead of "I am coming!" to her mother.  My questions are:   1.) Can I say "Coming!" instead of "I am coming!" in English? 2.) If I can, when can I remove the subject and verb? 3.) And would this be considered standard English?   (NOTE: The OP is asking about "ellipsis of subject pronoun + auxiliary", which is a topic that comes up often on grammar and linguistics forums/sites. It is a good question. -- F.E.)


What is the term used for people who drive slowly?

I have heard terms like bikers, racers and car racers used for the people who drive quickly. But what are people called who drive slowly, or at normal speed, or very slowly (for old people who drive really slowly)?  Drivers cannot be use specifically for them as it denotes everybody.  So is there any particular term for these people?


"remap" (probably wrong word) my /opt folder?

Long ago when I setup my Linux server, I installed the OS on a rather small SSD having intended on keeping all the large data on NAS drives.  I didn't realize  my /opt folder would get so large.  It is on the small SSD.  Is there a simple way for me to "remap" that folder so that i don't have to go make any changes in programs that may reference it, but so that it is now physically residing on my larger drive?  Sorry if this is a dumb Q.  I know a very narrow scope regarding Ubuntu :)


how do you do hasClass on a dynamic item

on click event for a dynamically created item is something like this.  $('.static_parent').on('click','a', function () {  bur now Im trying to see if a element has a class, but its on a dynamic items. I tried a few variations of this but cant get it to work.  $('.input-group',this).hasClass('open') but surely the on will need to play a role in some way... or not?  I have multiple occurrences of .input-group and each has a dropdown where is class of open is added on click.  But what I dont get is how to test hasClass on the dynamic added dropdown.  Maybe a variation of this  $(document).on( 'click', '.button', function(e){     var $button = $(this);     var $menu = $button.closest('.menu');     e.stopPropagation();      // Close others-assumed you want all menus closed     $('.menu').not($menu).removeClass('open');       // Toggle target open/close     $menu.toggleClass('open');      $(document).on('click', function(e){         //This function will only run when e.target isn't a button         //Your $target.is($menu.find('button')) will always be false          if( $menu.hasClass('open') ){             $menu.removeClass('open');         }     }); });


Deriving formula for partial sum of power series

I have the sum $$\sum_{i=0}^n i\cdot a^i$$ and according to wolframalpha, the partial sum evaluates to  $$ \frac{a (n\ a^{n + 1} - (n + 1) a^n + 1)}{(a - 1)^2}.$$ How does one arrive at the above formula? The usual trick of expanding the sum and subtracting partial sums to arrive at a closed form doesn't seem to work here.


How do I create a Mac bootable USB drive using Windows?

My MBA 2012 with OS X 10.9.4 Mavericks won't boot anymore - it simply freezes after the initial jingle. I already tried resetting NVRAM and SMC, but to no avail. I don't have any time machine backups.  However, I still have a disc image of Mavericks sitting on an external hard drive, a USB stick and access to a notebook with Windows 7.   I haven't yet found any tutorial on how to create a bootable USB drive on Windows in order to reinstall OS X on my beloved Macbook Air.  Any help would be greatly appreciated!


what does this command do? cat f1 f2 .. > f1

f1 and f2 are two files, I want to know what does this two commands in linux,  cat f1 f2 .. > f1 and       less f1 f2 …>f2 . I dont have linux in my computer to test them.


What's a way to implement a flexible buff/debuff system?

Overview:  Lots of games with RPG-like statistics allow for character "buffs", ranging from simple "Deal 25% extra damage" to more complicated things like "Deal 15 damage back to attackers when hit."  The specifics of each type of buff aren't really relevant.  I'm looking for a (presumably object-oriented) way to handle arbitrary buffs.  Details:  In my particular case, I have multiple characters in a turn-based battle environment, so I envisioned buffs being tied to events like "OnTurnStart", "OnReceiveDamage", etc.  Perhaps each buff is a subclass of a main Buff abstract class, where only the relevant events are overloaded.  Then each character could have a vector of buffs currently applied.  Does this solution make sense?  I can certainly see dozens of event types being necessary, it feels like making a new subclass for each buff is overkill, and it doesn't seem to allow for any buff "interactions".  That is, if I wanted to implement a cap on damage boosts so that even if you had 10 different buffs which all give 25% extra damage, you only do 100% extra instead of 250% extra.  And there's more complicated situations that ideally I could control.  I'm sure everyone can come up with examples of how more sophisticated buffs can potentially interact with each other in a way that as a game developer I may not want.  As a relatively inexperienced C++ programmer (I generally have used C in embedded systems), I feel like my solution is simplistic and probably doesn't take full advantage of the object-oriented language.  Thoughts?  Has anyone here designed a fairly robust buff system before?  Edit: Regarding Answer(s):  I selected an answer primarily based on good detail and a solid answer to the question I asked, but reading the responses gave me some more insight.  Perhaps unsurprisingly, the different systems or tweaked systems seem to apply better to certain situations.  What system works best for my game will depend on the types, variance, and number of buffs I intend to be able to apply.  For a game like Diablo 3 (mentioned below), where nearly any bit of equipment can change a buff's strength, the buffs are just character stats system seems like a good idea whenever possible.  For the turn-based situation I'm in, the event-based approach may be more suitable.  In any case, I'm still hoping someone comes along with a fancy "OO" magic bullet which will allow for me to apply a +2 move distance per turn buff, a deal 50% of damage taken back to the attacker buff, and a automatically teleport to a nearby tile when attacked from 3 or more tiles away buff in a single system without turning a +5 strength buff into its own subclass.  I think the closest thing is the answer I marked, but the floor is still open.  Thanks to everyone for the input.


After migrating account with Mojang, where are my new/current saves?

Recently I migrated my account on Minecraft.net.  I had two worlds/saves before migration called 'Exile' and 'TEST world'.      A little after I migrated, I deleted 'Exile' and 'TEST world', and started a new world/save called 'Village on the Green'. Today, I went in my saves to check out my files for ADMIST related purposes.  'Village on the Green' wasn't in the saves, but my old maps 'Exile' and 'TEST' world were, even though I had deleted them.   I don't care about the latter, I think I get whats going on there. The problem is that since migration, I cannot find my current worlds/saves.     Where are they at? Is there still local content for my current worlds in a file somewhere, or does Mojang hold onto all of the data now?   4/4/2013 EDIT: Most likely location conflict.


Can not install brackets from .deb file.  Please help someone.     Its solved.


Is the cube root of a prime number rational?

The question is: if $P$ is prime, is $P^{1/3}$ rational?   I have been able to prove that if $P$ is prime then the square root of $P$ isn't rational (by contradiction) how would I go about the cube root?


Formal proof for $q \land \neg q \vdash r \land \neg r$

Having some issue with some logic. The question is to formally prove;  $$q \land \neg q \vdash r \land \neg r$$  I've never done this before so would appreciate some help with it. No idea really where to start as $r \land \neg r$ doesn't exist on the left hand side of the equation. I guess I break down the left hand side first but then I don't know where to go.   Would really appreciate any help anyone can provide.  Thanks.  Update  Have attempted it myself but still not sure what to do. With the first part of the formula $q \land \neg q$ ... do I declare this as false? Really have no idea where to go with this, other than deducting the $q \land \neg q$ apart.   Would really appreciate some help on this.   Thanks.


Strange Unresolved external symbol errors (LNK2019)

I am trying to make a simple linked list, and I came across a LNK2019 when I started to add code to my main function. It was compiling before, but when I added code to my main, I got several errors. I have all my header files included in my main CPP file, and I checked for circular includes. I haven't used C++ in a while, so sorry if this seems obvious. I went with the precompiled headers option when I made the project, if that means anything. What am I messing up?  Errors:  1>RandomCPP.obj : error LNK2019: unresolved external symbol "public: __thiscall List<int>::List<int>(void)" (??0?$List@H@@QAE@XZ) referenced in function _wmain 1>RandomCPP.obj : error LNK2019: unresolved external symbol "public: __thiscall List<int>::~List<int>(void)" (??1?$List@H@@QAE@XZ) referenced in function _wmain 1>RandomCPP.obj : error LNK2019: unresolved external symbol "public: void __thiscall List<int>::add(int const &)" (?add@?$List@H@@QAEXABH@Z) referenced in function _wmain 1>RandomCPP.obj : error LNK2019: unresolved external symbol "public: int * __thiscall List<int>::get(int)const " (?get@?$List@H@@QBEPAHH@Z) referenced in function _wmain   List.h:  #pragma once #include "ListNode.h"  template<class T> class ListNode;  template<class T> class List { public:     List<T>();     ~List<T>();      void add(const T&);     void insert(int, const T&);     void clear();     bool isEmpty() const;     T* get(const int) const;     int getLength() const;      void foreach(void(*foo)(T)) const;      T* operator[](const int index) const;  private:     ListNode<T>* firstElement;     ListNode<T>* lastElement;      //Utility     ListNode<T>* getNewNode(const T&);     ListNode<T>* getNode(int index) const; };   ListNode.h:  #pragma once  template<class T> class List;  template <class T> class ListNode {     friend class List < T > ;  public:     ListNode(const T& data);     ~ListNode();      T getData() const;  private:     T data;     ListNode<T> *nextPtr; };   RandomCPP.cpp (Main File):  #include "stdafx.h" #include "List.h" #include "ListNode.h"  using namespace std;  int _tmain(int argc, _TCHAR* argv[]) {     List<int> values = List<int>();     values.add(0);     values.add(1);     values.add(2);     values.add(3);     values.add(4);      cout << values.get(0) << endl         << values.get(1) << endl         << values.get(2) << endl         << values.get(3) << endl         << values.get(4) << endl << endl;      system("pause");     return 0; }   stdafx.h:  #pragma once  #include "targetver.h"  #include <stdio.h> #include <tchar.h> #include <iostream>   I have a List.cpp file and a ListNode.cpp file, each of which contain the definitions of the class declared in the corresponding .h file, and nothing else. The stdafx.cpp file is empty except an include of stdafx.h.


I am trying to understand UART synchronization. In a UART, the default state is high, and it starts the reception process when it receives a start bit (high-to-low transition)  In some scenarios any spike, noise or interrupt may change the state from high to low, which is enough for the UART to detect it as a start bit. I know that a UART internally handles these scenarios and avoids the process of receiving a full byyr.  Can anyone explain me how a UART handles these spikes?


I need to prove that $x^3 + y^3 + z^3$ is irreducible in $k[x, y, z]$, where $k$ is a field of characteristic $\ne 3$.  I think Eisenstein's criterion could be applied somehow here, but I'm not sure how to do it.


When I'm playing/working on my laptop the keyboard sometimes key-in randomly, so I ask:   How can I disable its on-board keyboard?  System:  Laptop Acer v3 772g OS: Windows 8


Why do birds sitting on electric wires not get shocked?

When we touch electric wires, we get shocked. Why don't birds sitting on electric wires not get shocked?


Let $a$ and $b$ be two integers. Show that $\gcd(a^2, b^2) = \gcd(a,b)^2$.   This is what I have done so far:  Let $d = \gcd(a,b)$. Then $d=ax+by$ for some $x,y$. Then $d^2 =(ax+by)^2 = a^2x^2 + 2axby+b^2y^2$.  I am trying to create a linear combination of $a^2$ and $b^2$ but do not know what to do with the middle term.  EDIT: I would be interested in seeing a proof using the Fundamental Theorem of Arithmetic as well. I simply thought it would be easiest to use Bezout's Identity.


(chrome) Set default handler for magnet links ?

When I click on a magnet link Chrome/Chromium open Transmission ... I'm would like to change this to use Tixati


Can anyone help me with this?  What is the sum of this series:  $\frac{2}{\pi}\sum_{k=1}^{\infty}\frac{(-1)^{k-1}}{2k-1}$  I got it after plugging $x=-1$ in a Fourier series   Thank you!


How to prove this theorem (about general topology)?

How to prove that "If $X$ is a Hausdorff space equivalent to $\varDelta \left(x\right),$ it is a closed set in $X\times X$"？


Is there any program like htop which can tell me the GPU RAM consumption when I train a "Deep Learning" model?


I had a dual boot machine with Windows 8 and Deepin linux on it. Last week I removed WIndows 8 and installed windows 8.1.   After installing Windows 8.1 grub was removed. I followed  to restore grub.  After repairing the machine restarted but for some reason after restarting in the middle of booting it shutdown.  Now the machine is not booting into any of the OS installed - it shows error message like "no boot device found please insert boot device and press any key".  I tried booting a live CD and it appears I have lost all my partitions and data.   I think it got formatted.  Is there any way to recover the lost partion data. If yes, how?  What all the requisites for that? is it possible to recover data into the same harddrive or do I need an external harddrive to store recover the data?  I Googled and got many tools which are available, but none have proper documentation on how to recover. My problem is I am not able to access any of the OS, so how can I to use the mentioned tool?  There are some bootable data recovery tools, but I dont know how to use them.