Why specifically does FTL violate causality?

Take this non-FTL scenario, involving a phone call and the postal service.  I send a postcard to my friend in Paris, asking whether they would like to visit me.  Since it will take some time to arrive, I decide to telephone instead and ask the same question.  I mention there is a postcard on the way, and my friend says yes, they would like to visit me.  After we finish speaking, my friend realises we didn't agree on a date for the visit, so my friend sends me a postcard to ask which date suits me best.  After realising that it will take some time to arrive, I get a telephone call from my friend asking the same question.  We agree on a date for the visit and hang up.  Some time later a postal worker in Paris is very confused, as they first see a postcard thanking the recipient for the invitation to visit, and then a few days later they see a second postcard inviting the same person to visit.  Somehow they have received the reply before the invitation.  They decide to telephone both my friend and I as our phone numbers are listed on the postcard, but we explain to the postal worker that we used the telephone to convey the information some time ago, and the postcards are arriving out of order due to the speed of the postal service.  Shortly afterwards, my friend receives my letter, and a day later I receive my friend's letter.  None of this violates causality, despite the postal worker seeing the events out of order, by getting the response before seeing the invitation.  Now if my friend was located in a distant star system, the postcard and postal service was replaced by a message sent at the speed of light, and the telephone was replaced by an instant FTL communication device, what exactly would change?  Apparently FTL communication allows things like the reply to arrive before the message was sent, but I cannot see how this would happen any more than telephoning before a postcard arrives results in time travel.  Even if my friend was travelling close to the speed of light (relative to me), experiencing a slower ticking clock, I cannot see how this would result in causality violation.  Sure, when I call my friend on the FTL-phone they'd hear my voice sound like a chipmunk because I am experiencing time faster than they are, but I can't see how any of this could result in anything going backwards in time.  Sorry to ask yet another of these questions but all the other answers I can find seem to involve a certain element of hand waving that avoids the key points of the issue.  In the hopes of avoiding this question being flagged as a duplicate, here are similar questions and my reasons why they don't answer this question:    States you will arrive before you leave but doesn't explain why.  Says the speed of light is constant no matter your reference frame, but seems to assume the speed of a spaceship travelling at c is also constant regardless of the reference frame.  That doesn't seem right to me, I can't see how a spaceship would "speed up", just because you view it from a different vantage point that happens to be moving in the same direction as the ship.  Photons may not be able to go slower than c under any circumstances, but a space ship sure can.  Seems to consider two frames with different clock speeds as synchronised, so a message sent at T1 = 10 will arrive at T2 = 10 even though T2 might be running at half the speed.  Explains that there is no universal timeline.  None is needed if you can calculate the speed of your friend's clock relative to your own.  Sadly I lack the physics degree required in order to understand the answer here.   I would really appreciate a detailed example showing exactly how FTL could produce a paradox and more specifically, why the paradox cannot be avoided.  Thanks in advance for any help you might be able to provide to help me wrap my head around this!


If $f:\Bbb R^2\to\Bbb R$, what does $$\frac{\partial^2 f}{\partial x\, \partial y}$$ mean? Does it mean $\dfrac{\partial}{\partial x}\left(\dfrac{\partial f}{\partial y}\right)$ or $\dfrac{\partial}{\partial y}\left(\dfrac{\partial f}{\partial x}\right)$?  (I know that most of the time due to Schwarz theorem it is irrelevant.)


Is the second sentence correct?     This is a dummy sentence. interk is the best service provider.   Here "interk" is the name of a service provider, which is registered with first letter small.


Bash (on Windows 10) doesn't locate any package

I have installed Bash on Ubuntu on Windows (after enabling the feature in settings)  I don't remember what I did, but the result was that apt-get doesn't locate ANY package  With and without sudo:  $ apt-get install <package> Reading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package <package>   I tried many fixes found on this site, like:  apt-get upgrade & apt-get update  & I tried recreating resources.list using nano  How could this be fixed?


Some questions and answers are marked Community Wiki and are owned by a community wiki user:  (In fact, this very question is one of them)  Why have Community Wiki posts? How do Community Wiki posts work? How does a post become a Community Wiki post? How can the Community Wiki status be removed from a post? How can I find Community Wiki posts?


Let $(X,S,\mu)$ be a measure space. Suppose $\mu(X)<\infty$. Put $E_n=\{$ $x\in X:$ $n-1\leq |f(x)|<n \}$ Then, $f\in \mathcal{L}^p$ if and only if $\sum_{n=1}^{\infty}n^p\mu(E_n)<\infty$. My attempt: Notice, $X=\bigcup_{n=1}^{\infty}E_n$. Since $(E_n)_n$ are pairwise disjoint, we deduce by a standard property of measures that $\mu(E_n)<\infty$ for each $n$. As a consequence, $\int |f|^p d\mu=\sum_{n=1}^{\infty}\int_{E_n}|f|^p d\mu$ Now, observe that for each $n$, $n^p\chi_{E_n} \geq |f|^p\chi_{E_n}\geq (n-1)^p\chi_{E_n}$ Upon taking integrals, we obtain: $ \sum_{n=1}^{\infty}(n-1)^p \mu(E_n)\leq\int |f|^p d\mu \leq \sum_{n=1}^{\infty} n^p\mu(E_n)$ So, if $\sum_{n=1}^{\infty}n^p\mu(E_n)<\infty$ then $f\in \mathcal{L}^p$. Now for the reverse, not that if $\mu(E_n)=0$ for each $n$ then we are done. If there is some $n$ such that $\mu(E_n)=0$  if $f\in \mathcal{L}^p$, then $\sum_{n=1}^{\infty}(n-1)^p \mu(E_n)<\infty$. Now the question is how do we determine whether a series coneverges given another one converges? The answer is the $\textbf{limit comparison test}$: Theorem: Let $\sum_{n=1}^{\infty}a_n$ and $\sum_{n=1}^{\infty}b_n$ be two series such that $a_n\geq 0$ and $b_n>0 0$ for all $n$.  Put $c= \lim_{n\rightarrow \infty}\frac{a_n}{b_n}$.  If $0<c<\infty$ then either both series converge or both series diverge.  To invoke this theorem notice that if for all $n$, $\mu(E_n)=0$ then we are immediately done. So, we may assume that for some n , $\mu(E_n)>0$. If for all $n$, this is the case, then we are immediately done. If only finitely many satisfy this property, then we may disregard the ones with 0 measure. Thus, we may assume for each $n$, $\mu(E_n)>0$. In which case, the limit comparison test above allows us to deduce that $c=1$. Since $\sum_{n=1}^{\infty}(n-1)^p \mu(E_n)$ converges, so must $\sum_{n=1}^{\infty}n^p \mu(E_n)$.


Is there a decision procedure for intuitionistic propositional logic?

Is intutionistic propositional logic decidable?  If so, what is a decision procedure for it, like tableaux for classical propositional logic?  EDIT: In the first revision I mistook "predicate" for "propositional".


If $f$ is continuous then $G$ is homeomorphic to $X$.

Let $f: X \to Y$ be a function. The graph of $f$ is defined to be the set $G = \{(x, f(x)) : x \in X\}$. Prove that if $f$ is continuous then $G$ is homeomorphic to $X$.     an anyone suggest  me the process of solving this problem, thanks.


(How) can I print my own checks on my printer on regular paper?

If I want to write a check from one of my accounts, I can obviously order a checkbook. The thing is, I don't want or need a whole checkbook. I might just need, like, 1 check. Maybe 2.  Now, banks nowadays allow depositing checks from just scanning them via a mobile app. So, really, most/all security features of the check (e.g. magnetic ink) are kind of irrelevant nowadays.  Assuming both parties involved in the transaction are fine with this, how can I actually print my own check so that it looks like a check I ordered by mail? Are there templates out there somewhere?


For an unbalanced dataset annotated by human annotators in which each item is assigned to different classes, what is the argument for and against using any of One-vs-One vs One-vs-ALL SVM classification approaches?


Superclass cannot has a pointer of derived class?

I'm doing my project in visual studio 2015 community version.  I want to create two class.  class A {     B* b;     public:     //several method...  }; class B : public A {     public     //several method... };   Is this possible?  I keep receive error code C2504. But I cannot translate this error message to English.  I'm sorry that I don't show this error message.    Two class are separated and each class .h file include others .h file For example, include "B.h" in A.h and vice versa.    I'm sorry I forgot adding semicolon.


Need help finding a specific Scifi trilogy, 2000-2004

I've been looking for a Sci-fi book trilogy that I'm pretty sure was published 2000-2004. Almost positive I read it in high school, think it might fall under YA or something but anyway details that I remember:  The first book starts out with us getting details about the protagonist via dreams I believe. Something about his ship being damaged or lost during the transit home after the war and the soldiers are debriefed during hypersleep. Well, because his ship was damaged/lost, the system never stops the debriefing and forces him to relive the experiences over and over again which causes a lot of trauma to the point where he has constantly recurring nightmares involving those memories.   Anyway, you find out he was a soldier who fought with a power suit of some kind and his branch of the military didn't believe in harming the environment. They fought what he called a "Pure War", only causing destruction to the enemy never the surrounding life. The last war he fought was against some kind of bugs.  Apparently his unit was sabotaged by the local populace who were supposedly helping them with upkeep. The mechanics were putting some kind of alien eggs inside the suits so that they would cause the wearer to go battle crazy and then the suits would explode from the inside out as the alien bug ripped out from their bodies.   He later meets some kind of orphan/thief/beggar girl who you believe is super young at the time. She helps him out because at some point, I don't remember why or how, he has to go on the run from the government.  That's a lot from the beginning of the first book. I don't really remember how it ends but the girl ends up having special abilities later in the series, and you find out that there is an alien inside the protagonist's suit but it's not the bug alien but a different kind/species. Last but not least, the girl and protagonist end up as lovers at some point during end of the first or middle of the second book. I'm not too sure.  Anyways, I hope someone can help me out with this, it's been driving me bonkers. I remember some other stuff, like specific scenes if you think those would help.


Uncaught exception thrown after moving my website to localhost

