I stopped using Ubuntu for a while (since 12.10) and recently came back to it. From what I remember, it used to only ask for the root password once for a terminal session (for sudo commands). Now it asks me everytime I want to sudo something. Is there a way to fix this? or is this intentional?  The same thing happens with git. I have enter my credentials everytime I want to commit. I know my friends on on mac don't need to do this. Are the two issues related?  Any help would be appreciated. Thanks in advance!

I execute quite a lot of sudo commands.  I noticed that if I execute one and then another one within few minutes, the 2nd time I don't get the message:     [sudo] password for my_username:   but I do get it when there is more time between the execution of the two commands.  What's the period of time in which the message is not appearing? How can we check it / update it?


I have the menu item id. I want to display that menu item with its children.   Suppose for example I have menu item test and it has two children menu items. So I want to load them and display it as  test   test1   test2   I tried to load the menu item with the following code.  $menu_content = current(\Drupal::entityManager()->getStorage('menu_link_content')->loadByProperties(array('id' => 1)));   But I am unable to get the children from the variable. Can someone help me here?

I need to create block with a list of links menu child items (only first level) of a given menu like this:   Item 1 Item 2 Item 3   With this code I can have the menu items but I don't know how to process each element to obtain the menu item title and the menu item url.  $menu_name = 'main'; $menu_tree = \Drupal::menuTree(); $parameters = $menu_tree->getCurrentRouteMenuTreeParameters($menu_name); $parameters->setMinDepth(0);  $tree = $menu_tree->load($menu_name, $parameters); $manipulators = array(   array('callable' => 'menu.default_tree_manipulators:checkAccess'),   array('callable' => 'menu.default_tree_manipulators:generateIndexAndSort'), ); $tree = $menu_tree->transform($tree, $manipulators);


i got  E/BoostFramework: BoostFramework() : Exception_1 = java.lang.ClassNotFoundException: Didn't find class "com.qualcomm.qti.Performance" on path: DexPathList[[],nativeLibraryDirectories=[/system/lib, /vendor/lib, /system/vendor/lib]] this error after being this the system crash.    10-05 13:45:25.466 7639-7639/com.example.sanjay.samelikeviber E/BoostFramework: BoostFramework() : Exception_1 = java.lang.ClassNotFoundException: Didn't find class "com.qualcomm.qti.Performance" on path: DexPathList[[],nativeLibraryDirectories=[/system/lib, /vendor/lib, /system/vendor/lib]]     10-05 13:45:25.466 7639-7639/com.example.sanjay.samelikeviber V/BoostFramework: BoostFramework() : mPerf = null     10-05 13:45:25.700 7639-7639/com.example.sanjay.samelikeviber D/ViewRootImpl@32bfe65[Viber]: ViewPostImeInputStage processPointer 1     10-05 13:45:26.341 7639-7639/com.example.sanjay.samelikeviber D/AndroidRuntime: Shutting down VM                                                                                --------- beginning of crash   After being crash i got the error  FATAL EXCEPTION: main                                                                                Process: com.example.sanjay.samelikeviber, PID: 7639                                                                                java.lang.NullPointerException: Attempt to invoke virtual method 'java.lang.Class java.lang.Object.getClass()' on a null object reference                                                                                at android.support.v4.app.BackStackRecord.doAddOp(BackStackRecord.java:380)                                                                                at android.support.v4.app.BackStackRecord.add(BackStackRecord.java:375)                                                                                at android.support.v4.app.FragmentPagerAdapter.instantiateItem(FragmentPagerAdapter.java:103)

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


I am on a layer, I make a dup object, it gets locked to the original one. I do it again, I make an object, then a brand new one to size it smaller to put it inside of it instead, as soon as it touches it they become one object, stuck together. put a different object in to see what that would do ,as soon as I put it in contact with the first object it to is now locked together, I tried using 'U' on the duplicate object "shift D" it did not separate them either.  layer 10 on the first set of layers,

I created a thick glass bottle and duplicated the interior faces to make a new object to create the liquid inside.   I went in the edit mode, selected the faces I wanted to copy and duplicated them with ShiftD. Then I pressed P to  separate the duplicated faces.   Now I try to make a duplicate of that liquid to make it flow out of the bottle, and I simply need the duplicate of one face of it. So I go to edit mode and do as I did to make the liquid from the bottle faces... but as soon as I'm back to the object mode and I want to move the duplicated faces, every thing moves with it...   I played around and tried things, and while doing so I realized that if I dupe the liquid object in object mode using ShiftD and press 0 to place it where the original is, they move together if I duplicate it and place it somewhere else so that they are separated.   Also if I pick one of the two separated objects and make it intersect with the other one, release my left mouse button to place it there, and then try to move it again, they both move together, but not at the same speed.  I really don't understand what is going on and I'm sure it's really badly explained, so what I'll do is make a screen capture of my Outliner and record the behavior of the objects and upload those to help you understand.


I have the following document:  \documentclass[10pt,aps,pre,amsmath,amsfonts,amssymb,floatfix,longbibliography,superscriptaddress,notitlepage]{revtex4-1}  \usepackage{amssymb,amsmath} \usepackage{bm} \usepackage{color} \newcommand{\angstrom}{\text{\normalfont\AA}} \usepackage{hyperref} \usepackage{setspace} \usepackage{soul} \usepackage{bm} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{listings} \lstset{basicstyle=\ttfamily\footnotesize,breaklines=true} \usepackage{graphicx} \usepackage{color} \usepackage{hyperref} \usepackage{enumitem} \usepackage{algorithm} \usepackage{algpseudocode}   \begin{document} \title{Lipsum} \author{Jane Doe} \date{\today}  \begin{abstract} Lorem ipsum dolor sit amet. \end{abstract}  \maketitle  \section{Lipsum Generator} \begin{algorithm} \caption{lipsum} \label{proc:lipsum} \begin{algorithmic}[1] \Procedure{MapGen}{} \State lorem \State ipsum \State dolor \EndProcedure \end{algorithmic} \end{algorithm}  \bibliography{ref} \bibliographystyle{unsrt}  \end{document}   I am getting the following error messages during compilation:  Missing \endcsname inserted \end{algorithm} Missing number, treated as zero \end{algorithm} Extra \endcsname \end{algorithm}   The weirdest part is, it compiles and produces a correct .pdf file. What could be the problem?

When I run the attached code I get this error:  ************************************ Missing \endcsname inserted. <to be read again>                     \c@float@type  l.23 \end{algorithm} ************************************   Any help would be highly appreciated.  \documentclass[aip, amsmath, amssymb, reprint]{revtex4-1}  \usepackage{graphicx} \usepackage{dcolumn} \usepackage{bm} \usepackage{float} \usepackage{algorithm} \usepackage{algpseudocode}  \begin{document}  \begin{algorithm*}   \caption{Hello}   \label{EPSA}    \begin{algorithmic}[1]    \State $T_m= \min\limits_k (T_c(k)),  k_m= \arg\min\limits_k (T_c(k))$    \end{algorithmic} \end{algorithm*}  \end{document}


$$x\sim \frac{x-np}{\sqrt{npq}} \overset{d}{\to} N(0,1)$$   I want to show that normalised binomial distribution converges in distribution to standard normal distribution.   Note that: Convergence in distribution mean  $F$ is cumulative distribution function  If $F_n(x) \to F(x)$ as $n \to \infty $  then $x_n \overset{d}{\to} x$   Also note that   $$M_{x_n}(t) \to M_x(t) \Rightarrow F_n(x) \to F(x) \Rightarrow x_n \overset{d}{\to} x$$   where $M$ is called as moment generating function.  so I need to show that   $$\lim_{n\to \infty} M_{x_n}(t)=M_x(t)$$  For binomial distribution, the moment generating function is $[pe^t +(1-p)]^n$  And for standard normal distribution, the moment generating function is $e^{t^2/2}$

Would absolutely love if someone could help me with this question, in a step by step way to help those who are uninitiated to Statistics and Mathematics.   So, I am trying to "prove/justify" through MGFs how as n(the sample size) increases and goes to infinity, a standardized binomial distribution converges to the Standard Normal Distribution. So in the beginning we have $X_n $~$ Bin(n,p)$ then we standardize this $R.V.$ by subtracting the mean $E(X_n)=np$ and dividing by the $SD$ which is $np(1-p)$. After doing this, we get a new $R.V.$ with $mean=1$ and $variance=SD=1$. It is the distribution of this standardized quantity that converges to a fixed distribution, correct? Namely the Standard Normal Distribution. Let's call the standardized version of $X_n$, $Z_n$.   I think what we need to do is to find the MGF of $Z_n$ and show that this MGF becomes the Standard Normal Distribution's MGF as the sample size $(n)$ heads toward infinity. Now $Z_n$ is a function of $X_n$ which we know the MGF of which is $(1-p+pe^t)^n$.   Now I know that $Z_n$ is a linear transform and that we should be able to use this to simply the MGF but I don't understand how the course notes do it, mostly because they skip a lot of steps and it is difficult to follow. There is also a Taylor Series Expansion for the exponential that I am confused about although I do understand the concept of the series expansion.  Help would be greatly appreciated! I would love assistant in exactly how we can prove this via MGF.   Thanks so much in advance :)


I want to make a function work like an on off switch in python. I know how to do it in Javascript, but I don't understand how indenting works with Python, can someone help point me in the right direction?
test
 <button onClick="myFunction()">change</button>     onoff = 1  def test():   if onoff == 1:     print("on")     onoff = 2   elif onoff == 2:     print("off")     onoff = 1   test() test() test() test()

The following code works as expected in both Python 2.5 and 3.0:  a, b, c = (1, 2, 3)  print(a, b, c)  def test():     print(a)     print(b)     print(c)    # (A)     #c+=1       # (B) test()   However, when I uncomment line (B), I get an UnboundLocalError: 'c' not assigned at line (A). The values of a and b are printed correctly. This has me completely baffled for two reasons:   Why is there a runtime error thrown at line (A) because of a later statement on line (B)? Why are variables a and b printed as expected, while c raises an error?   The only explanation I can come up with is that a local variable c is created by the assignment c+=1, which takes precedent over the "global" variable c even before the local variable is created. Of course, it doesn't make sense for a variable to "steal" scope before it exists.  Could someone please explain this behavior?


