What is wrong with the following “proof” by Mathematical Induction? We will prove statements that all computers are built by the same manufacturer. In particular, we prove statements B(n) with n ∈ N, that “in any collection of n computers, all of the computers are built by the same manufacturer”. First check that B(1) is true, since with only one computer there is only one manufacturer. Now assume B(k); that is, in any collection of k computers, all are built by the same manufacturer. To prove B(k + 1) consider any collection of k + 1 computers. Pull out one of these computers, ‘HAL’ say, leaving just k computers, all of which must have the same manufacturer. Swap the ‘HAL’ computer with one of the others, so again there are k computers, so all must have the same manufacturer. Thus ‘HAL’ must have the same manufacturer as the others, hence all k + 1 computers have the same manufacturer; that is B(k + 1) must be true.

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


I'm trying to form a propositional logic proof chain for the tautology $\delta \implies \delta$, using only the axioms    $\alpha \implies (\beta \implies \alpha)$ $((\alpha\implies (\beta \implies\gamma))\implies((\alpha\implies\beta)\implies( \alpha\implies\gamma)))$ $((\neg\beta\implies\neg\alpha)\implies(\alpha\implies\beta))$   The only rule of inference is modus ponens.  Seems like it should be easy, but I can't seem to get it.  Help appreciated.

