I know you can add alias commands in Linux to the .bashrc file, but Window 7 definitely does not use bash.  Where and how can I add alias commands for use in the command prompt cmd.exe?
How can I make command aliases in Windows' Command Prompt like I would with bash?  I found out about doskey in , so I can do something like:  doskey ls=dir /b   ...and now the command ls acts a little more like ls on Unix.  (I type ls so often in cmd, it isn't even funny.)  But how do I get this to stick between sessions?  It goes away the next time I open cmd.exe.  (Is there something like .bash_profile?)
Mandatory child record when creating parent record I created one event receiver and deployed it, but only users who are site collection admins are able to view this web part. I have included the SPSecurity.RunWithElevatedPrivileges but the same thing. What am I missing?  Below is my code   public override void ItemAdding(SPItemEventProperties properties)     base.ItemAdding(properties);     SPSecurity.RunWithElevatedPrivileges(delegate()        {SPWeb web = properties.OpenWeb();         base.ItemAdding(properties);         string name= web.Lists[properties.ListId].Fields["first name"].InternalName;          var list = web.Lists["location names"];    });} How do you turn off developer mode on an s5? I turned developer options 'off', but is there anything else that needs to be done? Not my phone so don't want to mess anything up :-) "Whether or not" vs. "whether" This will depend on whether he's suitable for the job.    This will depend on whether he's suitable for the job or not.   This will depend on whether or not he's suitable for the job.         It is still not defined whether we're following that approach.   It is still not defined whether we're following that approach or not.   It is still not defined whether or not we're following that approach.         "Or not" doesn't really seem to be needed to complement "whether". Why do people use it then? Is it redundancy and nothing more? Or is it for emphasis? Or are there cases when "or not" is required for the sentence to be grammatical? Let $f_n(x) : \mathbb{R} \rightarrow \mathbb{R}$ be defined as $\dfrac{x}{n}$. Is $f_n$ uniformly convergent?   With "$(a_n)$ is limited and $(b_n)$ converges to 0 $\Rightarrow (a_nb_n)$ converges also to 0" i would guess that $x\cdot \dfrac{1}{n}$ converges uniformly but $x$ is not limited in this case. So does ist converge uniformly or not? Question about the Euclidean ring definition I recently came across the following definition for a euclidean ring:  There exists a function $g:R\to\Bbb N_0$ with the following properties:  1.) $\forall x,y \in R$ with $ y \neq 0$ there exist $q,r \in R$ with $x = qy + r$ where $r=0$ or $g(r) &lt; g(y)$.  2.) $\forall x,y\in R\setminus\{0\}$ we have $g(xy)\ge g(x)$  What I don't understand, is the point of the second requirement. I have seen definitions where this is not a requirement. What does 2.) achieve?   Thanks very much Pointer to class data member "::*" Non-algebraically closed field in which every polynomial of degree $<n$ has a root My problem is to build, for every prime $p$, a field of characteristic $p$ in which every polynomial of degree $\leq n$ ($n$ a fixed natural number) has a root, but such that the field is not algebraically closed.  If I'm not wrong (please correct me if I am) such a field cannot be finite, by counting arguments. But on the other hand, the union of all finite fields (or of any ascending chain of finite fields) of characteristic $p$, which is what I get if I start with $F_p$ and add a root to each polynomial of degree $\leq n$ in each step, is the algebraic closure of $F_p$, hence algebraically closed. I don't see how I can control this process so that in the end I get a field that is not algebraically closed.  Any hint will be welcome. Thanks in advance. How can I remove Amazon search results from the dash or disable the feature? How can I disable Amazon search results in the Dash? Inverse public-key encryption I'm in the need of an inverse public-key encryption method where you encrypt with the private key and decrypt with the public key. In other words an asymetric encryption where you can't generate the encryption key from the decryption key. Does such encryption exist? If yes which, and which would be the fastest?  If nothing like that exists I would be glad if you helped me out with my situation:    I need to authenticate users logging in from my Java application in the way that the response from the server cannot be falsified and thus giving the user full access to the application. Using public key encryption was an obvious method, I would decrypt data received from the client to confirm the credentials. This won't work because if someone manages to decompile and get the private key from the code, they would be able to generate the public key, which would make them able to crack my application again. So any ideas how I can get this secure? I have a shapefile with 3800 polygons representing the smallest administrative areas in Ireland. Many of these, in rural areas, have tiny populations, under 100 people. In urban areas, all would have adequate populations.  For each area I have a population figure, and various other attributes, all of which can be intelligently summed to give valid results for areas produced by combining the smaller areas.  I need to merge the areas to get say, 500 or 600 areas of reasonable population. I need to leave the larger (in population) areas alone, where possible. I would greatly prefer to do this automatically. This is necessary for model fitting purposes, primarily.  I've looked at a number of the dissolve questions here:   'Batch Dissolve Polygons based on Attributes in QGIS or FWTools' I think would require me to know which areas to merge, when this is what I need to calculate. 'Practical way of managing polygons and unions of them' and 'How do dissolve polygons from shapefile using open source tools?' have the same issue.   Any suggestions? I have these two CREATE TABLE statements:   CREATE TABLE GUEST (   id int(15) not null auto_increment PRIMARY KEY,   GuestName char(25) not null );  CREATE TABLE PAYMENT (   id int(15) not null auto_increment   Foreign Key(id) references GUEST(id),   BillNr int(15) not null );   What is the problem in the second statement? It did not create a new table. Permalink rewrite with custom post type and custom taxonomy I think thats a quick one:  I've got:   Custom post type: Food  Custom taxonomy (Registered to Food): Fruits Terms in Fruits: Apple, Orange, Cherry   If I type in example.com/food?fruits=Apple,Cherry, I get all posts in Fruits with the terms Apple and Cherry, thats great!  But I would like to type in example.com/food/fruits/Apple,Cherry or example.com/food/Apple,Cherry to get the same result.  I´ve tried different permalink and rewrite plugins related to custom posts but nothing helped.  Thank you,  David At some point, the filesystem on my digital audio player has become read-only. I cannot copy files into it or remove files on it.  Are there some possible reasons for the player's file system to change permissions in this way?  I tried using chmod:  $ sudo chmod a+rw SGTL\ MSCN/  chmod: changing permissions of `SGTL MSCN/': Read-only file system   SGTL MSCN is the mount point of the digital audio player.  What else can I try to make it writeable? Galois Group of $\sqrt{2+\sqrt{2}}$ over $\mathbb{Q}$ Proof Check: Every Cauchy Sequence is Bounded How do i prove invertibility of this linear transformation Foreword  This question was inspired by initial mistakes in . I wanted to explore the strange circle with $A&gt;\pi r^2$ and got lost into geometrical jungle.  A  is usually described by it's height $h$, radius of the base $a$ and radius of the sphere $r$. Besides we have a relation $a^2+(r-h)^2=r^2$ so the cap actually only has two degrees of freedom.  When considering a case of circle on a sphere (like the Earth), it's the surface of a spherical cap, but we can't see the height or other classic parameters of this spherical cap. Instead we encounter parameters like area $A$, perimeter $C$ and diameter $d$. I will try to write formulae for these: $$A=2\pi rh$$ $$C=2\pi a$$ $$d=2r\theta$$  Where $\theta$ is introduced with $\sin\theta=\frac{a}{r}$ or $\cos\theta=(1-\frac{h}{r})$.  As the cap only has two degrees of freedom, it should be a good problem with unique solution if only two values are known.  A-C Problem  The simple example: $A$ and $C$ are given. I show this only as example before the other tasks.  We can easily find $a=\frac{C}{2\pi}$ and then solve:  $$A=2\pi rh = 2\pi r (r-\sqrt{r^2-a^2})$$  to obtain  $$r=\frac{A}{2\sqrt{\pi(A-\pi a^2)}}$$  Parameters $a$ and $r$ are now known and it is straightforward to find $h$, $d$, $\theta$ and anything else.  C-d Problem  $C$ and $d$ are given.  First step once again is easy: $a=\frac{C}{2\pi}$. The knowing of $a$ suggests that we might prefer the $\theta$ definition with the sine. We obtain: $$d=2r\theta=2r\arcsin\frac{a}{r}$$  That's where I got stuck. Is there an easy way to solve this? Is there a hard way to solve this?  I tried solving numerically with Wolfram Mathematica and it went into complex numbers. When solving the geometrically equivalent $\sin\frac{d}{2r}=\frac{a}{r}$ I got some roots, but the search seemed very unstable and not finding the root closest to initial value. Besides it was finding a lot of different roots while I am pretty sure that there should only be one $r$ for each pair of $d$ and $a$. What would be the right formulation to solve this problem numerically?  A-d problem  $A$ and $d$ are given. This seems the hardest one. We obtain a system of equations:  $$A=2\pi r h$$ $$d=2r\arccos\left(1-\frac{h}{r}\right)$$  (The first equation suggested solving the problem in $h$ and $r$).  Is this system solvable analytically? Or numerically? My experiments with Wolfram Mathematica never converged.   Of course, I could express $h$ or $r$ from the first equation and leave only the second in one of these forms: $$d = 2r\arccos\left(1-\frac{A}{2\pi r^2}\right)$$ $$d = \frac{A}{\pi h}\arccos\left(1-\frac{2\pi h^2}{A}\right)$$  But I have no idea how to solve these either. RMSE vs Standard deviation in population Mann-Whitney U test and K-S test with unequal sample sizes