1-Are Pseudogenes and Junk DNA both Non-Coding DNA or they are different entity? How much Pseudogenes & Junk DNA do we have respectively?   2-I read that Non-Coding DNA has functions, my question is-since we have 98.5% NON-CODING DNA, how much of them has been found to be functional?

In January 2012, David Icke published a book (ISBN: 9780955997334) entitled “Remember where you are and where you come from” in which he challenged what he claimed to be the view of mainstream science that 90–97% of the human genome was , serving no function. He implied, instead, that it must have a function, but that this was unknown.  Is it still true that we do not know what all this DNA does? I see that we consider this DNA to be non-coding, but does that mean it is “junk”? I find it hard to believe that it can serve no function, otherwise why would the DNA be there? Is it possible that it is used for things we don't yet understand?


I have come across a problem in an elementary mathematics book that I am seeking help with. The problem states : "Given $m,n \in \mathbb{N}$, with $m > 1$, prove that there exist unique nonnegative integers $k,a_{0},a_{1},...,a_{k}$ s.t. $0 \leq a_{i} < m$ for $0 \leq i \leq k$, $a_{k} \neq 0$ and : \begin{equation} n = a_{k} m^{k} + a_{k-1}m^{k-1} + \dots + a_{2}m^{2} + a_{1}m + a_{0} \end{equation} In this case, we write $n = (a_{k}a_{k-1}...a_{1}a_{0})_{m}$ and say that the right hand side above is the representation of $n$ in base $m$ or the m-adic representation of $n$." Can anyone help with an explained solution to this ? This is on a chapter on mathematical induction.

Base-b Representation of an Integer: Why can I make the assumption about number of terms in expansions in uniqueness part?   Reading the book of Koshy I have come across the below theorem. It states that I can write any integer $N$ in a base $b\ge2$ representation $N=a_kb^k+...+a_1b+a_0$ such that $0\le a_i<b$, $a_k \neq 0$ for some $k\ge0$.  In the uniqueness part, why can I assume the expansions contains the same number of terms ? I must prove that all expansions of $N$ equal the one in the theorem, but if I add terms to the expansion by zero coefficients, well, then the expansion is not in the proper form anymore ? (the greatest term in the expansion is $0$ if I add zero coefficients) .  Can someone help clear this out ?     Why can I assume the expansions contain the same number of terms ? If I add terms to the expansion, well then I've violated the form of the expansion ?


This is my code. I was observing  data type of args in def function.  >>> def example(a,b=None,*args,**kwargs): ...   print a, b ...   print args ...   print kwargs ... >>> example(1,"var",2,3,word="hello") 1 var (2, 3) {'word': 'hello'} >>> _args = (1,2,3,4,5) >>> _kwargs = {"1":1,"2":2,"3":3} >>> example(1,"var",*_args,**_kwargs) 1 var (1, 2, 3, 4, 5) {'1': 1, '3': 3, '2': 2}   When the 2, 3 of actual parameters (arguments) to a function pass as *arg of formal parameters; thus, arguments are passed using call by value (where the value is always an object reference, not the value of the object).   *args in the call expands each element in my sequence (be it tuple or list) into separate parameters. Those separate parameters are then captured again into the *args argument, why is it always a tuple?

In the following method definitions, what does the * and ** do for param2?  def foo(param1, *param2): def bar(param1, **param2):


Question  Are there any downsides, or side-effects to paying off the remaining balance of a home mortgage with the help of an unsecured loan owed to a relative?  Are there legal considerations that need to be addressed?  Tax implications?    Risks?  I have done some searching, but most of what I have found is that it is considered a bad idea to refinance a mortgage to pay off unsecured debt.  I'm trying to do the opposite.  I did find this link  but in that question, the personal loan seems to be from a bank with a possibly higher interest rate and seeks ways to get out of what seems to be a difficult situation.  Background  I currently have a 15 year fixed rate (3.0%) mortgage on a house in the US.  The starting balance was $270k.  We have been paying extra on it, and it currently has a remaining balance of $60k.  We have no other debts.  I have $40k in cash.  My relative has $20k in cash, and has offered it as a personal loan at 0% interest.  Combined, these are sufficient to pay off the mortgage completely.  From the point of view of the mortgage processor, I would own the property.  The relative and I are discussing writing a gentleman's contract for the terms of repayment (speed, amounts, frequency, etc..), and what happens in various what-if scenarios.  The relative has stated that they do not want any collateral.  The spouse and I are both working, and are currently on track to pay off the mortgage in less than a year without this help.  Taking this offer would accelerate that plan considerably.  From my point of view, this seems like a really good deal for me, and a generous blessing from the relative.  What am I missing?  Update1  Thank you all for the items to consider.  The Tale of Woe is an apt component that I had been contemplating, and is a big negative for this deal. This link  is similar in that the source of some of the payoff is a unsecured loan from family.  These questions are similar in that regard.  With that said, my question is more around the implications of converting a secured loan into an unsecured one - shifting the risk.  The comment about the IRS minimum interest rate (before which a loan is considered a gift) is definitely a new one on me.  While it isn't a deal breaker, it does mean a slightly more complex tax return for me and the relative.

Together my wife and I have about $80,000 in student loans. My mother in law is in the process of selling her house. We proposed the idea of borrowing ~$50000 from her, once she sells, so that we could pay off our loans with higher rates. We offered to pay her back with an interest rate of 5%. Our idea was that we would be able to pay off all of the loans with a rate over 5%, and she would get a (nearly*) guaranteed 5% return rate.  Does this plan make sense to all parties involved?  Loan amounts  and rates (from a couple of months ago, may update when I have more time):  $10,541.19      8.63% $16,966.98      8.38% $ 6,423.44      6.55% $ 6,341.26      6.55% $14,715.64      6.50% $ 7,107.64      4.41% $ 2,126.34      4.25% $ 3,637.38      3.61% $ 3,438.88      3.61% $ 2,779.82      3.61% $ 4,131.47      3.15% $ 3,482.91      3.15% $   697.95      3.15%   Some other relevant information:   We've already bought a house  We own both our vehicles (actually have a third we need to sell) We're currently bringing in a little more each month than our monthly expenses, but can (and probably will) cut back in certain areas to have extra to pay off loans with even faster   * I only say nearly as you never know what could happen, but we have every intention of paying it all back at that rate.


I have a customer looking for a short story from around the 1970's(?) about a young man who is transported to a place where all the lost things like socks are. Possibly called "Someplace Else" (though I haven't had much luck looking with that title)? His uncle may show up there after going missing?  Sorry I don't have more to go on but that's all she remembers.

I've read this book about 15 years ago, but I think it's older than that.  In the story people use some sort consciousness transfer technology to travel to distant solar systems. So basically an alien from planet A would want to visit Earth, and you would like to visit the planet A, by mutual agreement you'd transfer your mind into the alien's body and alien's mind would be transferred into your body.  So the main character decides to travel and swaps bodies with an alien. However, he/she isn't able to return back to his/her own body and instead is transferred to another alien's body and so on. As the story progresses the protagonist jumps from body to body until he/she slowly loses his/her own identity.  Also the story is written in a funny/light tone.   I've read this story in Russian but I am sure that it was translated. The story was a part of collection of short sci-fi stories.


Prove that any graph G with an even number of vertices has two vertices with an even number of common neighbors

By contradiction. Suppose that any two vertices have an odd number of common neighbors. For an arbitrary vertex $v$, look at the subgraph induced by the neighbors of $v$. All degrees in this subgraph are odd(why all degrees are odd here?),   and hence the degree of $v$ is even(it is even because of the handshaking theorem?).   Let us count walks of length $2$ beginning at $v$. Their total number is even (because every vertex has an even degree). At the same time, an odd number of these walks come back to $v$, but any other vertex is reached by an odd number of walks, and hence the number of vertices distinct from $v$ must be even—a contradiction.  Please help me visualize this hint from my textbook.


Task at hand:  Show that in the Cantor Intersection Theorem, "compact" cannot be replased by "closed"; that is, find a nested sequence $\{F_n\}_{n=1}^\infty$ of nonempty closed sets in C such that $$\bigcap_{n=1}^\infty F_n=\varnothing $$  I know the difference between compact and closed but I am trying to find a nested sequence that meets the criteria but I can not seem to understand what is going on.

Give an example to show that Cantor's Intersection Theorem would not be true if compact sets were replaced by closed sets.    Compact set is closed and bounded, so what I'm going to find is something that is closed but not bounded.  By the Cantor theorem, which says that a decreasing sequence of non-empty compact subset will have a non-empty intersection.  What I was trying to approach is how two sets just "touched" and as if they have not bounded, two sets "touched" nothing. But I cant give an example for that


Could someone share a piece of code that will stop working after the critical update "Prevent Creation of Function Expressions in Dynamically Created Aura Components" will be activated?  I'm not quite sure what is being banned here. Passing inline code has never worked and passing references like this seems to work fine:  $A.createComponent(         "ui:inputText",                 { "change": component.getReference("c.handleChange")},                 function(newCmp, status, errorMessage) {}         );

i just observed  release notes, and in my org critical updates area, we r using $A.createComponent()/ $A.createComponents() in bunch of our custom lightning cmps's. still i am not under stand how this critical updates 'll effects of our orgs, can you please explain how it'll effects for below code snippet.  we r using simple like below:  cmpcontroller.js  opencustomcmpmodal: function(component,field1,field2,field3){  var attributes = {    'chldfield1': field1,    'chldfield2': field2,    'chldfield3': field3 };      $A.createComponents(                 [                     ["aura:html", {                         "tag": "h2",                         "body": 'Modal header',                         "HTMLAttributes": {                              "class": "slds-text-heading_medium slds-hyphenate"                          }                     }],                     ["c:mycustomcomponent",attributes]                 ],             function(components, status) {                 if (status === "SUCCESS") {                     modalheader = components[0];                     modalBody = components[1];                    var promiseaction =  component.find('overlayLib').showCustomModal({                        header:modalheader,                         body: modalBody,                         showCloseButton: true,                         cssClass: "my-modal,my-custom-class,my-other-class"                     });                     component.set("v.modalPromise",promiseaction);                 }             }); }


Does exist a combinatorial proof for the following two identities ?    $\sum_{k = 0}^{n}  \binom{x+k}{k} = \binom{x+n+1}{n}$ $\sum_{k = 0}^{n}  k\binom{n}{k} = n2^{n-1}$    I know how to derive the identites from $(1+x)^n$ , but I am searching for a combinatorial proof ?

I have to prove that:     $$\sum_{k=0}^{n} {{m+k} \choose{m}} = { m+n+1 \choose m+1 }$$   I tried to open up the right side with Pascal's definition that: $$ { n \choose k} = {n-1 \choose {k}} + {n-1 \choose {k-1}}$$  Here is what I came up with, and I am sure it is wrong because it does not equal the left side:  $$ {m+n+1 \choose m+1} = {m+n \choose m+1} + {m+n \choose m} = ... ={m+n \choose m+1} + {m+n-1 \choose m} + {m+n-2 \choose m-1} + ... + {m \choose m+1} = \sum_{k=0}^{n} {m+k \choose m+k-n+1 }  $$  Which, again, probably is wrong because it is not equal $\sum_{k=0}^{n} { m+k \choose m}$. Any help is appreciated