My website works right on server, I took a backup from database and public_html in order to have a copy of my webstie in localhost.  I imported the database but it reported an error, some thing was wrong with content of  cache_views table, so I emptied this table and database successfully imported. I replaced public_html with the old one and configured settings.php. but it doesn't work, it reports this error :  Additional uncaught exception thrown while handling exception.  Original  PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT s.lid, t.translation, s.version FROM {locales_source} s LEFT JOIN {locales_target} t ON s.lid = t.lid AND t.language = :language WHERE s.source = :source AND s.context = :context AND s.textgroup = &#039;default&#039;; Array ( [:language] =&gt; fa [:source] =&gt; Makes the view results available as a context for use in Panels and other applications. [:context] =&gt; ) in locale() (line 684 of C:\xampp\htdocs\test\modules\locale\locale.module).   Additional:  PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: INSERT INTO {watchdog} (uid, type, message, variables, severity, link, location, referer, hostname, timestamp) VALUES (:db_insert_placeholder_0, :db_insert_placeholder_1, :db_insert_placeholder_2, :db_insert_placeholder_3, :db_insert_placeholder_4, :db_insert_placeholder_5, :db_insert_placeholder_6, :db_insert_placeholder_7, :db_insert_placeholder_8, :db_insert_placeholder_9); Array ( [:db_insert_placeholder_0] =&gt; 0 [:db_insert_placeholder_1] =&gt; php [:db_insert_placeholder_2] =&gt; %type: !message in %function (line %line of %file). [:db_insert_placeholder_3] =&gt; a:6:{s:5:&quot;%type&quot;;s:12:&quot;PDOException&quot;;s:8:&quot;!message&quot;;s:455:&quot;SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT s.lid, t.translation, s.version FROM {locales_source} s LEFT JOIN {locales_target} t ON s.lid = t.lid AND t.language = :language WHERE s.source = :source AND s.context = :context AND s.textgroup = &amp;#039;default&amp;#039;; Array ( [:language] =&amp;gt; fa [:source] =&amp;gt; Makes the view results available as a context for use in Panels and other applications. [:context] =&amp;gt; ) &quot;;s:9:&quot;%function&quot;;s:8:&quot;locale()&quot;;s:5:&quot;%file&quot;;s:52:&quot;C:\xampp\htdocs\test\modules\locale\locale.module&quot;;s:5:&quot;%line&quot;;i:684;s:14:&quot;severity_level&quot;;i:3;} [:db_insert_placeholder_4] =&gt; 3 [:db_insert_placeholder_5] =&gt; [:db_insert_placeholder_6] =&gt; h t t p://localhost:81/test/ [:db_insert_placeholder_7] =&gt; [:db_insert_placeholder_8] =&gt; 127.0.0.1 [:db_insert_placeholder_9] =&gt; 1389935326 ) in dblog_watchdog() (line 154 of C:\xampp\htdocs\test\modules\dblog\dblog.module).


Delete specific line number(s) from a text file using sed?

I want to delete one or more specific line numbers from a file. How would I do this using sed?


Why ~/.bash_profile is not getting sourced when opening a terminal?

Problem  I have an Ubuntu 11.04 Virtual Machine and I wanted to set up my Java development environment. I did as follows   sudo apt-get install openjdk-6-jdk Added the following entries to ~/.bash_profile  export JAVA_HOME=/usr/lib/jvm/java-6-openjdk  export PATH=$PATH:$JAVA_HOME/bin  Save the changes and exit Open up a terminal again and typed the following  echo $JAVA_HOME   (blank) echo $PATH        (displayed, but not the JAVA_HOME value)  Nothing happened, like if the export of JAVA_HOME and it's addition to the PATH were never done.   Solution  I had to go to ~/.bashrc and add the following entry towards the end of file  #Source bash_profile to set JAVA_HOME and add it to the PATH because for some reason is not being picked up . ~/.bash_profile   Questions   Why did I have to do that? I thought bash_profile, bash_login or profile in absence of those two get executed first before bashrc.  Was in this case my terminal a non-login shell? If so, why when doing su after the terminal and putting the password it did not execute profile where I had also set the exports mentioned above?


oracle-xe-11.2.0-1.0.x86_64.rpm file installation error

i tried to install oracle-xe-11.2.0-1.0.x86_64 on ubuntu 20.04  i have gone through a lot of installation steps from many resources , many of them asked to unzip the oracle-xe-11.2.0-1.0.x86_64.rpm.zip file on first step  but when i downloaded from oracle website the file was in .rpm format instead of .rpm.zip   please help me out with this.


Why didn't \printnoidxglossaries print anything with \cite{} in document?

I have both glossaries and bibliography in my report. I used \printnoidxglossaries but it won't show up because of \cite{} in my report.. When I removed \cite{} then \printnoidxglossaries will show up. Why does this happen and do you know how to fix this problem?  Example:  the codes with \cite{veggie}:  \documentclass{report}   \usepackage[utf8] {inputenc} \usepackage[english] {babel} \usepackage{biblatex} \usepackage{glossaries}   \makenoidxglossaries   \newglossaryentry{potato}{name={potato},plural={potatoes},    description={starchy tuber}}   \newglossaryentry{cabbage}{name={cabbage},    description={vegetable with thick green or purple leaves}}   \newglossaryentry{carrot}{name={carrot},    description={orange root}}   \begin{document} \printnoidxglossaries   \chapter{Vegetable} Chop the \gls{cabbage}, \glspl{potato} and \glspl{carrot} \cite{veggie}.    \begin{thebibliography}{100}  \bibitem{veggie} Vegetable. (2014). \emph{FDA}.  \end{thebibliography} \end{document}      The code without \cite{veggie}, you can see the difference:  \documentclass{report}   \usepackage[utf8] {inputenc} \usepackage[english] {babel} \usepackage{biblatex} \usepackage{glossaries}   \makenoidxglossaries   \newglossaryentry{potato}{name={potato},plural={potatoes},     description={starchy tuber}}   \newglossaryentry{cabbage}{name={cabbage},     description={vegetable with thick green or purple leaves}}   \newglossaryentry{carrot}{name={carrot},     description={orange root}}   \begin{document} \printnoidxglossaries   \chapter{Vegetable}  Chop the \gls{cabbage}, \glspl{potato} and \glspl{carrot}.    \begin{thebibliography}{100}  \bibitem{veggie} Vegetable. (2014). \emph{FDA}.  \end{thebibliography} \end{document}       How to fix this problem?? Thank you for your time!


If $\phi:R\rightarrow R'$ is a surjective ring homomorphism and I is an ideal in R.... continued below

then $\phi(I)=[s'\in R'|s=\phi(s)\space \forall\space s\in I]$ is an ideal in R'  So I know that for something to be an ideal, it needs to be closed under subtraction and it must absorb products. I guess I get overwhelmed when there is a lot going on.  I want to say something along the lines of  Let $r,s\in \phi(I)$, then $\phi(r-s)=\phi(r+(-s))=\phi(r)+\phi(-s)=r+(-s)=r-s\in I$ since $I$ is an ideal...  Then let $t\in R'$ and $s\in \phi(I)$, so $t(s)=t(\phi(s))$ .... Not sure if I'm headed down the right path


Stubborn single image insists on getting its own page

Any ideas why this image (lower entry) gets its own picture while the other one (upper entry, not visible) does not?      Tried using scale=0.5 instead and it got inline instead. Probably some funky LaTeX thing going on with that it's on the end of the previous page otherwise.


Sum of series $\sum_{n=1}^{\infty}\frac{1}{n(n+\frac{1}{2})}$

$\displaystyle\sum_{n=1}^{\infty}\frac{1}{n(n+\frac{1}{2})}$ i am trying to solve an integral and this ended up being last part I need, Wolfram alpha gives $4-2\ln{4}$ but I don't know how they actually got that value. can anyone help or give a starting point? telescoping series didn't work


