I am a beginner and I am using Ubuntu 14.04 LTS with text entry given by English International with dead keys.  Everything works well but instead of getting "ç" I get "ć".   Yes, the key that I have in my keyboard is apostrophe and not accent.   I have found some solutions in , but they assume that you are able to find a file /usr/lib/gtk-2.0/2.10.0/gtk.immodules, but I am not able to do that.  Can someone help me?

I need the character Cedilla working my English USA Ubuntu Natty but when use the normal combination ' then c I get this ć. In the previous versions I used this solution:  but it isn't working on Natty. Any help will be very appreciatted! Best regards.


If I were pushing my hands against each other, the stronger arm will move the weaker arm, but if all forces have an equal and opposite reaction, why does the weaker one move?

Given Newton's third law, why is there motion at all? Should not all forces even themselves out, so nothing moves at all? When I push a table using my finger, the table applies the same force onto my finger like my finger does on the table just with an opposing direction, nothing happens except that I feel the opposing force. But why can I push a box on a table by applying force ($F=ma$) on one side, obviously outbalancing the force the box has on my finger and at the same time outbalancing the friction the box has on the table? I obviously have the greater mass and acceleration as for example the matchbox on the table and thusly I can move it, but shouldn't the third law prevent that from even happening? Shouldn't the matchbox just accommodate to said force and applying the same force to me in opposing direction?


I came to a situation where I want to render a text based on there index value. So, Let's assume I am having a loop which is having an index variable and I want to show some specific text if the index value is 0 or 5 or 10. But I am not sure how could I use the arithmetic comparison in HTML file of LWC. Below is the sample code.  <template if:true={navigation.data} >     <template for:each={navigation.data} for:item="tab" for:index="index">                   <template if:true={index==0 || index==5 || index==10}>
 {tab.Title__c}
         </template>          <template if:false={index==0 || index==5 || index==10}>
 {tab.Title__c}
         </template>      </template> </template>

How can expression functions similar to Visualforce and Lightning Aura Components be achieved within lightning web components?   For example, <template if:true={index % 5 == 0}>
</template> expression index % 5 == 0 is not compyling at all.  accountList.html  <template>     <template if:true={accounts.data}>         <template for:each={accounts.data} for:item='item' for:index='index'>                                       {item}         </template>     </template> </template>   accountList.js  import {LightningElement, wire} from 'lwc'; import getAccounts from '@salesforce/apex/TestController.getAccounts';  export default class AccountList extends LightningElement {      @wire(getAccounts) accounts;  }   Since LWC doesn't support Expression Functions, I'd like to know how to implement them.


How do I represent and use some of the characters in the snippet below in Winedt 10.3 ? I just want this for fun. I want a way how to create some of these characters in a pdflatex compiler in WinEdt 10.3. Can someone give me a MWE of LaTeX file how to use them ? This a general question about how to use Unicode in WinEdt. Please note that I'm a complete beginner to LaTeX and Unicode especially. I need a MWE of the character 12110, not some lengthy answer.

How do I enter Unicode characters in LaTeX?  What packages do I need to install and what escape sequence do I type to specify Unicode characters in an ASCII source file?


I am making Achiote Paste and need a substitute for the annatto seeds.  Recipe calls for 1/4 cup of annatto seeds.  Can I substitute tumeric, saffron or paprika and if so how much should I use?

is a common spice in Mexican cookery, especially in the Yucatan. However, like many Mexican ingredients, it's hard to find in Europe. What can I use as a substitute to give the same colour and approximate flavour?


Stuck on a homework question, so I could use all the help I could get.  Let $x = x(1), \dots , x(n)$ be a bit string containing exactly $m$ occurrences of 1. Consider the following operation on $x$: we choose a random pair of indices $(i,j),$ and we swap $x(i)$ and $x(j)$ so that $x'(i) = x(j),$ $x'(j) = x(i),$ while $x'(k) = x(k)$ if $k \neq i$ and $k \neq j.$ (If $i = j,$ therefore, then we change nothing.) Let $X_1 = x,$ and let $X_2, \dots, X_N$ be obtained by such a sequence of operations (always swapping a new random pair) that so $X_{r+1} = X_r$. The number of 1s remains $m$ in each iteration. Show for each $i$, we have $P(X_N (i) = 1) \rightarrow \frac{m}{n}$ as $N \rightarrow \infty$.  We're given this hint: Consider the last time $i$ was swapped.   I've gathered that the probability that $i$ is swapped on any given iteration is $1-(1- \frac{1}{n})^2$. I've also figured out that the probability $i$ is 1 after a swap is $\frac{m}{n}$, as there are m choices for i to change to (including itself) after being selected for a swap, but I'm not sure how to apply this.

Let $x = x(1), \dots , x(n)$ be a bit string containing exactly $m$ occurrences of 1. Consider the following operation on $x$: we choose a random pair of indices $(i,j),$ and we swap $x(i)$ and $x(j)$ so that $x'(i) = x(j),$ $x'(j) = x(i),$ while $x'(k) = x(k)$ if $k \neq i$ and $k \neq j.$ (If $i = j,$ therefore, then we change nothing.) Let $X_1 = x,$ and let $X_2, \dots, X_N$ be obtained by such a sequence of operations (always swapping a new random pair) that so $X_{r+1} = X_r$. The number of 1s remains $m$ in each iteration. Show for each $i$, we have $P(X_N (i) = 1) \rightarrow \frac{m}{n}$ as $N \rightarrow \infty$.   What's confusing me is that it seems as though the probability on any iteration of $X_j$ that $X_j(i) = 1$ is always $\frac{m}{n}$, which would make the problem trivial.


How do you solve  $$ \int\sqrt{\sin(t)}dt  $$ using the substitution method.

$$\int \sqrt{\sin x} ~dx.$$  Does there exist a simple antiderivative of $\sqrt{\sin x}$? How do I integrate it?


Looking for correct spelling of my grandparants who are from Poland.  Came over to America via Ellis Island in 1913.  Immigration papers reflect: Grandfathers name: Stanislaw Czizyk or Czisik Arrived 1/19 or 1/15/1913  Born: 5/23/1885 Kurpiecz/Kurpiesc, Poland.  His wife, Julia, found 2 surnames for her: Zajaczkowska and Ziamakucka Born: 3/19/1895 Czernawta, Russia. UPDATE: New surname from surviving source: Julia Zinkowski.  Growing up, my father said she was from Bialystok) and grandpa was from Warsaw. He passed away years ago, so no living relative to ask further. They were married 6/23/1911 in Kurpiecz, Poland.  Again, this is what US records reflect.  I am at a loss for finding my heritage in Poland. Thoughts are to start with the correct spelling, then with having birth dates I could possibly find relatives.

My Polish grandmothers last name was Dziubenofska, but I know that's not how it is spelt! I'm looking for the proper spelling.   Can you help find it for me?  She came over to Ellis Island and they changed it on her to dziuk. This is only a prefix to the full name.


Noob Java question:  Could someone explain the difference between   1. Queue<Integer> q = new LinkedList<Integer>() and 2. LinkedList<Integer> q = new LinkedList<Integer>()   in Java?  I had assumed that in declaration 1., I wouldn't be able to use LinkedList specific methods and could only use those described by the Queue interface.  However, I just tried q.size() and found that that worked, although that is not a part of the Queue interface.  Is the difference in passing these objects as parameters?   What is the difference?

I have seen this mentioned a few times and I am not clear on what it means. When and why would you do this?   I know what interfaces do, but the fact I am not clear on this makes me think I am missing out on using them correctly.   Is it just so if you were to do:  IInterface classRef = new ObjectWhatever()   You could use any class that implements IInterface? When would you need to do that? The only thing I can think of is if you have a method and you are unsure of what object will be passed except for it implementing IInterface. I cannot think how often you would need to do that.   Also, how could you write a method that takes in an object that implements an interface? Is that possible?


How can I show that If the Wronskian of two solutions to a second-order ODE with $\textbf{no boundary conditions}$ is zero then they are linearly dependent?  Please do not mark this as duplicate as there is no answer to this particular question nowhere.

According to , if the Wronskian of two functions is always zero, then they are not necessarily linearly dependent.  But it seems that if the two functions are solutions of the same homogeneous second-order linear differential equation, then the condition $W[y_1, y_2](t) = 0$ does indeed imply that they are linearly dependent.  Online, I found that if two functions are real analytic and their Wronskian is identically zero, then they are necessarily linearly dependent. But there is no reason that the solutions to a linear differential equation should be real analytic.  How can we prove that the condition $W[y_1, y_2](t) = 0$ implies the linear dependence of $y_1(t)$ and $y_2(t)$? More generally, how can we prove that the condition $W[y_1, \ldots, y_n](t) = 0$ implies the linear dependence of $y_1(t), \ldots, y_n(t)$?


Suppose that $S=\{f\in C[0,1]|\|f\|<=M\}$ with $\|f\|=\max_{x\in[0,1]}|f(x)|$. Is set $S$ a compact set? Is set $S$ a bounded set?