I have a bash script that is located in one of my PATH locations. When I run the script it ends with a cd /some/location but since the script is run in its own subproccess it doesn't change the location in the shell.  I know I can run the script using . ./the/script.bash and can even set that up as an alias but I would like to know if there is a way to get a command run from a script in my PATH to execute in the current shell.  --EDIT--  Apparently there was some confusion about my initial question so let me give an exact example.  I have a script called windows located at ~/bin/ and my .profile adds /home/$USER/bin to my PATH environment variable. The script windows mounts my windows partition (I dual boot) and then changed directories to the home file on my windows partition. The script looks like this:  #!/bin/sh  mount_point="/media/$USER/windows" if ! grep -q "[[:space:]]$mount_point[[:space:]]" /proc/mounts; then     sudo mount -t ntfs /dev/nvme0n1p3 "$mount_point" fi cd "$mount_point"/Users/Justin   So now when when I type the command windows into my terminal it runs this script, but since the script is not run in the current shell the cd does not change my current shells directory.  My question was is there a way to make this run in my current shell (so that when I run the command windows it changes my directory) without using an alias to call the script preceeded by a .

I just want to write a script which changes my directory.  I put the below commands in the file /home/alex/pathABC  #!/bin/sh cd /home/alex/Documents/A/B/C echo HelloWorld   I did   chmod +x pathABC   In the Terminal, while in /home/alex, I ran ./pathABC, but the output is just HelloWorld and the current directory is not changed.  So what is wrong?


Thank you in advance for your help with this matter! I've been struggling with the VFS website for days!  So I created separate applications on the website for me, my husband, and my daughter. Then I was asked to register at VFS. Unfortunately, I registered my daughter's application before I create the family application. As a result, there is no way I can add her to the family "bundle." When I purchased the round-trip courier service, only my husband's and my GWF numbers are there. Can I still use the shipping labels for all three of us? The three of us will go for the biometrics appointments together, and the labels themselves do not show GWFs. Thanks!!

