From a theoretical point of view, what are interfaces good for?   I know that they allow us to implement multiple inheritance; but are they widely used for something else?

So lets say I have this interface:  public interface IBox {    public void setSize(int size);    public int getSize();    public int getArea();   //...and so on }   And I have a class that implements it:  public class Rectangle implements IBox {    private int size;    //Methods here }   If I wanted to use the interface IBox, i can't actually create an instance of it, in the way:  public static void main(String args[]) {     Ibox myBox=new Ibox(); }   right? So I'd actually have to do this:  public static void main(String args[]) {     Rectangle myBox=new Rectangle(); }   If that's true, then the only purpose of interfaces is to make sure that the class which implements an interface has got the correct methods in it as described by an interface? Or is there any other use of interfaces?


** Please stop to devote this question. I really don't know what to search for it. I have tried to use keyword like 'C# ??' and tried in the title of the qeustion like '?? what it ' but there is no any question in the 'Questions that may already have your answer' box.  public ICommand _command; public ICommand Command {     get     {         return _command ?? (_command = new MvxCommand(AddItem));     } }   I found i like those code. But I really don't know what does it mean?  Additional, if i want to search in msdn about it, what the keyword I should use for?

Ran across this line of code:  FormsAuth = formsAuth ?? new FormsAuthenticationWrapper();   What do the two question marks mean, is it some kind of ternary operator? It's hard to look up in Google.


Let's say, one wants to detect, whether a picture of a fixed size contains a cat or not. But as a dataset, you have 10000 pictures of cats, and 30000 pictures which don't contain a cat, but are very similar to each other. For example, let's assume, the 30000 pictures in the "not cat" class contain only pictures of one or two kinds of spiders. When training a CNN, you will find that you achieve a high score on the test set (here high score = almost fully diagonal confusion matrix) but when you want to use the CNN in the real world, you find that almost everything gets classified as a cat. Why does the network generalize badly in this case? Even if the dataset doesn't represent the kind of data, the CNN would see in the real world, shouldn't it be easy for the CNN to say "I have seen 10000 examples of cats, therefore anything which doesn't look like a cat is not a cat" ? How would one deal with this problem (besides gathering more data)?

I am performing a classification task, to try to detect an object. A picture of the environment is taken, candidates are generated of this possible object using vision algorithms, and once isolated, these candidates will be passed through a CNN for the final decision on whether the object has been detected or not. I am attempting to use transfer learning on InceptionV3 but am having difficulty training it, as I only have one set/class of images. The dilemma is that I only have one class of data and when I pass it through the network, I get a 100% accuracy (because there is nothing to compare it to). How should I overcome this? Should I find more categories online to add to my dataset? What should these categories be? Just to clarify, as an example, I have class "cat". Not "cat" and "dog". Not "cat" and "no cat". Just "cat". That is what my dataset consists of at the moment.


I am looking for a remote desktop client which allows to use two displays in fullscreen as remote, and use one display to run local apps.    So far I have tried   Remote Desktop Connection (windows builtin)   This tool does not allow to specify the number of monitors you want to use. It only allows to use one screen, or all screens. Resizing the display is not possible.   Windows 10 remote desktop app   This tool allows resizing, so it is possible to use two displays as remote, and one local. These two are however not used in fullscreen, resulting in weird resizing and fuzzy images.   Remote Desktop Manager Free   Same issues as Windows 10 remote desktop app, no fullscreen for the specified monitors.  So the question is: does someone know an application which checks all these boxes?   Can be used in Windows 10 Small or no license cost Allows to run some but not all displays in fullscreen mode

I tried to find an answer to this a few years ago, but it seemed it wasn't possible then (I suspect it isn't now either! - but what the hell!)   I have a three monitor system, that I mostly use for remote desktop. However occasionally it would be useful to have remote desktop on two monitors and use the other monitor for the local machine.   I know it is possible to have a single monitor full screen, or to stretch an RDP session across monitors, but this loses things like snapping etc.   P.S. this is a duplicate of  thread, but that was a couple of years ago, I'm hoping things have changed.


I want to install Ubuntu on my machine by allocating 400 GB for the / partition and 50 GB for the /home folder and 16GB RAM. Does it make sense, in this case,  to create a swap partition or is it useless?

From what I understand, the purpose of a swap partition in Linux is to free up some "not as frequently accessed" information from RAM and move it to a specific partition on your harddrive (at the cost of making it slower to read from or write to), essentially allowing active applications more of the "high speed memory".  This is great for when you are on a machine with a small amount of RAM and don't want to run into problems if you run out. However, if your system has 16 GB or 32 GB of RAM, and assuming you aren't running a MySQL database for StackExchange or editing a 1080p full length movie in Linux, should a swap partition be used?


