Strange behavior of bash and SIGTERM with Ubuntu

Here's what happens in Ubuntu (Linux ubuntu 5.3.0-53-generic #47~18.04.1-Ubuntu SMP Thu May 7 13:10:50 UTC 2020 x86_64 x86_64 x86_64 GNU/Linux, bash 4.4.20(1)):  In Terminal, open a window (let's call it "window_1") and type:  trap "echo something;" SIGTERM  then  echo $$  9781  then  kill -TERM $$  as expected, something is printed in window_1 and the window stays open.  Now open another "window_2" and type:  kill -TERM 9781  and window_1 is closed (no time to see whether something is printed).  Do the same with SIGINT and everything works as expected.   Do the same with SIGUSR1 and everything works as expected, but only after the Enter key is pressed.  Also, in macOS 10.13.6 everything works as expected (with SIGTERM, SIGINT and SIGUSR1).  Is anybody able to explain this apparent anomaly?  Thanks in advance.


In a reverse split, what happens to odd lots?

Let us say for example that I have 27 shares of stock X (there really is an X but its identity is not relevant).  In this example, X does a 5:1 reverse split. How many shares do I end up with. If I have fractional shares, what can I do with them?


I'm trying to update records in my sqlite database when the button is pressed. I've tried everything and I'm at wits end, please help Here's the button code c is a Connection variable, index is an integer variable that represents user's ID in the db              @Override             public void actionPerformed(ActionEvent e) {                 przelewKw = Double.parseDouble(kwotaF.getText());                  nazwaDoP = listaDoP.getItemAt(listaDoP.getSelectedIndex()).toString();                  try {                     for (int i = 0; i < nazwiska.length; i++) {                         if (nazwaDoP.contains(idKonta[i]) && nazwaDoP.contains(nazwiska[i])) {                             if (stanK[index-1] >= przelewKw) {                                 double roznica = stanK[index-1] - przelewKw;                                 try {                                     String url = "jdbc:sqlite:D:\\SQLiteDB\\Bank.db";                                     c = DriverManager.getConnection(url);                                     c.setAutoCommit(false);                                      PreparedStatement pstmt = c.prepareStatement("update Konta set StanKonta='"+ roznica +"' where IDKonta=' " + index +"'");                                     pstmt.executeUpdate();                                     System.out.println(stanK[index-1]);                                 }                                 catch (Exception exc) {                                     System.out.println(exc);                                 }                                 finally {                                     try {                                         if (c != null) {                                             c.close();                                         }                                     }                                     catch (Exception ex) {                                         System.out.println(ex);                                     }                                 }                             }                             else {                                 JOptionPane.showMessageDialog(framePrzelew, "Zbyt mało środków na koncie", "Uwaga", JOptionPane.WARNING_MESSAGE);                             }                         }                     }                 }                 catch (Exception ex) {                  }             }         });```


Let $f$ be continuous on $[a,b]$ with $f(x)>0$ for all $x\in [a,b]$. Prove that $\int_{a}^{b}f(x)dx>0$. (Note that needs strictness on inequality, could prove $\ge0$ easily but need $>0$).  I know that since $f$ is continuous on a closed interval then it is uniformly continuous, and I know that uniformly continuous functions are integrable. I previously had it where $\int_{a}^{b}f(x)dx =lim_{n\to \infty}\sum_{i=1}^{\infty} f(x_{i}) \Delta x$ and then said that since $f(x)>0$ then $\Delta x >0$ but then we do not use that definition of an integral in class and don't have something simple I could write it out equal to so then I am back to square one.


Err 80 appears when I turn on my Canon EOS 5D Mark II

Recently when on holiday in Italy my 5DII stopped powering up. Turn the switch on and - nada. Pulling the battery and popping it back in brings the camera to life, however as soon as the camera goes in to sleep mode, or I turn the power off, the problem returns. Sometimes the camera shows Error 80 at this point:     Err 80      Shooting is not possible due to an error.    Turn the camera off and on again or re-install the battery.   I've seen various posts on the interwebs about pulling the clock battery and leaving the camera for a while - have tried this and also replaced the clock battery to no avail.   Has anyone else had this problem - did the body have to go back to Canon for repair or did you manage to fix it?


How to have Terminator display remote hostname in title bar?

When I am SSH'ed into any one of my Linux devices, the title bar on Terminator displays user@hostname, where hostname is the computer I am SSHing from, rather than the computer I am SSH'ed into (i.e. the title bar mirrors $PS1 from the local device rather than the remote device). This makes it very confusing if I am SSH'ed into all 4 computers at the same time and can't see their prompts (as all their title bars are identical!).  How can I have Terminator display the correct hostname?


Axiom of choice in proof of theorem 2.41 in Rudin's principles of real analysis?

I have looked through the many questions about this theorem on this website, but none that I could see adressed exactly what I am wondering about. For completeness, I will state the theorem below and the part of the proof I am wondering about. 2.41 Theorem If a set $E$ in $\mathbb{R}^{k}$ has one of the following three properties, then it has the other two:  $E$ is closed and bounded. $E$ is compact. Every infinite subset of $E$ has a limit point in $E$.  The part of the proof I am wondering about concerns proving that (3) implies that $E$ is closed. The proof is set up by proving the contrapositive. Proof If $E$ is not closed, then there is a point $\mathbf{x_{0}}\in R^{k}$ which is a limit point of $E$ but not a point of $E$. For $n=1,2,3,...,$ there are points $\mathbf{x_{n}}\in E$ such that $|\mathbf{x_{n}} - \mathbf{x_{0}}| < 1/n$. Let $S$ be the set of the points $\mathbf{x_{n}}$. The proof continues, but the part I am wondering about is the last part, namely "let $S$ be the set of points $\mathbf{x_{n}}$." I understand that because $\mathbf{x_{0}}$ is a limit point, there must exist such points for all $n$. However, is just knowing that such points exist enough to form a set consisting of such points? For each $n\in \mathbb{N}\setminus \{0\}$ there must exist infinitely many such points since $\mathbf{x_{0}}$ is a limit point, must there not? And if so (since such points are not unique), if we want to form the set $S$ described above, must we not either specify some procedure describing these points for each $n$, or appeal to the axiom of (countable?) choice to choose one such point for every $n$? Unfortunately my instructor has deemed set theory "boring" every time I have tried to talk to him about the potential usage of the axiom of choice. Thank you very much in advance to anyone that took the time to read this post. Any answer is much appreciated.


alternative to `tail -f ` allowing printing continuous stream from multiple files in multiple folders under the same parent folder

As far as I know, tail -f <filename> allows to continuously print newly appended data from one single file.   What if I need to get content from multiple files located in multiple folders under the same parent folder, then filter that content if need be, and finally print it as a real-time stream, as new data gets appended to any one of the multiple monitored files?  EDIT: the operating system is RedHat Enterprise Linux 7.4


What is com.apple.bird? Why does it grow so big?

When trying to clean up their hard disk, some users discover ~/Library/Caches/com.apple.bird is pretty big, sometimes in the order of many gigabytes. What is it?


What happens to the energy when waves perfectly cancel each other?

What happens to the energy when waves perfectly cancel each other (destructive interference)? It appears that the energy "disappear" but the law of conservation of energy states that it can't be destructed. My guess is that the kinetic energy is transformed into potential energy. Or maybe it depends on the context of the waves where do the energy goes? Can someone elaborate on that or correct me if I'm wrong?