I am a permanent resident of USA. I am making a trip to India but planning a stop-over in London,UK for a week. For this stop-over , I am applying for a standard visitor visa. My biometric appointment has already been completed. Now I have to send applications for the visa for both me and my wife.  1.) Should I send both applications in same envelope? Maybe, put each application in small envelope and then put both applications in a bigger envelope?  2.) Should I put my financial documents (Bank statements , Pay Slips) in both applications(i.e. mine and my wife's)?  3.) I have an old passport which is expired. Is there any need to send this passport as well with my application?  Thanks!


There is a helpful summary of one's flags just to the right of one's flagging summary:  Your flagging history  1024 moderator attention flags 1023 deemed helpful    1 declined  512 disputed  128 posts marked spam  64 deemed helpful   32 posts marked offensive  4096 comments flagged   32 deemed helpful   32 declined   I'd really like each of the "declined" and "disputed" to be hyperlinked to a filtered list of exactly the flags I cast that our moderators didn't find helpful, so that I can more readily learn from my mistakes.   means I've got skim through the list and look for the lines that don't say "helpful" among 14 pages of flags. (Your pages may vary.)

Here is my flagging summary on SU:   Your flagging history   32 posts flagged as requiring moderator attention    2 are waiting for review   3 were marked valid   1 were marked invalid   (older flags were not recorded valid/invalid)    2 posts marked as spam    It is too complicated to look for invalid flags. Would it be possible to make filters on the top of the page (like on favorites for example) with:  By date, By type (off-topic, spam, dupes), By status (accepted, pending, rejected)  It would make it easier for reviewers to check their flagging and eventually know what to improve on.  Or is there another easy way to audit this?


I recently built a new Ubuntu 19 desktop.  After about two weeks, this started to happen when I tried to update:  shaman@shamanzUBUNTU1:~/Desktop$ sudo apt-get update [sudo] password for shaman:  Ign:1 http://dl.google.com/linux/chrome/deb stable InRelease Ign:2 http://dl.google.com/linux/earth/deb stable InRelease Hit:3 http://dl.google.com/linux/chrome/deb stable Release Hit:4 http://dl.google.com/linux/earth/deb stable Release Reading package lists... Error! N: Skipping acquire of configured file 'main/binary-i386/Packages' as repository 'http://dl.google.com/linux/earth/deb stable InRelease' doesn't support architecture 'i386' W: Unknown Multi-Arch type '' for package 'bubblewrap' E: Problem parsing dependency 2 E: Error occurred while processing bubblewrap (NewVersion2) E: Problem with MergeList /var/lib/dpkg/status E: The package lists or status file could not be parsed or opened.   Clicking on Software and Updates just gets me a spinning wheel and then nothing.   What's this Bubblewrap thing and how do I get rid of it?  I'm pretty well screwed on updates until I figure this out.

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


I want this  This is my screen. version is 2.90.1 What's wrong with the array modifier?

We know that the there is an Object Offset option for Array modifier, but when trying to make a circular array with that offset object as the center of the array circle, it always doesn't behave quite like what's expected. So how to make a nice and controllable circular array?  P.S.: There is an old  about moving the object's origin. I wonder if there is any way to do this without changing the location of the origin. :)


I would like to show the borders of the areas of a given ASCII DTM file for which there is data. This problem has been discussed  previously but the recommended solution, the , is now considered deprecated. Furthermore, I need to be able to script it, so using the GDAL tools from the command line is probably a better plan for me.   I also have an additional restriction: I need to be able to serve this file on GeoServer, and ultimately display it using Leaflet, so a shapefile or GeoJSON could be good choices for the file format of the final output.  What command should I use?

I need to create the polygon outlines of several single layer raster images, not the extent/bounding box, but the area without the nodata values, as shown here: .  In the answer to the question above, the Image Boundary plugin was mentioned, however, I don't find it in the QGIS 1.8.0 Lisboa, running on Ubuntu.   Is the tool still available?  If not, is there a way to do this using opensource tools, either gdal, R, QGIS, GRASS, or similar, not with ArcMap?


Is there an all-day metro pass in London?  For example in Tokyo, Japan there's an  and there's  in Cologne, Germany.  Does London also have something similar? I have heard of Oyster, but it's pay as you go, and usually those all-day or all-month passes have greater value. I will be traveling extensively by metro and tram and perhaps also buses.

We are 2 families, 4 adults and 4 kids (age 8, 11, 13, and 16) reaching at LHR  airport from USA.  Which will better economically save money and time to purchase, Oyster Card or London pass with travelcard?  We'll be able to spend half a day in London on June 1st, all day on June 4th and most of the day on June 5th.


I want to make a traffic light circuit but the problem is that I don't have a 0.1µF capacitor.  I do have a 1µF capacitor, would it be OK to replace it?  The circuit diagram I am using is shown below and is taken from an :

I've bought a broken receiver recently and I need to swap out a few of the capacitors.  the original capacitor is rated at 100v and 0.01uf. The local electronic store sells 100v 3.3uf capacitors. Would I be able to swap these two, or would the different in uf make them not work with the rest of the system?


Which is the best Ubuntu for Intel Atom powered notebooks? I have already tried 13.04 but that did not work. please help.

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


A book by the name of  teaches the following method for differentiating $x^2$ with respect to $x$: Take the equation: $$y=x^2$$ The author reasons that increasing both $x$ and $y$ by a differential amount preserves equality, so: $$y+dy=(x+dx)^2$$ Expanding the right-hand side gives: $$y+dy=x^2+2xdx+dx^2$$ Subtract off the original $y=x^2$: $$dy=2xdx+dx^2$$ The author reasons that an infinitesimal change in $x$ multiplied by an infinitesimal change in $x$ is so small to be effectively zero, so any powers of $dx$ higher than $1$ are dropped: $$dy=2xdx$$ Then, dividing both sides by $dx$: $${dy \over dx}=2x$$ This is nothing like the methods I've been taught for finding a derivative (which I understand to be the limit of the difference quotient), but it at least appears to work for polynomial functions. Is this a valid method that I'm not aware of? If so, how would you use this to differentiate more complex functions like sine and cosine?

I am reading in a book about differentiating, but I am confused with one of the steps he takes.  We start with:  $$ \begin{align} y &= x^{2} \\ y + \mathrm{d}y &= (x + \mathrm{d}x)^2 \\ y + \mathrm{d}y &= x^2 + x\mathrm{d}x + x\mathrm{d}x + (\mathrm{d}x^2) \end{align} $$  Now the author simplifies this to:  $$y + dy = x^2 + 2x\mathrm{d}x + (\mathrm{d}x^2)$$  I dislike how the middle term is simplified to $2x\mathrm{d}x$ instead of $2(x\mathrm{d}x)$, as I feel like it is more intuitive on what is going.  As in, $2$ of the term $x\mathrm{d}x$, instead of $2x\mathrm{d}x$.  But I fear writing it as $2(x\mathrm{d}x)$ may result in an incorrect distributive property.  Next, he omits the $(dx^2)$:  $$y + \mathrm{d}y = x^2 + 2x \mathrm{d}x$$  Subtract the original $y = x^2$:  $$\mathrm{d}y = 2x \mathrm{d}x$$  Now here is where I get confused:  $$\frac{\mathrm{d}y}{\mathrm{d}x} = 2x$$  How can he just divide both sides by $\mathrm{d}x$!?  If the original term was $2$ of $x\mathrm{d}x$, wouldn't it have to be written out as $2x * 2\mathrm{d}x$, and thus divide both sides by $2\mathrm{d}x$ instead?  I think the root of my confusion is how to properly simplify: $$x\mathrm{d}x + x\mathrm{d}x$$  I trust that he is right, but I am looking for an explanation of why his simplification can work, and why $2(x\mathrm{d}x)$ would be incorrect!  Thank you!


First post here, please forgive me if wrong community...  By "opposite role", I mean like parent/child, brother/sister.  In organ transplants, the "opposite role" of donor would be recipient. But I'm referring to crowd funding, where the "opposite role" of donor is the person who created the crowd funding campaign that the donor is donating to. They are more than just a recipient, they create and manage their fund raising campaign. gofundme uses the term "campaign organizer" but I'm looking for a single word.  And BTW, what is the correct term for "opposite role"? It's not antonym or "opposite word", because it's not really an opposite relationship.  EDIT  The best word for the reciprocal of donor in the context of crowd funding is fundraiser.  It's not a duplicate question because in this context which is more specific, we get a different answer. And the best answer for the word for "opposite role" is reciprocal (noun). (e.g., What is the reciprocal of parent? Answer: child)

Synonym for a supportee (Which doesn't seem to be a word)?  I created products that retail and we sell them and give the proceeds to charities. Trying to figure out a single word to use as a page title for those that we support were we can list the charities (With their permission of course).  Thanks


I found that some of the software downloaded by "apt-get" is now out of date. I compiled the new versions into .deb packages. Now, how can I add them into the software center or archive.ubuntu.com? I just want to make everyone convenient.

As a developer of free software, I want to get my application into Ubuntu.  Should I provide a source tarball and ask for packaging? Or should I create a package myself? Should I target Ubuntu directly, or should I try to get into Debian and then into Ubuntu automatically?


I have two languages:   $\{a^n b^m \mid n, m > 0, n - m = 0 \pmod 3\}$ $\{a^n b^m \mid n, m > 0, n + m = 0 \pmod 3\}$   and I'm having trouble drawing automata for them.  For the first language, I know that the first valid pairs are ab | aabb | aaaab | aaabbb, but I'm having trouble drawing that and putting it into a general automaton.  I know the for the second language, S ← abb|aab|aaabbb are the first valid pairs, but I again don't know how to put it into a general automaton.  q1:

I'm trying to draw two automata for these two languages:   For the first one, I know that the minimum is n = 1, m = 1, but I'm having troubles drawing a NFA for it.  The second one the minimum is n = 2, m = 1, but I still don't know how to start the NFA.  I have this for q2:


If $f \in\mathcal D′(\Bbb R^n)$, is a distribution and support of this   distribution is a set of finite points in $\Bbb R^n$. Can anyone tell   me that what will be the general form of this distribution?   I will appreciate if you can give any insight or idea about it.

Let $u$ be a distribution on $\mathbb{R}^n$ with support = $\left\{0\right\}$. Then there exists $N$ such that $u$ has order $N$. Let $\chi\in C_0^{\infty}(\mathbb{R}^n)$ a smooth function with  $\chi(x) = 1$ for $0\leq |x|\leq 1 $,   $\chi(x)\in [0,1]$ for $1\leq |x|\leq 2$,  $\chi(x)=0$ for $|x|\geq 2$  Denote $ \chi(x/r) = k_r(x)$ for $r\in (0,1]$. For the case $N=0$ I want to show that there exists $c_1$ such that $$|\left\langle u,\phi \right\rangle|\leq c_1 |\phi(0)|  $$ for all $\phi \in C_0^{\infty}(\mathbb{R}^n)$. The idea would be to apply $u$ on $\phi = k_r\phi+(1-k_r)\phi$ and letting $r\to 0$.   So then I guess we can write $$ |\left\langle u,\phi \right\rangle| \leq |\left\langle u,k_r\phi \right\rangle| + |\left\langle u,(1-k_r)\phi \right\rangle |$$ But not really sure how this follows...  Moreover how can i show that $\left\langle u,\phi \right\rangle = \left\langle u,\phi \chi\right\rangle = \left\langle u,\chi\right\rangle\phi(0) $?


I wrote a model with a model-only tool (Calculate Value) as the first step. While running the model in single time, it works fine. But while run in batch mode, it yields silly results. I checked the log (messages) of the batch processing and found that the Calculate Value ran only once while the rest of the model run multiple times. I confirmed Calculate Value running only once is the cause of the silly results. Does this mean the model-only tool (Calculate Value) can only run once in batch mode? Is there any way to fix it?

Am I correct that if my model has a model-only tool (Calculate Value), and then I run the model as a batched process, it will not run the Calculate Value expression?   I wrote a model to upload, define, project (and clip) XY data from excel files. I had thought to use iterate tables, but it wasn't working. (I assume due to having to choose which worksheet within xlxs). So I thought to do a batch, but this seems to leave that annoying $ that arc appends to table names (and is an invalid character in most tools...)  My guess is that the Calculate value that removes my $ is not being run in the batch. Ideas? Confirmations?


A vector space is a set V along with an addition on V and a scalar multiplication on V such that the following properties hold, according to S. Axler's Linear Algebra Done Right:  Commutativity Associativity Existence of additive identity Existence of additive inverse Multiplicative identity Distributive Properties  Now, by definition, an addition of two elements in the set V should also be a member of V. Using that fact, and (4) from the list above, shouldn't (3) be provable? Note: A few more moments of thought made me question my statement. What is $0$? Unless (3) is taken, does (4) make any sense? Am I on the right track? Also, S. Axler says, about subspaces, that they have to satisfy three conditions for them to be considered a subspace (excluding the condition that they have to be a subset of a vector space, which would ensure that the other properties (distributive, commutative) are satisfied $\forall v \space \epsilon\space Subspace$).  $0 \space\epsilon\space Subspace$ Scalar multiplication is closed. Addition is closed.  In addition to this, he also says we can replace (1) here with a similar condition:  The subspace is non-empty.  He says that since scalar multiplication is closed within the subspace, and that $0v = 0$ (the proof of this involves the additive inverse axiom and the fact that the "Zero" produced by the inverse CAN be added to a vector from $V$; Does this zero have to exist within $V$ for us to define "addition" between this zero and a vector from $V$?) for any $v\space\epsilon\space Subspace$, this would imply that $0\space \epsilon \space Subspace$. So here, is this replacement possible only because (3) from the vector space axioms defines "zero"? Note: I tried my best to organize my thoughts and questions, but something seems amiss. I know my questions aren't sequential and coherent but I am struggling to understand which part of this is the head and which one's the tail.

I mean if there is any construction that satisfies all the conditions for an vectorial space except it lacks an identity element? This questions was posed to me by a classmate last semester and I have been puzzling over it since then.


I am planning on putting ubuntu on my gaming rig. Right now I have a 240 GB SSD with Windows 10 installed and a 4TB HDD for storage of my Steam library. I would like to come back from the dark side and replace Windows with Ubuntu. Dose anyone have any recommendations on a prtitopning sceem that would allow me to put ubuntu on my SSD and my games and files on my HDD

I have an SSD with 64 GB and a 6 GB/s 1 Terabyte hard drive. I want to use the SSD only as a boot device and maybe for swap storage. On the 1 Terabyte hard drive, I want to have the main file system. As in Windows, I liked to have at least 2-3 Partitions example for music games programs and so on. Which partition layout do you recommend to me?


Suppose I have a 20d distribution, and i'm using MH to simulate 1024 draws from that 20d distribution, how many samples are burn ins?

I was wondering if there is a principled way to figure out how many samples to discard during the MH-MCMC burn-in stage. So, as I understand it, the initial samples can introduce bias in the computation of expectation in the estimated posterior distribution especially if they are really far from the mean.   I was wondering, say I do a MAP estimation and try to find some local mode of the distribution to initialise my MH-MCMC. Would that mean I do not have to do the burn in (assuming this mode is in some high density region of the distribution)?


How can I find the fundamental solution to the following PDE in $R^3$: $$-\Delta + 1 = 0$$. So far I have that $\hat{u} = \frac{1}{1-|s|^2}$, but how can i get the inverse FT in 3D. Any help is appreciated.

The fundamental solution of the Helmholtz equation in $\mathbb{R}^3$ $$(\Delta+k^2)u=-\delta \tag{1}$$ is well known:  $$u(x)=\frac{e^{\pm ik|x|}}{4\pi |x|}$$ solves the Helmholtz equation in distributional sense. The usual ansatz to obtain fundamental solutions is to Fourier transform both sides. Then $(1)$ becomes $$(-|x|^2+k^2)\hat{u}(x)=-1 \implies \hat{u}(x)=\frac{1}{k^2-|x|^2}.$$ The problem now arises is that we want to inverse Fourier transform $\hat{u}$ to obtain the solution. But $\hat{u}$ has singularities on the sphere of radius $k$.  How do we proceed in a rigorous distributional way to obtain the above fundamental solution? What do people usually do and is there any book about such problems?


I'm fairly new to smart pointer usage, and want to make sure I'm not introducing bad habits. I have an object A that is being created from a factory, and added to a queue. This queue is then read from another thread, and at this point I think it's perfectly valid to use a unique_ptr.   struct IInterface {  }  class A : public IInterface {  }  std::queue<std::unique_ptr<A>> queue;   However, while constructing A I realize I need a Class C. C takes a List of B's that it owns.  class A : public IInterface {     C c; }  class B { }  class C {     List<unqiue_ptr<B>> b; }   To me this still looks okay because we have ownership defined. However, I'm unsure of what pointer needs to be used when Class B now needs a pointer to IInterface, which A happens to implement. Do I make it a shared_ptr?  struct IInterface {  }  class A : public IInterface {     C c; }  std::queue<std::shared_ptr<A>> queue;    class B {     shared_ptr<IInterface> a; }  class C {     List<unique_ptr<B>> b; }   Did I choose the correct smart pointer, and did I analyze this correctly? I know this is super simple for you guys, but figured I would ask before I start doing things incorrectly.

What is a smart pointer and when should I use one?


everything shows up in render mode but otherwise, this is all I see.

When looking at my objects in 3d view I'm seeing a gray cone that seems to be hiding other objects.   Can anyone help me turn this off and explain what it is please.  Screenshots attached.


What is $\mathop {\lim }\limits_{n \to \infty } \frac{{\tan (n)}}{n}$?

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


I entered a charity calendar competition and the picture of my cat won, but when they tried to make it larger to put on their 2016 calendar it wasn't a good enough quality. It was blurred. I was gutted.  Is there any way my picture can be improved so it can be made bigger, or can I send it somewhere over the internet for them to do it for me?  I love the picture and would like it to be used.

I have taken a picture whose resolution is less. I can resize the image easily (i.e I can scale to higher resolution) but the image quality goes for a toss, which is true because the image might not have enough pixels to scale properly.   Is resizing a means of increasing the resolution of the image ? Is it possible to increase the pixel density of the image and then resize, so that quality of the image is not affected much?   I mainly use GIMP and Picasa.


Ever since 16.04 there has been nothing but issues with the new software center. First, it couldn't install anything of its life dependent on it requiring a separate package installer to be used.  Now,  suddenly, out of the blue, ubuntu-software will not open; it loads somewhat, then force closes within a few seconds after opening. I wish these things would all be working properly before releasing a LTS. It's a little embarrassing, really. Never had these issues with 14.04.   Anyway, here's what the terminal spits out when launching from there. Help?   shantelle@G505:~$ ubuntu-software  (ubuntu-software:15531): Gs-WARNING **: Failed to create permission org.freedesktop.packagekit.trigger-offline-update: GDBus.Error:org.freedesktop.PolicyKit1.Error.Failed: Action org.freedesktop.packagekit.trigger-offline-update is not registered  (ubuntu-software:15531): Gs-WARNING **: Failed to create permission org.freedesktop.packagekit.trigger-offline-update: GDBus.Error:org.freedesktop.PolicyKit1.Error.Failed: Action org.freedesktop.packagekit.trigger-offline-update is not registered  (ubuntu-software:15531): Gs-WARNING **: Failed to create permission org.freedesktop.packagekit.trigger-offline-update: GDBus.Error:org.freedesktop.PolicyKit1.Error.Failed: Action org.freedesktop.packagekit.trigger-offline-update is not registered  (ubuntu-software:15531): Gs-WARNING **: Failed to create permission org.freedesktop.packagekit.trigger-offline-update: GDBus.Error:org.freedesktop.PolicyKit1.Error.Failed: Action org.freedesktop.packagekit.trigger-offline-update is not registered  (ubuntu-software:15531): Gs-WARNING **: Failed to create permission org.freedesktop.packagekit.trigger-offline-update: GDBus.Error:org.freedesktop.PolicyKit1.Error.Failed: Action org.freedesktop.packagekit.trigger-offline-update is not registered  (ubuntu-software:15531): GLib-CRITICAL **: g_dir_read_name: assertion 'dir != NULL' failed  (ubuntu-software:15531): GdkPixbuf-CRITICAL **: gdk_pixbuf_get_width: assertion 'GDK_IS_PIXBUF (pixbuf)' failed  (ubuntu-software:15531): Gdk-CRITICAL **: gdk_cairo_surface_create_from_pixbuf: assertion 'GDK_IS_PIXBUF (pixbuf)' failed  (ubuntu-software:15531): Gtk-WARNING **: Error loading image 'file:///usr/share/gnome-software/featured-transmission.png': Error opening file: Too many open files  (ubuntu-software:15531): GLib-ERROR **: Creating pipes for GWakeup: Too many open files  Trace/breakpoint trap (core dumped)

Ubuntu Software instantly crashes as I try to open it. Tried to access from terminal and gives the following error:  (ubuntu-software:5523): Gs-WARNING **: failed to open plugin /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: cannot open shared object file: No such file or directory


In my book, it is claimed without proof that if a ring (commutative with identity) $R$ has zero divisors, then $R[x]$ has invertible polynomials of degree greater than $0$. They give the following example in $\mathbb{Z}_4$: $$(1+2x)(1+2x)=1$$ This seems like a pretty lucky example: in this ring we have a zero divisor whose sum with itself is $0$. In general this doesn't seem like an easy question to tackle. First i thought that maybe could find some $a$ such that $a^2 = 0$ and use the factorization $(1+ax)(1-ax)$ but in general such $a$ does not exist: $\mathbb{Z}_6$ is a counterexample. No polynomial of form $(1+ax)$ has a degree $1$ inverse in $\mathbb{Z}_6[x]$ either. Trying out higher degrees seems like a nightmare.

I am trying to prove a result, for which I have got one part, but I am not able to get the converse part.  Theorem. Let $R$ be a commutative ring with $1$. Then $f(X)=a_{0}+a_{1}X+a_{2}X^{2} + \cdots + a_{n}X^{n}$ is a unit in $R[X]$ if and only if $a_{0}$ is a unit in $R$ and $a_{1},a_{2},\dots,a_{n}$ are all nilpotent in $R$.  Proof. Suppose $f(X)=a_{0}+a_{1}X+\cdots +a_{n}X^{n}$ is such that $a_{0}$ is a unit in $R$ and $a_{1},a_{2}, \dots,a_{r}$ are all nilpotent in $R$. Since $R$ is commutative, we get that $a_{1}X,a_{2}X^{2},\cdots,a_{n}X^{n}$ are all nilpotent and hence also their sum is nilpotent. Let $z = \sum a_{i}X^{i}$ then $a_{0}^{-1}z$ is nilpotent and so $1+a_{0}^{-1}z$ is a unit. Thus $f(X)=a_{0}+z=a_{0} \cdot (1+a_{0}^{-1}z)$ is a unit since product of two units in $R[X]$ is a unit.   I have not been able to get the converse part and would like to see the proof for the converse part.


I'm getting 'false' for the first test and 'true' for the second test. I'm suppose to create a function that will evaluate to these values. I thought I executed my code in the function correctly but I'm not getting what I'm suppose to be getting. I don't understand what I could be doing wrong here. Any help will be so appreciated. Thanks. // - Given the arrayOfNames, determine if the array contains the given name. // - If the array contains the name, return true.  If it does not, return false. // - Hint: Use a loop to "iterate" through the array, checking if each name matches the name parameter. //  // Write your code here 👇  function contains(arrayOfNames, name) {   for (index = 0; index < arrayOfNames.length; index++) {     if (arrayOfNames[index] === name) {       return true;     } else {       return false;     }   }  }  //  -------TESTS--------------------------------------------------------------- //  Run these commands to make sure you did it right. They should all be true. console.log("-----Tests for Exercise Five-----"); console.log("* Returns true when the array contains the name."); console.log(contains(["bob", "nancy", "john", "shawnie", "waldo", "shaquon", "julie"], "nancy") === true); console.log("* Returns false when the name is not in the array"); console.log(contains(["bob", "nancy", "john", "shawnie", "waldo", "shaquon", "julie"], "fred") === false);

What is the most concise and efficient way to find out if a JavaScript array contains a value? This is the only way I know to do it: function contains(a, obj) {     for (var i = 0; i < a.length; i++) {         if (a[i] === obj) {             return true;         }     }     return false; }  Is there a better and more concise way to accomplish this?


I'm running tomcat server in my centos machine. I've following content in my /etc/logrotate.d/tomcat file:  /log/apache-tomcat/catalina.out{  copytruncate  daily  size 256M  rotate 8  missingok  maxage 7 }   I tried to run the logrotate command manually in debug mode.  /usr/sbin/logrotate -d /etc/logrotate.conf   In the logs, I found following content regarding the /log/apache-tomcat/catalina.out file.     rotating pattern: /log/apache-tomcat/catalina.out 268435456 bytes (8 rotations)      empty log files are rotated, old logs are removed      considering log /log/apache-tomcat/catalina.out     log needs rotating      rotating log /log/apache-tomcat/catalina.out, log->rotateCount is 8      dateext suffix '-20190206'      glob pattern '-[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9]'      glob finding old rotated logs failed      copying /log/apache-tomcat/catalina.out to /log/apache-tomcat/catalina.out-20190206      truncating /log/apache-tomcat/catalina.out   But the file size didn't change after running the command. I'm not sure what went wrong here.  This file size is keep on increasing and causing lot of issues.

I want to set up daily logrotate for my Tomcat server' catalina.out log file but it's not working - I haven't seen the rotated log files created. To troubleshoot, I ran logrotate -d /etc/logrotate.conf and got the following:    rotating pattern: /usr/local/tomcat/logs/catalina.out  5242880 bytes (7 rotations) empty log files are rotated, old logs are removed considering log /usr/local/tomcat/logs/catalina.out   log needs rotating rotating log /usr/local/tomcat/logs/catalina.out, log->rotateCount is 7 dateext suffix '-20151223' glob pattern '-[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9]' glob finding old rotated logs failed copying /usr/local/tomcat/logs/catalina.out to /usr/local/tomcat/logs/catalina.out-20151223 truncating /usr/local/tomcat/logs/catalina.out compressing log with: /bin/gzip    It seems like everything is working without any error. However, there is no results:    [root@gec logrotate.d]# ls -lrth /usr/local/tomcat/logs/cata* -rw-r--r-- 1 root root  398 Dec  4 17:48 /usr/local/tomcat/logs/catalina.2015-12-04.log -rw-r--r-- 1 root root 109M Dec 23 17:21 /usr/local/tomcat/logs/catalina.out    My /etc/logrotate.conf:    daily  rotate 7  # create new (empty) log files after rotating old ones create  # use date as a suffix of the rotated file dateext  # uncomment this if you want your log files compressed #compress  # RPM packages drop log rotation information into this directory include /etc/logrotate.d    My /etc/logrotate.d/tomcat:    /usr/local/tomcat/logs/catalina.out {     copytruncate     daily     rotate 7     compress     missingok     size 5M }     What is wrong?    Updates:  Interestingly, running logrotate -f /etc/logrotate.conf creates the rotation gzip files!  [root@gec logrotate.d]# ls -lrth /usr/local/tomcat/logs/cata* -rw-r--r-- 1 root root  398 Dec  4 17:48 /usr/local/tomcat/logs/catalina.2015-12-04.log -rw-r--r-- 1 root root 1.1M Dec 23 17:26 /usr/local/tomcat/logs/catalina.out-20151223.gz -rw-r--r-- 1 root root 109K Dec 23 17:27 /usr/local/tomcat/logs/catalina.out   However, how do I know whether the daily cron job will work?


i don't know exactly what topic i should read, but i thought it would be better to just post this. i have an acer laptop, and i was locked out of the bios. i wanted to try something new and installed ubuntu. i found that i don't like it. i can't even install apps like i can on windows. you have to type in all these codes. i just want to go back to windows. i was doing all this stuff to try to get back to windows, and actually got into the bios. i don't know exactly what order to put in the bios to boot into my original os. i don't know how to use grub 2. i'm very unfamiliar with everything. i kinda know something about the terminal. by the way i chose install when i first booted into the usb that had the iso file on it. i know i should have tried try ubuntu instead. i need some very clear instructions on how to boot into my original os and use windows. sorry again if this is duplicates of other topics. i just don't know what to look for. thank you.

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


I have a note type 'team' with a body field and a checkbox field (checked by default). I want to automatically check the box on save IF there is content in the body field. Is there a way to do that programmatically?

I want to update a node field's value when a node is updated.   Tried using the code mentioned here   use Drupal\node\Entity\Node;      function hello_world_entity_presave(Drupal\Core\Entity\EntityInterface $entity) {        $check = \Drupal::routeMatch()->getParameter('node');        if ($check) {       $node = Node::load($check->nid->value);       $node->title->value = 'testing';     //set value for field       $node->save();       }     }   but it did not work. I get a 500 error after saving the node. I also tried taking out the if statement and specifying a node id $node = Node::load(1);  I also tried using   use Drupal\node\Entity\Node;   function hello_world_node_update(Drupal\node\NodeInterface $node) {  $node = Node::load(1); $node->set("title", 'New value'); // also tried $node->setTitle('The new Title'); $node->save();  }   but no luck either.   In addition, I tried using different hooks entity_presave, entity_update, node_update, but did not make any difference.


I have two versions of python, namely, 2.7.10 and 3.4.3 in my Ubuntu 14.04 (trusty) machine.  How can I upgrade the 3.4.3 version to 3.5 latest version without affecting the 2.7.10 version?    Thanks in advance.

I have a linux VM with preconfigured Python3.4. I need to have Python3.7 to run my code.  I tried to uninstall Python3.4 but there are some system dependencies, so I kept old version. Then I downloaded and installed Python3.7.1.tgz (sudo make).   But now I can't access Python 3.7 instance. When I run a "python3" command, Python 3.4 is run, when "python3.7" then I get a "command not found" message.  How do I proceed? Is it okay to have two versions of Python 3 installed on one machine? What with installation packages by "pip"?


I'm currently running Ubuntu in a VMworkstation Pro, when I try to SSH into it, the connection is rejected. But, I can ping Ubuntu IP successfully.

I just installed Ubuntu. How do I set it up to allow me to ssh into it?  Right now I get "ssh: connect to host x.x.x.x port 22: Operation timed out".


It's very annoying to have to delete the cube, camera, and light every time I start a new scene. I only use Blender for games, so I never use those things. I would love for a new "General" scene to include a clean slate.

How can I change Blender from the default cube/lamp/camera default setup? Also, is it possible to change other features, such as the default view direction (Top, Side, etc) or the Editor type (3D View, Node Editor, Graph Editor, etc)?


I am in doubt with an exercise - I need to calculate  $$\left(205\mid853\right)$$  I would use the fact Legendre's symbols are multiplicative, but then I would have something like   $$\left(5\mid853\right)\left(41\mid853\right)$$  and it would not help much with Gauss lemma, since it would mean having sequences $(853-1)/2$ longs to multiply, to operate $\mod 853$, and so on.   Is there a faster trick I don't see?  Thanks in advance.

Without strenuous arithmetic.   Is there a program I can download to do so?  What are the quadratic residues modulo $5^4$ or $5^5$?  Thanks!


Hello so I got a notification from sofware updater to update google chrome but it said Failed to  download packages pleases check your internet connection but I was connected to the internet already and installing any other packages would be intalled easily. Here is the code from terminal: Reading package lists... Done Building dependency tree        Reading state information... Done Calculating upgrade... Done The following packages will be upgraded:   google-chrome-stable 1 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. Need to get 75.8 MB of archives. After this operation, 55.3 kB disk space will be freed. Do you want to continue? [Y/n] y Get:1 http://dl.google.com/linux/chrome/deb stable/main amd64 google-chrome-stable amd64 89.0.4389.90-1 [75.8 MB] 42% [1 google-chrome-stable 39.6 MB/75.8 MB 52%]                  3,6248% [1 gooErr:1 http://dl.google.com/linux/chrome/deb stable/main amd64 google-chrome-stable amd64 89.0.4389.90-1   Hash Sum mismatch   Hashes of expected file:    - SHA256:f38a1699e1707dd76edadc671d54922992ea4fd2705d79645679a6abe3e9f7c1    - SHA1:fc795cf3607888405e36b61230019d6dcff508db [weak]    - MD5Sum:58c8bec946f3251a13cdb5b56aecd0bd [weak]    - Filesize:75841728 [weak]   Hashes of received file:    - SHA256:09f32fa3eebfe13f3d1d5ca981260e7c8015cb074d61ad95fddb8810b3df095c    - SHA1:c3856406fc05efa2e87959b67c3f1f866d0362c1 [weak]    - MD5Sum:c5fa4ed66c5980d8982561c68dc06881 [weak]    - Filesize:75841728 [weak]   Last modification reported: Fri, 12 Mar 2021 00:18:53 +0000 Fetched 75.8 MB in 23s (3,341 kB/s)                                             E: Failed to fetch http://dl.google.com/linux/chrome/deb/pool/main/g/google-chrome-stable/google-chrome-stable_89.0.4389.90-1_amd64.deb  Hash Sum mismatch    Hashes of expected file:     - SHA256:f38a1699e1707dd76edadc671d54922992ea4fd2705d79645679a6abe3e9f7c1     - SHA1:fc795cf3607888405e36b61230019d6dcff508db [weak]     - MD5Sum:58c8bec946f3251a13cdb5b56aecd0bd [weak]     - Filesize:75841728 [weak]    Hashes of received file:     - SHA256:09f32fa3eebfe13f3d1d5ca981260e7c8015cb074d61ad95fddb8810b3df095c     - SHA1:c3856406fc05efa2e87959b67c3f1f866d0362c1 [weak]     - MD5Sum:c5fa4ed66c5980d8982561c68dc06881 [weak]     - Filesize:75841728 [weak]    Last modification reported: Fri, 12 Mar 2021 00:18:53 +0000 E: Unable to fetch some archives, try running apt-get update or apt-get --fix-missing.  I have tried everything that the terminal gave me but nothing worked. Anyways Here is the video evidence of it from the software updater:

When I check for updates, I get a "Failed To Download Repository Information" error.   This is what comes up under details:   W: Failed to fetch gzip:/var/lib/apt/lists/partial/us.archive.ubuntu.com_ubuntu_dists_natty_main_source_Sources  Hash Sum mismatch,  E: Some index files failed to download. They have been ignored, or old ones used instead.


We are told in The Matrix by Morpheus that humanity had blocked sunlight in the hope that it would prevent the Machines from recharging.  At the same time though, almost all life depends on sunlight, either directly or indirectly.  Therefore, by blocking sunlight, it would severely hinder the capability of organisms to survive.  My question is then, by the time of the events of The Matrix when Neo is freed from The Matrix, is there any non-human organic life?

Aside from the repetitive appearance of the black cat, I can't remember seeing any living animals, either inside the Matrix simulation or in Zion.  How come? Is there an in-universe explanation?


All I simply need is to send a name parameter value from my Swift app to an SQL query. After doing some research I found that I needed to create a POST request.   $ID = $_POST['customerName'];  $sql = "SELECT customer, rma, manufacturer, model, status FROM Equipment          WHERE customer = '$ID' ";   This is what I currently have in my PHP script for the POST Request:  <?php       // Create connection $con=mysqli_connect("localhost","username","password","dbName");  // Check connection if (mysqli_connect_errno()) {   echo "Failed to connect to MySQL: " . mysqli_connect_error(); }  // This SQL statement selects ALL from the table 'Equipment'  $ID = $_POST['customerName'];  $sql = "SELECT customer, rma, manufacturer, model, status FROM Equipment          WHERE customer = '$ID' ";  // Check if there are results if ($result = mysqli_query($con, $sql)) {     // Create temporary connection     $resultArray = array();     $tempArray = array();      // Look through each row     while($row = $result->fetch_object())     {         // Add each row into our results array         $tempArray = $row;         array_push($resultArray, $tempArray);     }      // Finally, encode the array to JSON and output the results     echo json_encode($resultArray); }  mysqli_close($con);  ?>   Then I need my Swift app to send the customerName value needed to for the correct data to show. Below I am trying to use let parameters: [String: Any] = ["customerName": "Customer1"] with no result..  func downloadItems() {     let url = URL(string: "https://www.sample.com/test/test.php")!     let defaultSession = Foundation.URLSession(configuration: URLSessionConfiguration.default)     var request = URLRequest(url: url)     request.setValue("application/json", forHTTPHeaderField: "Content-Type")     request.httpMethod = "POST"     let parameters: [String: Any] = ["customerName": "Customer1"]      request.httpBody = parameters.percentEscaped().data(using: .utf8)      let task = defaultSession.dataTask(with: url) { (data, response, error) in         if error != nil {             print("Error")         }else {             print("details downloaded")             self.parseJSON(data!)         }      }      task.resume() }

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


I have an old Iphone 4 with iOS 7.1.2 and I lost the carrier sim which it is locked,and the wi-fi  connection don't works at all, how can I activate it to use this like an Ipod?  (sorry for my bad english)

So we bought an iPhone 4 from the Apple store. But we didn't get a micro-SIM as there are no PAYG tariffs on micro-SIM available.  Is there anyway to activate the device without getting hold of a SIM? I don't want to sign up to a contract just to develop with.


For every $a, b$ belongs to $G$    $a*b=ab/2$ I have to find out whether $(G, *)$ is an abelian group or not I have gone up to identity but stuck at inverse please someone help

Let G be a set of all non-zero real numbers. And  a * b  = (ab/2).  We need to show (G,*) is an abelian group.  I know I need to show ab = ba, but that seems so trivial,  Assuming the group is abelian,  a * b  = b* a  ab/2 = ba/2 Crossing out 2, we get ab = ba  Is this the correct answer ?  Multiplying both sides inverse of a and b results in 1 = 1 . Am I doing something wrong ? Or am I missing something?


We have 3 SQL 2014 instances in a AlwaysOn Availability Group. Our 2 primary servers are onsite at our primary data center in synchronous replication. A 3rd replica is at our DR site in Async Mode (no automatic failover)  We run transaction log backups every minute on our primary instance (don't offload backups). Our DR site usually runs < 5 seconds behind the primary site, and the business is ok to lose up to 1 minute of data in the event of an unplanned outage at our primary site (planned outages we switch to sync mode and deal with the latency issues).  Sometimes though, our DR site can be out of sync by 20-30 minutes, particularly during index maintenance and end of month operations.  My question is, in the event that both servers in the primary site go offline and our DR site is behind, can we use our log backups to bring the DR server up to date? What are the steps involved?  : asks the same question but for SQL Mirroring instead of AAGs.  Due to licensing the DR site is non-readable (I don't think this will make a difference but just in case it does).

Purely a theoretical question as I've been considering possible DR scenarios...  In this scenario:   The link between a principle and a mirror server becomes unavailable for a period of time (e.g. network outage) Incremental log backups are still being taken during this time Then the principle database fails and is unrecoverable   Is it possible to restore the incremental log backups onto the mirror to bring it up to date and back online, or would you need to start from scratch with a restore of a full backup?  Depending on the size of the database the difference could be hours of downtime so it would be nice to know.  I'm predominantly interested in SQL Server 2008 R2 and 2012 but other people may be interested in other versions if there's a difference.


Okay so here I've tried proving that :  Let $x_n$ be a sequence, if $\limsup{x_n}=\liminf{x_n}$ then $x_n$ converges.  Proof. By definition, $\limsup{x_n}$ and $\liminf{x_n}$ are limits of subsequences that are formed from $x_n$. Let these subsequences be $a_n$ and $b_n$ such that:  $$\lim{a_n}=\limsup{x_n}=a \\ \lim{b_n}=\liminf{x_n}=b$$  Okay let's analyse this :  There exists and $ɛ_1$ such that $|a_n-a|<ɛ_1$ for $n>N^{'}$  There exists and $ɛ_2$ such that $|b_n-b|<ɛ_2$ for $n>N{''}$  Let   $$N=max(N{'},N{''})$$  so $|a_n-a|+|b_n-b|<ɛ_1+ɛ_2$ for $n>N$  By triangle inequality ::  $$|a_n+b_n-(a+b)|<ɛ_1+ɛ_2$$   So we have found that when we add this subsequences together, they converge to $a+b$, what if $a=b$ Then : $$|a_n+b_n-(2a)|<ɛ_1+ɛ_2$$   So both $a_n$ and $b_n$ have infinite traces around the point $a$ Since their trace is a subset of the actual sequence $x_n$ we can considered that they are approaching the open ball $B(a,ɛ)$. when they approach to the ball, for $n>N$ sequences equal out $a_n=b_n$ and we can also say that  $$a_n=b_n=x_n$$ for $$n>N$$  So that when $\liminf=\limsup$ the sequence $x_n$ converges.  What do you think about my proof? IS it correct? What else should I add, what should I adopt? I'm new to analysis so help me out please.  Thanks.

I want to prove that a sequence of real numbers $\{s_n\}$ converges to $s$ if and only if $\limsup_{n \to \infty} s_n = \liminf_{n \to \infty} s_n = s$.  Here are my definitions:  For any sequence of real numbers $\{s_n\}$, let $E$ be the set of all subsequential limits of $\{s_n\}$, including possibly $+\infty$ and/or $-\infty$ if any subsequence of $\{s_n\}$ diverges to infinity.  Then $\limsup_{n \to \infty} s_n = \sup E$, and $\liminf_{n \to \infty} s_n = \inf E$.  I know the theorem that a sequence converges to a point if and only if every one of its subsequences converge to that same point, so one direction of this proof is easy:  If $\{s_n\}$ converges to some point $s \in \mathbb{R}$,  then every subsequence of $\{s_n\}$ converges to $s$.  So the set $E$ of every subsequential limit of $\{s_n\}$ consists of the single point $s$, so $$\limsup_{n \to \infty} s_n = \sup \{s\} = s = \inf \{s\} = \liminf_{n \to \infty} s_n$$  But the other direction seems more tricky...  If $\limsup_{n \to \infty} s_n = \liminf_{n \to \infty} s_n = s$, then every convergent subsequence converges to the same point $s$.  Also, there can be no subsequences which diverge to infinity (otherwise $\limsup_{n \to \infty} s_n$ would be $+\infty$, or $\liminf_{n \to \infty} s_n$ would be $-\infty$).  But can't there be subsequences which diverge otherwise?  And wouldn't that throw off the convergence of $\{s_n\}$?    EDIT:  I'd also be willing to accept a solution which makes use of the "Pinching Theorem" (if $a_n \leq s_n \leq b_n$ for every $n \in \mathbb{N}$, and if $a_n \to s$ and $b_n \to s$, then $s_n \to s$).


gdal_polygonize converts whatever rasters values into vector integers as it is based on the GDALPolygonize() function ().  It is suggested that the GDALFPolygonize() function () should be employed in case floating points are to be transferred.  However, it is absolutely obscure to me how to implement or call such function instead of the standard one. No clue is available anywhere.  I'm calling gdal using both OSGeo4W shell as well as QGIS2.6 python interface (I'm on Windows 7 and 8.1).

