How do I output a suggestion for a user to accept and use as input?

What can I do to leave the cursor on the same line of the suggestion in a Bash script?  Bash version = 3.2.51  It's purpose is to suggest a string so that the user should only press Enter.  #!/bin/sh echo "@@@@@@@@@@ @ Enter the new plarform name [for example: our-platform-7.26-2.17-res4]: @@@@@@@@@@" echo "our-platform-7.26-2.17-res4" read SuggestDefaultPlatform  echo "Stored name: " ${SuggestDefaultPlatform}   which prompts:  @@@@@@@@@@ @ Enter the new plarform name [for example: our-platform-7.26-2.17-res4]: @@@@@@@@@@  our-platform-7.26-2.17-res4 _   where the underscore "_" stands for the cursor.  I don't want to use a "Y/n" logic workaround, assigning a default value to the "SuggestDefaultPlatform" variable  SuggestDefaultPlatform='our-platform-7.26-2.17-res4';   and then prompt a question like:  Are you okay with `'our-platform-7.26-2.17-res4'` as your platform name? [Y/n]...   Instead the user might want to change just a few digits of a prompted suggestion and press Enter. See below the cursor "_" at the end of the "SuggestDefaultPlatform" variable:  @@@@@@@@@@ @ Enter the new plarform name [for example: our-platform-7.26-2.17-res4]: @@@@@@@@@@  our-platform-7.26-2.17-res4_   so that the user can move the cursor, modify the suggestion and/or press Enter.  our-platform-7.26-2.17-res_ our-platform-7.26-2.17-re_ our-platform-7.26-2.17-r_ our-platform-7.26-2.17-_ our-platform-7.26-2.17_ our-platform-7.26-2.1_ our-platform-7.26-2.18-alpha1_   Press Enter.  which prompts:  Stored name: our-platform-7.26-2.18-alpha1


When can we add a total time derivative of $f(q, \dot{q}, t)$ to a Lagrangian?

The other day, I was listening to  on the Lagrangian for a charged particle in an electromagnetic field, and at one point in the video, the lecturer mentions that we can add any total time derivative of a function $f(q, t)$ to the Lagrangian without altering its equations of motion.   This is nothing new to me, and I understand it fully, but shortly afterwards (approximately two minutes after the linked starting point), he goes on to say that you can, in fact, add a total time derivative of a function $f(q, \dot{q}, t)$, given certain conditions. This definitely surprised me, and I would love to know more about it, but the lecturer quickly moves on, so my question is as follows: under what conditions can one add the total time derivative of a function which depends on the particle's generalized velocities in addition to its generalized coordinates and time without affecting the particle's equations of motion?


Is it possible to downgrade from 14.04.1 64-bit to 32-bit as an old PC is having real trouble running 64-bit.


Recursive Alegbraic Equation for binary trees?

Consider the number $b_h$ of binary trees of height $h$, where height is being measured by the number of levels. An empty tree has height $0$, a single node binary tree has height $1$, and there are three trees of height $2$. Find a recursive algebraic equation for a sequence $b$, and prove for all natural numbers $h$ that $b_{h}$ is the number of binary trees of height $h$.   Assuming $b_{1} = 1$ binary Tree.  Then $b_{2} =  3$ binary Trees.  The difference is increasing by $+1$, $+2$, ..., $+(h-1)$.  How can we get the recursive algebraic equation for this? I'm really confused.


How to randomly shuffle tiny spheres inside a big sphere?