\documentclass{article} \usepackage[english]{babel} \usepackage[utf8]{inputenc} \usepackage[a4paper, total={6in, 9in}]{geometry} \usepackage{fancyhdr,stix,graphicx,framed,amsmath,amssymb,blindtext}   \pagestyle{fancy} \fancyhf{} \rhead{Right Header Content} \lhead{\includegraphics[scale=.15]{logo-tv-logo.png} } \rfoot{Page \thepage} \newcommand\fillin[1][3cm]{\makebox[#1]{\dotfill}}  \begin{document}  \blindtext \end{document}

How would one increase the height of the \fancyhead{} so that the text in the main body, doesn't collide with the title?  I have the following MWE:  \documentclass[a4paper,10pt,oneside]{article} \usepackage{fancyhdr} \usepackage[english]{babel} % Required to compile in Windows \usepackage[letterspace=150]{microtype} \usepackage{fontspec}  \pagestyle{fancy} \setmainfont {Adobe Garamond Pro} % Main document font  \renewcommand{\headrulewidth}{0pt}  \fancyhead[C]{     \addfontfeature{LetterSpace=20.0}\fontsize{30}{30}\selectfont\scshape Foo Bar Camp Names\\[5mm] }  \begin{document} \section*{Foo} \end{document}   However, the section foo starts right in the header, therefore I want to add some vspace in between header and main body. I tried \vspace, \bigskip, and all other sorts of vertical space commands, but none worked.  Updated MWE:  \documentclass[a4paper,10pt,oneside]{article} \usepackage{marvosym} % Allows the use of symbols \usepackage[english]{babel} % Required to compile in Windows \usepackage[letterspace=150]{microtype} \usepackage{fontspec} \usepackage{fancyhdr} %\usepackage[headheight=110pt]{geometry}  \pagestyle{fancy} \setmainfont {Adobe Garamond Pro} % Main document font  \renewcommand{\headrulewidth}{0pt} \setlength{\headheight}{110pt}   \fancyhead[C]{     \addfontfeature{LetterSpace=20.0}\fontsize{30}{30}\selectfont\scshape Foo Bar Camp Names\\ }  \fancyfoot[C]{     \lsstyle     \scshape{         \renewcommand{\\}{\ {\large\textperiodcentered}\ }         Foo Street \\Bar\\Foocountry     }\\     {\Large\Letter} foo@bar.com \ {\Large\Telefon} (+001) 000-0000000 }  \begin{document} \date{} % hide date \section*{Foo Bar} \end{document}


Is there any integer $p$ such that $p > 1$ and all three numbers $p$, $p+2$ and $p+4$ are prime numbers? If there are such triples, prove that you have all of them; if there are no such triples, prove why not. Apart from this, I am given the following information: if $a$ is an integer, then precisely one of the following holds: either $a = 3k$ for some integer $k$, or $a = 3k+1$ for some integer $k$, or $a = 3k+2$ for some integer $k$. I have observed that, when you sum $p$, $p+2$ and $p+4$, you get $3(p+2)$. But from that, I don't know how to proceed.

Intuitively it's true, but I just can't think of how to say it "properly".  Take for example, my answer to the following question:     Let $p$ denote an odd prime. It is conjectured that there are infinitely many twin primes $p$, $p+2$. Prove that the only prime triple $p$, $p+2$, $p+4$ is the triple $3,\ 5,\ 7$.   And my solution:     Given an odd integer $n$, between the three integers $n$, $n+2$ and $n+4$, one of them must be divisible by $3$... Three possible cases are $n=3k$, $n+2=3k$, and $n+4=3k$. The only such possible $k$ that makes $n$ prime is $k=1$. In this case, given an odd prime $p$, either $p=3$, $p+2=3$, or $p+4=3$. This would imply that $p=3$, $p=1$, or $p=-1$. The only of these three that is prime is $p=3$, therefore the only three evenly distributed primes are $3$, $5$, and $7$.   Is there a "better" way that I can assert that one of the integers is divisible by 3? This feels too weak.


We have regex to validate URL. I need a regex that will validate against it. Kindly help me in this.  URL for proper validation   var regexp = /(ftp|http|https)://(\w+:{0,1}\w*@)?(\S+)(:[0-9]+)?(/|/([\w#!:.?+=&%@!-/]))?/  What's for validating against, i.e it should not be a URL.

How can I check if a given string is a valid URL address?  My knowledge of regular expressions is basic and doesn't allow me to choose from the hundreds of regular expressions I've already seen on the web.


After looking around this site, it's been said that it's best practice to use 644 permission for my websites in /var/www.  So I have done chmod 644 /var/www/mysite  I now no longer have access to the mysite folder, permission denied. After asking  it seems that I need to allow my user execute permissions.  I've done this but now feel I am in a bit of a mess.  So could someone please explain the best practice when it comes to setting permissions for /var/www/mysite?  I want myuser to be able to go in there. What sort of access should www-data have? Basically what permissions should I set for this folder and sub folders for each user?

I want to stop having to use sudo everytime I work in /var/www. How can I do that? I simply want to put all of my sites into this directory and work with them without too much pain.


If I cut the pin on my meter and remove the meter in order to replace the incoming power breaker, will I get in trouble? I live in the United States.

when upgrading to a 200 amp service panel with service drop coming from bottom underground do I need southern California Edison to come disconnect and then reconnect or can I just do it on my own. I do have a permit.


I have written a small script to count number of occurrences of logs in megabyte from a particular file following is my code  #!/bin/sh  count=1    while read line do          found=$( grep M $line )         if [ "$found" ]; then          echo $count")" $line >> filesave.txt         fi         count=$((count+1))   done < log1.txt   but I am getting error like  ./count.sh ./count.sh: syntax error at line 10: `found=$' unexpected

I have written a small script to count number of occurrences of logs in a particular file. The following is my code:   #!/bin/sh count=1 while read line do     found=$( grep M $line )     OCCURENCE=$( grep M /log.txt)     if [ "$OCCURENCE" ]; then         echo $count")" $line >> filesave.txt     fi     count=$((count+1)) done < log1.txt   but I am getting this error:  ./count.sh ./count.sh: syntax error at line 10: `found=$' unexpected


In a match between A and B probability of winning A is 1/2 and B winning is 1/3 and probability of draw is 1/6. Person who wins two consecutive    matches will win the game. Find probability that A wins the game

Working my way through the following problem: Problem  Suppose that $E$ and $F$ are mutually exclusive events of an experiment.  Show that if independent trials of this experiment are performed,  then $E$ will occur before $F$ with probability $\frac{ P( E)}{P( E) + P( F)}.$  I have the following come up with the following solution: Solution  Since $P( E^c) = P( F)$ Therefore $\frac{ P( E)}{ P( E) + P( F)} = \frac{ P( E)}{ 1 - P( F) + P( F)} = \frac{ P( E)}{ 1} = P( E)$  But I am unsure if I am able to assume $P( E^c) = P( F)$ as a given? As well, I am particularly confused by the answer in the solution manual which makes it's argument as follows: Solution Manual  If $E$ and $F$ are mutually exclusive events in an experiment,  then $P( E \cup F) = P( E) + P( F)$. We desire to compute the probability that $E$ occurs before $F$ , which we will denote by $p$. To compute $p$ we condition on the three mutually exclusive events $E$, $F$ , or $(E \cup F )^c$. This last event are all the outcomes not in $E$ or $F$. Letting the event $A$ be the event that $E$ occurs before $F$, we have that $p = P( A|E) P( E) + P( A|F) P(F ) + P( A|(E \cup F )^c) P( (E \cup F )^c)$ $P( A|E) = 1$ $P( A|F) = 0$ $P( A|(E \cup F)^c) = p$ since if neither $E$ or $F$ happen the next experiment will have $E$ before $F$ (and thus event $A$ with probability $p$). Thus we have that $p = P( E) + p P( (E \cup F)^c)$ $= P( E) + p (1 − P( E \cup F))$ $= P( E) + p (1 − P( E) − P( F))$ Solving for $p$ gives $p = \frac{ P( E)}{ P( E) + P( F)}$ as we were to show.  Specifically his statement  since if neither $E$ or $F$ happen the next experiment will have $E$ before $F$ (and thus event $A$ with probability $p$)


The texture does not show in UV editing mode, default mode or render. I have mapped the UVs and the viewport shading is set to textured mode as shown.  I tried adding a material (it was green) and the the render shows up as green.  In a different file the texture was showing and I didn't even add a material.  How can I get the texture to show?  This is the UV editing screen  And the Default screen (I removed the material from all objects)

I have added some textures to objects in blender but the textures don't show up until I render the file. it can be difficult to know what the objects look like without rendering it. is there a way to have textures show in the editor even if they are at a lower res?  In editor:    Rendered:


In my code i am getting values like this keys = request.POST.get('keys') KeysList = json.loads(keys)          values = request.POST.get('values') valuesList = json.loads(values)    After print statement i am getting values in list  like : keys = ['A', 'B', 'C', 'D']  Values = ['true', 'false', 'true', 'true']  but what i exactly want is like i want a dictionary in this way : updateObj = { 'A' : 'true', 'B' : 'false', 'C' : 'true', 'D' : 'true', } how can i achieve this can any one please suggest me for this ?? i am stuck here thanks in advance

Imagine that you have the following list. keys = ['name', 'age', 'food'] values = ['Monty', 42, 'spam']  What is the simplest way to produce the following dictionary? a_dict = {'name': 'Monty', 'age': 42, 'food': 'spam'}


I wnat to measure python power consumption while one or more python code is running.  How to measure power consumption for running python code on MacBook Air?

What's your preferred way of getting current system status (current CPU, RAM, free disk space, etc.) in Python? Bonus points for *nix and Windows platforms.  There seems to be a few possible ways of extracting that from my search:   Using a library such as  (that currently seems not actively developed and not supported on multiple platform) or something like  (again no activity since 2007 it seems and no support for Windows). Using platform specific code such as using a os.popen("ps") or similar for the *nix systems and MEMORYSTATUS in ctypes.windll.kernel32 (see ) for the Windows platform. One could put a Python class together with all those code snippets.   It's not that those methods are bad but is there already a well-supported, multi-platform way of doing the same thing?


How do I get an one liner for this condition?  if [ -f ~/.ssh/config ] then     echo -e "\xE2\x9C\x94 Config file existing" fi   My attempt:  if [ ! -f ~/.ssh/config ] || echo -e "\xE2\x9C\x94 Config file existing"

I'm learning about decision making structures and I came across these codes:  if [ -f ./myfile ] then      cat ./myfile else      cat /home/user/myfile fi   [ -f ./myfile ] && cat ./myfile || cat /home/user/myfile   Both of them behave the same. Are there any advantages to using one way from the other?


Let $d$ be a square free integer. Let $R=\{a+b\sqrt{d}:a,b\in\mathbb{Z}\}$. Also $P\subset R$ is a prime ideal. I want to show that the factor ring $R/P$ is finite. (No group theory only ring theory)  I know that if $I$ is a nonzero ideal, the $I\cap\mathbb{Z}$ is a nonzero ideal in $Z$. Also $I\cap\mathbb{Z}=(n)$ for some positive integer $n$. Also I know $R/P$ has no zero divisors.   So I looked at some other post and I still don't understand the connection between $R/(n)$ (which is a finite set), $(R/(n))/P$ (how does this look like), and $R/P$.

Let $d \in \mathbb{Z}$ be a square free integer.  $R=\mathbb{Z}[\sqrt d]$ =$\{a+b\sqrt d | a,b \in \mathbb{Z} \}$. Overall, I'm trying to show that every prime ideal $P \subset R$ is a maximal ideal.     So far I showed that $I \subset R$ is finitely generated.  $I=\{(x,s+y \sqrt d)\}$ And now I'm trying to show that R/P, for some prime ideal is a finite ring with no zero divisors.  From there it would follow that R/P is a field and any prime ideal is maximal.   I know R could also be written as $R= \mathbb{Z}[x]/(x^2-d)$.  How could I show that R/P is a quotient of $\mathbb{Z}/n\mathbb{Z}[x]/(x^2-d)$?


my laptop was previously dual boot windows/linux. I removed linux, and re-installed windows, and upgraded to windows 10. My partitions were still all out of whack so i used a partition tool to try and add all my unallocated space back to my fresh windows install. I think i deleted some recovery partitions somehow... the tool restarted my computer, and before boot started doing stuff at a terminal like screen for the partitions. at one point i got thee windows 10 error screen which said I will need to run a repair.  I went to create a USB install media to run the repair, but in the time I was gone my screen went black and wouldnt come back. I held the power button to shut down, and then pressed it to turn on.  Heres my issue - every other post says things about entering the bios to boot via usb and run my repair, or do some disk utilities to fix it, etc. I can't even get this far.  When i press the power button of my laptop, the light on the power button comes on but I do not hear the harddrive spinning up, and it looks like the monitor never even turns on, and im just at a pure black, silent laptop.  Anyone have any idea what to do? :(

I have a Windows system and when I turn it on everything runs and turns on but the monitor stays black. No BIOS shown or anything. Ideas?  This is also a brand new system. No more then a year old running an i5.  Could it be powersupply?


Here is my working code. However, one small problem. I cannot seem to input in the right answer. The code always only repeats "Incorrect. Wrong answer..." even if I input the right answers which are "slowbro", "Slowbro", and "SLOWBRO". I would be very thankful if someone can help me fix the following code:  public void PokemonQuiz () { char again = 'y'; while (again == 'y' ||  again == 'Y') {  String ans = IBIO.inputString ("\nUnscramble: OBORSLW (Hint: Shelder latches onto its tail.) ");  int tries = 0;   while (ans != "slowbro" || ans != "Slowbro" || ans != "SLOWBRO") {   System.out.println ("Incorrect. Wrong answer. Try again.");   tries++;   ans = IBIO.inputString ("\nUnscramble: OBORSLW (Hint: Shelder latches onto its tail.) ");    if (tries > 3)   {    System.out.println ("The correct answer was SLOWBRO.");    again = IBIO.inputChar ("Play again? (y/n) ");     if (again != 'y' || again != 'Y')     break;   }   }   System.out.println ("Correct.");   }   Edit: I know that "==" should be replaced with ".equals ()" but then how would i change the "!=" ??

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


Let $c_0,c_1,c_2,\ldots ,c_n$ be constants such that :  $$c_0+\frac{c_1}{2}+\ldots+\frac{c_{n-1}}{n}+\frac{c_n}{n+1}=0$$  I have to prove that the equation: $$c_0+c_1x+\ldots+c_nx^n=0$$  Has a real solution between 0 and 1.  Didn't know how to start...I thought that maybe I could use something about derivative...But I'm lost... Any help,much appreciated!!!

Problem: If   $$C_0+\frac{C_1}{2}+\cdots + \frac{C_{n-1}}{n}+\frac{C_n}{n+1} =0,$$  where $C_0,...,C_n$ are real constants, prove that the equation  $$C_0+C_1x+\cdots +C_{n-1}x^{n-1}+C_nx^n=0$$  has at least one real root between $0$ and $1$.  Source: W. Rudin, Principles of Mathematical Analysis, Chapter 5, exercise 4.


After some updates a few months ago I get these outputs:  W: Erro GPG: http://sft.if.usp.br trusty Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 40976EAF437D05B5 NO_PUBKEY 3B4FE6ACC0B21F32 W: Erro GPG: https://download.01.org trusty InRelease: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY A902DDA375E52366 W: Erro GPG: http://extras.ubuntu.com trusty Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 16126D3A3E5C1192 W: Erro GPG: http://sft.if.usp.br trusty-updates Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 40976EAF437D05B5 NO_PUBKEY 3B4FE6ACC0B21F32 W: Erro GPG: http://archive.canonical.com trusty Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 40976EAF437D05B5 NO_PUBKEY 3B4FE6ACC0B21F32 W: Erro GPG: http://sft.if.usp.br trusty-backports Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 40976EAF437D05B5 NO_PUBKEY 3B4FE6ACC0B21F32 W: Erro GPG: http://archive.canonical.com trusty Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 40976EAF437D05B5 NO_PUBKEY 3B4FE6ACC0B21F32 W: Erro GPG: http://sft.if.usp.br trusty-security Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 40976EAF437D05B5 NO_PUBKEY 3B4FE6ACC0B21F32 W: Erro GPG: http://ppa.launchpad.net trusty Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY C71839136CF5CE97 W: Erro GPG: http://ppa.launchpad.net trusty Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 90BD7EACED8E640A W: Erro GPG: http://ppa.launchpad.net trusty Release: As assinaturas a seguir não puderam ser verificadas devido à chave pública não estar disponível: NO_PUBKEY 9641080A705C2B92   I know how to fix this ordinarily, but this time I'm getting too many. Except for the first one (about intel graphics) the others seems to be related to Ubuntu itself. I have tried changing mirrors but I'm stuck with the same error.  Update : sudo apt-key adv --recv-keys --keyserver keyserver.ubuntu.com  returns this error and many similar:  gpg: recurso do bloco de chaves: `/etc/apt/trusted.gpg.d/tuxpoldo-btsync.gpg': limite de recurso   I suppose that's "resource limit"  `

I added some extra repositories with the Software Sources program. But when I reload the package database, I get an error like the following:     W: GPG error:  trusty InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 8BAF9A6F   I know I can fix it using apt-key in a terminal, according to the official Ubuntu documentation. But I would have liked to do it graphically. Is there a way to do this without using a terminal?


I want to center a map. I have it on "width: 50%;" and it is showing one the left side. How do I do this?  I have tried to create a "wrapper" div on it an set text-align to center. This did not work. I also tried it on the .map class... Anybody tried this before?  #wrapper {   text-align: center; } .map {    height: 400px;    width: 50%; }   The reason i want to do this is because i do not want it to fill the whole screen on my webpage. it should be a smaller size window.

How can I horizontally center a
 within another
 using CSS?

Foo foo


i see sometimes this constructor writing with inline explicit. for example:  protected :      inline explicit Singleton() {           CCASSERT(Singleton::instance_ == 0, "error Singleton::instance_ == 0.");          Singleton::instance_ = static_cast<T*>(this);      }     inline ~Singleton() {          Singleton::instance_ = 0;      }   for what inline explicit is good for ?

What does the explicit keyword mean in C++?


On the immigration canada web page viewing PDF and some of them worked and some gave me this notice:  Please wait... If this message is not eventually replaced by the proper contents of the document, your PDF viewer may not be able to display this type of document. You can upgrade to the latest version of Adobe Reader for Windows®, Mac, or Linux® by visiting http://www.adobe.com/go/reader_download. For more assistance with Adobe Reader visit http://www.adobe.com/go/acrreader. Windows is either a registered trademark or a trademark of Microsoft Corporation in the United States and/or other countries. Mac is a trademark of Apple Inc., registered in the United States and other countries. Linux is the registered trademark of Linus Torvalds in the U.S. and other countrie   on abobe's page there is no linux or ubuntu option. i am using ubuntu 14.04 what do i do?

I am new to Ubuntu, but I believe I have Ubuntu 11.10 installed correctly.  I am trying to install Acroread using AdbeRdr9.4.6-1_i386linux_enu.deb that I downloaded from the Adobe web site.  How do I do this?


I recently installed Ubuntu 18.04. I read that the file manager Nautilus can be used to transfer files to and from remote servers. I also read that one can do this by selecting "Connect to Server" from the File menu of Nautilus.  For some reason I do not see "Connect to Server". I see:   New Window Sidebar Keyboard Shortcuts Help About   and a few other things.  What am I doing incorrectly?  EDIT:  The possible duplicate is not the same issue, but through it I was able to find the solution:  The Connect button is not in the File menu, but rather at the bottom of the Nautilus window as an Input field: Connect to Server [Enter server address..]. Select "+ Other Locations" and the field will appear on the bottom.

I'm using Ubuntu 16.04.3 LTS.  I remember having a link in Nautilus that I used to browse network shares with in the past. I don't remember exactly but I think it was "Windows network" or "Browse network".  Now I can't find this on my current installation, there's only "Connect to server", but this is not what I want. Is there a way to put that link there?


I have a project where I receive a cost of a product and the amount paid. I need to derive the smallest amount of coins that will make the change. I use double variables for the price and the paid amount, as well as the change: double change = double paidAmount-double cost; My problem is that for 1 - 0.66 I receive 0.33999998 instead of 0.34 What type of variables should I use to get exactly two digit after the floating point result? Please not that I must not use BigNumber

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


Prove $\frac{x}{x+1}<\ln(x+1)<x$ for $x>0$    What I have done is to look at the derivatives and interval of each function.  lets: $f_1=\frac{x}{x+1}$ , $f_2=\ln(x+1)$, $f_3=x$  the intervals of the functions are $f_1=(0,1)$ , $f_2=(0,\infty)$, $f_3=(0,\infty)$  now looking at the derivatives of the functions $f_1'=\frac{1}{(x+1)^2}$, $f_2'=\frac{1}{x+1}$ , $f_3'=1$  Is this enough to prove the inequalities? is there a way to use the mean value theorem or Rolle's theorem?

Prove for $x>0$ $$ \frac{x}{1+x}<\ln(1+x)<x $$ I tried writing $\ln(1+x)=\ln(1+x)-\ln(1)$ and using the MVT for the $(1,1+x)$ interval. I eventually could prove the inequality but how do I have to prove even for $(0,1)$


I need one help. I need to fix the the textarea height as per the content written inside it. I am explaining my code below.          <link rel="stylesheet" href="lib/style.css">
Hello
     <textarea id="textarea-container">     Line 1     Line 2     Line 3     Line 4     ccccccccccccccccccccc </textarea>        Here some text are present inside the textarea and its scrolling. I need here the text area height will expand as per the content present inside it not more than that and it never scroll.

There was , which I've tried. But there is one problem: the textarea doesn't shrink if you delete the content. I can't find any way to shrink it to the correct size - the clientHeight value comes back as the full size of the textarea, not its contents.  The code from that page is below:  function FitToContent(id, maxHeight) {    var text = id && id.style ? id : document.getElementById(id);    if ( !text )       return;     var adjustedHeight = text.clientHeight;    if ( !maxHeight || maxHeight > adjustedHeight )    {       adjustedHeight = Math.max(text.scrollHeight, adjustedHeight);       if ( maxHeight )          adjustedHeight = Math.min(maxHeight, adjustedHeight);       if ( adjustedHeight > text.clientHeight )          text.style.height = adjustedHeight + "px";    } }  window.onload = function() {     document.getElementById("ta").onkeyup = function() {       FitToContent( this, 500 )     }; }


I have been asked to create a new post with my question. So it is about starting from a distribution function and proving that we can always find a probability space. My attempt is this :   So assume we have a probability space $(\Omega, \mathcal{F}, P)$ and a random variable $X : \Omega \rightarrow \mathbb{R}^*$. * Here we start with the distribution function $F$. increasing and right continuous, st. $F(\infty) = 1$ and $F(-\infty) = 0$. We define :  \begin{align} P_I : I &\longmapsto [0,1] \quad I \in \mathbb{R}^2 \text{ (interval)} \\ [a,b] &\longmapsto F(b) - F(a) \end{align}   We can define $P_X$ on the borel sets by decomposing the set into disjoint intervals :    \begin{align} P_X : \mathcal{B}(\mathbb{R}^*) &\longmapsto [0,1] \quad B = \dot \bigcup B_i \quad B_i \in \mathbb{R}^2 \\ B &\longmapsto \sum_i P_I[a_i,b_i]  \end{align}   By taking $X$ as the identity function we have $\Omega = \mathbb{R}^*$ and $P = (P_X)_{\Omega}$   One user pointed out that not every borel sets is a countable union/ intersection of intervals. So my question is how to proceed from there to finish the demonstration ?  EDIT :   I finally ended up with that :   We can define $P_X$ on the algebra $\mathcal{A} = \{A:A = \sum_i [a_i, b_i]\}$ with $-\infty < a_i \leq b_i < \infty$    \begin{align} P_X : \mathcal{A} &\longmapsto [0,1] \\ A &\longmapsto \sum_i P_I[a_i,b_i]  \end{align}   $P_X$ is a probability measure on the algebra $\mathcal{A}$ so it can be extended to the minimal $\sigma$-algebra containing all closed intervals. We have then $\sigma(\mathcal{A}) = \mathcal{B}(\mathbb{R})$. We just finally take this new measure $P$ and construct the probability space $(\mathbb{R}, \mathcal{B}(\mathbb{R}),P)$   Thoughts ?

So assume we have a probability space $(\Omega, \mathcal{F}, P)$ and a random variable $X : \Omega \rightarrow \mathbb{R}^*$. We can derive from this a distribution $P_X$, and a distribution function $F$. My book says that when working with distribution function directly we have no need to know the underlying probability space since everything is well determined. We just need to show that we can find one. So here is my attempt :   Here we start with the distribution function $F$. increasing and right continuous, st. $F(\infty) = 1$ and $F(-\infty) = 0$. We define :   \begin{align} P_I : I &\longmapsto [0,1] \quad I \in \mathbb{R}^2 ( interval) \\ [a,b] &\longmapsto F(b) - F(a) \end{align}   We can define $P_X$ on the borel sets by decomposing the set into disjoint intervals :    \begin{align} P_X : \mathcal{B}(\mathbb{R}^*) &\longmapsto [0,1] \quad B = \dot \bigcup B_i \quad B_i \in \mathbb{R}^2 \\ B &\longmapsto \sum_i P_I[a_i,b_i]  \end{align}   By taking $X$ as the identity function we have $\Omega = \mathbb{R}^*$ and $P = (P_X)_{\Omega}$   I suspect that I can use the fact that F is increasing and right continuous to say that we can find a measure $\mu$ s.t $\mu(a,b) = F(b)-F(a)$ and then use this measure as probability measure. But I'm scared to miss any vital step along this way.  I would like to know if there is any flaw in my reasoning. Or anything missing. Thanks for any input !


I have the following python function attempting to transpose an 8x8 matrix, A, store its values in the zero 8x8 matrix, B, and return B. I realize that the most readable and/or algorithmically efficient implementation would involve only two for loops, but for the sake of the larger program I'm trying to build the transpose function needs to be in a similar format to the following:  def transpose(A, B, n):     tmp = [[0, 0, 0, 0, ]]     for m in range(4):         j_start = m*2         j_finish = j_start + 2         for k in range(4):             i_start = k*2             i_finish = i_start + 2             for i in range(i_start, i_finish):                 for j in range(j_start, j_finish):                     tmp = A[j][i]                     B[i][j] = tmp                     print "At B[" + str(i) + "][" + str(j) + "] = " + str(A[j][i])     print B     return B   When I print the value at each iteration of the innermost for loop, it prints out the correct value (which you can verify at home):  At B[0][0] = 1 At B[0][1] = 9 At B[1][0] = 2 At B[1][1] = 10 At B[2][0] = 3 At B[2][1] = 11 .... At B[6][7] = 63 At B[7][6] = 56 At B[7][7] = 64   but the ensuing print and return statements yield  [[8, 16, 24, 32, 40, 48, 56, 64], [8, 16, 24, 32, 40, 48, 56, 64], [8, 16, 24, 32, 40, 48, 56, 64], [8, 16, 24, 32, 40, 48, 56, 64], [8, 16, 24, 32, 40, 48, 56, 64], [8, 16, 24, 32, 40, 48, 56, 64], [8, 16, 24, 32, 40, 48, 56, 64], [8, 16, 24, 32, 40, 48, 56, 64]]   What's the reason for the disparity between printed values from within the loop and those that are returned?

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


With reference to the sample data set below (3 treatments ABC, 3 positions 123 and 3 reps), I am interested in knowing if the level of variation in the responses due to treatments A, B and C are the same or sig different. Also if the level or variation in the 3 positions is the same or not. Finally, is there a sig interaction between treatment and position.              A       B       C Position 1  1.01    1.03    1.05             1.02    1.00    1.02             0.99    1.01    1.01 Position 2  0.98    1.00    1.00             0.99    1.02    1.00             1.01    1.04    1.02 Position 3  1.00    0.99    1.01             1.02    1.02    1.00             1.01    1.02    1.01   A normal Anova will determine if the means are sig different (or not) but i am interested in assessing the level of variation in the data, is the level of variation in the response affected by treatment and / or position.  Assuming the data is normally distributed I was considering using the Bartlett test to assess the homogeneity of variance for the treatments (3 columns) and then repeating the test for the rows. Is this approach valid? Is there a better way?

This isn't a strictly stats question--I can read all the textbooks about ANOVA assumptions--I'm trying to figure out how actual working analysts handle data that doesn't quite meet the assumptions. I've gone through a lot of questions on this site looking for answers and I keep finding posts about when not to use ANOVA (in an abstract, idealized mathematical context) or how to do some of the things I describe below in R. I'm really trying to figure out what decisions people actually make and why.   I'm running analysis on grouped data from trees (actual trees, not statistical trees) in four groups. I've got data for about 35 attributes for each tree and I'm going through each attribute to determine if the groups differ significantly on that attribute. However, in a couple of cases, the ANOVA assumptions are slightly violated because the variances aren't equal (according to a Levene's test, using alpha=.05).   As I see it, my options are to: 1. Power transform the data and see if it changes the Levene p-val. 2. Use a non-parametric test like a Wilcoxon (if so, which one?). 3. Do some kind of correction to the ANOVA result, like a Bonferroni (I'm not actually sure if something like this exists?). I've tried the first two options and gotten slightly different results--in some cases one approach is significant and the other is not. I'm afraid of falling into the p-value fishing trap, and I'm looking for advice that will help me justify which approach to use.  I've also read some things that suggest that heteroscedasticity isn't really that big of a problem for ANOVA unless the means and variances are correlated (i.e. they both increase together), so perhaps I can just ignore the Levene's result unless I see a pattern like that? If so, is there a test for this?  Finally, I should add that I'm doing this analysis for publication in a peer-reviewed journal, so whatever approach I settle on has to pass muster with reviewers. So, if anyone can provide links to similar, published examples that would be fantastic.


We all know it is not the centrifugal force.  Given that the probability density multiplied by the surface area of a shell peaks at some distance from the nucleus. Also given that the electron in the atom does not behave like a tiny ball of matter, but like a wave function with probability distribution spread out through space.   Still, there is a very very strong electrostatic attraction between the electron and the nucleus due to their tiny distance.   (a) What force counteracts this attractive force to prevent all of the electrons from sticking to the nucleus?  (b) Why is the kinetic energy of the electron twice the fall in potential energy? As an example, a meteor falling towards earth would not stop when the KE is twice the PE, it would continue falling till all the PE is converted to KE simply because the attractive force does not stop at any point.   (c) Why doesn't the electrostatic attraction ensure that the highest probability of finding the electron is on or within the nucleus?  (d) Given the Pauli exclusion principle saying that all electrons cannot have the same energy, meaning all cannot be sticking to the nucleus or within the nucleus, still there has to be an opposing force holding the electrons at successively higher energy levels, like the reaction force from the tree holds the apple up at a higher potential energy. If the opposing force is not there, then they must fall and lose energy. Why is this opposing force not needed for an electron?  (e) Can we say that while an electron is in an atom, it does not behave like a particle at all, so it is not attracted by and does not accelerate towards the nucleus because only particles can do that and waves cannot, meaning there is no such thing as a charge, attraction, mass or acceleration for a wave.   Sorry to ask many different ways, but it illustrates problems in understanding that need to be solved.

I'm having trouble understanding the simple "planetary" model of the atom that I'm being taught in my basic chemistry course.   In particular,    I can't see how a negatively charged electron can stay in "orbit" around a positively charged nucleus. Even if the electron actually orbits the nucleus, wouldn't that orbit eventually decay?  I can't reconcile the rapidly moving electrons required by the planetary model with the way atoms are described as forming bonds. If electrons are zooming around in orbits, how do they suddenly "stop" to form bonds.     I understand that certain aspects of quantum mechanics  to address these problems, and that there are  of atoms. My question here is whether the planetary model itself addresses these concerns in some way (that I'm missing) and whether I'm right to be uncomfortable with it.


Somebody asked the following :    Clearly this is just a troll post so I (and other users) flagged it as spam. The spam flag was subsequently disputed (which I think simply means that a moderator rejected it):    Huh? Puzzled, I took another look at the list of possible flagging reasons:     I am flagging this question because         it is spam   This question is effectively an advertisement with no disclosure. It is not useful or relevant, but promotional.   it is offensive, abusive, or hate speech   This question contains content that a reasonable person would deem inappropriate for   respectful discourse.   it is a duplicate...   This question has been asked before and already has an answer.   it should be closed for another reason...   This question does not meet this site's standards and should be closed.   it is very low quality   This question has severe formatting or content problems. This question is unlikely to be salvageable through editing, and might need to be removed.   other (needs ♦ moderator attention)   This question needs a moderator's attention. Please describe exactly what's wrong.      Of these, only a few are applicable at all: “spam”, “should be closed for another reason”, “low quality” and “requires moderator attention”.  But:   it shouldn’t be closed (it has no value – it should be deleted), it’s not “low quality” (the description seems to fit actual, albeit bad, questions), and it doesn’t require moderator attention (I certainly didn’t want to bother a mod with this worthless post).   So I still think “spam” is the most fitting reason. Maybe it would help to have a more apt reason “troll post”, or maybe we could explicitly subsume this under one of the other points?

Spam gets fairly heavily punished - 100 reputation penalty, if I recall correctly, and the content itself gets hidden in the revision history.  Now if we just have some rubbish:     dfajiojaifojadiofjadhigaowkokaomdiovnuiyhioqejgioqejgio   I'm not talking about someone posting a question or comment as an answer (i.e. possibly just not knowing the rules or being frustrated with not having the required privileges), or someone making some really horrible attempt at answering the question, I'm talking about an answer that clearly shows absolutely no observation of any content on the page.  This, in my opinion, causes a similar amount of harm to the site - I'm inclined to say the fact that someone posts spam isn't as important as the fact that they're posting something that needs to be deleted, since we're likely going to delete it pretty quickly, and they're (likely) behaving maliciously, or am I wrong?  Why don't we treat this equally harshly, or why do we treat spam as harshly as we do?    Side notes:  I'm sure I've seen a few times where users get punished for posting spam when their link is likely actually relevant to the question and useful (should I flag these? They are still link-only answers, so they shouldn't really come back, and often I'm just not sure enough). While false positives are bad, it seems worse that we're treating worse behaviour better.  I'm assuming that's not what "abusive" in this reason is referring to: (I'm also not sure, off the top of my head, how this one gets treated)     It is offensive, abusive, or hate speech


Given a curious setup, my desktop computer is now far from an accessible connection to the internet as it lacks WiFi, yet I do have a spare laptop lying around with WiFi capabilities. Is it possible to use the available WiFi connection in my desktop, through the laptop?   I've seen a couple of these questions thus far, but none have been specific to Windows 8.1, the operating system on both computers.  Thanks!

Due to some home network complications I have had to move my router to a seperate part of the house, therefore the wired network I had set up can no longer work. Before I find the time to go out and buy a Wifi adapter for my desktop PC, I have a laptop that uses a built in Wifi card to connect to my router and this can connect to the internet, and I was wondering if I could somehow access the internet on my desktop PC via my laptop.  I'm hoping for a not-so-complex solution as this will only be set up for a few days, but it is quite vital that my desktop computer gets internet access.  Does anyone have experience in this sort of thing and can help me out? Thanks.


How do I export Python with the libraries used? It seems like a hassle to get people to install not only Python but the libraries needed to run the code.  I'm using Python 3.4 so I can't use Py2Exe, how do I include the libraries in a folder to use locally without installing them to the system?

I am looking for a Python3.0 version of "py2exe". I tried running 2to3 on the source for py2exe but the code remained broken.  Any ideas?


I thought "people" is countable, so we should say "fewer than five people"?  Being in the US for many years, I rarely hear people saying "fewer than," even with countable nouns like "people."  I presume this usage is grammatically wrong, but idiomatic?

I've just received a memo which says (effectively)      As more people leave, there will be less people available.   I want that word to be fewer. Are there guidelines for which word ought to be used when?


While working on the Collatz conjecture, I've found that the square of every prime number $p$ (except 2 and 3)can be written in the form of $12k+1$.  $p^2=12k+1$.$(k\in\mathcal N)$  is this a new discovery ? or have been used earlier somewhere.

Let $p>3$ be a prime. Prove that $24 \mid p^2-1$.   I know this is very basic and old hat to many, but I love this question and I am interested in seeing whether there are any proofs beyond the two I already know.


So, I have a few accounts on the Stack Exchange Network, and most of them are around 100 points. I've recently added the Network Flair to my profile, but it's only showing the Stack Overflow icon; other communities do not appear. I'm wondering if this is either a bug or it's based on a number of points for the icons to appear on the Network Flair.  How many points do I need for an icon appear to appear on the flair?

My StackExchange flair shows only my Area 51 rep  Even though I have multiple associated accounts with more than 200 rep:


I have a multiplayer server world that I run locally on my computer. I would like to copy that world into a single player save. Easy explanation.  Problem comes when I try copy and pasting the world; it gets the correct world but has not saved my player, specifically. I spawn in the world's original spawn, which is way too far from my server's spawn to reach, and I have no items. Is there a way to fix this loss of player data? I'm the only player that has logged into the multiplayer server so I'm the only player data present  Update:   The playerdata .dat file is there and it has my uuid in the name, with dashes. I have tried copying my world over directly, and I've also tried creating a world, entering the world once, and then replacing the folder contents with my world files. Both have the same result.

Not long ago I started a minecraft world on a new 1.9 snapshot and friends wanted to join so I took my world file and dropped it in a server. Now a little later they are losing intrest in it already but I'm still having my fun. I tried copying the world file back in the saves folder but then I ran into a little problem. I started with the progress I was in before I put it on a server. I was in the same location with the same health, hunger, items, armor, ... This wasn't all a problem when I transfered it to a server. So how do I end up with the progress I was at when I last played on the server?


I have $f:S^3 \rightarrow S^2$ given by $$f(x_0,x_1,x_2,x_3) = (x_0^2+x_1^2-x_2^2-x_3^2, 2x_0x_3+2x_1x_2,2x_1x_3-2x_0x_2)$$ I define $\tilde{f}:S^3\subset \mathbb{R^4} \rightarrow S^2 \subseteq \mathbb{R}^3$ so that I have $$d\tilde{f}_{(x_0,x_1,x_2,x_3)} = \begin{pmatrix} 2x_0 & 2x_1& -2x_2 &-2x_3\\ 2x_3& 2x_2& 2x_1&2x_3 \\ -2x_3 & 2x_3 & -2x_0 & 2x_1 \end{pmatrix}$$ I argued that since the differential has maximum rank, equal to 3 and equal to the dimension of the image, then the differential is surjective and therefore $f$ is a submersion. Is it correct? Or, for example, do I have to argue something more regarding the differential ? Like $d\tilde{f}_x: T_xS^3 \subseteq T_x\mathbb{R^4} \rightarrow T_xS^2 \subseteq T_x\mathbb{R^3} $ ?

I need to show that the Hopf map $H : S^3 \to S^2$ is a submersion. There are many ways to define it, but for now I've gone with the restriction of the function $F : \mathbb{R}^4 \to \mathbb{R}^3$ mapping $$(x,y,u,v)\mapsto (2(xu+yv), 2(xv-yu), x^2+y^2-u^2-v^2).$$ It wasn't too bad to show that $F$ is a submersion, but is there a way to go from here to show that $H$ is a submersion? I can write down $H$ as the composition $$S^3 \overset{\iota}{\hookrightarrow} \mathbb{R}^4 \overset{F}{\to} \mathbb{R}^3 \overset{\pi}{\to} S^2,$$ and define $\pi(p) = p/\lVert p\rVert$, but I don't really know where to go after computing the Jacobian of $\pi$, and I don't know if this will even work for my purposes (I don't see how to argue that the composition of the corresponding differentials here isn't rank $1$ — I know $d\iota$ has trivial kernel but things seem to break down once I get to $d\pi$). I'm really just trying to avoid having to compute the Jacobian of $H$ with respect to the stereographic projections and show that that beast of a thing is full rank. Am I on the right track, or is there a better way?


I made an upvote for a comment that pointed me through the Stack Exchange Android app. Later I thought of getting back my upvote and I tried to do that, but that option (upmark) is not available. Meanwhile I tried to do that other comment that is pointing to some other person I'm able to get back or see that upmark.  Can someone suggest me how to get back my upvote through my handset? If that option is not available then it could be a bug or request that definitely should be available since the user wants these kind of basic options in the app as well.  A comment pointed me to:    A comment pointed to others:

There is an option to undo the comment upvote in stack exchange sites like an alert    Whereas using Stack exchange app, I'm able to upvote a comment but unable to undo it.   I think instead of showing Vote up again, it should show message like "undo upvote".  Something similar in stack exchange sites.


$X$ is a metric space and $f: X  \rightarrow X$ is a dynamical system.  Prove: $w(x_{0})$ is closed.  Here the set $w(x_{0})$ is the future of the orbit of $x_0$, defined as $$\omega(x_0) = \{y \mid \exists (n_k)\, n_k \to \infty, f^{n_k}(x_0) \to y\}$$

So I understand how to find subsequential limits of a sequence but why does the set of subsequential limits have to be closed? A line in my textbook briefly goes over this but doesn't really explain why. Any clarification? Thanks.


I would like to pause/freeze a process in time; how can I do that?  Not duplicate because kill -STOP <PID> has caused applications to crash when I've used it.

So I've got a persistent program running in the background. Killing it just causes it to restart with a different PID. I'd like to suspend it (put it to sleep without actually killing it). Does kill -9 do this? If not, how should this be done?


I am making an add-on in blender that has one python file. In the past, I have been able to just import this add-on as a single python file by itself, but I need to use a .zip file for this because my add-on needs a .blend file to work. I have tried installing my current add-on as a zip with files as so: addon.zip: --addon.py --addon.blend  But the add-on doesn't show up in Preferences. How do I make this work? Thanks in advance!

I'm trying to put together an add-on that contains two operators.  I've gotten each operator file to run properly independently, but I'm having trouble figuring out how to write an init.py file that would allow me to distribute them as a single add-on.  I've posted everything on Github.  The three files aren't too long:   I've read a few other threads, but nothing seems to work for me.  How can I get my init.py to register my operators properly?


Note that this question is about Plain TeX, not LaTeX. Consider the following example.  \pdfpagewidth 8.5 in \pdfpageheight 11 in  foobar \bye   Under pdftex, this will work fine. However, this will throw the following nasty error if I try to run tex on it.  ! Undefined control sequence. l.1 \pdfpagewidth                   8.5 in   Is it possible to write my document so that it will not execute those two lines if it is running under tex rather than pdftex?

How can I detect inside a TeX file which engine (pdftex/xetex/luatex) is used to compile the file? Is there a LaTeX package that provides this functionality?


The task is to scale a polygon in QGIS. The procedure is performed tracing the polygon and then apply a scaling factor ( the factor used is " Distance on the ground" / " Distance on map " ) .  Both ArcGIS and AutoCAD there is the "scale" tool.  Is there any way to do Qgis or plugin?

In QGIS (1.8.0-Lisboa) on Windows (OSGeo4W Install), how would you resize a feature proportionally?  The only way I've found to do this is by hand using either the Freehand Editing (0.2.6) plugin or the Reshape Features button. Neither of these provides a means to uniformly scale (as in resize) the selected feature up or down.  For example, I want to increase the features size by 130% so that you retain the shape of the feature but expand the area of the shape itself proportionally in all directions.


I'm trying to vertically center this image within the fixed position divs, but I cannot seem to get it to work. I have read other questions and the answers I've found don't work with a fixed position like I need. What am I missing? Thanks!  JSFiddle:

    #container {     background-color: black;     z-index: 0;     position: fixed;     left: 0;     right: 0;     top: 0;     bottom: 0;     width: 100%;     height: 100%; }  #logocontainer {     position: fixed;     margin: 0 auto;     z-index: 1;     left: 0;     right: 0;     top: 0;     bottom: 0;     width: 50%;     height: 100%;     display: inline-block;     vertical-align: middle;     align-items: center;     justify-content: center;     text-align: center; }  #logocontainer img {     width: 100%; }

I want to center a div vertically with CSS. I don't want tables or JavaScript, but only pure CSS. I found some solutions, but all of them are missing Internet Explorer 6 support.
Div to be aligned vertically
   How can I center a div vertically in all major browsers, including Internet Explorer 6?


I've recieved text message where the the heart wasn't <3 but an actual heart symbol and I have an HTC inspire, how do I send one like that?

How can I make special symbols on my Samsung Galaxy SII, like ☺ or ♥?


This downloaded file is in my download folder. Where should I keep this folder and how to use and install it? Previously I deleted all qt5 files show there is an error so I have downloaded it. I have extracted the tar.gz file but I need to know in detail what to do with this offline installer. This error was occurring as I deleted all files of qt5 qt.qpa.plugin: Could not find the Qt platform plugin "xcb" in "" This application failed to start because no Qt platform plugin could be initialized. Reinstalling the application may fix this problem.  I am running Ubuntu 20.04.

av_acharya@AnoxBotox:/$ wireshark qt.qpa.plugin: Could not find the Qt platform plugin "xcb" in "path/to/plugins" This application failed to start because no Qt platform plugin could be initialized. Reinstalling the application may fix this problem.   sudo apt-get install --reinstall qt5-default Reading package lists... Done Building dependency tree        Reading state information... Done The following NEW packages will be installed:   qt5-default 0 upgraded, 1 newly installed, 0 to remove and 23 not upgraded. Need to get 0 B/24.4 kB of archives. After this operation, 170 kB of additional disk space will be used. Selecting previously unselected package qt5-default:amd64. (Reading database ... 241279 files and directories currently installed.) Preparing to unpack .../qt5-default_5.12.8+dfsg-0ubuntu1_amd64.deb ... Unpacking qt5-default:amd64 (5.12.8+dfsg-0ubuntu1) ...


I'm trying to find the comm ports on Windows 10. I've looked everywhere in device manager and went to "show hiden devices" but nothing shows up. My PC is a Dell Inspiron. Anybody else haveing the same problem?

Just like we can check COM ports in windows 7 or lower , by going to  Control Panel >> Device Manager >> Ports   How should we  check it in Windows 10?


Assume we are given two positive integers a and b. We want to know all possible all possible lists of size b where each element can be from 0 to a (not including a).  For example if a =2, b=2, we should have [0,0],[0,1], [1,0],[1,1].  Is there any way for having all such lists with Standard python functions?

How can I get the Cartesian product (every possible combination of values) from a group of lists?  Input:   somelists = [    [1, 2, 3],    ['a', 'b'],    [4, 5] ]   Desired output:  [(1, 'a', 4), (1, 'a', 5), (1, 'b', 4), (1, 'b', 5), (2, 'a', 4), (2, 'a', 5) ...]


I have a C# windows application with 4 App Modes - Debug,Pre-Release, Release and UAT. I have to display in the footer of my main form as to what is my current Operating mode. Any idea how I can retrieve the same?

I would like to enable/disable some code based on a custom solution configuration I added in Visual Studio.  How do I check this value at runtime?


I have Windows XP and Ubuntu 12.04 on my laptop.  I've had XP on the laptop for years, and installed Ubuntu 12.04 a few months ago.  For some reason, Ubuntu 12.04 has stopped working.  When I power on the laptop, I get the GRUB menu, and I can select Windows XP or Ubuntu 12.04.  If I select Windows XP, it boots up perfectly and I can use it as normal. However, if I select Ubuntu 12.04, It just displays a terminal type blank screen with no text except the blinking cursor, but no commands execute if I try typing something in.  How do I fix this so I can boot back into Ubuntu 12.04?  I know I can try a reinstall, but I don't want to lose the files I have in Ubuntu 12.04.  Is it possible to somehow do a repair?

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


I'm trying to recreate a stupid idea called sleep sort, however the output is far from expected. I am expecting 0 1 2 3 5  However I get 0 5 5 5 5  ...which is wierd because the thread does: sleep for (item) seconds and then print that item. Here's my code import threading import time  def sleepSort(lst):     for item in lst:         threading.Thread(target = lambda: (             time.sleep(item),             print(item)         )).start()  sleepSort([3, 0, 2, 1, 5])  Is there something wrong with my code? Thank you very much in advance!

While I was investigating a problem I had with lexical closures in Javascript code, I came along this problem in Python:  flist = []  for i in xrange(3):     def func(x): return x * i     flist.append(func)  for f in flist:     print f(2)   Note that this example mindfully avoids lambda. It prints "4 4 4", which is surprising. I'd expect "0 2 4".   This equivalent Perl code does it right:  my @flist = ();  foreach my $i (0 .. 2) {     push(@flist, sub {$i * $_[0]}); }  foreach my $f (@flist) {     print $f->(2), "\n"; }   "0 2 4" is printed.  Can you please explain the difference ?    Update:   The problem is not with i being global. This displays the same behavior:  flist = []  def outer():     for i in xrange(3):         def inner(x): return x * i         flist.append(inner)  outer() #~ print i   # commented because it causes an error  for f in flist:     print f(2)   As the commented line shows, i is unknown at that point. Still, it prints "4 4 4".


From the Word web dictionary:     Study: Consider in detail and subject to an analysis in order to   discover essential features or meaning   Particularly, I am looking for a word (synonym of 'study') which describes reading the research literature thoroughly (e.g. in order to review it), and getting the most out of it.   Actually I am writing a proposal for a software application to search and read research literature. So I want to say that it will be designed and optimized in a way that you can get the most out of reading the research articles (because of features like highlighting terms of interest, e.g. highlighting all names of cars in an article about different automobile manufacturers).  So I want a word used in this kind of meaning/context. Any suggestions are welcome.    Edit: I just applied bold format to the part of the question which describes why it is different from the other question, i.e. a part of my question is that the word/phrase should describe that there are features available to get the most out of the reading experience.

Sometimes we read books rather quickly and don't give them much (or any) thought, so the action 'reading' does not necessarily imply that we have given enough thoughts to any book we read.   Is there a word that describes reading a book with great care; usually but necessarily slowly over a long period of time.


I have a section of code used to find a key value within a dictionary. The current method i'm using works, however i'm attempting to speed up the execution of the script. To do this i want to move the if ticker in tick: to immediately after for tick in trades_dic["Ticker"].items():. The intention of which is to speed up this element by removing the need to check all combinations. Full section of code below, any help would be much appreciated. :)     for tick in trades_dic["Ticker"].items():         for stat in trades_dic["Status"].items():             if ticker in tick and "Open" in stat:                 (tick_k, tick_val) = tick                 (stat_k, stat_val) = stat                 if tick_k == stat_k:                     (active_k, v) = tick                     break         else:             continue         break