I trying to alias a column with "a&b":  eg:  SELECT numberofemployees "Employees (D&B)" from account;    or   SELECT numberofemployees as "Employees (D&B)" from account;   Every other character works fine except for the "&". This query is prompting me to give a value for a variable. I am using it in PL/SQL Developer.

I have a SQL script that creates a package with a comment containing an ampersand (&). When I run the script from SQL Plus, I am prompted to enter a substitute value for the string starting with &. How do I disable this feature so that SQL Plus ignores the ampersand?


I have written this code to insert a new node at any position of the "Linked List"     I know there is build-in library in Java; I am writing this as a practice for Java.  But I get error      java.lang.NullPointerException    I don't know where the problem. Here is my code:   public void insertAtPos(int val , int pos) {          Node nptr = new Node(val, null);                         Node current = start;          /*  Crawl to the requested index */         for (int i = 0; i < pos; i++){             current = current.getLink();         }          /*  Set the new node's next-node reference to this node's next-node reference  */         nptr.setLink(current.getLink());          /*  Set the new node's next-node reference to the new node  */         current.setLink(nptr);          size++ ;   }       /*  Function to set link to next Node  */ public void setLink(Node n) {     link = n; }   /*  Function to get link to next node  */ public Node getLink() {     return link; }


I want to save the string "thats'one" in my table columns, but I don't want to use mysqli_real_escape_string. Can anyone guide me regarding how to do that?

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


Let $f(x)$ be differentiable over $[0,+\infty)$ and satisfy $f(0)=0$.   If there exists a constant $c>0$ such that $|f'(x)|\leq c|f(x)|$ holds   for every $x \in [0,+\infty)$, prove $f(x)\equiv 0.$   This is a version of Bellman-Gronwall inequality.

$f$ is a continuous real valued function on $[a,b]$ and also differentiable on $(a,b)$ such that $f(a)=0$. If there exists $k\geq 0$ such that $|f'(x)|\leq k|f(x)|$ for all $x \in (a,b)$ then show that $f(x)=0$ for all $x \in [a,b]$.   If i show that $f$ is constant function on $[a,b]$ then it will be done. But according to given condition I think Lagrange's MVT is required, but how to apply?


I want to play a game with my best friend. She used to live very near me and we could play minecraft on the same server the whole time. But now she has moved house and we hardly see each other, and we need to play on the same server, just without being on the same internet. How do I do this?

I've had this problem a lot lately because me and my friend would like to play a map together, but the thing is we can't use LAN. She lives in California and I live 700 miles away, so we are definitely not connected to the same wifi. If you could please answer this it would be a lot of help to me because I have been searching this for a while and nothing that works have come up so far. Thanks


Vector spaces like $\mathbb{R}^n$ can have different bases and we can change the basis with a matrix to get a new one. This made me wonder: Are there any vector spaces with $dim>1$ that have only one basis?

Here is the question as an exercise in the book Linear Algebra Done Right, Chapter 2     Find all vector spaces that have exactly one basis.


I want to set the RUN to yes in the /etc/default/saned, as mentioned in .  Here is a snippet of the file :  # Defaults for the saned initscript, from sane-utils  # Set to yes to start saned RUN=no  # Set to the user saned should run as RUN_AS_USER=saned   How can I edit the saned file from within the tty1 terminal?

I guess my question is closer to "How would I go about editing a .conf file from a remote connection via an ssh terminal?"   I downloaded an ssh emulator to my iPhone which works fine and dandy, and I can ssh to my computer at home via DNS services. Right now I'm trying to annoy my room mates who are home right now my getting my machine to beep.  In order to do that I need to edit /etc/modprobe.d/blacklist.config. I tried sudoedit but I got no text.  Anything graphical is out of the question, because I'm essentially in a dedicated terminal like if you pressed Ctrl+alt+F1.


I have been trying to add relative layouts to a linear layout inside a scroll view in android-studio.   It kept giving me an error:  java.lang.NullPointerException: Attempt to invoke virtual method 'void android.widget.LinearLayout.addView(android.view.View)' on a null object reference   I thought maybe I can't add it to the scroll view because of so many layouts. So I removed everything and created a small code like so:  public class ChildAccountsActivity extends AppCompatActivity {      @Override     protected void onCreate(Bundle savedInstanceState) {         super.onCreate(savedInstanceState);         setContentView(R.layout.child_accounts_activity);          LinearLayout linearLayout = findViewById(R.id.accountHolder);          Button myButton = new Button(this);         myButton.setLayoutParams(new LinearLayout.LayoutParams(                 LinearLayout.LayoutParams.MATCH_PARENT,                 LinearLayout.LayoutParams.MATCH_PARENT));          linearLayout.addView(myButton);  <<--ERROR HERE }   Here I am just trying to add a button to the linear layout, but it keeps giving me the error mentioned above.  Any guidance will be appreciated and please keep in mind that I'm new to programming and very likely don't know what I'm doing. Thanks for your time :D

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


Find isomorphism between $S_3$ and $GL_2(F_2)$.   proof: Let $A = \begin{pmatrix}  a& b\\ c  & d \end{pmatrix}$. Where $\det (A) \neq 0$.  And recall $S_3$ is the permutation group with {1,2,3}.  Then there are $6$ different matrices Let $ \begin{pmatrix}  1& 1\\ 1  & 0 \end{pmatrix}$ ,  $ \begin{pmatrix}  1& 1\\ 0  & 1 \end{pmatrix}$ ,  $ \begin{pmatrix}  0& 1\\ 1  & 1 \end{pmatrix}$ ,  $ \begin{pmatrix}  1& 0\\ 1  & 1 \end{pmatrix}$ , $ \begin{pmatrix}  1& 0\\ 0  & 1 \end{pmatrix}$ , $ \begin{pmatrix}  0& 1\\ 1  & 0 \end{pmatrix}$ . And $|GL_2(F_2)| = 6$. And $|S_3| = 3! = 6$ both have orders $6$.  I was trying to construct a map by trying to compare their Cayley tables, but in general matrix multiplication does not commute. Can someone please help me? Maybe we can construct a map, but I am not sure.  I am stuck. Thank you for any help.

Well I want to prove that $GL_{2}(\mathbb{F_{2}}) \simeq S_{3}$ then I need to find a bijection between them, so my attempt for the $\Leftarrow]$ part is to consider the permutation matrix, I will Ilustrate this with an example:  $\sigma = (1 \to3),(2\to1),(3\to2)$ and its permutation matrix is:  $$ \left( \begin{array}{ccc} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{array} \right)$$   Then the pattern is to write a 1 in the place we are mapping our cycle.  But I dont know How to proceed with the $\Rightarrow]$ part, Can someone helpme to finish this bijection please? Thanks a lot in advance.   Note:  $\mathbb{F_{2}}$ is thefield of the integers mod two the consisting of {0,1} :)  THE ABOVE ATTEMPT IS WRONG THEN I NEED YOUR HELP IN BOTH SIDES OF THE ISOMORPHISM THANKS A LOT ;)


I have been trying to prove the statement in the title, however I seem to get stuck at a certain point. Let $M$ be the maximal left-ideal of $R$. Then consider $M.r$ for $r \in R$. If $M.r \neq R$, we have that $M.r \subseteq M$. Now if this assumption would be true, we would have that $M$ is a right ideal as well. However when trying to prove that $M.r \neq R$ for all $r \in R$ I don't get very far. I know that if we assume equality, one would get $m.r=1$ for one $m \in M$. However I don't know how to go from here. Thank you in advance!

If a non-trivial ring $R$ has a unique maximal left ideal $J$ , then $J$ is two-sided and is also the unique maximal right ideal in $R$.  I can prove that it is two sided, but I can't prove that it is unique.  My proof:  Let $r \in R$. Then $Jr$ is a left ideal. If $Jr = R$, then $jr = 1$ for some $j \in J$. Note that $rj \in J$ since J is a left ideal, so $rj \neq 1$. Using a lemma, $1 - rj$ is not left invertible, which is to say that $R(1-rj) \neq R$. But then R(1-rj) is contained in a maximal left ideal, i.e. $1-rj \in R(1-rj) \subseteq J$, so $1= rj +(1-rj) \in J$, which gives a contradiction. Hence $Jr \neq R$. This implies that $Jr$ is contained in $J$. Since the choice of $r$ is arbitrary, $jr \in J$ for all $j \in J$ and $r \in R$. Hence, $J$ is a two sided ideal.  Can someone tell me how I can prove uniqueness?


I want to write shell Code in my LaTeX document. I'm using the listings package, with a code sample adapted from :  \documentclass{report}  \usepackage{color} \usepackage{xcolor} \usepackage{listings}  \usepackage{caption} \DeclareCaptionFont{white}{\color{white}} \DeclareCaptionFormat{listing}{\colorbox{gray}{\parbox{\textwidth}{#1#2#3}}} \captionsetup[lstlisting]{format=listing,labelfont=white,textfont=white}  % This concludes the preamble  \begin{document}  \begin{lstlisting}[label=some-code,caption=Some Code]    NETWORKING=YES  HOSTNAME= f e −19. l o c a l d o m a i n  } \end{lstlisting}  \end{document}   The problem is that there is some extra space between every character when I generate a PDF. I would like the code without this space. The extra space is visible in the the part HOSTNAME=.

I used the following code to list my java code, but the it looks like there's too much space between words. What can I do?  % source code listing \usepackage{listings} \usepackage{color} \usepackage{xcolor}  \usepackage{caption}  % citation style \usepackage{apacite} \DeclareCaptionFont{white}{\color{white}} \DeclareCaptionFormat{listing}{\colorbox{gray}{\parbox{\textwidth}{#1#2#3}}}  \begin{document} \begin{lstlisting}[label=some-code,caption=bind to service call] bindService(new Intent(this, Recognizer.class), recConnection, Context.BIND_AUTO_CREATE); \end{lstlisting} \end{document}   The snapshot of what I got. The code not completely shown, and space too wide, in function bindService.


