I edited  to improve the formatting.  However, when I clicked "Save", it complained that the "Title was too short".  This seems unfair to me since I didn't modify the title and had no interest in doing so.  I tacked on "...?" but felt a bit silly for doing so.

Test to see if the title length requirement can be circumvented by appending lots of dots.


Have installed Ubuntu and windows 7.But now while booting system boots via windows and no grub screen is seen.

I installed Ubuntu on a Dell XPS 13 laptop that had Windows 10 preinstalled on it. I installed it from a USB flash drive on a partition. When I boot my computer I can only boot into Windows 10 and Ubuntu is nowhere to be seen.  If I boot into my USB then I can see that Ubuntu is installed, but I can't get to it from the BIOS boot menu.


For a project I'm working on I'm adding records to a list. But a button in the added content does not execute the javascript it is supposed to execute.   I've made a scribble out of it - as simple as I could make it - to demonstrate.  The button "some content to click" fires of an alert like I expect. The button 'some other content to click' does not.  I suspect this has to do with the html not being there on load... but I'm clueless on how to solve this.  Anyway... if you guys are willing to help... here is the code:  <!DOCTYPE html>       <meta http-equiv="content-type" content="text/html; charset=UTF-8">     <title>scribble</title>
         <button class='clickme'>add record</button>

                 <button class='record_button'>some content to click</button>

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


One of the axioms of special relativity is that the speed of a massless "particle" such as light is c in all reference frames. In this comment from another question, , someone stated that there is no reference frame that moves at speed $c$ due to this axiom. This is confusing. Is there no reference frame for massless particles such as light? Are reference frames and mass linked?     kind of answers the question.

Quite a few of the questions given on this site mention a photon in vacuum having a rest frame such as it having a zero mass in its rest frame. I find this contradictory since photons must travel at the speed of light in all frames according to special relativity.  Does a photon in vacuum have a rest frame?


Referring to something that means a step-by-step tutorial, which is the correct word / term ?  walk-through  walkthrough  walk through  I'm under the impression that the dash version "walk-through" is correct as that seems to be the most commonly used.  Most spell checks flag "walkthrough" as not a word, so I'm pretty sure that's out.  Most grammar checks to not seem to flag the spaced version "walk through", however, so I'm not 100% sure.  Thoughts on this?  -- EDIT -- Not sure why somebody linked to a post about "well-being" vs "wellbeing" clearly not the same word(s) I'm asking about.

Some compound words are written without hyphens (nonaggression, nonbeliever), some with hyphens (well-intentioned), and others with spaces (post office).  Is there a rule or good guide as to which option should be used?


I don't know the German language and I stumbled upon this book. I tried google translate and utterly failed. I just need to know what this volume is mainly about.

I have been trying to study elliptic functions and theta function for quite some time and have already got the hang of the classical theory (Jacobi/Ramanujan) based on real analysis, and now would like to study the arithmetical part related to imaginary quadratic fields and their relation to elliptic functions. Having very limited knowledge of Group Theory and Galois Theory (and things covered under Modern/Abstract Algebra) I tried to find classical references and stumbled upon Weber's Algebra, but unfortunately it is in German. Does anyone know if an English translation exists and if so how can it be obtained?  If there is no English translation available can someone point out any good references for "Imaginary quadratic fields and their relation to elliptic functions" keeping in view my very limited knowledge of Abstract Algebra.


I'm looking at this pretty easy problem, but I need the final argument for the mean-value property that I'm looking for. The problem goes like this.     Prove that if $V = \{z \in \mathbb{C} : \mathrm{Re} z \leq 0 \}$, then   $$|\mathrm{e}^{z}- \mathrm{e}^{w}| \leq |z-w|$$ for $z,w \in V$.   So my idea is obviously to apply the mean-value theorem for $f(z) = \mathrm{e}^z$ and bound it by $$\left| \frac{f(z) - f(w)}{z-w}\right|\leq 1.$$ But how do I argue that $$\frac{f(z) - f(w)}{z-w} \leq f'(0)?$$ This would finish the problem immediately.

Came across this problem on an old qualifying exam: Let $a$ and $b$ be complex numbers whose real parts are negative or 0. Prove the inequality $|e^a-e^b| \leq |a-b|$.  If $f(z)=e^z$ and $z=x+iy$, then $|f'(z)|=e^x\leq 1$ given that $x \leq 0$. I played around with the limit definition of the derivative, but wasn't able to get anywhere. Not sure what else to try; a hint would be very helpful!


I am facing a problems with this question : Prove that If x and y are integers and x + y is odd , then x−y is odd. , any suggestions ?

the homework question I'm having trouble with is this one.  Write a detailed structured proof to prove that for all the integers $x$ and $y$, $x - y$ is odd if and only if $x + y$ is odd.  I have the proof format and structure down fine, its the proof part that is throwing me in circles.  What I worked out so far makes no sense so I think my understanding of it is flawed.  $2k+1$ is the definition of odd, so I use that when trying to prove it. I'm going off the premise ($x - y$ is odd) $\Rightarrow$ ($x + y$ is odd)  Let $i \in \mathbb Z, $ be such that $x - y = 2i + 1$.  Then $x - y = 2i + 1$.  $2i = x - y - 1$.  $i = (x - y - 1)/2$.  $Let  p = i$.  $x + y = 2p + 1$.  $x + y = 2(x-y-1)/2 + 1$.  $x + y = x - y$.  So now I end up with an impossible case... Can anyone help me understand what I'm doing wrong?


I just came across  thread, and i asked myself:  I know that $\sum^\infty_{n=0} x^n = \frac{1}{1-x}$  But what happens when we set up the sum like  $$\sum^\infty_{n=0} nx^n = ?$$  There is probably a formula for that as well, at least there must be some coincidence, for the limited sums i already saw the prove in the thread i mentioned above. My books could not help me out so far.. If there is a formula for this, i would also like to see the derivation of it..   Searched the web with no luck so far. If you know a website or thread where this is explained, probably a link is enough for an answer.. I appreciate your help!

How can I evaluate $$\sum_{n=1}^\infty\frac{2n}{3^{n+1}}$$? I know the answer thanks to , but I'm more concerned with how I can derive that answer. It cites tests to prove that it is convergent, but my class has never learned these before. So I feel that there must be a simpler method.  In general, how can I evaluate $$\sum_{n=0}^\infty (n+1)x^n?$$


I was trying add ones to some specific position in a 100*100 zero matrix. My code was something this:  adjacency=[[0]*100]*100 while ...     x=...     y=...     adjacency[x][y]=adjacency[x][y]+1   But it adds to other positions as well. In face, adjacency[0]=adjacency[1]=..=adjacency[99], while there's no way that the calculation of x, y in while-loop will produce this kind of result.  So, I changed to array. The only thing I changed was:  adjacency=np.zeros((100,100))  And the result is right this time. Adjacency[i] no longer equals to each other.  Does anyone know why? (Using Python2.7.)

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?


For P(n) being the assertion that in every set of n horses, all horses have the same color: P (n) ⇒ P (n + 1), when n > 1.  How do I prove this problem, can someone give me explanation or a headstart?

I'm bugged by the following that's summarized on p. 109 of .     False theorem: All horses are the same color.      Proof by induction:      $\fbox{$P(n)$ is the statement: In every set of horses of size $n$, all $n$ horses are the same color.}$   $\fbox{Base Case or $P(1)$:}$ One horse is the same color as itself. This is true by inspection.   $\fbox{Induction Step:}$ Assume $P(k)$ for some $k \geq 1$.   $\fbox{Proof of $P(k + 1) :$}$   Since $\{H_1, H_2, ... , H_n\}$ is a set of $n$ horses, the induction hypothesis applies to this set. Thus, all the horses in this set are the same color.   Since $\{H_2, H_3, ... , H_{n+1}\}$ is also a set of $n$ horses, the induction step likewise holds for this set. Thus, all the horses in this set are the same color too.         Therefore, all $n +1$ horses in $\{H_1, H_2, H_3, ... , H_n , H_{n+1}\}$ are the same color. QED.   The issue the instructor was trying to point out is clearly valid. For the case $n = 1$, there is only ${H_1}$. So this case says nothing about possible overlapping elements of each set of $(n + 1)$, for instance $H_2$ in the above proof.    But it was proposed in the class discussion that this was the only problem. Had you been able to prove $P(2)$ true, then a proof of the above format would have been fine.    My interpretation is that yes, you could prove all horses are the same color, if you can prove that any set of two horses will be the same color. But this format would not work.  Why not? The problem I see is that the above proof is for the existence of at least one particular pair of sets of horses of sizes $n$ and $n + 1$, such that in each set, all horses are the same color.  Particularly when the set of size $n$ is a subset of the set of size $n + 1$.  In order to prove the induction step, don't you need to prove that sets of sizes $n$ and $n + 1$, do not necessarily contain the same, overlapping elements?  You could prove that any horse can be added to a set of 2 horses.  Take the last two, and they must be the same color, and so on.  Wwhatever color the first two happen to be, all other horses must thus be the same color.    Am I misinterpreting the example, or am I making a logical error? Thanks in advance.


When i work on QGIS project (named "pro"), some file with this symbol appears in the workspace folder with the name "pro.qgs~":     I tried to open it- but with no success.   How can i open it and what is the purpose of it? What to do, so this file will not create in the folder?

When saving a project file (.qgs), which when executed is automatically loaded with qgis.bat, there's another .qgs file which appears in the same directory of the original project file, although this one is not loaded with the qgis.bat file:    This is just out of curiosity but is the latter designed to be a backup of the original .qgs file?


I used this code: Scanner SC = new Scanner(System.in); String Gender = " "; System.out.println("...."); String Ans1 = SC.nextLine(); Ans1 = Ams1.toLowerCase(); if(Ans1 == "yes") {   Gender = "male";   System.out.println(Gender); } else { System.out.println("Get out!"); }   I think I used the Gender variable in if statement, but it's showing  The Value of the local Variable is not used. And when I ran, it works but the value of gender is the same as the previous. It means that if I write yes it doesn't show the word male it shows the space I gave. Please Help!

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?


