$X$ and $X\times X$ has the same cardinal, if $X$ is inifinite.  How to show it?  give a suggestion. Do we have some easier method?

Is the cardinality of the Cartesian product of two equinumerous infinite sets the same as the cardinality of any one of the sets? I couldn't find this explicitly stated in any handout or text. This certainly seems to be true from the examples I have seen:  The Cartesian product of two infinitely countable sets is again infinitely countable. The Cartesian product of two sets with cardinality of continuum again has cardinality of continuum.


I'm reading a online book titled Mathematical Statistics Old School which can be found .  In the section about the Dirichlet Distribution (which begins on page 63 if you would like to look) it says to let  $X_1, \ldots, X_K$ be independent random variables, where $X_k \sim Gamma(\alpha_k, 1)$.  Then the $K-1$ vector $\underline{Y}$ defined by  $$Y_k = \frac{X_k}{X_1 + \cdots + X_K} , k = 1,\ldots, K-1$$ has a Dirichlet distribution. So $\underline{Y} \sim Dirichlet(\alpha_1, \ldots, \alpha_K)$. It is noted that $Y_1 + \cdots +Y_K = 1$.   The text says the following two things, which I am having trouble understanding:        The marginals $Y_k \sim Beta(\alpha_k, 1- \alpha_k)$   If $X_k \sim Gamma(\alpha_k, \lambda)$, then the definition is the same.      For my first issue, I thought it would be that $$Y_k \sim Beta(\alpha_k, \sum_{i\neq k} \alpha_i)$$ because if $X_1 \sim Gamma(\alpha_1, \lambda)$ and $X_2 \sim Gamma(\alpha_2, \lambda)$ then $$\frac{X_1}{X_1 + X_2} \sim Beta(\alpha_1, \alpha_2).$$  I think clearing this issue up would help me see that if $X_k \sim Gamma(\alpha_k, \lambda)$, then the definition is the same.   EDIT Jan 24 '17: I'm not really sure how my question is a duplication of . But I am glad it was pointed out . As pointed out by Xi'an in the comments, my confusion is due to a typo in the text I am reading.   I think it would be more accurate to mark this question as answered instead of as duplicate.

Imagine that  $$ X_1,\dots,X_k \sim \mathrm{Dirichlet}(\alpha_1,\dots,\alpha_k) $$  Since $x_i \in (0,1)$ for all $x_i$ and $\sum_{i=1}^k x_i = 1$, then $x_i$'s follow the first two axioms of probability and Dirichlet can be (and is) used as "distribution over distributions". Intuitively it should follow that  $$ X_1,\dots,X_{k-2},X_{k-1}+X_k \sim \mathrm{Dirichlet}(\alpha_1,\dots,\alpha_{k-2}, \alpha_{k-1}+\alpha_k) $$  since the properties of $x_i$'s would not change and the total "mass" of $\alpha_i$'s would not change.  But it's probability density function is  $$ f(x_1,\dots,x_k) \propto \prod_{i=1}^k x_i^{\alpha_i - 1}$$  and  $$ x_{k-1}^{\alpha_{k-1} - 1} \times x_k^{\alpha_k - 1} \ne (x_{k-1} + x_k)^{\alpha_{k-1} + \alpha_k - 1} $$  So merging of random variables in Dirichlet distribution does not seem lead to Dirichlet distribution over $k-1$ variables. What does it lead to?


Does anyone knows why I cannot remove the letter B in the list?  Steps to reproduce:   click on "Add to list" button letter B is added to the list click on letter B in the list to remove letter B is not removed from list click on letter C or A letter C or A is removed from list   HTML:   <button id="add">Add to list</button>

A

A