Given the following code (that doesn't work):  while True:     #snip: print out current state     while True:         ok = get_input("Is this ok? (y/n)")         if ok.lower() == "y": break 2 #this doesn't work :(         if ok.lower() == "n": break     #do more processing with menus and stuff   Is there a way to make this work? Or do I have do one check to break out of the input loop, then another, more limited, check in the outside loop to break out all together if the user is satisfied?


I have a javascript function   <script>     $(document).ready(function(){         $('.paper_img').click(function(){              console.log("hello")              return false;         });     }); </script>   how can I access the element which triggered this function? thanks carl

Is there any way to get the ID of the element that fires an event?  I'm thinking something like:    $(document).ready(function() {   $("a").click(function() {     var test = caller.id;     alert(test.val());   }); }); <script type="text/javascript" src="starterkit/jquery.js"></script>  <form class="item" id="aaa">   <input class="title"></input> </form> <form class="item" id="bbb">   <input class="title"></input> </form>     Except of course that the var test should contain the id "aaa", if the event is fired from the first form, and "bbb", if the event is fired from the second form.


"Oscar Wilde wrote the novel, "The Picture of Dorian Gray."  (Rewrite this sentence, using the noun from of the verb "wrote".)     [1] Oscar Wilde was the writer of the novel, "The Picture of Dorian Gray".      [2] Oscar Wilde is the writer of the novel, "The Picture of Dorian Gray".   If [2] is right, please explain whether it's ok to change the tense of the original sentence.  If [1] is right, please explain why [2] isn't correct.

if someone asks me or if there is a question in exams like "who is the author of Xxx book?" Should I answer in the past or present tense,like "Yyy is/was the author of Xxx book". I know the author is not alive.


I'm using JavaScript and I want to convert string type value like this: '[{"key": "a", "value": "aa"}, {"key": "b", "value": "bb"}]' to array type, without '' quotes, like this: [{"key": "a", "value": "aa"}, {"key": "b", "value": "bb"}]. I receive this type as an argument to a function where I have to treat the value as Array. But currently I can't push or pop items because the value is of string type.

Given a string of JSON data, how can I safely turn that string into a JavaScript object?  Obviously I can do this unsafely with something like:  var obj = eval("(" + json + ')');   but that leaves me vulnerable to the JSON string containing other code, which it seems very dangerous to simply eval.


I have a small script like this to configure the iptables:  #!/bin/bash  PRE_STR="iptables -t nat -A PREROUTING -p tcp -j DNAT" FOR_STR="iptables -A FORWARD -p tcp -j ACCEPT"   ##################################### # instances CM="10.0.1.137" MASTER="10.0.1.149" MYSQL="10.0.1.83" REPORTING="10.0.1.85"  ##################################### # Clear Iptables iptables -F iptables -t nat -F  ##################################### # Forward to enable Internet on private nodes iptables -t nat -A POSTROUTING -j MASQUERADE   ##################################### # Port forwarding  forward() {         $PRE_STR --dport $1 --to $2:$3         $FOR_STR --dport $3 -d $2 }  #what   from    to ip           to port forward 3222    $CM             22 forward 7183    $CM             7183 forward 7180    $CM             7180  forward 3122    $MASTER         22 forward 8888    $MASTER         8888 forward 11000   $MASTER         11000  forward 2122    $MYSQL          22 forward 13306   $MYSQL          3306  iptables-save > /etc/firewall.conf   The question is, how to load the /etc/firwall.conf with the current iptables settings on the next startup?  On a normal Debian machine I would put a script that fires iptables-restore < /etc/firewall.conf it into the folder /etc/network/if-up.d/iptables. But this isn't available in this image.  So what is the correct why to load this /etc/firewall.conf?  AMI ID: ami-1de2d969  Update:  Is it ok to fire it in iptables-restore < /etc/firewall.conf in /etc/rc.local?  Source:

I want my iptables rules to automatically be loaded on startup. According to the wiki on Debian this can be done by placing a script with the name iptables in /etc/network/if-pre-up.d/ So I did, this is what it looks like:  cat /etc/network/if-pre-up.d/iptables  #!/bin/sh /sbin/iptables-restore < /etc/firewall/iptables.rules /sbin/ip6tables-restore < /etc/firewall/ip6tables.rules   This script works: if I run it as root my firewall rules get applied. But on reboot there are no firewall rules. What am I doing wrong?  On request: the /etc/network/interfaces (I did not touch this file)  user@DebianVPS:~$ cat /etc/network/interfaces  # This file describes the network interfaces available on your system # and how to activate them. For more information, see interfaces(5).  # The loopback network interface auto lo iface lo inet loopback  # The primary network interface allow-hotplug eth0 iface eth0 inet dhcp


I'm trying to create an opaque div with a slight colour over an image. I can't seem to get it to fit exactly over the whole image. I've tried so many different variations and the following is the best I can come up with. I know it's probably something simple but I think I need some help lol.    .old{     position: relative; }  .cover{  background-color: blue;     width: 100%;  height: 200vh;  position: absolute;  top: 0;  left: 0;  z-index: 1;  opacity: 0.5; }

I want to overlay one image with another using CSS. An example of this is the first image (the background if you like) will be a thumbnail link of a product, with the link opening a lightbox / popup showing a larger version of the image.   On top of this linked image I would like an image of a magnifying glass, to show people that the image can be clicked to enlarge it (apparently this isn't obvious without the magnifying glass).


I am having trouble trying to solve this Diophantine equations: $$ 𝑥^3=4𝑦^2+4𝑦−3 $$  I was wondering if anyone could help me find the integer solutions to these and any advice of techniques to use?  Thank you!

Proof by contradiction:  1. Suppose  $x^3 + 3 =4y(y+1)$ has an integer solution   Then  $x^3 + 3 =4y^2+4y$ Then  $x^3 + 3 + 4 = 4y^2 + 4y + 4$ Then $x^3 + 7  = (2y + 2)^2$   Not sure how to simplify it further...


When I reached 2k reputation points (on Stack Overflow), I got an orange rectangle next to my profile link on the notification bar that links to the suggested edits review page and displays the number of pending edits.    Since I reached 10k, that link now displays a much bigger number and links to the whole review page, not just suggested edits.  I don't like that because I already have a link to the review page right next to it.  The suggested edits queue is my favorite thing to review, so I liked having a quick way of getting to it.  Now, it's two clicks: review; suggested edits.  I would like it if that link stayed the same as it was.

Another meta question identified a bug that was marked as designed. To summarize the bug, the little number that appears next the Review link in the header shows an incorrect value most of the time.         I would like to propose that the feature be dropped. Honestly, I would prefer it be fixed, but the response to the question above gives me little faith that it will be. Half of the time, I click that little brown box and find out that I was lied to. There's nothing to review.  The little number no longer does the job it was created to do.        Oh sweet! Three things I can review!        Just kidding...


I joined Stack Overflow last week when I saw a  I wanted to answer. If I understand things correctly,  has been upvoted twice and also accepted. And I did receive the Teacher and Revival badges for it. Yet when I look at , it shows no changes and is thus still at one.  What is it about the reputation system that I'm not understanding here?

Some questions and answers are marked Community Wiki and are owned by a community wiki user:  (In fact, this very question is one of them)  Why have Community Wiki posts? How do Community Wiki posts work? How does a post become a Community Wiki post? How can the Community Wiki status be removed from a post? How can I find Community Wiki posts?


Is there any universal method to detect string charset? I user IPTC tags and have no known encoding. I need to detect it and then change them to utf-8.  Anybody can help?

I received some text that is encoded, but I don't know what charset was used. Is there a way to determine the encoding of a text file using Python?  deals with C#.


"Every possible history starting from a particular state and ending at a particular state is assigned a complex number by some predefined rules in particular that the complex number is the product of the complex numbers assigned to each part of the history.  The complex numbers are summed and the square magnitude gives the probability for the final state given the initial state."  This is my very brief summary of the essence of quantum mechanics. The problem is that it necessitates the definition of the sum and product of complex numbers. Feynman used arrows instead in some public lectures. Do you know of any better explanations that don't involve complex numbers or little arrows?   Also, the definition is not entirely true as you have to regulate the sums or do Wick rotation tricks otherwise you just get infinity. Which sort of suggests that this definition might not be the best.

1.  Why is the wave function complex? I've collected some layman explanations but they are incomplete and unsatisfactory. However in the book by Merzbacher in the initial few pages he provides an explanation that I need some help with: that the de Broglie wavelength and the wavelength of an elastic wave do not show similar properties under a Galilean transformation. He basically says that both are equivalent under a gauge transform and also, separately by Lorentz transforms. This, accompanied with the observation that $\psi$ is not observable, so there is no "reason for it being real". Can someone give me an intuitive prelude by what is a gauge transform and why does it give the same result as a Lorentz tranformation in a non-relativistic setting? And eventually how in this "grand scheme" the complex nature of the wave function becomes evident.. in a way that a dummy like me can understand.  2.   A wavefunction can be thought of as a scalar field (has a scalar value in every point ($r,t$) given by $\psi:\mathbb{R^3}\times \mathbb{R}\rightarrow \mathbb{C}$ and also as a ray in Hilbert space (a vector). How are these two perspectives the same (this is possibly something elementary that I am missing out, or getting confused by definitions and terminology, if that is the case I am desperate for help ;)   3.   One way I have thought about the above question is that the wave function can be equivalently written in $\psi:\mathbb{R^3}\times \mathbb{R}\rightarrow \mathbb{R}^2 $ i.e, Since a wave function is complex, the Schroedinger equation could in principle be written equivalently as coupled differential equations in two real functions which staisfy the Cauchy-Riemann conditions. ie, if $$\psi(x,t) = u(x,t) + i v(x,t)$$ and $u_x=v_t$ ; $u_t = -v_x$ and we get $$\hbar \partial_t u  = -\frac{\hbar^2}{2m} \partial_x^2v + V v$$ $$\hbar \partial_t v  = \frac{\hbar^2}{2m} \partial_x^2u - V u$$ (..in 1-D) If this is correct what are the interpretations of the $u,v$.. and why isn't it useful. (I am assuming that physical problems always have an analytic $\psi(r,t)$).


The question says:  Find a and b integers where:  $671a-654b = 18$ and $\gcd(a,b) = 18$ My attempt was: $a = cd$ where $d$ is $\gcd$ and $c$ is just an integer. $b = kd$ where $k$ is just an integer too. $k$ and $c$ are co-prime, btw (This is all according to a law in math, I don't know its name though) By putting them in the equation we find: $d(671c - 654k) = 18$ which is $671c - 654k = 1$ By using the euclidean algorithm, I only found this which is not correct: $76(671) - 78(654) = -16$ -$16$ should be $1$ in its place but it isn't, so it's not right, either. So how do I continue from here? EDIT: I redid my algorithm and I found that $c = 77$ and $k = -79$ which after putting it in a and b, I find their values. Thank you all!

We want to find the solution $x$ to the congruence system  $$\begin{align} x &\equiv r_1 \!\!\!\pmod{\!m_1}\\ x &\equiv r_2 \!\!\!\pmod{\!m_2}\end{align},\ \ {\rm where}\ \  \gcd(m_1, m_2) = 1$$  These can be rewritten as  $$\begin{align} x &= r_1 + m_1 j\\ x &= r_2 - m_2k\end{align}$$  for unknown integers $j, k$. So we set those two equations as equal and rearrange them to  $$m_1j + m_2k = r_2 - r_1$$  Now assume we perform $\text{egcd}(m_1, m_2)$, which gives us the solution to  $$m_1u + m_2v = \gcd(m_1, m_2)$$  Let the integer $\,h\,$ make $\,h \gcd(m_1, m_2) = r_2 - r_1$.  Then $\qquad hm_1u + hm_2v = h\gcd(m_1, m_2) =  r_2 - r_1 = m_1j + m_2k$  At this point I am lost because I don't think we can just assume  $hm_1u = m_1j$ and extract $j = hu$.   How do I get the values of $j$ or $k$ so I can get the value of $x$?


I'm using apache mina sshd to produce a ssh server so that users could be able to access a specific system remotely.  here is a part of my code:      SshServer sshd = SshServer.setUpDefaultServer();     sshd.setPort(830);     sshd.setKeyPairProvider(new SimpleGeneratorHostKeyProvider("hostkey.ser"));     sshd.setShellFactory(new ProcessShellFactory(new String[] { "/bin/sh", "-i", "-l" }));     sshd.setCommandFactory(new ScpCommandFactory());     sshd.setPasswordAuthenticator(new PasswordAuthenticator() {         public boolean authenticate(String username, String password, ServerSession session) {             return true;             // just to make sure everything is right             // this will implement later         }     });      sshd.start();   when running this code on windows, this code looks ok, but on linux (Ubuntu 18.04), this error is gotten:  Exception in thread "main" java.net.SocketException: Permission denied at java.base/sun.nio.ch.Net.bind0(Native Method) at java.base/sun.nio.ch.Net.bind(Net.java:455) at java.base/sun.nio.ch.Net.bind(Net.java:447) at java.base/sun.nio.ch.AsynchronousServerSocketChannelImpl.bind(AsynchronousServerSocketChannelImpl.java:164) at org.apache.sshd.common.io.nio2.Nio2Acceptor.bind(Nio2Acceptor.java:59) at org.apache.sshd.SshServer.start(SshServer.java:318)   I know running the program using a port number above 1024 might fix this but the standard port of the kind of application I'm developing is 830. how can I fix this problem? does it need any configuration in my firewall or superuser settings?

It's very annoying to have this limitation on my development box, when there won't ever be any users other than me.  I'm aware of , but none of them do exactly what I want:    (The version in Debian testing, 1.0, only supports IPv4)  (the "nat" table is not yet implemented for ip6tables, the IPv6 version of iptables) sudo (Running as root is what I'm trying to avoid) SELinux (or similar). (This is just my dev box, I don't want to introduce a lot of extra complexity.)   Is there some simple sysctl variable to allow non-root processes to bind to "privileged" ports (ports less than 1024) on Linux, or am I just out of luck?  EDIT: In some cases, you can  to do this.


I have tried SPFX inside SPO, But is there a way to add the look and feel of SPFX inside Sharepoint 2013 mainly for the usage of Mobile compatibility.

I know the new SPFx will be released for Sharepoint 2016 sometime in the year 2017. But are there any plans to also bring this for Sharepoint 2013?  Are there any possibilities/hacks to add a Sharepoint app created with SPFx in the Sharepoint 2013 app catalog?


let F be a field, let ${h(x)=a_{n}x^{n}+a_{n-1}x^{n-1}+...+a_{1}x+a_{0}}$ belongs to F[x], and let $g(x)=x-1$. show that $g(x)$ divides $h(x)$ iff ${a_{n}+a_{n-1}+...+a_{1}+a_{0}=0}$. Can someone help me proving this, please!!

I'm reading Fraliegh's text on abstract algebra, and his statement for the factor theorem is, "An element $a\in F$ ($F$ is a field) is a zero of $f(x)\in F[x]\iff$ $(x-a)$ is factor of $f(x)$ in $F[x]$." The proof is straightforward, and seems to be the most common one, but I don't see where exactly you need to use the fact that $F$ is a field; it seems like this result would hold for any ring $R$. Is this true?


The situation:   Even though SPF, DKIM, and the entire mail formatting is optimized to score 10/10 on , many outgoing mails are marked as spam in yahoo and outlook. The primary server sends out the emails. Incoming email is handled with mailgun.org, so the MX records (on the primary server) point to mailgun servers.  It is relatively easy to set up the PTR record for the primary server, but AFAIK impossible on mailgun.   Questions   Is setting the PTR record on the primary server enough?  If not: what is the exact way a major email service provider checks incoming emails regarding the PTR record?   a) domain -> read MX record -> look up PTR of domain in the MX record (which would be mailgun)  b) domain -> look up PTR record of that domain (primary server in this case)  c) other?

This is a  about how to handle email sent from your server being misclassified as spam.  For additional information you may find these similar questions helpful:                    Sometimes I want to send newsletters to my customers. The problem is, that some of the emails get caught as spam messages. Mostly by Outlook at the client (even in my own Outlook 2007).  Now I want to know what should be done to create "good" emails. I know about reverse lookup etc., but (for example), what about a unsubscribe link with an unique ID?  Does that increase a spam rating?


I have recently scanned a bunch of old photo prints to digital for a slide show but all of them have a bunch of white space around them like this:                                         /\                                       ||                              Unwanted White space   I know how to remove the space manually in GIMP but I was wondering if there is some kind of automatic tool to do it for me because I have way too many to do by hand.

I need to scan a large volume of book covers and even though the scanner (HP) most of the time scans/auto-sizes, many are left with white/grey space on the sides.  What is the best way I can automate the "crop" on these images?  Is there some software/tools that automate this?


Consider this scenario, I have installed Ubuntu server in my computer. Can I launch any graphical application like Android-studio or Mozilla firefox from the OS?  To be more specific if I navigate to the folder which has the application, and type chmod +x myapp.sh and then type sh ./ myapp.sh . .. what is going to happen?  I am just Curious to know

Trying to run a Ubuntu server for the first time... But everything is in a terminal. Is there a way to switch to a GUI?


Had problem with "Advanced Mac Cleaner".  After some effort, and plenty of time, I think I have found and removed all files concerning this malware.  My only apparent remaining problem is that the Advanced MacCleaner icon remains in my Launchpad.  I really, REALLY don't want to bring any of the amc files back from trash unless I absolutely have to (and would prefer to empty trash entirely after I am sure this whole problem is solved.)  Anyone got a fairly easy fix for this final step that a basic laymen (computer wise) like me could implement w/o too much difficulty?  Thanks.

I have moved an installer into the launchpad (uTorrent-Installer). The problem is that I would like to remove it now but as it is an installer it doesn't appear in "Applications" in the Finder. I can't right-click the icon to remove it nor can I drag and drop it into the trash.  Can I delete apps from launchpad?


I have points in a txt file with lon, lat and elevation. The CRS is the National Grid of my country (metric system). However, when I add them in QGIS and then try to lay over them a map from OpenLayers plugin, the points are 50 meters off their true location. How to fix this?  The national grid is Balkan Zone 7.

I have problem with CRS Bosnia and Herzegovina?  MGI 1901 / Balkans zone 6  EPSG:3908 MGI 31276 / Balkans zone 6  EPSG:31276  Which of these two is OK? When I open google sattelite image with openlayers plugin, MGI 1901 match an image, when I change to MGI 31276 vector layer mismatch about 300m. When I import my layers to Global Mapper, datum of vector is "MGI Austria"   I need this projection:


Especially for some of the less frequented tags, such as , it can take a long time till a question is closed as duplicate. (For example,  has been up for closing for over a week.)  Given that gold and silver tag badges usually mean that a user has spent quite a bit of time answering questions, user with these badges are also more likely to remember the duplicates, which may have a non-intuitive title, and thus not show up in the automated search.  I suggest to give the more (e.g. 2-3x for gold, and 2x for silver) weight to gold and/or silver tag badges for close-as-duplicate votes (of a question with that tag, obviously), to make the duplicate questions disappear more quickly.  NOTE Three years later, a similar suggestion was very positively received (see link to duplicate)

In order to increase the efficiency with which poor quality questions are closed, it could make sense to have weighted close votes for a small subset of qualified users.   A very good way to measure the qualified users would be to leverage the tag badges. However, it needs to be rationally limited to a set of users that are knowledgeable with the subject. A very good way to measure the top users in a tag would be to look at those who have a gold badge in the tag.  If two users who have a gold tag badge pertinent to a question issue a close vote, the question should probably be closed (or probably will be very soon under the current system). I think it would make sense to allow users with a gold tag badge to have a 3x weight for close votes in those tags.  Please keep in mind, this isn't suggesting full moderator one click closure. It only adds weight to the vote. A single user could not do it on their own. These singular users cast close votes all the time, so that aspect would not change. Some will vote to close, some wont, but the ones who do should have a stronger weight to their vote. Even with 3x it will require 2 of said votes to accomplish, or still 2 other users (meaning 3 agreed it should be closed - which is the same amount of high rep users it takes to delete a question and that has a much greater impact than closure).  tldr;  Allow gold tag badge users to have a weighted close vote in their tag


So I have an SQLite database with a table that has a column named id set up to auto increment.  Is there a way to retrieve what it will next increment to?

I'm trying to find if there is a reliable way (using ) to find the ID of the next row to be inserted, before it gets inserted. I need to use the id for another insert statement, but don't have the option of instantly inserting and getting the next row.  Is predicting the next id as simple as getting the last id and adding one? Is that a guarantee?  Edit: A little more reasoning... I can't insert immediately because the insert may end up being canceled by the user. User will make some changes, SQL statements will be stored, and from there the user can either save (inserting all the rows at once), or cancel (not changing anything). In the case of a program crash, the desired functionality is that nothing gets changed.


By definition any topology must contain the empty set.  Also by definition if $B\subset T$ is a basis for topology $T$, then every member of $T$, in particular the empty set, must be a union of some members of $B$. But how can you get a union of sets equal to the empty set if none of them are empty sets?

Given space $X = \{a, b, c\}$, $\beta$ is a basis for a topology  $\tau$  on X.   $\tau  = \{ \varnothing, X, \{a\}, \{b\}, \{a,b\}\}$,  $\beta = \{\{a\}, \{b\}, X\}$.  $\beta$ can't union its elements to get empty set $\varnothing$ contained in $\tau$ , but the definition of basis require that every open set can be expressed as a union of basis elements.  So why $\varnothing$ is not an element of $\beta$ ?


In OSX, this is easy but not so in Ubuntu.  flpsed is not the answer here, since it does not include rotate capability.  How can you rotate single pages of PDF and save the result?

I know that there is a very similar question, but I'm not interested in highlighting. What I'm looking for is some tool in Linux to edit pdf files. I've tried pdfedit which did the work for me, but if freezes after a few edits. I've tried this tool under Ubuntu 9.10 and under KDE Fedora 14 and the same thing happens. I've tried Okular but the notations are too big to fill out exercises from pdf workbooks.    Is there any tool that suits this job? I don't care whether it is open source or I have to pay a reasonable price for it.


Good evening, I am trying to construct a menu system for a program I am building to practice my mental mathematics. The idea is that selecting the option “1” in the below sub-menu (sub1) causes the introductory dialogue generated in the function two_by_three_mult (called upon selecting “1”) to change to reflect the choice made. However when option “1” is selected the intro_dialogue variable does not change to equal “2-digit by 3-digit multiplication”, meaning that when the two_by_three_mult function runs the correct message is not displayed.   I assume this issue arises because I am attempting to call a function (two_by_three_mult) and change a variable (intro_dialogue) which said function utilises within the same IF clause however I cannot work out how to format my code to fix this.   def sub1():     sub1_1 = int((raw_input("""Welcome to the practice area. What would you like to practice?     1:2-digit by 3-digit multiplication     2:Anything else     """)))     if sub1_1 == 1:         def printHam():             intro_dialogue = "2-digit by 3-digit multiplication"         two_by_three_mult()     elif sub1_1 == 2:         sub12_1 =(raw_input("""under construction. press 'm' to return to the main menu. Press any other button to exit         """))         if sub12_1 == "m":             main_menu()  def two_by_three_mult():     import random     questions = int((raw_input("Welcome to the %s multiplication programme.  How many questions do you wish to attempt? "%(str(intro_dialogue)))))

The following code works as expected in both Python 2.5 and 3.0:  a, b, c = (1, 2, 3)  print(a, b, c)  def test():     print(a)     print(b)     print(c)    # (A)     #c+=1       # (B) test()   However, when I uncomment line (B), I get an UnboundLocalError: 'c' not assigned at line (A). The values of a and b are printed correctly. This has me completely baffled for two reasons:   Why is there a runtime error thrown at line (A) because of a later statement on line (B)? Why are variables a and b printed as expected, while c raises an error?   The only explanation I can come up with is that a local variable c is created by the assignment c+=1, which takes precedent over the "global" variable c even before the local variable is created. Of course, it doesn't make sense for a variable to "steal" scope before it exists.  Could someone please explain this behavior?


I have an array declared like this float dati[10];  I normally subscript the array like as follows dati[2] = 5;  But i have also seen other types of substriptions like 2[dati] = 5;  and *(dati+2) = 5;  Can anyone tell me what's the difference between these three?

As Joel points out in , in  (aka: K & R), there is mention of this property of arrays in C: a[5] == 5[a]  Joel says that it's because of pointer arithmetic but I still don't understand. Why does a[5] == 5[a]?


I'm facing an issue with an STM32F105 microcontroller which with a simple code executing in a while loop it stops after 16 second here is code which I don't think there is a problem with the code since it runs fine on STM32F103 while (1)   {       uint8_t frame[8] = {'H','E','L','L','O','W','O','R'};       CAN1_TX(0x110110,8,frame);       HAL_GPIO_TogglePin(GPIOA, GPIO_PIN_1);       HAL_Delay(500);       CAN1_TX(0x110110,8,frame);       HAL_GPIO_TogglePin(GPIOA, GPIO_PIN_2);       HAL_Delay(500);   }  void CAN1_TX(uint32_t id,uint32_t dlc,uint8_t frame[8]){     char msg[50];     CAN_TxHeaderTypeDef TxHeader;     uint32_t TxMailbox;     TxHeader.DLC = dlc;     TxHeader.ExtId = id;     TxHeader.IDE = CAN_ID_EXT;     TxHeader.RTR = CAN_RTR_DATA;     if(HAL_CAN_AddTxMessage(&hcan1, &TxHeader, frame,&TxMailbox) != HAL_OK){         Error_Handler();     }      while(HAL_CAN_IsTxMessagePending(&hcan1, TxMailbox)); }  The two leds blinks for 16 seconds and then they stop. When I changed the delay to 500 it blinks now for 8 seconds only. The problem is from the CAN_TX functions the problem only happens when CAN1_TX or CAN2_TX added Debugging didn't help after that 8 seconds the debugger don't show any problem or where it is hanging EDITED** Now after more digging.I changed the CAN mode to LOOPBACK and the problem disapeared it seems that the problem only happens on normal mode but why ?  when I switch back to normal mode the problem came back please note that the CAN_TX does not work now while it was sending frames yesterday here is the clock config in case it has anything to do with this issue

I'm a beginner and I'm using STM32F10x family to learn about electronics.I was using STM32F103 blue pill in the past few months and I can debug it and upload code to it while both boot0 and boot1 are equal to 0. When I switched to STM32F105 which has only boot0 and exposed since I couldn't find boot1 in the pinout in the datasheet.I have to hook boot0 into vcc in order to flash the elf file.now this also happens on the blue pill I can't flash it wihout turning boot0 into 1. the problem is I can't debug it while boot0 is equal to 1 i'm getting Target is not responding, retrying... Target is not responding, retrying... Error! Failed to read target status Debugger connection lost. Shutting down... I think its because boot0 is equal to 1. and when I turn back boot0 into zero the debugger can't flash the file and can't debug. I'm trying to debug it since I have a problem I done a simple code to toggle led after 1 second but the code only execute for 16 seconds and stop executing. and I want to debug it to see why. on the STM32F103 the this problem don't happen


I am making a python script which hashes a string using an algorithm that the user specifies in input using hashlib. After I hash the string, I want to do the same thing to it, no matter what hash algorithm the user chose. Because of that I wanted to make a function for it, not to repeat code but wouldn't know how to change the built-in hash function based on the input. My code right now looks like this:  current_algorithm = input('Hash algorithm: ')      if current_algorithm == 'md5':     hashed = hashlib.md5(word).hexdigest()     # Execute the same code here elif current_algorithm == 'sha256':     hashed = hashlib.sha256(word).hexdigest()     # Execute the same code here  elif current_algorithm == 'sha512':     hashed = hashlib.sha512(word).hexdigest()     # Execute the same code here   The function hashlib.algorithm(word).hexdigest() has to change depending on which algorithm the user chose. For example, if the user chose sha512, the code would look like this: hashlib.sha512(word).hexdigest(), instead, if the user chose md5, the code would look like this: hashlib.md5(word).hexdigest() and so on. However, the code under these lines is exactly the same and right now I am repeating it 3 times, and possibly more if I will add more algorithms in the future. Therefore how do I make a function that changes algorithm based on user input, so that I do not have to repeat so much code? I was thinking to take advantage of arguments, but wouldn't know how to work around it. This is kind of what I had in mind, but would not work since you can't change built-in methods:  def func(algorithm):     hashlib.algorithm(word).hexdigest()     # Execute the same code here  if current_algorithm == 'md5':     func(current_algorithm) elif current_algorithm == 'sha256':     func(current_algorithm) elif current_algorithm == 'sha512':     func(current_algorithm)   Then, under every if statement I would call the function with and passing it the user input (containing the hash algorithm) as an argument.  I hope the question is clear and would appreciate any help!

What is the best way to go about calling a function given a string with the function's name in a Python program.  For example, let's say that I have a module foo, and I have a string whose content is "bar". What is the best way to call foo.bar()?  I need to get the return value of the function, which is why I don't just use eval. I figured out how to do it by using eval to define a temp function that returns the result of that function call, but I'm hoping that there is a more elegant way to do this.


I am wondering if anyone can validate my proof for this problem I am working on.  Question: Let $f(x)$ be a non-constant polynomial in $\mathbb Z[x].$  Prove that $\langle f(x)\rangle$ is not maximal in $\mathbb Z[x]$.  Clearly $\frac{\mathbb Z[x]}{\langle f(x)\rangle}$ is a field iff $\langle f(x)\rangle$ is a maximal ideal.  Proof: $\langle f(x)\rangle = \{g(x)f(x) \mid g(x) \in \mathbb Z[x]\}$. Thus $\langle f(x)\rangle$ is just all non-constant polynomials.  Let $a \in \frac{\mathbb Z[x]}{\langle f(x)\rangle} = \{ a_0 + \langle f(x)\rangle \mid a_0 \in \mathbb Z\}$. Thus $a_0$ is a constant and is not 'absorbed' by $\langle f(x)\rangle$.  Does there exists an element $b \in \frac{\mathbb Z[x]}{\langle f(x)\rangle} = \{ b_0 + \langle f(x) \rangle \mid b_0 \in \mathbb Z[x]\}$ s.t. $ab = 1 + \langle f(x)\rangle$ (the identity).  But $\langle f(x)\rangle$ absorbs all non-constant polynomials, thus $a_0$, $b_0$ must be non-constant, and $a_0 b_0 \in \mathbb Z$.  Clearly, not all elements of $\mathbb Z$ have multiplicative inverses, and there does not exist elements   $a = \{a_0 + \langle f(x)\rangle \mid a_0 \in \mathbb Z\}$, $b = \{b_0 + \langle f(x) \rangle \mid b_0 \in \mathbb Z[x]\}$ where $a_0 b_0 = 1 + \langle f(x)\rangle$.  Therefore, not all elements of $\frac{\mathbb Z[x]}{<f(x)>}$ are units, $\frac{\mathbb Z[x]}{\langle f(x)\rangle}$ is not a field, $\langle f(x)\rangle$ is not a maximal ideal of $\mathbb Z[x]$.

Let $f$ be a nonconstant element of ring $\mathbb Z[x]$. Prove that $\langle f \rangle$ is not maximal in $\mathbb Z[x]$.   Let us assume $\langle f \rangle$ is maximal. Then $\mathbb Z[x] / \langle f \rangle$ would be a field. Let $a \in \mathbb{Z}$. Then $a + \langle f \rangle$ is a nonzero element of this field, hence a unit. Let $g + \langle f \rangle$ be its inverse. Then $a g - 1 \in \langle f \rangle$, hence $ag(x)-1 = f(x)h(x)$ for some $h \in Z[x]$, hence $ag(0) + f(0)h(0) = 1$, thus $(a,f(0))=1$ for all $a \in \Bbb Z$, contradiction, hence the proof.  Is my argument correct? Is there any other method?