In an online forum, OP means "original poster," but can it also mean "original post?"   For example, instead of saying     To answer the OP's original question...   could one instead say     To answer the question in the OP...   or would this be an improper use of the term?

I heard this in  movie. It was my op. What does it mean? Googling gave me : 'Original Poster'. But that doesn't seem very meaningful.


How to formulate calculation to find if two numbers are with a difference of 10 units. B and C are within 10 units difference from A. D is not.  Find the difference between the other points and point A = 355.5.  On 360 degree circle A = 355.5 degree  B = 350 degrees #diff 5.5 C = 1 degree #diff 6.5 D = 320 degrees #diff 35.5 E = 348 degrees #diff 7.5   If the difference is less than 10 then it the correct answer. i.e. B, C, E. How to formulate this?

What kind of math would I use to calculate the difference between two degrees on a circle? Say, 38 and 272 degrees?  When I just subtract one position from another sometimes it's more than 180 or sometimes I cross over 0/360.  I need keywords that can help me learn more about it.  Ultimately I want to create an excel formula but I don't know what it is called. Thanks


Helicopters or dual/quadcopters stop rising after reaching some height from the ground. What causes that? And what one should do if he want to prevent this, if he want the helicopter to keep rising up?

Is there a reason why people can't just take the helicopter to mount Everest? Why is it that helicopters can't reach that high?


So i've been trying a few things out in python and happened to come across this:  >>> a = 10 >>> b = 10 >>> a is b True   Apparently when creating the variable b Python notices that there is already another(different) variable with the value 10 and simply creates a reference to it (simply to save memory, maybe?). Since integers are immutable (at least I think they are) it makes some kind of sense. But then i tried the same thing with a bigger number and got this:  >>> a = 100200103847239642631982367 >>> b = 100200103847239642631982367 >>> a is b False   Here, for some reason Python seems to create another int object instead of making the variable b a reference to the variable a, which does not make sense to me. Assuming the reason the references created in first example is to save memory, wouldn't it be even more efficient to create a reference in the latter case also since the numbers are way bigger?

Why does the following behave unexpectedly in Python?  >>> a = 256 >>> b = 256 >>> a is b True           # This is an expected result >>> a = 257 >>> b = 257 >>> a is b False          # What happened here? Why is this False? >>> 257 is 257 True           # Yet the literal numbers compare properly   I am using Python 2.5.2. Trying some different versions of Python, it appears that Python 2.3.3 shows the above behaviour between 99 and 100.  Based on the above, I can hypothesize that Python is internally implemented such that "small" integers are stored in a different way than larger integers and the is operator can tell the difference. Why the leaky abstraction? What is a better way of comparing two arbitrary objects to see whether they are the same when I don't know in advance whether they are numbers or not?


Recently  was "closed as subjective and argumentative".  I wonder, where would you recommend to ask such questions?