I have float raster and now I want to convert it to vector. How is it possible with the Python GDAL library?  I have tried with gdal_polygonize.py of GDAL utilities on the command line and it worked excellently. But this utility is based on GDALPolygonize() of C++ library and I want to C++ method GDALFPolygonize() to be used instead, which manipulates float raster data as far as I know.


I bought an old pan on ebay and I wish to know if it is enamelled or raw. Inside of pan has a black layer and a spot patch 6 by 3 cms of different layernature. How do I find out out if pan is raw cast iron. The thin black layer is difficult to identify. The seller says that pan is not enamelled. But I doubt it.

I have found a cast iron grill manufactured by the French company Le Creuset. This cookware is probably around 20 years old and you can see a picture of the same model below.    I'm wondering if this grill is enameled cast iron or raw cast iron. Indeed, if it's raw cast iron, I will strip of the former seasoning and create a new one. If it's enameled cast iron, I'm not sure how to deeply clean it but I will not put it in my self-cleaning oven.  Today, all cast iron products from Le Creuset are enameled but I don't know if that was the case 20 years ago. The cookware is black and has been used a lot, so I don't know if the (quite) smooth aspect of the top is enameled or not.   Do you have any tricks to recognize if cast iron cookware is enameled or not?*  Photos (click for full-size)       On this last one, you can see "Le Creuset * Made in France* D2" but I didn't find anything about D2 grill model on the internet.