I have input elements in my html page. When user presses the submit button, it being binded to the click even in jquery and the data is being validated and then send to server using AJAX. The problem is, I have a file field. So how to initiate the uploading of the file via the code using AJAX ?  Sample code:  $(function(){   $('#btnSubmit').on('click', function(){     // validate fields, make some processing on the data, etc.     // then send to server using AJAX...      $.ajax({       //....      });      // after submitting the above data or along with it, I want the picture uploaded(without user having to press upload button or anything)   }); });   How it can be done?


Solve $f(x^2+y+f(y))=2y+f(x)^2$ over $\mathbb{R}$

I want to find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all $x,y\in\mathbb{R}$: $$f(x^2+y+f(y))=2y+f(x)^2.$$  Suppose we have given a solution $f$. Then $f$ is surjective (set $x=0$). Moreover, I have shown that $f(-x)^2=f(x)^2$ for all $x\in\mathbb{R}$ as well as $f(x)=0\Rightarrow x=0$. But I could not make any progress.  I tried for example $y:=-f(x)^2/2$. Then we get $x^2-f(x)^2/2+f(-f(x)^2/2))=0$. Can someone tell me how to proceed?  Best wishes


previous Eclipse Neon installation does't start on Ubuntu 18.04

I recently upgraded from Ubuntu 16.04 to 18.04 and, after the upgrade, my previous Eclipse Neon installation doesn't work anymore. If I launch it I see the splash screen, it disappears and then nothing else. On console and in log I don't receive any errors.  I tried adding SWT_GTK3=0 or SWT_GTK3=1 in the environments, removing -Dorg.eclipse.core.net.enableGnome option I had in command line, using default VM (I was using JDK 1.8.0) and in eclipse.ini the settings:  --launcher.GTK_version 2   but nothing works. I'm bound to this Eclipse version because it's the one adopted in my company. Any suggestion?  EDIT  Cleaning workspace as stated in the comment is a temporary solution. It's necessary to specify SWT_GTK3=0 to avoid workspace corruption in subsequent run.


Ease camera acceleration which follows a path

I let a camera follow a round path which also tracks an empty (see reference). There is no problem in animating this, however I want the camera to start moving slowly and generate more speed and also to come to a halt slowly (ease in & out). But when I take a look in the graph editor there is no curve to edit.      Edit:  Also if I choose the curve there is no graph to adjust.


What are the high level differences b/w Nikkor 50mm f/1.8G and f/1.4G, and G/D

I am a beginner in DSLR, and would like to purchase another lens other than my kit lenses came with my D3400. After so much googling, and reading blogs, I have decided to purchase one 50mm lens. I have found 2 options, either  or . 1.4 is expensive than 1.8. I did a googling for 1.4 vs 1.8. All of the blogs were technical (coz I don't understand that "tech language") and I am looking for some "simple to understand" definitions, like the image look sharp, background will look blurrier, perfect for night photography etc. I would like to know the difference b/w D and G also.  Thank you.


I'm making input that user could only type number or float number. If I type text it clears out whole input.I want forbid type text without clearing field . Any ideas how to make it?  <input    type="text"    id="willBeCreditedAmount"    maxLength={9}    placeholder="Enter amount"    pattern="[0-9]*"    onChange={(e) => this.props.updateWillBeCreditedAmount(e.target.value, currentComProfile)    }    value={willBeCreditedAmount} />


Find limit of recursive sequence $a_{n+1} =\sqrt{2+ \sqrt{a_n} }.$

Let $a_n$ be the sequence in $\mathbb{R}$ given by:  $$ a_1 = \sqrt{2}, \; \; a_{n+1} =\sqrt{2+ \sqrt{a_n} }. $$  Show that this sequence converges and find the limit.  I have already proven that this sequence is increasing and bounded by $2$, so the limit exists. Now, when I'm trying to find the limit, say  $L$, I get that $L$ satisfies the equation: $$L^2 -2 - \sqrt{L}=0, $$ but I don't actually know how to solve this equation, so I would like to know if there is an  easier way to find the limit, and in case I must solve the last equation, how can I solve it?  Thanks in advance!


Hello I want to move from my compact camera to a dslr. I am fan of landscape photos so I want to buy an ultra-zoom lens. My camera supports 14x optical zoom. I know that for compact cameras it's just a notation, so searching further from the official website:   focal-length = 5.0 – 70.0 mm (35 mm equivalent: 28 – 392 mm)   I cannot understand what 35mm equivalent means. I want to buy lens that has 55-200 focal length. So will the new lens have better zoom or not?  I don't provide any model because I believe it's better for the question not be a comparison between certain products.


Determining the particular processor on which a process is running

I have access to an 8-core node of a Linux cluster.  When logged in to the node, I can see a list of processors using this command:  more /proc/cpuinfo   In my 8-core node, the processors are numbered from 0 to 7.  Each processor is an Intel Xeon CPU (E5430 @ 2.66GHz).  Now suppose I call the program foo with some arguments args:  foo args   The program foo takes a long time to execute (hours or days, for example).  Having called foo, is it possible to determine the particular processor (i.e., 0 to 7) on which foo is running?  The top program shows me the process ID and similar information, but I don't see the processor number.  Is such information available?


is there a way to prevent data in a flash drive from being copied

I want to give a USB flash drive to a friend but I don't want him to copy the data in USB or add anything to it is it possible so he could only read the files without the ability to do anything else?


My friend applied for a UK visa last month (that is, June 2015) for 3 weeks in the UK, but got 6 months. Since she got more days, she decided to extend her stay, because she has a six-month visa with 180 days to stay. She left from Kenya on Thursday evening, but they refused her entry and canceled her visa because she decided to extend her stay from 3 weeks to 5 months.  She did this because the visa is valid for 6 months. We can't understand whether this is right. Nowhere on the visa is there anything to indicate that she can only stay for a certain period of time. It indicates 180 days duration of stay. Can she appeal?


How to close a menu bar when clicking outside of it

I'm trying to find multiple ways to close a sidebar menu that pops out from the left side. The idea of this is to have a page with an "Open/Close Menu" button. As expected this button should be able to open and close the menu with clicked, but I also want to include an option of closing it when simply clicking outside the menu bar. My thought process behind this is to add a div that surrounds all of the content on the page, and gives it a class name of "notMenu". I would define the dimensions of this to be the entire page and give it a z-index of 1. When the menu pops up, it would be on top of .notMenu with a z-index of 2, yet I can't seem to get it to work.   var menuBtn = document.querySelector('.menuBtn'); var sidebar = document.querySelector('.sidebar'); var closeMenuBtn = document.querySelector('.closeMenuBtn'); var notMenu = document.querySelector('.notMenu');   var nav = 'closed'  menuBtn.addEventListener('click', function() {   if (nav === 'closed') {     sidebar.style.display = 'block'     nav = 'open'   } else {     sidebar.style.display = 'none'     nav = 'closed'   } });  // closeMenuBtn.addEventListener('click',function(){ //   sidebar.style.display = 'none' // });   closeMenuBtn.addEventListener('click', function() {   sidebar.style.display = 'none';   nav = 'closed'; });  /* notMenu.addEventListener('click',function(){     sidebar.style.display = 'none'     nav = 'closed'; }) */ h1 {   text-align: center; }  .menuBtn {   position: relative;   left: 50%;   transform: translateX(-50%); }  .closeMenu {   font-size: 30px;   z-index: 2; }  .sidebar {   position: absolute;   top: 0;   height: 100vh;   width: 300px;   background: grey;   display: none;   z-index: 2; }  .notMenu {   position: absolute;   top: 0;   height: 100%;   width: 100%;   z-index: 1; }

 Header

Link1

Link2

Link3

       <button class="closeMenuBtn">Close Menu</button>
      <button class="menuBtn">Open/Close Menu</button>

 Lorem ipsum dolor sit amet consectetur, adipisicing elit. Aspernatur quia ipsam optio, veritatis corrupti exercitationem quae itaque accusamus voluptas ipsa consequuntur nostrum, culpa, cum dolore incidunt ducimus harum minus doloremque?

 Lorem ipsum dolor sit amet consectetur adipisicing elit. Eum quia laboriosam ut accusantium itaque adipisci vitae error provident voluptate, dolorem veniam dignissimos atque accusamus aut rem quos esse fugit voluptas soluta laudantium.       Nam voluptates maxime sapiente, pariatur voluptatibus mollitia quia.

         Alternatively, is there a way to do this without designated a new class as .notMenu? I assume there is a possibility to do this with e.target in JS with if statements. function(e){   if (e.target !== 'sidebar'){     sidebar.style.display = 'none'   } }   The issue I ran into with this is that e.target returns an object. I'm unable to define which objects represent the sidebar and which ones do not, therefore I can't determine if the area outside the sidebar is being clicked.


Can you recommend a Java library for reading (and possibly writing) CSV files?

Can you recommend a Java library for reading, parsing, validating and mapping rows in a comma separated value (CSV) file to Java value objects (JavaBeans)?


I am reading some tutorials about Linux configurations:    To accomplish many of the configurations is important and mandatory be the root.    Well I did realize that in many places are used sudo su and sudo -i, even when both accomplish the the same goal, I have the doubt about:    when is mandatory use one approach over the other?    I am doing this question because for some reason exists these two approaches


What is the female synonym for the word "buddy"

Two men may use the word "buddy", but can a man call a woman "buddy"? If not, what is the equivalent for women?


Let $G=\{n \in \Bbb N \mid n\leq 55 , \; \gcd(n,55)=1\}$ be the group under multiplication modulo $55$. Find $x$ is $x^2=26$ and $x>30$

Let $G=\{n \in \Bbb N \mid n\leq 55 , \; \gcd(n,55)=1\}$ be the group under   multiplication modulo $55$. Let $x\in G$ such that $x^2=26$ and   $x>30$. What is the value of $x$?   I tried brute force and fortunately, it seems that $31$ satisfies $31^2 =26\mod 55$. But I don't know how can we solve for $x$ without hit and trial.


I need to perform clustering in a given dataset. There are atrributes with numerical as well as categorical values.  What is the best way to convert categorical to numeric value ?  as an example one field is colour and the values are red, green, blue so can I assign a  mapping like:  red : 1, green : 2, blue : 3 or red : 11, green : 25, blue : 30   and if I provide a mapping like this will this affect the Euclidian distance for clustering ?  or is there any other way ?


I wish to get the file extension of an image I am uploading, but I just get an array back.   $userfile_name = $_FILES['image']['name']; $userfile_extn = explode(".", strtolower($_FILES['image']['name']));   Is there a way to just get the extension itself?


Does $X_n \overset{L^2}{\rightarrow} X$ imply $X_n^2 \overset{L^1}{\rightarrow} X^2$?

Suppose $X_n,X$ are random variables with $X_n \overset{L^2}{\rightarrow} X$. Does this imply $X_n^2 \overset{L^1}{\rightarrow} X^2$?  $X_n \overset{L^2}{\rightarrow} X$ means $E(|X_n-X|^2) \rightarrow 0$ and what we have to show is that $E(|X_n^2 - X^2|) \rightarrow 0$.


What is the ` character or symbol called and what is its significance outside of SE code formatting?

What is the ` character's name and what is its significance outside of SE code formatting because I cannot get it to work? I'm familiar with its use in the Stack Exchange forums used to format code blocks, so please outside of that.


I would like to know what is the best way to implement collision avoidance and eventually pathfinding in a LibGDX 2D top view game. Think of "Binding of Isaac".  I use a sort of tilemap to place the obstacles (squares), taken from an ASCII map, but I'd prefer to keep the movements free from it. (Enemies shouldn't move from tile to tile but freely)  Since the target is mobile I can't use heavy algorithms.  I'm not particularly concearned about enemies getting stuck on weird shapes (such as 'U') since it kind of makes sense (they are white globules, not particularly smart :P) but I still want them to be a challenge.  I've taken into consideration Steering Behaviors and the LibGDX-AI framework but I can't find good documentation, I can aswell code it by myself in case.  ANOTHER QUESTION Just to know, which kind of algorithm is used in the Binding of Isaac? It perfectly suits my needs


there are some users in my project, that are using auto refresher or similar extension and each of them are making like 40 requests per second. It is not good for my server. Is it possible from apache side, to temporary block those users? Just temporary? For example for 5 mins?


Is getting into grad school hard for applied mathematics?

I am looking at program for grad school in applied mathematics. If I currently A 3.56 GPA, will it be a challenge to get into grad school?


How to use a longtable with only one entry in the list of tables

I'm using longtable to spread my table over three pages. Unfortunately the caption is also added three times to the list of tables. Is is possible to have it displayed only once?


Run app on X11 on server without forwarding

The problem I am using an application that is computationally intensive and requires X11 to run. I want to run it on a remote server (that is obviously running X11). I don't need to forward X11, I just need it to run on the server. More details If I run the application from the server (i.e. I use the keyboard that is physically connected to the machine), then everything works fine. My problem is that I want to start this application remotely (from an SSH connection) because I cannot always access the server physically. I am not completely sure how it works, but when I run the following command from the machine (i.e. using its keyboard): $ xhost +  then I can run my app ($ DISPLAY=:0 ./run-my-app) without problem from SSH. Now, I cannot run xhost + from SSH, and anyway it sounds like a bad idea in terms of security. If I don't run xhost +, I get the following output:  No protocol specified xauth: (argv):1:  unable to open display ":0".  In conclusion, it looks like there is some security feature (access control) that prevents me from running the app on X11 remotely. But the point is that I don't want to have more than what happens when I start the app from the server (with the keyboard connected to the physical machine); I just want to start/stop it remotely, without any forwarding. Is there a way to do that? Similar questions It looks similar to  and , but in these situations they can use a virtual server like Xvfb, which does not work in my case. Moreover, I do have an X server running on the server, and I do need it.


1052 Column 'product_id' in order clause is ambiguous,

I am trying to run query in Magento 2 Db and getting the error:  Column 'product_id' in order clause is ambiguous,  The query is: SELECT `main_table`.* FROM `wishlist_item` AS `main_table`  INNER JOIN `cataloginventory_stock_status` AS `stockItem`    ON stockItem.product_id =  main_table.product_id AND stockItem.stock_status = 1  INNER JOIN `catalog_category_product_index_store1` AS `cat_index`    ON cat_index.product_id = main_table.product_id AND cat_index.category_id = '2'   AND cat_index.visibility IN (3, 2, 4)  WHERE (`wishlist_id` = '1') AND (`main_table`.`store_id` IN('1'))  ORDER BY find_in_set(product_id,'1,2,3'), name ASC  LIMIT 12  How to fix this?


How to count the number of rows and cols in matrix?

How can I count the number of rows and cols in c language after dynamic allocation?  void printMatrix(int **arr) {     int i,j;      int col = (sizeof(arr)/sizeof(arr[0]));     int row = (sizeof(arr)/sizeof(arr[0][0]));     for(i=0;i<row;i++)     {         for(j=0;j<col;j++)         {             printf("%d\t",arr[i][j]);         }         printf("\n");     } }   In my example I get only the matrix start pointer by **arr.  It try to run this code but it return row = 1 and col = 1 when the row = 3 and col = 2.


How do I show www. and https:// in Chrome 79?

I just updated Chrome to version 79, and I noticed that prefixes like https:// and www. have disappeared again. Before, I fixed this by setting the omnibox-ui-hide-steady-state-url-scheme-and-subdomains flag in chrome://flags to Disabled. However, that flag isn't there anymore, and I don't see what it was replaced with. What's the new way to fix this?  Update: I tried setting temporary-unexpire-flags-m76 to Enabled. While this brought back the above flag, it no longer works. As soon as I set it and relaunch, it gets set right back to Default.


How to draw Brownian motions in tikz/pgf

Here I want to draw some Brownian motions in tikz, like this:  Furthermore, I want to truncate the trajectory of Brownian motion, like this:   I have tried many times with random functions in tikz, but always fail.  BTW, the figures uploaded are screenshots from "Brownian Motion - Draft version of May 25, 2008" written by Peter Mörters and Yuval Peres.


Recently I am stubborn enough to simply delete stuff that was in my mac. When I open up terminal, this pops up: (a screenshot of terminal with the code: Login incorrect login:)    I am not sure if I have accidentally deleted one of the supporting files for Terminal in my mac (this is just a guess)?  I've tried changing the shells. Typing in my username or even the correct password but it won't work at ALL. If there is no solution is a way to delete and reinstall Terminal?  Someone suggested I reinstall the OS. If that is the easiest solution, how do I do it? (sorry I am an IT noob)


Is the total impact of an user's combined accounts visible somewhere or can it be queried in the Stack Exchange Data Explorer?

Is the total impact of an user's combined SE accounts visible somewhere or can it be queried in the Stack Exchange Data Explorer?


Which of these sentences is correct? 1)Internet technology has significantly contributed to furthering education in the world. 2)Internet technology has significantly contributed in furthering education in the world. If only one is correct, does this mean that the other one is grammatically wrong or it can be used in a certain context?


Why is the second law of thermodynamics indisputable?

Why is the  undisputable?  On his  Professor Hawking says the following:     The cosmologist, Sir Arthur Eddington, once said, 'Don't worry if your   theory doesn't agree with the observations, because they are probably   wrong.' But if your theory disagrees with the Second Law of   Thermodynamics, it is in bad trouble.   Why is that? Why does the second law of thermodynamics seem to prescribe how theories are done? Why does it seem to have this power?


How do I install "Ubuntu One" on Ubuntu 16.04? Although it seems trivial but I couldn't find nowhere instructions? I want to backup my files on cloud using Ubuntu One service. Also when I open Deja-dup for backup I cannot see "Save to Ubuntu One" option on storage location in settings?


I have imported OpenStreetMap data for the country Switzerland via osmosis in my MySQL database.  Now I want to look for a specific address in that database, but I can't find a way to get the whole address (street, postcode, town ..).  For  example, the address I'm talking about is: Street: Archstrasse, town: Grenchen, postcode: 2540, county: Amtei Solothurn-Lebern, country: Schweiz.   <!-- language: lang-sql --> select * from current_way_tags where way_id = 162530695;> &nbsp;  +-----------+----------+-------------+&nbsp;  | way_id    | k        | v           |&nbsp;   +-----------+----------+-------------+&nbsp;  | 162530695 | cycleway | lane        |&nbsp;   | 162530695 | highway  | primary     |&nbsp;  | 162530695 | name     | Archstrasse |&nbsp;  | 162530695 | ref      | 5           |&nbsp;  +-----------+----------+-------------+&nbsp;


What’s the maximum number of people that have been in the TARDIS at once?

What is the maximum number of people that have been inside the TARDIS at once? Is it in the David Tennant series 4 episodes "The Stolen Earth" and "Journey's End", when all "The Children of Time" have gathered?


The value of PI in Decimal units to 20 places is 3.14159 26535 89793 23846...  and the occurrence of digits 0 through 9 in the decimal part of the sequence is:  0 (none)  1,1 2,2 3,3,3 4,4 5,5,5 6,6 7 8,8 9,9,9   As we can see 0 doesn't appear at all, followed by 7 (One occurrence), then 1,2,4,6,8 (Two occurrences each) and then 3,5,9 (Three occurrences each).  Does this distribution smoothen out at some point? Say will PI() to xx million places produce an equal occurrences of all digits (as would happen if these were random digits)? Or is there something inherently non random in PI() which creates a weighted average in favor of certain digits?  The question is also w.r.t PI() in Binary units. At the end of xx million places of PI(), is the total number of 0's and 1's at 50% each?  Just curious.  ps: This is not merely theoretical question, but asked from practical perspective -- i.e. since PI() is calculated to Billion+ p[laces, I was wondering is someone has actually carried out such an exercise; and if so, what is the result?  To further clarify, if PI () was being spit out by a PI producing machine and we do not know the value of PI(), and every day the world waits for the NEXT PI() digit, then I am sure that no one can predict the next PI value, and so it is random. But in a different world, the PI producing machine always knows the answer and so produces the next digit in the series consistently. In other words, the PI producer always knows what the next digit is going to be and is not spitting out the numbers randomly. My question is that over millions of places, can we spot a pattern of digit distribution that would tell on the inherent nature of PI? Or have we found that after a billion places, we end up getting 10 piles of equal weights suggesting that the PI producer is after all random?


If my pie is hot, and Lola's pie is hot.  Can I say      "Lola and my's pies are hot"?    Or should it be      "Lola's and my pies are hot"?   These posts,  and  deal with possessive pronouns and the Saxon genitive, but do not address specifically the case illustrated here.


My cousin in grade 10, was told by his teacher that remainders are never negative. In a specific example,  $$-48\bmod{5} = 2$$  I kinda agree.  But my grandpa insists that  $$-48 \bmod{5} = -3$$  Which is true? Why?


Is there any short enhanced form of for loop which we can use for primitives. I have do the legacy code for looping on to primitives, like this  for(int i=0; i<10; i++){ }   Although for objects, we have ehanced for loop like  for(MyObject m : myObjectList){ }   Is there any similar option for primitives also?


Fact: "Abraham Lincoln was the sixteenth president of USA"  I know that Abraham Lincoln was a president of USA but I don't know the number/order. How do I pose this as a Question in English?


Unbiasedness and Consistency of the following Estimator

Let   $T(x)=\frac{\sum_{i=1}^{n}X_{i}+\frac{\sqrt{n}}{2}} {n+\sqrt{n}}$  Where, $X_{i}$'s are from $B(1,\theta)$ or Bernaulli. Then, comment on the Unbiasedness and Consistency of the given estimator.   My approach  I think the given estimator is biased and Consistent. The Estimator is biased which directly follows from structure of estimator. As far as consistency is concerned, the estimator can be written in the following form:  $T(x)=\frac{\overline{X}}{1+\frac{1}{\sqrt{n}}}+\frac{\sqrt{n}}{2(n+\sqrt{n})}=a_n\overline{X}+b_n$  $\overline{X}$ is consistent for $\theta$ and $a_n \rightarrow 1$ and $b_n \rightarrow 0$. Hence, the given estimator is consistent.   But my manual, gives the answer that given estimator is biased and inconsistent. How can this be possible? I hope I used the theorem correctly. Thanks


Bridged connection for virtual machine is blocked by windows

I am trying to created virtual machine which in bridged mode. I already asked  but it only assure me that problem is with my host machine. I also tired to install VmWare instead of VirtualBox and problem is exactly same.  So my question is: how can I diagnose what is blocking bridged mode on my Windows 7?  I already:   Disable Windows Firewall I do not have any antyvirus software running


How many one-to-one functions there $\phi$ from $\{1,2,3,4,5,\}$ to $\{1,2,3,4,5\}$ such that $\phi(i)\neq i$ for $i=1,2,3,4,5$

How many functions one-to-one  $\phi$  from $\{1,2,3,4,5,\}$ to $\{1,2,3,4,5\}$ such that $\phi(i)\neq i$ for $i=1,2,3,4,5$  my attempt:   the number of one-to-one functions  $\phi$  from $\{1,2,3,4,5,\}$ to $\{1,2,3,4,5\}$ is 5!=120  and given condition is  $\phi(i)\neq i$ for $i=1,2,3,4,5$ so these are 5  so number of one-to-one functions are   $\phi$  from $\{1,2,3,4,5,\}$ to $\{1,2,3,4,5\}$ such that $\phi(i)\neq i$ for $i=1,2,3,4,5$  =120-5=55  is i am right


I want to find occurrences of anything within [[...]] and replace with another string. For example, [[name]] lives in Florida. [[name]] = James I almost have it working, except for one small issue. Regex.Replace([[name]], @" ?\[[.*?\]]", "James")  The output is: James] lives in Florida. The last ] is not being replaced.


