On first page of Table of Contents there is no header and footer, but on the second page there are a header and a footer.  My question: I don't need any numbering and header/footer on table of content. How can I have the entire table of contents (not only its first page) appear with no header or footer, and have them start at Chapter 1?  \documentclass[tikz,table,twoside,12pt,a4paper]{report} \usepackage{PTSansNarrow} \usepackage[T1]{fontenc} \usepackage{array,tabularx} \usepackage[most]{tcolorbox} \usepackage{xcolor} \usepackage{enumerate} \usepackage{graphicx} \usepackage[ruled, vlined, linesnumbered]{algorithm2e} \usepackage{censor} \censorruledepth=-.2ex \censorruleheight=.1ex \usepackage{setspace} \usepackage{subfigure} \usepackage{subfig} \usepackage[top=3.5cm, bottom=3.5cm, left=3.5cm, right=2.75cm]{geometry} \usepackage{fancyhdr} \usepackage{url} \usepackage{fancyvrb} \usepackage{color} \textwidth14cm \definecolor{darkblue}{rgb}{0.1,0.3,0.5}  \DefineVerbatimEnvironment% {MyVerbatim}{Verbatim} {gobble=0,label=\hspace{.85\textwidth},labelposition=all}  \usepackage[Lenny]{fncychap}%Sonny, Lenny, Glenn, Conny, Rejne, Bjornstrup and Bjarne \usepackage{cite} \usepackage{rotfloat} \usepackage{subfloat} \usepackage[titletoc]{appendix} % load package with ``framed'' and ``numbered'' option. \usepackage[numbered,autolinebreaks,useliterate]{mcode} \pagestyle{fancy} \fancyhf{} \fancyhead[LE,RO]{} \fancyhead[R]{\nouppercase{\leftmark}} \fancyfoot[C]{\thepage}  \renewcommand{\headrulewidth}{2pt} \renewcommand{\footrulewidth}{1pt}   \begin{document}  \pagenumbering{gobble}% Remove page numbers (and reset to 1) \clearpage \title{\textbf{THESIS NAME}\\ \begin{figure}[ht] \centering \includegraphics[width=0.5\textwidth]{logo.eps} \end{figure} }  \date{} \author{\textbf{SUBMITTED BY:}\\\textbf{STUDENT NAME} \vspace{5mm} \\ \textbf{Supervised By}\\ \textbf{NAME}\quad \vspace{10mm} \\ \textbf{DEPARTMENT OF COMPUTER SCIENCE} \\\textbf{NAME OF UNIVERSITY}        \\\textbf{Session:2012-2013} } \maketitle  \null \vfill \null \vfill \onehalfspacing \newpage \pagenumbering{roman} \chapter* {PROJECT APPROVAL} SAKASLJFSAJFKSAJFJEIJ S\KJ\\\\ \newline COMMITTEE\\\\ \newline \begin{flushleft} External Examiner: \line(1,0){250} \end{flushleft} \begin{flushleft} Comments: \line(1,0){250} \end{flushleft} \begin{flushleft} Internal Examiner: \line(1,0){250} \end{flushleft} \begin{flushleft}  Comments: \line(1,0){250} \end{flushleft} \begin{flushleft}  Chairman: \line(1,0){250}  \end{flushleft}  \begin{flushleft}  Comments: \line(1,0){250}  \end{flushleft}  \chapter* {DEDICATION}  KSAHDSAFH ASK JFASKJF  \chapter* {ABSTRACT}  XCLSCSAJFSAFOSAFISADKFLASKFL;ASKSAKFLKSALKFS  \chapter* {ACKNOWLEDGEMENT} LSAFLDSFJ SDAFJIASFAS JFSJAF SFSFAUI DSAF \chapter* {AUTHOR'S DECLARATION} ABC \newline Signature of Authors\\ \newline ABC: \xblackout{forty       two}\\ \newline ABC: \xblackout{forty     two}\\ \newline Date: \xblackout{forty     two}\\    \newpage \pagenumbering{gobble}% Remove page numbers (and reset to 1) \clearpage \tableofcontents  \pagenumbering{arabic} \input{ch1} \input{ch2} \input{ch3} \input{ch4} \input{ch5} \input{ch6} \input{ch7} \input{ch8}   \addcontentsline{toc}{section}{\textbf{Bibliography}} \bibliographystyle{plain} \bibliography{bibk}   \end{document}


$\mathbb{Z}[\frac{1-\sqrt{-19}}{2}]$ - principal ring, but not an euclidean ring

I am stucked on the problem. Is there someone who could tell me why $\mathbb{Z}[\frac{1-\sqrt{-19}}{2}]$ is a principal ring, but it is not an euclidean ring?


How can I find the actual seed code for my map?

When a map is created randomly, how can we find the seed that it has generated ?  I want to find some cool map in single player and when I'll find one, I want to get that seed and create it on my SMP server.


How do I get this movie texture to animate as projected on an object?

I'm just trying to get a movie texture to play on an object - can't seem to get it to play in Blender 2.8 (when pressing space).    Can anybody suggest a solution?


How can I get an equation of trajectory of a particle mathematically for circular motion?

How can I get an equation of trajectory of any particle moving in a circular motion? I mean I want to get an equation of a circle by using the conditions given for a circular motion. We know that if a particle enters in a force field $\vec F$ with velocity $\vec v$, where force $\vec F$ is perpendicular to $\vec v$, and if the force remains perpendicular to $\vec v$ always, then the trajectory of that particle becomes a circle. We can understand it physically. $\vec F$ is always perpendicular on $\vec v$ and hence on the displacement at every position of the particle. We know the force is always directed to a fixed point from which the force is created. At any point on the trajectory, the direction of displacement is given by the tangent on that point. so we can assume the force as the radius of a circle, as it is always perpendicular to the tangent on the trajectory, which is a property of a circle. So the trajectory will be a circle. But how can I get it mathematically? Can I get an equation of a circle for the trajectory of the particle by using the conditions(like $\vec F$ is always perpendicular to $\vec v$ and hence on displacement or something like that)?


Show that for any integer $n \geq 0$, the complete graph with $2n + 1$ vertices can be $2$−factorable into $n$ Hamiltonian cycles  A graph $G$ is 2-factorable if and only if it is 2r-regular for some r.  If $G$ is Hamiltonian, then that $G$ has a $2$-factor.  I'm trying by induction but I have problems with the inductive step.


Intuition behind standard deviation greater than mean for all positive values

I am following through this   But it doesn't talk about what does it mean when the standard deviation is higher than mean when all values are supposed to be positive e.g. standard deviation of age of 500 people. Clearly age can't be negative but the lower end of 1 standard deviation confidence interval is negative.  Edit: My question is what does lower end of confidence interval being negative mean since negative age is not possible.


Occasionally I need to use a custom icon for something - a launcher created with alacarte, a custom .desktop file, or just a particular folder viewed in Nautilus.  I know there are LOADS of cool icons installed on my system at /usr/share/icons but browsing them is really awkward. Everything is scattered around, duplicated in different sizes (or symlinked to .svg) etc.  So, say I'm looking for a text file icon, or a purple folder or such, searching is a faff, and then when you do find results you need to work out what the best quality one is.  Made me think that someone might have written an app for this?


Why is the rescaled sample SD Chi distributed?

A related post . In which the author claimed, if $X_{i}\sim N(\mu,\sigma^2),i=1,\cdots,n$ are iid then      $$\frac{(n-1)s^2}{\sigma^2}\sim \chi^2(n-1)$$   in which $s^2$ is the unbiased sample variance. i.e. $s^2=\frac1{n-1}\sum(X_i-\bar X)^2$ where $\bar X=\frac1n\sum X_i$.  I want a proof of it. But I can't do one on my own. In fact, contrary to my initial suspicion that $X_i-X$ are uncorrelated, I actually got \begin{align} \mathsf{Cov}\,(X_i-\bar X,X_j-\bar X) &=\mathsf{Cov}\,(X_i,X_j)+\mathsf{Var}\,(\bar X,\bar X)-2\mathsf{Cov}\,(X_i,\bar X)\\ &=0+\frac1{n^2}n\sigma^2-2\frac1n\sigma^2\\ &=-\frac1n\sigma^2\ne 0 \end{align}  So where does the Chi square come from?


What happens when this situation occurs in Tsuro?

There are two empty sepetated spaces left and the person going does not have a card to play but the next person does.   Does the first person lose because they are out of cards to play or does the second player lose because they still have a card to play afterwards that will move them off the board?


Why can't I unsubscribe from an Event Using a Lambda Expression?

This article states .  E.g. you can subscribe as follows:  d.Barked += (s, e) => Console.WriteLine("Bark: {0}", e);   but you can't unsubscribe like this:  d.Barked -= (s, e) => Console.WriteLine("Bark: {0}", e);    Why? What's the difference between this and unsubscribing from a delegate, e.g.  EventHandler<string> handler = (s, e) => Console.WriteLine("Bark: {0}", e); d.Barked += handler;  // ...  d.Barked -= handler;


Which render engine renders faster? Blender Internal or Cycles?

I wonder which render engine is faster? I mean, you have 2 identical scenes and render it using BI and Cycles. Which image will be generated faster? What will be the time difference?  Do you know any site (please post a link) which shows the results of such comparison?


Where do I find the client id and client secret of an existing connected app? The documentation talks about this information being provided when creating a new app, but what if my app already exists? I can't find this info.


How do I display file modification time (linux) as "Nov 8 12:00" format?

The format I want is "Nov 8 12:00". It is the format you get by using the ls -l command. It is month, day of the month, hour and minute. I tried stat -c %Y filename which gives time of last data modification, seconds since Epoch and I tried date -d @resultFromStat. It gives me unnecessary extra output like below.     Fri Feb 13 16:31:30 PST 2009   I am trying to use bash in perl.


What to do when moderators are guessing the answer instead of closing it?

I saw  question few minutes back. The question is not at all clear and as far as what I have read in the FAQ and heard about the functioning of this site. Questions like these should be closed as "Unclear what OP is asking"  But I found that the Moderators are also answering. I am not saying anything about there potential but dont you think that it is aganist the rule. I respectfully respect all the moderators here. But just curious to know that what is right and correct?  I am really sorry if I am asking for a big trouble by asking this question here. I have no intention to blame or put a finger on any moderator.


What is the full list of SE domain names?

Most SE sites are subdomains of stackexchange.com. However, some aren't. What are the list of those that aren't?  Right now i just know stackoverflow.com, superuser.com, serverfault.com, and askubuntu.com.


I'm about to start a Minecraft server, and I'd like to mimic some of the mechanics of a few larger servers on which I have played. For example I'd like to be able to set local game modes, so that one biome may be a survival area, while another is creative. I've been trying to find a way to do this, but unfortunately I haven't found anything. So I was wondering if anyone could help?


