I have been writing this code and I hit a wall with this access violation. I believed it may have been an issue with running out of the array in the for loop for(int i = 0; i <= this->lastIndex; i++), but I can't figure out what to change in there(if anything). Simplified version of code:  Test.h  class Test { public:     void setID(string ID);     void setName(string name);      virtual void print() = 0;      string getID();     string getName();      Test();     Test(string ID, string name);     ~Test();  protected:     string ID;     string name;   Test.cpp  #include "Test.h" Test::Test() {     this->ID = "";     this->name = ""; }  Test::Test(string ID, string name) {     this->ID = ID;     this->name = name; }  string getID() {     return ID; } string getName() {     return name; } void Test::setID(string ID) {     this->ID; } void Test::setName(string name) {    this->name; }  void Test::print() {     cout << ID;     cout << name; } Test::~Test() {}   RosterTest.h  #include "Test.h"  class RosterTest { private:     int lastIndex;     int capacity;     Test** tests; public:     RosterTest();     RosterTest(int capacity);      void parseThenAdd(string datarow);     void print_All();      ~RosterTest(); }   RosterTest.cpp  #include "RosterTest.h"  RosterTest::RosterTest() {     this->capacity = 0;     this->lastIndex = -1;     this->tests= nullptr; } RosterTest::RosterTest(int capacity) {     this->capacity = capacity;     this->lastIndex = -1;     this->tests= new Test*[capacity]; }  void RosterTests::parseThenAdd(string row) {     if(lastIndex < capacity)     {         lastIndex++;          int rhs = row.find(",");         string ID = row.substr(0, rhs);          int lhs = rhs + 1;         int rhs = row.find(",",lhs);         string name = row.substr(lhs, row.length() - lhs);      } }   void RosterTest::print_All() {     for(int i = 0; i <= this->lastIndex; i++)     {         (this->tests)[i]->print(); // ERROR HERE     } } RosterTest::~RosterTest() {     for(int i = 0; i <=lastIndex; i++)     {         delete this->tests[i];     }     delete tests; }   main.cpp  #include "RosterTest.h"  int main() {     const int numTests= 2;     string testData[numTests] =     {         "test1,name1",         "test2,name2"     };      RosterTest* ros = new RosterTest(numTests);     for (int i = 0; i < numTests; i++);     {         ros->parseThenAdd(testData[i])     }     ros->print_All(); //ERROR HERE   Where I marked //ERROR HERE is where the errors are located as far as I know, using print_All() fails on the first loop and I'm unsure why.

In Visual Studio, we've all had "baadf00d", have seen seen "CC" and "CD" when inspecting variables in the debugger in C++ during run-time.  From what I understand, "CC" is in DEBUG mode only to indicate when a memory has been new() or alloc() and unitilialized.  While "CD" represents delete'd or free'd memory.  I've only seen "baadf00d" in RELEASE build (but I may be wrong).  Once in a while, we get into a situation of tacking memory leaks, buffer overflows, etc and these kind of information comes in handy.  Would somebody be kind enough to point out when and in what modes the memory are set to recognizable byte patterns for debugging purpose?


We currently have exchange 2010 setup as a test behind our domino servers. All our users are in Active Directory and have the AD mail attribute set to their email address. I would like to know if there is a way to include all AD users in the address book even if they do not have an exchange account. I have read this post:    about creating separate contacts for the users but I would like to use the current AD users rather than keep a separate list of users. Any Ideas?

We just made the switch to Google Apps for part of our domain. We disabled the accounts that are now on Google Apps and mail routes correctly. Our problem is that now we have no way of seeing those users in the Global Address List.  So we have these users in our Active Directory, they have no mailbox on Exchange, and we want to be able to see/search for their addresses in the GAL. Is there any way to do this?  This is Exchange 2007, if that matters.


Find all natural numbers $m$ such that $\varphi(m)$ is a prime number.  Let $a$ is coprime with $m$. By using Euler's theorem and Fermat's little theorem, we have $a^{\varphi(m)} \equiv 1 \mod m$ and $a^{m-1} \equiv 1 \mod m$. This is the only thing I have. Please help me. Thank you very much.

I was thinking about this problem today. If $p$ divides $n$, then $p-1$ must divide $\phi(n)$. But $p-1$ is even for all primes greater than $2$, so must $\phi(n) = 2$ - the only even prime? I feel like this argument is shaky and not very rigorous!


I'm trying to render an animation, the problem is Blender is not rendering anything. The CPU is not working at all, what to do? Here's the file that I'm trying to render: .

This is meant to solve this problem once and for all. What is every reason an object isn't showing up in a render or viewport in when using the cycles render engine?


I'm writing a code to take a rain time-series and save hourly files for each day in order to feed a hydrological model, so, basically, I need to save each file with the hour of the day with tho digits, like this: rain_20200101_0000.txt rain_20200101_0100.txt ... rain_20200101_0900.txt rain_20200101_1000.txt .. rain_20200101_2300.txt  But python doesn't put a zero before numbers between 0-9, so if I use a range(24) to do that it will save the first 10 hours like "rain_20200101_100.txt" The solution I found was to put an if for x<10 and x>=10 inside the range(24) and insert a "0" before the hour for the first condition, but I think that is too rude and should be a more eficient way to do that. Could you help me with a simpler solution for this code?

What is a Pythonic way to pad a numeric string with zeroes to the left, i.e. so the numeric string has a specific length?


So upon entering Luminose city, I immediate sought out the clothing store to look at what was offered in this city. I mean, c'mon, it's pokemon with customization? Nuts! But when I entered the store, my character was told she wasn't 'as stylish as she could be', and asked to visit other clothing stores in Luminose before returning. Any help on how to access this particular store?

Once the player obtains access to Lumiose City for the first time, they'll be able to visit Boutique Couture from the city's Vernal Avenue (South fork, connecting from South Boulevard). Upon entering the store without performing any other actions, the player will be turned away and informed they "aren't stylish enough" and that they should visit more places in Lumiose City before visiting again.  This description is dubious, and doesn't inform the player of what they need to accomplish to gain access. Specifically:  Even beating the game (completing the Pokémon League) fails to allow access, as does modifying the player's look, visiting most shops in all areas of Lumiose City, and performing all hair stylist, PR studio, and associated actions. Completing a set of triple battles in Restaurant Le Wow did set the event flag that allowed access in my copy of Y, but it is not clear if this is the only requirement for access.  So other players may benefit, and so I know how to repeat this process if I obtain a copy of X or the future release of Z, what exact requirements yield access to this store for the first time?


So the thing is I'm trying to install Cmake and cmake-curses-gui.  I have updated the system with apt-get-update.    sudo apt-get install cmake    Reading package lists... Done    Building dependency tree    Reading state information... Done    Package cmake is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'cmake' has no installation candidate  sudo apt-get install cmake-curses-gui    Reading package lists... Done    Building dependency tree         Reading state information... Done    E: Unable to locate package cmake-curses-gui      That's strange. Can anyone give some pointers?  Pastbin sources.list :-

What does the above Error mean? What is an installation candidate?  I was trying to do  sudo apt-get install munin-memcached     and I get this message:  Reading package lists... Done Building dependency tree        Reading state information... Done Package munin-memcached is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source E: Package munin-memcached has no installation candidate   I googled for the problem and someone said to do a apt-get upgrade but it still did not solve my problem.


On $\mathbb{Z}[x]$ polynomial rings is module $M=(x,3)=x\mathbb{Z}[x]+3\mathbb{Z}[x]$ cyclic? Note: $(x,3)$ means generated by x and 3 I have no idea how i should start. I only know cyclic means generated by only one element. I would be appreciated for any help.

Hi I don't know how to show that $\langle 2,x \rangle$ is not principal and the definition of a principal ideal is unclear to me. I need help on this, please.   The ring that I am talking about is $\mathbb{Z}[x]$ so $\langle 2,x \rangle$ refers to $2g(x) + xf(x)$ where $g(x)$, $f(x)$ belongs to $\mathbb{Z}[x]$.


I'm still kinda new to number theory so could someone tell me if my solution is right?   Reducing $\mod n +10$  $$n \equiv -10 \pmod{n+10} \implies n^3 + 100 \equiv -900 \pmod{n+10}$$ So we want $(n+10) \mid 900$ and the largest number would be $n = 890$

What is the largest positive $n$ for which $n^3+100$ is divisible by $n+10$  I tried to factorize $n^3+100$, but $100$ is not a perfect cube. I wish it were $1000$.


auto update is "broken" and will not work. I now have a red "no entry" sign at the top of the screen. It says "error: BrokenCount >0" I am completely lost, and what I have seen on the forum looks like its written in serbo-croat to me. Do I have to reload the Ubuntu disc and if I do will I lose everything I have on the machine? I do not want to go back to anything with Microsoft written on it please..

This red icon.... It showed up after I upgraded to Ubuntu 12.04LTS; I can't figure out how to ditch it. It seems to be a notification thing.  I am at a loss.  The icon is this one:      I clicked it and read this:     An error occurred, please run Package Manager from the right-click menu or apt-get in a terminal to see what is wrong. The error message was:  'Error: BrokenCount>0'.        This usually means that your installed packages have unmet dependencies.


class GfG {    static String encode(String str)   {     int count =1;     char c ;     StringBuilder result = new StringBuilder(200);     int i=0;     while(i<str.length()-1){         int j =i+1;         count =1;         c = str.charAt(i);         while(j<str.length() && str.charAt(j)==c  ){             count++;             j++;         }         result.append(c+""+count);         if(str.charAt(str.length()-1)!=c && j==str.length()-1)             i=j-1;         else             i=j;     }     return result.toString(); }  public static void main(String[] args) {     String res = encode("hnwnkuewhsqmgbbuqcljjivswmdkqtbxixmvtrrbljptnsnfwzqfjmafadrrwsofsbcnuvqhffbsaqxwpqcac");     if(res.equals("h1n1w1n1k1u1e1w1h1s1q1m1g1b2u1q1c1l1j2i1v1s1w1m1d1k1q1t1b1x1i1x1m1v1t1r2b1l1j1p1t1n1s1n1f1w1z1q1f1j1m1a1f1a1d1r2w1s1o1f1s1b1c1n1u1v1q1h1f2b1s1a1q1x1w1p1q1c1a1c1"))         System.out.println("yes");     else         System.out.println("no");    } }   I am getting this error and i have no clue how to deal with it . Can anyone tell me the reason and solution for this error .  Exception in thread "main" java.lang.OutOfMemoryError: Java heap space     at java.util.Arrays.copyOf(Arrays.java:3332)     at java.lang.AbstractStringBuilder.ensureCapacityInternal(AbstractStringBuilder.java:124)     at java.lang.AbstractStringBuilder.append(AbstractStringBuilder.java:448)     at java.lang.StringBuilder.append(StringBuilder.java:136)     at GfG.encode(GFG.java:18)     at GfG.main(GFG.java:28)