Describe all positive integers,n such that $3^{n+1}$divides $2^{3^n}+1$. I am little confused about what the question asks-if it asks me to find all such positive integers, or if it asks me to prove that for every positive integer n,$3^{n+1}$ divides $2^{3^n}+1$. Kindly clarify this doubt and if it's the former part, please verify my solution-n=1.


Are there any other sets that are both open and closed other than $\emptyset$ and $\Bbb R$?

Is there any set $X \subseteq \Bbb R$  so that X is both open and closed, $X \neq \emptyset$, and $X \neq \Bbb R$?  I know $\emptyset$ and $\Bbb R$ are two sets that are both open and closed, but are there any more sets that fit this category?


Update Manager does not ask for password anymore

I have realized this behaviour recently. Before that each time the update manager poped up to tell me there are updates and I tell it to install them it will ask me for a password. But since recently it does not do that anymore. When I click install it just downloads them and installs them.  Is this a bug or intended behaviour? I use Oneiric with latest updates if that helps


I've been playing a board game called risk lately, and I'm very interested in the probability behind it. Sorry if this question is it the wrong category, but I assumed that it was largely statistical. Consider the following:  Suppose two people are playing a dice game involving troop exchanges called Risk. Each player (either attacker or defender) begins with a certain number of "troops" and rolls three dice. Depending on how many of one player's dice beats those of another (based on a special scoring system), each player can lose a fraction of their troops. A defending player has a 62% chance for a net win, while an attacking player has only a 37% chance. Specifically, a defending player has a 37.5% chance to take three of the attacking player's troops, while an attacking player has a 15.6% chance to do the opposite. There is a 25.5% chance that the attacking player will lose 2 troops while the defending one loses 1, and there is a 21.4% chance that the attacking player loses 1 troop while the defending player loses 2.  I've gotten this far, through a very long program, but I can't figure this out: How many troops should the attacking player have in comparison to the defending player to make it fair, or so that there should be 0 players left on both sides in theory?  Thanks!


Is $f(x) = x^{-1/2}$ Riemann integrable on [0,1]?

I'm having a little bit of confusion with the following. The integral is given as:  $$\int_0^1 x^{-1/2} dx = [2x^{1/2}]_0^1 = 2$$  But from what I understand, a Riemann integrable function must be bounded. How does one reconcile this with the fact that   $$x^{-1/2} \to \infty \text{ as }x \to 0$$   I suppose a natural follow up question would be: If the integral of a function is finite, is it Riemann integrable?


Reading order of "A Song of Ice and Fire"

I've become hooked on HBO's A Game of Thrones, so I was going to read the books. However, I'm a little confused as to which order to read them since there are novellas based on chapters of the novels.  This is what I've found online:   Blood of the Dragon (July 1996), taken from the Daenerys chapters in A Game of Thrones. Path of the Dragon (December 2000), taken from the Daenerys chapters in A Storm of Swords. Arms of the Kraken (March 2003), based on the Iron Islands chapters from A Feast for Crows.   Should I read the novel first, then the novella for that book, then back to the original series?