This question is taken from Saxe K -Beginning Functional Analysis.   Show that the closed unit ball in $C[0,1]$ is not compact by proving that it is not sequentially compact.   (It's assumed that we are using the uniform norm).  I've been working on this for ages but I could not come up with any sequence $\{f_n\}$ in the unit ball such that there exists $N\in \mathbb{N}$ such that for all $m,n\geq N$ we have that $d(f_n,f_m)>c$. Should be a nice example of this, please help me!


I'm using these code for making wrapper-elements containing their floated children (instead of collapsing):  .wrap:after {   content: '';   display: block;   clear: both; }   Now I have seen code in which table is used as the value for display.   It's said that this is for "to contain the top-margins of child elements".  Full article here:   I've tinkered around with both variations (block, table) but I couldn't find any difference.  Can someone provide an example which shows the difference between using block or table?

I have the age-old problem of a div wrapping a two-column layout. My sidebar is floated, so my container div fails to wrap the content and sidebar.

   There seem to be numerous methods of fixing the clear bug in Firefox:
 overflow:auto overflow:hidden   In my situation, the only one that seems to work correctly is the
 solution, which is a little bit scruffy. overflow:auto gives me nasty scrollbars, and overflow:hidden must surely have side effects. Also, IE7 apparently shouldn't suffer from this problem due to its incorrect behaviour, but in my situation it's suffering the same as Firefox.  Which method currently available to us is the most robust?


This should be quick and easy.  I want to compare two columns and flag any mismatches in a third column. What is the easiest way?  Sample output:  1   |      A          B       C 2   |  =========  =========  === 3   |  apple      apple        4   |  banana     bananas     1 5   |  orange     orange 6   |  melon      melon 7   |  lemon      lEmon       1

I have two columns in Excel that I want to compare and find the differences between them.  Suppose:   Col A has 50 numbers, i.e. 0511234567 Col B has 100 numbers in the same format


I have a file with values like:   a,9,1  b,2,4  c,2,4  till *,2,0 and this is my code:      public static final String letterFileLoc = "filelocation";     public static Map<Character, Integer> letterValueMap;     public static Map<Character, Integer> letterCountMap;     public static void constructLetterMaps() throws FileNotFoundException{     File pointvals = new File(letterFileLoc);     Scanner pts = new Scanner(pointvals);     while (pts.hasNext()){         String [] parts = pts.next().split(",");         char alpha = (parts[0]).charAt(0);         int counts = Integer.parseInt(parts[1]);         int values = Integer.parseInt(parts[2]);         letterValueMap.put(alpha, values);         letterCountMap.put(alpha, counts);       }   and I keep getting a null pointer expception when I'm putting the values. I don't understand why. Could someone please explain?

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I learned the following  $$ e^{ik2\pi}=1 $$  and I was wondering whether or not $k$ has to be an integer.    Thought 1: Since $e^{ik2\pi}=\cos(2k\pi)+i\sin(2k\pi)=1$, equating the real and imaginary parts we conclude that $k$ is an integer.  Thought 2: Since $e^{i2\pi}=1$, if we raise both sides to the power $k$ then we have $e^{ik2\pi}=1^k=1$ for any $k$. So $k$ does not have to be an integer.  I am more keen on Thought 1 but I would like to know what is wrong in Thought 2?

I've been stuck with this for a while now. I have this chain of reasoning that would imply $e^{-\pi}=e^\pi$, obviously false, since $e^\pi$ and $e^{-\pi}$ are two real distinct numbers and so I must have made an assumption somewhere that I cannot actually do. I know I have to be very careful when working with complex numbers, especially when they're in the exponents, and so I tried to make the steps as small as I could so that it would be easier to point out where it went wrong.  \begin{align} e^{-\pi}&= e^{\pi\cdot -1}\tag{1}\\ &=e^{\pi\cdot i^2}\tag{2}\\ &= e^{\pi\cdot i\cdot i}\tag{3}\\ &= \left(e^{\pi\cdot i}\right)^i\tag{4}\\ &= (-1)^i\tag{5}\\ &=\left(\tfrac{1}{-1}\right)^i\tag{6}\\ &=\left((-1)^{-1}\right)^i\tag{7}\\ &=(-1)^{-1\cdot i}\tag{8}\\ &=(-1)^{-i}\tag{9}\\ &=\left(e^{i\pi}\right)^{-i}\tag{10}\\ &=e^{i\pi\cdot -i}\tag{11}\\ &=e^{-i^2\pi}\tag{12}\\ &=e^\pi\tag{13} \end{align} I suspect it has something to do with changing the base from $e$ to $-1$, but what does that mean? Are complex powers only defined for positive bases? Any help is appreciated.


I am aware that there are many questions asked in the past about escaping single quotes, but none of them addresses this challenge, i.e how to do it with an alias.  I have already successfully defined many aliases to replace sed/awk/grep/perl commands which use regex in the last release of bash (4.4.0(1)).  For instance, the following alias can escape double quotes in any string:  alias esc_double_quotes=$'sed \'s|"|\\\\"|g\'' string="JC's alias to escape \"double quotes\"" echo "$string" | esc_double_quotes JC's alias to escape \"double quotes\"   However, when it comes to escaping single quotes with an alias, it seems that the mission is impossible.   I have already tried 5 different methods which all fail for different reasons:  # 1) My first technique alias esc_single_quotes=$'sed \"s|'|\\\\'|g\"' # 2) My second technique alias esc_single_quotes="sed 's|'\''|\\\'\''|g'" # 3) My third technique alias esc_single_quotes="sed \"s|'|\\\\'|g\"" # 4) Technique inspired from http://stackoverflow.com/questions/1250079/how-to-escape-single-quotes-within-single-quoted-strings?answertab=active#tab-top alias esc_single_quotes='sed '"'"'s|'|\\\\'|g'"'" # 5) Technique inspired from http://stackoverflow.com/posts/1315213/revisions alias esc_single_quotes='sed '\''s|'|\\\\'|g'\'''   Would anyone live up to this impossible challenge & prove me wrong?

I'm having trouble with escaping characters in bash. I'd like to escape single and double quotes while running a command under a different user. For the purposes of this question let's say I want to echo the following on the screen:  'single quote phrase' "double quote phrase"   How can I escape all the special chars, if I also need to switch to a different user:  sudo su USER -c "echo \"'single quote phrase' \"double quote phrase\"\""   Of course, this doesn't produce the right result.


Deja Dup doesn't support full system encryption, only home directory. rsync - I should make the backup, then archive the folder and then encrypt it. It's too long. tar archive of the system - I should make tar, and then encrypt the archive. It's too long. encrypt the external hard drive with cryptsetup and then put tar archive of the system there or use rsync - I can't use the standard Windows utility to make the backup because it requires ntfs. Am I right? What would you recommend?

This question exists because it has historical significance, but it is not considered a good, on-topic question for this site, so please do not use it as evidence that you can ask similar questions here.  While you are encouraged to help maintain its answers, please understand that "big list" questions are not generally allowed on Ask Ubuntu and will be closed per the .   Backup is incredibly important. Obviously there's no best backup tool, but a comparison of the options would be very interesting.   Graphical Interface? Command line? Incremental backups? Automatic backups? Install method: In standard repositories? PPA?


I have a problem with 2NF and I have been unable to solve it by using Google. It is making me crazy because I am a teacher and I don't want to teach wrong stuff to my students.   Let's have a table with 5 fields.  Gradings = {StudentName, SubjectCode, SubjectName, #Exam, Grade}  Dependencies are this way:  StudentName, SubjectCode, #Exam -> Grade  SubjectCode -> SubjectName  SubjectName -> SubjectCode  Therefore, candidate key 1 is {StudentName, SubjectCode, #Exam} and candidate key 2 is {StudentName, SubjectName, #Exam}.   Prime attributes are {StudentName, SubjectCode, SubjectName, #Exam} and non-prime attributes is Grade  According to the definition of second normal form, a non-prime attribute cannot depend on a part of a candidate key. The only non-prime attribute (Grade) does not depend on a part of a candidate key so this table seems in 2NF .  The problem is that I think something is amiss (and I could be wrong). I think subjects should have their own table.   Gradings = {StudentName, Subject Code, #Exam, Grade}  Subjects = {Subject Code, SubjectName}  But 2NF does not produce this. 3NF is about dependencies between non-prime attributes so it does not produce this either. But it seems to me that this is the right outcome, because it has no redundancy.  I guess if non-prime attribute was defined as "attribute that is not a candidate key", 2NF would produce the desired result. But I have checked this again and again and non-prime attribute is defined as "attribute that does not BELONG to a candidate key".  What am I doing wrong? I feel like I am beating my head against a wall.  Thank you in advance.

I have a problem with second normal form (2NF) and I have been unable to solve it by using Google. It is making me crazy because I am a teacher and I don't want to teach wrong stuff to my students.   Let's have a table with 5 fields.  Gradings = {StudentName, SubjectCode, SubjectName, #Exam, Grade}  Dependencies are this way:  StudentName, SubjectCode, #Exam -> Grade  SubjectCode -> SubjectName  SubjectName -> SubjectCode  Therefore, candidate key 1 is {StudentName, SubjectCode, #Exam} and candidate key 2 is {StudentName, SubjectName, #Exam}.   Prime attributes are {StudentName, SubjectCode, SubjectName, #Exam} and non-prime attributes is Grade  According to the definition of second normal form, a non-prime attribute cannot depend on a part of a candidate key. The only non-prime attribute (Grade) does not depend on a part of a candidate key so this table seems in 2NF .  The problem is that I think something is amiss (and I could be wrong). I think subjects should have their own table.   Gradings = {StudentName, Subject Code, #Exam, Grade}  Subjects = {Subject Code, SubjectName}  But 2NF does not produce this. 3NF is about dependencies between non-prime attributes so it does not produce this either. But it seems to me that this is the right outcome, because it has no redundancy.  I guess if non-prime attribute was defined as "attribute that is not a candidate key", 2NF would produce the desired result. But I have checked this again and again and non-prime attribute is defined as "attribute that does not BELONG to a candidate key".  What am I doing wrong?


I want to execute apt-get install texlive-full but do I need to do anything before this like install an installer or anything?

How can I install applications like Google Chrome on Ubuntu?  Are there any commands to install an application?    Index of answers:


i have created global Navigation (structural navigation)  on SharePoint online site .  now i am trying to create third level navigation on SharePoint On Premise Site. i have SharePoint on premise publishing site . but i am not able to find Edit Links button .  is that possible to create third level navigation in SharePoint on premise . if Possible/not possible please  share some articles.

in my SharePoint On premise environment i have Publishing Site . i am trying to Edit Links in Global navigation . but i am unable to see Edit Links option on SharePoint on premise publishing site.       Please suggest something so i can see that Edit Links opetion in SharePoint on premise site


How can we tell if a star is made of matter or anti-matter? For example, is there any difference spectroscopically? Or could we tell from cosmic rays?  If half of the stars were made of matter and half of anti-matter, then they would be in balance.   After the Big Bang, the slightest of imbalances in the distribution of matter and anti-matter would, I think, grow more pronounced as a local surplus of matter would persist if bombarded with equal amounts of matter and anti-matter. Over time, that matter would gravitationally come together and locally grow more dense. Gravitation thus would segregate matter and anti-matter as most of space became empty. Thus perhaps half the stars that we see might be made of anti-matter.  For the photons they produce would be the same, yes? And the gravitational force is the same.  In particular, I wish to know approximately what is the density of mass in the space midway between our solar system and Alpha Centauri? What would be the nature and magnitude of energy released there if matter from our side was colliding with anti-matter from Alpha Centauri's side? Would we be able to detect that? Please, I would like to see a calculation!

Given that  galaxies are theoretically possible, how would they be distinguishable from regular matter galaxies?  That is, antimatter is equal in  and all properties, except for the opposite reverse charge of the particles, identical to regular matter. Hence a star composed of antimatter hydrogen would fuse to anti-helium in an analogous way to our own Sun, and it would emit light and radiation at the same wavelengths as any regular matter star and would cause the same gravitational forces for planetary systems to form as in any other star system.  Hence, what would be a telltale sign if you were observing a galaxy made up entirely of antimatter?  Also, is there any evidence for that half of all galaxies are not made of antimatter -- while general theories currently assume that there is an imbalance of matter over antimatter in the universe, then what is the rationale for not assuming that there is in fact an even balance between the two?


I have installed the codeblocks from ubuntu software center and used good enough time no problem but when i try to access functions from graphics.h library I'm getting errors so please help me adding the graphics.h from  to the code::blocks.  Thanking you , guys!

Is there any Linux based compiler which supports graphics.h library? I want to implement graphic programs, so please kindly let me know if there is any such software.    If not then how  can I use it?


Is $F(x)=\int_{a}^xf(t)dt$ continuous everywhere if  $$f(x)=\begin{cases} e^x, & \text{if }x>0\\ C,  & \text{if C is constant not equal 1 and }x\le0 ?\\ \end{cases}$$  This confuse me since I know $f(x)$ is not continuous at $0$ but $F(x)$ is a sum of area which seems always continuous.

Say I have a function $f(x)$ on some interval $[a,b]$.  Say it is integrable such that $\displaystyle\int f(x)~dx $ is defined.  Is $\displaystyle\int f(x)~dx $ necessarily continuous?  If I were to know that the integral is integrable itself such that $\displaystyle\int \int f(x)~dx $ is defined. Would that change anything?   If so why?  Thank you


In Google webmaster, I set a preferred domain as www but my subdomain is non www. Will these cause any negative effect?

My company has two websites a main one at www.example.com and one at subdomain.example.com which is a subdomain of the first and is our self hosted blog.   The way Google sees these with the www or no-www (called naked for now on) is that each of these actually are different when the www or naked version is used/not used in the front of the domain. I completely understand this. It is also advised that both should be set up in the Google Webmaster Tools, which I have done. Correct me if I am wrong on that in regard to having both set up.  Now the way it appears is that we can set a preferred domain up in Webmaster Tools only at the root domain level. The subdomain cannot have this and actually says the following:  **Restricted to root level domains only**.  So it appears that the domain should follow what the root domain says, which on our preferred one says to display the www.example.com and not the naked version. That is one issue I have in that one displays one way and the other displays another.   Is it that we have the wrong redirects in place for the subdomain? Another question is does this have any affect on SEO in regards to duplicate content on the web in how we have set this up?


I'm looking for custom code to remove fields on user profile like you see in the pictures :  I would also like to replace Gravatar images with simple photos from the media library:

I want to hide/remove the Personal Options in the Your Profile (wp-admin/profile.php) admin page.  I am aware that solutions for this exist, but I they use jQuery to do hide this section. This works, but when a user has JavaScript disabled in their browser, it will show up again. Therefore it is not a proper way to remove Personal Options.  Is there a way to remove the Personal Options section from the HTML source of the page? This means no jQuery or CSS hacks, or core file modification.


it has been a while since I had to deal with any probability analysis. I will try to explain as best as I can, feel free to ask any clarification.  I have around 150 number of events (sales projects), each with its on Probability P of occuring (selling).  Each event has a value V of (sales price).  Now some events might occur others might not, depending on their P. I would like to establish a distribution where I can see the probability of reaching any possible total Value of all events.  for up to 10 events that is fairly easy, working out all possible combinations (n^2)-1, ranking them by total value of successes, working out the probability of the combination, then use Bayes law to work through the combinations.  This is impossible to do for 150 events. Is there an easier way or an approximation?  In the end I would like to be able to say the Probability of selling 50k worth of projects is xyz% or the P(75) this year is abc kUSD.  I hope this is vaguely understandable.  Many thanks and kind regards Joe

If 20 independent Bernoulli trials are carried out each with a different probability of success and therefore failure. What is the probability that exactly n of the 20 trials was successful?  Is there a better way of calculating these probabilities rather than simply summing together the combinations of success and failure probabilities?


I am using Ubuntu 14.04 on my Dell XPS 13 9333.  Everytime I use the command line (succesfully or not) a short line is being put out instead of the usual fresh and empty line which you normally get if the command you used was succesfully processed. The line is always the same and it says:  no talloc stackframe at ../source3/param/loadparm.c:4864, leaking memory   Any idea what this means?

Everytime I try to sudo something at the terminal, I get a warning message:  alexandre@XPS-15Z $ sudo mount file.iso /mnt/ -o loop [sudo] password for alexandre:  no talloc stackframe at ../source3/param/loadparm.c:4864, leaking memory   It's just annoying to get that all the time. How do I solve that? I'm on Ubuntu 14.04 (upgraded from 13.10)


I want to capture all values from this xml file and print the values in file as out1.txt  remark - value from the xml mean the word in the double bracket     more input.txt   <app name="UAT/ECC/Global/MES/1206/MRP-S23"   ear="UAT/ECC/Global/MES/1206/MRP-S23.ear" xml="UAT/ECC/Glal/ME/120/MRP-  S23.xml"/>  <app name="OQ/ediedbn/adSFSF/adSFSF-CL" ear="OQ/ebn/aSF/adSF- CL.ear"  xml="OQ/ediedbn/adSFSF/adSSF-CL.xml"/>  <app name="OQ/ediedbn/adaEBS/adOrBS-HR-CL"  ear="OQ/ediedbn/adOraS/araEBS- HR-CL.ear" xml="OQ/eddbn/aOraEBS/adOEBS-   HR-CL.xml"/>  <app name="UAT/CZ/LIMS/T068_01/LIMS-QA-S03" ear="UAT/CZ/LIS/T068_01/LIS-QA-     .ear" xml="UAT/CZ/LIMS/T068_01/LIMS-QA-S03.xml"/>   .  more out1.txt  UAT/ECC/Global/MES/1206/MRP-S23 UAT/ECC/Glal/ME/120/MRP-S23.xml OQ/ediedbn/adSFSF/adSFSF-CL OQ/ebn/aSF/adSF- CL.ear . . .   please advice how to capture the values in the out1.txt file with awk / perl one liner , bash

How to capture the words in the double quote to one line as out.txt  more input.txt  "OQ -63/ECC/UK/JDA/adRedprairie" "OQ -63/ECC/UK/JDA/adRedprairie.ear" "OQ- 63/ECC/UK/JDA/adRedprairie.xml" "OQ/CZ/Ecomphos/216_06/OM-S03" "OQ/CZ/Ecomphos/216_06/OM-S03.ear"     "OQ/CZ/Ecomphos/216_06/OM-S03.xml"  more out.txt  OQ -63/ECC/UK/JDA/adRedprairie OQ -63/ECC/UK/JDA/adRedprairie.ear Q-63/ECC/UK/JDA/adRedprairie.xml OQ/CZ/Ecomphos/216_06/OM-S03 OQ/CZ/Ecomphos/216_06/OM-S03.ear OQ/CZ/Ecomphos/216_06/OM-S03.xml


I tried to install Vlc 2.2 in Ubuntu 14.04 LTS as it not available on Ubuntu Software Centre using following commands:  sudo add-apt-repository ppa:mc3man/trusty-media sudo apt-get update && sudo apt-get install vlc    But it showed errors:  Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies: vlc : Depends: vlc-nox (= 3.0.0~~git20150319+r59816+33~ubuntu14.04.1) but 2.1.6-0ubuntu14.04.1 is to be installed    Depends: libavcodec55 (>= 6:9.1-1) but it is not installable or             libavcodec-extra-55 (>= 6:10~~git20131218.b3189af~ubuntu14.04.1) but it is not installable    Depends: libavutil53 (>= 6:9.1-1) but it is not installable    Recommends: vlc-plugin-notify (= 3.0.0~~git20150319+r59816+33~ubuntu14.04.1) but it is not going to be installed    Recommends: vlc-plugin-samba (= 3.0.0~~git20150319+r59816+33~ubuntu14.04.1) but it is not going to be installed    Breaks: vlc-nox (< 2.2.0~pre2-2~) but 2.1.6-0ubuntu14.04.1 is to be installed vlc-nox : Depends: libvlccore7 (>= 2.1.0) but it is not going to be installed        Recommends: libdvdcss2 but it is not installable E: Error, pkgProblemResolver::Resolve generated breaks, this may be caused by held packages.   now even if I try to install it using Ubuntu Software Centre it shows me error that package dependencies cannot be resolved.  Please help. Thanks in advance.

Occasionally, when I'm installing stuff, I get an error like the following:  Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  package1 : Depends: package2 (>= 1.8) but 1.7.5-1ubuntu1 is to be installed E: Unable to correct problems, you have held broken packages.   How can I resolve this?


I have a struct that overrides the Equals() method and the compiler complains about GetHashCode() not being overridden.  My struct:    private struct Key   {     ...      public override int GetHashCode()     {       return ?;     }      public int FolderID;     public MyEnum SubItemKind;     public int SubItemID;   }   What is the right way to implement the GetHashCode() method?  a)      return FolderID ^ SubItemKind.GetHashCode() ^ SubItemID;   or b)      return FolderID.GetHashCode() ^ SubItemKind.GetHashCode() ^ SubItemID.GetHashCode();

In .NET, the  is used in a lot of places throughout the .NET base class libraries. Implementing it properly is especially important to find items quickly in a collection or when determining equality.  Is there a standard algorithm or best practice on how to implement GetHashCode for my custom classes so I don't degrade performance?


I am trying to calculate the length of lines, which were convatede before from gps to Shapefile (vector layer). I tried it with "feldrechner" (matrix calculator?) and the most time I got 0, or in the other times I got a very unrealistic result.  I also tried it with measurement of lines. There I got a good result. But I think, because of tracing the line by hand it is not so exact.  Does anybody know how I can get my exact length or/and area?  Both my results were: e.g. this result (first way): 2.74556577576214e-07 In my other way I got in this case 35,555m.

I am using QGIS.   I would like to know if there is any way during the editing phase of a vector (line or polygon) to know the length of the line (total and partial) that is being created?


It seems that for every prime p = (4k + 1), p-1 is a quadratic residue modulo p. It seems that for every prime p = (4k - 1), p-1 is not a quadratic residue modulo p.   I can't figure how to proove this, does anyone has an idea ?   Best regards

I came across this problem and I believe Lagrange's theorem is the key to its solution.  The question is:     Let $p$ be an odd prime. Prove that there is some integer $x$ such that $x^2 \equiv −1 \pmod p$ if and only if $p \equiv 1 \pmod 4$.   I appreciate any help.  Thanks.


Hi I am trying to call an action result in my controller containing parameters, but whenever one of these parameter contains # sign(special character) the string parameters does not include # sing in parameter and Next all parameters are set to null.  Following is my java script through which i am calling my action result.      <script type="text/javascript">         $(document).ready(function () {             $('#btnExport').unbind().click(function () {                 var url = @Url.Content("~/BankStatement/ExportBankStatementSummary") +                     "?legalName=" + '@ViewBag.LegalName' +                     "&dba=" + '@ViewBag.DBA' +                      "&contactPerson=" + '@ViewBag.ContactPerson' +                     "&address=" + '@ViewBag.Address' +                      "&period=" + '@ViewBag.Period' +                     "&totalHeading=" + '@ViewBag.TotalHeading';                 window.location = url;             });         });     </script>   This is the action result that is called in this java script  public ActionResult ExportBankStatementSummary(string legalName, string dba,                                                 string contactPerson, string address,                                                 string period, string totalHeading)     {         ViewBag.LegalName = legalName;         ViewBag.DBA = dba;         ViewBag.ContactPerson = contactPerson;         ViewBag.Address = address;         ViewBag.Period = period;         ViewBag.TotalHeading = totalHeading;          ...   The problem is that in the action result parameters, when ever any of the parameter contains any special character (# in this case) then that parameter and next parameters becomes null.  For example if address is "Street # 2" then parameter address becomes "Street " and next parameters period and totalHeading becomes null.  Any help will be highly appreciated.  Thanks in advance.  [I do not agree on the duplication of this question because the marked duplicate question was discussed in detail and the detailed conversation covered the answer of this question but the actual question was totally different from this question.]

How do you safely encode a URL using JavaScript such that it can be put into a GET string?  var myUrl = "http://example.com/index.html?param=1&anotherParam=2"; var myOtherUrl = "http://example.com/index.html?url=" + myUrl;   I assume that you need to encode the myUrl variable on that second line?


i have this query  SELECT a.album_id parent, a2.album_id child FROM album a LEFT JOIN album a2 ON a2.parent_album_id = a.album_id WHERE a.album_id = 76   Basically, it returns parent and children values, like so:  parent      child -------------------- 76          64 76          106   I want to use those values,  the parent and all of the children (76, 64, 106), to delete from another table like so  DELETE a, ai FROM album a LEFT JOIN album_image ai ON ai.album_id = a.album_id WHERE a.album_id IN (76,64,106)   Executing the above query, works perfectly! But, i need the query to be dynamic. I've try this with no success:  DELETE a, ai FROM album a LEFT JOIN album_image ai ON ai.album_id = a.album_id WHERE a.album_id IN (     SELECT a.album_id parent, a2.album_id child     FROM album a     LEFT JOIN album a2 ON a2.parent_album_id = a.album_id     WHERE a.album_id = 76 )   I get it why it won't work, because the subquery in the where clause returns 2 values. And so i've try CONCAT_GROUP and CONCAT_WS with no success!  What is my solution? Thanks

I have a table story_category in my database with corrupt entries. The next query returns the corrupt entries:  SELECT *  FROM  story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category INNER JOIN         story_category ON category_id=category.id);   I tried to delete them executing:  DELETE FROM story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category        INNER JOIN story_category ON category_id=category.id);   But I get the next error:      #1093 - You can't specify target table 'story_category' for update in FROM clause    How can I overcome this?