The system L0 is defined as follows:  Axioms: A1 (α → (β → α))  A2 2. (α → (β → γ) → ((α → β) → (α → γ))  A3 ((¬β → ¬α) → ((¬β → α) → β))  In one of my problem sheets, I am told that I am allowed to use the following theorem: if   ⊢ (α → α)    ⊢ (α → α) → (α → α)  My attempt to solve/prove the second one  ⊢ (α → α) → (α → α) choose 2 axioms which match.  α →α   β→α  γ→α  (α → (α → α) → ((α → α) → (α → α))  I'm struggling to see an obvious way of proving the theorem.  Is it provable? And if so, can you point me in the right direction?  Thanks a lot!


this figure delivers the flowchart of fragility curve development through IDA

I want to import graphics into my main input file using the macro \includegraphics. It does not work if the filename contains spaces.   also discusses this subject, but there is no solution there.  My compilation routine is latex->dvips->ps2pdf (because of PSTricks).


Actually i wanted to install adobe reader on my linux machine, so i first typed the code sudo apt-get update and pressed enter then got a new problem. please fix this error  sudo apt-get update E: Malformed entry 52 in list file /etc/apt/sources.list (Component) E: The list of sources could not be read.   Source.list      # deb cdrom:[Ubuntu 18.04.3 LTS _Bionic Beaver_ - Release amd64 (20190805)]/ bionic main restricted  # See http://help.ubuntu.com/community/UpgradeNotes for how to upgrade to # newer versions of the distribution. deb http://in.archive.ubuntu.com/ubuntu/ bionic main restricted # deb-src http://in.archive.ubuntu.com/ubuntu/ bionic main restricted  ## Major bug fix updates produced after the final release of the ## distribution. deb http://in.archive.ubuntu.com/ubuntu/ bionic-updates main restricted # deb-src http://in.archive.ubuntu.com/ubuntu/ bionic-updates main restricted  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu ## team. Also, please note that software in universe WILL NOT receive any ## review or updates from the Ubuntu security team. deb http://in.archive.ubuntu.com/ubuntu/ bionic universe # deb-src http://in.archive.ubuntu.com/ubuntu/ bionic universe deb http://in.archive.ubuntu.com/ubuntu/ bionic-updates universe # deb-src http://in.archive.ubuntu.com/ubuntu/ bionic-updates universe  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu  ## team, and may not be under a free licence. Please satisfy yourself as to  ## your rights to use the software. Also, please note that software in  ## multiverse WILL NOT receive any review or updates from the Ubuntu ## security team. deb http://in.archive.ubuntu.com/ubuntu/ bionic multiverse # deb-src http://in.archive.ubuntu.com/ubuntu/ bionic multiverse deb http://in.archive.ubuntu.com/ubuntu/ bionic-updates multiverse # deb-src http://in.archive.ubuntu.com/ubuntu/ bionic-updates multiverse  ## N.B. software from this repository may not have been tested as ## extensively as that contained in the main release, although it includes ## newer versions of some applications which may provide useful features. ## Also, please note that software in backports WILL NOT receive any review ## or updates from the Ubuntu security team. deb http://in.archive.ubuntu.com/ubuntu/ bionic-backports main restricted universe multiverse # deb-src http://in.archive.ubuntu.com/ubuntu/ bionic-backports main restricted universe multiverse  ## Uncomment the following two lines to add software from Canonical's ## 'partner' repository. ## This software is not part of Ubuntu, but is offered by Canonical and the ## respective vendors as a service to Ubuntu users. deb http://archive.canonical.com/ubuntu bionic partner # deb-src http://archive.canonical.com/ubuntu bionic partner  deb http://security.ubuntu.com/ubuntu bionic-security main restricted # deb-src http://security.ubuntu.com/ubuntu bionic-security main restricted deb http://security.ubuntu.com/ubuntu bionic-security universe # deb-src http://security.ubuntu.com/ubuntu bionic-security universe deb http://security.ubuntu.com/ubuntu bionic-security multiverse # deb-src http://security.ubuntu.com/ubuntu bionic-security multiverse deb http://archive.canonical.com/precise partner # deb-src http://archive.canonical.com/precise partner deb http://archive.canonical.com/ precise partner # deb-src http://archive.canonical.com/ precise partner

I have unistalled and reinstalled the Ubuntu Software Center as per info I found in a similar thread and I got the same response about line 91 or something like that.  I just tried to upload a screen shot but since I'm new it won't allow me to.  I also can not figure out how to cut and paste anything so I have to hand type what the error screen says, both when I attempt to open the software center and nothing happens, when I try to enter commands into the terminal to uninstall, reinstall, whatever I get the same following:  COULD NOT INTITIALIZE THE PACKAGE INFORMATION An unresolvable problem occured while initializing the package information Please report t:his bug against the 'update-manager' package and include the following error message: 'E: Malformed line 91 in source list/etc/apt/sources.list (dist parse)  E: The list of sources could not be read.,  E: The package list of status file could not be parsed or opened.   How do I report bugs?  What can be done about this.  I have searched and everything everyone says to do leads me back to the same line error message.  So, I don't know how to get to line 91 in the source list; to tell you what it says. Sorry, I'm really new to this. That is what I need is to find out how to get there and fix what it says. I would really like to NOT have to re partition my hard drive and start from scratch, so I'm really looking forward to getting this problem solved. I need to be able to install new software.


How to extract text from a specific area of a webpage (in Arabic not English) given the url using C/C++?  For example: given the url of  I want to extract the body of the article (highlighted in the image below) and throw away the other parts of the webpage like the heading, the menus on the right and on the left, etc. I only need the body to be parsed into a string.

I want to write a program in C/C++ that will dynamically read a web page and extract information from it. As an example imagine if you wanted to write an application to follow and log an ebay auction. Is there an easy way to grab the web page? A library which provides this functionality? And is there an easy way to parse the page to get the specific data?


[u'10.57518117688789', u'43.17174576695126', u'0 10.57512669810526', u'43.17172389657181', u'0 10.57509460784044', u'43.17169116727101', u'0']   I need to turn this into a list of latitudes and longitudes that are in order from 1st to last. The first element being latitude and the second being longitude. I don't need the u or the '0'.   Right now, I'm just printing them, but this method needs to return a list of coordinates in order.   def get_coord_list_from_earth(filename):      filename = str(filename)      data = xml.dom.minidom.parse(filename)      coordinates = data.getElementsByTagName('coordinates')[0].firstChild.nodeValue     coordinates = coordinates.strip()      print coordinates.split(',')   I need it to output a list of lists like this.  [10.57518117688789, 43.17174576695126], [10.57512669810526, 43.17172389657181], [10.57509460784044, 43.17169116727101]   This link is to a sample file this would need to run with

I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


I just started learning ML myself in python. I didn't understand a passage in the code and would be happy if you made it clear to me what he was saying. Plus I don't know what [:, -1] and [:,: - 1] do  inputs = training_data[:,:-1] outputs = training_data[:, -1]

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


I've installed Xubuntu 14 on my laptop. But now the laptop cannot detect the windows installation disc. When I put in the disc and restart, nothing changed; it still went directly into Xubuntu without any option. I'm sure nothing is wrong with BIOS since I have checked it many times. When I insert Ubuntu installation disc and restart, it shows the options perfectly. What should I do in order to install windows on my laptop?

I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only!


I am using  \begin{figure}[b] \centering     \includegraphics{bla.pdf}     \caption{bla} \end{figure}   I would like this figure to be at the bottom of this page, so I include [b]. For some reason, the figure is pushed to the end of the whole chapter, several pages further down. In addition, it takes along another picture (this one does not have any [b] or [t] or [h] specification, which then also appears at the end of the chapter....  Why is [b] not working?

How to influence the position of float environments like figure and table in LaTeX?   This is a general question and should collect useful answers for all users. I hope we can use this as a reference


I am an Indian national and a frequent traveler. I have been issued a Schengen multiple entry visa twice from the French Embassy in Central Africa. I have been to France three times and two times to Poland on same visa. Now I am in India and  would like to fly directly to Poland on the same valid visa. I would like to know are there any issues entering Poland first instead of France?

My wife was just issued a multiple entry visa by France, which is good for one year.  Our first trip will be to France, the issuing country.  My question is: after we leave the EU and return, must future trips also start in France? Or may we go directly to (say) Greece from the US on a later visit?


I'm reading about infinite products in complex analysis, where there is a theorem like     The product $\prod_{n=1}^\infty\left(1+a_n\right)$ converges absolutely iff the series $\sum_{n=1}^\infty|a_n|$ converges.   Then an exercise is to show that $\prod_{n=2}^\infty\left(1-\dfrac{1}{n^2}\right)=\dfrac{1}{2}$  The theorem above guarantees that the product converges, but what is the method to evaluate its value?

Evaluate the infinite product $$\lim_{ n\rightarrow\infty }\prod_{k=2}^{n}\left ( 1-\frac{1}{k^2} \right ).$$  I can't see anything in this limit , so help me please.


In the stock market, over both the short and long-term, does someone necessary need to lose in order for someone else to make a profit? If not, then more fundamentally does something — in the most abstract sense — need to lose value in order for another's investments to gain value?  Is the stock market a zero-sum game?  Note: Thus far I've received a few answers basically explaining that companies can increase in value spontaneously from increased consumer confidence, but in a far broader sense doesn't this result in decreases elsewhere in the system? I'm really looking for a technical explanation of why the stock market is or isn't a zero-sum game.

Many investment gurus state that majority of investors fail and then offer a proven "[insert fancy name] investment strategy" that will make you successful. The number usually starts at 90% and often goes up to 99%.   Intuitively, the number makes sense to me. After all this is a zero sum game. Taking into account all different kinds of middle-men the game is actually a negative sum game.   Are there any scientific reports supporting these claims? All I found was a bunch of anecdotes.  Edit: several people noted that losing/failing is a relative term. I agree. What would be interesting is to find research that resulted in a sample of distribution of returns relative to some general market index.


I have the following problem:  Let $G$ be a finite group with transitive group action on a set $X$ (#$X > 1$). Prove: there exists an element $g \in G$ such that $gx \neq x$ for all $x \in X$.   It would be nice if anyone could help me getting started. Usually with these problems, I have trouble understanding what information I have given.  I know that transitive action is: $Gx = X$ for some $x \in X$. But how can I use this definition?  Regards.

Let $X$ be a transitive $G$-set. ($G$ acts on  $X$ transitively.) If $X$ is finite and has at least two elements, show that there is some element $g$ $\in$ G which does not have any fixed points; that is, such that $g$$($$x$$)$ $\ne$ $x$ for all $x$ $\in$ $X$  I am trying to use contradiction, but it is not very clear to me why this is true.


was asked in a recent exam where the candidate had to find the output for the following code: #include<stdio.h> #include<string.h> int main() {     char * c = "GATECSIT2017";     char *p = c;     printf("%d", (int)strlen(c+2[p]-6[p]-1));     return 0; }  I started coding in C++ , so I wasn't an expert in C-Strings. After messing around with code, I understood how it worked, but one thing wasn't clear to me, which was this way of accessing a char from the char* string. My question is, how 2[p] gets the character at index 2? Does it  resolve into *(p+2) or is there something else going on? Also, is there any documentation or any article that could explain this behavior?

As Joel points out in , in  (aka: K & R), there is mention of this property of arrays in C: a[5] == 5[a]  Joel says that it's because of pointer arithmetic but I still don't understand. Why does a[5] == 5[a]?


On a Ubuntu 14.04 server  sudo apt-get update sudo add-apt-repository ppa:ubuntu-wine/ppa   command not found: add-apt-repository  I have to run  sudo apt-get install software-properties-common python-software-properties   Retype and now is all ok:  sudo add-apt-repository ppa:ubuntu-wine/ppa   After I type:  sudo apt-get install -y wine1.7 winetricks   but I have this:  The following packages have unmet dependencies:  wine1.7 : Depends: wine1.7-i386 (= 1:1.7.34-0ubuntu1~ppa1) but it is not installable            Recommends: cups-bsd but it is not going to be installed            Recommends: gnome-exe-thumbnailer but it is not going to be installed or                        kde-runtime but it is not going to be installed            Recommends: fonts-droid but it is not going to be installed            Recommends: fonts-liberation but it is not going to be installed            Recommends: ttf-mscorefonts-installer but it is not going to be installed            Recommends: fonts-horai-umefont but it is not going to be installed            Recommends: fonts-unfonts-core but it is not going to be installed            Recommends: ttf-wqy-microhei E: Unable to correct problems, you have held broken packages   apt-get updade or similar not works, returns me same errors. how Can install or compile manually missing package?

Can someone please explain how I can install  in the following ways?   By using the package manager? By downloading and installing a pre-built package?


if I backup the transaction logs regularly, I see that it will also truncate the log to free up space.  My question is, why would I then want to regularly shrink the log file? Isn't both of these operations the same? What am I missing here?

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 am attempting to set up a computer using an answer file created by the WAIK and resetting the settings with SYSPREP and had a quick question. We are wanting to use Norton GHOST for our deployments. When do I run the sysprep? I figure it is after I get the computer all set up with the proper updates/software/drivers but I have not been able to find a direct answer to this online. Do i run it after everything is set up and the system is ready to be captured?

I am new to Windows 7, but want to deploy it in a Netware (read: no Active Directory, no domain, etc.) environment.  I have used Novell Zenworks for imaging and deploying Windows XP in the past, and have never used sysprep because it was never necessary.  Now, I find that Zenworks is unable to image Windows 7 at all.  It appears that there is a bunch of hardware-specific information that breaks the image on all machines except the specific machine it was created on.  I have  what sysprep was, just a few weeks ago.  My question is simple.  Where can I find a step-by-step guide to using sysprep to image and deploy Windows 7?  Edit: I see that my question has been migrated.  Thanks.  I have read the  that  provided--then I read the 150+ comments.  It seems that this is becoming out of date.  Is there nothing else that sums up how to use sysprep to prepare Windows 7 for imaging and deployment?


As discussed in this , dilogy/duology/etc. can be used to describe a series of two items, and trilogy and tetralogy exist for three- and four-item series, but I couldn't find any words for series with more than four items.  Specifically, I'd like to see words for up to eight-length series. (The thought came about when trying to find a word other than saga/series/etc. to describe the Harry Potter book and movie series.)

Recently I was looking at the X-Men box set and saw that currently five have been released.  I had it in my head that these would be called a quintology but I have seen them being called a pentalogy.  I assume both words are interchangeable, but is one of the terms preferred over the other, or is it a matter of taste?


I am trying to get remainder of 2 double using % operator  double x = 965.606698735538; double y = 482.803349367769; var mod = x % y;   Expected value is 0  Actual value is 482.803349367769  Can someone help why its behaving so strange.

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


In the description for  on page 230 of the Curse of Strahd adventure, it says      Though van Richten could have done them harm, he instead interrogated Ezmerelda's mother and father on the wereabouts of his missing son. Satisfied with their answers, he spared their lives before departing [...]   However, it says in the "Journal of Rudolph van Richten" handout on page 255 (in ):      When I found the caravan, I threatened to set the zombies on the Vistani unless they returned my dear boy. They replied that he had been sold to the vampire, Baron Metus. Something inside me snapped. I released the zombies, and the entire tribe was eaten alive.   So which of the above is correct:      Did van Richten kill the tribe with zombies? Or did he spare them and walk away?   Obviously Ezmerelda survived, but      I imagine she wouldn't be fond of van Richten if he slaughtered her entire tribe, yet why would he lie? Is it guilt that he didn't kill them so he's covering his tracks? Is it the senile ravings of a old man (though he seems pretty sound of mind to me)? Or is Ezmerelda mistaken, and her family were illusions for several years (that doesn't sound right)?   How is one able to figure this out? Does it say somewhere in the book that the journal lies, or that Ezmerelda is under some sort of enchantment?

This question includes NPC lore spoilers for Curse of Strahd, proceed at your own risk.  While running Curse of Strahd and prepping ahead, I have happened upon a rather glaring contradiction in the backstories of two of the important NPCs. I'm wondering if anything has been said by the developers regarding this...  This contradiction centers around       Ezmerelda d'Avenir and "Rictavio" (Rudolph van Richten)   In the former's backstory, we have this little snippet regarding their first encounter with the latter.      When Ezmerelda was a little girl, her family kidnapped van Richten’s teenage son, Erasmus, and delivered him into the clutches of a vampire. Even today, years later, she can still hear Erasmus’s pleas for mercy. That event haunted her childhood. Van Richten tracked down Ezmerelda’s family soon after the kidnapping, but not before the Vistani had sold the boy. Though van Richten could have done them harm, he instead interrogated Ezmerelda’s mother and father on the whereabouts of his missing son. Satisfied with their answers, he spared their lives before departing with the information they had given him. Ezmerelda witnessed van Richten’s act of mercy and was deeply moved by it.      However, in  (Handouts) we have the...      Journal of Rudolph van Richten   In which we find this entirely contradicting statement...      When I found the caravan [that had kidnapped Erasmus], I threatened to set the zombies on the Vistani unless they returned my dear boy. They replied that he had been sold to the vampire, Baron Metus. Something inside me snapped. I released the zombies, and the entire tribe was eaten alive.   After this, it goes on to explain      That this is where van Richten got is "monsters kill everyone you love" curse.   I know that if you go back to the AD&D2E Ravenloft books, the story from the Handout is how things actually went down, and the character who is the subject of the first story is a new character that was invented for the 5E Module.  Has anything been said about this backstory contradiction? It's kind of a big deal if these two characters turn out to be important to the plot (which they will in the game I'm running).  If the first story is true then...      Ezmerelda's family was not killed by van Richten, but the event that should have caused van Richten to get cursed never happened.   If the second story is true then...      Ezmerelda's origin and relationship with van Richten doesn't make sense, as she should have died with the rest of her family...and there was no 'act of mercy' for her to witness that made her want to seek out van Richten.


Let, $$S_n = \sum_{1\leq j<k+j\leq n}^{} 1/k$$  In the book concrete mathematics, The next line shows  that,  $$S_n = \sum_{k=1}^n \sum_{j=1}^{n-k} 1/k$$  I am getting very hard times understanding how $1\leq j<k+j\leq n$ implies $1\leq k\leq n$ and $1\leq j\leq n-k$  How is it done? Can you suggest any resource that can help me manipulating inequalities?

If you have the Concrete mathematics book please refer to page 40 and 41.  So how come this given sum  $$ \sum_{1 \le j < k + j \le n} \frac{1}{k} $$  becomes  $$ \sum_{1\le k \le n}\sum_{1\le j \le n-k} \frac{1}{k} $$ ?  I do not understand how this is proven since to my understanding i am following from the book's method of factoring inequalities,  $$ [1\le j < k+j \le n] = [1 \le j \le n][j < k+j\le n] \text{ or } [1\le k+j \le n][1 \le j < k+j] $$  And it doesn't look like the double summation above. I Tried simplifying the two above and it leads me to nowhere near the answer.


I made a short code which shows me exactly how many users are registered in my website. $user_query = "SELECT id FROM users ORDER BY id"; $user_counter = ($user_query); $user_counter_run = mysqli_query($conn, $user_counter); $user_counting = mysqli_num_rows($user_counter_run);  I dont have much experience about SQL Injections... Im just wondering, can i get a SQL Injection by this code?

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


I have a number of SSIS Packages  I am trying to locate a table that is populated by one of the SSIS Package   is there an easy way to find in the project where database.dbo.tabledata has been used in a script within the project  please help team

I have a number of SSIS packages, how can I search them to find the use of specific tables? I need to make tables changes and I am trying to assess the impact of these.


I use the following regex which extracts domain names and urls with/without schema and www:  (https?://)?\w+(\.\w+)+(/\w+)*(/\w+\.\w+)?(\?[\w%&=.]*)*(?=[^\w.?&%=])   that works fine in most of the cases, for example for www.medicare.gov  But it doesn't work in case of input text www.medicare.gov.   How to fix it in order to support such or similar cases also?

How can I check if a given string is a valid URL address?  My knowledge of regular expressions is basic and doesn't allow me to choose from the hundreds of regular expressions I've already seen on the web.


I've been going through a couple of tutorials on applying textures using the node editor, but I can't seem to get it right. I downloaded some 3d images, they include (albedo, heightmap and normalmap) but that's as far as I can go. I don't know how I should apply them. While following a tutorial it seems so easy but now that I'm trying it by myself, things get a bit tricky :p. I've already UV unwraped my mesh, now I just need some sort of guideline. Thanks in advance.

I created some texture maps in MindTex to use in Blender, but I can't figure out how to properly hook them up. The maps I have:  - Diffuse  - Normal  - Height   - Specular   - Gloss   - Self Illumination  - Reflection  - Ambient Occlusion   MindTex (left) vs. Blender (right)  As you can clearly see it's a pretty big difference.  is my material node setup in Blender. In the examples I don't actually use self illumination or reflection images, but including this in the answer would be helpful.


Is wands the only tool used for spellwork? Are there any wizards that use staffs, like Gandalf, in Harry Potter? Is there any mention of other tools you can use to perform spells?

In the beginning of the series, it's mentioned that Muggle-born wizards/witches are identified due to inadvertent spell-casting. However, it seems like later in the book, disarmed wizards/witches are completely helpless.   What is the explanation for why some spells can be cast without a wand and is there an in-universe explanation for why this isn't done? Also, are there spells that can be cast non-verbally (with/without a wand)?


I try to create bigger table in TeXworks where are different horizontal as well as vertical lines. Everything works fine but it always crash on the \cline command (when I use \hline it works perfectly). Anyone know where should be problem?  I use packages:  \usepackage[czech]{babel} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc}   \usepackage{array} \usepackage{multirow} \usepackage{hyperref} \usepackage{amsmath} \usepackage{tikz}   Source of the table:  \begin{table}[ht] \centering \begin{tabular}{*{11}{|l}} \hline & & \multicolumn{4}{c}{Longer text} & \multicolumn{3}{c|}{Longer text}\\ \cline{3-9} & & a& b & c & d & ei & f & g \\ \hline \parbox[t]{2mm}{\multirow{3}{*}{\rotatebox[origin=c]{90}{text}}} & description & 2 & 1 & 2 & 0 & 1 & 2 & -1\\ \cline{2-9} & description & 2 & 0 & 1 & 2 & 1 & 1 & 0\\ \cline{2-9} & description & 2 & 2 & 2 & 1 & -2 & 2 & -2\\  \hline \parbox[t]{2mm}{\multirow{4}{*}{\rotatebox[origin=c]{90}{text}}} & description & 2 & 2 & 2 & 2 & -1 & 2 & 0\\ \\cline{2-9} & description & -1 & 0 & 2 & 2 & -2 & 1 & -2\\ \cline{2-9} & description & 1 & 2 & 2 &  & -1 & 1 & -1\\ \cline{2-9} & description & -1 & -1 & 0 & 0 & 0 & -1 & 1\\ \hline \end{tabular} \caption{Multi-row table} \label{tab:multirow} \end{table}

I tried to use the Slovak language with the booktabs package.    Let's see a couple of cases.   slovak is included in the options to babel     \usepackage[english,slovak]{babel}   or    \usepackage[slovak,english]{babel}   or    \usepackage[slovak]{babel}`  "slovak" is NOT included in the options to babel  \usepackage[english]{babel}    Similarly two cases for \cmidrule  A. \cmidrule{2-3} is included in the table    B. \cmidrule{2-3} is NOT included in the table    If both (slovak+\cmidrule) are included (case 1A), then following error occurrs  Paragraph ended before \@@@cmidrule was complete   (and a lot of other errors)  In the other cases (1B, 2A and 2B) (NO slovak or NO \cmidrule), then pdflatex is succesful  Does anybody know why 1A is wrong?    And how to use slovak and \cmidrule together (case 1A)?  \documentclass[10pt]{book} \usepackage[english,slovak]{babel} \usepackage{booktabs}  \begin{document}  \begin{tabular}{ccc} A & B & C \\ %\cmidrule{2-3} A & B & C \\ \end{tabular}  \end{document}   I have Win7, TeXstudio 2.5.2


The rustling grass is driving me crazy - does it actually mean something? I've tried walking towards it, I mean I have actually walked in circles for five minutes in a Home Depot parking lot and in my neighborhood, but nothing ever comes of it.  I've tried tapping the screen where the grass is rustling - nothing.  Sometimes I see little pieces of green, other times it is substantially bigger. But never a pay off.  What am I missing?

Occasionally, you can see little tufts of leaves blowing in spots on the map      Do these mean anything?


I'm using Flot JS charts. I'm trying to remove one of the plot series from my data array completely with jquery or plain javascript.  This is what my data array looks like:  [  {   "label" : "Citrix PV Ethernet Adapter",   "data": [[1,0], [2,0.01], [3,0.02], [4,0.01], [5,0.01]]  },  {   "label" : "Virtual Adapter _1",   "data" : [[1,0], [2,0], [3,0], [4,0], [5,0]]  } ]   I want to be able to have the ability to completely remove one of the entries, preferably by using the "label" properties value, so it looks like this:  [  {   "label" : "Citrix PV Ethernet Adapter",   "data": [[1,0], [2,0.01], [3,0.02], [4,0.01], [5,0.01]]  } ]   Is this possible? I know it's possible to "toggle" the visibility of the series in Flot, but this doesn't suit in this case.  There could be many many entries in this array, I've just kept it to two for an example.  I've tried the playing around with javascripts delete function but I've had no luck so far.  How can this be done?

What is the difference between using  on the array element as opposed to using ?   For example:  myArray = ['a', 'b', 'c', 'd'];  delete myArray[1]; //  or myArray.splice (1, 1);   Why even have the splice method if I can delete array elements like I can with objects?


Well I am not able to understand how to reduce Complex/Mixed Combinations of Capacitors into simpler circuits.  Well there is one Complex Circuit of capacitors which I was able to reduce into simpler one.(How did i know... because I got the right answer)  Here it is:    But I couldn't able to figure out the basic logic behind the conversion of Complex Circuit into Simpler ones. The concept of solving these questions are vague in my mind.  That's why I stuck in a question in which the circuit was very complex.  The picture is:    Now C=18 microfarad and C1= 12 microfarad(If anyone want to get the equivalent capacitance between P and Q)  How to reduce it in a simpler circuit?  So  a. What is the basic logic behind the conversion of Complex Combination of Capacitors into Simpler ones?  b. If a combination of capacitors can be converted into a Wheatstone Bridge is there any combination of same capacitors other than Wheatstone Bridge so to get  same equivalent capacitance?

I simply can't figure out what the capacity of this circuit is.  I can do the math myself, I just need a hint how to create an equivalent circuit where it is obvious what is parallel and what is in series...


Calculate the following sequence: $\lim_{n\to \infty} a_n = \frac{1}{n^5}(1^4 +2^4+....+n^4)$.  I know how to solve this using Riemann sums of the function $x^4$.  I was wondering if there's another way using other methods. Any help would be appreciated.

By considering:  $$\lim_{n\to\infty}\frac{\sum_{k=1}^n k^1}{n^{2}} = \frac 1 2$$ $$\lim_{n\to\infty}\frac{\sum_{k=1}^n k^2}{n^{3}} = \frac 1 3$$ $$\lim_{n\to\infty}\frac{\sum_{k=1}^n k^3}{n^{4}} = \frac 1 4$$  Determine if this is true: $$\lim_{n\to\infty}\frac{\sum_{k=1}^n k^m}{n^{m+1}} = \frac 1 {{m+1}}$$  If it is, prove it.  If it is not, evaluate $\lim\limits_{n\to\infty}\frac{\sum_{k=1}^n k^m}{{m+1}}$.


The purpose of placing the Philosopher's stone where it was placed was to hide it from Voldemort. Is there any in-universe reason why it was hidden behind a series of solvable puzzles? It looks like it was set up such that a worthy hero could solve the puzzles and get the stone (there were even written clues!), but surely the point was to hide it from anyone, including capable wizards such as Quirrel who might be helping Voldemort.  Why then not just hide it behind Snape's magical fire and not provide the potion, for example?  I understand that the purpose of the puzzle is to show Harry as a hero, so I'm not even questioning why the puzzles were easy enough to be solved by an 11 years old, but is there an in universe explanation why there were puzzles at all?

The Sorcerer's (Philosopher's) stone was moved from Gringotts to Hogwarts  Dumbledore wanted the stone to be better protected.  In Harry Potter and the Sorcerer's Stone however, Harry, Ron, and Hermione, three 11 year-olds, manage to get through seven magical obstacles designed to protect the Sorcerer's (Philosopher's) Stone.   If it was possible for three first year kids to get through the obstacles, then how was the Stone well protected at at all. Did Dumbledore really expect that the teachers' defenses would work against Voldemort?


I am typesetting some Indian currency using spreadtab for calculations. I want to obey the usual conventions followed in typesetting Indian money amounts:   One thousand (hazar) = 1,000 One lakh = 1,00,000. One crore = 1,00,00,000. One urb = 1,00,00,00,000. One khurb = 1,00,00,00,00,000.   The last two mentioned are uncommon. People prefer to say Rs 77,000 Cr. instead of Rs 770 urb.  This is unlike most other currencies (including German/British/US currencies) where you have uniform separators after every n (usually 3) zeros.  In Indian currency, the separators are after every two zeros, except for the first set, which is after three zeros.  I have looked at the documentation of numprint, but I do not think it can be done using that package (or siunitx for that matter).  Suggestions?

\num{100000} prints 100 000  I want to have 1 00 000.  Question: How to set siunitx package to do the above?  Some more  \num{1000} => 1 000  \num{10000} => 10 000  \num{100000} => 1 00 000  \num{1000000} => 10 00 000  \documentclass[12pt]{article} \usepackage{siunitx} \sisetup{group-separator = {,}}  \begin{document}  \num{1000}  \num{10000}  \num{100000}  \num{1000000}  \num{10000000}  \num{100000000}  \num{1000000000}  \SI{1000000000}{m}  \end{document}   The exact rules are described on the :     The Indian Numbering System uses separators differently from the Arabic system; besides the three least significant digits of the integer part, a comma divides every two rather than every three digits.


I have downloaded a bad version of wine and so my applications no longer work. I am finding it hard to locate all the programs that I downloaded using it and thought that it would be easier to just wipe my system and start again. Is there a simple way of doing this?  I don't have a disc drive so if there is an option to do this from USB that would be great.  Thanks for any help

I want to reinstall Ubuntu, but I also want all information and settings to disappear. So everything looks like the first time I installed it. Is it possible to do so via Terminal? Or what are the steps I should follow?


I'm using Mint 20.1 (update: I also use zsh as my shell) , and I notice that there are two very similar environment variables dealing with path:  $PATH, which lists every path directory, using colons as separators $path, which lists the same directorys, but using spaces as separators  Why is that? What is the purpose of each variant? AFAIK, everyone recommends that changes to path should be committed to $PATH; is that right?

In  12, using the  shell, I noticed this difference when looking at $path (lowercase) versus $PATH (uppercase).  echo $path      /sbin /bin /usr/sbin /usr/bin /usr/local/sbin /usr/local/bin /usr/home/freebsd/bin   echo $PATH      /sbin:/bin:/usr/sbin:/usr/bin:/usr/local/sbin:/usr/local/bin:/usr/home/freebsd/bin   One output is delimited by SPACE character, the other by COLON character.   ➥ Why the difference?   Are these two different, separate variables? Or does the lowercase/uppercase trigger some kind of trick or meaning I do not know about?   Is this a zsh feature? Or a feature of FreeBSD?


Hello, I made an object(left one) and I duplicated it and scaled by -1 in x direction(right one) to have it symmetric. Then i applied "Apply to Location, Scale&rotation and Origin to Geometry" But as in the picture, it is shaded improperly. What can problem be and how can I fix it ?

While rendering a mesh with smooth shading on, I get a dark region/shadow on certain faces. The effect is more evident when smooth shading is applied to a mesh containing ngons, with the ngons turning black when rendered.   The blackening effect is visible in the viewport too.  How can I solve this problem?


I own a [Lenovo Z410][1] laptop, and its battery is not removable.  Lenovo published an ['energy management' driver for Windows][2] that let you to use ac power instead of battery when the battery power is between 55% and 60%. How may I do this in Ubuntu?  I notic that if i turn on this option in windows and restart to ubuntu whitout unpluging charger, battery doesn't charging and device use ac power.  [1]: cpu: core i7 4702MQ  [2]: you're right. It's a driver. But when you install it, an app named "power manager" appear in app menu.

I just learned that some Lenovo laptops include a utility that offers to limit battery charging capacity to within 0–80% in order to slow the attenuation of the battery lifespan:    How can I do this in Ubuntu?


I'm currently trying to write a GUI for Tic Tac Toe in Python. For that purpose I am using tkinter. I want to create a button for every position to be able to make my moves by clicking one of these buttons. The problem now is that I want a function with different parameters to be called depending on the button I clicked. Therefore I tried to use lambda expressions, but no matter which button I click, it results in the same call.  import tkinter as tk  class GameWindow:      def __init__(self):         win = tk.Tk()          buttons = [[tk.Button(win,text=str(i)+str(j)) for j in range(3)] for i in range(3)]         for i in range(3):             for j in range(3):                 buttons[i][j]["command"] = lambda: print([i,j])                 buttons[i][j].grid(row=i, column=j)                 print([i,j])         win.mainloop()  test = GameWindow()   In this case, I just want the position to be printed, but no matter which button I click, [2,2] is being printed.

I want to create a list of lambda objects from a list of constants in Python; for instance:  listOfNumbers = [1,2,3,4,5] square = lambda x: x * x listOfLambdas = [lambda: square(i) for i in listOfNumbers]   This will create a list of lambda objects, however, when I run them:  for f in listOfLambdas:     print f(),   I would expect that it would print  1 4 9 16 25   Instead, it prints:  25 25 25 25 25   It seems as though the lambdas have all been given the wrong parameter. Have I done something wrong, and is there a way to fix it? I'm in Python 2.4 I think.  EDIT: a bit more of trying things and such came up with this:  listOfLambdas = [] for num in listOfNumbers:     action = lambda: square(num)     listOfLambdas.append(action)     print action()   Prints the expected squares from 1 to 25, but then using the earlier print statement:  for f in listOfLambdas:     print f(),   still gives me all 25s. How did the existing lambda objects change between those two print calls?  Related question:


Given the recent number of users who come here to complain that their account has been suspended because they deleted too many of their own questions, could a warning message be added after the first deletion which points to the policy "Your account will be suspended if you delete too many questions"?  Or even a simple: "Are you sure you need to delete this questions? "  Update: See also the  results for many examples of users who were suspended.

If a user is question banned  and the , how can the user fix this on their own?  Until recently, advice has been to improve their questions, but since they can't see the questions on their question screen, they can't improve them:     Feature request: Allow a question banned user to see their own deleted questions, or warn them that deleting questions could lead to a question ban.


Something changed between MacTex2012 and MacTex2014 in terms of how PreviewEnvironment and beamer interact.  This MWE used to produce a single page (by pdflatex in MacTex 2012), but now it produces two pages, the second blank.  \documentclass{beamer} \usepackage[active,tightpage]{preview} \PreviewEnvironment{center}  \begin{document} \begin{frame} \begin{center} test \end{center} \end{frame} \end{document}   I'm trying to track down why, but perhaps an expert out there can leap to the answer?

The following code is taken from Gonzalo Medina' . At the time he posted the answer the code was compilable.   \documentclass{beamer} \usepackage{pstricks-add} \usepackage[active,tightpage]{preview} \PreviewBorder=0pt \PreviewEnvironment{pspicture}  \begin{document}  \begin{frame}     \begin{pspicture}(6,6)         \pnode(0,0){A}         \pnode(6,0){B}         \pnode(6,6){C}         \pnode(0,6){D}         \pnode(1,1){P}         \pnode(5,1){Q}         \pnode(3,5){R}         \only<5>{\psclip{\pscircle[linestyle=none,dimen=middle](3,3){3}}}         \only<1->{\pspolygon*[linecolor=red](A)(B)(Q)(P)}         \only<2->{\pspolygon*[linecolor=green](B)(C)(R)(Q)}         \only<3->{\pspolygon*[linecolor=blue](C)(D)(R)}         \only<4->{\pspolygon*[linecolor=yellow](D)(A)(P)(R)}        \only<5>{\endpsclip}      \end{pspicture} \end{frame}  \end{document}     But now, the same code is no longer compilable with error /typecheck in --div--.  Actually, I want to compile the following code but the same error also occurs. What is wrong?  \documentclass{beamer} \usepackage{pstricks} \usepackage[active,tightpage]{preview} \PreviewEnvironment{pspicture} \PreviewBorder=12pt\relax   \begin{document}  \begin{frame}{Test} \psset{unit=.5cm,runit=.5cm} \begin{pspicture}[showgrid=top](-7.5,-7.5)(7.5,7.5) \pstVerb {        %true setglobal     %globaldict begin     /c40 {40 cos} bind def     /s40 {40 sin} bind def     /s65 {6 5 s40 mul add} bind def     %end     %false setglobal } \pscircle[linecolor=blue]{8} \pscustom[fillstyle=solid,fillcolor=black!20]{%   \only<1->{\psarc(0,0){5}{40}{! 180 0.3 ATAN1 sub }}   \only<2->{\psline(! 37.5 c40 mul s65 div 1.5)(! 32.5 c40 mul s65 div 0.5)}   \only<3->{\psarc(0,0){5}{!180 0.1 ATAN1 sub}{!180 0.1 ATAN1 add}}   \only<4->{\psline(! 27.5 c40 mul s65 div -0.5)(! 22.5 c40 mul s65 div -1.5)}   \only<5->{\psarc(0,0){5}{!180 0.3 ATAN1 add}{320}}   \only<6->{\psarcn(0,0){6}{! 270 5 c40 mul 36 25 c40 dup mul mul sub sqrt div ATAN1 add }{! 270 0.25 Acos sub }}   \only<7->{\psline(-7.5,-1.5)(!5 c40 mul s65 div 7.5 sub -0.5)}   \only<8->{\psarcn(0,0){6}{!180 1 12 atan add}{!180 1 12 atan sub}}   \only<9->{\psline(-7.5,0.5)(! 5 c40 mul s65 div 7.5 sub 1.5)}   \only<10->{\psarcn(0,0){6}{!180 1.5 6 atan sub}{! 1 c40 div 10 div 36 25 10 sin mul sub 60 s40 mul add mul s65 div ATAN1}}   \only<11->{\closepath} } \end{pspicture} \end{frame} \end{document}   Forensic trace record  The last success of compiling the code was on July 29, 2012 and the last update of preview is in 2010. So preview can be removed from the list of candidates causing this problem.  pstricks and beamer are left, but which one is the source of problem?


can someone please give me an example for this sentence, (i don't want a formal definition) thank's.

I have some trouble trying to understand Halmos' explanations about generalized Cartesian products. I've read these entries already:    This also has the page I'm stuck on.      Is his generalization the same as a Cartesian product of several sets? As here:   What puzzles me is $\{a,b\}$. Where does it come from, what does it do? I know that it is supposed to be arbitrary. How does it identify distinct elements of $X \times Y$? Does some function map each $a \in A$ to an element in $X$? Or is it always the same $a$?  What does he mean by      the set $Z$ of all families $z$, indexed by $\{a,b\}$, such that $z_a \in X$  and $z_b \in Y$   ? What does does an element of $Z$, namely one family $z$, consist of? By family, does he mean an indexing function or the indexed elements? This comes to a very important question for me: Does family mean a function or the set of all indexed elements?   I will try to explain how I understand it thus far: $Z$ contains elements of the form $\{(a,x),(b,y)\}$. The choice of $x$ depends on $a$, so an $x$ in a $z \in Z$ equals the $z_a$ of $X$. Now, we want to map these pairs to $X \times Y$, so we have a function $f$ that takes $z \in Z$ and connects it to the corresponding ordered pair $(z_a, z_b)$, where $z_a \in X$. $X \times Y$ is not the same as $Z$; they only, effectively, contain equal elements.  He goes on:     If $\{X_i\}$ is a family of sets ($i \in I$), the Cartesian product of the family is, by definition, the set of all families $\{x_i\}$ with $x_i \in X_i$ for each $i$ in $I$.   How I understand it: $\{X_i\}$ contains, as elements, several sets, each single one a set $X$ identified by an index/element of $I$. Then, we go over all indeces $i$ in $I$, take from each set $X$, namely $X_i$, an element $x$ and add it to current set of the newly created sets/families. So, the lower index $i$ does not refer to an element of $X_i$ indexed by $i$, but rather calls all elements of $X_i$ $x_i$. We end up with a set, defined as Cartesian product, of sets, in which each element (set) contains ordered elements, each from a different $X_i$. How does the ordering occur?  $\prod_i X_i$, the Cartesian product, becomes equal to $X^I$, if all $X_i$ are the same set $X$. $X^I$ means all possible combinations of mapping from $I$ to $X$. We randomly take an elements $x$ from some $X_i$, put it in a set/family with other randomly obtained $x$, put the entire set into a set denoted $X^I$, and continue doing so, till we have no more options. Then, each set in the new $X^I$ contains a mapping of some $i$ to some $x$. Since we exhausted the options, they are indeed all combinations.  Where did I go wrong? Someone needs to spoonfeed my the answer; I am completely confused by now.


I have this exercise:     $M$ is the lebesgue measurable sets on $\mathbb{R}$.   Suppose that $E \in M$. Show that for each $\epsilon > 0$, there is a   closed set $F$, with $F \subset E$ and $\lambda(E \backslash F)  <\epsilon$.   Here $\lambda$ is the Lebesgue measure.  I am stuck on this exercise. Using the definition of the Lebesgue measure, I know that there is a sequence of open intervals $\{I_n\}$, $E \subset \bigcup I_n$, so that for instance $\lambda(E) > \sum \lambda(I_n)-\epsilon/2$. I thought that maybe I could shrink the intervals to get closed intervals, however that didn't work because I don't know how much they have to be shrinked in order to get containment in E, and also there is a problem that an infinite union of closed sets might not be closed itself.  Another option is to use the Caratheodory criterion somehow, but I don't see how that helps?

Just having trouble with this problem. First, it says to prove that if $E$ is Lebesgue Measurable, and $\epsilon>0$ is arbitrary, then there is an open $O$ such that $E \subset O$ and $m(O\setminus E)<\epsilon$. Now for this part, since $E$ is Lebesgue measurable, I was able to take the definition of being Lebesgue outer measurable (the infimum of open coverings of $E$) and easily construct $O$ from that, and it works out.  But now I want to show that there is an $F$ closed with $F \subset E$ and $M(E\setminus F)<\epsilon$. The problem is, I can't figure out how to construct this $F$! The idea seems obvious intuitively, but I feel like I am given no tools for constructing a closed subset of an arbitrary set that satisfies these conditions. Am I missing something obvious here?  Thanks!!


Let L : K be a finite extension, and let p be an irreducible polynomial over K. Show that if op and [L : K] are coprime, .then p has no zeros in L .

Here is another problem of the book Fields and Galois Theory by Patrick Morandi, page 37.     Let $f(x)$ be an irreducible polynomial over $F$ of degree $n$, and let $K$ be a field extension of $F$ with $[K:F]=m$. If $\gcd(n,m)=1$, show that $f$ is irreducible over $K$.   I'm preparing for my midterm exam so I'm trying to solve as many as this book problems. Thanks for your helps.


A friend has written me a message in which she tells me that she is leaving tomorrow from Italy. I want to say that I hope that she had/ has had a great time here in Italy. What is the right way to say it? "I hope you enjoyed staying in Italy" or "I hope you have enjoyed etc.." Thanks.

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


I am trying to store the figure height and width into a separate file, for this I write the code (please excuse me, if these are not in a standard method) as below:  \documentclass{book}   \RequirePackage{color,graphicx}% \RequirePackage{printlen}%  \uselengthunit{cm}  \newlength\imageheight \newlength\imagewidth  \newwrite\imgdetail% \immediate\openout\imgdetail\jobname.imd%  \let\LTXincludegraphics\includegraphics%  \newbox\fightbox% \newdimen\fightdimen%  \newcount\fightcounter%  \def\fightvalue{}%  \renewcommand\includegraphics[2][]{% \settoheight\imageheight{\hbox{\LTXincludegraphics[#1]{#2}}}% \fightdimen=\ht\fightbox% \gdef\fightvalue{\strip@pt\fightdimen}%   \write\imgdetail{\figurename\space\thefigure, Page \thepage, #2}%   \write\imgdetail{height=\printlength{\imageheight}}%   \LTXincludegraphics[#1]{#2}% }%  \begin{document}  \begin{figure} \includegraphics[draft]{gr1.eps} \end{figure}  \end{document}   Everything works fine, but the figure height doesn't come correct, the output was:  Figure 0, Page 1, gr1.eps height=\def cm{pt}0.0pt   Can you advise what I did wrong in this?

I have some LaTeX code  \begin{figure}     ABC     \caption{def} \end{figure}   And I would like to be able to find its height in a pdf output. The method outlined  doesn't work, yielding the error:  ! LaTeX Error: Not in outer par mode.   I considered the idea of using \write18 and somehow measuring the size of the figure by itself using pixel-grabbing tricks, but if the document had a globally changed caption size, that would mess things up.  I was wondering if there was a valid way to do this.


I have a pdf file that consists of an image per page.   Are there any command line programs that can extract these images?

When I convert a pdf file to bunch of jpg files using   convert -quality 100 file.pdf page_%04d.jpg   I have appreciable quality loss.   However if I do the following, there is no (noticeable) quality loss:  Start gscan2pdf, choose file-> import (and choose file.pdf). Then go to the temporary directory of gscan2pdf. There are many pnm files (one for every page of the pdf-file). Now I do    for file in *.pnm; do               convert $file $file.jpg done   The resulting jpg-files are (roughly) of the same quality as the original pdf (which is what I want).   Now my question is, if there is a simple command line way to convert the pdf file to a bunch of jpg files without noticeable quality loss? (The solution above is too complicated and time consuming).


If we define a cron job with * * * * * /some/task/to/perform, how many times the job will executed in 60 seconds?

The first noncomment line in a legacy crontab file begins with five asterisks:  * * * * * ([a_command]) >/dev/null 2>&1   The authors are gone, so I do not know their intent.  What does all-wildcards mean to (Solaris 8) cron?  The betting here is either run once, run continuously, or run never, which is unfortunately broad.  If you are wondering about the comment line preceding this, it is "Do not delete."  Note: This cron file is working. This question is not a duplicate of a question about broken cron files or cron files which require troubleshooting.


According to the , deprecation allows to remove something from the API. Has this ever happened to the standard API?

I'm code reviewing a change one of my co-workers just did, and he added a bunch of calls to Date.toMonth(), Date.toYear() and other deprecated Date methods.  All these methods were deprecated in JDK 1.1, but he insists that it's ok to use them because they haven't gone away yet (we're using JDK 1.5) and I'm saying they might go away any day now and he should use Calendar methods.  Has Sun/Oracle actually said when these things are going away, or does @deprecated just mean you lose style points?


I am really confused and frustrated as I can't figure this out. If someone could clear my doubt, I'd be really thankful.   According to my textbook current is the rate of flow of charge, it is directly proportional to voltage provided the resistance remains constant. So, when current which is basically electrons carrying electrical energy, when they pass through a resistor or lamp or any other electrical component, some electrical energy gets converted into thermal energy, so the electrical energy they carry is reduced, right? And as they pass through a component they undergo collisions with the atoms which causes their speed to reduce, they will travel slower and therefore pass through the resistor much slowly, so as its speed reduces the current should reduce?   As current is the rate of charge, it's rate will definitely reduce due to the collisions it will go through, right? I understand that the “amount” of electrons will remain same as everyone says, but current just isn't “flowing electrons” it's the rate at which they flow, so although the amount of electrons flowing remains same, their rate of flow decreases, so isn't the current supposed to be reduced rather than remain constant?   I could be totally wrong but I haven't  found any resource which gives me the answer to my question, everyone claims the amount of electron remains same (I agree) but no one refers to its rate. I am studying this entire chapter by myself so sorry if something I said tends to be wrong.

I know that the question is quite stupid but I want to get an insight of this case. consider 3 resistors connected in series with a battery, after the current passes through resistor 1 it loses some of its energy, the kinetic energy of the charge carriers will definitely also decrease and so does the drift velocity then why doesn't the current decrease? Its quite confusing.


Ok, these are 2 questions in one, but they are different.   I am trying to define a function f mapping from X to Y. So what i am doing is: open the equation environment and writing: $f:X{\rightarrow}Y$. However, after that, i would like to write below the X{\rightarrow}Y the following x{\mapsto}y since $x{\in}X$ and $y{\in}Y$. But if i open another equation environment to write this x{\mapsto}y it does not get aligned with the X{\rightarrow}Y. So i need help. What am i supposed to do? The other problem is that i what to write Definitios and theorems in the text. SO, i am using the amsthm package and, in the preambule, i wrote \newtheorem{def}{Definition}. However, when i open the def environment things go insane, because appears the single word Definition in the first page of the file and the body of the text begins only in the second page. And worse: in the place where it was supposed the Definition (and the text together it) to appear, nothing appears. So i don't know what to do.        \documentclass{article}  \usepackage[utf8]{inputenc}  \usepackage{amsmath}  \usepackage{amsthm}  \newtheorem{defi}{Definition}  \begin{document}  \begin{defi}  A set $A$ is...  \end{defi}  \end{document}   I am a beginner in LaTeX. I am sorry if it seems dumb.

I have the following diagram:    However, this looks a bit ugly, I would like a version that looks a little bit better. For example, size the last arrow such that the T_\phi is moved to the right.  This is the code which I am using to do this:  \begin{align*}   \xi \colon &\lb \to \mathcal{L}(\hh)\\   &\phi \mapsto T_\phi. \end{align*}   Where \lb and \hh just give the names for those spaces. Does anybody have a suggestion how I would improve the look of this function definition?


Some items are labeled junk and have a list of constituent materials. For example a baseball is made of leather and cork. But you need an actual baseball to make a baseball grenade.   Does anyone have a list of junk items used in recipes before they are broken down?

Fallout 4 adds the kleptomaniac-friendly ability to deconstruct practically anything into useful components. As such, I have built an impressive store of building materials, and enforce a "pick up everything, leave nothing" strategy. This works quite well.  However, a few guys on Live have been recommending I hold on to any copies of the Daily Bugle I find, as there is supposedly an NPC that will pay caps for them. I assume this is the case for both regular and rolled up copies.  I know that in previous Fallout games, there were a few "junk items" that would serve a purpose, often in regards to an NPC that would buy them off you for a fair amount of caps.  Are there any junk items in Fallout 4 that serve any type of purpose other then component scrapping? Are there any particular items I should be holding on to, instead?   I am specifically asking about items that can otherwise be lost through the automatic dis-assembly of junk. Items that fall under the "misc" category, like overdue books and subway tokens, are of no use in this context as there is no great risk of accidentally destroying them.


I am trying to show data in excel by requesting to server. I am sending data in table format. It has some date values. I am sending the dates as 'MMM/DD/YYYY', which is working properly in mac.  When the same I am trying to check in windows, it is considering it as 'DD/MM/YYYY'.   Is there any way to force excel to consider the date as 'mm/dd/yyyy' always, irrespective of system's date format?  EDIT  I am adding connection in the excel (From web in windows), which will send request to get the data that we want to show in the excel. There is no manual typing.

In my locale, date is inserted as dd/mm/yyyy or variations of that (including dd-mm-yy). I made an Excel form (in normal Excel file), already formatted to show date as dd/mm/yyyy, but when I typed "05/04/2015" it will be shown as "04/05/2015". I know this can be solved by changing the regional setting to my local setting, but I need to distribute this form to a lot of people with no knowledge of changing regional setting, and assuming no one can teach how to, hence my question :  Is there any way to input "05/04/2015" and be recognized as "5 April 2015", without having to change regional settings ?  Additional note: When I mean "4 May 15" (typed in 4/5/15), Excel will recognize this as "5 April 15" because Excel takes input as "mm/dd/yy" format. I need to change the default behavior of Excel to take as "dd/mm/yyyy" as this is the way the users will input.  If possible, the setting should also included/embedded on the file to allow end-users use the form without even changing setting.  I'm not familiar with macros and VBA, but willing to try those :)  EDIT : this is related to my question :   but I don't need to change the whole formula bar, as long as Excel recognize that I'm typing in dd/mm/yy format.


I am labeling areas on a map (for example, forest (coniferous, deciduous trees), swampland, and so on).  A cartographer has criticized it because labels which extend beyond the boundaries of the specific areas are cut off.  Therefore, I would like to show only those labels that are completely contained within the area.  (I tried to work around the problem by masking the area with an internal buffer of the area's border, but that only cuts the labels along the buffer boundary.)  I would appreciate any ideas about how this could be accomplished with QGIS 1.80.   Thank you, whuber,  for your assistance*

I've read a few other issues about trying to prevent labels from rendering if they run off the edge of the map canvas. This is particularly a problem in Composer, where I get lots of country labels which are only half on the page.    In the above post in the QGIS issue queue, Nyall Dawson says "There's an option in the global label settings to prevent clipped labels at the edge of maps".  I can't find this setting. Does anyone know where it is? Or any other solution for this problem?


I can't mount the windows disk. I am a new Linux user.  Error mounting /dev/sda1 at /media/dimitris/CE061FB2061F9B13: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,dmask=0077,fmask=0177" "/dev/sda1" "/media/dimitris/CE061FB2061F9B13"' exited with non-zero exit status 14: Windows is hibernated, refused to mount.  Failed to mount /dev/sda1: Operation not permitted: The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option.

Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount.  When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens.    Here's my partition table, if any more data is needed please let me know.     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048    20000767     9999360   83  Linux /dev/sda2        20002814   478001151   228999169    5  Extended /dev/sda3   *   478001152   622532607    72265728    7  HPFS/NTFS/exFAT /dev/sda4       622532608   625141759     1304576   82  Linux swap / Solaris /dev/sda5        20002816   478001151   228999168   83  Linux


MWE:  \documentclass[referee]{svjour3}  \usepackage[english]{babel}  \begin{document} \cite{yang2008,yang2010}  \bibliographystyle{IEEEtran} \bibliography{IEEEabrv,bibfile_test} \end{document}   The cls file can be obtained from .  bibfile_test file:  @article{yang2010,   title={An analytical continuous-curvature path-smoothing algorithm},   author={Yang, Kwangjin and Sukkarieh, Salah},   journal={IEEE Transactions on Robotics},   volume={26},   number={3},   pages={561--568},   year={2010},   publisher={IEEE} }  @inproceedings{yang2008,   title={3D smooth path planning for a UAV in cluttered natural environments},   author={Yang, Kwangjin and Sukkarieh, Salah},   booktitle={Intelligent Robots and Systems, 2008. IROS 2008. IEEE/RSJ International Conference on},   pages={794--800},   year={2008},   organization={IEEE} }   Resulting PDF:    Why do the authors disappear in the second case? How do I fix it (short of manually editing the bib file)?

In my .bib file, I have two entries with exactly the same author names:  @article{Seshadrinathan2010A-Subjective-St,     Author = {K. Seshadrinathan and R. Soundararajan and A. C. Bovik and L. K. Cormack}, ....  @article{Seshadrinathan2009Study-of-Subjec,     Author = {K. Seshadrinathan and R. Soundararajan and A. C. Bovik and L. K. Cormack}, ....   When cited after each other, and typeset with the IEEEtran bibliography style, the .bbl file reads:  \bibitem{Seshadrinathan2010A-Subjective-St} K.~Seshadrinathan, R.~Soundararajan, A.~C. Bovik, and L.~K. Cormack, ``A   subjective study to evaluate video quality assessment algorithms,''   \emph{SPIE Proceedings Human Vision and Electronic Imaging}, 2010.  \bibitem{Seshadrinathan2009Study-of-Subjec} ------, ``Study of subjective and objective quality assessment of video,''   \emph{IEEE Transactions on Image Processing}, 2009.   As you can see, the author names have been replaced with ------. It looks like this in the final PDF:    Is this normal behavior?


If I have wet clothes and put them on the ground and let the Sun shine on them, they dry as water evaporates. But water should evaporate at 100 degrees Celsius so how come they go dry if it's just about 30 degrees Celsius? What am I missing?

When the sun is out after a rain, I can see what appears to be steam rising off a wooden bridge nearby. I'm pretty sure this is water turning into a gas.  However, I thought water had to reach 100 degrees C to be able to turn into a gas.  Is there an edge case, for small amounts of water perhaps, that allows it to evaporate?


After clicking it changes the number then changes the repective arrow back to a grey color.   Color should stay changed not revert back to grey.   Color should stay grey in situations where the user cannot vote validly for whatever reason.

When I vote using the Android app, the button highlights briefly in orange as expected and then returns to the normal black (so both vote buttons are the same color). I expected the highlighting to remain in place to show my vote.  The post score reflects my vote, and if I tap the vote button again it cancels my vote (and updates the score again).  So my vote is there; it's just not shown.  If I vote, navigate back to the list of questions, and then return to the page where I voted, my vote shows in orange and is persistent. Votes I've previously cast show up and are persistent on first view; it's only new ones that behave like this.  By its nature, it's hard to take a meaningful screenshot.  I don't use the app a lot, so I don't know how new this is. My phone says I'm up to date (1.0.77).


I am a newbie to Diablo 3. I have the Reaper of Souls version of the game. My understanding is the game has 5 acts. Correct? if so, what happens after Act V? I'm at level 38 and fighting in Act V now. I'm a long way from level 70. So, are there new quests between levels 40 to 70?

My friend and i decided to play some Diablo 3. We played for almost 9 hours straight and killed Diablo on the hard difficult. We reached level 41.  We think 9 hours is short for a game like Diablo 3.   Have we missed something? Why are we only level 41? Is there more story?


I have a tablet that I got about 2 years ago, but never opened it until recently (it was a package deal, and my laptop finally died).  When I booted it up, it went through a whole bunch of automatic updates, which makes sense.  It eventually ended up running Windows 10 (this may have been one of the automatic updates).  What doesn't make sense is that Windows Explorer shows less than 2GB of free space out of 28.5GB on my C drive.  This makes it virtually impossible to install any new software.  I tried running disk cleanup and removing all programs that I had no use for, but this hardly put a dent in the used space.  Visible folders show nothing unusual.  There is both a Windows package and a Windows10Upgrade package, but the latter doesn't seem to be taking up excessive space.  Other than that there's just the Program Files and Program Files (x86), Users, and a small number of my own files that don't take up much room.  My only guess is that all of the upgrades left some sort of garbage behind (maybe copies of earlier Windows versions or something?), but I can't figure out where it's being stored or how to get rid of it.

How can I visualize which folders and files are taking up all of the space on my hard drive?  I'm getting some conflicting reports on the size of hard drive contents. Namely what is and isn't there and what folders are actually using the space.   I need to know which of the files or folders the culprits behind all this hidden bloat. Also there should be a print option to get it on paper.


I am using Ubuntu 11.04 Desktop and when I right click on a particular folder and select "Open With Other Application....", some of the applications are repeated multiple times. This is happening with more than one application. I was able to get rid of them from the "Edit Menu" option, but why does this happen and how to make sure it doesn't happen again?

The dialog box in question here is the one you get with the context menu option "open with other applications". Wine seems to have inserted more than a dozen or so entries for each application I install, which makes it a pain to find the correct application:     What can I do to remove the duplicates?     Update: Neither of the two solutions really work. The bug is interesting, but the symptoms does not match my problem (I'm not having problem with uninstalling applications, but rather the things that are inserted after installing them), and with the other one, all references to the Wine application are removed, which actually makes the problem worse (although it may be an acceptable solution if nothing else can be found). So this is still an open question; any takers?


Including me, I have noticed it many times, people tends to delete complete password field even if they miss single character.   Anyone know why users are tend to behave in such a way? Can we do something to change this sort of user experience?   Thanks in advance.

We login to applications almost every day. The password is stored in our fingers, as an automated process (if they have used it long enough). When users realize they have entered a wrong character (before hitting login-button) they erase the whole password, and retype the entire password – instead of just the last wrong character. Question is why?         – Wireframes created with


So sound is a wave and is basically just vibrations, an atom vibrates causing another next to it vibrate and so on until it finally reaches our ears to become sound.  If that's normally how waves behaves, what about light? I understand it's also a particle but something must have caused its starting point to influence its next point in space thereby allowing it to travel through space. what is the cause and effect relationship that allows light to propagate through space? I ruled out matter because most visible light is blocked by matter.

As I understand it, electromagnetic waves have two components which are the result of each other, i.e., when a moving electric charge creates a changing magnetic field at point X then a changing electric field is created at point Y and this repeating process is what creates EM waves, so therefore, it requires no medium. Is my understanding correct?  One thing that I'm surprised to know is that light is also called an electromagnetic wave.  Does this include light of any kind, for example: light from a bulb, a tube, and also from the Sun? How do they contain electric and magnetic fields?


in my app I get a String from RSS fedd item(tag description)and put it in a ListView but the String looks like this:    I try to remove the tag with this method but doesn't work:  private String refactor(String mess) {         int indexToRemove = mess.lastIndexOf("<strong>");         String toBeReplaced = mess;         if(indexToRemove >= 0 ){              toBeReplaced = mess.substring(0, indexToRemove);         }         int newIndex = toBeReplaced.lastIndexOf("</strong>");         String messFinal = toBeReplaced;         if(newIndex >= 0){             messFinal = toBeReplaced.substring(0, newIndex);         }         return messFinal;     }

Is there a good way to remove HTML from a Java string? A simple regex like replaceAll("\\<.*?>", "")   will work, but things like &amp; wont be converted correctly and non-HTML between the two angle brackets will be removed (i.e. the .*? in the regex will disappear).


I am to computing this limit:  $$\lim_{n\to+\infty}\int_{\mathbb{R}} \sin(nx)h(x) \,, dx$$ where $h(x)$ stays in $L^1(\mathbb{R})$.  Is it correct this method? I choose a sequence of functions $h_n(x)\in C_c^\infty$ which converges to $h$ in $L^1$ sense and I have   $$\int_{\mathbb{R}} \sin(nx)h_n(x) \, dx = \left.-\frac{\cos(nx)} n h_n(x)\right|_{-\infty}^{+\infty} + \int_{\mathbb{R}} \frac{\cos(nx)}{n}h_n'(x) \, dx$$  so  $$\left|\int_{\mathbb{R}} \sin(nx)h_n(x) \, dx\right|\le \frac Cn\to0.$$  In this way I have  $$\|\sin(nx)h(x)\|_{L^1}\le\| \sin(nx)h(x)-\sin(nx)h_n(x)\|_{L^1}+\| \sin(nx) h_n(x) \|_{L^1} \to 0$$

Ok, so one of the formulations of the Riemann-Lebesgue Lemma says: $$ f\in L^1(\mathbb{R}) \implies \hat{f}(\omega)\to 0\;\mbox{ when } \;|\omega|\to\infty.$$  I get all the steps of the proof, except the one which says that if $f$ is an arbitrary integrable function, it may be approximated in the $L^1$ norm by a compactly supported smooth function $g\in L^1$. My question is: Why? How do you know that for all $\epsilon>0$, and for all arbitrary function $f\in L^1$ exists a compactly supported smooth function $g$ so that $||f-g||_{L^1}<\epsilon$? The "proof" can be found in many places, but this step can be found in Wikipedia


i'm having this problem and been stucked on this for hours. Im fairly new here and hope you guys are able to assist. I thought the problem was with declaring the array or something but i cant seem to fix it. My idea was to split the codes into three different parts to construct, display and the main method but apparently along the way there was an error. private static void constructArray(Customer [] c){     c = new Customer[3];     ArrayList<ItemInfo> cust1 = new ArrayList<>();     cust1.add(new ItemInfo("Mutton", 1, 19.85));     cust1.add(new ItemInfo("Stationery",2,17.66));          ArrayList<ItemInfo> cust2 = new ArrayList<>();     cust2.add(new ItemInfo("Fishball",1,12.07));     cust2.add(new ItemInfo("T Bone Steak",3, 19.20));     cust2.add(new ItemInfo("Stationery", 2, 12.25));          ArrayList<ItemInfo> cust3 = new ArrayList<>();     cust3.add(new ItemInfo("Crab", 2, 14.08));          c[0] = new Customer(cust1, "cheque");     c[1] = new Customer(cust2, "cash");     c[2] = new CustomerPlus(cust3, "Paynow", true); }  private static void displayArray(Customer [] c){      c = new Customer[3];      for(Customer cust : c){         if(cust instanceof CustomerPlus){             CustomerPlus plus = (CustomerPlus) cust;             plus.addItem(new ItemInfo("Cigarette",2,12.96));             System.out.printf("Mode of payment:%s%nInvoice no:%04d%n%n", plus.getPaymentmode(), plus.getNumber());             System.out.printf("%s%19s%10s%13s%n","Item","Quantity","Price","Sub Total");             System.out.println(plus);             System.out.printf("Total payment: %.2f%n", plus.computePayment());             if(plus.getAdult())                System.out.println("Customer: adult");             System.out.println("-----------------------------------------");                         }          else{            System.out.printf("Mode of payment:%s%nInvoice no:%04d%n%n", cust.getPaymentmode(), cust.getNumber());            System.out.printf("%s%19s%10s%13s%n","Item","Quantity","Price","Sub Total");            System.out.println(cust);            System.out.printf("Total payment: %.2f%n", cust.computePayment());            System.out.println("-----------------------------------------");         }     }  }   public static void main(String[] args){     main m = new main();     Customer [] c = new Customer[3];     constructArray(c);     displayArray(c);               }

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?


We saw Stan Lee appear twice in Guardians 2; the first time is during the 700 hyperspace jumps, with one of the realms they speed through featuring Lee telling stories to a trio of Watchers (specifically when he was a FedEx agent in Captain America: Civil War.)  Now, it was revealed to us that Guardians 2 took place in 2014. However, Captain America: Civil War was released in 2016. We know that most MCU movies take place during real life present time. If this is the case for Civil War, is there any explanation for this?

Perhaps an overly pedantic observation, however, in the Guardians of the Galaxy cameo Stan Lee claims to have been a Fed-Ex man. This is presumably a reference to the Stan Lee cameo at the end of Captain America: Civil War. In which Stan Lee is a Federal Express man who (humorously) calls Tony Stark "Tony Stank".  However, Guardians of the Galaxy: Vol.2 is supposed to take place soon after the events of GOTG Vol.1, long before Civil War and thus before Stan Lee's character poses as a Fed-Ex man. So what's the deal here? Is time travel involved? Has Stan Lee been a Fed-Ex man twice?


I went to the market and then I went to the Cafe.     I went to a market and then I went a cafe      In the above sentences, what is the difference in nuance between them a market/a Cafe, and the market/the cafe?  My friend said "the market" has two meanings. One meaning is "shopping" and the other is the market building. Is it correct?  The other,  "a market" is just a market building. It means I went there for shopping or to meet someone etc. So, I just go to a building. Is it correct?   Is it the same with "I went to the Cafe or I went to a Cafe"?  Generally when you speak a stranger using words like "a market/cafe" or "the market/cafe" for the first time, from who's point of view do you speak, you or the stranger? Which article is appropriate, "a" or "the"?

I can’t for the life of me figure out where to use a and where to use the — and where there is no article at all. Is there a simple rule of thumb to memorize?   The standard rule you always hear:     “If a person knows which item you are talking about then use "the"   . . . doesn’t clear things up for me, as I have no idea whether or not they know.


Kindly explain me how to estimate poisson regression model using iterative weighted least square method. I know it can be easily estimated in any software like Stata, SAS, SPSS etc but I want to estimate it manually.  I am unable to understand the weight matrix (W) in the following iterative estimation equation: $$   b =(X^\mathrm{T}WX)^{-1}X^\mathrm{T}Wz   $$

Background:   I'm trying to follow .  I understand the basics of MLE estimation: likelihood, score, observed and expected Fisher information and the Fisher scoring technique. And I know how to justify .    The question:   I can't understand even the first line of this method :(   What's the intuition behind the $z_i$ working variables defined as:  $$ z_i = \hat\eta_i + (y_i -\hat\mu_i)\frac{d\eta_i}{d\mu_i}$$  Why are they used instead of $y_i$ to estimate $\beta$?   And what's their relation with the response/link function which is the connection between $\eta$ and $\mu$  If anyone has a simple explanation or can direct me to a more basic-level text about this I would be grateful.


Last week my Samsung Galaxy Fame broke, everything still works only the screen doesn't work anymore. It won't react if you touch it but it still works when you unlock it, so basically you can't do anything. Does anyone know how to restore my photo's to my PC, when I plug it into my computer it shows me that there aren't any files, but I have done it before and there should be files. Can anyone PLEASE HELP ME?!  THANKS A BUNCH

I just broke the screen of my (unrooted) Galaxy S.  How do I get back my SMS and contacts?   PS: I tried Kies but it won't detect my phone for some reason. (Kies works fine with another Galaxy I possess but not this one)


I'm trying to search online for the string toUri().  Valid result will be Java's   But when I search google it return mostly toURI results.  When I search I discover that .  How can I still ignore results of toURI? Searching "toUri()" - "toURI()" didn't help.

Is there any way to make a Google search case-sensitive?


I am writing a scheduling program using an algorithm. At the last stage of the algorithm I need to look into the timetable (the timetable which was created) to see if the student is already assigned to a class at that time.  Therefore, we have:  Current Class Start Time: (2017, 02, 09, 10, 00, 00) Current Class Finish Time: (2017, 02, 09, 11, 00, 00)   At this moment we will search into the timetable to see what other classes student A is assigned to:  For example, let's say on the same date they are already assigned to:  Class 'Z' Start Time: (2017, 02, 09, 09, 00, 00) Class 'Z' Finish Time: (2017, 02, 09, 12, 00, 00)   Now I want to find the time range of Class 'Z' and compare it with the time range of Current Class.  DateTime startClassZ = new DateTime(2017, 02, 09, 09, 00, 00); DateTime endClassZ = new DateTime(2017, 02, 09, 12, 00, 00);  DateTime StartCurrent = new DateTime(2017, 02, 09, 10, 00, 00); DateTime StartCurrent = new DateTime(2017, 02, 09, 11, 00, 00);  if (They do not clash) {    Assign } if (Clash) {    Select Another Student }   Could anyone please help me with my 'IF statements' and also how to solve this problem.  The way that I am thinking of it, there are three possibilities:   If 'current class' (Start and end time) lands in between 'Class Z' (Clash 1) If the 'start time' of 'current class' lands in between 'Class Z' (Clash 2) If the 'end time' of 'current class' lands in between 'Class Z' (Clash 3)   Thank You

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


If $\mu$ is an ordinal, how can we formalize that  $$   \sum_{\lambda<\mu}x_{\lambda}=z $$  When $\mu=\omega$, this is just the usual infinite series, the partial sums converge to $z$.  What is the definition for higher ordinals?   I don't think this is quite the same as an uncountable sum, it is a sum over an well-ordered index. We can define it as a limit points of finite sums, but I was wondering whether there is a "better" (possibly equivalent) definition that takes advantage of the extra structure (well-oredring of the index). I suspect this will make sense only if countably many elements are non-zero.   As for the context, I guess the most general one could be that of topological vector spaces, so that we have the vector operations and limits.

Obviously, “most” of the terms must cancel out with opposite algebraic sign.  You can contrive examples such as the sum of the members of R being 0, but does an uncountable sum, with a finite sum, ever occur naturally as part of a larger scenario (eg, proof of a theorem, or preparation for a definition)?


In gcc every command line arguments have one dash. In some other tools, options that are not a single character have a two dashes prefix.   Why is there two standards, which one is the most common?  Examples:   gcc -MF deps.d -c foo.c -o foo.o # Single dash gcc -dumpspecs                   # Single dash gcc --sysroot=dir                # Double dashes grep --recursive --only-matching foo bar # Double dashes

I was wondering why is it that some programs requires their command prompt parameters to have two dashes in front whereas some (most) only require one dash in front?  For example most programs look like this: relaxer -dtd toc.xml toc_gr.xml toc_jp.xml  Whereas some programs look like this: xmllint --valid toc.xml --noout  What's the reason that some requires two dashes instead of one? Doesn't it make sense for everyone to stick to one standard (i.e. a single dash will do).


I have these two commands that I need to manually run every time after login:  autossh -M 2000 -N -f -q -D 127.0.0.1:7070 user@domain.com   and  sudo mkdir /media/C sudo mount /dev/sda2 /media/C   I'd like to make them automatically run every time I boot and login to my computer. I'm currently using 10.04LTS.  BTW, I only vaguely know what init.d or runlevel mean. But I still prefer to know a command-line based way to achieve this, not a fancy GUI way. Also, the autossh will only succeed after Ubuntu automatically detect and connect to my network, so should we let it retry infinitely until successfully executed?  Thank you!

How can I make an application automatically start when I have logged in?


I want to glob every hidden file and directory, but not the current (.) and parent directory (..).  I am using bash.  Observe current behaviour:  $ ls -a .  ..  ...a  ...aa  ..a  ..aa  .a  .aa  .aaa  a $ echo * a $ echo .* . .. ...a ...aa ..a ..aa .a .aa .aaa   I would like .* to behave like this  $ echo .* ...a ...aa ..a ..aa .a .aa .aaa   There is the shell option dotglob  $ shopt -s dotglob   that works in a way; now I can use * to glob everything (hidden or not) but not . and ..  $ echo * ...a ...aa ..a ..aa .a .aa .aaa a   but now I can't differentiate between hidden or not. Also, .* still globs . and ..  $ echo .* . .. ...a ...aa ..a ..aa .a .aa .aaa   Is there a way to make .* not expand to . and ..?

How do I move all files in a directory (including the hidden ones) to another directory?  For example, if I have a folder "Foo" with the files ".hidden" and "notHidden" inside, how do I move both files to a directory named "Bar"?  The following does not work, as the ".hidden" file stays in "Foo".  mv Foo/* Bar/   Try it yourself.  mkdir Foo mkdir Bar touch Foo/.hidden touch Foo/notHidden mv Foo/* Bar/


Was thinking about changing phone to an Iphone because my android is too slow for the game. Was wondering if i could still use my goodle account for android on my Iphone?   Thanks

I was having trouble playing the game on my android so I downloaded it to my wife's phone (Galaxy S6). I read some posts on how to get it running on my android and it worked but, my level 7 account is on my wife's phone.  How do I get it back to my android? When I sign out and back in it doesn't ask for any sign in info. I've tried deleting the app's data and even uninstalling and re-installing, but it still doesn't ask for sign-in info.


I tried to run a basic C++ file on terminal:  #include <iostream> using namespace std; int main() {     cont << "This is my first C++ program!";     return 0 }   and then tried to run it in terminal:  Kawika-and-Chloe-Boss:~ kawikaandchloe$ make learningCPP.cpp make: *** No rule to make target `learningCPP.cpp'.  Stop.   and tried:  Kawika-and-Chloe-Boss:~ kawikaandchloe$ make learningCPP make: *** No rule to make target `learningCPP'.  Stop.   and tried:  Kawika-and-Chloe-Boss:~ kawikaandchloe$ gcc learningCPP.cpp -o learningCPP.out clang: error: no such file or directory: 'learningCPP.cpp' clang: error: no input files   Here is the entire bash/clang file:  Last login: Mon May 25 07:49:21 on console Kawika-and-Chloe-Boss:~ kawikaandchloe$ make learningCPP.cpp make: *** No rule to make target `learningCPP.cpp'.  Stop. Kawika-and-Chloe-Boss:~ kawikaandchloe$ make learningCPP make: *** No rule to make target `learningCPP'.  Stop. Kawika-and-Chloe-Boss:~ kawikaandchloe$ gcc learningCPP.cpp -o learningCPP.out clang: error: no such file or directory: 'learningCPP.cpp' clang: error: no input files Kawika-and-Chloe-Boss:~ kawikaandchloe$ $ g++ -o lab21 learningCPP.cpp -bash: $: command not found Kawika-and-Chloe-Boss:~ kawikaandchloe$ $ ./lab21 -bash: $: command not found Kawika-and-Chloe-Boss:~ kawikaandchloe$ ./learningCPP.cpp -bash: ./learningCPP.cpp: No such file or directory Kawika-and-Chloe-Boss:~ kawikaandchloe$ ./main -bash: ./main: No such file or directory Kawika-and-Chloe-Boss:~ kawikaandchloe$ $ g++ -o main learningCPP.cpp -bash: $: command not found Kawika-and-Chloe-Boss:~ kawikaandchloe$ cpp make learningCPP.cpp run     asdklajdl;jaksld  sadddasdfasddas df  dsa f dsa   Can you help?

How can I compile/run C or C++ in Unix console or a Mac terminal?  (I know it, forget it, and relearn it again. Time to write it down.)


public void rentMovie(){            System.out.println("ENter a customer ID: ");            int ID =In.nextInt();            System.out.print("Enter a movie: ");            String name=In.nextInt();            for(Customer customer:customers){            Optional<Movie> movie = catalogue.getMoviesAvailable().stream().filter(b -> b.getTitle().equals(movieName)).findFirst();            if(movie.isPresent()) {               catalogue.getMoviesAvailable().remove(movie.get());               catalogue.getMoviesRented().add(movie.get());               customer.getCurrentlyRented().add(movie);                customer.getRentingHistory().add(movie.get());           }       }}   When I run this code I get a null pointer exception on customer.getCurrentlyRented().add(movie);  and on  customer.getRentingHistory().add(movie.get());  Can you tell me how to rectify this problem?  Customer Class  public class customer{      private List<Movie> currentlyRented;      private List<Movie> rentingHistory;    public Customer(){      }     }   Catalogue Class  public class Catalogue{     private List<Movie> moviesAvailable;     private List<Movie> moviesRented;       public Catalogue(){       moviesAvailable.add(new Movie("Matrix",1999,new Genre("SciFi"),3));       moviesAvailable.add(new Movie("Jurassic Park",1993, new Genre("SciFi"),4));       }      }   While renting a movie it should also update the currently renting and renting history also on the rent movie class.

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?


This is an old flash disk that I have not used in a while. It was a small drive I was planning to use for TinyCore Linux. I plug it in, and it does not show up in KDE Partition Manager. I query lsblk, lsusb and  usb-devices in bash (Ubuntu 20.04.2)  twice each , once with and once without it plugged in. I manage to find that it mounts at /dev/sdc , so i proceed to do a sudo fdisk /dev/sdc , but get fdisk: cannot open /dev/sdc: Read-only file system . Alright, I do sudo hdparm -r0 /dev/sdc and get : /dev/sdc:  setting readonly to 0 (off)  readonly      =  0 (off)  Which appears to state that I've been successful in changing the readonly variable to False ? Also, KDE Partition Manager now sees it but says No valid partition table was found on this device. But any attempts at formatting result in immediate There were errors while applying operations. Aborted. with the dialog box below displaying : Create a new partition table (type: msdos) on ‘/dev/sdc’  Job: Create new partition table on device ‘/dev/sdc’  Command: sfdisk /dev/sdc  Create new partition table on device ‘/dev/sdc’: Error Create a new partition table (type: msdos) on ‘/dev/sdc’: Error  Calling fdisk on /dev/sdc still gives the same read-only error message. Sigh. I thus conclude something has gone wrong with the drive , perhaps it's days of being written to are over. Okay, so does it have any data on it , since it can be read ? I run  on it (hexdump should yield similar results) and I get an endless stream of 0s until I decide to   ^C and kill the program. Any idea what could have happened and if there's anything else that can be tried to recover or revive it ? Or is it dead, as I presumed ?  EDIT : On Ubuntu , just as on macOS and Windows 7 machines that I tried on, this 2 Gib drive seems to show up as a 7.5 Gib drive. Is this normal or does it indicate some low-level error that can be undone to revive this disk ? EDIT 2: I attempted reformatting/erasing on Windows 7 SP1 as well as macOS 11.1 's DiskUtility. Of course, it failed, with Windows also saying it was "read-only". EDIT 3: Sadly , @Tetsujin suggested and perhaps got this question closed because apparently they found it similar to  . Untrue. A sincere reading of the question in full is enough to indicate that the reality is quite to the contrary. Here is how : I have tried the usual methods and the hypothesis presented in those answers and that does not check out here. "inserting the drive into another computer" does not work, as mentioned in edits 1 & 2. "This behavior is typical of flash drive controllers when they detect ... too many bad blocks" and "any data on the drive is still accessible" - well, all bytes are 0 , as scanning the device reveals, and "overriding this" does nothing. "Ensure ... "Write-Protect Switch" is not locked" There is no such thing. "low-level format tools may help" - nope.

When I plug in my USB flash drive, it shows up on my computer as write-protected or read-only. I am unable to transfer data to it, nor can I modify or delete any files already stored on it. I also cannot repartition or reformat the drive using Windows Disk Management, DiskPart, GParted, or other tools. The drive does not have a write-protect switch.  Why did this happen and what can I do about it? Is there a way to remove the write protection?  (Note that this can happen with some memory cards, too, as they often use controllers similar to those used in flash drives. In some cases, the system may report that the drive or card was formatted successfully even though it was never actually formatted; the original data reappears when the device is reinserted.)     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this problem. Feel free to edit the answer to add additional details.


I'm a Naruto fan, not really a One Piece fan. I want to start watching it, but I don't have any time to do a marathon.  Just a little summary would be nice.

I got into anime from watching Death Note; then moved on to My Hero Academia, during the hiatus between season 3 & 4, I'm looking for an anime to watch. I heard about One Piece from a friend; all I know about it so far are devil fruits(sort of?), but can anyone give me a short simple explanation on the show and its lore. Thanks!