A

   Jquery:   $(document).ready(function(){      $("ol").append("
C</li");      $("#add").click(function(){         $("ol").append("
B
");     });      $("li").on("click",function(){         $(this).remove();     }); });   Here you have the sample in the .  Best regards.

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


If I want to reach native Japanese speakers, which slug is better; 1/ english-dictionary.com 2/ 英語の辞書.com  There are several questions on this but none seem to give a clear answer.

I'm currently building a website that is not targeted to an English speaking audience. So my thoughts are that if I were to make the URLs in the language of choice (in this case Spanish) then would this help or hinder my SEO for the website? Is it always better to have english URL paths for getting picked up by search engines?


double d = 4.321562;   Is there an easy way to extract the 0.321562 on it's own from d? I tried looking in the math class but no luck. If this can be done without converting to string or casting to anything else, even better.

How do I get whole and fractional parts from double in JSP/Java ? If the value is 3.25 then I want to get fractional =.25, whole = 3  How can we do this in Java?


For a long time I was a user of Windows 10, but recently installed second OS - Ubuntu 18.04   For me, the best way to switch language is Ctrl+Shift, so I'd like to stay with it on both systems.  The problem I noticed is that on Windows language switches after shortcut keys are released, while on Ubuntu after shortcut keys are pressed. So when I want to use another shortcut (e.g. anonymous window in chrome - Ctrl+Shift+N) - on Windows it successfully opens, but on Ubuntu - doesn't, because after pressing first two keys of shortcuts it simply changes language  Is there any way to change shortcuts activation behaviour, so it changes language when shortcut is released, but not pressed?   Or maybe there is some other way to resolve this problem?

Can I use Ctrl+Shift for changing languages? I can't set this hotkey for changing keyboard languages.  At this moment Alt+Shift switch languages, but I can't see this hotkey in keyboard hotkeys list or in   gsettings list-recursively  org.gnome.desktop.wm.keybindings | sort | more   output.


How do I determine the type parameter of a generic method dynamically if I have the Type object.  For example -   Type typeObject = dataTable.Columns[columnName].DataType; List<typeObject> values = dataTable.SampleMethod<typeObject>(param1, param2);   How do I achieve this?

What's the best way to call a generic method when the type parameter isn't known at compile time, but instead is obtained dynamically at runtime?  Consider the following sample code - inside the Example() method, what's the most concise way to invoke GenericMethod<T>() using the Type stored in the myType variable?  public class Sample {     public void Example(string typeName)     {         Type myType = FindType(typeName);          // What goes here to call GenericMethod<T>()?         GenericMethod<myType>(); // This doesn't work          // What changes to call StaticMethod<T>()?         Sample.StaticMethod<myType>(); // This also doesn't work     }      public void GenericMethod<T>()     {         // ...     }      public static void StaticMethod<T>()     {         //...     } }


If $X=\{x_n\}, Y = \{y_n\}$ be bounded sequences of real numbers. Then, if $x_n \leq y_n~\forall~n$, then show that $\lim \inf (x_n) \leq \lim \inf(y_n)$ and $\lim \sup (x_n) \leq \lim \sup (y_n)$  Attempt: $\lim \inf (x_n)$ represents the least limit point in $X$ and $\lim \inf(y_n)$ represents the least limit point of $Y$.  Given that,  $~\forall~m, x_m \leq y_m, $  I am still not able to see any compulsion why the least limit point of $x_n$ should be less than the least limit point of $y_n$.  That is, for each index $m, x_m \leq y_m$. But, that doesn't place any restriction on the least limit point of $x_n$ becoming greater than the least limit point of $y_n$?  Where could I be going wrong?   Thank you for your help.

Can anyone prove this question? I tried but I didn't get any I idea, so I hope someone can solve it.     Let $X_n\leq Y_n$ for each $n\in \Bbb N$. Show that $\liminf X_n \leq \liminf Y_n$ and $\limsup X_n \leq \limsup Y_n$.   Please prove this question - thanks.  The definition I have:     Let $X_n$ be a sequence in real number and let $$E=\{x\in \Bbb R^\sharp:(X_{n_k}) \rightarrow x \text{ for some subsequence }(X_{n_k})\text{ of }(X_n)\}$$ for all $n \in \Bbb N$ and $k$ from $1$ to $\infty$. Then by definition $\lim\sup X_n = \sup E$ and $\lim\inf X_n = \inf E$.


I've declared a string with two newlines inside of string     somestring=$'\n##### Branch FREEZE enable/disable\nRelease:'   I have a $file with a text inside like this  ###############################  ##### Branch RELEASE enable/disable Release: disable  ##### Branch FREEZE enable/disable Freeze: disable  ##### Mail list #####   I am trying to figure out, if there is a string inside with both of the newlines with a command     if grep -q "$somestring" "$file"; then   echo "found the string"   But the result is always positive, when there is a newline inside of string.  How can I make it work correct with newlines inside?

I needed to find all the files that contained a specific string pattern. The first solution that comes to mind is using find piped with xargs grep:  find . -iname '*.py' | xargs grep -e 'YOUR_PATTERN'   But if I need to find patterns that spans on more than one line, I'm stuck because vanilla grep can't find multiline patterns.


I want to create a text file which will add each command I am going to run on the terminal as a new line entry in the text file. i.e., I need to keep a record of what are the things I'm doing in the terminal. Further if I can keep a record of outputs I'm getting in the terminal, along with the inputs in the terminal, as a text file, it will be much better.   Each time I forget a command I have to search again in the Internet for the command.  Can I can make a file like above?

How can I run sudo apt-get install by BOTH seeing the process of installation (long in my case) and saving its output into a text file ?


Hello guys I'm havin some troubles with a a little program, I hope you can help me. The issue is that when I make a click in a div it suppose to add and other in the other box div, and it words fine but the problem is when I'm trying to get the index of those divs added it iterate over the all divs each time.  <!DOCTYPE html>                <meta charset="UTF-8">         <title>Document</title>

uno

dos

tres

          This is the result when I click in them, it iterate each time    If I add directly in the console it words fine.  $('.dentro_contenedorb').click(function(){     console.log( $(this).index() ) }


I am a newbie to ubuntu and trying to compile and run C++ programs in Ubuntu terminal and in CodeBlocks (Ubuntu 14.04). I get the permission denied error when executing. I understand that the file/folder permissions are the issue here. I tried using chmod to allow executable permission to my cpp folder, which is a folder in one of my my windows partitions (win 7, dual booting).   chmod -R 777 /media/sandun/Data/cpp/   It doesn't give an error but not working. I searched more and more and found that I should mount the partition in ubuntu which is given in the link below.  I didn't try that yet. I am wondering whether it will work or effect the file system on windows partition. Or is there any other alternative? Thanks a lot.

I have a script that I need to execute on an NTFS partition. The script's permission is set to 600.  I attempted to modify the permissions by running chmod 755 script.sh, which doesn't report a failure or anything - but it also doesn't change the permissions on the file:  $ stat script.sh    File: `script.sh'   Size: 297070      Blocks: 584        IO Block: 4096   regular file Device: 811h/2065d  Inode: 35515       Links: 1 Access: (0600/-rw-------)  Uid: ( 1000/  xxxxxx)   Gid: ( 1000/  xxxxxx) Access: 2010-09-30 14:05:16.041621000 -0700 Modify: 2010-09-30 14:05:05.070157000 -0700 Change: 2010-09-30 14:05:05.070475000 -0700  $ chmod 755 script.sh $ stat script.sh    File: `script.sh'   Size: 297070      Blocks: 584        IO Block: 4096   regular file Device: 811h/2065d  Inode: 35515       Links: 1 Access: (0600/-rw-------)  Uid: ( 1000/  xxxxxx)   Gid: ( 1000/  xxxxxx) Access: 2010-09-30 14:05:16.041621000 -0700 Modify: 2010-09-30 14:05:05.070157000 -0700 Change: 2010-09-30 14:05:05.070475000 -0700   As you can see, it remains unchanged.


I suppose 'the number of' is followed by a singular, but what about the following sentence where they are two subjects:  Both the number of entries and exits is/are high.

Possible Duplicate:          From the grammatical view both are correct, but please explain the difference in meaning:   The number of students in the class is fifteen. A number of students were late for class.


So, whenever I try to update repos recently (via apt-get), I get something like this:  Reading package lists... Error! W: GPG error: http://ppa.launchpad.net trusty Release: The following signatures were invalid: BADSIG 6AF0E1940624A220 Launchpad PPA for TualatriX W: GPG error: http://ppa.launchpad.net trusty Release: The following signatures were invalid: BADSIG 5A9A06AEF9CB8DB0 Launchpad PPA for Ubuntu Wine Team E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/ppa.launchpad.net_libreoffice_libreoffice-4-3_ubuntu_dists_trusty_main_i18n_Translation-en%5fUS E: The package lists or status file could not be parsed or opened.   When I disable all the ppas, these errors disappeared. Is this a problem with the launchpad servers or is the problem within my configuration or something? I'm running Ubuntu 14.04.

The computer gave me this output in a window:  E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_natty_main_binary-i386_Packages E: The package lists or status file could not be parsed or opened.   How can I fix this?


I'm using Ubuntu 16.04 LTS. I'm a beginner. I installed a lot of Software(Applications, Programs).  I want to Install the same Ubuntu on another computer with the same settings as this one.

I would like to customize Ubuntu live CD by installing some additional packages. I have followed   but it doesn't seems to work. Can anyone provide clear instructions?   Note: I do not prefer Remastersys, manual way will be appreciated.  Customization  Packages that I want to install:   Thunderbird    Samba    SSH       Changes that I need:   Remove Games menu from the Application menu Firefox shortcut on Desktop Radiance as the default Theme Different default Ubuntu Wallpaper   Configuration file changes   I want the panel to be placed at the bottom I want to paste my Samba configuration file instead of default Samba configuration I have few Firefox shortcuts and folders I would like to show that in Desktop Also it will be nice if you say me how to change the icon sets   Recent Updates   I have customized Ubuntu 10.10 with Firefox shortcuts and few folders on desktops. Everything went smooth. But the installer gets crashes after choosing the timezone. How do i fix this issue? Also setting wallpaper affects the login screen. The wallpaper which i set is displayed on the login screen also. I just want the default one for the login screen.


I have a computer using Ubuntu 14.04 LTS with the ASUS Nvidia gt440 graphics card and a vga monitor that is supported with the resolution of 1280 X 800.   However, in the display options I could not find 1280 X 800 and all the other options are either causing screen to flicker or just lower resolution.  Is there a way to add a custom resolution in the display settings?

I tried to use xrandr to set 1680x1050 as a new mode to VGA output, but it says:  sudo xrandr --addmode VGA-0 1680 X Error of failed request:  BadMatch (invalid parameter attributes) Major opcode of failed request:  140 (RANDR) Minor opcode of failed request:  18 (RRAddOutputMode) Serial number of failed request:  35 Current serial number in output stream:  36


#!/bin/bash  awk 'NR!~/^(1|$q+2|$q+3)$/' deltay.txt > yota.txt   q is an integer obtain from a previous process in the script, and I need to erase lines one, the q+2 an q+3, but that command just erases lines 1...  How to do it? PS: I've tried with sed -e, but seems I don't own that command

Having the following in one of my shell functions:  function _process () {   awk -v l="$line" '   BEGIN {p=0}   /'"$1"'/ {p=1}   END{ if(p) print l >> "outfile.txt" }   ' }   , so when called as _process $arg, $arg gets passed as $1, and used as a search pattern. It works this way, because shell expands $1 in place of awk pattern! Also l can be used inside awk program, being declared with -v l="$line". All fine.  Is it possible in same manner give pattern to search as a variable?  Following will not work,  awk -v l="$line" -v search="$pattern" '   BEGIN {p=0}   /search/ {p=1}   END{ if(p) print l >> "outfile.txt" }   '   ,as awk will not interpret /search/ as a variable, but instead literally.


$$\lim_{n\to\infty}\sum_{k=1}^n \frac{n}{n^2+k^2}$$  I tried this using powerseries just putting as $x=1$ there ,even tried thinking subtracting $s_{n+1} - s_{n}$ would be of some help, also I thought of writing the denominator as product of two complex numbers and then doing the partial fractions but it did not help. Any method guys?  Thanks in advance for guiding to think about these kind of problems.

Show that $$\lim_{n \to \infty} \sum\limits_{k=1}^n \frac{n}{n^2+k^2} = \frac{\pi}{4}.$$  I am familiar with Taylor series and Fourier series of the standard functions. I tried to compare with those and see if there is a relation, I don't seen to find any. How do I tackle this?


I know sometimes a comma is used after the parenthesis, sometimes it's used before the parenthesis, and sometimes no comma used at all. What I don't understand is how to know when to use which. If someone could explain, with example sentences, I'd very much appreciate it.

Are there cases where a period is placed inside parentheses? In which cases the period (or a comma) should be placed inside the parentheses?


In the film 'Harry Potter and the Deathly Hallows II' we don't see Harry buy himself a new wand after the war, nor do we see him using the Elder Wand to repair his old wand (as he did in the novel).  What, if anything happened with Draco's wand? Did Harry continue to use Draco's wand from then on?

At the end of the seventh book, Harry Potter and the Deathly Hallows, Harry uses the Elder Wand to repair his own broken wand.     ‘I know it’s powerful,’ said Harry wearily. ‘But I was happier with mine. So ...’   [...] He laid the broken wand upon the Headmaster’s desk, touched it with the very tip of the Elder Wand and said, ‘Reparo.’   As his wand resealed, red sparks flew out of its end. Harry knew that he had succeeded. He picked up the holly and Phoenix wand, and felt a sudden warmth in his fingers, as though wand and hand were rejoicing at their reunion.   In the movie, Hermione presumably disposed of Harry's wand after revealing that his wand was broken, after Harry said It's done. At the end of Deathly Hallows Part 2, Harry simply destroys the Elder Wand, with no mention made of his old one.  Was there any explanation for the change in the ending (of Harry's wand)?


Whenever my figure or table has to move to the next page it is placed exactly at the center of the page, and thus occupies the whole page by itself. I tried all the combination in:  \begin{figure}[htb]   having failed, I tried this one  \usepackage{float}  .  .   \begin{figure}[H]   This kind of work, but again whenever the figure has to be placed on the next page, the previous page has white spaces between the section heading and the paragraphs before and after.  I'm exhausted of plans now. any help?  EDIT  Example:  \documentclass[11pt,a4paper,twoside,openany]{book}   \usepackage[latin1]{inputenc} \usepackage[english]{babel} \usepackage[demo]{graphicx}  % privides the H option \usepackage{float}  % produces random text for testing \usepackage{blindtext}  \begin{document}  \blindtext[2]  \begin{figure}[H] \centering \includegraphics[width=0.8\textwidth,height=50mm]{} \caption{Test Test Test} \end{figure}  \blindtext[2]  \begin{figure}[H] \centering \includegraphics[width=0.8\textwidth,height=50mm]{} \caption{Test Test Test} \end{figure}  \blindtext[2]  \begin{figure}[H] \centering \includegraphics[width=0.8\textwidth,height=50mm]{} \caption{Test Test Test} \end{figure}  \blindtext[2]  \begin{figure}[H] \centering \includegraphics[width=0.8\textwidth,height=50mm]{} \caption{Test Test Test} \end{figure}  \blindtext[2]  \end{document}   and this is what I get on page 2:

I have a figure in my paper (I am using IEEEtran package). After this figure there exists a space between the figure and the text. How can I reduce the size of this white space. To be specific the space is between the caption of the figure and the text of my paper. Any suggestions?


I was trying to compare a user input with a predefined string. But it did not show my expected result. Here is the code   import java.util.Scanner; public class StringMatching {      public static void main(String[] args) {         Scanner scannerObj=new Scanner(System.in);         String userinput=scannerObj.nextLine();             System.out.println(userinput);          System.out.println(userinput);         if(userinput=="yes")         {             System.out.println("Yes! Working..");         }         else         {             System.out.println("Not Working..");         }       } }     The output of this program shows Not Working. I don't know what I missed here. Looking for your kind support. Regards

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


I've been working through an exercise in Lee's Smooth Manifold. The author ask us to show that the space $\bar{\mathbb{R}}_+^n := [0,\infty)^n$ is homeomorphic to upper half-space $\mathbb{H}^n := \mathbb{R}^{n-1}\times[0,\infty)$, both equiped with the usual topology.  I managed to construct a homeomorphism $f : \bar{\mathbb{R}}_+^2 \to \mathbb{H}^2$ defined by restriction of the map $f(z) = z \, e^{i\theta} = r \, e^{i2\theta}$ to $\bar{\mathbb{R}}_+^2=[0,\infty) \times [0,\infty) \subset \mathbb{R}^2 \approx \mathbb{C}$. Alternatively, a more pleasing  the map like $f(z) = z^2$. So we have $$ \mathbb{H}^2\approx \bar{\mathbb{R}}^2_+.  $$ To proceed i tried for $n=3$ case but it's messy. After a while i came up with this induction: Suppose that $\mathbb{H}^n\approx \bar{\mathbb{R}}^n_+$ for all dimension less than or equal to $n$. Clearly this hold for $n=1$. By definition of upper half-space, \begin{align} \bar{\mathbb{R}}^{n+1}_+ = \bar{\mathbb{R}}^{n}_+ \times \bar{\mathbb{R}}_+ &\approx \mathbb{H}^n \times \bar{\mathbb{R}}_+ = \mathbb{R}^{n-1} \times \bar{\mathbb{R}}_+ \times \bar{\mathbb{R}}_+  \\ &\approx \mathbb{R}^{n-1} \times \mathbb{H}^2 = \mathbb{R}^{n-1} \times \mathbb{R} \times  \bar{\mathbb{R}}_+ = \mathbb{R}^n \times \bar{\mathbb{R}}_+ = \mathbb{H}^{n+1}. \end{align} In the argument above i use the following result : if $A \approx B$ then $A \times C \approx B \times C$, which i think can be done by set $f : A \times C \to B \times C$ to be $f(a,c) = (\varphi(a),c)$, where $\varphi$ is a homeomorphism between $A$ and $B$.     Is this proof correct ? Is there any other (correct) proof for this ? I tried to googling it but i found nothing. If possible, can anyone give me references for manifold with corner ? Thank you.

Let $\mathbb{H}^n = \{(x^1, \dots , x^n) \in \mathbb{R}^n : x^n \ge 0\}$, and $\overline{\mathbb{R}}^n_+ = \{(x^1, \dots , x^n) \in \mathbb{R}^n : x^1 \ge 0, \dots, x^n \ge 0\}$. Endow each set with the subspace topology it inherits from $\mathbb{R}^n$.  Exercise 16.18 on page 415 of Lee's Introduction to Smooth Manifolds (2nd edition) asks us to show that $\mathbb{H}^n$ and $\overline{\mathbb{R}}^n_+$ are homeomorphic.   However, it seems to me the spaces are not homeomorphic, as shown by the following argument.  Suppose $f:  \overline{\mathbb{R}}^n_+ \to \mathbb{H}^n$ is a homeomorphism. Set $f(0, \dots , 0) = (a^1, \dots, a^n)$. Then   $$A = f(\overline{\mathbb{R}}^n_+ \setminus \{(0, \dots, 0)\}) = f((\infty,0) \times \cdots \times (\infty,0)) = \\  ((\infty, a^1) \cup (a^1, - \infty)) \times \cdots \times ((\infty, a^n) \cup (a^n, 0]),$$ where, if $a^n= 0$, then in the last factor we discard $(a^n, 0]$.  The set $A$ is connected as it is the continuous image of the connected set $(\infty, 0) \times (\infty,0)$. But at the same time we see that $A$ is disconnected as it is the union of the disjoint relatively open sets  $(\infty, a^1) \times \cdots \times (\infty, a^n)$ and $ (a^1, - \infty) \times \cdots \times (a^n, 0]$ (or $(\infty, a^1) \times \cdots \times (\infty, 0)$ and $(a^1, - \infty) \times \cdots \times (\infty, 0)$ in case $a^n = 0$).   Is there a  mistake in my argument or something I am missing? Any comments are greatly appreciated.


I have downloaded a  program in order to take pictures with my webcam.   After installation I clicked its icon to start then it opened 'Open With...' dialog to select which program to be used to run it.   I thought that it was a Java program, so it (maybe) want me to show java.exe path to work.   Then I associated YawCam.exe to work with java.exe. What I did not notice "Alway use the selected program to open this kind of file" was checked.   Suddenly the icons of all my program shortcuts and start menu items changed to java's cup icon.  I have read a question similar to mine at   It sounds a good choice. But if try to run cmd command via 'Run...' dialog, Windows tries to open cmd.exe with java.exe  I also have tried to turn back to a checkpoint with system restore. Again I have encountered the same problem with cmd.exe  I have a solution in my head that creating a new account and continuing my work. But I will do that if I feel helpless.  I have tried what suggested at  but did not work. After restart, background programs (like dropbox) did not started either.

After (hopefully) scrubbing viruses out of a Windows 7 installation (after deciding not to simply run over the laptop repeatedly with my car), I've got everything almost back to normal. The only lingering issue I have is that for my non-admin users, the ".exe" file extension doesn't work. That is, clicking on the various desktop application links results in a "How do you want to open this?" dialog.  I've been through the alleged registry fixing from "winhelponline" and that had absolutely no effect.  I've tried running "assoc" for the affected users, but it reports the .exe association to be "exefile" even though it persistently does not work.  Right-clicking on a desktop icon and then choosing "start" does successfully open an application, but that's clearly a terrible situation.  For my admin user, things seem to work fine.  What do I need to do to get things working?


I have developed a stand alone Java Application which contains the following.   MySQL Installation Java Application code Tables and stored procedures Batch files VB Script files   I am planning to generate an Executable file which allows the user to install all the above with a single click. I am able to generate a Jar file but not an Exe file.   Could you please help me.  Thanks in advance.

If I have a Java source file (*.java) or a class file (*.class), how can I convert it to a .exe file?  I also need an installer for my program.


This may seem like a stupid question.  I'm using Ubuntu 15.10 with GNOME Terminal 3.16.2. When I was new to the system, I often typed 'l' or 'la' instead of 'ls' to list files, and would then be told that these were not valid commands. I obviously then typed 'ls' properly. Now I notice that typing 'l' and 'la' do the same thing as 'ls'.  What's going on here? Has the terminal learnt the common mistakes that I make, and made aliases to account for them, or is this a new feature that I've installed without realising?

There is a command l available on my machine which appears to do nothing.  which l also produces no output. Is this a real command, and does it actually do anything?


Assuming the straw can be built out of any material, shape, size.  Would the vacuum effect of space acting on the pressurized gas have enough force to lift the weight of the atmosphere contained in the straw out into space?  Or maybe the atmosphere is simply to heavy to lift into space?  Would it be similar to a really long straw that reaches down to the deep end of a pool and your standing outside the pool and your trying to suck water through the straw up from out of the bottom. The plastic straw might collapse in on itself from the negative pressure but if it was made from metal it is possible.

If I built a tube from Earth's surface to the exosphere, would all the air be sucked out to space?  If this pipe reached to a big planet, like Jupiter, would its gravity through the pipe suck our atmosphere?  If one end of the pipe was at the Earth's core, and other in the exosphere, would the magma go there, like in giant volcano?


I'm not able to update my ubuntu desktop. When I open the software updater it says you should upgrade to ubuntu 13.10. When I click upgrade, the update doesn't start the software updater closes automatically. Please help.

I am currently using Ubuntu 10.04. I know there is a 10.10 release, but can I upgrade directly to 11.04? Could you walk me through the steps please?


I've been stuck by this integral. I only knew that roots of the cubic equation are complex. Please help me with this. $$\int\frac{dx}{x^3+x+1}$$

How do I calculate the following indefinite integral?       $$\int\frac{1}{x^3+x+1}dx$$     Approach:  $x^3+x+1=(x-a)(x^2+ax+c)$ where   $a:$ real solution of the equation $a^3+a+1=0$  $c:$ real solution of the equation $c^3-c^2+1=0$  Then $$\int\frac{1}{x^3+x+1}dx=\int\frac{1}{(x-a)(x^2+ax+c)}dx=\int\frac{A}{(x-a)}dx+\int\frac{Bx+C}{(x^2+ax+c)}dx$$


Does anybody know how to create a "minimum bounding polygon" from a set of polygons in QGIS or elsewhere?    For example, in the figure below I can create a Convex Hull per the purple outline, but I'm after a tighter fit that matches the inner reddish shape.  I can do a buffer with a small distance, but there are interior holes that are tedious to delete manually.

I have a layer of street segments that are within a given distance of a fire station. Now I want to make a border around these street segments. If I use Buffer, it puts a buffer around each segment. If I use Convex Hull it makes a border around the street segments but does not follow the street segments but rather cuts across them. What I really need is an outside buffer of the street segments that follows the outermost street segments.   Is it possible in QGIS?  The image below shows the problem. The lines in green represent street segments that can be reached from a given point within 4 minutes. The yellow is 6 minutes and the blue is 8 minutes from the same point.  When I put a convex hull around the green segments (shown in purple), the hull includes some of the yellow segments because a convex hull is based on the smallest polygon that contains all of the lines. I see that a concave hull is what I really need, but QGIS does not support the concave hull.


My old modem was malfunctioning and I had to get a new one. However, now my girls can't join each other's games in Minecraft PE. Their iPods are both connected to the new wifi and they can sync apps. It is only in Minecraft PE that they get the message "Server Outdated" or "Outdated Client". They spent a lot of time creating some of these worlds and are pretty devastated that they can't join together. Any ideas?

Trying to connect my from son's iPod 4 to my iPod 4s. Both are using iOS6, both playing Minecraft version 8.1. My iPhone joins to my iPad no problem but not to the iPhone 4. If I try to connect from the iPhone4 it says 'outdated server' if I try to connect from my iPhone 4S the wifi world from the iPhone4 doesn't even show up as an option to connect to.  Same version same wifi network, what am I missing?


I'm getting this error when trying to save a Case: Failed to invoke future method 'static void cloneCaseWithCaseProds(String, String, Set<Id>)' on class 'CTRL_Support_ProcessV2' for job id 'xxxxxxxxx'  caused by: System.DmlException: Insert failed. First exception on row 0; first error: UNABLE_TO_LOCK_ROW, unable to obtain exclusive access to this record: []  Class.DAL_BaseObject.UpdateDatabase: line 117, column 1 Class.DAL_BaseObject.InsertDBObjects: line 45, column 1 Class.DAL_BaseObject.InsertDBObject: line 40, column 1 Class.CTRL_Support_ProcessV2.cloneCaseWithCaseProds: line 252, column 1  Any information on how to debug or fix this?

Error Message:     Developer script exception from Nicomatic : quotepotential :   quotepotential: execution of AfterUpdate caused by:   System.DmlException: Update failed. First exception on row 0 with id   a0Q90000005PoxtEAC; first error: UNABLE_TO_LOCK_ROW, unable to obtain   exclusive access to this record: [] Trigger.quotepotential: line 14,   column 1      Apex script unhandled trigger exception by user/organization:   00590000001A6jh/00D90000000bovq      quotepotential: execution of AfterUpdate      caused by: System.DmlException: Update failed. First exception on row   0 with id a0Q90000005PoxtEAC; first error: UNABLE_TO_LOCK_ROW, unable   to obtain exclusive access to this record: []      Trigger.quotepotential: line 14, column 1   these mails are getting to my mail..........  trigger quotepotential on Quote_Line_Item__c (after insert,after update) {     Set<Id> quoteIds = new Set<Id>();     List<Quote__c> quotes = new List<Quote__c>();     for (Quote_Line_Item__c record: Trigger.new) {         if (record.Quote1__c != null){             quoteIds.add(record.Quote1__c);         }     }     for(AggregateResult ar:[                 SELECT                      Quote1__c,                      SUM(Max_Batch__c)sumMax                  FROM Quote_Line_Item__c                  WHERE Quote1__c=:quoteIds                  GROUP BY Quote1__c                 ]) {          quotes.add(new Quote__c(              Id=(Id) ar.get('Quote1__c'),              Potential__c = (Decimal) ar.get('sumMax')              ));     }     if (quotes.isempty() == false) {         update quotes;     } }


We are running Windows 10 Pro x64. The Software we use only supports 1703.  So I have a new machine here, running 1607 and want to upgrade to 1703.  Also, I want to keep that, but install all other updates automatically. I know, that there will be one day I have to upgrade, but the vendor of the software we use should ship patches before that day.  Somehow, I didn't do any progress researching that, I wouldn't ask if I had any clue.  Thank you.  As I was asked where this is a duplicate of "How to disable Windows Updates": I would just disable them, if this was my intention. I want to stay on 1703. And as 1709 has been published half a year ago, it will still work.

I have a brand new, unopened laptop with Windows 10 Home that, due to a standardized test that my spouse will have to take on it in late July, I cannot put Windows 10 Creator on.  I understand that this will leave the laptop less secure, and I am rather mad about it, but I have no control over the testing software.  They made it very clear that Windows 10 Creator is not supported, and that it should not be installed prior to the exam.  When I open this laptop up, I would like to make my laptop as secure as I can by getting as many updates as possible without installing Windows 10 Creator.  However, updates rarely identify themselves clearly, so I am not sure how to know when I have even encountered the Windows 10 Creator update.  Can anyone tell me how to know which update to avoid?  Also, (and this is not strictly part of the question), any further advice about how to secure this thing without being up to date on Windows updates would also be appreciated.


If I wanted a bijective map $[0,1]$ to $\mathbb{R}$ and I would define $f$ as: \begin{equation} f(x)=\begin{cases} 0&x=0\\{}\\ 1&x=1\;\\{}\\ -cot\pi x,&\text{otherwise}\\ \end{cases} \end{equation} Would it be a legitimate bijection?

I'm looking for a bijection from the closed interval [0,1] to the real line. I have already thought of $\tan(x-\frac{\pi}{2})$ and $-\cot\pi x$, but these functions aren't defined on 0 and 1.   Does anyone know how to find such a function and/or if it even exists?   Thanks in advance!


My virtualbox 5.0 use to work on kernel 4.8.13 and it was in my list of kernels to choose from.   Apparently automatic download and updates removed 4.8.13 and installed the latest kernel available 4.13.x without my knowledge.   Now, virtualbox crashes 100% of the time every time I boot one of the virtual machines. The whole host operating system (Ubuntu) FREEZES COMPLETELY. The only way is to reboot my system (power cycling).   So, I thought maybe I can install 4.8.13 and get virtualbox working again, but I DO NOT see 4.8.13 in the list of kernel images in the repository. And I thought maybe different version of 4.8.X will work. None of the old kernels I have tried so far worked to fix my problem at all. So, what am I doing wrong? What are my next steps in solving this issue?

Ubuntu 16.04 LTS Virtualbox 5.0.40 ubuntu r 115130  Today after upgrading to kernel 4.13.0-26 guest vbox machines started to crash whole ubuntu. just hard poweroff is working.  If I startup with kernel 4.10.0-42 everything works fine.  what may be the problem ?


I'm trying to cite two different papers that share the same author and were published in the same year. Here is an example:  \documentclass{article}  \usepackage[    backend=biber,             style=authoryear,             sorting=nyt,             useprefix=true,              sortlocale=de_DE,             natbib=true,             doi=false,             isbn=false,             maxcitenames=2,              maxbibnames=99,             eprint=false]             {biblatex} \usepackage{filecontents}  \begin{filecontents*}{general.bib} @article{giacometti16a, author = "Giacometti, R. and Zavala, J.A. and Gog, L.", year = {2016}, pages = {68-77}, title =  {Anthropogenic increase in carbon dioxide modifies plant–insect interactions}, journal = {Annals of Applied Biology}, volume={170}, number={1}, doi = {10.1111/aab.12319} } @article{giacometti16b, author = "Giacometti, R. and Barneto, J. and Barriga, L. G and Sardoy, P.M. and Balestrasse, K. and Andrade, A.M and Pagano, E.A and Alemano, S.G and Zavala, J.A.", title = {Early perception of stink bug damage in developing seeds of field-grown soybean induces chemical defences and reduces bug attack}, journal = {Pest Management Science}, volume = {72}, number = {8}, pages = {1585-1594}, keywords = {herbivory, jasmonic acid, MAPK signalling, plant–insect interactions, salicylic acid, Glycine max L, Nezara viridula L}, doi = {10.1002/ps.4192}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/ps.4192}, eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/ps.4192}, year = {2016} } @article{thomma01, title = "The complexity of disease signaling in Arabidopsis", journal = "Current Opinion in Immunology", volume = "13", number = "1", pages = "63 - 68", year = "2001", issn = "0952-7915", doi = "https://doi.org/10.1016/S0952-7915(00)00183-7", url = "http://www.sciencedirect.com/science/article/pii/S0952791500001837", author = "Thomma, B.P and Penninckx, I.A. and Cammue, C.P.  and Broekaert, W.F.", keywords = "Arabidopsis thaliana, salicylic acid, jasmonic acid, ethylene, biotroph, necrotroph", abstract = "Not more than 10 years ago it was generally accepted that pathogen-inducible defense mechanisms in plants are triggered through a central signaling cascade that regulates a multicomponent defense response. Now we know that the plant defense system is regulated through a complex network of various signaling cascades." } \end{filecontents*}  \addbibresource{general.bib}  \nocite{*}  \begin{document}  As is saying in \parencite{giacometti16a},  \parencite{giacometti16b} and in \parencite{thomma01}  \printbibliography  \end{document}   And this is how latex make my pdf:    As you may have noticed, when two paper share the same author and year, biblatex cites the first and second author (Giacomettis´s references)  But I don't want to differentiate these twins references that way, I want only the first author to be cited and then the year with a letter "a" for the first paper and with a letter "b" for the second paper. Here is an example:    Does anyone know how can I fix this issue?

In the header of my document I set the maximal author names to 2:  \usepackage[style=authoryear-icomp, maxbibnames=9, maxcitenames=2, backend=biber]{biblatex}   Now, when I cite texts with two authors, LaTeX gives me the following:     (Author_A/ Author_B 2012: 232)   When I have three authors or more, LaTeX makes it:     (Author_A/ Author_B et al. 2012: 232)   But I want LaTeX to just name the first author if there are more than two authors ... like this:     (Author_A et al. 2012: 232)   Any tips on how to achieve this ?


I'm applying for a UK visa to sit for plab exam, and I am thinking about making my dad a sponsor. I have two questions:  My father runs a private clinic, so providing an evidence of the average income will be hard. Will that affect the decision, and if yes how can I provide acceptable evidence of his income since he receives money in cash?  His bank account contains enough money but with too few transactions, as the money is derived from saving certificates interest. Will that bank statement be accepted?

The UK Visas and Immigration Directorate publishes  that provides helpful tips that can result in successful visa applications. Section 2 of this guidance opens is entitled "other documents you may want to provide" (emphasis mine).  Section 2: other documents you may want to provide – all visitors This section provides guidance on the types of documents that you may want to provide to help us consider your application against the Immigration Rules. Previous travel documents/passports, which show previous travel. Financial documents showing that you have sufficient funds available.  These must clearly show that you have access to the funds, such as:  bank statements building society book proof of earnings such as a letter from employer confirming employment details (start date of employment, salary, role, company contact details) where a third party (who is either in the UK or will be legally in the UK at the time of your visit) is providing financial support to you e.g. a business, a friend or a relative, documents to show that they have sufficient resources to support you in addition to themselves and any dependant family should be provided   The first item is "bank statements" and this ties in with the , which says...  evidence that you can support yourself during your trip, eg bank statements or payslips from the last 6 months  (Note 'eg' is a Latin abbreviation meaning "for example"; this appears to be optional rather than a fixed requirement.) Question: How should someone interpret this such that the chances of success are maximized? How many statements should I submit? What are they looking for and what do my bank statements tell about me?


$\lim\limits_{h \to 0} \frac{1}{h} \int_{a-h}^{a+h} f(x)\,dx$  I think that this kind of limit should I probably calculate with some kind of epsilon-delta definition.   And using the limits:  $\lim\limits_{h \to 0^+} \frac{1}{h}=\infty $  $\lim\limits_{h \to 0^-} \frac{1}{h}=-\infty $  I appreciate any helps.

Let $f:\mathbb{R}\rightarrow \mathbb{R}$ be continuous.Let $t\in\mathbb{R}$.  Evaluate:$\lim_{h\rightarrow0}\frac{1}{h}\int_{t-h}^{t+h}f(s)ds$.  $\lim_{h\rightarrow0}\frac{1}{h}\int_{t-h}^{t+h}f(s)ds=\lim_{h\rightarrow0}\frac{1}{h}\int_{t-h}^{t}f(s)ds+\lim_{h\rightarrow0}\frac{1}{h}\int_{t}^{t+h}f(s)ds$.  Intuitively, I know that these both limit tends to $f(t)$. Therefore answer will be $2f(t)$.  But I don't know the formal way to prove that this limit tends to $2f(t)$. Help me if there is any formal proof of this (like using any theorem etc.)  Thank you


I have got visa to travel to Germany from 31/05/2015 to 31/12/2015  I have booked flight which starts in on 30th night  9:55pm which will be 2 hours ahead of visa date  Kindly let me know if it is  ok or should I cancel and book for next day.

I have a question, I applied for the Schengen visa through Germany, on the form they ask me when I'd arriving (to Germany) and when I'd returning. they take this exact date as the visa period.  I wondering if they would let me get into the plane, even though my flight it a day before the arrival.  Let get the real deal; let say this:  My visa is valid from 02/12/2014 to 02/02/2015. But, my flight is scheduled to be departing on 01/12/2014, but entering Germany 02/12/2014. the flight duration is almost 9hours and there is 7hours difference between Germany and the departing flight country.


Hello I cannot select the option 'none' as that option is not available. I'm getting really frustrated as I'm trying to download free aps and it will not let me as keeps wanting payment details. I did enter payment details before for one app however I have no money in my account so my card details keeps declining.  How can I set up my appleID to have no payment card associated with it for the App Store?

Ever since adding an iTunes gift card to my account, I'm getting verification requests like crazy. I can't even download free apps. It takes me to my payment info and when I try to select none, I continually get a message under the payment info that says "you must verify your payment info to continue"  I don't want a credit card on file and would really like the none option to work. My ID shows I still have iTunes credit.


So is there no way for me to move a file from internal memory to the external SD card in Android KitKat version? I used to use Wifi Transfer style apps to move stuff from my laptop to the internal memory, and then move them to the SD Card using one of the many explorer apps for Android. Is this not possible at all anymore??  Seems like an uncalled for restriction!

Yesterday I upgraded my Samsung Galaxy S4 to Android 4.4 KitKat and had the bad surprise that it cannot write to my SD card anymore... I know this problem is widely documented everywhere, but has any workaround been found for it yet? (Other than removing the card physically from the phone and opening it on my PC) Also, because of the KNOX flag I can't downgrade to 4.3...  (PS: Rooted or not, it makes no difference)


Currently working on a document of type article. I'd like to add two horizontal lines above and below the title. I tried the following:      \documentclass{article}     \begin{document}       \line(1,0){250}      \title{A Title}      \line(1,0){250}       \author{FirstName LastName}      \maketitle      \clearpage     \end{document}    This does not give the desired effect, and splits the title page into multiple pages. Could you advise?

The standard titlepage is quite simple. I am looking for a very  and need help customizing my title page.  It should match the  classicthesis doctoral thesis template  Below a minimal working example:   \documentclass[12pt,a4paper,footinclude=true,twoside,headinclude=true]{scrbook} \XeTeXinputencoding iso-8859-1 \usepackage[marginparsep=8pt,left=3.5cm,right=3.5cm,top=3cm,bottom=3cm]{geometry}  \usepackage[parts,pdfspacing,dottedtoc]{classicthesis}    \frontmatter  \begin{document}     \pagestyle{scrheadings}        %this is the place to set up my cover sheet.       %*******************************************************      % Abstract     %*******************************************************    %\renewcommand{\abstractname}{Abstract}    \pdfbookmark[1]{Résumé}{Résumé}   \begingroup    \let\clearpage\relax    \let\cleardoublepage\relax    \let\cleardoublepage\relax       \chapter{Résumé}     Résumé de la thèse en français\dots      \vfill      \chapter*{Summary}   Résumé de la thèse en anglais\dots    \endgroup             \vfill     \end{document}


I was wondering if it possible to have TikZ/pgfplots output a linear regression which also gives me the uncertainty of the regression itself. Sort of like this:     note how a and b have an uncertainty.   Currently, I have this  \begin{tikzpicture} \centering      \pgfplotsset{width=11cm,          compat=1.3,          legend style={font=\footnotesize}}      \begin{axis}[      title={$R_1$:Experimental Plot I vs. V},      xlabel={V},      ylabel={I}},      legend cell align=left,      legend pos=north west]       \addplot+[blue][mark size=1.5pt] table[row sep=\\,      y={create col/linear regression={y=Y}}] % compute a linear regression from the      %input table       {            X Y\\            0.44 0.001   \\             -0.44    -0.001  \\             4.24 0.008   \\             -4.40    -0.008  \\             9.68 0.018   \\             -9.99    -0.018  \\             15.56    0.029   \\             -15.64   -0.029  \\             18.67    0.035   \\             -18.67   -0.035  \\      };      \addlegendentry{%          $\pgfmathprintnumber{\pgfplotstableregressiona} \cdot a          \pgfmathprintnumber[print sign]{\pgfplotstableregressionb}$ lin. Regression} %                \addplot+[blue,only marks,mark=*,mark size=1pt][error bars/.cd,y dir=both,y explicit,         x dir=both,x explicit]        coordinates {          (   0.44    ,   0.001   ) +- (  0.01    ,   0.00025 )         (   -0.44   ,   -0.001  ) +- (  0.01    ,   -0.00025    )         (4.24,0.008) +- (0.01,0.002)         (-4.40,-0.008) +- (0.01,-0.002)         (9.68,0.018) +- (0.01,0.0045)         (-9.99,-0.018) +- (0.01,-0.0045)         (15.56,0.029) +- (0.01,0.00725)         (-15.64,-0.029) +- (0.01,-0.00725)         (18.67,0.035) +- (0.01,0.00875)         (-18.67,-0.035) +- (0.01,-0.00875)       }; \end{axis} \end{tikzpicture}   Thanks in advance.   edit: I'm not asking for the r^2 value for the regression, I'm asking for the uncertainty of the regression itself.

I have the following code   \documentclass{article} \usepackage[utf8]{inputenc} \usepackage{pgfplotstable} \usepackage{pgfplots} \pgfplotsset{compat=1.11}  \pgfplotstableread{ x1 y1 y2 0   1   1 1   2   4 2   3   9 3   4   16 4   5   25 5   6   36 6   7   49 7   8   64 8   9   81 9   10  100 10  10  100 }\tableLabel  \begin{document}  \begin{tikzpicture} \begin{axis}[ legend pos = north west, title = Cool Graph, xlabel ={Cool X}, ylabel ={Cool Y}, grid = major, legend entries = {best fit, y1, y2}, ]  \addlegendentry{%     $\pgfmathprintnumber{\pgfplotstableregressiona} \cdot x     \pgfmathprintnumber[print sign]{\pgfplotstableregressionb}$ lin.     Regression} % \addlegendentry{y1}  \addplot table [x index=0, y = {create col/linear regression={y=y2}}]     {\tableLabel}; \addplot table [x index=0, y = y1]{\tableLabel};        %The data entries in column y1 \addplot table [x index=0, y index=2]{\tableLabel};     %The data entries in column y2 %\addplot table[row sep=\\, y={create col/linear regression={y=Y}}]  \end{axis} \end{tikzpicture} \end{document}   I wish to also show the R^2 value (least squares regression value) on my graph, is this possible?


The problem I'm attempting is to prove that, given an n x n matrix $A$, we can find matrices $B$ & $C$ such that $BC=CB$, $A=B+C$, $B$ is diagonalizable, and $C^n = 0$. I first tried simply breaking the matrix into upper & lower triangular matrices, but one is not guaranteed to be diagonalizable and the two don't necessarily commute. I'm considering having $B$ simply be $\lambda I$, but guaranteeing that $C^n=0$ seems tricky. Any suggestions?

I would like to prove that every $n\times n$ matrix is the sum of a diagonalizable matrix and a nilpotent matrix. How is this possible? I'm not sure where to begin really- I know that a nilpotent matrix is one of which some power is the zero matrix.  I also know that a matrix A can be written as $AP=PJ$ with $P$ invertible and $J$ of Jordan form.  I have proven that any strictly upper triangular matrix is nilpotent, so $J$ can be written as $D+N $, with D diagonal and $N$ nilpotent, but how can I change this for A? Thank you!


for i in L*; do cd $i find . -type f -name 'botrytis_cinerea_T12345.*' -exec rename 's/botrytis_cinerea_T12345/"$i"/g' {} \; done   I get the error  find: missing argument to `-exec' rename: not enough arguments  Usage:  rename [options] expression replacement file...  Options:  -v, --verbose    explain what is being done  -s, --symlink   act on symlink target   -h, --help     display this help and exit  -V, --version  output version information and exit  For more details see rename(1).

I'm trying to find certain files with the name "stringx" and replace the name (but not the extension) with "stringy". So basically for stringx.txt and stingx.cs, I'd want stringy.txt and stringy.cs. I've attempted to test my rename command regex using following, but it returns no results:  rename -n 'stringx./s/\*$stringy./\/' stringx.*   I'm running csh under Centos. I can see that my regex is probably not correct, but I can't see any results to verify this. I can see that there are files that are named stringx. with the following:  find ./ -name 'stringx.*'


I'm a Linux engineer, and I know quite a bit of programming languages, and can create a website pretty easily, but what I suck at, is SEO. That's an art all by itself, and that's what I need some help in.  My parents are realtors, and they're going through a bit of a dry spell for a while, and I would really like to help them so they can get some bills paid. They have a couple special houses they want to sell, and I thought that maybe me, as a technical junkie, can help a bit.  I spotted  which explains how some realtors are registering the street address of a house they're marketing, as the domain itself, and that's what I want to do.  For example, if the domain is 12345 W McGyver Rd (Fake), then I would have  registered the following domains:   12345WMcGyverRd.com 12345WestMcGyverRoad.com   The domain just points to a vhost on a server I own, which returns a 301 redirect to redirect to my parents real-estate website, specifically to the page that contains the data of the specific house.  The goal is to have the website show up as a search result when someone types the address into a Google search. I figure having the domain as close to the actual address should help.  I went  and submitted the two domains, hoping they would get indexed, but it doesn't look like it's worked..  Are there any SEO tricks I can do? I would be willing to add some PHP to the page that does the redirecting, maybe check to see if its a Google crawl bot and return some useful data? I'm just not sure the best way to do that.  If anyone has any SEO tricks they can suggest that would help, that would be amazing. Im not trying to play the sympathy card, but I just really want to help my parents :)

Lets say I have a domain already, for example www.automobile4u.com (not mine), with a website fully running and all.  The title of my "Website" says:    <title>Used cars - buy and sell your used cars here</title>   Also, lets say I have fully SEO the website so when people searching for the term buy used cars, I end up on the second or first page.  Now, I want to end up higher, so I go to the google adwords page where you can check how many searches are made on specific terms.  Lets say the term "used cars" has 20 million searches each month.  Here comes the question, could I just go and buy that domain with the search terms adress, in this case www.usedcars.com and make a redirect to my original page, and this way when people search for "used cars", my newly bought domain name comes up redirecting people to my original website (www.automobile4u.com)?  The reason I believe this benefits me is because it seems search engines first of all check website adresses matching the search, so the query "used cars" would automatically bring www.usedcars.com to the first result right?  What are the downsides for this?  I already know about google spiders not liking redirects, but there are many methods of redirecting...  Is this a good idea generally?


I was trying a CSV using "," as the split delimiter but when I checked the file, I found that the CSV contains , in the field example "id26305","This process, however, afforded me no means of ascertaining the dimensions of my dungeon; as I might make its circuit, and return to the point whence I set out, without being aware of the fact; so perfectly uniform seemed the wall.","EAP" I am using Java and here's my code to read the file. Any Suggestions? private static ArrayList<Record> readRecordFromCSVFile(String filename){     File f=new File(filename);     ArrayList<Record>r=new ArrayList<>();     try {         BufferedReader br = new BufferedReader(new FileReader(filename));         String line=br.readLine();         String line2="";          while ((line2 = br.readLine()) != null) {             String[]attributes=line2.split(";?(?:(?:\"((?:[^\"]|\"\")*)\")|([^;]*))");             Record record=createRecord(attributes);             r.add(record);          }      } catch (FileNotFoundException e) {         e.printStackTrace();     } catch (IOException e) {         e.printStackTrace();     }     return r; }

Can anyone recommend a simple API that will allow me to use read a CSV input file, do some simple transformations, and then write it.  A quick google has found  which looks promising.  I just wanted to check what others are using before I couple myself to this API.


Please check the code below:  my %hash = ( 123 => "a", 456 => "b", );  use constant x_1 => 123; use constant x_2 => 456;   I want to use something like $hash{x_1} to get "a". I tried to store x_1 into a variable and then use it as the key, it worked. Like      my $var = "x_1"; # or my $var = x_1   But when I get the variable x_1 from an array which I store into a variable, and then try to access the hash from this variable, it shows an error. Like   my @arr; $arr[0]{"y_1"} = "x_1"; $arr[0]{"z_1"} = "x_2"; my $newVar = $arr[0]{"y_1"};#$newVar = x_1 print $hash{$newVar}; #this shows error.   How could I use the variable not as a string but as a constant here?

Is there any way to use a constant as a hash key?  For example:  use constant X => 1;  my %x = (X => 'X');   The above code will create a hash with "X" as key and not 1 as key. Whereas, I want to use the value of constant X as key.


Let $G$ be an abelian group with even order and $M:=\{g\in G:g^2=e\}$.  It is easy to show that $M$ is a sugroup of $G$ and the number of elements of $M$ must be a power of $2$.     I want to prove that the product of the elements of $G$ (which in this case is equal to the product of the elements of $M$) is not the identity element $e$, if and only if #$M=2$ (this means that there is only one element with order $2$). I found this claim when I studied the Wilson criterion for the primality of a number.   The case #$M=4$ is easy. If $a,b\in M$, we can show that $ab$ is not $a,b,e$, hence must be some other element $c$ and we get $abc=c^2=e$. But what about #$M=8$? If we have the elements $e,a,b,c,d,f,g,h$ and $ab=c$ and $df=g$, the product would be $h$ which is impossible considering my claim.   Who can complete my proof ?

Question: If $G$ is a finite group such that the product of its elements (each chosen only once) is always $1$, independent of the ordering in the product, what can we say about $G$?  I was trying to conclude that $G$ must be abelian (I am not sure about this). I proceed as follows: if $|G|\leq 4$, then obviously, $G$ is abelian. Suppose $|G|>4$. Then consider products of all elements in the order $a^{-1}b^{-1}ab cc^{-1}dd^{-1}....$. This, being identity, implies that $a^{-1}b^{-1}ab=1$, i.e. $G$ is abelian.  BUT, the problem is in $a^{-1}b^{-1}ab$, the elements $a$ and $a^{-1}$ should be distinct, and similarly for $b$. Otherwise, the product $a^{-1}b^{-1}ab cc^{-1}dd^{-1}....$ is not in the prescribed form as in question.  Also, note that the cyclic group of order $4$ doesn't satisfy that $abcd=1$ where $\{a,b,c,d\}\cong \mathbb{Z}_4$.


I've notice that when I open an application from terminal, for instance evince fileName.pdf  and I try to close using Ctrl+z, it actually does not close. Instead, it keeps open and when I try to close directly by "close button", it crashes and I receive a message like  "fileName.pdf" is not responding  Does someone knows why this is happening?

Can anyone tell me the difference between ctrl+z and ctrl+c?  When I am in the terminal, both the combinations stop the current process, but what exactly is the difference between both?


I have almost completed the proof, I have shown, that there exists an element of order e, where e is min{n:$g^n=1$} and $g\in G$ where $G$ is the multiplicative group of a finite field. Now I noticed, that the polynomial $x^e-1$ is solved by all $g\in G$. I am finished if I can show, that e=q-1 where q=$|G|$. However I only know that q-1$\leq$e. My idea is, that if q-1 <e, e >min{n:$g^n=1$}, so e has to be q-1 wich means $G$ is cyclic. Is the reasoning for q-1=e sufficient?

Why is the multiplicative group $(K\smallsetminus\{0\},\cdot)$ of a finite field $(K,+,\cdot)$ always cyclic?


Rather than just blindly following Youtube tutorials, I like to practice modelling by finding concept art I like and trying to model it in Blender. In this case I'm trying to model this robot:  I'm trying to replicate that big round lens in the robot's 'head', but I can't seem to do it and still have clean geometry. I have tried using a boolean to cut out the circle, then adding a sphere, but it results in a messy mesh.  There are no doubt several better ways to achieve the same effect with much cleaner results. Any ideas?

I need to extrude a circular shape from a surface that's basically just a grid of quads. What's the best practice to do this without screwing up the topology too much?  I basically want to have a circular face I can extrude, in order to have a cylinder like protuberance on the object, something like this:


Passing a window global variable through JS does not seem to be working. The following code is printing true:   window.nada = true; tata(window.nada); console.log(window.nada);  function tata(lala) {   lala = false; }    How can I affect the window.nada global variable inside the tata function?

The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?


So my question is how can I pass a file argument to my bash script using a Terminal command in Linux? At the moment I'm trying to make a program in bash that can take a file argument from the Terminal and use it as a variable in my program. For example I run myprogram --file=/path/to/file in Terminal. My Program #!/bin/bash     File=(the path from the argument)   externalprogram $File (other parameters)  How can I achieve this with my program?

Say, I have a script that gets called with this line: ./myscript -vfd ./foo/bar/someFile -o /fizz/someOtherFile  or this one: ./myscript -v -f -d -o /fizz/someOtherFile ./foo/bar/someFile   What's the accepted way of parsing this such that in each case (or some combination of the two) $v, $f, and  $d will all be set to true and $outFile will be equal to /fizz/someOtherFile?


I'm not getting the correct value if i add 2 decimal values in java script,  if i add 19.67 and 34.70 i should get 54.37 instead i'm getting the value 54.370000000000005. Can anyone help me out, Thank you. below is my code  <script type="text/javascript">     $(document).ready(function () {         $('#btn').click(function () {             var a = 19.67;             var b = 34.70;             var c = parseFloat(a) + parseFloat(b);             alert(c);         });     }); </script>

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


Let $f:\Bbb R\to \Bbb R$ be  a differentiable function such that $\sup _{x\in \Bbb R} |f^{'}(x)|<\infty$. Then which are true:   $f$ maps bounded sequences to bounded sequences. $f$ maps Cauchy sequences to Cauchy sequences. $f$ maps convergent  sequences to convergent $f$ is uniformly continuous.   Let $|f^{'}(x)|\leq M$ for some $M>0$ .Then $|f(x_1)-f(x_2)|\leq |f^{'}(x) ||x_1-x_2|\leq M(x_1-x_2)<\epsilon $ whenever $|x_1-x_2|<\delta $.Thus $f$ is uniformly continuous.So $2,3,4$ are true.  But how to prove /disprove $1$?

(UGC CSIR-2015, DECEMEMBER, MATHEMATICAL SCIENCES)        $f$ maps a bounded sequence to a bounded sequence.   $f$ maps a Cauchy sequence to a Cauchy sequence.   $f$ maps a convergent sequence to a convergent sequence.   $f$ is uniformly continuous.      I choose all of the options as possible answers because the condition $\sup_{x\in \Bbb R}|f'(x)| \lt \infty$ forces $f$ to be uniformly continuous.(Because $f$ becomes Lipschitz and Lipschitz condition implies uniform continuity)  i.e. $\frac {|f(x)-f(y)|}{|x-y|} \le \sup_{x\in \Bbb R}|f'(x)|$ $ \forall x,y$.  Hence all other options are bound to be true.  Am I correct?


I used a basic technique to implement a method that finds the date of the next day based on the given parameter in the format YYYY-MM-DD and returns the next day in the same format.   Can you please take a look at the code and tell me if it is inefficient or not? It works perfectly fine, but I would prefer to implement a method with more efficiency and fewer lines of code if possible. Keep in mind that any values of the month or day that are single digits numbers have to be formatted with a 0 in the tens place.   public String nextDate(String date){ //ex: 2016-01-31 -returns-> 2016-02-01     int MMrange = 30;      String result = "";      String daystr = date.substring(8,10);     String monthstr = date.substring(5,7);      int day = Integer.parseInt(daystr);     int month = Integer.parseInt(monthstr);     int year = Integer.parseInt(date.substring(0,4));     if(month==1||month==3||month==5||month==7||month==8||month==10||month==12) MMrange = 31;     else if(month==2) MMrange = 28;     if(year%4==0&&month==2) MMrange = 29;     if(day==MMrange){         day =1;         month++;     }else if(month==12&&day==31){         year++;         month = 1;         day = 1;     }else{         day++;     }     result = Integer.toString(year)+"-"+Integer.toString(month)+"-"+Integer.toString(day);     if(month <=9&&day<=9) result = Integer.toString(year)+"-0"+Integer.toString(month)+"-0"+Integer.toString(day);     else if(month <= 9) result = Integer.toString(year)+"-0"+Integer.toString(month)+"-"+Integer.toString(day);     else if(day <= 9) result = Integer.toString(year)+"-"+Integer.toString(month)+"-0"+Integer.toString(day);     return result; }

I'm working with a date in this format: yyyy-mm-dd.  How can I increment this date by one day?


Drawing a blank here. I'm trying to recreate Jack Sparrow's famous bandana; a red base colour with a blue floral pattern. I've started off with a red, diffuse base on my bandana mesh and I've acquired a decent image of a vector floral pattern with an alpha background.  My problem is: how do I then add this floral pattern on the surface of my red bandana? Can I not stack image textures in the same material? The floral pattern is a png image, and its alpha channel is apparent when I use the alpha textured material method. However, I don't want my bandana to be transparent.   How do I add the floral pattern to the opaque base material while retaining the image's transparency?

I am trying to create a low poly face with a face from a .png file. The issue is I already have material placed for hair and skin, as shown in the picture below.   I have created a .png file with a face which I would like to overlay over the skin material on the front of the head.    All examples I searched so far assume I also want the color of the material from the .png texture.  Update:  I added UVMapping, changed view to texture, made sure one face is on the eye but nothing is displayed..... see image... I don't know what is going on.


I am a Canadian citizen w/ a Canadian passport.  I went on a student visitor visa from September 11 2014 to December 17 2014. I'm returning on May 2 and leaving July 30 of this year as a tourist. How long am I able to visit the UK within a 365 day period? Does the fact that there is a period of time between my visits change anything?  I know I'm only allowed to stay as a general visitor/tourist for 6 months at a time. But as these two separate trips total just over 6 months, I am concerned that I will not be allowed to stay this long.

I am a Chinese citizen holding a HK SAR passport. How long am I able to visit the UK within a 365-day period?  My stamp is for 6 months. Could I leave within 6 months but re-enter again a couple of weeks for another 6 months?


ubuntu@ubuntu:~$ su - Password: su: Authentication failure   I have given the password still it is showing the same as above, can any one help me out

I installed  (Precise Pangolin), 64 bit. Nowhere was I asked to set password for root.  I just installed  software. It was installed under the /root folder by default. Now I try do something on that folder. I tried with su to switch to root, but I don't know its password.   Should I always use sudo or get the default root password, if any?  How do I create a  for software installed inside the /root directory?


The square of any integer is either perfectly divisible by 4 or leaves a remainder 1 when divided by 4. Any number which on division by 4 leaves a remainder 2 or 3 is not a perfect square. Prove

Prove that a perfect square is either a multiple of $4$ or of the form $4q+1$ for some $q\in \mathbb{Z}$.  Any ideas on how to start? Do I use a proof by contraposition? Also what's the definition of a perfect square?


When we are driving on motorway in sunny afternoon  we can observe a mirror like reflection on the road at some distance why is it so.  !!?

Often, I'll be driving down the road on a summer day, and as I look ahead toward the horizon, I notice that the road looks like there's a puddle of water on it, or that it was somehow wet. Of course, as I get closer, the effect disappears.  I know that it is some kind of atmospheric effect. What is it called, and how does it work?


I am new to regularized regression, and I was told that Elastic net overcomes many issues of the Lasso Regression. Especially, in the case of highly correlated predictors, Lasso variable selections tend to be unstable.  I don't really understand why, therefore, I tried to demonstrate it. Hence, I created a dataset of highly, pairwise correlated variables:  # this function generate a pair wise higly correlated dataset def generate_correlated_dataset(cov_strengh: float,n_features: int,n_samples: int) -> (np.ndarray,np.ndarray):     # mu = 0 , centered distribution     mu = np.zeros(n_features)      #generating cov matrix, with cov_strengh as the covariance maximal strengh     # allocating random values for sigma     sigma = np.random.uniform(low=-.5,high=.5,size=(n_features,n_features))     # ensuring 1 on diagonal and maximum strengh for variables pairwise     for i in range(0,n_features):         sigma[i,i] = cov_strengh         if i < (n_features-1) and (i/2 == np.floor(i/2)):             sigma[i,i+1] = cov_strengh             sigma[i+1,i] = cov_strengh     # making sigma positive definite     sigma = np.dot(sigma , sigma.T)     # making lambda symetrical     sigma = sigma+sigma.T     # generating x as N(mu,sigma)     X = np.random.multivariate_normal(mean = mu, cov = sigma, size = n_samples)     # random gaussian coeficients to generate y     coef = np.random.randn(n_features)     y = np.dot(X,coef)     return (X,y) # example: X_ex,y_ex = generate_correlated_dataset(3,50,100) pd.DataFrame(np.corrcoef(X_ex,rowvar=False)).head()   Then I use a 10-Folds CV on my dataset to compare Lasso's and Elastic Net's bias, variance, and the variance of predictors and stability. To measure stability, I measure the distance to K/2 selection, which I consider as the worst selection (random selection). Here my stability metric:     metric = 2/(n_features * K) * sum(|K/2 - nb_selection|)   I tried several values for alpha. I thought, that in those conditions Elastic net would easily have a stability dramatically higher that Lasso's. Here is my code to compare both regressions:  #generating training dataset n_features = 50 n_samples = 100 K = 10 #number of folds alpha = .1  # models, ratio is .5 for elastic lasso = Lasso(alpha=alpha) elastic = ElasticNet(alpha=alpha,l1_ratio=0.5)  # generate dataset: X,y = generate_correlated_dataset(cov_strengh= 3,n_features= n_features,n_samples= n_samples)  # test models bias_elastic, var_elastic, coefs_elastic = evaluate_model(X=X,y=y,K=K,model=elastic) bias_lasso, var_lasso, coefs_lasso = evaluate_model(X=X,y=y,K=K,model=lasso)   print(f"Bias               : Elastic = {bias_elastic}, Lasso = {bias_lasso}") print(f"Variance of the prediction: Elastic = {var_elastic}, Lasso = {var_lasso}") print(f"Stability          : Elastic = {stability_metric(coefs_elastic)}, Lasso = {stability_metric(coefs_lasso)}") print(f"Variance of coefficients  : Elastic = {np.mean(np.var(coefs_elastic, axis = 0))}, Lasso = {np.mean(np.var(coefs_lasso, axis = 0))}")   Evaluate model does a CV and returns the results for each folds. at the end, my results are slightly better for Elastic net, but not that much.   Bias               : Elastic = -0.03647122865037677, Lasso = -0.02128281711861078 Variance of pred: Elastic = 21.258733026121277, Lasso = 21.106866537149813 Stability          : Elastic = 0.928, Lasso = 0.892 Variance of coef  : Elastic = 0.001947616131880543, Lasso = 0.0035541923789652262   Could you show a dataset where one can see a real difference between Lasso and Elastic net in term of variable selection stability?

In compressed sensing, there is a theorem guarantee that  $$\text{argmin} \Vert c \Vert_1\\ \text{subject to } y = Xc $$ has a unique sparse solution $c$ (See appendix for more details).   Is there a similar theorem for lasso? If there is such a theorem, not only will it guarantee the stability of lasso, but it will also provide lasso with a more meaningful interpretation:  lasso can uncover the sparse regression coefficient vector $c$ that is used to generate the response $y$ by $y = Xc$.  There are two reasons that I ask this question:   I think 'lasso favors a sparse solution' is not an answer to why use lasso for feature selection since we can't even tell what the advantage of the features we select is.  I learned lasso is notorious for being unstable for feature selection. In practice, we have to run bootstrap samples to evaluate its stability. What is the most crucial reason that causes this instability?      Appendix:   Given $X_{N \times M} = (x_1, \cdots, x_M)$. $c$ is a $\Omega$-sparse vector ($\Omega \leqslant M$). The process $y = Xc$ generates the response $y$. If $X$ has the NSP (null space property) of order $\Omega$ and covariance matrix of $X$ has no eigenvalue close to zero, there will be a unique solution to  $$\text{argmin} \Vert c \Vert_1\\ \text{subject to } y = Xc $$ which is exactly the $c$ that gives $y$.  What this theorem also tells is also if $X$ has not the NSP of order $\Omega$, it is simply hopeless to solve $\text{argmin}_{c: y = Xc} \Vert c \Vert_1$.     EDIT:  After receiving these great answers, I realized I was confused when I was asking this question.  Why this question is confusing:  I read a  in which we have to decide how many features (columns) the design matrix $X_{N \times M}$ is going to have (auxiliary features are created from primary features). Since it is a typical $n < p$ problem, $D$ is expected to be well constructed so that the solution to lasso can be a good approximation of the real sparse solution.   The reasoning is made from the theorem that I mentioned in the appendix: If we aim to find a $\Omega$-sparse solution $c$, $X$ has better to have the NSP of order $\Omega$.   For a general $N \times M$ matrix, if $N > C \Omega \ln M$ is violated, then     no stable and robust recovery of $c$ from $D$ and $P$ is possible   $D$ corresponds to $X$, $P$ corresponds to $y$     ...as expected from the $N = C \Omega \ln M$ relationship, the selection of the descriptor becomes more unstable, i.e., for different training sets, the selected descriptor often differs...   The second quote is the part that confuses me. It seems to me when the inequality is violated it is not just the solution maybe non-unique(not mentioned), but the descriptor will also become more unstable.


I have created an extended event as below. I want to know how to query the historical data using T-SQL to see the issues at particular timestamps. The trace is running as of now  CREATE EVENT SESSION [PerQuerymonitor] ON SERVER  ADD EVENT sqlos.wait_info(     ACTION(sqlserver.database_name,sqlserver.plan_handle,sqlserver.sql_text)), ADD EVENT sqlos.wait_info_external(     ACTION(sqlserver.database_name,sqlserver.plan_handle,sqlserver.sql_text)), ADD EVENT sqlserver.disk_log_read(     ACTION(sqlserver.database_name,sqlserver.plan_handle,sqlserver.sql_text)), ADD EVENT sqlserver.sql_batch_completed(SET collect_batch_text=(1)     ACTION(sqlserver.database_name,sqlserver.plan_handle,sqlserver.sql_text)), ADD EVENT sqlserver.sql_batch_starting(     ACTION(sqlserver.database_name,sqlserver.plan_handle,sqlserver.sql_text)), ADD EVENT sqlserver.sql_statement_completed(     ACTION(sqlserver.database_name,sqlserver.plan_handle,sqlserver.sql_text)), ADD EVENT sqlserver.sql_statement_starting(     ACTION(sqlserver.database_name,sqlserver.plan_handle,sqlserver.sql_text))  ADD TARGET package0.event_file (SET filename=N'C:\SQLDatabase\PerQuerymonitor.xel', max_file_size=(204800)) WITH (MAX_MEMORY=4096 KB, EVENT_RETENTION_MODE=ALLOW_SINGLE_EVENT_LOSS,MAX_DISPATCH_LATENCY=30 SECONDS,MAX_EVENT_SIZE=0 KB,MEMORY_PARTITION_MODE=NONE,TRACK_CAUSALITY=OFF,STARTUP_STATE=ON) GO   Appreciate your kind help.

My aim is to audit all queries on an instance, who's running them and from where, how many reads, in order to consolidate/migrate on another instance.   Figured out the best way is via Extended Events to .xel files, over 2 weeks, copy those and analyse on my well-specd desktop. Set up the capture with the minimal number of details (fields), so really can't make it smaller than this - aprox 12GB in 12 files. Used "Merge Extended Event Files" in SSMS to load the .xel files and process as detailed in   Is this really the best way to do it ? Is there a better tool to load the files ? It's really slow with SSMS 17.7 - example: with only 4 filters so far (before getting into grouping and aggregates) it took over 12h to get to crunch through 50% of the logs.


Given, $f(x)$ $:=$ $\sqrt{x^2 + 1} \over x$, with $x > 0,$ I wondered which kind of integration would be the most clever one.  Following the advice of Gilbert Strang, I would try to substitute $x = \sin u,$ but in the end, this would lead me to the integration of $\csc u,$ and that's not an easy way to do it, I guess. Another approach would be to substitute $u = \sqrt{x^2 + 1}.$ This substitution works much more straight-forward, but it includes a lot of smaller calculations that could cost me time in an exam. So, do you know another approach that works with a clever trick and goes much faster?

I want to know how to integrate  $$\int\frac{\sqrt{1+x^2}}{x}\,\mathrm dx$$  Could anyone solve it?  Thanks


Let $f(x)$ be bounded.  if $ \int f(x) $ from 1 to infinity converges and the limit $\lim_{x\rightarrow\infty}(f(x))$ exists then $\lim_{x\rightarrow\infty}(f(x)) = 0$ ?  I can't think of a counter example to disprove this. is it correct?

I'm really struggling on this question.  I've been thinking about it for awhile now but this is one of those where I don't really have much intuition on what to do.  Problem 3. Prove that if the limit $\lim_{x\to +\infty}f(x) =: L$ exists (finite or infinity) and the improper integral. $$\int_a^{+\infty}f(x) dx$$ is convergent, then $L = 0$.  Here is some facts that I know that I think I should perhaps use. Facts/Knowledge I know: The above integral can be rewritten as:  $$\int_a^{\infty}f(x)dx = \lim_{A\to \infty}\int_a^{A}f(x)dx$$  We know that limit as x goest to infinity of $f(x)=L$.  I need to somehow show that limit L is equal to 0. If I take the integral I get $\lim_{A \to \infty} F(A)-f(a)$ and I know this does not equal infinity as the integral converges.  I'm not sure if this is on the right track or what to do next. I was thinking maybe perhaps instead I could use the Cauchy Criterion to come up with a proof.  Note: I'm not used to doing proofs with Improper integrals.  Theorem 1 (Cauchy Criterion). The improper integral (1) converges if and only if for every $\epsilon > 0$ there is an $M\geqslant a$ so that for all $A, B \geqslant M$ we have $$\Bigg|\int_A^B f(x) dx\Bigg| < \epsilon$$


In a certain universe a perfectly spherical, uniformly dense planet is found to be in a stable orbit around a stable star. The rest of the universe is empty space with no silly stuff like dark matter. The planet has been in orbit for millions of years. Would the orbit be a perfect circle? If not why not?

This might be a completely wrong question, but this is bothering me since many days ago. Given the mass (Sun) curves the space around it, gravitation is the result of such curved space (Correct me if I am wrong, source: A Documentary film). Given any point on a circle with center same as center of the mass, curvature in the space should be equal (Intuition).   Planets rotate around the Sun because of the curve in the space they should follow a circular path and the distance between planet and Sun should be at a distance.  Given the fact that earth has a elliptical orbit around the sun, and the distance between Earth and Sun varies according to position of the earth. Why do we have a elliptical orbit not a circular orbit.


In my current spring project, I need read in my service class all classes with a specific custom annotation (@MainForm) and return a List> to the controller. The class which should be read are placed on the package com.spring.loja.model. Anyone knows a way to do that?

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


I'm just finishing up paying off my student loans (woohoo!) and am starting to look at places I can put my money to make it work for me. I've read Kobliner's  and am interested in starting with ETF's, but I have a slight dilemma.  I work for a medium-sized company that is publicly traded on the NYSE1. They offer a program where I can allocate up to 15% of my paycheck (after tax) to buy their stock at 85% of the price. The only stipulation being that I have to hold it for 180 days (~6 months).  To me this seems like free money. The second that stock is bought, I've already made 100/85 => 17.6% on my money!  I'm very tempted to allocate the full 15% of my paychecks to this, but I know that it's important to diversify my investments.  I was planning to use 20% of each paycheck to play with for investments--would 15% company stock/5% ETF be diversified enough? Should I drop to 10%/10% or lower? Is there some reason I'm missing to not go all in on this?  EDIT:  I don't think this is a duplicate. The marked duplicate is asking (very broadly) how often "is good" to invest in an ESPP. I know I'm already going to be investing every chance that I get. My concern is one of diversification, which the duplicate makes no mention of. I've made it clear that I'm comparing between ESPP and ETF, while the duplicate seems to simply ask "what are you experiences with ESPP?"    1. It's worth noting that this company's stock has done incredibly well in the last 10 years. While , this company is definitely not going anywhere anytime soon. An investment with them would definitely be safe. I have the utmost confidence in this company.

Although it is company-specific, what are your experiences when contributing to ESPP (Employee Stock Program)?   More specifically, do you recommend contributing to ESPP in max? Or maybe it is only worth during certain times throughout the year? (stock prices are usually higher during Spring/Summer times!)  I work in a big cable company in the US. Kind of stable company. My company rules:  10% of salary with 15% discount, happening quarterly, vesting after a year from purchase


I am working on the algorithm of a project Euler problem. In this, I am processing a large list of numbers with possibly millions of entries in the list. I know beforehand that the list is sorted and I want to check if a particular element is in it or not. I can do it like:   if element in array:     #do something else:     # do something else   or like:   if((array.index(element)>=0):     # do something else:      # do something else   But I know it searches for the element linearly, which takes much time. It pains me that even if the list is sorted, it searches for it linearly. Is there a way that I can tell the compiler to search for the element using binary search, like a default parameter like:  if(array.index(element, binary_search=False):     #do something   so that I can make the second parameter to True and it works as expected. Or do I have to write the binary search function by myself and use it instead of the builtin index method or the in operator?   I am new to Python. Please bear with my ignorance. I searched for it extensively but couldn't find the exact answer. Thanks in advance.

Is there a library function that performs binary search on a list/tuple and return the position of the item if found and 'False' (-1, None, etc.) if not?  I found the functions bisect_left/right in the , but they still return a position even if the item is not in the list. That's perfectly fine for their intended usage, but I just want to know if an item is in the list or not (don't want to insert anything).  I thought of using bisect_left and then checking if the item at that position is equal to what I'm searching, but that seems cumbersome (and I also need to do bounds checking if the number can be larger than the largest number in my list). If there is a nicer method I'd like to know about it.  Edit To clarify what I need this for: I'm aware that a dictionary would be very well suited for this, but I'm trying to keep the memory consumption as low as possible. My intended usage would be a sort of double-way look-up table. I have in the table a list of values and I need to be able to access the values based on their index. And also I want to be able to find the index of a particular value or None if the value is not in the list.  Using a dictionary for this would be the fastest way, but would (approximately) double the memory requirements.  I was asking this question thinking that I may have overlooked something in the Python libraries. It seems I'll have to write my own code, as Moe suggested.


Windows 7 Pro 32 bits. I have changed the name of an account (that has admin rights) via control panel, and in the login screen it shows the new name. So far, so good.   However, when I start some software, it auto-fills the username field with the old account name, and errors when I fill it with the new name, saying the account does not exist.   Hm, weird. Upon further ispection, I find out that:    The folder name in c:\users is still the name of the old account (but I suspect this is by design, to prevent malfunction of some poorly programmed software that might have it hardcoded somewhere) net user is still listing the old name When I clicking on a folder -> properties -> sharing -> advanced sharing -> checkbox "share folder" -> permissions -> add -> advanced -> objects -> checkbox "users" -> OK -> locate now (uh, what was I even doing?) lists the old account name.

I have an install of Windows 7 that I've already put a few days into. Today I realized I've made a mistake in the username and it's driving me nuts (my personal OCD).  While changing the physical folder name is perhaps possible, though quite involved, I do not want to open that can of worms.  What I want to do is simply change the username I give when the login prompt shows up. I thought it's possible by just renaming the user account in the User Accounts but that didn't work.  Is it possible to do then? Or is the only way to create another user and spend hour migrating everything I'd already customized to that user?


We have around 10 case record types. We have one specific record type for our service cases. We want the cases to be assigned an auto case number whenever a new case is created. We do have a auto number field but it's updating for every case that is created.   Auto case number shouldn't be assigned when cases are created in other record types. For ex: If there are 8 cases under this record type, I want the 9th case to to have SR-009 as the custom case number instead of SR-020, assuming other record type cases are created. How do I achieve it?

I'd like to increment fields based on the quote field, so when a quote is created, a custom field will increment depend on the region (each field will have format of "ZO - {000}). Each region should have it's own series of Unique numbers. For example: if it's a "US" region quote, "Quote Number1" custom field will increment (. If it's a "ROW" region quote, "Quote Number2" custom field will increment.  Standard "Autonumber" field works on any record creation, and not customized by record types..  UPDATE: I modified a trigger posted as an answer (@user2590, see below your modified code). I want the autonumbers to work only for "Invoice" record type in Quotes ("Quote record type should be affected"). I assume it is simpler than the original code but somehow it doesn't work...I'm getting: "System.NullPointerException: Attempt to de-reference a null object". Can you have a look and see what's not working?  trigger SampleAutoNumberRegion on Quote (before insert){ String[] name = new String[]{'Invoice'};  Map<Id, RecordType> regions = new Map<Id,RecordType>([SELECT Name from RecordType WHERE sObjectType = 'Quote' AND Name IN :name]);  AggregateResult res = [SELECT MAX(US_Invoice__c) max1, MAX(ROW_Invoice__c) max2 FROM Quote WHERE RecordType.Name IN :name ];   Integer max1 = Integer.valueOf(((String)res.get('max1')).substringAfter('- ') ); Integer max2 = Integer.valueOf(((String)res.get('max2')).substringAfter('- ') );   for(Quote theQuote : trigger.new){          if(thequote.Opportunity.Account.Region__c.contains('US')){   //region corresponds to 'US'         String num1 = String.valueOf( (max1 != null) ? ++max1 : 1 );//will use the incremented value of max unless max was null (else use 1 instead)          for(Integer i=0; i< (3 - num1.length() ); i++){ //should pad with leading zeros to ensure format of {000}             num1 = '0' + num1;         }         theQuote.US_Invoice__c = 'ZO - ' + num1;      }       else if(!thequote.Opportunity.Account.Region__c.contains('US')) {          String num2 = String.valueOf( (max2 != null) ? ++max2 : 1 );         for(Integer i=0; i< (3 - num2.length() ); i++){ //should pad with leading zeros to ensure format of {000}             num2 = '0' + num2;         }         theQuote.ROW_Invoice__c = 'ZO - ' + num2;    }  } }


Suppose that $A, B,$ and $C$ are independent random variables, each being uniformly distributed over $(0,1)$. What is the probability that $AX^2 + BX + C$ has real roots?  I am given a hint that if $X$ ~ uniform $(0, 1)$, then $-\ln(X)$ is exponential. The sum of two (or more) independent exponential random variables is gamma...  How does this hint help answer this question?  Thanks a lot

The following is a homework question for which I am asking guidance.     Let $A$, $B$, $C$ be independent random variables uniformly distributed between $(0,1)$. What is the probability that the polynomial $Ax^2 + Bx + C$ has real roots?   That means I need $P(B^2 -4AC \geq 0$). I've tried calling $X=B^2 -4AC$ and finding $1-F_X(0)$, where $F$ is the cumulative distribution function.  I have two problems with this approach. First, I'm having trouble determining the product of two uniform random variables. We haven't been taught anything like this in class, and couldn't find anything like it on Sheldon Ross' Introduction to Probability Models.  Second, this strategy just seems wrong, because it involves so many steps and subjects we haven't seen in class. Even if I calculate the product of $A$ and $C$, I'll still have to square $B$, multiply $AC$ by four and then subtract those results. It's too much for a homework question. I'm hoping there might be an easier way.


Do you know any tutorial for create document class?   I create my own documentclass by editing book class but not everything works fine.  Thanks for help.

What are some good tutorials on writing custom styles (classes) that clearly explain commands used and some of the features that TeX has to offer in the way of styles?


I’ve been talking to a sugar daddy for a couple days and he wants to mobile transfer me 200$. He wants me to buy 150$ worth of google play gift cards for him and then keep 50$ for myself. Is this a scam?

This is a really weird situation. A guy contacted me regarding a business I have. He offered far in excess of my stated fees and even told me he could help me financially if I needed it, which I do. He said he was a doctor. Before he even showed up, he gave me his bank account and routing number and full name, which I used to pay some utility bills. All the payments went through. He also sent me $2500 through PayPal, and I received an email that I had received the payment, though it's been 24 hours and it still hasn't shown up in my "recent activity" in my account. But at the time when I met him, I had no reason to doubt the whole thing was real.   So we met, and through conversation he seemed totally legit. Halfway through our session, he abruptly left — he claimed he was being called in to the hospital. He had already received some, but not all, of the services we had agreed to. He said he would come back in a few hours. Oh yeah, and since the PayPal funds hadn't gone through yet, and I needed cash to pay rent, he said his "financial advisor" would be wiring me $800 a couple hours later. Well, I never heard back from him and never got a call about a wire transfer. In retrospect it all seems very obviously a scam, except for the fact that he gave me a bank account number that actually worked as far as paying some bills!  My question is, assuming the PayPal payment never goes through — I never got an email saying that it was cancelled, but it isn't showing up in my payments either. I'm planning on calling PayPal if it hasn't gone through by tomorrow. But assuming that payment doesn't go through, how can I use the bank account info to get the payment he promised me as far as the services I provided? Other than paying all my utilities in advance? You'd think with an account number and routing number and full name, I would be able to withdraw money somehow, but I really have no idea how. And since it isn't under my name, I can't make a payment on my student loans. I wouldn't take more than he owed me, but it would really be nice to at least get that, even if I didn't get the $2500 he had promised me.   You always hear about not letting people see your account number and stuff like that, but it seems impossible to do anything with this info even though I have it! If scamming people with their bank account number is so easy, how do scammers do it? So I'm wondering two things:   What legal way can I take what I am owed from this guy? What illegal way do people use this info if they had it? I don't want to get in trouble, but I'm just curious because you always hear how easy it is.   (Oh, and I never actually saw his ID so I don't know that the name & bank info he gave me was actually his, he could have stolen it from someone, though he really didn't seem like a hacker — he was a middle aged black man who was very smart-sounding, polite, soft spoken, and he seemed to have a lot of knowledge that a real doctor would have. I have a college degree and am very skeptical in general and careful about not being scammed and I've never had an experience even close to this, and the whole time I kept thinking "is this guy for real?" but since the utility stuff had gone through, it seemed legit. And nothing he did sent up a red flag like he might be a criminal or something. But later I googled the name and couldn't find a doctor by that name, at least not in the state he said he lives in. And since he said he would be contacting me last night, and he never did, it seems obvious that he planned the whole thing, but it just makes no sense to me.)


Every time I join a Minecraft server after being disconnected, I time out just as I finish loading in. I can connect to other servers when this happens with no issue. The issue will persist until either I turn off my computer completely and then let it sit for some time/completely remove all power or if I restart my internet entirely. This issue seems to appear every time after I disconnect from a server for any reason other than me clicking disconnect directly. I have checked firewall settings, anti-virus settings and I know that nobody else on the server is experiencing this issue. I have logged out and back in of my account, changed my Minecraft skin to force my account to update the whole nine yards. This is very frustrating as I don't want to have to completely restart my internet every single time I get disconnected from the server due to afk or whatever. My ping isn't the best with the server, its usually around 120ms with some variation however my connection is consistent.

My LAN server won't let my cousin join me or me join my cousin. It won't show up on the multiplayer screen - it keeps saying "scanning for LAN servers" but it never finds it. I am at his house and we use different computers but it won't connect. How can I fix this?