I m holing a passport of Indian. I m traveling  to Russia but my flight from Mumbai to Tokyo, Tokyo to Haneda, Haneda to Kansai. Kansai to Vladivostok. I have a airport change at Tokyo. Can I require a transit visa of Japan.

I'm arriving from New Delhi, India (Indian passport) with JAL at Narita on 11th July at 07:30 and departing for San Francisco with JAL at 00:05 on 12th July from Haneda. Do I need a transit visa as I'll be switching airports and spending a few hours at JAL City Haneda Airport Hotel?  Previously I had connecting flights from Narita to San Francisco and obtained shore passes to relax at Narita Nikko Hotel. Now I'm travelling with my elderly Mom and do not want complications at Narita immigration or later in the day while going from Narita Airport to Haneda airport. Please advise.


Here is Prob. 2.10 in the book Vector Analysis and Cartesian Tensors by D. E. Bourne and P. C. Kendall, 3rd edition:  Show that the four points with position vectors $$ \mathbf{r}_1, \mathbf{r}_2, \frac{r_2}{r_1} \mathbf{r}_1, \frac{r_1}{r_2} \mathbf{r}_2, $$ where $\mathbf{r}_1 \neq \mathbf{0}$ and $\mathbf{r}_2 \neq \mathbf{0}$, lie on a circle.  My Attempt:  Relative to a rectangular cartesian coordinate system $Oxyz$, let $\mathbf{r}_1 = \left( a_1, b_1, c_1 \right)$ and $\mathbf{r}_2 = \left( a_2, b_2, c_2 \right)$, where $$ a_1^2 + b_1^2 + c_1^2 > 0 \qquad \mbox{ and } \qquad a_2^2 + b_2^2 + c_2^2 > 0, $$ and as $\mathbf{r}_1, \mathbf{r}_2, \frac{r_2}{r_1} \mathbf{r}_1, \frac{r_1}{r_2} \mathbf{r}_2$ constitute four points on the circle, so we must also have $$ a_1^2 + b_1^2 + c_1^2  \neq a_2^2 + b_2^2 + c_2^2. $$ As a circle is a plane figure, so we can also assume without any loss of generality that both $\mathbf{r}_1$ and $\mathbf{r}_2$ lie in the $xy$-plane so that $c_1 = c_2 = 0$. Therefore we obtain $$ a_1^2+ b_1^2 > 0 \qquad \mbox{ and } \qquad a_2^2 + b_2^2 > 0, $$ and also $$ a_1^2+ b_1^2 \neq a_2^2 + b_2^2.  $$   Let $x^2 + y^2 + 2gx + 2fy + c = 0$, $z = 0$ be the required circle. Then substituting the coordinates of the heads of the four vectors we obtain $$ \begin{align} 2a_1 g + 2 b_1 f + c &= - \left( a_1^2+ b_1^2 \right), \\ 2a_2 g + 2 b_2 f + c &= - \left( a_2^2+ b_2^2 \right), \\ 2 \sqrt{ a_2^2+ b_2^2} a_1 g + 2 \sqrt{ a_2^2+ b_2^2} b_1 f + c &= a_2^2 + b_2^2, \\ 2 \sqrt{ a_1^2 + b_1^2 } a_2 g + 2 \sqrt{ a_1^2 + b_1^2} b_2 f + c &= a_1^2 + b_1^2.  \end{align} $$  Is what I have done so far correct? If so, then what next? How to proceed from here? Or, is there a more direct solution?

I'm stuck on problem 2.10 from Vector Analysis and Cartesian Tensors by Kendall:      Show that the four points with position vectors $\vec{r_1}$, $\vec{r_2}$, $\frac{r_2}{r_1}\vec{r_1}$, $\frac{r_1}{r_2}\vec{r_2}$ , where $r_1\neq0$ and $r_2\neq0$, lie on a circle.   I tried supposing that there exists some vector $\vec{d}$ which gives the position of the circle centre and then trying to prove that the distance from each point to this centre is equal. But I just arrive at the condition that $\hat{r_1}=\hat{r_2}$.   Any suggestions for another strategy, am I just messing something along the way?


The problem requires you to prove: $x^2 + xy + y^2 > 0$ assuming that $x$ and $y$ are not both zero  I made use of a property proven earlier ($x^3 - y^3) = (x-y)(x^2 + xy + y^2)$) and rewrote $x^2 + xy + y^2$ as $\dfrac{x^3 - y^3}{x-y}$. Then I simply tested for the three cases $x = y, x > y, x < y$  For the last two, it's easy to show that the condition holds. But when I consider $x = y$ then the statement that I got evaluates to zero, which is clearly not greater than zero, even though the statement $x^2 + xy + y^2$ should not be zero.  Edit: One stupid mistake. $x = y$ is undefined as it requires division by zero. What do I do from here?

Can't quite finish this proof:     Prove that if $x$ and $y$ are not both $0$ then $ x^2 +xy +y^2> 0$   $ x^2 +xy +y^2 +xy -xy> 0$  $ (x +y)^2 -xy> 0$ Without loss of generality define $x\geq y$  Firstly the case where $y<0$ and $x>0$ is trivial as both $ (x +y)^2$ and $-(xy) >0$.   I want to say by transitivity  as each are >0 that there sum must be ${}> 0$ can I do that?  The second trivial case is $y=0$ as we simply have $ x^2 >0 $ where $x>0$.  Lastly we have define $c= x+y$  since both $x$ and $y$ must have the same sign we know $|c|>x$ since $x\geq y$ we know that $ x^2 \geq xy$ finally since  $ |c|^2 = c^2$ $ \forall c \in \mathbb{R} $  We have $ c^2 >x^2 \geq xy$ hence $c^2 -xy >0$  I feel like I have all the pieces but it doesn't feel finished how do I fix it?  Edit: I am really glad i asked this question love the variety of different good answers no idea what a discriminant is but im going to go look that up. I wanted to give the accepted answer to Edward as he actually answered my question but Anurag s proof was just so much better then my attempt. ^^


Clearly, droids are programmed with, or given, a male or female gender. The majority of droid characters are clearly, and definitely, given a male identity and consistently referred to as 'he.' However, TC-14 certainly seemed to be female, plus the server droid in the diner in Episode II and I'm sure there are more.  Is this a part of their programming? Is there a difference between the body of TC-14 and C-3PO for example which makes them have a gender? Could C-3PO be reprogrammed as female, and would this be complicated or more like changing the voice on a sat nav/GPS system? Is it determined by their owner when purchased or first activated?  (These questions are to prompt an answer to the overall one - I don't think I'm really asking multiple questions here).

Inspired by  question.  Are droids in the Star Wars universe referred to with gendered pronouns (i.e. he or she), or are they referred to as objects (i.e. it)?


Ubuntu.com instructions say to press F12 or F10 or look for a brief message after switching on but none of these are applicable; laptop just goes to Windows.  When I try to open Ubuntu from the USB, it wants to know which Windows app to open it with, none of which work.  I have also installed something called Rufus under some weird instructions on this same site, but it just opens something called Hex Editor which shows the Ubuntu thingy as a page full of incomprehensible numbers. I've been at this for hours and it's doing my head in - can't even get past go.  I'm not a computer geek but I would've thought Ubuntu a tad more user-friendly after reading all the hype.

This question is asked often in Ask Ubuntu, sometimes with few hints about the situation.   Please provide a list of possible reasons to help troubleshoot the problem.


Say i am training a neural network and have 10 samples with 4 variables each and 1 label assigned to each observation. What does it mean to say that the samples are independent and identically distributed?  I know what IID variables are. And i have read statements such as "Because we usually assume that our samples are independent and identically distributed, the likelihood over all of our examples decomposes into a product over the likelihoods of individual examples:  text omitted". What exactly does it mean for the samples (here 4 variables and 1 class label) to be iid?

I have been facing hard time understanding meaning of "random sample" as well as "iid random variable". I tried to find out the meaning from several sources, but just got more and more confused. I am posting here what I tried and got to know:  Degroot's Probability & Statistics says:     Random Samples / i.i.d. / Sample Size : Consider a given probability distribution on the real line that can be represented by either a p.f. or a p.d.f. $f$. It is said that $n$ random variables $X_1 , . . . , X_n$ form a random sample from this distribution if these random variables are independent and the marginal p.f. or p.d.f. of each of them is $f$. Such random variables are also said to be independent and identically distributed, abbreviated i.i.d. We refer to the number n of random variables as the sample size.   But one of the other statistics book I have says:       In a Random Sampling, we guarantee that every individual unit in the population gets an equal chance(probability) of being selected.   So, I have a feeling that i.i.d.s are elements that construct random sample, and the procedure to have random sample is random sampling. Am I right?   P.S.: I am very confused about this topic, so I will appreciate elaborate reply. Thanks.


I have a field at a grid containing date/time and I need to know the difference between that and the current date/time. What could be the best way of doing so?  The dates are stored like "2011-02-07 15:13:06".

I'm creating an application which lets you define events with a time frame.  I want to automatically fill in the end date when the user selects or changes the start date.  I can't quite figure out, however, how to get the difference between the two times, and then how to create a new end Date using that difference.