C- main segmentation fault, string problem - how to solve

my main function needs to collect array size from user and fill it with strings, to then send out to functions - my main appears to crash after recieving a single string - I believe the error is due to temporary_string - when it does work I get no indication the arrays actually enter the function and the output is the same as the input - I don't know why. int main() {     int n = 0, rule = 0;     char* temporary_string="";     printNumStringsInputMessage();     scanf("%d", &n);     printStringsInputMessage(n);     char** arr_of_strings= malloc(n * sizeof(char*));     for (int l = 0; l < n; l++)     {         scanf("%s", temporary_string);         arr_of_strings[l] = malloc((strlen(temporary_string) * sizeof(char)));         strcpy(arr_of_strings[l], temporary_string);         strcpy(temporary_string,"");     }     printRuleOfComparisonInputMessage();     scanf("%d", &rule);     return (0); }


Convert String in Array form to String Array

Let's say I've got a string with three strings looking like this:  String s = "[object1,object2,object3]";   How do I convert this to a String array which looks like this:  String[] ary = {"object1", "object2", "object3"};   Also mind that each string item (object1, object2 and object3) may also contain additional comma (,) characters.


i'm working on a legacy project & i found something like that :  test:{         if(1 == 1) {             System.out.println("Oups");             break test;         }         System.out.println("Hello World");     }   I google it, but nothing seems to match with this kind of structure.  Of course, this part of code compile & run ... ????  Do someone know what that do ?


So I posted a similar question previously () which was just about general gameplay; the outcome of which was that is just how the die rolls, which is fair enough.  However, now that we have reached our "final quest", phrases like "some of you may die" and "I am going to kill some of you" have started floating around.  Now, this dungeon was designed for five level 5 characters. Our group consists of four level 5 characters, and one level 4 character, so the dungeon is already over-leveled. Additionally, we played one session with one player missing, and we took a hefty blow in that session, due to his absence. (Not blaming the DM for that one, that's on us).  Additionally, the DM has stated that resting is out of the equation. If we rested for even 20 minutes, the bad guy would send more minions our way, or even take a rest himself.  So - our current situation:   One character is unconscious, and has spent all of his abilities, plus has a "permanent injury" waiting for him when/if he regains consciousness (Fighter - Battle Master) Two characters are at half-health, with 3/4 of their abilities spent (Rogue - Assassin and Fighter - Eldritch Knight) One character is at minimal health, with most of their abilities remaining (Barbarian) One character is mostly fine (the perks of missing a session) (Barbarian)   We're halfway through the Dungeon, resting is out of the question, and the Boss is holding the surrounding area under siege with a doomsday death laser.  Apart from an all out retreat (where we would still have to take our chances trying to avoid the death laser), there seems to be little chance of survival, but none of us really want to die, especially when we're only at level 5!  What could we do to attempt to prevent this from happening?


How can I put pagenumber into longtable header?

I try to fill a multipage table using longtable environment. I need to put some data before table parts on every page. To do this I write  \multicolumn{9}{l}{\tabheader}\\ \hline % here i write header description\cr\hline 1&2&3&4&5&6&7&8&9\cr\hline \endfirsthead \multicolumn{9}{l}{\tabheader}\\ \hline 1&2&3&4&5&6&7&8&9\cr\hline \endhead   The macro \tabheader puts some data about table and it also should contain current page number.   As I understand, head in longtable creates only once and later just copies (like \copy0). How can I do such changed header? I can't put it into page headers because the beginning of table have some text before table header.


After I enable an addon to add objects (for instance a gear from Extra Objects addon) the interface shows up in the toolbar menu. Is there any way to get the interface back after it has disappeared?  Edit: Thanks. That was not the answer I was looking for but I suppose that I will have to live with it.  Stephen


How do you automatically set the focus to a textbox when a web page loads?  Is there an HTML tag to do it or does it have to be done via Javascript?


Read only field not working in page layout

I have custom object called candidate. I have created field name called first name which is read-only in the page layout. Once a record is created with first name field populated I am able to edit that field. Why I am able to edit (I mean getting pencil icon). Can anyone suggest me for this issue?


Chain link jams after reassembling the rivet

I bought a chain riveting tool. Here is how it looks like:    It works fine, I was able to push the rivet out of a test chain. But faced an unexpected difficulty: after I restore the rivet to it's proper position the chain link becomes very hard to move.  I think, the cause of this  is that my tool is not as precise as those, used in the factory, when manufacturing the chain. And when I restore the rivet, I shift it a little bit from it's ideal position. It creates extra friction, not allowing the plates to move freely as they should.    Is it normal? Am I doing something wrong? Maybe, there are better tools?


Motivation for statistical distributions

As statisticians, we come across many distributions under the banners "discrete" or "continuous", and "univariate" or "multivariate". But can anyone provide a good reason behind the existence and motivation for so many distributions? How do we get them? And what can a layman understand from it?  What is the logic behind the existence of distributions?


What is the best practise to autostart unprivileged lxc containers on Ubuntu 14.04 64bit?

The current implementation of the LXC technology . Users of the unprivileged containers (which arguably promise better security) don't get any working out-of-the-box solution for autostarting their containers.    I know of two ways of achieving this goal. I need to decide which one to take (or maybe there is another?)  Both methods require that the lxc.start.auto 1 be set in .  Transforming an existing privileged container  In short .   Invoking unprivileged container via a custom upstart job  The lxc-autostart command invoked by the owner of the unprivileged containers (without the sudo) starts all the unprivileged auto-start containers. The problem is only with how to run it during system startup.  This is tough, because any form of sudo -u <lxc-user> -- lxc-autostart nor su -l <lxc-user> -c lxc-autostart wouldn't work - I guess they don't handle ranges of subuid well. The only way to get root autostarting user's containers is through ridiculously complex ssh <lxc-user>@localhost lxc-autostart.  I haven't tried the setgid and setuid stanzas yet (something tells me, it wouldn't work either).  EDIT: My intuition was right. Setting the setgid and setuid in upstart script doesn't help either.


Can I cast a no-concentration spell while concentrating on another?

Is it possible, while concentrating on one spell, to cast a different spell or cantrip that do not require concentration without losing that concentration?


Why should i add the butter after i knead the main ingredients when making a bread? i saying this because from this recipe  and many others that i have seen, they have added the butter after kneading (or mixing though), i just realized this in few bread recipes like that one, so which its the purpose of mixing it like that, this kinda reminds me of when you make puff pastry dough.


Formal proof for an easy calculus result

I have the following situation: Suppose $x,y$ are real numbers with $y > 0$. Then, I would like to show that for small values of $t$, we have   $$ (tx)^2 + (ty - 1)^2 \leq 1 $$  How can I show this in a formal manner?? For instance, I find myself struggling because I don't know that is the definition of small values of $t$.   Can someone help me? thanks


How to refer to an entity composed of multiple persons (it or they)?

Suppose you have a team composed of several persons. If I want to designate this team without repeating "team", which word do I have to use ? "it" or "they" ? In other words, which one of the following sentences is correct ?  The team decides whether it wants to work on this project or not. The team decides whether they want to work on this project or not.  Maybe both are correct.  In the first one, "it" stands for one single entity but associates the human sensation "I want to work on this project" whereas a team is not a human. In the second one, "they" implicitly stands for the members of the team but I am not sure of the correctness of "The team ... they ...".  I would very appreciate to have some feedback on those 2 formulations.


I need to replace a power supply on a machine. My current power supply has an input of 120v~60Hz 12VA, can i replace it for one with an input of 120V~60Hz 25W?


I accidentally caused one of my encrypted drives to start converting into a decrypted drive. How can I stop it?

One of my external hard drives used for Time Machine backups has an encrypted HFS+ volume. While in the process of trying to re-associate the backup with my system, I accidentally told it to start decrypting the drive.  I don't want it to be decrypted! However I can't find any way of telling my system to stop! After searching around, I've found that you can use diskutil to stop a drive that's in the process of being converted to encrypted, but found no mention of any way to do halt a decryption conversion.  Help! What can I do? It's going to take forever to decrypt this massive drive, and I don't want it to even do that!  edit: This question is different from  in that I am not using FileVault to encrypt this drive. It is an external drive with no macOS system on it used for Time Machine backups -- FileVault isn't involved.


How to make code which uses Lightning promises look more synchronous

When I read about , I see that they should appear as solution to prevent  and  but when I actually try to write a code which would use Lightning promises it still doesn't look like synchronous code, it still resembles both pyramid of doom and callback hell.  main: function(component, helper) {     helper.promise1(component, helper).then(         $A.getCallback(function(record) {             return helper.promise2(component, helper, record).then(                 $A.getCallback(function(){                     console.log("Success");                     helper.showToastMessage(component, "Great Success!!!!")                 }),                  $A.getCallback(function(errorMessage){                     console.log("Rejected by second promise2");                     helper.showToastMessage(component, "Failure " + errorMessage);                 })              )         }),          $A.getCallback(function(errors){             console.log("Rejected by first promise1");             let message = errors && Array.isArray(errors) && errors.length > 0 ? errors[0].message :'Unknown error';             helper.showToastMessage(component, "Failure " + message);         })      ) }   Is that possible to refactor this code to look more like synchronous code and without callback hell or pyramid of doom?


How can I find the maximal interval of existance for following equation?

How can I find the maximal interval of existence for the solution of $\dfrac{dx}{dt}=4x^2$ , $x(0)=5$ including $t=0$ .


I don't think I fundamentally understand what an enum is, and when to use it.  typedef enum {     kPersonTypeFaculty,     kPersonTypeStaff,     kPersonTypeSearch }    so please give idea about why using enum and how to used enum


create 2 functions that read and display data

I'm trying to create a function read() and display(). They should read 3 values and print those 3 values using another function which is the display(). I tried doing this: #include<iostream> int read(void); void display(int n1, int n2, int n3); using namespace std; int main() {     int n1, n2, n3;     n1, n2, n3 = read();     print(n1,n2,n3);     reverse(n1,n2,n3);          return 0;     }  int read(void) {     int n1, n2, n3;          cout << "Enter three numbers: ";     cin >> n1;     cin >> n2;     cin >> n3;     return n1, n2, n3; }  void display(int n1, int n2, int n3) {     cout << n1 << " " << n2 << " " << n3 << endl;     return; }  It only stored the n3 value. Is there another way I can go about this?


what happens to rank of matrices when singular matrix multiply by non-singular matrix??

I need to find the prove for any rectangular matrix $A$ and any non-singular matrices $P$, $Q$ of appropriate sizes,  rank($PAQ$)= rank($A$)  I know that when singular matrix multiply by non-singular the result will be singular matrix. However, It is not relevant to the rank of the matrix. If A is singular with rank 2, why rank($PAQ$)= 2 not any numbers.


Why does my buffer take up the entire screen?

I am using QGIS. I am aware there is a similar question here but the solution (changing the layer CRS) is not working for me. I cannot change my CRS as I am using information for the entire Asia-Pacific region. Is there another option to create a 1000 km buffer zone from all volcanoes in the region? It is currently projected as geographic coordinates, the default WGS:84.


Communication between HTTPD and Glassfish server

