Is there a name for the "a"/"an" exceptions?

"A person" or "an ornament" are normal instances of 'A' being followed by consonants or vowels. However the rule seems to have exceptions when a word sounds like it starts with the opposite, such as "an hour" or "a url" (when url is pronounced letter by letter).  Is there a name for this kind of exception?


An accelerated charge produces an electromagnetic wave. Is light an electromagnetic wave despite not having charged particles?

Light is an electromagnetic radiation contrary to the law of electromagnetism that states that: an accelerated charge produce electromagnetic wave. Please explain.


Where i can find apps that existed in "start" command on cmd?

i wanna get the path of the folder so that i can see or add apps to start them from start command in cmd.


Let $z,w \in \mathbb C$ s.t $\bar z w \neq 1$ and $|z|\leq 1, |w| \leq 1$ then $ |\dfrac{z-w}{1-\bar z w}| \leq 1$  The hint is to show that $ |z-w|^2\leq |1-\bar z w|^2$ but i cant relate those 2


Inserting entries in a list without sorting the output

I have two lists as follows:  l1 = [1,3,5,7] and l2 = [2,4,6]  how can I get this output l3 = [1,2,3,4,5,6,7] ,that is, inserting the first entry from l2 as second entry in l1 and so on. Thanks in advance


Can't edit file in /tmp with 777 permissions even when root; Can delete;

I have a file that's owned by www-data:www-data and has rwxrwxrwx permissions. Despite being root I can't write to it, however I can remove it. The /tmp folder has drwxrwxrwt permissions. Where the problem might be? # Can't write to file root@app-web:/data/app# >> /tmp/app.log bash: /tmp/app.log: Permission denied  # Permissions on file root@app-web:/data/app# ls -alt /tmp/app.log  -rwxrwxrwx 1 www-data www-data 18788 /tmp/app.log  # I can remove it root@app-web:/data/app# rm -r /tmp/app.log  # Create it  root@app-web:/data/app# touch /tmp/app.log   # Write to it root@app-web:/data/app# >> /tmp/app.log   # Once I change owner back to www-data root@app-web:/tmp# chown www-data:www-data /tmp/app.log  # I can no longer write root@app-web:/tmp# >> /tmp/app.log bash: /tmp/app.log: Permission denied  root@app-web:/data/app# lsattr /tmp/app.log --------------e--- /tmp/app.log  root@app-web:/data/app# getfacl /tmp/app.log # file: app.log # owner: www-data # group: www-data user::rwx group::rwx other::rwx   My /tmp folder sits in / mount. overlay on / type overlay (rw,relatime,lowerdir=/var/lib/docker/overlay2/l/JYPNMY5ACNKQ4ZF6Z43DCI2ITB...upperdir=/var/lib/docker/overlay2/bf343e129700f4357a4d24bd0a9782d094e8e51f21e06932111ec432a3ab27dc/diff,workdir=/var/lib/docker/overlay2/bf343e129700f4357a4d24bd0a9782d094e8e51f21e06932111ec432a3ab27dc/work,xino=off)  Permissions of /tmp drwxrwxrwt   1 root root 4096 tmp


What are the documents we need to carry for flight journey within India?

I need to go Kolkata from Vijayawada by air but don't have a passport. I do have a valid voter card, an  and a .  What are the documents I need to carry?


How can I reverse (flip horizontal) a table?

I want to reverse (flip horizontal) all columns in some tables like this:  \documentclass{book} \begin{document} \begin{center} \begin{tabular}{c|c|c} $p$ & $q$ & $p\vee q$ \\ \hline $T$ & $T$ &T\\ $T$ & $F$ &T\\ $F$ & $T$ &T\\ $F$ & $F$ &F   \end{tabular} \end{center} \end{document}   I wrote these tables in Persian Xe-TeX and this language is a right to left writing language, and these tables appear reverse in output, so I used \lr command but the tables broke down and went out from centering also. I don't want to rewrite them. How can I fix it?


How find this limit $\lim \limits_{x\to+\infty}e^{-x}\left(1+\frac{1}{x}\right)^{x^2}$

find this limit     $$\lim \limits_{x\to+\infty}e^{-x}\left(1+\dfrac{1}{x}\right)^{x^2}$$   my idea: $$\lim \limits_{x\to+\infty}e^{-x}\left(1+\dfrac{1}{x}\right)^{x^2}=\lim \limits_{x\to+\infty}e^{-x}\cdot e^x=1$$  But book is answer is not 1? and How about find it? Thank you


Is it bad to leave the crock pot on "warm" (not low) all day?

I just bought all the ingredients to make a soup in the crock pot. I was planning on having it cook all day, but I just realized the recipe only calls for it to cook on low for 3-4 hours. If I cook it on low for 3-4 hours, and then put it on warm before I leave for work, will it be a bacteria minefield or will it be warm enough to keep the food safe from bacteria?


I am creating the oh-so-common Events custom post type and I want to use the published date as my event date. Eventually, in my archive, I will make sure to display posts with the scheduled status.  I know I can add a custom metadata, and I am already doing it for other datas, but I believe that in this case using the publishing data is the best. First of all, it will allow me to easily query for upcoming events or past events; secondly, nobody really cares of when an event was published; and thirdly, but most importantly, I want my archives permalinks to have the /date/post/ structure (ex. /2013/10/awesome-event) and it makes much more sense to have the event date there rather than the published date.  I browsed a bit through the WP core file that creates that metabox, and I couldn't find any filter that I could hook in to edit that label. Titles of the metaboxes are easily editable, but it looks like labels not so much.  Any suggestions on how to achieve something like this.


How to properly set URL for links and other assets

I want to use the full URL for the location of my css, js, and image files in my header.php file. So that when the header.php file is called from another folder directory, it doesn't break the link.  However, I want the site to be accessible by http and https, set by the user in their profile settings in the web application.  I started to write some code below of the solution but I'm not sure if this is the correct way of handling this.  config.php   <?php // use https $use_https = true; ?>   header.php  <?php if ($use_https == true) {    $proto = "https://"; } else {    $proto = "http://"; } ?>    <a href="<?php print($proto . $_SERVER["SERVER_NAME"]); ?>/some-folder/">Link


Windows 7 won't boot after side-by-side installation of Ubuntu 14.04.1

I installed Ubuntu 14.04.1 from a DVD I burned. Ubuntu runs perfectly, but when I select Windows 7 from GRUB, the screen goes blank (with some coloured lines at the very top of the screen). From here, the only way to get back to GRUB to force shut-down the machine from the power button.  I have updated grub2.  I have also tried boot repair, but all it did was create two Windows options from GRUB menu:   Windows 7 (loader) (on /dev/sda1) Windows 7 (loader) (on /dev/sda2)   Both of them have the same result as earlier. Blank screen with some colourful pixels at the top of my monitor (top 2 or 3 pixels). Here's my boot repair .  P.S. This is not a duplicate of  as I am able to select Windows from the grub menu but it crashes afterwards.


Can a child enter the UK with his older brother even though his brother is not the person listed to accompany him on his visa?

My mum, little brother and I plan to travel to the UK but my 15 year old brother’s visa states that it’s only valid if accompanied by my mother. Unfortunately my mum cannot travel any longer for medical reasons. Is there any way my little brother and I, his older brother, can be allowed to enter the UK without my mum?


Finding solutions to non elementary integrals

For integrands such as $e^{-x^{2}}$ is it possible to transform into a Taylor series and exchange the summation with the integral similar to the problem sophomore's dream? $$\int e^{-x^{2}}dx=\int \sum_{n=0}^\infty \frac{(-x^{2})^{n}}{n!}dx$$ I have used the same method to evaluate $\int x^{x}dx$ and I have evaluated this integral numerically too getting the exact answer. Could this method be used to evaluate all non-elementary integrals?


Installing grub2 in efi-mode in usb flash drive

I've two different OS, which one is ubuntu. I'm using a PC, NOT a Mac. I use Chimera bootloader that don't find Ubuntu. So, i'd like to install grub 2 in EFI-mode on flash-drive USB. In this way, i can load Ubuntu only if the usb flash-drive is connected.  I followed this guide  replacing "/dev/sda" in  sudo efibootmgr --create --gpt --disk /dev/sda --part 1 --write-signature --label "GRUB2" --loader "\\EFI\\grub\\grub.efi"   with the usb-pen directory. Then, i've copied the grub.cfg file that exists in Ubuntu partition.Result? Grub2 loads, but when i select the menu entries, grub2 doesn't find any command, or disks. How can i fix this problem?  P.S. Here, there are the photo of the error(when i select ubuntu entry in grub2), the usb-drive's contents and the grub.cfg file


Incorrect name and broken image for site at SEDE

Over at , on the list of sites,  is still listed as "Cognitive Sciences" and the image is scrambled:  Can we fix that?


How to retrieve email address of current user?

In Google Spreadsheet I am having the following issue:  I am using Session.getActiveUser().getUserLoginId() to fetch the current user's email id but other than creator of the spreadsheet it is returning empty string. I have also used getEffectiveUser() but no help.  I have even deployed this to "User accessing the web app" but still it's not working.  How can I fix this?


How is it that Legolas always has a quiver full of arrows?

In the movie version of Lord of the Rings, Legolas is seen many times shooting arrow after arrow, yet he never seems to run out.  For example, after the long battle at the end of The Fellowship of the Ring, his quiver is completely filled.  Where are all these arrows coming from? Is it some form of elven magic? If so, it is never explained either in the movie, nor in the book that I can recall.


Disabling the trackpad from the command line

How can I disable the trackpad (without restarting my computer) from the command-line on OS X Mavericks?


My text's font style changes and goes to italic after using the Pi symbol

After using the Pi symbol (\Pi), my text changes to a different font and goes to italic. How can I resolve this?


What's the difference between two array declarations in Java?

In my book they've been switching the way the declare arrays between the following two methods:      int array1[] = {1, 2, 3};     int[] array2 = {1, 2, 3};   I was wondering what the difference was between the positioning of the two brackets, and why is it that when I put the brackets after the name (such as in array 1), why I must either initialize it to a set of values or a new array, but in array2, I can simply say "int[] array2;" and then use it later...?


When are moderator flags automatically dismissed as "aged away" by the system?

Moderator flags can be dismissed as aged away.   What does this dismiss reason mean? What causes flags to be dismissed with this reason? Do aged away flags affect my daily flag amount? Can I cast a flag again if it gets marked aged away?


Help with Limit: $\lim_{n \to \infty} \frac{(2 n)! e^n (n)^n}{n! (2 n)^{2 n}}$

Help with Limit: $$\lim_{n \to \infty} \frac{(2 n)! e^n (n)^n}{n! (2 n)^{2 n}}$$  EDIT: Posted a similar question just yesterday but bad formating from my part dropped a term, and lead me to strange places. Honestly, I am just plain stuck, I have been hitting my head against it for $2$ days straight. I know the solution should be $2^{-1/2}$ but...  Help would be appreciated. If anyone has a Wolfram Alpha PRO account I am sure that thing churns out the solution as it is something quite basic I just don't see it and its driving me crazy.


How can I install psensor and use it my Ubuntu mate? I think my laptop has an overheating problem.