I've set up proftpd to use ssl/tls. Trying to connect I get an 'Illegal PORT command'  Finding Host xxx.nl ... Connecting to xxx.xxx.xxx.xxx:21 Connected to xxx.xxx.xxx.xxx:21 in 0.018001 seconds, Waiting for Server  Response Initializing SSL Session ... 220 FTP Server ready. AUTH TLS 234 AUTH TLS successful SSL session NOT set for reuse SSL Session Started. Host type (1): AUTO USER xxx 331 Password required for xxx PASS (hidden) 230 User xxx logged in SYST 215 UNIX Type: L8 Host type (2): Unix (Standard) PBSZ 0 200 PBSZ 0 successful PROT P 200 Protection set to Private PWD 257 "/" is the current directory CWD /var/www/html/ 250 CWD command successful PWD257 "/var/www/html/" is the current directory TYPE A 200 Type set to A PORT 192,168,192,14,211,181 500 Illegal PORT command Port failed 500 Illegal PORT command PASV 227 Entering Passive Mode (xxx,xxx,xxx,xxx,160,151). connecting data channel to xxx.xxx.xxx.xxx:160,151(41111) Failed to connect data channel to xxx.xxx.xxx.xxx:160,151(41111)   iptables:  Chain INPUT (policy ACCEPT) target     prot opt source               destination ACCEPT     icmp --  anywhere             anywhere            /* 000 accept all icmp */ ACCEPT     all  --  anywhere             anywhere            /* 001 accept all to lo interface */ REJECT     all  --  anywhere             loopback/8          /* 002 reject local traffic not on loopback interface */ reject-with icmp-port-unreachable ACCEPT     all  --  anywhere             anywhere            /* 003 accept all to eth1 interface */ ACCEPT     all  --  anywhere             anywhere            /* 004 accept related established rules */ state RELATED,ESTABLISHED ACCEPT     tcp  --  anywhere             anywhere            multiport ports ftp /* 021 allow ftp. */ ACCEPT     tcp  --  anywhere             anywhere            multiport ports ssh /* 022 allow ssh. */ ACCEPT     tcp  --  anywhere             anywhere            multiport ports smtp /* 025 allow smtp. */ ACCEPT     tcp  --  anywhere             anywhere            multiport ports pharos /* 051 allow rundeck. */ ACCEPT     tcp  --  anywhere             anywhere            multiport ports 8140 /* 814 allow puppetserver. */ ACCEPT     tcp  --  anywhere             anywhere            multiport ports http /* 080 allow http. */ ACCEPT     tcp  --  anywhere             anywhere            multiport ports https /* 443 allow https. */ DROP       all  --  anywhere             anywhere            /* 999 drop all */  Chain FORWARD (policy ACCEPT) target     prot opt source               destination  Chain OUTPUT (policy ACCEPT) target     prot opt source               destination   Connecting via normal ftp works just fine...  I'm using WS_FTP with ftp-authssl//xxx.nl/.... I tried several other connection options, ports, etc. But all give the same error. Althoiugh it seems that sometimes a first directory listing is shown (but that might be caching of WS_FTP)


How do I deal with an experienced player who doesn't interact well with my group?

My group and I just migrated from a DM whose very incongruent storytelling and deliberate punishment of non-hack & slay-solutions scared us off. We (mostly) kept our characters (since they are our first and much thought went into them) and decided to rotate GM-duties.   I am the first to GM, 3 sessions up to now, and I ran into many problems.  The social dynamics: we work as a team in a small theatre company. One of the players is my girlfriend. Another is a cool, funny guy. Both have very little experience, but playing with them is good fun. Along with the second session comes the third player: very experienced and all kinds of problematic.  Problems with the character:  First he builds some tripping monk, which is awfully weak compared to the other guys. He hates that character, so I help him kill him off and allow him to build a new one. (using the resurrection of their friend as a plot hook for the others).  The new character is a Ninja2 / Fighter2 / Chainmaster1. with a blooded template.(by the way, about two third of the build is the same as my girlfriends´) He assures me that the character isn't that strong. That the Ninja is only there for the skills.  Today, he went invisible, crept behind three bowmen and killed them all by Attacks of Opportunity when they fired. (without breaking invisibility, because ghost step is weirdly worded...)  The encounter was laughingly easy, because he had an ability I didn't know worked that way. I feel tricked, because he told me that the Ninja's ghost step wasn't a big deal, yet obviously planned to use it exactly as he did. How should I react.  I want to mention that I do not resent good feat combinations in any way. I just do not like the nasty surprise.  Problems with the Person  He's, theoretically, a nice guy. He knows the rules far better than me. But he is so desperately squeezing for advantages. Every enemy he strikes at is flat-footed for some reason. An enemy fumbles an attack, losing his weapon: he does not say a word. He fumbles: bloody murder on how losing weapon on fumbles favors the critters. He advises me to nerf the abilities of the other players and nags about it. He doesn't tell me how good his abilities are.  And on the social side: I played the first session without him, Girlfriend shy but active. Since: Whenever I ask her something, he gives advice. Girlfriend doesn't say anything anymore. He bogs the game down with lots of rule lawyering. He is loud.  He really challenges my motivation.  I mean, he is loud and uncaring all the time, but D&D seems to pull out his very worst.  He sure doesn't mean to be. He just does not seem to perceive when he is behaving badly.  I do not want to start an argument (he starts blocking completely) and I´d rather not have to "forget" telling him when we play. I´d really appreciate advice on how to resolve this problem.


The question is this:      Let $f:\mathbb C[x,y]\rightarrow\mathbb C[t]$ be the homomorphism that sends $x\mapsto t+1$ and $y\mapsto t^3-1.$ Determine the kernel $K$ of $f$, and prove that every ideal $I$ of $\mathbb C[x,y]$ that contains $K$ can be generated by two elements.   Solution:  I have shown that $((x-1)^3-y-1)=K.$ However, I am having trouble showing the second part. Any hints??


prove inequality through mean value theorem

I want to prove that if $x$ is a real number and $x>-1$, $$\sqrt{1+x}  \leq 1+\dfrac{x}{2}$$ I'm not sure which one should I choose for $f(x)$. I also don't understand why we need the mean value theorem to prove this.


