UMVUE of $\exp(t \mu)$ for $N(\mu, \sigma^2)$ where $\mu$ is not known but $\sigma^2$ is known

I am new to UMVUE calculations and struggling a bit with this question. I want a hint about how to approach the derivation of the UMVUE for $\exp(t [\mu)$ for $N(\mu, \sigma^2)$ where (\mu is not known but \sigma^2 is known. I would go directly as finding the $E[h(T)] = e^{t\mu} $ I intend to use the density of $\bar X \sim (N, \sigma^2/n)$ in the computation of the expectation on the left side but I got stuck right after that. Thanks in advance.


Stubborn Startup Page - MyStartSearch - mystartsearch.com

Just earlier I opened IE to go check my emails, etc... but my startup page is not google anymore as it previously was. The startup page was instead some "mystartsearches" thing which I had not downloaded. I also had two new add-ins into IE that I had not downloaded nor had been installed with any other program. I have been able to remove said add-ons, I have changed the home page to google, but it still does not open google on startup. Is there any extra configuration or file I need to change to make this startup page changed to be in sync with my homepage?  Extra info: I have cleared all settings from IE, restored to default, cleared all history and cache, refreshed my DNS cache, etc.


Error when trying sudo apt-get update - Python related?

I hope you can help me. I installed Ubuntu 18.04 a few days ago and, while trying to configure it and installing new packaged and software, I think I did something bad. I think it could be related with installing python. Anyway, netiher the gnome-terminal or gnome-tweaks can´t start anymores. Also, when I try to update (sudo apt-get update) it gives me the following error:  sh 1: /usr/lib/cnf-update-db: not found Reading package lists... Done E: Problem executing scripts APT::Update::Post-Invoke-Succes 'if /usr/bin/test -w /var/lib/command-not-found -a -e /usr/lib/cnf-update-db > /dev/null; fi' E: Sub-process returned an error code   I am relativeley new to Linux so I have no clue how can I fix this. Any idea? Even to restore defult configurations/settings?  Thank you very much!


How to get the list of modifiers currently in the modifier stack of the object

I want to get a list of modifiers that r in the modifier stack of an object i have no idea how this is done , so I haven't tried anything yet. if i have a subdivision surface modifier applied on the object then i want a list that says ["Subdivision"]


what are the things to include in a (ubuntu 20.04 LTS) backup?

People like me who constantly re-installs distro for some reasons doesn't want to go with the same process of setting up the previous environment.(unlike windows where i know what folders and drives needs to be included in backup(although i use AOMEI BACKUPPER) so my life is easy in windows but not so in ubuntu because i'm an avid noob who keeps messing up with system and then re-installs it.


Is this code correct? int *set_new (int choice) {    int *new_choice {new int};    *new_choice = choice;    return new_choice; }  Should I delete *new_choice after the value is returned, because *new_choice is on the memory heap? int *set_new (int choice) {    int *new_choice {new int};    *new_choice = choice;    return new_choice;    delete new_choice; }  Or, do I need to delete it where the function is finished calling? if not deleted, will it cause a memory leak? I learned on a website if you use dynamic memory (new) immediately after that delete (delete) so there is no memory leak. The function is called in main: int main () {  int *b {new_choice (23)};  printf ("% d", *b);  delete b; }


Typesetting the definition of a piecewise function

How to write this in LaTeX:  y = {1 if a >b      0 if a <b   How to make the big bracket that contains both and defines the function y?


I have a page with a modal. One option in this modal is to print the page using window.print().   This prints the modal and not the page.  How can I print just the page and not the modal?


x=0.008+0.005 if x==0.0130     disp('hurray'); end   The above equality doesn't satisfy for these specific set of numbers 0.008 and 0.005, though it works for 0.009 and 0.004.


What exactly the Heisenberg Uncertainty Principle explains?

I just don't understand what Heisenberg meant by the statement that "It is impossible to determine both position and momentum of an electron simultaneously.If one quantity is known then the determination of the other quantity will become impossible." Now, it obvious that position of an object can not be determined if it is in motion or having a momentum because it is continuously changing its position. If it is at rest we can determine its position but not momentum since it has a zero velocity. Did he mean that electron never come to rest?


In my textbook it is said that the quotient space $D^n/S^{n-1}$ is homeomorphic to $S^n$. I can imagine it for $n=2$, but fail to make a mathematical proof for any dimension.  Can anyone provide a rigorous proof?


How can I travel flexibly around the US?

In Europe, travelers can buy a special rail pass that gives them unlimited train rides for a month. And some airlines offer tickets where a list of destinations is chosen in advance, but the flight dates are flexible and can be chosen on short notice.   Is there anything similar for traveling around the US by bus or train? Greyhound used to offer something like it, called the "Discovery Pass," but it seems to have been discontinued. And Amtrak only seems to offer unlimited passes on specific short routes, mainly targeting commuters.


If $G/Z(G)$ is nilpotent then $G$ is nilpotent

Notation : $Z_{i+1}(G)=${$g\in G : [g,x]\in Z_i(G)  \forall x\in G$} where $Z_0(G)=1$.  Definition : $G$ is said to be nilpotent if $Z_n(G)=G$ for some $n\in \Bbb N$.  Let $Z_n(G/Z(G))=G/Z(G)$. I have that $Z_{i+1}(G)/Z_i(G)=Z(G/Z_i(G))$. Then $\frac{Z_{i+1}(G)/Z(G)} {Z_i(G)/Z(G)}≈Z(\frac{G/Z(G)}{Z_i(G)/Z(G)})$. Now the L.H.S is a subgroup of $\frac{G/Z(G)}{Z_i(G)/Z(G)}$ and the R.H.S is a characteristic subgroup of $\frac{G/Z(G)}{Z_i(G)/Z(G)}$. Since L.H.S is isomorphic to R.H.S, I conclude that L.H.S.=R.H.S. At this stage I am stuck. What can I conclude from this?


Here is the basic problem that I am running into over and over. I have a question that I would like to find an answer to on Stack Exchange. As I search I find a number of promising Q&As in the system that are effectively duplicates of my question. So far so good.  When I go through the answers I realize that every answer is many years old and refers to a version of the language that I am no longer using. Bumping the question or trying to get it more attention is not specifically useful in this case because the answers it already has are perfectly good and well-accepted answers in the context of when it was asked.  Despite the answers being good, it is likely there are much better ways to address the problem with a more modern version of the language. Additionally, perspectives change over time, best practices at that time may have been very different from now.   By just bumping and encouraging extensions to the old answer we are creating a confusing mix of old and new answers. More importantly, good new answers to very old questions are unlikely to receive the votes or attention the deserve when they are competing against a top rated answer with years of upvotes.   I want to be a good Stack Exchange citizen and not post duplicate questions, but the answers as they currently stand do not address the capabilities of more up to date programming languages and there doesn't seem to be a solid way to re-pose the question in a more up to date context without being overwhelmed with duplicate question tags.  Is there a suggestion to handle this situation?  I also wanted to put out the idea that it may be helpful to have a mechanism that depreciates Q&As without a freshly accepted answer for X period of time. I am specifically not suggesting they get deleted, but that we should be more accepting of questions that are duplicates or very similar to old depreciated Q&As.  Another helpful item would be some indication of the age of a Q&A. I realize that the dates are on every post, but the information is not easy to see when you are searching for answers.  I am not trying to upset the system here, but I think it would be worthwhile discussing ways to make the information contained in these sites more timely and relevant.     I am getting a lot of pushback on this either not being an issue or I   should just follow advice to edit the old question to reflect new   technology. Based on this I would like to understand if anyone sees   this as a problem. So I am going to ask some questions directly;      Does anyone see a problem with old Q&As stagnating and not getting   updated with new answers that reflect current technology?      Does anyone feel it would be better to have a system that facilitates   or encourages new answers to old Q&As so that we have information that   better reflects current programming standards and technologies?   This Question has a discussion tag in the hope that we could have a discussion on the topic. I am still hoping that will happen, but if no one else sees the problem I can refocus on something else. My goal wasn't to post a question that has a bunch of people voting it down.


Clone ownership and permissions from another file?

Is there a command or flag to clone the user/group ownership and permissions on a file from another file? To make the perms and ownership exactly those of another file?


How can I create a video file from a set of jpg images?

I am attempting to create a video file from a set of JPG images. I have adapted the instructions given in  but have experienced some issues.   Firstly, not all of the required packages are available, but are replaced by libav-tools, which is already installed - so I think that's not an actual problem?   My files are named image-NN.jpg (NN being an integer) and I have used the command  avconv -i "image-%d.jpg" -r 25 -c:v libx264 -crf 20  -pix_fmt yuv420p movie.mov   as per the linked question, but this just gives a No such file image-%d.jpg error. I   I tried changing it to   avconv -i "image-*.jpg" -r 25 -c:v libx264 -crf 20  -pix_fmt yuv420p movie.mov   and this produces a video file of length 0:00 that appears to only contain one frame. (I am guessing that the * has used the first match, rather than every match).    gives a slightly different way of formatting the file name, so I tried   avconv -i "image-%02d.jpg" -r 25 -c:v libx264 -crf 20  -pix_fmt yuv420p movie.mov   This produces a larger file, and makes a video that lasts for about 3 seconds (approx the length I was expecting) but it contains just the first frame.   Another answer on the first linked question suggests using ImageMagick, so I gave this a try  convert -delay 1 image-*.jpg output.mp4   But this produced an error   convert.im6: delegate failed `"ffmpeg" -v -1 -mbd rd -trellis 2 -cmp 2 -subcmp 2 -g 300 -i "%M%%d.jpg" "%u.%m" 2> "%Z"' @ error/delegate.c/InvokeDelegate/1065.   The version of avconv is  carl@number1 ~/Scott's stop-motion/1 $ avconv -version avconv version 9.18-6:9.18-0ubuntu0.14.04.1, Copyright (c) 2000-2014 the Libav developers built on Mar 16 2015 13:19:10 with gcc 4.8 (Ubuntu 4.8.2-19ubuntu1) avconv 9.18-6:9.18-0ubuntu0.14.04.1 libavutil     52.  3. 0 / 52.  3. 0 libavcodec    54. 35. 0 / 54. 35. 0 libavformat   54. 20. 4 / 54. 20. 4 libavdevice   53.  2. 0 / 53.  2. 0 libavfilter    3.  3. 0 /  3.  3. 0 libavresample  1.  0. 1 /  1.  0. 1 libswscale     2.  1. 1 /  2.  1. 1   Where am I going wrong, and what do I need to do?     Additional: It was suggested that I list every file individually, so with a bit of Python I generated this  avconv -i image-01.jpg image-02.jpg image-03.jpg image-04.jpg image-05.jpg image-06.jpg image-07.jpg image-08.jpg image-09.jpg image-10.jpg image-11.jpg image-12.jpg image-13.jpg image-14.jpg image-15.jpg image-16.jpg image-17.jpg image-18.jpg image-19.jpg image-20.jpg image-21.jpg image-22.jpg image-23.jpg image-24.jpg image-25.jpg image-26.jpg image-27.jpg image-28.jpg image-29.jpg image-30.jpg image-31.jpg image-32.jpg image-33.jpg image-34.jpg image-35.jpg image-36.jpg image-37.jpg image-38.jpg image-39.jpg image-40.jpg image-41.jpg image-42.jpg image-43.jpg image-44.jpg image-45.jpg image-46.jpg image-47.jpg image-48.jpg image-49.jpg image-50.jpg image-51.jpg image-52.jpg image-53.jpg image-54.jpg image-55.jpg image-56.jpg image-57.jpg image-58.jpg image-59.jpg image-60.jpg image-61.jpg image-62.jpg image-63.jpg image-64.jpg image-65.jpg image-66.jpg image-67.jpg image-68.jpg image-69.jpg image-70.jpg image-71.jpg image-72.jpg image-73.jpg image-74.jpg image-75.jpg image-76.jpg image-77.jpg image-78.jpg image-79.jpg image-80.jpg image-81.jpg image-82.jpg image-83.jpg image-84.jpg image-85.jpg image-86.jpg image-87.jpg image-88.jpg  -r 25 -c:v libx264 -crf 20  -pix_fmt yuv420p movie.mov   This had the same effect as previous - only the first frame is used.  Additional:  has been suggested as a possible duplicate, but it relates to acquiring images using a webcam connected to a PC. This is not the issue I am having. I already have the photos; they were taken with an ordinary digital camera.


I want to have the "^" sign over the "=" sign.  I have tried \newcommand{\defeq}{\overset{^}{=}}, \newcommand{\defeq}{\stackrel{\text{^}}{=}}, \newcommand{\defeq}{\overset{\^}{=}} and different combinations of these, but none have worked yet.  Also, I would like my command only to work in math mode (in the {$$}, \begin{equation}, and such environments). I do not want it to work in textmode, so the output of \defeq , {$\defeq$} should be , ^= (but the ^ over the =).


If $A^2 = I$, then $\operatorname{rank} (A+I) + \operatorname{rank} (A-I) =n$

Let $A ∈ M_n$. If $A^2 = I$,    show that   $$\operatorname{rank} (A + I) + \operatorname{rank} (A − I) = n$$   I know that $x^2=1$, $x^2-1=0$, and so $(x-1)(x+1)=0$. So  depending on this formula, how I can complete my solution to this question   or how can I use  anther methods to solve it. Any one could help me please?


Creating a redundant environment with ONLY 2 servers (so without a third server that handles the load-balancing)

First of all, i'm sorry if this question has been answered before, but i've been searching for a while now and couldn't seem to find (or understand) an answer.  So, i have two physical servers with centOS on them. 1 of them is already hosting some websites and databases. Now i want to make a redundant environment by using load balancing with failover. so basically, i want to have both servers running, dividing the work by the amound of connections that are open at that moment and when 1 of them crashes let the other server take over all the work.  Every example i came across had a 3th server for haproxy in front of 2 webservers. But would it be possible with just the 2 servers (by installing haproxy on both webservers for example)? Or is there a better way of handling this problem?  thanks in advance.


Is Ubuntu 16.04 same as Lubuntu 16.04 or Elementary OS Loki with the desktop environments changed? Can I install Elementary OS Loki and 'switch' to Ubuntu just by installing the Unity desktop environment?  My question is different from  where the asker only wanted to switch between the desktop environments. I specifically want to know if the underlying codebase and kernel is same between all these flavors.  And lastly, if I have Elementary OS installed, is it possible to get updates from the latest Ubuntu repository?


Every time I open my browsers, be it Firefox, Chrome, Dragon, or , the qvo6.com page loads. The homepages for these browsers are set to blank. Yet this problem persists.   doesn't seem to work at all!  I've tried TrendMicro's HijackThis, and it still doesn't seem to help.  Any means to remove this annoying thing? I don't remember what caused this.


I retrieved an old math book and I'm delighted to share following exercise.     The pencils in a box of crayons always have the same color.   Proof by induction on the number $n$ of pencils in the box:   This is true when $n=1$. All the pencils, only one, havs the same color. Suppose the result true for a box having $n+1$ crayons. Remove one. Remains $n$ crayons. By induction hypothesis they all have the same color. Put back the crayon you removed and remove another one. The $n$ remaining crayons in the box have again the same color by induction hypothesis. Hence the two crayons that were removed have the same color. Therefore all the $n+1$ crayons have the same color.   Can you find what's wrong here?


I want a 2x2 scatterplot matrix of the data in the file scatter.dat:  0.5334437   0.4824717 0.6848940   0.6865826 0.5818373   0.6335347 0.5465202   0.5290712   The following code works:  \begin{tikzpicture}   \pgfplotstableread{scatter.dat}\myscatter   \begin{groupplot}[       group style={         group size=2 by 2,         horizontal sep=0pt, vertical sep=0pt,         xticklabels at=edge bottom,yticklabels at=edge left},       height=3.5cm,width=3.5cm,     ]      \nextgroupplot     \addplot+[only marks] table[header=false,x index=0,y index=0] {\myscatter};     \nextgroupplot     \addplot+[only marks] table[header=false,x index=0,y index=1] {\myscatter};     \nextgroupplot     \addplot+[only marks] table[header=false,x index=1,y index=0] {\myscatter};     \nextgroupplot     \addplot+[only marks] table[header=false,x index=1,y index=1] {\myscatter};   \end{groupplot} \end{tikzpicture}   I would prefer an automatic version with loops for larger scatter plot matrices by modifying the code from above as follows:  \begin{tikzpicture}   \pgfplotstableread{scatter.dat}\myscatter   \begin{groupplot}[       group style={         group size=2 by 2,         horizontal sep=0pt, vertical sep=0pt,         xticklabels at=edge bottom,yticklabels at=edge left},       height=3.5cm,width=3.5cm,     ]      \foreach \columnA in {0,...,1} {       \foreach \columnB in {0,...,1} {         \nextgroupplot         \addplot+[only marks]            table[header=false,x index=\columnA,y index=\columnB]           {\myscatter};       }     }   \end{groupplot} \end{tikzpicture}   However, compiling this code with pdflatex yields the following error:  ! Illegal unit of measure (pt inserted). <to be read again>


I know this site is for very specific programming questions. Does anyone have any recommendations for sites that allow longer discussions on technology choices and perhaps even discussion of specific software designs for new projects?  Sometimes getting a few good people to look through a proposal can help you avoid major headaches by pointing out better design alternatives.


How to get all possible combinations of a list’s elements?

I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe?


How to compare the string with case insensitive

I already know about the lower() and upper() but is there any simplest method to do it,for example like ignoreCase() in Java,  ex code:  a="hello how are you,i am praveen",  now if i do   "PRAVEEN" in a:  it gives us false,i want to make it caseinsensitive    thank you in advance


What is the origin of elements heavier than iron?

In all the discussions about how the heavy elements in the universe are forged in the guts of stars and especially during a star's death, I usually hear that once the star begins fusing lighter atoms to produce iron (Fe) that's the end of the star's life and the whole system collapses onto itself; and based on how massive the star was initially, it has different outcome - like a white dwarf, a neutron star or a black hole. I have rarely heard a detailed explanation of how the elements heavier than iron are produced. I would appreciate a convincing explanation of this process.


Why a mono-atomic crystal layer (2D) can't be stable?

According to Peierls and Landau, 2D crystals were thermodynamically unstable. They can't exist! Of course, this theory was disapproved in 2004 (example: graphene).  What is the general definition of stability of a general system?  What is the thermodynamics' stability?


find the min and max value in two columns

I have some data which looks like:  sampleA    ATGC    10   100 sampleA    ATGC    120  230 sampleA    ATGC    200  110   I want to print the min and max using the values in both column 3 and 4. So my output should look like:  sampleA   10  230   Thanks in advance


Creating equal and hashcode for a class using a map

I have a class as shown below and wanted to create several instance of it where each object should be unique based on the content of map.  For this equals and hashcode functions should be specified and I'm looking a way to implement using the map.  private class A {      private Map<String, Object> map;      public A () {         this.map = new HashMap<>();     }      public void addElement (String s, Object v) {         map.put(s, v);     }      @Override public boolean equals (Object o) {         // should be on map     }      @Override public int hashCode () {         // should be on map     } }


How to remove a file completely from git repository?

I added app.apk into git repository first, and then we decided to remove app.apk from git repository. Not only remove it from source code directory but also .git directory to reduce the size of git repository.  Suppose I have a commit log like this:  commit07 remove `app.apk` from source code directory commit06 update some files commit06 update `app.apk` and some files commit05 fix some bug in source code files commit04 update `app.apk` and some other source code files commit03 update some source code files commit02 add `app.apk` and some other source code files commit01 init   but the size does not shrink. I want to remove app.apk from history too.  Which means if I checkout commit04 and ls app.apk will say app.apk not found  the commit hash is OK to be changed.  Is it possible to do that?


create sql query that got row between 2 times from 2 times

The table that called "events" has 2 paranetes. StartTime and EndTime that contain UNIX time.  ID   StartTime    EndTime 1   1522530000   1532590000   i got 2 values from the user that contain Unix Times.  $start = 1522530000; $end = 1532590000;   Im trying to get the rows between the times that i got:  SELECT * FROM `events` WHERE (StartTime <= '$start' AND EndTime >= '$end')    And its work but not always, like:  $start = 1530392400; $end = 1534107599;   what can i do?


The confusing nature of direct sum for finite abelian groups

I would first like to make sure of the following concepts, note that all groups are abelian. Let $A,B$ be subgroups of $G$.  (1) Cartesian product (a.k.a. external product): The Cartesian product of subgroups $A$ and $B$ is $A \times B = \left\{ (a,b) \:{:}\: a \in A, b \in B \right\}$ where the operation by components is the group operation.  (2) Internal product: The internal product of subgroups $A$ and $B$ is $AB = \left\{ ab \:{:}\: a \in A, b \in B \right\}$.  (3) Sum: The sum of subgroups A and B is $A + B = \left\{ a + b \:{:}\: a \in A, b \in B \right\}$.  So (2) and (3) are basically the same objects because (2) is used under the multiplicative notation and (3) is used under the additive notation.  (4) Direct product: The internal product $AB$ is called a direct product and denoted $A \times B$ (confusingly enough) if $A \cap B = \left\{ 1 \right\}$.  (5) Direct sum: The sum $A + B$ is called a direct sum and denoted $A \oplus B$ if $A \cap B = \left\{ 0 \right\}$.  So (4) and (5) are basically the same objects because (4) is used under the multiplicative notation and (5) is used under the additive notation.  I am aware that (1) and (4) (or (5)) are isomorphic and often used interchangeably. When the direct sum is used in a correct way, it causes no confusion at all such as $\mathbb{Z}_{15} = \left\{ 0,5,10 \right\} \oplus \left\{ 0,3,6,9,12 \right\}$.  But when it is used in a rather ambiguous way such as $\mathbb{Z}_2 \oplus \mathbb{Z}_2$, which should be $\left\{ 0+0,0+1,1+0,1+1 \right\} = \left\{ 0,1 \right\}$, which is of order $2$, but I have seen my lecturer saying it is of order $4$, so he must have interpreted it as the Cartesian product owing to the isomorphic nature.  I am really not happy with this as the definition of sum and direct sum clearly states otherwise. Could anyone shed some enlightening lights on this issue?


How to modify citation and database entry for conf. proceeding with the iet bibliography style?

The iet.bst file is not providing the appropriate citation for conference proceedings and database entry. How do I modify it?  The iet.bst file under section 2.6.5 on the webpage which I am using:   The bib entries are:  @INPROCEEDINGS{byang,         author={B. Yang and D. Hartung and K. Simoens and C. Busch},         booktitle={IEEE International Conference on Biometrics:          Theory Applications and Systems (BTAS)},         title={Dynamic random projection for biometric template protection},         year={2010},         pages={1-7},         month={Sept},}  @TECHREPORT{nist,     author = "C. I. Watson and M. D. Garris and E. Tabassi and      C. L. Wilson and R. M. McCabe and S. Janet and K. Ko",     title = "User's guide to Non-Export Controlled Distribution of NIST Biometric Image Software",     institution = "NIST",     year = "2004" }  @INPROCEEDINGS{ice,     author={Phillips, P.J. and Bowyer, K.W. and Flynn, P.J.      and Liu, X. and Scruggs, W.T.},     booktitle={2nd IEEE International Conference on Biometrics: Theory, Applications and Systems},     title={The Iris Challenge Evaluation 2005},     year={2008},     month={Sept},     pages={1-8}, }    @MANUAL{fvc,      TITLE = "Fingerprint Verification Competition (FVC2002)",      NOTE = "http://bias.csr.unibo.it/fvc2002/databases.asp",      }


Let $K=\mathbb{Z}_p(t)$. How to prove $f(x)=x^p-t$ is irreducible in $K[x]$?


In my html I have the following ajax code which populate data into a table:  function generate_table() {        var tr;       $('#emp_body').html('');       for (var i = 0; i < displayRecords.length; i++) {         tr = $('
');         tr.append("" + displayRecords[i].id + "	");         tr.append("" + displayRecords[i].email_address + "	");         tr.append("" + displayRecords[i].mobile_number + "	");         tr.append("" + displayRecords[i].status + "	");         tr.append("" + displayRecords[i].credit_limit + "	");         var $td = $('').html('Edit');         tr.append($td);         $('#emp_body').append(tr);       }     }   I also have a jquery on click function:  jQuery('.editbtn').on('click', function() {        var $row = jQuery(this).closest('tr');       var $columns = $row.find('td');       var values = [];        jQuery.each($columns, function(i, item) {           values.push(item.innerHTML)       });       console.log(values[0]);       window.location.href = "/portal/admin/customerDetails?id=" + values[0];      });   So the issue here is that, when I click on Edit button, it does not call the on click function. How can I fix this issue ?


Is Darth Vader really afraid of the Emperor?

In Episode VI, during their conversation before meeting the Emperor, Luke asks Vader to give up on the Emperor and join him instead, at which Vader replies: "You don't know the power of the Dark Side, I must obey my master".  What does this mean? Is Vader somehow afraid of the Emperor?  P.S. Please do not say it was a lie, a deceptive trick to get Luke to join the Dark Side, because clearly it has nothing to do with that.


for which values of $n$, $1+n+n^{2}+n^{3}+n^{4}$ is a perfect square?

I saw a question my number theory notes: for which values of $n$ , $1+n+n^{2}+n^{3}+n^{4}$ is a perfect  square where $"n"$ is non negative integer? It was solved my professor using inequalities,but i think that his method is too long.Because of that, i did not write it here. I tried to solve it using modular arithmetic but i could not do it. I am looking for hints or solutions to solve it using modular artihmatic. Note= I tried to use $(mod4)$ because for all $x^{2} \equiv \pm 1 (mod4)$ but i stuck in it.


Javascript loop very inefficient......Why?

I am not a javascript expert but thought this was a slam dunk to code until I saw the results. I am looking for help to make this MUCH more efficient. I have a simple for-loop going over a list of data rows. Typically there are 10 or so but sometimes there might be up to a couple of thousand. With 10 its no problem. With 1200 it takes 34 seconds!! The code -            for(let i = 0; i < selectedRows.length; i++) {                 selectedRows[i].checked = event.target.checked;             }  I am setting the "checked" variable in all rows to true or false. i.e. someone selected the "Check all boxes" checkbox. As mentioned above, with 1200 rows it takes 34 seconds. When I add timers in like the following -             for(let i = 0; i < selectedRows.length; i++) {                 console.time('handle checking of box - ' + i);                 selectedRows[i].checked = event.target.checked;                 console.timeEnd('handle checking of box - ' + i);             }  what is interesting is that the loop starts out fast. It does a row in about 1ms which is what I would expect.  But, as the loop progresses it gets much slower until at the end each row takes 20ms.  Can anyone help me understand why the loop gets slower and slower as well as perhaps a better way of doing this?


My question—my meta-question as the case may be—concerns the purpose of these words referred to as "tags". Let me be clear: I use tags. The site supports them, so why shouldn't I? My understanding of their reason for existing is tragically incomplete.   Are they used for searching? Are they useful in any other way, or do they merely act as decoration?     For more information, see "" and "" in the .


If $A$ and $B$ are compact subsets of $\mathbb R$, then so is $\frac{A}B$.

Given compact $A,B \subseteq \mathbb{R}$ with $\alpha := \inf(B) > 0$, define $$\frac{A}B := \left\{\frac{x}y : x \in A  \text{ and } y \in B\right\}.$$ Show that $\frac{A}{B}$ is compact.  I am thinking of using the following result given in a previous exercice but I don't know how to proceed.     $K \subset \mathbb R^n$ is compact if and only if for all $\{x_{n}\}$ such that $\{x_{n} : n\in \{1,2,\dotsc\}\}\subset K$, there exists a convergent subsequence $\{{x_{\phi(n)}}\}$ that converges to a limit $l \in K$.   When does the infimum come into place?


Should basic netiquette dictate that we post reasons for downvoting?

Possible Duplicate:    OK, I've just got downvoted for an answer that was previously upvoted. I'm pretty sure my answer wasn't the best, yet not the worst. It was also not a subjective question and I got a little upset because... One of the reasons I'm participating on discussion forums or hybrids like StackOverflow is that I want to get some feedback for what (I think) I know. But, there are occasions in here where you have no idea why your response was bad and thus downvoted. I mean, a question is not about who gives the best answer, it is about learning from each other. If you downvote me, give me a reason for it. Don't be a coward or a selfish person that keeps all the knowledge for himself. I've been searching on uservoice and any proposal to enforce some feedback when downvoting was rejected so I believe giving feedback for a downvote should be basic netiquette in here. If the system can't enforce it the we should rely on common sense. So... When you downvote, please give feedback:  Say, "Hey, I downvoted you. It was me, ok? Now you know." Say, "Hey, -1 because you said that." Say, "Hey, that what you said is actually the other, -1"  It's not that funny to offer free consultation letting ghosts assess your knowledge. I'm doing this for free so I expect this to be a fair trade by receiving real feedback for free. I'm also convinced I'm not the only one having this problem, so please share your opinions. Edit: I'm a little bit shocked. Within a minute after posting this "question" some people downvoted almost all of my questions (no subjective questions and I may say pretty hard to answer). So, some people are very touchy today although I didn't point the finger at anyone... I wouldn't have believed this could happen.


Java, Finding Kth largest value from the array

I had an interview with Facebook and they asked me this question.     Suppose you have an unordered array with N distinct values       $input = [3,6,2,8,9,4,5]       Implement a function that finds the Kth largest value.      EG: If K = 0, return 9. If K = 1, return 8.   What I did was this method.  private static int getMax(Integer[] input, int k) {     List<Integer> list = Arrays.asList(input);     Set<Integer> set = new TreeSet<Integer>(list);      list = new ArrayList<Integer>(set);     int value = (list.size() - 1) - k;      return list.get(value); }   I just tested and the method works fine based on the question. However, interviewee said, in order to make your life complex! lets assume that your array contains millions of numbers then your listing becomes too slow. What you do in this case? As hint, he suggested to use min heap. Based on my knowledge each child value of heap should not be more than root value. So, in this case if we assume that 3 is root then 6 is its child and its value is grater than root's value. I'm probably wrong but what you think and what is its implementation based on min heap?


Who or what is the oldest sentient being in Tolkien's lore?

The Hobbit, The Lord of the Rings, The Silmarillion, The Histories of Middle Earth, all lore related to this universe is acceptable fodder. Regardless of their power, susceptibility to The One Ring, amount of appearances, or any other constraint, who or what is the oldest?   Since Eru is the "easy" answer, then who or what is second? Any canon source, including letters, is acceptable.  I am asking this as more defined version of  which was put on hold.  And if it matters, the criteria would be oldest at the end of LotR or whatever place he left off in his tales whether the being was alive or not at that point. Example: if being 1 was 999 years old at point A and died, and being 2 was 998 at point B (years after point A) and died, being 1 was oldest in the lore.   (I am not well-read in the Histories and letters and such. If he continued the tale much past the end of LotR, then that is the cut-off point. Oldest sentient being, alive or dead, at the end of canon.)  If you have a question about if some source counts, ask yourself: Did it come from JRR or Christopher working from his father's notes? If the answer is Yes, then it counts. If it does not come from the family, then no. I can trust scholars, but would like the trail to be only one degree of separation. If your case is compelling enough, a pass may be granted.   EDIT  If it's not bad form, can I extend the question to the oldest four? Eru is too obvious and as Kevin comments, "Eru was clearly first, he created the ainur second, and it's generally indicated that Tom Bombadil is tied to Middle-Earth and so third." The "generally indicated" thing is not decisive, but, if this is indeed accurate, I'm curious to know just a little bit more. Please either play along with me, or slap my hand for grabbing too many cookies. It's a fascinating and complicated history I know too little about. (I do plan to remedy this someday.)  NEWER EDIT  I just noticed this question still gets viewed and was active a few months ago. Let me further clarify. I am after the oldest entity AT ANY POINT in the canon. If a creature lived to be 99 years (I'm using low numbers to keep it simple) and then died, and another lived to be 98 at the close of the canon, the dead one wins. Living, dead, doesn't matter. Age at end of canon is all that counts.


hyperref pagebackref: page number and link in references wrong

I try to use hyperref with pagebackref to get a page number and a link for each of my references. My first pages have roman numbers (title page, ...), later on I switch to arabic numbers. For whatever reason the links in the references have the right page number but the link is wrong (somehow a negative offset).  I have a minimal example:  \documentclass[a4paper, 12pt, twoside]{report} \usepackage[latin1]{inputenc}  \usepackage[T1]{fontenc} \usepackage[english,ngerman]{babel} \usepackage[left=4cm,top=3cm,right=3cm,bottom=4cm]{geometry} \usepackage[pdftex, plainpages=false, hypertexnames=false, pdfpagelabels=true,     hyperindex=true, linktocpage, pagebackref=true, pdfa=true]{hyperref}  \begin{document} \pagenumbering{roman} \pagestyle{empty} Titel  \setcounter{page}{1} \tableofcontents \newpage  \pagenumbering{arabic} \pagestyle{plain}  \chapter{one} \section{one} \newpage  \section{two} Zitation~\cite{citation_key}  \bibliographystyle{plain} \begin{thebibliography}{widest-label}     \bibitem{citation_key}Autor: Titel. Verlag, Jahr. \end{thebibliography}   \end{document}   Any ideas?


Is this normal? Ubuntu 14.04 Gnome 3.9.90?

I just finished installing Ubuntu 14.04 and Gnome Shell sudo apt-get install gnome-shell ubuntu-gnome-desktop, however when I checked what version has been installed I read 3.9.90: is this correct?   Isn't Ubuntu 14.04 supposed to ship with gnome 3.10 at least? What am I missing?


Where can I find or enable the processing toolbox in QGIS 2.18? Doesn't seem to be an option in the "View" drop menu, and the help file doesn't have anything about how to get it to display  I attached a screenshot of what QGIS looks like to me, maybe it's there somewhere and I'm missing it?


Prove an algorithm which takes (n+1)^5 steps is O(n^5)?

Find out the c and n0.  Please explain with the steps.


I would like to ask if MS Access database supports working in networks & multi-user access?


When is it a good idea to use uint_least16_t as opposed to uint16_t?

I see the utility of the 'fast' integers (like uint_fast16_t) but I simply can't imagine a good reason to use uint_least16_t in lieu of uint16_t.  Can someone please enlighten me on the use of 'least' integers?  P.S. - This question is not a duplicate of  because this doesn't ask for the purpose of uint_least16_t in isolation; it asks for the purpose of uint_least16_t when the system also supports uint16_t.   The accepted answer in the similar question implies that uint_least16_t is to be used defensively because not all platforms may support uint16_t - that is not an acceptable answer for this question.


Or any other silver surface? Perfect silver "colour" just seems to be "reflecting gray", so something that absorbs all wavelengths by the same fraction and reflects everything else specularly. When I scratch it, it gets gray.  So a mirrors are gray and specular reflectors and therefore the colour we commonly call silver is, also, simply gray and specular. Is that correct or am I heading in the wrong direction here?


Proving that $\exp(z_1+z_2) = \exp(z_1)\exp(z_2)$ with power series

Probably a simple question, but I wonder about the following:  To prove that $\exp(z_1+z_2) = \exp(z_1)\exp(z_2)$, I use : $$\exp(z_1+z_2) = \sum_{n=0}^{\infty}\sum_{k=0}^n\frac{1}{k!(n-k)!}z_1^kz_2^{n-k} $$ by using the binomial expansion. Now the property has been proved if this sum equals: $$\sum_{k=0}^{\infty}\sum_{m=0}^{\infty}\frac{z_1^{k}z_2^{m}}{k!m!}$$  Strange enough, I don't see exactly why this is true (although they use this without explanation in many books). I see that both sums contain "all terms" formally, but I would be glad if someone could show rigorously that both sums converge to the same complex number. Probably it is just a property of series that I'm missing here.


I am in the process of completing some homework and have come across a question that says: "What is the steady-state current?" It is asking in reference to a circuit that includes two capacitors in parrallel and a DC source of 24V and an AC source given by $\epsilon = 20 \cos(120 \pi t)\ \text{V}$, where $t$ is in seconds. I assume that it is asking when the current is constant. Because naturally the current is not constant due to the AC source, would I just consider the DC source for this?


How can I allow my mouse cursor to pass from larger monitor to smaller based on relative positioning?

I currently have a monitor setup like below:                            +----------------------+                           |                      |                           |                      | +-----------++-----------+|                      | |           ||           ||      3840x2160       | | 1920x1200 || 1920x1200 ||                      | |           ||           ||                      | +-----------++-----------++----------------------+   I want to find a way to allow my mouse to always go from the 3840x2160 monitor to the 1920x1200 without it getting blocked because the larger monitor can't align fully.  I have been searching for a registry hack or a software product that could allow the cursor to pass from the larger to the smaller based on relative location, instead of exact pixel location. The goal being that the mouse cursor is never blocked at the edge of the 3840x2160 when attempting to go to the left 1920x1200 monitor.  Any help in solving this is appreciated.


As per  the issue I hoped would be resolved persist. Issue is that by upgrade I get the option to upgrade to 13.10. However 12.10, which I'm currently running, ended in May of 2014 – the “supplied” version is 13.10, but this one ended in July of 2014!  What to do now? Really hoped I could, for once, do an upgrade and not, yet again, buy a new HDD for upgrade ... with the days of work that this entails :P  Should I upgrade to 13.10 and then to 14.10 or 14.04 or is this a dead end. Is it a high risk operation etc.?  Can't post image so here is an ASCII version of dialogue  [»«][                       Software Updater                      ] _X | |                                                                      | |  +-------+  Software updates are no longer provided for Ubuntu       | |  |    ^  |  12.10                                                    | |  |    #  |                                                           | |  +-------+                                                           | |             To stay secure, you should upgrade to Ubuntu 13.10       | |                                                                      | |  [ Settings... ]                    [  Upgrade...  ] [     OK     ]  | |                                                                      | +----------------------------------------------------------------------+   After [  Upgrade...  ]:  = Upgrading to a no longer supported version =  You are about to upgrade to a version of Ubuntu that is no longer supported.   The target release of Ubuntu is '''no longer supported''' by Canonical. The support timeframe is between 9 month and 5 years after the initial release. You will not receive security updates or critical bugfixes. See http://www.ubuntu.com/releaseendoflife for details.  It is still possible to upgrade this version and eventually you will be able to upgrade to a supported release of Ubuntu.  Alternatively you may want to consider to reinstall the machine to the latest version, for more information on this, visit: http://www.ubuntu.com/desktop/get-ubuntu  For pre-installed system you may want to contact the manufacturer for instructions.  == Feedback and Helping ==  If you would like to help shape Ubuntu, take a look at the list of  ways you can participate at    http://www.ubuntu.com/community/participate/  Your comments, bug reports, patches and suggestions will help ensure that our next release is the best release of Ubuntu ever.  If you feel that you have found a bug please read:    http://help.ubuntu.com/community/ReportingBugs  Then report bugs using apport in Ubuntu.  For example:    ubuntu-bug linux  will open a bug report in Launchpad regarding the linux package.  If you have a question, or if you think you may have found a bug but  aren't sure, first try asking on the #ubuntu or #ubuntu-bugs IRC  channels on Freenode, on the Ubuntu Users mailing list, or on the  Ubuntu forums:    http://help.ubuntu.com/community/InternetRelayChat   http://lists.ubuntu.com/mailman/listinfo/ubuntu-users   http://www.ubuntuforums.org/   == More Information ==  You can find out more about Ubuntu on our website, IRC channel and wiki. If you're new to Ubuntu, please visit:    http://www.ubuntu.com/   To sign up for future Ubuntu announcements, please subscribe to Ubuntu's  very low volume announcement list at:    http://lists.ubuntu.com/mailman/listinfo/ubuntu-announce


Question: A family has three children but you don’t know their sexes. If at least two are boys, what’s the probability one child is a girl (assuming that all outcomes are equally likely)?  My Answers  Define the events $E:="at\ least\ two\ boys"$, $F:="exactly\ one\ girl"$  Combination interpretation: Here $E=\{\mbox{BBB, BBG}\}$ (i.e. "3 boys" or "2 boys and 1 girl"). Note the combinations $\mbox{\{BBG\}}=\mbox{\{BGB\}}=\mbox{\{GBB\}}$ (are equivalent) as we are ignoring order. Thus, there is only one combination of this where there is $"at\ least\ two\ boys\ AND\ one\ girl"=E \cap F=\mbox{\{BBG\}}$, hence  $$\begin{equation}\begin{split}\mathbb{P}(F|E) & = \frac{\mathbb{P}(E \cap F)}{\mathbb{P}(E)} \\ & = \frac{|E\cap F|}{|E|}\\ & = \frac{1}{2} \end{split} \end{equation}$$  [This seems somewhat intuitive as once we know the sexes of 2 of the children, we only care about the sex of the last child (which is equally likely of being a boy or girl by assumption).]  Permutation interpretation: Since order now matters, we have $E=\{\mbox{BBB, BBG, BGB, GBB}\}$ and $E \cap F=\mbox{\{BBG,BGB,GBB\}}$, hence  $$\mathbb{P}(F|E) = \frac{3}{4}$$  My Question: Should I be using the Combination interpretation or the Permutation interpretation?  I feel regardless of which interpretation I use, the answer should be the same - but it isn't??? Is my logic correct, or have I gone wrong somewhere (am I missing possible outcomes within one of the interpretations)?


When $ab/(a+b)$ is an integer, where $a,b$ are positive integers.

When $ab/(a+b)$ is an integer, where $a,b$ are positive integers?  clear; maxn:=30; for a in [1..maxn] do for b in [a..maxn] do q1:=a*b; q2:=a+b; if q1 mod q2 eq 0 then   print a,b,q1 div q2; end if; end for; end for;   the Magma code given above outputs the following.  2 2 1 3 6 2 4 4 2 4 12 3 5 20 4 6 6 3 6 12 4 6 30 5 8 8 4 8 24 6 9 18 6 10 10 5 10 15 6 12 12 6 12 24 8 14 14 7 15 30 10 16 16 8 18 18 9 20 20 10 20 30 12 21 28 12 22 22 11 24 24 12 26 26 13 28 28 14 30 30 15   So I conjectrue that $\frac{ab}{a+b}$ is an integer if and only if $\frac{a}{d}+\frac{b}{d} \mid d$, where $d=\gcd(a,b)$. It is true if $a=b$.  If $\frac{a}{d}+\frac{b}{d} \mid d$, then  $$\frac{ab}{a+b}=\frac{a}{d} \cdot \frac{b}{d}\cdot \frac{d}{\frac{a}{d}+\frac{b}{d}}$$ is a product of three positive integers and hence is an integer.  Conversely, i.e., $\frac{ab}{a+b}$ is an integer. Let $b=\frac{p}{q}\cdot a$ with $\gcd(p,q)=1$ where $p=\frac{b}{d}$, $q=\frac{a}{d}$ and $d=\gcd(a,b)$. Then $$\frac{ab}{a+b}=\frac{a\cdot \frac{p}{q}\cdot a }{(1+\frac{p}{q})a}=\frac{ap}{p+q}$$ Since $\gcd(p,p+q)=\gcd(p,q)=1$, it has $p+q \mid a$. Similarly, it has $p+q \mid b$. As a result, $p+q \mid \gcd(a,b)$, i.e. $\frac{a}{d}+\frac{b}{d} \mid d$. It completes the proof.


Can a temporary table be shared across sessions?

I have revised a procedure that builds a dynamic SQL statement to create and populate a temporary table. The syntax was something like this:  ...'create #temp_' + CAST(GETGUID() AS VARCHAR(36)) ...   I asked a colleague if he knew why a unique identifier was being concatenated to the table name. He told me that in the past there were cases where temporary tables were shared across sessions and the data was messed up.  I know this is not possible since MSDN clearly states:     You can create local and global temporary tables. Local temporary   tables are visible only in the current session, and global temporary   tables are visible to all sessions.   Now (remembering the case) some colleagues think we should use the syntax above as a good practice but I do not like it and need proof there is no such bug or if it was it is already fixed.  Could anyone with experience in SQL Server 2005/2008 tell me if there ever was such case?


Logarithmically Convex Functions Characterization

I need help proving that if  $g(x)=e^{\langle a,x\rangle }*f(x)$ is convex on $\mathbb{R}^n$ for all $a \in \mathbb{R}^n$, then $f$ is logarithmically convex. One thing I noticed was that if $g$ is log-convex itself, then $f$ is log-convex since then, $\log(g) = \langle a,x\rangle  + \log(f)$, so that $\log(f) = \log(g)-\langle a,x\rangle$. Then $\log(g)$ would be convex, and $-\langle a,x\rangle$  is a linear function so is also convex, and hence their sum is as well. However, I can't seem to prove this either. Other things I thought may be helpful are that $g$ is convex iff its hessian is positive semidefinite, or iff its gradient is monotone, but neither of these have been particularly useful to me.


Avoiding asking a question that's already been asked

Someone else has already asked a question about the exact same problem that I am having. Unfortunately, the question does not have an answer yet. Follow-on questions to the original poster have gone unanswered. How do I get an answer to that question?  I can't upvote the question unless I have 15 reputation.  I don't have an answer to the question (yet), although I do have some more information about my particular instance of that problem that may lead to an answer. I don't see how to just comment on the question.  What choice do I have other than to start a new post with the same question (and be responsive when anyone replies)?


Why not just iterate a hash function 10,000,000 times?

I've read many posts on SO on how you should implement password hashing. And I've read that you shouldn't hash the password many times (well, it doesn't help much, it is said). But why not? If I iterate the hashed passwords, let's say, 10,000,000 times (because user can wait 3 seconds to have his registration completed, or I could just do that by sending an AJAX request).  So, how an attacker, stolen my database, and even knowing that I just iterate the password 10,000,000 times (worst-case scenario), could possibly find out users' passwords? He couldn't create a rainbow table, as it would take him very long (hashing passwords takes time, and hashing the hash so many times takes much more time), brute-force is also not really possible, so what's left?


Remove Duplicate Column Rows from Stored Procedure Result and concatenate other column

I have this code for a stored procedure: BEGIN     SELECT teams.name,             IFNULL(users.email,'N/A') as email,             IFNULL(users.name,'N/A') as user_name,             IFNULL(team_user.role,'N/A') as role     FROM teams         LEFT JOIN team_user ON teams.id=team_user.team_id         LEFT JOIN users ON team_user.user_id=users.id     WHERE role is NULL     OR role='admin'; END  I would like to display the result of the stored procedure in a table. The following is an example of the table that it displays:     Team Name User Name     Team1 AdminUser1ForTeam1   Team1 AdminUser2ForTeam1   Team 2 AdminUser1ForTeam1   Team3 AdminUser1ForTeam3   Team3 AdminUser2ForTeam3     The problem with this table is that if a team has more than 1 admin, the team name will be repeated in two separate rows. The following is the result I want to achieve:     Team Name User Name     Team1 AdminUser1ForTeam1, AdminUser2ForTeam1   Team 2 AdminUser1ForTeam1   Team3 AdminUser1ForTeam3, AdminUser2ForTeam3     I tried using group_concat however that cannot detect when the team name is a duplicate. I can also use php to try and achieve the result. Any help is greatly appreciated!


JavaScript equivalent to printf/String.Format

I'm looking for a good JavaScript equivalent of the C/PHP printf() or for C#/Java programmers, String.Format() (IFormatProvider for .NET).  My basic requirement is a thousand separator format for numbers for now, but something that handles lots of combinations (including dates) would be good.  I realize Microsoft's  library provides a version of String.Format(), but we don't want the entire overhead of that framework.


Show that a double-periodic and entire function is a constant function

I know that a double-periodic function is a function $f$ such that $f(z)=f(z+2\pi)$ and $f(z)=f(z+2\pi i)$. My idea is to use Louisville's Theorem which states that if $f$ is entire and bounded in the $\mathbb{C}$-plane, then $f$ is constant throughout the $\mathbb{C}$-plane. Since $f$ is entire, I know that I only have to show that $f$ is bounded. But does it simply follow that $f$ is periodic means $f$ is bounded?


When are variables evaluated when passing them into functions?

This is probably a simple question, but I would really like to know the answer.  Are the arguments passed into a function calculated once and set as local variables or are they calculated every time they're used inside the function?  For example:  When you write a forLoop, you should set a variable that finds the object using the iteration:    for(var i = 0; i < objects.length; i++) {      var obj = objects[i];      obj.title = "title";      obj.description = "description";   }   If you don't set the obj variable then the operation for finding the object will be run more than once:    for(var i = 0; i < objects.length; i++) {      objects[i].title = "title";      objects[i].description = "description";   }   So far I've learnt that this is bad (although I'm guessing the performance difference in modern browsers is almost unnoticeable).  My question is, if you wrapped the modifying methods in a function and passed objects[i] to the function, would objects[i] be calculated once and set as the local variable obj in the function or would it calculate it every time obj is called?  What is a better practice, code A or code B?  Code A:     function modify(obj) {       obj.title = "title";       obj.description = "description";    }     for (var i = 0; i < objects.length; i++) {       modify(objects[i]);    }   Code B:     function modify(obj) {       obj.title = "title";       obj.description = "description";    }     for (var i = 0; i < objects.length; i++) {       var obj = objects[i];       modify(obj);    }   Update: This question is similar but different to  because it simply questions when the value is calculated rather than which value is passed.


My niece would like to play Minecraft with me, but I have/play on Java only and her laptop's operating system is Windows 10, are you able to get the Java edition of Minecraft on Windows 10 or can it only get the Windows 10 edition of Minecraft?


Does computer weight increase as I add data to my Hard disk?

I recently purchased a new Dell laptop. It weighs 1.34 KG. I want to add movies in my laptop. Will my laptop weight increase if I add movies?


Describe all groups which contain no proper subgroup.

Describe all groups $G$ which contain no proper subgroup. I did not understand the meaning of the question actually. Any help would be appreciable, thank.


what is the specific cause of permanent magnetism

Why can't we answer this simple question?  Where does the magnetic field of a permanent magnet come from? What is different about a magnetizable atom that allows it?  Why is it perpetual?   Or is it recurrent?   Charged particles in motion into wave-flux, then the wave-flux back to charged particles in motion?  Primal energy still not explained.   To the back side of Mars and physics still cannot explain the basis of a child's toy.  tecvia


I have a replication of around 200 records in a table, I want to remove all of then except one, how can I do this ??


How to add a zero to the output of the String.length method if the length is less than 10?

I have a string as a parameter in my method and i am trying to print the length of the string in which i have succeded but I want to add a zero in front of the length if it is less than 10.  I am getting the int cannot be referenced error, and not sure what the correct way of doing this is.  public void sendMessage(String message) throws ProtocolException {     physicalLayer.sendFrame("<" + "E" + "-"         + message.length().toString().padleft(2, '0')         + "-" + message + "-" + "00" + ">"); }   Thanks


How can I stream audio from my phone over wifi to a speaker or receiver?

I have a Galaxy Nexus and would like to be able to send music from it to speakers or a receiver.   Since I use a few different apps to listen to music (Spotify and Pandora mostly but sometimes also Audible) I don't want to have to use a specific player.   And I'd like to do it all over WiFi because Bluetooth doesn't provide enough range for me (I've tried, many different ways).  Is there a way to do this with android?  What I'm not looking for:   A way to stream to or from a PC. Anything involving BlueTooth. A new music player app on android - I want to stream music from any app on my phone to a wireless receiver or speaker. Anything involving software running on a PC.    This should work when my PC is off. I should be able to pull out my phone, open spotify or pandora or audible or google listen or whatever and hear the output on any speaker in the house.


is there a way to keep a session alive even when logging out?

While I am always logging into a CentOS server for simulations it got me thinking:  why can't I keep running the simulations even if my session is closed?  I know that when a session is ended or a user logs out,  any process generated from the session is also terminated.  Could there be a way to let the processes keep on running by itself  even if the session is closed?  -- a silly question from a user with not much unix background :)


Is it possible to construct a hash-based public key encryption scheme?

I know hashes can be used to construct symmetric encryption schemes (HMAC running in counter mode), signature schemes (SPHINCS), pseudorandom generators, etc.  One thing that's missing is public key encryption. Is it possible to create a hash based public-key encryption scheme?  My intuition says no. But it would be nice if there is a proof that it can't be done.


How to set up Gnome interface for HiDPI screen?

I have a 3200x1800 ultrabook and I would like to decrease the resolution of the screen 2x. The problem is that once I do it all the GUI elements increase in size too much    Is there a way how to scale down the size of everything that Gnome Shell shows ?


Some icons are correct, and some are whack. Turns out it's not just the hot questions list, but the whole icon set.


How do I format a list of questions like this?     I'm getting the equation on a new line below the i) when using enumerate and \list.  I don't want to get rid of \[ and \] either as I like the long integral sign  I get this instead:


How to check case owner is active or not

I need to check whether the case owner is active or not? in trigger  Code:   for(Case cs : trigger.new){         system.debug('hello owner'+cs.owner);//returning null         system.debug('hello active'+cs.owner.isactive);// always returning false         }


I'm thinking of gifting a drawing tablet to a person who uses Ubuntu. I had my eyes on the Huion Kamvas Pro 13 and I would like to know if it is supported before making a terrible mistake. However, I couldn't find any clear information online and the related questions here on AskUbuntu are quite outdated.


$ A\setminus(B\setminus C) = (A\setminus B)\cup (A\cap C) $ how to prove?

how to prove that: $$ A\setminus(B\setminus C) = (A\setminus B)\cup (A\cap C) $$  My attempts: $$A∖(B∖C) = x∈A ∧ x∉B (A∖B)∪(A∩C) = (x∈A ∧ x∉B) ∨ (x∈A ∧ x∈C)$$ im new in this, and im pretty stuck here


Stack Overflow allows spoilers in the form:  >! SPOILER   Example:      SPOILER   Why doesn't chat support them? They would be quite useful, especially for rooms that are frequently off topic and often have dicussions about movies etc.  Many other sites, like Arqade, would make even better use of spoilers.


How to prove that the element-wise exponential of a symmetric matrix is not always positive-definite?

The  $e^X$ of a square symmetric matrix $X$ , where $$ e^X = \sum_{k=0}^\infty \frac{1}{k!} X^k $$ Does the exponentiation of each element of the symmetric matrix $X$ (not to be confused with the matrix exponential above) also result in a positive-definite matrix? $$\begin{pmatrix} e^{x_1} & e^{x_{1,2}} & e^{x_{1,3}}\\ e^{x_{2,1}} & e^{x_2} & e^{x_{2,3}}\\ e^{x_{3,1}} & e^{x_{3,2}} & e^{x_3}  \end{pmatrix}\neq e^X$$ After experimentally running this new question (different than the original question that was closed) with toy data, I am seeing that the element-wise exponential  matrix is not always positive-definite like how the matrix exponential always is. but I could be wrong. How can we prove that the element-wise exponential matrix does not guarantee positive-definiteness? (please general mathematical proofs only, rather than a counter-example)


Minecraft is a game that is largely based on a heightmap and uses that heigtmap information to flood the world with light.  From my understanding the highest point in the heightmap is the end of the sunlight influenced area.  Everything above that is lit by sunlight, everything below that just is influenced by light nearby in a radius of 8 blocks.  Thus if you have a floating island on the top of your world everything below that will be seen essentially as a cave.  When two lights influence the same point the brighter light wins (unsure about that).  Either way there are a couple of problems with minecrafts lighting model: first of all, if your world does not have a heightmap it becomes trickier to figure out what exactly is supposed to emit sunlight and what not.  A simple way would be to assume that the world is (in my case) a floating rock and then traverse each axis from both directions and figure out where the rock starts and ends.  But this does not fully eliminate the problem as dents in the rock are not supposed to be in darkness.  Minecraft itself will cache the light information in its chunks together with the information about the material of a block.  Thus only if the world is modified the lighting has to update.  Unfortunately that process is still pretty slow on updates and on quick light changes one can see the lighting lag behind.  That's especially true if a lot of blocks change (TNT, sunset etc.) and you're not running the fastest computer (Or Java on Mac).  From my still limited understanding of 3D graphics lighting a world like minecraft shouldn't be the biggest issue.  How would you tackle the problem?  I think the basic requirements for lighting in a voxel world would be   update fast enough that it could happen in a single frame.  One might be able to do the lighting in the graphics device and download the changed light information to the main RAM. light information must be quickly available for the main game logic so not entirely based on the graphics device: reasoning: light affects the growth of grass, spawning of monsters etc. light updates would have to be local to a chunk or have some other limit so that one does not have to relight the whole world which might be very large in size.   The main idea would be to make the light updates fast, not necessarily more beautiful. For general light rendering performance improvements one could easily add SSAO on top of that which should result in much nicer worlds.


Find an integer coefficient polynomial for this number

At my latest exam was the following problem:     Prove that $\sqrt{2}+\sqrt[3]{2}$ is irrational.   The solution is to find a polynomial with integer coefficients, a root of which is $\sqrt{2}+\sqrt[3]{2}$ and to prove it is not a rational root of it. How do you find polynomials for similar expressions (like the general case of $\sqrt[k]{m}+\sqrt[l]{n}$, given $\sqrt[k]m, \sqrt[l]n \not\in \mathbb{Q}$)?


I've got a function that returns a column from a table. Now I want to make this rows from the column I returned into a single row .   CREATE PROCEDURE [dbo].[creareStringContract]     @numeTabela varchar(100),     @numeColoana varchar(100),     @valoareColana varchar(50),     @numeColoanaValori varchar(100) AS BEGIN     -- Declare the return variable here     DECLARE @str varchar(max) = ''      -- Add the T-SQL statements to compute the return value here     exec ('SELECT ' +@numeColoanaValori +'     FROM ' +  @numeTabela + '     WHERE  ' + @numeColoana +' = ' + @valoareColana )      -- Return the result of the function END GO  CREATE TABLE #tmp  (     ID int  IDENTITY (0,1),     IDContract int,     Valoare decimal  )      INSERT INTO #tmp VALUES (1,-500)     INSERT INTO #tmp VALUES (1,300)     INSERT INTO #tmp VALUES (1,250)     INSERT INTO #tmp VALUES (1,150)     INSERT INTO #tmp VALUES (1,50)     INSERT INTO #tmp VALUES (2,-900)     INSERT INTO #tmp VALUES (2,350)     INSERT INTO #tmp VALUES (2,300)     INSERT INTO #tmp VALUES (2,250)     INSERT INTO #tmp VALUES (2,200)     INSERT INTO #tmp VALUES (2,100)     INSERT INTO #tmp VALUES (3,-600)     INSERT INTO #tmp VALUES (3,280)     INSERT INTO #tmp VALUES (3,270)     INSERT INTO #tmp VALUES (3,160)     INSERT INTO #tmp VALUES (3,150)     INSERT INTO #tmp VALUES (4,-1500)     INSERT INTO #tmp VALUES (4,500)     INSERT INTO #tmp VALUES (4,400)     INSERT INTO #tmp VALUES (4,300)     INSERT INTO #tmp VALUES (4,250)     INSERT INTO #tmp VALUES (4,150)     INSERT INTO #tmp VALUES (4,100)     INSERT INTO #tmp VALUES (4,50)     INSERT INTO #tmp VALUES (4,30)     INSERT INTO #tmp VALUES (1,10)     INSERT INTO #tmp VALUES (1,5)     INSERT INTO #tmp VALUES (1,4)     INSERT INTO #tmp VALUES (1,3)     INSERT INTO #tmp VALUES (1,2)   Here is the sample data.  exec [creareStringContract] '#tmp','IDContract','1','Valoare'   Now this query result is .   Valoare -500 300 250 150 50 10 5 4 3 2   Now I want this to be resulted as   IDContract  (No column name) 2              -500,300,250,150,50,10,5,4,3,2


A simple way to replace date created with last opened date?

I have a huge number of files that were copied into an old OS X 10.6 server.  Problem is there are a large number that came over with a time last opened but no create or modified dates.  Is there a basic script to go through and change the create date to the last opened date?


I'm using Ubuntu 16.04 LTS on an Asus K53E laptop with 8 GB RAM. I check for updates to the software daily. If there are no updates, it asks me if I want to upgrade? What does upgrade exactly mean? Will my personal files still be there? Will it wipe EVERYTHING and give me a completely new installation of Ubuntu? Or will it allow me to keep my files and applications, and merely upgrade the OS?  When I upgrade my Mac or Windows machines, my personal files remain available after the upgrade. Does Ubuntu do the same, or are there completely different "rules"?


Search only for the currently active language

How can I restrict the results from a default search in Drupal 7, to bring only the nodes that are in the current language?  My website has a three language switcher; the user chooses what language he wants to use when viewing the site. If he searches something, the result page bring results from other languages. Today I have only 3 enabled languages, but we plan to expand this to 6 or more.


How exactly works this Python generator example?

I am very new in Python and I am finding some difficulties trying to understand how exactly works this generator implementation example calcolating Fibonacci squence:  class Fib:     def __init__(self, nn):         print("__init__")         self.__n = nn         self.__i = 0         self.__p1 = self.__p2 = 1      def __iter__(self):         print("__iter__")                return self      def __next__(self):         print("__next__")                        self.__i += 1         if self.__i > self.__n:             raise StopIteration         if self.__i in [1, 2]:             return 1         ret = self.__p1 + self.__p2         self.__p1, self.__p2 = self.__p2, ret         return ret  for i in Fib(10):     print(i)   So I have this Fib class.  As usual it contains the __init__() constructor method that take the number of wich I wand to calculate the Fibonacci seqience and set to 0 the i property (because 0 is the first Fibonacci number of each sequence) and set 1 the second and the third number of the sequence (so it starts from 0,1,1).  Then I have the __iter__() method that return itself (so is it returnin a Fib object, is it correct?).  Finnally there is the __next__() method that should return the next item of the seuqence. When the last element is reached it raise a StopIteration exception. Otherwise it calculate the next fibonacci number and return it.  Outside the generator class I am using this for loop:  for i in Fib(10):     print(i)   to calculate the first 10 Fibonacci number.  And here I have some doubts:  1) When I do Fib(10) I am calling the constructor (the __init__() method), so I am calling it one time. Is it correct?  2) The __next__() method is called when I have to obtain the next Fibonacci number. Ok...But who is calling this method? I suppose that it is automatically called by the FOR loop but I am not visualizing how it happens.  3) The FOR loop it seems to me that it is calling the constructor (__init__() method passing to it the number of which it have to calculate the Fibonacci sequence. But what is the sens of the __iter__() method. Who is calling it?


Prove that $\sqrt[3]{2}+\sqrt[3]{4}$ is irrational

As the question says, how can I prove that $\sqrt[3]{2}+\sqrt[3]{4}$ is irrational? I have tried setting it to be equal to $a$, and $\sqrt[3]{4}$ equal to $a^2$, but I haven't gotten anywhere. The solution does not have to use the above. Any help is appreciated. (I know this is a duplicate, but I haven't seen any answers that I have gotten a full solution from)


How to install gnome desktop in ubuntu 17.04?


i have a Map like  Map <String, List<Object>> timeSerisData   which contains two lists one is headerList and another is dataList but internally dataList contains another Objects, means my dataList is list of Objects. So now i am getting that headerList and dataList like this:  @PostMapping("/doExportData") @Timed public void doExportData(@Valid @RequestBody Map <String, List<Object>>  timeSerisData){     List<Object> headerList = new ArrayList<>();     List<Object> dataList = new ArrayList<>();             for(Map.Entry<String, List<Object>> entry :              timeSerisData.entrySet()) {          if(entry.getKey() == "headerData") {              headerList = entry.getValue();             System.out.println("headerlist"+headerList);          }else {              if(entry.getKey() == "dataList") {                  dataList = entry.getValue();                 System.out.println("data list"+dataList);             }          }      } }      In above code in dataList i am getting list which contains two objects   like this:[{Ticker=GSU,Name=Revenu,Year=2015, dataList=[1,2,3,4,5,6]},   {Ticker=GSU, Name=Gross,Year=2018, dataList=[7,8,9,10,11,12]}]   Now i want to get the values of this dataList and want to set that in pojo class. So how to get those values.


I sold my old Mac but it still appears in the list of iCloud devices e.g. in Safari Tabs. Is there a way of deleting devices from the 'iCloud sync list'?


What is $\lim_{n\to \infty }\left(\sqrt[\leftroot{-2}\uproot{2}n+1]{(n+1)!}-\sqrt[\leftroot{-2}\uproot{2}n]{n!}\right)$?

So recently a friend asked me to compute  limit:   $$\lim_{n\to \infty }\left(\sqrt[\leftroot{-2}\uproot{2}n+1]{(n+1)!}-\sqrt[\leftroot{-2}\uproot{2}n]{n!}\right)$$  Question : Does the limit exist? If yes is it finite and if yes what is its value?  How do we solve this?  Edit:  Note: I am only familiar with only basics of limit solving(upto  L'Hôpital's rule) and have reasons to believe that this limit can be solved using these methods. If you could keep your answer simple that should help.  Update  Here is where I have gotten so far   $$ \lim_{n\to \infty} (n+1)! ^{1\over n+1} - (n)! ^{1\over n}$$  Can be written as $$ \lim_{n\to \infty}[1*2*3*...(n+1)]^{1\over n+1}  - [1*2*3*...n] ^{1\over n}$$   $$\implies \lim_{n\to \infty} [(n+1)[{1 \over n+1}* {2 \over n+1}  * {3\over n+1}...* {n+1 \over n+1}]^{1 \over n+1} - (n)[{1 \over n}* {2 \over n}  * {3\over n}...* {n\over n}]^{1 \over n} ]$$  (Factoring n+1 out of first expression and n from second.)  $$\implies  \lim_{n\to \infty} [(n+1) e^{{1 \over n+1} (\sum_{r=1}^{n+1}ln({r\over n+1}))} - (n) e^{{1 \over n} (\sum_{r=1}^{n}ln({r\over n}))}  ]$$  From here I think second limit can be solved as a integral(limit of a sum) but I cannot solve first. How can I proceed further?  Thanks!


UK visa refusal because of personal loan (funds parking)

I am Indian citizen male residing in Saudi Arabia with my family.  I applied for UK visitor visa to attend a 3-day long technical training course.  The length of the visit was for 16 days, because I planned to sightsee after attending the training.   I have already visited the UK before twice. This time, I was going to the UK alone, and my family was to remain in Saudi Arabia. My family is financially dependent on me.  This visit was financially supported/sponsored by my employer, and a supporting letter was included with the application.   Given the above details, I got rejected due to not providing provenance of funds, as follows:     I had secured a personal loan in August 2016 from a bank in Saudi Arabia. My salary is deposited in the same bank account.  I had attached my account bank statements with the application. However, I did not mention the loan in the application. Also, I had not attached a separate statement from the bank about the loan, which appears as a credit on the account statement.  Is it wise to reapply?    I have approached the bank, but it refuses to provide a statement regarding the loan.   What should I do to increase the chance of succeeding with a second application? Should I attach any additional supporting document?  Is there an option for lodging complaint. Is it advisable?


I would like to draw a single path with relative coordinates, where every segment gets their arrow tips. I have tried  \draw[<->] (0,0) -- ++(1,0) -- ++(1,0) -- ++(1,0);   But of course, as is specified in the manual, this adds arrow tips to the first and last subpaths only, of course, so it becomes something like <------------>, whereas I would like it to be <---><---><--->. I have read  and know that an edge will give me arrow tips on every edge, but then I can't use incremental coordinates. (I am actually trying to do the exact same thing that @quinmars is doing in that question.)  Since the answer to that question is 5 years old, I was hoping that either TikZ or somebody else may have an elegant solution to this?


Inductive proof that there are infinitely many pairs of consecutive powerful integers?

One way to prove that there is an infinity of consecutive powerful integers is to just note that there are infinite solutions to the equation $x^2-8y^2=1$, because clearly $x^2$ and $8y^2$ are clearly powerful. But this uses a bit of theory.  I found this problem under an induction worksheet, and all of the surrounding problems are easy. Is there really an elementary solution to the problem?  All of my attempts have been fruitless.  Note: a number is powerful if whenever a prime $p$ divides it we have that $p^2$ also divides it.


Adobe Illustrator: strange behavior while aligning objects

I am creating icons with Adobe Illustrator during which process I use the Align tool quite frequently.  All of a sudden, the align tool started behaving quite strangely.  When I select two objects and specify that I want to align to a key object, when I press align it seems to only align halfway to where it should be.  When I press align again it aligns halfway again - after I press it several more times, it finally gets to where it needs to be.  Also, when I try to align to artboard, it pushes the object out to a seemingly random place.  Here is a video showing exactly what I mean:   What setting did I accidentally set to make align behave like this?


How to send an email to an author on a specific date using date field specified in a node?

In my content I have one date field which is entered by the author, who fills that as future estimate date like  tomorrow or after 1 month. Depending on that estimated date, on that day mail should trigger.  Example: my date field is "weaning date" which the author will fill at as after one month on that day should trigger a mail.


I've been reading and looking at different iOS apps to design the UI for mine, and it feels like sometimes the difference between using a modal view or a non-modal view is not entirely clear... for example, from a "sign up" and "sign in" view, there are some apps that display the sign in form in a modal view, an another do navigating to the view in the "right" (appearing then the "back" button). What should be the best way, from the point of view of user experience? Since a modal view for iPhone occupies the entire screen, there is another difference between modal and non-modal views apart from one sliding up from the botton, and the other one sliding left from the right?  Also, is it correct (and possible) to navigate through several views from a modal view displaying a back button in the navigation bar, or it should not be that way and a modal view should always display cancel and complete buttons (not a back button)?  Maybe I made a lot of questions... thanks in advance!


Big inputs(64 bits) giving unexpected results while Counting number of bits in a 64-bit integer in c++

i am trying to count number of bits in 64 bit integer but it shows some unexpected.here is the code. counting bits is was not the major part but some unexpected output is....plz have a look on input and output!!!!  #include<iostream> #include<math.h> #include<stdint.h> #include<cstdio> using namespace std;  int64_t t,n,ans; int main(){     cin>>t;     while(t--){          int64_t ans=0;          cin>>n;          /*          while(n>0LL){              n>>=1LL;              ans++;          }//*/         ans=floor(log2(n));         //ans=floor(log2l(n));         cout<<ans<<"\n";      }     return 0; }   the input and output is this  10 18446744073709551615   63 (number of bits in 18446744073709551615) should be printed only once and console should be waiting till i input another number and the count the number of bits in other number.but it is not happening.The output comes is like this....  63 63 63 63 63 63 63 63 63 63   plz help me ragarding the same.


php version in apt - does it correspond to version on php.net and if not how to upgrade to latest release

So I'm setting up a lamp web server based on ubuntu 13.04 raring. I've installed all required software and run apt-get update and upgrade.   When I run php info it reports php version 5.4.9-4ubuntu or something similar. Does this correspond to the release 5.4.9 on the php.net site. If so what is the best way to update to the latest 5.4 or 5.5 minor release?   I previously tried installing from source but this only updated the command line version of php. Apache was still reporting the same release.


How does the linux kernel know device major and minor numbers?

As far as I know, the kernel detects hardware, adds information to sysfs creates a device in /dev and then generates a udev event. My question is, do device drivers do all of this or it is the kernel itself? If drivers do it, then they would know the device major and minor number to create the file in devtmps.   I also understand (maybe wrongly) that it is udev who calls modprobe to load the drivers that handle a device.   I was told that they do so with the contents of the MODALIAS uevent environment variable, thus loading all modules whose aliases match this string (the correct driver). In short: what are the steps of hardware detection in linux and WHO performs each step: the kernel itself, the driver inside the kernel or udev in userspace. Thanks.


How to utilize Winforms Paint Event in creating graphics - accessing from another class (simple plasma effect)

I'm beginner in C# programming and I'm trying to create some graphics effects utilizing Winforms. I've tried to generate simple "plasma effect", however utilization of Paint Event is really frustrating (or I'm just stupid). In my example I have two classes (Form1 and Plasmadraw). In Form1 I have following setup: namespace Plasma_effect { public partial class Form1 : Form { public Form1() { InitializeComponent(); this.Width = 1920; this.Height = 1200; FormBorderStyle = FormBorderStyle.None; WindowState = FormWindowState.Maximized; this.DoubleBuffered = true; }     private void Form1_Paint(object sender, PaintEventArgs e)     {         Plasmadraw plasma = new Plasmadraw();          plasma.Draw(e.Graphics);          Invalidate();     }      private void Form1_Load(object sender, EventArgs e)     {         // Why I can't create instance of Plasmadraw class once here , I have to do it in Paint event ??     }      private void Form1_MouseClick(object sender, MouseEventArgs e)     {         this.Close();     }  And in the Plasmadraw class I have following setup: namespace Plasma_effect { class Plasmadraw {     int y;     int x;     double i;          double pii = 3.1415;      public void Draw(Graphics gfx)     {         // Should I use For loop here in creating the plasma, I managed to create full screen plasma with it, but no animation ?            x = x + 10; // this should increase the value, however the value is not increased         i = i + 1;          if (x == 1920)         {             x = 0;             y = y + 10;         }          if (y == 1200)         {             y = 0;         }              double v = Math.Sin((x * 0.5) + i * 0.001);             double c = v * pii;             double d = c + (2 * pii / 3);             double f = c + (6 * pii / 3);             double r = 255 * Math.Abs(Math.Sin(c));             double g = 255 * Math.Abs(Math.Sin(d));             double b = 255 * Math.Abs(Math.Sin(f));              int r1 = (int)r;             int g1 = (int)g;             int b1 = (int)b;              Color e = Color.FromArgb(r1, g1, b1);              SolidBrush brush = new SolidBrush(e);             Rectangle rect = new Rectangle(x, y, 10, 10);             gfx.FillRectangle(brush, rect);             } }  } Basically I'm trying to create continuous loop where I would have the effect running. The problem is that the program creates just one rectangle and stops after that. What I should do to make it run continuously ? Before I've managed to create some moving effects by basically creating a list of objects (for example sprites) and then using foreach in Paint event to draw them & invalidate(). However I'd like to learn to use some other approach than always using the same (copied) way.


Encrypt existing TM-backup when the source computer is missing?

I have a bunch of Time Machine archives for old computers I no longer have. I want to encrypt these archives. Can that be done using a different computer than the one that was backed up? I have looked that the tmutil man-page and found a couple of interesting options there: inheritbackup - seems to make it possible to use the TM-destination for machine A for machine B. However, there is a caveat in the instructions: Inheriting is typically only one step in the process of configuring a backup for use by a machine. You may also need to use setdestination, associatedisk, or both, depending on the situation. Since this is backup data I don't want to lose or corrupt I am a bit hesitant to experiment (I have copies but if I perform a couple of operations and everything looks fine and I therefore delete my copies just to, a year from now, realise that I broke something I won't be too happy...). Would be nice with a HOWTO or step-by-step guide, if possible.


A Rocket in a constant gravitational field, what are the conditions required for the rocket to take off immediately? (in terms of $m_0,μ,g,v_r$), where  $m_0$ = mass of the rocket at $t=0$  $μ$ = mass per unit time of expelled gas;  $v_r$ = velocity of the expelled gas relative to the rocket  Show that, in this case, the velocity of the rocket always grows (until the fuel is used up).   If this condition is not fulfilled, then there are two possibilities: Either the velocity is always descending, or there is a moment in time when the velocity, after descending, starts to grow again. Find the condition separating these two cases (will involve the mass $m_1$ of the rocket without fuel).  Thanks :)


I am trying to install , but it requires APR and APR-util. I have succesfully installed APR, but with APR-util a fatal error is returned:  xml/apr_xml.c:35:19: fatal error: expat.h: File o directory non esistente   saying that the folder xml/apr_xml is not found.  The error occurred when I ran make; ./configuration had no problems.  What do I do?


I want connections coming in on ppp0 on port 8001 to be routed to 192.168.1.200 on eth0 on port 8080.  I've got these two rules  -A PREROUTING  -p tcp -m tcp --dport 8001 -j DNAT --to-destination 192.168.1.200:8080  -A FORWARD -m state -p tcp -d 192.168.1.200 --dport 8080 --state NEW,ESTABLISHED,RELATED -j ACCEPT   and it doesn't work. What am I missing?


I recently noticed that some of the papers I've listed on my homepage look a lot sharper than others when rendered in a PDF viewer. Curious about this, I tracked it down to this import:     \usepackage[T1]{fontenc}   As a brief example of what I mean, here's a test case:  \documentclass{article} %\usepackage[T1]{fontenc} \usepackage[english]{babel} \usepackage{blindtext} \begin{document} \blindtext \end{document}   Here's the result in TeXstudio with and without the T1 encoding (with is marked with a little red dot in the lower right-hand corner):    Likewise here's the result in Adobe:    And here's a close-up:    I'm compiling the PDF in TeXstudio using  pdflatex.exe -synctex=1 --extra-mem-bot=1000000000 -interaction=nonstopmode %.tex     If I simply drop the fontenc package, I have problems with braces ({}) used in the text. And the package .  My questions are:   Is this a local effect due to my font set-up? How could I resolve this problem?   (Sorry if the question is naive; I'm afraid I only have passing knowledge of T1 and the font system in LaTeX.)


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


Randomly initialised global counter used to encrypt the kth message with $\operatorname{IV} = \operatorname{IV} + k \hspace{5mm} mod \hspace{5mm} 2^n$

The use of an increasing IV is not secure for a block cipher. That is, using a random IV for the first message then $\operatorname{IV} + 1$ for the second , $\operatorname{IV}+ 2$ for the 3rd etc. How can I construct an attack to show that this mode is not secure?


Change permissions of a folder with cronjob

I have a scanner that can "save to folder" only with FTP or CIFS protocols.  I managed to set it up with CIFS to save the file to a shared folder on a Mac, however although the folder has read/write permissions to all users, when the file is written to the folder it only has read/write permissions to the user that created it (scan). This means even the local user can't open the file unless we change the permissions of the file. Applying the permissions to "enclosed items" solves the issue until a new scan is made. I don't know how to create a cronjob so that permissions are changed every minute. Would anyone be able to help me with this?  Thanks! Miguel


Check an instance is in Spring 14 preview or not

In  has listed the sandboxes which are in Spring 14.  My sandbox is one of those, but any other way to ensure my instance is in Spring 14 preview release?


Deciding what interpolation method to use for resampling raster data?

Are there hard and fast rules about which interpolation methods are suited to each kind of raster data?


Type on image vs. type on standard background

Does anyone have any research or a/b testing regarding whether people are more likely to read and retain information when type is on an image as opposed to a standard background? I'd imagine that people tend to skip over type on images because of the visual distraction, but I'd like to have some data to back up that assumption.


What word means that every outcome is worse than where you started,  For example, You must make a choice but the choices are a worse situation than your current one.


I have read about the const and readonly keyowrds in C#. One of the difference between these keywords is that the value of the const is resolved at compile time while readonly keyword is resolved at run time. Though I didn't get chance to implement them in any of my projects. So I thought of giving it a try. I created mylibrary which I would use in my other project. The code in mylibrary is as following    namespace MyLibrary  {   public class Class1   {     public static readonly string MyVar = "Vikram";     //public readonly string MyVar;     //public Class1()     //{     //    MyVar = "Test";     //}   } }   Now I would use this library as reference in my other console project as following  class Program {     static void Main(string[] args)     {         //MyLibrary.Class1 class1 = new MyLibrary.Class1();         Console.WriteLine(MyLibrary.Class1.MyVar); // output is vikram         Console.ReadLine();         Console.WriteLine(MyLibrary.Class1.MyVar); // changed to Test but still op as  vikram         Console.ReadLine();     } }   Now between these two writeline's I will change the value of "MyVar" in my library and recompile it, according to readonly's concept it should get reflected in the console project without recompiling my main  project.  Please correct me if I my understanding of the readonly keyword is wrong.  P.S I have been through the answers of  link. In one of the answers the following is being mentioned  in the case of the readonly value, it is like a ref to a memory location. The value is not baked into AssemblyB's IL. This means that if the memory location is updated, Assembly B gets the new value without recompilation. So if I_RO_VALUE is updated to 30, you only need to build AssemblyA. All clients do not need to be recompiled.  Can anyone please explain what does the bold line exactly means. I think this is what I am doing in my example.


Synonym for competitive that has negative connotations

I'm looking for an adjective or a noun or a verb that means to be overly competitive in a way that makes you lose sight of how you're affecting others around you. Example. "Ben was (behaving) **** , working on his . He was laser-focused on his project at the expense of spending time with his family.


How can it be possible to localize a ring at a set with zero divisors?

Let $R$ be a commutative ring with identity, and $S$ a multiplicative subset of $R$ not containing $0$. Which step in my reasoning is wrong?   Every element of $S$ is a unit in $S^{-1}R$. Every element of $S$ that's a zero divisor in $R$ is a zero divisor in $S^{-1}R$. But zero divisors can't be units. Therefore it's not possible to localize $R$ at $S$.


Defining preprocessor directives gives unknown identifier while compilation

I am using the following macro definition in my C program, however, after compilation, it is giving me error that macro names should be identifier. Can anybody tell me what mistake I am doing while defining macro?  #include <stdio.h> #include <stdlib.h>  #define a0 0 #define x1 1 #define a1 2 #define x0 3 #define x0a1 4 #define b0 5 #define b1 6 #define y0 7 #define y1 8 #define y0b1 9 #define c0 10 #define z1 11 #define c1 12 #define b1 13 #define z0 14  #define 1R0 0 #define 1B0 1 #define 1W0 2  #define 2R0 3 #define 2B0 4 #define 2W0 5  #define 3R0 6 #define 3B0 7 #define 3W0 8  #define Running 0 #define Blocked 1 #define Waiting 2


When I try to login in Ubuntu, It login and freeze in desktop screen. When I try to solve this I refer , my problem is solved with small trouble.After this I restart and login into Ubuntu it login and shows same login screen. So I search something about "login loop" I referred . I installed unity desktop and reboot and then restarted my ubuntu still my problem is not solved. I hope lot of you faced this problem if yours is solved. Please share your solutions with me to retrieve my ubuntu OS.  Thanks, Ami


How to turn off all notifications of Android Facebook app?

There are many old/partial/... threads about this where I find none of them satisfactory and sufficient.  I want to turn all notifications off of my Android Facebook app.  It has not been possible before, so I did not have the app.  I will uninstall the app if there is no solution for the task.   I have browsed all Facebook settings but they do not have anything about turning all notifications off.   I would like to find also System specific block for Facebook App i.e. do not allow it it to show me any notifications.  It  would be great if you can do this without third party appplications.   Phone: Oneplus 2 OS: OxygenOS 3.1 (Android 6)


Could someone explain what it means that temperature is a lagrange multiplier of energy?

I have looked online but I couldn't find anything that explains this definition


Will an object trigger if the source is sacrificed to pay a cost?

Will "When/Whenever Foo" trigger if the source is sacrificed to pay a cost for Foo?  Examples  If I activate 's ability and sacrifice , will Kurkesh trigger, allowing me to copy Birthing Pod's ability?  If I cast  and sacrifice  to pay for the cost, will Basilica Screecher trigger, allowing me to extort?


Core Update to 8.9.4 Removed Block Visibility Options?

Recently updated core from 8.9.2 to 8.9.4, in doing so the options to place blocks on specify pages is now gone?


I have an existing three way switch hooked up already, it works fine. I would like to add another three way switch by connecting another switch to the existing three way switch. Can this be done with 14/2 romex between the two switches?


Forcing a SimpleXML Object to a string, regardless of context

Let's say I have some XML like this  <channel>   <item>     <title>This is title 1</title>   </item> </channel>   The code below does what I want in that it outputs the title as a string  $xml = simplexml_load_string($xmlstring); echo $xml->channel->item->title;   Here's my problem.  The code below doesn't treat the title as a string in that context so I end up with a SimpleXML object in the array instead of a string.  $foo = array( $xml->channel->item->title );   I've been working around it like this  $foo = array( sprintf("%s",$xml->channel->item->title) );   but that seems ugly.  What's the best way to force a SimpleXML object to a string, regardless of context?


Multi-dimensional list, change in one sublist getting reflected in others

I have a array as follows, and I would like to change the value of the middle entry of the second row.       array = [[0, 0, 0],               [0, 0, 0],               [0, 0, 0]]     array[1][1] = 1   expected output:      [[0, 0, 0],       [0, 1, 0],       [0, 0, 0]]   however, it seems like the value of the whole column is changed:      [[0, 1, 0],       [0, 1, 0],       [0, 1, 0]]   Why does this not work? How do I just change the value of the entry that I want?  Thanks!


How can I type an expression that give me specific text based on another field value? I added an image of example data.


So I want to start collecting old Thinkpads and I think the X61s is a good place to start. With 4gb ram and it's Integrated Intel X3100 will it run smoothly on Ubuntu and play low end games like Undertale? (I know there's a system requirements sheet for Ubuntu and Undertale but I had absolutely no clue what they meant!)


Calculate a 3D Point when the distance to three other points is known

I have a problem where I want to calculate the position of a point given the distances to three other points. I have only found answers on this problem for 2D but nothing for 3D. I tried solving it using an equation system with three equations. Where every equation is the length of the relative vector between the point I am looking for and another point. Solving this by hand is pretty much impossible. I also tried to you use software to solve the equation system but could not get to a solution. Using this approach I would get two solutions I think. This would be okay for me.   I am sure this problem has already been solved but I could not find any answers online. I would appreciate any answers. This calculation should be done using code. So any graphical approach is not an option.


What's the single word to describe the smell of the perfume of someone who just walked by?

I read the word sometime ago and can't remember it.  the smell of the perfume of someone after he/she walks by..