I found a bug      When disk is full - Lubuntu 13.10 can't load.   I went to  to search this "bug" but didn't find this "bug". I push button "Report a bug", but I see , not the interface of "bug" submitting. Maybe I need to do something to get access of posting "bug reports"?

I found a problem with an application on Ubuntu.   Questions :   How do I best report the issue?  What sort of information should I provide?


How do I get this sort of notation in LaTeX?     I'm using TeXmaker.

How to write this Piecewise function using LaTeX?  I tried $ \begin{array}{cc}   \{ &      \begin{array}{cc}       0 & x\leq 0 \\       \frac{100-x}{100} & 0\leq x\leq 100 \\       0 & 100\leq x     \end{array} \end{array} $  but it didn't work perfectly, the bracket "{" looks small, see:


In a sentence, how do you test in Arcpy whether a feature class has any selected records or not? More info below to explain:  I am doing a batch process in which a sampling layer (10km grids) is used to select polygon records (of which there are about 100,000 in total). My script returns the list of polygon IDs that intersect each 10km grid square. I then do some further processing/summarizing using that list of polygon IDs.  In instances where there are polygons within the sample square, ArcGIS performs a selection on the polygons, and it's relatively easy to iterate through those records using a searchcursor. Note I'm using v10.0.  But in instances where there are no selected records (ie there are no polygons intersecting my 10km sample square), the searchcursor would return ALL records in the database. So what's the most robust way to test programatically whether a feature class has a selection or not?  I know you can use arcpy.GetCount_management to return a number that tells you how many records are selected, and if that number = the number of records in the entire layer then you can infer that either none, or all are selected.  But that's not the same as determining if there is a selection or not. What's the best way to do that in Arcpy?

Using arcpy I'm trying to get the results of a selection, or what is currently selected as a list.  Basically I'm attempting to build an addin which on click will either perform an operation where I invoke SelectLayerByAttribute_management (or ByLocation) to select some features, or the user performs a selection ByAttribute (or ByLocation), and while they have their selection hightlighted executes my snippet by pressing a button on the toolbar.  In each  case I want to get a list of results to perform a specific task on only certain selected features.  I can't find out how to get a list of the currently selected features, or find a listener for  selection having been made so I can enable the button, and ensure I can perform my operation on an existing selection.


Searching Natural Language Processing in Google Image search gives many images of this type:      Note that there are only horizontal and vertical texts with random formatting. What is a generic way to get this?

I have seen the answer to this question:    So yes it can be done by generating an image and inserting it, but that's kind of cheating. I'd like to be able to generate a word cloud that is made of searchable text, rather than a .png file. Does anyone know if that is possible?  Edit I'm interested in any style, it doesn't have to be a complex cloud with words in different directions, it could be a "horizontal" cloud like some of those .


I’ve been struggling with this question for a while and was hoping you could help because I think I’ve gone wrong somewhere with my calculations, Firstly I calculated the total number of passwords (including those that didn’t satisfy the criteria) by doing $(26+26+10)^8 = 62^8$ Then I calculated the number of passwords with at least one number: $(10\cdot 62^7)$ (I was thinking the other $7$ characters could be any). I also did the same for at least one uppercase letter: $(26\cdot 62^7)$ and for at least one lowercase letter: $(26\cdot 62^7)$ I then tried to calculate the number of passwords with at least one number and at least one uppercase letter: $(10\cdot 26\cdot 62^6)$, with at least one number and one lowercase letter: $(10\cdot 26\cdot 62^6)$, with at least one uppercase letter and one lowercase letter: $(26\cdot 26\cdot 62^6)$ My logic was to use the inclusion-exclusion rule and find the number of passwords that satisfy all of them: $$62^8 - (10\cdot 62^7) - 2(26\cdot 62^7) + 2(10\cdot 26\cdot 62^6) + (26^2\cdot 62^6) = 6.793308176 \cdot 10^{13}$$ My problem is by the same logic I’ve used, I could simply do $26\cdot 26\cdot 10\cdot 62^5 = 6.193057944 \cdot 10^{12}$ I don’t understand why these two answers are different, have I gone wrong somewhere?  Thank you very much for your help!

Suppose you want to generate a password using ASCII  characters ($128$ characters.)How many ways can you create a password of 10 characters long that has at least one lowercase letter (a-z) and at least one number ($0-9$)?  ** MY ANSWER: $26*10*(128)^{10}$**  I don't understand why this is wrong? Can anybody help? Thanks!


This ad, on Code Review:  links to: http://engine.adzerk.net/r?e=eyJhdiI6NDE0LCJhdCI6MTcsImJ0IjowLCJjbSI6MTE2MSwiY2giOjExOTgsImNrIjp7fSwiY3IiOjI2NjMsImRpIjoiMmUwNmRhMjNhNzFhNDgxOGIwYmUyZmRhYWI5ZTE5Y2YiLCJkbSI6MSwiZmMiOjQ2NTEsImZsIjozMzM1LCJpcCI6IjkyLjEyLjIwOC4yMTUiLCJrdyI6ImphdmFzY3JpcHQsb3B0aW1pemF0aW9uLHN0cmluZ3MsdXRmLTgseC1ob3N0LWNvZGVyZXZpZXcuc3RhY2tleGNoYW5nZS5jb20iLCJudyI6MjIsInBjIjowLCJlYyI6MCwicHIiOjE3NTYsInJ0IjoxLCJyZiI6Imh0dHA6Ly9jb2RlcmV2aWV3LnN0YWNrZXhjaGFuZ2UuY29tL3F1ZXN0aW9ucy8xMDkwNTIvdXNpbmctcGFuZGFzLXRvLXBhcnNlLWFkd29yZHMtZXhwb3J0LWdvb2dsZS1hbmFseXRpY3MiLCJzdCI6MTIwNTcsInVrIjoidWUxLTU3YjIyNjRjZDYzNTQ4N2I4YmEwNGY5MDQ2Njc1MjE5Iiwiem4iOjc2LCJ0cyI6MTQ0NjA3MDM1NDI3MiwiYmYiOnRydWUsInBuIjoiYWRjbTIiLCJ1ciI6bnVsbH0&s=MFHwMALcxHB2XRwa6p5otO7Go04&url=http%3A%2F%2Ftridion.stackexchange.com%2Fquestions%2F13151%2Fcontent-porter-primary-key-constraint-pk-file-extensions-error%3Futm_medium%3Dad%26utm_source%3Dhttp-skeptics-stackexchange-com-questions-1700-do-bigger-or-more-monitors-incr%26utm_campaign%3Dtridion.stackexchange.com-promo%26utm_content%3D13151  which redirects to: http://tridion.stackexchange.com/?utm_medium=ad&utm_source=http-skeptics-stackexchange-com-questions-1700-do-bigger-or-more-monitors-incr&utm_campaign=tridion.stackexchange.com-promo&utm_content=13151  You can see utm_source=http-skeptics-stackexchange-com-questions-1700-do-bigger-or-more-monitors-incr. I presume utm_source is the originating site (ie. the site the ad was clicked on from), so why is it saying I clicked on it from Skeptics rather than Code Review? I don't think this actually matters but I'm curious: Why is it happening? Is there a reason? (If so, why? :)

Today, I was on Stack Overflow when I noticed an interesting ad pointing to history.SE (actual square ad, not just Hot Network Questions).  The link in the ad was:    which resolves to:  https://history.stackexchange.com/questions/23946/what-were-greek-and-roman-sails-made-from?utm_medium=ad&utm_source=http-askubuntu-com-questions-471178-converting-hundreds-of-jpg-to-pdf-using-te&utm_campaign=history.stackexchange.com-promo&utm_content=23946  (link form for conveniece: )  The confusing part os the URL is: utm_source=http-askubuntu-com-questions-471178-converting-hundreds-of-jpg-to-pdf-using-te. The ad is from SO to history.SE, it doesn't have anything to do with Ask Ubuntu, so why does it appear in the URL? Is this a bug?  EDIT: Okay, managed to trigger it again: the page  contains this ad:    The link of the ad is:    which resolves to:  http://opensource.stackexchange.com/questions/1556/how-to-react-to-unhelpful-contributions-to-otherwise-unnoticed-projects?utm_medium=ad&utm_source=http-sharepoint-stackexchange-com-questions-16925-why-am-i-getting-server-erro&utm_campaign=opensource.stackexchange.com-promo&utm_content=1556  incorrectly referencing an unrelated sharepoint.SE question.


I wonder What is the difference between this two different method of 2D matrix initialization in python.       m =[]     K = []     for x in range(0,W+1):         m.append(0)     for x in range(0,n+1):         K.append(m)   and       l = []     for j in range(0,n+1):         l.append([])         for i in range(0,W+1):             l[j].append(0))   when I tried to print l and K the both gave the same answer but when I tried to implement it in code the output of program changed.  the earlier one(K) gave an incorrect answer but later one(l) when implemented in the program gave a correct answer.

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