I have a few questions about the verb 'to languish.'     In the OED, it suggests that this word must be used for a living thing.  Couldn't it be used metaphorically for something like an idea or a literary genre that has a kind of "life?" Most usage suggests that languish cannot have an object. Can't languish be used with a prepositional phrase (with an object of course), for instance?  Can something languish into a pale imitation of itself?  This usage (languish into) was more common 200 years ago but has almost died out according to ngram. Any ideas on why?   Any clarification would be greatly appreciated!  (sorry, couldn't find any decent tags, no usage tag?)


I am currently using Texworks + Linux. To compile the PDF I hit pdflatex + bibtex + pdflatex + pdflatex. Is there a way so that I create a new typeset that does that in one click?  Found the easy answer:  1- add a new typeset tool, (Edit > Preferences > Typesetting > Add Processing tools)    2- And use Browse to add your simple bash code:  #!/bin/bash                                                                   filename=$1                                                                  filename_bib=$2                                                               pdflatex $filename                                                           bibtex $filename_bib                                                         pdflatex $filename                                                           pdflatex $filename


Clicking the 'get project' button on careers 2.0 produces no effect and creates JS error in console

The same happens when adding an article, and a book you've read:  Uncaught Error: Syntax error, unrecognized expression:


GOAL  Install Android Developer Studio  ERROR MESSAGE  sudo apt-get install libc6:i386 libncurses5:i386 libstdc++6:i386 lib32z1 lib32bz2-1.0   Error Message:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package lib32bz2-1.0 E: Couldn't find any package by glob 'lib32bz2-1.0' E: Couldn't find any package by regex 'lib32bz2-1.0'   QUESTIONS  Is the package unavailable (deprecated) or is the command incorrect?  Perhaps there is another explanation which I have not considered.


How to use Launchctl for runing scheduled command

I try to work with Launchctl and have a question:  I know there is a possibility to run commands directly (shell for example) with Launchctl, can someone please add an example on how can I do it with delay? (for example, run the command echo 1 > /tmp/1 in 10 minutes)  I know it can easily be done by creating Launch Agents, I looking for a way to do it using Launchctl directly to programmatically.  I know I can run: launchctl submit -l my_choosen_name mkdir /tmp/mydir as a direct command, my question is how can I schedule this to run every 5 minutes directly from launchctl ?


Difference between "be suspicious of" and "suspect"?

Similar questions have beens asked before, but I believe mine hasn't quite been answered.  In the game HITMAN™, holding a suspicious item and standing close to an NPC causes the word Suspicious to appear on screen, indicating that someone is suspicious of 47.  If I then described to someone why I failed Silent Assassin, would I say that someone   suspected me or was suspicious of me   or do both expressions mean the same in this context?


Question on completing proof separability in metric space implies countability

Let $X$ be a metric space. I want to show that: $X$ separable $\Rightarrow X$ second countable.  What I have been able to show thus far:  Let $Y$ be the countable dense subset in $X$.  I have shown for any $x \in X$ and corresponding neighbourhood $N_{x}$ that there exists $y \in Y$ so that $B_{\frac{1}{n}}(y)\subseteq N_{x}$  My question: I do not know whether I am on the right track... I still need to show that some kind of collection $\bigcup_{U \in C}U=N_{x}$ but I am unsure on how to construct it. I do not see how the fact that $B_{\frac{1}{n}}(y)\subseteq N_{x}$ can help.   Any help is greatly appreciated.


I don't understand why in Point class where I call the method on an object , it returns false. So, in method, in third/fourth/fifth case it returns false even if values of x and y of every objects are zero. class Point{     private int x;     private int y;     public Point(int x, int y) {         this.x = x;         this.y = y;     }  public boolean method(Point p) {       if (p!=null)              return x==p.x && y==p.y;         else return false;   }  }  public class AppPoint{     public static void main(String[] args) {         Point p = new Point (0, 0);         Point q = new Point (0, 0);         Object r = new Point (0, 0);         Object s = new Point (0, 0);         System.out.println(p.method(p));         System.out.println(p.method(q));         System.out.println(p.method(r));         System.out.println(r.method(q));         System.out.println(r.method(s));     } }  // method return: true true false false false


I am trying to run the following longtable:  \documentclass[12pt]{article}  \usepackage{amssymb,amsmath,latexsym,booktabs,float,graphicx,longtable} \usepackage{array} \newcolumntype{L}[1]{>{\raggedright\let\newline\\\arraybackslash\hspace{0pt}}m{#1}} \newcolumntype{C}[1]{>{\centering\let\newline\\\arraybackslash\hspace{0pt}}m{#1}} \newcolumntype{R}[1]{>{\raggedleft\let\newline\\\arraybackslash\hspace{0pt}}m{#1}}  \begin{document} \begin{center} \begin{longtable}[pt]{l C{3.5cm} C{3.5cm} C{3.5cm}}  \caption[Average statistics]{Average statistics} \label{tab:sumstats} \\ \hline \hline \  & \multicolumn{3}{c}{Total variation} \\ \cline{2-4} \textbf{Tests} & \textbf{Test 1} & \textbf{Test 2} & \textbf{Test 3}\\ \hline \endfirsthead \multicolumn{4}{l}% {{\bfseries \tablename\ \thetable{} continued}} \\ \hline \hline \  & \multicolumn{3}{c}{Total variation} \\ \cline{2-4} \textbf{Tests} & \textbf{Test 1} & \textbf{Test 2} & \textbf{Test 3}\\ \hline \endhead \hline \endfoot  \hline \hline \multicolumn{4}{l}{\footnotesize Note: aaa}\\ \endlastfoot  \textbf{Experiment 1} \\ A (\%) & 0.89 & 0.90  & 1.23\\ B (\%) & 14.25 & 14.31  & 14.76\\ C (\%) & 0.21 & 0.22  & 0.25\\ \hline \end{longtable} \end{center}  \end{document}   However, I need this table to start in a new page and to fill the previous page with text.   Currently I can only put the table in a new page with \clearpage or \newpage, but I get an empty space in the previous page if I do so.  Do you know how can I solve this issue?  Thank you very much.


Reading the koma script source code (more precisely tocbasic.sty), I found, starting at line #623, this:  \DefineFamily{KOMAarg} \DefineFamilyMember[.toc]{KOMAarg} \newcommand*{\DeclareNewTOC}[2][]{%   \newif\iftb@nt@float   % ...   \def\tb@nt@tocentrystyle{default}%   % ...   The syntax of this command according to the manual: \DeclareNewTOC[options]{extension}.  What is the role of the @ (in this context) and what does the \tb@nt@ expand to, if I called the command i. e. like \DeclareNewTOC[float]{foo}?   The reason is that I want to change the last command I added (addtocentrystyle).  Thanks for any help in advance.


Is it possible to carry the modulus sign $| . |$ in two lines. I just put a mwe for a hypothetical example. Thank you for any suggestions.  \documentclass{article} \usepackage{amsmath} \usepackage[utf8]{inputenc} \begin{document} \begin{equation*} \begin{split} \left| \sum_{n=1}^{\infty} (-1)^n (2x+1)^{n} \sin \left( \frac{\pi}{2} x^n \right) \right|&=\left| -(2x+1) \sin \left( \frac{\pi}{2} x \right) + (2x+1)^2 \sin \left( \frac{\pi}{2} x^2 \right) - (2x+1)^3 \sin \left( \frac{\pi}{2} x^3 \right) + (2x+1)^4 \sin \left( \frac{\pi}{2} x^4 \right) \\ &\dots +(-1)^{n-1} (2x+1)^{n-1} \sin \left( \frac{\pi}{2} x^{n-1} \right) +(-1)^n (2x+1)^n \sin \left( \frac{\pi}{2} x^n \right)  \right|   \end{split} \end{equation*} \end{document}


Evaluate $\int \cos(\cos x)~dx$   I tried to use chain rule but failed. Can anyone help me please?


In the Stargate universe, the vortex from the naqahdah disc which occurs once an address is correctly dialed emits a fluid-like substance. Is this substance an ionized radiation or a chemical exposed to the breathable oxygen?  The question: 'Is the Chappa'ai vortex ionized or toxic?'


As the photo - Variable 'n' has already been declared.  I've tried clearing my cache, as well as using a new user profile with no extensions, but it doesn't work.  Might be useful to know so it can be fixed before more people are using Chrome (If it's SO's fault of course!)


Energy propagation through stationary points of a standing wave

I take two identical lasers, point them at each other from a large distance in space, and fire a pulse from each. The pulse is $N$ wavelengths long. The pulses intersect at the mid point and, for a while, a standing wave is formed by their superposition, and in that standing wave are a series of stationary points at which the E and H fields are 0. There will be $N$ such points, some longer lived than others. However, both pulses are carrying energy, in the E and H fields, and that energy arrives at the final destination, so energy is being transferred, in the form of E and H fields, through points that never have an E or H field. I can do maths, but I'm looking for some sort of physical explanation of what is actually happening to allow this. Can anyone point me in the right direction? I've found a related question which doesn't have answers I can accept (or, for that matter, an accepted answer)  and this one which has the right title but isn't the question I'm asking  This last one doesn't answer the question - the accepted answer instead explains how an additional wave can travel through a pre existing standing wave - I want to know how the two waves forming the standing wave are propagating energy through the nodes.


I am looking for a solution for Windows to be able to type the same commands in multiple terminals (SSH) at the same time. I am using ConEmu with Git bash, but any solution for Windows is of interest.


ubuntu 16.10 konsole is very slow connecting to gb.archive.ubuntu.com

Why apt-get install is always slow at this line below?  0% [Connecting to gb.archive.ubuntu.com (2001:67c:1560:8001::14)]   It takes up to 5 to 10 mins sometimes. It just gets stuck there most of time.  For example:  $ sudo apt-get install php-pgsql Reading package lists... Done Building dependency tree        Reading state information... Done The following packages were automatically installed and are no longer required:   gyp libjs-inherits libjs-node-uuid libuv1 libuv1-dev linux-headers-4.8.0-22 linux-headers-4.8.0-22-generic linux-image-4.8.0-22-generic linux-image-extra-4.8.0-22-generic   node-abbrev node-ansi node-ansi-color-table node-archy node-async node-block-stream node-combined-stream node-cookie-jar node-delayed-stream node-forever-agent node-form-data   node-fstream node-fstream-ignore node-github-url-from-git node-glob node-graceful-fs node-gyp node-inherits node-ini node-json-stringify-safe node-lockfile node-lru-cache   node-mime node-minimatch node-mkdirp node-mute-stream node-node-uuid node-nopt node-normalize-package-data node-npmlog node-once node-osenv node-qs node-read   node-read-package-json node-request node-retry node-rimraf node-semver node-sha node-sigmund node-slide node-tar node-tunnel-agent node-underscore node-which Use 'sudo apt autoremove' to remove them. The following additional packages will be installed:   php7.0-pgsql The following NEW packages will be installed   php-pgsql php7.0-pgsql 0 to upgrade, 2 to newly install, 0 to remove and 1 not to upgrade. Need to get 57.7 kB of archives. After this operation, 223 kB of additional disk space will be used. Do you want to continue? [Y/n] y 0% [Connecting to gb.archive.ubuntu.com (2001:67c:1560:8001::14)] Get:1 http://gb.archive.ubuntu.com/ubuntu yakkety-updates/main amd64 php7.0-pgsql amd64 7.0.13-0ubuntu0.16.10.1 [55.8 kB] Get:2 http://gb.archive.ubuntu.com/ubuntu yakkety/main amd64 php-pgsql all 1:7.0+44 [1,920 B]                                                                                Fetched 57.7 kB in 8min 4s (118 B/s)                                                                                Selecting previously unselected package php7.0-pgsql.                                                                                (Reading database ... 258311 files and directories currently installed.)                                                                                Preparing to unpack .../0-php7.0-pgsql_7.0.13-0ubuntu0.16.10.1_amd64.deb ...                                                                                Unpacking php7.0-pgsql (7.0.13-0ubuntu0.16.10.1) ... Selecting previously unselected package php-pgsql. Preparing to unpack .../1-php-pgsql_1%3a7.0+44_all.deb ... Unpacking php-pgsql (1:7.0+44) ... Processing triggers for libapache2-mod-php7.0 (7.0.13-0ubuntu0.16.10.1) ... Setting up php7.0-pgsql (7.0.13-0ubuntu0.16.10.1) ...  Creating config file /etc/php/7.0/mods-available/pgsql.ini with new version  Creating config file /etc/php/7.0/mods-available/pdo_pgsql.ini with new version Setting up php-pgsql (1:7.0+44) ... Processing triggers for libapache2-mod-php7.0 (7.0.13-0ubuntu0.16.10.1) ...   I'm on ubuntu/ kubuntu 16.10.  EDIT:  $ ping -c4 gb.archive.ubuntu.com PING gb.archive.ubuntu.com(steelix.canonical.com (2001:67c:1560:8001::11)) 56 data bytes  --- gb.archive.ubuntu.com ping statistics --- 4 packets transmitted, 0 received, 100% packet loss, time 3056ms   vs  $ ping6 -c4 gb.archive.ubuntu.com PING gb.archive.ubuntu.com(steelix.canonical.com (2001:67c:1560:8001::11)) 56 data bytes  --- gb.archive.ubuntu.com ping statistics --- 4 packets transmitted, 0 received, 100% packet loss, time 3073ms   EDIT 2:  $ which ping /bin/ping  $ ping -V ping utility, iputils-s20150815


Get/Set coordinates for UV vertices using Python

I got this UV map, and I want to set the position coordinates for all the four vertices to x=0.5 and y=0.5 (in the center of the green pixel).  I've already tried to use bpy.ops.transform.translate(value=(0,0,0)), but this moves the vertices relative to the current position. Is there a way to set specific coordinates/position for the UV vertices?


Operation not permitted turning off airplay mirroring

I'm running the command  sudo chmod 000 /System/Library/CoreServices/AirPlayUIAgent.app/Contents/MacOS/AirPlayUIAgent   Because AirPlay mirroring is messing with one of my programs, but it tells me "Operation is Not Permitted". I'm the owner of this Mac and should definitely be permitted, some help please?


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


Zsh says "no matches found" when trying to download video with youtube-dl

I downloaded youtube-dl using pip on CrunchBang (a Debian Wheezy distro). When I run   youtube-dl {video URL}   I get  zsh: no matches found: {video URL}   I guess it has something to do with zsh, because I found some users on Arch forums complaining about it. When I switched to bash it worked.


How do I limit the number of rows returned by an Oracle query after ordering?

Is there a way to make an Oracle query behave like it contains a MySQL limit clause? In MySQL, I can do this: select *  from sometable order by name limit 20,10  to get the 21st to the 30th rows (skip the first 20, give the next 10). The rows are selected after the order by, so it really starts on the 20th name alphabetically. In Oracle, the only thing people mention is the rownum pseudo-column, but it is evaluated before order by, which means this: select *  from sometable where rownum <= 10 order by name  will return a random set of ten rows ordered by name, which is not usually what I want. It also doesn't allow for specifying an offset.


Mathematician learning theoretical physics

EDIT:  I was aware of the supposed duplicate.  But I'm interested in a clear and focused path through the basics to advanced theoretical physics such as string theory - a path that avoids studying engineering physics - for a pure mathematician with no physics background.  I can't see in the supposed duplicate where this path is outlined.  ...  I'm a pure mathematics PhD student in Riemannian geometry / geometric analysis.  My main interests are in Einstein manifolds, Ricci flow, harmonic maps, and Yang-Mills theory.    I have no training whatsoever in physics:  I've never even picked up the typical 1,500 page textbook titled Physics for Scientists and Engineers etc.  I've only ever read pure mathematics and can handle any level of pure mathematics to any level of abstraction.  I'd like to learn the background and basics in theoretical physics motivating the above areas of geometric analysis to develop physical intuition: general relativity, gauge field theories, and the standard model of particle physics, etc.  Ideally I also want to learn advanced theoretical physics such as quantum field theory, string theory, and sypersymmetry.  I'd like a structured path through basic to advanced theoretical physics for a mathematician with no physics training.  I have looked at many standard references in these areas but their assumptions on the physics background of the reader does not align with my background.  These standard references all start talking and explaining things in physics notation, terminology, concepts, and intuition that is assumed on the reader.  Question:  As a pure mathematician, how do I learn basic through to advanced theoretical physics in an clear, focused and structured way?  What books should I read?  Are there books tailored to a target audience like myself: a pure mathematician with no physics background?  If required, I'm happy to start from scratch by working through a 1,500 page physics textbooks.  However, after progressing through mathematics one realises that starting with working through the typical 1,500 page calculus textbook, such as Stewart Calculus, is unnecessary because those books are tailored to engineers.  Instead, one can start with a book on set theory, proof, and logic, and then go straight into standard undergraduate books like Rudin Principals of Mathematical Analysis and Herstein Topics in Algebra, etc.  Indeed, many universities offer a streamlined program of study for pure mathematics majors that avoids wasting time on engineering calculus.  Question:  Is it the same situation in physics?  Are those 1,500 page physics textbooks targeted mostly at engineers and is there a focused and streamlined path through theoretical physics that starts at the start of theoretical physics and gets to advanced theoretical physics such as quantum field theory and string theory without having to learn engineering physics?  I would be VERY grateful for someone to provide some book recommendations and possibly a structured path for achieving the above.


Access denied to Windows partition on Ubuntu 17.04

I have installed Ubuntu 17.04 dual boot with Windows 10. Now I can't write data to my local disks from Ubuntu. I have only read access. Please help me to fix this problem.


Check an user belongs to a AD group inside SharePoint Group using SPServices JQuery

I want to check the current user exisit in a AD group inside the SharePoint Group using SPServices JQuery. I used the below code snippet but not successed. Any suggestions?   $().SPServices({         operation: "GetGroupCollectionFromUser",         userLoginName: $().SPServices.SPGetCurrentUser(),         async: false,         completefunc: function (xData, Status) {              if ($(xData.responseXML).find("Group[Name='SP Group Name']").length == 1)              {               }             else              {              }         }      });


Making apple account without credit card

How do I make an apple account without a credit card. I've tried everything!!! I do not have a credit card to make an account but i need to make one to download apps.


When I scanned my $HOME directory with baobab (Disk Usage Analyzer), I found that ~/.cache is consuming about half a GB.  I also tried to restart and again check size but no difference.  So, I am planning to rm -rf ~/.cache. Let me know Is it safe to clear ~/.cache?


This one is more of a netiquette question.  Sometimes I stumble on "unanswered" questions that were actually answered - in their comments. Those questions are shown as unanswered in the statistics.  For example: .  What should be done?   Flag the question so one moderator can somehow mark it as answered. Answer the question yourself (as a community wiki answer), mostly by copying the comments. Nothing. Move along.   EDIT  I'm talking about questions without activity for weeks or months.  Feature request  Give diamond-mods the ability to change a comment to an answer; and allow users to flag for this action.


When I type the command   top   The first row of the output is   29646 Usernam+  20   0 7041320 1.047g 105604 S  1267  0.6 256:11.86 MATLAB   As you can see, the CPU utilization is 1267%. That means, this process is using 13 CPU of the server. By the following command, I try to force this process to use only one CPU (The 30th CPU of server)  taskset -c -p 30 29646   However, I still see the CPU utilization of the process is about 1300%. Why taskset is not working properly?


Posting an answer now requires 10 reputation on this site

I was trying to answer a puzzle . But this question is marked protected and says, posting an answer now requires 10 reputation on this site..  I do have 100+ reputation, but still the site is not allowing me to answer. What could be the issue?


If $H$ and $K$ are finite supgroups of a group $G$, then $|HK| = \frac{|H||K|}{|H\cap K|}$

I want to prove following statement:  If $H$ and $K$ are finite supgroups of a group $G$, then $$|HK| = \frac{|H||K|}{|H\cap K|}$$  This is a proposition 13 in Dummit and Foote's Abstract Algebra chapter 3.3.   Intuitively, I can guess the order of $|HK|$ is proportional to $|H|$ and $|K|$ modulo some intersection.   The textbook states,  \begin{align} HK = \bigcup_{h\in H} hK \end{align} then it suffices to show that there are $\frac{|H|}{|H\cap K|}$ distinct cosets in this union.   I can understand the division of $HK$ as a sum of $hK$, but I'm having trouble understanding the next step.   Can you explain this in more detail?   Perhaps another proof of this will be helpful.     I have found same problem in     Now I have some sense.


I use this character to type the name of employee in my program vb6, but I can't type it. When I type alt+164 the letter c is appearing instead of ñ. How can I type this one? Is it on my program or on my computer? But I can type ñ in my computer in other applications e.g word,notepad.


What does the symbol $\Bbb C\setminus\{0\}$ mean? Here, $\Bbb C$ is the domain of complex numbers and the context is showing complex numbers follow pretty much the same rules as real calculus.


When I first saw the Accepted icon at the left, I interpreted it as being Accepted. So, I thought it was a bug. When I checked the answer online, I saw it wasn't accepted yet. So I accepted one of the answers, and the Accepted icon changed to the one seen at the right.  Given that, I think the green color is misleading. The site has gray Upvote, Downvote, and Accept icons. The app follows this, except for the Accept icon (which is green).  EDIT: Oh, wait. Looks like a duplicate of: … On the other hand, I think they have different concerns. He focuses not having a checked icon for unaccepted answers, while I focus on the color. Please flag this as dupe, if you think it is.


"sheaves of germs of differentiable functions are by no means coherent"?

This is related to a remark in Iitaka's algebraic geometry sec 1.12.  "...It should be noted that sheaves of germs of differentiable functions are by no means coherent. These facts seem to suggest coherence is linked with the property of being algebraic or analytic."   $\textbf{Q1:}$ What is the example of non-coherence for the differentiable case? First what is the sheaf of rings in the context? Is it ring of smooth functions?  $\textbf{Q2:}$ If I recall correctly, there are analytic sheaves which are not coherent.(I do not think I will recall this correctly.) Coherence is related notion to algebraic for sure but I have to use GAGA to say it is analytic. However, in analytic setting, there are non-coherent sheaves as well. Should I naively interpret coherence is subcase of analytic or algebraic?(But not the reverse in general?)


How can I recover my system after tasksel uninstalled too many packages?

So I was using Tasksel to install the MATE desktop env to try it out as an alternative to GNOME.  After that lengthy installation of MATE, MATE itself worked, but when using GNOME again, GNOME slowly started failing. Mostly using the Desktop Links of Nautilus, which broke. Nautilus only worked when started from the terminal and leaving that open.   This started days ago and I tried reinstalling Nautilus and its depending packages several times. No avail. Uninstalled Caja as I thought it may interfere.   Today I booted into recovery mode and used tasksel there inside GUI mode in a Terminal, still not sure how I got into GNOME from recovery mode...  It listed MATE as U but uninstalled ubuntu-mate-desktop anyway.   After a while, I noticed Symbols vanish, fonts being missing, etc until all I was left was the wallpaper.  After reboot, it went straight into shell.   How do I get back into GNOME, when tasksel just apparently uninstalled the whole system? I can't use APT there, the network seems missing.   Tools like the initramfs thing are missing for some unknown reason too.   Oh, I am... Well was... Using Ubuntu 18.04 latest updates.   How can I recover my system? Was tasksel always this volatile?


Projection on the hyperplane $H: \sum x_i=0$

Consider the hyperplane $H: \sum_{i=1}^n x_i=0$. Let $P$ denote the orthogonal projection onto $H$. What exactly is the matrix $P$ and how do we find it?


Delimiter for comments in text citations in biblatex

In the question , I learned how to remove a postnote delimiter when the citation doesn't contain a numeral, by adding this to the preamble:  \renewcommand{\postnotedelim}{\iffieldnums{postnote}{\addcolon}{\addspace}}   However, this also removes the delimiter between a regular citation and a "comment" style citation (such as "NN p.c.") (cf. ).  The question is, how do I make sure that the delimiter between the "regular" citations and the "comment" is the same character (comma, semicolon) as used to delimit the "regular" citations?  \documentclass{article} \usepackage[style=authoryear]{biblatex} \DeclareFieldFormat{postnote}{#1} \renewcommand{\multicitedelim}{\addcomma\space} \renewcommand{\postnotedelim}{\iffieldnums{postnote}{\addcolon}{\addspace}} \usepackage{filecontents} \begin{filecontents}{\jobname.bib} @book{lennon1972,     AUTHOR = "John Lennon",     TITLE = "Who did what in the Beatles",     YEAR = "1972"} @book{starkey1994,     AUTHOR = "Richard Starkey",     TITLE = "I'm the drummer",     YEAR = "1994"} @ONLINE{archiveZ,     TITLE = "Archive Z",     SHORTHAND = "Archive Z",     URL = "http://www.archivez.com",     URLDATE = "2013-03-22"} \end{filecontents} \addbibresource{\jobname.bib}  \begin{document} I know from books and people I have talked to that George Harrison played the guitar in the Beatles \parencites(Paul McCartney p.c.) [48]{lennon1972}[103]{starkey1994}[no. 58]{archiveZ} \end{document}     The citation should ideally look like this:     (Lennon 1972:48, Starkey 1994:103, Archive Z no. 58, Paul McCartney p.c.)


Draw a 5x5 square. In 16 of 25 squares draw diagonals in such a way that no diagonal ends touch. How can I do this?


In $\sin(\sin(x))$ Why should I Calculate the $\sin$ of $(\sin(x))$ radians not the $\sin$ of $\sin(x)$ degrees?

Why is radians the only unit for which I can use take $\sin(\sin(x))$ (Why is it the the default unit of trigonometry). This does not work if change the definition of a radian. But works if we change the definition of $\pi$ itself  Is this due to how we derive the Taylor Polynomial of $\sin(x)$ and $\cos(x)$ ? or How the  differential of $\sin x$ in radians is $\cos x$ ?(i.e because $\frac{\sin x}{x}$ converges to $1$ as $x\to 0$)  Or is it because of some convention or assumption somewhere?


check that $p(t)=\lambda e^{-\lambda t}$ is a density function

I have to prove the following is a density function $p(t)=\lambda e^{-\lambda t}$ when $t>=0$.  $p(t) = 0$  for $t<0$  If I understand correctly, if solve the integral, I should get $1$, because this the definition of a density function.  I tried the following...  $$\int_{0}^{\infty}\int_{-\infty}^{\infty}\lambda e^{-\lambda t}$$ ...which resulted in... $$\int_{0}^{\infty}[(-\lambda e^{-\lambda t})/\lambda]^{\infty}_{-\infty}$$  I do not know how to proceed. If I just plug in the infinities then I $0$ I think. How do I check if the function is a density function?


Let's assume $Y=\sum_{i=1}^{N}\alpha_iX_i^2$.  where $X_i$ has Gaussian distribution with mean $0$ and variance $1$, i.e., $\mathcal{N}(0,1)$ and $\alpha_i$s are constants.  When $\alpha_i$s are all $1$, the distribution of $Y$ is Chi-Squared. My question is what is the distribution of $Y$ when $\alpha_i\neq 1$?


Can I increase my SPECIAL stats later in the game?

I'm setting my SPECIAL stats and I don't know how irreparable this damage will be... How will I be able to modify my SPECIAL stats after leaving the vault, if at all?  Theoretically, could I get each stat to 10 over the course of the game?


Write a formula in an Excel Cell using VBA

I'm trying to use VBA to write a formula into a cell in Excel. My problem is that when I use a semicolon (;) in my formula, I get an error:     Run-time error 1004   My macro is the following :   Sub Jours_ouvres()     Dim Feuille_Document As String     Feuille_Document = "DOCUMENT"             Application.Worksheets(Feuille_Document).Range("F2").Formula = "=SUM(D2;E2)"     End Sub


How do you plot a recursive sequence in pgfplots/tikz?

I'm trying to plot a recursive sequence namely x(1)=1, x(n+1)=1/2[x(n)+2/x(n)]. I've tried messing around with the \tikzmath library but so far I'm not really successfull. My main issue is properly defining the function, not sure how or even what tool to use to do so. Plotting it is the easy part though.  I'd appreciate any help.


Testing two logistic regression models with same coefficients on different time samples

I run the two logistic regressions on different time windows (let say 1/2015 and 3/2015) and get two sets of parameters estimates. They differ a little.   Is it possible to use any statistical test to find out whether the difference between every respective two parameters (from the first model and the second model) is significant?


I can't destroy blocks in Minecraft Creative Mode (singleplayer)

I just logged in to Minecraft after maybe 8-9 months at the most. When I first logged in, I tried to switch between modes but I forgot how, so I looked for it and it said to press F1. Before I did I could destroy and place blocks, but now I can't destroy them! Is this common, and does anyone know how to fix it? And btw, whenever I go onto a bare hand to destroy something, it just goes back to the first item in my inventory.


I just installed the latest version of R. What packages should I obtain?

Duplicate thread:   Are there any R packages that are just plain good to have, regardless of the type of work you are doing? If so, what are these packages? If not, what packages do you find the most useful?


How do I set up SIP voice calling in Empathy?

I would like to use Empathy for Internet voice chat, but I do not see an option under the Empathy Accounts menu to create a SIP account.  How do I set up Internet voice calling in Empathy?


Selecting data from another table using a foreign key

I have two tables A & B. Table A id | name | num  Table B id | date | roll  id in table B is a foreign key which relates to the id in table A. I want to get the contents of table B where id is given and also along with that data, I need the name whose id is given from table A. NOTE: cannot use multiple queries separated by commas; need to do both the SELECTs in one query.


I am using Spring (Web MVC - REST) 4.3.3, spring security 3.2.4, Spring security Oauth 1.0.0 and OAuth2 for Authorization.  I am storing user's id as principle of authentication object.   My Question is, I want to know which user called the web service in the Service layer. How can I get that?  I want to use it like this,  Suppose someone creates an user. The creator will be stored in the new user. One way is to pass creator in the user object from client but I want that to be got from token itself because it already has that information.  EDIT  A brief explanation of downvote is welcomed.


Can I flash a rom, that is not exactly made for my phone, but has the some socket (MT6753)?

My phone is an Elephone P6000 Pro with Android 5.1 and I want to flash the Vernee Thor's 7.1 rom. Both of the phone has MT6753. Is it possible?


How do I design a 2A or more power supply for my consumer USB devices?

I understand that many of my consumer devices charged by USB ports can charge at higher rates than 0.5A.  However, in testing, I've found they don't consume more than this. Test Setup  I have a power supply that outputs between 0 and 30 volts, and 0 to 20 amps. I set the voltage to 5 volts, then connected up a female USB to the wires correctly. When I plug in a Samsung Galaxy S4 Mini, it pulls around 0.44 amps. It is the same with a Samsung Galaxy Tab Pro. However, when I connect an iPad Air with an official lightning cable, it only pulls around 0.11 amps. Also, I tried connecting a ZGPAX S28 smartwatch and it was still about 0.44-0.45 amps.  The power supply is more than capable of outputting the maximum 2.1 amps, so why doesn't it to at least the tablets? What do I need to do in my test setup to convince the devices to consume their maximum charging current?


I am unable to install wkhtmltopdf on Ubuntu 14.4. I downloaded from  Linux (Ubuntu Trusty) 64 bit. I ran the following command:  sudo dpkg -i wkhtmltox-0.12.2.1_linux-trusty-amd64.deb   Here's the log  (Reading database ... 61662 files and directories currently installed.) Preparing to unpack wkhtmltox-0.12.2.1_linux-trusty-amd64.deb ... Unpacking wkhtmltox (0.12.2.1) over (0.12.2.1) ... dpkg: dependency problems prevent configuration of wkhtmltox:  wkhtmltox depends on fontconfig; however:   Package fontconfig is not installed.  wkhtmltox depends on libjpeg-turbo8; however:   Package libjpeg-turbo8 is not installed.  wkhtmltox depends on xfonts-base; however:   Package xfonts-base is not installed.  wkhtmltox depends on xfonts-75dpi; however:   Package xfonts-75dpi is not installed.  dpkg: error processing package wkhtmltox (--install):  dependency problems - leaving unconfigured Processing triggers for man-db (2.6.7.1-1) ... Errors were encountered while processing:  wkhtmltox   I searched but could not find anything specific. What am I missing here?


How are the packages from the official repo protected against malicious developer's changes?

Suppose that the sole developer of a niche open source project available from an official Ubuntu repository gets to sneak a malicious commit into their project, making the otherwise useful program act as a keylogger and send the collected data  to the project's server along with benign and expected data queries, or perform any other similar and clearly destructive activity.  What layers of security does Canonical provide to avoid that? Is the code available from the official repos independently audited? What if the package maintainer is in cahoots with the developer, or is the same person?


Time-consuming problem of inserting 10,000,000 elements into ArrayList and LinkedList

I have some problems when I test the time it takes to insert 10,000,000 elements into ArrayList and LinkedList. When I put the test code at both ends in two main() functions, the time spent on the LinkedList is greater than about ArrayList, which is about twice.   When I put both ends of the code in the same main() method and the ArrayList is inserted first, the ArrayList takes longer than the LinkedList, which is about twice as large. I want to know what happened? In theory, it should be that ArrayList takes less time.  The first piece of code:  public static void main(String[] args) {     long begin2 = System.currentTimeMillis();     List<Integer> l2 = new LinkedList<>();     for (int i = 0; i < 10000000; i++) {         l2.add(Integer.MAX_VALUE);     }     long end2 = System.currentTimeMillis();     System.out.println(end2 - begin2); //Time: 12362  }   public static void main(String[] args) {     long begin1 = System.currentTimeMillis();     List<Integer> l1 = new ArrayList<>();     for (int i = 0; i < 10000000; i++) {         l1.add(Integer.MAX_VALUE);     }     long end1 = System.currentTimeMillis();     System.out.println(end1 - begin1); //Time: 7531 }   Second piece of code:  public static void main(String[] args) {     long begin1 = System.currentTimeMillis();     List<Integer> l1 = new ArrayList<>();     for (int i = 0; i < 10000000; i++) {         l1.add(Integer.MAX_VALUE);     }     long end1 = System.currentTimeMillis();     System.out.println(end1 - begin1); //Time: 7555      long begin2 = System.currentTimeMillis();     List<Integer> l2 = new LinkedList<>();     for (int i = 0; i < 10000000; i++) {         l2.add(Integer.MAX_VALUE);     }     long end2 = System.currentTimeMillis();     System.out.println(end2 - begin2); //Time: 3533   }   The next code makes me even more confused, because the time difference between the two pieces of code is not so obvious：  `public static void main(String[] args) {         try {             Thread.sleep(10000);         } catch (InterruptedException e) {             e.printStackTrace();         }         long begin1 = System.currentTimeMillis();         List<Integer> l1 = new ArrayList<>();         for (int i = 0; i < 10000000; i++) {             l1.add(Integer.MAX_VALUE);         }         long end1 = System.currentTimeMillis();         System.out.println(end1 - begin1); //Time: 4542          long begin2 = System.currentTimeMillis();         List<Integer> l2 = new LinkedList<>();         for (int i = 0; i < 10000000; i++) {             l2.add(Integer.MAX_VALUE);         }         long end2 = System.currentTimeMillis();         System.out.println(end2 - begin2); //Time: 4325     }`


I have tried to install ubuntu-restricted-extras and vlc,  but I'm getting this:  $ sudo apt-get install ubuntu-restricted-extras [sudo] password for aashay:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package ubuntu-restricted-extras  $ sudo apt-get install vlc Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package vlc


Is there a way to obtain this font for the chapter numbering?

I saw this font in the following picture:    Can you suggest something to make it usable for the chapter numbers in a (La)TeX document?


Let n be a positive integer. Prove that: $\lfloor \sqrt{n}+\sqrt{n+1}\rfloor=\lfloor\sqrt{4n+2}\rfloor$


I would love a list of Shell commands for Windows. Not to be confused with commands that you would run in Windows DOS. Over time I have come across these commands here and there. Like for example if you need to access the users startup folder in Windows 8, you go to run (Windows Key + R) and then type shell:startup then you would get your startup folder so you could load programs on startup upon Windows logon. This commands also works in Windows 7 as well. Can some please tell me were I can find a list all of the shell: that you can run?


Why WordPress choose data serialization over json_encode?

In my little age with WordPress, I've seen WordPress itself and its friendly plugins are using PHP serialize() in storing data into db in many cases. But in a recent search I found a serious community support for the json_encode() over the serialize().     And I personally tested an associative array with both of 'em, that shows:  serialize() stores 342 chars json_encode() stores 285 chars  Why I'm asking this? I'm on a project while I'm going to store repeating meta fields to a post. Where:  Data would be basically in English, but sometimes can be Bengali Data would be associative array, 3 level deep (I hope I understood levels correctly):   array(     1 => array(         'key'=>'value',         'key2'=>'value'     ),     2 => array(         'key'=>'value',         'key2'=>'value'     ) )  I've checked the postmeta table's meta_value field it's a longtext,  a length of 4,294,967,295 chars (4GB). So I need a robust solution into storing things.


Does $a_n$ converges if and only if $a_{2n},a_{3n},a_{2n-1}$ converge? $a_{2n}$ is a subsequence of $a_n$ and $a_{3n},a_{2n}$ are subsequences of $a_{6n}$ so they all have the same limit But what about $a_{2n-1}$ can I say it is a subsequence of $a_{2n}$ and therefore they all have the same limit?


Why the ring of integers of $ \mathbb Q(\sqrt{-19}) $ is $ \mathbb Z\left[\frac{1+\sqrt{-19}}{2}\right] $?

Why the  of $ \mathbb Q(\sqrt{-19}) $ is $ \mathbb Z\left[\frac{1+\sqrt{-19}}{2}\right] $?  I came up with this question when I was trying to understand this: . And this result seemed to be mentioned in an algebraic number theory book when I was looking for references.


How does a Mac choose between Wi-Fi and Ethernet to work with?

My Mac is connected via a 1GBit Ethernet. However, from time to time I do turn on WiFi and let it connect, typically because I need to use AirDrop etc.  When I'm done with AirDrop I usually turn the Wi-Fi off and stay on Ethernet.   My thinking is that "wifi is slower" and my Mac may use it when downloading or uploading instead of my fast Ethernet. Now I realize this is not based on anything else other than fear.  Is there truth to my fear?   If a Mac has two active connections, Wi-fi, and Ethernet -- what will it choose to use when I'm uploading a large file? Is there a possibility it would choose to use the slower Wifi connection? Or does it employ some kind of algorithm to figure out which one to use based on availability, type and speed?


We have two scripts, first.sh and second.sh. We run first.sh from second.sh using the . (source) command.  I am stuck at this script,   first.sh   value="myvalue"  export value   oldvalue="othervalue"  export value   After initializing the value and exporting, we have initialized the oldvalue and again exported value instead of oldvalue , but still the othervalue is available in the script second.sh, even though we didn't export oldvalue in first.sh.


Show that $K[x,xy,xy^2,\dots]$ is not Noetherian

Here is the problem I am stuck on: Fix a field $K$ and consider the subring $A \leq K[x,y]$ generated by $K \cup \{x,xy,\dots,\}$. Show that $A$ is not Noetherian.  I figure that taking ideals $I_n = (x,xy,\dots,xy^n)$ should give an infinite strictly ascending chain, which would establish that $A$ is not Noetherian, but I cannot figure out how to show that each $I_n$ is a proper subset of $I_{n+1}$. Any help here?


Prove $\forall n \in \mathbb{N}, \sum\limits_{i=0}^{n-1} 2^i = 2^n -1$

I am stuck on proving this statement. I know I can use the definition of the geometric sum to prove this, but I wanted to know how to prove this without external definitions.   Let $P(n)$ be the statement $\forall n \in \mathbb N, \sum_{i=0}^{n-1} 2^i = 2^n - 1$  Proof. Let $n \in \mathbb N$.  Base Case (Let $n = 1$)  $\sum_{i=0}^{1-1} 2^i = 2^1 - 1$  $1 = 1$  Therefore $P(1)$ holds  Induction Step: Let $k \in \mathbb N$  Assume P(k): $\sum_{i=0}^{k-1} 2^ i = 2^k - 1$ is true (Induction Hypothesis)  W.T.P. $P(k + 1): \sum_{i=0}^k 2^i = 2^{k+1} - 1$  Now to prove $P(k+1)$, would I let $2^k$ be equal to $\sum_{i=0}^{k-1} (2^i +1)$, by the induction hypothesis? I'm not sure how to proceed.


Do have to prove Solvency when getting a visa to the US from Russia

I have friend that is working with a travel agency in Russia to visit me here in the US. She informed me that the travel agent told her she will have to prove solvency of 4500$ to get the visa or she would be denied. She has gotten her passport and the visa office in Russia has called and spoke with me and had me answer some basic questions. I very weary at this point cause she says she doesn't have the 4500$ and that she about 1900$ short of the 4500$. I would like to know if the solvency check is an actual thing?


The way to earn the 'Analytical' badge is: Visited every section of the FAQ (retired). What does (retired) mean? Does it mean that it is no longer available?


What causes a question to be protected by the Community ♦ user

I noticed  in particular, which has 5 deleted answers on it.  The most recently deleted answer was deleted by a diamond mod 3 minutes prior to the time it was protected by Community ♦  Is there an automated process that causes a question to be protected by Community ♦ instead of a human?  If so, what are the qualifications that it checks for in order apply the protection?  Related:


I'm trying to identify why, suddenly, 100% of our disk space is in use. I have already rebooted but the issue persists.  Here are the outputs of some commands that are showing some strange (for me) results:  danny@hydrogen:~$ df -h  Filesystem            Size  Used Avail Use% Mounted on /dev/cciss/c0d0p1     130G  122G  949M 100% / none                  1.9G  196K  1.9G   1% /dev none                  2.0G     0  2.0G   0% /dev/shm none                  2.0G   40K  2.0G   1% /var/run none                  2.0G     0  2.0G   0% /var/lock none                  2.0G     0  2.0G   0% /lib/init/rw   danny@hydrogen:/$ sudo du -chs /  du: cannot access `/proc/1662/task/1662/fd/4': No such file or directory du: cannot access `/proc/1662/task/1662/fdinfo/4': No such file or directory du: cannot access `/proc/1662/fd/4': No such file or directory du: cannot access `/proc/1662/fdinfo/4': No such file or directory   danny@hydrogen:/$ df  Filesystem           1K-blocks      Used Available Use% Mounted on /dev/cciss/c0d0p1    135342296 128144108    323104 100% / none                   1991336       196   1991140   1% /dev none                   1995788         0   1995788   0% /dev/shm none                   1995788        40   1995748   1% /var/run none                   1995788         0   1995788   0% /var/lock none                   1995788         0   1995788   0% /lib/init/rw   danny@hydrogen:/$ mount  /dev/cciss/c0d0p1 on / type ext4 (rw,errors=remount-ro) proc on /proc type proc (rw,noexec,nosuid,nodev) none on /sys type sysfs (rw,noexec,nosuid,nodev) none on /sys/fs/fuse/connections type fusectl (rw) none on /sys/kernel/debug type debugfs (rw) none on /sys/kernel/security type securityfs (rw) none on /dev type devtmpfs (rw,mode=0755) none on /dev/pts type devpts (rw,noexec,nosuid,gid=5,mode=0620) none on /dev/shm type tmpfs (rw,nosuid,nodev) none on /var/run type tmpfs (rw,nosuid,mode=0755) none on /var/lock type tmpfs (rw,noexec,nosuid,nodev) none on /lib/init/rw type tmpfs (rw,nosuid,mode=0755)   danny@hydrogen:/$ sudo du -h --max-depth=1  634M    ./premvet_sync 5.6M    ./etc 4.0K    ./opt 16K ./lost+found 7.4M    ./bin 623M    ./lib 196K    ./dev 0   ./sys 4.0K    ./srv 4.0K    ./cdrom 8.0K    ./media 52K ./tmp ... it hangs for ages here.....   The server is running Ubuntu 10.04.4 LTS.  System load:  2.85                Temperature:         8 C Usage of /:   94.7% of 129.07GB   Processes:           132 Memory usage: 39%                 Users logged in:     0 Swap usage:   0%                  IP address for eth0: 192.168.1.124  => / is using 94.7% of 129.07GB   I'm struggling to comprehend why this is happening! Any pointers would be appreciated.


What is the term for a cut from one close-up object to another absurdly similar close-up object? For example, in the movie "A Christmas Story", I think there is a cut from a close-up of a toilet lid closing, to a close-up of a kitchen cooking pot lid opening, momentarily fooling the viewer into thinking it's one continuous scene, and then bringing on thoughts of mild disgust and humor over the absurd juxtaposition.


Enable Wireless Monitor mode for traffic sniffing

I need to sniff all the wifi traffic that I can capture using wireshark in Ubuntu. My wireless interface is named as eth1 in the interfaces list. When I select that interface in Wireshark and start new sniff, I got following error;    As  thread says, I tried to installed the mentioned driver but I got an error in installation saying that that driver is not supported by my device. After that I tried the second answer in the same thread and run following command to enable monitor mode in my wireless card.  echo 1 > /proc/brcm_monitor0   Then I saw a new Ethernet interface (not a wireless interface ) called prism0 in wireshark interface list. I couldn't start a sniff using that interface using monitor mode because in that interface settings, monitor mode check box has been disabled.  I have installed a broadcom wireless driver in Additional Drivers as follows:    Is there an error listing my Wifi interface as eth1 rather than wlan0 in the interfaces list? How can I start my wireless interface in monitor mode for sniffing?   Thank you.


Help! My articles are not indexed correctly by search engines

Something is seriously wrong after I updated my site with new templates, moved to a new server and started writing on English rather than Norwegian.    I know from Google Analytics, that most of my readers comes from Google.  I do a quick test by googling (google.no) Oslo Fashion Fair 2009. This is the name of the article and is the title of my page. (   )  The page that I trying to find is this:   This used to be one of the first pages in Google. Now you don't see my site until Page 4, and that is a link to something completely different.  On page 4 in the google search, you see this:     Designere - Norwegian Fashion   Norske designere Når man tenker fashion,tenker de fleste på designere som Yves   Saint ...   Fashion Week Guide 16-22 august 2010 · Oslo Fashion Fair 2009 ...   www.norwegianfashion.no/blog/designere   There are a few problems with this:   The headline says Designere - Norwegian Fashion. I no longer have a page called Designere. It's now called . The link points to www.norwegianfashion.no/blog/designere. But I've never had that a URL with that name. The page does not exist. When you click the link, a completely different page opens.   I also noticed that I ahve lost Page Rank. My Page-RAnk add-on in Firefox will no longer rate my site, and Googles own Page Rank checker can't check my site for page ranking.  So what kind of SEO have I done?     I've put the <title> tag at the top, followed by the meta tags <description> and Keywords For new pages, I use my intro texst in the description field. I've made sure to use appropriate H1 - H3 tags I've got relative content in headline vs intro and main body text, as well as appropriate keywords. I've added my site to Google I've used Google Webmaster Tools to optimize my site I've added a sitemap.xml    I don't know why I'm suddenly not being indexed by any search engines. What have I done wrong?  UPDATE  Using Google Webmaster tool, I can see issues Google encountered when crawling my site. Thre are a lot of 404 Page not found errors.  Example of 404 errors:  nyhetsarkiv is now called news   I have deleted marianne ase user in Wordpress. This author do not exists any more   Not sure what this is. I'v enever used this permalink structure.


I prepared the chicken marinade and forgot to keep it in refrigerator and it's been quite a couple hours that I realised and kept in fridge but I don't know if it's still good or gone bad. Please help. Also I can see something watery thing that's released. if it has pls help and tell me how can I correct it.


I am working on a project to provide networking data to a food production line. All of the power (both 120 & 220 volts is run in a chase approx. 15' long and the chase is roughly 8"s tall and 6"s wide. Instead of having my networking Keystone Jacks cut into a sheetrock ceiling tile above the production line I am wondering if I can run 4 CAT-6 SHIELDED network cable in the same chase that contains the 120 & 220 Romex and just cut in my keystone jacks with stainless steel wall plates on both sides of the food production line in the proper places I need to to be able to connect 4 video controllers to the store network?


Why doesn't removing "recently-used.xbel" clear my "Recent" folder?

I have searched on Google, and I have completed the following steps:   Delete "all" activity history from the "Privacy" application. Remove the file "recently-used.xbel" from ~/.local/share $ nautilus -q Remove the file "activity.sqlite" from ~/.local/share/zeitgeist $ zeitgeist-daemon --replace &   I checked my "Recent" folder in between all of the above steps and none of them had any impact. I also tried:   Remove all files with "sqlite" in the name from ~/.local/share/zeitgeist (3 files:)  activity.sqlite activity.sqlite-shm activity.sqlite-wal  $ zeitgeist-daemon --replace &   None of the above had any impact on the contents of the "Recent" folder.  According to everything I've found, removing the file "recently-used.xbel" and restarting Nautilus should clear the "Recent" folder. Why isn't it working?


Single Unpopular Question eats all reputations and limits low rep users

I have notices that sometimes a single unpopular question eats all user reputation, for users with less reputation, it may lower their reputation so that they can't even downvote or they loss other privilege that based on reputations.  I don't want to link any question here because I think its not appropriate, but I saw some examples in META.  My suggestion is that: allow users to downvote and other basic privilege when they lost reputation because of one question, because questions can't be deleted when had answers, and the principle can be based on previous reputation in some point.  More detail:  USER A get 200 reputation, then he/she can downvote, after this point, if the reputation decreased below 125, allow him to downvote.  Scenario:  User A answered 10 questions and gained 100 point, but asked one question that was unpopular and it causes user to loss all reputations.  In this scenario, the user lost all reputations and now he might not able even to downvote, I see that this is unfair some how, but its also realistic because its all about how this website works.


How to convert string to SolidColorBrush in C#?

I'm trying to convert a string to a SolidColorBrush in C#. The code I'm using is:  arrColors[arrColors.Length - 1] =                           (SolidColorBrush)new BrushConverter().ConvertFromString(sLine);   where sLine is a string read from a text file. For example, sLine might be "Black".  This code gives me a FormatException.


"paths must precede expression" error when trying to find all jpg files in the current directory

while running find command to find all the jpg files in the current directory as   find . -maxdepth 1 -type f -name *.jpg   i am getting the error as :   find: paths must precede expression: pic1 (1).jpg  Usage: find [-H] [-L] [-P] [-Olevel] [-Dhelp|tree|search|stat|rates|opt|exec] [path...] [expression]   i am not able to figure out what is wrong with that .


Error when trying to install of LibreOffice language tool extension

I got this error message when trying to install LibreOffice language tool in Ubuntu 14.04 32-bit.  (com.sun.star.uno.RuntimeException) { { Message = "[jni_uno bridge error] UNO calling Java method writeRegistryInfo: non-UNO exception occurred:  java.lang.NoClassDefFoundError: com/sun/star/task/XJobExecutor\X000ajava at stack trace:\X000at java.lang.NoClassDefFoundError: com/sun/star/task/XJobExecutor\X000a\X0009at  java.lang.ClassLoader.defineClass1(Native Method)\X000a\X0009at  java.lang.ClassLoader.defineClass(ClassLoader.java:759)\X000a\X0009at  java.security.SecureClassLoader.defineClass(SecureClassLoader.java:142)\X000a\X0009at  java.net.URLClassLoader.defineClass(URLClassLoader.java:467)\X000a\X0009at  java.net.URLClassLoader.access$100(URLClassLoader.java:73)\X000a\X0009at  java.net.URLClassLoader$1.run(URLClassLoader.java:368)\X000a\X0009at  java.net.URLClassLoader$1.run(URLClassLoader.java:362)\X000a\X0009at  java.security.AccessController.doPrivileged(Native Method)\X000a\X0009at  java.net.URLClassLoader.findClass(URLClassLoader.java:361)\X000a\X0009at  java.lang.ClassLoader.loadClass(ClassLoader.java:423)\X000a\X0009at  java.lang.ClassLoader.loadClass(ClassLoader.java:410)\X000a\X0009at  java.net.FactoryURLClassLoader.loadClass(URLClassLoader.java:810)\X000a\X0009at  java.lang.ClassLoader.loadClass(ClassLoader.java:356)\X000a\X0009at com.sun.star.comp.loader.RegistrationClassFinder.find(RegistrationClassFinder.java:52)\X000a\X0009at  com.sun.star.comp.loader.JavaLoader.writeRegistryInfo(JavaLoader.java:399)\X000aCaused by: java.lang.ClassNotFoundException: com.sun.star.task.XJobExecutor\X000a\X0009at  java.net.URLClassLoader.findClass(URLClassLoader.java:381)\X000a\X0009at  java.lang.ClassLoader.loadClass(ClassLoader.java:423)\X000a\X0009at  java.lang.ClassLoader.loadClass(ClassLoader.java:356)\X000a\X0009... 15 more\X000a", Context = (com.sun.star.uno.XInterface) @0 } }


Let $f$ be a continuous real-valued function in a circle $|z|\leq1$ and $|f|\leq1$. Prove that $| \oint_{|z|=1} f(z)dz |\leq4 $.   Any hint, please.


How to recover windows partition after installing ubuntu?

I had windows 10 installed on my asus laptop. Yesterday I installed ubuntu on it but in hurry i clicked clean installation of ubuntu. Which results in deletion of all drive which had so important data in it. I tried testdisk but it is not showing the deleted partition. I also tried many recovery softwares but they also are not showing lost partition. Is there any way to recover it back. Help me as soon as possible!


I'm just wondering where does the word "News" come from. Is it from the word "New" which means things that did not exist before?


What importance does the minimum of an identical and independently distributed random variables play in probability distribution?


How do you assert that a certain exception is thrown in JUnit 4 tests?

How can I use JUnit4 idiomatically to test that some code throws an exception?  While I can certainly do something like this:  @Test public void testFooThrowsIndexOutOfBoundsException() {   boolean thrown = false;    try {     foo.doStuff();   } catch (IndexOutOfBoundsException e) {     thrown = true;   }    assertTrue(thrown); }   I recall that there is an annotation or an Assert.xyz or something that is far less kludgy and far more in-the-spirit of JUnit for these sorts of situations.


Let $\lambda$ be a partition of length $n$ and suppose its largest diagonal block, the Durfee square of $\lambda$, has size $r$. By this I mean that $\lambda = (\lambda_1,\ldots,\lambda_n)$ is a non-increasing sequence of numbers, which I depict by the following diagram  \begin{align*} &\square \cdots \square \square \quad (\lambda_1 \text{ squares })\\ &\square  \cdots \square \quad (\lambda_2 \text{ squares }) \\ &\quad\vdots \\ &\square \quad(\lambda_n \text{ squares }) \end{align*}  and the largest $i\times i$ block one can fit to the topmost left is of size $r\times r$. The conjugate partition $\lambda'$ is given by reflecting the drawing above along the diagonal. If $\alpha_i$ and $\beta_i$ denote the sequence of numbers of blocks to the right of the diagonal in the $i$th row, and below the diagonal in the $i$th column, we write $\lambda = (\alpha_1,\ldots,\alpha_r\mid \beta_1,\ldots,\beta_r)$.   For example, for the partition $(5,4,2,1,1)$ has diagram $$ \begin{align} &\blacksquare\square\square\square\square\\ &\square\blacksquare\square\square\\ &\square\square\\ &\square\\ &\square \end{align} $$  and its conjugate is $(5,3,2,2,1)$. Its diagonal has length $2$, and in Frobenius notation we have $\lambda = (4,2\mid 4,1)$.  How can one show that the numbers $\lambda_1',\lambda_2'-1,\ldots,\lambda_r'-r+1,r+1-\lambda_{r+1},\ldots,n-\lambda_n$ form a permutation of $1,\ldots,n$? If $\lambda = (\alpha\mid \beta)$ in Frobenius notation, this is equivalent to the identity $$\sum_{i=1}^n t^i (1-t^{-\lambda_i}) = \sum_{j=1}^r (t^{\beta_j+1}-t^{-\alpha_j})$$ which is Example 4 in page 11 of MacDonald's Symmetric Functions and Hall Polynomials, which he states without proof, so presumably this is easy.   Continuing with the example, we compute that the sequence for $\lambda = (5,4,2,1,1)$ is $$5,3-1,3-2,4-1,5-1=5,2,1,3,4$$ a permutation of $1,2,3,4,5$.  In $(1.7)$ MacDonald proves that if we take $m\geqslant \lambda_1$ and $n\geqslant\lambda_1'$ then the numbers $$\lambda_i+n-i,1\leqslant i\leqslant n,\quad n-1+j-\lambda_j',1\leqslant j\leqslant m$$  are a permutation of $0,\ldots,m+n-1$ by labelling the vertical and horizontal edge-lines on the diagram of $\lambda$ fitted inside the diagram of $(m^n)$, but I haven't been able to come up with a proof similar to this.


Are third party chargers for iPhone bad despite having government agencies' certification stamps?

My usage history with Apple: iPhone 3 (2011~2013) and iPhone 8 (2018~present)  I sometimes used chargers purchased from convenience stores. Although all the chargers I got had government certification marks on them, so I thought they were 'originals' sanctioned from the manufacturers themselves, they were actually manufactured by third (usually Chinese) parties.   I did ask the government agency about this and the person in charge said that they were indeed safe(although I think there was a miscommunication such that he took the charger to be something else).   I also asked the Apple service desk for advice and they said the iPhone battery was designed to ward off overheating from unsuitable third party chargers.   Can an expert verify any of these answers here? Was there any danger in using these(in particular the danger of being electrocuted or damaging the smartphone).


Applying the Berry-Esseen theorem to non-identically distributed summands

I want to lower bound \begin{align}  \mathbb{P} \left( -\epsilon \leq  \sum_{i=1}^n X_i \leq 0 \right) &= \mathbb{P} \left( - \frac{\epsilon}{\sqrt{\sum_{i=1}^n \sigma_i^2}} \leq  \frac{\sum_{i=1}^n X_i}{\sum_{i=1}^n \sigma_i^2} \leq 0 \right) \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,(1) \end{align} where $\{X_i\}$ are mean zero, independent random variables with $\mathbb{E}[X_i^2] = \sigma_i^2 \leq H^2$ and $\mathbb{E}[|X_i|^3] = \lambda_i^3 \leq H^3$. From Equation $3$ in , I have that \begin{align} \sup_{x \in \mathbb{R}} |F_n(x) - \Phi(x)| \leq C_0 \left( \sum_{i=1}^n \sigma_i^2 \right)^{-3/2} \sum_{i=1}^n \lambda_i^3 \end{align} Loosening the bound above gives \begin{align} \sup_{x \in \mathbb{R}} |F_n(x) - \Phi(x)| \leq \frac{C_0}{\sqrt{n}} \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,(2) \end{align} Now I can write $(1)$ as \begin{align} F_n(0) - F_n \left(-  \frac{\epsilon}{\sqrt{\sum_{i=1}^n \sigma_i^2}} \right) \end{align} which by $(2)$ can be lower bounded as \begin{align} \Phi(0) - \frac{2C_0}{\sqrt{n}} - \Phi\left ( -  \frac{\epsilon}{\sqrt{\sum_{i=1}^n \sigma_i^2}} \right ) &\geq \frac{1}{2} - \frac{2C_0}{\sqrt{n}} - \Phi\left ( -  \frac{\epsilon}{H \sqrt{n}} \right ) \end{align} Can the last expression be improved to something like $K/\sqrt{n}$ for some constant $K$ for large $n$? I feel like I need some approximations to normal CDF $\Phi(x)$ for small $x$.


Does a Walker's senses diminish with time?

Based on  I started thinking about whether or not a Walker's senses will diminish over time.  We know that they at least have a sense of sight, hearing and smell, as evidenced S5E01 (and many others besides).  What we do not know is how old those Walkers were.  Is there any information that I missed in the show, or from other canon, to indicate whether or not a Walker ever loses any of these senses?


Preventing deadly/fatal commands from being run

After recently reading the article "", I've planned on somehow blocking/preventing/changing certain commands. I'm not worried that someone else will run destructive commands on my PC. I'm worried that I may be the culprit behind the accident.   I am worried about the commands listed below.  wget http://example.com/something -O – | sh –    I've run this line when I was copying & pasting commands from a guide. Had I noticed sh -, I'd have only run that after checking out the archive contents.     rm -rf /    I accidentally hit the 'Enter' key a lot...   I want to prevent making these mistakes in the future. Is there a command/configuration file that can ensure I don't commit these mistakes? I do not want to be able to run the commands above even with sudo/root permissions. It it okay if the solution can be reversed.  Resources that will help me learn more about Ubuntu (excluding common Ubuntu Wiki/Help/etc. links) would be greatly appreciated!  Data loss isn't my main concern. I want to make the terminal a little safer for myself ('newb-proofed' if you will). This would be helpful to me as I've got lot's to learn. I've started school again, & I can't be spending too much of my time resolving problems/error (as interesting as it is).  Edit:  Is it possible to require specific commands to ask for confirmation? If I wanted to set specific commands to require a special password, can it be done?


LNK2019 Error even though all files are added to project

I am a beginner in C++. Below are three files containing the relevant code to the problem. I am getting an error: Writer.obj : error LNK2019: unresolved external symbol "bool __cdecl isInArray<char>(char *,int,char)" (??$isInArray@D@@YA_NPADHD@Z) referenced in function "public: static void __cdecl Writer::write(......). I am using Visual Studio 2019. I understand this is an issue with the compiler not finding the definition of isInArray, but I made sure in Visual Studio that the files Utils.cpp and Utils.h are added to the project (it is automatically giving me the option to remove it from the project or deleting it entirely  when attempting. Plus, I added it by  write clicking on the solution and adding a new item, rather than from the file menu [I heard that this does not add the file to the project]). It  runs fine when the function definition is directly in Writer.cpp, but obviously I don't want all of my utility functions to be defined separately Utils.h #ifndef UTILS_H #define UTILS_H template<typename T> bool isInArray(T* arr, int length, T element); #endif  Utils.cpp #include "Utils.h" // i'm not sure if this is necessary   template<typename T> bool isInArray(T* arr, int length, T element) {     if (length == 0) return false;     for (short i = 0; i < length; ++i) {         if (arr[i] == element) return true;     }     return false; }  Writer.cpp // all includes #include "Writer.h" #include "Utils.h" #include <iostream> #include <chrono> #include <thread> #include <cstdlib>  void Writer::write(std::string output, bool includeNewLine) {     ...      // this is the only place isInArray is used     if (isInArray(vowels, sizeof(vowels) / sizeof(vowels[0]), output[i])) {         ...     } }  Thank you.


I'm doing the conversion of the month, the format (LONG) to an integer. But the months are converted without the 0. I must add the 0 of the months lower 10. How can I do?      String month = monthSelector.getSelectedItem().toString();     Calendar cal = Calendar.getInstance();     try {         cal.setTime(new SimpleDateFormat("MMMM").parse(month));     } catch (ParseException e) {          e.printStackTrace();     }     int monthInt = cal.get(Calendar.MONTH) + 1;


Adding button to the top bar results in two buttons and not only one

i add button to top of the bar but two buttons are added. how can i fix this problem d  class ExportAll(bpy.types.Menu):     bl_label = "ExportAll"     bl_idname = "OBJECT_MT_simple_custom_menu"      def draw(self, context):         layout = self.layout          obj = context.object          row = layout.row()         row.operator("mesh.primitive_cube_add")   def draw_btn(self, context):          layout = self.layout     row = layout.row(align=True)     row.operator('mesh.primitive_cube_add',text="CUP",icon="IPO_EXPO")  def register():     bpy.utils.register_class(ExportAll)     bpy.types.TOPBAR_HT_upper_bar.append(draw_btn)   def unregister():     bpy.utils.unregister_class(ExportAll)     bpy.types.TOPBAR_HT_upper_bar.remove(draw_btn)  if __name__ == "__main__":     register()


Requesting review of technically inaccurate answers

Some answers are plain wrong, or even harmful. Usually these get spotted pretty quickly and either fixed or deleted by the poster, on the basis of comments/votes.  Sometimes though these slip under the radar - the OP ignores the downvotes/comments, or nobody even picks up on it the first time around.  I've always assumed that VLQ flags in the 10K queue for answers that are technically flawed, but otherwise OK were effectively "request for review by somebody knowledgeable in this area". It seems though that .  How should answers like this be handled instead if VLQ is not appropriate? Is there a mechanism for requesting further review? Raising them in chat is sometimes an option, but not always appropriate.   The useful actions that might happen as a result of increased visibility:   Edits by domain experts Downvotes to hide the poor answer Less flawed answers by experts Delete votes by 20K users   Would a "technical issue flag" that pushes to a tab in  /review help?


search with upper and lower case letters

I want to make a search in a datagrid with the text "Modele" but it takes only the upper case or lower case according to the text to search. i want that it show me the "Modele" regardless of upper or lower case.  This is what i try:    private void textBox_model_TextChanged(object sender, EventArgs e) {      string searchValue = textBox_model.Text;      for (int u = 0; u < dataGridView_Articles.RowCount; u++)     {         if (dataGridView_Articles.Rows[u].Cells[5].Value.ToString().Contains(searchValue))         {             dataGridView_Articles.Rows[u].Visible = true;         }         else         {             dataGridView_Articles.Rows[u].Visible = false;         }     }             }


How to create a moderator part of the figure (arrows pointing other arrows, spacing, all X arrowheads on left of Y)?  Thanking you.


Reading a C/C++ data structure in C# from a byte array

What would be the best way to fill a C# struct from a byte[] array where the data was from a C/C++ struct?  The C struct would look something like this (my C is very rusty):  typedef OldStuff {     CHAR Name[8];     UInt32 User;     CHAR Location[8];     UInt32 TimeStamp;     UInt32 Sequence;     CHAR Tracking[16];     CHAR Filler[12]; }   And would fill something like this:  [StructLayout(LayoutKind.Explicit, Size = 56, Pack = 1)] public struct NewStuff {     [MarshalAs(UnmanagedType.ByValTStr, SizeConst = 8)]     [FieldOffset(0)]     public string Name;      [MarshalAs(UnmanagedType.U4)]     [FieldOffset(8)]     public uint User;      [MarshalAs(UnmanagedType.ByValTStr, SizeConst = 8)]     [FieldOffset(12)]     public string Location;      [MarshalAs(UnmanagedType.U4)]     [FieldOffset(20)]     public uint TimeStamp;      [MarshalAs(UnmanagedType.U4)]     [FieldOffset(24)]     public uint Sequence;      [MarshalAs(UnmanagedType.ByValTStr, SizeConst = 16)]     [FieldOffset(28)]     public string Tracking; }   What is best way to copy OldStuff to NewStuff, if OldStuff was passed as byte[] array?  I'm currently doing something like the following, but it feels kind of clunky.  GCHandle handle; NewStuff MyStuff;  int BufferSize = Marshal.SizeOf(typeof(NewStuff)); byte[] buff = new byte[BufferSize];  Array.Copy(SomeByteArray, 0, buff, 0, BufferSize);  handle = GCHandle.Alloc(buff, GCHandleType.Pinned);  MyStuff = (NewStuff)Marshal.PtrToStructure(handle.AddrOfPinnedObject(), typeof(NewStuff));  handle.Free();   Is there better way to accomplish this?    Would using the BinaryReader class offer any performance gains over pinning the memory and using Marshal.PtrStructure?


Why does a Hausdorff but not countably compact space have an infinite closed discrete subset?  In the proof of Theorem 2.1.5 in   E. K. van Douwen, G. M. Reed, A. W. Roscoe, and I. J. Tree, MR 1103993 , Topology Appl. 39 (1991), no. 1, 71--103.   the authors prove that a star compact Hausdorff space is countably compact. At the start of the proof they write     Suppose that $X$ is a Hausdorff space that is not countably compact. Then there exists $D = \{ x_n : n \in \mathbb N \} \subseteq X$, an infinite closed discrete subset.   I do not understand why if $X$ is Hausdorff but not countably compact, then there is an infinite closed discrete $D$.


I have some USD bills of 2003-2006. The money changers in India do not accept them. Some accept but offer the exchange at 10% discount than the quoted rate. Are the bills legal tender. I also have smaller denomination bills of 2009-2-13. What about their validity?


Haar Measure on Semidirect Product of Unimodular Groups

Let $M, N$ be closed subgroups of a given locally compact topological group such that the product $P = MN$ is semidirect, with $M$ normalizing $N$.  Assume second countable, sigma compact, whatever so that Radon products coincide with product measures.  To make life easy, assume $M, N$ are unimodular.  How do we construct a Haar measure on $P$?


I am using jQuery bind on bunch of radio buttons with the following code:  jQuery().ready(function() {     jQuery("input[name='rank_number']:radio").bind('change', function(){          submitSelectedRank();     });  });   This code is working fine on initial load of the page but the HTML for these radio buttons can be reloaded via an Ajax call using:  $.ajax({         type: "POST",         url: "/loadMyRadioButtons",         data: rankings,         dataType: "html",         success: function(response)         {              $('#radioBtnDiv').html(response);         }     });   Now the issue, anytime this ajax call replaces the HTML code, the binding stops working. How do I fix that?


Messages app showing unread number after deleted message. Can remove/reset?

Just what the title says, I deleted a group message in Messages, but it's still showing the unread number from that thread (see screenshot) and I can't bring up the group message because I deleted it.  Short of having someone text in that group again to make it reappear, anyone know how I can fully delete the thread, or clear the unread number?


My father has visa till July 2016, and when we came to US in March 2016, immigration officer put date of Sept 2016.  Now, I have to know that, can he stay till Sept 2016, or he has to leave US before July 2016?


Ubuntu 15.04 checking an ext4 partition on every boot

I have gone through other posts similar to my question, but i tried all solutions/ or their methods dont apply to my case.  There is no /forcefsck file on my system.  /etc/fstab contents:  UUID=6206c47e-b5aa-424f-876d-3c72889098b3 /     ext4    errors=remount-ro 0    1 UUID=caff3891-1cff-451f-8ab9-f5c074aa4dbc /home ext4    defaults          0    2 UUID=886f5731-2180-44cb-a46c-82b619bed4bd none  swap    sw                0    0   I did fsck with liveboot session on all ext4 partitions,and specially my main /home partition but didn't get any errors whatsoever.Ran this command: result no errors.  sudo e2fsck -f -y -v -C 0 /dev/sdb2   SMART check output:  $ sudo smartctl -H /dev/sdb smartctl 6.4 2014-10-07 r4002 [x86_64-linux-3.19.0-25-generic] (local build) Copyright (C) 2002-14, Bruce Allen, Christian Franke, www.smartmontools.org === START OF READ SMART DATA SECTION === SMART overall-health self-assessment test result: PASSED  $ sudo smartctl -i /dev/sdb smartctl 6.4 2014-10-07 r4002 [x86_64-linux-3.19.0-25-generic] (local build) Copyright (C) 2002-14, Bruce Allen, Christian Franke, www.smartmontools.org  === START OF INFORMATION SECTION === Model Family:     Seagate Momentus SpinPoint M8 (AF) Device Model:     ST1000LM024 HN-M101MBB Serial Number:    S2TTJ9HC801807 LU WWN Device Id: 5 0004cf 208283fbf Firmware Version: 2AR10001 User Capacity:    1,000,204,886,016 bytes [1.00 TB] Sector Sizes:     512 bytes logical, 4096 bytes physical Rotation Rate:    5400 rpm Form Factor:      2.5 inches Device is:        In smartctl database [for details use: -P show] ATA Version is:   ATA8-ACS T13/1699-D revision 6 SATA Version is:  SATA 3.0, 3.0 Gb/s (current: 3.0 Gb/s) Local Time is:    Sun Aug  2 07:50:04 2015 IST SMART support is: Available - device has SMART capability. SMART support is: Enabled     $ sudo dumpe2fs /dev/sdb2      But still, /dev/sdb2 (/home) gets checked every single time I do a reboot.  Any help?  PS: I've been getting this prompt very often on resuming the notebook from sleep.    There have been other users reporting about the annoyance of this dialog on the internet, with no clear explanation what this dialog is all about. This started appearing only when I upgraded to 15.04. Can this be related to my fsck problem?


RSA: Fermat-Euler Theorem - coprimality of message and modulus

I understand the implication of the Fermat-Euler theorem and how it applies to RSA and the detailed explanation by user  at  is very useful.  However, the Fermat-Euler Theorem states that $a$ and $n$ should be relatively prime to satisfy the following equation. $$ a^{\phi\left(n\right)}\equiv1\mod n $$ But I do not recall RSA stating any exceptions of $a$ which cannot be properly encrypted  Edit: Note that I have seen  which is very similar BUT the question is different and thus the given answer satisfies it however the answer does not show or prove why the fermat's theorem could still be used.  Edit 2: The reason it is a different question is because I am looking for the number theory function which enables the cryptographic system to work the way it does.


If $(G,*)$ is an abelian group, then show that $(a * b)^n = a^n * b^n$.

Define $a^2$ as $a * a, a^3 = a * a * a$, and for a positive integer $n, a^n= a * a * \cdots * a$ ($n$ copies of $a$).  (a) If $(G,*)$ is an abelian group, then show that $(a * b)^n = a^n * b^n$ for all positive integers $n$. (b) If $n$ is a positive integer, then show that $(a^n)^{-1} = (a^{-1})^n$.  By being an abelian group, commutative property w.r.t. $*$ is there.  (a) Need show that $(a * b)^n = a^n * b^n,\ \forall n\in\mathbb{N}$.  Stuck ...  (b) If $n$ is a positive integer, then show that $(a^n)^{-1} = (a^{-1})^n$. Unable to think of any approach.


How can I install Skype in ubuntu 17.04?

I have tried many times, but I could not complete the process.


Most efficient way to test equality of lambda expressions

Given a method signature:  public bool AreTheSame<T>(Expression<Func<T, object>> exp1, Expression<Func<T, object>> exp2)   What would be the most efficient way to say if the two expressions are the same? This only needs to work for simple expressions, by this I mean all that would be "supported" would be simple MemberExpressions, eg c => c.ID.  An example call might be:  AreTheSame<User>(u1 => u1.ID, u2 => u2.ID); --> would return true


Ubuntu minimal cd size after installation?

So I downloaded ubuntu ubuntu 14.04.3 mini.iso. I installed the ubuntu on virtual box.  Now after the installation the size used on the virtual hdd is 2.15GB??  Did I do something wrong? My goals was that I get a minimal installation with the mini.iso which size would be a few hundred MB.  I didnt check any additional packages to be installed only the basic ubuntu was checked but a file /dev/sda1 has a size of 1.1GB and udev has 361MB. now i am interested what is the actual size of the ubuntu operating system in this case and what is /dev/sda1  So can this be any smaller? more compact after installation?


pgfplotstable: dec sep = {.} doesn't work as expected

I need to use the point "." as a decimal separator, but something strange happens, I write: \documentclass[oneside]{scrbook} \usepackage[spanish, es-tabla]{babel} \usepackage{pgfplotstable}  \begin{document} \pgfkeys{/pgf/number format/.cd,fixed,precision=2,dec sep={n}} \pgfmathprintnumber{12.3456} \pgfkeys{/pgf/number format/.cd,fixed,precision=2,dec sep={.}} \pgfmathprintnumber{12.3456} \pgfkeys{/pgf/number format/.cd,fixed,precision=2,dec sep={,}} \pgfmathprintnumber{12.3456} \end{document}   the first one works as expected, but the others only show me the comma, why does this happen? am i forgetting something?, I tried also with use period,but it is the same.


Sci fi movie about a time traveling city

It is an old cheap sci fi movie that got forgotten. It was about a war in the future with cyborgs. The last standing city of humanity's survivors plan to use the city energy source to travel back through time to escape demise. But their first jump is in our time near a small desert town and they open a small hole to send some of their warriors to check and secure the site for the town's arrival. Some cyborgs also follow them to attempt to sabotage the whole thing. When the town people start dying they join forces with the people of the future to fight them off. At the end the battle is decided when the main hero points the energy beam of the city against the hordes of cyborgs and wins the war.


When I entered sudo apt update, It showed the following err. ~$ sudo apt update      Hit:1 http://ppa.launchpad.net/sylvain-pineau/kazam/ubuntu focal InRelease       Hit:2 http://archive.canonical.com/ubuntu focal InRelease                        Hit:4 http://ppa.launchpad.net/ubuntuhandbook1/audacity/ubuntu focal InRelease       Hit:5 http://ppa.launchpad.net/ubuntuhandbook1/avidemux/ubuntu focal InRelease       Err:3 http://www.getdeb.net/ubuntu focal-getdeb InRelease 403  Forbidden [IP: 143.95.32.90 80]                         Hit:6 http://in.archive.ubuntu.com/ubuntu focal InRelease        Hit:7 http://in.archive.ubuntu.com/ubuntu focal-updates InRelease      Hit:8 http://in.archive.ubuntu.com/ubuntu focal-backports InRelease      Hit:9 http://in.archive.ubuntu.com/ubuntu focal-security InRelease      Reading package lists... Done      E: Failed to fetch http://archive.getdeb.net/ubuntu/dists/focal-getdeb/InRelease  403  Forbidden [IP: 143.95.32.90 80]      E: The repository 'http://archive.getdeb.net/ubuntu focal-getdeb InRelease' is not signed.      N: Updating from such a repository can't be done securely, and is therefore disabled by default.      N: See apt-secure(8) manpage for repository creation and user configuration details.  Thanks in advance.


Why do I need interface when I can implement full class?

I tried to understand the use of interface and read  which says:     Interfaces define a standardized set of commands that a class will   obey.      The commands are a set of methods that a class implements.      The interface definition states the names of the methods and their   return types and argument signatures. There is no executable body for   any method that is left to each class that implements the interface.   I would like to ask why do I need to state name of methods and their return types and argument signatures in an interface while I can implement them directly in a class?


do liberate the memory at the end of the procedure used to something?

is the fact of liberating an instance of a worksheet at the end of a procedure  useful for something? here's the code:  sub Macro(path as String)    Dim ws as worksheet   set ws = thisWorkbook.Sheets("Recap")   ....   ...'do actions on the sheet ws   ...   set ws = Nothing  end Sub   so my question is: if I do not release the object ws, is that it will automatically release?  Set ws = Nothing serves some at the end of the procedure?  thanks


I am a sophomore in high school. When I approach a math problem or concept, I normally try to determine a formula or systematic method of solving all similar problems. However, since I entered precalculus, I have found that this approach does not work. I really love math and find it interesting and exciting, but I find that I am unable to solve the kinds of conceptual problems that I have been doing more recently. For example, when I try to do a counting problem, it is often unclear how to approach it. How can I improve my problem-solving and critical thinking skills? Also, how can I approach problems logically to solve ones that are not clear at first?


Best practices for direction control in 2d game on mobile

I've been working on a pacman clone in HTML5 for quite a while. ()  One important thing for me was always to keep it responsive, so it would be playable on all different handheld sizes. The big problem wit that is: it is way to hard to play on a mobile device.  On a desktop or laptop you can control Pacman using your keyboard's arrow keys or W-A-S-D, which - in my opinion - is really easy.  For touchscreen devices I added some buttons into the game and also the support for swipe gestures. Anyway, turns out it's still way too difficult to play for most of the users.  Do you know any better options on how to solve this issue?    EDIT: Just adjusted the game to detect swipe gestures on the whole screen and I think it is already a pretty nice improvement. Thanks for all the hints, and suggestions!


I have a nikon d3100 , A friend of mine needs a headshot for a billboard.I need to know if my camera can take a pic big enough (mp) I do have a 50mm lens I can use and plan to use a tripod and plan on using RAW.


How to serialize an object to XML without getting xmlns="..."?

Is there a way for me to serialize an object in .NET without the XML Namespaces automatically serializing also?  It seems that by default .NET believes the XSI and XSD namespaces should be included, but I don't want them there.


Force line break after item (with label)

I have looked at  solution and while it works for items without labels in my case I have the labeling environment (to be more specific: \begin{labeling}{alligator} ... \end{labelling}) and obviously a labeling list without labels doesn't make much sense.  Currently it looks like this (right part is cut off since it's not related to the issue):    Initially (before I added the Python 3.4 item) it looked okay but then I noticed that due to the length of some of the labels things weren't "looking" as if they had the same alignment especially since my labels are also bold which makes the issue even more visible.  I would like to feed a line break and get the following result:    I've just started learning about defining custom commands (or redefining present ones) and I'm having a tough time figuring out how to do that for the \item[...] command. Adding \mbox{}\\ after every single item is a lot of unnecessary work and even if I didn't have to do it (that is another solution for my problem is present) I would still like to know how to handle such commands.  I have tried  \let\OldItem\item \renewcommand{\item}[1]{\OldItem[#1]\mbox{}\\}   but it results in a horrible mess (plus it doesn't fix my issue at all):    Any ideas how to do this?


For a positive integer $n$, let $p(n)$ the largest prime divisor of $n$. Show that there exist infinitely many positive integers m such that $p(m − 1) < p(m) < p(m + 1)$.  Let $q$ be odd prime and $a<b$. $q^{2^b} - 1 =(q-1)(q+1)(q^2+1)...(q^{2^{b-1}}+1)$ $q^{2^{a}}+1 $ is a divisor of $ q^{2^{b}}-1  $    I don't know how to get the required inequality.


How does electricity travel through a set of resistors arranged parallel to each other?

For calculating net resistance in a combination of parallel resistors we use 1/R=1/r1+1/r2+1/r3....but electricity must travel through least resistance. Then how does this relation come in use? I am definitely unaware of some concept on this. The least 'r' should be the net resistance instead of sum of reciprocals..


What is the difference between $2.\bar{9}$ and $3$? Are they really equal? Then why is $2.\bar{9} = 2$ and $[3]=3$? And in high school, why do we learn $2.\bar{9} =  3$? Is there any satisfying argument about this? ($[ \ ]$ denotes GIF)


Calculating lat/lons from PostGIS table which has projected coordinate system?

I have a PostGIS table in a projected coordinate system (EPSG: 28355 or MGA94 Zone 55). In QGIS (with the PostGIS manager plugin) I calculate a coordinate by performing the following SQL:  UPDATE gisprod.buildings SET easting = x(centroid(the_geom))    Now I want to add a "lat" and "lon" field to this table and calculate the values using the appropriate coordinate system, in this case that would be (EPSG:4283 or GDA94).   Is there a way I can specify in the SQL statement to calculate the x/y coord using a different coordinate system?


I know that the "s" becomes "z" when it comes after a voiced sound. And it is pronounced as "s" when it comes after a voiceless sound. I also know rules about possessives but I don't know how natives pronounce a word when it ends in S and "apostrophe S" is added to it. For example: "Stannis's army". Do you add another syllable to it? Like Stannisiz? or just Stannis and ignore the possessive S? I really have difficulty in pronouncing words that end in S and possessive S is attached to it.


Prove that $$\sin\left(\frac{\pi}{n}\right)\sin\left(\frac{2\pi}{n}\right)\sin\left(\frac{3\pi}{n}\right).....\sin\left(\frac{(n-1)\pi}{n}\right)=\frac{n}{2^{n-1}}$$   Is there a proof without using complex numbers and $n-th$ roots of unity.