Currently, Glassfish Server sits behind a Apache HTTPD server. Glassfish server provides business applications along with static content.   The idea is to allow Apache HTTPD server to provide static content instead of Glassfish providing them as in the current design. Static content are files in the order of a few MB's . The primary reason this isnt the original design is because files should be allowed to be downloaded only if the STATE of the Glassfish deployed application is ENABLED (Service Unlock - SOA architecture).   I have a few  ideas to implement this. At the moment I need affirmation if this is doable.  Assume the static content is provided by Apache HTTPD, below are the ideas to implement  1) If there is communication possible between HTTPD and Glassfish (mod_jk?). If yes, can I pass custom messages from glassfish to HTTPD indicating the state of application to allow/disallow the clients access to static content. I dont want to depend on HTTP responses (404) as that ties up my glassfish resourse (thread-pool) as the number of clients requesting the download can be in the range of thousands. The idea is that Glassfish indicates a YES/NO from time to time (whenever change occurs) to HTTPD server. Depending on that state, apache writes down that state somewhere. When ever a client requests for the static content, HTTPD refers to the written state and takes decision if it can allow the clients access to the static files.   2) The next option is a simple ProxyPass mechanism from HTTPD and depending on the HTTP responses from the Glassfish, decision is taken if client can have access to static files. As stated earlier, this ties up my Glassfish resourses and isn't desirable.  3) I use JMS middleware to pass messages between glassfish and clients (different client). Can Apache listen to JMS queue. If yes, I can then pass Yes/No messages between Glassfish and HTTPD to Allow/Deny client requestd for static files.  4) Configure Glassfish server to provide static content by tuning the thread pool (as per current implementation). Least desirable.


What is the plural of "virus"? I have seen the word "viri" floating around in various sources throughout my life, but most people say "viruses". The spelling checkers I have tried do not recognize "viri", but I have learned that is not a very good method of verifying a word.


Good afternoon all.  Please bear with me if I don't make this easy to understand. Here is my code and a link to an image that I will use to try and explain my issue. The code is as follows: THe HTML
     `</a>`
The Compendium

Of Greek Mythology

   The CSS  header {     position: relative;     background-image: url(../images/1024px-Raffaello,_concilio_degli_dei_02.jpg)  } header div{     background-color: rgba(255,255,255,0.80) }    header img {     height: 100px;     float: left;     margin-left: 2em;     margin-bottom: 1em;     margin-top: 1em  }  header h2 {     position: relative;     padding-top: 1em;     padding-left: 7.5em;     font-size: 170% }  header h3 {     font-size: 120%;     padding-left: 7.5em;  }   And the image    Basically what I want to do is to have a background image for my header, which you will see in the image. On top of that background image, I want a white transparent background so that the black text can be seen properly. I have the idea of it all, except for one, the column logo. Because I float it, the white transparent background does not extend to the nav bar, as you can see in the image link.  If anyone can think of an alternative way to position the logo so that the text can still be in the same place or at least near to it, I would appreciate it.


How to print taxonomy terms field in node templates?

How can I display node taxonomy terms field in node templates of Drupal 8?  We do this in Drupal 7 by add this code to node.tpl.php file:  print render($content['field_tags']);   I tried adding the below code in Drupal 8:  {{ content.field_tags }}   but with this code have problems:   If I add some styles or make some changes to field--node--field-tags.html.twig file these changes displays in all content types also. If I don't want to show default taxonomy terms in the bottom of article nodes (I want to move and show taxonomy terms in the top of the article) and I assign "Hidden" value in "Administration>Structure>Content types>Article" in "Format" section, this settings cause to not displays all the taxonomy terms fields in throughout of the article nodes at all. Taxonomy terms Label always display even if no tags added to the node. How can I show taxonomy terms label and their values only when have been added any tags to it?


Searching registers that contains a part of text inside a registers from a List with stream java 8

I have this POJO. Also, I have a List of Students and I want to filter with stream which registers have in his schoolname the text santa. In SQL it would be something like this: LIKE %SANTA%     public class Student {     private String name;     private String lastName;     private String city;     private String schoolname;     private String telephone;      public String getName() {       return name;     }      public void setName(String name) {       this.name = name;     }      public String getLastName() {       return lastName;     }      public void setLastName(String lastName) {       this.lastName = lastName;     }      public String getCity() {       return city;     }      public void setCity(String city) {       this.city = city;     }      public String getSchoolname() {       return schoolname;     }      public void setSchoolname(String schoolname) {       this.schoolname = schoolname;     }      public String getTelephone() {       return telephone;     }      public void setTelephone(String telephone) {        this.telephone = telephone;     } }   And I would like to obtain the students which his schoolname contains the string santa, do you know how can I have to do the filter with streams?  I need to do with stream, I can't do it with if and else statements.


How to start sh file in one line command ? This is how I normally start sh file in the specific path  user@user:~$ cd idea-IC-171.4424.56/bin user@user:~/idea-IC-171.4424.56/bin$ ./idea.sh    If I would like to start the command in one line like below, I will get error  user@user:~/idea-IC-171.4424.56/bin$ cd idea-IC-171.4424.56/bin/idea.sh bash: cd: idea-IC-171.4424.56/bin/idea.sh: No such file or directory


Java equivalent of JavaScript Date.UTC(1980, 0, 8)  Example in JavaScript :    var base_date = Date.UTC(1980, 0, 8); console.log("base_date:" + base_date)     The result is: base_date:316137600000  How to do it in Java and the the exact same result?  The next java code, gives another result than javascript:  import java.util.Calendar; import java.util.Date; import java.util.GregorianCalendar; import java.util.TimeZone; import java.text.SimpleDateFormat; public class MyClass {     public static void main(String args[]) {      Calendar cal = GregorianCalendar.getInstance(TimeZone.getTimeZone("UTC"));         cal.set(1980, 0, 8);         long time = cal.getTimeInMillis();         System.out.println(time);         System.out.println(cal.getTime().getTime());     } }   316185175487   316185175487


I'm trying to visit a website that requires the use of Adobe Flash, but all it's doing is giving me the following error:     Please install the Flash player in order to view the broadcast         Is there anything I can do to resolve this error and install Flash on Ubuntu?  I am running Ubuntu 16.04 LTS, using Firefox as my browser.


Proving $x^n + x^{n-1} + \ldots + 1$ is reducible for $n$ composite

If $n$ is a composite number, I want to prove that $x^{n-1} + x^{n-1} + \ldots + x + 1$ is reducible. I am familar with the factorization \begin{align*} x^n - 1 = (x - 1)(x^{n-1} + x^{n-2} + \ldots + 1). \end{align*} If $n$ is composite, I know I can write $n = xy$ non-trivially. I do not know, however, how to proceed, because the only way I can isolate the polynomial I'm interested in is to redivide by $x - 1$, which is not helpful. I don't think polynomial long-divison will work well either.


I want to see all my Stack Exchange linked deleted questions

Searching "deleted:1" yielded 217,625 results.  I am not informed why my account is suspended. I have no question or answer history here:   Solution idea: a "deleted" tag. This would allow that tag to be searched or RSS albeit it's on a per-site basis as I think user IDs are not consistent on all sites.  I hate investing time into a question only to have it deleted and not being notified about it. But it seems like the site keeps the database entry, so I was wondering if I can grep/mget all my deleted posts.  . Maybe I can replace it like so:  $EXCHANGESITELIST . "/users/recently-deleted-answers/885719"  $EXCHANGESITELIST . "/users/recently-deleted-questions/885719"   and like flashGot.  But I wanted to ask you guys if this feature is implemented or perhaps I can set up an RSS feed to be notified.


How to prove $\sum_{d|n} {\tau}^3(d)=\left(\sum_{d|n}{\tau}(d)\right)^2$

For every positive integer $d$, we let $\tau\left(d\right)$ be the number of positive divisors of $d$. Prove that \begin{align} \sum_{d|n} \tau^3(d) = \left(\sum_{d|n} \tau (d)\right)^2 \end{align} for each positive integer $n$, where the sums range over all positive divisors $d$ of $n$.  Now I only know that both sides are multiplicative arithmetic functions in $n$. Could you tell me what I need to do next?


I need some help with a homework problem to modify a file's permissions. It wants it to be -rwxr-xr-x? Not sure how to make the user permissions. Thank you.


how to echo a method from string in javascript

I have about 7 string names that I would like to use inside if/else to echo a function like:   function main (str) {  if(str == "a"){    a()  }   if(str == "b"){   b ()  } }   My question is, is there anyway to just call function directly using the str value? without using if/else of course


Mount partition at /var/log during install

I'm installing Ubuntu 16.04 with manual partitioning, and need to choose a separate partition for /var/log. However, in the installer, there does not seem to be an option for doing this. The drop-down menu only has /, /boot, /home, /tmp, /usr, /var, /srv, /opt, and /usr/local.  What is the easiest way to put /var/log on a separate partition?


I have a note type 'team' with a body field and a checkbox field (checked by default). I want to automatically check the box on save IF there is content in the body field. Is there a way to do that programmatically?


How to highlight some text on a man page?

I find the manuals very difficult to read using the terminal. Is there a way to highlight specific text on the terminal? I tried piping to gedit using man man | gedit, but it opens a blank file instead.  Perhaps there's some way to find text within a man page and have it highlighted?


Inductive proof of gcd Bezout identity (from Apostol: Math, Analysis 2ed)

I've done proofs in discrete mathematics, but I'm still at the stage where proofs with more than a few steps make me uncomfortable.  From Apostol's Mathematical Analysis [2nd Ed.] on page 5, we have     Theorem 1.6. Every pair of integers $a$ and $b$ has a common divisor $d$ of the form   $$ d = ax + by $$   where $x$ and $y$ are integers. Moreover, every common divisor of $a$ and $b$ divides this $d$.   The proof (with my questions throughout) goes as follows:     Proof. First assume that $a \geq 0, b \geq 0$ and use induction on $n = a + b$. If $n = 0$ then $a = b = 0$, and we can take $d = 0$ with $x = y = 0$. Assume, then, that the theorem has been proved for $0, 1, 2, ..., n - 1$.   I am a little confused about taking $n$ to be $a + b$, since it's not obvious that all pairs $\{a, b\}$ would be covered by induction for all combinations of $a, b \in \mathbb{Z}$.     By symmetry, we can assume $a \geq b$. If $b = 0$ take $d = a, x = 1, y = 0$.   OK.     If $b \geq 1$ we can apply the induction hypothesis to $a - b$ and $b$, since their sum is $a = n - b \leq n - 1$. Hence there is a common divisor $d$ of $a - b$ and $b$ of the form $d = (a - b)x + by$.   I'm going to let $a' = a - b$, let $b' = b$ and let $d' = a'x + b'y$. (I wish Apostol did something like this to make his proofs clearer.)  I don't understand this logical step. Why does the fact that $a' + b' \leq n - 1$ imply that $d'$ exists and is a common divisor of $a'$ and $b'$? This seems like a huge leap.     This $d$ also divides $(a - b) + b = a$, so $d$ is a common divisor of $a$ and $b$ and we have $d = ax + (y-x)b$, a linear combination of $a$ and $b$.   At this point I am clueless. Why does $d$ divide $a$ and why does this imply it also divides $b$? And where does Apostol get $y-x$ from??     To complete the proof we need to show that every common divisor divides $d$. Since a common divisor divides $a$ and $b$, it also divides the linear combination $ax + (y-x)b = d$. This completes the proof if $a \geq 0$ and $b \geq 0$. If one or both of $a$ and $b$ is negative, apply the result just proved to $|a|$ and $|b|$.   Why not just do the entire proof with absolute values from the beginning?    Soft question: is it normal for authors to be very terse and not explain or give motivation for any steps? How do you go about trying to understand proofs that require a higher level of intuition than you currently have?