Completely new to GIS so this may be the most basic thing in the world however I've followed several other posts on the same question and it does not seem to be working.  My end goal(hopefully) is to take the files(.shp, .dbf, etc) that I've downloaded from the NHESP and turn certain habitats into lat and long values in a .csv.   Basically, I'm trying to determine if bee-hive distance to core habitats etc makes an impact on health, ability to survive, etc(if anyone cares).  I've tried using the field calculator to generate an X & Y coordinate, as well as the "save vector layer as" and changing the geometry to "as_xy."  Is there something I'm missing, or is it possible the files I have simply cannot generate or do not contain the information needed for lat/long?

I am very new to QGIS, so please bear with me.  I have a ".shp" file, which is contains a set of boundaries for suburbs of Australia. I opened it to QGIS and I would like to export it into a CSV file so that the final file would be like following.  POSTCODE, LATITUDE, LONGITUDE  When I select "Layer > Open attribute table" I can see the "postcode" column.  I had a look at a similar question here     Which told me to simply go to "Layer > Save as" and then type "GEOMETRY=AS_XY" or "GEOMETRY=AS_XYZ" in the "Layer" section of the "OGR creation options".  I followed exactly, but the latitude and longitude values are not being returned.


I use a TOSHIBA Satellite A300 laptop with Windows 8.1 Pro installed.  I made a live USB using Universal USB Installer 1.9.6.1 from which I can boot Ubuntu 15.04 using the ISO image from Ubuntu website.  My laptop successfully booted from the USB memory and ubuntu successfully ran without trouble.  On the desktop (I suppose it's called desktop) there was a file/program with the name "Install Ubuntu 15.04," which I opened.  During the installation I chose a drive which I already had decided to allocate for Ubuntu and changed its filesystem type to ext4`` and installed Ubuntu onto this drive. When the installation finished I was asked to restart my computer, which I did but instead my computer directly booted my windows 8.1. The partition on which ubuntu is installed is now invisible to windows but it says "healthy" in the Disk Management tab in the computer management window of Windows 8.1 . I saw during the installation of ubuntu the status "Installing GRUB" or something similar, I did some research then found out that GRUB is a multiboot manager from FSF. However, it seems that it doesn't exist and I can't reach to boot Ubuntu installed on the HDD no matter what I do.  I'd like your help to know what I should do to:   Make my computer detect Ubuntu so I can boot it. Ask each time for which OS I'd like to boot.   thank you very much

Recently I have installed Ubuntu 10.10 and selected a wrong option while installing it.   Now the problem is that my machine directly boots Ubuntu and even does not show me grub menu.  How do I install grub menu ?  And how do I add Windows Vista to the grub menu?  This is what I have tried.  sudo grub  > root (hd0,0)  > setup (hd0)  Error 17: Cannot mount selected partition   I don't know what's going wrong here and I am sure that I have not wiped out my windows partition.  Edit :   sudo update-grub  Generating grub.cfg ...   Found linux image: /boot/vmlinuz-2.6.35-22-generic   Found initrd image: /boot/initrd.img-2.6.35-22-generic   Found memtest86+ image: /boot/memtest86+.bin   ls: cannot access /media/BC54B2C654B282A6/boot   Boot: No such file or directory   done      sudo os-prober  ls: cannot access /media/BC54B2C654B282A6/boot   Boot: No such file or directory     Thanks.


I have a view written like  create view v1 as  with conn_query as (xxx) select stuff from conn_query where some_cond union select stuff from conn_query where some_other_cond   But suddenly querying this view became very slow (10 seconds for a result of 2 records), even though the  single queries in the union where very fast (milliseconds). Apparently the union caused xxx to be  fully evaluated without pushing down the arguments (10 seconds is about also the time it takes to select count(*) from v1)  Rewriting the view to   create view v1 as  select stuff from (xxx) where some_cond union select stuff from (xxx) where some_other_cond   fixed this. Unfortunately, this makes now the SQL xxx appear twice which is a bit ugly.  So now I'm curious if on a conceptual level, is there a good reason for this behaviour?  This is with Oracle 11.2.0.4.0  UPDATE/DUPLICATE:  I got exactly the expected fast behaviour with the cte variant by using  create view v1 as  with conn_query as (select /*+INLINE*/ xxx) select stuff from conn_query where some_cond union select stuff from conn_query where some_other_cond   as suggested in . This undocumented hint prevents Oracle from trying to be smart and materialzing the CTE just because it is accessed more than once.

Inline views allow you to select from a subquery as if it were a different table:  SELECT     * FROM /* Selecting from a query instead of table */     (         SELECT             c1         FROM             t1         WHERE             c1 > 0     ) a WHERE     a.c1 < 50;   I've seen this referred to using different terms: inline views, WITH clause, CTE and derived tables. To me it seems they are different vendor specific syntax for the same thing.  Is this a wrong assumption? Are there any technical/performance differences between these?


I want to print the array identifier name along with its content. In situations where a page contains many arrays, then there is a confusion - which elements belong to which array.  $user= array('id' => 1,'name' => "Tom");  //expectation user Array (     [id] => 1     [name] => Tom )

Say i have this PHP code:  $FooBar = "a string";   i then need a function like this:  print_var_name($FooBar);   which prints:  FooBar   Any Ideas how to achieve this? Is this even possible in PHP?


I would generally consider fields to not be substances, since substances are generally associated with matter. I know that energy is not a substance. Are electromagnetic waves a substance?

There was a reason why I constantly failed physics at school and university, and that reason was, apart from the fact I was immensely lazy, that I mentally refused to "believe" more advanced stuff until I understand the fundamentals (which I, eventually, never did). As such, one of the most fundamental things in physics that I still don't understand (a year after dropping out from the university) is the concept of . No one cared to explain what a field actually is, they just used to throw in a bunch of formulas and everyone was content. The school textbook definition for a field (electromagnetic in this particular case, but they were similar), as I remember it, goes like:  An electromagnetic field is a special kind of substance by which charged moving particles or physical bodies with a magnetic moment interact.  A special kind of substance, are they for real? This sounds like the authors themselves didn't quite understand what a field is so they decided to throw in a bunch of buzzwords to make it sounds right. I'm fine with the second half but a special kind of substance really bugs me, so I'd like to focus on that. Is a field material? Apparently, it isn't. It doesn't consist of particles like my laptop or even the light. If it isn't material, is it real or is it just a concept that helps to explain our observations? While this is prone to speculations, I think we can agree that in scope of this discussion particles actually do exist and laws of physics don't (the latter are nothing but human ideas so I suspect Universe doesn't "know" a thing about them, at least if we're talking raw matter and don't take it on metalevel where human knowledge, being a part of the Universe, makes the Universe contain laws of physics). Any laws are only a product of human thinking while the stars are likely to exist without us homo sapiens messing around. Or am I wrong here too? I hope you already see why I hate physics. Is a field not material but still real? Can something "not touchable" by definition be considered part of our Universe by physicists? I used to imagine that a "snapshot" of our Universe in time would contain information about each particle and its position, and this would've been enough to "de" it but I guess my programmer metaphors are largely off the track. (Oh, and I know that the uncertainty principle makes such (de)serialization impossible — I only mean that I thought the Universe can be "defined" as the set of all material objects in it). Is such assumption false? At this point, if fields indeed are not material but are part of the Universe, I don't really see how they are different from  except for perhaps a more geeky flavor. When I talked about this with the teacher who helped me to prepare for the exams (which I did pass, by the way, it was before I dropped out), she said to me that, if I wanted hardcore definitions,  a field is a function that returns a value for a point in space.  Now this finally makes a hell lot of sense to me but I still don't understand how mathematical functions can be a part of the Universe and shape the reality.


Now that Thanos has all the 6 Infinity stones at the end of Avengers: Infinity War, he is the most powerful creature in the universe. When he snapped his fingers during the last scene of the movie Drax, Starlord, Black Panther and many more started disintegrating into dust.   And in the post-credits scene, Nick Fury also died.  On what basis were they "chosen" for destruction?

At the end of ,     Thanos' plan comes to fruition as people begin disintegrating, including Bucky Barnes, Drax, Groot, Mantis, Maximoff, Parker, Quill, Strange, T'Challa, and Wilson.    Could this be caused by Thanos' direct manipulation or does it happen without Thanos' interaction but as some random event?     The heroes getting disintegrated, was it because it was Thanos's choice to complicate the possible regrouping of the Avengers/Heroes or was it just random?


I've been directed to a few articles, and I am sure there is a related post, but can someone explain the procedure by which we can view classic electromagnetism through quantum mechanics? Indeed we need to be able to look at any field as an ensemble of particles (photons), but how can we develop classic field theory assuming quantum mechanics?

I've read and heard that quantum electrodynamics is more fundamental than maxwells equations. How do you go from quantum electrodynamics to Maxwell's equations?


i have a file, which was encrypted with AES-128 in CBC mode. I know the content of original file and know the iv used to encrypt that file.So, just wondering if it's possible to recover the key used from the information provided.

I have a file, which was encrypted with AES-128 in ECB mode. I know the format of the original file and know that all files in this format have the same headers. So, I have an encrypted block and the original block.  Can I get the encryption key, using this information?


I want to change the spelling of my first name just 1 alphabet From S to Z . Will I be able to travel to US on my US visit Visa valid for 10 years

I'm a Malawian national and I got US Visa years back.  Recently, due to some reasons, I had to get my first name partially changed on my passport. I have got an affidavit certificate stating the reason and proof.  Since the visa on my old passport has still not expired, but there is a difference in first name, will I face any problem?


Why is it true that $a^{\log_{b}n} = n^{\log_{b}a}$

I'm trying to understand a "subproof" of the divisor Master Theorem (Cormen et al., Introduction to Algorithms, page 99), and in some point they state:  $$\Large a^{\log_b n} = n^{\log_b a}$$  where $a\geq 1$, $b > 1$ and $n = b^i$, for some $i$. That is, $n \in \{1, b, b^2, ...\}$  I would appreciate a simple explanation of this equality (just OK for a CS undergraduate).


Maybe I have already found the answer to this question in that it's not possible, but if there's a nifty trick... I'm all ears.  I'm trying to reproduce the following C enumeration list in python:  enum Id {    NONE = 0,    HEARTBEAT, //0x1    FLUID_TRANSFER_REQUEST,    FLUID_TRANSFER_STATUS_MSG,    FLUID_TRANSFER_ERROR_MSG,    FLUID_TRANSFER_RESUME,    EMERGENCY_STOP_MSG,    LOG_MSG,    VERSION_REQUEST,    VERSION_RESPONSE,    CHANNEL_INFORMATION_REQUEST,    CHANNEL_INFORMATION_RESPONSE,    TEST_REQUEST,    LED_CONTROL_REQ,    RESET_REQ,     // Camera App Messages    START_SENDING_PICTURES = 0x010000,    STOP_SENDING_PICTURES,    START_RECORDING_VIDEO_REQ,    STOP_RECORDING_VIDEO_REQ,    TAKE_PICTURE_REQ,    SET_VOLUME_LIMIT,             VIDEO_FRAME_MSG,    PICTURE_MSG,    I_FRAME_REQUEST,    CURRENT_VOLUME,    START_ANALYZING_IMAGES_REQ,    STOP_ANALYZING_IMAGES_REQ,    SET_FILE_PATH,     //Sensor Calibration    VOLUME_REQUEST = 0x020000,    START_CAL,    CLI_COMMAND_REQUEST,    CLI_COMMAND_RESPONSE,     // File Mananger    NEW_DELIVERY_REQ = 0x30000,    GET_DELIVERY_FILE_REQ,    GET_FILE_REQ,     ACK_NACK,    RESPONSE,     LAST_ID };   However, I don't want to have to specify every value for the list because it's changing often.  Since I also have it set to a new value in the various sections, I can't use the AutoNumber methodology (e.g. VOLUME_REQUEST = 0x020000).  Anyone got a clever trick to reproduce C style enums in python, or am I stuck with reproducing it the hard way?

I'm mainly a C# developer, but I'm currently working on a project in Python.  How can I represent the equivalent of an Enum in Python?


I have a scanner that worked fine in UM 18.04. But no longer works in 20.04. Should I report that as a bug to Launchpad? What are the criteria for determining bugs?

I found a problem with an application on Ubuntu.   Questions :   How do I best report the issue?  What sort of information should I provide?


In his Tractatus logico-philosophicus, Wittgenstein uses an unusual numbering system for paragraphs, here's how he describes it.     The decimal figures as numbers of the separate propositions indicate the logical importance of the propositions, the emphasis laid upon them in my exposition. The propositions n.1, n.2, n.3, etc., are comments on proposition No. n; the propositions n.m1, n.m2, etc., are comments on the proposition No. n.m; and so on.   Example    Ideas  I see two ways of designing such architecture. The first is the one proposed by the author of the plain Tex question that I cite below (that uses up and down). The other is to create a proposition environment.  \begin{proposition}     Proposition 1     \begin{proposition}         Proposition 1.1     \end{proposition}     \begin{proposition}         Proposition 1.2         \begin{proposition}              Proposition 1.21         \end{proposition}     \end{proposition} \end{proposition} \begin{proposition}[0]     Proposition 2     \begin{proposition}         Proposition 2.0         \begin{proposition}              Proposition 2.01         \end{proposition}     \end{proposition} \end{proposition}   Notes   I don't mind about working with commands or environments, I'm just looking for a practical solution. I am aware that  exist but I guess the use of LaTeX can simplify macros.

How can I keep track of a decimal number that indicates the current paragraph's place in a logical hierarchy and print it in the margin of each paragraph?  (To yield a numbering in the style of Tractatus Logico-Philosophicus).  \def\on{} \def\down{} \def\up{}  \on This is the first paragraph, paragraph number 1.  \on This is paragraph number 2.  \down This is paragraph number 2.1  \down 2 This is 2.101  \up This is 2.11  \down 2.111  \up 3 3  \bye   If \down is starred, begin with zero.  If \up is followed by an integer, it should take it as an argument, unless there is a newline between \up and the integer.  An indefinite number of decimals should be possible.  PS.  I apologize for changing the question after (2) answers have been given, but I realize I failed to appreciate a feature of Wittgenstein's numbering: the last decimal is never 0.  Therefore, \down <n> is better than \down*, as now demonstrated above.  I think the 0 is supposed to indicate an additional level of unimportance.


I have a array of ArrayList as defined below.  List<ArrayList<String>> reverseRange = new ArrayList<ArrayList<String>>();   and I set it to:  [[a, b, c, d, e, f, g, h, i], [a, b, c, d, e, f, g, h, i], [a, b, c, d, e, f, g, h, i], [a, b, c, d, e, f, g, h, i], [a, b, c, d, e, f, g, h, i], [a, b, c, d, e, f, g, h, i], [a, b, c, d, e, f, g, h, i], [a, b, c, d, e, f, g, h, i]]   by:  for (int i = 0; i < naive.size(); i++) { reverseRange.add(A); }   where A = [b, c, d, e, f, g, h, i]  I want to delete an object from specific list. Like:  reverseRange.get(0).remove("a");   but when I do that, it removes "a" from all lists and the result becomes:  [[b, c, d, e, f, g, h, i], [b, c, d, e, f, g, h, i], [b, c, d, e, f, g, h, i], [b, c, d, e, f, g, h, i], [b, c, d, e, f, g, h, i], [b, c, d, e, f, g, h, i], [b, c, d, e, f, g, h, i], [b, c, d, e, f, g, h, i]]   What I am doing wrong?

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


To prove that $e^x>1+x$, for all $x<0$. If I try to write $e^x$ as $1+x+\frac{1}{2}x^2+\frac{e^{\xi}}{3!}x^3$, for some $\xi\in (x,0)$. Then I get $e^x-(1+x)=\frac{1}{2}x^2+\frac{e^{\xi}}{3!}x^3$. How do I show that $\frac{1}{2}x^2+\frac{e^{\xi}}{3!}x^3$ is necessarily positive? I'd tried thinking for a long time, but can't find the way. Can't it be done by using Taylor to exactly order $3$??

Does anyone provide proof  of $1+x\leq e^x$ for all $x$?  What is the minimum $a(>0)$  such that $1+x\leq a^x$ for all x?


I've heard that $1+1/4+1/9+1/16+1/25+...$ converges to $\pi^2/6$. This was very surprising to me and I was wondering if there was a reason that it converges to this number?   I am also confused why $\pi$ would be involved. If someone could provide a proof of this or a intuitive reason/ derivation I would appreciate it. I am only able to understand high school maths however (year 12).

As I have heard people did not trust Euler when he first discovered the formula (solution of the ) $$\zeta(2)=\sum_{k=1}^\infty \frac{1}{k^2}=\frac{\pi^2}{6}.$$ However, Euler was Euler and he gave other proofs.   I believe many of you know some nice proofs of this, can you please share it with us?


I'm new to C++ OOP, and I am trying to implement a Hashmap and these are the files I have: unoreder_map.h: template <typename K, typename V> class unordered_map { .... public:     unordered_map();     ~unordered_map();     int size();     V getValue(K key);     void insert(K key, V value);     V remove(K key);     double getLoadFactor(); };   unordered_map.cpp: #include "unordered_map.h" template<typename K, typename V> unordered_map<K, V>::unordered_map() : count(0), numBuckets(5) { ... } template<typename K, typename V> unordered_map<K, V>::~unordered_map() {  ... }  main.cpp: #include "unordered_map.h"  int main(void) {     unordered_map<int, int> map;      map.insert(1, 1337);      std::cout << map.getValue(1) << '\n';      return 0; }  And I'm compiling as follow: g++ unordered_map.cpp main.cpp -o main And I get: /usr/bin/ld: /tmp/ccXdGpTS.o: in function `main':                                                                       main.cpp:(.text+0x24): undefined reference to `unordered_map<int, int>::unordered_map()'                                /usr/bin/ld: main.cpp:(.text+0x3a): undefined reference to `unordered_map<int, int>::insert(int, int)'                  /usr/bin/ld: main.cpp:(.text+0x4b): undefined reference to `unordered_map<int, int>::getValue(int)'                     /usr/bin/ld: main.cpp:(.text+0x77): undefined reference to `unordered_map<int, int>::~unordered_map()'                  /usr/bin/ld: main.cpp:(.text+0x9d): undefined reference to `unordered_map<int, int>::~unordered_map()'  What's this refering to?

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


I am trying to search the posts whose titles contains some keywords, e.g. "all types of".  So, I used this tag and a pair of quotation mark ""     title: "all types of"     the results shown above are what I want, though, below are not    Is it possible to search some keywords in title only?

I'm trying to search for questions that have specific words in their titles using the  search feature, but it seems that it does not return any search results.  Using this feature, I tried to search for questions on Stack Overflow with , but this search query returns no results.  Is it still possible to filter the search results based on words in question titles?


We recently migrated our web platform from php application to nodejs react application. Ever since we are facing a major drop in organic traffic from google search. While debugging found an issue where our site's google webcache is through below error    This error was when trying to access link - bit.ly/2upsOrO  changing the link from https to http is working i.e link bit.ly/2upT9pt is giving proper cached content.  Also weird part is changing the domain to any blah domain is giving cache content, i.e link bit.ly/2uoERpe is giving proper cached content.  Couldn't understand the issue, kindly help me debug the same, also let me know if further information is needed.

My site is getting 404. That’s an error. message when I click on cached from Google search results.  This is the error message from Google:  That’s an error.   The requested URL /search?q=cache:8kxLAgFrhZQJ:www.mysite.com.....&cd=8&hl=en&ct=clnk&gl=uk was not found on this server. That’s all we know.  What I did before I was getting this error is that about 10 days ago, I moved my hosting from Ixwebhosting to Gearhost (cloud based). I also added 301 redirect from non www to www.  I have no idea why I am getting this error. Please advise what might be the reason if there is a solution for it.  All of my pages are indexed by Google though.


I just can't wrap my head around this proof. How to do it? Here is what I tried:   $$A^3 = A$$ $$A^3 - A = 0$$ $$A(A-I)(A+I) = 0$$ Matrix $A$ satisfies the polynomial $p(x)=x(x-1)(x+1)$. Zeroes of $p$ are $-1, 0 ,1$. Minimal polynomial of the matrix $A$ has at least one root, which can only take value  of roots of $p$. Maximum multiplicity of that root in the minimal polynomial is one.   One can then take a look at the eigenspaces that correspond to the specific eigenvalues. What then...? Is that the path that can lead to a solution? Is there a better solution? I don't really get it... Please, be kind and explain this if you can spare the time.  I found  question, but there seems to be a leap of logic in the question, and the accepted answer.   $$A^3 = A$$ doesn't imply $$A^2 = I$$  For instance, take matrix $$ \begin{bmatrix} 1 & 0 \\ 0 & 0  \end{bmatrix}  $$  Also, if we take a linear operator $L:V \to V$, it is obvious that $Ker(L) \cap Im(L) = \{0\}$ ? Do I also need to prove that sum of kernel and image is direct sum?

If $ A^3=A$ prove that $Ker\left(A-I\right)+Im\left(A-I\right)=V$  I am not sure how to approach this problem, but first things first if we have $A^3=A$ that is $A^2=I$, what does that tell me (what does it imply) about $A$?  The only thing I can tell at this point is that $A$ is it's own inverse and if a matrice is invertible it has a full rank which implies that the dimension of the image space is $n$ and the dimension of the null-space aka kernel is zero. Thus we would have that $Im(A)+Ker(A)=V$, but subtracting $I$ confuses me here.  P.S. $A$ is the matrix representation of a linear operator and $V$ is the vector space for which the operator is defined.


Recently I had to factory reset my LG Stylo 3 running Android 7. Now the section in my settings that was "Developer Options" is no longer there. How can I get it back?

Cannot access Developer Options on Asus Zenphone 3 (Android 7.1.1):   Settings About Tap 6 times on Android Version   All I get is an 'N' on the screen:


Does anyone know how to prevent VS copying the .svn folders associated with subversion when publishing a web project?  I'm using Tortoise SVN and Ankh svn VS plugin.  Thanks

When publishing an asp.net web site in Visual Studio 2008, is there a way that I can force it to ignore the .svn folders in my local working copy so that my target folder does not end up with .svn files as part of the output.  Thanks,  Jason


I heard that the reason why we pay almost triple the price from a flight originating in the US is because the US charges over $700 in taxes on an international flight. How to avoid this?

I had planned for my wife, daughters and I to take a holiday from our home in China to the UK for a few weeks in July. Usually, when people visit us in China from the UK, the cost is around £450 to £500 for a return flight. Looking online, I can see that such tickets are available. However, when I looked at the flights from China to the UK the costs for return tickets were in the £850 to £1,000 range.  This seems unfair. Buying the same ticket on the same airplane results in vastly different prices depending on your origin. What justification is there for airlines to charge double the price for return flights from China to the UK and back as for the return flights from UK to China and back?  As it stands this will end our vacation plans as the cost has gone from an expensive £2000 trip for the family to an astronomical £4000 trip, equal to my entire years salary.


I would like to setup dual screens.  I've done multiple searches but there is nothing beginner-friendly for me to grasp exactly what I need to do to get the setup working.  I've picked up a few commands and here's what I have:  xrandr Screen 0: minimum 320 x 200, current 1920 x 1080, maximum 8192 x 8192 DVI-I-1 connected 1920x1080+0+0 (normal left inverted right x axis y axis) 476mm x 268mm    1920x1080      60.0*+    1680x1050      60.0      1280x1024      60.0      1440x900       59.9      1280x960       60.0      1152x864       75.0      1024x768       75.1     70.1     60.0      832x624        74.6      800x600        72.2     75.0     60.3     56.2      640x480        72.8     75.0     66.7     60.0      720x400        70.1   DP-1 disconnected (normal left inverted right x axis y axis) DP-2 disconnected (normal left inverted right x axis y axis)   I suspect I should see either one of the following connected since I have the second monitor plugged in correct?    DP-1 disconnected (normal left inverted right x axis y axis)   DP-2 disconnected (normal left inverted right x axis y axis)   I seem to have an NVIDIA graphics card as per the following:  lspci -nn | grep VGA 02:00.0 VGA compatible controller [0300]: NVIDIA Corporation GK107 [Quadro K2000] [10de:0ffe] (rev a1)   Some system information:  No LSB modules are available. Distributor ID: Debian Description:    Debian GNU/Linux 7.4 (wheezy) Release:    7.4 Codename:   wheezy   How to set this up for what I need to do next?

I am trying to setup a dual screen configuration on debian 8 jessie with Gnome.  My computer has 3 graphical outputs : 2 displayport and 1 HDMI. I can't manage to have two of this 3 outputs to work simultaneously.  output of xrandr is (with the other display on displayport):  xrandr: Failed to get size of gamma for output default Screen 0: minimum 1680 x 1050, current 1680 x 1050, maximum 1680 x 1050 default connected primary 1680x1050+0+0 0mm x 0mm 1680x1050      0.00* `   output of xrandr is (with hdmi working):  xrandr: Failed to get size of gamma for output default Screen 0: minimum 1920 x 1080, current 1920 x 1080, maximum 1920 x 1080 default connected primary 1920x1080+0+0 0mm x 0mm 1920x1080      0.00*   I also tried to use both displayport but it does not work either.  output of lshw -c videò:  *-display UNCLAIMED         description: VGA compatible controller    product: Intel Corporation    vendor: Intel Corporation    physical id: 2    bus info: pci@0000:00:02.0    version: 06    width: 64 bits    clock: 33MHz    capabilities: pciexpress msi pm vga_controller bus_master cap_list    configuration: latency=0    resources: memory:f6000000-f6ffffff memory:e0000000-efffffff  ioport:f000(size=64)   (with both screens connected via displayport)  output of lspci -v -s0:0:2.0  00:02.0 VGA compatible controller: Intel Corporation Device 1912 (rev 06) (prog-if 00 [VGA controller]) Subsystem: Dell Device 06b9 Flags: bus master, fast devsel, latency 0, IRQ 255 Memory at f6000000 (64-bit, non-prefetchable) [size=16M] Memory at e0000000 (64-bit, prefetchable) [size=256M] I/O ports at f000 [size=64] Expansion ROM at <unassigned> [disabled] Capabilities: <access denied>


This is a question relating to Wien's displacement law for the Planck function. As we all know frequency and wavelength are related to the speed of light by:   $$\nu\lambda=c$$  However, why is it that:   $$\nu_{\mathrm{peak}}\lambda_{\mathrm{peak}}\neq{c}$$  Any explanations would be very much appreciated.  To all of the people wanting to know where this statement came from. It hasn't come from anywhere specific, is it a well known fact of the Planck function. $\lambda_{\mathrm{peak}}=0.290T^{-1}$ cm K and $\nu_{\mathrm{peak}}=5.88\times{10^{10}}T$ Hz K$^{-1}$.

I am drawing a blank when it comes to equation transformation. Wikipedia  for the spectral radiance of black body:   First as a function of frequency $\nu$: $$I(\nu, T) = \frac{2 h \nu^3}{c^2}\cdot\frac{1}{e^\frac{h \nu}{k T} - 1}$$ Then as a function of wavelength $\lambda$ : $$I'(\lambda, T) = \frac{2hc^2}{\lambda^5}\cdot\frac{1}{e^\frac{h c}{\lambda k T}-1}$$   And I don't see how they get $\lambda^5$ term. I'm assuming that the transformation is just $\nu \rightarrow c/\lambda$, but that gives $$ \frac{2 h \nu^3}{c^2} \Rightarrow \frac{2 hc}{\lambda^3} \neq \frac{2hc^2}{\lambda^5} $$  Similar transformation happens at other parts in the article also. I'm obviously missing something, likely completely trivial.


In pandas I can search and replace all fields that contain the word fish, for example, using df.replace(r'.*fish.*', 'foo', regex = True).     But how do I search and replace all fields that don't contain the   word fish?   That is in my example replace all fields that don't contain the word fish with the word 'foo'.  For example, say the dataframe is  applefish pear water     afishfarm   I would like this to be transformed to  applefish foo foo       afishfarm

I know it's possible to match a word and then reverse the matches using other tools (e.g. grep -v). However, is it possible to match lines that do not contain a specific word, e.g. hede, using a regular expression?   Input:  hoho hihi haha hede   Code:  grep "<Regex for 'doesn't contain hede'>" input   Desired output:  hoho hihi haha


Isn't the contrapositive of 2 (Duff's test of failure) just 1? I can rephrase 2 below as 2.1. If the result didn't occur, would D regard himself as having failed (in his plan)? The logical contrapositive of 2.1 is 2.2. NOT(D regards himself as having failed) ⇒ NOT(the result didn't occur). = 2.3. D regarded himself as succeeding in plan ⇒ Result did occur. Doesn't 2.3 = 1 below?        But what is the ordinary meaning of intention? The courts have not told us because (presumably) they think it is obvious. [1] The widely accepted view is that the defendant intends a consequence of his action if he acts with the aim or purpose of producing that consequence. Lord Asquith in Cunliffe v Goodman13 explained that intention ‘connotes a state of affairs which the party intending . . . does more than merely contemplate: it connotes a state of affairs which, on the contrary, he decides, so far as in him lies, to bring about.’       It should be remembered that the jury will need to be persuaded beyond reasonable doubt that the defendant intended the result. In Haigh14 there was clear evidence that the defendant had smothered her child. However, there was no evidence as to how or in what circumstances she had done this. In such a case the Court of Appeal held the jury could not have been persuaded beyond reasonable doubt that the mother had intentionally killed the child. She could therefore be guilty of manslaughter, but not murder.       A useful test for seeing whether a result was the purpose of the defendant is to rely on Antony Duff’s test of failure:15 [2] had the result not occurred would the defendant regard himself as having failed in his plan?  Consider the following case. David throws a burning rag into Veronica’s house, wanting to frighten her by causing a fire. The rag in fact sets fire to the house and Veronica is killed. Here, had the rag not caused a fire and so Veronica had not been frightened, David would have regarded his enterprise as a failure. David therefore intended to cause the fire. However, had Veronica lived, David would not have regarded the enterprise as a failure (he wanted to frighten her, not kill her) and therefore he did not intend to kill Veronica.16  Herring, Criminal Law: Text, Cases, and Materials (2020 9 ed). p 131.

Isn't 2 (Duff's test of failure) just the contrapositive of 1?  I can rephrase 2 as  2.1. If the result didn't occur, would D regard himself as having failed in his plan?  The logical contrapositive of 2.1 is   2.2.  NOT(D regards himself as having failed in his plan) ⇒ NOT(the result didn't occur).  2.3. D regarded himself as succeeding in plan ⇒ Result did occur.    3. Does 2.3 change the author's example with Martin and Alfreda?  Doesn't Martin fail 2.3 too, just like how he fails Duff's test of failure?  Martin would regard himself succeeding in his plan (getting the inheritance), but the result (killing Alfreda) didn't occur.   Herring, . p. 127                But what is the ordinary meaning of intention? The courts have not told us because (presumably)   they think it is obvious. [1.] The widely accepted view is that the defendant ["D"] intends a   consequence of his action if he acts with the aim or purpose of producing that consequence.   Lord Asquith in Cunliffe v Goodman 12 explained that intention ‘connotes a state of affairs   which the party intending . . . does more than merely contemplate: it connotes a state of   affairs which, on the contrary, he decides, so far as in him lies, to bring about.’             It should be remembered that the jury will need to be persuaded beyond reasonable   doubt that the defendant intended the result. In Haigh 13 there was clear evidence that the   defendant had smothered her child. However, there was no evidence as to how or in what   circumstances she had done this. In such a case the Court of Appeal held the jury could not   have been persuaded beyond reasonable doubt that the mother had intentionally killed the   child. She could therefore be guilty of manslaughter, but not murder.             A useful test for seeing whether a result was the purpose of the defendant is to rely on   Antony Duff’s test of failure:14 [2.] had the result not occurred would the defendant regard   p. 128     himself as having failed in his plan? Consider the following case. David throws a burning   rag into Veronica’s house, wanting to frighten her by causing a fire. The rag in fact sets fire   to the house and Veronica is killed. Here, had the rag not caused a fire and so Veronica had   not been frightened, David would have regarded his enterprise as a failure. David therefore   intended to cause the fire. However, had Veronica lived, David would not have regarded the   enterprise as a failure (he wanted to frighten her, not kill her) and therefore he did not intend   to kill Veronica.15              Although Duff’s test is a very useful one there is one set of cases where it has to be treated   with caution. That is where a result is a means to achieve a desired end. Imagine Martin kills   his great aunt Alfreda in order to get his inheritance. The purpose of Martin’s action was to   get the inheritance. Using Duff’s test of failure we could say that Martin would be delighted   if Alfreda had lived, but he had somehow got hold of her money. However, it is generally   agreed that Martin would be said to intend his great aunt Alfreda’s death. This is because   under his plan the desired result (obtaining the inheritance) will be achieved through the   means of killing her. So when we consider the purpose of the defendant this includes not   only the aim, but also the means he wants to use to achieve that end.              To further clarify the core notion of intention, it is useful to distinguish it from other   concepts.