I am trying to position node(2) in a page in coordinates related to the page (origin at upper left corner of the body of the page). My code is:  \documentclass[border=10pt,a4paper]{memoir} \usepackage[total={16.51cm,21.59cm}, top=1.2in, left=0.9in, includefoot]{geometry} \usepackage{tikz} \usepackage{fancyhdr} \usepackage{comment} \pagestyle{fancy} \fancyhf{} \renewcommand{\headrulewidth}{2pt} \renewcommand{\footrulewidth}{1pt} \begin{document} \begin{tikzpicture} \node[](1) at (0cm,0cm) {1}; \node[](2) at (0.5\textwidth,-0.5\textheight) {2}; \end{tikzpicture} \vspace{1cm} \noindent \end{document}   For node(2) to be positioned in the centre of the page at (0.5\textwidth,-0.5\textheight) I have to create another node (1) in the origin, otherwise node(2) will be put at (0,0). I would like that someone could explain this strange behaviour.


Let $f$ be a real valued continuous function on the interval $[0,1]$ such that $$\int_0^1  x^n f(x) dx=0$$  for $n=0, 1, 2 ...$. Show that $f$ is identically zero.


What is desired practice for deriving answers from comments?

If I ask a question on SO and someone comments on it, not solving the problem, but leading to my solution nonetheless, what is the best way to handle assigning the correct answer? I could just answer it myself with a full explaination, but at the same time, I wouldn't have solved the problem otherwise. What is the best way to handle credit in such a case?


I am trying to compute a regression.  I have a continuous dependent variable (investment in millions of dollars) One continuous independent variables Five dichotomous indicators (1 / 0) Four interactions. Robust standard errors are being used.  N=569.  Is there any particular reason why the F-Test is not being worked out in Stata?  Stata help says:     Your estimation results show an F or chi2 model statistic reported to   be missing.  Stata has done that so as to not be misleading, not   because there is something necessarily wrong with your model   The problem seems to be related to the interactive dummy variables, because when I remove them the F test is calculated.  The regression output is the following  Linear regression                                        Number of obs =  580                                                          F(  9,   569) =  .                                                          Prob > F      =  .                                                          R-squared     =  0.2336                                                          Root MSE      =  1.2608                                             Robust lninv                         Coef.       Std. Err.  t      P>t    [95% Conf. Interval]  age                           0.1392668   0.0363307  3.83   0.000    .0679081  0.2106255 1.idicatorone                 0.4070426   0.2380546  1.71   0.088   -.0605304  0.8746155 1.indicatortwo                1.085003    0.1235029  8.79   0.000    .8424262  1.327581 1.indicatorthree              -0.4390229  0.1781991  -2.46  0.014   -.7890312 -0.0890145 1.fincrisis                   0.4526393   0.1376538  3.29   0.001    .1822677  0.7230108 1.bubble                      1.657902    0.1088199  15.24  0.000    1.444165  1.87164 indicatorone#indicatortwo                                                          1 1                       0.0810565   0.2113363  0.38   0.701   -.3340379  0.496151  bubble#indicatorthree                                                             1 1                       -0.8225963  0.2688304  -3.06  0.002   -1.350617 -0.2945752 fincrisis#indicatorthree                                                           1 1                       -0.1068982  0.2141135  -0.5   0.618   -.5274474  0.313651  indicatorthree#c.age                                                          1                             -0.0103719  0.0450553  -0.23  0.818   -.0988669  0.0781231  _cons                        0.0378515   0.1878819  0.2    0.840   -.3311753  0.4068783


Would chocolate liqueur cherries be allowed through Australian customs?

If the liqueur cherries have a stem and seeds will they be allowed into Australia through Australian customs?


Is formal truth in mathematical logic a generalization of everyday, intuitive truth?

I'm trying to wrap my head around the relationship between truth in formal logic, as the value a formal expression can take on, as opposed to commonplace notions of truth.  Personal background: When I was taking a class in formal logic last semester, I found that the most efficient way to do my homework was to forget my typical notions of truth and falsehood, and simply treat truth and falsehood as formal, abstract values that formal expressions may be assigned. In other words, I treated everything formally, which from the name of the course is presumably what I was supposed to do while solving problems.  On the other hand, I came out of the course more confused than enlightened about what truth refers to in mathematics. For example, on what levels are each of the following two statements "true"?        There are infinitely many prime numbers.   The empty function $f\colon \emptyset \to \mathbb R $ is injective.      For the first one, I can obviously see that there would be a contradiction if there were only finitely many prime numbers. To me, the classic proof by contradiction is not a "formal proof" or anything; it is merely a natural language argument that proves (in the everyday sense of the word "proves") why the statement must be true (in the everyday sense of the word "true").  On the other hand, I run into trouble when I try to think about the second one. The very concept of the "empty function" doesn't even feel like it makes sense, but if I think about it as the relation between $\emptyset$ and $\mathbb R$ containing no elements, and then try to write out the statement formally, I get (if I did it correctly)     $ \forall x \forall y ( ((x\in \emptyset) \land (y\in \emptyset) \land (f (x) = f (y))) \implies (x=y)) $   which I think has to be true in a formal sense (since the antecedent is always false?). But to be honest, I don't really know how to think about "truth" here; the situation feels much more confusing than with the first statement.  So, in conclusion, my questions are:     In what sense is each of the above statements "true"? And, more generally,      Is the notion of truth in (mathematical) logic just a formal value assigned to expressions? Or should I think of it as encompassing, but also generalizing, the intuitive notion of a true statement?   (Any insightful comments or answers are appreciated, even if they don't address all of my questions directly.)


I need to find the intersection point of 2 line segments (lines are finite, i.e., they have end points).   e.g. segment 1 from $(x_1, y_1)$ to $(x_2, y_2)$ -- segment 2 from $(x_3, y_3)$ to $(x_4, y_4)$  you can assume $m_1$ and $m_2$ are the gradients of segment 1 and segment 2 respectively  similarly, $c_1$ and $c_2$ being the y-intercepts of segment 1 and segment 2 respectively  Using $y=mx+c$ I can easily find the equations of both lines and then derive the intersection point from those equations and check if that point actually lies on both the line segments (intersection point may not lie between the end points).  My problem is when I calculate the gradients $m_1$ and $m_2$ I do $\frac{y_2-y_1}{x_2-x_1}$ there for if one of the lines is vertical then I am going to have problems. How can I deal with this?  Another problem is that if the two segments intersect at a point which is also the same as one of the end points then I want to assume that they are not intersecting.  e.g. if segment 1 is from $(2, 3)$ to $(3, 7)$ and segment 2 is from $(3, 7)$ to $(7, 3)$ then I want to assume they don't intersect.


How do I change directories from the command line?

I'm try to change to my Desktop directory from the terminal.  Running  cd /home/desktop   gives an error in the terminal saying no directory found.  What am I doing wrong?


How do I turn off the onscreen keyboard on the lock screen?

The lock screen has an on screen keyboard that I am unable to disable. I don't remember exactly but I believe I turned it on using the "Screen Keyboard" setting in the Universal Access settings. I've tried a number of things all with no effect:   Toggling "Screen Keyboard" in Universal Access Toggling "Onscreen keyboard" in the login screen (LightDM) Clicking on the "x" in the upper right corner of the keyboard


Can a 3rd party charger damage my macbook pro?

I forgot my macbook pro charger at a friends place and I won't have it for a week. I saw that there are 3rd party chargers being sold for half the price of official chargers. Can 3rd party chargers damage my macbook pro? After I get my normal charger back in a week I will be mostly using that one and keep the new one as an extra, so I won't be using it fulltime.


How do I search a specific user's answers?

I have a question, that I know was answered by a specific user, but I can't find it via a general search.  Can I narrow my search to that user's responses?  If not, please make it so.


Accuracy of shape area measurements when GCS shapefile is source of layer in PCS Data Frame?

I would need to deliver a result shapefile in WGS 84 (GCS: Geographic –lat/lon- coordinate system), the shapefile is originally in WGS84; but in the process of creating this result shapefile I need to measure areas (the ArcGIS Calculate geometry tool doesn’t allow calculating areas with the Data frame coordinate reference system set to a GCS).  The solution I find in ArcGIS is: set the Data Frame coordinate system to a proper projected coordinate system for that zone, work with the shape layer, in WGS 84 (GCS) whereas the Data frame is in a Projected coordinate system, and once finished working and obtained the result shape layer, Export the shapefile by doing Data > Export Data and , for the option “Use the same coordinate system as:”, choose “this layer’s source data”.  Is it possible to make an accurate area measurement in a layer in meters, hectares, acres, etc, when the layer’s coordinate reference system is a GCS (though the Data frame has a projected coordinate reference system defined)?


What does that sin wave of a photon represent?

I had an interesting thought in one of my classes, when we were talking about photons... I thought that if the speed of light is the fastest speed, and light goes in a straight line, then how come the motion of a photon is a sin wave which would be a greater velocity by a ratio of a length of a sin wave between 0 and 2 pi and 2 pi.   Of course I realise that the motion of a photon is not a sin wave. The position of a photon is random within a certain area, but has probabilities of being in particular places (quantum mechanics).  The sin wave represents some kind of field, but I am not sure what, and how it relates to a photon.


Is adding a time dummy the same as estimating by within-time fixed effects?

Is it the same to estimate the time fixed effect by the within estimator and by simply adding time dummies in my regression equation? Why would that be the case mathematically?    edit    $$\text{Y}_{ist}=\gamma_s+TFE+\sum^m_{\tau=0}\delta_{-\tau}\text{D}_{s,t-\tau}+\sum^q_{\tau=1}\delta_{+\tau}\text{D}_{s,t+\tau}+\text{X}'_{ist}\beta+\varepsilon_{ist} \tag1$$  Where TFE mean time fixed effect, I can estimate this using within estimation in R or Stata, my question is that does estimate equation (1) using within estimator same as estimate the following equation (2)  $$\text{Y}_{ist}=\gamma_s+\text{time dummies}+\sum^m_{\tau=0}\delta_{-\tau}\text{D}_{s,t-\tau}+\sum^q_{\tau=1}\delta_{+\tau}\text{D}_{s,t+\tau}+\text{X}'_{ist}\beta+\varepsilon_{ist} \tag2$$


Is there a way to share the internet connection from mac to a iphone surpassing 802.1x protection without using vpn from the internet?

I want to share my internet connection(ethernet) to my iPhone, but the network is protected by 802.1x so that I cannot do so. I have already know that I can share the internet connection with my phone using a VPN, but unfortunately the ISP blocks all VPN connections. Is there another way to achieve my target?  OS X 10.10 with iOS 8.4  Thank you!


How to log transform data with a large number of zeros

I have a dataset comprised of continuous values that have about 30-50% zeros and a large range (10^3 - 10^10). I believe these zeros are not a result of missing data and are the result of the sensitivity of the machine taking the measurements. I would like to log10 transform this data so I can look at the distribution, but I'm not sure how to handle the zeros  I've done a lot of searching and found the following   Add a small constant to the data like 0.5 and then log transform  something called a boxcox transformation   I looked up boxcox transformation and I only found it in regards to making a regression model. I just want to visualize the distribution and see how it is distributed.   Currently when I plot a historgram of data it looks like this    When I add a small constant 0.5 and log10 transform it looks like this    Is there a better way to visualize the distribution of this data? Im just trying to get a handle on what the data looks like in order to figure out what kind of tests are appropriate for it.