Reference Request on a good Linear Algebra book

So I'm looking for a linear algebra book with a strong focus on proofs. It would be great if the book also uses concepts from regular abstract algebra like isomorphisms etc instead of dancing around it.  Note that a book of problems/solutions would also suffice and indeed possibly be more helpful.   Could someone suggest something?  EDIT : To be clear, This isnt exactly a duplicate question. I've already taken abstract algebra and I'm looking for a book which uses those concepts. Most of these links are for people who've never taken abstract algebra and want to start off with linear algebra


Why is the default process creation mechanism fork?

The UNIX system call for process creation, fork(), creates a child process by copying the parent process.  My understanding is that this is almost always followed by a call to exec() to replace the child process' memory space (including text segment).  Copying the parent's memory space in fork() always seemed wasteful to me (although I realize the waste can be minimized by making the memory segments copy-on-write so only pointers are copied).  Anyway, does anyone know why this duplication approach is required for process creation?


What software programs are used to draw Mechanics, Electricity & Magnetism, Waves, Thermodynamics, Optics & Modern Physics diagrams?

For training students in competitive exams & physics olympiads, I want to illustrate deeper meanings in problem solving through diagrams.  I have my teaching material hand drawn in OneNote. I want to create some professional quality colorful diagrams that we find in Halliday, Resnick & Walker - Fundamentals of Physics.  To manually place Inductors or wedges or springs or lens or to create field diagrams on Adobe Illustrator is hard. You can imagine all the alignment troubles...  Any software with scripting/programming is also welcome.  So I decided to look out for help from the experienced ones in these regard.


How i can change function to one line in python

def height (t):   if not t:     return 0                                   # (1)   elif not t.nodes:     return 1                                   # (2)   else:     return 1 + max(height(n) for n in t.nodes) # (3)  hello guys some one can help me and change this function to pipline? using map , filter , lambda you don't need to write def height you need to use only with lambda map filter (PIPLINE)


How to transfer installed apps from one account to another

On my Note 2 I have two accounts configured  my.email@gmail.com my.work.email@company.com  Usually I have the Play Store configured to buy/install apps under my.email@gmail.com but somehow it got changed to my work email a while back. Before I noticed this, I installed ~20 apps using the my.work.email@company.com  Is there a way for me to re-associate those purchases with my.email@gmail.com without manually reinstalling each app? And how will this be different for free vs paid apps that I installed while using my.work.email@company.com?


Can you recommend some books on elliptic function?

I plan to study elliptic function.  Can you recommend  some  books? What is the relationship between elliptic function and elliptic curve？Many thanks in advance!


I have a 500 point bounty that will expire soon. What happens to those points?

I put a 500 point bounty on this question and think I was dumb about it:    In almost a week, no answers, and no comments.  I don't even think there was a boost in visibility than if I did a much smaller bounty.  Perhaps the best thing I should have done is to boost it for several weeks with a 50 point bounty  My understanding is that the outcome will either be   I lose the 500 points.  No benefit to the community, a huge rep loss for me. Someone posts a low quality answer that gets naively upvoted or via a puppet account...  The bounty is awarded to a poor answer that doesn't really help   My question is; what are my options if this were to occur?    Can I extend the duration of the bounty artificially?  Can I get a mod-level reissue of the rep, or an extension to this question?  I do think an answer to this question would benefit many C# developers interested in cryptography or Bitcoin, and think that whatever outcome results in a complete answer would be greatly beneficial for the community.


I've just realised that when you vote to reopen a question, you can't retract it afterwards. On the other hand, close votes can be retracted. Why can't "reopen votes" be retracted?


Is the order of the tensor product in $|\phi\rangle\otimes|\chi\rangle=|\chi\rangle\otimes|\phi\rangle$ relevant?

I am reading this book “Quantum Computing Explained” by David McMahon. I found the following statement on page 74  Note that the order of the tensor product is not relevant, meaning $|\phi\rangle \otimes |\chi\rangle = |\chi\rangle \otimes  |\phi\rangle$   I found it surprising to face this in a quantum computing book, because this is not true. Have any of you read the book or have any idea how it could be true? (Though as I said, I don’t think it is true).


How to access files/directories with spaces in the name?

Through terminal I can't access files or directories with a spaces in their names. The cd command says no such file or directory.  Is there any way to do it or should I rename all files with spaces?


Read a text file and save value as variable in python

I am new to Python and please excuse if my question sounds dumb. I have a function which reads a text file and records the first line and passes the same to another function. But I am not able to figure out a way to store the value to a global variable which can be reused again.   Sample of text file. Holds only one line: 1234567   Script to read file:  def main():     input = file(infile, 'r')     lines = input.readlines()     input.close()     i = 0     for line in lines:         i += 1         id = int(line)         WorkOnIDThread(id) main()   So basically I want help with storing the id as a global variable which I could reuse through out the script.   Any help on this would be really helpful.


Find all holomorphic functions that satisfy a condition

Find all holomorphic funtion $f:B(0,1)\mapsto B(1,4)$ s.t. $f(0)=3$ and $f(1/2)=1$  $B(a,r)$ is the open ball with centre a and radius r.  I think that maybe Schwarz lemma will help, but dont know how. Thanks!


How to Buffer data in a Geographic coordinate system?

I am having an issue with buffer. My data is in Geographic coordinate system. I am trying to do a buffer of 600m and i am finding different results for each case, have tried thse so far:    Map in web maercator map in UTM zone 12 map in geogaphic coordinate   I am missing some data points due to this and wanted to check how I can resolve this issue. I know that UTM is the most accurate projection for distance but I wanted to know if by using WebMercator map if there is a way to get correct buffer results , any ideas? Thanks jay


I came across this in the lecture notes of quantum field theory by David Tong. Inside time ordering interactions aren’t taken to be normal ordered. Interaction hamiltonian should be normal ordered otherwise it is not well defined (due to ordering ambiguity and related singularities). Most standard QFT textbooks don’t address this issue. Am i missing something here or normal ordering was assumed?


I have a table with a column for ID, Date and Frequency of occurrence for that particular date and ID.  ID    date          Frequency 1     2014-05-18      5 1     2014-05-19      4 1     2014-05-20      25 2     2014-05-20      7 3     2014-05-18      4 3     2014-05-20      1 4     2014-05-18      6   I'm looking to insert the dates for each ID that aren't currently there (assuming that the date ranges from 2014-05-18 to 2014-05-20) and add a value of 0 in Frequency for those.  For example, you can see that  ID 1 has an observation for all three dates;  ID 2 is missing 2014-05-18 and 2014-05-19;   ID 3 is missing 2014-05-19;   ID 4 is missing 2014-05-19 and 2014-05-20.  Therefore, the output should look like this  ID    date          Frequency 1     2014-05-18      5 1     2014-05-19      4 1     2014-05-20      25 2     2014-05-18      0 2     2014-05-19      0 2     2014-05-20      7 3     2014-05-18      4 3     2014-05-19      0 3     2014-05-20      1 4     2014-05-18      6 4     2014-05-19      0 4     2014-05-20      0   I've attempted the following from . However, that will only add dates with 0 Frequency that aren't present throughout the entire table instead of on an ID level.   DECLARE @s DATE = '20140518', @e DATE = '20140520';  SELECT c.date, Frequency = COALESCE(a.Frequency,0) FROM dbo.Calendar AS c LEFT OUTER JOIN dbo.table AS a ON c.date = s.[date] WHERE c.d >= @s AND c.d < DATEADD(DAY, 1, @e);


I get a (hex) value from an API, which is combined with some OR operations:     The ReferenceStatus is used to report the references stored for one   person in the ID Module archive. If more than one reference is   available, the approbriate values are combined with an OR operation.   This is the table with the different (non-combined) values:  Value  Remark 0x0001 Left little finger 0x0002 Left ring finger 0x0004 Left middle finger 0x0008 Left index finger 0x0010 Left thumb 0x0020 Right thumb 0x0040 Right index finger 0x0080 Right middle finger 0x0100 Right ring finger 0x0200 Right little finger 0x03FF All fingers   How can I split up the value from the API (let's say it's 0x01C8) into it the different codes (0x0008, 0x0040, 0x0080, 0x0100)? (I never worked with bitwise operations before)


First post here!  What I'm trying to accomplish looks fairly simple but so far I've had no luck in finding a way to accomplish it. Essentially I want to create custom stroke caps (or strke profiles if necessary) that will allow me to create strokes with a shallow rounded end or an angled end as shown below    Is this even possible? If so, how would I go about making this happen? I am working on a typeface where these two shapes will be common, and I prefer to work with pure strokes first, so if I can accomplish this it would be great. Thanks in advance for any tips!


Can we Find any Software's "Source Code" on Ubuntu

I wanted to know that there's a software on Ubuntu store and if i installed it so as we know we are in Ubuntu Linux , can i find that software's "Source Code" on the Terminal or any Other way... I am a student and have started Learning Software Development... So, How can i find any software's "Source Code" on Ubuntu Please Help Anybody...


I want to set up daily logrotate for my Tomcat server' catalina.out log file but it's not working - I haven't seen the rotated log files created. To troubleshoot, I ran logrotate -d /etc/logrotate.conf and got the following:    rotating pattern: /usr/local/tomcat/logs/catalina.out  5242880 bytes (7 rotations) empty log files are rotated, old logs are removed considering log /usr/local/tomcat/logs/catalina.out   log needs rotating rotating log /usr/local/tomcat/logs/catalina.out, log->rotateCount is 7 dateext suffix '-20151223' glob pattern '-[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9]' glob finding old rotated logs failed copying /usr/local/tomcat/logs/catalina.out to /usr/local/tomcat/logs/catalina.out-20151223 truncating /usr/local/tomcat/logs/catalina.out compressing log with: /bin/gzip    It seems like everything is working without any error. However, there is no results:    [root@gec logrotate.d]# ls -lrth /usr/local/tomcat/logs/cata* -rw-r--r-- 1 root root  398 Dec  4 17:48 /usr/local/tomcat/logs/catalina.2015-12-04.log -rw-r--r-- 1 root root 109M Dec 23 17:21 /usr/local/tomcat/logs/catalina.out    My /etc/logrotate.conf:    daily  rotate 7  # create new (empty) log files after rotating old ones create  # use date as a suffix of the rotated file dateext  # uncomment this if you want your log files compressed #compress  # RPM packages drop log rotation information into this directory include /etc/logrotate.d    My /etc/logrotate.d/tomcat:    /usr/local/tomcat/logs/catalina.out {     copytruncate     daily     rotate 7     compress     missingok     size 5M }     What is wrong?    Updates:  Interestingly, running logrotate -f /etc/logrotate.conf creates the rotation gzip files!  [root@gec logrotate.d]# ls -lrth /usr/local/tomcat/logs/cata* -rw-r--r-- 1 root root  398 Dec  4 17:48 /usr/local/tomcat/logs/catalina.2015-12-04.log -rw-r--r-- 1 root root 1.1M Dec 23 17:26 /usr/local/tomcat/logs/catalina.out-20151223.gz -rw-r--r-- 1 root root 109K Dec 23 17:27 /usr/local/tomcat/logs/catalina.out   However, how do I know whether the daily cron job will work?