The first experiment of a subjective proposal -  - was created 11 days ago and has been in public beta for 4 days so far. As a private beta user I followed the website since day 1, reading most questions (even though I didn't actively participate much), and so far my impression is very good: programmers is a wonderful website to read when you have some time to kill. It's like reading a magazine. In my opinion, reading  is much more fun than reading , and thus it's no surprise that most of the  actually belong on programmers, as they are subjective/argumentative (but have been grand-fathered). I believe that the very nature of subjective answers make them more interesting. Of course there is a (big) place for non-subjective websites where you can get help or help with a specific problem, but I think there should be a (big) place for subjective websites too. It's early to say (this is meant to be an ongoing discussion that will probably last months), but so far programmers seems to be one of the more successful - if not the most successful - proposals ever created. It has , and the only beta website with more views is gaming. So, what do you say? Should subjective proposals be allowed? Can they be successful?


I usually travel alone, which raises security issues. The most serious they are on beaches near lakes - when I want to swim, I have to leave all belonging on the beach.   I've never experienced anything to be stolen neither from me nor from anyone nearby or anyone I know. It is common for people to leave their things. However, are there any statistics or general reports about things stolen from people bathing in Germany? How often that happens? Are that single incidents, as rare as shootings in USA?  In Poland or Slovakia I would never leave a thing unobserved. But Germany is known from the culture of respect for private property.

I am planning to go to central America (Costa Rica + Panama) for a rather budget holiday, and I am wondering what people usually do with their documents, money, cameras, etc. when staying in a budget hotel (without a safe in the room) and wish to go swimming/diving? The two obvious options would be to leave all your stuff in your hotel, and even worse - leave them on the beach. But I guess if my stuff gets stolen in both of these cases, I am not going to get anything from the insurance company.


I've a Jersey based REST Client and a GET call defined as this :  The code doesn't come out after the client.get() call. A null pointer exception is hit on the client.get() call , this is the initialization logic from the class which calls the REST client :  Student.java :  public class Student {      private static RestClient client;      @SuppressWarnings("static-access")     public Student(Client client) {         this.client = new RestClient(client, "xyz");     }      public static RestClient getClient() {         return client;     }      public static void addStudent() throws Exception {          try {                    String addStudentUri = "https://www.zebapi.com/api/v1/market/ticker-new/btc/inr";                  ClientResponse js_response = getClient().get(URI.create(addStudentUri));             String s = js_response.getEntity(String.class);             System.out.println(s);         } catch (Exception e) {             System.out.println(e);                   }     }      public static void main(String[] args) {         try {             addStudent();         } catch (Exception e) {             // TODO Auto-generated catch block             e.printStackTrace();         }     } }   RestClient.java  public class RestClient {      private Client client;     private String randomHeader = "";      public RestClient(Client jerseyClient) {         this.client = jerseyClient;     }      public RestClient(Client jerseyClient, String random) {         this.client = jerseyClient;         this.randomHeader = random;     }      public String getRandomHeader() {         return randomHeader;     }      public void setRandomHeader(String randomHeader) {         this.randomHeader = randomHeader;     }      public RestClient() {     }      public ClientResponse get(URI uri)     {         return client.resource(uri)                 .get(ClientResponse.class);     }      public ClientResponse post(URI uri)     {         return client.resource(uri)                 .type(MediaType.APPLICATION_JSON)                 .accept(MediaType.APPLICATION_JSON)                 .post(ClientResponse.class);     }  }   Can you please help?

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 came across the following question:    This can be easily flagged for too broad or opinion based, but I wonder on which stack-exchange site can one ask answers for such a question?

Stuff like polls, recommendations based on subjective constraints, puzzles, webcomics etc. do not belong on the serious main SE sites, where professionals should be considered at work and having just a few spare minutes ("code's compiling") to answer questions, so they should not be distracted by such things. However, I'd also like to have a home for these things still using the SE engine. For the reason I mentioned before, this needs to be a separate place though. Let's call it four.[sitename-here].com.


Are posts in other languages allowed in SO?  I came across one such question here:    Should I raise a flag against this?

Otherwise known as  必须用英语吗？(is English required?) ¿Necesito hablar en inglés? ?האם אני חייב לכתוב באנגלית Muss ich auf Englisch schreiben?  Do I have to use English when posting a question, an answer or a comment on a Stack Exchange site?


Since the notions of products (resp. sums) of numbers include a convention for the product (resp. sum) of 0 terms, ${\prod_{i \in \emptyset} i = 1}$ and ${\sum_{i \in \emptyset} i = 0}$, I was wondering if there was such a convention for the cartesian product of 0 sets: ${\prod_{i \in \emptyset} A_i = ?}$, where the terms $A_i$ are sets.  Intuitively I would imagine that such a product is equal to the singelton containing the empty tuple {()} since an n-fold cartesian products produces a set of n-tuples and the empty tuple is the only 0-tuple. I'm not sure, however, since I wasn't able to find an answer by searching on the internet or the math stack exchange.

Let  $$Y=\prod_{X\in \emptyset}X$$  What is $Y$? The empty set? The singleton set?  EDIT: Here is another way of reading the conclusion in the comments so far:  $Y$ is the set $$Y=\{(x_1,...,x_n) | x_1\in X_1,...,x_n\in X_n, \text{ for } X_1,...,X_n\in \emptyset\}$$  But the only tuple satisfying this is $()$, i.e. the empty tuple. Hence $Y$ is the singleton. Is this argument correct?


I am building a program that verifies media and doc files within a given file tree. When it tries to read a pdf (with PyPDF2), it will occasionally freeze the program. I want to implement a timeout on the function so that it just times out and logs an error rather than crashing. Here is my code for the PDF function:  def pdf_verify(file, good_files, bad_files):     try:         PyPDF2.PdfFileReader(open(file, "rb"))         good_files.append(file)     except:         bad_files.append(file)      return good_files, bad_files   It tries to open the PDF file with PyPDF2, and if it can't be opened, it catches the exception and appends the file to a bad file list. I know there is a way to do this on Linux, but I need the program to be runnable on Windows. Is there any way to do this? Thanks!

I'm calling a function in Python which I know may stall and force me to restart the script.   How do I call the function or what do I wrap it in so that if it takes longer than 5 seconds the script cancels it and does something else?


I've been struggling for two days to dual-boot FreeDOS along with Mac OS X on an old MacBook (late 2011)  that I have.    I've tried doing the live CD option and flashing it to the drive with Rufus. I've tried following the instructions on the FreeDOS website for the USB drive and copying the contents of the .img file to the disk. and I've tried using Boot Camp which gives me an error that the Windows installer isn't found.   Nothing works. Does anyone have any idea of what is going on?

Is it possible to run FreeDOS via Bootcamp on a Mac?  If so, what are the instructions for doing so?


A British television series from the mid/late 90s, where the protagonist is a detective (?) somehow able travel back in time a few days (perhaps a week?) to solve crimes. I think other characters were unaware of his time travels...  I remember one episode where, during his investigation in the past, he saw a colleague and slipped him a piece of paper with some lottery numbers to play. When he arrived back, the rest of the team were celebrating his win with "bubbly", it then transpired it wasn't actually "real" champagne, confused we find out that:      his colleague had put down the numbers upside-down, somehow meaning he'd got four numbers (several hundred pounds) rather than all of them (several million).   The premise sounds a lot like , though I think this programme was aired prior to that...  Any ideas?

I recall a short lived TV show that I think was broadcast on the British TV channel ITV in the late 90s or early 2000s and it was about time travel. It was set in Britain in relatively modern times. The scene that really sticks in my head is when the protagonist goes to use their time travelling machine they go in to a room where the machine is and they close all the windows. The windows have latches on them and by closing the window it creates a circuit. By closing all the latches the circuit is complete and the machine is able to be activated. I don't know if it's much to go on, but it's been really bugging me for ages.


Number Theory: Prove for all $1\leq n \in \mathbb{N}$ $F_n \mid 2^{F_n}-2$ with $F_n$ is Fermat numbers Follow the following sections They will guide you in proof  Use polynomial division to prove that $2^{2^{n+1}}-1\mid2^{F_n-1}-1$.  Use polynomial division to prove that $F_n\mid2^{2^{n+1}}-1$.  Draw the conclusion from these two sections.   Attempt: if $2^{2^{n+1}}-1$ divide $2^{F_n-1}-1$ and $F_n$ divide $2^{2^{n+1}}-1$ so $F_n$ divide $2^{F_n-1}-1$ and i have no idea how to make it happen.

I realize that there is a similar post to this, but that post included a hint which we were not given. Also regarding that hint, I'm just wondering how someone could find it out for themselves. Here is the related post:  I know that $F_n = 2^{2^n} + 1$ and therefore $\,2^{2^n} \equiv -1 \pmod{F_n}$. But I don't intuitively know the next step to take to show that $\ 2^{F_n}\equiv 2\pmod{\!F_n},\,$ i.e. that  $$2^{2^{2^n} + 1} \equiv 2 \pmod{2^{2^n}+1}$$ So in essence, I would like to know how to solve it without knowing the hint. Thank you.


uhh, I'm new to Texture Paint and while experimenting paint brush, I've come across this problem...   and this is its UV Image   Please help me on how do I remove these edges on the paint's outlines and make it accurate to its UV lines.

I am sorry if someone already asked for this question, I wasn't able to find it anywhere..I googled lots of things and didn't satisfied my needs so I hope you can help me out :) :P. When I try to hand texture my model, some parts are being unable to be textured. I hope you understand what I mean, here is a screenshot so I can explain you.   The blue line is showing where I can't texture it as you can see it's white. I had to "Fill" to get the white color even though some places got still black as on the picture you can see black texture on the fore-end/near barrel.


Should we use singular verb with the subject/subjects "science and technology"? For example,      Science and technology have a prominent influence in the modern world.    Is this sentence correct? Please explain the logic behind it.

I am in doubt as to whether the subject-verb agreement of the second sentence of this paragraph is correct :  Unfortunately, there is no such thing as the ideal home workshop because most people are limited by the space available and by their budget. However, the information and diagram here acts as a guide to help you formulate a sensible workshop layout and a machinery “wish list”.  I suppose if the compound subject is seen as a single unit, then the sentence can be considered as correct. A little further in the same book, another sentence has a singular verb with a compound subject :  Alternatively commandeer a garage, or build yourself a substantial workshop if outdoor space and permission allows – however, do consider the impact of machinery noise on your neighbours.  Can "outdoor space and permission" be seen as one thing, or would this be considered a mistake ?


Those things are correct gramatically? What's the difference?  My girlfriend and I went to the beach and I threw her in the water and she said  "You're stronger than I am."   I think that "You're stronger than me." is always correct gramatically..

I read an English grammar article in which the author talked about the correct use of pronouns.  He writes:     If the extended sentence is “She’s more likely to ask him than I am,” in which the comparison is between the subject and the writer, I is correct. However, if the intent is to convey that the man referred to as him is more likely to be asked something by the subject than the writer is, the correct pronoun form is me, but that distinction should be clarified with a revision like “She’s more likely to ask him than ask me.”   Before reading this piece, I thought that the two sentences had the same meaning. While the second example is quite clear for me (“She’s more likely to ask him than ask me”), I don't think that I have correctly understood the first one. Could anyone explain it to me, please?


I want to get the time in the following line. I want to get the string          2017-07-07 08:30:00.065156   in  [ID] = 0,[Time] =  2017-07-07 08:30:00.065156,[access]   I tried this   (?<=[Time] = )(.*?)(?=,)   Where i want to get the string in-between the time tag and the first comma but this doesn't work.

I am tired of always trying to guess, if I should escape special characters like '()[]{}|' etc. when using many implementations of regexps.  It is different with, for example, Python, sed, grep, awk, Perl, rename, Apache, find and so on. Is there any rule set which tells when I should, and when I should not, escape special characters? Does it depend on the regexp type, like PCRE, POSIX or extended regexps?


Is it safe to publicly share Minidump files which are created after windows crash for like diagnosing let's say posting there links here at SO so other users can have a look and diagnose the issue??  Does those files contain information such as username, password, ip etc. that can compromise the security of one?

I realise it's unlikely that posting the file would cause a problem. However, since I know nothing about what a what's in a minidump file I thought I should check.


$$\lim_{n\to \infty} S_n=\lim_{n\to \infty}\sum_{k=1}^n\frac{1}{n!}$$  I need to show that this series is a convergent series. How do I show this series to be convergent? My book says that this is convergent. Please provide sone hint.

$$\sum_{n=1}^\infty \frac 1{n!}$$   I think we may compare it with $\frac{1}{n^n}$, and say that $\frac{1}{n!}>\frac{1}{n^n}$. But I am not sure of the convergence or divergence of $\frac{1}{n^n}$ itself, so this turns out to be useless.  What other way is there?


Recently asked on Physics.SE:    And also,   .  RF engineers know that putting a big conductive thing like a human head near an antenna is going to significantly alter the radiated fields. The argument goes that putting the remote under your chin (or sometimes on your forehead, and sometimes with mouth partially open) not only arbitrarily alters, but improves the remote's effectiveness.  The "experiments" confirming this argument are typically something like this:     I tried unlocking my car, but it didn't work. Then, I put the remote under my chin, and it worked! Therefore, remote-under-chin is more effective.   This is a textbook case of . No one ever tries unlocking their car with the remote under their chin, and when that doesn't work, tries unlocking it normally.  Let's skip the speculation and discussion about how it might work. Can someone with access to some proper RF test equipment perform a well-designed test of a car remote's characteristics with and without human-head-in-proximity? Or, can someone cite similar studies already performed by qualified RF engineers?

I'm in my parking lot and just a little too far from my car for the remote to work...  But if I hold the remote up to my chin, and then suddenly it works.  It sounds dumb until you try it, but it definitely works, with lots of different remotes/cars.  I assume it has something to do with the capacitance of your head, but I don't understand the details.


I could probably copy the contents from the package, but what is the best way to create an install Flash Drive for Mavericks?  Of course ideally the drive should be bootable.

Does anyone have a Terminal command-line recipe for making a new bootable USB flash drive for one of the new MacBook Air's?  Is there a way to dd copy the USB boot device that comes in the box and make the new copy bootable?  I'd like to make a new backup copy of the USB rescue device for my MBA, preferably on a much larger flash drive with room for a backup of some of my working directories.  Added:  And is it possible to make, not just a rescue drive, but a bootable USB drive that will boot a fully updated version of the OS (say 10.6.8 or later)?  If so how on a MacBook Air 11, and how big a USB stick will this require?


I am working on an api to make batch requests through HTTP. Suggested by this (), I decided to use Multithreading.   Here is the implementation:    public class GetItems { //Control the number of connections made to the server. PoolingHttpClientConnectionManager cm = new PoolingHttpClientConnectionManager(); cm.setMaxTotal(120); cm.setDefaultMaxPerRoute(30); HttpClient httpClient = HttpClients.custom()     .setConnectionManager(cm)     .build();  //Using concurrent map to store the result from different threads private Map<String, ItemAttributesFromDatapath> itemDataMap = Maps.newConcurrentMap();  //requests' batch private List<Request> requests;  public List<String> call() {         List<Thread> threads = Lists.newArrayList();         requests.forEach(request -> {             Thread thread = new Thread(new GetTask(client, request));             thread.start();             threads.add(thread);         });          threads.forEach(thread -> {             try {                 thread.join();             } catch (Exception ex) {                 LOGGER.error(ex);             }         });  }  //Inner class for multi-thread. public class GetTask implements Runnable{          private CatalogHttpRequest request;         private CatalogHttpClient client;         private String asin;          public GetTask(HttpClient client, final HttpRequest request) {             this.request = request;             this.client = client;         }          @Override         public void run(){             try{                HttpResponse response = client.executeHttpRequest(request);                 try {                     if (response.isOK()) {                         //some logic here                         String item = handle(response)                         itemDataMap.put(itemId, item);                      } else {                         String message = "Is Client Error";                         LOGGER.error(message);                      }                 } catch (Exception ex){                     LOGGER.error(ex.getMessage());                  }             } catch (Exception ex) {                 LOGGER.error(ex.getMessage());             }         }     } }   Then I tried to write unit-test,   @Test public void testBatchRequest() throws Exception{ HttpClient = mockClient(...); GetItems batch = new GetItems(...); List<String> ret = batch.call();}   Inside mockClient method, I mock some class using Mockito:   private HttpClient mockSuccessfulClient(InputStream responseStream, int code) throws IOException{          HttpEntity entity = Mockito.mock(HttpEntity.class);         when(entity.getContent()).thenReturn(responseStream);          HttpResponse response = Mockito.mock(CloseableHttpResponse.class);         when(response.getEntity()).thenReturn(entity);          StatusLine statusLine = Mockito.mock(StatusLine.class);         when(statusLine.getStatusCode()).thenReturn(code);         when(response.getStatusLine()).thenReturn(statusLine);          //CloseableHttpClient httpClient = Mockito.mock(CloseableHttpClient.class);         //when(httpClient.execute(any())).thenReturn(response);           CatalogHttpClient client = Mockito.mock(HttpClient.class);         when(client.executeHttpRequest(any())).thenReturn(response);          return client;     }   For the unit-test right now, the return list is empty, which is incorrect.   I tried to debug the code by setting up breaking point and found the main code didn't execute run() method inside GetTask when thread starts.   Since I am not familiar with multi-thread stuff. This problem may seem dumb to you, but can you help me figure out what's wrong in my code and how to write the proper test for my case.  Also, I am not sure if the ConcurrentMap is a good practice to store the results across multiple threads?

I have thus far avoided the nightmare that is testing multi-threaded code since it just seems like too much of a minefield.  I'd like to ask how people have gone about testing code that relies on threads for successful execution, or just how people have gone about testing those kinds of issues that only show up when two threads interact in a given manner?  This seems like a really key problem for programmers today, it would be useful to pool our knowledge on this one imho.


I am writing Jdbc program to connect with hive database but I am getting error as:     Exception in thread "main" java.lang.NoClassDefFoundError:   org/apache/hadoop/conf/Configuration  at   org.apache.hive.jdbc.HiveConnection.createUnderlyingTransport(HiveConnection.java:418)     at   org.apache.hive.jdbc.HiveConnection.createBinaryTransport(HiveConnection.java:438)     at   org.apache.hive.jdbc.HiveConnection.openTransport(HiveConnection.java:225)     at   org.apache.hive.jdbc.HiveConnection.(HiveConnection.java:182)     at org.apache.hive.jdbc.HiveDriver.connect(HiveDriver.java:107)     at   java.sql.DriverManager.getConnection(DriverManager.java:571)  at   java.sql.DriverManager.getConnection(DriverManager.java:215)  at   com.nucsoft.client.HiveJdbc.main(HiveJdbc.java:31)

I am getting a NoClassDefFoundError when I run my Java application.  What is typically the cause of this?


I need the ID of the node the inserted comment is attached to. This is what I have tried:  function my-module_comment_insert(Drupal\Core\Entity\EntityInterface $entity) {     // According to https://drupal.stackexchange.com/questions/145823/how-do-i-get-the-current-node-id     $node = \Drupal::routeMatch()->getParameter('node');     if ($node instanceof \Drupal\node\NodeInterface) {         $nid = $node->id();     }     drupal_set_message("The vaue is " . print_r($nid), 'warning'); }   But... The value I get is "1", while it should be (according to node URL) "55". Or am I using drupal_set_message for debugging the wrong way?  I also tried $entity->get('entity_id')->target_id (according to:  ) or \Drupal::routeMatch()->getRawParameter('node'), but I always get "1" and I'm positive that the website cache has been cleared.

How can I get the node id the comment is attached to in hook_comment_insert?  I tried the following code:  function mymodule_comment_insert(Drupal\Core\Entity\EntityInterface $entity) {   if ($entity->bundle() == 'comment_custom' && $entity->get('entity_type')->value == 'node') {      // Below returns empty, because "$entity->get('entity_id')->value" is empty.     $node = Node::load($entity->get('entity_id')->value);      // No luck with this one too.     $node = \Drupal::routeMatch()->getParameter('node');    } }


I am new to Ubuntu, and I am having difficulties with it being the only OS on my laptop. I would like to go back to Windows 10 and install Virtual Box, where I will be able to use Ubuntu occasionally. How could I do that?

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


As GET has so many meanings, it is hard for me to distinct between them and understand the nuances. Are these sentences all correct? Would you understand the same thing by them?     I will settle you in.   I will get you settled in.   Let's get you settled in!   Is the first one acceptable?

What are the differences in meaning and usage between "to start" and "to get started"?  Are there any cases in which these variants are not interchangeable? I feel that there are. For example,  looks less natural with its Start tab than it would with a Getting Started tab. I cannot see why there is a difference. Could you please explain?


How to make a counter that counts a word "parent", from an external file, then divides it by 2 and after that "echo's" this to a document? This is a file  that will be downloaded, thats why it should be external. This is for version control on git.  I am making a usb flash drive system, and i want it to have an updater. I also want to use batch or powershell (i dont understand any powershell) as this is a standard tool that comes with windows.  Sorry my bad english today, i'm having a really bad day..  EDIT  I have a better day today tho! Well, today i might be better to explain my problem! I want to make a batch-script that counts the times that the word "parent" appaer in the file, :   I'm currenly downloading this file with:  -- cd "$env:programfiles\DiscLovestory\sys\update" Remove-Item "git_commit.log" [Net.ServicePointManager]::SecurityProtocol = "tls12, tls11, tls" wget -O git_commit.log  pause  --  Having this is file is also gonna be needed as a "update-note" to the user. This script went straight to powershell, since i don't know how bitsadmin works, but if you also know how that should work, be my guest to help me out! As my script is based to be a batch-only script.  I want the output to go to: "%programfiles%\DiscLovestory\sys\update\version.log" and also in registry: REG ADD HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\DiscLovestory /v DisplayVersion /t REG_SZ /d  In both output places it should be enough to just put version as follow: "x.xx" without quotations.  And if you wanna follow up on the script, or use it, be my guest. It is open-source at:

I want to make a batch-script that counts the times that the word "parent" appear in the file,    http://api.github.com/repos/godzillamesel/disclovestory/commits   I'm currenly downloading this file with:  cd "$env:programfiles\DiscLovestory\sys\update"  Remove-Item "git_commit.log"  [Net.ServicePointManager]::SecurityProtocol =  tls12, tls11, tls"  wget -O git_commit.log http://api.github.com/repos/godzillamesel/disclovestory/commits  pause   Having this is file is also gonna be needed as a "update-note" to the user. This script went straight to powershell, since i don't know how bitsadmin works, but if you also know how that should work, be my guest to help me out! As my script is based to be a batch-only script.  I want the output to go to: "%programfiles%\DiscLovestory\sys\update\version.log" and also in registry:    REG ADD "HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\DiscLovestory" /v DisplayVersion /t REG_SZ /d   In both output places it should be enough to just put version as follow: "x.xx" without quotations.  And if you wanna follow up on the script, or use it, be my guest. It is open-source at: https://github.com/godzillamesel/disclovestory


I got a warning notification "Some of your past questions have not been well-received, and you're in danger of being blocked from asking any more." and I'm afraid to ask my next question, because I don't know if somebody downvote, no one will answer or flag question. How can it counts, I mean where is the border of "well-received questions"? It is total score of my questions or how system count when is enough to be blocked?  P.S. So sorry, if it is a little stupid question, but this is my first question on Meta and really want to understand it better. Thanks.

Don't you think people need to know what they did wrong exactly so they can fix it and get unbanned from asking questions or posting answers?


I would like to know if this sequence converges $\sqrt {2+\sqrt {2+\sqrt {2+\ldots}}}$.  I know this sequence is increasing monotone, but I couldn't prove it's bounded.  Thanks

(Fitzpatrick Advanced Calculus 2e, Sec. 2.4 #12)  For $c \gt 0$, consider the quadratic equation $x^2 - x - c = 0, x > 0$.  Define the sequence $\{x_n\}$ recursively by fixing $|x_1| \lt c$ and then, if $n$ is an index for which $x_n$ has been defined, defining  $$x_{n+1} = \sqrt{c+x_n}$$  Prove that the sequence $\{x_n\}$ converges monotonically to the solution of the above equation.  Note: The answers below might assume $x_1 \gt 0$, but they still work, as we have $x_3 \gt 0$.    This is being repurposed in an effort to cut down on duplicates, see here: .  and here: .


I have a script something like this:  go build foo -o /tmp/foo \ && echo 'Compressing foo' \ && upx /tmp/foo \ || exit 11 &  #  ^ this exit didn't exit the caller script  go build bar -o /tmp/bar \ && echo 'Compressing bar' \ && upx /tmp/bar \ || exit 12 &   go build baz -o /tmp/baz \ && echo 'Compressing baz' \ && upx /tmp/baz \ || exit 13 &   wait  scp /tmp/foo /tmp/bar /tmp/baz someuser@someserver:/tmp   How to make it exit when one of the background command either foo, bar or baz failed?  EDIT: Solution from the reference above:  PIDS=''  go build foo -o /tmp/foo \ && echo 'Compressing foo' \ && upx /tmp/foo &  PIDS="$PIDS $!"  go build bar -o /tmp/bar \ && echo 'Compressing bar' \ && upx /tmp/bar &  PIDS="$PIDS $!"  go build baz -o /tmp/baz \ && echo 'Compressing baz' \ && upx /tmp/baz  &  PIDS="$PIDS $!"  for pid in $PIDS; do     wait $pid || let 'fail=1' done  if [ "$fail" == '1' ]; then     exit 11 fi  scp /tmp/foo /tmp/bar /tmp/baz someuser@someserver:/tmp

How to wait in a bash script for several subprocesses spawned from that script to finish and return exit code !=0 when any of the subprocesses ends with code !=0 ?  Simple script:  #!/bin/bash for i in `seq 0 9`; do   doCalculations $i & done wait   The above script will wait for all 10 spawned subprocesses, but it will always give exit status 0 (see help wait). How can I modify this script so it will discover exit statuses of spawned subprocesses and return exit code 1 when any of subprocesses ends with code !=0?  Is there any better solution for that than collecting PIDs of the subprocesses, wait for them in order and sum exit statuses?


I've been avoiding the Windows 10 Upgrade to my Windows 7 install, but after a reboot recently, I am now getting the following notice from Windows Update:    Is there any way to back out at this point before I reboot? I would like to hold off for a while until I am sure a few legacy applications can handle it.

I cancelled the Microsoft Windows 10 Reservation and uninstalled KB3035583, but Windows 10 is still trying to install.   After I uninstalled KB3035583 and restarted my laptop as instructed, I could not find KB3035583 to hide it.   Now Windows 10 is sitting in my Windows Update saying that it will install when I restart my computer.


I have a Java software that needs to be licensed to clients. I have created a licensing module that would only allow the software to be executed on a specific hardware on which it was activated.   However I don't want the client to activate the software inside a Virtual Machine which would mean that multiple copies of the software could be used with a single license.  How do I stop my software from being installed in a VM?  Note:    I have done research on this and already found a solution. I'm posting it here so that it may be useful to other developers. It works only for VmWare and Virtual PC not on Parallels or VirtualBox I couldn't find a pure Java solution. It relies on native code.   If you know a better solution please post it as an answer.

Is there a way to identify, from within a VM, that your code is running inside a VM?  I guess there are more or less easy ways to identify specific VM systems, especially if the VM has the provider's extensions installed (such as for VirtualBox or VMWare). But is there a general way to identify that you are not running directly on the CPU?


Is the  value  $$ P(2)=\sum_{p \in \mathrm{primes}} \frac{1}{p^2} = 0.452247420041065498506543364832247934173231343\ldots $$  a transcendental number ?  What about the following sum ? $$\sum_{p \in \mathrm{primes}} \frac{1}{p^p} = 0.2873582513062241797364180458789322069559088\ldots $$  For the last sum,  might help because of the fast converging series.  The first sum might have been checked, as it is natural to come to such a sum. Perhaps, it is at least known if it is irrational.

A very simple question, but I can't seem to find anything relating to it :  Is there any research, are there any results that have focused on or given insight on   $\sum 1/p^p$, ${p \in \mathbb P}$ ?  A very basic series, converges extremely fast, its value is around .29. What more can there be said about it ?  From what little I know about more advanced number theory, similar sequences (I can think of a few similar ones that I can't find any relevant research or results about) can be very non-trivial to compute or to analyse.


It seems to be Stack Exchange's policy, that moderators are elected for life and can also be reinstated when they wish to continue their duties after stepping down. ().  I have now heard of/seen two cases of moderators stepping down from one site in good terms and later getting suspended (on their or any other site).  There is a general rule that a user must not have been suspended for a year before nominating as a candidate in any moderator election ().  How do these rules play together? If a moderator left their position under good terms and then later got suspended, can they request their privileges back?

Please leave any feedback or questions about this process on .   From time to time, moderators will step down or be removed from their positions — they may have expressed their wish to step down due to time constraints or they may have had behaviors unfitting of a moderator and have been forcefully removed, along with a number of other possibilities that fall somewhere between those two. What is the process for evaluating moderator reinstatement or removal appeal requests?  Note: Feedback on the original version of this post can still be found .


I am creating a text editor, and I am working on the sizing of my div. Unfortunately, it does not take up the whole page. Its width and height are set to 100%. Here is the CSS:  html, body {     position:absolute;     z-index:1;     top:0px;     left:0px; }   If you would like to view the page, you can see it . Thank you all so much for your help.

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


How to find $$\lim _{x\to 0} \frac{1}{x}\left(\frac{1}{\arctan x}-\frac{1}{x}\right)$$?  I tried doing it by L'Hospital, but I had to do it five times! Is there an easier way around this?

How to evaluate $\lim_{x\to 0+}\dfrac 1x \Big(\dfrac 1{\tan^{-1}x}-\dfrac 1x\Big)$ ? I used L'Hospital's rule but with no success.


When i click on the local host tab of my WAMP server it opens up the webpage but gives a blank page with the following error:  HTTP Error 404. The requested resource is not found.   I have researched online about the problem and uninstalled Skype and turned off my firewall as suggested. However it did not solve it.  What else can be done to solve the issue?   When I "test port 80" within the apache tab I get the following message:  Your Port 80 is actually used by:  Server: Microsoft-HTTPAPI/2.0   note: The WAMP server is online, yet the icon is still red. I am using a windows 64 bit laptop.

I have a problem starting the Apache Service in WAMP Server, when i test port 80, I get the following message on the console  Your port 80 is actually used by : Server: Microsoft -HTTPAPI/2.0   Things i did:  used netstat -aon from the command prompt to check what is running on port 80 and i get something with a PID of 4.  This PID of 4 corresponds to a file named - ntoskrnl (NT Kernel & System) in C:\Windows\System32  How do I go about solving this issue?


Let's say that you're a Sorcerer under the effects of Hold Person, can you cast a spell without a material component with the Subtle Spell metamagic?

Looking at the D&D 5th edition Compendium , I see:     A paralyzed creature is incapacitated (see the condition) and can’t   move or speak.   And for incapacitation:     An incapacitated creature can’t take actions or reactions.   Compare this to the , which specifically mentions physical actions:      This special attack renders the victim immobile. Paralyzed creatures   cannot move, speak, or take any physical actions. The creature is   rooted to the spot, frozen and helpless. Not even friends can move his   limbs. He may take purely mental actions, such as casting a spell with   no components.   Does this mean that, counterintuitively, by rules as written in 5th Edition a paralyzed creature cannot take actions that don’t require movement (e.g. casting a spell with no components)? It seems a silly interpretation, but that’s what the rules seem to be saying (assuming this resource accurately reproduces the rules).


For any $a,b\in\mathbb{Z}$, show that at least one of the following values is a square in $\mathbb{Z}_p$ with $p$ prime Those values are: $a^2 -b^2$, $2(b-a)$, $2(-a-b)$. I tried multiplying, adding and substracting those values but I can't conclude anything. edit:  I forgot to mention that the numbers must be squares mod $p$

Suppose the $p$ is an odd prime not dividing $ab$.  Prove that $z^2 \equiv ab \pmod p$ is solvable if and only if both or neither of $x^2\equiv a\pmod{p}$ and $x^2 \equiv b \pmod p$ are solvable.


I'm having trouble understanding the answer to the following question.    The part I'm particularly stuck on is the jump from step one and two where these two formulas appear to be equated  $Pr[(B_1 \cap B_2) \cap (B_1 \cup B_2)] = Pr[B_1 \cap B_2]$  I can't think of any properties of $\cap$ and $\cup$ that can allow us to do this. I tried drawing a Venn-diagram but was unable to represent $\cup$. Any clarification would be much appreciated!  EDIT:   I saw another solution to this question that simply does this.  Sample space:  BB BG GB GG  Since we already know one child is a boy, we can restrict our sample space to the first 3 entries. Out of those first 3 entries, only 1 entry is BB. The reason I was confused about this solution was that I didn't know the order of the boy and girl mattered. I would have made the "mistake" of making the sample space BB, GG, BG because BG is the same as GB. Please tell me why I'm wrong

In a family with two children, what are the chances, if one of the children is a girl, that both children are girls?  I just dipped into a book, The Drunkard's Walk - How Randomness Rules Our Lives, by Leonard Mlodinow, Vintage Books, 2008. On p.107 Mlodinow says the chances are 1 in 3.   It seems obvious to me that the chances are 1 in 2. Am I correct? Is this not exactly analogous to having a bowl with an infinite number of marbles, half black and half red? Without looking I draw out a black marble. The probability of the second marble I draw being black is 1/2.


Evaluate $(b^2)^{\frac{1}{2}}$ for $b=-1$.  If you substitute $b=-1$ first and then simplify you get $((-1)^2)^{\frac{1}{2}}=(1)^{\frac{1}{2}}=1$ but if you simplify first and then substitute you get $b^1=(-1)^1=-1$.  What am I missing?

I know there must be something unmathematical in the following but I don't know where it is: \begin{align} \sqrt{-1} &= i \\\\\ \frac1{\sqrt{-1}} &= \frac1i \\\\  \frac{\sqrt1}{\sqrt{-1}} &= \frac1i \\\\  \sqrt{\frac1{-1}} &= \frac1i \\\\  \sqrt{\frac{-1}1} &= \frac1i \\\\  \sqrt{-1} &= \frac1i \\\\  i &= \frac1i \\\\  i^2 &= 1 \\\\  -1 &= 1 \quad !!? \end{align}


Is there a way of changing what property a Linq statement does a Where and an OrderBy please?  I have the following example function that I am trying to make more flexible:  public static List<SADatastore.SA_Items> BuildResourcesModel2(         int Take = 10000,         int Skip = 0,         string filterBy = null,         string filterString = null,         string sortBy = "ItemID",         string sortOrder = "asc"         ) {          List<SADatastore.SA_Items> theAnswer = new List<SA_Items>();          using (SADatastoreEntities db = new SADatastoreEntities(Properties.Settings.Default.ConnectionString)) {             theAnswer = db.SA_Items                         .Where(x => x.SA_Categories.Description.ToLower().Contains(filterString.ToLower()))                         .OrderBy(x=>x.ItemID)                         .Take(Take)                         .Skip(Skip)                         .ToList();         }          return theAnswer;     }   As you can see, as it's written at the moment, it is always doing the where based on the Category Description and Ordering Ascending based on ItemID  Is there a way to rewrite this in a dynamic way so if it's called with the parameters  filterBy = "Manufacturer" filterString "Ford" sortBy = "Manufacturer" sortOder = "Desc"   It would dynamically change the Where and Order clauses?  Any help would be greatly appreciated!

I found an example in the  for Dynamic LINQ that allows you to use a sql-like string (e.g. OrderBy("Name, Age DESC")) for ordering. Unfortunately, the method included only works on IQueryable<T>. Is there any way to get this functionality on IEnumerable<T>?


I am new to theoretical physics. When I was reading the proof of conservation of energy, I found that the proof was a little bit trivial and everything seems to just be a definition.   The potential energy is derived from $W=\int_c {\bf F} \, \mathrm{d}{\bf r} =\varphi(b) - \varphi(a)$ where curve $c$ starts at $a$ and ends at $b$, and $\varphi$ is the "antiderivative" of the force field ${\bf F}$, given the field is conservative. The potential energy is defined as $U(x) = -\varphi(x)$.  The kinetic energy (Newtonian), by Newton's first law, is defined as $W=\int_0^t {\bf F} \, \mathrm{d}x=\int_0^t m{\bf v} \, \mathrm{d}v=\frac{1}{2}mv^2$.   Note that in the definition, both kinetic and potential energy are derived from the definition of work, but they're just viewed differently. One is viewed as a line integral, the other is viewed as a function of velocity. However, since both are derived from work simply with a different sign, their sum is 0 for sure, I didn't see any need to do a proof. Why is a law of universe just a definition? I think it should be based on observations, but the "proof" has really made me confused, because physics is not like math and we can't "invent" laws.

How is it proved to be always true? It's a fundamental principle in Physics based on all of our currents observations of multiple systems in the universe. Is it always true to all systems? Because we haven't tested or observed them all. Would it be possible to discover/create a system that could lead to a different result? How are we 100% sure that energy is always conserved? Finally, why did we conclude it's always conserved? What if a system keeps doing work over and over and over with time?


I downloaded Minecraft and downloaded 2 resource packs. When I went to the .minecraft folder, there was no \resourcepacks folder. Is this a bug, or because I'm running Windows 8, or what?

I go into my .minecraft folder and there's Assets and all the other files and folders, but no resource packs folder?  If I create one manually, and place the textures inside, they don't show up in-game.  I'm on a Mac.


So I was playing as a Khajiit, and I want to try being an Orc. Can I make a separate game file without deleting the original profile. I know it is possible on different games like Saints Row, but is it possible in Skyrim on PS3? THX!

Just wondering, I'm about to buy it and it sounds awesome, but how many characters can I have in Skyrim on the PS3? Am I limited to just 1, or can I make more than one character at once?


I have created a page where if the input length is 0, it shows an alert. And if input length is not 0, it does the function that href"mailto:info@company.com" property does(Did it with document.getElementByID). I want that after clicking on Send button, it sends an email or does the function that Html's href"mailto:info@company.com" property does. But it is not working. The code is: HTML: <form action="index.html">    <input type="submit" class="btn" value="Send" onClick="auth(event)">

 </form>  JavaScript:     function auth(event) {   event.preventDefault();    var username = document.getElementById("username").value;    if (username.length === 0) {     alert("Please enter your email");     return;   } else if (username.length === 5) {     document.getElementById("SendMail")   }    }

This is a little confusing to explain, so bear with me here...  I want to set up a system where a user can send templated emails via my website, except it's not actually sent using my server - it instead just opens up their own local mail client with an email ready to go. The application would fill out the body of the email with predefined variables, to save the user having to type it themselves. They can then edit the message as desired, should it not exactly suit their purposes.  There's a number of reasons I want it to go via the user's local mail client, so getting the server to send the email is not an option: it has to be 100% client-side.  I already have a mostly-working solution running, and I'll post the details of that as an answer, I'm wondering if there's any better way?


I currently have an application written in Rad Studio C++ for windows. It uses ADO connections to load data from SQL Server. Since it's a large amount of data it takes a long time to load all the data.  I would like to activate the Data Sources in the background. Can anyone help me with an example to do the following code in a separate thread.  DataModule->ADO_DataSource->Active = true;   Thanks

Can someone post a simple example of starting two (Object Oriented) threads in C++.   I'm looking for actual C++ thread objects that I can extend run methods on (or something similar) as opposed to calling a C-style thread library.  I left out any OS specific requests in the hopes that whoever replied would reply with cross platform libraries to use. I'm just making that explicit now.


I am trying to install some necessary packages but always get the Error "not a local package repository" as you see in picture ?  What can I do?  Thank you Very Much

I used MiKTeX 2.9 on windows. I have downloaded a package I want to install from the internet (manually, not through MiKTeX). The archive (*.lmza) containing the package was saved to a directory on my C:\ drive. Through MikTeX -> Maintenance -> Settings -> Packages -> Change... I can select the directory in which I have saved the archive containing the package. However, if I choose Packages shall be installed from a directory and choose the location of the package, I get this error message: C:\my\package\is\here does not seem to be a local package repository. What does it take for a directory/folder to become a local package repository?


I have one TIFF file and one shapefile in the same coordinate system, but it's not overlapping. When I see the extent of both files both are in meters but they are very different.

I put 4 different layers into my ArcMap document, but only one of them will show up on the map! I should be seeing the other 3 layers as well. When I do a Zoom to layer, I can see one layer, but I cannot figure out how to make the other 3 show up at once on top of each other.  Before I opened ArcMap, I used ArcCatalog where I right-clicked 3/4 of the shapefiles and  clicked Properties → Coordinate system → Import and then clicked on my Trees layer, which has the coordinate system I want the other 3 to have. But when I opened ArcMap the 4 layers did not overlap, nor could I move them above or below each other.


There are some apps like Facebook that I don’t want to update. And frequently I see a notification in app and in Play Store for its update.  Please let me know how to get rid of update of some specific apps.      I don't want to upgrade Facebook app but every time I see "upgrade" notification on Facebook app. Recently I did reset my device and before reset, I upgraded Facebook but after upgrade, some options were missing in app. That's why I don't want to upgrade it again.

General question I have an app X installed on my device in version Y. I don't want to update it to any newer version (Y+z) for some reason. Still, the Google Play Store app always lists updates for X, which keeps me from a simple "update all". My question, put to a single sentence:  How to hide updates for X permanently from the "available updates" list?   Specific examples First, I know there are alternatives as e.g. the , which can handle this quite well (skip this update, skip all future updates). I prefer a "generic solution", which does not depend on a 3rd party's market app. Second, I know that  includes a "Market doctor", which can be used to disconnect an app from Google Play.1 However, in my specific case that only worked for a few hours: I disconnected GTalk, as I don't want it replaced by Hangouts. The update notification disappeared for a few hours, then it was back. No idea what restored the "link". Third, just to make sure: I'm not talking about the "auto update" feature as discussed e.g. in . I was rather hoping for something close to , but without the need to "freeze" the app in question (which I still want to use, but in the version installed, not in a "future version" available). Fourth: No, uninstalling the app in question is no option here, though it would perfectly hide any future updates from being displayed :) Nor is "freezing", as the app is used regularly. Fifth: There is a related question for my GTalk example:  However, I want the opposite: No update.  It might very well be that "Google Apps" (and other pre-installed apps) are handled in some specific way, and restore their "market links" themselves somehow. For this case, my question includes: How to prevent that from happening?  Update There's a  discussing the very same issue. Until recently, a work-around for "user installed apps" was to uninstall them and then sideload the .apk – but even that stopped working. Well, re-signing the .apk with a different key might work for user-apps. But both would fail for pre-installed apps (can't sideload them to override; different signature would refuse that install completely). Moreover, there's an  on this by some "joel.bou..". Not hard to guess, though blanked out: that would be Joël Bourquard. If it's really him, then that's really an issue (for those who don't know: Joël is the dev behind Titanium Backup). Let me quote from the issue:  For the record: in the Android Market days it was possible to "Attach" or "Detach" apps (on rooted devices) with a system tool such as Titanium Backup. But nowadays (with the Google Play Store app) this has become nearly impossible to do, because the complete app list seems to sync from Google's servers and the user has no control over that.  Which explains why detaching with apps like Titanium Backup is no longer permanent. And I'm afraid I've asked the impossible. But I thought the same in the past with other questions, and surprisingly got solutions here. So I do not yet give up hope on this one!  1: what that does is explained by eldarerathis  (thanks to  for digging that up!)


I am collecting data from a GPS that is attached to a car. When I display this data in a map, the set of collected points are supposed to match with the street shapefile. However what I see in my map is points overlying places where the car can't go, Ex. Buildings, Parcels etc.   I understand this is a GPS accuracy issue. My question is: Is there any script or any way to spatially adjust this points to place them on top of the line so the collected data display on its right position in the map.

I'm using OpenStreetMap and its vectorial road network and I'd like to implement a map matcher algorithm.   Currently I'm able, for each GPS position, to retrieve the nearest road segment and calculate the projection of this position to that segment, like on this image (Red pin is the pure GPS position, in blue the mapped segment and in Green the mapped position):    However, due to the lack of accuracy of the GPS, sometimes the mapped position jumps from segment to another and can provide some inconsistent mapped position from time to time.  My current algorithm is very basic : from the pure GPS position, I get the nearest segment and decide that the mapped matched position is on this one. I know that this can be really improved.  I can imagine that taking the vehicle direction into account will improve the map matching but do you know any other approach that would enable me to improve my map matcher ?  I seek any link, and/or open source software?


I have a non-convex function of several parameters, that takes real values. I am looking for a good algorithm to find local minima. I am reasonably confident I can come up with descent starting points. I have some simple boundary conditions (parameters need to be positive)  I cannot have an analytical form of the Jacobian.  I looked into Nelder-Mead, but it is said to perform poorly in high dimensions (I have about 7 parameters for my function - do not know if that qualifies as high dimension), and also I could not find an implementation in python / scipy which has constraints.  Can anyone with optimization experience suggest some good optimizing algorithms to try?

Gradient descent and many other methods are useful for finding local minima in cost functions. They can be efficient when the cost function can be evaluated quickly at each point, whether numerically or analytically.    I have what appears to me to be an unusual situation. Each evaluation of my cost function is expensive. I am attempting to find a set of parameters that minimize a 3D surface against ground truth surfaces. Whenever I change a parameter, I need to run the algorithm against the entire sample cohort to measure its effect.  In order to calculate a gradient, I need to change all 15 parameters independently, meaning I have to regenerate all the surfaces and compare against the sample cohort way too many times per gradient, and definitely way too many times over the course of optimization.  I have developed a method to circumvent this problem and am currently evaluating it, but I am surprised that I have not found much in the literature regarding expensive cost function evaluations.  This makes me wonder if I am making the problem harder than it is and that there might be a better way already available.  So my questions are basically this: Does anyone know of methods for optimizing cost functions, convex or not, when evaluation is slow?  Or, am I doing something silly in the first place by rerunning the algorithm and comparing against the sample cohort so many times?


I have had my machine dual booting windows 10 and ubuntu 16.04 for many years using grub2. I havent been using ubuntu in awhile and have just logged back in. I had quite a lot of updates to do. Once I updated it told me I needed to restart to use the new version, I think it was a kernel update. I tried to reboot but I just get a black screen with a single line of green pixels going across the top of my monitor, no grub boot loader. I can go into the bios and boot directly to windows 10 fine. But when I try ubuntu I just get the same black screen with the green line. I decided to install ubuntu 18.04 from a live usb which was my original plan. On installation I told it to erase 16.04 and use that partition. It installed fine but I get the same problem with the black screen and green pixel line.  Windows an Ubuntu are on the same disk just different partitions. I have uefi  Any suggessions?

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


I am trying to convert from using SLDS as a static resource and use the <apex:slds/> element in a visualforce page instead. I am on a sandbox that is on Spring '17 and the page is version 39.0. When I load it I can see the min'ed resource coming across the network tab in my browser dev console. I can also do the following to get the non-minified resource:  <apex:stylesheet value="{!URLFOR($Asset.SLDS, 'assets/styles/salesforce-lightning-design-system-vf.css')}" />   The only differences in one particular class style that I notice is demonstrated below:  CSS From Static Resource (expected display results):  .slds .slds-text-heading--large {     font-weight: 300;     font-size: 32px;     line-height: 1.25; }   CSS From SLDS Asset import (not expected display results):  .slds-scope .slds-text-heading--large {     font-weight: 300;     font-size: 1.75rem;     line-height: 1.25; }   I just chose one particular style to demonstrate my issue. But none of the styling is happening on the page. I feel like I am missing something simple, but I am having issues pinpointing it.  Display with Static Resource:    Display with <apex:slds />:

In reading through the release notes I was excited to discover the introduction of a new  tag. That should help lower the barriers to entry! However, the release notes do not specify what the name of the scoping class should be. And since , we're left guessing.  To be explicit about what I'm trying to understand, take  for example:  <apex:page showHeader="false" standardStylesheets="false" sidebar="false" applyHtmlTag="false" applyBodyTag="false" docType="html-5.0">     <html xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" lang="en">         <head>             ...             <apex:stylesheet value="{!URLFOR($Resource.REPLACE_WITH_NAME_OF_SLDS_STATIC_RESOURCE, 'assets/styles/salesforce-lightning-design-system-vf.min.css')}" />         </head>         <body>              <!-- REQUIRED SLDS WRAPPER -->             <div class="REPLACE_WITH_NAME_OF_CUSTOM_SCOPING_CLASS">             ...         </body>     </html> </apex:page>   If I replace the <apex:stylesheet> with <apex:slds>, what should I specify for REPLACE_WITH_NAME_OF_CUSTOM_SCOPING_CLASS?


My prompt in Terminal currently looks like:  Dzulhelmis-MacBook-Pro:~ myusername$   I want it to be as short as possible, maybe at least no hostname there. How do I change my bash prompt?

How can I hide username and computer in terminal command prompt?   In Terminal it says  Last login: Mon Jan 13 00:00:14 on ttys000 Whatever:~ UserName$    Is it possible to show just the current folder and $ sign?


I have two classes named RA_Shortcode and WPBakeryShortCodesContainer  Now I need a third class RA_ShortcodeContainer inherit both classes..  Any idea how to achieve it.  Thanks in advance

I'm looking for a good, clean way to go around the fact that PHP5 still doesn't support multiple inheritance. Here's the class hierarchy:  Message   -- TextMessage     -------- InvitationTextMessage   -- EmailMessage     -------- InvitationEmailMessage    The two types of Invitation* classes have a lot in common; i'd love to have a common parent class, Invitation, that they both would inherit from. Unfortunately, they also have a lot in common with their current ancestors... TextMessage and EmailMessage. Classical desire for multiple inheritance here.   What's the most light-weight approach to solve the issue?   Thanks!


In Euclid's proof, if $p_1, p_2, \dots, p_n$ are the only primes then $p_1 \times p_2 \times \dots \times p_n + 1$ is not divisible by any of $p_1, p_2, \dots, p_n$ (because of some algebraic facts), which makes another prime and is a contradiction.   The proof makes sense logically, and I tried some numerical examples to "feel" the proof better but...  $2 \times 3 \times 5\times 7\times 11\times 13+1$ is not a prime! $2 \times 3 \times 5\times 7\times 11\times 13 \times 17+1$ is also not prime! Why is the general case proof is not working for these examples?

I've expressed Euclid's proof on the infinitude of primes on Mathematica:  f[x_] := Product[Prime[n], {n, 1, x}] + 1 TableForm[Table[{f[x], PrimeQ[f[x]]}, {x, 1, 20}]]   Which results in:  $\begin{array}{ll}  3 & \text{True} \\  7 & \text{True} \\  31 & \text{True} \\  211 & \text{True} \\  2311 & \text{True} \\  30031 & \text{False} \\  510511 & \text{False} \\  9699691 & \text{False} \\  223092871 & \text{False} \\  6469693231 & \text{False} \\  200560490131 & \text{True} \\  7420738134811 & \text{False} \\  304250263527211 & \text{False} \\  13082761331670031 & \text{False} \\  614889782588491411 & \text{False} \\  32589158477190044731 & \text{False} \\  1922760350154212639071 & \text{False} \\  117288381359406970983271 & \text{False} \\  7858321551080267055879091 & \text{False} \\  557940830126698960967415391 & \text{False} \\ \end{array}$  The proof flaws for all those values, how is it considered a proof then? I guess that there might be infinite prime numbers according to the proof, but what is the guarantee that at some point it won't fail indefinitely?


Any ideas how to modify view to filter the last created items in the past 2 hours?   Respect any thoughts without code

I am on SharePoint 2013 and do not have access to Designer, as a preface.  I am trying to create a list view that filters items by whether or not they were added in the last hour.  I had done this earlier, only with items that were added in the current week, by creating two columns, 'Week Start' and 'Week End', and filtering by Created falling between those two.  Simple enough.  However, filtering list views does not allow for complex functions, nor does the [Today] function recognize time, causing an issue.  Is there any workaround for this?  Thanks.


Today I opened gnome-terminal and I wrote   ls && sleep 4 && gnome-terminal   to open another terminal after the completion of ls command and waiting for 4 seconds. So it successfully opened a new terminal after previous commands completely ran (including sleep 4).  After that, next time I typed a new command   ls -lR && sleep 4 && gnome-terminal   The command ls -lR completed after 3 seconds, but after that none of the commands sleep 4 and gnome-terminal ran successfully.  What is the problem?

They seem to both signal BASH to commence with another command following the symbols but is there a distinct difference?


If a player is auctioned for Rs. 14cr and he played only 3 match will he be entitled to get his entire fees or he will be paid on a prorata basis for e.g no of match played.

Two players in IPL 6 (2013), Ricky Ponting and Glen Maxwell, were bought in the player auction for large sums (Ponting close to half a million and Maxwell over 1 million dollars).  Neither of these players ended up playing many games. Ponting played the first 6 and Maxwell just 3. In this case (and I'm sure many other similar examples) do the players get all of that sum, or are they paid on a pro-rata basis. For instance if they played only half the games they would get half the amount?


After hibernation my 16.04. Laptop shows me a blackscreen. I assume the keyboard is still responsive, because the back-lits on my keyboard worked.   I then upgraded from 16.04. to 17.10. and hoped the issue would be resolved. Unfortunately I still got a black screen after hibernation  uname -r returns me this:  4.13.0-31-generic

I am experienced the following issue: after hibernation (using command sudo systemctl hibernatein a terminal or the menu on the right top of Ubuntu desktop) I get a black screen (Even though all devices seem to work. The fan works!) and I am forced to reboot the OS because resume failed and I can't back to a "saved state". The content in etc/polkit-1/localauthority/50-local.d/com.ubuntu.enable-hibernate.pkla is:      [Re-enable hibernate by default in upower] Identity=unix-user:* Action=org.freedesktop.upower.hibernate ResultActive=yes  [Re-enable hibernate by default in logind] Identity=unix-user:* Action=org.freedesktop.login1.hibernate;org.freedesktop.login1.handle-hibernate-key;org.freedesktop.login1;org.freedesktop.login1.hibernate-multiple-sessions;org.freedesktop.login1.hibernate-ignore-inhibit ResultActive=yes   Additional info: Ubuntu version: 16.04LTS  Kernel version:   uname -r 4.13.0-26-generic   Graphic info:   udo lspci | grep -E 'VGA|Display' [sudo] password di michele:  00:02.0 VGA compatible controller: Intel Corporation 2nd Generation Core Processor Family Integrated Graphics Controller (rev 09) 01:00.0 VGA compatible controller: Advanced Micro Devices, Inc. [AMD/ATI] Whistler [Radeon HD 6730M/6770M/7690M XT] (rev ff) michele@michele-ubuntu:~$ sudo lshw -c display | grep driver        configuration: driver=i915 latency=0   CPU info:  sudo lscpu [sudo] password di michele: Architecture: x86_64 CPU op-mode(s): 32-bit, 64-bit Byte Order: Little Endian CPU(s): 8 On-line CPU(s) list: 0-7 Thread(s) per core: 2 Core(s) per socket: 4 Socket(s): 1 NUMA node(s): 1 Vendor ID: GenuineIntel CPU family: 6 Model: 42 Model name: Intel(R) Core(TM) i7-2630QM CPU @ 2.00GHz Stepping: 7 CPU MHz: 1995.561 CPU max MHz: 2900,0000 CPU min MHz: 800,0000 BogoMIPS: 3991.12 Virtualization: VT-x L1d cache: 32K L1i cache: 32K L2 cache: 256K L3 cache: 6144K NUMA node0 CPU(s): 0-7 Flags: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good nopl xtopology nonstop_tsc cpuid aperfmperf pni pclmulqdq dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm pcid sse4_1 sse4_2 x2apic popcnt tsc_deadline_timer aes xsave avx lahf_lm epb pti tpr_shadow vnmi flexpriority ept vpid xsaveopt dtherm ida arat pln pts   Why does the resuming fail?  Thanks in advance for your help.


I have a good friend playing in my game, but he's done things like:   Killing NPCs which direct the story, effectively ruining the rest of the group's chances. Spending all of his money on inane items like "appletinis" or "croissants". Killing civilians and guards without regard for consequences. One shotting bosses. Stealing treasure from other characters and refusing to give it back. Refusing to use his powers to help the group unless they offer him all of their best gear.   That's just a small sampling, but I hope it gets the point across.  I know that if I try to talk to him one-on-one he'll get angry. It's sort of his M.O. Whenever one of them confronts him he gets defensive as well.   I want him to participate because he's kinda supported the whole idea from the beginning but I'm worried that he's ruining the fun for the rest of the group. I also don't know the rules as well as he does, since I'm still really new to GM-ing - and tabletop RPGs as a whole - and he's been interested in these types of games for a while.  What sort of things can I do to make him play more effectively with the team?

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


The winner of a tennis game must win with a two point advantage.  Similarly, a suggested edit should not be approved unless it can get two more approvals than rejections.  This should greatly reduce incidents like  from happening.

Currently, the threshold for approving or rejecting a suggested edit is , whichever is reached first.  This means that, when  or just  edits get approved, it's often with a vote count of something like 1 reject / 2 approve (or 2 reject / 3 approve on SO).  Typically, these edits manage to get one or two very quick approve votes from, um, , after which it's very hard for the slower and more careful reviewers to accumulate enough votes to catch up before the edit is approved.  Conversely, when a valid edit gets wrongly rejected, this very rarely happens unanimously either.  More often, you'll see something like 3 votes to reject / 2 to approve, but that single last vote, no matter how well or poorly considered, is enough to tip the scales.  So I'd like to propose a simple change to the approval / rejection threshold:        Suggested edits should be approved when S = (# of approve votes − # or reject votes) ≥ N, where N = 3 on SO and N = 2 on other sites.   Similarly, suggested edits should be rejected when S ≤ −N.      No, this change is not going to magically fix all the problems with suggested edit review.  But I believe that it would be a simple and conservative improvement over the current behavior:   For obviously good or bad edits that get approved / rejected unanimously, this suggestion would not change the current behavior in any way. For edits that get one mistaken or careless reject / approve vote (as happens pretty often), an extra approve / reject vote would be required to balance it.  This would slightly slow the review process for such edits, but not excessively so.  Further, I would argue that these are precisely the kind of edits that deserve that little bit of extra attention to make sure the eventual decision will be correct. Edits that are truly controversial, and for which the reviewer community is nearly exactly 50–50 split between voting to approve and reject, might stay in the review queue significantly longer (maybe twice as long on average) than under the current system.  However, this is a trade-off for the increased likelihood that the eventual decision will actually reflect the majority opinion among reviewers, rather than mere random chance.  In any case, even if reviewers are exactly 50–50 split, the  under the proposed scheme is only N², i.e. 4 votes for other sites and 9 votes for SO.  Even a slight bias in the voting will further reduce this.  Besides, the longer the suggestion remains in the queue, the more likely it gets that someone will short-circuit the process by casting a binding vote (mod / post owner) or by choosing to improve the edit.     Ps. If it is felt that there's an issue with , a simple further chance to address that could be to make each reject vote count as, say, −2 rather than just −1 approval votes (and change the rejection threshold to S ≤ −2 × N to compensate).  This still wouldn't help with bad edits getting unanimously approved (which isn't really something that can be fixed, except maybe by slugster's cattle prod), but it would mean that each reject vote would now effectively cancel out two approve votes, titlting the balance for disputed edit suggestions in favor of rejection and making it easier for more careful reviewers to counter the "robo-approvers".


Hey I try to do presentation in beamer but I have problem with blocks. I start new Frame and I create new block. But when I click double enter I dont go out from this block. How can I end block and write sth in normal style?

I have been using beamer in LyX for a while now. Love it. But I just got a new computer, istalled LyX again and when I create a new beamer file (or open an old one) the "separator" option that is used to end a frame is not avaiable.  I do not know if there is something wrong with my installation or if I should install some package, or something else.  Has anybody ever run into this problem as well?  Thank you for the help.  Edited: Thank you for the answers, I basically need to update lyx on the other computers now.


I told a friend of mine to play Undertale, but as he doesn't have a PC, I will let him play the game on my pc. The problem is... I already completed the game in genocide, but from what I hear, there will be save files left even after the "true" reset with %appdata%. Someone on Reddit even said it stores Registy files on Windows... On another question found here, they mentioned "UndertaleGenocideRemover", but do that actually work? I don't want that the game remembers some decision and ruins the gameplay of my friend. I want that he can experience the game as a whole, with a clean, fresh start.

The ending I got is :      the genocide   When I reset my file, my past choices still take effect. I want to start a clean run.  I don't want to buy the game again, what do I do?


Im looking at video software. Im not sure what else to do? I use to run Cyberlink but cant since Im running the latest version of Ubuntu. What are my options?

What video editing software would you recommend on Ubuntu (or Linux in general) and why?  It can be for either beginners or experienced users.  Please only place one piece of software per response and include details to what makes it great!


What does Lucius Malfoy do for work? I know they have a lot of gold, so how did the family obtain it? Was it inherited just like the Potter family? He was a school governor, but was that his only job? Not sure if school governors actually get paid. I don't think he actually worked at the ministry, from what it says in the novels he just stopped in from time to time to give good to various organizations.   Harry Potter Order of the Phoenix  Chapter Educational Decreee Number 24 quoting Draco Malfoy     'Yeah, Umbridge gave the Slytherin Quidditch team permission to continue playing straightaway, I went to ask her first thing this morning. Well, it was pretty much automatic, I mean, she knows my father really well, he's always popping in and out of the Ministry . . . it'll be interesting to see whether Gryffindor are allowed to keep playing, won't it?'   Does anyone know what Lucius Mafoy's job was and how be has so much money?

Given how old some of those blue blood wizarding families are, I'd expect many of them to run out of money unless they have income sources (ala Gaunts).  Since there seem to be no feudal sources of income, Lucius Malfoy must have had some income source.  What exactly was it? Did he hold a job? Selling Dark Artifacts to B&B doesn't seem like an income stream :)


I created a simple tex file: sample1.tex  \documentclass{article} \begin{document}   Hello World! \end{document}   I used command:  pdftex sample1.tex   log file is:  This is pdfTeXk, Version 3.141592-1.40.3 (Web2C 7.5.6) (format=pdftex 2013.10.9)  17 MAR 2016 18:50  entering extended mode  %&-line parsing enabled. **sample1.tex (./sample1.tex ! Undefined control sequence. l.1 \documentclass                   {article} ?  ! Undefined control sequence. l.2 \begin           {document} ?  [1{/usr/share/texmf/fonts/map/pdftex/updmap/pdftex.map}] )</usr/share/texmf/fon ts/type1/bluesky/cm/cmr10.pfb>  Output written on sample1.pdf (1 page, 6933 bytes). PDF statistics:  10 PDF objects out of 1000 (max. 8388607)  0 named destinations out of 1000 (max. 131072)  1 words of extra memory for PDF output out of 10000 (max. 10000000)   Output pdf is as: article document Hello World!  Results are not as expected

First of all I would like to thank you because you helped me out a lot with all your answers to the already online questions.  Now, here is my problem. I am trying to do a bibliography file with TeXworks but I get this error when I try to compile (pdfLaTeX+MakeIndex+bibTeX):      This is pdfTeX, Version 3.1415926-2.4-1.40.13 (MiKTeX 2.9 64-bit)     entering extended mode     ****PATH here******     ! Undefined control sequence.     l.1 \documentclass         [a4paper,11pt]{report}   I've been reading some similar questions but I don't find the way to fix it (maybe I am missing something). I found one that says that I am trying to compile a LaTeX file using TeX compiler but I don't know how to change the configuration.  This is the .bib fiel content:      \documentclass[a4paper,11pt]{report}     \usepackage[english]{babel}     % faire de l'anglais     \usepackage[latin1]{inputenc}   % accents dans le source     \usepackage[T1]{fontenc}        % accents dans le DVI     \usepackage{url}     \begin{document}      @Article{ref11, author={Danihelka, Jiri and Kencl, Lukas}, journal={Cloud Futures Workshop 2012 }, title={Colaborative 3D Environments over Windows Azure}, year={2012}, month={May}, pages={}, note={}     }      @book{ref12, author = {Lee, Henry and Chuvyrov, Eugene},     title = {Beginning Windows Phone 7 Development},     publisher = {Apress},     volume = {},     number = {},     series = {},     address = {},     edition = {Second edition},     year = {2011},     month = {July},     note = {}     }      @Article{ref13, author={}, journal={}, title={Cloud computing}, year={}, month={}, pages={}, url={\url{http://en.wikipedia.org/wiki/Cloud_computing}}     }      \end{document}