Change MAC address of Intel(R) Dual Band Wireless-AC 7260

I tried to follow the instructions , but my card doesn't seem to have that option. Is there another way to do this?


$ sudo apt-get install cgroups-lite [sudo] password for neethu:  Reading package lists... Done Building dependency tree  Reading state information... Done E: Unable to locate package cgroups-lite


How can I gather (proper) food in the Nether? By "proper", I mean  any food excepting Rotten Flesh.


I want to install Ubuntu 16.04.1 LTS on ASUS ROG GL552VX-CN059D in dual boot with Windows 10, but the system freeze after I try with option "Install Ubuntu" or "Try Ubuntu ..." from Grub.  What is the problem? Thanks!


is overloading parantheses c++ a good idea

I have programmed in c++ for a couple of months, and I am starting to understand the core. At the moment I am trying to make a calender program with classes and inheritance (just to get more comfortable with object oriented programming), and a few weeks ago I learned about operation overloading.  I am wondering, is it a bad idea to overload parantheses for an object, such that I could for instance write this, or can an error occure becuase the compiler can confuse it for something else(constructor or something like that)?  //creating a valid year-object Year year1998 = Year(1998,true);  // the parantheses operator returns a day(another object) Day d = year1998(1,10);  //the overloading Day& Year::operator()(int monthNumber, int dayNumber){     //Just returns a day from the month class     return months[monthNumber][dayNumber]; }


Use of 'The' at the beginning of a sentence

The payment was made today Payment was made today  In which context, the above can be used.


Elements in 2d list repeated, while changing one value?

The following is python code, I initialize a 2-d list using operator *, and set the diagonal elements with other value. But get unexpected output.  table = [([False]*5)]*5 for i in range(5):    table[i][i] = 1   The expected output is   [[True, False, False, False, False],  [False, True, False, False, False],  [False, False, True, False, False],  [False, False, False, True, False],  [False, False, False, False, True]]   But I got   [[True, True, True, True, True],   [True, True, True, True, True],   [True, True, True, True, True],   [True, True, True, True, True],   [True, True, True, True, True]]   May the elements in the list refers one, I guess. How could I get the expected output without using numpy or other packages?


Application of maximum modulus principle

Let $f$ be a non-constant holomorphic(analytic) function in the unit disc$\{|z|<1\}$ such that $f(0)=1$ then it is necessary that  $(1)$ there are infinitely many points $z$ in the unit disc such that $|f(z)|=1 $  $(2)\  f$ is bounded  $(3)$ there are at most finitely many points in the unit disc such that $|f(z)|=1$  $(4)$ $f$ is rational function.  I tried the if (2)is true then and it is given that $f$ analytic then it will be constant.Am I right? How to disprove of prove other option($\textbf{ Here answer is unique}$).please help me.thanks in advance.


Firefox thinks I'm using and older Flash version

I'm running Firefox 35.0 on Fedora 20. It has the current latest Adobe Flash version (11.2.202.440).   Firefox is blocking Flash and displaying an alert bar, claiming it is outdated:    In English: Firefox has prevented an outdated plugin 'adobe flash' from running  Just to be sure, I ran:   yum reinstall http://linuxdownload.adobe.com/adobe-release/adobe-release-x86_64-1.0-1.noarch.rpm --  it installed adobe-release-x86_64.noarch 0:1.0-1.  yum reinstall flash-plugin -- it installed flash-plugin.x86_64 0:11.2.202.440-release.   Then I restarted Firefox in safe mode and checked about:plugins.  Shockwave Flash      File: libflashplayer.so     Path: /usr/lib64/flash-plugin/libflashplayer.so     Version: 11.2.202.425     State: Enabled (STATE_VULNERABLE_UPDATE_AVAILABLE)     Shockwave Flash 11.2 r202   Checking the actual .so file for versions strings, it looks like I have the correct version.  $ strings /usr/lib64/flash-plugin/libflashplayer.so | | grep "11.2.202" FlashPlayer_11_2_202_440_FlashPlayer LNX 11,2,202,440 11.2.202.440 drm/%s/%s/%s/11.2.202.440%s   What's going on and how can I fix it?


TikZ — rounded rectangle with transparent holes and custom width of borders

I'm trying to draw a rounded rectangle with round "holes" using  but I need the rectangle borders to be thick and "holes" borders to be thin. Is there a better way to do so than:  \begin{tikzpicture}[x=1mm, y=1mm]     % Background         \fill[fill=black!10] (1.5, 1.5) rectangle (15, -15);      % Fill     \fill[fill=black!2, even odd rule, rounded corners=0.5mm]          (0, 0) rectangle (10, -10)          (2, -2) circle[radius=1.25mm]         (2, -5) circle[radius=1.25mm];     % Rectangle border     \draw[thick, rounded corners=0.5mm] (0, 0) rectangle (10, -10);     % Holes borders     \draw[thin] (2, -2) circle (1.25mm);     \draw[thin] (2, -5) circle (1.25mm); \end{tikzpicture}   The result image should look like this:


How do I install Grub Customizer on Ubuntu 20.04?

I'm trying to install grub-customizer on Ubuntu 20.04 and it's not working.  This is what I've tried (as suggested by multiple websites):  $ sudo add-apt-repository ppa:danielrichter2007/grub-customizer  $ sudo apt update $ sudo apt install grub-customizer   It doesn't seem to find the package:  Err:13 http://ppa.launchpad.net/danielrichter2007/grub-customizer/ubuntu focal Release   404  Not Found [IP: 91.189.95.83 80]   This is the output from the last command:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package grub-customizer   I've read in a few places that people have been able to install this on 20.04 correctly. What am I doing wrong?  Thanks


variance estimator for a symmetrical two-sides censored normal distribution

Suppose to draw a sample of $n$ observations from $X \sim \mathcal{N}(0,\sigma)$, with observations outside the interval $(-c,+c)$ censored; $c$ is known and one can conveniently set $c=1$, for example.   If $m$ observations are $x_1,x_2,...,x_m$, and the other $n-m$ observations in the sample are censored, which is the ML estimator for $\sigma$ (or any other good estimator for it, giving priority to a closed form solution than to efficiency)?


Find all integer solutions for the equation $$x^2+7=2^n$$ where $n$ is a positive integer. Now as we can see that whenever $x$ is a solution of the equation $-x$ is also the solutions of the equation so we can assume that $x\geq 0$ Now writing the equation as $$x^2=2^n-2^3+1$$ and as $x$ is odd So we can write $x=2^mt+1$ such that $t$ is a positive integer and gcd$(t, 2)=1$ So for $n\geq 5$ our equation becomes $$2^{2m}t^2+2^{m+1}t+1=2^n-2^3+1$$ $$=>2^{m+1}t(2^{m-1}t+1)=2^3(2^{n-3}+1)$$ Now as gcd$(t, 2)=1$ So we get $m+1=3=>m=2$ and $$2^{n-3}-1=2^{m-1}t^2+t$$ $$=>2^{n-3}-1=2t^2+t$$ $$=>2^{n-3}-2t^2=t+1$$ $$=>2(2^{n-4}-t^2)=t+1$$ So we get $$2(2^{\frac{n-4}{2}}+t)(2^{\frac{n-4}{2}}-t)=t+1$$ Now $$t+2^{\frac{n-4}{2}}\geq t+1$$ So we get $2^{\frac{n-4}{2}}=1$ $=>n=4$ which is not possible as $n\geq 5$ So the given equation has no integer solutions for $n\geq 5$ Also $n=1, 2, $ does not give a solution But $n=3$ gives $x=-1$ and $x=1$ as the solution and $n=5$ gives $x=-5$ and $x=5$ as the solutions of the given equation Is this correct?


How can I write the null character on a Macbook Pro?

How can I write a null character on a Macbook Pro? I'd prefer to use just the keyboard or something that I can reach everywhere, without using a third-party program.


Showing $\vert \mathrm{det}(A) \vert \le \prod_{j=1}^n \Vert a_j \Vert_2$

Problem     Show $\vert \mathrm{det}(A) \vert \le \prod_{j=1}^n \Vert a_j \Vert_2$, where $a_j$ denotes the $j$th column of $A$, which is $n \times n$ matrix.     Try  When $A$ is singular, the result is trivial.  Otherwise, let us consider the matrix $U$, whose $j$th column, $u_j$ has unit length, i.e. $\Vert u_j \Vert_2 = 1, \forall j$. Then  $$ \det(U) \le 1 $$  where equality holds iff $u_j$'s are orthogonal.  I think I need to show   $$ \mathrm{det}(A) = \left( \prod_{j=1}^n \Vert a_j \Vert_2 \right) \det(U) \ \ \ (\ast) $$  because if it is true then   $$ \left( \prod_{j=1}^n \Vert a_j \Vert_2 \right) \det(U) \le  \prod_{j=1}^n \Vert a_j \Vert_2 $$  But I'm stuck at showing the above $(\ast)$.   Any help will be appreciated.


How to select a journal for publishing when my priority is to publish soon?

I am a PhD candidate in a small country. I have two Master degrees, one from an American university. I am also an experienced professional and an expert in the subject of my PhD studies (in my country, clearly). I need to publish a paper in an international journal as a condition to obtain my PhD. How do I choose a journal? I cannot afford years of waiting for the paper to be published, submit it and be rejected many times. I am looking through the journals, and there is simply no way to know which one is suitable for me. Any help? I understand about looking for journals which had previously published similar articles, but how to know that it is a journal which is likely to accept my article?  Thank you!


Is there a derivative that uses a Rolling Release model?

There were so many discussions about an Ubuntu with RR. They were so many pros and contras. At the end ubuntu wont be changed, the 6 month cycle system wont be changed. Thats fine!   But because there are so many people who would like to use an ubuntu with RR Im asking myself why isnt there an Ubuntu Derivate with RR. I couldnt found one, there are a loooot of Ubuntu Derivates but no RR. Is it just impossible? I mean Ubuntu = 6 months cycle, so the derivate have to be a 6 month cycle too? Is there no other option? Or are there already some smart guys trying to solve this problem? Thank you!


Let $G$ be a group of order $21$ contains contains an element $a$ of order $7$

Let $G$ be a group of order $21$ contains an element $a$ of order $7$ . Prove  that $A$=($a$) ,the subgroup generated  by $a$ , is normal in $G$ .   I'm more concerned with how I can derive the prove of this question


Order the results of a query by the same order as the IN statement

I have the following query  SELECT * FROM campaigns where campaign_id IN ( 'idStrOne', 'idStrTwo', 'idStrThree' );   The results of which are being ordered by the primary key of the table campaigns which is 'id'. This is not the order I want.   I want the results to come back in the same order as the arguments to the IN function. So in this case the order I want is   idStrOne, idStrTwo, idStrThree   How do I get this order?


UV Mapping looks messed up after unwrapping

I just marked the seams and unwrapped this human mesh. After I unwrap it, it looks like this ...      I have no idea why this is happening. Please ask, if you need further information.


Terminal engaged while using gedit or firefox

When I launch gedit or firefox from a terminal, the terminal is occupied(by occupied I mean no other commands can be run from the same terminal window) untill I press ctrl+c but it kills gedit or firefox. Any way other than opening a new terminal window?