My players have saved Thundertree for last      Rumors of there being a Dragon in the area enough to provide them caution.   They have cleared the Mine, driven away the bad guys, and found every existing magic item except one.      Of note, one has the Dragonguard armor that grants advantage against breath weapons.   They have been level 4 since entering the Mine, not quite level 5 however, obtaining level 5 only at the END of this adventure, this encounter/area included within that variable exp amount. They all took average HP each level up and are competent though not yet always tactical combatants. They know thier strengths, not how to compensate for weaknesses.  The party includes:     A Goliath Totem Barbarian A human Vengeance Paladin A Gnome Assassin Rogue A Gnome who is a Divination Wizard, and  A Human Life Cleric in heavy armor.   The party is not meant to kill Venomfang, only wound it enough to send it fleeing and survive long enough to do such. My concern is their survival given the CR, damage potential, and breath weapon of Venomfang. I could normally fudge rolls...or not even roll at all...to ensure proper tension while still allowing survival in this encounter that will link them directly to Tyranny of Dragons; but we use a Virtual Tabletop and have asked that I don't hide my rolls. Letting the dice fall where they will with no "divine intervention".   A Flameskull nearly took them out while inside the Mine....with my fudge option taken from me, what chance do they have at bringing Venomfang to 1/2 HP?      Venomfang is a Young Green Dragon with 160 HP and an 18 AC with a Breath Attack that would be devastating in the tight tower that serves as it's lair:  The dragon exhales poisonous gas in a 30-foot cone. Each creature in that area must make a DC 14 Constitution saving throw, taking 42 (12d6) poison damage on a failed save, or half as much damage on a successful one.  42 (provided I take the average) is enough to kill all except the Barbarian.  Hence my conflict.   To add clarity to what I'm asking, as it has seemingly been found unclear:  Can this level 4 party survive long enough to drive off or slay Venomfang?

My group of 8 level 3 players are about to run through the Thundertree Ruins and will probably have a hand at fighting the dragon. My question stems from the fact that a single poison breath attack from the dragon will outright kill all but 1 player assuming they fail their saving throws.  I understand this encounter is supposed to be ridiculously deadly, but I don't want to be punishing my players for testing the lengths at which they can fight stuff. A fight should be challenging and they should be able to try and run away, but instant obliteration seems a bit much.  All PCs are level 3 (HP in parenthesis):   Wood elf moon druid  (27) dwarven frenzy barbarian (44) fire genasi archer ranger (37) (pseudodragon companion (12)) wood elf assassin rogue (27) human wild magic sorcerer (22) dragonborn fighter (29) human monk (24) human fighter (32)


I have got a SQL table with a property 'Stock' and datatype float. According to several posts the equivalent type in C# is double.  So I have got a input which is a string and I convert it to a double value like this:  var number = Convert.ToDouble(numberAsString, CultureInfo.CurrentCulture.NumberFormat);   I have the follwing code to add the number on top of the stock:  result.Bestand += number;   Somehow (this is really strange to me) if I add "0,1" exactly three times, the value changes to  15,299999999999999. I don't know why though.  Remember: I am using commas instead of decimal points.

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I am trying to ask a question about getting my WiFi to work but I don't know what information to add to my question to get help, what do I need?

Your situation   You have successfully installed Ubuntu.  You have just downloaded and booted Ubuntu live media.  The latest LTS (see also ) or latest non-LTS release are preferred. See the list of  that are currently supported.) You upgraded your Ubuntu installation to the latest release that the software updater offered you. WiFi worked before, but not now on the new release. You  to new hardware.   Your problem   The wireless of your laptop or desktop is not working. You tried switching the wireless switch off and on and you tried rebooting several times, but you don't see any WiFi access points. You can see your wireless access point, but you cannot establish a connection. You want to analyze the problem, but you don't know where to start or what information you can provide.   This question and answer was written to give people the wireless script that will provide the information needed in most cases to diagnose their wireless issue's.   Related questions


When trying to use simple but good formatting to visually aid in differentiating parts of a slightly longer answer the extents of vertical space seem wrong.  One example:  This is a headline.  The vertical space visually connecting a headline to the previous paragraph is shorter than the vertical space relating it to the following content. But the following content and the headline form one semantic unit. At least in my reasoning they should be.  Looks to me as if visual layout units are disrupting semantic content units.  Shouldn't this be the other way around – more space separating the previous content a from such an element of order, and optically less space than that to unify headline and following content?  I haven't counted the pixels, but to me it looks as if baselines or x-height are used to calculate equidistance and the effect I see is caused by optically protruding elements?  (Please excuse me if I am just using the syntax wrongly and clarify if it is so, and where I might find guides to improve on this.)

When we use a header in a Question or Answer, the header is starting a new section of text, and is not related to the previous text above it (we have bold etc for highlighting within current text).    However, currently the space above the header is less than the space below it, so the header visually appears to be more closely linked and relevant to the text above the header.    For example:      Here I write some text about conservation within urban areas.    Header to portray I'm starting a new context (or other usage)  Do mice understand algebra when given enhancement drugs?    The header is closer to the text above than it is the text it's relevant to below. I measured it's roughly 5 pixels more space from the bottom of the header to the next text, than it is from the top of the header to the text above.  Can we have the spacing slightly adjusted so (whatever space is decided) there is more above the header than below?    Something like:  margin-top: 1.5em; would do it (i.e. on h2{})    This is what the exact above example looks like with 1.5 em added to the top (using Firebug):     It's not much, but it's enough to separate the text correctly.


I am using the default setting on Texmaker except at quick build option I am using pdflatex + biblatex + pdflatex(2x) + view pdf. It prints the references but the bibliography section does not appear. If I use online overleaf editor I get no errors and it prints the bibliography. The online difference is that at online editor I get refernces like [numbers like 1,2,3], and when I am using Texmaker it appears [refernce name] The biblatex packages that I am using: \usepackage{csquotes} \usepackage[backend=biber,style=numeric,sorting=none]{biblatex} \BiblatexHungarianWarningOff \addbibresource{ref.bib}  The Texmaker output message: This is BibTeX, Version 0.99d (MiKTeX 21.2) The top-level auxiliary file: main.aux I found no \citation commands---while reading file main.aux I found no \bibdata command---while reading file main.aux I found no \bibstyle command---while reading file main.aux (There were 3 error messages)  bibtex: major issue: So far, you have not checked for MiKTeX updates.  Process exited with error(s)

Running the minimal example  \documentclass{article} \usepackage{filecontents} \begin{filecontents*}{\jobname.bib} @ARTICLE{example,   author  = {Other, Anthony Norman},   title   = {Some things I did},   year    = {2014},   journal = {J.~Irrep. Res.},   volume  = {1},   number  = {1},   pages   = {1-10} } \end{filecontents*} \usepackage[backend=biber]{biblatex} \addbibresource{\jobname.bib} \begin{document} Hello\cite{example}. \printbibliography \end{document}   I get the warning There were undefined references.  I have read  and know that I need to run:   LaTeX Biber LaTeX   However, my editor is only set up to run BibTeX. How do I go about setting up my editor/IDE to be able to run Biber, and how do I run the LaTeX/Biber/LaTeX cycle?  Answers (sorted alphabetically by editor name)                    Answer guidelines   Each answer should be for one editor. If the editor is cross-platform, if possible give a single answer with notes covering the minor platform variations. Please edit the question to include new answers in the 'link list' Each answer should be 'stand alone', i.e. don't say 'It's almost the same as editor Y but ...' for the editor part Instructions for 'build tools' such as arara or latexmk are welcome but should explain how to set up the editor in question as not all editors allow simple addition of arbitrary tools