Why is it "" and not "Honey Badger doesn't care!" ?

I'd like to know how the sentence "That don't impress me much" sounds to a native English speaker.  The phrase is the title of a song by Shania Twain, and to my eyes it contains a clear error. It is obviously intended, and I want to know what was the effect that the author wanted to obtain.  Other examples that come to mind:   “She's got a ticket to ride, but she don't care” — The Beatles “My love don't cost a thing” — Jennifer Lopez “It don't matter” — Akon “She don't care about me” — heard in the Lost series “It Don't Mean a Thing” — a jazz album title “The Sun Don't Lie” — another album title


What is the difference between     When will XYZ bank release the results of clerks?   and     When would XYZ Bank release the results of clerks?   Which one is the formal way to ask the HR of the bank.  Please explain the difference between 'will' and 'would' (in a question) with examples.

What is the difference between would and will in the following examples?        How would you use this word in a sentence?     How will you use this word in a sentence?


/*    I have two classes. One is allocating memory on stack for its members while other is allocating on heap. See the below code snippet.*/  class A_Heap {  public:     A_Heap()      {         ptr = new char[256];         int_ptr = new int[1024];     }  private:      char * ptr;     int * int_ptr;     int abc;     char ch;  };  class A_Stack {  public:     A_Stack()     {     }  private:      char ptr[256];     int int_ptr[1024];     int abc;     char ch; };   /*class A_Heap will be less efficient as allocate memory on heap causing two more context switch from user to kernel mode? */