I am writing a client-side Swing application (graphical font designer) on Java 5. Recently, I am running into java.lang.OutOfMemoryError: Java heap space error because I am not being conservative on memory usage. The user can open unlimited number of files, and the program keeps the opened objects in the memory. After a quick research I found  and others saying on Windows machine the JVM defaults max heap size as 64MB.  Given this situation, how should I deal with this constraint?  I could increase the max heap size using command line option to java, but that would require figuring out available RAM and writing some launching program or script. Besides, increasing to some finite max does not ultimately get rid of the issue.  I could rewrite some of my code to persist objects to file system frequently (using database is the same thing) to free up the memory. It could work, but it's probably a lot work too.  If you could point me to details of above ideas or some alternatives like automatic virtual memory, extending heap size dynamically, that will be great.


Prove: if $f(z)$ differentiable in $|z|<R$  So Does  $\overline {f(\overline{z})}$   I have went over previous similar questions but did not find an answer to the following:  We say that $f(z)$ differentiable in $|z|<R$ therefore  $$u_x=v_y$$ and $$u_y=-v_x$$  Looking at $$\overline {f(\overline{z})}=U(x,-y)-iV(x,-y)$$  We can say that it is defined in $|z|<R$ as $|z|=|\overline{z}|<R$  But looking at its $C-R$ equations we get  $$U_x=--V_y\iff U_x=V_y\iff u_x=v_y$$  $$-U_y=-V_x\neq u_y=-v_x$$  How can we conclude from $C-R$ that $\overline {f(\overline{z})}$ is differentiable?

I'm doing a bit of self study, but I'm uncomfortable with a certain idea. I want to show that $f(z)$ is analytic if and only if $\overline{f(\bar{z})}$ is analytic, and by analytic I mean differentiable at each point. Here $f$ is a complex valued function.  What I do is write $f(z)=u(x,y)+iv(x,y)$, where $u$ and $v$ are real functions of two variables. Then $\overline{f(\bar{z})}=u(x,-y)-iv(x,-y)$.  These two forms look very similar, in the sense the one function being differentiable should immediately imply the other is differentiable, since the only thing really changing might be a $-$ sign popping out due to the chain rule.   How can I more rigorously express that $f(z)$ is analytic iff $\overline{f(\bar{z})}$ using this? Many thanks.


I want to prove that $1,999\dots$ Is an element of $\mathbb{Z}$. Here is my try :   $x = 1,9999\dots \\  10x = 19,9999\dots \\ 10x - x = 18  \\ 9x = 18  \\ x = 18/9  \\ x = 2 $    So $x \in \mathbb{Z}$   I know something is wrong but where ?

I'm told by smart people that $$0.999999999\ldots=1$$ and I believe them, but is there a proof that explains why this is?


I was reading this question , and one of the answers provided a link to . That answer got a down vote with a  saying " -1 for link to cplusplus.com."   the comment provided a  but it is expired.  Is there something wrong with using that website as a reference for answers ?

Someone just edited a link in one of my answers to point to a 'better reference'.    I've no problem with links being changed in general, but this smells like part of a concerted attempt to redirect traffic.   Is this kind of activity acceptable on SO?