def recur(n):     print(n)     if n>1:         recur(n-1)   How can this be converted to just line. I can not find a way to use the logic as  recur = lambda x: print(x) if.......  I can not even use   func = lambda x: [print(i) for i in range(x,0,-1)]

A regular function can contain a call to itself in its definition, no problem.  I can't figure out how to do it with a lambda function though for the simple reason that the lambda function has no name to refer back to.  Is there a way to do it?  How?


today, on my Google Account, I saw that one of the last locations of my phone is from the USA when I live in Europe? Is it right?

I have a major problem that I hope someone can help with. On my Google Maps feature under my Location History it shows a location that I was never at at any point, but when my wife happened to see that location she doesn't believe me that the GPS could be wrong and pinpoint that location if I was never there.  I was first wondering myself how could that could be possible if I was never there or my phone was never at that location that was 35 miles away from me and second is there any way I could prove the GPS being wrong? Can I contact Google Maps and can they give an official printout of that certain day and every location I was? I really need to prove my honesty to her and hope there is a way.


I have the following code:  for (int i = 0; i < 10000; i++ ) {     list.Add(new Point(i, 3)); }  for (int i = 0; i < 10000; i++) {     list[i].X = 100; }  Point point = new Point(0, 1); point.X = 1; point.Y = 10;   When I try to change X or Y property of a newly created Point structure there is no problem:  Point point = new Point(0, 1); point.X = 1; point.Y = 10;   But when I'm trying to do the same in a loop  for (int i = 0; i < 10000; i++) {     list[i].X = 100; }   The compiler is telling me     Cannot modify the return value of   System.Collections.Generic.List<System.Windows.Point>.this[int]   because it is not a variable   Can anybody please explain me this.