$f'=0$ on a co-countable set implies $f$ constant?

Suppose $S\subset[0,1]$ is countable, $f:[0,1]\to\Bbb R$ is continuous, and $f'(t)=0$ for every $t\in[0,1]\setminus S$. Does it follow that $f$ is constant?  Yesterday I realized the answer's yes if $S$ is closed and $f$ has bounded variation (say $f(x)-f(0)=\mu([0,x])$. Then $\mu$ must be concentrated on $S$, and since $S$ is countable and $\mu$  vanishes on singletons it follows that $\mu=0$.)    I can show the answer's yes if $S$ is closed.   But.  (The answer must be yes: If there were a counterexample it would be in books next to or in place of that Lebesgue-Cantor function. But I fear some may feel this argument is somewhat lacking in "rigor"...)  Edit: Thanks to @MartinR for pointing out that this follows from the result . The answer there is a little intricate; one can get the idea  from the first few lines, and then give the following proof, which seems simpler to me (possibly just because stuff I figure out always seems simpler than stuff I try to read, maybe not):  Let $S=(\alpha_n)$. Let $\epsilon>0$.  If $x=\alpha_n$ there is an open interval $I_x$ with $x\in I_x$ and $$|f(s)-f(t)|<\epsilon2^{-n}\quad(s,t\in I_x).$$Otoh if $x\in[0,1]\setminus S$ there is an open interval  $I_x$ with $x\in I_x$ and $$|f(s)-f(x)|\le\epsilon|s-x|\quad(s\in I_x).$$  Now $[0,1]$ is covered by finitely many intervals $J_1,\dots,J_n$ with $J_j=I_{x_j}$. We can assume that no $J_j$ is contained in the union of the $J_k$ for $k\ne j$, and then we can assume that the $J_j$ are ordered from left to right; in particular $0\in J_1$ and $1\in J_n$.  Now $J_j\cap J_{j+1}\ne\emptyset$, since $[0,1]$ is connected. Say $y_j\in J_j\cap J_{j+1}$. Then $$|f(1)-f(0)|\le|f(0)-f(x_1)|+|f(x_1)-f(y_1)|+|f(y_1)-f(x_2)|+|f(x_2)-f(y_2)| \\+|f(y_2)-f(x_3)|+\dots+|f(y_{n-1})-f(x_n)|+|f(x_n)-f(1)|.$$Now for each term here we may apply one or the other of the two inequalities above (depending on whether $x_j\in S$); throwing in a lot of extra stuff on the RHS to simplify the notation we obtain $$|f(1)-f(0)|\le2\epsilon\sum_k2^{-k}+\epsilon\sum|x_j-y_j|+\epsilon\sum|y_j-x_{j+1}|\le 3\epsilon.$$  So $f(1)=f(0)$, which come to think of it is not what we wanted to prove, but the same argument shows $f(b)=f(a)$ for every $[a,b]\subset[0,1]$.


Processing framework input variables from QGIS-2 not working in QGIS-3

A simple script created within the QGIS 2.18 processing toolbox:  ##example=string print example   Upon running would produce and input box in a window with a run button:   Once executed would produce the expected print in the python console  When testing the same code in QGIS-3.0, changing the print to python 3's print(), I get an error where the input section is seemingly ignored as a comment:   Does the processing framework no longer accept inputs in this way?


Proper way to reload rsyslog with a config file for a custom application

I want to log my app so that it writes its log into its own log file. I create the log file and save it under /etc/rsyslog.dbut my app doesn't create/write to the designated file. However, once I reload rsyslog, there are log entries the next time my app runs. I package my app into an RPM so I can write post-install scripts if necessary. Is this the proper way to handle this via post-install scripts? /etc/rsyslog.d/serf.conf if $programname == 'serf' then /var/log/serf.log & ~  Sending pkill -HUP rsyslog works but I wasn't sure if that would cause any issues to other programs while they're in the middle of logging.


Is there any way to "restore" a .pst (Outlook Personal Folder) or .ost (Offline Folder file)?

I have Microsoft Outlook 2007 installed and use IMAP for all my mail accounts. When I updated to Windows 7 I had to reinstall Outlook and thus download all the headers again. I ended up downloading everything again, but I would want to prevent this in the future.  Is there a way to import my Microsoft Office Outlook Personal Folders (.pst) or Offline Folder (.ost) files into the new installation, so I don't have to download all the headers again?    Edit: I checked the extension of the files in my current Outlook folder, which are .pst files, is it possible Outlook changed them to .ost files when I was messing around with my Outlook settings? I've changed my question to import .pst or .ost.  Edit2: I tried exactly that and even made sure they had the correct name, but then Outlook would crash on me. I guess there is more to it than just the file names... I also tried some programs to restore .ost files, which actually managed to get files out if it, but also tried to empty my wallet... I'm hoping for a kick-ass hacky way to get it working anyway!


Are distinct prime ideals in a ring always coprime? If not, then when are they?

Essentially as the title suggests - in some commutative ring $K$ (with 0,1), if we have 2 distinct proper prime ideals $\mathfrak{p}_1 \neq \mathfrak{p}_2$, is it necessarily the case (or if not, when is it the case?) that $\mathfrak{p}_1 + \mathfrak{p}_2 = K$ ?  I ask because I'm working through some lecture notes which frequently take some $K$ complete with respect to a discrete valuation, a prime ideal in a valuation ring  $\mathfrak{p} \subset \mathcal{O}_K$, a finite extension $L/K$, and then use the fact $\mathfrak{p}\mathcal{O}_L$ factors uniquely as some $\mathcal{P}_1^{a_1} \ldots \mathcal{P}_r^{a_r}$ (where $\mathcal{O}_L$ is the integral closure of $\mathcal{O}_K$ in $L$). Then we say $\mathcal{P}_i + \mathcal{P}_j = \mathcal{O}_L$ $(\forall$ $ i \neq j)$.   However it isn't clear to me, because we've made so many different assumptions along the way, what the reason is that $\mathcal{P}_i + \mathcal{P}_j = \mathcal{O}_L$. Is it because these primes occur in the factorisation of $\mathfrak{p}$, is it because of some property of Dedekind domains or fields, or is it not really possible to say out of context? Many thanks, and if anything needs clarification please ask.


Subgroups containing kernel of group morphism to an abelian group are normal.

Let $\varphi:G\rightarrow H$ be a group homomorphism from group $G$ to group $H$. Show that, if $H$ is abelian, all subgroups of $G$ that contain $\mathrm{ker} (\varphi)$ are normal in $G$.


Show only presenter view in a video call

I am using the package pgfpages to take notes of a particular slide. But when I present in a online presentation by Google Meet, Is there any way just to show the slides to the audience even though notes are present on the right hand side. Simply My audience do not want to see my notes.


Control which words biblatex/bibtex capitalizes in bibliography

My publisher has a list of ~50 words that need to be lowercase in titles of books and articles, the remaining words need to be capitalized. We are using BiBTeX, not biber, for performance reasons. Here is the invocation: \usepackage[backend=bibtex,language=american,style=authoryear]{biblatex}``` % Patch biblatex: \urlstyle{sf} \DeclareFieldFormat{url}{\url{#1}}  Right now, the only way I can think to honor the publisher's list is to have a python program that does post-processing on the .bbl file. Which I can certainly do, but it would be nice if there were a better way. If I do need to do post-processing on the .bbl file, is there a way to get latexmk to run my python program after running bibtex? From the docs, it seems that I might be able to set $bibtex = 'python bibwrap.py' where bibwrap.py would run bibtex and then run my post-processing script. Would that be the way to do it?


Book: Female protagonist transformed into alien on alien planet

I have been trying to figure this out for years. There is another posting that is similar, but I'm not sure if it's the same.   Female protagonist, I don't remember how she finds herself on the alien planet, but she is injured or stranded or something so the aliens transform her into one of them. From what I recall they are frog like, forest dwelling, and I vaguely recall telepathic communication?   At some point there are other humans, and she turns back into a human. I remember a really bizarre, out of place, graphic sex scene with a fellow human.  Also for some reason I keep thinking the author was maybe Swedish or Danish?


How can I remove the broken (due to power cut during installation) kde plasma package?

I was installing KDE plasma on Ubuntu but the power supply was cut off. when I tried to reinstall, an error occurred.  Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies: kde-telepathy-minimal : Depends: kde-config-telepathy-accounts (>= 15.04.0) but it is not going to be installed E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).   I tried to use sudo apt-get --purge remove kubuntu-desktop but it failed. Using sudo apt-get -f install didn't work.  The following additional packages will be installed:  kde-config-telepathy-accounts The following NEW packages will be installed:  kde-config-telepathy-accounts 0 upgraded, 1 newly installed, 0 to remove and 60 not upgraded. 704 not fully installed or removed. Need to get 0 B/148 kB of archives. After this operation, 808 kB of additional disk space will be used. Do you want to continue? [Y/n] y (Reading database ... 293342 files and directories currently installed.) Preparing to unpack .../kde-config-telepathy accounts_4%3a15.12.3-0ubuntu1_i386.deb ... Unpacking kde-config-telepathy-accounts (4:15.12.3-0ubuntu1) ... dpkg: error processing archive /var/cache/apt/archives/kde-config-telepathy-accounts_4%3a15.12.3-0ubuntu1_i386.deb (--unpack): trying to overwrite '/usr/share/accounts/services/google-im.service', which is also in package account-plugin-google 0.12+16.04.20160126-0ubuntu1 Processing triggers for libc-bin (2.23-0ubuntu7) ... Errors were encountered while processing: /var/cache/apt/archives/kde-config-telepathy-accounts_4%3a15.12.3-0ubuntu1_i386.deb E: Sub-process /usr/bin/dpkg returned an error code (1)   I also used sudo dpkg --remove --force-remove-reinstreq kubuntu-desktop and it completed successfully but have no effect. I couldn't install synaptic and I also couldn't upgrade the package either. I also couldn't remove google-im.service


Show Previous/Next Posts navigation only inside the same category

Is it possible to force previous/next navigation to browse through the posts (back and forth) that are only inside the same category (and to exclude other categories)?


"What {is/are} the meaning and connotations of this phrase?" Which is correct here, "is" or "are"?

Consider the question:  What is/are the meaning and connotations of this phrase?   Clearly you would say:  What is the meaning of this phrase? What are connotations of this phrase?  and obviously you could just restructure the sentence to avoid the ambiguity:  What is the meaning of this phrase, and what are it's connotations?  But supposing you want to use the original phrase, which form of the verb is correct? Is there a correct form?