This question may sound fairly elementary, but this is a debate I had with another developer I work with.  I was taking care to stack allocate things where I could, instead of heap allocating them. He was talking to me and watching over my shoulder and commented that it wasn't necessary because they are the same performance wise.  I was always under the impression that growing the stack was constant time, and heap allocation's performance depended on the current complexity of the heap for both allocation (finding a hole of the proper size) and de-allocating (collapsing holes to reduce fragmentation, as many standard library implementations take time to do this during deletes if I am not mistaken).  This strikes me as something that would probably be very compiler dependent. For this project in particular I am using a  compiler for the  architecture. Insight on this combination would be most helpful, but in general, for GCC, and MSVC++, what is the case? Is heap allocation not as high performing as stack allocation? Is there no difference? Or are the differences so minute it becomes pointless micro-optimization.


In my classical mechanics class they asked why the kinetic energy for an holonomic mechanical system has the homogeneous quadratic form.  Of course for a autonomous standard system( system that is holonomic and the constraint do no virtual work) you can just calculate that  $$ T = \frac { 1 } { 2 } \sum _ { i = 1 } ^ { M } m _ { i } \left( v _ { i } \cdot v _ { i } \right) = \sum _ { j = 1 } ^ { n } \sum _ { k = 1 } ^ { n } a _ { j k } ( q ) \dot { q } _ { j } \dot { q } _ { k } $$ with $$ a _ { j k } ( \boldsymbol { q } ) = \frac { 1 } { 2 } \sum _ { i = 1 } ^ { N } m _ { i } \left( \frac { \partial \boldsymbol { r } _ { i } } { \partial q _ { j } } \cdot \frac { \partial r _ { i } } { \partial q _ { k } } \right) $$ So you can write $$ T = \dot { q } ^ { T } \cdot A \cdot \dot { q } $$ But what is the physical reason?

As  says:     [...] the kinetic energy of a non-rotating object of mass $m$ traveling at a speed $v$ is $\frac{1}{2}mv^2$.   Why does this not increase linearly with speed? Why does it take so much more energy to go from $1\ \mathrm{m/s}$ to $2\ \mathrm{m/s}$ than it does to go from $0\ \mathrm{m/s}$ to $1\ \mathrm{m/s}$?  My intuition is wrong here, please help it out!


I came across one of my mother's cookbooks from 1954.  A lot of the baked goods call for "1 cake of yeast".  What would be the equivalent of this in today's supermarket?

This recipe for poppy seed rolls calls for 1 large yeast. How much yeast am I supposed to use? I usually see recipes measure it in teaspoons, but I can’t guess how much “large” is. I am also assuming this is active dry yeast, maybe it’s not and that’s the reason why the size is weird.


I have a login form that is being created in the view. Then in my controller I'm trying to load my model but it doesn't seem to load. Looked up a few answer here on stackoverflow and almost everybody says autoload model, import the database library,etc. I did that but I'm still getting the error      Fatal error: Call to a member function model() on a non-object in C:\xampp\htdocs\\project\application\controllers\login.php on line 11       A PHP Error was encountered      Severity: Notice      Message: Undefined property: Login::$load      Filename: controllers/login.php      Line Number: 11   login_view  <?php     $loginEmail = array('placeholder' => "Email", 'name' => "loginEmail");     $loginPassword = array('placeholder' => "Wachtwoord", 'name' => "loginPassword");     $loginSubmit = array('name' => "loginSubmit", 'class' => "btn", 'value' => "Inloggen");     $loginForgot = array('name' => "loginForgot", 'class' => "link", 'value' => "Wachtwoord vergeten?");      echo form_open('login/login', array('class' => 'grid-100 formc'));     echo form_input($loginEmail);     echo form_password($loginPassword);     echo form_submit($loginSubmit);     echo form_submit($loginForgot); ?>   login_controller  <?php  Class Login extends CI_Controller{     function index(){         $data['content'] = 'login_view';         $this->load->view('templates/template', $data);     }       function login(){         $this->load->model('login_model');         $query = $this->login_model->validate();          if($query){             $data = array(                 'username' => $this->input->post('loginEmail'),                 'loggedin' => true              );              $this->session->set_userdata($data);              redirect('profile/myprofile');         }     }  }  ?>   login_model  <?php  Class Login_model extends CI_Model{      function validate(){         $this->db->where('email', $this->input->post('loginEmail'));         $this->db->where('password', md5($this->input->post('loginPassword')));          $query = $this->db->get('tbl_users');          if($query->num_rows == 1){             return true;         }     }  }  ?>   autoload.php  $autoload['libraries'] = array('database', 'session');   What am I missing here?

So I'm refactoring my code to implement more OOP.  I set up a class to hold page attributes.  class PageAtrributes  {   private $db_connection;   private $page_title;      public function __construct($db_connection)      {         $this->db_connection = $db_connection;         $this->page_title = '';     }      public function get_page_title()     {         return $this->page_title;     }      public function set_page_title($page_title)     {         $this->page_title = $page_title;     } }   Later on I call the set_page_title() function like so  function page_properties($objPortal) {         $objPage->set_page_title($myrow['title']); }   When I do I receive the error message:     Call to a member function set_page_title() on a non-object   So what am I missing?


I am using the arrows.meta library to modify the arrow tips of my graphs. The problem is, that when I use the code below once, it works, but when I use it a second time, it does not. I tried it with and without the \usetikzlibrary{...} command in the second picture, I changed node names and so on.  I don't even want the exact same graph a second time, I just want to use the [-{Latex[...]}] arrow tips in another graph.   Error message:     Package pgf Error: Unknown arrow tip kind 'Latex'. \draw[-{Latex[.....   Minimum example:  \begin{figure}[H]     \begin{center}         \usetikzlibrary{arrows.meta}     \begin{tikzpicture}[align=center,node distance=3cm]     \footnotesize     \node [knoten,draw](a)[label=above:1] {$*$};     \node [knoten,draw](b)[below left of=*1, label=above:2] {$+$};     \draw [-{Latex[width=2mm,length=2mm]},red] (a.north east) .. controls +(up:2cm) and +(left:2cm) .. (b.south west); \end{center}\end{figure}

Is it possible to load a TikZ library and make it local to a tikzpicture?  I'm writing a long document, and feel like the different TikZ libraries required for different diagrams are "littering" the namespace.


I'm curious if it's possible to document roughly when the split happened, and also curious whether British or American usage diverged.

Do in future and in the future imply different meanings? If so, using which one is grammatically correct?


I'm trying to save the find output to a variable in this manner:   a=find /Users/Downloads/DTI_allsites/subprojects/*/UII_0077 -name "dti_preprocessed" -type d   But I keep getting the following message:   -bash:      /Users/Downloads/DTI_allsites/subprojects/UII_B/UII_0077:   is a directory   whenever I try to use the command, to echo the path using:       echo $a  I don't get anything saved in the variable.  How can I fix this?

I want to assign the result of an expression (i.e., the output from a command) to a variable and then manipulate it – for example, concatenate it with a string, then echo it.  Here's what I've got: #!/bin/bash cd ~/Desktop; thefile= ls -t -U | grep -m 1 "Screen Shot"; echo "Most recent screenshot is: "$thefile;  But that outputs: Screen Shot 2011-07-03 at 1.55.43 PM.png Most recent screenshot is:   So, it looks like that isn't getting assigned to $thefile, and is being printed as it's executed. What am I missing?