I have a list of spheres with some known characteristics (ids, radii, masses, and positions) with ids, radii, and masses being 1D arrays with shape (511, ) and positions being 3D array with shape (511, 3) inside some big spherical volume with known center, (0, 0, 0) and radius, distance_max. hal_ids_data = np.array([19895, 19896, ..., 24249])                    hal_radiuss_data = np.array([1.047, 1.078, ..., 3.263])                  hal_masss_data = np.array([2.427e+06, 8.268e+06, ..., 8.954e+07]      hal_positions_data = np.array([np.array([-33.78, 10.4, 33.83]), np.array([-33.61, 6.34, 35.64]), ..., np.array([-0.4014, 4.121, 33.05])])  I would like to randomly place these tiny spheres throughout the volume within the big sphere while keeping their individual characteristics intact meaning only their positions need to be shuffled subject to two constraints shown below. for hal_id, hal_position, hal_radius, hal_mass in zip(hal_ids_data, hal_positions_data, hal_radiuss_data, hal_masss_data):      # check if 1) any one of the small spheres are above some mass threshold AND 2) inside the big sphere     if ((np.sqrt(pow(hal_position[0], 2)+pow(hal_position[1], 2)+pow(hal_position[2], 2)) < distance_max) and (log10(hal_mass)>=1e8)):          # if so, then do the following stuff down here but to the shuffled populations of small spheres meeting the conditions above rather than to the original population  What is the fastest and shortest numerical algorithm to shuffle my small spheres under the last if statement before doing some stuff on them? (I do need my original population info though for later use so I cannot disregard it)


How to calculate time difference in PHP and store the time difference in mysql database

I have a table in the database with the name attendance. It has three columns: intime, outtime and work_hours. I have date and time in intime and outime. Now I want to write the php code to calculate the time difference in the format hh:mm:ss to store into the column work_hour of attendance table.  Please help me out.


Prove that the supremum of the set $A = \{x \in \Bbb Q \; | x^2 < 2\}$ is $\sqrt{2}$ in $\Bbb R$

Let $A = \{x \in \Bbb Q \; | x^2 < 2\}$.  Prove that $\sup_{x \in A}\, (x) = \sqrt{2}\;$ in real line $\Bbb R.$  I could prove the case in the rational line where no supremum exists. In $\Bbb R, $ it is easy to see that the supremum exists due to least-upper bound property (we know that 2 is an upper bound of $A$). But I don't know how to prove that supremum is equal to $\sqrt{2}\,$ in $\Bbb R$.


Datasets with same geographic and projected coordinate systems, appearing in different locations

I have two different sets of data (multiple shapefiles in each), when I import dataset 1 lets call it, into ArcMap it displays this error message:  I then use Define Projection tool on dataset 1 which adds its geographic as well as projected coordinate system which is exactly the same as dataset 2 yet they plot in different locations within ArcMap, but they should overlay with each other:   I have also tried to Define a coordinate system with the Define tool followed by the Project tool on dataset 1 but that doesn't work either. Both datasets should be plotting in the same location. Any solution to this?


which one is correct?  An evaluation of the Cronicle interface suggests that Cronicle helped the participants to find data accurately.  or  An evaluation of the Cronicle interface suggests that Cronicle helped the participants find data accurately.


After the latest Ubuntu updates, I have not been able to open virtualbox, on starting it gives me an error saying the kernel driver is either not loaded or set up properly and that I should reinstall virtualbox-dkms package. After removing virtualbox, and trying to reinstall I get the error below: ERROR: Cannot create report: [Errno 17] File exists: '/var/crash/virtualbox-dkms.0.crash' Error! Bad return status for module build on kernel: 5.8.0-34-generic (x86_64) Consult /var/lib/dkms/virtualbox/6.1.10/build/make.log for more information. dpkg: error processing package virtualbox-dkms (--configure):  installed virtualbox-dkms package post-installation script subprocess returned error exit status 10 dpkg: dependency problems prevent configuration of virtualbox:  virtualbox depends on virtualbox-dkms (>= 6.1.10-dfsg-1~ubuntu1.20.04.1) | virtualbox-source (>= 6.1.10-dfsg-1~ubuntu1.20.04.1) | virtualbox-modules; however:   Package virtualbox-dkms is not configured yet.   Package virtualbox-source is not installed.   Package virtualbox-modules is not installed.   Package virtualbox-dkms which provides virtualbox-modules is not configured yet.  dpkg: error processing package virtualbox (--configure):  dependency problems - leaving unconfigured dpkg: dependency problems prevent configuration of virtualbox-qt:  virtualbox-qt depends on virtualbox (= 6.1.10-dfsg-1~ubuntu1.20.04.1); however:   Package virtualbox is not configured yet.  dpkg: error processing package virtualbox-qt (--configure):  dependency problems - leaving unconfigured No apport report written because the error message indicates it's a follow-up error from a previous failure.                             No apport report written because the error message indicates it's a follow-up error from a previous failure.                                                         Processing triggers for menu (2.1.47ubuntu4) ... Processing triggers for bamfdaemon (0.5.3+18.04.20180207.2-0ubuntu2) ... Rebuilding /usr/share/applications/bamf-2.index... Processing triggers for desktop-file-utils (0.24-1ubuntu3) ... Processing triggers for mime-support (3.64ubuntu1) ... Processing triggers for hicolor-icon-theme (0.17-2) ... Processing triggers for gnome-menus (3.36.0-1ubuntu1) ... Processing triggers for systemd (245.4-4ubuntu3.3) ... Processing triggers for man-db (2.9.1-1) ... Processing triggers for shared-mime-info (1.15-1) ... Errors were encountered while processing:  virtualbox-dkms  virtualbox  virtualbox-qt E: Sub-process /usr/bin/dpkg returned an error code (1)  This happens even when I boot from the previous kernel using the grub menu, any help would be very appreciated. I have also tried to use aptitude to remove any conflicting versions of virtualbox from other repositories but still the same issue.


How can I avoid SQL injection attacks in my ASP.NET application?

I need to avoid being vulnerable to SQL injection in my ASP.NET application. How might I accomplish this?


NullPointerException on an initialized variable?

I saw the question asked in  but I believe I correctly called my layouts in order then interacted with the Activity/Fragment's views.  My issue is when I initialized a variable inside a constructor, I tested it for it's null status and it turns out fine... until the app continues into another method, then it magically becomes null again... Maybe there's some other Android technicality that is crashing my program that I don't know about?  ServiceStatusFragment (is the entry point of the program, gets loaded from MainActivity)  public class ServiceStatusFragment extends Fragment { private final String LOG_TAG = getTag(); private static final String ARG_SECTION_NUMBER = "section_number";  private View rootView; private ListView listView;  private ServiceStatus serviceStatus;  private PopulateList populateList;  public static ServiceStatusFragment newInstance(int sectionNumber) { //gets called when app starts     ServiceStatusFragment fragment = new ServiceStatusFragment();     Bundle args = new Bundle();     args.putInt(ARG_SECTION_NUMBER, sectionNumber);     fragment.setArguments(args);     return fragment; }  public ServiceStatusFragment() { }  @Override public void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState); }  @Override public View onCreateView(LayoutInflater inflater, ViewGroup container,                          Bundle savedInstanceState) {     rootView = inflater.inflate(R.layout.fragment_main, container, false);      listView = (ListView)rootView.findViewById(R.id.status_list);      listView.setAdapter(new StatusListAdapter(rootView.getContext())); //sets up adapter, pass in context     return rootView; }  @Override public void onAttach(Activity activity) {     super.onAttach(activity);     ((MainActivity) activity).onSectionAttached(             getArguments().getInt(ARG_SECTION_NUMBER)); }   StatusListAdapter  public class StatusListAdapter extends BaseAdapter { private final String LOG_TAG = StatusListAdapter.class.getSimpleName();  private Context c; private ServiceStatus serviceStatus = new ServiceStatus();  public StatusListAdapter(Context c){     this.c = c;     Serializer serializer = new Persister();     try {         //deserialize XML as per Simple XML java library         serviceStatus = serializer.read(ServiceStatus.class, c.getResources().openRawResource(R.raw.servicestatus));     } catch (Exception e) {         e.printStackTrace();     }      //DEBUG STUFF, (none of this gets displayed to logcat)     if(serviceStatus == null)         System.out.println("NULL BITCH!!");     if(c.getResources().openRawResource(R.raw.servicestatus) == null)         System.out.println("FILE  NULL HOE!!"); }  @Override public int getCount() {     return serviceStatus.getSubways().size(); //Logcat shows NullPointerException!?!?? }  @Override public Object getItem(int position) {     return serviceStatus.getSubways().get(position); }  @Override public long getItemId(int position) {     return 0; }  static class StatusRowItemHolder {     TextView lineText;     TextView statusText;     TextView dateTimeText; }  //TODO: Check efficiency, doesn't seem right in teh logcatz. Getting Tags, then inflating views? @Override public View getView(int position, View convertView, ViewGroup parent) {     StatusRowItemHolder srih;      //some view initialization stuff...      return convertView; }   LogCat shows the serviceStatus variable I initialized in the constructor is null when the adapter's getCount() method is called, why is that?  Logcat (not showing correctly on here)


Showing the irreducibility of a polynomial

I am asked to show that $f(X)=X^5 - aX -1$ is irreducible over $\mathbf{Z[X]}$ unless $a=0,2,-1$. ($\mathbf{Z}$ being the ring of integers.)  I have been able to do this, but my solution is a lengthy one.  I used the fact that if $f$ is not irreducible, then we have $f(X)=g(X)h(X)$, where $g$ and $h$ are polynomials over $Z$.   We can ignore the case where either one is constant, because the g.c.d. of the coefficients is 1. Hence,there are two possibilities - one where one of the polynomials is linear, and the second where one of them has degree 2 and the other has degree 3. For the first case, f must have a rational root, and it is easy to show that this is only possible if $a$ is either $0$ or $2$.   In the latter case, we can assume $g(X)= AX^3 + BX^2 + CX + D$ and $H(X)= A'X^2 + B'X +C'$, after which a laborious calculation involving comparing coefficients shows that that only possibility is $a=-1$.   However, I feel that there is a much more simple and obvious solution that I am missing. Since the coefficients of $f$ have g.c.d 1, f is irreducible over $Z$ iff it is irreducible over $Q$. I was wondering if there was any way in which we could perhaps use that to find a shorter solution.   Thanks in advance!


I learn that any work needs a source of energy, the work of gravity force  (like keeping the Moon in the orbit by the Earth gravity force) comes from where? Can we find any mass reduction (transform to energy source) during the time?


I'm looking for a trick, or a quick way to evaluate the sum $\displaystyle{\sum_{n=1}^{99}\sin(n)}$. I was thinking of applying a sum to product formula, but that doesn't seem to help the situation. Any help would be appreciated.


Constructing a Borel set A on R such that $0<m(A \cap I) < m(I)$ for all intervals $I$.

I need help constructing a Borel set $A$ on $\mathbb{R}$ with the following property:  For every open interval $I$,  $$0<m(A \cap I)< m(I)$$  A obviously needs to be dense in $\mathbb{R}$ and it also must have empty interior, but honestly I don't know what to do from here on.  Even the generalized cantor set doesn't have positive measure for all the sub intervals it is constructed on.....


Can the real and imaginary parts of $\dfrac{\sin z}z$ be simplified?

I have calculated the real and imaginary parts of $\dfrac{\sin z}z.$ I've obtained  $$\begin{eqnarray} \frac{\sin z}z&=&\frac{\sin(x+iy)}{(x+iy)}\\ &=& \frac{\sin(x)\cosh(y)+i\cos(x)\sinh(y)}{x+iy}\\ &=& \frac{x\sin(x)\cosh(y)+y\cos(x)\sinh(y)}{x^2+y^2}+i\frac{x\cos(x)\sinh(y)-y\sin(x)\cosh(y)}{x^2+y^2}. \end{eqnarray}$$  Before calculating it, I hoped I could use this in a solution to a certain problem, but I would need to differentiate the real and imaginary parts of $\dfrac{\sin z}z$ with regard to $x$ and $y$. But what I'm getting is very complicated. I understand that it could be that that's just the way it is. But maybe there are some simplifications to be done either in the functions or in their derivatives? I've never really used hyperbolic functions before so I'm not sure I'm not missing something.  Added. The problem I'm working on is the following.     Prove that the solutions of the equation $$\tan z=z$$ are all real.   I will sketch the solution I know here.  It can be calculated that  $$\tan(x+iy)=\frac{\sin(2x)}{\cos(2x)+\cosh(2y)}+i\frac{\sinh(2y)}{\cos(2x)+\cosh(2y)}.$$  Plugging this to the equation, we get  $$\begin{eqnarray} x&=&\frac{\sin(2x)}{\cos(2x)+\cosh(2y)}\\ y&=&\frac{\sinh(2y)}{\cos(2x)+\cosh(2y)}. \end{eqnarray}$$  From this we can get   $$\sin(2x)\cdot2y=\sinh(2y)\cdot2x.$$  By plotting the functions $\sin,$ $\mathrm{id}$ and $\sinh$ (and proving the right inequalities we can see from the plots), we can see that this is only possible when $xy=0$. But when we plug $x=0$ to the second equation, we can show that the only solution is $y=0$, which ends the proof.  What strikes me in this solution is the fact that $\dfrac{\sin z}z$ is used. (Not explicitly in my statement.) This function has another connection to the problem:     The non-zero solutions of the equation $\tan z=z$ are exactly the zeros of the derivative of $\dfrac{\sin z}z.$   This is easy to prove. I wondered if there shouldn't be a solution to the problem which uses this fact, given that $\dfrac{\sin z}z$ appears in the solution I know.


Illustrator space around outline and removing shape

I've used "//" and "\" to create this "W", and have made them into outlines, as I'm trying to give the different layers a colour, as well as having a white space where the lines touch and I would like to remove the top of the second "\".   I'm struggling with the white space at the moment and now I've added a stroke, the fill has decreased. Is there another way I could do this?   I've also tried to use my pen tool to remove the top of the "\" but when using "Path Finder" I cannot find an option to "Minus Forward". I'm a newbie so any advice would be lovely :)


I am flying home (Minneapolis) from London after Christmas, and I realized too late that my ticket has me flying into JFK then out of Newark. I land 2:50pm on Sunday (Jan 3rd), then my flight out of Newark leaves at 7:01pm. Is that enough time? If so, what is the quickest way? I won't have a ton of stuff, so I'm not averse to public transport. The best options seem to be:   Airtrain from JFK to Jamaica, LIRR from Jamaica to Penn Station, then the NJ transit train from Penn Station to Newark. I don't know how long this will take. The ETS shuttle. I put in my flight info and they recommend a 4:30 shuttle which would get me to Newark around 6, for $31.    Can anyone tell me how long I should expect to take to get through customs in JFK and I like the first one slightly more, since there is more flexibility (I think), but not if it takes significantly longer.  Any other advice would be appreciated - maybe this is an unrealistic transfer, and I'd be better off looking for a refund.  EDIT: Thank you everyone. I called the airline and got a refund, they barely put up a fight so I think they realized they shouldn't have sold me the ticket. Anyway, you guys were super helpful, thanks again.


Silk Option Missing from Cloth in Psychics Tab

I am trying to make a bed in Blender as part of a personal project but the Silk option is missing under the cloth in the Psychics tab. I have made the surface below have a collision put on it, but I just can't find it! Any help?


I reset my Chrome browser, now I lost all logins, how do I get them again?

Facebook, youtube, reddit, quora, etc... all are signed out.  I have another PC which hasn't synced using Internet (still not connected), can I use that to get logins again?  I can manage with some websites, but I'm afraid I would need logins for websites which I have forgot the password of.


How much willpower do gravely wounded soliders lose?

How much willpower do gravely wounded soldiers lose? The text says they suffer a permanent reduction?


Why are some related badges not grouped in the Badges Page?

I have seen that the  has recently been updated. I like the way this was done, but some related badges are not grouped, like these:  First bountys:   Altruist Benefactor Investor Promoter   First Questions:   Scholar Student  Tumbleweed   Messages in chat:   Outspoken Talkative   Flagged posts:    Deputy Marshal Citizen Patrol   Used x votes in a day:   Suffrage Vox Populi   Why is that so? Could these be grouped, like some others are?


Reversing a linked list in Java, recursively

I have been working on a Java project for a class for a while now. It is an implementation of a linked list (here called AddressList, containing simple nodes called ListNode). The catch is that everything would have to be done with recursive algorithms. I was able to do everything fine sans one method: public AddressList reverse()      ListNode:    public class ListNode{   public String data;   public ListNode next; }   Right now my reverse function just calls a helper function that takes an argument to allow recursion.  public AddressList reverse(){   return new AddressList(this.reverse(this.head)); }   With my helper function having the signature of private ListNode reverse(ListNode current).  At the moment, I have it working iteratively using a stack, but this is not what the specification requires. I had found an algorithm in C that recursively reversed and converted it to Java code by hand, and it worked, but I had no understanding of it.  Edit: Nevermind, I figured it out in the meantime.  private AddressList reverse(ListNode current, AddressList reversedList){   if(current == null)        return reversedList;   reversedList.addToFront(current.getData());   return this.reverse(current.getNext(), reversedList); }   While I'm here, does anyone see any problems with this route?


Small overlapping text on Related questions in MSE

Just noticed a minor css issue on this question:    The related questions on the right hand side have some overlapping text in Chrome:        (This only applies to this very site, Meta Stack Exchange)


How to remove red warning in a journal template?

I am using a LaTeX template provided by an academic journal on their website:  If you run the code, the template includes a red warning at the top of the document about the use of such template. Any suggestions on how to remove this warning? It seems that it is within the code itself because I don't see this text in the code. I am using this design for my assignment submission that will later turned into a journal submission. Thank you. Here is the original warning:  Authors are encouraged to submit new papers to INFORMS journals by means of a style le template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.  The code itself is here: \documentclass[msom,blindrev]{informs3}   \DoubleSpacedXI \usepackage{natbib}  \bibpunct[, ]{(}{)}{,}{a}{}{,}%  \def\bibfont{\small}%  \def\bibsep{\smallskipamount}%  \def\bibhang{24pt}%  \def\newblock{\ }%  \def\BIBand{and}% \TheoremsNumberedThrough   \EquationsNumberedThrough   \begin{document} \ARTICLEAUTHORS{% \AUTHOR{Author1} \AFF{Author1 affiliation, \EMAIL{}, \URL{}} \AUTHOR{Author2} \AFF{Author2 affiliation, \EMAIL{}, \URL{}}  }  \ABSTRACT{ Text of your abstract  }  \KEYWORDS{} \HISTORY{}  \maketitle  Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.  \end{document}  Update: I am not sure that an assumption posted in one of the comments below by cfr holds all the time. I find a plenty of working papers that look like mine but don't have that message. I am attaching screenshots of my paper vs. the other. Although the names of the journals are different, they belong to the same organization and when I try all original codes still have the same red message. My output:  Vs. a paper available online:


Linux Ubuntu Server - sudo chown -R user:user /

I accidentally gave all permissions of my system to another user who has neither a password nor a home directory.  I have complete physical access to the computer, and I'm currently logged in via SSH with key into the system as my user named "chronove"... the user chronove had access to sudo rights, however those are now gone as I ran the command:  $ sudo chown -R mc:mc /   To give you some more information:  $ sudo sudo: /usr/bin/sudo must be owned by uid 0 and have the setuid bit set   and  $ ll /usr/bin/sudo -rwxr-xr-x 1 mc mc 140944 Jan 14 00:41 /usr/bin/sudo*   I cannot access any other instance to the server via SSH or FTP to make any backups. My initial plan to solve this issue was to grab a backup of everything needed and reinstall the Ubuntu server. It seems I got read rights to all necessary files, however i'm unsure as to move several zip files across the only SSH connection I have (which would break on restart).


Why does OS X want me to "upgrade" from El Capitan to Yosemite Beta 4?

This is just silly:    If I try accepting (no, I wouldn't go through with it), it just says that the update is unavailable.  So why does it ask me to downgrade, and how do I get rid of this?


Programs for generating a character sheet

This is my first question.  I'm looking for a character sheet generator. For example, names, skills, attributes, missions. Dou you know a program (Web or desktop)?  A long time ago I read a question that indicates a program, but I forgot It.  EDIT:   I want generate an Medieval RPG game and a Cyberpunk RPG game


Relationship between Binomial distribution and the Beta distribution

I have been investigating the details of the Beta distribution and the Binomial distribution and have 2 questions to ask, but first a slight preamble to explain the background to my questions. In the following, I am assuming that the normal parameters for the Beta and Binomial distribution ($\alpha, \beta, n, k$) are positive integers greater than zero, and $x$ is the target probability that we are looking for.  So, in my investigation, I started with the equation for the Beta distribution in the form  $Beta(x|\alpha,\beta) = \frac {\Gamma (\alpha +\beta )}{\Gamma (\alpha) \Gamma(\beta )}x^{\alpha-1}(1-x)^{\beta-1} $ and the Binomial distribution in the form $Bin(x|n,k) = {\binom {n}{k}}x^{k}(1-x)^{n-k}$. Then using the fact that $\Gamma(x+1) \equiv x!$, I re-worked the equations for the Beta distribution and the Binomial distribution and came to the following set of four relationships between the two. They are all essentially the same, just expressed in different formats, i.e. going from Beta to Binomial, or Binomial to Beta, and interchanging their normal parameters. To get to the four relationships, the following intermediate relations were derived from the equivalence of the Beta and Binomial distributions:  $\alpha = k + 1; \beta = n - k + 1; n = \alpha + \beta  - 2; k = \alpha - 1$  The four relationships are:   $Beta(x|\alpha,\beta) = Bin(x|\alpha+\beta-2, \alpha-1)*(\beta+\alpha-1)$ $Beta(x|\alpha, \beta) = Bin(x|n,k) * (n+1)$ where $ n = \alpha + \beta  - 2$ and $ k = \alpha - 1$ $Bin(x|n,k) = \frac{Beta(x|k+1, n-k+1)}{n+1}$ $Bin(x|n,k) = \frac{Beta(x|\alpha, \beta)}{\alpha+\beta-1}$ where $\alpha = k + 1$ and $\beta = n - k + 1$   I tested these numerically and they agree, at least for the number set I used. As the above description is quite condensed, and I am happy to elaborate on how I reached these conclusions if required.  So  my questions are: 1. Is my analysis correct, and the conclusion that the Binomial and Beta distributions are closely linked as shown above? 2. If it is correct, can anyone point me to any references for more detail on these relationships?


Concerning the sequence $\Big(\dfrac {\tan n}{n}\Big) $

Is the sequence $\Big(\dfrac {\tan n}{n}\Big) $ convergent ? If not convergent , is it properly divergent i.e. tends to   either $+\infty$ or $-\infty$ ? ( Owing to $\tan (n+1)= \dfrac {\tan n + \tan 1}{1- \tan1 \tan n}$ and the non-covergence of   $\Big (\tan n \Big)$ it is easy to see that if $\Big(\dfrac {\tan n}{n}\Big) $ is convergent then the limit must be  $0$ , but I can not proceed further . )


How can I uninstall Ubuntu 19 and replace it with Windows 10?

I installed Ubuntu 19 but I now want to uninstall it and run it as a VM in Windows 10.   I have tried following suggestions here on Ask Ubuntu, e.g.entering through terminal root, going to GRUB on a memory stick boot. These did not help. Trying to access the CD Rom is no help either; I can't get out of my root drive directory.  I cannot manage to format the hard drive and install a copy of Windows 10 on the hard drive.  I am all about to give up throw the HDD out and buy another HDD.  I need step by step instructions all the way through to when it starts installing Windows from my CDRom.  When done I will use oracle to run a VM Ubuntu to learn how to use it.  I thought this old computer I am not using would be good to learn on but I was mistaken.


Test loops at the top or bottom? (while vs. do while)

When I was taking CS in college (mid 80's), one of the ideas that was constantly repeated was to always write loops which test at the top (while...) rather than at the bottom (do ... while) of the loop. These notions were often backed up with references to studies which showed that loops which tested at the top were statistically much more likely to be correct than their bottom-testing counterparts.  As a result, I almost always write loops which test at the top. I don't do it if it introduces extra complexity in the code, but that case seems rare. I notice that some programmers tend to almost exclusively write loops that test at the bottom. When I see constructs like:  if (condition) {     do     {        ...     } while (same condition); }   or the inverse (if inside the while), it makes me wonder if they actually wrote it that way or if they added the if statement when they realized the loop didn't handle the null case.  I've done some googling, but haven't been able to find any literature on this subject. How do you guys (and gals) write your loops?


How do you define a non-integer as even or odd?

Note that in this question, I will use the word non-integers to mean all rational non-integers. I've been working on problems on non-integers lately, and a few thoughts popped into my head.  How do you define non-integers as even or odd?   How do you define non-integers as prime or composite?  I thought of some of the possibilities. Do you round to the nearest integer and define parity on that? Do you take away the decimal point to find primes and composites? Or are non-integers described as neither even or odd, neither prime or composite? Any help on this would be appreciated greatly.


Do i need locks when accessing a class with getter and setter from different threads?

I'm writing some code where one thread is using setters from a class and another thread is using getters from the same class.  My question is do I need to use lock or is there no problem when the threads call the getter and setter at the same time?


Is it possible to get GIMP 2.10.4 work on Ubuntu 16.04?

I tried to install it from source, but there some dependencies problems, a lot and I don't know how to get them - it seems like they not in repo. Could you get GIMP 2.10.4 work on your Ubuntu 16.04 ? How to install (and where to get them) all necessary for dependencies ?


Slack shows opened links to browser as another slack instance in task bar

If I open a link sent to me on Slack, the new browser window opened shows up as 'another' Slack window. Is there any way to have it correctly group the new browser window with the existing browser windows? I'm on Ubuntu 18.04 running gnome.


How do I reset the 3d view from this state?

I am new to Blender. I have some experience with 3DS Max though.  I was trying to use the little triangular widgets at the bottom left and top right of a tab, and eventually ended up with 18 of them before I learned how to get rid of SOME of them. I am left with the Blender window below, and cannot get rid of whatever this is, to show me the usual 3D window any more. If I close blender and restart and load the same .blend file, I get the same result.    Help would be much appreciated.


I have to find the limit of this sum: $$\sum_{r=1}^{\infty}\cot ^{-1}(r^2+\frac{3}{4})$$  I tried using sandwich theorem , observing:  $$\cot ^{-1}(r^3)\leq\cot ^{-1}(r^2+\frac{3}{4})\leq\cot ^{-1}(r^2)$$  Now when I was calculating the limit of left hand expression, I convert it to $\tan^{-1}$, by using:  $$\tan^{-1}\frac{1}{x} = \cot^{-1}x$$  but couldn't sum up the terms of arctan series.     How can I proceed?   Is there any better way ?


How to orgnaize files while using function templates

I am trying to organize files while using function templates as shown in the following:  template <class T> T max(T a, T b) {     return a > b ? a : b; }  int main() {     cout << "max(10, 15) = " << max(10, 15) << endl;      retun 0;  }   I simply put the implementation of "max(T a, T b)" in a templateMaxFun.cpp and the following in templateMaxFun.h file:  template <class T> T max(T a, T b);   Then, I put #include "templateMaxFun.h" in the main.cpp. However, the compiler is complaining: "undefined reference to `int max(int, int)".  My question is: what is the correct way to put a template function prototype in the .h file? I am guessing my problem might be here.  Thanks for your help.


Polite or unrectified placement of the word please

I would please prefer to take both parts of the test on Monday.   Is the placement of the word please in this sentence grammatically correct?


Does lens pen actually work and solve the purpose for removing dust or finger print from lens?  How about the longevity of these pens?


Consider this code:  try {     int* test = (int*)0x00000001;     *test = 232; } catch(...) { }   I am getting a Access violation writing location 0x00000001. Is it possible to catch this in a simple way, or avoid my program crashing in an unpleasant way?


Sum of numerators divided by sum of denominators $\leq$ the maximum fraction

Let $\tfrac{a_1}{b_1},\dots,\tfrac{a_n}{b_n}$ where $a_i,b_i>0$. How can one prove that $$\frac{\sum_i a_i}{\sum_i b_i}\leq \max_j \tfrac{a_j}{b_j}$$?


I am trying to install PCAP-core-1.8.2/ () on CentOS release 6.2 and I keep getting the error when I run:       perl Makefile.PL  Can't locate File/ShareDir/Install.pm in @INC (@INC contains: /usr/local/lib64/perl5 /usr/local/share/perl5 /usr/lib64/perl5/vendor_perl /usr/share/perl5/vendor_perl /usr/lib64/perl5 /usr/share/perl5 .) at Makefile.PL line 24.   Line 24 is this:  use File::ShareDir::Install;   I see it can't find File/ShareDir/Install.pm so when I try and find this perl module:  locate Install.pm  I get this:  /usr/share/perl5/ExtUtils/Install.pm   and in my .bashrc file I added this directory - but I am not sure what is going wrong either in the PERL5LIB PATH or elsewhere? Any suggestions would be gratefully received.


Why can't we introduce a symbol $j$ for $\frac{1}{0}$?

If we introduce $j$ for $\frac{1}{0}$, then $\frac{2}{0}$ will be $2j$ and $\frac{3}{0}$ will be $3j$ ,etc.  So, I'm asking to call the solution of $x\cdot 0=1$ $j$ and discover properties of $j$ just like we did with $i$.  But, if we say $j\cdot 0=1$ for some $j$, then, since for any $j$, $j\cdot 0=0$, so it will give the contradiction $0=1$.  But, we can mend the rules for $j$. I mean, we follow the rule $\sqrt{a}\cdot \sqrt{b}=-\sqrt{ab}$ for negative $a$ and $b$. If we don't follow this rule, then this contradiction happens:  Let's suppose $i$ exists.  Then $i^2=\sqrt{-1}\cdot \sqrt{-1}=\sqrt{(-1)(-1)}=\sqrt{1}=1$, which is a contradiction, because we've assumed $i^2=-1$. So, $i$ does not exist.  But we changed the rules for $i$ to avoid this contradiction.  Then, why can't we change the rules for $j$ to avoid contradictions? I mean, we can say $x\cdot 0=0$ only if $x\neq j$.  EDIT: As a side note, why can't we define $\frac{1}{0}$ to be $\infty$? It seems soo.. intuitive to say that $\frac{1}{0}=\infty$ and $\frac{1}{\infty}=0$,


ecryptfs-recover-private doesn't accept my login passphrase

Ubuntu Live DVD (14.04 or 14.10)  $ sudo ecryptfs-recover-private  INFO: Searching for encrypted private directories (this might take a while)... INFO: Found [/media/ubuntu/4aaa62c3-5a78-4054-b804-2476d6c4ec42/.ecryptfs/pacmo/.Private]. Try to recover this directory? [Y/n]: Y  INFO: Found your wrapped-passphrase Do you know your LOGIN passphrase? [Y/n] Y INFO: Enter your LOGIN passphrase... Passphrase: Error: Unwrapping passphrase and inserting into the user session keyring failed [-5] Info: Check the system log for more information from libecryptfs   Why ? I insert my login password exactly


I've been working on a large multiplayer world. In it, I have set up a "P.A. System" using a command block chain, with all the blocks set to use the /say command to send messages in chat.    When I send a  signal through the chain, the first block (set to impulse, not chain, and unconditional) activates. Then the second block (set to chain and conditional) activates. The signal seems to end there, as the third block (set to chain and conditional) does not activate. Why is this setup not working?  I am playing Bedrock Edition, on my phone.


Give three non-isomorphic groups of order 24, and explain why they are not isomorphic.

I am not sure how to do this question, any help would be very much appreciated!


Why does the odd part of the function integrate to $0$?

When evaluating the integral $$\int^1_{-1}\frac{\cos(x)}{1+e^{1/x}}dx,$$ the author says that the odd part of the function integrates to $0$ over $-1$ to $1$. I have calculated the even part of the function ($\frac{1}{2}\cos(x)$), so the integral is equal to $\sin(1)$. But why exactly does the odd part integrate to $0$?


What is an intuitive explanation of the Hopf fibration and the twisted Hopf fibration?

As the question suggests, what is an intuitive explanation of the Hopf fibration and the twisted Hopf fibration? I not a topologist by trade and I find the concept kind of hard to understand... Thanks in advance.


I've been looking around SO and Google for a way to link to certain parts of an SO question or answer. For instance adding to the top of your question/answer links to header tags that are further down the page, via the id or name attributes. For instance here is an example of linking to one answer to a  question via the name attribute of the a tag and the id attribute of the div tag.  This is a name tag and div tag found in the source of one of the questions  asked on Super User.

  This links to an answer to the question asked on Super User by use of the name attribute. Link  This links to the same answer by use of the id attribute. Link   Here is the link to the question asked above -  Here is the link to the answer mentioned above -    and the only tags which are allowed attributes are the  and  tags and neither one allows name="" or id="", and 's title attribute is a global attribute in HTML5 that just shows a description when hovered over.  Basically I'm seeing if there is a way to do the following:  Assume this is my answer to a question on SO, and the link to the question is http://stackoverflow.com/questions/123/this-is-a-question.  This is my answer. It is very long and contains different sections split up by
 tags, but if you don't want to have to scroll through the whole question then just use a link provided below.      Section 1     Section 2     ...     Section 8
Section 1
 ... section 1 blah
Section 2
 ... blah ... ... blah blah blah ...
Section 8
   I'm sorry if this has been asked before, I searched Google and SO thoroughly, but maybe I didn't search for the right thing.


GR correction for the gravitational force

I have this expression for the gravitational force between 2 masses when the gr term is added:  $$F = - \frac{GMm}{r^2} + \frac{4G^2mM(M+m)}{r^4c^2}$$  which I got from the internet since I haven't bee able to find a similar expression in any book. But i'm not sure if it's right or needs fixing.  Is the second term in the force correct?


Type erasure is the process of removing generic information for backward compatibility on compiled class. Then, I can't know what type of class are the objects in a generic class, but in an inherited class, for example:  package generics.testing;  class Box<T> {     private T value;      public Box() {         System.out.println("GenericSuperClass: " + getClass().getGenericSuperclass());     }      public T getValue() {         return value;     }      public void setValue(T value) {         this.value = value;     } }  class IntegerBox extends Box<Integer> {}  public class GenericsTesting {     public static void main(String[] args) {         Box<String> box = new Box<>();         IntegerBox ibox = new IntegerBox();     } }   I get:  GenericSuperClass: class java.lang.Object GenericSuperClass: generics.testing.Box<java.lang.Integer>   My question is, why is that information generics.testing.Box<java.lang.Integer> preserved and where is stored?


Crash with error "No more room to grow table"

For the past week or so my computer has been crashing at least once a day with the same error.  *** Panic Report *** panic(cpu 2 caller 0xffffff8018318b7f): "No more room to grow table: 0x0xffffff8018ab3e00 size:262142, used:262141, requested elem:1"@/Library/Caches/com.apple.xbs/Sources/xnu/xnu-3248.60.10/osfmk/kern/waitq.c:594 Backtrace (CPU 2), Frame : Return Address 0xffffff802e83bd60 : 0xffffff80182dab52 0xffffff802e83bde0 : 0xffffff8018318b7f 0xffffff802e83be60 : 0xffffff8018316122 0xffffff802e83be70 : 0xffffff80182d43ac 0xffffff802e83bee0 : 0xffffff80182d1bb8 0xffffff802e83bf10 : 0xffffff80183b8eca 0xffffff802e83bfb0 : 0xffffff80183ecd86  BSD process name corresponding to current thread: Google Chrome He  Mac OS version: 15G31  Kernel version: Darwin Kernel Version 15.6.0: Thu Jun 23 18:25:34 PDT 2016; root:xnu-3248.60.10~1/RELEASE_X86_64 Kernel UUID: B5AA8E3E-65B6-3D0E-867B-8DCCF81E536C Kernel slide:     0x0000000018000000 Kernel text base: 0xffffff8018200000 __HIB  text base: 0xffffff8018100000 System model name: MacBookPro11,5 (Mac-06F11F11946D27C5)  System uptime in nanoseconds: 12138432578219   I've wiped the drive and re-installed El Capitan but I'm still getting the same issue.  I use this machine for software development, so there's a good amount of CPU and memory intense operations, a couple virtual environments, and I run Chrome Canary, Chromium, and Chrome which I know are big hogs as far as browsers go.  However, when running low on memory before I recall there being a dialog window that "Your system is low on memory" and I was able to close programs before a crash.  What would be causing this issue?  Hardware failure?  Memory leak in a program?  I notice that last process name is Google Chrome He so maybe it's just time I switch browsers...


The use of "random" to mean "arbitrary", "unidentified", "unknown", etc

I'm seeing the use of "random" instead of "arbitrary", etc., with increasing frequency. To me, "random" has a specific meaning and is not synonymous with these other words.  Is it correct to use it in this way?


In the ring $\mathbb Z_5[X]$ find associated elements with $X^3+4X^2+3X+2$   I know that I must find $a \in \mathbb Z_5[X]$ such that $a|(X^3+4X^2+3X+2)$ and $(X^3+4X^2+3X+2)|a$. Assume that this $a$ exist we have:  $$\exists _{c\in \mathbb Z_5[X]} (X^3+4X^2+3X+2)=ac $$ $$\exists _{d\in \mathbb Z_5[X]} a=(X^3+4X^2+3X+2)d $$  However, I don't know how to find such $ a $ quickly


I'm trying to use a .dmg file. I have it downloaded and everything but whenever I try to open it, it doesn't do anything. Am I doing something wrong?


Why use logistic regression instead of SVM?

I have a very basic question, but it's not really clear to me. When would one choose logistic regression over SVM? Maximum margin property seems more justifiable then whatever log. reg does. Is it because scores or interoperability?


Is Process builder a complete alternate for the triggers

I need to do some analysis on process builder for taking a decision on config vs coding.  Saying that process builder is the alternate for the Triggers for updating the child records.    After creating some processes I noticed the following.  1) It can update the child records after meeting a condition on the parent record.   --> Here my observation is what if we need to update only specific child records, that means we are running out of options in this case we can not exert conditions at child record level.  --> So far I came across the couple of posts on bulk update or inserts issues with the process builder. for reference   .    So here I would like to submit my analysis as process builder is not the complete alternate for the triggers since it has limitations on updating or inserting child records and also in doing the bulk updates/inserts.  My question is I am I analysing the right way or missing some thing and if there is any thing more can i add to it.


Get the name of the current method being executed

Well what I am basically doing is an app which has many activities. I have a few friends with android phones and I gave them the app for testing. However, it sometimes goes into endless cycles and does strange behaviour which I am not able to understand due to their lack of programming experience and inability to dump the logcat in those particular moments.   So what I need to do is to create a static always visible window, probably popup window, that shows in which method is the program now.   So my question would be, which is the best way to achieve this functionality and how to retrieve the current method the App is in (it has several threads).


Continuously differentiable functions inequality

Let $f:[a,b] \to \mathbb{R}$ be a continuously differentiable function with $f(a)=0$. Show that any such $f$ satisfies the following: $\int_{a}^{b} (f(x))^{2}dx \leq (a^{2}+b^{2})\int_{a}^{b} (f'(x))^{2}dx$ I was thinking along the lines of Cauchy-Schwarz inequality but am completely stuck. A detailed solution would be of great help. Thanks


How do I force an onclick event to load throughout the lifecycle of a page?

I have an onClick event on a button that is created using data returned from the server (via Ajax). The outline of my code is this:  $(document).on('pageinit', function() { $.ajax({     url: '/',     dataType: 'json',      type: 'POST',     contentType: 'application/x-www-form-urlencoded',     data: textInput,     success: function (response) {         if(response.error_code!=null){             alert(response.user_message);         }         else {          //code to generate button with id tag `cvResults`           $('#cvResults').click(function(e) {          // some code here, redirects to another mobile page         }         },//then remainder of ajax function   I initially tried putting the onClick function outside the Ajax call (but within the pageinit). This wouldn't trigger because the page would initiate without any #cvResults tags and hence not load the function.  I now have a different problem. When you click this button and go to the other page, if you then press back and try to click the button again, the event isn't triggered. This makes sense because there has been no response from Ajax.  How do I cater for both of these scenarios, and just permanently have the onClick event listening when the #cvResults tag is present?


Canada to Mexico via USA: Do I need and ESTA or visa?

I have UK Passport and am Canadian Citizen. Flying to Mexico via Dallas. Do I need an ESTA or Visa?


How can I switch between "All" and "Unread" in my Outlook 2013 inbox?

I would like to switch between seeing All and just Unread emails in my Outlook 2013 inbox using just the keyboard and a single key combo, for instance Ctrl+Shift+A and Ctrl+Shift+U (just an example).  Is there such a shortcut, or is it possible to create one?  The closest I have gotten is Ctrl+E to go to the search box, then Shift+Tab to jump to Unread and Shift-Tab again to get to All, then Space to select. Cumbersome!


Who does the data explorer think I am John.Doe

I logged into data-explorer for the first time 9I have viewed others' queries but have not created one myself). When I log in with the StackExchange Open Id provider, I am shown as john.doe13574.     This does not happen when I login to a new stackexchange site, my details are recogniozed and fetched from my profile.  Is this an expected behaviour? Strangely, my picture is recognized correctly so the system "knows" me (I know the picture is from Gravatar, but the system knows what details to send to Gravatar)


I am working on a homework problem (so don't just give me the answer) from Herstein's Topics in Algebra, which goes as follows:     If $G$ is a finite group, show that the number of elements in the   double coset $AxB$ is $$\dfrac{o(A)o(B)}{o(A\cap xBx^{-1})}$$   It makes sense to me, but my attempts at a proof seem to fall short of undeniability. I have been trying to show that $o(A \cap x B x^{-1})$ equals the number of duplicate terms in the list of all possible products of an element from $A$ and an element from $xB$.   Suppose $a_0 \in A \cap xBx^{-1}$. Then $\exists b_0 \in B : a_0 = x b_0 x^{-1}$. In the list of products of the form $axb, a \in A, b \in B$, any term involving $a_0$ will be of the form $a_0 x b = x b_0 x^{-1} x b = x b_0 b$ for some $b \in B$. But then this list is just the left coset $xB$, which is already accounted for in the product list of $AxB$ by setting $a=e$.   This is where I run into trouble. I can't seem to crystallize this argument. Am I going about this the right way? And if you see how I should extend this argument, can you nudge me in the right direction?  Thanks Math.SE.


Who was the piano player that Starbuck met in the bar on Galactica?

Towards the end of season four, Starbuck meets a piano player in the makeshift bar on Galactica.  Now, it appears that this guy is some kind of ghost/angel like Caprica-6 and the ghost Baltar - but I have an idea that he could also be the original copy of the seventh model (Daniel). It's mentioned right in the episode before that Cavil poisoned all of the bodies that were being prepared to accept a copy of Daniel - but it's ambiguous about the fate of the original cylon with that personality. Daniel was also mentioned as an 'artist' and 'sensitive' person.  So - could it have been Daniel that helped Starbuck realise what the music meant?


How to make maps in QGIS or Openstreetmap, etc. to wrap around a physical sphere?

How do I go about creating a map of the earth in QGIS or Openstreetmap, etc. and then export art in the appropriate projection so that it can be wrapped around a sphere?


How to list available functions in the static library file

I use Raspberry Pi 3 and program GPIOs using C and Sysfs/WiringPi. If someone provides a static library (.a file) to work with my Raspberry Pi C project, is there a way to list what functions, with what parameters needed, are available inside this static library? For instance, if I get "test.a" without any documentation/explanation of it, I want to find out that this static library has void foo(int param1); char bar(void);


How does the degrading of the food bar work?

While searching for an answer to my question, I am came across another question on this website: .   Here, the answer provided by  states that:      Various actions including walking, swimming, running, and stabbing   things will increase your hunger (though ).   There are 2 questions I want to ask. Firstly, besides walking, swimming, running and stabbing, are there other actions that deplete your hunger? For example, Mining or Jumping?  Secondly, what is the rate in which the following actions deplete your Hunger Bar? Do different actions have different effects on your hunger bar?


Wrong position (on separate page) of sideways figures in amsart

I run into a problem when running sidewaysfigure in amsart. The code below illustrates  \documentclass[a4paper,reqno]{amsart} %\documentclass{article} \usepackage{graphicx} \usepackage[figuresright]{rotating}  \begin{document}  \begin{sidewaysfigure} \centering \rule{0.75\textheight}{0.5\textheight} \caption{dummy figure} \end{sidewaysfigure}  \end{document}   When I compile this in amsart the black square is not allinged correctly (the top is cut off). When I compile in article the problem goes away.   I would rather stick to amsart so am wondering if anyone has encountered this issue before / knows of a fix? I've used a combination of landscape and afterpage, which doesn't cause this issue but can lead to pretty random gaps appearing in the text and some other funnies with more figures involved, so I'd rather stick to sidewaysfigure if possible.   Thanks in advance for your help. Pawel


Converting *.tif file into headerless (flat) binary file?

I am using NDVI files (value range -1 to +1) created from Landsat CDR images to produce a timeseries in TIMESAT software.   My  .tif file has following characteristics.  File type  TIFF,Data Type  Double Precision, Byte Order Host (Intel), Interleave BSQ  As per the requirement of TIMESAT, the image should be headerless(flat) binary file, and values can be stored as 8 bit integer(0-255), 16 bit signed integer(-32767 to +32768) or 32 bit real.   Now i need to change my data type into any of these 3 format and .tif file into headerless binary files.   Any idea?


Can an “if-clause” be used as an extraposed subject?

When a subject is a whether-clause, it can be extraposed:     [Whether (or not) he comes] makes no difference.　　(basic version)   It makes no difference [whether (or not) he comes].　　(extraposed)   The logical subject is "extraposed", pulled out of its basic position and moved to the end of the sentence.  Since the sentence needs a grammatical subject, dummy it appears in its place at the beginning.    Can an if-clause be used as an extraposed subject, too?     *[If he comes] makes no difference.　　(basic version)   It makes no difference [if he comes].　　(extraposed)   Is the extraposed version okay?  It's unclear because the basic version seems to be ungrammatical.


Is it experimentally proven that photons travel at speed $c$ in vacuum?

Are there experiments which show that single photons (not classical em waves) travel exactly at $c$ in vacuum?  What is the error bar in that case? The question is posed due to the fact that loop quantum gravity predicts variations in the speed of light.


I would like to write a LaTeX document in which several Mathjax commands are shown as source code and compiled.  So I want to have a list of items and have them show up on, for example, the left side as source code for Mathjax e.g. a^2 and on the right side have it show what it will look like e.g. a², but I do not want to enter the code twice for maintenance reasons.  I tried to create a \newcommand for this myself, but failed with verbatim package and listings packages (mostly with improper alphabetic constant errors) and I have tried sverb package with demo environment and showexpl package wit LTXexample environment, but failed with both to have it display the code as it would have to be used with Mathjax (i.e. without math mode symbol $). The document will have to be used by very inexperienced Mathjax users so I do not want to confuse them with symbols they will not have to enter.  Any suggestions for me?  What I tried so far  defining a \newcommand  \usepackage{verbatim} \newcommand{\cl}[1]{$#1$ & \lstinline{#1}} %use within a \tabular environment   In this case LaTeX tells me that I cannot use \verb in a new command.  \usepackage{listings} \newcommand{\cl}[1]{$#1$ & \verb!#1!} %use within a \tabular environment   My ultimate goal is to list formulas and this works fine with certain things, but as soon as there is a command in there, e.g. \geq I receive a ! Improper alphabetic constant. error. I found out that I have to escape the \ in the listing with another \, such as \\geq, but of course that will not work for the first part of the command...   I used them like this:  \begin{document}     \begin{tabular}{c|c}     $F(x) \geq 0$ & \verb!F(x) \geq 0! \\      \hline      \cl{A(n+2)=A(n)+A(n+1)} \\     \hline     \cl{\geq} \\     \end{tabular}  \end{document}   imported environments  I found packages which aim to provide almost what I searched for:  \usepackage{sverb} \begin{document}     \demo{}     $\geq$ \end{document}   This does perfectly what it intends to do, but in my particular case it is very unpractical, that it (of course) always displays the $ symbols. This is meant to be used by someone who does really not know about LaTeX/Mathjax at all and I did not succeed in explaining why these symbols are in the document, but do not need to be entered in Mathjax.  \usepackage{showexpl} \begin{document}     \begin{LTXexample}     $\geq$     \end{LTXexample} \end{document}   The result of this (for my document) was pretty much the same as in the above case.  I tried


At the beginning of  we see that Logan (a.k.a. Wolverine) and Colonel William Stryker were working together by the end of the Vietnam War.   For 5 years after the war, he lives in Canada with a girlfriend. But in  we see that Logan was part of some gang at the end of the Vietnam War.   My question is which of these are X-Men movie canon?


Proof of Extended Law of the Mean (Taylor's Formula)

I started reading "The Mathematics of nonlinear Programming - AL peressini" recently.  Theorem : Suppose that $f(x) , f'(x) ,f''(x)$ exist on the closed interval $[a,b]$. If $x^* ,x $ are two different points of $[a,b]$ , then there exists a point $z$ strictly between $x^*$ and $x$ such that   $$f(x)=f(x^*)+f'(x^*)(x-x^*)+\frac{f''(z)}{2}(x-x^*)^2$$  I tried to prove this theorem using The Fundamental theorem of calculus. But I can not stop it at the second derivative . Do I have to use mean value theorem ? or is there a simple proof for this ?


If you would be so kind to explain and answer my dilemma, I'd be grateful of all of you.  Here is the error:  Error mounting /dev/sda1 at /media/ubuntu/System: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=999,gid=999,dmask=0077,fmask=0177" "/dev/sda1" "/media/ubuntu/System"' exited with non-zero exit status 14: The disk contains an unclean file system (0, 0). Metadata kept in Windows cache, refused to mount. Failed to mount '/dev/sda1': Operation not permitted The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option.   Problem: I cannot mount my System or "Windows" Drive. In the first place, it said i cannot boot windows, so i got Ubuntu instead. So after trying to get my 800gb Windows drive back, this error popped up. Any help would be wonderful.


Determine the pod/instance API endpoint of a Salesforce org?

Say I want to retrieve my API endpoint from a Visualforce Page or a Force.com Site, I can try:  Url.getSalesforceBaseUrl().toExternalForm();   But the return value is all over the place. It could be any of the following:   http://pod.salesforce.com (from a batch apex class) https://c.na1.visual.force.com (a local Visualforce Page) https://mysite.secure.force.com (from a Force.com Site) https://ns.pod.visual.force.com (some page in a managed package)   This wreaks havoc on the Remote Site Settings, and gets worse with Sites and Communities.  So how do I get just "https://na1.salesforce.com"?


In my code I have two line sections. But I want it in 1 line in header . What can I do?  \documentclass{biditufte-handout} \usepackage{ptext}  \usepackage{fancyhdr}  \pagestyle{fancy} \fancyhf{} \fancyhead[L]{\leftmark} \renewcommand{\headrulewidth}{0pt}  \usepackage{xepersian} \settextfont{Yas} \reversemarginpar   \begin{document}  \section{یک عنوان \\ بخش} \ptext[1] \end{document}     This picture is my goal:


Disable mouse acceleration in Ubuntu 15.10

I did a few quick google searches, and it looks like the most recent  about this was back in 2012.   How might I go about disabling mouse acceleration in Ubuntu 15.10? I tried installing gpointing-device-settings but there were many errors.  I'm looking for a persistent setting.


How to measure the performance speed of one method in java

I have implemented a protocol and it is executed and give me the output I want but the problem is the runtime execution. Is a little more than I would expected. I wanted to measure the execution time of one of my methods of the class but I am not sure if what I have done is correct since I do not have much experience in testing. What I have done is:  public class MyClass {     // some private fields here      public int method toBeMeasured (int a){         long startTime=System.nanoTime();          // the code under my method including          // some for cycles and some operation.          long finalTime=System.nanoTime() - startTime;          return something of type int;     } }   Now what I need to know if the result I got is really telling me the performance speed of this method or am I measuring it wrong. Also I want to know how can I measure this 10000 times and take the average of those times. I hope to receive any feedback for my question.


What is a word for deliberate dismissal of some facts?

For example: A situation needs both Fact A and Fact B to be explained, but a person accepts Fact A and rejects Fact B, misconstruing the situation?     Do you think this is just ignorance or deliberate _____?


I burned a live iso image of debian 9 gnome i386 and booted it from my usb.   Everything worked perfectly, but it was not finding any local wifi.    After reading that the free version was missing the necessary firmware, I burned the debian 9 gnome i386 with non-free firmware and booted from my usb.  This time my wifi was found, but when I entered my password it tried to connect for a few seconds and then disconnected.  I'm not sure what to do from here.  There is no problem with the network or password, as I was able to login and use the internet from the PC I am using now.  Any help is greatly appreciated!


I want to be able to do a . I can almost come to a halt on my bike without taking my shoes out the cleats - but not quite.   In theory, on a  it should be easier, but I can't quite manage to maintain position, I always find myself rolling forward.   So I'm looking for snippets of advice, without being able to see what I'm doing wrong, can anyone tell me something to do right so as to perform a decent track stand; on either a free or a fixed hub, advice for either is fine.   What's your secret?  I promise that I'll go out and practice somewhere quiet ...


This is my attempt I know this is incomplete or may even be wrong.   Let $θ_1 \in \arg(z)$ and $θ_2 \in \arg(w)$. Then, $θ_1+θ_2 \in \arg(z)+\arg(w)$. Also, $θ_1+θ_2 \in \arg(zw)$. Is this sufficient for the proof or correct at all? Hope someone could help me out. Thanks.   EDIT: Just to avoid any confusions I will add how $\arg z$ is defined.   $\arg z=\{\text{Arg}\, z+2\pi k\mid k\text{ is an integer}\}$


How to find the last two digits of 3^1000?

So I think the problem reduces to 3^1000 mod 100. So I used the Eulers Totient to find phi(100)= 40. Then 3^1000 = (3^40)^25 = 1 mod 100. Is something wrong?


Minimal polynomial, determinants and invertibility

I need to prove the following:     Let $A$ be a square matrix over a field. If the matrix $A$ is invertible, then the minimal polynomial $m_A$ satisfies $m_A(0) \neq 0$.   There is one definition I am unsure of or need help making more clear.  I will proceed with proof by contraposition:  We must show that if $m_A(0) = 0$ then $A$ is not invertible. By definition of minimum polynomial of $A$ we have:  $m_A(x) = x^r - \lambda_{r-1} x^{r-1} - \ldots - \lambda_1 x + \det(A)$. Not sure about the determinant term here  So, $m_A(0) = \det(A) = 0$. We know $\det(A) = 0 \implies A$ is not invertible.


Opening local document files in Google Docs

Is there any way that I could simply double click on a document file and have it open Chrome straight into google docs?


How to make full-paged Table's Caption full-paged

My Table can show in full-paged mode. But my caption still at half-paged mode. I want my caption be centering in page. How to solve this issue? \documentclass[journal]{IEEEtran}  \usepackage{multirow} \usepackage{makecell} \usepackage[flushleft]{threeparttable} \usepackage{float} \usepackage{afterpage}  % load the afterpage package \usepackage{graphicx} % for '\resizebox` macro \usepackage[margin=0.6cm]{geometry} \usepackage{adjustbox} \usepackage{caption}% http://ctan.org/pkg/caption  \begin{document}  \captionsetup[table]{justification=centering, singlelinecheck=off} \floatstyle{plaintop} \restylefloat{table}   \begin{table}[ht]     \centering         \begin{adjustbox}{width=1\textwidth}             \begin{tabular}{|c|c|c|c|c|c|}                 \hline                     \multicolumn{2}{|c|}{} & Average & STD & Z & P \\                 \hline             \end{tabular}         \end{adjustbox}     \caption{\label{table2} TRADITIONAL EVALUATION SCALE STATISTICAL RESULTS} \end{table}  \end{document}


Instructions on how to build electronic devices

I have got plenty of books in the theory of electronic devices, but I wish to build these transistors (BJT, MOSFETS, etc) and diodes by myself.  Which books are there in offer to learn how to do this?


Prove that given 17 integers, the sum of 9 of them is divisible by 9.

Prove that given any $17$ integers, there exist nine of them whose sum is divisible by $9.$  I'm pretty sure we have to use the pigeonhole principle, with the possible remainders as the pigeonhole, but that gives a lot of possibilities and I don't know where to start.  I tried to compare it to this question which was easier to solve:  Prove that given any $5$ integers, there exist three of them whose sum is divisible by $3.$


Upgrade to level 2 or deploy another building?

I am looking for some strategy hints for Defense Grid : The Awakening to improve alien blast efficiency.  If there is enough space to build, is more efficient upgrade a structure to Level 2, or deploy instead a new structure, considering also the price difference?


Can player characters identify monsters?

In D&D 5e, I can't find a skill check for identifying monsters. (Other than Arcana for planar monsters). Can PCs identify monsters, and if so, what skill should they use? (Or is it just a Wis/Int check?)


I am trying to install Ubuntu 13.10 on my new laptop. The option mentioned in the install guide to "install alongside Windows" does, however, not appear in the install wizard. When I select "Something else" I am presented (as expected) with the disk manager.  My problem is that this laptop came with no less than 7 partitions! Windows is only aware of one 418GB partition. My question is this: How do I resize that windows partition to be as small as possible, create space to install Ubuntu, and use the rest as a shared NTFS partition. Ideally, I would like to put Win 7 on there as well, as I am not a great fan of Win 8.  I would be more than happy to live without Win 8 (If I can put 7 on). I am just apprehensive to completely format the drive and lose the recovery partition. I did make a recovery DVD and a recovery USB drive (which is about 14 GB big), though.  Any suggestions / help would be greatly appreciated!  To make it clear, i took some screenshots of the install wizard. Unfortunately, I cannot post images.


Windows 10 uninstalling my graphics driver and replacing it with a different one

Recently, my computer has been uninstalling its current graphics driver and replacing it with that of a different type of graphics card. It goes from AMD Catalyst version 15.7.1 to an AMD Radeon driver (I don't know exactly which as it wont open due to me having the wrong type of hardware for it).  At the moment, I am uninstalling the graphics driver with  then running the  program, and installing the driver it recommends. However this seems only to be a temporary fix, because it has usually uninstalled the Catalyst driver and replaced it with the Radeon one by the end of the next day (I have reinstalled the driver 5 times this week already).  On  from a few months ago, I was told to use the Catalyst driver for the graphics, when in had a problem with OpenGL not working.  Computer Specs:  Operating System: Windows 10 Home 64 bit  Processor: Quad core AMD A8-5557M APU with Radeon(tm) HD Graphics 2.10 GHz  RAM: 8.00GB (7.19GB Usable)  Display Adapters: AMD Radeon HD 8550G, AMD Radeon R9 M275X    Thanks in advance for any help.


Commutator Subgroup and the Largest Abelian Quotient

Good day. I'm not too sure how I should go about asking my question, so if it is in anyway confusing, feel free to edit it.   In my Group Theory course we defined and showed a few properties of the commutator subgroup $[G,G]$ of a group $G$. And then we stated and proved a lemma in lecture that I'm having some difficulty wrapping my head around. I'll state it here for clarity.  Lemma a) The commutator subgroup $[G,G]$ of $G$ is a normal subgroup of $G$. b) The quotient group $G / [G,G]$ is the largest abelian quotient of G in the sense that every homomorphism $\varphi : G \to A$ where $A$ is an an abelian group, induces a unique homomorphism $\bar \varphi : G/[G,G] \to A$ so that $\varphi =\bar \varphi \circ \pi$ where $\pi : G \to G/[G,G]$ is the quotient homomorphism.  Now, it's not the proof of this lemma that I'm having trouble with, it's the italicized text that is messing with me. I completely understand what it is that the italicized text is saying, I'm just not too sure why it is that the property gives us the "largeness" that is claimed. I can see that the above forces $G$ to "pass through" $G/[G,G]$ before it "reaches" $A$ (I apologize for the casual terminology), so I can sort of see why $G/[G,G]$ should be the largest quotient, in a non-rigorous sort of way.  Overall I'm very confused. Perhaps I'm missing something very simple. Any help or nudges in the right direction would be much appreciated.   As a side note I did try a search on Google and here on Stack Exchange and couldn't find anything that answered my question. So if I missed something obvious, then my apologies. Thank you in advance.


Prove whether the following series converge or diverge.  $$\sum \limits_{n=1}^{\infty} \frac{(2n)!}{(4^n)(n!)^2(n^2)}$$  I think this series converge and I tried to justify using the ratio test but I got $\lim \limits_{n\to\infty} \frac{a_{n+1}}{a_n}=1$ which means the ratio test cannot be applied.  Please give me some ideas or hints on how to solve this question, thanks to anybody who helps.


Can I have the equivalent of a Ps 'smart object' in Ai which I can keep updating in Ps?

I've scanned in some maps, and I'm regularly adding little touches here and there to each map in Photoshop. Each map has a few Ps layers and is not vector.  For all the annotations, I'm using Illustrator, because it's better for the job with its typography tools.   In Ps, I can drag some graphics/layers in from Ai and it becomes a single 'vector smart object' so whenever I want to edit that graphic, it opens in Ai and updates in Ps when I save.   How do I have the equivalent of this in Illustrator? I have a multilayered graphic which I want to keep opening and editing in Ps but still keep at the exact same size and position in the Ai document (to keep the annotations accurate)?


c++ strict-aliasing rules compile error with Qt and QLinkedList

In file included from /usr/local/Qt/linux-g++/include/QtCore/QLinkedList:2,   from /home/bamboo/Packages/Parser.h:17,   from /home/bamboo/Packages/Module.cpp:6: /usr/local/Qt/linux-g++/include/QtCore/qlinkedlist.h: In member function 'void QLinkedList<T>::clear() [with T = int]': /usr/local/Qt/linux-g++/include/QtCore/qlinkedlist.h:294: error: dereferencing pointer 'y' does break strict-aliasing rules /usr/local/Qt/linux-g++/include/QtCore/qlinkedlist.h:293: note: initialized from here /usr/local/Qt/linux-g++/include/QtCore/qlinkedlist.h:294: error: dereferencing pointer 'y' does break strict-aliasing rules /usr/local/Qt/linux-g++/include/QtCore/qlinkedlist.h:293: note: initialized from here   where in big lines class Module contains a member template like: Parser<int> and the class parser is defined:  template <typename T> class Parser {    // some stuff    QLinkedList<T> stuff; };   and this piece of code compiles nicely with gcc (Ubuntu 4.4.3-4ubuntu5.1) 4.4.3 and nicely with g++ (Ubuntu/Linaro 4.7.2-2ubuntu1) 4.7.2 and fails with g++ (Debian 4.4.5-8) 4.4.5 ... and I have no idea why? Anyone has seen this error message and anyone know what this might mean?... and more importantly how to solve it?


Mathematical Induction and "the product of odd numbers is odd"

I am extremely poor at proofs and logical manipulation so I am stuck on a lot of these questions especially induction.   The question below I have been stuck at for a little over 1 hour and I can't get it, I have tried various substitutions and forms but I am stuck..  Using mathematical induction: An integer is odd if it can be written as $n=2k+1$. Use induction to prove that the product of $m$ many odd integers is odd for every $m \geq 2$.  I have tried doing $(2k+1)(2(k+1)+1)$ and substituting $k=1$ for my basis step after that I am lost.


How can I remove unwanted ads on top of sites?

I'm running Windows 7. Yesterday, when I opened a website with Firefox, I saw 3 ads at the top of the site.  Then, when I checked other websites with different browsers, I saw these ads:    In the page source, I can't see any code for these ads. After using Inspect Element, this code was added to the header:     And the code in the body for this ad is:     I don't see any new and unwanted plugins in my browsers, and I haven't installed Hotspot Shield.  Is this malware, and if so, how can I remove it?


I have the code below that returns the date in the following format: m/d/yyyy, but I would like it to return it as mm/dd/yy( So it would show a 0- before single digit dates and only show the last two digits of the year). How can I tweak it so?   import datetime today = datetime.date.today() '{0.month}/{0.day}/{0.year}'.format(today)


Where to ask a question about compression?

I want to ask a question about compression and I'm unsure where to ask the question because I couldn't find any sites where this question would fit according to the Help Center.  The question:  Is there a lower bound of how much compression can be done on data?    I thought that mathSE might be suited since there might be a mathematical proof that explains i.e. why any data can't be compressed to less than 50% of it's original size (even if we don't have such a compression algorithm yet).


Heteroskedasticity in logistic regression


validate url and domain field using jquery

I have a form that contain input fields one for domain and one for folder name. now i want to validate these two fields before submitting the form.I am using .  how can i validate my fields on custom build rules  1) domain url will not contain http:// or / at the end     http://google.com wrong    google.com/     wrong    google.com      correct   2) folder name without any "/" at the start or at the end     foldername/ wrong    /foldername wrong    foldername  correct   this is the code that i am trying.  <form id="f">     <label for="domain">Domain</label>     <input type="text" value="subdomainname.abc.com" id="domain" name="domain" maxlength="50" size="30">      <label for="newfolder">Folder Name </label>     <input type="text" name="newfolder" maxlength="50" size="30" id="newfolder">      <input type="submit" value"configure"> </form>   this is validation   $(function() {     var v = $('#f').validate({         rules: {             domain: {                 required: true                  // custome rule              },             newfolder: {                 required: true,                 // custome rule             }         },         messages: {             domain: {                 required: "Enter a valid url"             },             newfolder:{                 required: "Folder name incorrect"             }         },         submitHandler: function(form) {             alert('submit');           }     });           });


I check my Moto G XT1033 phone on daily basis hoping that one day I will get Android 5.0. But I didn't haven't got the update yet.  Is there any current expected date it will be released in India?


How to cite something which is cited another book

\documentclass[12pt]{article}  \usepackage[utf8]{inputenc} \usepackage{graphicx} \usepackage{url} \usepackage{filecontents} \usepackage[backend=bibtex]{biblatex}  \begin{filecontents*}{reference.bib} @Book{Houghton1995,   Title                    = {The Search for God: Can Science Help?},   Author                   = {John Houghton},   Publisher                = {Lion Books},   Year                     = {1995},   Address                  = {Oxford} }  @Book{Lennox2009,   Title                    = {God's Undertaker: Has Science Buried God?},   Author                   = {John C. Lennox},   Publisher                = {Lion Books},   Year                     = {2009},   Note                     = {Originally published in 2007.} } \end{filecontents*} \addbibresource{reference.bib}  \title{My Doc} \author{Me} \begin{document}  \maketitle  Our science is God's science. He holds the responsibility for the whole scientific story.\dots The remarkable order, consistency, reliability and fascinating complexity found in the scientific description of the universe are reflections of the order, consistency, reliability and complexity of God's activity.  \printbibliography  \end{document}   The quote above is from Lennox2009, and that source quoted it from Houghton1995. I do not have access to the original source. Is there methodical way to make such a citation?


Distribution function of a random variable defined by a cumulative distribution function

I have been given a question:  Suppose that $F(x)=P(X\leq x)$. Show that if $F$ is continuous and $Y:=F(X)$, then $P(Y\leq y)=y$ for all $y\in [0,1]$.  I have been having difficult even starting to prove anything, since the definiton of $Y$ seems to me somewhat self refrencing. I will be thankful for any clues.


How can I delete an item from an array, and then resize the array to the smaller size? Likewise, how can I increase the capacity if I need to add another item?


Missing space in the user activity report

In my profile under the  there is a small visual bug: a space is missing between the word "on" and the subsequent word.   See the following image:


I am learning Java internals and this can be a naive question. I understood the concept of garbage collection in Java that JVM decides when to perform garbage collection but we can only REQUEST JVM by using System.gc() . So my question is that if System.gc() does not force the garbage collection then what is the importance of the command? What exactly we can achieve by this call? What are the considerations while supporting System.gc() call? Essentially the question is why Java provide System.gc() call?


How to change "ifthenelse" conditional to "ifnum"

I'm trying to put a conditional inside \cfoot from the fancyhdr package like this:    if the document contains a one-page there will be no footer. if there are more pages the footer takes the format " \thepage of number of pages".   To set the number of pages i have used the lastpage package which provide the label LastPage allowing the user to refer to the last page of a document via \pageref{LastPage}.     When using \ifthenelse there is no problem   \documentclass{article} \usepackage{lastpage} \usepackage{ifthen} \usepackage{fancyhdr} \usepackage{lipsum}  \pagestyle{fancy}  \renewcommand{\footrulewidth}{1pt}  \cfoot{\ifthenelse{\pageref{LastPage}>1} {Page \thepage\ of \pageref{LastPage}}{}}  \begin{document}  \lipsum  \end{document}   But with the use of \ifnum produces an error:     !Missing = inserted   for \ifnum   \documentclass{article} \usepackage{lastpage} \usepackage{fancyhdr} \usepackage{lipsum} \pagestyle{fancy}  \renewcommand{\footrulewidth}{1pt}  \newcommand{\foo}{\pageref{LastPage}}  \cfoot{\ifnum\foo>1 Page \thepage\ of \pageref{LastPage}\fi}  \begin{document}  \lipsum  \end{document}   Where is the problem , with \ifnum  and how to solve it ?


What is the relationship between p (prime), n (order) and h (cofactor) of an elliptic curve?

I am reading up on ECC and having trouble understanding how these are related.   In a finite field, all point operations are taken modulo $p$.  $n$ is the order of the generator $G$ — which apparently is the number of different points on the curve which can be generated by multiplying a scalar with $G$. This is clear. But —   How is this $n$ chosen? Is $G$ chosen so that $n$ is a certain number? Does $n$ effect the security of the curve? Do all the points of the crypto operations with a given $G$ fall in the set of $n$ points for that $G$?    $h$ is the cofactor which is the $\#E(\mathbb F_p)/n$.    What is the significance of this?  $\#E(\mathbb F_p)$ is the number of points of the curve apparently. Why is dividing that with $n$ interesting?


Does single quote (') pronounce "dash" , "prime" or something else?

we write as f dash of x   when talk about this formula.    I heard someone pronounce it as "prime" somewhere else.  Does single quote (') pronounce dash, prime or something else?


I have this script  select  *  from psPatDiscounts  where cancelflag = '0'  and refdate between  '2014-01-01 14:03:00'  and '2014-01-31 14:03:00' group by FK_psPatRegisters   however, after running this script it gives me this error message :     Msg 8120, Level 16, State 1, Line 1   Column 'psPatDiscounts.PK_TRXNO' is invalid in the select list because it is not contained in either an aggregate function or the GROUP BY clause.


When to use "have"/"has" and when not to use "have"/"has" in a sentence

I heard about it. I have heard about it. I knew him. I have known him. He has played really well. He played really well.


I am trying to prove the existence of the square root of 2.   The proof: Let  $$S=\{x \in \mathbb{R} ∣x \ge 0, x^2 < 2\}.$$ I understand the proof of LUB, $\alpha$ and so I am at the step where $\alpha^2=2.$  I know that we are to prove by contradiction so we state let $\alpha^2 <2$ and $\alpha^2 >2$. Now my instructor wants us to use the Archimedean Axiom $1/n < \epsilon$.  $(\alpha^2 + 1/n)^2$ then what.....


Modifying labels on some enumerated items

In an enumerate environment, I want a few (not all) of the items to have asterisks which appear before the number (I don't feel strongly about whether the number or the asterisk is horizontally aligned with the other numbers).  Is there a less crufty way to do this than, say, using multiple lists (or — horrors — numbering manually)?  I'm already using enumitem for an unrelated purpose, if that helps, although I didn't find a solution after a quick skim of its manual.


Join multiple pipe delimited files with unequal rows/lines into one based on first column


Evaluate the integral $\int_0^{2a}\int_0^\sqrt{2ax-x^2}\frac{\phi'(y)(x^2+y^2)x dxdy}{\sqrt{4a^2x^2-(x^2+y^2)^2}}$

Change the order of integration in:  $$\int_0^{2a}\int_0^\sqrt{2ax-x^2}\frac{\phi'(y)(x^2+y^2)x }{\sqrt{4a^2x^2-(x^2+y^2)^2}}dxdy$$ and hence evaluate it.    I changed the order of integration and got the limits $y=0$ to $a$ and $x=a-\sqrt{a^2-y^2}$ to $a+\sqrt{a^2-y^2}$. I then tried changing to polar coordinates, but it is only making the integrand more complex.


Taking Honor Mechanics class in college this semester and It would be great to get your opinions on advanced textbooks compatible with such a class?

I used to like and think that Halliday and Resnick was the best, but I've heard it is not really advanced. What honors physics textbook would you recommend or is the one most used out there?  Again, I'm looking for a very specific type of book, which is an advanced one for honors physics classes in college. A huge list of all possible physics books is definitely not what I'm looking for.


Transit visa for connecting flights in the UK and Toronto

Is a transit visa required when travelling from Abuja to the US via the UK and Toronto on Air Canada? I will have a 12-hour layover in the UK and 6 hours in Toronto.


How do I get the value of 'columnwidth'?

I am using the  for a conference paper (a two-column document). And I'd like to insert several figures plotted by matplotlib.  I was wondering what is the width I should set for fig.set_size_inches in matplotlib.  fig = matplotlib.pyplot.gcf() fig.set_size_inches(w, h, forward=False)   Is it equevilent to columnwidth in ACM SIG? However, I didn't find the definition  of columnwidth in sig-alternate-05-2015.cls.  $ grep 'columnwidth' sig-alternate-05-2015.cls    \hrule width .5\columnwidth   % (was .4) updated Gerry March 20 2007         \hsize\columnwidth \@parboxrestore     \hsize\columnwidth \@parboxrestore


What if one family member doesn't have a photo ID for domestic air travel in India?

My friend has booked tickets for vacation in India (domestic travel), but realized that his wife doesn't have any photo ID.  Will any of the following documents work for his wife?   Marriage certificate Nationalized bank's passbook ()   Their travel date is next week, so there is less time to apply for any photo ID like PAN card/Passport.


Calling One Plugin from another Plugin in QGIS

I am working on various plugins in QGIS which I have made, so I was wondering if it is possible to make one plugin which would call these plugins in a predetermined order, so that I would not have to call them individually.


Mean of ratio of minimum and maximum of two standard normal variables

I'm working on the following problem.     Let $X,Y$ independent, standard normally distributed random variables and define $U=\max\{|X|,|Y|\}$ and $V=\min\{|X|,|Y|\}$. Find the mean of $V/U$.   What approach would work here? I don't really see where to start. Using integrals doesn't seem to work. Any hint or (partial) solution is much appreciated!


How does an LSTM process sequences longer than its memory?

* Note: The premise of my question was incorrect in the first place. My question assumes that an LSTM maintains a separate set of weights for each time step in the memory it is given as a design parameter. As , only a single set of weights is learned. So an LSTM cell does not care about how long a sequence is - it applies the same set of weights to each step in the sequence. Please don't let my question convolute your understanding of LSTMs.   Terminology:  Cell: the LSTM unit containing input, forget, output gates and the hidden hT and cell state cT. Hidden units/memory: How far back in time the LSTM is "unrolled". A hidden unit is an instance of the cell at a particular time. A hidden unit is parameterized by [wT, cT, hT-1]: The gate weights for the current hidden unit, the current cell state, and the last hidden unit's output. Where wT represents input, output, forget gate weights.   An LSTM maintains separate gate weights wT for each hidden unit. This way it can treat different points in time of a sequence differently. (see *Note above) Let's say an LSTM has 3 hidden units so has gate weights w1, 2, w3 for each of them. Then a sequence x1, x2,...xN comes through. I am illustrating the cell as it transitions over time: @ t=1 xN....x3    x2    x1                   [w1, c1, h0]                       (c2, h1)  @ t=2 xN....x4    x3    x2                   x1                   [w2, c2, h1]                       (c3, h2)  @ t=3 xN....x5    x4    x3                   x2    x1                   [w3, c3, h2]                       (c4, h3)  But what happens at t=4? The LSTM only has memory, therefore gate weights, for 3 steps: @ t=4 xN....x6    x5    x4                   x3    x2    x1                   [w?, c3, h2]                       (c4, h3)  What weights are used for x4 and all the following inputs? In essence, how are sequences that are longer than an LSTM cell's memory treated? Do the gate weights reset back to w1, or do they remain static at their latest value wT?  Edit: My question is not a duplicate of  question. It is asking about multi-step prediction from inputs. However, I am asking about what weights are used over time for sequences that are longer than the internal hidden cell states. The question of weights is not addressed in that answer.


Dual boot Ubuntu 12.04 and Windows 7 PROBLEM

I have spent the past 4 days trying to get Ubuntu and Windows 7 on my computer and every time it boots straight into Ubuntu. I have looked through most of the threads and tried Windows first, Ubuntu first, partitioning the drive, reinstall grub with boot - repair, pretty much every tutorial I can find, I only have one USB drive to boot off of, so this is very time consuming. I have to download the iso file and create a bootable USB everytime I install an OS and it's all for nothing because there is no boot menu. If anyone can help it would be greatly appreciated


Can we define the effective mass or the moving mass of a photon?

I know that the rest mass of a photon is zero. but the photon can be bent by gravity (which can also be explained by the curvature of space-time due to the effect of mass), this implies that it must have some effective mass, while in motion, therefore does it also bend space-time? can the mass of the photon be defined in common(SI) units, how?


How to write equation as shown in picture using Latex?

how we write this equation in latex in given form


MTG question about stack/effect resolving

Lets say my opponent have  in play. Then proceeds to use instant spell that target Zada to trigger its effect. Then i play  in response to his instant spell. Does Zada, Hedron Grinder still resolves even if my Stasis Snare resolves first by exiling Zada? If its effect still resolves, how do you prevent Zada from using its ability if i have the instant removal (stasis snare, lightning axe, grasp of darkness etc...) in my hand that can be played in response ?


I have a Mojang account and I own Minecraft on it but cannot login to Minecraft using the Minecraft website, the Mojang website or the Minecraft launcher. On the Mojang website I get the error "unknown email or password" and on the Minecraft website I get "Oops, unknown username or password. If you are logging in with a Mojang account make sure to use your e-mail address as username." I also can't login to tekkit using it either.


How to open Excel 2010 as separate files

How do I open multiple Excel 2010 workbooks as separate files.  I do not want to have to toggle between the two or more I want to use on split screen.


Which English speech sounds are difficult for a learner from Jamaica to say? (I'm aware of /θ/)

On 11.1.21. I'm going to start working with a Jamaican learner of English to support her with her spoken and written English. I understand that θ and ð may be difficult for her to say, but please can anyone identify any other sounds that may be challenging for her? I want to be well-prepared for our meeting so I can be as helpful to her as possible. I believe she was brought up speaking Jamaican Patois. Is she likely to find any particular aspects of English grammar difficult? If anyone's able to throw any light on these questions, I'd be very grateful!


Call by reference not behaving as expected

Please consider this short code :   class abs{} class cd {     static void method(abs a)     {         System.out.println(a); // PRINTS NULL         a = new abs();         System.out.println(a); // PRINTS NEWLY GENERATED HASHCODE     }     public static void main(String...args)     {         abs gh = null;         // REFERENCE SET TO NULL          // NOW PASSING IT TO A METHOD         method(gh);          // IF OBJECT CALL IS CALL BY REFERNCE, THEN WHY DOES THIS PRINT NULL ?         System.out.println(gh);     } }   My comments explain what I want. Basically the last print statement should print the hashcode but it prints 'null'. What is the reason behind this ?


Next semester I will take a course about Ring and Module Theory. Can anyone tell me the best texbooks and problems books about it. I only know some famous problems books such as Exercises in Classical Ring Theory, Exercises in Modules and Rings, Exercises in Basic Ring Theory.


"limited" access to wifi after upgrading to Windows 8.1

After my sister upgraded her Lenovo laptop to Windows 8.1, her internet connection keeps showing "limited" connection. She can't access to internet. However, my Toshiba laptop (Windows 7) can access to internet. Even though we tried to restart her laptop and even disconnect and reconnect the modem few times, same problem still occur. Please help.


I would like to know how I can find  the path of the recycle bin and its files.  I have tried  to find  them from a DOS command.  However, it took me to the recycle.bin but did not show its path.  How can I find out the path of recycle bin? Is there a command to retreive that?


how to manage translations in salesforce for the application running outside salesforce?

We are developing an application that will be deployed on a web platform.The backend data is stored in salesforce and what we would like to do is to support multi lingual app. Is there a way where the form labels will get translated based on some code/setting within salesforce and the values will be accessed on the application outside salesforce? For example - if the attribute value passed to the component is 'French' , all the form labels and buttons would get translated to French language. Similarly it translates any languages dynamically as long as it is translated in Salesforce. Is this possible or any suggestions on this?


Proof of $\sin nx=2^{n-1}\prod_{k=0}^{n-1} \sin\left( x + \frac{k\pi}{n} \right)$

I have seen this identity on Wolfram mathworld and in a comment to another similar trigonometric proof:    I can't seem to find a proof to this identity online anywhere. What method is used to prove this?


Merging CSV (single line per row) files without losing the header line

I need to merge two CSV files: datasorted1.csv and datasorted2.csv, but my headers keep getting sorted.  head -n 1 datasorted1.csv datasorted2.csv > resultado.csv && tail -n +2 datasorted1.csv datasorted2.csv | sort -t "|" -k 1 >> resultado.csv   Sample data:  Name|Email|Country|Company|Phone Brent Trujillo|tempus@mauris.org|Burkina Faso|Donec LLC|(612) 943-0167


Can you please provide a step by step solution for next integral. I don't have any idea of how this can be solved $\displaystyle\int e^{x^2}\,dx$.


How to succinctly express $A_k{\times}A_{k-1}{\times}A_{k-2}{\times} ... {\times}A_1$

I was thinking of writing: $$\prod_{i=k}^1 A_i$$ But I'm not sure if it is the correct way to do it. As in: $$\left(A_1{\times}A_2{\times}A_3{\times} ... A_k\right)^{-1} = A_k^{-1}{\times}A^{-1}_{k-1}{\times}A^{-1}_{k-2}{\times} ... {\times}A^{-1}_1$$ I intended to write it more succinctly as: $$ \left(\prod_{i=1}^k A_i \right)^{-1} = \, \prod_{i=k}^1 A_i^{-1}$$ But I'm not sure if it's the correct way of representing it.                   EDIT The $A_i$ are matrices.


Can I change the Linux console (Ctrl+Alt+F1) font to Ubuntu Mono?

Is there a way to set a specific TTF font to be used on the console? (I believe you might have to convert it to a bitmap font?)  If it needs to be converted, what tools can I use to do the conversion? Otherwise, how do I pick Ubuntu Monospace for my console font?  (I already have the Ubuntu Monospace font installed from the beta PPA for it.)  Edit: I already set gnome-terminal to use Ubuntu Mono. Now I'm wanting to set the all-text screens I get when I press Ctrl+Alt+F1 to use the same font.


I want to have an Ubuntu LiveCD or LiveUSB with a program (Cisco Packet Tracer) installed on it that’s always there every time I boot.   Anyone knows how to do this?   (Preferably as an image as I want this on several USB-sticks, but maybe I can also do some kind of clone if I succeed on one.)    Thanks!  Magnus


If $R:S^{1}\rightarrow S^{1}$ is a irrational rotation, $\{R^{n}([x])\}$ is dense in $S^{1}$ for all points.

Let $\alpha$ a irrational number, and $R:S^{1}\rightarrow S^{1}$ the irrational rotation, i.e., $[x]\rightarrow[x+\alpha]$. I need to prove that, for all $[x]\in S^{1}$, the set $\{R^{n}([x])\}$ is dense in $S^{1}$.  First, I can write $R$ by  $$R(e^{2\pi ix})=e^{2\pi i (x+\alpha)}.$$  So, I can write $R^{n}(x)$, $n\in\mathbb{Z}$ by  $$R^{n}(e^{2\pi i x})=e^{2\pi i(x+n\alpha)} $$  I need to prove that, for all $e^{2\pi i x}\in S^{1}$ and for all $[y]=e^{2\pi i y}\in S^{1}$, every neighborhood $V$ of $[y]$ contains a point $[z_{y}]=e^{2\pi i z}$ such that $[z_y]=R^{n}([x])$ for some $n\in\mathbb{Z}$. That is,  $e^{2\pi i z}=e^{2\pi i (x+\alpha n)}\Rightarrow 2\pi iz=2\pi i(x+\alpha n)+2ik\pi\;\textrm{for some}\;k\in\mathbb{Z}\Rightarrow z=x+\alpha n+k.$  Is my way correct? If it does, how can I proceed now? If it doesn't, what I need to do?  I don't think this question is duplicate. I'm showing my attempt to proof, that is different from other proofs.


How to hook into the CPT's title placeholder?

I want to change the default placeholder text in my Custom Post Type title field. This isn't possible while registering a new post type.  The following screenshot describes it.


How is prestige gain computed when battling a gym you own?

When I took over a gym, I wanted to level it up. I battled it with my most powerful Pokemon (who was about twice the CP of the pokemon in the gym) and I gave less prestige when I used a more powerful Pokemon (+100) than when I used one closer to the CP of the gym'd Pokemon (+284).  So, how is prestige gain computed? Prestige loss is fairly static but it's unclear to me what the rate of gain is and what influences it.