I want to display events within a given month, the event has a start and end date, I cannot find a way to accommodate for events that span more than 2 month. I tried the following, discarding the syntax (it's episerver find client API)  currentEvents = SearchClient.Instance.Search<EventPage>()                .Filter(page => page.FromDate.Exists() & page.ToDate.Exists())                .Filter(page => page.FromDate.InRange(start, end, true, true) | page.ToDate.InRange(start, end, true, true))   let's assume some event has starting date of '20/11/2014' and an ending date of '10/2/2015', by logic it falls in month 1, but using the above logic it will not show. any idea?

Given two date ranges, what is the simplest or most efficient way to determine whether the two date ranges overlap?  As an example, suppose we have ranges denoted by DateTime variables StartDate1 to EndDate1 and StartDate2 to EndDate2.


I am currently playing a Warlock and I am going to take the tome pact boon. I know you cannot be concentrating on two spells at once but if I am concentrating on Hex and I cast guidance immediately before an ability check (same round) would Hex end? It is six seconds or less that guidance would be up. Is that enough time for Hex to end? Could it be considered instantaneous in this case? I guess my main question is could I cast guidance immediately before a check and keep Hex active?

The book says:     Concentration. Some spells require you to maintain concentration in order to keep   their magic active. If you lose concentration, such a spell ends.   So what happens if, for example, you are already concentrating on a spell, and cast Witch Bolt without concentrating. Would you get the initial arc of blue energy, or would it not even go off?  I am asking if you can cast a spell that says concentration without concentrating for an immediate effect. This would be useful to avoid interrupting your existing concentration. In essence, if you are concentrating on thing A (doesn't have to be a spell since other things need concentration), can you cast a concentration spell getting an immediate effect without losing concentration on thing A?  Since the definition of concentration is to keep the spell active (meaning it is already active) I would think that you would get the initial effect (if it had one) without the need to concentrate on it.


I am asking the user to input whether they are a teacher or student and use the response to run a menu specific to their answer.   This is what I have so far but even though the input reads out correctly the result is not working in my if/else statement to call the menus.   I am new to java so unsure what is wrong.   public void welcomeUser(){     //dummy read of String to clear the buffer - bug in Scanner class.     input.nextLine();      String userResponse = "";     do {         System.out.print("Welcome! Are you a teacher or student? (please type => teacher or student): ");         userResponse = input.nextLine();         System.out.print(userResponse);      }     while(!userResponse.equals("teacher") && !userResponse.equals("student"));       if(userResponse.equals("teacher")){         runTeacherMenu();     }      else if(userResponse.equals("student")){         runStudentMenu();     }  }

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


I wanted to install Ubuntu 14 alongside Windows 7 today (Windows was already installed).   In the install menu i choose the "something else option" and gave Ubuntu 200 gb + 8gb for swap like 56mb for /boot thingy and made a 10 gb partition to move files between windows and Ubuntu.    Those are the Partitions which Ubuntu detects      Since i installed Ubuntu, Windows does not show up when i boot my PC , it just goes to ubuntu instantly and does not give me an option to choose.  Is there a way to recover the windows installation or the  files? There are so many files i lost now :(

I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them.


I have plenty of rep to upvote and comment everywhere but when I try to upvote an answer I get an error message saying that because I have less than 15 rep points my vote doesn't count publicly.  What gives?   App Version: 1.6.6.2 Device: iPhone 7 Plus OS Version: Version 11.4.1 (Build 15G77)   Edit: Does rep not carry over between sub-sites? Like, if I have rep on Network Engineering, it doesn't mean I have rep on Ask Different (Apple)?

On Stack Exchange, users may gain a certain level of reputation.  What does reputation do? How can a user gain or lose reputation?   See also   in the Help Center  - Maximum amount of votes a user can use in a day and reputation requirements to vote.  - How to get an exact overview of the actions that got you your reputation.  - A full list of all privileges granted at each reputation level on all sites.


What are the rules regarding the use of too and also? I have read some relevant answers, but none made it clear.  If someone says "my phone is working", what should I reply?   Mine is working too Mine is working also

I have sent this e-mail to Aman also. I have sent this e-mail to Aman too.   Which one is correct? What is the exact difference between the two? Please explain.


It's well known there exists only one finite field with $p^n$ elements, up to isomorphism, where $p$ is a prime and $n \geq 1$. Let $n = m t$, where $m, t > 1$. Then $F = Z_p[X]/(f(X))$ is a field with $p^n$ elements, provided $f$ is some irreducible polynomial of degree $n$ in $Z_p$. By the same token, $G = Z_p[X]/(g(X))$ is a field with $m$ elements ($g$ irreducible of degree $m$). Then $G$ has $p^m$ elements. Finally let: $H = G[X]/(h(X))$ where $h$ is an irreducible polynomial of degree $t$ with coefficients in $G$. Now, in my understanding $F$ and $H$ have both $p^n$ elements. So my question is: Are $F$ and $H$ isomorphic?

Fraleigh(7ed) Theorem33.12. Let $p$ be a prime and let $n\in\mathbb{Z}^+$. If $E$ and $E'$ are fields of order $p^n$, then $E \simeq E'$.   Proof in the text: Both $E$ and $E'$ have $\mathbb{Z}_p$ as prime field, up to isomorphism. By Corollary 33.6(A finite extension $E$ of a finite field $F$ is a simple extension of $F$), $E$ is a simple extension of $\mathbb{Z}_p$ of degree $n$, so there exists an irreducible polynomial $f(x)$ of degree $n$ in $\mathbb{Z}_p[x]$ such that $E\simeq \mathbb{Z}_p[x]/ \langle f(x) \rangle$. Because the elements of $E$ are zeros of $x^{p^n}-x$, *we see that $f(x)$ is a factor of $x^{p^n}-x$ in $\mathbb{Z}_p[x]$*. Because $E'$ also consists of zeros of  $x^{p^n}-x$, we see that $E'$ also contains zeros of irreducible $f(x)$ in $\mathbb{Z}_p[x]$. Thus, because $E'$ also contains exactly $p^n$ elements, $E'$ is also isomorphic to $E\simeq \mathbb{Z}_p[x]/\langle f(x) \rangle$.  I don't know why $f(x)$ divides $x^{p^n}-x$. $E$ has a zero $\alpha$ of $f(x)$, but it doesn't need to have all the zeros of $f(x)$. So $f(x)=(x-\alpha)g(x)$ in $E[x]$ and $g(x)$ need not be splitted into linear factors. How can $f(x)$ divide $x^{p^n}-x$?


How do I integrate $$\frac{\sin x+\cos x}{\sin^4 x+\cos^4 x}$$ ? Tried different ways including the tangent half-angle substitution (which seems to be disastrous).

How can one find $$\int  \frac { \sin x+\cos x }{ \sin^4 x+\cos^4x}\, dx?$$


After setting Java Path and do restart, I was unable to view the desktop, upper right corner controls and left side bar. I able to login with credentials. After that nothing can be done. Just only the purple color window. Unable to do my work. I have shared the image similar to my scenario.

When I login, nothing happens.   I am presented with my desktop wallpaper.    No Dash, no Launcher, nothing.


Is there a closed form expression for the following sum:   $$\sum_{k=0}^s (-1)^k {n \choose k}, $$  where $s \in \{0,1,2,...,n\}$  -- which is basically the first $s$ terms in the alternating binomial coefficients series.   I know if $s=n$, the sum is zero, but I cannot figure out a general closed form expression in terms of $s$.

It is easily checked that $\displaystyle\sum_{i\ =\ 0}^{n}\left(\, -1\,\right)^{i} \binom{n}{i} = 0$, for example by appealing to the binomial theorem.  I'm trying to figure out what happens with the truncated sum $\displaystyle\sum_{i\ =\ 0}^{D}\left(\, -1\,\right)^{i}\binom{n}{i}$.  How far away from $0$ can this get, as a function of $D$ ?.  I'm mostly interested in the case of when $D \ll n$, such as $D \sim \,\sqrt{\,n\,}\,$.  Thanks !


I'm using Asus FX503 laptop Intel® Core™ i7-7700HQ CPU @ 2.80GHz × 8 8GB Ram, 4gb Nvidia Geforce GTX 1050 graphics card,  I recently installed Ubuntu 18.04.2 LTS on my laptop(not as dual boot),  I'ts taking nearly 30 seconds to boot after a fresh install, while it took only 15 seconds to boot, when I was using Windows 10. I know, 30 seconds is not bad, but I was hoping that the boot time would be faster in Ubuntu. Is there anything, that I can do to decrease the boot time in Ubuntu?  These are the systemd outputs:  user@user-FX503VD:~$ systemd-analyze   Startup finished in 3.473s (kernel) + 23.594s (userspace) = 27.067s graphical.target reached after 23.587s in userspace  user@user-FX503VD:~$ systemd-analyze blame      14.555s dev-sda2.device       8.576s snap-core18-782.mount       8.376s snap-gnome\x2dlogs-57.mount       4.661s vmware-USBArbitrator.service       4.564s snapd.service       4.296s NetworkManager.service       3.112s networkd-dispatcher.service       3.054s udisks2.service       2.464s systemd-tmpfiles-setup-dev.service       2.376s dev-loop12.device       2.160s dev-loop14.device       2.138s ModemManager.service       2.115s dev-loop6.device       2.086s dev-loop22.device       2.048s dev-loop4.device       1.993s dev-loop13.device       1.988s dev-loop15.device       1.946s grub-common.service       1.880s dev-loop18.device       1.739s systemd-sysctl.service       1.711s thermald.service       1.673s avahi-daemon.service       1.398s networking.service       1.391s keyboard-setup.service       1.316s gpu-manager.service

After booting I ran systemd-analyze blame and here are the results:       21.596s systemd-journal-flush.service      18.658s dev-sda8.device      15.099s dev-loop33.device      15.034s dev-loop19.device      15.012s dev-loop34.device      14.989s dev-loop21.device      14.877s dev-loop15.device      14.866s dev-loop26.device      14.773s dev-loop27.device      14.684s dev-loop30.device      14.677s dev-loop32.device      14.649s dev-loop35.device      14.590s dev-loop25.device      14.267s dev-loop23.device      14.192s dev-loop24.device      14.156s dev-loop29.device      14.133s dev-loop16.device      14.065s dev-loop31.device      14.059s dev-loop28.device      13.821s dev-loop20.device      13.531s dev-loop22.device      13.495s dev-loop14.device      13.364s dev-loop18.device   What are these dev-loopxx.device (xx denotes numbers) services and why are they taking so much time? Are they related to the mounting of snaps? Can I reduce the boot time by disabling them? I'm running Ubuntu 18.04 alongside Windows 10.


Why only light has photons while x-ray or micro/radio waves don't?   If we build a device that can iterate over all frequencies, what will be so special about the light range that it will start to generate photons while in all other ranges no photons will be made?  Are there special 0 mass particles for x-rays and radio waves or do they also generate photons? (the latter is highly unlikely since radio doesn't travel in a straight line)

Do x-rays and gamma rays also contain photons like visible light does? If so, then what makes photons of visible light and other waves different?  The rest mass of a photon is zero, but as it moves at the speed of light, its mass is infinite. By $E=mc^2$, its energy is infinite, but using formula $ E=h\nu$, we get finite energy. How is this happening?


Suppose I have a multiple linear regression of the form: $$y_i = \beta_0 + \beta_1 x_{i1} + \beta_2 x_{i2} +\beta_3 x_{i3}+\epsilon$$ Then suppose I am interested in testing this set of hypotheses: $$H_0: \beta_1 *\beta_2 = 0$$ $$H_A: \beta_1 *\beta_2 \neq 0$$ I am interested in deriving a score test statistic for this hypothesis.  I understand that I need to derive this under the null hypothesis.  However, I am under the impression that score tests do not work for nonlinear hypotheses of this form, correct?  Additionally, you see that there is a nuisance parameter to also take into consideration: $\beta_3$. Any input would be much appreciated, thank you! Update: this is quite similar to my question .  However, this setting has a nuisance parameter, whereas the other does not.

Suppose I have a multiple linear regression of the form: $$y_i = \beta_0 + \beta_1 x_{i1} + \beta_2 x_{i2} +\epsilon$$ Then suppose I am interested in testing this set of hypotheses: $$H_0: \beta_1 = 0 \text{ OR } \beta_2 = 0$$ $$H_A: \beta_1 \neq 0 \text{ AND } \beta_2 \neq 0$$ I am interested in deriving a test statistic for this hypothesis.  I understand that I need to derive this under the null hypothesis.  However, it is not as straightforward as just plugging in $\beta_1 = 0 \text{ and } \beta_2 = 0$, since our null is that either/or is zero, not both. Any input would be much appreciated, thank you!


I am developing a 2D game with very large levels in which two teams(around 200 objects per team) fight against each other in planes, tanks, turrets,...etc. With every entity shooting bullets at their enemy it is expected that there would be a numerous amount of objects at one instant. What collision detection algorithm could I use to support collision for a massive number of entities at once? The objects are simple figures(rectangles and circles). Would a brute force approach suffice or break up the level into a grid?

I'm working on a 2d topdown shooter, and now need to go beyond my basic rectangle bounding box collision system.  I have large levels with many different sprites, all of which are different shapes and sizes. The textures for the sprites are all square png files with transparent backgrounds, so I also need a way to only have a collision when the player walks into the coloured part of the texture, and not the transparent background.  I plan to handle collision as follows:   Check if any sprites are in range of the player Do a rect bounding box collision test Do an accurate collision (Where I need help)   I don't mind advanced techniques, as I want to get this right with all my requirements in mind, but I'm not sure how to approach this. What techniques or even libraries to try. I know that I will probably need to create and store some kind of shape that accurately represents each sprite minus the transparent background.  I've read that per pixel is slow, so given my large levels and number of objects I  don't think that would be suitable. I've also looked at Box2d, but haven't been able to find much documentation, or any examples of how to get it up and running with SFML.


Considering that I've never studied quantum mechanics before I have need to understand the operator commutator. My start is: $[A,B]=AB-BA \tag{a}$  Now, why must be  $$\left[\frac{\partial }{\partial x},x\right]\stackrel{?}{=}1 \tag{1}$$ I have thought, from the rule (a),  This identity  $$\left[x,\frac{\partial }{\partial x}\right]=-1 \tag{2}$$ is easy because $[A,B]=-[B,A]$. I have not understood, also, (3) and (4)  $$\left[i\hslash\frac {\partial}{\partial x},x\right]=i\hslash \tag{3}$$  $$[p_x,x]=i\hslash  \tag{4}$$ where $p_x$ is the momentum on $x-$ axis.

states that:    $$\sigma(x)\sigma(  p_x )\ge \frac {\hbar}{2}.$$  What is the scientific proof of this principle?


I am making a video that contains both video footage and still frames but I can't find where to change duration of still frames to longer than 4 seconds.  How can I change the duration of a still frame to be longer than 4 seconds in iMovie 10.0.7?

I'm trying to make a simple iMovie time lapse video and it's my first time trying to iMovie '13. I have photos that I would like to change the duration of, only when I click the info icon there's just an image of a clock and no option to change the duration, which is how I've been directed on every other forum, only the option just isn't there. Any other ideas on how to change the time length of multiple photos at once?


Is there a way to ask Ruby what operating system it's running on?  I am using the clipboard gem in conjunction with Selenium and I need the script to run on all systems.  Since the "copy" keyboard shortcut is different on OSX vs. Windows, I would like to be able to tell which operating system my script is being run on.

I want my Ruby program to do different things on a Mac than on Windows. How can I find out on which system my program is running?


Suppose that you have a group of items and you make a hierarchy structure for them. Now, you call this structure, "item hierarchy" or "items hierarchy"?  However, my real phrase is "context hierarchy" vs. "contexts hierarchy"  In general there are some noun-noun constructions which address a group of things. Then the first noun is plural or singular?

As a general rule, I learnt that when stringing together multiple nouns to form a noun phrase, the nouns acting as adjectives lose their ending "s", even if they carry a plural meaning.  For example:   asset inventory (an inventory of many assets) sample collection (a collection of samples) system logs (multiple logs of multiple systems)   Now my question is: if the nouns on the left always lose their s (do they?), how can I distinguish when the noun is actually singular or plural?  See the following examples:   risk analysis (how can I tell apart if the analysis is of a single risk or multiple risks?) system log (is it the log of a single or multiple systems ? ) vulnerability assessment (am I assessing a single vulnerability or more than one?)   and so on...  How can I avoid the ambiguity that derives from this kind of noun phrases?


whan I write a class like this:  public class MyClass{     public void print(){     system.out.println("Hi")    } }   I can instantiate the class in the main even though It has no constructor written by me, is that because it inherits from Object anyway      ?

I have a question about default constructors and inheritance in Java.   Generally, if you write a class and do not include any constructor, Java provides automatically for you a default constructor (one without parameters), which initializes all instance variables of the class (if there are any) with some default values (0, null, or false). If you write a constructor, however, with some parameters, and you don't write  any default constructor, then Java does not provide a default constructor.  My question is: what is the case with classes, which inherit from other classes - if I write a constructor with some parameters in them, but don't include a default constructor, do they inherit the default constructor of the super class?


I have a website and yesterday I renamed all the HTML files to appropriate names to help them show up in searches better. For example one of my pages was called logic.html now its called logic_gates_and_truth_tables.html.   I submitted a new site map to Google and told it to recrawl my site and today I did a site:example.com search and the search results had doubled because it kept"logic.html" in its results and added a new result called logic_gates_and_truth_tables. As you would expect when clicking the old link it gives you a "page not found" error.   How can I get Google to remove the old pages and only list the newly renamed pages?

I have set up my site with sample pages and data (lorem ipsum, etc..) and Google has crawled these pages. I deleted all these pages and actually added real content but in webmaster tools, i still get a lot of 404 errors Google trying to crawl these pages. I have set them to "mark as resolved" but some pages still come back as 404.   Furthermore, I have a lot of these sample pages still listed when i do a search of my site on Google. How to remove them. I think these irrelevant pages are hurting my rating.   I actually wanted to erase all these pages and start getting my site being being indexed as a new one but I read it's not possible? (I have submitted a sitemap and used "Fetch as Google.")


Can I install Visual Studio Community 2019 (not Visual Studio Code)? I don't care if is via Terminal, Ubuntu Software or through download from the website. If is possible, please tell me how. If is not possible, please tell me a replacement for it. Thanks!

How can I install Visual Studio?    I'd prefer to use it in Wine or PlayOnLinux if possible.


Hit a no ball and run 4 runs. Then the fielder will throw that ball and it will go for a six..total 11 runs.  Is that possible?

What is the maximum number of runs allowed to take by running between the wickets per ball including overthrows in international cricket?  If a batsman doubted that he or his partner didn't get reach any of the runs, are they allowed to run more than the maximum number?


I have a sony e series model sve1513acnb with 2 Gb ram & i3 Processor I want to add 2 Gb Ram Memory but I am confused. Which is the best Memory Card is suitable for my laptop?"

I am seeking advice on which memory to use with my motherboard and CPU. Below are my components and some relevant information extracted from their official websites.   NOTE: Although this is a very specific case, a general answer is equally good for me — and also alot more useful for everyone else!  CPU: AMD Phenom II X4 810   ASUS M4A785TD-V EVO listed as one of many  motherboards.   Motherboard: ASUS M4A785TD-V EVO   4 x DIMM, Max. 16 GB, DDR3 1800(O.C.)*/1600(O.C.)/1333/1066/800 ECC,Non-ECC,Un-buffered Memory Dual Channel memory architecture (Complete list of specs: ).   NOTE II: I wouldn't want to do any overclocking as I have no experience with that. So I think the 1333 MHz is the most appropriate. Since the higher frequencies are marked with "O.C."  Questions:   How can I be certain that a specific RAM will work well (or not work) together with my CPU and motherboard? (The Qualified Vendor List is a good starting point, but it's a bit limited and sometimes a bit outdated). Is it true that choice of memory is not independent of the processor? How?    I'm worried I'll be missing something essential when buying my next RAM chips :)


Without coming off as either a gender swapped version of a character (with no differences other than its gender), or being overly feminine/masculine?  For example i am currently playing a female mage in a fantasy RPG. However i am told that i dont come across as feminine at all, especially when i take charge and try to get the party on track. This is especially true when i talk, since obviously the way i construct sentences is masculine and not feminine. My character feels like it would be exactly the same if her gender was male.  On the flip side when i see females play male characters, they generally either come across as really feminine and passive, or they try to be overly masculine (playing something akin to conan the barbarian for example) to the point where it feels like they are trying too hard (hitting on every woman they see, bragging, stereotypical male behaviour)  Any tips?

I rarely play characters of the opposite sex, and I find that I'm not very good at it, at least in my own estimation.  This is hampering when I GM because it limits my range, and makes things hard when I do role-play a female.   I'm comparing my depiction of females to how I would play a male character, and I'm not seeing any difference, besides the bad falsetto. Women do make different choices and have a different way of arriving at a conclusion than men, but I'm not very good at mimicking that.  How can I improve this ability, and how different should I really make female characters than male?  Is this dependent on culture?


I got an edit suggestion approved recently. I usually check the review results to see if something could have been done better and I found that one of the result was "Edit" (instead of the usual Approve or Rejected).    I checked the  and the , but I couldn't figure out what it means.  Was something added to the suggested edit by the user? Or is "Edit" an indication for further editing?

When clicking "edit" I see:  Your edit will be placed in a queue until it is peer reviewed. We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.  Like:     Likewise, when I am not logged in, clicking "improve this question" or "improve this answer" shows:  You are not . Your edit will be placed in a queue until it is .  And when I click 'Save', I get:  Thanks for submitting an edit. It is only visible to you until it's been approved by trusted community members  Like:     Who can suggest an edit? Where do suggested edits go? Who can vote on a suggested edit? How do suggested edits get reviewed? Can I earn reputation? What about abuse or bad edits? Sometimes the Community user approves or rejects my edit. Why is that? When can I not suggest an edit? Is there a minimum change requirement for a suggested edit? How do I check my suggested edit history? I disagree with the reasons why my suggested edit was rejected. What can I do? How do I know whether there are edits waiting for review? Someone suggested an edit to my own post, and the reviewers took the wrong action. What can I do? Are tag wikis included in this scheme? What do the "Improve Edit" and "Reject and Edit" buttons do? Why are apparently valid links to rejected edits resulting in 404 errors?   For more information about editing, see "" in the .


I need some help getting the find command to work right in a script working on. I need to be able to exclude some directories. Below I have what I'm doing as a work around.  sudo find / ( -name firefox -o -name thunderbird -o -name seamonkey \) -type f 2>/dev/null|grep -v '(10_Recommended|repo)'   I would like to exclude some directories so the script or find command doesn't take so long.  In the example above I want to exclude /export/repo, which is an NFS mount and  /10_Recommended* which is the start of a patchset used on Solaris server. The current one being an example like: /10_Recommended_CPU_2014-01.  I have tried using -prune and ! statements and it's just not working. Can someone give me a hand with this?  I'm tuning this command on Solaris 10, RHEL 5, SLES 11 SP2.

I'm trying to use the Linux find command to find all directories and sub-directories that do not have .svn (Subversion hidden folders) in their path. I can only get it to exclude the actual .svn directories themselves, but not any of the sub-directories.  Here is what I'm doing right now:  find . -type d \! -iname '*.svn*'   I've also tried:  find . -type d \! iname '.svn' \! iname '.svn/*'   Just an FYI, I'm trying to use the find pattern so I can apply some subversion properties to all directories in my repository excluding the subversion hidden folders and their sub-directories (by applying the exec command to the directories returned from the find command)..  TIA


I default to the construction of the reals I learned in my first semester Real Analysis course.  This is that they are the set of equivalence classes of convergent Cauchy sequences of rationals.  I am now wondering where in basic Real Analysis the Axiom of Choice is relied upon.  Is that construction of the reals independent of its usage?  If not, can we obtain different models of the real numbers if it is dropped?  (Added) Let me give a specific example of my concern: When I go to prove something like the reals are closed under addition, I say things like: Suppose $x_n$ and $y_n$ are representative cauchy sequences of two reals, then I go on to prove that $x_n + y_n$ is cauchy.  Didn't I just use the axiom of choice there?  Isn't a choice of representative from each of the equivalence classes (which I made to prove the theorem) a usage?

In my introductory Analysis course, we learned two definitions of continuity. $(1)$ A function $f:E \to \mathbb{C}$ is continuous at $a$ if every sequence $(z_n) \in E$ such that $z_n \to a$ satisfies $f(z_n) \to f(a)$. $(2)$ A function $f:E \to \mathbb{C}$ is continuous at $a$ if $\forall \varepsilon>0, \exists \delta >0:\forall z \in E, |z-a|<\delta \implies |f(z)-f(a)|<\varepsilon$. The implication $(2)\implies(1)$ is trivial (though I will happily post a proof if there is sufficient interest).  The proof of the implication $(1)\implies(2)$ is worth remarking on, though. Proof that $(1)\implies(2)$: Suppose on the contrary that $\exists \varepsilon>0:\forall \delta>0, \exists z \in E:\left (|z-a|<\delta \; \mathrm{and} \; |f(z)-f(a)|\ge \varepsilon\right )$.  Let $A_n$ be the set $\{z\in E:|z-a|<\frac{1}{n} \; \mathrm{ and }\; |f(z)-f(a)|\ge\varepsilon\}$.  Now use the Axiom of Choice to construct a sequence $(z_n)$ with $z_n \in A_n \; \forall n \in \mathbb{N}$.  But now $a-\frac{1}{n}<z_n<a+\frac{1}{n}\; \forall n \in \mathbb{N}$ so $z_n \to a$.  So $f(z_n) \to f(a)$.  But $|f(z_n)-f(a)|\ge\varepsilon\; \forall n \in \mathbb{N}$, which is a contradiction. You will have noticed that the above proof uses the Axiom of Choice (the lecturer didn't explicitly spell out the dependence, but it's definitely there).  My question is: is it possible to prove that $(1) \implies (2)$ without using the Axiom of Choice.  I strongly suspect that it isn't.  In that case, can anyone prove that we have to use the Axiom of Choice?  I can think of three ways to do this: (A) Show that $\left( (1) \implies (2)\right)\implies \mathrm{AC}$.  I suspect that this statement is untrue. This is definitely untrue, as Arthur points out, because I only used the axiom of countable choice, which is strictly weaker than AC. (B) Show that $(1)\implies (2)$ is equivalent to some other statement known to require the Axiom of Choice (the obvious example being the well-ordering of the real numbers). (C) Construct or show the existence of a model of ZF in which there exist sequences which satisfy $(1)$ but not $(2)$. Of course, if anyone can think of another way, I would be very interested to hear about it. One final note - I am aware that very many theorems in Analysis use the Axiom of Choice in one way or another, and that this is just one example of such a theorem.  If there exists a model of ZF like the one described in (C), is the study of Analysis in that model interesting?


I've read recently that ++i is much more efficient in C++ than its counterpart i++ because the first (++i) does the increment and returns the incremented value, whereas the latter (i++) creates a copy of the value, return it and performs an increment.   Does the same happen in Java?

Is there a difference in ++i and i++ in a for loop? Is it simply a syntax thing?


I have this code:      <script type="text/javascript">     function js() {         var getJs = document.getElementById("jogo");          if (JS == true) { //if button JS is pressed - it is correct?              < script type = "text/javascript"             src = "file1.js" >           } else < script type = "text/javascript"         src = "file2.js" > </script> } </script>   it doesn't work. I gave two buttons, if the first is pressed, file1.js should be loaded. In case the second one is pressed, file2.js should be loaded.  How can I do that?

How can you reliably and dynamically load a JavaScript file?  This will can be used to implement a module or component that when 'initialized' the component will dynamically load all needed JavaScript library scripts on demand.  The client that uses the component isn't required to load all the library script files (and manually insert <script> tags into their web page) that implement this component - just the 'main' component script file.  How do mainstream JavaScript libraries accomplish this (Prototype, jQuery, etc)?  Do these tools merge multiple JavaScript files into a single redistributable 'build' version of a script file?  Or do they do any dynamic loading of ancillary 'library' scripts?  An addition to this question: is there a way to handle the event after a dynamically included JavaScript file is loaded?  Prototype has document.observe for document-wide events. Example:  document.observe("dom:loaded", function() {   // initially hide all containers for tab content   $$('div.tabcontent').invoke('hide'); });   What are the available events for a script element?


My website: www.kmskinboutique.com   It is now showing a 404 Error warning on 1/2 the page (on the homepage & tabs).  Nothing is missing - the warning just pushed my website down.  I have searched & can't figure out how to repair.  Any help out there??  I recently updated all of my Plug-Ins so I'm not sure which one may have caused this (if they did at all!)  Thanks in Advance! ~K

This is a  about Server Security - Responding to Breach Events (Hacking)   See Also:                  Canonical Version I suspect that one or more of my servers is compromised by a hacker, virus, or other mechanism:   What are my first steps? When I arrive on site should I disconnect the server, preserve "evidence", are there other initial considerations? How do I go about getting services back online? How do I prevent the same thing from happening immediately again? Are there best practices or methodologies for learning from this incident? If I wanted to put a Incident Response Plan together, where would I start? Should this be part of my Disaster Recovery or Business Continuity Planning?   Original Version       2011.01.02 - I'm on my way into work at 9.30 p.m. on a Sunday because our server has been compromised somehow and was resulting in a    attack on our provider. The servers access to the Internet   has been shut down which means over 5-600 of our clients sites are now   down. Now this could be an FTP hack, or some weakness in code   somewhere. I'm not sure till I get there.      How can I track this down quickly? We're in for a whole lot of   litigation if I don't get the server back up ASAP. Any help is   appreciated. We are running Open SUSE 11.0.            2011.01.03 - Thanks to everyone for your help. Luckily I WASN'T the only person responsible for this server, just the nearest. We managed   to resolve this problem, although it may not apply to many others in a   different situation. I'll detail what we did.      We unplugged the server from the net. It was performing (attempting to   perform) a Denial Of Service attack on another server in Indonesia,   and the guilty party was also based there.      We firstly tried to identify where on the server this was coming from,   considering we have over 500 sites on the server, we expected to be   moonlighting for some time. However, with SSH access still, we ran a   command to find all files edited or created in the time the attacks   started. Luckily, the offending file was created over the winter   holidays which meant that not many other files were created on the   server at that time.      We were then able to identify the offending file which was inside the   uploaded images folder within a  website.      After a short cigarette break we concluded that, due to the files   location, it must have been uploaded via a file upload facility that   was inadequetly secured. After some googling, we found that there was   a security vulnerability that allowed files to be uploaded, within the   ZenCart admin panel, for a picture for a record company. (The section   that it never really even used), posting this form just uploaded any   file, it did not check the extension of the file, and didn't even   check to see if the user was logged in.      This meant that any files could be uploaded, including a PHP file for   the attack. We secured the vulnerability with ZenCart on the infected   site, and removed the offending files.      The job was done, and I was home for 2 a.m.            The Moral   - Always apply security patches for ZenCart, or any other CMS system for that matter. As when security updates are released, the whole   world is made aware of the vulnerability.   - Always do backups, and backup your backups.   - Employ or arrange for someone that will be there in times like these. To prevent anyone from relying on a panicy post on Server   Fault.


Many people use the phrase etc. in their writing. However, I have never come across an example of using a comma after it.  So, is it     Almost everybody uses Wi-Fi in their daily lives – be it gaming, emails, searching, etc. for it is their hobby.   OR     Almost everybody uses Wi-Fi in their daily lives – be it gaming, emails, searching, etc., for it is their hobby.   ?  Or perhaps I should use     Almost everybody uses Wi-Fi in their daily lives - be it gaming, emails, searching, etc, for it is their hobby

As a result, I am able to be understanding and accommodating to the people that I work with, including clients, which I believe is an important asset for a professional to have.   I wanted to make sure it is absolutely known that I mean to acknowledge clients as a class of people I can work with. Is this the right way to include it with commas?


There was a user named Moab that stated he could generate an admin pw from the code it spits out after 3 failed attempts, can anyone still do this for me? I am desperate (helping a friend). My code is: i 70256311 Please help!

I have an HP 6730b laptop with a BIOS password and Windows XP password. I do not need any of the content on the disk, I would just like to be able to reset everything and start again from scratch.  Is there any way to achieve this?  Edit: It appears that HP Credential Manager has been used to password the BIOS. This could be why none of the methods I have tried are working.


I just removed my CD Optical drive from my Macbook Pro 2009 and replaced it with an SSD. I cloned my original drive using disk utility and now boot to the SSD. Everything transfered well except for Office. It now asks me to input my key again. Unfortunately I do not have the original key as I purchased the MBP from someone else. Is there a way to find the key within Office on the old hard drive?

I want to use Migration Assistant to transfer my data from a Macbook Pro to a Macbook Air. I'm told that I need my product key for MS Office 2011.   Is there a way to find my product key on my mac?


I'm a relatively new student studying philosophy and became interested in the computer models of mind.  I've read John Searle's CR experiment and had a quick thought. How can CR experiment refute to the below?   If a computer is fed with bunch of data that it actually learns or correctly answers untaught problem, is it not being intelligent?   Say for instance, a system is given a multiplication table from 1 to 100.  It is taught formally and knows how to read the table and give correct outputs of multiplication. Let's say the computer "learns" how to multiply (say the data above is enough for the computer to actually learn multiplication).  If a user asks "101 x 101?" and the computer correctly answers it, this displays learning and thus capability to think?

Searle invented a thought experiment, the , which he proposes is an argument against Strong AI (that machines think) but not against Weak AI (that machines simulate thinking), he has a man in a room manipulating chinese symbols via an instruction book written in english.   My question is, Where does this instruction book come from? We're all aware that humans write the code that drives a computer, or writes code that writes more code to drive a computer (ie a compiler) etc.  My clarification (that is, if it is), of Searle's Chinese Room thought experiment, is to have a man (John) who doesn't understand Chinese in a room with two windows. At one window, someone (Mai) submits questions in Chinese, at the other window stands a man (Lao) who does understand Chinese; when a question is submitted, John takes the question walks across the room, and passes it through the window, and gives it to Lao, who reads it, answers it, and then John walks back to the first window, and hands the answer back to the Mai.  To Mai, it appears John understands Chinese (even, if he rather strangely refuses to speak it). She is not aware that he has a secret human collaborator, Lao.  I think this models what actually happens in a computer, much more clearly. But is this an accurate analogy?


I posted this question as guest with some issues that should be fixed in this version so here it goes.  I have the following self defined counter and command:  \documentclass{article}  \newcounter{usecase}[section] \newcommand{\usecasenumber}{\arabic{usecase} \stepcounter{usecase} \newcommand{\usecase}[9]{     \begin{tabular}{| p{4cm} | p{8cm} |}         \hline         Anwendungsfall-Nummer       & U-\usecasenumber  \\         \hline         Hauptakteur                 & #1                \\         \hline         Andere Akteure              & #2                \\         \hline         Beschreibung                & #3                \\         \hline         Vorbedingung                & #4                \\         \hline         Nachbedingung               & #5                \\         \hline         Ausführung                  & #6                \\         \hline         Alternativen                & #7                \\         \hline         Ausnahmen                   & #8                \\         \hline         Benutzte Anwendungsfälle    & #9                \\               \hline     \end{tabular} }  \begin{document} \usecase{1}{2}{3}{4}{5}{6}{7}{8}{9} \end{document}   I now want an environment named usecase that does the exact same thing my newcommand does plus adding another line to the table with the name that one should be able to give the usecase environment. The environment should be able to automatically increase the counter and I want to be able to add labels to the usecase environment (just like it is possible in figure or table). When I reference such a label with \ref I want the reference to be the number of the environment given by the counter usecase.  I am not sure how to realize that or if it is even possible. I would start with something like this but I don't know how to proceed from there on to achieve the desired behaviour.  \newenvironment{usecase}[1]{\refstepcounter{usecase}}{     % TODO }   It would be really appreciated if someone could help me out here. :)  Edit:  Alternatively, I woul be O.K. with a floating environment named usecase that takes a paramater that will be its caption. If that makes it any easier.


Can I use the middle click mouse button so I can scroll down faster, like in Windows?  When I am in Windows and I press the middle click somewhere I can scroll in, a 4-way pointer shows on the screen, and when I move the mouse in any direction, the window will scroll in that direction even without continuing to press the middle button.  Is there anything like this in Ubuntu? How can I do this, especially in Chrome!

How can I get the middle mouse button to behave correctly in Ubuntu? Clicking the middle button does not show the arrow which allows me to scroll the page by moving the mouse.  Information:   Firefox 3.6.8 Mouse: Microsoft Intellimouse Explorer 3.0


It might be a very stupid question but I just don't understand this code:  >>> a=[[0]*3]*3 >>> a [[0, 0, 0], [0, 0, 0], [0, 0, 0]] >>> a[0][1]=3 >>> a [[0, 3, 0], [0, 3, 0], [0, 3, 0]]   Why a call a[0][1] will initialize the whole second column to be 3?

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


The only solution I know to get all the classes and examine whether they have a specific annotation.    for (Class clazz : classes){             clazz.isAnnotationPresent(SomeAnnotation.class);   }   I would like to use something like this:   List<Class> classesUsingAnnotation = SomeApi.getAllTargetTypeForAnnotation(SomeAnnotation.class)   Is there any API out there for this?

What is the best way of searching the whole classpath for an annotated class?  I'm doing a library and I want to allow the users to annotate their classes, so when the Web application starts I need to scan the whole classpath for certain annotation.  Do you know a library or a Java facility to do this?  Edit: I'm thinking about something like the new functionality for Java EE 5 Web Services or EJB's. You annotate your class with @WebService or @EJB and the system finds these classes while loading so they are accessible remotely.


I'm trying to create a one-liner which should remove excess files from dir to save it from consuming too much space.  ls -r --sort=time | head -${{ls | wc -l} - n} | xargs rm -f   n should stand for number of files I want to keep in directory.  I'm doing something wrong here and can't figure out what. Can someone help please?

Is there a simple way, in a pretty standard UNIX environment with bash, to run a command to delete all but the most recent X files from a directory?  To give a bit more of a concrete example, imagine some cron job writing out a file (say, a log file or a tar-ed up backup) to a directory every hour. I'd like a way to have another cron job running which would remove the oldest files in that directory until there are less than, say, 5.  And just to be clear, there's only one file present, it should never be deleted.


Is there a downside to doing this:  import java.util.*;   rather than importing a specific part:  import java.util.Stack;   Does it take more time to build for example?

It is much more convenient and cleaner to use a single statement like  import java.awt.*;   than to import a bunch of individual classes  import java.awt.Panel; import java.awt.Graphics; import java.awt.Canvas; ...   What is wrong with using a wildcard in the import statement?


I have to travel for a summer course in August in Netherlands but before that i travel to Saudi Arabia in June. I'll have to submit my passport to saudi embassy around the mid of may and i return back mid July. Keeping all this in view can i apply for the visa rn? I'm from Pakistan.

I am indian citizen on H1b visa in US. I am planning to visit France in Oct 2014. Can I apply for Schengen visa now about 3/4 months in advance. Are there any restrictions that on early you can apply for Schengen visa.


I had applied for Shengen visa to attend a conference in Rome but it was refused for the following reason:     One or more member state(s) consider you to be a threat to public policy, internal security, public health as defined in Article 2(19) of Regulation (EC) No 562/2006 (Schengen Borders Code) or the international relations of one or more of the member states.   I am a master's student and have clean record, I don't understand why the visa was refused for that reason.   suggest that I need to consult a lawyer but the deadline to lodge an appeal has almost passed and I don't need the visa now, beacause the conference is already finished. I still want to clear this misunderstanding, however. What should I do? Where do I start from?

I applied for German Schengen visa as a medical escort to my relative in a different country from  where I reside, but my visa application was refused and the refusal letter  was written in German as the following:        Ein oder mehrere Mitgliedstaaten sind der Auffassung, dass Sie eine Gefahr für die öffentliche Ordnung, die innere Sicherheit, die   öffentliche Gesundheit gemäß Artikel 2 Absatz 19 der Verordnung (EG)   Nr 562/2006 (Schengener Grenzkodex) oder die internationalen   Beziehungen eines oder mehrerer Mitgliedstaaten darstellen.      I was in Germany for nearly a year with my relative during his treatment; I extended my stay there 3 times; and I returned back home two months ago in order to renew my passport. I applied again using the same documents that I used for my extension in Germany.    First, can anyone tell me what the refusal means? Next, is there any possibility that there is a mistake in the assessment?    Note: In English this reason is...     One or more member state(s) consider you to be a threat to public   policy, internal security, public health as defined in Article 2(19)   of Regulation (EC) No 562/2006 (Schengen Borders Code) or the   international relations of one or more of the member states).


Q. Given two line segments of length a and b. Draw a line segment of length $\sqrt{ab}$ using a ruler and compass.  I didn't get any idea how to approach to the solution.

Given   A straight line of arbitrary length The ability to construct a straight line in any direction from any starting point with the "unit length", or the length whose square root of its magnitude yields its own magnitude.   Is there a way to geometrically construct (using only a compass and straightedge) the a line with the length of the square root of the arbitrary-lengthed line?  What is the mathematical basis?  Also, why can't this be done without the unit line length?


Kernel driver not installed (rc=-1908)  The VirtualBox Linux kernel driver is either not loaded or not set up correctly. Please try setting it up again by executing  '/sbin/vboxconfig'  as root.  If your system has EFI Secure Boot enabled you may also need to sign the kernel modules (vboxdrv, vboxnetflt, vboxnetadp, vboxpci) before you can load them. Please see your Linux system's documentation for more information.  where: suplibOsInit what: 3 VERR_VM_DRIVER_NOT_INSTALLED (-1908) - The support driver is not installed. On linux, open returned ENOENT.

I tried to use my Virtual Box and this is the error I received - (I just updated to the new Ubuntu also) and I am VERY new at this Linux OS.     Kernel driver not installed (rc=-1908)      The VirtualBox Linux kernel driver (vboxdrv) is either not loaded or   there is a permission problem with /dev/vboxdrv. Please reinstall the   kernel module by executing      '/etc/init.d/vboxdrv setup'      as root. Users of Ubuntu, Fedora or Mandriva should install the DKMS   package first. This package keeps track of Linux kernel changes and   recompiles the vboxdrv kernel module if necessary.


To subdivide longer proofs of theorems, I use two list environments defined using enumitem: pfsteps for numbered steps and pfparts for labeled parts.   Horizontal space problems  1) In the pfsteps enumerate list, there seems to be a bit too much horizontal space after the colon that follows the step number — more space than would follow a colon in ordinary text.  2) In both the pfsteps enumerate list and the pfparts description list, there is definitely too much horizontal space between "Proof" and the first label of the list.  Questions  Problem 1) can be fixed by using something like the commented-out line \hspace{-1pt} after the colon in the definition of label for pfsteps. But is there a nicer way to decrease this space?  How can Problem 2) be fixed, for both the pfsteps and the pfparts list environments.  Sample source  \documentclass[12pt]{memoir}  \usepackage{amsthm}  % Indent ``Proof.'' \usepackage{xpatch} \newlength{\normalparindent} \AtBeginDocument{\setlength{\normalparindent}{\parindent}} \xpatchcmd{\proof}{\hskip\labelsep}{\hskip\labelsep\hskip\normalparindent}{}{}  \let\oldproofname=\proofname \renewcommand{\proofname}{\sffamily\bfseries{\oldproofname}}   \usepackage{enumitem}  \newlist{pfsteps}{enumerate}{3} \setlist[pfsteps,1]{%   %label=\sffamily{Step {\arabic*}:\hspace{-1pt}},   label=\sffamily{Step {\arabic*}:},   ref=\normalfont{\arabic**},   wide,itemsep=0pt,topsep=0pt }  \newlist{pfparts}{description}{1} \setlist[pfparts,1]{%   font=\normalfont\textsf,   itemindent=0pt,   wide,   itemsep=0pt,topsep=2pt, }  \begin{document}  Proof using \verb!pfsteps! enumerate list.  \begin{proof}  \begin{pfsteps}  \item do this first. The way to begin is to start at the very beginning and use the definitions involved to get going.  \item do this next. After the initial step, we proceed by showing something interesting next.  \item conclude with this. That's it! \qedhere  \end{pfsteps}  \end{proof}  \bigskip  Proof using \verb!pfparts! description list.  \begin{proof}  \begin{pfparts}  \item[Sufficiency.] First we show that the stated condition is sufficient for the conclusion to hold.  \item[Necessity.] To conclude the proof we show that the stated condition is a necessary condition for the conclusion. \qedhere  \end{pfparts}  \end{proof}  \bigskip  For comparison, a proof that is not divided into steps or parts.  \begin{proof}  Here is the proof of the main result. % \end{proof}   \end{document}   Output  In the output shown below, the red arrows point to excessive space. (And for comparison, the green arrow points to the normal space after a "Proof."

Consider the following example:  \documentclass{article} \newtheorem{Theorem}{Theorem} \begin{document} \begin{Theorem} On the other hand, this one has only one claim. \end{Theorem} \begin{Theorem} \begin{enumerate} \item First claim \item Second claim \end{enumerate} \end{Theorem} \end{document}   Typesetting it results in:    Notice there is extra horizontal space before the first item in the list of the second theorem.     Is there a sensible way to get rid of that?   Ideally, the solution would work with amsthm, thmtools, enumitem.  N.B.: this is related to  but not quite the same.


I am wondering which flag to raise upon catching sight of something like this:     Asdfghjkl lkjhgfdsa     Spam? It's not promoting anything. Rude or abusive? It's not speaking ill of anything. Not an answer? Of course it isn't but it isn't even anything meaningful.  BTW, is there archived examples for all kinds of flags? I am curious if there has ever been a question flagged as 'Blatantly Off-Topic'.

Spam gets fairly heavily punished - 100 reputation penalty, if I recall correctly, and the content itself gets hidden in the revision history.  Now if we just have some rubbish:     dfajiojaifojadiofjadhigaowkokaomdiovnuiyhioqejgioqejgio   I'm not talking about someone posting a question or comment as an answer (i.e. possibly just not knowing the rules or being frustrated with not having the required privileges), or someone making some really horrible attempt at answering the question, I'm talking about an answer that clearly shows absolutely no observation of any content on the page.  This, in my opinion, causes a similar amount of harm to the site - I'm inclined to say the fact that someone posts spam isn't as important as the fact that they're posting something that needs to be deleted, since we're likely going to delete it pretty quickly, and they're (likely) behaving maliciously, or am I wrong?  Why don't we treat this equally harshly, or why do we treat spam as harshly as we do?    Side notes:  I'm sure I've seen a few times where users get punished for posting spam when their link is likely actually relevant to the question and useful (should I flag these? They are still link-only answers, so they shouldn't really come back, and often I'm just not sure enough). While false positives are bad, it seems worse that we're treating worse behaviour better.  I'm assuming that's not what "abusive" in this reason is referring to: (I'm also not sure, off the top of my head, how this one gets treated)     It is offensive, abusive, or hate speech


I posted the following question, and answer (for documentation purposes), to Stack Overflow since that is where I originally looked for the answer (and didn't find one):    I thought it might fit on Server Fault as well so I was going to copy the question and answer over but was unsure if that was appropriate or if there was a better way of going about it.  Just like copying and pasting code is not a good programming practice, is there some way to reuse this question/answer on Server Fault?

I've been a Stack Exchange contributor for a couple of years now, currently most active on . One thing that keeps coming up is questions that would appeal to audiences on two different Stack Exchange sites but there are almost no features taking advantage of these questions. On travel.SE we have crossover questions most often with  and possibly next most often with  - but it can happen with almost any SE site. Today alone we had  with  and  had . I am absolutely sure that this must happen all the time between arbitrary pairs of Stack Exchange sites but the only feature that takes advantage of it is the possibility of migrating off-topic questions which leaves the original question acting as a redirect across the two sites. I think there is a missed opportunity to build the network between sites where users of one site don't realize they could make valuable contributions to a sister site they have had so far little to do with. At the very least there could be a way to "advertise" a question on a second site that could be interested in it. Probably by listing it in the sidebar where there are also links to meta questions, linked questions, related questions, new blog posts, and But there could also be some kind of features that make some sort of acceptable crossposting. There could be gamification/badges added around building cross-site questions or whatever else you can think up. I think this is a great way for people to spread their expertise from their main site onto other sites, to make the network stronger and more cohesive, to bring more attention to questions that would have a divided audience between two sites. I can think only of positives and no negatives. Does anyone else have some ideas to add or think this is a bad idea for any reason?  Example crossover questions: Here are some links to some crossover questions I've been finding in the Stack Exchange network here. (This was previously posted as an answer, but more people wanted it to be part of the question.)   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :


I am using the IEEEtrantools package with TeXstudio. I have the problem that when writing an equation with  \begin{IEEEeqnarray}     <formula> \end{IEEEeqnarray}   it marks all math commands red and complains 'math command outside math env'. This is sad, because it looks a lot less beautiful and readable like this, which is in my opinion a big benefit of TeXstudio.  Any idea how to fix this? I have already included the IEEEtrantools.cwl file into the 'permanently active completion files' (according to this question: ) and it still does not work.  EDIT:   TeX distribution: TeX Live 2015/Debian document class: scrreprt color related packages: color, graphicx, amsmath   In case it was not clear: the math commands appear red in the editor, no in the document.

I am using TexStudio 2.9.4 on Windows 7. There is a problem that has been raised here at least once. It is that TexStudio flags unrecognised command  to  \begin{IEEEeqnarray}{rCl} and then within the environment flags expressions like \mathrm as being used outside the math environment. The fix (on Windows) is to manually edit the file C:\Users\USER\AppData\Roaming\texstudio\IEEEtrantools.cwl adding:  \begin{IEEEeqnarray}{cols}#\math,array \end{IEEEeqnarray} \begin{IEEEeqnarray*}{cols}#\math,array \end{IEEEeqnarray*}   in place of the \IEEEeqnarray entry there.   This works but is there a separate file that I could add (eg myfixes.cwl) which TexStudio would read? Burying the fix in a big autogenerated file is not ideal.  BTW is there any documentation on the format of .cwl files?


How can I calculate the determinant of the following matrix?  $$A=\begin{pmatrix} \lambda&&&a_0\\ -1&\ddots&&\vdots\\ &\ddots&\lambda&a_{n-2}\\ &&-1&\lambda+a_{n-1} \end{pmatrix}$$  I've tried to calculate the determinants of the $2 \times 2$ and $3 \times 3$ ones and finally got something like  $$\det(A_n)=\lambda^n+\lambda^{n-1}a_{n-1}+\dots+a_0$$  But in order to prove this solution a mathematical induction would be necessary. Is there any more efficient way?

I have a matrix in companion form,    $$A=\begin{pmatrix}  0 & \cdots & 0& -a_{0} \\  1 & \cdots & 0 & -a_{1}\\ \vdots &\ddots & \vdots &\vdots \\ 0 &\cdots & 1 & -a_{n-1} \end{pmatrix}$$    where $A \in M_{n}$. I want to prove by induction that the characteristic polynomial is  $$p_{A}=t^{n}+a_{n-1}t^{n-1}+\cdots +a_{0}$$  The part that is confusing me is if we assume this hold for $A_{1}\in M_{n-1}$ how do we transform, or "add" to $A_{1}$ to get the n by n matrix $A\in M_{n}$? I hope this makes sense.


So far, I could solve all my monitoring needs (like CPU and memory usage, network traffic, and disk activity) with ksysguard. It was what came preinstalled with KDE, it's easy enough to figure out, it is easy to adapt the display to whatever you're looking for, and with a bit of google & error I was able to set up ksysguardd on remote systems to do over-the-network monitoring, too. Being able to save log data to file was also useful.  Now, I would like to log such performance data on the remote server, i.e. without having a ksysguard instance running on a "monitor system" locally. I know that this should actually be easier than transferring the data over the network and displaying it in graphs and bars, but I honestly admit I am clueless.  Googling gave me links to several enterprise-level, everything-and-the-kitchen-sink solutions, but it seemed none of them would be quite as easy to set up and configure as ksysguard was (especially not without root access on the to-be-logged system), and I am not sure I am up to the task, and certainly not willing to invest more than 1-2 hours into the subject.  Can you people give me suggestions on simple performance logging solutions for Linux?  Edit: I should have mentioned, one of the core requirements is that the logging must be able to run without root access.

We are running two production servers with Apache 2 and MySQL. I am looking for a reliable way of monitoring our load, stability and uptime.  I have come across , but are there better alternatives?


What is the best way for checking empty strings (I'm not ) in C# when considering code performance?(see code below)  string a;  // some code here.......   if(a == string.Empty)   or  if(string.IsNullOrEmpty(a))   or  if(a == "")   any help would be appreciated. :)

In C#, I want to initialize a string value with an empty string.  How should I do this?  What is the right way, and why?  string willi = string.Empty;   or  string willi = String.Empty;   or  string willi = "";   or what?


I am trying to replace string with a sentence or paragraph contacting multiple newline characters using shell script. Replacement string will be generated run-time.  eg:   sed /string_to_be_replaced/Replacement(newline character) string (newline character)/g   Any inputs/ideas are welcome. Thanks!

I have a script that reads a text stream and generates a file of sed commands that is later run with sed -f. The generated sed commands are like:  s/cid:image002\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1922/g s/cid:image003\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1923/g s/cid:image004\.jpg@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1924/g   Assume the script which generates the sed commands is something like:  while read cid fileid do     cidpat="$(echo $cid | sed -e s/\\./\\\\./g)"     echo 's/'"$cidpat"'/https:\/\/mysite.com\/files\/'"$fileid"'/g' >> sedscr done   How can I improve the script to ensure all regex metacharacters in the cid string are escaped and interpolated properly?


Prove that the rings $2 \mathbb{Z}$ and $3\mathbb{Z}$ are not isomorphic. I find that if i make a map $\phi$:$2 \mathbb{Z}$ $\longmapsto$ $3\mathbb{Z}$ the map homomorphism works. so the only thing that i need is to show that $\phi$ is not surjective. How do i show that.

How are $2\mathbb{Z}\ncong3\mathbb{Z}$ different as rings? What interesting properties does one have that the other doesn't?