How to GM as a Solar NPC who has high Intelligence and Wisdom scores?

I'm considering using a Solar (INT 25, WIS 25) as a semi-benevolent (but also kind of annoying) come-and-go guide of sorts to 3 high-level PC's in an upcoming campaign. While I would like to imagine that I can match this angelic being wit for wit, I don't think I could.  It's a tough pill to swallow, but I'm probably lucky to fall around 15 INT.    What are some ways in which this puny human GM can convincingly establish a super-intelligent Solar?  My main concern is that the Solar is smarter than me.  How can I hope to play a creature that far exceeds me in this ability which affects it's way of speaking, it's sharpness of mind and other aspects of character that are difficult to emulate?  What kind of prep will I need to do so I can fluidly present this NPC to the PC's?  From your experience, what works when role-playing a Solar NPC as a GM?


Let $R$ be an integral domain and $f,g\in R[X_1,...,X_n]$ where $n>1$. What is an example of a pair $f,g$ such that $\deg(fg)<\deg(f)+\deg(g)$?   Moreover, I have proven that the units of $R[X_1,...,X_n]$ are just the units in $R$. (Proof is done inductively) Is it true?  EDIT    Even though the each term in the underlined summation is nonzero, isn't it possible that the summation is 0? Why is this impossible ?


Optimal seasonality (frequency) value for Holt-Winters in time series prediction

I am trying to use Holt-Winters method in order to do time-series prediction on some datasets. The problem that I'm dealing with is the fact that each dataset has different seasonality value (or frequency basically). As an example, in one dataset the trend occurs every 300 timesteps while for another one this might be a different number. Assuming that I do not have the option of visualizing data each time to find out about the seasonality of my data, what would be the best way for finding the optimal value of frequency to get the best performance from Holt-Winters? Note that I receive about 500 out of 4000 samples to train my model.  My approach: Split train data to train and validation subsets. Use different seasonality values on train and evaluate performance on validation. For now, I think I'll use random search to find the best value such that it minimizes the prediction error on validation set. I was wondering if there are any other practical methods or approaches that any of you might be aware of?  UPDATE: I have to mention that I have to implement this only in python and not R, so the findfrequency() function from forecast package is applicable here.


This is a revision of my earlier question.  Sorry. I'm a beginner here and on a learning curve regarding format.    If the gravity well steepens to infinity at the point of a singularity, then so does the "time well".  Understandingly, the inward falling energy/matter is not aware of this change in time relative to the "outside" universe, locked as it is in its local reference.  How does the inward falling energy/matter ever "physically" reach the singularity?  It seems like the man counting to 100, going half way each time.  He gets closer and closer, but never actually arrives 100% there.


Quickly toggling visibility of certain symbology on ArcGIS Pro?

I'm trying to migrate from QGIS to ArcGIS Pro (still on trial version) and I have really basic problem.   How to quick toggle visibility of object with certain symbology (unique values symbology)?   In QGIS there is option to on/of visibility for symbol of every unique attribute value on Layers Pane. However, in ArcGIS PRO there is no option like that.  Here is how it look on QGIS:    ArcGIS Pro Contents pane:


Spotlight with Halo applied is creating rings around light

Here's a portion of a render I'm working on, which is backlit from behind by a spotlight with a "Halo" effect applied:    If you look carefully in the background, you'll notice the halo effect is creating "rings" of shadow as it fades.  How can I remove these rings and make the halo effect fade out smoothly?  I've played around with all the settings I can find without any success.  Here's my current settings for the spotlight:


When I start ubuntu up a purple screen pops up and then disapears again then a window comes up that says that I am running in low graphics mode. I click ok and then all I see is a black console. How do I get into the normal ubuntu?


Standard textwidth with geometry package

I really like the way LaTeX puts text on a4paper (quite large margins), but I need to \usepackage{geometry} to change the layout of my appendix. What options should be used with geometry to make everything (textwidth, margins etc) look identical to what it looks like without \usepackage{geometry}?  Another way to phrase it would be that I want the same output whether \usepackage{geometry} is commented out or uncommented. How is this done?  (I'm rendering PDF's with pdflatex, if that make a difference)


Laptop does not suspend when lid is closed

I'm a new Ubuntu 13.10 user. Closing the lid of my laptop does not result in the computer entering suspend mode, meaning each time I close my lid without manually suspending the computer the battery dies.  The proper settings are set in Power Management -- suspend the laptop on lid close for both AC and DC, but these do not have an effect on actual behavior.  It looks like this is a common problem for many users as far back as Ubuntu 11 -- the only solution I could find is the below. However, as a new linux user I'm not aware of how to actually execute the instructions. If someone could provide additional detail that would be tremendously helpful.  Thanks in advance.  /etc/acpi/events/lidbtn triggers /etc/acpi/lid.sh which triggers  /etc/acpi/local/lid.sh.post at the end of the script.  /etc/acpi/local/* allows you to add your own config (e.g. required for  wmii).   generate /etc/acpi/local/lid.sh.post  make it executable and add:   \#!/bin/bash  grep -q closed /proc/acpi/button/lid/*/state  if [ $? = 0 ]  then  /usr/sbin/pm-suspend  fi   wmii will now go to suspend mode when closing the lid. It'll  automatically wake up when opening the lid.     #!/bin/bash      load=$(cat /sys/devices/LNXSYSTM:00/LNXSYBUS:00/PNP0C0A:00/power_supply/BAT0/capacity)     min_load=20     if [ $load <= min_load ]; then         pm-suspend     fi


Finding expected number coin flips to get 2 consecutive heads

First, I know what the right answer is, and I know how to solve it. What I'm trying to figure out is why I can't get the following process to work.  The probability that we get 2 consecutive heads with one flip is 0. The probability that we get 2 consecutive heads with 2 flips = 1/4. The probability of getting 2 consecutive heads with 3 flips = 1/6. The probability of getting 2 consecutive heads with 4 flips = 2/10 = 1/5. And the probability of getting 2 consecutive heads with 5 flips = 3/16.   Am I doing something wrong. I don't see any easy way to use these numbers to solve the original problem of finding the expected number of coin flips to get 2 consecutive heads.


what is the difference between c# build for a 'x64' or 'any cpu' target

I am building a c# project for a DLL that will be used x64 environment. Originally I was using 'Any CPU" as the platform target. However, when I test it I found it failed during library loading and I found it load some 32 bit libraries. I changed it to 'x64' and everything works as expected. My question is, in what case I should use 'x64' and in what case I should use 'Any CPU'.  I used to think 'Any CPU' is safer and it will automatically determine whether 32-bit or 64-bit library is required.


Edit source differs from question view? Or are we each other's friends now?

I stumbled upon the following issue.  starts out with "Dear friends", as can be seen in the image below (and hopefully by following the link).    However, when I go to edit the question for some clean-up, I don't see this in the source of the question:    My first guess was that a suggested edit is hanging around somewhere, but I don't see one. So, what's going on? Am I the only one seeing this? Bug? Cache? (New feature? Are we all friends now? ;) )


Convert perl hash with multiple values into python dict

I have a perl file named ips.pl at C:\Perl\test\ips.pl which contains 6 perl hashes. Each hash contains 1 key and 2 values. The file contains below data.  {  '192.168.111.1' => [             '192.168.111.2',             '192.168.111.3',  ],   '192.168.111.4'  =>  [                     '192.168.111.5',                     '192.168.111.6',  ],   '192.168.111.7' => [                      '192.168.111.8',                      '192.168.111.9',  ], }   How Can I convert this perl file to python readable? I need result in 3 separate Python Dict. The required result should be like  dict1 = {'192.168.111.1': '192.168.111.2'} dict2 = {'192.168.111.1': '192.168.111.3'} dict3 = {'192.168.111.4': '192.168.111.5'} dict4 = {'192.168.111.4': '192.168.111.6'} dict5 = {'192.168.111.7': '192.168.111.8'} dict6 = {'192.168.111.7': '192.168.111.9'}   As am new to both perl and python, please suggest me any module which will be a easy solution for me. In case we dont have any such module then please suggest me the steps. Thanks in advance  I tried with below code,  import re class PerlLikeDict( dict ): pattern_type= type(re.compile("")) def getitem(self, key):     F = open("resources.pl", "r+")     print "value of F object is", F     print "type of object is ", type(F)     rd=str(F.read())     print "value of string variable rd is", rd     #print "value of 1st is", rd[1]     #print dict_rd == dict(rd)     if key in self:         return super( PerlLikeDict, self ).__getitem__( key )     for k in self:         if type(k) == self.pattern_type:             if k.match(key):                 return self[k]     raise KeyError( "key %r not found" % ( key, ) )  F = open("resources.pl", "r+") rd=str(F.read()) print "able to read the file", rd x=PerlLikeDict(rd) print x   This is giving error  Traceback (most recent call last): File "C:\Users\sanjaya.sahoo\workspace\my python  learning\src\workon_local_perlfile.py", line 23, in <module> x=PerlLikeDict(rd) ValueError: dictionary update sequence element #0 has length 1; 2 is required


Can grep output only specified groupings that match?

Say I have a file:  # file: 'test.txt' foobar bash 1 bash foobar happy foobar   I only want to know what words appear after "foobar", so I can use this regex:  "foobar \(\w\+\)"   The parenthesis indicate that I have a special interest in the word right after foobar.  But when I do a grep "foobar \(\w\+\)" test.txt, I get the entire lines that match the entire regex, rather than just "the word after foobar":  foobar bash 1 foobar happy   I would much prefer that the output of that command looked like this:  bash happy   Is there a way to tell grep to only output the items that match the grouping (or a specific grouping) in a regular expression?


To get the value of specific attribute value as True or False, having uneven columns

I am having one file with the below two lines in the file. I need to check if the value of xpoweredBy is true or false. Many thanks in advance.        <Connector clientAuth="false" sslProtocol="TLS" xpoweredBy="false" allowTrace="false" /> <Connector port="8009" protocol="AJP/1.3" redirectPort="8443" xpoweredBy="false" allowTrace="false" />


Compute $n!\int...\int_{0<s_1<...<s_n}ds_1...ds_n$.   Before that, I were to show that $$\int...\int_{0<s_1<...<s_n}f(s_1,s_2-s_1,...,s_n-s_{n-1})ds_1...ds_n=\underset{0<x_1,...,x_n \\ x_1+...+x_n<1}{\int...\int}f(x_1,x_2,...,x_n)ds_1...ds_n $$ which I did using a change of variable theorem.   I don't know, however, how to apply it here, if I better apply here. I generally don't know what the bounds for each integral are. I could really use some help.


How to make Illustrator not to lie about colors?

Here is the fragment of red area, which is said by Illustrator as being #840608 (upper green marker). But actually, as reported by screen inspecting application, the color is #9C0D01 (lower gree marker).    Later, when I starting to export image for web, the color is becoming #B70F00    Finally it becomes #9B0203 in we browser:    How professional program can be so inaccurate with colors? If this is a result of some feature (the usability of one is of high doubt) the how is it possible to disable it totally?  So, I need color code conserve full way from drawing to web.  UPDATE  I am measuring screen colors with  utility. It works exact with web browsers:    jsfiddle link:   UPDATE 2  Illustrator file:


import java.util.Scanner; public class golfScores{   public static void main(String[] args){     // array to hold     //loop and array building     Scanner sc = new Scanner(System.in);     int[] scores = new int [10];     System.out.println("Please enter the golf Scores :");     for (int i = 0; i < scores.length; i++){       scores[i] = sc.nextInt();      }     System.out.println("The Scores you enterd are: " +scores[]);    } }   it wont print my array. I get syntax error, insert ". class" to complete Expression


I'm wondering if someone can help explain why the following code snippet returns a and b both equal to 6.   int main(){     int a =5, b;     a++,b=a;      printf("%d %d\n", a, b); }   Is the answer that, in fact, the behaviour is implementation-specific (based on compiler)? Or, is the following the explanation (my understanding of postfix is that the incrementing only happens after the variable a has been "used" by whatever other operator exists around it). In this case, is the a "used" by the comma operator when the LHS is evaluated and then thrown away, such that incrementing happens before the RHS is evaluated?  Thanks in advance!


Code coverage for delete statement in batch class

How can I get increased coverage for this code? I get only 75% so far.  Not able to cover the delete statement in the main class.  Any help is greatly appreciated.  Main Class:  public void execute(SchedulableContext schedulevariable)     {          //Variable Declaration         List<Case> CaseList = new List<Case>();          try{             CaseList = [SELECT Id,Privacy_Issue__c,Status,SystemModstamp FROM Case                          WHERE Status ='Closed' AND Privacy_Issue__c = True AND                          SystemModstamp < :system.now().addDays(-63)];              if(CaseList.size()>0){                 Database.delete(CaseList ,false);             }         }         Catch(Exception ex){             system.debug('Exception Message::'+ex.getMessage());         }     }   }   Test Class:   @isTest(seealldata=false) public class DeleteCasesBatch_Test {      static testmethod void executeTest()     {         List<case> caseList = new List<Case>();         //Runas System Admin         TestUtility.getRunAsUser();          System.runAs(TestUtility.runAsUser){              //Case record Insertion             Case c1 = TestUtility.createCase();              c1.Status='Assigned';             c1.Privacy_Issue__c= true;             Database.insert(c1);              c1.Status = 'Closed';             Database.update(c1);              DeleteCasesBatch ads = new DeleteCasesBatch();             ads.execute(null);              Test.stopTest();              system.assertNotEquals(c1, null ,'Case Record is Null');              Database.delete(c1);          }     } }


java null pointer exception-i read previous aswers but having difficulty in figuring out the solution. kindly help me out

I am getting nullpointerexception when i call the putArray()and sortArray() methods. getArray() method works fine. when i print the array within getArray() method it is working. But i get null pointer exception when i print in putArray() method.I spent a lot of time figuring it out .Kindly help me resolve this. also suggest me any other better ways to write this code. Thank you.  import java.util.Scanner; public class BubbleSort {     int num;     int[] arr;     public void getArray() {         System.out.print("Enter the total numberr of elements in the Array :  ");         Scanner sc = new Scanner(System.in);         num = sc.nextInt();         int arr[] = new int[num];         System.out.print("Enter " + num + " Elements  : ");         for (int i = 0; i < num; i++) {             arr[i] = sc.nextInt();         }     }     public void putArray() {         System.out.print("The Array is:  ");         for (int i = 0; i < num; i++) {             System.out.println(arr[i] + "  ");         }     }     public void sortArray() {         for (int i = 0; i < num; i++) {             boolean flag = false;             for (int j = 0; j < num - i - 1; j++) {                 if (arr[j] > arr[j + 1]) {                     arr[j] = arr[j] + arr[j + 1];                     arr[j + 1] = arr[j] - arr[j + 1];                     arr[j] = arr[j] - arr[j + 1];                     flag = true;                 }             }             if (!flag) {                 break;             }         }     }     public static void main(String[] args) {         BubbleSort b = new BubbleSort();         b.getArray();         b.putArray();         b.sortArray();         b.putArray();     } }


How is hotness score calculated at larger sites?

To start with, I am aware that hot questions from larger sites are somehow "penalized" and :     This is designed to ensure that a single site doesn't dominate the list, and that users see a good sampling of questions that are likely to interest them throughout the network...   I would like to understand how is hotness score really calculated at these sites. The reason why I ask is that per my observations, this seems to be quite different than is documented in the . Specifically, I would like to understand the difference in the impact of answer(s) score and aging factor.  Regarding impact of answers score, my observations of hot questions from smaller sites appear to be in agreement with known formula: (MIN(AnswerCount, 10) * QScore) / 5 + AnswerScore. For example, a question with low score (+1, +2) can get into hot list if it has got answer(s) with sufficiently high score.  At larger sites, this doesn't seem to be the case. Say, it looks like Stack Overflow questions just don't enter hot list until they reach certain score (+6,+7), no matter how many answers are there and how high is their score.  Does system simply totally ignore answers until question reaches certain score?  Another thing I noticed is that questions seem to age away from the hot list 2-3 times faster than ones from smaller sites (having comparable question and answers scores). Granted, this is harder to track and I am not yet sure if I figured that correctly. Do larger sites questions age away faster than those from smaller sites?    For those interested, here is a (partial) list of example questions I studied before asking this: , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , .  Although above examples are only from Stack Overflow, my question isn't (I only used it as an example of a large site in my studies). I would like to understand if hot questions from other larger sites are handled in a similar way.


How to clear all Windows event log categories fast

Under Windows 7 you open the Event Viewer to browse several categories. You can also clear a single category by clicking Clear Log... on the right pane.  Assuming I want to clear ALL categories, am I supposed to click and clear them one by one? There are dozens of them. Is there a faster way? Maybe with PowerShell?


Radeon HD 2000, 3000, 4000 on Ubuntu 12.04.2 and higher: fglrx (legacy) unsupported, what to do?

After upgrading to 12.10 quantal, the packaged version of fglrx no longer works. I discovered that this is because there is a separate 'legacy' fglrx driver for the HD 2k-4k series cards, but it is incompatible with the xorg server on 12.10.  This is the most current version of the driver for HD 2000 through HD 4000 series cards. You can't use the non-legacy fglrx driver, but you can use the open-source radeon driver if you prefer your WM compositing to be laggy and your YouTube videos to play like they would on a Pentium MMX series:    Usually this driver can be installed in the following way, necessary because apt-get install fglrx would pull in the non-legacy driver:  wget http://www2.ati.com/drivers/legacy/amd-driver-installer-12.6-legacy-x86.x86_64.zip unzip amd-driver-installer-* sudo sh ./amd-driver-installer-*.run --buildpkg Ubuntu/quantal sudo dpkg -i fglrx*.deb sudo aticonfig --initial -f   If you use a different version of fglrx (for example, a newer 12.9 that doesn't support those cards) then the final command will give you an error no supported hardware detected or something similar. However, everything works at this point and you will get a reasonable xorg.conf:  ... other stuff  Section "Device"         Identifier  "aticonfig-Device[0]-0"         Driver      "fglrx"         BusID       "PCI:1:5:0" EndSection  ... other stuff   At this point you're supposed to reboot and everything will be working with the fglrx driver. However, upon rebooting, you'll be treated to the following errors in Xorg.0.log when fglrx attempts to load:  (EE) Failed to load /usr/lib/xorg/modules/drivers/fglrx_drv.so: /usr/lib/xorg/modules/drivers/fglrx_drv.so: undefined symbol: noXFree86DRIExtension   Some searching around will show that this is a problem with the legacy ATI drivers not supporting xserver 1.13 or newer. () ATI has released a fixed driver for its most recent (HD 5000 series or later) cards, but not for the 'legacy' cards yet. The non-legacy ATI drivers can't be used with the old cards.  What should an Ubuntu user, using one of these HD 2000-4000 series cards, do?    Wait for an updated 'legacy' ATI driver that properly works with xserver 1.13?   Downgrade back to 12.04 Precise, which uses xserver 1.11? Try to downgrade xserver on 12.10 Quantal to 1.12, which could possibly break Unity and GNOME? Forced upgrade to HD 5000 series or later card? (Not possible with integrated graphics...) Some other 1337 action that fixes this problem painlessly?


I really like Ubuntu desktop.  My company has some computers. I'm thinking on install Ubuntu on our computers. So, I need to know how much the operative system cost? If not, how much is the cost for future system maintenance?


limit of a definite integral to infinity

For a definite integral   $$\int^b_af(x,h)dx,$$   can we in general show that   $$\lim_{h\to \infty} \int^b_af(x,h)dx = \int^b_a \lim_{h\to \infty} f(x,h) dx.$$   Intuitively this seems to make sense, as an integral can be approximated by a Riemann sum, and we could use the limit sum rule iteratively.  However, I did not found how to formalise this, can anyone help me with this.


Fisher's Exact Test in contingency tables larger than 2x2

I was taught to only apply Fisher's Exact Test in contingency tables that were 2x2.  Questions:   Did Fisher himself ever envision this test to be used in tables larger than 2x2 (I am aware of the tale of him devising the test while trying to guess ) Stata allows me to use Fisher's exact test to any contingency table. Is this valid? Is it preferable to use FET when expected cell counts in a contingency table are < 5?


I have a directory full of geojson files that I need to convert to shapefiles for editing in QGIS.  As far as I have searched, there are no resources in GIS StackExchange that explain how to do this from a  geojson .  The output should be shapefiles, named exactly the same as the geojson, in a separate directory. Can anyone recommend the best method to do this programmatically in Python or in other software?


I'm a canadian citizen. i have a stopover to japan going home to canada and will transfer from tokyo HND airport to tokyo NRT.  Also, I have layover of from 4 am in the morning and be leaving at 6 pm of the same date.  I'm planning to have a 1 day sightseeing outside the airport.  Do I need to get a visa or any documents so i can go out?


Why does this regex generate undefined entries?

This regular expression does exactly what I want, except it produces lots of undefined entries. Is there a way to fix it so that it does not generate undefined entries?   var s = "on 2020-1-22 radio station 7-1207 was at -27db"; var regex = /(?<![a-zA-Z0-9+-])([+-][0-9]+[.]?[0-9]*)|([0-9]+[.]?[0-9]*)/; var m = s.split(regex); console.log(m);    output: ["on ",undefined,"2020","-",undefined,"1","-",undefined,"22"," radio station ",undefined,"7","-",undefined,"1207"," was at ","-27",undefined,"db"] desired output: ["on ","2020","-","1","-","22"," radio station ","7","-","1207"," was at ","-27","db"]


I am putting a gate across my driveway which is 14ft between posts on either side. Its going to be wood and all 1x6 and 1x8 lumber to keep weight down. Each gate will be about 7ft long so I was thinking of putting a wheel at the end of both. I live in NH so Im sinking the post hole 4ft and the gate will be 4ft tall. Do I need to use a 6x6 and if so does the hole have to be 18in wide or can I do a 12in hole with a sonotube and concrete?


Is doing a PhD a good way to develop a deeper understanding of quantitative finance and statistics?

I work in business and mainly deal with quant finance and statistics + do a lot of programming to implement ideas from quant finance and statistics. I have a master of science in economics.  My problem is: whenever I am trying to dig deeper (by reading articles from scientific journals) to understand some theoretical foundations of a certain idea from statistics and quant finance (ranging from pricing of exotic options to kriging based methods) to modify and customize this idea for my situation, I discover that my knowledge of math is not enough to penetrate deeper in a subject.  Is it a sign that I need to get a PhD in quant finance/ statistics/ math or it would be an overkill and I better go for a less time consuming (bloody) option (if there is any)?


How can i disable android permission manager notification?

I have an android 4.4.2 device and permission manager app enabled.  I have facebook messenger installed for example and i deny it permission to read my sms or phone contacts.   It works, but keeps displaying "Messenger is denied " in the center bottom lower screen for ages. Sometimes i need to reboot my device to make it go away.   absolutely annoying


Command for creating a directory and navigating into it directly?

Quite often I need to perform this two commands:  mkdir abc cd abc   I am curious whether there is a simple command (or an alias that I can create and use) to do it in one go, like  user@GROUP:~$ mdcd abc user@GROUP:~/abc$   Is this possible?


How did Schrödinger come up with his equation?

So all of the people who studied QM know the famous . I have read that it was not derived, but it is a postulate; something that is just real.    Some people have tried to explain to me that it comes from another more general (I think) equation that has to do with the Hamiltonian, but please do not try to explain it to me that way because then it just becomes maths (if there isn't another explanation then just tell me so).  So physically, intuitively, how did he come up with this? It is a postulate, yes, but nonetheless, Schrodinger did not wake up one day and suddenly knew what the equation was.


The "oval" path in too sharp as you can see in the intersection with the horizontal line. How can i fix this problem?       \documentclass{article} \usepackage{tikz}  \usetikzlibrary{patterns}     \begin{document}  \begin{tikzpicture}[scale=0.3]   \draw[smooth,pattern=north east lines] (0,0) to[out=75,in=285] (0,7.5)   to[out=255,in=105] (0,0)-- cycle;  \draw (0,-7.5) to[out=105,in=255] (0,0);   \draw (0,7.5)--(20,7.5);  \draw (0,-7.5)--(20,-7.5);    \end{tikzpicture}  \end{document}


How can I make a modification to a .service and keep it persistent?

I have a Debian stretch where I'm running transmission-daemon as a service.  I keep my seeded files on an external USB hard disk drive mounted on /mnt/external-disk. This disk has an ext4 filesystem, and I mapped it in /etc/fstab by uuid.  The problem is:  When the service transmission-daemon starts at boot it doesn't check if the external filesystem is already mounted so it doesn't find the files on it, and I get a data error and the torrent files are not seeded, but the service starts.  To resolve this problem I checked the systemd documentation, and I found what was missing:  The line RequiresMountsFor= in the [Unit] section of the transmission-daemon.service file is located in the tree below /lib/systemd/. After I added that line with the path of the mountpoint /mnt/external-disk the problem disappeared and the service was working fine. If I rebooted the machine, the service was working, and the files were seeded.  This worked until I had a apt-get dist-upgrade where the package transmission-daemon was involved and after it stopped. So I checked the transmission-daemon.service, and I found the modification I made was missing.  I added the line RequiresMountsFor= another time with the proper path, and the problem was fixed again.  My question is: How can I make this modification persistent?


How to disable Gmail read receipt nagging?

I have some coworkers and customers that send all of their e-mails with read receipts requested. Whenever I view one of these emails in Gmail and then try to leave, it asks me if I want to send a read receipt or not. I always click "No", but even if I view that message at a later date (such as trying to find an old email on a particular topic), Gmail will continue to nag me about sending read receipts.  Is there any way to tell Gmail that I never, ever, under any circumstance, never want to send a read receipt? This drives me absolutely insane. I must spend several hours over the course of the year just dismissing read receipt dialogs.


I use tablet with Android in a professional environment and the it department doesn't accept to install wifi.  My tablet need to synchronise with CSV file on a LAN share.  I'm looking for solutions. Is it possible to connect a tablet on ethernet (possibly with builtin firmware)? If yes, which model?  I looked for solutions and I found some interesting links:    / a pack to add ethernet support to Asus  Iconia Tab a500  Motorola Xoom   Does someone have experience with this? I prefer avoid root my tablet or use a custom firmware or launch some custom command when connected to the network, but if no Android tablet come with this feature built in, I would be willing to root it.  Alternate solution:  connect the tablet to the PC with USB and access the LAN share located on the computer (it was possible with Windows Mobile) and maybe access the whole network.  I own a Galaxy Tab 8.9 and the best would be to find a solution with that tablet.


Ubuntu Won't Boot from USB on ASUS X205T

I've created a bootable USB for Ubuntu 16.04.01, which worked on my Dell Latitude E6420. I'm now trying to install Ubuntu on my Asus X205T, but whenever I boot override to the drive, it kicks me back to the bios setup, or, on the second try, just gives up and goes to windows. The device is currently running Windows 10. I double checked, and the USB drive does have 64 bit Ubuntu on it. Additionally, the EFI gives me an error message when I try to boot it. I'm attaching some  in case they shed some light on the issue. Any help is appreciated. Thanks!   EDIT: I tried recreating the bootable USB using a FAT32 file system, just to be sure. I also flashed the bios. The computer still ignores the boot override and goes to windows. I've also disabled fast boot and moved the drive to the top of the boot order, and the computer kept swapping back to the bios without ever starting Ubuntu. I have not yet disabled UEFI, but won't I need to change the file system on the USB drive to DD instead of ISO to get that to work?


Can't Recreate Values for U, S, V from SVD in numpy

To better understand SVD, I'm trying to recreate the values for U, S, and V using straight numpy, but I can't get the same results.  According to numpy's  for its implementation of SVD, it returns values for U, S, and V such that you can recreate your original dataset in the following way:  (U*S) @ V = original_data   My understanding is that the values for U are derived from the eigenvectors of $ XX^T $, V from the eigenvectors of $X^TX$, and they share the same eigenvalues, and their square root comprise the values for S.    So, to recreate these on my own I'm doing the following:  from sklearn.datasets import load_boston boston = load_boston() X = boston.data u_vals, u_vecs = np.linalg.eig(X.dot(X.T)) v_vals, v_vecs = np.linalg.eig(X.T.dot(X))   My thinking is that u_vecs[:, :13] @ np.diag(v_vals**.5) @ v_vecs.T ought to do the trick.    However, this gives very different results.    Even more, I've checked further, and the only difference between the values I have from numpy's eigensolver and the ones returned from its svd method are the signs involved in the eigenvectors used.    However, my (perhaps naive) understanding is that this shouldn't make a difference.  However, I'm clearly mistaken in something.  Is it simply a case of using a different eigensolver, or is there a deeper misunderstanding that I'm not seeing?


Folder is not deleting. How to delete this folder?

I am trying to delete "Games" folder. Folder size is huge. But it's not deleting. Even not showing a message.  If I try to delete using cmd. But it shows another error.    What should I do now?


how to get the difference between 2 tables in 2 different schema's in Oracle?

I am using Oracle 11G. I have a table called Tickets in the schema called 'tickets1" I have the same table structure in another schema called 'tickets2' I want to find out  What data is the same in both tables? What data is different?   CREATE TABLE tickets(     ticket_number NUMBER NOT NULL,         first_name VARCHAR2(50) NOT NULL,     last_name VARCHAR2(50) NOT NULL,     PRIMARY KEY(ticket_number) );


C++ Assign a variable of type A to type B that extends A

I'm trying to create a tile system which creates a single instance of a tile, and adds the tile to an array of tiles, allowing you to call Tile::s_tileList[1] to get the dirt tile.  However, I'm having some issues with it. Here's the complete tile code:  tile.h  #pragma once  class Tile { public:     static const Tile s_tileList[128]      static const Tile s_dirt;      Tile(int tileId);     virtual ~Tile(); protected: private:     int m_tileId; };   tile.cpp  #include "tile.h"  #include "tile_dirt.h"  const Tile Tile::s_dirt = TileDirt(1); // This line errors  Tile::Tile(int tileId) {     s_tileList[tileId] = *this;     m_tileId = tileId; }  Tile::~Tile() {  }   tile_dirt.h  #pragma once  #include "tile.h"  class TileDirt : Tile { public:     TileDirt(int tileId);     virtual ~TileDirt(); protected: private: };   When I'm trying to assign s_dirt to TileDirt I get the following error:  conversion to inaccessible base class "Tile" is not allowed   What am I doing wrong here?  I tried doing:  static const Tile* s_dirt;   And assign it like:  const Tile* Tile::s_dirt = new TileDirt(1);   But that just adds another error: no suitable constructor exists to convert from "const Tile *" to "Tile"


how to put personal info (address, phone) in header (2)

Similar to the question here:  I am using modern cv casual style and want personal info (address, street, phone, email) in the header but below the horizontal line below my name. And this just in the first page. Could anybody help me with that?


I have a spatial table (polygons,polylines) in a database. These are digitized by multiple people. For example, a state is divided into multiple Grids and given to multiple people to digitize using QGIS; which is connected to a postgres database. Now, I have to merge all those polygons and polylines. I don't know how to do this via ST_Union. I Used the following snippet to merge the polygons and polylines CREATE TABLE schema_name.polygon_un2 AS SELECT upg.un_geom,npg.Column1,npg.Column2,npg.Column3,npg.Column4,npg.Column5  FROM (  SELECT st_union(the_geom) As un_geom,(   SELECT oid FROM schema_name.polygon    WHERE oid = 100748191   ) FROM schema_name.polygon WHERE oid IN (100748191,100763519)  ) upg  INNER JOIN schema_name.polygon npg ON npg.oid = upg.oid;   DELETE FROM schema_name.polygon WHERE oid IN (100748191,100763519);  I have the interesecting polygon oid in a Seperate Table, I want to do this process in an update query and that should be a dynamic plpgsql function.  Green : Grid , Other : Polygon But This snippet did not work !! The snippet which i expect is  It should create a new row for the merged polygons and polylines (eg oid - 1 and 2 merged to oid 3).  The polygons which are not merged (eg 1 and 2 should be deleted)


I want to label two or three equations in the same line such as  x = r,  y = w                   (1a,b)  z = t,  a = q, b = p            (1c-e)  Thanks


Multiply dominated nodes in the forest environment

Edit: I think I need to join two different trees (there's two root nodes). I'm at a loss.    I'm in a bit of a pickle. I need for the node that says A in the following graph to be dominated by two nodes and not only one (I need it to be a multiply dominated node; so I need to add another branch). Is this possible in the forest environment? How can I fix these?  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage{tikz} \usepackage{amsmath} \usepackage[linguistics]{forest} \usepackage[]{graphicx}  \begin{document}   \begin{forest}    for tree={grow=0,l=3cm,anchor=east,child anchor=east,grow=west, s sep+=1pt}     [{$(e_{i+1} \land e''_{j+n})$C$p$}       [{$(e_i \land e'_2)$C$e_{i+1}$}         [{$e_1$C$e_2$C$\dots$C$e_i$}]         [{$((e'_1 \supset e'_2) \land e'_1)$C$e'_2$}         [$(e'_1 \supset e'_2)$]         [A]         ]       ]       [{$(e''_j \land e'''_k)$C$e''_{j+1}$C...C$e''_{j+n}$}         [{$e''_1$C$e''_2$C$\dots$C$e''_j$}]         [{$e'''_1$C$e'''_2$C$\dots$C$e'''_k$}]       ]     ] \end{forest}  \end{document}


Check whether or not $\sum_{n=1}^{\infty}{1\over n\sqrt[n]{n}}$ converges.    I tried few things but it wouldn't work out. I would appreciate your help.


Add "Appendix" before "A" for Appendix A

I have the following latex document, and I want to add "Appendix" to the title of the Appendix A. So far the prefix "Appendix" only shows up in the TOC, but I also want to add the prefix "Appendix" to the title of the respective chapter. \documentclass[headsepline,footinclude=false,oneside,fontsize=12pt,paper=a4,listof=totoc,bibliography=totoc,listof=nochaptergap]{scrbook} \usepackage[utf8]{inputenc} \usepackage[titletoc,title]{appendix}  \begin{document}  \tableofcontents{}  \newpage  \begin{appendices} \chapter{Test} \end{appendices}  \end{document}  That's how the appendix appears in the TOC which is correct:  But the header in the text still looks like this:  Is there any way I can change this behavior, so it prints "Appendix A. Test" as the title of the appendix? Thanks in advance for your support!


Bad accents of "foreign" characters in "native" dialogue

I am currently watching Falcon and the Winter Soldier in English and as a German native speaker I stumbled a fair bit about the terrible German spoken by the supposedly German extras. They sound like English native speakers who don't know a word of German and are just trying to phonetically repeat German sentences. I also noticed that Daniel Brühl, who is from Germany, often tries to speak Russian, which I am sure doesn't sound any better than the "German" extras. And I am also pretty sure that all other "native" extras for other languages don't sound any better. Now, I am quite sure that getting someone who actually speaks the language to at least dub the scene later (if you can't actually find an actor who can speak the language) is neither too expensive or too hard in a production like this with a budget of $150m. So I don't think it's about laziness or money. Also, since there was at least one German actor on the production (and I am sure more than enough people who natively speek one of the other languages), I can't believe no one noticed. And Falcon and the Winter Soldier is not at all alone with that issue. Almost all native English productions have that issue. So there must be some other reason this is so common? Are native English speakers so used to bad fake movie accents that they wouldn't recognize the real accents/languages? What am I missing here?