I have the following bash script which works fine until I get to number 9 (/dev/sdj) where it does not produce the expected output.  hdd1="$(sudo fdisk -l | grep "Disk /dev/sd" | awk '{print$2}' | sed 's/://g')" counter=0 function check {     i="0"     while [ $i == "0" ]     do         hdd2="$(sudo fdisk -l | grep "Disk /dev/sd" | awk '{print$2}' | sed 's/://g')"         hdd1_count=$(echo "$hdd1" | wc -l)         hdd2_count=$(echo "$hdd2" | wc -l)         # Check if added or removed         if [[ "$hdd1_count" < "$hdd2_count" ]]         then             echo -e "\e[32mHDD ADDED\e[0m"             counter=$((counter+1))             echo "Total HDD: $counter"             echo "HDD1: $hdd1"             echo "HDD2: $hdd2"             hdd1=$hdd2             echo "HDD1 is now: $hdd1"             # Get last disk in var             last=$(echo "${hdd1##*$'\n'}")             echo "LAST: $last"         elif [[ "$hdd1_count" > "$hdd2_count" ]]         then         echo -e "\e[32mHDD REMOVED\e[0m"             counter=$((counter-1))             echo "Total HDD: $counter"             echo "HDD1: $hdd1"             echo "HDD2: $hdd2"             hdd1=$hdd2             echo "HDD1 is now: $hdd1"             # Get last disk in var             last=$(echo "${hdd1##*$'\n'}")             echo "LAST: $last"         fi     done }  check   Here is the output:  HDD ADDED Total HDD: 1 HDD1: /dev/sda HDD2: /dev/sda /dev/sdb HDD1 is now: /dev/sda /dev/sdb LAST: /dev/sdb   This works until /dev/sdi as followed:  HDD ADDED Total HDD: 8 HDD1: /dev/sda /dev/sdb /dev/sdc /dev/sdd /dev/sde /dev/sdf /dev/sdg /dev/sdh HDD2: /dev/sda /dev/sdb /dev/sdc /dev/sdd /dev/sde /dev/sdf /dev/sdg /dev/sdh /dev/sdi HDD1 is now: /dev/sda /dev/sdb /dev/sdc /dev/sdd /dev/sde /dev/sdf /dev/sdg /dev/sdh /dev/sdi LAST: /dev/sdi   Then I get to insert disk 9 and the output changes but I cannot find the problem why it isn't going on like expected. Here is the output:  HDD REMOVED Total HDD: 7 HDD1: /dev/sda /dev/sdb /dev/sdc /dev/sdd /dev/sde /dev/sdf /dev/sdg /dev/sdh /dev/sdi HDD2: /dev/sda /dev/sdb /dev/sdc /dev/sdd /dev/sde /dev/sdf /dev/sdg /dev/sdh /dev/sdi /dev/sdj HDD1 is now: /dev/sda /dev/sdb /dev/sdc /dev/sdd /dev/sde /dev/sdf /dev/sdg /dev/sdh /dev/sdi /dev/sdj LAST: /dev/sdj   I have changed the script now for 2 days in a row but I keep getting the same result. Can someone spot the problem?   EDIT:  -lt and -gt did the trick, thanks!

What's the difference between these:  SEC=$(mysql -hxxx -Pxxx -uxxx -pxxx -se "SELECT Seconds FROM tablename")  SEC=100   Both return the same result (100). But when I test it with:  if [ ${SEC} > 1 ] then     echo "SEC GT 1" else     echo "SEC LT 1" fi   The first one returns:  "SEC GT 1"   The second one returns:  "SEC LT 1"   If however, I change it to:  if [ ${SEC} -gt 1 ]   then the result is reversed.  I'm assuming it's got something to do with the datatype, and that I presumbaly need to cast one or the other to get the same result.  It's just that at present it's messing up my testing, as I have to remember to change the IF section every time.


my layer is point, and the symbol are "ellipse" with categorized renderer. So I define rotation in data defined properties but the tool «rotate» still inactive (rotation data works in QGIS 2.8).  Where the rotation properties must be defined : in the "MARKER» level or in "SYMBOL" level or the both ?   With the 10 symbols, I must make 10 times the same operations (in marker or in symbol level)?   The rotation is no longer in advanced menu, maybe in the over menu (and I can't see it) ?

I cannot find the the rotation field setting under the properties-layer settings-advanced (for styles) menu in the new release of QGIS (2.10.1 64bit). The only setting what is available there is the "symbol levels". Any idea where can I find this function?


Given the complete source code below, please explain why every execution of this program in Eclipse results in time in do1() greater than time in do2() by 2~3 milliseconds.  Does the JVM need to "warm up"?  import java.util.concurrent.atomic.AtomicInteger; import java.util.stream.IntStream;  public class Question {     public static void main(String[] args) {         do1();         do2();     }      public static void do1() {         O obj = new O();         Thread t = new Thread(() -> IntStream.range(0, 100000)                     .forEach(e -> obj.incrementN()));          long start = System.currentTimeMillis();          t.start();          try {             t.join();         } catch (InterruptedException e1) {          }          float time = (System.currentTimeMillis()-start)/1000F;          System.out.println(time);         System.out.println(obj);         System.out.println();     }      public static void do2() {         O obj = new O();         Thread t = new Thread(() -> IntStream.range(0, 100000)                     .forEach(e -> obj.incrementN()));          long start = System.currentTimeMillis();          t.start();          try {             t.join();         } catch (InterruptedException e1) {          }          float time = (System.currentTimeMillis()-start)/1000F;          System.out.println(time);         System.out.println(obj);     } }  class O {     private AtomicInteger n = new AtomicInteger(0);      public void incrementN() {         n.getAndIncrement();     }      @Override     public String toString() {         return ""+n.get();     } }   Sample output:  0.003 100000  0.001 100000

How do you write (and run) a correct micro-benchmark in Java?  I'm looking for some code samples and comments illustrating various things to think about.  Example: Should the benchmark measure time/iteration or iterations/time, and why?  Related:


Let $\alpha \in (0,1)$. How can I construct a Borel set $A$ such that $$\lim_{r \to 0+ } \frac{m(A \cap [-r,r])}{2r}=\alpha$$?  Thanks.

Let $\alpha \in (0,1)$. Find a fixed Borel subset $E$ of $[-1,1]$ such that  $$ \lim_{r \rightarrow 0^+} \frac{m(E \cap [-r,r])}{2r} = \alpha $$    I think it is the trickiest problem for studying Lebesgue measure Differentiability. Firstly, I came up with setting $E = [-\alpha r, \alpha r]$, but it does not meet the condition of ''fixed'' subset. It is so tricky that even my TA said this problem is "hard as hell".   Anybody can suggest any idea?   Thanks in advance.


In a recursive forecasting model, let's say you are trying to predict sales for the next month and you will append that prediction to your input and predict the month after. Basically, your target is Sales quantity, which you lagged. But let's say you have other continuous numerical features like Price which you will lag as well. As your model is making predictions on sales_qty, it will feed it back to sales_qty as input so you will never run out of values for that one. So how do you deal with your other features (other than the target) in order to generate them as next months inputs in a recursive forecasting model (because eventually you will run out of them)? Do you create a sub-model and try to predict them as well?

In a recursive forecasting model, let's say you are trying to predict sales of Target for the next month and you will append that prediction to your input and predict the month after. Basically, your target is Sales quantity, which you lagged. But let's say you have other continuous numerical features like Price which you will lag as well. As your model is making predictions on Sales_QTY, it will feed it back to sales_qty as input so you will never ran out of values for that one. So how do you deal with your other features (other than the target) in order to generate them as next months inputs in a recursive forecasting model (because eventually you will run out of them)? DO you create a sub-model and try to predict them as well?


If I tweet something containing wording that looks like (and is) a URL, but not intended to be interpreted as one, Twitter appends content from that URL to my tweet. I want to use the words ASP.NET without them being seen as a URL. How can I do this?

Currently, Twitter converts anything that has dot inside it into a link, e.g. ASP.NET becomes , Any.DO becomes  etc. I currently make a space if I want the word to stay the way it should, e.g. "ASP. NET" though it is not right.  Is there a hack around this Twitter bug? Like if there would be some unicode character that looked like a dot and could be inserted there or something like that.


I would like to draw an arrow pointing from the south of the t node to the south of the e node. The problem is that I have a slight grade in the edge pointing from the first to the second node.  This seems to come from the fact that the height of the arrow isn't considered within my calculation.   Does anybody know how to consider it? Is there a more elegant way to achieve the desired solution?  \documentclass{article} \usepackage{tikz} \usetikzlibrary{calc} \usetikzlibrary{positioning}  \begin{document} \begin{tikzpicture}         \node[draw](tID){t};         \node[draw, right=2.0cm of tID.east](eID){e};         \draw[->,semithick] (tID.south) -- ($(tID.south) - (0.0,0.5)$) -- ($(eID.south) - (0.0,0.5)$) -- (eID.south); \end{tikzpicture} \end{document}

TeX Code  \documentclass{standalone} \usepackage{tikz}  \begin{document}  \begin{tikzpicture}    \coordinate (A) at (0, 0);   \coordinate (B) at (2, 3);    \node[draw,minimum width=10mm] at (A) {};   \node[draw,minimum width=10mm] at (B) {}; \end{tikzpicture}  \end{document}   How such path can be drawn using Tikz?


Normally, I use GParted, but cannot this time as I will explain. I have a USB drive that was sent from Dell, containing Windows 8 or 10 (I cannot remember which). I would like to reuse the drive for something useful, but I am getting messages stating that it is read-only.  When I attempt to change the permissions of the directory I get The permissions could not be changed. Sorry, could not change the permissions of 'W8-1': Error setting permissions: Read-only file system. I have opened nautilus as root.  Using the command line: sudo chown 777 /media/bobo/W8_1/' I receive the message: chown: changing ownership of '/media/bobo/W8_1/': Read-only file system  When using gparted, I unmount, select the appropriate drive, unmount drive, select drive to format, choose fat32. Message reads:  Can't write to /dev/sdc because it is opened read-only.    I have checked the device for a physical switch, but am unable to locate one. I have wasted enough time on this, I should just throw it away, but am feeling stubborn and would like to get something back for all the time that Microsoft has stolen from me over the years.

I currently have a Windows 10 pen drive that isn't in use at the moment. I try to format the drive on disks, and the terminal using mkfs.vfat /dev/sdc1 and all I get is;  mkfs.fat 4.1 (2017-01-24) mkfs.vfat: unable to open /dev/sdc1: Read-only file system   Is there a way to format this to any file system? I'd like to use it for other things.


I find an image on AWS in ami format which is my target.  I need to download the target OS image to my local system and install it on my local cluster computers. (There is no direct support for exporting ami image into iso file.)  Is it possible? How can I achieve it?

I installed Ubuntu 14.04.1 on one of my laptops and now I want distribute that exact installation to a few of my friends. I tried making an iso with Gparted on a live session but it makes a 500 GB file (I've only used around 8 GB) .   Thanks in Advance !


I am a resident of Dubai (UAE). I am planning to go to the USA for a vacation. I am wondering if they are allowing tourists at this time.

This community wiki explains the current restrictions by the United States of America on the entry of individuals who may pose a risk of transmission of the SARS-Cov2, the virus which causes the Covid-19 disease.


There seems to be a split between those who say the backer board should go over the tub flange and those who say it should go above. Those who say over say so for drainage. Those who say above seem to suggest because of the surrounding drywall plane.   The tile expert forums go with it over the flange; seemingly the general contractor forums suggest above. Most forums suggests a vapor barrier even with Hardi Backer.  How does a person make the right decision with so many conflicting viewpoints? I know in other posts, the two options are covered; however, little is discussed with regard to the problem of going over the tub flange causing the drywall plane to be uneven. Shimming for example over 1/4" would seem to be a problem blending the CPU board with the drywall. How is that done successfully?

I'm installing a new bath tub and shower.  I've removed the old tile down to the studs.  Should the backer board be in front of or behind the tub flange?  I put it on the rear tub wall from floor to ceiling at first, but I can easily remove it if it should go OVER the tub flange.


I'm experimenting with the excel2latex tool to quickly get my Excel tables to latex code. However if I check the use booktabs package option in the Excel2Latex AddIn and paste my code into Latex I get some vertical space which is not filled by border or by background color. If I disable the booktabs option it just works fine.  So my Question is: How can I use the booktabs package with a complete background color fill and closed borders?  See my MWE and Screenshots below or visit   \documentclass{article} \usepackage[utf8]{inputenc} \usepackage{tabularx, booktabs, multirow} \usepackage[table]{xcolor} \usepackage{graphicx} \usepackage{bigstrut}  \begin{document}  % Table generated by Excel2LaTeX from sheet 'Tabelle1' \begin{table}[h]   \centering   \caption{Add caption}     \begin{tabular}{|r|r|r|}     \toprule     1 & 2 & 23 \\     \midrule     12 & 2 & 2 \\     \midrule     13 & 1 & 1 \\     \bottomrule     \end{tabular}%   \label{tab:addlabel}% \end{table}%   % Table generated by Excel2LaTeX from sheet 'Tabelle1' without bookstabs \begin{table}[h]   \centering   \caption{Add caption}     \begin{tabular}{|r|r|r|}     \hline     1 & 2 & 23 \bigstrut\\     \hline     12 & 2 & 2 \bigstrut\\     \hline     13 & 1 & 1 \bigstrut\\     \hline     \end{tabular}%   \label{tab:addlabel}% \end{table}%   \end{document}   Table Image:


I have these two lists:  salePrices = [9.95, 14.95, 19.95, 24.95, 29.95, 34.95, 39.95, 44.95, 49.95] percents = [5, 10, 15, 20, 25, 30, 35, 40, 45, 50]   And then, using this for loop, I iterate through each percent and calculate the discounted price.  for percent in percents:      for salePrice in salePrices:          newPrice = salePrice - ((percent / 100) * salePrice)          print("\t" + "{0:.2f}".format(newPrice), end = " ")      print()   This all works fine, except for one issue: some of the values calculated are not rounded properly.   For instance, 14.95 - (0.1 * 14.95) = 13.455, which should be rounded to 13.46 by .format(). However, the value printed is 13.45.  Is there something I am doing wrong, or is it a problem with the method, format, itself?

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


I would like to create a python multi-dimensional empty list without very long codes. So I tried this:   a = [[[]] * 2] * 2     It turns out that when I print(a), I got the multi-dimensional empty list:     [[[], []], [[], []]]   But when I append something into one of the empty list:     a[0][0].append(np.array((1.5,2.5)))     All the empty lists got this np.array:     [[[array([1.5, 2.5])], [array([1.5, 2.5])]], [[array([1.5, 2.5])], [array([1.5, 2.5])]]]     But if I create the multi-dimensional empty list like below:  b = []   for i in range(2):        c = []       for j in range(2):           c.append(([]))       b.append(c)     It works. When I print(b), I still got:    [[[], []], [[], []]]     But when I do   b[0][0].append(np.array((1.6,2.6)))    then print(b), I got:    [[[array([1.6, 2.6])], []], [[], []]]     which is what I want.    Why is does happen?  I am using Python 3.6.8  This is my codes:  This is wrong:  a = [[[]] * 2] * 2   print(a)   a[0][0].append(np.array((1.5,2.5)))   print(a)     This is what I want:  b = []   for i in range(2):       c = []       for j in range(2):           c.append(([]))       b.append(c)   print(b)   b[0][0].append(np.array((1.6,2.6)))   print(b)     Why a = [[[]] * 2] * 2 cannot work, and how can I create this shortly? Thanks!

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?


Find an equation of the plane that passes through the point $(1, 3, 1)$ and contains the line: $x = t, y = t$ and $z = -2 + t$.    My attempt:  The points are $(1,3,1), (0,0,-2)$ and if $t = 1$: $(1,,1,-1)$  $a = (1,1,-1) - (0,0,-2) = [1,1,1]$  $b = (1,1,-1) - (1,3,1) = [0,-2,-2]$  normal vector is $n = a \times b = 2j - 2k = [0,2,-2]$  Therefore the equation is found by $[0,2,-2] \cdot [x-1, y-3, z-1] = 0$  $\leftrightarrow 2y -2z = 4$  $\leftrightarrow y - z = 2$  right?

Determine the equation of the plane that contains the point $(4,2,-1)$   and also the line $L: (1,1,1) + t(-2,0,3)$ for $t\in\mathbb{R}$.   The direction vector $(-2,0,3)$ of the line is also a direction vector for the plane.  We can get a vector orthogonal to the plane by solving  $$(x,y,z) \cdot (-2,0,3) = 0$$  $$-2x+3z = 0$$  One valid solution would be $(3,1,2)$.  So we have that $(3,1,2)$ is orthogonal to the plane. And since $(4,2,-1)$ belongs to it, a normal equation for the plane can be calculated this way:  $$(x,y,z)\cdot (3,1,2) = (4,2,-1) \cdot (3,1,2)$$  $$3x+y+2z = 12$$    But that's wrong. If the plane contains the line $L$, it should also contain the point  $$(1,1,1)+5\cdot(-2,0,3) = (-9,1,16)$$  But it doesn't:  $$3(-9)+(1)+2(16) = -27 + 1 + 32 = 8 \not = 12$$  What did I do wrong?


I want to solve:  Show that, in $\mathbb Q[x]$ (rationals), the polynomial $(x-1)^2$ divides a $zx^{z+1} – (z+1)x^{z}+1$, where $z \geq 1$ is any integer  I am really lost with this one, don't know how to aproach it

Prove that the polynomial $f_n(x)=nx^{n+1}-(n+1)x^n+1$ is divisible by $(x-1)^2$  where $n\in\Bbb{N_1}$.  My Attempt   I've tried proving it by induction but can't find a way to prove it for $n+1$ after assuming it holds for $n$; I've also checked it graphically, it seems that for all $n$ $f_n$ intersects the axes at $(0,1)$ and $(1,0)$; I've also tried finding a factor $k$ such that $(x-1)^2k=f_n(x)$ for $n=3, n=4$ on WA but with no luck.


Trying to upgrade to new LTS  Get error ... cannot calculate upgrade... and the upgrade stops.  In /var/log/dist-upgrade/main.log :   2014-08-22 03:42:25,357 ERROR Dist-upgrade failed: 'The package 'update-manager-kde' is marked for removal but it is in the removal blacklist.'   Too scared to manually remove a package that is named update-manager-kde!

An unresolvable problem occurred while calculating the upgrade:   The package 'unity' is marked for removal but it is in the removal blacklist.   This can be caused by:   * Upgrading to a pre-release version of Ubuntu  * Running the current pre-release version of Ubuntu  * Unofficial software packages not provided by Ubuntu   If none of this applies, then please report this bug using the  command 'ubuntu-bug ubuntu-release-upgrader-core' in a terminal.   What shall i do? Do i need to remove untiy from blacklist but how?


I have a list, that I wanted to convert to a dictionary.    L =   [         is_text,         is_archive,         is_hidden,         is_system_file,         is_xhtml,         is_audio,         is_video,        is_unrecognised      ]   Is there any way to do this, can I convert to dictionary like this by program:  {     "is_text": is_text,      "is_archive": is_archive,      "is_hidden" :  is_hidden     "is_system_file": is_system_file     "is_xhtml": is_xhtml,      "is_audio": is_audio,      "is_video": is_video,     "is_unrecognised": is_unrecognised }   Variables are boolean here.  So that I can easily pass this dictionary to my function   def updateFileAttributes(self, file_attributes):     m = models.FileAttributes(**file_attributes)     m.save()

I have enum and use the variables like myEnum.SomeNameA, myEnum.SomeNameB, etc.  When I return one of these variables from a function, can I print their names (such as myEnum.SomeNameA) instead of the value they returned?


I have been working on fixing the issue of Ubuntu freeze. All of a sudden the system freezes and I had to restart it. I have followed a solution posted on the . According to this I selected the Nvidia driver package as follows.    The actual option was the 3rd. I selected the first one and since then the system never froze till now. But I am seeing some pixels on the screen which are out of place. And this is happening quite often but there was no freeze at all.   The following is the image of the out of order pixels on the home page.    Could some one help me with the fixing the pixel problem? Should I install some other display driver?


I have a weird question about this post:    There are two answers posted by one person (I will call him simply "the user" because it doesn't really matter who it was).  This is what appears to have happened:   The question was posted. The user posted  and the consensus by other people was that this answer was correct because it has 2 upvotes. OP decided to update the question with more information. The user decided to post  that reflects the additional information.  It is a different answer in general, too. In the meantime, other people gave answers that aren't duplicates of anything else there. OP accepts the second answer by that one user.     Since the answers are different (because they're based on different amounts of info provided in the question), is it okay that the one user posted two answers?  Or, since it's a new user, maybe they just didn't know to update the old post.    Since one has upvotes and the other is accepted, would it even make sense to edit the answers together and flag a moderator to delete one?  The user would lose a fair amount of points to have either answer removed, seeing as they don't have much rep to begin with.    tl;dr?  Someone posted two answers; one is accepted, the other has upvotes.  Do I flag it or ignore it?     Edit:  I think I have my answer already but let me just clarify something... the first answer this user gave is no longer relevant anymore since OP provided some more code to clarify the issue.  It's text contains just this:      This part of code is correct, there might be some problem in the Login section of the code, where you create these SESSION variable.     It's not like it's two valid but different approaches to solve the same exact question....  The second answer given by that user shows how to correct specific parts of the code in question.

When is it okay to post two answers to one question?


In the sentence     He is gone   Is 'is' a a helping verb, as if to say "he has gone". Or is "gone" a complement meaning not present?

I understand "He is gone" or "Winter is gone" is the common usage.  But is "She is come" or "Spring is come" as common?


I'm trying to figure out a solution to this. When I search for a phrase in Spotlight, it shows me the file which contains the search phrase. However my file is around 12000 lines and I was wondering if there is a way/shortcut in Spotlight itself that can take me to the keyword in the Preview pane? I would appreciate if anyone points in to another similar tool. I don't necessarily want a text only search tool but a more general search tool like Spotlight! Thanks in advance.

When searching for specific words inside documents, upon getting the results, is there a way to then preview in the document where that word occurs without having to first open the document and perform the search again within the application?  Ideally, I'd like to hit spacebar and have the preview jump to that section of the document of the first occurrence of the word.  Would also consider 3rd party search tools if that provided the functionality.