I have the following java code to read a CSV file and store the values in an ArrayList().          try {         File file =new File("Data.csv");         BufferedReader br=new BufferedReader(new FileReader(file));         while(br.readLine() != null){             String input=br.readLine();             input=input.replace('"', '\0');             datam.add(input.split(",|\\s|;"));         }     } catch (FileNotFoundException e) {         // TODO Auto-generated catch block         System.out.println("Exception");         e.printStackTrace();     }   But i am getting the exception at the following lines  String input=br.readLine();             input=input.replace('"', '\0');             datam.add(input.split(",|\\s|;"));   I am finding no error in the code. I am using the Arraylist for populating a JTable. The exception message is the following:  java.lang.NullPointerException at com.cs319.MyTable.<init>(Lab2Swing.java:366) at com.cs319.Lab2Swing.createPanel3(Lab2Swing.java:190) at com.cs319.Lab2Swing.<init>(Lab2Swing.java:103) at com.cs319.Lab2Swing$1.run(Lab2Swing.java:75) at java.awt.event.InvocationEvent.dispatch(Unknown Source) at java.awt.EventQueue.dispatchEventImpl(Unknown Source) at java.awt.EventQueue.access$400(Unknown Source) at java.awt.EventQueue$3.run(Unknown Source) at java.awt.EventQueue$3.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at java.security.ProtectionDomain$1.doIntersectionPrivilege(Unknown Source) at java.awt.EventQueue.dispatchEvent(Unknown Source) at java.awt.EventDispatchThread.pumpOneEventForFilters(Unknown Source) at java.awt.EventDispatchThread.pumpEventsForFilter(Unknown Source) at java.awt.EventDispatchThread.pumpEventsForHierarchy(Unknown Source) at java.awt.EventDispatchThread.pumpEvents(Unknown Source) at java.awt.EventDispatchThread.pumpEvents(Unknown Source) at java.awt.EventDispatchThread.run(Unknown Source)


Why is re-upvoting not allowed for comments?

If I remove my upvote on a comment, then after some time try to re-upvote the same comment, I won't be allowed to. I don't get why we can't re-upvote a comment after we upvote it then revoke our vote. Why is that?


According to Wikipedia:     A Hilbert space is separable if and only if it admits a countable orthonormal basis   While this statement seems very reasonable, it is not clear to me how one would go about proving it.


How do I detect what .NET Framework versions and service packs are installed?

A similar question was asked , but it was specific to .NET 3.5. Specifically, I'm looking for the following:   What is the correct way to determine which .NET Framework versions and service packs are installed? Is there a list of registry keys that can be used? Are there any dependencies between Framework versions?


Prove that the iteration of $\sin(x)$ goes to zero as $n$ goes to $\infty$

Basically let $S(x)=\sin(x)$ such that $S^2(x)=\sin(\sin(x))$ and $S^3(x)=\sin(\sin(\sin(x)))$ and so on until $S^n(x)=\sin(\sin(\ldots\sin(x)\ldots))$  Prove that $S^n(x)\rightarrow 0$ as $n\rightarrow\infty$


I've been having issues with tikz, it's simply not outputting anything onto the page, I tried with circuitikz and default tikz examples off the internet, to no avail.  I then tried pdflatex (which I didn't know I had on linux mint) and it worked flawlessly, but that is not the default when I just type latex, it uses texlive.  I don't know if I want to change over to pdflatex (what are the disadvantages?) or how to change the default (I want to keep typing latex, not pdflatex).  Is it a known issue with texlive? IS there any way to fix it?  edit:  Here is a basic example that I took right off of the Tikz site, the exact one that would only work with pdflatex.  % A simple Tree % Author: Stefan Kottwitz % https://www.packtpub.com/hardware-and-creative/latex-cookbook \documentclass[border=10pt]{standalone}   \usepackage{tikz} \begin{document} \begin{tikzpicture}[sibling distance=10em,   every node/.style = {shape=rectangle, rounded corners,     draw, align=center,     top color=white, bottom color=blue!20}]]   \node {Formulas}     child { node {single-line} }     child { node {multi-line}       child { node {aligned at}         child { node {relation sign} }         child { node {several places} }         child { node {center} } }       child { node {first left,\\centered,\\last right} } }; \end{tikzpicture} \end{document}   Could it just be that dvi format doesn't like the images?


Is there a subtle difference between "somebody" and "someone", "anybody" and "anyone"?

Are there any subtle differences between "somebody" and "someone", or can they be used completely interchangeably? Similarly, can you imagine a situation in which you would prefer "anybody" to "anyone" or vice versa?


Starter's book on Quantum Mechanics (more general and simple books than full QM textbooks)

This question is a little different from other questions referring to books on QM. I ask you to tell me some books that have QM on a simpler level than that of a full course on QM. Some universities advice students to buy a book that has generally most of undergraduate material but on a simple level (like Young's or Serways' books University physics). They cover modern physics on a simpler level and help students on the courses "fundamentals of physics". After that semester,students take courses on each subject and delve into them in a more deep manner with more advanced textbooks. I am not asking you to tell me the advanced books (like Griffith's or Dirac's books on QM) but tell me about some simpler books that have QM (and Special relativity if possible). I ask this because some friends of mine advised me to tackle QM on a more simple manner with simpler mathematics to get the grips on the intuition behind it first, and then go to the full understanding with more advanced textbooks.


Could two different bases of a Hilbert space have different cardinality?

Here is a quote from  (accessed: Nov. 22, 2013) :      As a consequence of Zorn's lemma, every Hilbert space admits an orthonormal basis; furthermore, any two orthonormal bases of the same space have the same cardinality, called the Hilbert dimension of the space.   But it seems to me that for a lot of quantum systems this is not so. For example, the one dimensional harmonic oscillator has a countable basis of energy eigenstates but an uncountable basis of position eigenstates (whose wave functions are delta functions).   So where am I wrong? I assume the answer has to do with the fact that delta functions are not actually part of the Hilbert space. Is that it?


I was hoping to hear some great tips on how to get clients. The obvious is having great photos but I want to go further into the marketing side. I've also already created a referral program, now I'm just waiting. I don't want to just wait though, I want to keep going and reach out.  One example being finding engaged couples or expecting mothers on Instagram. How do you reach out to personal accounts on instagram? How do you FIND them? Hashtag examples?  How do you reach out to your facebook friends without sounding desperate? I don't think many people see my posts offering services. I want to reach out to my friends asking if they are in need of any photos.  If you have any other ideas, I would love to know!


How to get File object to folder where from main class was loaded?

package ru.reflection; public class ReflectionTool {     public static void main(String[] args) throws IOException {      } }   I am working in Intellij IDEA. The main class is located in path_to_my_project/out/production/ru/reflection/Reflection.class  How can I get File object for folder where from Reflection.class was loaded -  path_to_my_project/out/production/ru/reflection/ ?


Copy a same audio file multiple time in another audio file

I have an audio file on my Linux system. Let's say a 2 second .wav  file. I want to copy the same audio file 50 times into a new b.wav such that the duration of b.wav will be 100 seconds. I tried like this: for i in {1..50}; do cat a.wav >> b.wav; done   But it's not working. Please suggest a solution.


I am trying to insert a function in my VBA code to only fill a cell when another cell has data in it

This is my code. It fills the Date when I have this  =Updating_Date(B5) typed in C5. What it is supposed to do is fill the Date ONLY when data is present in B5, and remove the Date when No data is present. Currently it displays Date no matter what. I need to write in a condition to make it ONLY display Date when data is present in Column B.     Below is what I have typed into a module, thanks to another user, with =Updating_Date(B5) entered in C5.  Function Updating_Date(dependent_cell as Range) As Date   Updating_Date = Date End Function  Again, this displays the Date no matter if data is in column B or not.   Thanks.


Unusual Accented Letter: umlaut + accent

This is the letter I'm trying to reproduce: ǘ  There's an umlaut and, on top, an acute accent. I can do one or the other but not both.  Any suggestion?


Can someone explain to me whether an efficient estimator can be biased? What I've read so far seems to be always about efficiency being a property being alluded to unbiased estimators but I was thinking that a biased estimator with smaller variance can thus be efficient. I am unsure if my main question has a single definitive answer.


Make tag selection more seamless and less error-prone on Android app

This question was posted using the Android App.  When posting questions using the Android application, tag selection can be a little tricky & error-prone.  The web application provides an autocompletion list of suggestions as you type, but no such list appears in the Android app. It would be very useful if similar functionality could be implemented there.  Also it appears that entering a new tag is friction-free, as might happen when fat fingering a tag. As a demonstration I have tagged this question with a false tag.  It should not be this easy to create a new tag, as I would guess the majority of these cases would be mistakes.


How to get a construction paper look in photoshop or illustrator

I am looking to create some graphics or logos that look and feel very much like that thicker colored construction paper in photoshop or illustrator cs6  Example here:   and here :   Any thoughts here?


Simulated "and" statement in grep that is not order specific

I am trying to use a simulated "and" statement with egrep. Currently I have   egrep -i 'name.*policy'  which works only if the order of appearance is true. Alternatively, I can egrep -i 'name.*policy|policy.*name' . I want to see if there is a better way to use an "and statement that is not order specific.


Matrix inversion in the smoothing splines

The question is about the matrix inversion in the smoothing splines.  Given observations (y1, x1), ..., (yn, xn) and a choice of $\lambda \ge 0$, the smoothing spline estimator, $\hat{f}_{\lambda}$ is defined by $$ \hat{f}_{\lambda} = argmin~\sum_{i=1}^{n}(y_i - f(x_i))^2 + \lambda \int f''(t)^2 dt $$ It is well-known that the solution to the above optimization problem is a natural cubic spline with knots at the unique values of x.  Given the natural spline basis functions {$h_1, ..., h_n$}, we have $f(x) = \sum_{i=1}^{n}h_j(x)\theta_j$ and $H_{n \times n} = {h_j(x_i)}_{i,j=1}^n$. Solving the $\hat{f}_{\lambda}$ is equivalent to solve the problem $$ argmin_{\theta \in R^n} ||y - H\theta||_2^2 + \lambda \theta^T\Omega\theta, $$ where the penalty matrix $\Omega$ has entries $\Omega_{jk} = \int h_j''(x)h_k''(x)dx$.   This is a generalized Ridge regression problem, and the solution is $$ \hat{\theta} = (H^TH + \lambda \Omega)^{-1}H^TY $$  Suppose I use the natural cubic spline to compute $H$ and $\Omega$. When I put knots at each distinct x values, what to do if $H^TH + \lambda \Omega$ is singular?  Note this is different from another question in another poster. In that question it did not address the placement of knots issue.


So, as I said I have a VPS, Raspberry Pi and a plan, but I am in need of some advice, so here goes.   I have a VPS with prgmr.com which I ahve up and running nice and smoothly without any issues.  I also have a new RaspberryPi sat on my desk, with Raspberrian downloading as I type.  My plan is to use the Raspberry Pi as a backup server at home, so my question is this:  How would you go about backing up a remote Ubuntu VPS via SSH?  The VPS is setup as a web server, but I would like to set up a cron job on the Pi so that it can automatically login to the VPS and run then download a backup, just incase I manage to brick the thing or something else happens that results in me losing data.  Naturally I want this backup to contain everything so I can quickly restore the whole server, all nicely configured as it is now if things go bad.    How would you go about running this sort of backup?  I figured that I would have to write some kind of bash script to SSH in, compress all the relevant files into a tar.gz or similar and the download the images vis SCP.    What are your thoughts on this?  What packages etc would you use, and how would you configure it?  The VPS has a LAMP stack on, so what files would you aim to backup?  It also has lots of other smaller programs such as GIT, and ZendTools installed.


OpenSUSE installed alongside Windows 10 doesn't boot after installing Ubuntu

I installed openSUSE Tumbleweed on my HP probook in dual boot with Windows 10. Then, I noticed some bugs in openSUSE and decided to try Ubuntu 18.04. But after I installed Ubuntu the openSUSE didn't show up in the boot options any more.  I searched for help and found out that I should run some sudo grub-something (don't remember what) and the grub.cfg was rebuilt and then openSUSE started appearing in the GRUB menu on boot. But when I choose openSUSE in that menu I get an error saying   cannot find vmlinuz-5.1.4... Need to load kernel first   I tried searching everywhere but have no luck, so I'm here to get a little help. If you need more details, please, let me know.  EDIT:  I don't know if openSUSE is sharing /boot with Ubuntu.  This is the output of lsblk -o name,fstype,size,label,mountpoint  NAME   FSTYPE     SIZE LABEL MOUNTPOINT loop0  squashfs 140,7M       /snap/gnome-3-26-1604/74 loop1  squashfs    13M       /snap/gnome-characters/139 loop2  squashfs  14,5M       /snap/gnome-logs/45 loop3  squashfs   8,4M       /snap/canonical-livepatch/77 loop4  squashfs  34,6M       /snap/gtk-common-themes/818 loop5  squashfs   2,3M       /snap/gnome-calculator/260 loop6  squashfs    91M       /snap/core/6350 loop7  squashfs   3,7M       /snap/gnome-system-monitor/57 sda             298,1G        ├─sda1 ntfs       500M        ├─sda2 ntfs     242,1G        ├─sda3              1K        ├─sda4 btrfs       35G        ├─sda5 swap       3,8G        └─sda6 ext4      16,2G       / sr0              1024M


Can the definition of continuity be said both of these ways?

So if the definition of continuity is: $\forall$ $\epsilon \gt 0$ $\exists$ $\delta \gt 0:|x-t|\lt \delta \implies |f(x)-f(t)|\lt \epsilon$. However, I get confused when I think of it this way because it's first talking about the $\epsilon$ and then it talks of the $\delta$ condition. Would it be equivalent to say: $\forall$ $\delta \gt 0$ $\exists$ $\epsilon \gt0$ $:|x-t|\lt \delta \implies|f(x)-f(t)|\lt \epsilon$. I guess what I'm asking is whether there is a certain order proofs or more formal statements need to follow. I know I only changed the place where I said there is a $\delta$ but is that permissable in a "formal" way of writing?


I don't like Hell, can I go somewhere else?

I just opened a nether portal for the first time, and I must say, it's not a very good location, a sort of narrow trench/cavern thingy without any obvious clues as to which direction is "out".  I'm not willing to simply move my overworld portal (due to dilation it is unlikely to have much of an effect, anyway), and was wondering if there was a way to force minecraft to generate a new personal Hell for me to explore (hopefully one that doesn't involve me stuck in some wall!).


Measure The speed write to variable between regluar one and volatile

I want to make a test, what is more efficient write to a regular variable or write to volatile variable. I wrote this code for the test  private int v1= 42; private volatile int v2 = 43;  public void measure(){    long startRegular = System.nanoTime();    v1++;    long endRegular= System.nanoTime();    v2++;    long endVoltaile = System.nanoTime();    long rt = endRegular - startRegular;    long vt = endVoltaile - endRegular;    System.out.println("regular time : " + rt + " voltaile time " + vt); }   The output from this program is diffrenet result for every run. Is this a valid test? or there is a better way to test it?


Prove without induction that $3^{4n}-2^{4n}$ is divisible by $65$

My brother asked me this (for some reason).  My solution is:  $(3^{4n}-2^{4n})\bmod{65}=$  $(81^{n}-16^{n})\bmod{65}=$  $((81\bmod{65})^{n}-16^{n})\bmod{65}=$  $(16^{n}-16^{n})\bmod{65}=$  $0\bmod{65}$    I think that this solution is mathematically flawless (please let me know if you think otherwise).  But I'm wondering if there's another way, perhaps with the binomial expansion of $(81-16)^{n}$.  In other words, something like:  $3^{4n}-2^{4n}=$  $81^{n}-16^{n}=$  $(81-16)^{n}+65k=$  $65^{n}+65k=$  $65(65^{n-1}+k)$  How would I go from "$81^{n}-16^{n}$" to "$(81-16)^{n}+65k$"?


Python use virtualenv to prevent library version conflicts. How ruby does it?

As title, python use virtualenv to isolate pip libraries for each python application. Ruby has gem, how does it prevent library version conflicts without a virtual environment.


Prove that there is unique group of order 35 up to isomorphism

I have shown that any group of order 35 is cyclic. I don't know what to do next.  EDIT: I am not asking how to show that any group of order 35 is cyclic, just trying to show that that implies its unique


Excluding the mustache villian, what was the first movie to have a person tied to a train track? Did the movie scene come from a book?


Reset footnote counter by section with footmisc

I would like to reset my footnote counter for every section in my article, and I am using the footmisc package. I have seen the perpage option, and similarly there are questions on how to achieve this for chapters, but I would like the equivalent for sections, and am struggling to find an applicable solution.  Currently my preamble includes (among other things):  \documentclass[12pt, a4paper, twoside]{article} \usepackage[bottom]{footmisc}   Similar questions:


Please see my   I want the green middle div to fill the remaining space of the wrapper div no matter how much content it has.  If it matters I'm including bootstrap too.


Combine Cycles passes in way compatible with photoshop

I'm trying to take my Cycles render passes into photoshop and combine them there. The purpose of this is to be able to manipulate the passes individually with various photoshop tools. However, photoshop does not support the way that Cycles passes are usually combined.  Normally, you have ((Diffuse Direct + Diffuse Indirect) * Diffuse Color) + ((Gloss Direct + Indirect) * Gloss Color). However, Photoshop does not have the Add blend mode.  So to do this, I need a different way to combine passes that does not rely on the Add blend mode. Is there another way that will be reasonably accurate?


How to show the that a set $A$ nowhere dense is equivalent to the complement of $A$ containing a dense open set?

I was reading a textbook and saw an alternative formulation of nowhere dense. I am not sure how to prove this alternate formulation below:  The Normal Nowhere Dense Statement:  Let $X$ be a metric space. A subset $A ⊆ X$ is called nowhere dense in $X$ if the interior of the closure of $A$ is empty, i.e. $(\overline{A})^{\circ} = ∅$. Otherwise put, $A$ is nowhere dense iﬀ it is contained in a closed set with empty interior.   Alternate Formulation:  "Passing to complements, we can say equivalently that $A$ is nowhere dense iﬀ its complement contains a dense open set."  Does anyone know how I can prove this? It seems rather painfully straightforward but I am not sure how to show it exactly. Thank you!


Find a first order sentence satisfied by models with square domain.

(c) Let $\mathcal{L}^*\subseteq\mathcal{L}^{\text{FOPC}}$ be a first order language of predicate calculus consisting of three unary function symbols $f,g,h$.  (i) Write down an $\mathcal{L}^*$-sentence $\phi$ such if $\mathcal{A}$ is an $\mathcal{L}^*$-structure with $\mathcal{A}\vDash\phi$ then the restriction of $h_\mathcal{A}$ to the range of $f_\mathcal{A}$ gives a one-to-one function onto the range of $g_\mathcal{A}$.  (ii) Write down an $\mathcal{L}^*$-sentence $\psi$ such that if $\mathcal{A}$ is an $\mathcal{L}^*$-structure with $\mathcal{A}\vDash\psi$ and the domain $A$ of $\mathcal{A}$ is finite then the cardinality $|A|$ is a square.    Part (i) is easy enough, but I'm having trouble with part (ii). I assume that you can use part (i). My initial idea was to use $h$ to ensure $|Range(f_A)| =|Range(g_A)|$ but I'm not sure where to go from there. Thanks.


lstlisting label with wrong counting across sections

All my listings labels appear with prefix 1. in all sections, such as the following example, where the second listing of my paper in section 2 appears with the prefix 1. rather than 2.  I have already realized that \maketitle is the root of this behavior. If I remove \maketitle the labels appear correctly with 1 and 2, rather than 1.1 and 1.2.   How can we keep consistent numbering with the following llncs template:  \documentclass[runningheads]{llncs}  \usepackage{listings}  \begin{document}  \title{PetClinic Sample}  \maketitle  \section{Intro} \label{sec:alternatives}  We will use the PetClinic Spring~\ref{lst:input}  \begin{lstlisting}[language={HTML}, caption={Button}, label={lst:button} ]     <button></button> \end{lstlisting}  \section{Idioms}  \begin{lstlisting}[language={HTML},caption={Input},label={lst:input}]     <input> \end{lstlisting}   \end{document}


I am working with Regex that does not match properly:  Regex.Match("\u0002\u0002BURDETTE\u0002ST\u0002\u0002\u00022115\u0004^CONESTOGA MAGNET ELEM SCH^^^ ", @"\u0002([\w\s\u0000\u0001\u0002\u0003\u0004/.,:&-]+)^([\w\s^/.,:&-]+)")   I have no problems matching separate parts of regex:   Regex.Match("\u0002\u0002BURDETTE\u0002ST\u0002\u0002\u00022115\u0004^CONESTOGA MAGNET ELEM SCH^^^ ", @"\u0002([\w\s\u0000\u0001\u0002\u0003\u0004/.,:&-]+)")     Matches: {BURDETTEST2115}  Regex.Match("^CONESTOGA MAGNET ELEM SCH^^^ ", @"^([\w\s^/.,:&-]+)")   Matches:{^CONESTOGA MAGNET ELEM SCH^^^ }


# of partitions of $n$ into at most $r$ positive integers $=$ # of partitions of $n + r$ into exactly $r$ positive integers?

How do I see that the number of partitions of the integer $n$ into at most $r$ positive integers is equal to the number of partitions of $n + r$ into exactly $r$ positive integers?


Non trivial valuation over a finite extension $F/\mathbb{Q}_p$ is equivalent to the one induced by $v_p$

I'm stuck on a question in an exercise on p-adic numbers. Actually, let $p$ a prime number, $F/\mathbb{Q}_p$ a finite extension of fields, $\mathcal{O}$ the integral closure of $\mathbb{Z}_p$ on $F$, $\mathfrak{p}$ the maximal ideal of $\mathcal{O}$.   We have already shown that : $\forall l \in \mathbb{N}_{\geq 2}$, $\gcd(l,p)=1 \;\forall x \in \mathfrak{p} \; \exists y \in \mathcal{O} \quad y^l=1+x$, using Hensel's lemma.    Now, the next question is :      Deduce from this that for any non trivial valuation $w$ on $F$, if we are   noting $\mathcal{O}_w$ its valuation ring, we have  : $\mathcal{O} \subset O_w$.   (We know as well that if we are noting : $v(x) = v_p(N_{F/\mathbb{Q}_p}(x))$, then $\mathcal{O} = \{ x \in F \; | \; v(x) \geq 0\}$)  To do this, I thought to show that $\mathbb{Z}_p \subset O_w$, as $O_w$ is integrally closed on $F$, we would have $\mathcal{O} \subset O_w$.  Now, if $x \in \mathbb{Z}_p$, $x = \frac{a}{b}$, where $\gcd(p,b)=1, \gcd(a,b)=1$. We also know that the restriction to $\mathbb{Q}$ of $|.|_w$ (which is the n.a absolute value corresponding to the valuation) is either trivial or $|.|_q$ for a prime $q$, by Ostrowski's theorem. So : $w(x) = w(\frac{a}{b}) = w(a)-w(b)$. If $w$ is trivial over $\mathbb{Q}$, $w(x) = 0$ and we have the result. Otherwise, $w(x) = v_q(a) - v_q(b)$. But then I'm stuck, cause actually the result I have to prove indicates that $q=p$, but there is no way (I found) from here to conclude this (and it's actually quite normal, cause this is what implies the next question).  So, anyone could help me, please ?  Thank you !


all,  I have found that the same Makefile works well in Mac OS X, but does not work in Ubuntu. The snippet is as following:  start:     @echo $(seperator)     @if [[ "$(PROJECT)" == "" ]]; then \          echo " Project powered by CodeMate!"; \      else \          echo "  $(PROJECT)"; \      fi     @echo $(seperator)   and make complains:  /bin/sh: [[: not found   Any idea?  Cheers,  Li    Updates:  I have changed the above conditional Bash statements to:  if test "$(PROJECT)" = ""; then \   then things work fine. So what is wrong with "[["?


I built a site for a company a couple of months ago to bring it up to date: Proper coding, SEO, the works. Their old site was poorly compiled HTML*  Apparently, they used a service through a company that I'm assuming added back-links all over the place and likely some black hat SEO practices.  The site has been #1 for their target search term but now it's at the bottom of page 1.  Any ideas why the sudden drop? I'm even doing SEM through google, and that's where it's dropped.


Junior professorship (W1) in Germany without full German proficiency

I am a Computer Science PhD student aiming for an Academic career. One of the options I am considering after I receive the degree is to apply for a W1 professor position in Germany (Junior professor).   My question is very specific to Germany. Is there a chance I can become a Junior professor without being fluent in German? Most of the job postings I come across are actually written in German. Some of them do not mention German knowledge as a requirement, but it could be that it goes without saying.   I know that many courses, particularly in master programs, are taught in English. So I am sure there is a capacity to teach in English. But I am wondering if there is a culture of preferring and only accepting German speakers. Because if that's the case, I should start putting back up options.   Obviously I could work on my German. But my question is assuming I did not reach the required level of German until the time I start applying for Junior professorship.


How do I unlock the Dream Suite in Animal Crossing New Leaf?


Feynman's question on the mathematical machinery underlying nature

Physicist Richard Feynman said in his lectures     "It always bothers me that according to the laws as we understand them   today, it takes a computing machine an infinite number of logical   operations to figure out what goes on in no matter how tiny a region   of space, and no matter how tiny a region of time. How can all that be   going on in that tiny space? Why should it take an infinite amount of   logic to figure out what one tiny piece of space/time is going to do?   So I have often made the hypothesis ultimately physics will not   require a mathematical statement, that in the end the machinery will   be revealed and the laws will turn out to be simple, like the chequer   board with all its apparent complexities. But this is just   speculation." (The Character of Physical Law - Ch. 2)   what does he mean by "in the end, the machinery will be revealed and the laws will turn out to be simple". what machinery is he referring to? Is he asking for example what machinery "solves" the endless mathematics? or perhaps how the mathematics unfolds seemingly by itself.  also, these were given in 1965. have we come anywhere closer to answering his question since then?


How do I know what cards or sets are legal to play with?

Can I mix older Magic the Gathering cards with cards from Magic 2015? If I have mainly Magic 2015 cards can I play my friends who mainly have older decks?


OS X Mavericks: InstallESD.dmg and BaseSystem.dmg

I would like to make a bootable DMG or ISO file with OS X Mavericks on it. I want to then burn this file to a DVD-ROM (or, alternatively, make a bootable USB stick with it).  From what I've read, however, the file     /Applications/Install\ OS\ X\   Mavericks.app/Contents/SharedSupport/InstallESD.dmg   is not bootable. From what I understand, to make it bootable one needs to insert a file called BaseSystem.dmg inside InstallESD.dmg and then burn the resulting DMG (perhaps after converting it to an ISO 9660 file, although I'm not sure whether this is necessary) to a DVD-ROM drive.  Here is what I'd like to know:   What exactly is BaseSystem.dmg? Is this file the same on all OS X systems? Will any version of this file from any OS X system do just as well? Do I need to use Disk Utility to add this file to InstallESD.dmg or can I use the command line? What is the procedure in each case? I am not root on the system. Can I accomplish this without a root password? I've heard the root password is only needed for setting file permissions. Can I get away with this, copy BaseSystem.dmg, and do the rest of the work requiring root privileges on Linux after mounting the USB key with all files on Linux?   Thanks.


I came across a question from Real Analysis. Here's the question. "Let $C$ be a subset of a compact metric space $(X, d)$. Assume that for every continuous function $h : X\to \mathbb{R}$, the restriction of $h$ to $C $attains a maximum on $C$. Prove that $C$ is compact." Questions seems straight forward that I need to somehow prove C is closed but I am stuck as how can I proceed. Any direction would be helpful?


'while read' loop through lines in text file losing characters in Bash script. is FFmpeg line to blame?

I am looping through a text file, using 'while read'. I read three variables from each line - two filenames and a decimal number. I know that this works in a vanilla setup (loop, read line, echo line, extract variables, nothing else), because I have tested it on my input file.  I am getting an odd result, though, once I add in the meat of my routine - which is a call to ffmpeg to merge the audio and video streams represented by the filenames. Successive 'read' operations omit leading characters from the line. I read  that calls for 'read' input within a 'while read' loop can cause problems, and wonder if the ffmpeg call is doing something that confuses bash, but this seems unlikely and bizarre! NB: I don't really understand the ffmpeg call - I got it from an answer to another question.  Any help would be appreciated!  The first 'read' works as expected (and the ffmpeg command completes):  LINE  1 vidsNeedingSound/448£generic@06_10_16-09_30_47.mp4 soundToAdd/448£generic@06_10_16-12_11_54.wav 6.988354 V: vidsNeedingSound/448£generic@06_10_16-09_30_47.mp4   A: soundToAdd/448£generic@06_10_16-12_11_54.wav   D: 6.988354   The second 'read' loses 36 characters from the beginning of the line (and the ffmpeg command fails because the file represented by the variable V which takes the first item of the line doesn't point at a file):  LINE  2 6-09_30_47.mp4 soundToAdd/452£generic@06_10_16-12_11_54.wav 9.64663 V: 6-09_30_47.mp4   A: soundToAdd/452...   The third 'read' works as expected (and the ffmpeg command completes):  LINE  3 vidsNeedingSound/452£left@06_10_16-09_30_47.mp4 soundToAdd/452£left@06_10_16-12_11_54.wav 9.862118 V: vidsNeedingSound/452£left@06_10_16-09_30_47.mp4   A: soundToAdd/452...   The fourth 'read' loses 37 character (one more than the last fail) from the beginning of the line (and the ffmpeg command fails):  LINE  4 09_30_47.mp4 soundToAdd/452£right@06_10_16-12_11_54.wav 9.431392 V: 09_30_47.mp4   A: soundToAdd/452....   That's the pattern. When not preceded by a successful call to ffmpeg, the 'read' works as expected. After each successive successful ffmpeg call, characters are omitted from the beginning of the line: 36 characters to begin with, then 37, 38, 39...  The clincher is that when ffmpeg fails after a 'successful' read (due to another problem), the following 'read' works as expected.  CONCLUSION: a successful ffmpeg call results in a read fail on the next iteration through the loop.  Why does this happen, and how can I stop it?  Here's my code: ...  # Loop through lines in the merge file IT_COUNT=1 while read MERGE_LINE                do              echo "LINE " $IT_COUNT     ((IT_COUNT+=1))     echo $MERGE_LINE   # testing use     read VID_FILE AUD_FILE DURATION <<< "$MERGE_LINE" # Get the data from each line     echo "V: $VID_FILE   A: $AUD_FILE   D: $DURATION"         # testing use ....     # add audio to video     ffmpeg -i $VID_FILE -i $AUD_FILE -filter_complex "aevalsrc=0:d=$AUD_SHIFT[s1];[s1][1:a]concat=n=2:v=0:a=1[aout]" -c:v copy -map 0:v -map [aout] $FILE_OUT -hide_banner  done <$MERGE_FILE     Thanks for looking!


Prove universal morphism is unique up to unique isomorphism.

I'm following along Wikipedia page() on universal property, and this seems it should be trivial, but I couldn't finish the proof.  The definition I am working with:   The problem   So I want to prove that if $(A, u)$ and $(A', u')$ are universal morphism from $X$ to $F$, then there exists unique isomorphism $k: A \rightarrow A'$ such that $u' = F(k) \circ u$.   My attempt:   For any $B \in C$ and $f: X \rightarrow F(B)$, there exists unique $h: A \rightarrow B$ such that $f = h \circ u$.  Letting $B = A'$ and $f = u'$, we see that there exists unique $k: A \rightarrow A'$ such that $Fk \circ u = u'$.  This shows existence and uniqueness. We only need that $k$ is isomorphism, but this is the part I cannot prove.   Similarly, there exists unique $k': A' \rightarrow A$ such that $Fk' \circ u' = u$.  Plugging into each equation, we get  $$Fk \circ Fk' \circ u' = F(k \circ k') \circ u' = u'$$  $$Fk' \circ Fk \circ u = F(k' \circ k) \circ u = u$$  but this of course doesn't imply $F(k \circ k') = id$, so it seems useless.   Thanks for your help!


How to launch the onscreen Accessibility Keyboard with a keyboard shortcut too?

With ctrl + cmd + space, macOS launches Emojis & Symbols, also know as the Character Viewer.  Is there a shortcut to launch the Keyboard Viewer?


Upgrade manager wants me to do a partial upgrade

So here is my story...  I was doing upgrades to ubuntu the other day, and the power went out right in the middle of the upgrade, so now when I try to do upgrades it keeps asking me if I want to do a partial upgrade. I have heard this is bad and should be avoided, I also know there is a way to fix this via the command line, but I can't remember how, nor can I find anything on the internet.  Any help would be appreciated. Thanks


I have some bullets that simply have an always sensor and motion, but since I have gravity on, they fall in a weird way. They do not fall and hit the ground on the tip of the bullet, but rather hit the ground in the exact position they had when they were fired, sleeping. How do I have the bullet tilt as it falls, and possibly have it hit the ground on it's tip?


How to fit exponential y=A(1-exp(B*X)) function to a given data set? Especially how to determine the initial start parameters?

I have a data set in which $y$ is roughly related to $\log(x)$. Now I wish to fit the curve $$y=A(1-\exp(BX))$$  When I use R and the nls2 function, then I encounter the error SINGULAR MATRIX at initial parameters.     I have tried to use a model with the $a$ parameter fixed, in which case it works fine   model2<-nls2(ynew~1000*(1-exp(bx)),data=sData,start = list(b=0.08),trace = TRUE,control = list(maxiter=1000))   But when I have both $a$ and $b$ as free parameters then I get the error  model1<-nls2(ynew~A*(1-exp(bx)),data=sData,start = list(A=10,b=0.08),trace = TRUE,control = list(maxiter=1000))    Some similar issue is explained in this thread  where they suggest to:   linearize to get better starting values in addition use the plinear method   How can I linearize my function? I can not rewrite into a linear function by taking the logarithm.   Below is an image of my function/data. I will try to post the subset of the data


How do I reset another user’s password on Windows 10?

I’m troubleshooting a standard user’s account. She has forgot her password and I’m trying to change the password but there’s no options   My method was   Home > Control Panel > User Accounts > User Accounts (Change account type) > person’s name Account > Change account password  But Change account password is not available. Is there any other way to change the person’s password that I’m troubleshooting in order to get her stuff back?


I have 2 projects in one solution in Visual Studio, one in C++ talking to some hardware, one in C#, building a GUI and such.  In my .cpp I have some functions that work:  namespace ISCOPumpLibrary {     char data[512];      bool ISCOPump::Connect(char unit, int com, long baud) {         commport = com;         speed = baud;         unitnum = unit;          connected = commOpen(commport, speed);         return connected;     }      bool ISCOPump::GetInfo() {         char in[512], out[512];          in[0] = 'G';          Execute(in, out);         strcpy_s(data, out);          return true;     }   With a .h file like:  namespace ISCOPumpLibrary {     public ref class ISCOPump     {     public:          static bool Connect(char unit, int com, long baud);         static bool GetInfo();   These are called in the C# program as follows:  private void Button_GetInfo_Click(object sender, EventArgs e) {      bool connected = ISCOPumpLibrary.ISCOPump.Connect(7, 7, 19200);     bool info = ISCOPumpLibrary.ISCOPump.GetInfo();      //label_serial.Text += "\r\n" + info; }   This all seems to work. The problem I'm having is I cannot seem to find a way that actually works to return the char data[512] or char out[512]  I've looked through a bunch of answers but can't find one that looks similar to my case, most seem to be calling these things a little differently.  I've tried using std::string or having an argument of char*, and haven't had any luck getting C# to like either of those.  Any ideas on how I should get this to work?  Solution header:  namespace ISCOPumpLibrary {      using namespace System::Runtime::InteropServices;     using namespace System;      public ref class ISCOPump     {     public:         // ISCO Implemented functions.          //returns success bool         static bool Connect(char unit, int com, long baud);          //returns string of info         static bool GetInfo([Out]String^ %c);   cpp:  namespace ISCOPumpLibrary {     bool ISCOPump::Connect(char unit, int com, long baud) {         commport = com;         speed = baud;         unitnum = unit;          connected = commOpen(commport, speed);         return connected;     }      bool ISCOPump::GetInfo([Out]String^ %c) {         char in[512], out[512];          in[0] = 'G';          Execute(in, out);          c = gcnew String(out);          return true;     }   cs:      private void Button_Connect_Click(object sender, EventArgs e)     {          bool connected = ISCOPumpLibrary.ISCOPump.Connect(7, 7, 19200);          ISCOPumpLibrary.ISCOPump.GetInfo(out string data);          label_serial.Text += "\r\n" + data;     }   Note one of the key details was that the using namespace system calls in the header had to be within the class to prevent all sorts of conflicts.


How can I disable transmission-daemon autostart

I tried rcconf and update-rc.d but transmission-daemon starting each time i boot the system.


For any integer a, a$^{37}$ $\equiv$ a (mod 1729)

I was hoping someone could review my proof, thanks!   Question: For any integer $a$, $a$$^{37}$ $\equiv$ $a$ (mod 1729)   Proof:   Note first that 1729 = 7 * 13 * 19.   Then we have $a$$^{37}$ $\equiv$ $a$ mod 1729 if and only if the following set of equations all hold true for $a$:   $a$$^{37}$ $\equiv$ $a$ mod 7   $a$$^{37}$ $\equiv$ $a$ mod 13   $a$$^{37}$ $\equiv$ $a$ mod 19   For a proof of the reverse direction of the above if and only if statement, consider that if $a$ satisfies all 3 equations, then since all 3 numbers are relatively prime we have $a$$^{37}$ $\equiv$ $a$ mod lcm(7,13,19) = 1729.   Hence note that by Eulers Theorem we have a$^{\phi(7)}$ = a$^6$ $\equiv$ 1 mod 7, which implies a$^{37}$ $\equiv$ $a$ mod 7, for all $a$ such that gcd($a$,7) = 1. Similarly we have $a$$^{37}$ $\equiv$ $a$ mod 13 and $a$$^{37}$ $\equiv$ $a$ mod 19. Hence when $a$ satisfies the condition gcd($a$,7) = gcd($a$,13) = gcd($a$,19) = 1, then $a$$^{37}$ holds.   Suppose $a$ is divisible by either 7, 13, or 19. Then WLOG suppose $a$ $\equiv$ 0 mod 7. a$^{37}$ $\equiv$ $a$ mod 1729 if and only if the above 3 equations hold. The first equation holds as 0$^{37}$ $\equiv$ 0 mod 7. The other 2 equations also hold as gcd(7,13) = 1 and gcd(7,19) = 1, so Euler's Theorem still applies in those cases. Hence the original claim holds for all a $\in$ $\mathbb{Z}$.


How to pass values from one page to another in jQuery

I have two pages of jQuery, Page1 and Page2, and I'm able to get input in Page1.  The somval=1000$.  The page 1 user enters the somevalue. I have stored the value:  var val = somval;   Now in the second page, I need to get the result of somvalue in page 1. Of course two pages using My1.js My2.js respectively.  How do I share the values from one jQuery file to other JavaScript or how do I get the value from page1 value, to page2?  How do I tackle this?


I have deleted my chat history of mail and deleted it from trash as well. I am unable to recover it. PLease help me out. It is very important for me.


Why current is negative in this situation? Because EMF and current directions are the opposites?        – Schematic created using   Can someone give me a good explanation on relationship between current and EMF?


Can any Power function (whose base is not zero) , e.g. $2^{n}$, be defined arithmetically (i.e. using addition and multiplication only)?

In other words, I'm looking for a binary relation $P(x,y)$, being arithmetical, i.e being expressed in the first order language of Peano arithmetic (hence non-recursively, i.e. using addition and multiplication only - without using the very symbol $P$), which satisfies:   For every $x$, there exists a unique $y$, satisfying $P(x,y)$. $P(0,1)$. Every $x,y$, satisfying $P(x,y)$, satisfy $P(x+1,2y)$.   If such an arithmetical function (as defined above) does not exist, I will be glad to read the proof of this fact.  (No Gödel's coding please).


How to show the maximal interval for $\dot{x}(t)=-cx^2(t)+\frac{x^2(t)}{1+x^2(t)}$ is $[0,\infty)$?

The following differential equation has the maximal interval as $[0,\infty)$:  $$ \dot{x}(t)=-cx^2(t)+\frac{x^2(t)}{1+x^2(t)} $$  where $c>0$.  My try: We need to show the solution lives in a bounded set, then we are done. Since $\frac{x^2(t)}{1+x^2(t)} \leq 1$ we can write  $$ \dot{x}(t)\leq-cx^2(t)+1 $$  I do not know how to find the upper bound for $x(t)$ and how to come up with a lower bound for $x(t)$.


I've been baking bread on and off during the last two years. Now, finally, I found a nice recipe. It calls for 2% of salt (20gr per kg of flour). It gives a tasty bread.  On the other hand, the health service recommends using less salt in bread, but I don't know the recommendation, nor the tastefulness of the recommended bread... (that's a lot of recommends in one sentence).  So, what is the recommendation and does it produce a decent bread?


Why do I have to use 's in some sentences?

For example: Brandon's house instead Brandon house. How is that rule named, I'm trying to improve my English.


Are complex numbers just vectors defined by cosine (x axis) and sine (y-axis)?

There is no clear and standard definition of a complex number, I recall a prof being at a loss when a freshman aske him what is a complex number.  I read somewhere that a great mathematicians was not ashamed to say, re the formula $e^xpi = -1$ I think, that nobody knows what it means , but they are proud of it, is that true?*  I suppose nobody has a clear answer, I am just asking to specify what is more or different from the regular operations on a vector field taken as a 360° circle, where points are identified by  cosine of the relative angle (real part) and sine (imaginary part)  Edit  The linked question/answer resembles only superficially my question. I stressed the crucial feature that the vector is defined by sin and cos and consequently obeys the rules of duplication etc of angles. I am not familiar with all details of that theory and I am asking , if any, about the differences. If there are none or minor ones, then complex numbers ar not numbers and not complex at all.  *I found the quote:      Benjamin Peirce, a noted American 19th-century philosopher,   mathematician, and professor at Harvard University, after proving   Euler's identity during a lecture, stated that the identity "is   absolutely paradoxical; we cannot understand it, and we don't know   what it means, but we have proved it, and therefore we know it must be   the truth   *


Is there a package to create Optical Mark Reader answer-sheets?

Is there a package to create Optical Mark Reader answer-sheets (aka bubble sheet)?  EDIT 1: No choice. I think I must use PSTricks and \multido to make it.


Question about PCA: how are PC scores generated using PC eigenvectors?

My question is quite elementary but I need help understanding the basic concepts. In the following example from the Mathworks  of the princomp function  load hald; [pc,score,latent,tsquare] = princomp(ingredients); pc,latent   we get the following values for:  pc =     -0.0678   -0.6460    0.5673    0.5062    -0.6785   -0.0200   -0.5440    0.4933     0.0290    0.7553    0.4036    0.5156     0.7309   -0.1085   -0.4684    0.4844  latent =    517.7969    67.4964    12.4054     0.2372  score =     36.8218   -6.8709   -4.5909    0.3967    29.6073    4.6109   -2.2476   -0.3958   -12.9818   -4.2049    0.9022   -1.1261    23.7147   -6.6341    1.8547   -0.3786    -0.5532   -4.4617   -6.0874    0.1424   -10.8125   -3.6466    0.9130   -0.1350   -32.5882    8.9798   -1.6063    0.0818    22.6064   10.7259    3.2365    0.3243    -9.2626    8.9854   -0.0169   -0.5437    -3.2840  -14.1573    7.0465    0.3405     9.2200   12.3861    3.4283    0.4352   -25.5849   -2.7817   -0.3867    0.4468   -26.9032   -2.9310   -2.4455    0.4116   Legend:  latent is a vector containing the eigenvalues of the covariance matrix of X.  pc is a p-by-p matrix, each column containing coefficients for one principal component. The columns are in order of decreasing component variance.**  score is the principal component scores; that is, the representation of X in the principal component space. Rows of SCORE correspond to observations, columns to components.  Can somebody explain whether the values of score are genetrated somehow using the values of pc and if this true, what kind of computation is perfomed ?


References about the application of group theory in physics

I want some references about the history of the application of group theory in physics. Most references I found are professional textbooks, but I'm not concerned about the technical details and I don't have enough backgrounds to understand them as well, rather I'd like some popular-science style reference. Could you please recommend some references to me? P.S. I am an undergraduates in mathematics, so if a reference must contain some technical details, I'd like one with more mathematics and less physics.


Warning after submitting sitemap to Google: "We found that some URLs redirect to other locations"

I noticed that I have three warnings when I submitted my Sitemap. They all say this:      When we tested a sample of URLs from your Sitemap, we found that some   URLs redirect to other locations. We recommend that your Sitemap   contain URLs that point to the final destination (the redirect target)   instead of redirecting to another URL.   I'd like to try and resolve this issues but I'm not sure what to do.  Sitemap url for reference:


Why can't i get longitude and latitude from using just "location" class' built-in methods?

what i am trying to do is create an instance of class "location" and calling methods-"getLongitude()" and " getLatitude()" to get latitude and longitude and show them using "toast" but i am getting errors.  Here is my code and the errors:  CODE   package autogenie.maptrial;   import android.content.Context;  import android.location.Location;  import android.support.v7.app.AppCompatActivity;  import android.os.Bundle;  import android.widget.Toast;    public class MainActivity extends AppCompatActivity { Location loc; Double lon,lat;  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.activity_main);       lon=loc.getLongitude();     lat=loc.getLatitude();        Context context = getApplicationContext();     String s=String.valueOf(lon)+"  "+String.valueOf(lat);     int duration = Toast.LENGTH_LONG;      Toast toast = Toast.makeText(context,s, duration);     toast.show();   } }     THE ERRORS:     java.lang.RuntimeException: Unable to start activity   ComponentInfo{autogenie.maptrial/autogenie.maptrial.MainActivity}:   java.lang.NullPointerException      and      java.lang.NullPointerException                                                                           at autogenie.maptrial.MainActivity.onCreate


show that if $M \times \mathbb{R}^{n}$ is orientable than so is $M$

I need to show if $M \times \mathbb{R}^{n}$ is orientable than so is $M$, where $M$ is connected manifold. $R^{n}$ has standard orientation (determined by standard basis ) and by the assumption $M \times \mathbb{R}^{n}$ also orienatable, so how to show that $M$ is orientable?


How to give reference at the end of particular page?

Hello friends,  I want to give reference at the end of particular page in which reference is mentioned just like attached image. Please write the latex code , Thanks in advance...


I rarely ate rice growing up, and only recently started cooking it. I started with basmati, and seemed to do alright with that, but my wife (who used to live in Korea) said she preferred rice to clump together, as opposed to the perfect individual grains of a nicely cooked basmati.  Well, as embarrassed as I am to say so, I've been struggling with this two-ingredient dish. I've tried using short-grain rice, which helped somewhat, but using my basmati technique on it is not yielding the desired result.   After doing some research, I've found a slew of conflicting advice, on nearly every point, including:   Wash / don't wash Soak / don't soak Use less / more water Boil hard / steam on lowest setting   What I would love to know is, what do each of these factors really do?


Is there a way to search for those questions that have only negative votes?

I would like to search for questions with less than 0 votes (that is, only negative votes). There is a way to search for 0 or more, but not 0 or less?


Using apt-get how to check have installed latest version ?

Hello im just new for Linux   I know that  sudo apt-get   is for installing application   but how I would know that I have installed the latest version of the application   for example apt-get install sun-java6-jdk   is there an option to upgrade or see the latest version   or its ok to install an old version the application and Linux will upgrade it for me ?


One word for students, faculty and staff at a university

What word is used to include students, faculty and staff at a university?


I'm using latex editor to insert a picture. When I view the output in pdf file the "Diagram.jpg" appear above the picture. How I can remove it?   the code written for insertion is:  \begin{figure}[h]     \centering         \includegraphics[width=1.00\textwidth]{Blcok Diagram.jpg}     \caption{Block Diagram}     \label{fig:Block Diagram} \end{figure}   and the output is like:


I recently discovered that the singular "band" can go together with plural verbs.  "band goes on tour" gets 11,700 results on google while "band go on tour" gets 31,900 results.  What's going on here?


My objects just don't get any light in render. And they look like empty png in render. It happened one day, I was working in Blender 2.8. Than I installed 2.9 and the problem was gone for some time. Now it happen again. I`m not very experienced user, maybe I just pressed the wrong button somewhere.


Where can one learn the structure of caret sign command sets as in install lamp-server^?

To establish a LAMP stack with Ubuntu one could execute in an Ubuntu command line:  sudo apt-get install lamp-server^ -y   The caret indicated it's not a common installation command but rather a command that encapsulates a set of commands.  Where can one learn the structure of caret sign command sets as in install lamp-server^ ?


Big time difference for compilation between`XeTeX and `pdfTeX` engines

On Windows 7 64-bit I am using TeXLive 2016. I have the complete package installed and in order to use system fonts I switched from pdfTeX to XeTeX. It occurred to me that XeTeX ran much slower than its counterpart and the test in the Windows PowerShell confirmed this observation. For the same file with all the auxiliary files deleted XeTeX takes 47 second to run, whereas pdfTeX takes 9 seconds.   I read on this site that running fc-cache -fv in the administrator command prompt should help, yet this did not make the situation better. I know that it is acceptable to have a difference of %50 percent maybe, but the time it takes is nearly 5 times. What might be the reason behind this?  PS: The source file has a size of around ~1600 lines when flattened. The PDF output is 112-113 pages. The power shell output is below:  PS D:\Dropbox\Work\ThesisTeXSource> Measure-Command {pdflatex.exe -synctex=1 -shell-escape -interaction=nonstopmode .\On gunArisevMSc.tex} system returned with code 1   Days              : 0 Hours             : 0 Minutes           : 0 Seconds           : 9 Milliseconds      : 97 Ticks             : 90973370 TotalDays         : 0.000105293252314815 TotalHours        : 0.00252703805555556 TotalMinutes      : 0.151622283333333 TotalSeconds      : 9.097337 TotalMilliseconds : 9097.337    PS D:\Dropbox\Work\ThesisTeXSource> Measure-Command {xelatex.exe -synctex=1 -shell-escape -interaction=nonstopmode .\Ong unArisevMSc.tex} system returned with code 1   Days              : 0 Hours             : 0 Minutes           : 0 Seconds           : 47 Milliseconds      : 699 Ticks             : 476994194 TotalDays         : 0.000552076613425926 TotalHours        : 0.0132498387222222 TotalMinutes      : 0.794990323333333 TotalSeconds      : 47.6994194 TotalMilliseconds : 47699.4194    PS D:\Dropbox\Work\ThesisTeXSource>


I think I accidentally pressed something to make it like this:    See how the XYZ arrows are at the 3D cursor instead of those vertexes I've selected?  How do I fix that? Whenever I select on a vertex or something, those blue, red, green arrows would always be where I selected, now it just keeps going to the 3D cursor.


How do you prevent friends from joining your game?

When trying to get some solo achievements or when running the game for the first time with a new friend, your other friends can be a bit too friendly and barge in, killing everything or just making the mobs beefier.  How do you block people from joining your game?


The series is $1\cdot\frac{1}{2} + 2\cdot\frac{1}{4} + 3\cdot\frac{1}{8} + \cdots$  Or in other words  $$\sum_{n=1}^{\infty}\frac{n}{2^n}$$  What kind of series is this and how to find the sum? Thanks....


Which annotation should I use: @IdClass or @EmbeddedId

The JPA (Java Persistence API) specification has 2 different ways to specify entity composite keys: @IdClass and @EmbeddedId.   I'm using both annotations on my mapped entities, but it turns out to be a big mess to people who aren't very familiar with JPA.   I want to adopt only one way to specify composite keys. Which one is really the best? Why?


Field can not be filtered in SOQL query call

Here is my SOQL code for finding records to update but it is generating a compiler error like "field 'Chatter_Monitor_Policy_Keyword__c' can not be filtered in query call". Why can't I filter by this field?  string abc = obj[0].Chatter_Monitor_Policy_Keyword__c; string s ='%'+ abc + '%';  List<Chatter_Monitor_Policy__c> records = [SELECT Id, Chatter_Monitor_Policy_Keyword__c from Chatter_Monitor_Policy__c where Chatter_Monitor_Policy_Keyword__c Like:s and CreatedById =: UserInfo.getUserId()]; if(records.size()!=null) {   for(Integer i=0; i<records.size(); i++)   {     records[0].Chatter_Monitor_Policy_Keyword__c = s;     update records[0];   } }


I install ubuntu 20.04 from usb , and also I did partion part of installation, I format partion then Install , and it stuck on loading for 15 minutes  and there is no loading , there is only cursor that act cycle loading .


i'm getting an error of "FIND: Parameter format not correct" in powershell The following works from CMD C:\Users\User>echo abc | find "a" abc  C:\Users\User>echo abc>z.z  C:\Users\User>find "a" z.z  ---------- Z.Z abc  C:\Users\User>  But this fails from powershell! PS C:\Users\User> echo abc | find "a" FIND: Parameter format not correct PS C:\Users\User> echo abc >z.z PS C:\Users\User> find "a" z.z FIND: Parameter format not correct PS C:\Users\User>  There is a similar question here   where the answer says to use quotation marks with the find command. Though I have   And I wouldn't be using /C because i'm not trying to count occurrences. Though find /c isn't working either PS C:\Users\User> find /C "a" z.z FIND: Parameter format not correct PS C:\Users\User>  And it's not a UK keyboard issue, where two pipe characters get swapped. 'cos it works in cmd and not powershell. And I tried copy/pasting the correct pipe character from charmap.  And as yo see this occurs also with the format of find [pattern] file. So without any pipe. So, not a pipe issue. There's something about powershell and find, that is going wrong here. Where cmd is fine. Added Upon further investigation PS C:\Users\User> which find /cygdrive/c/Windows/system32/find PS C:\Users\User>  Makes me wonder, is that a PATH problem it's clashing with cygwin? I don't think it's a PATH problem, because that's just cygwin's way of stating that the path is in c:\windows\system32  but does look like a weird clash with cygwin though in some way.. not sure if relevant to the problem. It is running windows FIND PS C:\Users\User> find /? Searches for a text string in a file or files.  FIND [/V] [/C] [/N] [/I] [/OFF[LINE]] "string" [[drive:][path]filename[ ...]]    /V         Displays all lines NOT containing the specified string.   /C         Displays only the count of lines containing the string.   /N         Displays line numbers with the displayed lines.   /I         Ignores the case of characters when searching for the string.   /OFF[LINE] Do not skip files with offline attribute set.   "string"   Specifies the text string to find.   [drive:][path]filename              Specifies a file or files to search.  If a path is not specified, FIND searches the text typed at the prompt or piped from another command. PS C:\Users\User>


Show that for all $a,b,c$ positive real numbers that $(a+b+c)(a^{-1}+b^{-1}+c^{-1})\geq 9$

Show that for all $a ,b , c $ positive real numbers that $$(a + b + c)(a^{-1} + b^{-1} + c^{-1})⩾ 9 $$


I'm a bit confused with matrix calculus.  Given is $$f(x) = \frac{1}{2}||Ax-b||^2_2$$ and the derivate of it is in my book $$\nabla_xf(x) = A^T(Ax-b). $$  I don't see how this works. My plan was to substitute the $L_2$ norm and derivate that. Witch give just the substitute (thing in brackets) time it's inner derivative. No clue why the inner derivative would be $A^T$.


I am doing summer project in maths and I have to type my report. I am good with the latex I write on mathstack that I have learned through experience but when it comes to softwares, I do not know anything like those commands \begin \end does not make sense to me.   Is there any software which can automatically put these commands in, so that in b/w we can type whatever stuff we want?  Also if not, at least you guys can tell me if there is any latex software which shows the output on half of screen(right half), as I type on left half and compile, (I saw it somewhere).  Anyways, I have to download a software and will have to go through some you tube videos, so please suggest me relatively easy Latex software.  Thanks!  P.S. Please edit the tags as you wish, I did not understand many tags here.


Unpaired t-Test with equal sample sizes and unequal variances

I have two samples of $n=10$ with the following values  Sample 1:   Mean = $3$  $s_{d} = 0.4$   Sample 2:   Mean = $3.35$  $s_{d} = 0.3$   but the observations of both samples are unknown and I want to know the common $s_{d}$ to calculate $t_{0}$    Note: this is no homework is only an exercise from the tutorial, which has not been solved.


I've got a fresh install of the Drupal 8 Beta 12. I'm trying to install the REST UI module:  $ drush dl restui-8.x-1.x-dev  PHP Fatal error:  Class 'Drupal\Core\Session\AccountInterface' not found in /var/www/html/drup/core/includes/bootstrap.inc on line 64 Drush command terminated abnormally due to an unrecoverable error.   [error] Error: Class 'Drupal\Core\Session\AccountInterface' not found in /var/www/html/drup/core/includes/bootstrap.inc, line 64   Does anyone know what's going on here?


Lists getting cleared unexpectedly after assignment

class ListHolder {     public List<char> List;     public ListHolder(List<char> l)     {         this.List = l;     } }  class Program {     static void Main(string[] args)     {         List<char> a = new List<char>();         a.Add('s');         ListHolder c = new ListHolder(a);         a.Clear();         Console.WriteLine(c.List.Count);     } }   I've put some list into that class, than I cleared the list and wrote the count of the list in the class... I would expect that the output should be "1" (as the list in the class contains the letter 's') but instead it writes "0". How is possible, that a.Clear clears even the list in the class? How can I achieve clearing only the list in the Main and the list in the class letting be?


How to execute something in current shell

I want to create a bash script or something similar that I can execute in the current shell:   echo '#!/bin/bash    export foo="bar" ' > zoom.sh   but if I want to run this script in the current process:  exec ./zoom.sh   then my terminal will just exit "process completed", even if I use set +e, it still exits.  There's source and eval which will run stuff in the current shell, so maybe eval is my best bet?  A bash function will work - but I have to rely on the user to source it in the first place.


Replacing a variable permanently in shell

I have file <temp_test.sh> in which I have defined a variable Min_Inc=300000.  I then want to get the user input to change the value of Min_Inc. I followed these steps.   Read the value using echo $Min_Inc and displayed it. Sought User input for the new value and read it with read New_Val. Tried replacing Min_Inc=300000 with Min_Inc=$New_Val using sed as sed 's/Min_Inc=300000/Min_Inc=$New_Val/'   This gives an error message. Moreover, I want to make this change permanent which I can make by redirecting the output to another file.


Can you combine Polearm Master with War Caster to cast Booming Blade as enemies approach?

The  feat (PHB, p. 168) says:     While you are wielding a glaive, halberd, pike, or quarterstaff, other creatures provoke an opportunity attack from you when they enter your reach.   The  feat (PHB, p. 170) says:     When a hostile creature's movement provokes an opportunity attack from you, you can use your reaction to cast a spell at the creature, rather than making an opportunity attack. The spell must have a casting time of 1 action and must target only that creature.   On this very topic, Mearls has :     Q: Do Polearm Master and War Caster combine to allow a magic user to make a spell opportunity attack when they enter reach?   A: No - polearm master applies only if you use the weapons it lists to make the attack     Another question on this very topic:   But since then, we now have spells like  (SCAG, p. 142):     As part of the action used to cast this spell, you must make a melee attack with a weapon against one creature within the spell’s range, otherwise the spell fails. On a hit, the target suffers the attack’s normal effects, and it becomes sheathed in booming energy until the start of your next turn. If the target willingly moves before then, it immediately takes 1d8 thunder damage, and the spell ends.    So, with the addition of booming blade, if I have a quarterstaff + War Caster + Polearm Master, could I use my reaction to cast booming blade if someone steps into my reach?


Discrete uniform random variable(?) taking all rational values in a closed interval

I just had an (intellectual) panic attack.     A continuous random variable that follows a uniform in a closed interval $U(a,b)$: a comfortably familiar statistical concept.   A continuous uniform r.v. having support over the extended reals (half or whole): not an r.v. proper, but a basic Bayesian concept for an improper prior, useful and applicable. A discrete uniform taking a finite number of values: let's throw a geodesic dome, no big deal.     But what about a function that has as its domain all the rationals that are included in a closed interval with integer bounds (start with the $[0,1]$ if you wish)? And we want to use it in a probabilistic framework, requiring that each possible value has equal probability with all the others?   The number of possible values are countably infinite (which characterizes a lot of discrete distributions), but how to express the probability of a single value given that we want probabilities equal?  Can we say-show-prove that such an entity is (is not) a random variable?    If not, is this another incarnation (perhaps already well-known) of an "improper prior"?  Is it possible that this entity is in some well-defined sense, however special,  "equivalent" to a continuous uniform r.v.? Or I just committed a cardinal(ity) sin?  It appears that the fact that the domain is a closed interval does not let me let go. Bounded things are usually manageable.  The questions are many in order to be indicative of the internal maelstrom- I am not asking to get answers to each one of them.    At any time that I may come up with any insights, I will update.    UPDATE: the present question just acquired a constructivist sequel


Worried first time DM/general player of DnD seeking advice!

I need whatever help I can get with my first ever DnD session!  To be honest, I have little to no experience with roleplaying games. I used to roleplay with my friends, but I wouldn't consider that experience in the world of DnD. I got introduced to DnD through The Adventure Zone, Stranger Things, and other pop culture references to the game. Since my family are the ones I'm most comfortable sharing my nerdy interests with, and they're, uh, older, I'll be DMing for my parents and my brother. My family is also entirely new to DnD, and I'm not really sure how to prepare them in advance.   I bought the starter kit along with some dice (to treat myself), I'm currently reading through the starter kit manuals, and I'm watching whatever video or post I can find related to DnD. But from what I hear, it's very difficult to DM and listening to podcasts make me so overwhelmed to start.   I just need whatever advice I can get, and whatever information I should read on too, besides the rule book and story that comes with the starter kit. Anything I could be missing, or something to ease my worries.  Thank y'all so much in advance!


Showing expression of $dA$ in cartesian coordinates = $dA$ in cylindrical polar

In cartesian coordinates, $dA = dx\,dy$ . As $x=\rho \cos\phi\ $ and $y=\rho \sin \phi \ $,  then: $dx=  \cos\phi\, d\rho - \rho \sin\phi\, d\phi$ and $dy = \sin\phi\, d\rho + \rho \cos\phi \, d \phi  $.  So $dx\, dy = \rho\, d\rho\, d\phi(\cos^2\phi-\sin^2\phi) $, (ignoring second order terms in $d\rho$ and $d\phi$)  Why is this not equal to the correct result of $dA=\rho\, d\rho\, d\phi$?


Proof that the effective/proper action is the generating functional of one-particle-irreducible (1PI) correlation functions

In all text book and lecture notes that I have found, they write down the general statement \begin{equation} \frac{\delta^n\Gamma[\phi_{\rm cl}]}{\delta\phi_{\rm cl}(x_1)\ldots\delta\phi_{\rm cl}(x_n)}~=~-i\langle \phi(x_1)\ldots\phi(x_n)\rangle_{\rm 1PI} \end{equation} and they show that it is true for a couple of orders.  I heard that Coleman had a simple self contained proof for this statement (not in a recursive way), but I cannot find it. It might have been along the line of comparing to the $\hbar$ expansion but I'm not sure.  Do you know this proof? Is there a good reference for it?  Comment: Weinberg does have a full proof but it is hard and not intuitive.


How many ways are there to select a pair of cards from a standard deck of cards such that one of the cards is red and the other one is black?

Suppose that a pair of cards are selected from a standard deck of 52 cards. And since there are 26 black cards and 26 red cards, so I'm wondering if my thinking is right?   ${26!/25! * 26!/25!}$ so it would be ${26*26 = 676}$


NTFS Drives suddenly mount as read-only, how to fix?

my NTFS drives have always mounted with write access now suddenly they don't. How do I get them to mount with write access?  I mount them simply by going to "other locations" and clicking the drive.  I'm on Ubuntu Budgie 18.04.


Is there a list of expandable TeX primitives? LaTeX? e-TeX? others?

According to  I understood that calculations are possible in a keyval list when the macro is expandable. The macro \numexpr being expandable, calculations are possible.   Hence the interest in knowing which macros are and which are not expandable from TeX, LaTeX, ε-TeX, etc.  I am not asking if there is a test, but if there is a list already made.


Let $a,b$ be in a group $G$. Show $(ab)^n=a^nb^n$ $\forall n\in\mathbb{Z}$ if and only if $ab=ba$.

Let $G$ be a group and $a,b\in G$.  Show $(ab)^n=a^nb^n$ for all $n\in\mathbb{Z}$ if and only if $ab=ba$.  I don't known where to start. It seems trivially.


Should I write "that being said" (vs. "that's been said" or "Having said that")?

I often write what "sounds" right (being not a native English speaker/writer), and I believe the expression "that being said" to be fairly common, as opposed to a more complete form like "that's been said" or "Having said that".  In doubt, I turn to , which seems to confirm the . (not exactly the right reference, I know.)  Yet, I don't think that "that being said" is correct, especially in writing. "That said" is even more common. Is it also acceptable in writing?  What expression would you use in formal writing? (Not too formal though: like a )


I am not so seasoned about gis and geotools, I am trying to encode a feature collection obtained by a shapefile in gml 3.2. Here is my code:  @Test public void transformAccumuliDiFranaShapeToGml32() throws IOException {   URL zipfile = Thread.currentThread().getContextClassLoader().getResource("my.shape.zipped");    File unzippedFile = new File(tmpFolder, UUID.randomUUID().toString()); unzippedFile.mkdirs();   File zippedFile = new File(zipfile.getPath()); getUncompressed(zippedFile, unzippedFile);   File shapefile = getFileBySuffix(unzippedFile, ".shp");    FileDataStore ds = FileDataStoreFinder.getDataStore(shapefile);   SimpleFeatureCollection features = ds.getFeatureSource().getFeatures();    Configuration configuration = new org.geotools.gml3.v3_2.GMLConfiguration(); org.geotools.xml.Encoder encoder = new org.geotools.xml.Encoder(configuration);   FileOutputStream fos = null;   try {     fos = new FileOutputStream(new File(tmpFolder, UUID.randomUUID().toString() + ".32.gml"));     encoder.encode(features, org.geotools.gml3.v3_2.GML.FeatureCollection, fos);   } finally {     if (fos != null)     fos.close();   } }   All I can get is an empty gml file. This is the content:  <?xml version="1.0" encoding="UTF-8"?> <gml:FeatureCollection xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:gml="http://www.opengis.net/gml/3.2"/>   Maybe it depends by the QName value I pass to encoder.encode(..);. You can find the shapefile I used . What am I missing? I am using org.geotools version 17.2.


If $b $ divides $ad $ with$ \mathrm {gcd}(a,b)=1$, then $b $ divides $d $

Let $a\in \mathbb {Z} $ and $a,b \in \mathbb {N} $. Suppose that $b $ divides $ad $ where  $\mathrm {gcd} (a,b)=1$. What can you conclude from the above assumptions?   I have a feeling that we must have $b $ divides $d $, but I am unsure and have no intuition guiding me as to a formal way to express what I believe is the conclusion.


Decision on rejected edits should be displayed as a notification to the editor

Update, April 2014: I fully support  of adding the message where it belongs—in the actual editing form. This is less intrusive than displaying it as a notification, but it serves the same purpose. Can has?     Background  When you suggest an edit, the outcome of whether it was approved or rejected is buried deep within your profile. You have to navigate to Profile » Activity » Suggestions to find a list of your recent edits, but even those do not say anything about the outcome:    waffles♦ introduced this , but what can I learn from this page? I have to manually click through the edits to see whether they were rejected or not. This is  time-consuming or inefficient at best. There's also no learning involved at all, since there is no active feedback.     Feature request #1  If an edit was rejected, there should be a notification message displayed, linking to the page of the suggested edit (which states the reject reason).    This kind of feedback would improve the editing behavior, since otherwise, inappropriate suggestions might just continue.    Feature request #2  If the above is too intrusive, the messages in the profile's Activity section should be clearer, for example like this (compare against the first screenshot in the question):        This is similar to:     Here's some more explanation:  Let's assume the case of a user suggesting lots of edits that are in some way harmful. Maybe they were too minor, like only changing keyboard shortcuts to use kbd markup instead of boldface.   Yes, we've already had this on Super User. Since it only takes one user to approve / reject there, some of these edits might even have been wrongfully accepted, others  rejected. While this is a problem of its own, the user suggesting these edits will have a hard time even getting any kind of feedback.  They would never see the rejection messages because they're buried somewhere, unless they critically checked each suggestion in their profile. I doubt anybody would do this. Even more so, they might only look at their steadily climbing reputation, not really noticing a rejected edit.  Another case is users learning how to edit. How are we  if they're not told what they did wrong? They will just continue suggesting edits until somebody actually pings them in chat or comments somewhere.  Here's an  of a user who was completely unaware that he could see feedback somewhere in a dark corner of his profile, until he was banned from editing because he'd repeated the same mistake over and over.


what is the significance of the "7" in "man 7 regex"?

When I type man regex into a shell, this loads  REGEX(3)                                                     Linux Programmer's Manual                                                     REGEX(3)  NAME        regcomp, regexec, regerror, regfree - POSIX regex functions  SYNOPSIS ........   when I type man 7 regex I get a different man page  REGEX(7)                                                     Linux Programmer's Manual                                                     REGEX(7)  NAME        regex - POSIX.2 regular expressions  DESCRIPTION ........   What is happening here?


I briefly helped out a friend, who has an HP laptop (not new). I saw she had a start button for her Windows 8 floating in the corner of her desktop. Is this something HP provided? I didn't get a chance to investigate and I'm pretty sure she didn't download a third-party program.


Trying to format a Computer that has the admin account and permissions deleted

I am an administrator for a business and have inherited windows 7 guest computers. They are pretty much soft locked to where the only thing that can be done is surf the web.  I have no administrator profile, no command prompt or any permission that would allow me to update or format. Is there anyway that i can format these computers without administrator access or the command prompt?


I'm using vim + omnisharp/syntastic for some unity3d development in C#.  When I declare a variable using the actual type, for instance   string[] myArray = new string[5];  I get a warning message telling me to use the 'var' keyword instead.  Is there any reason for that (i.e. performance, established code style, etc) ? Are there any pros/cons ?


Enabling Time Machine for a USB HDD with NTFS

When I've plugged in my USB HDD (WD Passort Elite) for the first time, the system had asked me whether I want to use this HDD as time machine drive. I've chosen smth like 'decide later' and continued my work. When later I tried to setup time machine preferences I couldn't find the way to set my USB HDD as time machine drive. When I press 'Select drive for backup' i see empty list, nevertheless my drive is plugged in and works well. Btw, it is ntfs-formatted, could it be a problem?  Thanks in advance


How to adjust the padding surrounding a matrix's cells?

Consider the following LaTeX manuscript featuring a TikZ picture of a matrix with a single cell.  \documentclass[tikz]{standalone} \begin{document} \begin{tikzpicture}   \matrix[draw,nodes=draw]   {     \node {*}; \\   }; \end{tikzpicture} \end{document}   The resulting image is                                                                    How can I adjust the padding surrounding the cell? For instance, suppose I wish to get rid of the padding all together. I attempted to add inner sep=0pt to the matrix's option list, but then not only did the padding surrounding the cell collapse, but also the padding surrounding the asterisk inside the cell:                                                                       P.S. If the matrix has more than one cell, I don't wish to alter the spacing between the rows or the spacing between the columns; only the padding inside the matrix that surrounds the entire grid of cells.


How do I show that if $A$ is compact and $U \supseteq A$ is open, then there is an open $V$ with $A \subseteq V \subseteq \overline{V} \subseteq U$?

This question is from Wayne Patty's Topology Section 5.2.  Consider $A$ be a compact subset of a regular space and let $U$ be an open set such that $A\subseteq U$. Prove that there is an open set $V$ such that $A \subseteq  V \subseteq \overline{V} \subseteq U$.  Let $p \in A$ which implies $p \in U$. Then a result is given in   the book (Theorem 5.11): A $T_1$-space $(X, \mathcal T)$ is regular if and only if for each member $p$ of $X$ and each neighbourhood $U$ of $p$, there is a neighbourhood $V$ of $p$ such that $\overline{V}\subseteq U$. So, I got $ V \subseteq \overline{V} \subseteq U$. But I am unable to prove that $A\subseteq V \subseteq \overline{V}$. I thought that I should let $V\subseteq \overline{V} \subseteq A$ but I am not able to find a contradiction. Can you please help with that?


Einstein's equation: good, intuitive introduction anywhere?

Baez - like most others - gives (IMHO) a quite unsatisfactory . They all start with the equivalence principle or similarly unintuitive reasoning, relating it to special relativity and so on. But I did not find any introduction that gives me an intuitive description of what the Einstein equation actually describes.   Baez talks about $t$-momentum. What is a $t$-momentum? And what is a $t$-momentum in t-direction? And then what would a $t$-momentum in $x$-direction be? And what do I have to think of a $t$-momentum flow? He explains: "The flow of $t$-momentum in the $t$-direction is just the energy density." As if that explains anything at all.  IMHO a much better approach would be to describe simple experimental results and then show how to calculate them using Einstein's equation, maybe using a reduced and simplistic form initially.


This is a good news.    This is good news.    Which one is correct? Clarify the difference


Limit with criteria $\lim_{n \to \infty}n \cdot \left [ \frac1e \left (1+\frac{1}{n+1} \right )^{n+1}-1 \right ]$

$$\lim_{n \to \infty}n \cdot \left [ \frac{\left (1+\frac{1}{n+1} \right )^{n+1}}{e}-1 \right ]$$ I was trying to calculate a limit that drove me to this case of Raabe-Duhamel's test, but I don't know how to finish it. Please give me a hint or a piece of advise.  I cannot use any of the solution below, but they are clear and good. I'm trying to prove it using squeeze theorem like this: $$\lim_{n \to \infty}n \cdot \left [ \frac{\left (1+\frac{1}{n+1} \right )^{n+1}}{e}-1 \right ]=\frac{-1}{e} \cdot\lim_{n \to \infty}n \cdot \left [e- \left (1+\frac{1}{n+1} \right )^{n+1} \right ]$$  I found this: $$\frac{e}{2n+2}<e- \left (1+\frac{1}{n} \right )^{n}<\frac{e}{2n+1}$$ Is this true? How can I prove this? Thanks for the answers.


Compare 2 objects with same keys in different order

var i={ key1:value1, key2:value2 } var j={ key2:value2, key1:value1 }  How to compare above objects and get answer true?