I am using two divs, one on top with no content or height and the other below it with some content or just height. I wish to put some space between them and instead of using margin-bottom alone on the first div or margin-top alone on the second div I am evenly sharing the space between both, i.e. half the space on the first div's margin-bottom and half the sapce on the second div's margin-top. For some reason only one of the two seem to apply and the other is ignored.  Check out this example      body {     margin:0px; } .element1 {     margin-bottom:10px; } .element2 {     margin-top:10px;     border:1px solid #000;     height:30px; }

     try removing either margin-top on .element2 or margin-bottom on .element1, the space remains the same, but remove both and the space disappears.

So essentially does margin collapsing occur when you don't set any margin or padding or border to a given div element?


There is not much to explain here. Just want to know why echo $SHELL always gives the output /bin/bash even though I switch to other shells. What do I have to do to make sure the $SHELL gives the correct shell path that I am in.  [root@localhost user]# echo $0 bash [root@localhost user]# echo $SHELL /bin/bash [root@localhost user]# csh [root@localhost user]# echo $0 csh [root@localhost user]# echo $SHELL /bin/bash [root@localhost user]# tcsh [root@localhost user]# echo $0 tcsh [root@localhost user]# echo $SHELL /bin/bash [root@localhost user]# sh sh-4.2# echo $0 sh sh-4.2# echo $SHELL /bin/bash sh-4.2#  [root@localhost user]# which csh /bin/csh [root@localhost user]# which csh /bin/csh

When I run echo $SHELL the output says /bin/tcsh which means that I am running a tcsh shell. But for example when I issue the following command  alias emacs 'emacs -nw'    I get the following error:  bash: alias: emacs: not found bash: alias: emacs -nw: not found   and when I issue alias emacs="emacs -nw" it runs fine!  This is confusing since I am running tcsh but the commands are interpreted by bash.  What could be the reason?


Im looking for a solution to an issue regarding tmux. One of my scripts ns2server stopped working recently when running start (using tmux) but not in debug mode (not using tmux).  I found that using tee to get the output of tmux was for some reason stopping Natural Selection 2 server from running.   tmux new-session -d -s ${servicename} "${executable} ${parms}|tee -a '${consolelog}'"   I removed tee and the server started working again.  tmux new-session -d -s ${servicename} "${executable} ${parms}"   There have also been reports that other server scripts do not update the consolelog unless you enter the tmux session and press return.  Im guessing there is a better way to send the output of tmux to a file than using tee. Does anyone have any suggestions on this? Thank you  Project homepage       EDIT: I have looked at this answer . Although very useful does not quite answer my question. The answer to the other question talks about toggling logging on and off. I require logging to be on by default as soon as a new session is started. Plus I would rather not have to create a .tmux.conf file if this can be avoided. Maybe there is a way for me to script the toggling on by default when the session is started.  EDIT: Found a good solution  tmux new-session -d -s ${servicename} "${executable} ${parms}" tmux pipe-pane -o -t ${servicename} "exec cat >> '${consolelog}'"   the second line activates logging in the session and sends it to a file.

I make heavy use of screen's "log" command to log the output of a session to a file, when I am making changes in a given environment. I searched through tmux's man page, but couldn't find an equivalent. Is anyone aware of a similar feature in tmux, or do I have to write my own wrapper scripts to do this?  EDIT: I'm aware of 'script' and other utilities that allow me to log a session. The reason that screen's functionality is so useful is the ability to define a logfile variable which uses string escapes to uniquely identify each session.  e.g. I have a shell function which, given a hostname, will SSH to that host in a new screen window and set the window title to the hostname. When I start a log of that session, it is prefixed with the window title.  If this functionality doesn't exist in tmux, I'll have to create a new set of shell functions to set up 'scripts' of sessions I want to log. This isn't hugely difficult, but it may not be worth the effort given that screen does exactly what I need already.


I heard this problem and I am a bit stuck.  Given a function $f : I \rightarrow \mathbb{R}$ where $I \subset \mathbb{R}$ is an open interval. Then $f$ can be writen $f=g+h$ where $g,h$ are defined in the same interval and have the Intermediate Value Property. I tried to construct firstly the one function arbitarily at two points and then tried to define it in a way to have the IVP but I cannot manage to control the other function, as I try to fix the one I destroy the other and I cannot seem to know how to be certain I have enough point to define both in a way they have the IVP.  Any help appreciated! Thank you.

If $I$ is an interval of real numbers , then is it true that any function $f:I \to \mathbb R$ can be written as $f=f_1+f_2$ , where $f_1 , f_2 : I \to \mathbb R$ have the Intermediate value property?


I have to layout a 16 x 12 ft (size of tarpaulin) document in Photoshop, but when I change the resolution to 300 it's too large and it takes time to render the layout. What should I do?

(This question is meant to be a resource to direct others to given that this is a common question.)  Given the task of creating an image that will be printed at a certain size, what pixel dimensions and resolution should I be setting my file at?


So this is the first version of Ubuntu that stops the sound from coming out of my speakers when I plug in headphones. Unfortunately it also stops the sound altogether... I would like to submit a bug report but I can't remember how, nor what program I should submit it for?

I found a problem with an application on Ubuntu.   Questions :   How do I best report the issue?  What sort of information should I provide?


If I began eating and drinking at 7am,  can I say:     I ate my meal, and I drank my liquor from the same time.

If the eating meal starts at 7:00 AM and finishes at 8:00 AM. the drinking liquor starts at 7:00 AM and finishes at 7:50 AM.  can I say that :   I drank the liquor when I ate the meal. I ate the meal when I drank the liquor.   Is I need to use progressive tense ?


The current text is: "Voted on 600 questions and 25% or more of total votes are on questions"  I think it should read "Voted on 600 posts and 25% or more of total votes are on questions", which is what I believe was meant (understanding post as "question or answer")

"Voted on 600 questions and has better than 3:1 answer/question vote ratio" is the current text.  "Voted on 600 questions and 25% or more of total votes are on questions" is my proposed text.  (Or should it read "or less"?  I'm still not completely sure what is intended.)  "Better" in the original doesn't indicate which way is preferred (and it's not clear to me one way or the other is better, merely that a certain threshold is the requirement for this badge).  This is even slightly shorter, in both characters and as displayed for me in a proportional font, which should help for a badge with one of the longest current descriptions.


I am using Stack Exchange latest iOS app and below is what my default screen looks like when I open the app:    I just would like to see questions only from Stack Overflow.com and salesforce.stackexchange.com but right now it shows questions from all other network sites which I am not interested. So how do I change this behaviour?  Apologies if this is a very basic question. I tried googling but did not have any success.

My feed shows questions from all SE sites, most of which are irrelevant to me.  I'm interested in physics, math, and programming, topics I find served well by the SE model.  There are many SE communities I have no interest in and even get annoyed when I see the kinds of questions and answers posted (ie, opinion based answers that are passed off as truths).    It would be much better if I could manually add each site I'd like to see questions from.


I am having an issue with a rendering. I am trying to render a outside architecture scene with a sky texture (nishita) For some reasons, there are some black stains/pixel in some random areas of the render... I'm using blender 2.90.1 Here is the file :  Any thought ? :D  Thanks Valentin

I was following  on creating a watch and noticed that when I rendered the watch, some pieces were messed up.  I'm new to 3D modeling and I've just learned Blender, I can't explain it well, so here's a picture:    Other examples:     I don't know if it's a problem with my World texture, the object, or the object's texture/material, so I can't even guess how to fix it. What causes this? Is it possible to fix it?


May the matrix be:  >>> A=[[]]*3 >>> A [[],[],[]]   I want to append the value 1 to the first list of the matrix so that:  >>>A[0].append(1) >>>A [[1],[],[]]   But when I try it this way, the result is:  >>>A[0].append(1) >>>A [[1],[1],[1]]   How do I make it only append in the first list?  I'm on Python 3.6.6

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?


Got a weird (or neat) bug here.   was migrated from music.SE to sound design beta.  I happen to remember that I upvoted if not all, all but one of the other answers on the question.  However, since it has been migrated to sound.SE, although the answers preserved their votes from music.SE, I am able to upvote them again.    I remember, for instance, that I was the only one to have upvote the accepted answer.  My upvote is still there, but I can upvote it again, giving me a double-vote power.  Not a critical bug, but still a bug that could use working out.

was created on Server Fault, answered on Server Fault, I upvoted some of those answers on Server Fault, and then moved by consensus to Super User.  Now that the question is on Super User, I can upvote the same answers I previously upvoted on Server Fault.


I'm trying to write a command that will display a title that says "welcome" when you log into my server, but only on the screen of the player that just logged in. I want this to happen every time anyone logs into my server. how can I do this?

Is there any way to run a command automatically when a player joins the server? I need to do this without the use of a Bukkit plugin. I think it's possible with MCP but I want to know how!


We have a large database, with a size of approx 400GB. We are using bulk insert (from upstream system) with the following parameters:  `Driver=/IIS/Appl/Server/branded_odbc/lib/VMsqls24.so` `Description=DataDirect 6.0 SQL Server Native Wire Protocol` `Address=SQLLPB2GBRxxx.xxxxx.COM,14331` `AnsiNPW=Yes` `AuthenticationMethod=4` `Database=DB_PROD` `QuotedId=No` `EnableBulkLoad=1` `BulkBinaryThreshold=32` `BulkCharacterThreshold=-1` `BulkLoadBatchSize=1024` `BulkLoadOptions=0`   The delta changes in the DB represent approx 70GB at month end. The transaction log file is falling over at 800GB (twice the size of the actual DB, where 800GB is the current size of the allocated transaction log drive). Autogrow is enabled on the transaction log, but we are unsure WHY it is becoming so large. Simple recovery is set.  Are there any parameters (either upstream on the bulk insert, or on the transaction log db ) we can fine tune?

This one seems to be a common question in most forums and all over the web, it is asked here in many formats that typically sound like this:  In SQL Server -  What are some reasons the transaction log grows so large? Why is my log file so big? What are some ways to prevent this problem from occurring? What do I do when I get myself on track with the underlying cause and want to put my transaction log file to a healthy size?


I have a question with regex, I'm trying to scrape a stock price. The element surrounding it looks like this:  17.89   As you see there are multiple parentheses in that element so when I try to narrow it down with the following code the parentheses cause my script not to display any results.  MatchCollection list = Regex.Matches(data, "<span class=\"Trsdu(0.3s) Fw(b) Fz(36px) Mb(-4px) D(ib)\" (.+?)", RegexOptions.Singleline);   I Know you can ignore quotation marks using \ but is there away to ignore parentheses?

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?


I am using a lot of tabulars in my dissertation, and I occasionally would like to append a footnote to an item in the table to explain exactly what I mean by it. When I run latex and convert into pdf, the footnote number shows in the table, but there is nothing at the bottom of the page. What can I do?   I am using MikTeX 2.9 and Winedt 10, and here is a (probably way to informative) MWE:   \documentclass[12]{report} \setcounter{tocdepth}{4}  \usepackage{layout} \setlength{\voffset}{-0.75in} \setlength{\headsep}{5pt}   \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{csquotes} \usepackage{authblk} \usepackage [T1]{fontenc} \usepackage[backend=biber, style=authoryear-comp]{biblatex} \usepackage{xyling} \usepackage[super]{nth} \usepackage{linguex} \usepackage{xspace} \usepackage{cgloss4e} \usepackage{abstract} \usepackage{booktabs} \usepackage{hyperref} \usepackage{xr}  \let\eachwordone\itshape  \addbibresource{ref2.bib}  \title{XXX} \author{YYY} \date{\today}   \begin{document}  blablabla.   \setlength{\tabcolsep}{1.5em} \begin{table}[h!] \caption{Z} \begin{tabular}{c} \toprule Item\footnote{With this I mean...} \\  \end{tabular} \end{table}  \end{document}

I would like to have footnotes in tables, but the \footnote command does not work inside a table environment.  Googling one finds that this is , at least in the UK.  That link contains a list of solutions to the problem, but since the author of the FAQ does not believe that this is good style, no comparison is made between the different methods.  I am sure that there are good typographical reasons why in most situations it is undesirable to have footnotes in tables (although I have never come across them), however I have recently felt the need to do just this in a paper I am currently writing.  Therefore I'd like to ask two questions:   What are the arguments against footnotes in tables? If one really must go against the advice in 1., which method (whether considered in the  or not) would you recommend?   Thanks in advance.  Added  In response to ShreevatsaR's comment: I do not much care for where the text of the footnote appears.  I do however insist on the footnote marks being attached to the relevant entries in the table, so that I can avoid having to reference "the second entry in the eighth line of the table", etc...


The title says it all. Is there a way so I input  input("")   They input  dbs -U thebos123 -P pw.txt   Then store thebos123 into a variable but not the rest

What's the easiest, tersest, and most flexible method or library for parsing Python command line arguments?


I'm new to JAVA programming and right now I'm facing a strange case. I set the confirmation variable to the type of String , it will hold the user input. When the user type "yes" The program should create a new user, but it didn't . Instead, it rise the false alarm "Process is canceled by user". It seems the convirmation variable didn't evaluated correctly. Any advice guys. thanks.  This is my code (it's pretty simple though):  import java.util.Scanner;  public class CreateUser {     public static void main(String[] args)     {         Scanner input = new Scanner(System.in);         String firstName;         String lastName;         String confirmation;          System.out.println("Create new user");         System.out.print("Enter first name : ");         firstName = input.nextLine();         System.out.print("Enter last name : ");         lastName = input.nextLine();          System.out.println("Are you sure?");         confirmation = input.nextLine();          System.out.println(confirmation); // this line is to make sure that the variable value is "yes"          if(confirmation == "yes")         {             Users newUser = new Users(firstName, lastName);             System.out.printf("User %s %s has been created\n", firstName, lastName);             System.out.println("Total active users now is :"+Users.getRegisteredUsers());         }         else         {             System.out.println("Process is canceled by user");         }          input.close();      } }   And this is the output :  Create new user Enter first name : fin Enter last name : fin Are you sure? yes yes Process is canceled by user

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?


We will be travelling in September 2017 by Greyhound from New York City to Buffalo with no transfers. The tickets are already booked online. Our departure time is 8.00 am from the Port Authority. We will have 2 checked baggages. How do we find the gate number when we reach the Port Authority terminal?

I am using Greyhound to go from NY to DC. I don't see on my ticket where exactly my bus will be. Is this information on my ticket somewhere or do I just go to Port Authority and ask? This is my first bus trip so I'm a bit nervous.


I'm on a virtual machine trying to copy a file from SSH to local system. Using Debian. I don't see the "Connect to" option. When I try to do it trough terminal, I enter  scp [myusername@remote.system]:[path to the file obtained using "find"]   and it just gives me options for scp usage like -c etc If I enter the above command and add Downloads, it says file name and 100%, size etc, but the Downloads folder is empty What am I doing wrong? Please help!

In my terminal shell, I ssh'ed into a remote server, and I cd to the directory I want.   Now in this directory, there is a file called table that I want to copy to my local machine /home/me/Desktop.   How can I do this?  I tried scp table /home/me/Desktop but it gave an error about no such file or directory.   Does anyone know how to do this?


L'Hospital's Rule:  If ${f(x)}\over{g(x)}$ is either $0\over0$ or $\infty\over\infty$, then the $\lim_{x\to \infty}$${f(x)}\over{g(x)}$ $=$ $\lim_{x\to \infty}$${f'(x)}\over {g'(x)}$.  What I want to know is if the converse is true.  In other words, if $\lim_{x\to \infty}$${f(x)}\over{g(x)}$ $=$ $\lim_{x\to \infty}$${f'(x)}\over {g'(x)}$, then is ${f(x)}\over{g(x)}$equal to one of  $0\over0$ or $\infty\over\infty$?  By this I mean that there does not exist a case in which L'Hopital does not apply yet gives the correct answer. It is not a repeat of another question, as many have suggested.  I would ask those people to take a look at the question that they have said I have repeated.  These are two different questions, and it surprises me that they could have been confused.

$$\lim_{x \to \infty} \frac{x}{x+\sin(x)}$$   This is of the indeterminate form of type $\frac{\infty}{\infty}$, so we can apply l'Hopital's rule:  $$\lim_{x\to\infty}\frac{x}{x+\sin(x)}=\lim_{x\to\infty}\frac{(x)'}{(x+\sin(x))'}=\lim_{x\to\infty}\frac{1}{1+\cos(x)}$$  This limit doesn't exist, but the initial limit clearly approaches $1$. Where am I wrong?


I am new to this platform so can some one help me out for some commands.  I need some commands on patching a server for only specific packages.  After upgrading packages how to figure out package updated to latest version or not ??

How can I check the version of the available package in the Ubuntu repositories without installing it?


I have always pronounced Sauron like 'S-ow-ron', after reading Appendix E of the Lord of the Rings, but now I just listened to  recording of Tolkien reciting the Eagles' Song, and it sounds like he is saying "Saw-ron".  Did I mis-hear it, or did Tolkien do a mistake? Or am I supposed to pronounce it that way, and he wrote "Sauron" so that people would read it as "Sawron"? Highly unlikely, I think . . .

Did Tolkien the linguist intend for the name of the dragon Smaug to be pronounced "Smog" [IPA: /smɒɡ/ or /smɔːɡ/]? The trailer for the second installment of The Hobbit trilogy pronounces the word (pronounced 'sma-ow-g' [IPA: /smaʊɡ/]) entirely differently than the way I have been reading it for all these many years.


In Low Quality Posts review, what happens when <20k users chose "recommend deletion", and 20k users chose "delete" for the same review? For example, if a post had 3 "recommend deletion" reviews and 2 "delete" reviews, would it be deleted?

I've noticed that the number of reviews required to remove a post from a queue varies. For example, to accept/reject a suggested edit, you need two votes of the same kind. If the votes are conflicting, the number goes higher. This seems to be the case for the other queues as well. (Additionally, I think that a mod-review is binding) So, my question is: what are the criteria for a review to be marked as a "completed" review? Also, when is a review considered invalidated (i.e. "no longer reviewable")? Formerly When is a post removed from a review queue?.


Hi I use for loop to add the strings which is in array. Can anyone help me for the below code it shows error.  image = new String[] {"APP","FIELD","KYC"};  image2 = new String[] {"MEMORANDUM","ASSOCIATION"};   Now using for loop or any method I need the same image array as  image = new String[] {"APP","FIELD","KYC","MEMORANDUM","ASSOCIATION"};

I need to concatenate two String arrays in Java.  void f(String[] first, String[] second) {     String[] both = ??? }   What is the easiest way to do this?


A real palace of a house That idiot of a doctor  Would you show me the phrases above in some other ways that mean the same thing? Any comment would be appreciated

Could you think of any synonym phrase or words, so that they would be synonym with the following?  That idiot of a doctor The real palace of a house  Thanks in advance


I have an iPhone SE on old iOS 10.3.1 and I dont want to update it.  How do I add a Google account? This doesn't work:  There is a web popup (I can enter email + password, password is valid) but after that nothing happens.   No email account is added and I no longer have my contacts on my iPhone SE! Is Google blocking old version of iOS ?

I am trying to add a gmail account to my iPad in order to have contacts, email, and calendar sync.  I go to Settings -> Mail -> Accounts -> Add Account and enter my gmail credentials.  It accepts the credentials and then goes to this screen:   The spinner to the left of Gmail will spin for about 20 seconds then it just takes me back to this screen:   The account never gets added.  I get an email on my phone that says "new sign in from iPad" so I know the authentication is working.  I am using iOS 10.2.   The same problem existed in 10.0.2.  Some users have reported that doing this process over 4g rather than WiFi works, but this is a WiFi only device.  The gmail app is installed and logs me in just fine.  The same thing happens on both my 2 factor authentication account and my account without 2FA.


In this , the  claims that      for a random variable $X\geq 0$, the event $A=[X\leq x]$ is the same as $ [u(X)\geq u(x)]$, for any decreasing bounded invertible function $u$ (e.g., $u(X)=\frac{1}{1+tX}$ or $u(X)= e^{-tX}$, $t>0$).    I really don't see how this is true. Could anyone give me a hint here?

I need to lower bound the tail probability of a non-negative random variable. I have a lower bound on its expected value. I am aware of a reverse markov's inequality that does the job when the random variable is bounded above. Unfortunately that is not my case.   Is there any other inequality that may be useful to me in this regard?  thanks  NR


How to I prove that f is measurable if f is a real function of a measurable space $X$ such that $\{x ; f(x) \geq r\}$ is measurable for every rational $r$.  From my basic understanding I need to prove that $f^{-1}(U)$ is measurable where U is the union of countably open balls with rational radii?

Let $E$ be measurable and define $f:E\rightarrow\mathbb{R}$ such that $\{x\in E : f(x)>c\}$ is measurable for all $c\in\mathbb{Q}$, is $f$ measurable?  There are a number of equivalent definitions for the measurability of a function and the most obvious one would be to show that $\{x\in E : f(x)>c\}$ is measurable for all $c\in\mathbb{R}$.  Thus my strategy has been to consider an arbitrary irrational $y$ and use the density of the rationals in the reals to show that there exists some open set $O$ such that $m^*(O-\{x\in E : f(x)>y\})< \varepsilon$.  I would do this by choosing some rational $q<y$, close enough to $y$, such that the set of values in $E$ which get sent under $f$ to values strictly greater than $q$ and less than or equal to $y$ is small enough.  But that doesn't in general seem possible since I could keep sending intervals of some fixed positive length to smaller and smaller regions just beneath $y$.  However conversely, such a function would not be enough for a counter example, since finding such a function only rules out this strategy, but doesn't necessarily entail non-measurability.  Is there a better definition of the measurability of a set I should use? or does the statement actually not imply measurability?  Thanks.


I'm new to ubuntu .. i tried to use su command to enter as a root but didn't work but i tried to use sudo -i  , su root and sudo -s worked   I need to know why su didn't work ?

I am having problems with the su command. I know my password and I am typing it correctly but su indicates authentication failure.  So I checked on the internet and then went into recovery mode and changed my username's password to what I was entering before.  Even now entering the same password on su gives me authentication failure.  Please suggest what am I doing wrong??


I am aware this question has been asked many times but I'm still struggling to understand a few things.  Let R be a ring in which $x^2=x$ for all x ε R.  (a) Prove that $x + x = 0$ for for all x ε R.  (b) Prove that R is commutative.  For (a):   I understand that $a+a=(a+a)^2=a^2+a^2+a^2+a^2=a+a+a+a$. But I don't understand how $a+a+a+a ⟹ a+a=0$.  For (b): For any $x, y$ in the ring $R$, $x+y=(x+y)^2=x^2+xy+yx+y^2=x+y+xy+yx,$ so $xy+yx=0$. But how do I get to $xy = yx$ ?

Prove that if $a^2 = a$ for all elements of the ring $R$, then $R$ has characteristic 2. Is the converse of the statement true?  Attempt:  by the definition of characteristic of a ring, the first statement implies that characteristic of the ring is $\leq 2$. If the ring is assumed to be non trivial ring then, characteristic is 2.  About the last statement can we construct a field of say 8 elements and show that there exists a an element of order $\neq 2$?  Is there a simpler example ?


\documentclass{article}     \begin{document}   \begin{center}     \begin{tabular}{ | p{5cm} | p{5cm} | p{7cm} |}\hline  \centering{A} &      \centering{B} &      \centering{C} \\ \hline  \end{tabular}  \end{center}  \end{document}   I am making an A4 document and I want the words in the first row of the table to be centered. Here I have omitted other rows. But errors occur and it seems that I can't use \centering for the last column. Why doesn't it work?

I want a table whose first column is aligned top, second column is aligned middle, and third column is aligned bottom; like this:    I wrote the following code:  \documentclass{article} \usepackage[english]{babel} \usepackage{array}  \begin{document}  \begin{tabular}{| p{1cm} | m{1cm} | b{1cm} |}     \hline     x &     A long text comes here &     x \\ \hline \end{tabular}  \end{document}   Yet, to my surprise, the outcome was "all columns aligned middle," as follows:    What did I do wrong?


I want to calculate the sum of first $n$ natural numbers. I used the following C program to compute the first '$n$' digits :  #include <stdio.h> int main() {     int n;     double m;     double sum=0;     scanf("%d", &n);     while (n>0) {         m=1.0/n;         sum+=m;         n--;     }     printf("%lf",sum);     return(0); }   What I get is that the sum is very slowly diverging.    For $10^{1}$, I get the value : $2.92...$ For $10^{14}$, I get the value : $18.807..$ For $10^{16}$, I get the value : $21.92..$   So it appears to diverge.   How can we prove it? Actually sum of reciprocals is divergent, even after being a subseries of this series, so it naturally should be divergent. How can we show this?

Show that $$\sum\limits_{k=1}^n \frac{1}{k} \geq \log(n)$$ Use this to deduce that the series $$\sum\limits_{k=1}^\infty \frac{1}{k}$$ diverges.   Hint: Use the estimate $$\frac{1}{k} \geq \int_k^{k+1} \frac{1}{x}\,\mathrm{d}x$$   Note that all instances of "$\log$" mean the natural logarithm, the inverse of the exponential. After doing the integration, I've concluded that $\frac{1}{k} \geq \log(1+\frac{1}{k})>-\log(k)$  I suspect I'm supposed to use the hint to arrive at the first inequality, and then since $\log(n)$ can become arbitrarily large as $n$ increases, so must the harmonic series (essentially the comparison test).  I'm having trouble making this jump. Hints are appreciated, but please no solutions.


let $f(x)$ be two derivable on $R$,give the two postive  numbers $A,B$ and such   $$[f(x)]^2\le A$$   $$[f'(x)]^2+[f''(x)]^2\le B$$   show that   $$[f(x)]^2+[f'(x)]^2\le \max{(A,B)},\forall x\in R$$   I think maybe well know inequality：  $$|f'(x)|\le2\sqrt{|f''(x)||f(x)|}\le |f''(x)|+|f(x)|$$ $$\Longrightarrow [f'(x)]^2\le (|f''(x)|+|f(x)|)^2\le\dfrac{1}{2}([f''(x)]^2+[f(x)]^2)$$  if $A\ge B$ then I can't $$[f(x)]^2+[f'(x)]^2\le A$$  Maybe this idea can't usefulll?

Let $f\in C^2(\mathbb{R},\mathbb{R})$.   Assume there exist  $(a,b) \in \mathbb{R}^2$ such that  $\forall x \in \mathbb{R}, (f(x))^{2} \leqslant a$ and $(f'(x))^{2} + (f''(x))^{2} \leqslant b$.   Prove that: $$(f(x))^{2} + (f'(x))^{2} \leqslant \max(a,b)$$ for all $x \in \mathbb{R}$.   I tried to use taylor lagrange with the integral form of the remainder but I did not succeed.  Ì really don't know how to tackle  the problem.   Any suggestion, Hint (or Answer) will be very helpful,  Thank you in advance,


I'm having some confusion with the reasoning behind what seems to me to be an inconsistency.   For example  public class Test {     static int a;     public static void main(String[] args)     {         System.out.println(a);     } }   So that will print out 0, as expected. But say we had  this instead,   public class Test {      public static void main(String[] args)     {         int a;         System.out.println(a);     } }   This won't compile for me, complaining that a hasn't been initialized. I was expecting it to print out 0...  Which leads me to some questions:  1) Why don't function scoped variables have default values?   2) Could the static keyword be the reason? And why?

Was there any reason why the designers of Java felt that local variables should not be given a default value? Seriously, if instance variables can be given a default value, then why can't we do the same for local variables?  And it also leads to problems as explained in :     Well this rule is most frustrating when trying to close a resource in a finally block. If I instantiate the resource inside a try, but try to close it within the finally, I get this error. If I move the instantiation outside the try, I get another error stating that a it must be within a try.      Very frustrating.


I need to write a url including a character which seems a command , $  the entire command is :   \item URL - this is set as "\nolinkurl{http://localhost:9200/\$*/pcap/}";    but this produce:     URL - this is set as " \protect\T1\   textdollar*/pcap/ "   how can I avoid part "\protected\T1\textdollar" ?

I'm using the url package. Now, I have some some url with a percent sign in it and want to place it in a footnote. When I let the % where it is, I get a comment, and the whole thing fails to compile because of some unmatched brackets. When it's at the end of a line, it doesn't show up at all in the result. When I write \% instead, this gets literally into the output—but I want the url to be displayed correctly.  What could I do?


So I have the iTunes app on my iPhone 4 and I used it to purchase songs onto my phone. I went to my music app a while back a deleted some songs I didn't want anymore ( i just went to the song swiped my finger across the screen and the delete button apeared) but now I want them again and I don't know how get them back on my phone with out debuting them?

I put all my music on a playlist seperate from the rest of the music on the iTunes library, so I could easily get to what music I wanted to listen to, instead of my brother or sister's music. My brother recently got an iPod nano, and didn't know how to use iTunes, after explaining it to him, he deleted my whole entire playlist. I didn't know, so when I hooked my phone up to the computer to sync some songs I was going to buy, all the music on my phone disappeared. I've tried re-doing the playlist and syncing all of it to my phone again, but it won't work. I've also tried turning off my phone for certain periods of time, still nothing.  I lost about 200 songs (thankfully not more), and I don't know how to get it back.


a Friend gave mea HTC 526 but they hard reset an the phone is asking for me to give the Gmail account that's was set with the phone   an I nor  my friend don't know it so how can I skip this an set it up with my email /

I won a Samsung Galaxy S6 Edge, signed into it with my Google account, played around with it, wiped it, and sold it.  Now the person can't get past setup because it's saying he must login with an account previously synced to the phone.   Is there anything I can do from my side to remove this lock?


My server /dev/sda1 disk full  root@server:/var/www# df  Filesystem 1K-blocks      Used Available Use% Mounted on  /dev/sda1   48060296  45653236         0 100% /  udev         8055724        12   8055712   1% /dev  tmpfs        3225816      1140   3224676   1% /run  none            5120         0      5120   0% /run/lock  none         8064536       144   8064392   1% /run/shm  /dev/sda3  908566268 580691288 281722432  68% /home   Previously when I perform apt-get autoclean & clean I can solve the issue by clear some space. But this time it's not working.  I wish to know which directory under /dev/sda1 but I couldn't check on it. How should I do? Which directory I should look into it and delete those folder?  Having /dev/sda1 full has jammed up MySQL.  Thanks.

I've been doing jmeter tests and have had a few OutOfMemoryExceptions, so I've bumped up the heap memory in JMeter. But now it seems I can't run anymore tests as it says I'm using 94.9% of 14Gb.  When I use df -h it says dev/sda1 is full  I was wondering if anyone can help me? I think it has to do with the JVM from the jmeter


Steps to reproduce:   Go to the Stack Overflow home page Click "Mobile" at the bottom of the page. Wait for the page to refresh and scroll to the bottom. Hover over each of the links, noticing that hovering over "Full Site" leaves the default cursor: text.   I know that mobile devices with a touch screen would not show a cursor. However, this kind of thing drives me crazy. The all.css file used on the page already has .footer-links a{, so only the actual cursor: pointer must be added.

When (accidentally) clicking "mobile" in the footer, one gets the mobile site in a regular browser too. To switch back, one can click "full site" in that same footer:    However: when hovering it, the mouse is changed as to select text, rather than to indicate one can click (even though it's clickable).  All other links do change the mouse into a pointer.  (Not a big deal, except when somehow  getting into the mobile mode, I guess.)


Decide if the series converges absolutely, conditionally, or not at all. \begin{equation} \sum_{n=1}^{\infty}\frac{(-1)^n}{(2+(-1)^n)n} \end{equation}  I'm having a lot of trouble with this one. I know the even terms will be of the form $\frac{1}{3n}$ and the odd terms of the form $-\frac{1}{n}$ but I'm not really sure how I can use that to prove convergence. Any hints would be greatly appreciated.

While revising for exams, I came across a question where at the end of it, we had to determine whether the below series was convergent or divergent:  $$\sum_{n=1}^\infty \frac{(-1)^n}{n(2+(-1)^n)} $$  Unfortunately, other than knowing that as the series $ \sum_{n=1}^\infty \frac{(-1)^n}{n} $ converges, this series will most likely converge as the $(2 + (-1)^n)$ terms are bounded, I can't see a way of using this to determine if it converges or not.  Here's a list of some of the other ideas I've tried, which don't seem to get me anywhere:   Generalising the series - By this, I mean replacing the $-1$ for $z$ and then try and use the ratio test to see whether $-1$ is inside or outside or on the boundary of the circle of convergence - however, when I did so, I believe that the ratio test is inconclusive for all values of $|z|$, which while disappointing, is an interesting feature of the series.  - While this is usually a nice tool to use for when dealing with awkward sums, I can't see any good choice of sequences $ (a_n) $ and $(b_n)$ to choose to use. Summing consecutive terms - By this, I mean evaluating the series by looking at the sum of    $$\sum_{k=1}^\infty \frac{(-1)^{2k}}{2k(2+(-1)^{2k})} + \frac{(-1)^{2k-1}}{(2k-1)(2+(-1)^{2k-1})}$$  $$ \Rightarrow \sum_{k=1}^\infty \frac{1}{2k} - \frac{1}{3(2k-1)}$$  $\quad$ but then as we are left with parts of the harmonic series this doesn't seem like a nice way to  $\quad$evaluate it.  Other than that, I'm completely out of ideas, so any new ones (or ways to make my old ones work) would be much appreciated!


I need help for one math project.  It's about a system of non-inear equations. The system go like this:  $$ f(x)=\left\{ \begin{array}{ll} x^5+y^3*z^4+1 \\  x^2*y*z \\  z^4-1 \end{array}  \right. $$  The right side of the equation is 0.  a) Calculate all the zeros in the system (manually) b) Find the Jacobian matrix, J(x). (Notice that J(x) is singular for z = 0) c) Consider independent two starting solutions:  1) x(0) = {-0.01, -0.01, -0.01}T  2) x(0) = {-0.1, -0.1, -0.1}T  I have tried something but I don't know whether I am right...  $$ f(x)=\left\{ \begin{array}{ll} x^5+y^3*\pm1=-1 \\  x^2*y*\pm1=0 \\  z=\pm1 \end{array}  \right. $$  So because in the middle line there is 0 in the right side some of X and Y must be 0. When i get for Y=0 the result is this: $$x= -1 ,   y= 0,   z= \pm1$$  And for X=0 the result is this: $$x= 0 ,   y= -1,   z= \pm1$$  I dont know where to go after this...  Please help me. Thank you!

I have post once here about this question but i had some problems and i stopped with solving it. Now i started again and i think i`ve made it better. Here is where i need help.  This is the system of nonlinear equations.  f(x) = 0 where:  $$ \left\{  \begin{array}{c} x_1^5+x_2^3+x_3^4+1 \\  x_1^2*x_2* x_3 \\  x_3^4-1 \end{array} \right.  $$  The right side of the equation is 0.  A) Find manually all the zeroes of the system.  B) Calculate the Jacobian J(X). (Notice that J(x) is singular for x3 = 0)  C) Check this two starting solutions:  1) X0 = {-0.01, -0.01, -0.01}  2) X0 = {-0.1, -0.1, -0.1}  D) Calculate the determinants |J(X0)| and |J^-1(X0)| for the two starting solutions. Notice that Jacobians are almost singular, altough the starting solutions are not so far from the real solutions.  -------------------------------------------------------------------------------  This is the task that i need to solve. I started from here.  From this system we can see that $$ X_3 = \pm 1 $$ So going from this we can make 4 solutions.  $$I:x_3=1, x_2=0, x_1=-1$$  $$II:x_3=1, x_2=-1, x_1=0$$  $$III:x_3=-1, x_2=0, x_1=-1$$  $$IV:x_3=-1, x_2=-1, x_1=0$$  After this i started with the Jacobian. I have made this for the Jacobian matrix.  $$ \left[     \begin{array}{ccc}       5x_1^4 & 3x_2^2x_3^4 &4x_3^3x_2^3\\       2x_1 x_2 x_3 & 1*x_1^2 x_3 & 1*x_1^2 x_2\\       0 & 0 & 4x_3^3     \end{array} \right] $$  After the jacobian i calculate the determinants for all 4 solutions and I have:  I:  the determinant is: 20.  II:  the determinant is: 0.  III:  the determinant is: 20.  IV:  the determinant is: 0.  I stucked on this: When i need to see the two starting solutions C). And when i need to calculate their determinant. The first number that i calculate is 0.00000005 and i said okay its enough i am something wrong.


I am looking for a proof on why    $$\frac{1}{\sqrt 5}\left[\left(\frac{1+\sqrt 5}{2}\right)^n-\left(\frac{1-\sqrt 5}{2}\right)^n\right]$$   an integer.   I have seen many proofs on this, but they all refer to a properties of Fibonacci numbers, which shouldn't be necessary.  I am trying to see why it is true using purely elementary results such as the binomial formula. Clearly this reduces to  $$\frac{1}{2^n\sqrt 5}\sum_{k=0}^n {n\choose k }\left(1-(-1)^k\right) 5^{k/2}$$  I am looking for a "divisibility" argument to see why this is an integer.

For each $n$ consider the expression $$\frac{1}{\sqrt{5}}\left[\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^n\right]$$  I am trying to prove by induction that this is an integer for all $n$.  In the base case $n=1$, it ends up being $1$.   I am trying to prove the induction step:   if $\frac{1}{\sqrt{5}}\left[\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^n\right]$ is an integer, then so is $\frac{1}{\sqrt{5}}\left[\left(\frac{1+\sqrt{5}}{2}\right)^{n+1}-\left(\frac{1-\sqrt{5}}{2}\right)^{n+1}\right]$.   I have tried expanding it, but didn't get anywhere.


Here is my itinerary, followed by my question:  X (a European city) --> New York, JFK New York, JFK --> Y (a South American city)   Do I need to pass through the passport control at JFK if I purchase those two flights separately?

In Europe usually you don't need to go through immigration to change planes (unless you are entering/exiting Schengen). Is it the case in the US as well? May I catch a connecting flight on one of the US airports if I don't have US visa?


Did anyone see you   or     Did anyone saw you   ?  I saw this in a movie, which used "Did anyone see you". I wonder why "see" is present tense not past tense. Can someone tell me?

Where did you go last night?   Where went you last night?   Is there a reason we say the first of the previous two sentences as opposed to the last one?   I know the second sentence is ungrammatical. I was just wondering if there was more of a rule than just "asking questions in the simple past needs 'did' + verb in the present tense."


I am working on a desktop game in C#, with Monogame framework. I am storing the tile instances in a 2D Array, for the sake of easy collision detection. But the levels are big (often 100x100 or bigger) and there are lots of tiles out of the screen bounds all the time which I should not draw. At the moment I'm running through the arrays and checking whether they are in the screen bounds or outside, but that may not be too efficient due to the big count of the tiles.  Is there any better way to hide out of bounds tiles?

I have a big map with isometric tiles(3d camera), how can i draw only visible tiles ?  Whats the best way to do that ? space partitionning (octrees etc...)?


I'm wondering if anyone can guide me with following problem... Each fruit has different chance to be called out.  Apple - 80%  Orange - 10% Banana - 10%   Each time a user click on the random image, only 1 fruit will come out with above weight. I have no idea how I can calcuate to get that result. Pseudo code example is fine for me.

I have a loot box that I want to fill with a random item.  But I want each item to have a different chance of being picked.  For example:   5% chance of 10 gold 20% chance of sword 45% chance of shield 20% chance of armor 10% chance of potion   How can I make it so that I select exactly one of the items above, where those percentages are the respective chances of getting the loot?


What is the basic difference between absolute pressure and gauge pressure?

What are the key differences between Gauge pressure and absolute pressure?  Are there any other forms of pressure?


I have two files file1.txt, file2.txt. I want to select records which are common to both file1.txt and file2.txtbased on column 2 and column 3 and copy them to out.txt with additional column(column 4 from file2.txt).   Sample Input:  file1.txt  abc 1 a f11 f13 f14  abd 2 b f12 f14 f13   abe 4 d f13 f16 f12  acf 5 s f14 f15 f19   file2.txt  abc 1 a f21 f23 f24  abd 1 b f21 f24 f23   abe 4 d f24 f26 f22  acf 6 s f23 f25 f29   Desired output  out.txt   abc 1 a f11 f13 f14 f21  abe 4 d f13 f16 f12 f24   I have asked a similar  earlier on how to work with three files and extract similar output based on similar input for better understanding. I'm new to Unix world and been learning on how to do file processing. Based on that I have tried the below piece of code using awk but didn't work. Could someone please check and suggest, what went wrong ?  awk 'FILENAME == ARGV[1] {     m[$2,$3] = 0; z[$2,$3] = $6;     next; } {     if (($2,$3) in m && m[$2,$3] == 1) {         print $0 " " z[$2,$3] >"out.txt";     } }' file2.txt file1.txt

I have three files file1.txt, file2.txt, file3.txt and they are of same format.  I want to select records from file1.txt which are present in both file2.txt and file3.txt based on column 2 and column 3 respectively to the output file out.txt.   Also, I need to create another file, out2.txt, with additional columns (column 4 from file2.txt, column 5 from file3.txt).  Sample Input:  file1.txt  1. abc 1 a f11 f13 f14  2. abd 2 b f12 f14 f13   3. abe 4 d f13 f16 f12  4. acf 6 s f14 f15 f19   file2.txt   1. abc 1 a f21 f23 f24   2. abd 1 b f21 f24 f23    3. abe 4 d f24 f26 f22   4. acf 6 s f23 f25 f29   file3.txt   1. abc 1 a f31 f33 f34   2. abd 2 b f31 f34 f33    3. acf 5 s f33 f35 f39   4. abe 4 d f34 f36 f32   Desired output  out.txt   1. abc 1 a f11 f13 f14   2. abe 4 d f13 f16 f12    out2.txt   1. abc 1 a f11 f13 f14 f21 f31  2. abe 4 d f13 f16 f12 f24 f34


I'm running Ubuntu 13.10 on a Dell Inspiron 530s. It has a Linksys network adapter card, but I do not have the adapter, so my computer is connection-less.  What I'd like to know is if there is a way to share the internet that my wireless laptop is receiving through an ethernet cord to give internet to my desktop computer. The laptop is a Compaq Presario CQ56, running Windows 8.  Any answer is well appreciated.

Im trying to share the wireless from my netbook eeepc to my desktop computer that does not have any wifi, it can run internet through a cable connected to my internet router but im wondering if there is any way to share my netbooks wireless through the ethernet cable. the desktop is running on 12.04 and the eeepc is running on 12.10


I'm new to Java, and I've recently learned about hashCode(). On , there is the following example of a hashCode() method:   public class Employee {     int        employeeId;     String     name;     Department dept;      // other methods would be in here      @Override     public int hashCode() {         int hash = 1;         hash = hash * 17 + employeeId;         hash = hash * 31 + name.hashCode();         hash = hash * 13 + (dept == null ? 0 : dept.hashCode());         return hash;     } }   I understand that multiplying by 31 and 13 decreases the chance of collision, but I don't see why hash is initialized to 1 rather than to employeeId. In the end this simply has the effect of adding 17*31*13 to the hashCode(), which is not going to change whether two hashCode() values are equal or not.  Bloch's "Effective Java (Second Edition)" has a very similar example in Item 9 (pages 47 and 48), but his explanation of this additive constant is quite mysterious to me.  Edit: This question was marked as a duplicate of the question  That question is not the same: it is asking whether there is any reason to prefer the number 31 to any other number in the formula for the hashCode() of a String. My question is why it is the case that in many examples of hashCode() which I have found online there is a single constant added to the hashCode() of all objects.   In fact, the example of hashCode() of a String is relevant here, because in that example there is no constant added. If adding 17*31*13 has any effect in the example I gave above, why not add such a constant when computing hashCode() of a String?

Per the Java documentation, the  for a String object is computed as:   s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]       using int arithmetic, where s[i] is the    ith character of the string, n is the length of    the string, and ^ indicates exponentiation.   Why is 31 used as a multiplier?  I understand that the multiplier should be a relatively large prime number. So why not 29, or 37, or even 97?


I have created a AR(2,1,0) model with the first two parameters equal to -1.08 and -0.33. I understand that a autoregressive parameter equal to 1 implies non-stationarity and a random walk process so I'm assuming the effect is the same if the parameter is a -1. So what does it mean when the parameter is greater than one?  This model performs pretty well so I'm not sure if something is incorrect.

According to Theorem 8.8 in Time Series A.W. van der Vaart an ARMA process $$\phi (L)X_t=\theta(L)\epsilon_t$$ has a  unique stationary solution $X_t=\psi(L)\epsilon_t$ with $\psi=\theta/\phi$ if $\phi$ has no roots on the complex unit circle. This would imply that the explosive process, with $\rho>1$, is a stationary process $$X_t=\rho X_{t-1}+\epsilon_t$$ with stationary solution $X_t=\sum_{i=1}^\infty \rho^{-i}\epsilon_{t+i}$.  Now indeed $\sum_{i=1}^{\infty} \rho^{-i} < \infty$ so that weak stationarity can be proved by using this representation.   However, here on stackexchange I see a lot of question/answers that suggest that the process above is not stationary (see for example , ). In particular, the accepted answer of the latter question claims that the process is non-stationary by simulating a series and showing it displays explosive trending behaviour.  I think the only way to reconcile the theorem I mention above and the plots in the accepted answer of () is the following: the explosive process is indeed stationary but non-ergodic, that is, we cannot find the statistical properties of $X_t$ such as $\mathbb{E}(X_t)=\mu$ by observing a single infinitely long sample path of the explosive process, mathematically: $$\lim_{t \to \infty}\frac{1}{t}\sum_{t=1}X_t \neq\mathbb{E}X_t$$  Is this reading correct?


I was wondering how to make such system?

How can I get a brace on the right, not the left, to group cases, using cases? (I know actual cases look better with the brace on the left, but the items I need to group are not literally cases. They are a set of steps in an algorithm which I want to consider as an item.)  The following puts the brace on the left. All I need to do is to flip it to the right.  \begin{align} \begin{cases} a&=bbb\\ c&=ddddddd\\ e&=ffffffffff \end{cases} \end{align}   Thanks for any help with this!


If I set the text of a TextView in XML, like this:      <TextView         ...         android:text="0" />   Can I compare that string in Java? Doing this:      private void InitializeMethod() {         A_1  = tv_1.getText().toString();     }      private void CheckAnsMethod() {         if (A_1 == "0"){             correctAns.start();             }         }else{             wrongAns.start();         }     }   causes the sound 'wrongAns.mp3' to be played...

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


I created a server where users can return a table as JSON representation.  What I wanted to do have the user create a python module that inherits from a Reader Base.  This isn't the issue.  The issue is how do I make it do my server can dynamically load each library to read each file type?  I hope I explained this well.  If not please ask questions.  Thank you, J  I do not believe this is a duplicate because the python modules may or may not exists and will be added to the system on run time.

I'm writing a Python application that takes as a command as an argument, for example:  $ python myapp.py command1   I want the application to be extensible, that is, to be able to add new modules that implement new commands without having to change the main application source. The tree looks something like:  myapp/     __init__.py     commands/         __init__.py         command1.py         command2.py     foo.py     bar.py   So I want the application to find the available command modules at runtime and execute the appropriate one.  Python defines an __import__ function, which takes a string for a module name:     __import__(name, globals=None, locals=None, fromlist=(), level=0)      The function imports the module name, potentially using the given globals and locals to determine how to interpret the name in a package context. The fromlist gives the names of objects or submodules that should be imported from the module given by name.       Source:    So currently I have something like:  command = sys.argv[1] try:     command_module = __import__("myapp.commands.%s" % command, fromlist=["myapp.commands"]) except ImportError:     # Display error message  command_module.run()   This works just fine, I'm just wondering if there is possibly a more idiomatic way to accomplish what we are doing with this code.  Note that I specifically don't want to get in to using eggs or extension points. This is not an open-source project and I don't expect there to be "plugins". The point is to simplify the main application code and remove the need to modify it each time a new command module is added.


I have the following question in hand.   If $\lambda_1,\cdots,\lambda_n$ are the eigenvalues of a given matrix $A \in M_n$, then prove that the matrix equation $AB - BA = \lambda B$ has a nontrivial solution $B \neq 0 \in M_n$, if and only if $\lambda = \lambda_i - \lambda_j$ for some $i,j$.

Let $E \in M_n(C)$ be an $n \times n$ matrix with entries in a(n algebraically closed, characteristic 0) field $C$, with eigenvalues $\lambda_1, \ldots, \lambda_n$. Show that the commutator map $M_n(C) \to M_n(C)$ given by $B \mapsto [E,B] = EB - BE$ has eigenvalues $\lambda_i - \lambda_j$.  This is an ingredient a proof of the fact that any regular singular equation $y' = Ay$ over $C((z))$  is equivalent to $v' = Dz^{-1}v$ with $D$ a constant matrix. See exercise (7) (a) (i) of  by Marius van der Put (page 6 of the PDF).  This is homework, so hints rather than full answers would be appreciated.  Things I have found that may or may not be useful:   $EB - BE = (\lambda_i - \lambda_j)B$ can be written $(E-\lambda_i)B = B(E- \lambda_j)$. $EB$ and $BE$ .


Fixed effects model seems to differ from random effects model for a meta-analysis of sample correlations in terms of assumptions. What is key assumption for a fixed effect model?

In meta-analysis packages, both fixed effects and random effects models are available. How do one choose between these two models? Since one is assessing different studies, should one not choose random effects model all the time?


I'm making a character model that will be rigged and used for a 3D animation I'm making for class. In tutorials I see, they keep their models hollow. Is it better to keep your model hollow? Will my model still be ok if it's filled inside while rigging or will there be problems I'll encounter?

I have this weird object (vascular tree) which is empty inside, but closed from the top and the bottom:  However, it is empty inside, which makes me unable to use boolean on a bigger object (I want to make a hole in an object through which this object will go through). So I thought I should fill it and then try to boolean. But, how do I fill it?  Thank you sincerely.


Only the 'object mode' is visible from the menu. Cannot edit anything.

I just enabled the Blenderkit addon but cannot seem to figure out how to edit the objects. I looked in this reddit thread and amazingly none of the solutions worked for me.  Making it a single user object, data, and materials did not work. I do not see any option to append when adding a model form the Blenderkit asset bar (I even tried saving it and appending the object in another instance of Blender and it still would not let me edit it). And when I right click I do not see an option to make local on outliner collection. I am using Blender 2.83 if that makes a difference but can use 2.9 if need be. Any other solutions?


I am trying to create a new user and restrict his access to only a single folder in /usr/local/. So I did some google and followed the following steps.  groupadd controlgroup1 cd /usr/local mkdir controlfolder1 chmod g+rw controlfolder1/ chgrp -R controlgroup1 controlfolder1/ useradd control1 passwd control1 gpasswd -a control1 controlgroup1   I went into /etc/sshd_config and toward the end of the file I added this   Match Group controlgroup1 # Force the connection to use SFTP and chroot to the required directory. ForceCommand internal-sftp ChrootDirectory /usr/local/controlfolder1/ # Disable tunneling, authentication agent, TCP and X11 forwarding. PermitTunnel no AllowAgentForwarding no AllowTcpForwarding no X11Forwarding no   I restarted ssh: systemctl restart sshd.  So when I tried to login the control1 user I saw this in the log file ?  Code: Accepted password for control1 from 192.168.1.8 port 52912 ssh2 May  5 14:12:47 localhost sshd[2639]: pam_unix(sshd:session): session opened for user control1 by (uid=0) May  5 14:12:47 localhost sshd[2639]: fatal: bad ownership or modes for chroot directory component "/usr/local/controlfolder1/" [postauth] May  5 14:12:47 localhost sshd[2639]: pam_unix(sshd:session): session closed for user control1   I have ensure control1 one is the owner of it .  ls -ld controlfolder1/ drwxrwxr-x. 2 control1 controlgroup1 6 May 5 13:58 controlfolder1/   I have followed the step but I have a new issue on the  "chown -R control1:controlgroup1 /usr/local/controlfolder1/control1" . So this is different. I also want to give ssh access not just sftp ? I hope this will clear the duplication error.

I've been trying to configure sftp in a debian server.sshd_config:  Subsystem sftp internal-sftp  UsePAM no  Match User sftpUser ChrootDirectory /users/sftp/sftpUser ForceCommand internal-sftp AllowTcpForwarding no X11Forwarding no   Directories:   drwxr-xr-x   3 root      root      4096 Oct 20 10:59 users   drwxr-xr-x   3 root      root      4096 Oct 20 11:00 sftp   drwxr-xr-x   2 root      root      4096 Oct 20 11:00 sftpUser   cat /var/log/auth.log  Oct 20 10:58:22 w1 sshd[24634]: Accepted password for sftpUser from 201.156.103.213 port 34106 ssh2 Oct 20 10:58:22 w1 sshd[24636]: fatal: bad ownership or modes for chroot directory component "/"   sftpUser no home, bin/falseand member of user group.  In the client side I'm getting the famous Write failed: Broken pipe and then the connection is dropped.  Commenting the ChrootDirectorycommand in sshd_config makes the connection, but get's the user loose.  What am I doing wrong ?


I have an HTC Inspire and I'm trying to use the new Google+ auto backup. All the photos say "Backup Failed". However, it is uploading the videos.  I have checked every setting that I know of and it looks like it is setup right.  Any ideas?

When looking at my photos in the Google+ app, at the bottom is a footer that says "Backup failed" with a retry button. The backup still fails when I click Retry.  Is there a way to find out why Auto Backup is failing so I can correct the problem?


Is using filter_input() or any similar validation/sanitation function overkill when using PDO prepared statements:  $sql =  "SELECT count(*) FROM players_test WHERE email = :value"; $stmt = $pdo->prepare($sql); $value = filter_input(INPUT_POST, 'signupEmail', FILTER_SANITIZE_STRING);  $stmt->bindParam(':value', $value, PDO::PARAM_STR); $stmt->execute();   What would be a reasonable approach to handle stings and integers?

Let's say I have code like this:  $dbh = new PDO("blahblah");  $stmt = $dbh->prepare('SELECT * FROM users where username = :username'); $stmt->execute( array(':username' => $_REQUEST['username']) );   The PDO documentation says:     The parameters to prepared statements don't need to be quoted; the driver handles it for you.   Is that truly all I need to do to avoid SQL injections?  Is it really that easy?  You can assume MySQL if it makes a difference.  Also, I'm really only curious about the use of prepared statements against SQL injection.  In this context, I don't care about XSS or other possible vulnerabilities.


I'm not sure about the humidity in the apartment, but I don't think this was a problem. However, the board took quite some water one day and slightly bent on the front and back (so it has a slight U shape when seen from the side). It seems to have receded a little bit but it is still noticeable.

I should have paid more attention but after regular washing of top surface, my half-inch-thick board is rocking like a cradle.  It is not practical to use flipped over as it has a counter lip.  I tried keeping the backside moist over 24hrs with no noticeable affect.  Wet grass and sunshine was suggested  but it doesn't sound very practical for me. What indoor solutions can I try?


Someone has asked a question before regarding the ring $\mathbb{Z}[X]/(2x+4,x^2-3)$, but the answer wasn't quite what I was looking for.  I was wondering how one would show this quotient isomorphic to $\mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2 \mathbb{Z}$.  I was thinking of using the isomorphism $$\mathbb{Z}[X]/(2x+4,x^2-3) \cong \frac{\mathbb{Z}[X]/(2x+4)}{(2x+4,x^2-3)/(2x+4)}$$ I've seen problems like this before, but I don't think I even understand the structure of $\mathbb{Z}[X]/(2x+4)$.

I need to describe a ring $R=\mathbb{Z}[X]/(X^2-3,2X+4)$    I know that its element would be of the form $\{f(x)+(X^2-3,2X+4)|f(x)\in \mathbb{Z}[X]\}$ After that will i divide $f(x)$ by $X^2-3$ first and then by $2X+4$ to reduce the elements  in $R$?


Can 2 players mount a horse? If so, Can the player not controlling the mount cast spells o shoot an arrow? If the horse doesn't have a saddle there is any difficult to do this?

Are there any rules or clarifications that say anything about limitations or mechanical implications of having multiple characters on a single mount?


I want my old phone to run wxtoimg, which is available for linux, even for ARM.   The problem is that the phone has Android 2.3.6 installed and the default installation guide fails in several steps.... (The backup step, the bootmanager unlocking step freezes the device, the flashing step returns no image for the device)  My Android device is a rooted lg e400 with 8gb sdcard.  How can I install an ARM version of ubuntu or ubuntu touch on it?   The installation guide I tried

I would like to port Ubuntu Touch to a device that is currently not supported. What are the requirements for doing this and where do I begin?


I have the array of the arrays of char. I need to convert it into an array of int. How can I do that? I know we can convert char* to int as follows:  char *i = "123"; std::stringstream ss; ss << i; int ii; ss >> ii; std::cout << ii << std::endl; //prints 123   But how can I convert the array of such an arrays into an array of integers?

What's the C++ way of parsing a string (given as char *) into an int? Robust and clear error handling is a plus (instead of ).


And when they are paralleled, orbital angular momentum is 0.

Why is orbital angular momentum not 0 when spin and linear momentum are not collinear?   Why can it be 0 when spin and linear momentum are parallel?  Like in the example of a scalar field at rest decaying into an electron and a positron via interaction $\frac{1}{2}g\phi \bar{\Psi}\Psi $   If spin is along x axis and three-momenta is along z axis, decay rate will be 0 if two spins are opposite because orbital momentum is not 0 after decaying.


I want remove date in this template:    I remove this line   \date{\today}   but this not work    i modify to \date{}    I want reduce the spacing

I'm using the \author and \title commands to produce a title with \maketitle. I also know that there is a \date command to specify the date of my work. However, if I omit \date, \maketitle will produce the current date. How do I achieve that no date is displayed at all?  \documentclass{article}  \author{Author, A.} \title{Alpha}  \begin{document}  \maketitle  Some text.  \end{document}


I went to step 4 from  guide and extracted LAStools to my C drive and just made the folder there.   I can't do step 8 because it seems to already be in "advanced interface". Then, step 9 mine only says "Options".   Step 10 is where I get the error message and it won't go past that step. I keep getting this error message. Can anyone help me get this installed?

I have a problem with LAStools in QGIS 2.14. I've followed the LAStools instructions for downloading LAStools for QGIS. `  I replaced 'lidar' folder in C:\OSGeo4W64\apps\qgis\python\plugins\processing\algs\lidar with the folder downloaded from .  I downloaded the 'LAStools' folder and put it in the following location: 'C:\LAStools'. I activate LAStools in to Processing, and type 'C:\LAStools' for the 'LAStools folder location', but I get the following message:      "Wrong value for parameter "OTB applications folder":   Specified path does not exist:   C:/OSGEO4~1/apps\orfeotoolbox\applications"   LAStools appears in the processing toolbox. I can start to run a lasview. The data appears in 'just a little LAS and LAZ viewer', but the program hangs and then crashes.  Is this happening because of the error message? I have looked through the StackExchange for other examples of this specific problem, with no success. Any suggestions on what am I doing wrong?


When considering some cdf $F_X(x)$ — e.g. from  — I’m having a hard time trying to understand what $F_X(X)$ really means. Expanding gives $P(X \leq X)$, which at first glance should always equal $1$; the only other possibility I can think of is $1/2$, assuming that the two $X$’s are actually different (bad notation?). But then we’d have $W = F_X(X) = 1$ (or $=1/2$) from the question linked above, which makes no sense. So how can we understand the quantity $F_X(X)$?

I'm attempting to understand the proof of the probability integral transform in [1].  First they define $Y = F_X ( X )$. Yet, the cumulative distribution function is defined in [2] as $$F_X ( x ) = P(X\leq x).$$  Q1. Can you define $F_X ( X )$ (preferred answer would provide a measure-theoretic definition [4], but any definitions are welcome)?   Continuing to read from [1], there is a step such that  $$P(F_X ( X ) \leq y)  = P(  X   \leq F^{-1}_X ( y )).$$  Q.2. Can you explain how come this equality holds?  I imagine its related to the properties shown in [3]. Namely that $$F^{-1}(F(x)) \leq x$$ and $$F(F^{-1}(p)) \geq p.$$ Even so, such seems to me to be insufficient to understand why the equality holds.  [1]   [2]   [3]   [4]


I want to extend the height of an element to the bottom of the height of its parent element. I couldn't find any way or solution to do it. Here is my code.  So, there is some content above the child element, and I want the child element to OCCUPY all the space that is below that. Basically: the rest of the parent element (to the bottom of its height).  I also tried making an awful visual display of the height of the child element should be extended -  (the area colored in red should be its new height).  Currently, it only has its own height with padding that I added in CSS and its element.   .parent {   background: #232323;   height: 500px; }  h1 {   color: white }  .child {   padding: 50px;   border: 3px solid red; }

*Some other content*

*The content of the child element*

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.


I have a textbox where if you enter and click the button, it will generate a checkbox with a "delete text".  I wonder why my click function does not work, it does not do any thing at all. smtg like this:  $( "#addMemberEmail" ).click(function() {     if(jQuery.trim($('#mListMemberEmail').val()).length > 0) {         var checkboxId = "checkbox_" + $('#mListMemberEmail').val();          var checkbox = '
<input type="checkbox" id="' +                           checkboxId + '" value="' + $('#mListMemberEmail').val() +                           '" checked/>	' + $('#mListMemberEmail').val() +                           '
delete

';         $('#group').append(checkbox);          //reset textbox         $('#mListMemberEmail').val('');     } else {         alert("Please enter an email address");     } });  //why this is does not work? $( ".btndel" ).click(function() {       alert("Aaa"); });   I create the jsfiddle here:    It would be great if you could also show me for the delete function. It's supposed to be if you click the delete button, it remove the checkbox depend on which delete button is clicked.

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.


Is there an idiom that is similar in meaning to the last straw that broke the camel's back, except with positive connotations? For eg., how do I idiomatically express that "the My Little Pwny mount was the final factor that helped me decide to install HotS"?

I understand that "Deal breaker" is an expression used for a feature/characteristic that would make one not go for a deal (or terminate a contract), even if the deal's other features are great.  What expression would be the opposite of "Deal Breaker"? I'm looking for an existing expression that would describe a feature that would make one go for the deal, even if there are other not so great characteristics.  The expression could fill the sentence below:     I know this phone carrier has higher rates and everything, but if   they are offering free iPhone to us if we switch, that would be a <expression   here>! We would totally go for it.


On an server running multiple ASP.NET sites, is it better to use one application pool per site or for sites to share a single application pool?  What are the advantages or disadvantages inherent to each setup?  Or is there a hard and fast rule here?

What are pros and cons of having dedicated application pools over keeping web applications in one default app pool?


If I plug my iPhone into a Windows computer the photos I believe DCIM folders display as basically a drive. All you do is drag and drop the files you want. This works great!    How can I do this on macOS, preferably without any additional software? Unfortunately on my Mac it forces you to use the Photos application which I do not like. I'm transferring such a large number of files, I don't want airdrop.  AirDrop is to slow and sometimes doesn't work when using differing iOS and MacOS versions.  Right now I hilariously drag the files onto a thumb drive in Windows and then move the thumb drive to my Mac.

Previously, on Windows, iPhone was recognized as a camera and I could browse image folder with Explorer without a need to import/download/tranfer photo files to the computer.  Is there a way to do the same on Mac OSX? I mean, all approaches I have ever read are somehow connected to import procedure (iPhoto, Preview, iTunes, etc.) or to hacking the iPhone and installing some apps that will allow to mount the phone as storage drive work.   What is the easiest and most straightforward way to view that files without transferring them to a computer?


I wrote this code  List<Object> result = null;  .... Object resultObject =method.invoke(o, "test", "test"); System.out.println(resultObject); result.add(resultObject);   resultObject contain the result that I expect but the last line caus a NullpointerException.

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?


Background  Advanced Host Controller Interface (AHCI) is a technical standard defined by Intel that specifies the operation of Serial ATA (SATA) disk controllers. When it is supported by your operating system and PC hardware, you will get the benefits of features such as native command queuing and hot swapping. For an older OS like Windows XP which does not support AHCI mode out of the box, without OEM-supplied drivers, it is possible to turn on the legacy (IDE) mode in the BIOS to get it to install properly. If your installed your Windows 7 or Windows 8 accidentally in the legacy IDE mode, and want to switch to the AHCI mode, Windows will not boot after you switch from IDE to AHCI in the BIOS.  Goal  This question aims on solving this problem with Windows Vista 32-bit installed on a SATA drive in BIOS IDE mode, as to how exactly to proceed when one wants to switch to AHCI without OS re-installation.

Can I enable AHCI after installing Windows 7 in a SATA drive that was on IDE mode?


Let $A, B \in M_n(\mathbb{C})$ be Hermitian. Show that $\text{tr} (AB)^2 \leq \text{tr} (A^2B^2$).  What we can say is that $AB - BA$ is skew-hermitian since $BA = (AB)^*$. Since it is Skew-hermitian, its eigenvalues are all imaginary. And its square is similar to a diagonal matrix whose diagonal entries are all negative. And so $\text{tr}(AB-BA)^2 \leq 0$.  How do you proceed from here?

Suppose $A,B \in {M_n}$ be Hermitian.Is this true that $tr[(AB)^2]\le tr(A^2B^2)$?


I have seen this type of circuit design a few times, but am not sure why it is needed. Considering the schematic below, what is the purpose of resistor R3?

Here in the Figure R5=50K. This resistor value is not in the equations to obtain output voltage, and in many tutorials non-inverting input is directly grounded without a resistor. What might be the reason to use it here?


It's clear to me that there was no clean solution in Python 2 to unload a module, and this was a known bug, that was set to be corrected.   The posts:     of the year 2009 and 2010 confirm this lack of support for unloading a module.  I wonder if this was solved in Python 3.x. When I do, import os, del os, dir(), the os module is not there (at least not visible, usable). Is it gone?

I have a long-running Python server and would like to be able to upgrade a service without restarting the server. What's the best way do do this?  if foo.py has changed:     unimport foo  <-- How do I do this?     import foo     myfoo = foo.Foo()


I went through few questions (see the list below) but haven’t found the answer to my question...          The question is what software can I use to analyze to find out if I can get any data from my Seagate ST300003U2 External USB hard disk drive.  It was lying in a drawer for few months unused and few weeks later I wanted to access my backed up pictures there and Windows now will not recognize it properly after plugging it in and Ubuntu will not detect it at all.  I went to the professionals and they quickly tried by connecting to a Win machine and told me that if I left the drive with them there they “might” recover something. I asked how they would do it and the I was told that they got some tool to run it against. I want to try them by myself if there is any free version. Of course they did not tell me name of the tools.  Any idea what free/opensource software on Windows or Linux or self bootable solution I can use to analyze such a hard disk drive?   UPDATE  I get this message on Win7. So there is no issue with cables or so in my eyes. I wonder why Ubuntu gives me no message.    I got this from Device Manager: Windows has stopped this device because it has reported problems. (Code 43)

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


According to :     Yes, ... deleted answers count towards an automatic ban.   Now, this is not very specific, and I suspect that is intentional. However there are certain cases where I don't think it would be fair for deletion to count against the answerer, and would love to see some clarification / guidance (without revealing any specific details about the algorithm):   answers that are deleted because the question was deleted. . This typically will be through no fault of the answerer or any issues with the quality of their answer (though one could argue that a question that gets deleted should not have been answered - but then you get into whether the question was self-deleted, was it down-voted first, or did the community/moderators delete it). answers that are self-deleted. For example, if I answer a post and then realize someone beat me to the punch with an identical answer, or perhaps later someone posts a better answer. This is peripheral to  and again is not necessarily a quality issue with the answer or the author. In fact, we probably want to encourage, rather than punish, behavior that cleans up redundant or lower-quality answers.   In either case, I would hope that just the mere fact that an answer was deleted does not count against a user. In these scenarios it would be unfair, IMHO, unless the answer was down-voted or maybe flagged prior to deletion (meaning there was a problem with the answer, according to a user other than the author).

According to  on MSO there is an algorithm in place that is used to trigger whether a Question or Answer ban is automatically applied to a user.  However, if an answer is left to a question and that question is subsequently closed and deleted, this means all the answers are also deleted. Do these collateral damage deleted answers count towards the Answer Ban criteria?   These answers could well be good and well researched answers (albeit against poor questions) left in good-faith.  Yes, one could argue that people shouldn't be posting answers to bad questions in the first place, and that it's then their own fault if they end up being banned from answering because of it, but SE is full of people who just want to help out even when questions are poor, so should these people be punished in the same ways as people who just leave "lol, great post! Check out my free-coupon website" answers?


Let $G$ be a group with subgroups $H$ and $K$ with index $r=[G:H]$ and $s=[G:K]$. Show that: $[G:H\cap K]\leq rs$  I know it works with Lagrange, but I don't know exactly how.

Reference:   Let $G$ be a group. Let $H,K$ be subgroups of $G$. How do I prove that $[G:H\cap K]\leq [G:H][G:K]$?  Let's not assume any index is finite. Then, still the result holds? If so how do I prove it?