Say I have an enum defined like so:  [Flags] public enum LogLevel {     None = 1,     Pages = 2,     Methods = 4,     Exception =8 }   and a class like:  public static class Log {     public static LogLevel Level = LogLevel.Methods | LogLevel.Pages;      public static void EnterPage([CallerFilePath]string filePath = "")     {         if (Level == //What value here to check if Level includes Pages?)         {              //Log         }     }   What value do I need to equate Level to to check whether the enum includes Pages?

From time to time I see an enum like the following:  [Flags] public enum Options  {     None    = 0,     Option1 = 1,     Option2 = 2,     Option3 = 4,     Option4 = 8 }   I don't understand what exactly the [Flags] attribute does.  Anyone have a good explanation or example they could post?


I have used ModernCV template to write resumes, Beamer to prepare presentations. Likewise, is there any standard Latex template for writing Statement of Purpose (SOP) or Research Proposal?

I am trying, loosely based on  to make a template for my Statement of Purpose. How could I remove the empty extra line between the horizontal rule and the text? Moreover, how could be the first letter be of larger font in the title?  Any other suggestion is more than welcomed.  \documentclass{article}  \usepackage[left=1in,right=1in,top=1in,bottom=1in]{geometry}  \newcommand{\HRule}{\rule{\linewidth}{0.5mm}} \newcommand{\Hrule}{\rule{\linewidth}{0.3mm}}  \makeatletter% since there's an at-sign (@) in the command name \renewcommand{\@maketitle}{   \parindent=0pt% don't indent paragraphs in the title block   \begin{center}     \MakeUppercase{\Large \bf \@title}     \HRule%   \end{center}%   \textit{\@author \hfill \@date}   \par } \makeatother% resets the meaning of the at-sign (@)  \title{Statement of Purpose} \author{name} \date{Ph.D. Applicant}  \begin{document}  \maketitle% prints the title block  Emergency medicine has always been a passion of mine\ldots  \end{document}


I have object's API Name  How can I get Object's Label ?  I am trying this  Map<String, Schema.SObjectType> schemaMap = Schema.getGlobalDescribe();  Schema.SObjectType schemaObj = schemaMap.get(SObjApiName);

Im working in a site, And I need to present many fields to be filled and the page, so accoding to a selecction before, I have all the field but I have the Api Name, and the object name, but, With this api object field name, how can I get the label????  Example. I have "Student__c", I need to present "Student" to the user.  Thanks a lot for ur help!    Ok, thanks for ur answuers but I think I did not explain well this situation.   I have a list of string, where I have the information but in Api's name.  I present this fields in a table, so the user is filling the fields but with an inputText and not with an inputfield!.. So, in this moment, I dont know what is the label of each field.  My question basically, if by means of a query I could know the label of a field, if I know the api field name and the object name.. My question is if there is a way to consult this info!...  I know if I have the object is enough using an inputfield, But I cant do that. Neither set the label with HTML directly 'cause this is something dynamic.   Anyone knows how can I know, or consult, I guess by means of a query, how to get this label names???


Since most lower voltage zener diodes operate at 5ma and require a resistor to provide it, what happens when you add a small resistance load across the zener and there is no longer 5ma for the zener to keep the voltage regulated ? In other words, how can it work as a regulator for a low resistance load ? How would you do this ? Thank you.

I wonder why a Zener diode is worse than linear voltage regulator.  Some of the posts online mentioned that because of the power dissipating problem. Zener diodes keep consuming a large amount of current while the load may just need a very little amount of current.   If I understand correctly, this phenomenon will happen only when the Zener diode is connected with the load in parallel. What if I connected my Zener diode with my load in series? Also, someone said that linear voltage regulators (e.g. LM7805) are not good voltage regulators as the power dissipated in them is much higher than that in switching voltage regulators. In my understanding, the power dissipated in a linear voltage regulator can be calculated by dropout voltage x current = power converted to heat.   Regarding these 2 points, other than a linear voltage regulator can handler a wider current range, what is the benefit of choosing a linear voltage regulator over a Zener diode?


Recently I installed Ubuntu next to Windows 10 and when I try to connect it to wifi it says "wifi adapter not found".   For every solution I've seen it says I need ethernet (I'm using USB ethernet through my phone, I don't know if that is a problem).  I have secure boot disabled and when I go to Additional Drivers it says that there are no additional drivers found.  If I enter the command lspci -knn | grep Net -A3; rfkill list I get  03:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821]      Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless   Network Adapter [103c:831a] 0: hci0: Bluetooth      Soft blocked: no      Hard blocked: no

I'm trying to install drivers for my Wifi on my HP All-in-one desktop. I've been told to show the output of the command "sudo lshw -C network" so here it is:  *-network description: Ethernet interface product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller vendor: Realtek Semiconductor Co., Ltd physical id: 0 bus info: pci@0000:01:00.0 logical name: enp1s0 version: 15 serial: 48:ba:4e:5c:06:5f size: 100Mbit/s capacity: 1Gbit/s width: 64 bits clock: 33MHz capabilities: pm msi pciexpress msix bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt 1000bt-fd autonegotiation configuration: autonegotiation=on broadcast=yes driver=r8169 driverversion=2.3LK-NAPI duplex=full firmware=rtl8168h-2_0.0.2 02/26/15 ip=192.168.1.21 latency=0 link=yes multicast=yes port=MII speed=100Mbit/s resources: ire:31 import:e000(size=256) memory: fea04000-fea04fff memory:fea00000-fea03fff  *-network UNCLAIMED description: Network controller product: Realtek Semiconductor Co., Ltd. vendor: Realtek Semiconductor Co., Ltd. physical id: 0 bus info: pci@0000:02:00.0 version: 00 width: 64 bits clock: 33MHz capabilities: pm msi pciexpress cap_list configuration: latency=0 resources: import:d000(size=256) memory:fe900000-fe90ffff   Output from "lspci -nnk | grep -A2 0280":  02:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821] Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless Network Adapter [103c:831a] 03:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. RTS5229 PCI Express Card Reader [10ec:5229] (rev 01)


When talking with a mathematics teacher the other day, we discussed these axioms in the context of proving tautologies with semantic tableaux:   $(p\to(q\to p))$ $((p\to(q\to r))\to((p\to q)\to(p\to r)))$ $((\lnot p\to\lnot q)\to(q\to p))$   We wondered if it was possible to show that $\neg(\neg A) \rightarrow A$ from these axioms (along with MP), but it did not seem obvious how to do so and yet this fact is not included as an axiom. Is it provable from the axioms or is this fact simply unprovable in this version of PL?

I'm very new to classical propositional logic, and my lecturer is using a system with the following axioms:  A1. X→(Y→X)  A2. (X→(Y→Z))→((X→Y)→(X→Z))  A3. (¬Y→¬X)→(X→Y)  Use uniform substitution and Modes Ponens (MP) as rule of inference. Deduction Theorem also allowed.  I'd like to deduce the following:  (a) X, Y ⊢ ¬(X→(¬Y)) (conjunction, but expressed in terms of NOT and IMPLIES)  (b) X→((X→Y)→Y)  (c) (X→Y)→(((¬Y)→X)→Y)  (d) (((¬Y)→X)→Y)→(X→Y)  Remark: The last two are to show that the axiom (A3) can be replaced with a different axiom:  B3. (¬Y→¬X)→(((¬Y)→X)→Y).  Solution: Bram28 proves (b) and (c) below. I demonstrate (a) and (d).  (d) is alright; first, I claim that X, ((¬Y→X)→Y) ⊢ Y.  Axiom (A1) gives ⊢X→(¬Y→X) so that ((¬Y→X)→Y)⊢X→Y by Hypothetical Syllogism (HS), which Bram28 shows to be valid.  Now that we have ((¬Y→X)→Y)⊢X→Y just apply the deduction theorem to get what we want: ⊢((¬Y→X)→Y)→(X→Y).  (a) is slightly trickier. Axiom (A1) gives ⊢ Y→(X→Y) so that X, Y ⊢ (X→Y).  Next, by part (b), we have as a theorem that ⊢X→((X→¬Y)→¬Y).  Therefore X, Y ⊢(X→¬Y)→¬Y.  But ⊢(¬¬(X→¬Y))→(X→¬Y) by DN Elim, which Bram28 shows to be valid.  By HS, X, Y ⊢(¬¬(X→¬Y))→¬Y.  By Axiom (A3) and MP, X, Y ⊢(Y→¬(X→¬Y)).  Also, rather trivially X, Y ⊢Y.  Finally by MP we conclude X, Y ⊢¬(X→¬Y) as required.


QUESTION EDITED: I have 10 different patients, who have undergone heart procedures and we have collected some measurements of cardiac electrical activity from the same region of all ten hearts. Due to a number of reasons, the data collected from each region comprises a different number of points/measurements. This has been analysed by proprietary software and we have been given only three values for each patient. The mean (electrical conduction velocity in cm/sec), the SD and the number of points that were used by the software to calculate this mean/SD (n) for each patient.  Mean SD n  I have NOT been provided with the individual values associated with each point for each patient, only the those three numbers. The number of points for each patient varies quite a bit - some are 47, some are 17 so as an example, the first two patients have the following: Patient 1  Mean = 2.5cm/s SD = 0.8 n = 47  Patient 2  Mean = 3.5cm/s SD = 1.5 n = 17  and so on for all 10 patients Is there a way I can find (a) MEAN of the MEANS and (b)appropriate SD for the mean of the means WITHOUT needing the individual values of each point? I think I understand how to find a weighted mean: Multiple each mean by n of that patient/cumulative n of all 10 patients and then add them all together (as in this example ) That should (I think) provide me with an overall mean of the conduction velocity of this region of the heart from these 10 patients. But how do I then calculate the SD of this mean of means for when we want to present this data in a medical journal? I would imagine it wouldn't work exactly the same way as a weighted mean?

I'm calculating the covariance of a distribution in parallel and I need to combine the distributed results into on singular Gaussian. How do I combine the two?  Linearly interpolating between the two almost works, if they are similarly distributed and sized.   provides a forumla at the bottom for combination but it doesn't seem right; two identically distributed distributions should have the same covariance, but the formula at the bottom of the page doubles the covariance.  Is there a way to combine two matrices?


This is part of a homework problem. I think I've got it right, but it isn't fitting into the next step, so wanted to check this one. Question: What is $E(e^{rX^2})$ when $X$ is $N(0,\sigma^2)$? My answer: $E(e^{rX^2})=\int_{-\infty}^{\infty}{\frac{1}{\sqrt{2\pi\sigma^2}}e^{-\frac{1}{2}\frac{x^2}{\sigma^2}}}e^{rx^2}dx=\frac{1}{\sqrt{2\pi\sigma^2}}\int_{-\infty}^{\infty}{e^{-x^2(\frac{1}{2\sigma^2}-r)}}dx$ The term inside the integral is just the main part of the formula for a cdf for a normal distribution with standard deviation $\gamma$ where $\frac{1}{2\gamma^2}=\frac{1}{2\sigma^2}-r=\frac{1-2r\sigma^2}{2\sigma^2}$ so it has area $\frac{\sqrt{2\pi\sigma^2}}{\sqrt{1-2r\sigma^2}}$ So, overall: $E(e^{rX^2})=\frac{1}{\sqrt{2\pi\sigma^2}}\frac{\sqrt{2\pi\sigma^2}}{\sqrt{1-2r\sigma^2}}=\frac{1}{\sqrt{1-2r\sigma^2}}$ Is this right?

Given a known Gaussian distribution, $X \sim \mathcal N(\mu_x, \sigma_x^2)$, how does one determine the the distribution of $Y$ if $Y = X^2$?


I have a simple two class program in java and the main class doesont want to create an object of the nameProcessor class  I tried everything I know but I am still a dumb begginer  public class Main {     public static void Main()     {         // initialise instance variables          String name="Andy";         System.out.println("That name is "+name.length()+" letters long");         System.out.println("The first letter is "+name.substring(0,1));         nameProcessor np1 = new nameProcessor(name);         if (np1.nameChecker()==false)            System.out.println("That is a nice name.");         else             System.out.println("That is a wierd name.");     } }  public class nameProcessor {     private String userName;     private String letters;     private String letter;     private boolean give;       public nameProcessor(String name)     {         // initialise instance variables         String userName=name;         String letters="XYZWxyzw";         String letter="";         boolean give=false;     }       public boolean nameChecker()     {         give=false;         for(int i=0;i<userName.length();i++){             letter=letters.substring(i,i+1);             if (userName.indexOf(letter)!=-1){                 give=true;             }         }         return give;     } }   //Some correct outputs would be   //Andy->That is a nice name //XXX->that is a wierd name  //just any string containing XYZWxyzw should return true

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


When I try to open Google Chrome, I get this:  [2922:2958:0913/051621.681319:FATAL:nss_util.cc(632)]  NSS_versionCheck("3.26") failed. NSS >= 3.26 is required. Please upgrade to the latest NSS Aborted (core dumped)   What should I do?

I upgraded to Chrome 61.0.3163 via ppa on Ubuntu 16.04 but it won't launch because NSS out of date. Launching Chrome in terminal gives:  NSS >= 3.26 is required. Please upgrade to the latest NSS, and if you still get this error, contact your distribution maintainer.   Running   sudo apt-get install libnss3   gives  libnss3 is already the newest version (2:3.21-1ubuntu4)   Should I try to get a newer version of libnss that's not in the repository? I downgraded my version of Chrome for now.  Edit:  apt-cache policy libnss3 libnss3:   Installed: 2:3.21-1ubuntu4   Candidate: 2:3.21-1ubuntu4   Version table:  *** 2:3.21-1ubuntu4 500         500 http://us.archive.ubuntu.com/ubuntu xenial/main amd64 Packages         100 /var/lib/dpkg/status  cat /etc/apt/sources.list # deb cdrom:[Ubuntu 16.04 LTS _Xenial Xerus_ - Release amd64 (20160420.1)]/ xenial main restricted  # See http://help.ubuntu.com/community/UpgradeNotes for how to upgrade to # newer versions of the distribution. deb http://us.archive.ubuntu.com/ubuntu/ xenial main restricted # deb-src http://us.archive.ubuntu.com/ubuntu/ xenial main restricted  ## Major bug fix updates produced after the final release of the ## distribution. # deb-src http://us.archive.ubuntu.com/ubuntu/ xenial-updates main restricted  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu ## team, and may not be under a free licence. Please satisfy yourself as to ## your rights to use the software. Also, please note that software in ## universe WILL NOT receive any review or updates from the Ubuntu security ## team. deb http://us.archive.ubuntu.com/ubuntu/ xenial universe # deb-src http://us.archive.ubuntu.com/ubuntu/ xenial universe # deb-src http://us.archive.ubuntu.com/ubuntu/ xenial-updates universe  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu  ## team, and may not be under a free licence. Please satisfy yourself as to  ## your rights to use the software. Also, please note that software in  ## multiverse WILL NOT receive any review or updates from the Ubuntu ## security team. deb http://us.archive.ubuntu.com/ubuntu/ xenial multiverse # deb-src http://us.archive.ubuntu.com/ubuntu/ xenial multiverse # deb-src http://us.archive.ubuntu.com/ubuntu/ xenial-updates multiverse  ## N.B. software from this repository may not have been tested as ## extensively as that contained in the main release, although it includes ## newer versions of some applications which may provide useful features. ## Also, please note that software in backports WILL NOT receive any review ## or updates from the Ubuntu security team. # deb-src http://us.archive.ubuntu.com/ubuntu/ xenial-backports main restricted universe multiverse  ## Uncomment the following two lines to add software from Canonical's ## 'partner' repository. ## This software is not part of Ubuntu, but is offered by Canonical and the ## respective vendors as a service to Ubuntu users. deb http://archive.canonical.com/ubuntu xenial partner deb-src http://archive.canonical.com/ubuntu xenial partner  # deb-src http://security.ubuntu.com/ubuntu xenial-security main restricted # deb-src http://security.ubuntu.com/ubuntu xenial-security universe # deb-src http://security.ubuntu.com/ubuntu xenial-security multiverse


Does trample ability have any effect during a fight between two creatures out of combat?  I'll explain better. When any card or effect allows two creatures to fight each other - for example, when a  is summoned by paying its kicker cost -  it is good to clarify how the various creatures' abilities still have an effect.  The question is this: -"Does trample ability have any effect during or after a fight between two creatures out of combat?". I give an example. If two creatures are invited to fight each other, let's say a  and a , after the fight ended normally with the Mammoth's victory, the fact that there are two points left that the Mammoth could deal with the trample ability, does it have any relevance in a case like this? That is,following the same example: does the Mammoth's controller have the chance of dealing them to the opponent?

The text for  says:     {1}{G}, {T} : Target creature you control fights another target creature. (Each deals damage equal to its power to the other.)   Does this have anything to do with combat? Or is it just direct damage between two creatures? For example, can one of the creatures have defender? Or what if one of them is tapped?   I've been assuming it is more like the damage dealt by a .  Also: are the two creatures then “tapped” until their next untap step? ie: could you use Ulenvald Tracker to make two creatures fight in your pre-combat step, then enter the combat phase with a creature who just “fought” untapped? Could you make two creatures fight who are both tapped?


I am running this with the IP address of the same machine:  $ nmap -p0-65535 192.168.1.198  Starting Nmap 7.60 ( https://nmap.org ) at 2019-03-20 10:13 EDT Nmap scan report for olive.fios-router.home (192.168.1.198) Host is up (0.00049s latency). Not shown: 65526 closed ports PORT      STATE    SERVICE 22/tcp    open     ssh 111/tcp   open     rpcbind 139/tcp   open     netbios-ssn 445/tcp   open     microsoft-ds 2049/tcp  open     nfs 5900/tcp  filtered vnc 41441/tcp open     unknown 43877/tcp open     unknown 44847/tcp open     unknown 55309/tcp open     unknown   Does "open" mean "listening"?  Why can't the following lsof report some open port's information? Thanks.  $ sudo lsof -i :2049 $ sudo lsof -i tcp:2049 $

I have a process which listen to 2 ports : 45136/tcp and 37208/udp (actually I assume it is the same process). But netstat doesn't return any pid :  netstat -antlp | grep 45136 tcp        0      0 0.0.0.0:45136           0.0.0.0:*           LISTEN      -    Same result with "grep 37208".  I tried lsof too :  lsof -i TCP:45136   But it doesn't return anything.  It's a new installation of squeeze and I really don't know what could be this process. Any idea ?  ANSWER Thanks to your comments I found out what it was. I deinstalled nfs-server nfs-common (after a dkpg --get-selections | grep nfs search) and the unknown process disapeared. Strange though that kernel processes aren't marked in any way.  Thanks again to both of you. ;)


I am currently considering a sum $$\sum_{r=0}^{n}{\binom{n}{r} (-1)^{r} (1-\frac{r}{n})^{n}}$$ but have no thoughtful ideas how to start.   Maybe it's worth noticing that $$\sum_{r=0}^{n}{\binom{n}{n-r}(-1)^{r}(1-\frac{r}{n})^{n}} = \sum_{r=0}^{n}{\binom{n}{r} (-1)^{r} (1-\frac{r}{n})^{n}}$$ and apply to the first one the convolution rule, but this doesn't seem productive enough.  Are there any hints that might help? Would be grateful to recieve any.

The successive difference of powers of integers leads to factorial of that power. Here's the formula:     $$\sum_{r=0}^{n}\binom{n}{r}(-1)^r(n-r)^n=n!$$   Can anyone give a proof of this result?  Note: The original question was to prove the more general     $$\sum_{r=0}^{n}\binom{n}{r}(-1)^r(l-r)^n=n!$$   for an integer $l$, which some of the answers address.


I have a newly reformatted PC and I just finished installing all the programs, drivers and hardware applications (like samsung magician, Logitech gaming software, etc) that I needed.  I work with 2 monitors and tons of windows opened (I'm programming)  Now one strange behavior that I'm getting annoyed is sometimes, the window focus randomly changes. I'm not sure what program has been doing this and I don't want to uninstall programs 1 by 1 to catch the offending program (since this was not happening on the previous OS installation given the same programs and startup, the only difference is everything is updated in the new OS format).  I haven't timed it yet, but it happens approx once every 20min Same thing happens to games, randomly going out of full-screen. (I know samsung magician has this behavior before, but I tried to remove it on startup and games still randomly goes out of full-screen)  I would like to know if there's an elegant solution to catch what program/driver/hardware application is doing this because it's getting annoying.  I'm using windows 8.1 fully updated, I formatted my pc to upgrade from win 8.1 also (but probably around 1 year behind on updates) since I usually reformat a windows OS every 1.5 years.

A background process/program steals focus from my currently active application. It disturbs me a lot when I type in an app or control an app using keyboard or play online flash games in full-screen. I want to remove this program from my PC, but I'm unable to detect it. I've analyzed all processes & scanned for viruses. All things are right from this side. I don't want to change focus behavior using registry tweak. Please, help me detecting that app..


How to show that $3^x+4^x=5^x$ has only one solution? Thanks in advice.

I would like to prove that the equation $ 3^x+4^x=5^x $ has only one real solution ($x=2$)  I tried to study the function $ f(x)=5^x-4^x-3^x $ (in order to use the intermediate value theorem) but I am not able to find the sign of $ f'(x)= \ln(5)\times5^x-\ln(4)\times4^x-\ln(3)\times3^x $ and I can't see any other method to solve this exercise...


$f:\mathbb R\rightarrow \mathbb R$ has both a left limit and a right limit at each point of $\mathbb R.$ Then the number of discontinuities of $f$ is what $?$  Now the Greatest Integer Function is one such function and has countable infinite discontinuities.   Any continuous function  also has both limits at each point and they are same and number of discontinuity is $0.$   So , is there  a function with both limits at each point that has number of discontinuities uncountable $?$ Is that possible $?$

I know that Dirichlet function has uncountable many discontinuities. I think they are removable, because the discontinuities can be removed by redefining the function values of the rational numbers as 0.  So Dirichlet function is a function that has uncountable many removable discontinuities, then my question is can we construct a function with uncountable  many jump discontinuities? If not, how do we prove it is impossible? Thank you.  An odd but similar question is can we have a function that has uncountable many infinite discontinuities?


When I touch with my bare finger the oscilloscope probe I get a perfect sine ac wave 155V peak to peak!.  This is my first oscilloscope and I don't know if this is a normal glitch.  Do I have a faulty one?

it once happened that when I touched the positive terminal of the Oscilloscope input probes letting its negative terminal open, I observed sinusoidal voltage signals with 0.5V peak to peak and of frequency nearly 50Hz. I don't understand the exact cause for these signals. When I touched the other, negative terminal output signal reached zero with a very little noise...(with the positive terminal connected to the body..) Is it because the power lines near the place I observed these are 50Hz and those induced a potential difference across me with respect to the supply ground which is also the ground of Oscilloscope... or something else.. When I touched a wire or a resistor with positive terminal of Oscilloscope.. there was no change in the Output.. Its because the equivalent model of our body includes capacitance and inductance with resistance.. If so then actually how we are being induced with such voltage signal..? Actually the discontinuity in signal is because of the difference between the frequency of actual signal and sampling frequency of my camera.


I want to create a math operator that is an integral with a square (\square) stack onto it such that the integral is still formated the way that the operator \int is. How do I do this?

Good Afternoon all,  I am trying to typeset a symbol that I have been using to represent the integral of a regulated function. This symbol is the standard integral symbol, with the letter "R" superimposed on it.  I have tried using \mathllap, \mathclap and \mathrlap (as suggested ), however none of these have managed to give the desired effect. When I tried doing it without the limits of integration, it got close to working, however then I was unable to have the limits to the right hand side of the symbol:  \mathop{\mathrlap{\int}R}_a^b f   Any help would be greatly appreciated, thank you in advance!  Minimal Example:  \documentclass{article}  \usepackage{amsmath,mathtools}  \begin{document}  Take the regulated function $f$, we want to compare the Riemann integral, $\int_a^b f$ to the regulated integral $\mathop{\mathrlap{\int}R}_a^b f$ by taking sequences of step functions.  We will prove that $$ \mathop{\mathrlap{\int}R}_a^b f = \int_a^b f $$  \end{document}


I have two two-level categorical variables, IV1 and IV2. I want to fit a linear model in R and find out the simple effect of IV1 on the DV at each level of IV2, separately. I'm not interested in the overall effect of IV1.  Is it correct to sum-code IV1, dummy-code IV2, and fit this model:  lm(DV ~ IV1 * IV2, data=dat)   Then interpret the main effect of IV1 as the effect of IV1 on DV at the reference level of IV2.


The function sequence $f_n=nx^{n-1}$ tends to zero for all $x \in [0,1)$. Why is the above limit not equal to $0$? Can you show it with Lebesgue's convergence theorems?

Let $s_n$ be a sequence defined as given below for $n \geq 1$. Then find out $\lim\limits_{n \to \infty} s_n$.   \begin{align}   s_n = \int\limits_0^1 \frac{nx^{n-1}}{1+x} dx  \end{align}  I have written a solution of my own, but I would like to know it is completely correct, and also I would like if people post more alternative solutions.


I saw the following sentence:     Sally, who I saw in town yesterday, is a friend of my sister.   But I think it should use whom instead of who, since Sally is the guy I saw, so why not use whom?

I can never figure out whether I should use who and whom. Most people use who for both colloquially, but some people say this is not correct.  What’s the rule for using who and whom correctly?


Could anyone recommend introductory books on Green's functions with applications in the framework of classical electrodynamics?

For a physics major, what are the best books/references on Greens functions for self-studying?  My mathematical background is on the level of Mathematical Methods in the physical sciences by Mary Boas.


I'm trying to create a nature scene with some plants which require alpha-masked images for the leaves. But whenever I UV unwrap them, the objects get coloured pink.

I made a character, and its one of my first times texturing, and I saved my character into a new folder, and when I came back to the model ALL the textures were pink, I used to know what to do, but I stopped texturing, how do I bring my textures back?


Via the  webpage, to activate this package, I need to click on the button "Available on Chrome".  I would like to install/active this  package via the terminal command line. How can I do so?

I want to install chrome extensions in chrome browser through Terminal instead of doing in GUI.  Is there any way to install the extensions from Terminal?


How I can invest in Stack Exchange Inc. and in the idea behind the Stack Exchange? Maybe in form of shares?

Joel Spolsky has just posted  where he talks about seeking venture capital for Stack Overflow.  If instead they opted to seek shareholders from the StackOverflow community along the lines of the , but at a larger scale, would you be interested?  I'm asking this because I suspect there might be enough fanatics willing to invest $500 or so in a product they love to raise a considerable sum. People also often talk about the motivation for high rep users. It seems to me having an actual stake in the product might be a decent incentive (especially if you also get a gold badge for buying shares).


I have A Pentium Dual Core 2.50 Ghz and having  2GB DDR2 ram and 512 MB Nvidia 8 Series graphic card. Will Ubuntu 13.04 run on my system faster than Windows 7. Would I be able to run 64 Ubuntu on my PC?

The Ubuntu 13.04 32-bit desktop system requirements. What are they?


In fact I want to have a two columns nomenclature in order, but when I write them in order in the result they are not in the order, I have already read the nomencl package : sort by order of appearance, and I have applied the same structure but the problem remains the same. even when I use \nomencalure[order]{symbol}{meaning}. Here is the code:  \immediate\write18{makeindex \jobname.nlo -s nomencl.ist -o \jobname.nls} \documentclass[preprint,12pt,3p,numbers,sort,compress]{elsarticle} \usepackage{multicol} \usepackage{framed}   \usepackage{nomencl} \makenomenclature \setlength{\nomitemsep}{-\parskip} \begin{document}  \section{Introduction} \label{sec1}  BLABLABLABLABLABALABABLABLABLABLAB\par   LABALABABLABLABLABLABLABALABABLABLAB\par  LABLABLABALABABLABLABLABLABLABALABA  \begin{framed} \nomenclature[01]{$x_{1}$}{parameter1} \nomenclature[02]{$x_{2}$}{parameter2} \nomenclature[03]{$x_{3}$}{parameter3} \nomenclature[04]{$x_{4}$}{parameter4} \nomenclature[05]{$x_{5}$}{parameter5} \nomenclature[06]{$x_{6}$}{parameter6} \nomenclature[07]{$x_{7}$}{parameter7} \nomenclature[08]{$x_{8}$}{parameter8} \nomenclature[09]{$x_{9}$}{parameter9} \nomenclature[10]{$x_{10}$}{parameter10} \nomenclature[11]{$\delta$}{parameter11} \nomenclature[12]{$\theta$}{parameter12} \nomenclature[13]{$\omega$}{parameter13} \begin{multicols}{2} \printnomenclature[1.9cm] \end{multicols} \end{framed} \end{document}

In the nomencl package, how can I make the symbols print by order of appearance in the LaTeX code?


If, in local system, an accelerated system is completely physically equivalent to a system inside a gravitational field.  Acceleration results in an increase in speed.  Right?  What happens when the accelerated "elevator" accelerates to the point where its speed hits (or exceeds?) the speed of light?    Does it stop at the speed of light?  Is that a possible way to distinguish between the two different forces?  Or does something else happen?

I don't have a lot of knowledge of special relativity and associated topics; some of the few things I know are that "all motion is relative" (that is, there is no 'stationary reference frame'), and the speed of light in vacuum ($c \simeq 3 \cdot 10^8~\mathrm{m~s^{-1}}$) is the absolute asymptotic speed limit (asymptotic meaning that you can never equal it, only get arbitrarily close). What escapes me is how those concepts work together - to my naive understanding, an object would never move in its own reference frame (and so would never reach $c$). What reference frame is $c$ measured against? (Is it measured against a reference frame?) Or am I looking at this the wrong way?


My Code (Javascript):  var num = 0; function change(){     var num = 10; }         change();         document.write(num);   The result should be 10 but it is showing 0. Why? If the code is wrong, what is the correct way to do this?

What is the scope of variables in javascript? Do they have the same scope inside as opposed to outside a function? Or does it even matter? Also, where are the variables stored if they are defined globally?


The Error is that: String which doesn't == withdraw, whatever i put, it will just say, deposit. i want to be able to use both (withdraw) & (Deposit).  import java.util.Scanner;  public class BasicClasses {     public static void main(String[] args) {         System.out.println("Welcome to First National Bank (FNB)");         Scanner Key = new Scanner(System.in);         String Question = Key.nextLine();         BasicClasses flix = new BasicClasses();          System.out.print(" | Withdraw | or | Deposit | [ ");         Scanner Key1 = new Scanner(System.in);         String Which = Key.nextLine();          if(Which == "withdraw") {             System.out.println("|Withdraw| - | How much do you Want to Withdraw?");          } else {             System.out.println("|Deposit| - | How much will you be Depositing?");     }   }   }

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I minimized my terminal after doing a repo sync.  I cant find it on any desktop now! Please help.

I just installed 11.10 and found that once I minimize the terminal window, I can't bring it back. All other Windows are getting minimized to the Unity launcher and I can relaunch them from there. If I go to the launcher and click on terminal a new terminal session is created and the old one is lost completely. This is the first time I am facing such a problem and all my previous installations of 11. 10 didn't throw up any such behaviors. Any suggestions?


I hope the picture is clear enough, I've found a worm like insect like the one below a little while ago in my shower, and today I found another one. I've never seen something like this. I would say it is slightly bigger than a centimeter.  Location: Netherlands  Why do they come in my shower ?

I am in Portugal (Lisbon) at the moment, and when leaving my room late at night (12 pm ~ 04 am) I usually face about 4 of these arthropods in the corridors:    (For reference, the "line" in the image is a standard separation on the floor. This particular example of the animal is a little smaller than a nail.) They seem to have quite variable sizes and walk primarily on ground. Also, as implicit above, they seem to be active primarily during the late night. (I don't see them much often, if at all, during the morning/afternoon.) They can be quite fast, but if left unharmed do not move much. They also appear to take shelter inside the walls.  From what I searched, it seems possible that they are centipedes. I've seen sites saying that they are useful to keep other less pleasant animals at bay. My questions are: What are those animals, and should I leave them be or not?


I have some problems with aligning text to the center:    .list {   width: 100%;   height: 100%; }  .row {   vertical-align: middle;   width: 100%;   height: 30px;   text-align: center; }  .name {   display: block;   float: left;   width: 30%; }  .message {   display: block;   float: left;   width: 70%; }

Ben

Hello world

Tom

Hello world

NoName

Hello world

     What I would like to achieve is to get list of names and messages, where each name and message are in one row. But currently, where I am trying to align text in row it doesn't work. Any ideas?

I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers?

testing...


How could dictionaries whose values are lists be merged in Python, so that all of the keys are moved into one dictionary, and all the elements of each list moved into a single list for each key?  For example, with these dictionaries:  x = {'a': [2], 'b': [2]} y = {'b': [11], 'c': [11]}   ... the result of the merging should be like this:  {'a': [2], 'b': [2, 11], 'c': [11]}   How could this be done with any number of dictionaries, not just two?

I have two Python dictionaries, and I want to write a single expression that returns these two dictionaries, merged (i.e. taking the union).  The update() method would be what I need, if it returned its result instead of modifying a dictionary in-place. >>> x = {'a': 1, 'b': 2} >>> y = {'b': 10, 'c': 11} >>> z = x.update(y) >>> print(z) None >>> x {'a': 1, 'b': 10, 'c': 11}  How can I get that final merged dictionary in z, not x? (To be extra-clear, the last-one-wins conflict-handling of dict.update() is what I'm looking for as well.)


I am trying to make this simple function:  private void getID(){     for(int i=0;i<crops.size();i++){         ID.add(i);     } }   where cropps.size() is the size of a bitmaparraylist which i've made. People told me that these function fail because you can get the argument null. But how can i get null if i don't fill in any arguments...  I've also tried to make the input of the function an Arraylist of integers but this failed as wel. On my Oncreate method i use getID() after i made the crops so that isn't the error as well. So i'm kind of confused here and help would be much appreciated.  Kees

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


A while ago, I thought one could use trigonometry. Simply have the actors hold the base of the light saber, and the stick part would be generated by the computer.

, the the props are made of wood.     Also, due to the brittleness of the stunt blades used during this fight, which were little more than wooden dowels, Diamond was forced to instruct Alec Guinness and David Prowse to stop their blades before contact due to their fragility.   If there isn't any particularly special feature about the props to separate them from the rest of the image, were they done manually?  How were the lightsaber effects accomplished?    I'm interested in all the movies, but mainly episode IV/original trilogy.


I have a valid US visa as I study there. I am returning back home via Germany. Do I need a transit visa in Germany?  Also, the ticket has no information about the flight terminals.

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


I want to use temporary Xubuntu without installing on the PC. Also, I want to keep my system empty after removing the bootable USB drive. It will be great if you could suggest how the below might be achieved:   Try Ubuntu option should be automatically selected. Ubuntu OS should be run temporarily when power is on (without selecting any option manually). As soon as USB is removed the system should stay empty again.

I am creating a custom live CD based on Ubuntu 15.10. When the user sees the first boot screen (and doesn't press a key), it will automatically boot into a GUI menu where the user can choose 'Try Ubuntu' or 'Install Ubuntu':    However, if the user presses a key, it gets a text menu. Selecting 'Try Ubuntu' boots directly into the desired live CD:    I can successfully remove the installer boot entries in the text menu (isolinux/txt.cfg), but this doesn't change the default boot option when the user does not press any key. Removing the installation package ubiquity is not an option, I just want to prevent the user from starting the installer directly.  How can I change the default boot option to boot into 'Try Ubuntu'?


Why I can't implicitly convert Generic<T> to GenericSetted : Generic<T> ?  This driving me insane:  Declaration:  class GenericParam<T> { }  class WithGenericParamAndGeneric<G, T>     where G : GenericParam<T> { }   Implementation:  class Generic : GenericParam<string> { }  class Inherited : WithGenericParamAndGeneric<Generic, string> { }   Trouble:  void Assign() {     WithGenericParamAndGeneric<GenericParam<string>, string> b = new Inherited(); //(!) }   Error:     Cannot implicitly convert type 'Inherited' to   'WithGenericParamAndGeneric<GenericParam<string>, string>'   I do not know the reasons in which case CLR can't process this case.

It seems that a List object cannot be stored in a List variable in C#, and can't even be explicitly cast that way.  List<string> sl = new List<string>(); List<object> ol; ol = sl;   results in Cannot implicitly convert type System.Collections.Generic.List<string> to System.Collections.Generic.List<object>  And then...  List<string> sl = new List<string>(); List<object> ol; ol = (List<object>)sl;   results in Cannot convert type System.Collections.Generic.List<string> to System.Collections.Generic.List<object>  Of course, you can do it by pulling everything out of the string list and putting it back in one at a time, but it is a rather convoluted solution.


Can a matrix 3x3 have 2 solutions? Can it be determined somehow without solving it? For other type of matrix, how do you determine the number of solutions without solving it?  Thanks!

How would you go about proving that for any system of linear equations (whether all are homogenous or not) can only have either (if this is true):   One solution Infinitely many solutions No solutions   I found this a bit difficult to prove (even though its a very fundamental thing about any linear equation). The intuitive geometric explanation is that a line can only intersect at one point, and if it intersects at a later point, it can't be a linear equation, but I don't think this is a convincing proof.   I thought of if you assume that there are two (or more, but I picked two) solutions for some linear system, then for the points in between   Solution Set 1: X1, X2....., Xn  Solution Set 2: X1, X2....., Xn  Then (I think), the points between S1 and S2, must be infinitely many points (and thus infinitely many solutions) such that these points can also satisfy the linear system, which would mean the system has 2 infinite solutions.   However, I don't think this is rigorous enough and nor do I understand completely why its true. Can anyone help in explaining (correcting) and elaborating on the intuition and proof of this?


I'm improving upon the motion path in Blender. As it is now, the motion path is something that needs to be calculated for each bone, then updated manually. I want to make the motion path (for the active bone) update every time I change something in the graph editor.  I have this simple script:  import bpy  bpy.ops.pose.paths_update()   That I want to trigger, every time I make a change in the graph editor. Is this possible? Is there a simpler way of doing it, rather than trigger a script?  What I currently have, is the above script as an operator. I then reference this operator with a hotkey. But I want to remove the need for a hotkey.

Blender's application handlers are listed , but is it possible to create a new one?  For example, I'd like an application handler which is a callback for every time I add a strip to the Video Sequence Editor.


This particular question was asked in quiz yesterday and I was unable to solve it.  Suppose f and g are entire functions and g(z) $\neq$0 for all z $\epsilon \mathbb{C} $ . If |f(z) |$\leq$ |g(z) | , the which one of them is true.  1.f is a constant function. 2.f(0) =0 . 3.for some C $\epsilon \mathbb{C} $ , f(z) = C g(z) . 4.f(z) $\neq$ 0 for all z $\epsilon \mathbb{C} $ . 4 th option can be removed by taking f(z) =0 and g(z) =2 . But I am unable to find any way to remove rest of options.

Let $f$ and $g$ be entire functions and $g(z)\neq 0$ for all $z\in \mathbb{C}$. If $|f(z)|\le |g(z)|$, can we say $f$ is constant?  Liouville theorem says that an entire bounded function is constant, but g is not given bounded here. So I think it should be false. What else can we say about $f$?


So I'm on a dual boot machine and was wondering if there was any way I could expand the root partition (Booted into Windows or Ubuntu) because I accidentally allocated too little space when setting up. Here's a . I just want to know if I am able to allocate some of the memory in the unallocated area to root, thanks in advance.

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


I was benchmarking if it is worth to put loop inside a callback function so I tested fourth order Runge-Kutta of on y'=y in C++, all with gcc 5.1 on Ubuntu with compilation command  g++ -std=c++11 -O3 -march=native --fast-math test.cpp   The Runge-Kutta loop  double dt=(t_end-t_0)/N; auto y=y_0; auto t=t_0; for(size_t k=0;k<N;++k)     {     auto k_1=f(k*dt, y);     auto k_2=f(k*dt + 0.5*dt, y + 0.5*dt*k_1);     auto k_3=f(k*dt + 0.5*dt, y + 0.5*dt*k_2);     auto k_4=f(k*dt + dt, y + dt*k_3);      y+=dt*(k_1 + 2*k_2 + 2*k_3 + k_1)/6.0;     }  return y;   Inlining was achieved by a template and a function object. For dynamic binding a function pointer was used.  The Pentium M  Specs as given by /proc/cpuinfo  cpu family      : 6 model           : 13 model name      : Intel(R) Pentium(R) M processor 1.73GHz stepping        : 8 microcode       : 0x20   Frequency from sudo cpufreq-info  current policy: frequency should be within 800 MHz and 1.73 GHz.                 The governor "userspace" may decide which speed to use                 within this range. current CPU frequency is 1.73 GHz (asserted by call to hardware).   Results                    ODE solution       exp(1)             diff                   Execution time Function pointer  2.718281828037378  2.718281828459045  -4.21667145644733e-10  53321972 Inlined call      2.718281828037378  2.718281828459045  -4.21667145644733e-10  19916460   The Prescott:  Specs as given by /proc/cpuinfo  cpu family      : 15 model           : 4 model name      : Intel(R) Pentium(R) 4 CPU 3.40GHz stepping        : 3 microcode       : 0x5   Frequency from sudo cpufreq-info  current policy: frequency should be within 2.80 GHz and 3.40 GHz.                 The governor "userspace" may decide which speed to use                 within this range. current CPU frequency is 3.40 GHz.   Results                    ODE solution       exp(1)             diff                   Execution time Function pointer  2.718281828037378  2.718281828459045  -4.21667145644733e-10  70811683 Inlined call      2.718281828037378  2.718281828459045  -4.21667145644733e-10  19928642   Comparison and question  So the Prescott performs no better (it seems to be much worse), than the much lower clocked Pentium M. Sure, Prescott had a very long pipeline, but my code is highly predictable since N=2^30. So what makes the Prescott that slow despite its high CPU frequency?

Why, for example, would a 2.66 GHz dual-core Core i5 be faster than a 2.66 GHz Core 2 Duo, which is also dual-core?  Is this because of newer instructions that can process information in fewer clock cycles? What other architectural changes are involved?     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this question. Feel free to edit the answers to add additional details.


I have two hard drives in my computer and would like to install Ubuntu 18.04.3 on the second hard drive. I wanted to know if there is any way to install it without leaving my main drive?

I have 2 1tb hard drives on my computer with Windows 8 on the first hard drive and nothing on the other.  I want to install Ubuntu 14 on the second hard drive. I've looked up some guides and they all say to install Ubuntu on the sdb partition when booting off a usb stick. I have also seen some say to unplug the Windows HDD and then install Ubuntu onto the second HDD, and Ubuntu will automatically detect Windows and ask what you want to boot into upon boot.   I am really concerned about this - Will it ask me to choose what OS I want to boot into? Is there something like rEFInd(Mac) for Windows? Can anyone please give me a guide on how to do it without ruining my computer?  Thanks


Hello I'm following some tutorial on Blender 2.5. Author shows how to use Bevel on cube's edge. Here is simple code (edit mode is on):  cube = bpy.context.active_object cube.data.edges[0].bevel_weight = 1.0   But when i try this code in Blender 2.69/2.71, I can't see any changes. When I do it by shortcut ctrl+b it works

I need to set weights for some edges from a python script. I have tried looping through object.data.edges and setting bevel_weight values but I can't get it right. It only works if I have first edited some edge's bevel weight by hand from the 3d-view's transform window. But I would like to get it work from my script without any manual hacking.  Steps to reproduce:  Start Blender with default cube and switch to Scripting view.  Try to set weights for all edges:  for edge in C.object.data.edges:     edge.bevel_weight = 1.0   Verify that values changed:  for edge in C.object.data.edges:     edge.bevel_weight   Switch into edit mode in 3d-view and open up transform window by pressing n. Select edges to see that the change did not work (bevel weights are all zero). Switch back to object mode and read values again in scripting console to see that they were reset to zero:  for edge in C.object.data.edges:     edge.bevel_weight   Go back to edit mode and change some edge bevel weight straight from the transform window by hand. Go back to object mode and change values again from the scripting console:  for edge in C.object.data.edges:     edge.bevel_weight = 1.0   This time it works, bevel weights are 1.0 when you go back to edit mode and look from the transform window.   Any ideas? My final need is to apply a bevel modifier to only some set of edges and that's why I'm trying to mark them by using weights. Using vertex group for bevel modifier does not work in my situation, since I need to specify edges, not vertices, which to bevel.   I'm using Blender v2.71.


So here is their .  And here is the .  How did the person in question, who has 1 rep, comment on a question?

Yesterday I wanted to comment on a question on Stack Overflow, but I don't have 50 reputation points. The question is that I referred in my answer to another Stack Overflow question, and my response had showed as a comment.  It is correct?? I don't know if this is a bug.  This is the question:   And now my rep is 47.


I have created a file that contains arithmetic expressions, one per line. How can I evaluate the expressions and display the results, from the command line?  The file looks like this:  1 + 2 6 * 4 97 % 12 43215 / 43 * 100   The goal is to output each result, in order, also one per line. I recall there is a way to do this that only requires one command, and that command used might start with w, but I can't remember how.

I am looking for a Calculator which can do calculations in the terminal itself without any other extra prefixes and suffixes.  For example: If I typed something like 10000-9000 in the terminal, the answer should come out as 1000.  Once again I am saying, I just need a quick calculator in terminal, without any characters added. I know if I switch to Python, it can do that but I don't want it in such a way.


I am trying to connect 2 separate paths somewhere along its centre, see picture:    Is there a way to do this?

I want to extrude a curve in two directions.    Or join both curves into one, is it possible? I've tried copying it and then join segments, but I don't see Remove Doubles option while working with curves.


Problem statement:     Let $Y$ be an ordered set in the order topology and $X$ a topological   space. $f,g:\, X\to Y$ are continuous.  Show that $\{x\mid f(x)\leq g(x)\}$ is closed.   My thoughts:  In case $Y=\mathbb{R}$ I would define $h=g-f$ and say that the above set is $h^{-1}([0,\infty))$ which is closed by continuity of $h$. But in an ordered set $Y$ there is no meaning of $g-f$.  Can someone give me a hint ?

Let $Y$ be an ordered set in the order topology with $f,g:X\rightarrow Y$ continuous.  Show that the set $A = \{x:f(x)\leq g(x)\}$ is closed in $X$.  I am completely stumped on this problem.  As far as I can tell I've either got the task of proving $A$ gathers its limit points, or showing that there is a closed set $V \subset Y$ such that $f^{-1}(V)$ or $g^{-1}(V)$ is equal to A, which would prove $A$ closed since both $f$ and $g$ are continuous.  The latter strategy seems like the more likely to succeed.  Unfortunately I can't find any way of constructing this set $V$.  The fact that I don't know if $f$ or $g$ are injective means I keep running into the problem of having $f^{-1}(V)$ or $g^{-1}(V)$ give me extra points not in $A$.  And even if I were able to construct $V$ this wouldn't guarantee it was closed.   I suspect I may need to use the continuity of both $f$ and $g$ together in some way but I can't see how.  Can anyone give me some guidance on this problem? Thanks.


Let's say I have a Header element which has various content that is determining its height rather than a set property. Is it possible to get that height using CSS only? I want that in order to know how much vertical space I have left on the page and size a video div accordingly.  If I had the dimension set manually I could just use height: calc(100vh - headerHeight);  sample:
something

   header {   background-color: yellow;   margin: 0; } p {   font-size: 2em;   padding: 0.5em;   margin: 0;   background-color: pink; } div {   background-color: blue;   height: 100vh; /* This should adjust so it doesn't overflow-y.*/ }

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


let $n=\mid V\mid$  base case: let $n=0$. Thus lemma becomes vacuously true since both bipartitions will contain the empty set thus not a bipartite graph.  Inductive step:  let $k\in\mathbb{N}$, assume $P(k)$ show P(k+1): $\forall G=(V,E), k+1 = \mid V \mid\Rightarrow \mid E\mid\leq\frac{(\mid k+1\mid)^{2}}{4}$, where G is bipartite  I'm having trouble the inductive step, here's my intuition of how I think I should approach. create a subproof to show max possible edges in bipartite graph is when both bipartitions of V has the same size. Then we can assume if a bipartite graph is complete then proposition is satisfied for case 1. I think for Case two, prove for when # of edges are less than the max?

Prove that for a bipartite graph $G$ on $n$ vertices the number of edges in $G$ is at most $\frac{n^2}{4}$.     I used induction on $n$.    Induction hypothesis: Suppose for a bipartite graph with less than $n$ vertices the result holds true.    Now take a bipartite graph on $n$ vertices.Let $x,y$ be two vertices in $G$ where an edge exist between $x$ and $y$. Now remove these two vertices from $G$ and consider this graph $G'$. $G'$ has at most ${(n-2)^2}\over4$. Add these two vertices back.  Then the number of edges $G$ can have is at most    $$|E(G')|+d(x)+d(y)-1$$   My question is in my proof I took $d(x) + d(y) \le n$, where $d(x)$ denotes the degree of vertex $x$.  Can I consider $d(x)+d(y) \leq n$? I thought the maximum number of edges is obtained at the situation $K_{\frac n 2,\frac n 2}$


I bit the bullet and upgraded to iOS 9.1, and the phone now moves like it's an iPhone 3GS. I can see iOS 8.x is no longer signed, but fortunately I have SHSH of iOS 8.2 saved.  How can I downgrade without losing my warranty? I've heard jailbraking will void warranty, but I guess jailbraking then flashing an iOS version that removes the jailbreak should allow my phone to still be in warranty.  PS: This is not a duplicate of , because it talks about restoring from IOS9 to usinged IOS8 version with SHSH blobs.

I'm trying to downgrade my iPhone from the current iOS to an older one, as per .  But every time I try, I always receive this error:     The iPhone could not be restored. This device isn't eligible for the requested build.     I have tried many times with and without DFU mode. Any ideas regarding this?


I believe the first of the code examples is a short-hand Singleton implementation and I'm not sure if it is thread safe. As the class, EventSourceLogger derives from EventSource, which is not static, this class can not just be a static class itself (which would have been even more convenient - tradeoffs between singletion and static notwithstanding).    I reverted from a more thorough specific known thread safe implementation to this implementation for brevity - after liking the look of this approach in a colleagues code.  What have I lost?   Current implementation  [EventSource(Name = "EventSourceLogger")] public class EventSourceLogger : EventSource {     public static readonly EventSourceLogger Logger = new EventSourceLogger();` }   Previous implementation  [EventSource(Name = "EventSourceLogger")] public class EventSourceLogger : EventSource {     private static EventSourceLogger instance;      private EventSourceLogger()     {     }      public static EventSourceLogger Instance     {         get         {             if (instance == null)             {                 instance = new EventSourceLogger();              }              return instance;         }     } }

In other words, is this Singleton implementation thread safe:  public class Singleton {     private static Singleton instance;      private Singleton() { }      static Singleton()     {         instance = new Singleton();     }      public static Singleton Instance     {         get { return instance; }     } }


while I'm learning for exams i need often to search multiple pdf files for some text. I have done it till now using adobe reader.The Problem is that adobe reader or all other pdf viewers i tried ("PDF-XChange Viewer","Foxit Reader" ..) have an unpratical search interface in the way that if one needs to choose another index folder one must navigate again all over through  the way there! It also doesn't recognise shortcuts.  I tried  wingrep which is really good tool and its integrated into context menu but it doesn't support searching into pdf files :( also tried Docfetcher but it's not really user friendly and not integrated into the context menu.  Is there any anyway anytool(except "Windows Search indexing") which let user navigate fast between index folders( like typing directory into address bar or a has search function in context menu) ?

I'm trying to get Windows Search (4.0) to index PDFs and .pub, .doc, etc. files.  The files are on an XP Pro PC acting as a file server. But I don't have MS Office, etc. installed (no need, trying to keep it "slim and trim") but WS 4.0 is doing the indexing of those files and not indexing .pdf and .pub.  I've found a few  (from Foxit PDF reader) rated 3/5 and only support WS 2.0 or 3.0.  Looking for other solutions and also a way to index .pub files.


Suppose $z_1,...,z_n\in \Bbb C$ are complex numbers, not necessarily distinct, satisfying $$ z_1^k+\cdots +z_n^k=0$$  $ \color{red}{\forall\; k>0}$. Then is it true that $z_1=\cdots=z_n=0$?  This will be obvious if the $z_i$'s  were all real, but I'm wondering that this is true for the complex case.

Here is a statement that seems prima facie obvious, but when I try to prove it, I am lost.  Let $x_1 , x_2, \dots, x_k$ be complex numbers satisfying:  $$x_1 + x_2+ \dots + x_k = 0$$  $$x_1^2 + x_2^2+ \dots + x_k^2 = 0$$  $$x_1^3 + x_2^3+ \dots + x_k^3 = 0$$  $$\dots$$  Then $x_1 = x_2 = \dots = x_k = 0$.    The statement seems obvious because we have more than $k$ constraints (constraints that are in some sense, "independent") on $k$ variables, so they should determine the variables uniquely.  But my attempts so far of formalizing this intuition have failed.  So, how do you prove this statement?  Is there a generalization of my intuition?


Which is more appropriate to use?      I graduated at Harvard university    Or     I've graduated at Harvard university

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


When a file is double clicked in a file manager it is automatically opened using the application associated with the type of the file.  How can I do the same from code. I am open to any programming  language. I have a little experience with Python and C.   My target operating systems are Ubuntu Linux and OSX. However, ideally I would like to find a solution that works with Windows, OSX, and Ubuntu linux.

I need to be able to open a document using its default application in Windows and Mac OS. Basically, I want to do the same thing that happens when you double-click on the document icon in Explorer or Finder. What is the best way to do this in Python?


Supeeer new to Latex so I'm sorry if my question is stupid.   I have a programming assignment using pseudo-code for one of my courses. Our professor suggested we do the assignment using LaTeX. Can anyone guide my how to format the code using LaTeX?  I should make it look like this:     Thanks in advance!

I have defined my own language whose syntax is very close to the one of Pascal. I would like to type the following program for instance. Many people use the packages algorithmicx or algorithm2e to print programs, but it seems that we have to use their specific keywords of its syntax like procedure, end while.  I just want to indent spaces when needed, and bold some words when I want (sorry that I could not bold letters in the following figure). Do I have to use  texttt for each line? Also, with verbatim, I could not bold words...  Also, as the program is not large, I would need to put it on the left side of the page, and leave space for some explanasion text on its right hand side. So I  guss I need to get them all together, and use multicols.  Could anyone help?  program test                                      some text here var   i : integer;                                    ...    b : boolean; begin    i := 1;                                        ...    b := true;    while i < 15 do       i := i  + 1;       b := not b                                  some text here    od end   Edit1: Following @Werner's tabbing solution, I have made the code a minipage:  \begin{minipage}[t]{0.48\linewidth}% \begin{tabbing} Werner's solution \end{tabbing} \end{minipage}\hfill \begin{minipage}[t]{0.48\linewidth} a paragraph \end{minipage}   Actually as the code shows, I want the texts to be another separated minipage on the right hand side of the code. I have then 2 questions:   is it reasonable to make 0.48\linewidth instead of 0.5\linewidth? 0.48\linewidth is a conventional choice? is it possible to make a frame around the code, and use \caption and \label to make it a reference (I prefer figures)?


Let $x_1,x_2,\dots,x_n$ be independent identically distributed random variables uniform on $\{1,2,\dots,N\}$, and let: $Y_n:=\text{the number of different elements in } \{x_1,x_2,\dots,x_n\}$.  Let $T:=\inf\{n:Y_n=N\}$.  What is $E\left[T\right]$?

What is the average number of times it would it take to roll a fair 6-sided die and get all numbers on the die?  The order in which the numbers appear does not matter.  I had this questions explained to me by a professor (not math professor), but it was not clear in the explanation.  We were given the answer $(1-(\frac56)^n)^6 = .5$ or $n = 12.152$  Can someone please explain this to me, possibly with a link to a general topic?


I have a list of 20000 email id which have emails from domains like gmail, ymail, gmx, hotmail, custom domains etc I have those list in a spreadsheet Column A. Can you help me separate them according to their domain in different columns?   For example gmail ids in column B and ymail in column C and so on....

I have a txt file which has around 20000 email id. I want to know email count from gmail, yahoo, ymail, googlemail, aol, live,custom domain, gmx, and other temporary emails separately. And also i need to filter them and sort them in email domain order. How can i do that using notepad++? If any other program make this much easier than notepad ++  please refer that too.


I am passing data through a bean, but whenever I use the passed data in a if function it never passes the first check.  I will also post the result for just printing out the Get_Functions I am using.  The inputs I use are just admin and password.  JSP Code:  <jsp:useBean id="user" class="User.GetInfo" scope="session"/>  <HTML> <BODY> <% if (user.getUsername() == "admin") {     if (user.getPassword() == "password" ) {         session.setAttribute( "LoggedIn", true );         response.sendRedirect("AdminPage.jsp");      } else {         session.setAttribute( "LoginError", "Wrong password." );          response.sendRedirect("AdminLogin.jsp");     } } else {      session.setAttribute( "LoginError", "Wrong username." );      response.sendRedirect("AdminLogin.jsp"); } %> </BODY> </HTML>   Results for just printing out code:  You entered  Name: admin  Email: password

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I'm planning a trip to South-Korea in April. I was looking at flight ticket prices and found that I can go from Brussels to Seoul (and back) for about 600€. It lands in London however. I then tried to find the same flight but from London (I was expecting I could get the price even more down if I'm not doing BRU-LHR), but no search engine found it and the cheapest was at about 700€.  Here you can see what I'm talking about in action:    It's the same date and everything, and it's much cheaper from Brussels although it lands in London.  Question: This seem really strange.  Why does this happen, and is it possible to buy the ticket from Brussels but only get on the plane from London?

Usually I find a flight I like that uses one or more connections with the same or different companies. In these cases, if the distance between the first and the second connection is not too large, I prefer to go by bus or train and then take the flight. The problem is that sometimes it is more expensive to take the flight in the second airport than to take the flight from the first one. I mean, I'm wondering why sometimes it is more expensive to take only a flight than to take the same flight and another one.  A practical example (and real, you can check with SkyScanner). Imagine I am in Madrid (Spain) and would like to go to Rio de Janeiro (Brazil) on April 1st. The cheapest flight I have found is this:     TAM airlines: MAD -> GRU -> GIG : 507 €   Fantastic! GRU is one of São Paulo's airports. That's perfect for me! I'll go on to Rio traveling overland. But then, I look for this flight (MAD -> GRU, non-stop):     TAM airlines: MAD -> GRU : 597 €   It's the same flight, 90 € more expensive! I've found this kind of behavior a lot of times and I'm intrigued to know why it happens.


I have both Windows 7 x64 and Ubuntu 16.04 x64 installed on my laptop. I figured out that the Windows 7 option no longer appears on dual boot.

So, I've successfully dual-booted my Windows 8 machine with Ubuntu 12.04 . However, I still don't have a convenient method of choosing what OS to load at boot time.  After installing Ubuntu, my computer still loads Windows 8 directly. I then added grubx64.efi to the white list of my boot loader. But after that, my machine loads Ubuntu directly without even a shadow of GRUB showing up!  I used boot-repair and I got this paste.ubuntu URL: . After running boot-repair (and re-white listing the grubx64.efi file), GRUB now shows up but without any Windows 8 option!  Lastly, I ran sudo fdisk -l and it gave me this:  WARNING: GPT (GUID Partition Table) detected on '/dev/sda'! The util fdisk doesn't support GPT. Use GNU Parted.   Disk /dev/sda: 750.2 GB, 750156374016 bytes 255 heads, 63 sectors/track, 91201 cylinders, total 1465149168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disk identifier: 0x6396389f     Device Boot      Start         End      Blocks   Id  System /dev/sda1               1  1465149167   732574583+  ee  GPT Partition 1 does not start on physical sector boundary.   I'm guessing my problem has something to do with the warning from fdisk above but I don't know what to do with it. How do I proceed now?  Edit  My etc/default/grub is as follows:  # If you change this file, run 'update-grub' afterwards to update # /boot/grub/grub.cfg. # For full documentation of the options in this file, see: #   info -f grub -n 'Simple configuration'  GRUB_DEFAULT=0 #GRUB_HIDDEN_TIMEOUT=0 GRUB_HIDDEN_TIMEOUT_QUIET=true GRUB_TIMEOUT=10 GRUB_DISTRIBUTOR=`lsb_release -i -s 2> /dev/null || echo Debian` GRUB_CMDLINE_LINUX_DEFAULT="quiet splash" GRUB_CMDLINE_LINUX=""  # Uncomment to enable BadRAM filtering, modify to suit your needs # This works with Linux (no patch required) and with any kernel that obtains # the memory map information from GRUB (GNU Mach, kernel of FreeBSD ...) #GRUB_BADRAM="0x01234567,0xfefefefe,0x89abcdef,0xefefefef"  # Uncomment to disable graphical terminal (grub-pc only) #GRUB_TERMINAL=console  # The resolution used on graphical terminal # note that you can use only modes which your graphic card supports via VBE # you can see them in real GRUB with the command `vbeinfo' #GRUB_GFXMODE=640x480  # Uncomment if you don't want GRUB to pass "root=UUID=xxx" parameter to Linux #GRUB_DISABLE_LINUX_UUID=true  # Uncomment to disable generation of recovery mode menu entries #GRUB_DISABLE_RECOVERY="true"  # Uncomment to get a beep at grub start #GRUB_INIT_TUNE="480 440 1"   Also, just for the record,  in installing my dual-boot. The tutorial (which uses, 11.10, I must note), doesn't mention anything about this problem. Is there anything there I shouldn't have done?


I have a question about econometrics in general. If I have a regression with an interaction between two dummies, do I need to have those dummies separated in the regression too. I have this regression: is this right? $$ y_i=\beta_0 + \beta_1d\_sex_i*d\_country_i +\beta_2d\_country_i + \varepsilon_i $$ or do I need to do this: $$ y_i=\beta_0 + \beta_1d\_sex_i*d\_country_i +\beta_2d\_country_i + \beta_3d\_sex + \varepsilon_i $$

Is it ever valid to include a two-way interaction in a model without including the main effects?  What if your hypothesis is only about the interaction, do you still need to include the main effects?


I am still having trouble understanding how voltage sources combine when they are connected in parallel. Consider the following circuit below:  If we assume that the wires connecting the resistor to the two voltage sources are perfect (zero resistance), then we get what appears to be a paradox since the voltage at node 1 needs to be both 1V and 2V at the same time. In reality, this situation is resolved by the finite resistance that real wires possess. My misunderstandings occur when one of the voltage sources is an AC source such as below. In this case, is the voltage at node 1 really just a sum of the AC and DC sources? In this scenario, does this mean that the DC source outputs an AC current in order to maintain a constant voltage? Would this AC current coming from the DC source be in-phase with the current from the AC source in order to cancel out the AC source's effects on the DC source? Also, for real world applications, does this type of connection lead to any negative effects that would damage the AC or DC source? I've seen suggestions that using a capacitor or transformer would be better to add AC and DC voltages rather than connecting them directly.

I realize connecting two different voltage sources in parallel is a contradiction (in an ideal circuit). But if I were to connect this in practice and measure the voltage across points A and B, what value of voltage would it show? And how much current would be sunk by the 5V battery? (Non ideal conditions)


I'm starting a course on algebraic structures in university, and this is one of the first problems. I want to know if my solution is valid. The question goes like this:  Being $G$ non-empty semigroup (set with associative binary product). We know that $G$ verifies that:  $\exists e\in G:ex=x \forall x\in G$ ("left" neutral element). $\forall x \in G, \exists y\in G : yx=e$ ("left" inverse element).  Prove that $G$ is group.  My solution goes like this: $$e=ee=(g^{-1}g)e=g^{-1}(ge)$$ Then necessarily $ge=g$, because $g^{-1}(ge)$ must be equal to $e$. So that proves that $e$ is in fact left and right neutral element of $G$. Now, we see that: $$g=ge=g(g^{-1}g)=(gg^{-1})g$$ and we conclude that $gg^{-1}=e$ because $(gg^{-1})g$ must be equal to $g$, so we conclude that $g^{-1}$ is left and right inverse element of $g$. Given this, I conclude that $G$ is in fact group. Is my reasoning correct? I'll thank any help.

Related Link:    Reference: Fraleigh p. 49 Question 4.38 in A First Course in Abstract Algebra     I will present my proof (distinct from those in the link) for critique and then ask my question.  $G$ is a set and $ \times $ is an associative binary operation.  Suppose that there exists a $e \in G$ such that, for all $a \in G$, $ea = a$ and $a^{-1}a = e$ for some $a^{-1} \in G$.  Show that for the same $e$, $ae = a$ and $aa^{-1} = e$.  $a^{-1}(aa^{-1})a = (a^{-1}a)(a^{-1}a) = ee = e = a^{-1}a = a^{-1}(a^{-1}a)a$  Since $a^{-1} \in G$, it has a left inverse; apply it to both ends, and we have $(aa^{-1})a = (a^{-1}a)a$.  As a result, $ae$ = $a(a^{-1}a) = (aa^{-1})a = (a^{-1}a)a = ea$.  For the right inverse, start with $aa^{-1} = a(a^{-1}a)a^{-1} = (aa^{-1})(aa^{-1})$.  Since $\times$ is a binary operation, $aa^{-1} \in G$ and has a left inverse; apply it to both ends, and we have $e = aa^{-1}$.  In second comment following the question in the link, Mr. Derek Holt pointed out that the requester did not word his/her question correctly.  Specifically, the identity in the second axiom is not well-defined.     Let $(G, *)$ be a semi-group. Suppose    1. $ \exists e \in G$ such that $\forall a \in G,\  ae = a$;    2. $\forall a \in G, \exists a^{-1} \in G$ such that $aa^{-1} = e$.    How can we prove that $(G,*)$ is a group?    This formulation makes the same technical error as many textbooks. The $e$ in your second axiom is not well-defined. "But obviously it's intended to be the same $e$ as in the first axiom" you reply. But the first axiom does not necessarily specify a unique element $e$. So should we interpret the second axiom as meaning "for some $e$ as in 1" or "for all $e$ as in 1"? –  Derek Holt Sep 17 '11 at 15:31   Was he saying that if, in axiom 1, we have $ae_1 = a, ae_2 = a$, but $e_1 \neq e_2$,  when we get to axiom 2, do we have $aa^{-1} = e_1, aa^{-1} = e_2$, or two different inverses so that $aa_1^{-1} =  e_1, aa^{-1}_2 = e_2$?  I think my wording eliminated the ambiguity.  It does not imply that $e$ is unique, but if $e$ is a left identity and produces left inverses, then it is also a right identity and produces right inverses. I tried really hard on this one; please kindly point out my mistakes.


I was using the Stack Exchange mobile website today and came across a title that messed up the layout a bit. Not sure whether this has been noted to the admins already.  See screenshot of the issue:    As can be seen, this is probably caused by the inline code environment in combination with a long string containing no spaces that is longer than allowed.

I’ve found a small, yet annoying, CSS-error in the mobile view of Stack Exchange. It seems like long titles breaks the style, which causes the up-vote arrow and the answer button to break the row and fall beneath the intended spot. From the looks of it, the title cell, or the tags, increase too much and causes this minor CSS-error.    Is it possible to fix this?


I want to define a literal object in Javascript so that, for example:  myObject.foo()   returns an anonymous function, but   myObject.foo.bar()   returns a different anonymous function, and  myObject.foo.status   equals some string, etc.  Assume I'm starting with something like:  var myObject = {     foo: {         bar: function () { ... },         status: "someString"     } }   How would I modify this accordingly?  Is it proper syntax to add a static reference like:  myObject.foo = function() { ... }   My guess is that, if valid, that would override the definition of foo entirely.  Is there an elegant way to achieve this?  I am creating a literal object that maps directly to a REST API URL so there is consistency between the URL and its object reference.  For example, if the relative URL for a particular API call is myObject/foo and another is myObject/foo/bar, then I would like the JS functions to be myObject.foo() and myObject.foo.bar(), respectively.

JavaScript allows functions to be treated as objects--if you first define a variable as a function, you can subsequently add properties to that function.  How do you do the reverse, and add a function to an "object"?  This works:  var foo = function() { return 1; }; foo.baz = "qqqq";   At this point, foo() calls the function, and foo.baz has the value "qqqq".  However, if you do the property assignment part first, how do you subsequently assign a function to the variable?  var bar = { baz: "qqqq" };   What can I do now to arrange for bar.baz to have the value "qqqq" and bar() to call the function?


I have created a script that works as expected in shell but cron job does not seem to run it. when I check my cron mail, I see that it prints "hltv is not running" but does not create a screen session.  #!/bin/bash if [[ $(netstat -a | grep '27027') == *27027* ]]; then echo "tour 2 hltv is running" else echo "hltv is not running" /usr/bin/screen -A -m -d -S tour2 ./start_hltv +connect xxx.xxx.xx.xx:27015 -port 27027 +exec hltv.cfg fi   I have replaced my ip with xx.xxx.xx.xxx for privacy reasons.  Further details.. Well, I have a centos vps that I use for hltv (related to half life game) that runs on port 27027. Every once in a while, it crashes, so I was trying to create a script that would check if something is happening on that port and if not, it means process is crashed and need to start it.  I created script and named it "autorestart" and ran  chmod +x autorestart   This is the output i get from my cron job mail, but screen -ls does not show tour2 as valid screen.     Message-Id: <20140330021701.71D591A5B@hltvvps.localdomain> Date: Sat,   29 Mar 2014 22:17:01 -0400 (EDT)      hltv is not running   Thanks  Edit. Got this working.   #!/bin/bash if [[ $(netstat -a | grep '27027') == *27027* ]]; then echo "tour 2 hltv is running" else echo "hltv is not running" cd /usr/hlds/tour2 chmod +x ./run_hltv (run_hltv has screen command) sh run_hltv

This is a  about using cron & crontab.   You have been directed here because the community is fairly sure that the answer to your question can be found below. If your question is not answered below then the answers will help you gather information that will help the community help you. This information should be edited into your original question.  The answer for 'Why is my crontab not working, and how can I troubleshoot it?' can be seen below.  This addresses the cron system with the crontab highlighted.


I'm trying to redirect www.domain.com to sub.domain.com except when url is www.domain.com/something and in that case keep it that way. I couldn't find any solution on the google and anytime I try to implement this in my own, I get www.www.domain.com. Thanks in advance!  Options +SymLinksIfOwnerMatch Options -Indexes  RewriteEngine on RewriteCond %{HTTP_HOST} !^www\. RewriteRule ^(.*)$ http://www.%{HTTP_HOST}/$1 [R=301,L]

I would like to redirect www.example.com to example.com. The following htaccess code makes this happen:  RewriteCond %{HTTP_HOST} ^www\.example\.com [NC] RewriteRule ^(.*)$ http://example.com/$1 [L,R=301]   But, is there a way to do this in a generic fashion without hardcoding the domain name?


I have strings that contain white-space and punctuation characters that I want to decompose into individual characters. However, I want to avoid breaking up certain sub-strings that have a specific meaning such as ... or - or \n\r. For example, the string \n\r\n... .. - -.. should be decomposed into ['\n', '\r\n', '...', '.', '.', ' - ', '-', '.', '.']  I've tried using re.findall() and re.split() but without success. The following produced so far the best results (I included only some of the delimiters here to make the example shorter): delimiters = [     r'\r\n',     r'\n',     r' - ',     r' ',     r'...',      r'\.', ] pattern = re.compile(r'(' + r'|'.join(delimiters) + r')') match = pattern.split('\n\r\n... .. - -..') print([m for m in match if m])  which gives ['\n', '\r\n', '...', ' ', '.. ', '- -', '.', '.']  This is very close but I don't understand why ..  and - - are matched.

I am tired of always trying to guess, if I should escape special characters like '()[]{}|' etc. when using many implementations of regexps.  It is different with, for example, Python, sed, grep, awk, Perl, rename, Apache, find and so on. Is there any rule set which tells when I should, and when I should not, escape special characters? Does it depend on the regexp type, like PCRE, POSIX or extended regexps?


I want to know why there are two folders while we need one. Eg. Program Files and Program Files(x86)

I know that on a 64-bit version of Windows the "Program Files" folder is for 64-bit programs and the "Program Files (x86)" folder is for 32-bit programs, but why is this even necessary?  By "necessary", I don't mean "why could Microsoft not have made any other design decisions?" because of course they could have. Rather, I mean, "why, given the current design of 64-bit Windows, must 32-bit programs have a separate top-level folder from 64-bit programs?" Put another way, "what would go wrong if I somehow avoided the redirection mechanism and forced everything to install to the real C:\Program Files\?"  There are plenty of questions on Super User and elsewhere that assert "one is for 32-bit programs, one is for 64-bit programs", but none that I can find give the reason. From my experience, it doesn't seem to matter whether a 32-bit program is installed in the correct place or not.  Does Windows somehow present itself differently to a program running out of "Program Files (x86)"? Is there a description that shows exactly what's different for a program installed in "Program Files (x86)" instead of "Program Files"? I think it's unlikely that Microsoft would introduce a new folder without a legitimate technical reason.


I'm writing my dissertation and that involves typing a lot of $\mathrm{CO_2}$. I'd like to make a macro for it that's a lot easier to type, but if I put \newcommand{\co2}{\mathrm{CO_2}}, for example, it gives me the error that \mathrm can only be used in math mode. But using \newcommand{\co2}{$\mathrm{CO_2}$} doesn't work either.  Is there a way for me to make a macro that makes typing CO_2 easier, even if it doesn't use \mathrm?

What is the 'best' package for typesetting chemical formulas? (I don't need anything but the chemical formulas.)  Assume I want to typeset     The dissociation of a AgBr molecure requires an energy of $E = \SI{123456789}{\J}$.   I am using the  package for the physical quantity but what about AgBr?


I find the meaning of hyperparameters not always clear. The hyperparameters are defined as "the parameters of the prior". Suppose that one has prior information about a certain parameter $\theta$. More precisely, one supposes that $\theta \sim N(\mu_0, \sigma_0^2)$. In that case, the hyperparameters are given by $\mu_0$ and $\sigma_0^2$.  But, what in case of a non-informative prior? What in case of a uniform prior? For instance, suppose we have the following model. We have data $y_1,\ldots,y_n$ where the likelihood is given conditionally on a parameter $\lambda$. Thus: $$y_i \ | \ \lambda \sim N\left(\mu,\frac{\sigma^2}{\sqrt{\lambda}}\right), \qquad \lambda \sim \Gamma(\nu/2,\nu/2)$$ with the non-informative prior $g(\mu, \sigma^2) \sim 1/\sigma$. So we have in fact three parameters $\lambda, \mu, \sigma^2$. What are the hyperparameters in this case?

Title says it all.  I have seen both "the hyperparameter of the Dirichlet distribution" and "the parameter of the Dirichlet distribution"  What are the differences?