Why NAND gate is economical to implement an specific equation?

I have the following Boolean equation:  A + (B + A)'   From many suggestions I know that it is economical to use NAND gates to implement this equation. I can design a logic circuit of this equation using NAND gates but I don't know why NAND gates are economical for this equation?


How to develop a model in R to illustrate that sum of two variables normally distributed if these two variables each follow a Normal distribution?

I was wondering how can I use code in R to set up a simulation to show that if two random variables each follow a normal distribution with given means and variances, their sum is also normally distributed with a mean equal to the sum of the means of two random variables and variance equal to the variances of the two random variables.


what tables related to drupal cache can be safely delete using SQL and how to be sure to empty it entirely?  It seems i have reminiscence of ancien block configuration when i empty cache using back office or drush cr


Orthogonal completion in nonhilbert spaces

Let $X$ be some Hilbert space. There is the widely known theorem in functional analysis which states that for each closed subspace $H\subset X$ we have $H\bigoplus H^{\perp}=X$. Now we do not suppose $X$ to be Hilbert space (but it is endowed with a scalar product). Is it true that there always exists such closed subspace $H\subset X$ such that $H\bigoplus H^{\perp}\ne X$?  So, I know that the completness of $X$ is important in the proves given in books, but how to build such closed subspace $H$?