I have a list of structs and I want to change one element. For example :  MyList.Add(new MyStruct("john"); MyList.Add(new MyStruct("peter");   Now I want to change one element:  MyList[1].Name = "bob"   However, whenever I try and do this I get the following error:     Cannot modify the return value of   System.Collections.Generic.List.this[int]‘ because it is not   a variable   If I use a list of classes, the problem doesn't occur.  I guess the answer has to do with structs being a value type.  So, if I have a list of structs should I treat them as read-only? If I need to change elements in a list then I should use classes and not structs?


I'm ranked as one of top 4% users of Data Science Stackexchange. I'm applying for a PhD program in related field.   Shall I mention my Stackexchange rank in my resume? If yes under what title?

Should I mention my Stack Overflow (and other Stack Exchange sites) reputation in my CV while applying for a post-graduate position?


How do we measure the age of the universe if time is relative to the observer? What is the reference frame we use to measure the age of the universe?

Many times I have read statements like, "the age of the universe is 14 billion years" . For example this wikipedia page .   Now, my question is, which observers' are these time intervals? According to whom 14 billion years?


How can I make agar.io skins? I don't remember how to make skins for agar.io. I want to make agar.io skins on the PC version with my friend.

I have noticed recently that people have their own skins. Not like the ones where you type in a specific nickname and it gives you a skin but where the people make their own. How do you do it?


So when i press control+option+b, there will appear so many weird files. And my question is that what are the functions of these files? Should i delete these files?

In addition to the .tex and .dvi or .pdf files, TeX/LaTeX/ConTeXt produces and uses lots of other files. What do they do? Which ones are used to create the document and which ones are automatically created by the compiler. What files can I safely delete?


I have this account, with 2 IDs google and myopenid. I have another at work with a stackexchange ID, and not much experience. I would like to join them, or if not just add the work ID to this account.   So I tried to add the work ID (stackexchange ID). But this logged me out of this account, and into the other.  How can I add the work ID to this account? How can I now add another stackexchange ID to this account?

I accidentally posted a question without being logged in. Is there a way to associate that question with my account?   For more information, visit "" in the .   a.k.a. How can you link a registered account to a cookie-based account? a.k.a. How do I merge an unregistered account with a registered account a.k.a. Merging users a.k.a. How do I associate anonymous questions I’ve asked with my registered account? a.k.a. Is there a way to claim an unregistered user? (in case anyone searches with those terms)


I understand bash as a window where I can type commands to linux. Reading the wikipedia, I've learned that there were various shell applications throughout the history. First, I understood bash as something where you type a command and get a response. Every time you typed something and pressed enter, it would respond with another line of text with the response. But it's more than that. You can actually create 'applications' inside bash. For example, there are the text editors nano and vim. So it looks that you can actually control some graphs inside the window.  Another example is this window that appears in the raspi-config command of the raspberry pi. This appears inside the putty window when I type this command. What is it? How do I make colorful and rectangular things appear inside bash?  I want to understand what's happening: where does bash runs inside linux? how does it communicate with the system? I'm young and therefore I have no insight on the history of terminals on computers, I don't know how all changed when GUIs appeared.

I think these terms almost refer to the same thing, when used loosely:   terminal shell tty console   What exactly does each of these terms refer to?


I was looking for the proof is this theorem, but I couldn't find it anywhere.  the theorem is stated formally:  If $f_m$ is a sequence of continuous functions defined on $D$ (subset of $R$) such that $f_m$$\to$$f$ uniformly on $D$ then $f$ is continuous.  can someone give the stepwise proof?

The uniform limit of Continuous Functions is continuous.   Proof Let $\varepsilon > 0$. There exists $N$ in natural numbers such that $n>N$ implies  $|f_n(x)-f(x)| < \frac{\varepsilon}{3}$ for all $x$ in $S$. In particular $|f_{N+1}(x)-f(x)| < \frac{\varepsilon}{3}$ for all $x$ in $S$. Since $f_{N+1}$ is continuous at $x_0$ there is a $\delta>0$ such that, $x$ in $S$ and $|x-x_0| < \delta$ imply $|f_{N+1}(x)-f_{N+1}(x_0)|< \frac{\varepsilon}{3}$ Now we conclude $x$ in $S$ and $|x-x_0| < \delta$ imply $|f(x)-f(x_0)|< 3 \cdot \frac{\varepsilon}{3} = \varepsilon$.  Can someone explain what is happening here? I don't follow it all.


Another homework problem from my Group Theory class.  Let $a,b$ be elements of a group, $G$.  Let $\operatorname{ord}(a)=m$ and $\operatorname{ord}(b)=n$. Let $a$ and $b$ commute. Prove: If $m$ and $n$ are relatively prime, then the $\operatorname{ord}(ab)=mn$.  So I am having trouble starting off on this problem.  Here is what I believe I know:  $a^m=e$ and $b^n=e$ [as defined by the order of the elements] which leads $a^m=b^n$  $\operatorname{ord}(ab)=mn=\operatorname{ord}(ba)=nm$ as defined by commuting.  $\gcd(m,n)=1$ as defined by $m,n$ being relatively prime.    I don't know how to start this proof. Do I want to to go the route of $a^mb^n=e$?  Then $(ab)^{mn}=e$?   Any tips to start this would be greatly appreciated!!!

Prove if $\operatorname{ord}(a)=m$, $\operatorname{ord}(b)=n$, and $\operatorname{gcd}(m,n)=1$, then $\operatorname{ord}(ab)=mn$.   I was reading this and was thinking how this proof would look like. I tried to do it and am not sure if this is correct. Here is what I did:  If $a$ and $b$ commute then $(ab)^{mn} = a^{mn} * b^{mn} = (a^m)^n * (b^n)^m = 1 * 1 = 1.$ So $ord(ab) | mn$.  Now, take $k = \operatorname{ord}(ab) = m^\prime * n^\prime$ where m' is relatively prime with $n$ and $n'$ is relatively prime with $m$. By the result above $m' | m$ and $n' | n$. Now we have $((ab)^k)^{m/m'} = 1$ since $(ab)^k=1$. But on the other hand, by the commutativity:  $$((ab)^k)^(m/m') =$$  $$((ab)^(m' * n'))^(m/m') =$$  $$ a^{n'm} * b^{n'm} = $$  $$(a^m)^{n'} * b^{n'm'}=$$  $$b^{n'm'} = 1$$  This implies that $n' * m'$ is divisible by $n$. But $m'$ is relatively prime with $n$, so we must have $n' = n.$ By symmetry, $m' = m$. So $ord(ab) = mn$.  Just to say this again, I want to prove if $a$ and $b$ commute and $m$ and $n$ are relatively prime then   $$ord(ab)=mn.$$   The comments are vague. I guess this must be the answer then and there probably is not another way to do this.


How can I make a bootable partition for Ubuntu on Mac? UNetBootIn just hangs.

If you select "USB" and "Mac" on , it gives a series of command line instructions to make a USB key which the MacBook will boot into Ubuntu from.  I've followed them to the letter two or three times on different USB keys, and it doesn't work. There's a very great deal of technical discussion about EFI etc. but this set of instructions seems to suggest it should just work, but it doesn't.  Help? I'm increasingly unhappy with the more locked-down approach Apple is taking, and I'd quite like to start using Linux with a view to transitioning over to using it as my main operating system, but booting from the CD takes forever, runs slowly and I'm really hoping to get it moving off USB.  Can anybody help me?


When we project an object vertically upwards its velocity at maximum height consider to be zero but still, it has acceleration due to gravity i.e $9.8\mathrm{m/s^2}$. But mathematically we know that acceleration is the first derivative of velocity with respect to time $(a=dv/dt)$. So mathematically if velocity is zero there can not be any acceleration but this case contradict this equation. We can not even say that its direction is changing as the direction has no meaning without magnitude. So how this situation can be explained mathematically?

When I shoot a ball vertically upward, its velocity is decreasing since  there is a downward acceleration of about $9.8\,\mathrm{ms}^{-2}$.   I have read that at the top most point, when $v = 0$, the acceleration is still $9.8\,\mathrm{ms}^{-2}$ in the downward direction where $v=0$. That is, the acceleration is still the same.  But at the highest point, the ball is stationary, so it is not even moving. How can it accelerate?


I am reading the code that involves some bitwise operations as shown below:  unsigned char data = 0; unsigned char status = 0;  //DAQmx functions for reading data DAQmxReadDigitalLines(taskHandleIn,1,10.0,DAQmx_Val_GroupByChannel,dataIn,8,&read,&bytesPerSamp,NULL); DAQmxReadDigitalLines(taskHandleOut,1,10.0,DAQmx_Val_GroupByChannel,dataOutRead,8,&read,&bytesPerSamp,NULL);   for (int i = 0; i < 8; i++) {     if (dataOutRead[i] == 1)         data = data | (0x01 << i);     else         data = data & ~(0x01 << i); }  for (int i = 0; i < 4; i++) {     if (dataIn[i] == 1)         status = status | (0x01 << (7 - i));     else         status = status & ~(0x01 << (7 - i)); } ctrl = 0;   In the above codes, dataOutRead and dataIn are both uInt8 8-element arrays originally initialized to zero.  I don't quite understand what the code is actually doing? Anyone can walk me through these codes?

How do you set, clear, and toggle a bit?


rn im working on a retro N64/PSX/Dreamcast 3D character model for my fan JJBA Stand ability and I wanted to use a technique where plane objects always face the camera like the bob-ombs on SM64, does anyone knows how to achieve this?

How can I make a plane always look at camera? Like in old videogames, like Doom or Wolfenstein, this kind of software used static images that always looked at the camera, is this possible to make on Blender Cycles?


how can i achieve that braces are on both sides, so in the beginning and the end of each cases environment? I Think this looks better than now.  \documentclass[12pt]{article}  % This first part of the file is called the PREAMBLE. It includes % customizations and command definitions. The preamble is everything % between \documentclass and \begin{document}.  \usepackage[margin=1in]{geometry}  % set the margins to 1in on all sides \usepackage{graphicx}              % to include figures \usepackage{amsmath}               % great math stuff \usepackage{amsfonts}              % for blackboard bold, etc \usepackage{amsthm}                % better theorem environments  \newtheorem{thm}{Theorem}[section]  \begin{document}  \begin{thm}  There is \begin{cases} test1 \\  test2 \end{cases} if \begin{cases} condo \\  condo \end{cases} to do.  \end{thm}  \end{document}

Is there any way to add braces around a system of equations? Say I want to add braces around:  a=x+2y+3z  b=6x+y+2z  c=5x+3y+z  The best example I could find of how I want the braces to look is the "2d,3d,4th,5th,6th" thing here:    In other words, they need to be curly braces and appear on both sides. They also need to enclose the whole system.  Thanks!


The following plain java code is calling some web service API:  String url = "https://my_web_service/some_function?password=my_password"; InputStream is = new URL(url).openStream(); BufferedReader rd = new BufferedReader(new InputStreamReader(is, Charset.forName("UTF-8"))); String result = readAll(rd);  //result is also sensitive data!   Does it's a safe way to transmit & get sensitive data? Assuming arguments like this not relevant:     "SSL is secure, but remember that any encryption can be broken if given enough time..."   Thanks,

I am creating a secure web based API that uses HTTPS; however, if I allow the users to configure it (include sending password) using a query string will this also be secure or should I force it to be done via a POST?