Receiving a product after getting a refund

Last week I ordered 2 kits of impact drivers due to the unbelievably low price.  The product was discounted from 300EUR to 100, so I bought 2 of them. Next day I received an email from the company, that the given price was a mistake and that the order will be cancelled any my money was refunded.  But to my surprise, today I received the package that I have ordered, but my money was already refunded so I haven't paid for them but receive them. What should I do next? I ordered from the UK and it was shipped to Slovenia - both EU countries.


According to the answers here at meta, you can lose privileges when you e.g. spend your reputation on bounties. What is the rationale behind that?  By my opinion, it would be more natural if the privileges are persistent once gained. The user is given privileges once he was "tested" by the community. He has to spend some time at the site to gain reputation and see how it works. We consider him trustworthy then.  Once the person is trustworthy, what makes him untrustworthy when he spends his reputation on bounties? Does he become a beginner then? Will he suddenly forget everything he learned at SO?  P.S.: I would understand it for negative points from downvotes (or penalties, if there are any). But when placing bounties.... or when your answers are migrated (I don't know if you lose points in this situation) I don't really see any reason to lose privileges.


I found out that even the users less than 1000 rep has expanded usercards, like me. In the privilege of the established user, the usercard section is gone. When did this change apply?


Where is the flaw in this "proof" that 1=2? (Derivative of repeated addition)

Consider the following:   $1 = 1^2$ $2 + 2 = 2^2$ $3 + 3 + 3 = 3^2$   Therefore,   $\underbrace{x + x + x + \ldots + x}_{x \textrm{ times}}= x^2$   Take the derivative of lhs and rhs and we get:   $\underbrace{1 + 1 + 1 + \ldots + 1}_{x \textrm{ times}} = 2x$   Which simplifies to:   $x = 2x$   and hence    $1 = 2$.     Clearly something is wrong but I am unable pinpoint my mistake.


The usual \rightarrow has its long version \longrightarrow, exactly as \mapsto has its long version \longmapsto. I was wondering if there exists a basic command for a long \hookrightarrowas well. The stupid try \longhookrightarrrow sadly doesn't work.


Lean C development environment on Ubuntu 14.04

I need a very lean system with minimum of packages installed for development in C programming language.  I know about build-essential meta-package but it's too big for my intents as I'm just working with C, not C++ etc.  I've tried to install just gcc but it still requires a lot of extra packages. What is the best approach to get the bare minimum for C development of Ubuntu 14.04?


So I am trying to add a ppa and when using     add-apt-repository     I get    apt-add-repository: command not found    I tried to do    sudo apt-get Install apt-add-repository     and there is no file to download  I need to install this ppa Thanks in advance


How to define a vector of a templated using member of a templated class?

The compiler (g++-7) emits an error when compiling the following code:  #include <vector>  template<typename MetricType, typename DataType> class Label {   public:     using metric_type = Label<MetricType, int>;      template<typename LabelDataType> using label_type = Label<MetricType, LabelDataType>;   // ... };  template<typename LabelType> class Raptor {   public:     std::vector<typename LabelType::metric_type> works;      std::vector<typename LabelType::label_type<int> > throws_an_error; };  int main() {   Raptor<Label<int, int> > raptor;   return 0; }   The error message is  main.cpp:17:53: error: template argument 1 is invalid      std::vector<typename LabelType::label_type<int> > throws_an_error;                                                      ^ main.cpp:17:53: error: template argument 2 is invalid make[2]: *** [CMakeFiles/bin.dir/build.make:63: CMakeFiles/bin.dir/main.cpp.o] Error 1 make[1]: *** [CMakeFiles/Makefile2:73: CMakeFiles/bin.dir/all] Error 2 make: *** [Makefile:84: all] Error 2   I tried giving the std::vector an empty struct as the second template argument, but the error message stays the same.  I have no idea what this error message means and how to make this code compile. Especially I'm confused, because the field works does not produce any errors, also when commenting the errorneous field out, but the types metric_type and label_type<int> are equal.


Short story where artificial life gets out of control

Please bear with me, memories are vague. I'm looking for the name of a short scifi story, by a fairly prominent author IIRC, where a person was evolving "pet artificial life" in their basement. Written circa 2000, I think.  As the story proceeded the life got increasingly more complex. It started off simple but became gradually more well-defined and intelligent, resembling organisms, and later evolved a civilization. The evolution kept speeding up until one day the person came back to find his "artificial creatures" managed to break out of the confinement he imposed on them. The civilization basically became smarter than humans, and escaped ?into another dimension? via some new physics it invented, in a singularity event.  I'm not 100% sure, but I think the life was digital = evolving in a computer. But I may be wrong about that. In any case, the life was super tiny / not visible, so if not digital, maybe microscopic / nanotech or something.  Fairly short, perhaps 20 pages in total.  What I remember from the story is that the person tried to set up restrictions for what his creation could do without harming them, making the constraints ever more sophisticated as the life became smarter and smarter. But in the end, they managed to escape anyway (they vanished, basically, without harming the person or anyone else).  EDIT: I just went through short stories of Ted Chiang, because I thought it might have been him. But no luck there :(


I am making a Atari Breakout game with unitys 2d tools and I need to get the ball to bounce of colliders in the scene. If you havent played the game before how it works is if the ball hits the wall at 45 degrees it will bounce of the wall at the same angle (diagram bellow)    How can I get the ball to move at a continues speed and when it hits a collider to bounce back the way the image shows?


Local diffeomorphism from $\mathbb R^2$ onto $S^2$

Is there any local diffeomorphism from $\mathbb R^2$ onto $S^2$?


Python - Identify String and integer from a string

Say for example you have a variable with a string which contains x = '2 C', meaning 2 of clubs.  Is there a way of extracting the string (c) and storing it in a variable, i.e. string_var.   Then extract the number (2) into a different variable, i.e. number_var.


Initial value problem, show y(x) = 1-x is a solution

I'm not really sure on how to go about solving this problem...  Consider the initial value problem.       $$y' (x) = \frac{1}{2}(-x + \sqrt{x^2 + 4y})$$   $$y(2) = -1$$   $a)$ Show that $y(x) = 1-x$ and $y(x) = -\frac{x^2}{4}$ are two solutions to the above IVP.


What's the best way to get a regular anchor () to submit the form it is embedded in when clicked?  <form>

                 The link could be embedded at any level                 in the form, so "this.parentNode.parentNode..." is no good. :(

 </form>   I know that the easiest way using jQuery would be  $('#myLink').click(function() {     $(this).parents('form:first').submit(); });   ...but I'm trying to find a way to do this without using a library.    Edit: I'm really trying to find a method which doesn't require knowledge of the form (eg: its name, id, etc). This would be similar to how you could put this on an input element: <input onclick="this.form.submit()" />


Prove $2^n-1$ is divisible by $(2^m-1)^2$ iff...

Prove that for any $m,n\in\mathbb{Z}^+$, the number $2^n-1$ is divisible by $(2^m-1)^2$ iff the number $n$ is divisible by $m(2^m-1)$.  My work so far:  It's an if and only if statement, so the common approach is to split the proof into two "if then" proofs ($A\rightarrow B \text{ and } B\rightarrow A$).  Starting with $A\rightarrow B$, for a direct proof, I would assume $A$ and prove $B$. I can use the definition of divisibility:  Assume $n=m(2^m-1)k$ for some integer $k$  Then I need to prove that $2^n-1=(2^m-1)^2h$ for some integer $h$  So I'm thinking I need to start with the expression $2^n-1$ and transform it to $(2^m-1)^2h$, or vice versa, and I need to use the assumption $n=m(2^m-1)k$ somehow.  I notice that the LS of the equality contains the variable $n$ while the RS contains $m$, and the assumption relates $n$ to $m$, so that could be a way forward. For example, simple substitution gives $2^{m(2^m-1)k}-1$, but I'm not sure what I could do from here. Perhaps there's a divisibility theorem that could help?  Other things I notice: $2^n-1$ and $(2^m-1)^2$ are always odd. Also, the divisors in both cases are multiples of $2^m-1$.  Any help/hints appreciated.


Is it possible with Google searches to ban any and all results from a domain?

Is it possible to configure Google somehow to permanently ban search results from domains that I know 100% are never, ever going to make me happy?  Something cookie/session based maybe?  E.g. I want to ban (permanently, forever and always) results from experts-exchange.com.  Every time I click results that take me to their page I just want to scream.    Update!  Google has released a Chrome Extension to allow users to block individual site from Google search results!  .  (Since this question has been closed, I cannot answer it.)


What crews are best for maximizing my heist returns?

I realized after the first heist that I could have made a better choice of crew in order to maximize my returns (since certain people end up costing more due to scripted events). Regardless of difficulty, what crew members should I choose in the heist missions in order to make the most money?  I know that the answer isn't always "pick the cheapest". E.g., on the jewel heist, the gunman with the least experience doesn't steal as much as the experienced one, and his casualty costs (in the scripted event) further cut into the take-home.


Disable "left swipe gesture / app switching" in Windows 10 on Surface 3

Is it possible to disable 'left swipe / gesture' or 'App Switching' in tablet mode on a Surface 3? I am Left Handed and whenever I use the 'Pen' in One note, my palm rests on the left hand edge and opens up the App Switch view constantly. I have disabled tablet mode, disabled the keyboard, disabled Task View, had to move the task bar to the right so I don't hit the start button with my left hand, got 'Left Handed' set up in Device Settings for the pen, disabled Arrange Windows under Multi Tasking - any other left handers got this issue and fixed it? This is only an issue for me in tablet mode when using the pen in One note. Many thanks


Attempt to prove Fermat's Last Theorem n = 3.

My previous attempt at proof did not work as I thought and so I decided to try again. Please bear in mind that this is not a duplicate of my old proof. If you look at the other one you will see that this examines the parity of the equation, something the previous attempt does not do. This time I have based my attempt on induction rather than algebra.  To begin with, I examined the equation: $$ A^3 + B^3 = C^3$$ Where $A$, $B$, $C$ $\in \Bbb Z$ and $A$, $B$, $C > 0$. We can also assume that $A, B, C$ are the lowest solutions. Therefore, $A^3, B^3, C^3$ are co-prime.   Examining this, we should be able to draw conclusions on each term's parity. In this form, we could have: $$(1)EVEN + ODD = ODD$$ $$(2)ODD + ODD = EVEN$$ $$(3)EVEN + EVEN = EVEN$$  However, equation $3$ is not possible as we know that $A^3, B^3, C^3$ are the lowest solutions possible and are co-prime. Therefore, we are left only with $1$ and $2$.    My previous attempted solution involved rewriting the equation in terms of $A^3$: $$A^3 + xA^3 = C^3$$ Here $x$ is either an integer, irrational or fraction. If it is an integer we get: $$(1+x)A^3 = C^3$$ Since $x \in \Bbb Z$, $x+1 \in \Bbb Z$. Therefore, $\sqrt[3]{x+1} \in \Bbb Z$ and $\sqrt[3]{x} \in \Bbb Z$. The only possible integer solution to this is $x = 0$. However, this would mean that $B^3 = 0$.  Therefore, $x$ is irrational or a fraction. If $x$ is irrational, $B^3$ will be irrational.  Therefore, $x$ is a fraction.  We can now represent this in the equation: $$A^3 + \frac{p^3}{q^3}A^3 = C^3$$ Where $p,q \in \Bbb Z$. The reason the fraction can be represented as such is because that is the ratio of $A^3$ to $B^3$. Even if $p^3$ and $q^3$ did share factors they could be simplified to still be cubes. (For example, $\frac{64}{8} = 8$.)  Simplifying this further we get: $$(qA)^3 + (pA)^3 = (qC)^3$$  We shall begin by analysing $qA$. We know from earlier that this is either odd or even. If we assume it is even, then either: $$\frac{A}{2} \in \Bbb Z , \frac{q}{2} \notin \Bbb Z$$ or $$\frac{A}{2} \notin \Bbb Z , \frac{q}{2} \in \Bbb Z$$  or $$\frac{A}{2} \in \Bbb Z , \frac{q}{2} \in \Bbb Z$$  Analysing $pA$, we can see from before that $pA$ must be odd. Therefore: $$\frac{A}{2} \notin \Bbb Z , \frac{p}{2} \notin \Bbb Z$$ This means we can compare this with the other possible parities of $A$ to give:  $$\frac{A}{2} \notin \Bbb Z$$ $$\frac{p}{2} \notin \Bbb Z$$ $$\frac{q}{2} \in \Bbb Z$$  Substituting this all into our equation gives us: $$(EVEN)^3 + (ODD)^3 = (EVEN)^3$$ $$EVEN + ODD = EVEN$$  This clearly is incorrect and so our original assumption, that there are integer solutions to the below is incorrect. $$A^3 + B^3 = C^3$$  Q.E.D. (Hopefully.) Is this correct? I cannot find anything wrong with it unlike my previous one. Thank you.


I have this code:  double timeTillTick = 15.0; private void lower_Tick(object sender, EventArgs e) {     if (timeTillClear > 0)     {         timeTillClear -= 0.1;         clearingIn10SecondsToolStripMenuItem.Text = "Clearing in " + timeTillClear + " seconds.";     }     else     {         lower.Enabled = false;     } }   lower ticks once every 100 milliseconds. When it:   Gets to 8 Gets to 5 Gets to 1   it increases by 0.000000000000001. Why?


How to change the terminal title and the prompt path to show only the current working directory’s name?

I use Terminator terminal. As you can see from the screenshot below, everywhere it shows the directory names. Instead of showing whole directory names, I want it to show only the last directory name i.e ecommerce in this case. Is there a way to do this?


Let $S$ be any set of axioms extending ZF. Suppose $\phi_1, ... \phi_n \in S$. Show that, if from $\phi_1, ... \phi_n$ one can prove all axioms of $S$, then $S$ is inconsistent. Conclude that ZF is not finitely axiomatizable.  So in order to show that $S$ is inconsistent, I need to show $S \vdash (\phi_1 \land ... \land\phi_n )$ and $S \vdash \lnot (\phi_1 \land ... \land\phi_n )$. But how do I do this and how do I conclude that ZF is not finitely axiomatizable?


Easy Photoshop action or other Adobe automation to generate stylised stacked images

In my job I need to often showcase screens of our work. I find it's very stylish to showcase images like this one:       Is there an easy way to do this in any Adobe software -- PS, or Fireworks, or Illustrator -- so that all I need to do is add images and all the rest is done automatically? I know actions are one kind of automation, but perhaps there are other tricks which I don't even know how to ask for. Basically I want to make this simple for "business users" to add images to via drag and drop, or file-open, and not tinker with the actual stylisation.   Welcome any thoughts, and ideally any pointers to these types of styles. Variations I can think of are showing images inside a large iMac or iPad kept next to each other.   Thank you.


Recovering unwanted lost partitions while installing Ubuntu 18.04

I was trying to install Ubuntu 18.04 (through live bootable USB Flash Drive) over Drive C: of Windows, thus replacing Windows with Ubuntu. I wanted to have only Drive C: formatted and two other Drives(D: and E:) remain intact. In the installation phase, I chose "Use LVM with the new Ubuntu installation" but after warning appeared saying that "all your drives will be formatted", I changed my mind, but it was late and I had my drives integrated into one "dev/sda2/" partition with file system as "lvm2-pv" and Mount Point as "ubuntu vg" that contains all the capacity of the Hard Drive. May someone help me with returning those other two partitions(D: & E:) back? I didn't used up any space of that newly created partition (and also haven't installed Ubuntu yet) and am using live version of Ubuntu. These images show drives that I can access to (the second picture is after I scroll down the window bar)


List Local and Global Key Bindings in Mac OS X

Can someone help with a solution to list key bindings being used by an OS X application, as well as global bindings being used by all applications?  Ideally, there would be a way to specify bindings for a single key combination, such as:  Ctrl-P or Opt-Cmd-Z  as well as getting a comprehensive text dump of current bindings for all keys.  For my purposes this doesn't need to be fancy: A Bash or AppleScript would be fine. Of course, a dedicated GUI utility would be great, if such a thing exists.


Any infinite dimensional vector space has a basis?

How should I prove that any infinite dimensional vector space has a basis? I have heard that there is a proof using Zorn's Lemma but I do not know how. In addition, are there different approaches/proofs to this problem?


I've tried this example from OpenBSD   it works fine, but with Mozilla Firefox 6.0 it's possible to use both http and https, while I want to force users to use only HTTPS. How can I achieve this?  Thanks!


How could I go about detecting (returning true/false) whether an ArrayList contains more than one of the same element in Java?  Many thanks, Terry  Edit Forgot to mention that I am not looking to compare "Blocks" with each other but their integer values. Each "block" has an int and this is what makes them different. I find the int of a particular Block by calling a method named "getNum" (e.g. table1[0][2].getNum();


Dimension too large for TikZ modulo arithmetic

\documentclass[a4paper,10pt]{article} \usepackage[utf8]{inputenc}  \usepackage{tikz}  \usepackage{ifthen}  \usetikzlibrary{calc}   \begin{document}  \def\sides{50}  \pgfmathsetmacro\lmu{\sides -1}  \begin{tikzpicture}    \foreach \i in {0,...,\lmu} \draw (\i *360/\sides:3cm) node(\i){\i};   \foreach \i in {0,...,\lmu} \draw let \n1={int(mod(\i+2,\sides))} in (\i) -- (\n1); \end{tikzpicture}  \end{document}   I try to do some modulo >40 pictures. I found particularly useful the code in . But now I found a dimension too large-limitation. Does anybody know how to overcome this?


How to stop meatballs falling apart when frying

I tried cooking meatballs as a change to what I usually cook but I found that they didn't stay together when being fried.  I made the meatballs with about 500g of mince, a chopped onion, some herbs and a beaten egg. I then mixed everything up in a mixing bowl and then fried.  After I realised that they weren't saying together when being fried I tried adding another egg, but it still didn't help.  Does anyone have any suggestions as to what I did wrong, or what I could try next time?


Exporting a PDF from QGIS Print Composer for Avenza Pdf Maps

Alright I actually did this successfully a few months back following these steps .    Now when I bring the map into Avenza, I get a "Map Not Referenced"  Now I have no clue what I am doing wrong.  I have tried and tried.  I have unistalled and reinstalled.  Tried to export as image then convert format.    A strange thing to note, I can not select reference map under Print Composer-> Export Settings -> Reference Map.


For $c > 0,$ find the limit, lim$_{n \to \infty}  n(\sqrt[n]{c} - 1)$   Ok, I am not exactly on sure how to do this. Though here are some of my thoughts:    lim$_{n \to \infty} (nc^{1/n} - n) = nc^0 - n = 0,$ and I don't think this can be correct logically. Also, I think we can make it a $\log$ function by doing it like this:  $(nc^{1/n} - n) = e^{\log(nc^{1/n} - n)}.$ But, then what? We can't distribute the log inside because that's not correct. I am lost. Any help?   Update: please don't mark this as a duplicate of , since the other question was not required to use L'hopital's rule, but I need to use that in my question.


How do I make the login screens and boot splashes match when installing different desktops?

I wanted to try out different desktop environments so I installed XFCE, KDE, GNOME, etc on top of Unity in Ubuntu 12.04  After a while I decided that I didn't like those other DEs and would stick to Unity. So I changed my default DE to Unity by configuring gdm.  sudo dpkg-reconfigure gdm   Now I am able to choose my DE at login time and all of DEs are working properly.   But the strange thing is that my boot up screen says 'lubuntu', my login screen is KDE, and my desktop is Unity.   How and why is this happening? Why didn't my gdm configuration have any effect? Does login and boot up screen need to be configured separately from the DE?  There are other similar questions here but they are not the same as this one. I do not want to remove the other enviroments I'm quite happy with having a list of DEs to select from. I want to know how to set proper defaults.


I can't figure out how to fix the nullpointererror in Java

I am writing a program that takes a file and writes it's contents to an array. Then the array is sorted with a selection sort algorithm and then can be searched using the binary search algorithm. The array can not have more than 100 elements and I can't use user-defined classes.  /*Griffen Fox   CS 110   Assignment 5   Question 1 */ import java.util.Scanner; import java.io.*; public class WordsSearchProgram {    public static void main(String[] args)throws IOException    {       //Loads Words.txt to an array       final int SIZE = 100; //Size of the array       String[] words = new String[SIZE]; // creates the array       int index = 0; // Loop Control Variable        //Opens the File       File file = new File("words.txt");       Scanner inputFile = new Scanner(file);        //Reads Contents Into Array       while (inputFile.hasNext() && index < words.length)       {          words[index] = inputFile.nextLine();          index++;       }        //Close File       inputFile.close();       int search;       for (index = 0; index < words.length; index++)         {            search = searchString(words, words[index]);             if (search >= 0)           {               System.out.println(words[index] + " is at index " + search);            }            else           {               System.out.println(words[index] + " is not in the array.");            }          }       }     //Selection Sort Algorithm     public static String[] sort(String[] words)     {       for (int i = words.length - 1; i >= 1; i--)       {        // Find the maximum in the list[0..i]        String  currentMax = words[0];        int currentMaxIndex = 0;           for (int j = 1; j <= i; j++)          {             if (currentMax.compareTo(words[j]) < 0)              {                currentMax = words[j];                currentMaxIndex = j;             }          }         // Swap list[i] with list[currentMaxIndex] if necessary;        if (currentMaxIndex != i)         {          words[currentMaxIndex] = words[i];          words[i] = currentMax;        }        }       return words;       }       //Binary Search String       public static int searchString(String[] words, String key)        {            int first = 0;            int last  = words.length;          int position = -1;          boolean found = false;             while (!found && first <= last)          {               int mid = ((first + last) / 2);               if (key.compareTo(words[mid]) == 0)              {                  found = true;                position = mid;               }             else if (key.compareTo(words[mid]) > 0)              {                  first = mid - 1;               }              else              {                  first = mid + 1;               }              }            return position;         } }


What does a "closed-form solution" mean?

I have come across the term "closed-form solution" quite often. What does a closed-form solution mean? How does one determine if a close-form solution exists for a given problem? Searching online, I found some information, but nothing in the context of developing a statistical or probabilistic model / solution.   I understand regression very well, so if any one can explain the concept with reference to regression or model-fitting, it will be easy to consume. :)


The following sentence appeared in an article: "I would say 94,504 bitcoins is real folding money, but you can't fold bitcoins." A colleague said that it should have been 'are' instead of 'is.' I am torn as to whether he is correct because 'bitcoins' is plural or incorrect because '94,504 bitcoins' is a singular concept that is being equated to another singular idiom.  I think he's incorrect because 'five eggs is enough' is correct and you rarely equate a plural noun with a singular noun; 'apples are orange' doesn't work.


Ubuntu 16.04 - Can't run software update or apt-get-update

I am running Ubuntu 16.04. I haven't been able to update the software in months because I keep getting this message. I tried switching between servers. That's not it. Tried updating the expired keys. Still no luck. Please help me resolve this. I can't even upgrade to a newer version of Ubuntu to fix it. Nothing works.  I am also wondering if this has to do with the Trust software providers section of the software updated being empty. Here is a screenshot:   Software Updater gives me the following:     Failed to download repository information. Check your internet   conntection.   Can't run sudo-apt-get-update. I get this message:  Ign:1 http://dl.google.com/linux/chrome/deb stable InRelease  Hit:2 http://us.archive.ubuntu.com/ubuntu xenial InRelease                   Hit:3 http://dl.google.com/linux/chrome/deb stable Release             Hit:4 http://us.archive.ubuntu.com/ubuntu xenial-updates InRelease     Hit:5 http://us.archive.ubuntu.com/ubuntu xenial-security InRelease    Hit:6 http://ppa.launchpad.net/gambas-team/gambas3/ubuntu xenial InRelease                                Hit:7 http://archive.canonical.com/ubuntu wily InRelease                     Ign:8 http://download.opensuse.org/repositories/home:/Horst3180/xUbuntu_16.04 InRelease  Hit:10 http://ppa.launchpad.net/i-nex-development-team/daily/ubuntu xenial InRelease  Hit:11 http://ppa.launchpad.net/mjblenner/ppa-hal/ubuntu xenial InRelease  Hit:12 http://download.opensuse.org/repositories/home:/Horst3180/xUbuntu_16.04 Release  Hit:13 http://ppa.launchpad.net/pipelight/stable/ubuntu xenial InRelease  Hit:14 http://ppa.launchpad.net/team-xbmc/ppa/ubuntu xenial InRelease  Hit:15 http://ppa.launchpad.net/webupd8team/java/ubuntu xenial InRelease  Hit:16 https://deb.opera.com/opera-stable stable InRelease  Err:17 http://download.opensuse.org/repositories/home:/Horst3180/xUbuntu_16.04 Release.gpg    The following signatures were invalid: KEYEXPIRED 1496576244 Reading package lists... Done   W: An error occurred during the signature verification. The repository is not updated and the previous index files will be used.  GPG error: http://download.opensuse.org/repositories/home:/Horst3180/xUbuntu_16.04 Release: The following signatures were invalid: KEYEXPIRED 1496576244 W: Failed to fetch http://download.opensuse.org/repositories/home:/Horst3180/xUbuntu_16.04/Release.gpg The following signatures were invalid: KEYEXPIRED 1496576244  W: Some index files failed to download. They have been ignored, or old ones used instead.  http://download.opensuse.org/repositories/home:/Horst3180/xUbuntu_16.04/Release.gpg The following signatures were invalid: KEYEXPIRED 1496576244  W: Some index files failed to download. They have been ignored, or old ones used instead.   I then tried updating the keys:  for K in $(apt-key list | grep expired | cut -d '/' -f2 | cut -d' '-f1); do sudo apt-key adv --recv-keys --keyserver keys.gnupg.net $K; done    And output:  Executing: /tmp/tmp.5NRsQ5oSoL/gpg.1.sh --recv-keys --keyserver keys.gnupg.net BEB6D886 gpg: requesting key BEB6D886 from hkp server keys.gnupg.net gpg: key BEB6D886: "home:Horst3180 OBS  Project <home:Horst3180@build.opensuse.org>" not changed gpg: Total number processed: 1 gpg: unchanged: 1 Executing: /tmp/tmp.ctjucxHt4s/gpg.1.sh --recv-keys  --keyserver keys.gnupg.net F6D61D45 gpg: requesting key F6D61D45 from hkp server keys.gnupg.net gpg: key F6D61D45: "Opera Software Archive Automatic Signing Key 2015 <packager@opera.com>"  not changed gpg: Total number processed: 1 gpg: unchanged: 1


Mid-80s cartoon with 4-5 robots with "special powers" to zap things; had a scene with a kraken chase on an ice world

Does anyone remember a cartoon with 4-5 humanoid robots on Saturday morning in the mid-80s?  As far as I can remember, they had "powers" to zap things and maybe fly but I don't remember much of the story/plot/enemies/powers.  I don't remember humans in the show.  One scene I remember was the were on some ice world and were being chased by this huge polar kraken type monster.  They got cornered at the edge of this ice sheet and some water.  One of the robots (the leader I guess) asked if someone had any power to do anything.  They all looked at each other and one of the female robots said she did and zapped the ice sheet so they floated away from the kraken.  However, since all of them ran out of power, they couldn't do anything except stand on the ice sheet and float in the water.  I don't remember anything after this scene, probably because my parents shut off the TV, or I'm just that old.  It's also possible I caught the re-runs of it, so it's possible it's late 70s or early 80s.


HDD light pulsing every few seconds under Kubuntu 18.04.3 (re-post)

(Sorry to re-post this, I have lost access to my original account.)  I've recently installed Kubuntu 18.04.3 on a new AMD Ryzen 3000-series-based system. The system is installed on a SATA SSD, specifically on an Ext4 partition, with a SATA HDD formatted in NTFS mounted for storage. The system has been in use for a few days, with a maximum uptime of two days (so far).  My issue is this: the HDD indicator light on the case flashes every 1-3 seconds, even when the system is idle, and there is no obvious reason to access the disk. The flashes are not regular: sometimes the light is dark for as long as 3 seconds (obviously it is difficult to time such short intervals -- I am approximating), sometimes there are a few quick pulses less than a second apart. The flashes seem to vary in duration as well -- sometimes very brief, sometimes nearly a second. Unmounting the secondary HDD does not appear to have any effect.  Some searching lead me to try iotop. I ran sudo iotop -Pao, and waited until 10 flashes of the HDD light had occurred. This is the result:   6887 be/4 root          0.00 B      0.00 B  0.00 %  0.02 % [kworker/u64:1-events_power_efficient]   433 be/3 root          0.00 B      0.00 B  0.00 %  0.02 % [jbd2/sda2-8]  6302 be/4 root          0.00 B      0.00 B  0.00 %  0.01 % [kworker/u64:0-events_unbound]   The "kworker" processes seem to switch between various states, such as "events_power_efficient", "events_unbound", and "events_freezable_power_". The jdb2 process does sometimes write to disk, though that was not observed here (even though, as I said, 10 flashes of the HDD light occurred). The computer was otherwise idle during this test.  My searches also lead me to check /var/log. The result of ls -lth | head is as follows:  -rw-r-----  1 syslog adm             951K Aug 27 19:49 kern.log -rw-r-----  1 syslog adm             594K Aug 27 19:49 syslog -rw-r-----  1 syslog adm             528K Aug 27 19:49 ufw.log -rw-r-----  1 syslog adm              53K Aug 27 19:48 auth.log -rw-r--r--  1 root   root             40K Aug 27 19:15 Xorg.0.log -rw-rw-r--  1 root   utmp             79K Aug 27 18:29 wtmp -rw-r--r--  1 root   root              55 Aug 27 16:28 prime-offload.log -rw-r--r--  1 root   root              30 Aug 27 16:28 prime-supported.log -rw-r--r--  1 root   root            1.2K Aug 27 16:28 gpu-manager.log   I have no experience interpreting log files, so I don't know if anything here is out of the ordinary.  If the kernel version is relevant, the output of uname -r is 5.0.0-25-generic.  My questions are, 1. Why is my HDD light flashing, even though there is no obvious disk activity, 2. Does this indicate some kind of problem with my system that needs to be fixed, and 3. If so, how do I fix it? The light itself does not bother me -- if this is just a sign of a normal, healthy Ubuntu install, then no problem. My concern is that something is wrong, and if so, I would like to fix it.  Thanks in advance for your time.  In response to heynnema (in the original posting of this question), the issue occurs even at the log-in screen, before I log in. So, it is not tied to my user account. However, it does not occur in the BIOS, suggesting that it is specific to Kubuntu (or at least, to the SSD Kubuntu is installed on).


API for user creation in Marketing Cloud not working

I am using the following SOAP envelope for creating a marketing cloud user using SOAP API. I am testing it using POSTMAN, I got a status code 200, so the request went fine, but the user DID NOT get created on SFMC. Could anyone help to check what could be wrong?  Following is SOAP envelope which I am using. Using this the user did not get created in MC-  POST /Service.asmx HTTP/1.1 Host: webservice.s10.exacttarget.com Content-Type: text/xml SOAPAction: Create Cache-Control: no-cache Postman-Token: 23d086a6-6e7f-4c4e-8b7a-c374e440de6a  <soapenv:Envelope xmlns:soapenv="http://schemas.xmlsoap.org/soap/envelope/" xmlns:xsd="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">    <soapenv:Header>       <wsse:Security soapenv:mustUnderstand="1" xmlns:wsse="http://docs.oasis-open.org/wss/2004/01/oasis-200401-wss-wssecurity-secext-1.0.xsd">          <wsse:UsernameToken wsu:Id="UsernameToken-24440876" xmlns:wsu="http://docs.oasis-open.org/wss/2004/01/oasis-200401-wss-wssecurity-utility-1.0.xsd">             <wsse:Username>XXXXXXXXXX</wsse:Username>             <wsse:Password Type="http://docs.oasis-open.org/wss/2004/01/oasis-200401-wss-username-token-profile-1.0#PasswordText">XXXXXXXX</wsse:Password>          </wsse:UsernameToken>       </wsse:Security>    </soapenv:Header>    <soapenv:Body> <createrequest xmlns="http://exacttarget.com/wsdl/partnerAPI">     <objects xsi:type="AccountUser">         <partnerkey xsi:nil="true"></partnerkey>         <objectid xsi:nil="true"></objectid>         <client>             <id>MID_of_the_BU</id>         </client>         <userid>TestAPIuser</userid>         <password>test123456</password>         <name>Test</name>         <email>test@example.com</email>         <activeflag>true</activeflag>         <isapiuserspecified>true</isapiuserspecified>         <isapiuser>true</isapiuser>         <islockedspecified>true</islockedspecified>         <islocked>true</islocked>         <mustchangepassword>true</mustchangepassword>         <mustchangepasswordspecified>true</mustchangepasswordspecified>                      <defaultbusinessunit>MID_of_the_BU</defaultbusinessunit>          <userpermissions>             <useraccess>                 <id>3</id>                  <idspecified>true</idspecified>              </useraccess>          </userpermissions>         <ssoidentities>             <ssoidentity>                 <isactive>true</isactive>                 <federatedid>TestAPIuser</federatedid>             </ssoidentity>         </ssoidentities>     </objects> </createrequest>    </soapenv:Body> </soapenv:Envelope>


how to make sure that the UTC date saved in the database is equivalent to midnight in the specified timezone in Django

I want to save the datetime in the database as midnight for a specific user. I save the timezone on my user object. However, the database keeps saving it as midnight in UTC. Below is the code I am using.   tz_obj = pytz.timezone(user.timezone) start_date = tz_obj.normalize(date_obj.replace(day=1, hour=0, minute=0, second=0, microsecond=0)) end_date = tz_obj.normalize(date_obj.replace(day=calendar.monthrange(date_obj.year, date_obj.month)[1], hour=23, minute=59,                                     second=59, microsecond=99999)) obj = MyObject.objects.create(start=start_date, end=end_date)   Can someone show me how to make sure that the UTC date saved in the database is equivalent to midnight in the specified timezone.  Update Each user could have a different timezone so setting the timezone in the settings file does not solve this problem.


Using multiple values in MySQL query parameters (... IN ('value', 'value')...)

I am connecting to a database on MySQL to read certain data in a VB.NET Form. I am using MySQLCommand parameters to pass in my data, but have been unable to use the IN query with multiple values in the parameters. Here is my query (with pointers to commands):  SELECT time, method FROM test1 WHERE custPin=@CUST AND dataID=@ID AND method IN (@CALLS)   There are upwards of two parameters I need to pass into @CALL, which for examples sake will be test1, test2, test3. These are stored in a list before being looped through and inserted into a string for the parameter, for example we will call testList. Below is my MySQLCommand parameter:  dim testList As String = test1 & " " & test2 & " " & test3 mySQLCommand.Parameters.Add("@CALLS", MySqlDbType.String).Value = testList   I have tried to divide the testList using ,, '<SPACE>', and '', but no dice. When dividing it is putting in random \ into my string.  Is there a better way to use the IN MySQL command with multiple values while using MySQL parameters as above?


Strangest thing...*:  $$\tan^2 10^\circ+\tan^2 50^\circ+\tan^2 70^\circ=9\tag{1}$$  The trick, as always, is how to prove it.   My idea was to add a "missing" tangent and analyze a similar expression:  $$\tan^2 10^\circ+\tan^2 30^\circ+\tan^2 50^\circ+\tan^2 70^\circ$$  ...and then to attack this sum pairwise (first and the last term, second and third). Despite the fact that I got the same angle ($80^\circ$) here and there, I got pretty much nowhere with this approach.   The other interesting fact is that (1) can be rewritten as:  $$\cot^2 20^\circ+\cot^2 40^\circ+\cot^2 80^\circ\tag{1}$$  ...and now the angles are in nice geometric progression. That's the vector of attack that I'm trying to exploit now, but maybe you can entertain youself a little bit too.  *Borrowed from "Usual suspects"


Do you think the use of image data URI is SEO friendly?   On the one hand saves you a HTTP request. On the other hand it really messes up your code. Especially for image files larger than 20KB or moving GIF image files of up to 200KB, the quantity of code inserted is enormous. As Googlebot reads usually from top to bottom, all data after the image data URI encoding will be harder to rank well in Google.   Consider that image data URI is not in the CSS files as they should normally be and for the time being I can use only TinyMCE editor which provides me with just two options, either insert image with the image data URI method or the traditional image link.   I would like to know which is more search engine friendly.


Get value of global scale in in TikZ-picture

I calculate some lengths of a path (without the use of the let operator!). To achieve that I use the \pgfgetlastxy{}{}; command (which works fine so far) but if I scale the picture, the calculations do not make sense anymore, as I cannot take the scaling factor into account. The following code should demonstrate my problem. \documentclass{article} \usepackage{tikz} \tikzset{dot/.style={circle, fill, inner sep=2pt}}  \begin{document}     \begin{tikzpicture}[scale=1]         \draw (0,0) node[below] {scale = 1} -- (20pt,60pt);         \pgfgetlastxy{\myLastX}{\myLastY};         \node[dot, label={right:(\myLastX, \myLastY)}] at (\myLastX, \myLastY) {};     \end{tikzpicture} %     \begin{tikzpicture}[scale=0.5]         \draw (0,0) node[below] {scale = 0.5} -- (20pt,60pt);         \pgfgetlastxy{\myLastX}{\myLastY};          \node[dot, label={right:(\myLastX, \myLastY)}] at (\myLastX, \myLastY) {};     \end{tikzpicture} %     \begin{tikzpicture}[scale=0.5]         \draw (0,0) node[below] {scale = 0.5 (what I want)} -- (20pt,60pt);         \pgfgetlastxy{\myLastX}{\myLastY};          % \getglobalscale{\globalscale} <--- How to get the global value?         \pgfmathsetmacro\globalscale{0.5}         \node[dot, label={right:(\myLastX, \myLastY)}] at (\myLastX/\globalscale, \myLastY/\globalscale) {};     \end{tikzpicture} %     % Does not work     % \begin{tikzpicture}[scale=0.5]     %     \draw (0,0) node[below] {scale = 0.5 (what I want)} -- (20pt,60pt);     %     \pgfgetlastxy{\myLastX}{\myLastY};      %     \pgfkeysgetvalue{/tikz/scale}{\globalscale}     %     \node[dot, label={right:(\myLastX, \myLastY)}] at (\myLastX/\globalscale, \myLastY/\globalscale) {};     % \end{tikzpicture} \end{document}   TL;DR: To solve my (initial) problem I need to get the value of the global picture scale. The way I tried to get it in the last code snippet did not work. Is there any other way to get it?


What to do with an old question that may receive better answers on a different SE?

(Note: I have a specific question in mind but I'm asking this one in the general case as it may apply to others. I've added an explanation for the specific case at the end.)  It can happen that a question is on-topic on more than one Stack Exchange website. Unless I'm mistaken, asking it on either of them is acceptable.  If it is posted on one of the websites but has not received an answer that solves the problem in a timely fashion, and there is reason to think that it can receive better answers on the other website, should it be re-asked on that one?  Migration may not be an option due to the question being .  The question that prompted this one is . I believe it is equally on-topic in Arqade and Superuser, but that the people most qualified to answer it may be on Superuser, as it is essentially about SMB/samba.


i am trying to install ubuntu 14.04.2 LTS......i booted via usb .....when i start the installation process, i select the language,then tick for "download third party appications" and "check for updates while downloading" and then i get to choose what should i opt for ...so i select "install ubuntu alongside windows 8" and as soon as i click "continue", the computer restarts with windows 8....what should i do? i tried rebooting and also tried to reinstall "wubi" on my pendrive but the same situation occurs....


Is a join optimized to a where clause at runtime?

When I write a query like this...  select * from table1 t1 join table2 t2 on t1.id = t2.id   Does the SQL optimizer, not sure if that is the correct term, translate that to...  select * from table1 t1, table2 t2 where t1.id = t2.id   Essentially, is the Join statement in SQL Server just an easier way to write sql? Or is it actually used at run-time?  Edit: I almost always, and will almost always, use the Join syntax. I am just curious what happens.


Correct the zigzag-form align of a TOC (article)?

I would like to obtain an advice regarding the TOC for an article. I wonder if the following serpent-like output caused by numbers of subsections being longer than those of sections is my mistake or is intended like that by amsart? If not, I'd like to know, even manually, how to correct it? I have tried a double title (one in square brackets having more space before the text) but no result.  \documentclass{amsart} % \usepackage{titletoc} \usepackage{amsthm} \usepackage[english]{babel}   \begin{document}    \tableofcontents  %% --------------------------  \section{First Movement}  \subsection{Allegro con brio}    \subsection{Allegro senza brio}    \section{Second Movement}   \subsection{Adagio}   \subsection{Piu adagio}   \subsection{Ancora piu adagio}   \section{Third Movement: ``la sveglia''}  \section{Finale}  \subsection{Prestisisimo}   \end{document}


Which license to choose for article publication?

My editor is giving me the option to choose between:    The Creative Commons Attribution 4.0 International License (CC BY 4.0) The Creative Commons Attribution-Noncommercial-NoDerivative Works 4.0 International License (CC-BY-NC-ND 4.0).    to publish my article in their journal.  If I understand it, the basic difference between the two is that the first one allows for commercial use of the content of my paper from third parties.  Would the first one be less restrictive in terms of citations to my article? What is the most common option for research articles?


Get Memory Ram and CPU Usage from process

How i can get memory ram and cpu usage used of my process? not from entire CPU.  all codes who i search on internet always retrieve from entire CPU, but i need retrieve these informations from my own process.  i'm using delphi 10.1  these code above who i did with others examples show very near the real memory usage:  var   ProcHand        : THandle;   i               : integer;   WorkingSet      : array[0..$3FFF - 1] of DWORD;   Shared, Privates, total : Integer; begin   ProcHand := OpenProcess(PROCESS_ALL_ACCESS, False, GetCurrentProcessId);    Shared    := 0;   Privates  := 0;   total     := 0;    if QueryWorkingSet(ProcHand, @WorkingSet, SizeOf(WorkingSet)) then   begin     for I := 1 to WorkingSet[0] do     begin       if ((WorkingSet[I] and $00000FFF) and $100 <> 0) then Inc(Shared) else Inc(Privates);        Application.ProcessMessages;     end;   end;    total     := WorkingSet[0] * 4;   Shared    := Shared * 4;    Result := Format('%.2f e %f > Memory %.2f', [total / 1024, shared / 1024, ((total / 1024) - (shared / 1024))]);    CloseHandle(ProcHand);   the code are based on


I am using Angular JS 1 as my view for my project. With each deployment i have to clear cache to make my js changes visible. I cannot ask my client to do the same. I am caching this request for the first time when a new user access the applications because css/images are not going to change that frequently as respect to js files. please let me know if there is any way that we can load only the changed cc/image/js files in user browser and use rest of them from cache.


Evaluate $\lim_{n \to \infty} \frac{1}{n}[(n +1)(n+2) \cdots (n+n)]^{\frac{1}{n}}$

Evaluate $$\lim_{n \to \infty} \frac{1}{n}[(n +1)(n+2) \cdots (n+n)]^{\frac{1}{n}}$$  We can write as $\displaystyle\lim_{n \to \infty} \frac{1}{n}[(n +1)(n+2) \cdots (n+n)]^{\frac{1}{n}}$ $$= \lim_{n \to \infty}\left[\frac{(n +1)(n+2) \cdots (n+n)}{n^n}\right]^{\frac{1}{n}} = \lim_{n \to \infty}\left[(1+\frac{1}{n})(1+\frac{2}{n})\cdots (1+\frac{n}{n})\right]^{\frac{1}{n}}$$  I have used this result if $\{a_n\}$ is a sequence of positive term which is convergent to $l$ and $b_n = (a_1. a_2 . \cdots a_n)^{1/n}$ ,thhen $b_n$ converges to $l$  here $a_n = 2$, but i think it is not right,how to use this result in this question. Give me hint how to proceed . Thank you


Finishing a proof: $f$ is injective if and only if it has a left inverse

I've already done a lot of searching (in particular: ) to try to prove this statement:      $f: A \to B$ is injective if and only if it has a left inverse. [I'm going to also assume $A$ and $B$ are nonempty.]   My attempt so far:     $\Leftarrow$ Suppose $f$ has a left inverse and $f(a_1) = f(a_2)$ for    $a_1, a_2 \in A$. Then there is a function $g: B \to A$ such that   $g\left(f(a_1)\right) = a_1$ and $g\left(f(a_2)\right) = a_2$. Since   $g$ is well-defined, it follows that $g\left(f(a_1)\right) =  g\left(f(a_2)\right)$, and hence $a_1 = a_2$.         $\Rightarrow$Now   suppose $f$ is injective. Then $f(a_1) = f(a_2) \implies a_1 = a_2$.   Furthermore, since $A$ is nonempty, there is an element $x \in A$.   Define $g: B \to A$ by  \begin{equation*} g(b) = \begin{cases}  f^{-1}(b), & b \in \text{Im}(f) \\ x, & b \in A \setminus  \text{Im}(f)\text{.} \end{cases} \end{equation*} This mapping is   well-defined, since if $f$ is injective, $f^{-1}(b)$ is unique.   My main question: does this imply that if $f: A \to B$ is injective that any mapping $g: \text{Im}(f) \to A$ is bijective? Otherwise, I don't understand why we can even use $f^{-1}$ on an element. [Please read the link above for more details - in proof 1.]


We know that $2^2$ means $2\cdot 2$, $2^3$ means $2\cdot 2\cdot 2$, and $2^5$ means $2\cdot 2\cdot 2\cdot 2\cdot 2$ and so on and so forth. But what does $2^{2.5}$ mean? I don't mean to say "How to find it out". I mean, what is the idea behind it? Is it something like "If $S=V\cdot T$, then $T=\frac SV$ and $T$ gets smaller as $V$ gets bigger, and theoretically $V$ can get so big that $T$ might become $0$. (that is, $\lim_{V\to \infty} \frac SV = 0, (T = \frac SV))$" but can't be shown physically?


I have the following function:   int func(int carg, const char **varg) {    //code ...  }   My understanding is the following:  varg is a pointer to a second pointer. This second pointer points to a char. This char is ...   either: a single char (1st case) or: a char that constitutes the first char of a char array. (2nd case)   Is this understanding correct?   The thing I don't understand is why you would want to pass a pointer to a pointer as an argument.  If you wanted to pass (by reference) a single char to the function, you could simply write:   int func(int carg, const char *v) {        //code ... }   In the 2nd case, where you want to pass (by reference) a char array to the function, one could use the same function (where this time, v points to the first element of the array passed to the function):   int func(int carg, const char *v) {    //code ...  }   In summary, I don't understand why you would want to use a pointer to a pointer as argument to a function.  The concrete case I have is the following declaration of a main function:   int main(int carg, const char **varg);   **varg handles the arguments on the command line. One can access the command line arguments using varg[1], varg[2], etc. So, obviously, what **varg does is simply to save the command line arguments in an array. But this could be achieved in a more simple way with the following code:   int main(int carg, const char *varg);    What am I missing?


How to exclude some files from filename expansion mechanism in bash?

I have ubuntu file system directories in the root directory and I accidentally copied hundreds of files into root directory.  I intuitively tried to remove copied files by excluding file system like  rm -rf !{bin,sbin,usr,opt,lib,var,etc,srv,libx32,lib64,run,boot,proc,sys,dev} ./.   bu it doesn't work. What's the proper way to exclude some directories while deleting the whole?  EDIT: Never try any of the commands here without knowing what to do!


Show that if f(n) is O(g(n) and d(n) is O(h(n)), then f(n) + d(n) is O(g(n) + h(n))

I have just started an algorithm design and analysis class and I am completely lost. We seem to be moving thru material that I am unfamiliar with and my book is terrible. My instructor tried to help but I still do not understand. The question:  Show that if f(n) is O(g(n)) and d(n) is O(h(n)), then the summation f(n) + d(n) is O(g(n) + h(n))  If someone could help me understand this proof and show me the methodology for proving something like this I would be so grateful. This isn't homework, but is similar to stuff we are doing in class and it's going right over my head. Give me the child's explanation if you could.   I have used this as a reference:     but im still very confused. Thanks so much in advance.


Is it unusual for the MEAN to outperform ARIMA?

I recently applied a range of forecasting methods (MEAN, RWF, ETS, ARIMA and MLPs) and found that MEAN did surprisingly well. (MEAN: where all future predictions are predicted as been equal to the arithmetic mean of the observed values.) MEAN even outperformed ARIMA on the three series I used.  What I want to know is if this is unusual? Does this mean the times series I'm using are strange? Or does this indicate that I've set something up wrong?


Copying feature service to local geodatabase using ArcPy and ArcGIS API for Python?

I am trying to export/copy a feature service to a local geodatabase where I can work on it locally.    I have provided the code below. I keep getting an "Object: Error in executing tool" for the last line where I am trying to copy the feature.   from arcgis.gis import GIS from arcgis.features.use_proximity import create_buffers  import arcpy  #########################################################################################  GDB_Name = input("Name Geodatabase")  Folder_Input = input("Provide Folder Path of Project")  Item_ID = input("Provide item ID")   #########################################################################################  gis = GIS("http://arcgis.com", "XXXXXXXX", "XXXXXXXXXXX")  search_results = gis.content.search('{}'.format(Item_ID))  Trail_Data = search_results[0]  WorkspaceGDB = arcpy.CreateFileGDB_management(Folder_Input, '{}.gdb'.format(GDB_Name)) print("GDB created")  arcpy.env.workspace = r'{}'.format(WorkspaceGDB)  arcpy.CopyFeatures(Trail_Data, "Area_Trail_Data")


What is the English equivalent of gatasan?

It literally means to milk. It also means a dairy cow. It could be both a noun or verb.  v. To use someone for the money he/she can give you. n. Someone (a girlfriend, husband) that you milk for money.


Why Can't I duck reverb on the mix bus in Unity?

i'm surprised there is so little documentation on this issue. But i'm trying to duck the audio on all the mix buses in Unity so that you can clearly hear the VO of the game.  Now it works great except that I have some reverb zones in the game and any sound that plays in these reverb zones, the actual reverb itself is NOT DUCKED.  So the VO is accompanied with a huge wall of wishy washy muddy noise.  Anyone deal with this before? How can we deal with this?


I am new to unix script. I am trying to create a script that acts as a unix command, such as "ls -l", "ls -la"    myscript -x     ----> do thing 1 myscript -xy    ----> do thing 1, do thing 2 myscript -yz    ----> do thing 2, do thing 3    so, "-x", "-xy" are $0 ? or we need to use different variables to get that?  Thanks


How did the Community user earn the Civic Duty badge?

Apparently, .  How the heck did that happen?


Prove that $r^n/n!$ converges where $n\ge r$

The answer is in the title of the question.  I need to show it converges to 0 and $r>0$.  I am sorry if this is a bad question, I'm having trouble explaining it.  So essentially this Do the $\lim_{n\to inf}\frac{r^n}{n!}=0.$


Trying to implement a variadic min() function in C++

I have some code that seems to me like it ought to work but throws an error when compiling. The header file (min.hpp): #include <type_traits>  namespace test {      template <typename T1>     T1 min(T1 a);     template <typename T1, typename ... Args>     typename std::common_type<T1, Args...>::type min(T1 a, Args ... args);  }  The implementation (min.cpp): #include <type_traits>  namespace test {      template <typename T1>     T1 min(T1 a)     {         return a;     }     template <typename T1, typename ... Args>     typename std::common_type<T1, Args...>::type min(T1 a, Args ... args)     {         typename std::common_type<Args...>::type b = min(args...);         return a > b ? b : a;     }  }  Calling the function (demo.cpp): #include <cstdio> #include "min.hpp"  int main() {     int x = test::min(1, 2, 3);     std::printf("%d\n", x);      return 0; }  Compiling: g++ min.cpp demo.cpp -std=gnu++17 -o main Error message: Undefined symbols for architecture x86_64:   "std::__1::common_type<int, int, int>::type test::min<int, int, int>(int, int, int)", referenced from:       _main in demo-5e729b.o ld: symbol(s) not found for architecture x86_64  However, the code works fine if I move the main() function from the separate file to min.cpp. Why do I get this error and how can I fix it?


If $a\lt{b}$ and $c\le{d}$, prove that $a+c\lt b+d$.   This seems like a basic proof and I think this is how it goes: $$c \le d, \text{ Given }$$ $$a+c \le a+d$$ $$a+c \lt b+d, \text{ since } a \lt b$$  Is that all I need? I'm thinking this does it all quickly and concisely, but I have had trouble with proofs in my classes.


Why Lasso or ElasticNet perform better than Ridge when the features are correlated

I have a set of 150 features, and many of them are highly correlated with each other. My goal is to predict the value of a discrete variable, whose range is 1-8. My sample size is 550, and I am using 10-fold cross-validation.   AFAIK, among the regularization methods (Lasso, ElasticNet, and Ridge), Ridge is more rigorous to correlation among the features.  That is why I expected that with Ridge, I should obtain a more accurate prediction.  However, my results show that the mean absolute error of Lasso or Elastic is around 0.61 whereas this score is 0.97 for the ridge regression. I wonder what would be an explanation for this.  Is this because I have many features, and Lasso performs better because it makes a sort of feature selection, getting rid of the redundant features?


I am new to Ubuntu. I don't know my password to authentication for dowloading applications in appstore. How I get password for authentication to download apps ?


I want to make an animation of some objects, that have a lot of vertices and so Blender gets pretty slow. How can I make the animation without the slow speed in Blender?  Is there a way to do that easily?


Does $\mathop{\LARGEΣ}_{k = 1}^{n}k^α = \left(\mathop{\LARGEΣ}_{k = 1}^{n}k\right)^β$ for which $α \neq 3, \ β \neq 2$ and $α \neq β$?

I figured out that:     $$\mathop{\LARGEΣ}_{k = 1}^{n}k^3 = \bigg(\mathop{\LARGEΣ}_{k = 1}^{n}k\bigg)^2$$   Are there any other solutions for the following equation, for which $α \neq 3, \ β \neq 2$ and $α \neq β$?          $$\mathop{\LARGEΣ}_{k = 1}^{n}k^α = \bigg(\mathop{\LARGEΣ}_{k = 1}^{n}k\bigg)^β$$      P.S. The Sigmas in the equations look different to how its font usually looks like on the MSE and/or MO, (it's typical look appearing like this $\rightarrow \sum$) because I am using  \mathop{\LARGEΣ}_{k = 1}^{n}  just to test how it looks like, and because of its boldness, I don't mind its appearance.    Edit:  There is another answer that solves my problem , mentioned by .


If you have previously clicked a link in spoiler blocks, when you come back, you can see the link in blue words through the spoiler tag:    Is this supposed to be normal?


$$\mathrm{div}\ {\bf F} = \lim_{V\to\{0\}}{1\over|V|}\oint_V {{\bf F}\cdot d{\bf a}}$$  Wikipedia says:     In physical terms, the divergence of a three dimensional vector field   is the extent to which the vector field flow behaves like a source or   a sink at a given point. It is a local measure of its   "outgoingness"—the extent to which there is more exiting an   infinitesimal region of space than entering it.   If there is a source, it means net flux is going to be positive. Then it means flux $\oint_V {{\bf F}\cdot d{\bf a}}$ shows us that there is a source there. But why do we have to divide flux by "volume"?  I am asking the intuition behind defining divergence as flux divided by "volume".


So, I'm studying mathematics at a college level, and not very long ago I had a teacher tell us that the binomial theorem is as follows:  $$(a+b)^n = \sum_{k=0}^n {n \choose k}a^{n-k}b^k$$  With virtually no form of proofing at all. Is there a way of proving this without doing basic crunch work and substituting in as many values as possible?


How can I reproduce the error "package... needs to be reinstalled, but I can't find an archive for it" for testing?

From time to time, Ubuntu users encounter errors from  or , of the form:  The package some-package needs to be reinstalled, but I can't find an archive for it.  I want to know what causes this error so that I can reproduce it and try to find safe ways of fixing it, even when the broken package is important and has many dependencies.  of the  might give a bit of a clue, but I don't know how packages get the status that causes the error.  How can I produce this error for testing on my (Ubuntu MATE 17.10) system?  This is prompted by  and my long-standing discomfort with closing questions about this error against , whose answer uses dpkg --force-all to remove the offending package.  suggests this solution has worked for many users, but I am not confident that using --force-all won't cause later problems, or that it's a good idea to use this method to remove important packages like APT.


How to send HTML email via Gmail including the background CSS

The obvious way is to just copy and paste. However, the HTML has stylesheets like  .auto-style9 {     background-image: url('http://domainname.com/backgroundTall.png');     background-repeat:no-repeat; }   That is a background image of one of the table. If I see the HTML in Firefox I can see the background image.  If I copy it to Gmail or Outlook, the background is gone.  So how can I do it? Actually, how can I send HTML email in general? How do corporations do that?


I know that what  equals to.   The first question is, how do you get the formula $$\ell_P~=~\sqrt\frac{\hbar G}{c^3}$$ that describes the Planck length? The second question is, will any length shorter than the Planck length be inaccessible? If so, what is the reason behind this?


Strategies to denest nested radicals $\sqrt{a+b\sqrt{c}}$

I have recently read some passage about nested radicals, I'm deeply impressed by them. Simple nested radicals $\sqrt{2+\sqrt{2}}$,$\sqrt{3-2\sqrt{2}}$ which the later can be denested into $1-\sqrt{2}$. This may be able to see through easily, but how can we denest such a complicated one $\sqrt{61-24\sqrt{5}}(=4-3\sqrt{5})$? And Is there any ways to judge if a radical in $\sqrt{a+b\sqrt{c}}$ form can be denested?  Mr. Srinivasa Ramanujan even suggested some CRAZY nested radicals such as: $$\sqrt[3]{\sqrt{2}-1},\sqrt{\sqrt[3]{28}-\sqrt[3]{27}},\sqrt{\sqrt[3]{5}-\sqrt[3]{4}}, \sqrt[3]{\cos{\frac{2\pi}{7}}}+\sqrt[3]{\cos{\frac{4\pi}{7}}}+\sqrt[3]{\cos{\frac{8\pi}{7}}},\sqrt[6]{7\sqrt[3]{20}-19},...$$ Amazing, these all can be denested. I believe there must be some strategies to denest them, but I don't know how.  I'm a just a beginner, can anyone give me some ideas? Thank you.


How to delete directories with path/names too long for normal delete

Windows seems to have a length limit on file names when trying to delete, though it won't prevent those files from being created.  Our build process creates a number of temporary files (many build off of a WSDL) that run afoul of this limit.  Our ant script is somehow able to delete them when doing a clean, but sometimes I need to delete the workarea directory (where all the temp files go) without actually doing a full clean from ant.  This is the same errors , but the answers there don't really work for me as I'm dealing with a directory, not a file, and I don't always know what specific files or subdirectories are causing the problem.  And I'm trying to avoid any manual process (other than triggering a single command) to actually delete them.  If I try deleting the directory from Explorer I get the error   Cannot delete [file name]: The file name you specified is not valid or too long.   Specify a different file name   Trying Remove-Item in powershell gives the following error:  Remove-Item : The specified path, file name, or both are too long. The fully qualified file name must be less than 260 characters, and the directory name must be less than 248 characters. At line:1 char:12 + Remove-Item  <<<< -force -Recurse <directory>   Does anyone know of any tools or easy ways to get around this delete error without having to manually find the problem files and move/rename them?


Rights for reviewing revoked while improving post

While reviewing a post, I saw some random character input and I wanted to improve that post. That's why I clicked the "Improve" button to edit the post and bang.... The message said that I can't review for 2 days. I should have rejected the edit.   Are there any ill effects of this? I just wanted to remove those random characters. The "Improve" button confused me a little.


Is there a command to list all users? Also to add, delete, modify users, in the terminal?

I need a command to list all users as well as commands to add, delete and modify users from terminal - any commands that could help in administrating user accounts easily by terminal.


Apache SSL VirtualHosts on a single IP using UCC/SAN certificate

I need to host several Apache virtual hosts with SSL from a single IP.  Now - I understand that because SSL wraps around the HTTP request, there's no way to know which host is being requested until a public key has been sent to the client first. This essentially breaks the possibility of SSL virtual hosts using a standard SSL certificate.  I have obtained a Unified Communications Certificate (UCC), otherwise known as a Subject Alternative Name (SAN) certificate. This allows me to serve the same certificate for multiple domains.  I would like this to be the certificate served by Apache for any SSL request - and then have Apache resolve the virtual host as usual, once the encryption has been established.  How should I configure Apache for this? I have tried to research how this can be done, but all I can find are quotes which say that it is possible, but no specifics:    wiki.apache.org/httpd/NameBasedSSLVHostsWithSNI     While Apache can renegotiate the SSL   connection later after seeing the   hostname in the request (and does),   that's too late to pick the right   server certificate to use to match the   request hostname during the initial   handshake, resulting in browser   warnings/errors about certificates   having the wrong hostname in them.   serverfault.com/questions/48334/apache-virtual-hosts-with-ssl     Incidentally, it is possible to have   multiple SSL-secured named virtual   hosts on a single IP address - I do it   on my website - but it produces all   sorts of warnings in the Apache logs,   and certificate warnings in the   browser. I certainly wouldn't   recommend it for a production site   that needs to look clean.   -David Jul 31 at 4:58   www.digicert.com/subject-alternative-name.htm     Virtual Host Multiple SSL sites on a single   IP address. Hosting multiple   SSL-enabled sites on a single server   typically requires a unique IP address   per site, but a certificate with   Subject Alternative Names can solve   this problem. Microsoft IIS 6 and   Apache are both able to Virtual Host   HTTPS sites using Unified   Communications SSL, also known as SAN   certificates.     Please help.


I found  user at stackoverflow today, but not getting what kind of user is this, is it from StackOverflow or its a fake account which is only made to cast downvotes (12654 downvotes).  The userid in the URL is -1 :)  Is it from Stackoverflow team or its a fake account, if so can't we block such type of users who just made to make downvotes.


I'm trying to convert a DXF 2010 file to KML using ogr2ogr:  ogr2ogr -f "KML" outfile.kml infile.dxf   In the file, $INSUNITS is 6, that's meters, if I'm correct? The problem is that DXF is not georeferenced, and I get errors like:  ERROR 1: Latitude -1113854.310000 is invalid. Valid range is [-90,90]. This warning will not be issued any more Warning 1: Longitude -684136.440000 has been modified to fit into range [-180,180]. This warning will not be issued any more   I'm pretty new to this stuff, and in the last weeks I haven't found documentation that's explaining what I'm doing wrong. Can I add a suggested lat/lon as a parameter to ogr2ogr? Is it actually possible to do a conversion DXF to KML?


When I run the *.jar file my Ubuntu pops up an error message with      The file /... is not marked as executable.  If this was downloaded or copied from an untrusted source, it may be dangerous to run.   Though when I right clicked the *.jar file and got to its Properties > Open With, the Default Application to open this kind of file was already set to OpenJDK Java 7 Runtime.  What is wrong here?


issues with generating a nomenclature with TexMaker

Im trying to write my thesis with TexMakerX and am using a latex template found at    the problem is I can't reproduce the example shown. The pdf generated works great but it does not include the nomenclature as specified. I then look at an old version of the template which includes some advice on the nomenclature issue, found here:    and it is mentiones that the 'files should work ok with front-ends like Texnic, but to get nomenclature features, etc, working you'll need to set makeindex as a postprocessor'. So, I go to Tools and select 'MakeIndex', then I receive a message saying:  Process started: makeindex "thesis".idx  Input index file thesis.idx not found. Usage: makeindex [-ilqrcgLT] [-s sty] [-o ind] [-t log] [-p num] [idx0 idx1 ...]  Process exited with error(s)  What should I do?


Can I use the word "milks" when discussing KINDS of milk

Heard at the cafe: "We have three milks: soy, almond, and cow."  Is it ok to use the word "milks" in this context? I've heard it in other uncountable nouns, like "essential oils", or "simple sugars", or "red wines", so why can't we ask, "which milks do you have?"


Is there a rule in DnD 5e when buying starting equipement at higher level (lvl5 and higher)

is there some rules about the gold you can use when buying starting equipement at higher level.  My character just died and i have to create a new one at level five. My Game master is fairly new to the task and we got a debate about if you can use the extra 500+ 1d10x25 Gold piece you get in the starting equipement tab for buying starting equipement or not. (Page 36 dungeon master's guide)  My Game master doesn't know, and two of our players are arguing about a rule in the books that apparently mention that even at higher level you can only buy the starting equipement with the starting wealth by classe tab and not with any extra gold wathever the origine of it is even the starting equipement tab mentioned before. (player's handbook p. 143).   I've tried to find it in the Dungeon master's guide and online but could'nt find anythings about it. Even here the post about the starting equipement that i found doesn't mantion anything about it.    thanks for the light that you can bring in this zone of shadow.


MySql how to format output rows to single lines?

I am trying to format my MySQL results to one line rather than rows. Here is what my results look like  select name, picks from week1:  Name          Picks               ----        --------------- Nick Smith   New York Giants        Nick Smith   Dallas Cowboys         Nick Smith   Carolina Panthers     Nick Smith   Philadelphia Eagles      Frank Ann    New York Giants        Frank Ann    New York Jets          Frank Ann    Carolina Panthers      Frank Ann    Buffalo Bills          . . Etc   I am trying to format the MySQL results to display as:  Nick Smith   New York Giants, Dallas Cowboys, Carolina Panthers, Philadelphia Frank Ann    New York Giants, New York Jets, Carolina Panthers, Buffalo Bills .... ... Etc     WRAP OFF   Won't work because the Picks for that specific person will show as a row  Any Idea's how this could be accomplished?  Thanks!


Find the value of $\left[\frac{1}{\sqrt 2}+\frac{1}{ \sqrt 3}+......+\frac{1}{\sqrt {1000}}\right]$

Find the value of $$\left[\frac{1}{\sqrt 2}+\frac{1}{\sqrt 3}+.....+\frac{1}{\sqrt {1000}}\right]$$.Where [•] denote the greatest integer function.   I am very confused about this problem. I tried to find the upper and lower bound of the function. But I can't find any formulas to find the bounds. Somebody please help me.


Which of these two sets of examples are more correct?     Finally, I decided to not go to the party.   Finally, I decided not to go to the party.          Tell your sister not to worry about the exam.   Tell your sister to not worry about the exam.


I'm trying to make the input maze of Astar algorithm(alogorithm to find the shortest path between start and destination and there can be some blockages within the maze, which takes input a maze representing blockages only, as shown below). From the GUI using the Click1 command in each button, I intend to get an output like this(where I inserted a blockage at [3][2]). 1 represents blockage which is to avoided to find the path from start to end. [[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 1, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]] but I get a output as following,I can't understand why it's blocking the same column of each and every row [[0, 1, 0, 0, 0], [0, 1, 0, 0, 0], [0, 1, 0, 0, 0], [0, 1, 0, 0, 0], [0, 1, 0, 0, 0]] I created the maze in the init(): of class App() using this: def __init__(self, master,dimension,indexes):    self.maze=[[0]*self.dimension]*self.dimension  this entire thing is within a class App(): for creating the grid of buttons, and storing their reference         self.gid = []         for i in range(self.dimension):             row = []             Grid.rowconfigure(self.frame1, i + 1, weight=3)             for j in range(self.dimension):                 Grid.columnconfigure(self.frame1, j + 1, weight=3)                 btn=Button(self.frame1,command=lambda i=i, j=j: self.Click1(i, j))                 btn.grid(sticky=N+S+E+W,padx=2,pady=2,ipadx=1,ipady=1)                 row.append(btn)                 row[-1].grid(row=i + 1, column=j+1)             self.gid.append(row)    the Click1 method/Command that also within this class:     def Click1(self, i, j):         self.indxes.append((i,j))         if len(self.indxes)==1:             self.gid[i][j]["bg"]="blue" #indicates start         elif len(self.indxes)==2:             self.gid[i][j]["bg"]="green" #indicates destinations         else:             self.gid[i][j]["bg"] = "black"             self.maze[i][j] = 1  #how I insert blockage within the maze


Number of ways of distributing $n$ identical objects among $r$ groups

I came across this formula in a list:  The number of ways of distributing $n$ identical objects among $r$ groups such that each group can have $0$ or more $(\le n)$ objects  I know that standard way of doing this is to solve the problem of distributing n identical objects and $(r-1)$ partitions among themselves which can be done in $C(n+r-1,r-1)$ ways.   But I am unable to prove to myself why it is not $(r+1)^n$.  Because each of the n objects has r+1 choices, either group1, group2,... group r or none at all.


How to cite specific custom field with BibLaTeX?

I am working on a document commenting another paper (Gödels incompleteness theorems). Therefore, I need two lists of bibliographies, one is mine and one the one from the other paper.  The other paper is quite old and uses different style'd citations. I want to keep the original paper as much as possible, so I want to create a custom field like:  @book{taocp1,     keywords={own},     author="Donald Ervin Knuth",     title="The Art of Computer Programming, Volume 1",     year=1968,     isbn="978-0-201-89683-1" }   @article{hilbertschebeweistheorie,     keywords={goedel},     goedeltitle={J.~v.~\so{Neumann}, Zur \so{Hilbert}schen Beweistheorie, Math. Zeitschr. 26, 1927.},     year=1927,     author="John von Neumann",     title="Zur \so{Hilbert}schen Beweistheorie",     journal="Mathematische Zeitschrift",     number=26 }   Now, I know that I can have two bibliographies with things like  \printbibliography[keyword={own}] % Citations with keyword "own" \printbibliography[keyword={goedel}] % Citations with keyword "goedel"   This works fine. But I need to cite the "goedeltitle" field to get the original string used for citing the work (but still have it cited normally in the second bibliography).  I tried   \citefield{hilbertschebeweistheorie}{goedeltitle}   and this gets the work cited in the second bibliography. But the text where goedeltitle is supposed to be only becomes hilbertschebeweistheorie in the PDF.  I'm using this command to load biblatex:  \usepackage[     citestyle=authortitle-ibid,     isbn=true,     url=true,     backref=true,     backrefstyle=none,     pagetracker=true,     maxbibnames=50,     defernumbers=true,     maxcitenames=10,     backend=bibtex,     urldate=comp,     dateabbrev=false,     sorting=nty,     ibidtracker=true ]{biblatex} \bibliography{literatur.bib}


Why does my shell now have "(base)" as in "(base) user@laptop"?

Both my shell emulators (konsole on Kubuntu) as well as the virtuals terminals (Alt+F2, etc.) now display the "(base)" in front of the usual "user@laptop". I presume some recent update or package installation is causing this. It is quite annoying. Where does that come from and how do I get rid of it again? EDIT: So it is conda and its coming from the following lines in .bashrc # >>> conda initialize >>> !! Contents within this block are managed by 'conda init' !! __conda_setup="$('/home/username/anaconda3/bin/conda' 'shell.bash' 'hook' 2> /dev/null)" if [ $? -eq 0 ]; then     eval "$__conda_setup" else     if [ -f "/home/username/anaconda3/etc/profile.d/conda.sh" ]; then         . "/home/username/anaconda3/etc/profile.d/conda.sh"     else         export PATH="/home/username/anaconda3/bin:$PATH"     fi fi unset __conda_setup # <<< conda initialize <<<


I have two L series lenses 24-70 and 14mm and am in need of a longer lense (70-200 or 70-300)my question is since I shoot mostly landscape from a tripod is it worth the expense to go to the L series lense vs 4.5/5 type?


this is a rewrite of another recent question of mine [1] that wasnt stated well (it had a semi obvious simplification, mea culpa) but I think theres still a nontrivial question at the heart of it. have seen similar problems in the literature but not this one in particular.  will write it in terms of bit-vectors because thats easiest for me.      let there be a set of bit-vectors of size $n$, $v_1, v_2, v_3, ... , v_n$. consider the bitwise XOR operation. given a target vector $v_0$. find a subset of vectors such that the bitwise XOR of the set equals the target vector. what is an efficient (or ideally, optimal) algorithm to find a subset?   the brute force algorithm enumerates the powerset of size $2^n$ and lists the 1st subset found. (slightly?) more efficient would look at 1-positions in the target and exclude subsets that do not have at least 1 vector with a 1 in a 1-position of the target.  the subset may or may not exist. it may or may not be unique.  closely related questions: (1) find the smallest subset, (2) output T/F depending on whether such a subset exists.  have a suspicion one of these problems is NP complete.  looking for references, insight etc. it would be interesting to know if there are "hard" vs "easy" inputs etc  as I wrote on the other question this seems closely related to the subset sum problem (see eg garey & johnson ref) which is known to be NP complete but this seems to have "slightly" less complexity because its simpler to compute a vector bitwise XOR than a binary sum (the sum can have more binary digits).  the problem also seems closely connected to bin fu's recent question [2]  [1]   [2]


ReplaceAll Functionality with Regular Expression In Java

I have a string "Home   333-666-8888  Do Not Disturb" and want to extract the numbers from the string. For that I found a solution with ReplaceAll functionality in Java.   String ab="Home   333-666-8888  Do Not Disturb";  String bc=ab.replaceAll("[^0-9-]", "");   And it gives me 333-666-8888  My concern is how does replaceAll functionality actually works? I used to assume that it would replace the things matching the Regular Expression with blank and return me Home Do Not Disturb. But It gives me 333-666-8888. Can anyone help me in understanding how replaceAll with Regular Expression Works?


Get the complete link with an id of a particular post

Is there a proper way to get the id of a particular answer without using the built-in DevTools of the browser? Like for example, I want to refer that specific answer in some post, so when someone clicks the link, it will directly land them on that answer.  If this feature did not exist yet, I think this feature will be helpful.


what does this variable mean in front of the if statement? python

a user is trying to update their info. I have been reading this line of code but I still do not understand what does the bio in front of the if statement does.  the varaible bio is actually from an input  bio = data.get('bio', '')  user.bio = bio if bio else user.bio  P.S.  I just realised, could this be like a shorthand for if bio exist return bio else return user.bio? Then in this way, if user try to empty their input field, it actually wouldn't work?


How to force long lines to automatically split into several to fit on the page?

Intro  I have a list of elements in a tabular, where some elements of the last (3rd) column sometimes are long enough to overpass the width of the page. It is quite boring to have to go line by line and adjust accordingly.  For example one line of my tabular might be:  First column & second column & my long, way too long third column that overpass the width of the page.\\   and here is what I do to solve this issue  First column & second column & my long, way too long third column\\ & & that overpass the width of the page.\\   Question  Is there a solution to set the width of the page (indicating the page is an A4 for example) to the whole tabular, so that LaTex does the trick automatically. We might eventually have to indicate whether we want the line break to occur in the middle of the words or only at spaces or only after comas.


Why are the two results of this residue calculation inconsistent?

Problem:find the residue Res$(f(z),\infty)$ for $f(z)$ as follows $f(z)=\frac{e^z}{z^2-1}$ I tried two methods to solve the problem,but obtained two different results. The first method was like this:  Because Res$(f(z),\infty)$+Res$(f(z),1)$+Res$(f(z),-1)$=0,then I get the answer: Res$(f(z),\infty)=-\sinh1$ The second method was like this: Res$(f(z),\infty)$=-Res$(\frac{1}{z^2}f(1/z),0)$ $$ \frac{1}{z^2}f(1/z)=\frac{e^{1/z}}{1-z^2}=(1+z^2+z^4+z^6+...)(1+1/z+1/(2!z^2)+1/(3!z^3)+...) $$ Then $b_1=1$ so Res$(f(z),\infty)=-1$ I don't know where went wrong? I would appreciate it if you could help me find the reason.Thank you!


Midpoint-Convex and Continuous Implies Convex

Given that $$f\left(\frac{x+y}{2}\right)\leqslant \frac{f(x)+f(y)}{2}~,$$ how can I show that $f$ is convex. Thanks.      Edit: I'm sorry for all the confusion. $f$ is assumed to be continuous on an interval $(a,b)$.


Keyboard shortcut for Terminal doesn't work since updating to 12.10

I have Ctrl+Alt+T assigned as my keyboard shortcut to launch a Terminal window, but it stopped working after upgrading to 12.10.  I have verified that it is still set in the Keyboard Shortcuts settings menu, and have verified that other shortcuts (e.g. Ctrl+Alt+C to open calculator) work.  I have also tried using assigning different key combinations to Terminal, to see if that helps (it doesn't), e.g. unassigning Ctrl+Alt+C from calculator, and instead assigning it to Terminal. No dice.  Any ideas what might be going on?


Looking for a single word for 'blind worship'

Is there a single word for 'blind worship' as in worshiping an actor blindly notwithstanding the bad performance?


Prove that an element $\bar{x}$ is its own inverse iff $\bar{x} = 1,-1$

Show that in $\mathbb{Z_p^\star}$ (where p is prime under the binary operiation multiplication), an element $\bar{x}$ is its own inverse if and only if $\bar{x} = \bar{1},\overline{p-1}$  This question was in my last homework, and my solution was as follows:  $\overline{x^2} = \bar{1}$ $\iff \overline{x^2-1} = \bar{0} \iff \overline{(x-1)(x+1)} = \bar{0}$   I then concluded that either $\overline{x-1}$ or $\overline{x+1}$ is $\overline{0}$ however, the marker stated I needed more justification from the of:  $\iff \overline{(x-1)(x+1)} = \bar{0}$   to  either $\overline{x-1}$ or $\overline{x+1}$ is $\overline{0}$  I asked my lecturer at the end of one lecture and he said that you need to justify that either $p$ divides $\overline{x-1}$ or p divides $\overline{x+1}$, but I don't understand how p divides either, or how that justifies anything. Could someone please explain?


We seem to meet an awful lot of mostly non-recurring admirals.   What's the command structure at the top of Starfleet?  Does Starfleet report to a Commander-in-Chief? Is the Federation Council involved?  Is the President involved?


Is it true that any set $P$ can be endowed with a total order $"\leq" \subseteq P\times P$?


Pattern based, batch file rename in terminal

I need to rename the following:  file_001_loremipsum.png file_002_dolor.png file_003_sit.png file_004_amet.png file_105_randomness.png   into  upl_loremipsum.png upl_dolor.png upl_sit.png upl_amet.png upl_randomness.png   How do I make it happen with just one simple line of terminal command?


How can I deep copy an objects that contains nested objects and arrays?

I'm trying to implement a method to copy dungeons in a game managment app. Here is an example of a Dungeon to be copied: attributes: { isReady: true, isMainQuest: true, color: "red", partyMax: 8 } id: 59272 gamerMax: 12 gameId: 3 advLeveling: true mainObjects: [0: "Treasure" 1: "BossKill"] stats: { monsterCount: 25, treasureCount: 50, bossCount: 15 }  After reading a lot of posts about Object.keys, I decided to use that to "deep copy" my dungeon. My latest interation simply looks like this: Object.keys(obj).forEach(function (prop) {         console.log("obj[prop]: ", obj[prop]); }  But in all the versions I tried, including the one above, they never deep copy the nested arrays and objects like attributes, mainObjects, and stats. Is there a way to copy those as well, no matter how deep? Thanks!


Regular expressions preg_match with line breaks

I'm trying to match a string inside an HTML   for example I want to find the string inside <strong> string </strong>   what I'm doing is  preg_match_all('|\<strong\>(.*)\<\/strong>|',$html,$data);  echo $data[1][0];   it works when the string I want to search inside <strong> is not a line break but if it has a line break, how can I do it?  not working example:  <strong> line break string </strong>


java.sql.SQLException: OALL8 is in an inconsistent state on JBoss 6.1 EAP

OALL8 issue occurs while deploying an application on JBoss 6.1 EAP.  Here is the stacktrace:     java.sql.SQLException: OALL8 is in an inconsistent state at   oracle.jdbc.driver.DatabaseError.throwSqlException(DatabaseError.java:112)   at   oracle.jdbc.driver.DatabaseError.throwSqlException(DatabaseError.java:146)   at   oracle.jdbc.driver.DatabaseError.throwSqlException(DatabaseError.java:208)   at oracle.jdbc.driver.T4C8Oall.marshal(T4C8Oall.java:352) at   oracle.jdbc.driver.T4CPreparedStatement.doOall8(T4CPreparedStatement.java:199)   I am using racojdbc14.jar to connect to the oracle database.   Oracle Database: Oracle 11g. It is an RAC Cluster  Can anyone please post the solution to resolve this issue?


I've got following problem. Let $z$ be a complex number. Let $P(z)$ be a polynomial of degree $n$. Suppose that $|P(z)| \le M$ for $|z| \le 1$. Prove that for $|z| \ge 1$ we have. $|P(z)| \le M \cdot |z|^n$. Can somebody help?


What's the easiest way to install a list of packages with latest version?  Using apt-cache policy or Ubuntu software center, package xxxx only has version 1.1 In Pypi (), the latest version is 1.5. I do not fancy installing from the download file (.tar.gz). Why isn't the latest version reflected in the Ubuntu software center?


Prove that this is true in a nontrivial ring with unity.  If $a^2 = 0$ then $a+1$ and $a-1$ are invertible.  I've seen a few examples and tried out the following solution.  Since $a^2 = 0$:  1 = 1 - $a^2$ = $(1-a)(1+a)$   But I'm not sure if that proves the question. Any help would be appreciated!


Apt install hanging/Freezes when trying to run updates with no errors 17.10

I've been attempting to update my machine for the past few hours and I can't seem to get it to work.  I ran:  sudo apt update && sudo apt upgrade   This found multiple packages for things like updating the linux headers etc. I let it run over night and noticed that it had not made any progress and I could not kill it using ctrl+c.  I closed out the terminal and deleted the locks and ran:  sudo apt update sudo apt-get clean sudo dpkg --configure -a   Which also hung. I deleted the locks once more, restarted my machine and now it's hanging at:  sudo apt upgrade Reading package lists... Done Building dependency tree        Reading state information... Done Calculating upgrade... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 9 not fully installed or removed. After this operation, 0 B of additional disk space will be used. Do you want to continue? [Y/n] y Setting up linux-headers-4.13.0-17-generic (4.13.0-17.20) ... Examining /etc/kernel/header_postinst.d. run-parts: executing /etc/kernel/header_postinst.d/dkms 4.13.0-17-generic /boot/vmlinuz-4.13.0-17-generic  Progress: [  0%] [..........................................................]    I'm totally stumped. How do I get it to install these packages, or where can I search for errors?


I couldn't find an answer for this:     "Cross-thread operation not valid: Control 'progressBar1' accessed   from a thread other than the thread it was created on."   This is my code:          private void buttonStart_Click(object sender, EventArgs e)         {             ClassCopy cb = new ClassCopy();             cb.startCopy(textBoxSrc.Text, textBoxDest.Text, true);              th = new Thread(loading);             th.Start();          }          private loading()         {             for (int i = 0; i < 100; i++)             {                 if (progressBar1.InvokeRequired)                     progressBar1.Invoke(new Action(loading));                 else                     progressBar1.Value = i;             }         }


It's pretty basic and I'm sure I'm missing something dumb here, but I'd like to know why $||A+B||_F \leq ||A||_F+||B||_F$  The way I understand it,  $||A+B||^2_F=tr((A+B)^T(A+B))=tr((A^T+B^T)(A+B))=tr(A^TA+A^TB+B^TA+B^TB)$  Now using the property the trace is linear:  $tr(A^TA+A^TB+B^TA+B^TB) = tr(A^TA)+tr(B^TB)+tr(A^TB+B^TA)=||A||^2_F+||B||^2_F+tr(A^TB+B^TA)$  Now if we were to prove that $2||A||_F||B||_F \geq tr(A^TB+B^TA)$ that would solve the question. But I don't see how that's trivial, and generally multiplying $\sum$s together is something I avoid like the plague. Is this indeed the way? would someone help me with this last step?


Finding $$\lim_{n\rightarrow \infty}\sum^{n}_{k=0}\frac{\binom{n}{k}}{n^k(k+3)}$$   Try: $$\sum^{n}_{k=0}\frac{\binom{n}{k}}{n^k(k+3)}=\frac{n^3}{(n+1)(n+2)(n+3)}\sum^{n}_{k=0}(k+1)(k+2)\frac{\binom{n+3}{k+3}}{n^{k+3}}$$  Could some help me to solve it , thanks


Is there a way to customise the date format?

This Sep 16 '18 business annoys me to no end. Like most of the world's population my brain wants to parse dates either little or big endian.  I'd like to change the displayed date format to , but I use a number of devices (on occasion even the SE App on android). So even if I wanted to, using a custom css/js hack on my browser is not an option. But I cannot find an option to set this in my profile.  Can we please have this?!    Edit: I'm talking about the date format of older posts, where the "a few minutes ago" thing doesn't apply anymore.  I'm turning this support question into a feature-request, as per comments.


Novel about a high school student werewolf meeting a girl (Elise) who becomes a vampire

I'm searching for an old novel I read back in high school. It involved the main protagonist being a high school student who is also a Lycan (werewolf). It's set in high school, where she meets a new girl, named Elise. Somewhere down the lines, Elise becomes seduced by a stranger, and turned into a vampire.  That stranger is also targeting other students, and it's up to the protagonist, and a friend knowledgeable about the supernatural to put a stop to him. Prior to Elise being turned, there was no active conflict between the vampires and werewolves.  Eventually, the protagonist manages to track him down, with Elise helping her, at the expense of her life.  The only other info I can muster up is that the book is from the late 80's - early 90's from the cover art, although I read it in my high school in 2008.


What does the tilde (~) represent in .NET? i.e currentStyle &= ~(int) (WindowStyles.WS_BORDER);

I'm a VB developer currently deciphering an application written in C#. Generally I can find the answer through Google. But I'm lost on this. What is the tilde (~) used for in C#??  Here is a snip-it containing the expression:     /// <summary>         /// Updates the window style for the parent form.         /// </summary>         private void UpdateStyle()         {             // remove the border style             Int32 currentStyle = Win32Api.GetWindowLong(Handle, GWLIndex.GWL_STYLE);             if ((currentStyle & (int)(WindowStyles.WS_BORDER)) != 0)             {                 currentStyle &= ~(int) (WindowStyles.WS_BORDER);                 Win32Api.SetWindowLong(_parentForm.Handle, GWLIndex.GWL_STYLE, currentStyle);                 Win32Api.SetWindowPos(_parentForm.Handle, (IntPtr) 0, -1, -1, -1, -1,                                       (int) (SWPFlags.SWP_NOZORDER | SWPFlags.SWP_NOSIZE | SWPFlags.SWP_NOMOVE |                                              SWPFlags.SWP_FRAMECHANGED | SWPFlags.SWP_NOREDRAW | SWPFlags.SWP_NOACTIVATE));             }         }


I have added the png transparent image with the setting and its not showing transparent black background is seen. I have the base color aluminum and i want to add that logo of png on to it. The image is black letter with transparent background why its showing in white letters and black background. May i know where im going wrong any suggestion or help.


Upper bound for $\mathbb{P}(\max_{1\leq m\leq n} |S_m| \leq x)$ using martingales

Let $S_n= X_1+\ldots+X_n$ where $X_i$ are independent, with mean $0$ and finite variance. Suppose $|X_m|\leq K$ $\forall m$. Use that $S_n^2-var(S_n)$ is a martingale to prove that for any $x>0$ $$ \mathbb{P} \left(\max_{1\leq m\leq n}|S_m|\leq x \right) \leq \frac{(x+K)^2}{var(S_n)} $$  I have shown that $S_n^2-var(S_n)$ is a martingale but I don't know how to proceed since usual inequalities work in the opposite direction


Statistical evidence that the AUC was not overfitted to the model. With N=119, C-stat = 0.81 seems optimistic. Optimism-adjusted?

My data has 119 case and We did ROC for x (continuous variable ) to predict postoperative y (categorical variable) available , we got a comment from a reviewer asking "Please provide statistical evidence that the AUC was not overfitted to the model. With N=119, C-stat = 0.81 seems optimistic. Optimism-adjusted? "  I found some ; basically I split my cohort into train set (n=107) and test set (n=12), did 2 ROC curves and compared AUC for both using this command:   testobj <- roc.test(rocobj0, rocobj1);testobj    and this was the output     DeLong's test for two ROC curves      data:  rocobj0 and rocobj1      D = 0.44822, df = 12.488, p-value = 0.6617      alternative hypothesis: true difference in AUC is not equal to 0      sample estimates:      AUC of roc1 AUC of roc2       80.26961    72.22222    Regarding optimism adjustment, I did it used the following codes obtained from    auc.adjust <- function(data, fit, B){   fit.model <- fit   data$pred.prob <- fitted(fit.model)   auc.app <- roc(data[,1], data$pred.prob, data=data)$auc # require 'pROC'   auc.boot <- vector (mode = "numeric", length = B)   auc.orig <- vector (mode = "numeric", length = B)   o <- vector (mode = "numeric", length = B)   for(i in 1:B){         boot.sample <- sample.rows(data, nrow(data), replace=TRUE) # require 'kimisc'     fit.boot <- glm(formula(fit.model), data = boot.sample, family = "binomial")     boot.sample$pred.prob <- fitted(fit.boot)     auc.boot[i] <- roc(boot.sample[,1], boot.sample$pred.prob, data=boot.sample)$auc     data$pred.prob.back <- predict.glm(fit.boot, newdata=data, type="response")     auc.orig[i] <- roc(data[,1], data$pred.prob.back, data=data)$auc     o[i] <- auc.boot[i] - auc.orig[i]   }   auc.adj <- auc.app - (sum(o)/B)   boxplot(auc.boot, auc.orig, names=c("auc.boot", "auc.orig"))   title(main=paste("Optimism-adjusted AUC", "\nn of bootstrap resamples:", B), sub=paste("auc.app (blue line)=", round(auc.app, digits=4),"\nadj.auc (red line)=", round(auc.adj, digits=4)), cex.sub=0.8)   abline(h=auc.app, col="blue", lty=2)   abline(h=auc.adj, col="red", lty=3) }  model <- glm(data$y ~  data$x, data = data, family = "binomial") auc.adjust(df, model, B=200)   But it gave me this weird figure in which AUC is > 1    So A) I should conclude that AUC was not overfitted based on the splitting of the data that I did and P value of 0.66 from DeLong's test for two ROC curves, Right?  B) How to fix the optimism adjusted AUC figure to get it <=1?


How do I delete gamer profile on xbox 360

I have a couple of gamer profiles that aren't used anymore but I can't find out how to delete them.


PGFplots skip the first row of a table on which there are NaN values. Why?


I want to create multiple primitives such as spheres via python, but my current approach is too slow:  import bpy import time  t0 = time.time() for i in range(400):     bpy.ops.mesh.primitive_ico_sphere_add(radius=0.5, location=[i * 10, 0, 0])  t1 = time.time() dt = t1 - t0 print(dt)   This code takes about 5 seconds, which is just too slow (why?). Is there a way to make it run faster? I suspect creating the mesh every single iteration might be too slow and there is probably a better way to create multiples copies with the same shared mesh, but only different positions, which might be faster.


Can I update my research paper before the camera ready date?

I am trying to finalize the last version of my accepted paper. I have followed the suggestions that I got from the reviewers. While I am editing, I found that a relevant research paper that could benefit my argument if I include it in the related work.   I am just asking if it is ok to extend my reference list (one of the references is self-citation) will it have any bad implications?