This isn't the actual problem but I saw an answer where someone used this property to solve the problem . It says that if we have $$a+b+c=abc$$ then $\exists \alpha,\beta,\gamma \:$ $a=tan(\alpha)\:$;$b=tan(\beta)\:$;$c=tan(\gamma)\:$ where $\alpha+\beta+\gamma=\pi$ I don't know how to prove it , I hope someone gonna help me out ! By the way $a,b,c$ are positive reals


Why do I get a java.lang.NullPointerException error?

I am trying to make a program that computes the average of a series of BankAccount balances while filtering the ones that are below 1000. We were supposed to use a Measurable and Filter interface so I created a method to filter an array of BankAccounts and return a filtered array, and use that one to compute the average, here is what i have:  public class Data{    public static double average(Object[] objects, Measurable meas){       double sum = 0;       for(int i = 0; i < objects.length; i++){         sum = meas.measure(objects[i]) + sum;       }       if(objects.length > 0)         return sum / objects.length;       else          return 0;    }     public static Object[] filter(Object[] objects, Filter filter){      Object[] newarray = new Object[objects.length];      int cntr = 0;      for(int i = 0; i < objects.length; i++){         if(filter.accept(objects[i])){             newarray[i] = objects[i];             cntr++;         }     }      Object[] result = new Object[cntr];      System.arraycopy(newarray, 0, result, 0, cntr);      return result; }   interfaces and their implementations:  public interface Measurable{ double measure(Object x); } public interface Filter{ boolean accept(Object x); }  public class BankFilter implements Filter{ public boolean accept(Object x){     BankAccount account = (BankAccount) x;     return account.getBalance() > 1000; }  public class BankMeasure implements Measurable{ public double measure(Object x){     BankAccount account = (BankAccount) x;     return account.getBalance(); }   and the class to test it:  public class Tester{ public static void main(String[] args){     Measurable bankMeas = new BankMeasure();     Filter filter = new BankFilter();     BankAccount acc1 = new BankAccount(200);     BankAccount acc2 = new BankAccount(200);     BankAccount acc3 = new BankAccount(3000);     BankAccount acc4 = new BankAccount(50);     BankAccount acc5 = new BankAccount(4000);     BankAccount[] ar = {acc1, acc2, acc3, acc4, acc5};     Object[] filteredAcc = Data.filter(ar,filter);     for(int i = 0; i < filteredAcc.length; i++){         System.out.println(bankMeas.measure(filteredAcc[i]));     }      System.out.println(Data.average(filteredAcc, bankMeas));     } }       BankAccount class  public class BankAccount{ private double balance; public BankAccount(double initialBalance){     balance = initialBalance; } public double getBalance(){     return balance; } }   The NPE occurs at BankMeasure.measure(BankMeasure.java:4) and Tester.main(Tester.java:13) I have read that the NullPointerException means I am trying to access or modify a null Object but I don't see why that would be my case, any help much appreciated!


In C#, the switch statement doesn't allow cases to span ranges of values. I don't like the idea of using if-else loops for this purpose, so are there any other ways to check numeric ranges in C#?


I uninstall codeblocks via these commands (Ubuntu 14.04):  sudo apt-get autoremove codeblocks sudo apt-get --purge remove codeblocks   After that I run:  $ codeblocks bash: /usr/bin/codeblocks: No such file or directory   That means codeblocks is still stored in a PATH somewhere.  So I have a few Qs:   Is the way I used the correct way to safely uninstall everything of codeblocks? If so, why the path is still there (isn't it part of the uninstalling process to remove the path as well)? Where is the file that I can manually remove that obsolete path?   Thanks.


How can i put IF ELSE CONDITION in Oracle query?

I have a table, A and B which are shown below,  Table A:   id idB name faculty   B:   id name   Table B has 2 records as below.  SELECT * FROM B;   1, 1, 'First'  2, 2, 'Second'   Table A has 8 records as below.  SELECT * FROM A;   1, 1, A, IT  2, 1, B, IT  3, 1, C, IT  4, 1, D, Medicine  5, 1, E, Medicine  6, 1, F, Business  7, 1, G, Business  8, 1, H, IT   9, 2, A, Medicine  10, 2, B, Medicine  11, 2, C, Medicine  12, 2, D, Medicine  13, 2, E, Medicine  14, 2, F, Medicine  15, 2, G, Business  16, 2, H, Medicine   My question is:  How can I select data from table B where faculty should be IT and if there are multiple it should get with max ID. AND if there is no any IT, it should be get business?  My select view should be look like this below:  A and B records.   8, 1, H, IT, First 15, 2, G, Business, Second   Please could you advise and help in which way  we can retrieve these data?


I installed a headless Debian server which has Wireshark installed. Now I would like to run Wireshark in a way that it uses X11 server running in my Linux Mint laptop. As a first step I permitted X11 forwarding in Debian SSH server configuration file:  root@A58:~# grep X11Forwarding /etc/ssh/sshd_config  X11Forwarding yes root@A58:~#    Then I restarted SSH server with /etc/init.d/ssh restart and finally executed SSH client in my laptop using -X which enabled X11 forwarding. However, I still receive the "cannot open display" error:  root@A58:~# echo "$DISPLAY" localhost:11.0 root@A58:~# wireshark   (wireshark:3590): Gtk-WARNING **: cannot open display: localhost:11.0 root@A58:~# time xterm Warning: This program is an suid-root program or is being run by the root user. The full text of the error or warning message cannot be safely formatted in this environment. You may get a more descriptive message by running the program as a non-root user or by removing the suid bit on the executable. xterm: Xt error: Can't open display: %s  real    1m3.131s user    0m0.000s sys 0m0.000s root@A58:~#   Is the "$DISPLAY" variable correct? At the moment it's pointing to Debian server.. If the "$DISPLAY" variable is correct, then it's probably an authorization issue with X11 server?  X11 in laptop is started in following manner:  root      1113  0.1  4.3 101396 89992 tty7     Rs+   2013  44:28 /usr/bin/X :0 -nr -verbose -auth /var/run/gdm/auth-for-gdm-FHVC1j/database -nolisten tcp vt7


How do I prove that in every commuting family there is a common eigenvector?

The proof given by my textbook is highly non-satisfying. The author adopted some magic-like "reductio ad absurdum" and the proof (although is correct) didn't reveal the nature of this problem. I made my own effort into it and tried a different approach. Yet I can't finish it.  Let $\mathscr{F}$ be a commuting family in $M_n(\mathbb{C}^n)$, and $A\in\mathscr{F}$, then $A$ has $n$ eigenvalues. We pick one, say $\lambda$. Let $x$ be one of its eigenvector.  We can easily prove that, if $A$ has no other eigenvector with eigenvalue $\lambda$ that linearly independent with $x$, which means that $\{cx|c\in\mathbb{C}\}$ are the only vectors satisfying $Ax=\lambda x$, then $x$ is a common eigenvector. Because $\forall B\in\mathscr{F}$ and $\forall y\in \{cx|c\in\mathbb{C}\}$, $$A(Bx)=ABx=BAx=B(Ax)=B(\lambda x)=\lambda (Bx)$$, so that $Bx$ has to be in $\{cx|c\in\mathbb{C}\}$, that is, $Bx=c_0x$ for some $c_0\in\mathbb{C}$, which means $x$ is a eigenvector of $B$ too.  But what if there are vectors satisfying $Ax=\lambda x$ that's not in  $\{cx|c\in\mathbb{C}\}$? Well, then we should have a set of linearly independent eigenvectors $\{x_1,x_2,...,x_k\}$, that $\{c_1x_1+c_2x_2+...+c_kx_k|c_i\in\mathbb{C}\}$ are the only vectors satisfying $Ax=\lambda x$.  Now, I have a reasonable hypothesis that there exists some $x=c_1x_1+c_2x_2+...+c_kx_k$, that can be proven to be a common eigenvector of $\mathscr{F}$. I've tried some approaches to prove it but all failed.  Do you guys believe it's true? And if it is true then how do I prove it?


Are these expressions syntactically correct and semantically equivalent? What is general rules for "number-time noun" and "number time' noun" from semantic point of view?    "a day's work" vs "one-day work" "two days' notice" vs "two-day notice" "one year's pay" vs "one-year pay"     also see .


can you create a rule in outlook to move all emails that were sent to ANY distribution list that you are in

i want a folder with all emails that come to me because i am in distribution list.  I see how i can do this individually (1 rule for each specific list) but i wanted to see if i can do this in one rule for all dist. lists without having to specify the list names ?


Language problems when building bibliography

I'm having trouble making my bibliography. Between multiple authors it shows "and"  in stead of the  dutch "en". I've been searching  for solutions and most answers state this should do the job:  \usepackage[dutch]{babel}   \bibliography{referenties}    \bibliographystyle{unsrt}   However, it  doesn't work, I'm still getting  "and" in my bibliography. The title "bibliography" did get translated to "bibliografie" though.   What am I doing wrong?


What is the correct permission in /etc/fstab to mount NTFS?

I have Windows and Arch Linux in dual with UEFI. I want to mount my another NTFS partition in Arch. I mounted the partition with mount /dev/sda5  /mnt/Apps command. Then added the output of genfstab -U /mnt/Apps in /etc/fstab file. The output is as follows:  UUID=01D158CC7C2A61A0 /mnt/Apps ntfs rw,nosuid,nodev,user_id=0,group_id=0,allow_other 0 0   But when I unmount and remount that partition all files and folders shows with root uid and gid and 0777 permission. I also tried with changing uid and gid to 1000 but same result. So, my question, what is the correct way to add NTFS partitions in fstab so that I can read & write all file and folder both with normal user (1000:1000) and root (0:0)?


Does $\forall a\neq 0,N(a)>N(0)$ imply $N$ is a Euclidean function?

Let $A$ be an integral domain. A Euclidean function on $A$ is often defined as a map $N:A\to\Bbb{ N}$ such that the following two properties hold: (1) For all $a,b\in A, b\neq 0$, we have $N(a)\leq N(ab)$; (2) For all $a,b\in A, b\neq 0$, there exist $q,r\in A$ such that $a=qb+r$ and $N(r)<N(b)$. One can show (like ) that the above two properties imply: (3) for all $a\in A,a\neq 0$, we have $N(a)>N(0)$.  I would like to know if (2) and (3) imply (1), so that we get an equivelant definition for a Euclidean function.


Why does ice form on bridges even if the temperature is above freezing?

So with this "arctic blast" continuing, I've noticed that for my area, the temperature drops below freezing just long enough to cause freezing rain, but then the sun comes out and the temperature rises immediately. However, on bridges, ice continues to form.   How can ice form even if the temperature is above freezing?


Using a regression model to make prediction: When to stop?

I computed a simple linear regression model from my experiment measures in order to make predictions. I have read that you should not calculate predictions for points that depart too far from the available data. However, I could not find any guidance to help me know how far I can extrapolate. For example, if I calculate the reading speed for a disk size of 50GB, I guess the result will be close to the reality. What about a disk size of 100GB, 500GB? How do I know if my predictions are close to the reality?  The details of my experiment are:     I am measuring the reading speed of a software by using different disk   size. So far I have measured it with 5GB to 30GB by increasing the   disk size of 5GB between experiments (6 measures in total).   My results are linear and the standard errors are small, in my opinion.


Using a CNAME to forward traffic from a naked domain

I have a domain, flyh2.com.  I use a CNAME to forward www.flyh2.com to flyh2.elasticbeanstalk.com where my web site is hosted. This is the only way Amazon allows custom domain names. A records aren't allowed.  I'd like people to simply type  (without the www) and still have visitors see my web site.  Originally I used CNAME to forward both the naked and the www records to my web site, but it seemed to cause problems.  Incoming mail was being returned to sender:  Fwd: Returned mail: see transcript for details <mark@flyh2.com>... Deferred: Connection timed out with flyh2.elasticbeanstalk.com. Message could not be delivered for 6 hours Message will be deleted from queue   Seems that the CNAME on the naked domain was overriding the MX records.  Now I've changed the CNAME on the flyh2.com record to point to www.flyh2.com and in turn www.flyh2.com to CNAME to flyh2.elasticbeanstalk.com.  My MX records are set up correctly, but the CNAME on the naked domain seems to override them. Do I have to use an A record?


Adding a citation after paper is accepted

I am a junior researcher in mathematics. I worked simultaneously on proving Theorem A and Theorem B. They both generalize Theorem X in two different directions. Theorem X was proved several years ago (not by me). The proofs of Theorem A and Theorem B use very different techniques, and so I decided ahead of time to write one paper for each.  I finished proving Theorem A before I finished proving Theorem B. Then, I submitted Paper A to a journal (and the arXiv) proving Theorem A. Paper A includes a survey of related problems in the introduction. After a short while, I managed to prove Theorem B, and two months after the submission of Paper A, I submitted Paper B (to a different journal, and also to the arXiv). Now, six months after the submission of Paper A, it is accepted with requests for minor corrections. There is no response yet regarding Paper B.     In this situation, is it a reasonable/common to add one/two sentences to the survey in introduction of Paper A, explaining and citing the arXiv prepreint of Paper B, in addition to the minor corrections the referees asked for? (and letting the editor and referees know that I did that in my answer to their reports which comes along with the corrected manuscript).   Note that I am not asking if it is ok to cite a preprint. This is something I do, and so do other people, at least in math. My question is about making a change, after acceptance, which was not asked by the referees and the editor.


After the new update for Windows 10, my Media Feature Pack is missing.  I can't connect mobile devices to the PC, and I can't use Groove and other applications from the store.  I've installed the Windows Media Feature pack for Windows 10 Pro N (KB3010081), and it does not work.  My PC is a HP 4530s.  How can i choose the correct version of Windows Media Feature pack?


A relation between the GCD and LCM of 3 numbers


Currently building a new mountain bike. I'm fairly bike savvy and have built quite a few bikes over the years, but mainly road bikes.   I have installed/fitted a new Shimano slx group set and the hydraulic brake housing is very long. Lots of excess brake line around the handlebars, and when looking at other bikes in the shop they don't seem to have that problem. I'm fairly sure you can't shorten the housing, and not sure I want to have a crack at that if that is the case, so I wanted to see how other people get around this problem?


Role of rubber elasticity in the pressure inside a balloon

I'm just wondering if there's a pressure difference between the atmosphere and the air inside the balloon due to the rubber elasticity. A kind of analogous to the Laplace pressure in soap bubbles.


The meaning of the sentence: "I am positive"

Does the sentence: "I am positive." mean "I am sure 100 percent"?


Problems to login in Ubuntu 14.04 after new update (Friday)

Yesterday (November 4), I update my Ubuntu 14.04. After that I can't login. It something like a loop. I type the password, enter and it's return to login-screen.  The same happen if try the guest mode.  After some research, I found that the problems isn't with the login itself. But with the video card driver.  Any clue?


Link2sd not working on my rooted phone please help. trying from 2 weeks. having Android 4.2 jellybean. it says Mount script cannot be created. no such file or directory.


Irreducibility of Polynomials in $k[x,y]$

I'm working through some Hartshorne problems and have noticed that in order to do certain problems properly one must prove a given polynomial $f\in k[x,y]$ is irreducible.    For example, in problem I.5.1(b) we are studying the polynomial $f=xy-x^6-y^6$. How can I show this is irreducible?    The standard tricks (Eisenstein, linearity in one variable, etc...) don't seem to work here.  Edit: Some of the other polynomials in the problem are also giving me trouble. They are $g=x^3-y^2-x^4-y^4$ and $h=x^2y+xy^2-x^4-y^4$. Any ideas for these?


I want to run a command every 15min. Here is the command I want to run:   sudo bash -c "sleep 1h; pm-suspend"


Am I allowed to do a six-week internship in Germany on a 'normal' Schengen visa?

I have a summer internship offer from Germany. It'd be a summer internship of six weeks in Munich, unpaid but I am willing to bear all expenses (accommodation, travel etc).  Can I do that on a 'normal' Schengen visa or would I require a work visa?  I read that a work visa is usually required when the stay is for longer than 90 days, but for six weeks which particular visa is required?


I currently am unable to find the options to use the GPUs I have to render some footage in blender. Im using the Blender Rendering engine, but I dont have an option to use the GPUs, even though I enabled CUDA rendering in the preferences. Thanks for any help or insight.  My GPUs are GTX 980s, and I have the most recent driver installed.


a way to randomly cleave and break an object

Just looking for some hints on how to create the effect as shown in the attached image.


Difference between StringBuilder and StringBuffer

What is the main difference between StringBuffer and StringBuilder? Is there any performance issues when deciding on any one of these?


EXISTS ,IN usage without SELECT ,INSERT and UPDATE queries

I often get stuck when i want to write someting like  IF v_shortname IN (SELECT   sname FROM table)   OR    IF EXISTS (SELECT   sname FROM mmstrephdr  WHERE  sname= v_short)   I know EXISTS and IN not work in that way  .Also i can always tweak my code to get such results, but i always wonder if there is an programming construct in SQL which would do the job for me !


How to place INTENTIONALLY LEFT BLANK in the middle of the page while using two columns throughout the document?

From  I used the following codes to add an empty INTENTIONALLY LEFT BLANK page if a section ended in an odd number of pages, as well as if the total document would end in an odd number of pages (because for some reason it doesn't add the blankpage to the last section)  \newcommand*{\blankpage}{% %\setlength{\topskip}{0pt}%    % \setlength{\parskip}{0pt}% \vspace*{\fill} { \centering INTENTIONALLY LEFT BLANK.\par} \vspace{\fill}}  \makeatletter  \renewcommand*{\cleardoublepage}{\clearpage\if@twoside \ifodd\c@page\else \blankpage \newpage \if@twocolumn\hbox{}\newpage\fi\fi\fi} \makeatother  \AtEndDocument{%   \ifthenelse{\isodd{\pageref{LastPage}}}{\null\blankpage}{}}   Now here's my own question: the code made by the famous @DavidCarlisle seems to hint that if a two column setup is used, it would still place the "INTENT...BLANK" part right in the middle of the page. And it did! And then suddenly, it stopped doing it and started placing it on the left side of the page which I would guess to be centered in the left column. So how can I overrule the two columns and still have the sentence placed in the middle? The last page seems to be doing it right even though the \end{multicols} is after that last section.


Variance of linear combinations of correlated random variables

I understand the proof that  $$Var(aX+bY) = a^2Var(X) +b^2Var(Y) + 2abCov(X,Y), $$  but I don't understand how to prove the generalization to arbitrary linear combinations.  Let $a_i$ be scalars for $i\in {1,\dots ,n}$ so we have a vector $\underline a$, and $\underline X = X_i,\dots ,X_n$ be a vector of correlated random variables. Then $$ Var(a_1X_1 + \dots a_nX_n) = \sum_{i=1}^n a_i^2 \sigma_i^2 + 2 \sum_{i=1}^n \sum_{j>i}^n a_i a_j \text{ Cov}(X_i,X_j)$$  How do we prove this? I imagine there are proofs in the summation notation and in vector notation?