How to get the table name and column from mysql using php?

I've created a joined table in mySQL which looks like this.  SELECT junction_departments_qsps.departments_fk, junction_departments_qsps.checked, qsps.id, qsps.qsp_name, employees.id, employees.first_name, employees.last_name   FROM junction_departments_qsps   INNER JOIN qsps ON junction_departments_qsps.qsps_fk = qsps.id   INNER JOIN employees ON employees.department_id = junction_departments_qsps.departments_fk   WHERE junction_departments_qsps.checked = 1    As you can see I have a few table with the same column name "id".  In mySQL you link the table-name to the column-name like table-name.column-name.  In PHP I would usually get a column name by creating a loop and then echoing     $variable["column-name"];     Is there a way in PHP to get a table-name and column-name like in mySQL?  I've tried this  $variable["table-name.column-name"];   It doesn't work.  My problem with my joined tables is that when I do  $variable["id"];   I'm not getting the right id because I have multiple id's being asked for in mySQL.  Thank you really appreciate the help! :)


Using a previously used username that is no longer in use for my new Facebook page

Facebook will not allow me to use "godjhavoc" as my username for my Facebook page.   The thing is, that username is no longer in use so I don't understand why Facebook won't let me use it.  Previously I used "godjhavoc" as my username for my personal page but I changed it to "ibraheempedro" so I figured "godjhavoc" would be available but it is not.  How do I use "godjhavoc" as my username for my Facebook page?


How to check key at array and get one line output found or not?

i got array from user wanna hint in my assignment user input array elements and key and i'll check if the key found in the array or not and my output should be one line key found or not , and i tried more than time to fix it and thinking more but have no idea how to get only one output in same time i checking all array elements witch mean i'll get num of elements output lines ^_^   Scanner in=new Scanner(System.in);         System.out.println("Enter array size ? ");         int size=in.nextInt();         int input[] = new int[size];          for(int i=0;i<size;i++){             System.out.println("Enter array element #"+i);             input[i]=in.nextInt();         }         System.out.println("Enter key ? ");         int key=in.nextInt();         for(int i=0;i<size;i++){             if(key!=input[i]){                 System.out.println("key not found");             }else if(key==input[i]){                 System.out.println("key found");             }         }


I changed my phone number and can't verify my Gmail account.  How do I fix this? I know my password. I've tried accessing my alternative email. Nothing is working.  I can't regain access to my old number. How do I access my account?


DS160 connecting flight Atlanta keeps asking for location of stay but not staying

My partner needs to get a visa.  From all I read it's a transit C-1 that is required.  I have flight details completed and it asks for location of stay in US.  Then contact in US. However we are only in the airport to get connecting flight.    Can anyone advise what I should be selecting or do I just type does not apply?


What does "ii" mean in "dpkg --list" command output?

What is the significance/meaning of ii at the beginning of the output of  dpkg --list    command?  dpkg --list | grep firefox   for example, returns ii firefox together with other information.


I am getting these errors  W: Failed to fetch http://download.virtualbox.org/virtualbox/debian/dists/utopic/contrib/binary-amd64/Packages  404  Not found  W: Failed to fetch http://download.virtualbox.org/virtualbox/debian/dists/utopic/non-free/binary-amd64/Packages  404  Not found   How do I stop these messages from appearing?


Do we mention a girlfriend in UK visa application

I have another question regarding the UK visa application process.   We are hoping so he can come on holiday for 3 weeks in January. Do we give the information that I am his girlfriend? Of course, I don't want to hide it, but when researching this I have seen a lot of people say that you shouldn't give information you aren't asked for. We're putting me down as one of the friends he knows in the country so I wouldn't be surprised if the ECO found out I was his girlfriend anyway, so I don't want it to look like we were lying by omission. I know having a girlfriend in the country weakens the application, but I also don't want to ruin chances of future visas.  Should we put 'I am visiting the country as a tourist for a holiday from university and to visit my girlfriend' or do we not mention the girlfriend part unless explicitly asked?


Sci-Fi Book with an ice planet or something

I am trying to remember a book I read in  my teenage years (so the 1980's) that I thought was called "Ice Planet", but I can't find under that name.   The story is told from the viewpoint of what we later learn is an alien, and the first hint that the planet in question is Earth comes from the statement that it was special because mercury was liquid.  I believe the alien worked for a kind of drug control department to stop smuggling tobacco which had a much stronger effect on aliens than on humans.


No space left on device but there actually is

I'm getting the following error on Ubuntu 16.04 server when I try to install anything with apt;  gzip: stdout: No space left on device  But I do have plenty of space as you can see here;  ~ # df -h Filesystem      Size  Used Avail Use% Mounted on udev             32G     0   32G   0% /dev tmpfs           6.3G  8.0M  6.3G   1% /run /dev/md2        437G  186G  229G  45% / tmpfs            32G     0   32G   0% /dev/shm tmpfs           5.0M     0  5.0M   0% /run/lock tmpfs            32G     0   32G   0% /sys/fs/cgroup /dev/md1        488M  469M     0 100% /boot tmpfs           6.3G     0  6.3G   0% /run/user/0   Inodes:  ~ # df -hi Filesystem     Inodes IUsed IFree IUse% Mounted on udev             7.9M   441  7.9M    1% /dev tmpfs            7.9M  2.3K  7.9M    1% /run /dev/md2          28M  395K   28M    2% / tmpfs            7.9M     1  7.9M    1% /dev/shm tmpfs            7.9M     4  7.9M    1% /run/lock tmpfs            7.9M    17  7.9M    1% /sys/fs/cgroup /dev/md1         128K   330  128K    1% /boot tmpfs            7.9M     4  7.9M    1% /run/user/0   What's the problem and how can I fix this?  Note: I tried this answer but it didn't help;


Create alias that can interact with arguments

My ultimate goal is to simplify routine task of compilation and run.  Now I've following commands   1. g++ foo.cpp -o foo --std=c++11  2. chmod foo +x #this may be overkill  3. ./foo   So, my question if this can be done like  compile foo   with alias or something like that    I've tried  alias compile='g++ $1.cpp -o $1 --std=c++11'   with no luck


Why are rules not combining in an ssh config file?

It seems like the following would work as expected, i.e., that the second rule, having a hostname that matches the first rule, would apply it.  Host *.hostname.com  User myuser  IdentityFile ~/.ssh/myidentity  Host blah  HostName complicated.hostname.com   However typing ssh blah only applies the second rule (and not the user or identity file of the first one).  I have two questions:   Why is this happening? Is it possible to (simply) do what I am trying to do?


There is a restriction on setting your birthday:     Oops! There was a problem updating your profile:   - Birthday must be after 1920/01/01   I realize the number of 90 year old users is small, but shouldn't the restriction be a bit more relaxed, such as larger than any ?  Either 120 or 150 seems appropriate.  For example, my grandfather turns 90 next year (and just barely misses the current cutoff), but I can't imagine he's the only one around that age who is computer literate and still active enough to be interested in (the increasingly broad range of) SE sites.  I don't think he has contributed yet (mostly because of the comment restriction, I'd see him commenting before asking or answering), but I have emailed him with links that I know he's read.  Incidentally, the error message is wrong: birthday must be after 1919/12/31 and using the next day is accepted.


I've never had a problem when they are out of season, but sometimes when I buy big, beautiful, local green onions, inside the green part is VERY slimy! I have asked the produce guys about it on different occasions and they all look at me like a deer in headlights!  Any answers?


Proving that $L=\{w\in \Sigma^*: |w|_a= 2^n +273$, $n\in \mathbb{N} \}$ is irregular.

I am trying to prove that $L=\{w\in \Sigma^*: |w|_a= 2^n +273$, $n\in \mathbb{N} \}$ is irregular, whereas: $\Sigma=\{a,b\}$. I tried to use the pumping lemma with no success. I have also tried to prove that there are infinite equivalency classes (thus, $L$ doesn't have a finite automata which accepts it) but I got stuck, any help?


How can I add a logout link in my websites menu? Is there a PHP code or link that I can use to be able to do this?  Thanks


Suppose the collection $\{A_1, A_2,... A_k\}$ forms a group under matrix multiplication, where each $A_i$ is an $n×n$ real matrix. Let $A=\sum_{i=1}^kA_i$.  Show that $A^2=kA$ If the trace of $A$ is zero, then show that $A$ is the zero matrix  My try: Since $G=\{A_1, A_2,... A_k\}$ forms a group under matrix multiplication, there exists $A_p=I$ for some $ p\in \{1,2,...k\}$. WLOG let $A_1=I$. Also being group, for each $A_i \in G$ there exist $A_j \in G$ for some $j\in\{1, 2,...,k\}$ I cannot proceed further how to solve this problem. Please help me. Thank you in advance


iphone app cannot render formulas in comments

At least on my iPhone 4s, the app shows the LaTeX code in the comments, instead of rendering it. Not sure if this also happens in other parts besides comments.


I have a text file in the following format:  Surname, Forename: Day.Month.Year: Degree  Sellen, Jo: 03.07.1986: MSc CSE  Parfitt, Harry: 20.03.1984: MSc IT   How can I write a shell script that uses awk to read the file (class.txt) like this:  awk '{gsub(/ +/,"\t");print}' class.txt   and outputs the data in the following format, that exchanges the second and third column:  Surname Forename MSc stream Date of Birth  Sellen Jo MSc CSE 03.07.1986   Parfitt Harry MSc IT 20.03.1984   (Don't worry if tabbed columns don't line up)


Proving that an open interval is an open set

Suppose that a,b exist in $\Bbb R$ with $a < b$.  Show for every $x$ that exists in $(a,b)$, there exists $\epsilon\ > 0$ such that there is an $\epsilon$-neighborhood centered at $x$ that is contained in $(a, b)$.


I am writing a little library with some prime number related methods. As I've done the groundwork (aka working methods) and now I'm looking for some optimization.  Ofcourse the internet is an excellent place to do so. I've, however, stumbled upon a rounding problem and I was wondering how to solve this.  In the loop I use to test a number for it's primality it's more efficient to search until sqrt(n) instead of n/2 or even n - 1. But due to rounding problems some number get skipped and thus some primes are skipped! For example, the 10000th prime should be: 104729, but the 'optimized' version ends up with: 103811.  Some code (it's open for more optimization, I know, but I can handle only one thing at a time):  /// <summary> /// Method for testing the primality of a number e.g.: return IsPrime(29); /// History: /// 1. Initial version, most basic form of testing: m smaller then n -1 /// 2. Implemented m smaller then sqrt(n), optimization due to prime factoring /// </summary> /// <param name="test">Number to be tested on primality</param> /// <returns>True if the number is prime, false otherwise</returns> public static bool IsPrime(int test) {     // 0 and 1 are not prime numbers     if (test == 0 || test == 1) return false;      // 2 and 3 are prime numbers     if (test == 2) return true;      // all even numbers, save 2, are not prime     if (test % 2 == 0) return false;      double squared = Math.Sqrt(test);     int flooredAndSquared = Convert.ToInt32(Math.Floor(squared));      // start with 5, make increments of 2, even numbers do not need to be tested     for (int idx = 3; idx < flooredAndSquared; idx++)     {         if (test % idx == 0)         {             return false;         }     }     return true; }   I know the squared part fails me (or I fail), tried Math.Ceiling as well, with about the same results.


Data has two trends; how to extract independent trendlines?

I have a set of data that is not ordered in any particular way but when plotted clearly has two distinct trends. A simple linear regression would not really be adequate here because of the clear distinction between the two series. Is there a simple way to get the two independent linear trendlines?  For the record I'm using Python and I am reasonably comfortable with programming and data analysis , including machine learning but am willing to jump over to R if absolutely necessary.


Is there a way to split a hollow mesh by faces?

For example, I have a hollow cubic sphere like this:  A problem is to split it by all its faces like this:  The way I have done this one is an application the P > Selection to an outer face and an appropriate inner one. Then I just have connected appropriate edges to get that little piece. But this way is not really practical since I have to iterate over each face of the sphere manually. Is there a way to get the result automatically?


Unable to get correct Signature for Twitter Integration

Below code is from Postman which works exactly how I want, curl --location --request POST 'https://api.twitter.com/1.1/direct_messages/events/new.json' \ --header 'Authorization: OAuth oauth_consumer_key="#################",oauth_token="#############-################",oauth_signature_method="HMAC-SHA1",oauth_timestamp="1603808358",oauth_nonce="#######",oauth_version="1.0",oauth_signature="##############%3D"' \ --header 'Content-Type: application/json' \ --header 'Cookie: personalization_id="v1_U#########OCY3e24A=="; guest_id=v1%3A160302#######; lang=en' \ --data-raw '{ "event": {   "type": "message_create",   "message_create": {     "target": {       "recipient_id": "#######"     },     "message_data": {       "text": "Hello World!"     }   } } }'  However while generating the signature from Salesforce I am getting the error "401: Unable to authenticate the user" Please find below code in Salesforce: String oathNonce = TwitterDirect_Message.generateOathNonce();             Long timestamp = TwitterDirect_Message.generateTimeStamp();             //oauth_signature parameter contains a value which is generated by running all of the other request              //parameters and two secret values through a signing algorithm             String signature = '';            //Encodes a string into the application              String othSecret = Encodingutil.urlEncode(Accesstokensecret, 'UTF-8');             String consumSecret = Encodingutil.urlEncode(APIsecret, 'UTF-8');             String othToken = Encodingutil.urlEncode(Accesstoken, 'UTF-8');             String othNonce = Encodingutil.urlEncode(oathNonce, 'UTF-8');             String consumKey = Encodingutil.urlEncode(APIkey, 'UTF-8');             String paramString = 'include_entities=true&'+                                  'oauth_consumer_key='+consumKey+'&'+                                  'oauth_nonce='+othNonce+'&'+                                  'oauth_signature_method=HMAC-SHA1&'+                                  'oauth_timestamp='+timestamp+'&'+                                  'oauth_token='+othToken+'&'+                                  'oauth_version=1.0';             string baseString = 'POST&'+EncodingUtil.urlEncode('https://api.twitter.com/1.1/direct_messages/events/new.json', 'UTF-8')+'&'+                    EncodingUtil.urlEncode(paramString, 'UTF-8');             string signString = consumSecret+'&'+othSecret;             blob blobBaseString = Blob.ValueOf(baseString);             blob blobSignString = Blob.ValueOf(signString);             blob signBlob = crypto.generateMac('hmacSHA1',blobBaseString ,blobSignString );                     signature =  EncodingUtil.base64Encode(signBlob);             System.debug('signature: '+signature);


Transferring to a Top-10 PhD program in Theoretical Physics from a Top-50 program in US for better job prospects in Academia?

I will be soon joining a Top-50 school for a PhD in High Energy Theory. They have some very good professors who have published top quality journal articles in their area of expertise (even with some Nobel Laureates as co-authors). They are not as famous as Nathan Seiberg, Leonard Susskind, etc. though. I would like to know, given the job scenario in academia (especially in high energy theory), is it worth transferring to a top school like Harvard or Princeton after performing very well at my current school ? I mean, is their any huge advantage in the academic job market to be at a Top-10 school compared to a Top-50 school ?   I do not really care about going to a brand name school as far as my studies are concerned. I just want to make sure that if I work hard and succeed, I do not face problems in getting an academic job just because I did not attend Harvard or Princeton. Academically, my current school is very good too but it doesn't have that IVY kind of brand. My concern is only about the people in the hiring committees otherwise I am happy going to my current school.  Also, I have earlier worked with Professors who graduated from such top schools and they say that famous advisors are like "King-Makers" who get their students well placed in academia after PhD since they have influence in the field. Personally, I have no issues being at my current school if I get good people to work with. Also, is it ethically good to change schools like this ?


30" monitor has black border around desktop

I have been using a 24" monitor with my macbook pro early 2011 connected via a mini display port to DVI adaptor.  I recently received an HP Z30i 30" monitor.  When I connect to it with an mini display port to display port adaptor, although it displays at the monitors native 2560x1600 resolution, the mac is scaling the desktop display down so as to leave a 1cm or so black border around the desktop.  The mac reports using a resolution of 2560x1600 and the display reports this also.   This makes the display blurry as single pixels become sub pixels.   The display looks like the same effect as having "under scan" turned on when using an HDMI cable at 1080p.  I thought that maybe there was a hardware or display problem, but when I boot off a previous system partition from a different hard-drive using the same OS (10.8.5) release, the monitor set up works perfectly.  This proves the OS release, display and the hardware, so I'm thinking that there must be a preferences problem with my current setup.  Perhaps the under scan setting is somehow being applied to this display when it's not using HDMI?  I've tried deleting /Library/Preferences/com.apple.windowserver.plist, ~/Library/Preferences/ByHost/com.apple.windowserver.HostNumber.plist and rebooting but no results.   The scaling is applied before the login screen and logging in as a different user has the same problem.  Any ideas?  It's driving me nuts, I've got this nice 30" screen and I can't use it!


I am trying to work out how to have a fake mirror in my scene. Character A walks by a mirror on the wall, which should reflect the room and everything in it, except Character A. Instead of Character A, it reflects Character B. So, basically, I want a simple reflective surface, but:  Character A should not be visible in what the surface reflects. Reflections should be rendered as if Character A is not in the scene Character B will be in the scene, but only visible in the reflective surface, not in the world itself.  Here, crude graphic to show what I mean :D  Less crude graphic here:  Is this possible with Blender? I'm familiar with all of the most general functionality, but I can't think of anything that would achieve this. Are there data properties I can tweak? Is there a modifier that'll achieve it? Reflection probe trickery? I intend to use Eevee for the rendering, but if Cycles achieves this better, I can switch. EDIT: I can of course elect to not using a reflective but a transmissive surface and just model the contents of the mirror behind the surface. So instead of having any reflection at all, I'll just copy and mirror the geometry and do everything manually, but 1) that's a lot of work, 2) not really an answer to the technical question I'm asking.


Why After trigger cannot update same record?

I know after trigger cannot update the same record. But i would like to know why. I know the record is committed into the database. So the record is read only. But why the record is read only.


Noob questions, simple answers and big rep points

I struggle to pick up rep points even when answering questions and giving good demo's of code via a pastebin - sometimes spending 15 mins+. Then along comes a noob question, for instance  and before you know it the simple answer has got 26 upvotes, never mind the 11 for asking.  Can we do anything about this? Maybe give the question a complexity rating which goes towards the possible amount of points that can be earned? Probably contentious I know but its just an idea.


Yesterday I watched  and saw this scene.   Its around 1:15:25  So is  happened before Captain America: The Winter Soldier?? And when did Doctor Strange exactly took place?


Difference between 2>&-, 2>/dev/null, |&, &>/dev/null and >/dev/null 2>&1

Just looking for the difference between   2>&- 2>/dev/null |& &>/dev/null >/dev/null 2>&1   and their portability with non-Bourne shells like tcsh, mksh, etc.


I purchased, DELL Vostro-3558-Latop series with i3 5th Gen, 1TB HDD, 2G nVidia Graphics, 4GB DDR3 RAM and Ubuntu 14.04 pre-installed. I am totally at mercy of DELL Support. During software update the laptop got hanged and corrupted the installed operating system.  DELL Support raised their hands and said they do not support in UBUNTU.  Now somehow i managed to install the UBUNTU 16.04, but i am not able to see the appropriate driver for nVidia 920m graphics.  Please help me in getting the same restored back the nVidia Settings for enabling/disabling the graphics.  By any way like GUI, command etc.


system crashed after changing /etc permission

os- ubuntu 14.04 LTS  Unfortunately i changed permission of my /etc folder I ran following command        sudo chmod -R 777 /etc   and after this my system crashed.  When I tried to reboot it, it keeps showing a warning -                    system booting without full network configuration    and not booting at all.  How can I fix this?Because all my data and project are in there and I don't want to reinstall OS. Please help.


Need to import Symbology from ArcGIS PRO to QGIS 3.10 over ubuntu. Will .SLD do the work?


How do I find $\lim_{(x,y) \to (0,0)} \frac{\sqrt{xy + 1} -1}{x + y}$?

Compute $$\lim_{(x,y) \to (0,0)} \frac{\sqrt{xy + 1} -1}{x + y}$$  If you look at the graph of the function, it suggests that the limit does not exist. In fact, the limit DOES NOT exist. But how do I prove that?  When I approach the function from either $x$ or $y$-axis, the limit is equal to $0$. It is also equal to $0$ for every line (except for $x=-y$) passing through the origin.  I tried to approach $0$ on a parabola $y=x^2-x$ but the limit was again $0$.  Any thoughts would be appreciated.  Edit:  I did a mistake when calculating the limit as I approached $0$ on the parabola $y=x^2-x$ the result should be $1$ for that limit proving that the limit does not exist.


I'm using RegexBuddy but I'm in trouble anyway with this thing :\  I'm processing line by line a file. I built a "line model" to match what I want.  Now i'd like to do an inverse match... i.e. I want to match lines where there is a string of 6 letters, but only if these six letters are not Andrea, how should I do that?    EDIT: I'll write the program that uses this regex, I don't know yet if in python or php, I'm doing this thing first to learn some regex :) There are different types of line, I wanted to use regex to select the type i'm interested in. Once I got these lines I've to apply an other filter just to do not match a known value, I need all the others, not that. The (?!not-wanted) is working pretty fine, thank you. :-)  I hope this clarifies the question :)


I have a significant 2x2 interaction in a between-subjects design.  I would normally report omega-squared as my effect-size measure, but I've been asked to provide Cohen's d instead?  Can Cohen's d be computed for an interaction?  If so, how?


Comparing strings stored in two different arrays and output a string from another array if the strings match

I'm trying to make a comparison between two arrays called opCode[] and commands[]. My objective is to check for string equality, then display the corresponding string stored in another array called bin[]. I'm trying to simulate an assembler. public class Assembler  {   static String[] commands = new String[23];   static String[] bin = new String[23];      static String[] opCode;   static String[] operand;      public static void main(String[] args)    {     try {       /*        * Parse mac1 text file        */       BufferedReader br = new BufferedReader(new FileReader("mac1.txt"));        int i = 0;       String line;       String[] data = null;              while((line = br.readLine()) != null) {         data = line.split("\\|");         commands[i] = data[0];         bin[i] = data[1];         i++;             }              /*        * Parse algo text file        */       FileReader file = new FileReader("algo.txt");       BufferedReader br2 = new BufferedReader(file);              Path f = Paths.get("algo.txt");       long count = Files.lines(f).count();        opCode = new String[(int) count];       operand = new String[(int) count];                     i = 0;       String line2;       String[] data2 = null;              while((line2 = br2.readLine()) != null) {         data2 = line2.split(" ");         opCode[i] = data2[0];         operand[i] = data2[1];         i++;             }            }     catch(IOException e) {       System.out.println("File not found!"); //displays error msg if file is not found     }     translate();   }      public static void translate()   {     for(int i = 0; i < opCode.length; i++)     {       if(commands[i] == opCode[i])       {         System.out.println(bin[i]);       }     }   } }  commands[] / bin[]  opCode[] / operand[]  translate() isn't outputting anything. It could be the way I set up the the loop and conditional. What I'm trying to do is traverse through opCode[] and check for the matching strings in commands[], then output the corresponding binary sequence in bin[]. Thanks in advance!


I need to prove these 3 statements, and I don't know how to start...  A is an nxn matrix:  1) if rank(A) = n then rank(adj(A)) = n  2) if rank(A) = n-1 then rank(adj(A)) = 1  2) if rank(A) < n-1 then rank(adj(A)) = 0


Using the properties of real numbers, verify commutativity on complex numbers.

I have just started self-studying Linear Algebra after a 3 year hiatus from mathematics (in an extended neuroscience foray), and I want to ensure that I am sufficiently verifying commutativity of complex numbers by using the properties of real numbers.  My attempts...  (1) Commutativity of Addition:   Verify that $w + z = z + w$ for all $w, z \in \mathbb{C}$.  $$w + z = (a + bi) + (c + di) \hspace{10mm}\text{by definition of }\mathbb{C}$$ $$\hspace{13mm} = a + (bi + c) + di \hspace{10mm}\text{by associativity in }\mathbb{R}$$ $$\hspace{17mm} = a + (c + bi) + di \hspace{10mm}\text{by commutativity in }\mathbb{R}$$ $$\hspace{16mm} = (a + c) + (bi + di) \hspace{10mm}\text{by associativity in }\mathbb{R}$$ $$\hspace{19mm} = (c + a) + (di + bi) \hspace{10mm}\text{by commutativity in }\mathbb{R}$$ $$\hspace{13mm} = c + (a + di) + bi \hspace{10mm}\text{by associativity in }\mathbb{R}$$ $$\hspace{17mm} = c + (di + a) + bi \hspace{10mm}\text{by commutativity in }\mathbb{R}$$ $$\hspace{17mm} = (c + di) + (a + bi) \hspace{11mm}\text{by associativity in }\mathbb{R}$$ $$\hspace{13mm} = z + w \hspace{34mm}\text{by definition of }\mathbb{C}$$  $$\blacksquare$$  This seems a bit verbose to me - is it acceptable to combine steps? For example, rather than:  $$w + z = (a + bi) + (c + di) \hspace{10mm}\text{by definition of }\mathbb{C}$$ $$\hspace{13mm} = a + (bi + c) + di \hspace{10mm}\text{by associativity in }\mathbb{R}$$ $$\hspace{17mm} = a + (c + bi) + di \hspace{10mm}\text{by commutativity in }\mathbb{R}$$ can I instead write: $$w + z = (a + bi) + (c + di) \hspace{10mm}\text{by definition of }\mathbb{C}$$ $$\hspace{48mm} = a + (c + bi) + di \hspace{10mm}\text{by associativity and commutativity in }\mathbb{R}$$?  (2) Commutativity of Multiplication:  Verify that $wz = zw$ for all $w, z \in \mathbb{C}$.  $$\hspace{-14mm}wz = (a + bi)(c + di) \hspace{24mm}\text{by definition of }\mathbb{C}$$ $$\hspace{4mm} = a \cdot c + a \cdot di + bi \cdot c + bi \cdot di \hspace{10mm}\text{by distribution in }\mathbb{R}$$ $$\hspace{9mm} = a \cdot c + bi \cdot c + a \cdot di + bi \cdot di \hspace{10mm}\text{by commutativity in }\mathbb{R}$$ $$\hspace{35mm} = c \cdot a + c \cdot bi + di \cdot a + di \cdot bi \hspace{10mm}\text{by multiplicative commutativity in }\mathbb{R}$$ $$\hspace{1mm} = c(a + bi) + di(a + bi) \hspace{20mm}\text{by distribution in }\mathbb{R}$$ $$\hspace{5mm} = (c + di)(a + bi)\hspace{34mm}\text{by distribution in }\mathbb{R}$$ $$\hspace{4mm} = zw \hspace{55mm}\text{by distribution in }\mathbb{R}$$ $$\blacksquare$$  This also seems a bit wonky to me. Any and all suggestions on clearing up my verification, reasoning, etc. would be greatly appreciated!


I'd appreciate help with a couple questions regarding standard file permissions. Assume that I'm not using access control lists.     If a file is associated with multiple groups, must all groups have the same permissions?   If the group permission includes write access, can any member of any group the file is associated with change the file permissions? Can such a person change the file owner?   Say now the file permission is rwxr----- (owner can do everything, but group members can only read). I am in the group associated with the file. I am also the file owner. Which permission am I granted? Read-only, or rwx?


Prove that $X'X$ is rank-preserving of X

Given $X_{nxp}$ of rank p, we know that $(X'X)^{-1}$ exists because $X'X$ also has rank $p$. But how do you prove that $X'X$ has rank $p$ (it is rank-preserving of $X$)? What properties can you use to prove this?  Clarification: $X'$ is the transpose of $X$, and the values of $X$ are real.


I am having trouble constructing a stem and leaf plot in "R"  The data is: 1717, 1719, 1645, 3739, 3024 (This is only a subset of a larger sample but it is sufficient to show my problem)  The output I get is:  The decimal point is 3 digit(s) to the right of the |  1 | 677  2 |   2 |   3 | 0  3 | 7  This does not reconstruct my data as the numbers would be 1600, 1700... It seems my numbers have been rounded. I want to make the stem to be one digit as the thousands number and the leaves to be 3 digits to represent the hundreds, tens and ones. For ex) I want to 1717 to be 1|717  And I have tried scaling but that doesn't fix my problem, How do fix this issue?


Suggestion was tagged with status-declined and keep getting downvotes

I know that here on meta, downvoting mean disagree, but why the people continue downvoting it even after it already was declined?  The OP admited that the suggestion was bad and asked for sorry, but the people ignored and they keep downvoting the question hours after.  This is fair?


Reset AutoIncrement in SQL Server after Delete

I've deleted some records from a table in a SQL Server database. The IDs in the table look like this:  99 100 101 1200 1201...  I want to delete the later records (IDs >1200), then I want to reset the auto increment so the next autogenerated ID will be 102. So my records are sequential, Is there a way to do this in SQL Server?


Turn monotone increasing function to continuous function

Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a monotone increasing function. We know from a general fact that the set of discontinuities of $f$ is countable. Denote the set of discontinuities by $D$.  I want to construct a continuous function $g$ such that there exists a function $h$ defined on $D$ with $f(b)-f(a)=g(b)-g(a)+\sum_{x\in (a,b)\cap D}h(x)$.  The problem is that there can be a countable number of discontinuities, and it is not necessary that we can order them as $\cdots<x_{-2}<x_{-1}<x_0<x_1<x_2<\cdots$. How can we construct this function $g$?


Typical Unix/Linux programs accept the command line inputs as an argument count (int argc) and an argument vector (char *argv[]). The first element of argv is the program name - followed by the actual arguments.   Why is the program name passed to the executable as an argument? Are there any examples of programs using their own name (maybe some kind of exec situation)?


how to calculate earliest leap year in formula field salesforce

I am writing a formula where I need a logic for calculating the earliest leap year.     Formula   (Sum(Mort1, Mort2, Mort3)*1.08^(current year-earliest LP year))+water+ECB+Taxes   What logic we can apply for earliest LP year?


Defining column length for hashed password in MySQL

I'm working through a book and the exercise is below. I've found that the column length which the book called for wasn't actually long enough for the hashed password. I've now changed the value to match. However, my understanding is that the DEFAULT setting for hashing is a moving target. I understand that the resulting method changes based on best practice at the time called. I imagine the lengths change with it. If this is the case, what would the best approach be for establishing the password column in this scenario? I would like a solution which could accommodate new users using any DEFAULT hashing solution, whether they use the method chosen today or the one preferred six months from now.   require_once 'login.php';   $connection = new mysqli($hn, $un, $pw, $db);      if ($connection->connect_error) die("Fatal Error");      $query = "CREATE TABLE users (     forename VARCHAR(32) NOT NULL,     surname VARCHAR(32) NOT NULL,     username VARCHAR(32) NOT NULL,     password VARCHAR(32) NOT NULL )";  $result = $connection->query($query); if (!$result) die($connection->error);  $forename = 'Bill'; $surname = 'Smith'; $username = 'bsmith'; $password = 'mysecret'; $hash = password_hash($password, PASSWORD_DEFAULT);  add_user($connection, $forename, $surname, $username, $hash); echo 'First user added';  $forename = 'Pauline'; $surname = 'Jones'; $username = 'pjones'; $password = 'acrobat'; $hash = password_hash($password, PASSWORD_DEFAULT);  add_user($connection, $forename, $surname, $username, $hash); echo 'Second user added';  function add_user($connection, $fn, $sn, $un, $pw) {   $stmt = $connection->prepare('INSERT INTO users VALUES(?,?,?,?)');   $stmt->bind_param('ssss', $fn, $sn, $un, $pw);   $stmt->execute();   $stmt->close(); } ?>


what is the right way to say?  "combat sports lesson" (sports with s) or "combat sport lesson"?  It should not mean a specific style of combat sport like wrestling or karate.  It should mean combat sport in general.  Thank you.


relative clauses - when can we omit the pronoun?

When can the relative pronoun be omitted? This is not very clear for me. I don't understand the rules.


I've lost access to my SE email and password; do I have options?

A while ago I lost my password database (and since then do the obvious and have encrypted backups...) and as a result I lost my password to most websites and I was unable to recover one of my emails. I decided just now to see how the SE site works on mobile (I use the app exclusively), but I just realized which email this account is associated with!  Is there any way I can get the password or/and email of this account changed?  If not should I try to use this account for as long as possible, or just start over now? I'm finally at a happy place with my account and it'd be a shame to start over.


Java - How To Create A Single-Instance Program

Am developing a certain management system, however i have a problem. Every time i launch the system it keeps showing it's self in the toolbar meaning it runs many times instead of running once.... Is there any way I can create a launcher that checks if an instance of program is already running, if it's running to prevent it from opening another instance.. The image below show what i want to avoid....


Probability distribution function of a function of random variables

Suppose that X, Y and Z are independent random variables, each uniformly distributed on [0, 1]. Prove that (XY)^Z is also uniformly distributed on [0, 1]. While trying to solve the aforementioned question, I assumed a random variable W such that, W = (XY)^Z and applied logarithm on both sides which resulted in, lnW = Zln(X) + Zln(Y) then, found the probability density functions of ln(Y) and ln(X) and I am stuck at that step and couldn't proceed further. Thanks in advance


@interface default declaration usage in Java

I have just discovered this feature.   Declaring an interface using the "@interface" syntax allows you to put a default value.  public @interface HelloWorld {       public String sayHello() default "hello world"; }   This is something new for me. How is that default value suppose to be used.  I cannot find references to that, because the www is full of java interface documents prior to "@" addition in Java 1.5 ( was it on .5 or in .4? )     EDIT  Thanks for the answers ( I was somehow close to "annotation", for I use the tag already )  :P   I knew I should've read that document years ago!!!... let's see...      Many APIs require a fair amount of boilerplate code. For....


Let $W$ be a subspace of an inner product space $V$. Show that,  \begin{equation} W=(W^\perp)^\perp \end{equation}  I understand how this can work just not sure how to prove this mathematically. I know that $W^\perp=\big\{v\in V: \langle w,v \rangle=0 \space \forall \space w\in W \big\}$ but unsure what $(W^\perp)^\perp$ would be and how to use $(W^\perp)^\perp$ to prove that it is equal to $W$.


Best Ubuntu for a 2016 Dell Inspiron 3537

I want to know which you but it would be best for my Dell laptop. It’s preloaded with 12.04 currently its supporting 18.04 LTS bionic beaver however it 16.04 seems to be more stable can anyone offer any advice furthermore I intend to update to the newest version today to see what happens computer is free so I’m just figuring it all out


Can someone show me the chain of events which will lead to a faraway hurricane when I clap my hands (leaving everything else the same)?

I've been thinking about the  since I asked my  on this site, which was different because here I ask for showing me the mechanism for the "how". I even gave one (the first) answer as a favorite. Though many answers were given (many of which contained critical phenomena, which aren't the same as chaos: sure, if you change the direction of a little ball, which is aimed at the detonation device of a thermonuclear bomb, and the ball will miss the device because of this, the difference will be enormous: a bomb blast or not! If this ain't a very different response to a small change of initial conditions...But it ain't chaotic behavior). it's still not clear to me how clapping my hands can cause a hurricane far away. The weather system will the same after clapping my hands already at a little distance from my clapping due to the dissipation of my clapping energy into the surrounding air, and maybe a solution can be given in terms of energy.  If I'm standing in a heavy hurricane, I just can't imagine the storm could not have developed if someone far away didn't clap her hands  The best way to explain this is to give the chain of causes and effects that will lead to this hurricane if I clap my hands instead of not clapping at all. The weather system, for sure, contains no criticalities. The answer can also be given in the causes and effects of larger chunks of air (from little vortices to the similar behavior at larger scales, which are different only in their time-scale), rather than on the atomic level.   In a double pendulum, you don't vary the places in phase space by a small (and non-random) way for just a few atoms to show the dp shows chaotic behavior. You vary both arms of the dp by a tiny amount and see what happens, which, contrary to the weather can easily be done in an experiment.  The same reasoning can be given for a weather system.   Is there someone who can show this chain which causes the faraway hurricane by just clapping my hands and leave everything else the same?  Please don't think I ask this for collecting votes because it did in my first question ever here. You can see the contrary is happening, but I just want to see an argument that shows that you can't say the weather system is chaotic by varying a very tiny small part of it.


Why does "T" not equal "T" in this example?

I'm trying to write a simple hangman game in java for my college class. For some reason the if statement never returns seems to think that the two substrings being compared are equal. The two print statements show that by all rights the two should equate.  public String guessLetter(String letter) {     String blanks = "";             String theWord="FOO";     for(int i=0; i<=theWord.length()-1; i++)     {         System.out.print(letter.substring(0,1).toUpperCase());         System.out.print(theWord.substring(i,i+1)+ "\n");          if((letter.substring(0,1).toUpperCase())==(theWord.substring(i,i+1)))         {             blanks = blanks + theWord.substring(i,i+1);         }         else         {             blanks = blanks + "___  ";         }                }     return blanks; }   EDIT - As a great many people have pointed out, when comparing Strings, one must use the equals method instead of ==. I was unaware.


I heard light was its own antiparticle. What happens if two photons exactly cancel each other out?

In a laser multiple in-phase light rays add up into one strong coherent beam of light. What happens if two opposing laser beams sum up and exactly cancel each other out? Where does the lost energy go?


If $11..11$($n$ times 1) is prime, prove that $n$ is also prime

We know 11...11 (n times) is a prime number prove n is also prime.  it is easy to understand n is an odd number and 3 does not divide it but I could not do some thing more


How to quantify projection distortion using ArcGIS

I am trying to figure out a workflow to quantify the amount of distortion for different projections throughout a given area of interest.  I am thinking in the form that you would do a relative accuracy assessment.  The difference between the known (direction, distance, area, etc) vs the projected.  I envision the area of interest covered in a grid of points, lines and polygons (or whatever combination of vector i need for the calcs) and calculating the values both ways.  Is there something like that out there?  What would be the steps needed to take for each distortion?  I would probably only care about distance, area, and direction.


Im running 64 bits version, Im very new to ubuntu, just dived into it. this is what I do:  wget https://dl.google.com/linux/direct/google-chrome-stable_current_amd64.deb   then get:  `2016-10-01 23:22:41 (1.30 MB/s) - ‘google-chrome-stable_current_amd64.deb’ saved [49990192/49990192]`   then   sudo dpkg –I google-chrome-stable_current_amd64.deb   and get:  dpkg: error: need an action option   Type   dpkg --help for help about installing and deinstalling packages [*];  Use 'apt' or 'aptitude' for user-friendly package management;   Type  dpkg -Dhelp for a list of dpkg debug flag values;   Type  dpkg --force-help for a list of forcing options;   Type  dpkg-deb --help for help about manipulating *.deb files;   Options marked [*] produce a lot of output - pipe it through 'less' or 'more' ! Thanks in advance and sorry for my idiocy too


How do you derive an explicit solution to a functional equation using complex analysis?

For instance, take the gamma function. Somehow there is a way to use the identity $f(z+1)= z f(z)$ and  the condition $f(1)=1$ to derive the Euler/Laplace integral representation of the gamma function $\Gamma(z)$ using complex analysis as a solution to the functional equation, but how is that done? From what I have seen it is some kind of complicated analytical process involving contour integrals, can you apply a similar process to other functional identities?


I recently (Dec 2018) tried to enter the UK after traveling there for a week prior to December with no such trouble. This time however, I was trying to stay for 6 months to be with my boyfriend (UK citizen)... (I know bad move) Naturally and quite stupidly I quit my part time job as I thought I should to go on such the journey. I did not have any money for this trip as I would be relying on my boyfriend to "support" me during my stay there. I did not see any issue in doing this just as long as he could prove his source of income.  With this, I opted for the 6 month instead of say 2 weeks or 2 months (like I should have), i.e. I wanted to spend the most time with him that was possible, then go home. Anyways I was denied entry and sent home due to 'insufficient funds'; e.g. I quit my job in order to come on this trip, so to them I looked as if I cut all ties with my country, when in reality I was just trying to spend some much needed time with my boyfriend.  Long story short, if I try to reenter for two weeks, will I be denied again, being as from the nature of my second visit I was deemed a 'non genuine visitor"? I was told I was better-off applying for a visa. I was just genuinely confused about the rules on going for 6 months as you do not need a visa to visit up to 6 months if you are from the USA. I just want to make sure once I decide to travel again I won't have any hiccups.


JavaScript: Parsing a string Boolean value?

JavaScript has parseInt() and parseFloat(), but there's no parseBool or parseBoolean method in the global scope, as far as I'm aware.  I need a method that takes strings with values like "true" or "false" and returns a JavaScript Boolean.  Here's my implementation:  function parseBool(value) {     return (typeof value === "undefined") ?             false :             // trim using jQuery.trim()'s source             value.replace(/^\s+|\s+$/g, "").toLowerCase() === "true"; }   Is this a good function? Please give me your feedback.  Thanks!


I use Windows 7 SP1 x64 Ultimate and the Print Screen key stopped working: no image is put in the keyboard when I hit Print Key. Nothing happen  when I hit Alt +  Print Key either.   The issue affects the two keyboards that are connected to the computer. Windows' snipping tool works fine. Copy-pasting text works fine too.  I haven't tried to restart the computer, my guess is that it will work then, but I am curious to know what could cause the issue.


Is every Riemann-integrable function lebesgue integrable?

I thought every Riemann integrable function is lebesgue integrable. But , a user comments that the statement is not correct.  I'm confused.  Can someone clarify?


I have the problem that before and after a tikzpicture plot the distance is much higher than it should be  \documentclass[BCOR=3mm,11pt,headsepline,footsepline]{scrbook} \usepackage[ngerman]{babel} \usepackage[utf8]{inputenc} \usepackage{multirow} \usepackage{pgf,tikz} \usepackage[framemethod=tikz]{mdframed} \usepackage{amssymb} \usepackage{amsmath} \usepackage[dvipdfm]{geometry} \usepackage{tabulary} \usepackage{subfigure} \usetikzlibrary{arrows} \usetikzlibrary{shapes,snakes} \usepackage{ntheorem} \geometry{    inner=2cm,    outer=2cm,    top=2cm,    bottom=2.5cm,    head=2cm,    footnotesep=1cm, %   bindingoffset=1cm,    }  \mdtheorem[% apptotikzsetting={\tikzset{mdfbackground/.append style=% {top color=white, bottom color=white}, mdfframetitlebackground/.append style =% {top color=gray!10!white, bottom color=gray!10!white} }}, ,roundcorner=10pt,middlelinewidth=1.3pt, frametitlerule=true,frametitlerulewidth=1.3pt, innertopmargin=10pt,% ]{wissen}{Fehlerschwerpunkt} \begin{document} \subsection*{Aufgabe 5}  \begin{itemize} \item[•] $\displaystyle\lim\limits_{x\to 1} \ \frac{4x^2-3x-1}{x^2-1}=\lim\limits_{x\to 1} \ \frac{8x-3}{2x}=2,5$\\[3mm] Die Regel von L'Hospital darf angewendet werden, weil der Ausdruck $\frac{0}{0}$ entsteht \clearpage \begin{center} \begin{tikzpicture}[scale=0.6, >=latex,y=.5cm,x=1.7cm] \draw[-angle 45,line width = 0.8pt] (-4,0) -- (4,0) node[right] {\scriptsize $x$}; \draw[-angle 45,line width = 0.8pt] (0,-5) -- (0,14) node[above] {\scriptsize $y$}; \foreach \x in {-3,...,-1,1,2,3} \draw (\x, 3pt) -- (\x,-3pt) node[anchor=north] {\tiny \x}; \foreach \y in {-4,-2,2,4,6,8,10,12} \draw (3pt,\y) -- (-3pt,\y) node[anchor=east] {\tiny \y}; \draw[color=red, line width = 1pt, domain=-0.6:4, samples=100]     plot (\x,{(4*(\x)^2-3*(\x)-1)/((\x)^2-1)}); \draw[color=red, line width = 1pt, domain=-4:-1.3, samples=100]   plot (\x,{(4*(\x)^2-3*(\x)-1)/((\x)^2-1)}); \draw [red] (1,2.5) circle (4pt); \end{tikzpicture} \end{center} \item[•] $\displaystyle\lim\limits_{x\to 0} \ \frac{e^x-1}{4x}=\lim\limits_{x\to 0} \ \frac{e^x}{4}=0,25$\\[3mm] Die Regel von L'Hospital darf angewendet werden, weil der Ausdruck $\frac{0}{0}$ entsteht \begin{center} \begin{tikzpicture}[scale=0.6, >=latex,y=1.5cm,x=1.7cm] \draw[-angle 45,line width = 0.8pt] (-4,0) -- (4,0) node[right] {\scriptsize $x$}; \draw[-angle 45,line width = 0.8pt] (0,-1) -- (0,4) node[above] {\scriptsize $y$}; \foreach \x in {-3,...,-1,1,2,3} \draw (\x, 3pt) -- (\x,-3pt) node[anchor=north] {\tiny \x}; \foreach \y in {1,2,3} \draw (3pt,\y) -- (-3pt,\y) node[anchor=east] {\tiny \y}; \draw[color=red, line width = 1pt, domain=-4:-0.001, samples=100]     plot (\x,{(exp(\x)-1)/(4*(\x))}); \draw[color=red, line width = 1pt, domain=0.001:4, samples=100]     plot (\x,{(exp(\x)-1)/(4*(\x))}); \draw [red] (0,0.25) circle (4pt); \end{tikzpicture} \end{center} \end{itemize}  \end{document}


Is there a way to obtain the true IP address of someone masking their IP?

There is someone harassing me through emails and I need to know if there is a legal/legitimate way I can obtain their true IP address. They started masking their IP address after I used the email header to find out who it was initially. But now I'm at a loss. Any advice or suggestions or help would be tremendously appreciated. Thank you for your time.


TDD. I have quite complex coding exercise, do I test private methods if they are very complex?  So my class only exposes one public method, but contains few very complex methods, which should be tested I think?  there is doubt: do I test them or not?


I want to run a command "chmod -R 777 foldername" every time when apache restarts on my linux server.  How can I do that?  I have Linux CentOs 7.1 64 bit installed on my server with VestaCp.


How to add dependency on a Windows Service AFTER the service is installed

I have a Windows Service that makes use of a SQL Server database.  I don't have control over the installation of the service, but would like to add a dependency on the service to ensure that it starts after SQL server has started.  (SQL server is running on the same machine as the service in question)  Is there a tool to add a dependency or possibly editing the registry directly?


How to use RepairCost tag within testing commands

I had answered  and ran into a problem tagging a dropped item.    The command I gave will tag a leather chestplate with a protection level 1 enchantment.  Here is the command:  /scoreboard players tag @e[type=Item] add example {Item:{id:"minecraft:leather_chestplate",tag:{ench:[{id:0,lvl:1}]}},OnGround:1b}   This works properly if the item is obtained using the command:  /give @p minecraft:leather_chestplate 1 0 {ench:[{id:0,lvl:1}]}   The problem is that if the chest plate is enchanted with a book at the anvil, it gives the item another tag of  so the item has increased repair costs.  I attempted to add RepairCost:1 to the command inside the tag brackets:  /scoreboard players tag @e[type=Item] add example {Item:{id:"minecraft:leather_chestplate",tag:{RepairCost:1,ench:[{id:0,lvl:1}]}},OnGround:1b}   Over at , I found:     when you are testing for/giving a score depending on its tag you often need to specify that data type   I have never seen integers specified so I tried RepairCost:1i.  This did not work either.  Then over at  I found:     "auto:1b" is read as a Byte tag, while "auto:1" is read as an Integer tag.   byte:1b OR byte:true OR byte:false   short:1s   integer:1   long:1l   float:1f OR float:1.0f   double:1.0 OR double:1.0d   compound:{}   list:["data","data"]   intArray:[1,1,1]   string:"text"   It seems, integer is the default if unspecified.    I even took a look at the item in my inventory using :   I ended up building a testfor command where I just guessed at different variations and different positions within the command:  testfor @p {SelectedItem:{id:"minecraft:leather_chestplate",tag:{ench:[{id:0,lvl:1}],RepairCost:1}}}   Nothing I have tried has worked.  Is there some way to include RepairCost in detection commands like this?


I downloaded my old Blender project from Google Drive which I made in Blender 2.81. Even though I put all procedural textures, everything is pink. The textures are somehow missing. This is how it looks.


How to have both uppercase and lowercase in this Python function?

I tried to do upper() and lower() and even changing the Y and N's to lowercase inside the code. It works if I put in uppercase Y and N but I keep getting errors if I type in lowercase y or n. Anyone know a solution?  def patternSum(myDice):     if allSame(myDice):        patternPoints=input("\nWould you like to score the pattern points for all different values (25 points)? [Y/N]: ")        patternPoints.lower()        if patternPoints == "Y":           points = 25           sumDice=input("Would you like to score the sum of the dice (16 points)? [Y/N]: ")           if sumDice == "Y":              points = 25 + 16           if sumDice == "Y":              points = 16        elif patternPoints == "N":           sumDice=input("Would you like to score the sum of the dice (16 points)? [Y/N]: ")           points = 16        else:           print("Please try again by entering Y or N.")     else:         points = sum(myDice)         print( "Your score is now:",patternSum([1,1,1,1,1]),".\n" )      return points score = score + patternSum(myDice)


I would like to know if I have a certain table, let's say table X which contains salary and names, how would I display the maximum salary along with corresponding names? Thank you.


How can I prove by full induction that $n^{2(p+1)}-1$ is divisible by $n+1$?


Suppose I have what I think is a great idea for a new Settlers expansion. (Like 5,000 other people, no doubt!) What would be the most effective way to realize this possibility? Write to the makers and outline the idea? Pitch it like a novel manuscript? Or do such things not get publicly sourced? If I want to play it, is my best bet just to make my own set for use by friends and family? This question doesn't have to be about Settlers; it can be read as being about any game in the market. There are so many editions & flavours of all the most popular games, and I guess the core question is: Are they all generated internally or could a community member propose one?


How to set the citation counter for Bibtex?

I need the citation labels to start at some number larger than 1. I use Bibtex and cite with \cite{}. There has been an answer on this for natbib , which does however not work for Bibtex. This  is really helpful, but does not mention the citation counter. This is a minimal example, where I want the number of the first reference to be e.g. 5 instead of 1: \documentclass{article}  \usepackage{filecontents} \begin{filecontents}{mybib.bib} @misc{A01, author={Author, A.}, year={2001}, title={Alpha}} @misc{B02, author={Buthor, B.}, year={2002}, title={Bravo}} \end{filecontents}  \begin{document}  Some text \cite{A01,B02}.  \bibliographystyle{abbrv} \bibliography{mybib}  \end{document}  Thank you very much!


Why is our new clan member ineligible for war?

A member just joined our clan, but is ineligible for war.  She was not previously in a war, and her profile doesn't have the ineligible symbol and time like it would for others, but it still says she can't opt in for war.   Is this a bug or is there an explanation?


Fourier transform of modified Bessel function of the second kind

Does anyone have any suggestions for performing the following Fourier transform:   I = $\int_{-\infty}^{\infty} K_0(a \sqrt{x^2+1}) e^{i kx} dx $   where $K_0$ is the modified Bessel function of the second kind.


Can we get a paste feature added to image uploads in chat?

We've already got it for questions and answers. Let's get it for chat too! Most of my images come from screen captures so this would be really great!


Replacing background image using jQuery not working

I have created a parent div. Inside that div there are multiple child divs: the first one is holding a background image, the second one, the website name, and the third one, some text.  Using jQuery, when a user hovers on the second div, i.e. website name div, the third div i.e text div is visible.  Now what I want is, when the text div becomes visible, to also replace the image in the first div. Here is my HTML and jQuery code so far:  HTML:

{Div holding the image as a background}

                                      Website Name

text Div

            JS:    $(".contentBlock3").mouseenter(function () {         $('.contentText3').fadeIn(1500);         $('.contentImg').css("background-image", "images/gurus_bw.jpg)");         $('.contentImg').css("background-position", "top 30px)");     });   The CSS line is not working... What am I doing wrong ?


Does the lagrangian contain all the information about the representations of the fields in QFT?

Given the Lagrangian density of a theory, are the representations on which the various fields transform uniquely determined? For example, given the  for a  $$ \mathscr{L} = \frac{1}{2} \partial_\mu \varphi \partial^\mu \varphi - \frac{1}{2} m^2 \varphi^2 \tag{1}$$ with $(+,-,-,-)$ Minkowski sign convention, is $\varphi$ somehow constrained to be a scalar, by the sole fact that it appears in this particular form in the Lagrangian? As another example: consider the Lagrangian $$ \mathscr{L}_{1} = -\frac{1}{2} \partial_\nu A_\mu \partial^\nu A^\mu + \frac{1}{2} m^2 A_\mu A^\mu,\tag{2}$$ which can also be cast in the form $$ \mathscr{L}_{1} = \left( \frac{1}{2} \partial_\mu A^i \partial^\mu A^i - \frac{1}{2} m^2 A^i A^i \right) - \left( \frac{1}{2} \partial_\mu A^0 \partial^\mu A^0 - \frac{1}{2} m^2 A^0 A^0 \right). \tag{3}$$ I've heard$^{[1]}$ that this is the Lagrangian for four massive scalar fields and not that for a massive spin-1 field. Why is that? I understand that it produces a  equation for each component of the field: $$ ( \square + m^2 ) A^\mu = 0, \tag{4}$$ but why does this prevent me from considering $A^\mu$ a spin-1 massive field?  [1]: From Matthew D. Schwartz's , p.114:  A natural guess for the Lagrangian for a massive spin-1 field is $$ \mathcal{L} = - \frac{1}{2} \partial_\nu A_\mu \partial_\nu A_\mu + \frac{1}{2} m^2 A_\mu^2,$$ where $A_\mu^2 = A_\mu A^\mu$. Then the equations of motion are $$ ( \square + m^2) A_\mu = 0,$$ which has four propagating modes. In fact, this Lagrangian is not the Lagrangian for a amassive spin-1 field, but the Lagrangian for four massive scalar fields, $A_0, A_1, A_2$ and $A_3$. That is, we have reduced $4 = 1 \oplus 1 \oplus 1 \oplus 1$, which is not what we wanted.


How to find a random axis or unit vector in 3D?

I would like to generate a random axis or unit vector in 3D. In 2D it would be easy, I could just pick an angle between 0 and 2*Pi and use the unit vector pointing in that direction.   But in 3D I don't know how can I pick a random point on a surface of a sphere.  If I pick two angles the distribution won't be uniform on the surface of the sphere. There would be more points at the poles and less points at the equator.  If I pick a random point in the (-1,-1,-1):(1,1,1) cube and normalise it, then there would be more chance that a point gets choosen along the diagonals than from the center of the sides. So thats not good either.  But then what's the good solution?


They are both Galois fields of order 8. I'm not exactly sure what the question means - how does one determine/describe an isomorphism?


Volts for power supply, and ohms and watts for the resistor

I'm very new on this for this has never been taught in my school.  I have ten 5mm blue LEDs. Each led has 3.4V and 30mA max current. The only thing I know is that I have 34V for my LEDs. The power supply I would be using has 14V (a 5V usb cable plus a 9V battery).  So, my question is: how many volts should I really have as a power supply and how many ohms as well as watts should the resistor have? (I currently have 220ohms 1/4 watt for the resistors)  P.S. these will all be attached to a breadboard.  This will be made into a game. 10 LEDs 20 switches. It's called the nim number game. so the mechanics of the game is each player can turn on a maximum of 2 LEDs per turn. However, the last player to turn on the remaining LED that's not turned on wins. The project is done, honestly. We've attached the wires, Leds, switches, and ICs.  However, the initial power supply for the project is a 9V battery. But when the 6th LED is turned-on, the light it emits is very low already. Then, emission of light of all 10 Led lights becomes very low if all leds are turned on. So I added a 5V usb cable but I got the feeling that the resistors aren't compatible with the power supply anymore.  Thanks in advance for answering!


I have 5 properties and I thought that visualizing them along the axis of a pentagon would be nice. The properties can take an integer value between 0-5. Together that span a surface within the pentagon.  This is what I'd would like the image to look like [took me forever to make the markers in inkscape :-)] :    This is what I have so far:  \documentclass{standalone} \usepackage{tikz} \usetikzlibrary{shapes.geometric}  \begin{document}  \begin{tikzpicture} \newdimen\R \R=4cm \node[draw=black, minimum size=\R,regular polygon,regular polygon sides=5] (a) {}; \draw (a.center) -- (a.north)    node[above] {Property1}; \draw (a.center) -- (a.corner 5) node[right] {Property2}; \draw (a.center) -- (a.corner 4) node[right] {Property3}; \draw (a.center) -- (a.corner 3) node[left]  {Property4}; \draw (a.center) -- (a.corner 2) node[left]  {Property5};  \draw [thin,black!20] circle (\R) ; \fill[red] circle (2pt);  % Trial/error for this example %                              P1        P2           P3              P4             P5 \draw[fill=cyan, opacity=0.8] (0,1.5) -- (0.9,0.3) -- (0.55, -0.8) -- (-0.6,-0.8) -- (-1.4,0.45) -- cycle;  \end{tikzpicture}  \end{document}   Resulting in this:    I'm lost at drawing the markers on the vertexes and having them equally spaces and equally lost when it comes to filling the polygon given by the 5 integer-values  Since I have quite a few of these to draw, making the above into a macro would be really nice :-)


This should be simple, but why can't I upgrade to v21? a@sj:~$ lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 20.10 Release:    20.10 Codename:   groovy  a@sj:~$ sudo apt update Hit:1 http://us.archive.ubuntu.com/ubuntu groovy InRelease Hit:2 http://security.ubuntu.com/ubuntu groovy-security InRelease Hit:3 http://us.archive.ubuntu.com/ubuntu groovy-updates InRelease Hit:4 http://us.archive.ubuntu.com/ubuntu groovy-backports InRelease Reading package lists... Done Building dependency tree        Reading state information... Done All packages are up to date.  a@sj:~$ sudo apt upgrade Reading package lists... Done Building dependency tree        Reading state information... Done Calculating upgrade... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.  a@sj:~$ sudo apt dist-upgrade Reading package lists... Done Building dependency tree        Reading state information... Done Calculating upgrade... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.  I suppose that 21.04 LTS has not been released, but I set "any version" in the Update Manager and it is not giving me the option: $ sudo do-release-upgrade Checking for a new Ubuntu release No new release found.  $ tail -n 1 /etc/update-manager/release-upgrades Prompt=normal


For a sentence such as "physics’ greatest...",  would you use physics’s or physics’ ?  Microsoft Word highlights physics's as incorrect; however, I have seen it be used.


shell/bash script to delete files from FTP directory older than 30 days

I need shell script to delete all files older than 30 days from FTP server directories. I need to delete files from 5 different directories which are older than 30 days, should not delete the directories because they might have other files, have to delete only files older than 30 days. This is the first time I am working on shell script. tried following link no luck. can anyone help me on this.    below is the code I am using in my .sh file but I am facing invalid command error  ftp -inv $HOST <<EOS user $ftp_user $ftp_pass find /path/somefolder/ -type f -iname '*' -mtime +30 -exec rm {} \; quit EOS   Need to check if file is older than 30 days if it is older delete it from the directory.


What is a word to describe inefficient communication?

Example 1 - When reviewing résumés I don't want someone to use 1.5 pages to describe one job.   Example 2 - When a person uses excessive description to answer a simple question.


Ubuntu 18.04 audio disappeared after update

I've been using Ubuntu 18.04 on my Thinkpad X1 Carbon 7th gen for some time now with the audio working just fine, but after running some updates yesterday it seems like the audio card has stopped working when I rebooted this morning, could this be related to each other?  dmsg output:  [   32.624585] skl_hda_dsp_generic skl_hda_dsp_generic: Unsupported HDAudio/iDisp configuration found [   32.624590] skl_hda_dsp_generic: probe of skl_hda_dsp_generic failed with error -22   output from /var/log/apt/history.log:  Start-Date: 2020-03-17  09:30:06 Commandline: aptdaemon role='role-commit-packages' sender=':1.214' Install: linux-image-5.3.0-42-generic:amd64 (5.3.0-42.34~18.04.1, automatic), linux-headers-5.3.0-42-generic:amd64 (5.3.0-42.34~18.04.1, automatic), linux-modules-extra-5.3.0-42-generic:amd64 (5.3.0-42.34~18.04.1, automatic), linux-headers-5.3.0-42:amd64 (5.3.0-42.34~18.04.1, automatic), linux-modules-5.3.0-42-generic:amd64 (5.3.0-42.34~18.04.1, automatic) Upgrade: gir1.2-nm-1.0:amd64 (1.10.6-2ubuntu1.2, 1.10.6-2ubuntu1.4), linux-libc-dev:amd64 (4.15.0-88.88, 4.15.0-91.92), linux-headers-generic-hwe-18.04:amd64 (5.3.0.40.97, 5.3.0.42.99), libnm0:amd64 (1.10.6-2ubuntu1.2, 1.10.6-2ubuntu1.4), network-manager:amd64 (1.10.6-2ubuntu1.2, 1.10.6-2ubuntu1.4), linux-image-generic-hwe-18.04:amd64 (5.3.0.40.97, 5.3.0.42.99), linux-signed-generic-hwe-18.04:amd64 (5.3.0.40.97, 5.3.0.42.99), linux-generic-hwe-18.04:amd64 (5.3.0.40.97, 5.3.0.42.99), network-manager-config-connectivity-ubuntu:amd64 (1.10.6-2ubuntu1.2, 1.10.6-2ubuntu1.4), code:amd64 (1.42.1-1581432938, 1.43.0-1583783132), linux-firmware:amd64 (1.173.15, 1.173.16), docker-ce:amd64 (5:19.03.7~3-0~ubuntu-bionic, 5:19.03.8~3-0~ubuntu-bionic), docker-ce-cli:amd64 (5:19.03.7~3-0~ubuntu-bionic, 5:19.03.8~3-0~ubuntu-bionic) End-Date: 2020-03-17  09:31:51  Start-Date: 2020-03-18  06:58:27 Commandline: /usr/bin/unattended-upgrade Remove: linux-headers-5.3.0-28:amd64 (5.3.0-28.30~18.04.1), linux-headers-5.3.0-28-generic:amd64 (5.3.0-28.30~18.04.1) End-Date: 2020-03-18  06:58:27  Start-Date: 2020-03-18  06:58:30 Commandline: /usr/bin/unattended-upgrade Remove: linux-modules-extra-5.3.0-28-generic:amd64 (5.3.0-28.30~18.04.1) End-Date: 2020-03-18  06:58:31  Start-Date: 2020-03-18  06:58:36 Commandline: /usr/bin/unattended-upgrade Remove: linux-modules-5.3.0-28-generic:amd64 (5.3.0-28.30~18.04.1), linux-image-5.3.0-28-generic:amd64 (5.3.0-28.30~18.04.1) End-Date: 2020-03-18  06:58:40  Start-Date: 2020-03-18  06:58:48 Commandline: /usr/bin/unattended-upgrade Upgrade: libcephfs2:amd64 (12.2.12-0ubuntu0.18.04.4, 12.2.12-0ubuntu0.18.04.5) End-Date: 2020-03-18  06:58:49  Start-Date: 2020-03-18  06:58:53 Commandline: /usr/bin/unattended-upgrade Upgrade: libicu60:amd64 (60.2-3ubuntu3, 60.2-3ubuntu3.1) End-Date: 2020-03-18  06:58:55  Start-Date: 2020-03-18  06:59:01 Commandline: /usr/bin/unattended-upgrade Upgrade: librados2:amd64 (12.2.12-0ubuntu0.18.04.4, 12.2.12-0ubuntu0.18.04.5) End-Date: 2020-03-18  06:59:02  Start-Date: 2020-03-18  06:59:08 Commandline: /usr/bin/unattended-upgrade Upgrade: python3-apport:amd64 (2.20.9-0ubuntu7.11, 2.20.9-0ubuntu7.12) End-Date: 2020-03-18  06:59:09  Start-Date: 2020-03-18  06:59:14 Commandline: /usr/bin/unattended-upgrade Upgrade: python3-problem-report:amd64 (2.20.9-0ubuntu7.11, 2.20.9-0ubuntu7.12) End-Date: 2020-03-18  06:59:15  Start-Date: 2020-03-18  06:59:18 Commandline: /usr/bin/unattended-upgrade Upgrade: apport:amd64 (2.20.9-0ubuntu7.11, 2.20.9-0ubuntu7.12) End-Date: 2020-03-18  06:59:21  Start-Date: 2020-03-18  06:59:24 Commandline: /usr/bin/unattended-upgrade Upgrade: apport-gtk:amd64 (2.20.9-0ubuntu7.11, 2.20.9-0ubuntu7.12) End-Date: 2020-03-18  06:59:25


in eclipse java there are operators that help suppress warning in code.  is such suppression in delphi?  and   warning off  warning on  is two commands.


What is the viewing order of the re-imagined Battlestar Galactica?

I have watched a few random episodes of BSG here and there and really enjoyed it, but now I want to do it right. I want to go back to the start, and watch it all the way through.  I understand there is the main series, but have also heard of a mini-series, and movies etc. It makes me quite confused, and I have no idea of where to start and in what order I should watch. Can someone please clear this up for me, and give me a list of the entire viewing order?


Winter Bash 2020 has started and the hats (and masks) are listed below. As always, there are only two answers: one for the secret hats, and one for the regular hats. The secret hat list will be updated as we learn them. Please, only edit the secret hat answer with definitive and correct triggers. This is not the place to post guesses. Winter Bash is a fun event, so secret hat triggers should be put behind spoilers (use the >! markup) in order to not to spoil the fun for those users who want to discover the triggers themselves. If you'd like to discuss Winter Bash, hats or just have a question about it please come over to the . Please keep the comments here clean. As always, comments are not meant for discussion, conversation, "I just got hat X", etc. use the  for that (comments may be cleaned up without further notice). Here are the hats from previous years:


Dumping request parameters to database - safe?

I'm currently saving request parameters of API calls into a MySQL table for logging purposes.  I'm using the following.   $log->info('Request', var_export($request->get_params(), true))   Also, one of the parameters is a JSON string.  Should I escape each parameter individually for security purposes before writing to the database?  Thanks,


Unusual word order in "Fear not this night"?

Yesterday, I've listened to a song called "Fear not this night". I find the syntax unusual (as a foreigner, I have never encountered it). Is it the same meaning as "Don't fear this night" ? What's the slight difference between these 2 ?  Thank you for your time.


Search query displays results it should not?

There is the following search query that I use:   [*worklight*] is:question answers:0 duplicate:no closed:no   I don't know if it is just for me, or for more people (ahm, please use it...) but in the results I also see questions that have already been answered, whereas the search specifically should not search for those.  For example, this result shows up:  But it already has an answer...  Is there some indexing problem right now in Stack Overflow / Stack Exchange?


Stack Overflow design broken in Firefox Mobile

Is there an issue when Stack Overflow is used with Firefox on Mobile devices? A few weeks ago the design suddenly changed, now it looks pretty much like the desktop version, see screenshot. The nice and useful mobile theme disappeared. Of course, in my Firefox settings I did not set "Show desktop version" - anyway there is almost no difference. With the Chrome browser it looks much better (like it was looking in Firefox earlier times), see the second screenshot. Firefox Screenshot:  Chrome Screenshot:


Using ALTER to drop a column if it exists in MySQL

How can ALTER be used to drop a column in a MySQL table if that column exists?   I know I can use ALTER TABLE my_table DROP COLUMN my_column, but that will throw an error if my_column does not exist. Is there alternative syntax for dropping the column conditionally?  I'm using MySQL version 4.0.18.


I've set a global variable in functions.php like so:  $cat_args = array('cat1', 'cat2', 'cat3');   and tried to use it in a template file:  global $cat_args; if is_cat($args): //do stuff endif;   The conditional returned false. If I echo $cat_args I get an array. Is there an extra step to passing it to the conditional / is what I'm trying to do possible? Thanks!


Make Blender usable on high resolution screen

The Blender UI elements are incredibly small by default on high resolution screens on Windows (15" UHD screen).  I found the Preferences -> System -> DPI setting which can be set up to 144.  This makes Blender usable, but still uncomfortable and difficult on the eyes.  Is there a way to make the UI elements even larger?


Can I restore a single app backup without impacting other apps?

This may be a stupid question in the sense that it is obvious to everyone who has done it once - but I haven't.  So, I know that adb backup -f myAndroidBackup.ab com.corp.app can back up a single app's data without root. Will restoring this backup with adb touch only com.corp.app, or will it wipe other apps first?


I am trying to install  on the ubuntu server 16.04 LTS.   for that I have created file /etc/apt/sources.list.d/mongodb-org-3.2.list and added a line as per the doc.  echo "deb http://repo.mongodb.org/apt/ubuntu xenial/mongodb-org/3.2 multiverse" | sudo tee /etc/apt/sources.list.d/mongodb-org-3.2.list   Now when I try to download the package list using sudo apt-get update it is giving me below error.  nodev@ubuntu:/etc/apt/sources.list.d$ sudo apt-get update E: Type 'echo' is not known on line 1 in source list /etc/apt/sources.list.d/mongodb-org-3.2.list E: The list of sources could not be read.


Any polynomial has a finite number of solutions – well, any? --- The non-commutative case

First, some teasers; then, at the end of 2), the question.  The above statement holds for polynomials which are normalised (the leading coefficient is one, or a unit) and defined in rings $R[X]$ where $R$ a commutative ring.  1) If your polynomial is not normalised then there can be an infinity of solutions, of course. Take, for instance, $P_\phi=\phi X$ over the ring $R=\mathbb F_2^E$ of functions on some infinite set $E$ into the ring $\mathbb F_2 = \mathbb Z/2\mathbb Z$ and let $\phi \in R$ be such that $\phi^{-1}(\{1\})$ is finite.  Note however, that even for those $\phi$ for which $P_\phi$ has only finitely many solutions, it can be more than $1 = \deg P_\phi$, even arbitrarily many, if $\phi$ is chosen in an appropriate way.  2) If $R$ is not commutative, $R[X]$ can still be naturally endowed with the structure of a ring. However, evaluation is not necessarily a homomorphism anymore. In this case, are there normalised polynomials with an infinity of solutions? Matrix rings, perhaps? I am looking for a simple and intuitive example. Someone here who knows one?  So long, K.


Did the Enterprise have public/common restrooms?

The question is pretty straight forward. I can't imagine everybody goes back to their quarters to take a leak every time.


I want to use a byte array as a lookup key in a concurentDictionary. Currently I solve this by using a custom EqualityComparer<byte[]>.  This works fine, but I do realize that my hashcode generator will generate a lot of overlaps where things end up in the same hash bucket.  public class ByteArrayEqualityComparer : EqualityComparer<byte[]> {     public override bool Equals(byte[] x, byte[] y)     {         //fast buffer compare         return UnsafeCompare(x, y);     }      public override int GetHashCode(byte[] obj)     {         int hash = 0;         for (int i = 0; i < obj.Length; i += 2)         {             hash += obj[i]; //xor? shift? black magic?         }         return hash;     } }   What would be a good formula to create a relatively fast hash from the byte array?  My idea is that I can calculate the hashcode by skipping every x bytes for speed. As the final comparison is still done over the full data set, it seems pointless to compare all bytes multiple times.  I imagine that some xor magic and shifting on the hash var would make things better.  This is extremely performance critical, so any shortcut that can be used is welcome too.  [edit] I ended up using this solution. I use a struct to wrap the byte array so that I can use a cached hashcode for it instead of calculating it for each comparison. This resulted in a very nice performance gain.  public struct ByteArrayKey {     public readonly byte[] Bytes;     private readonly int _hashCode;      public override bool Equals(object obj)     {         var other = (ByteArrayKey) obj;         return Compare(Bytes, other.Bytes);     }      public override int GetHashCode()     {         return _hashCode;     }      private static int GetHashCode([NotNull] byte[] bytes)     {         unchecked         {             var hash = 17;             for (var i = 0; i < bytes.Length; i++)             {                 hash = hash*23 + bytes[i];             }             return hash;         }     }      public ByteArrayKey(byte[] bytes)     {         Bytes = bytes;         _hashCode = GetHashCode(bytes);     }      public static ByteArrayKey Create(byte[] bytes)     {         return new ByteArrayKey(bytes);     }      public static unsafe bool Compare(byte[] a1, byte[] a2)     {         if (a1 == null || a2 == null || a1.Length != a2.Length)             return false;         fixed (byte* p1 = a1, p2 = a2)         {             byte* x1 = p1, x2 = p2;             var l = a1.Length;             for (var i = 0; i < l/8; i++, x1 += 8, x2 += 8)                 if (*(long*) x1 != *(long*) x2) return false;             if ((l & 4) != 0)             {                 if (*(int*) x1 != *(int*) x2) return false;                 x1 += 4;                 x2 += 4;             }             if ((l & 2) != 0)             {                 if (*(short*) x1 != *(short*) x2) return false;                 x1 += 2;                 x2 += 2;             }             if ((l & 1) != 0) if (*x1 != *x2) return false;             return true;         }     } }


Problem: Let $f : G → H$ be an isomorphism. Prove that if $a \in G$   has infinite order, then so does $f(a)$, and if $a$ has finite order   $n$, then so does $f(a)$. Conclude that if $G$ has an element of some   order $n$ and $H$ does not, then $G \not\cong H$.   My proof: If $a$ has finite order $n$, then $a^n=e \Rightarrow f(a^n) = f(a)^n = e$. So, $f(a)$ has order $n$.  How can I prove $a$ had infinite order $\Rightarrow$ $f(a)$ has infinite order?


I'm struggling to understand what the purpose of the empty slicing operator is in python string_example = 'foo blah blah' string_without_operator = string_example string_with_operator = string_example[:]  print(string_without_operator) print(string_with_operator)  In this example the results seem to be identical - are they functionally equivalent or am I missing something and this operator useful in a different application?


New profiles have a description I don't want

Whenever I create a new account on another stackexchange network I find that it takes the description of my AskUbuntu account.  How do I choose what description to be taken to new accounts?


I have noticed that the treasure goblins have different colors. Some are red, blue, yellow, black and so on. Do the colors mean anything? Does it mean they have different loot? Sometimes treasure goblins tend to drop gems, other times books/pages. Can this have anything to do with the color of the goblin? Are they harder to beat or what does it mean?


sending email with smtp client is failed c# asp.net

protected void Button1_Click(object sender, EventArgs e)         {             try             {                 MailMessage message = new MailMessage(EmailTo.Text, Emailfrom.Text, EmailSubject.Text, EmailBody.Text);                 SmtpClient client = new SmtpClient("smtp.gmail.com",587);                 client.EnableSsl = true;                 client.Credentials = new System.Net.NetworkCredential("imranrizvi1992@gmail.com", "sihhhhjj");                 client.Send(message);             }             catch (Exception ex)             {                 Label1.Text = ex.StackTrace;             }          }   I am sending the email via asp.net smtp but it throws some error which i dont know how to resolve this :  at System.Net.Mail.MailCommand.CheckResponse(SmtpStatusCode statusCode, String response) at System.Net.Mail.MailCommand.Send(SmtpConnection conn, Byte[] command, MailAddress from, Boolean allowUnicode) at System.Net.Mail.SmtpTransport.SendMail(MailAddress sender, MailAddressCollection recipients, String deliveryNotify, Boolean allowUnicode, SmtpFailedRecipientException& exception) at System.Net.Mail.SmtpClient.Send(MailMessage message) at ProjectManagmentSystem.WebForm1.Button1_Click(Object sender, EventArgs e) in E:\ProjectManagmentSystem\ProjectManagmentSystem\Project.aspx.cs:line 73


Continuous positive function such that $\int\limits_1^{\infty}f(x)dx$ converges, while $\int\limits_1^{\infty}f^2(x)dx$ diverges

Does there exist a continuous positive function such that $\int\limits_1^{\infty}f(x)dx$ converges, while $\int\limits_1^{\infty}f^2(x)dx$ diverges? I have proved that if $f$ is decreasing monotonically, then this is false and $\int\limits_1^{\infty}f^2(x)dx$, but what happens when the demand for monotonic drops?


Since Mark Shuttleworth decided to  to  in the future, I was wondering if I can install it on my Ubuntu now?


How to edit the Boot Graphics Resource Table / Edit windows 8 BOOT LOGO?

I want to edit the screen which is displayed when windows 8 (starts) loads (/loading).   As for now it has the Toshiba logo, I want my custom logo or the windows default logo.  I have found that UEFI has something called "Boot Graphics Resource Table" and that it overides the default logo if there is a image present ()  How can I edit the logo stored in UEFI firmware or Boot Graphics Resource Table?  if it's in the "bootres.dll", which does UEFI use? My disk (spread across a few system/usefi/windows/etc partitions) has around twenty bootres.dlls.  The bootres.dll is signed by Microsoft, but I don't have to worry because I can sign the file I edit myself with my own certificate.


Derivation of Joint Moment Generating Function for Multivariate Normal

I'm attempting to derive the joint moment generating function for a multivariate normal, which takes the form below: $$M_{\mathbf{X}}(\mathbf{t})=E\left[e^{\Sigma_{j-1}^{n} t_{j} X_{j}}\right]=E\left[e^{\mathbf{t}^{T} \mathbf{X}}\right]=\int_{-\infty}^{\infty} \dots \int_{-\infty}^{\infty} \frac{1}{(2 \pi)^{n / 2}|\mathbf{V}|^{1 / 2}} e^{-\frac{1}{2}\left((\mathbf{x}-\mathbf{m})^{T} \mathbf{V}^{-1}(\mathbf{x}-\mathbf{m})-2 \mathbf{t}^{T} \mathbf{x}\right)} d x_{1} \ldots d x_{n}$$ Don't even know where to get started with this one! Are there other formulations to derive it ? Does anyone have an example, even if it's just for the bivariate case. I'd like to be able to show the general derivation, but could also settle in the meantime for the bivariate.


Where can I most efficiently buy all items for the "Shut up and take my money" achievement?

The "Shut up and take my money" Achievement requires that you buy one of each item from merchants.  There are a lot of items on the list that my class doesn't use, and I am unfamiliar with.  Is there one vendor, or a short list of vendors I can go to in order to buy one of each of these items types?  Also, since I plan on just selling many of them right back since they are of no use to me - generally, where can I buy each item the cheapest?


How can I add a newline in the text of a label in WPF such as the following?  <Label>Lorem    ipsum</Label>


How to remove Dynamically created Element with JQuery?

I make a div with dynamic elements using JQuery. I can create div elements BUT I can't remove this! How can i solve this problem.

         Color         <input type="text" name="color" class="form-control">

         Quantity         <input type="text" name="qty" class="form-control">

          Ex-Factory Date         <input id="exfact" type="text" class="form-control" name="exfactdate" placeholder="">

   My JQuery Part.    $(document).ready(function(){  var bulknitdown=$('#bulk').html(); $('.add').click(function(){          $('#bulk').append(bulknitdown);  }); $('.remove').click(function(){     bulknitdown.last().remove(); }); });


Unable to log in to Pokemon GO through mobile data but WiFi works

So I have this annoying problem where I can't connect to the Pokemon GO app through mobile data. It will get stuck at around 20% and I can see that my phone will have no data exchange whatsoever. When I use WiFi however, I can connect perfectly fine, turn off WiFi and then play the game. I have the assumption that it has to do with my google account, through which I log on with. I have read multiple answers to this problem and none worked:   restarting app, phone resetting app preferences uninstalling/reinstalling app setting google account settings to allow unsecure apps to use the google login manually turning on and of various google applications from usage of mobile data   All this did not help a bit.   But I noticed something strange: when Ii connect through WiFi, I will have a window of about 10 minutes where I can connect through mobile data with WiFi disabled. However after these 10 minutes I will have to log in with WiFi turned on again. This leads me to assume that some kind of authentication process is done, that works through WiFi but not through mobile data and also has a small time window where it seems to be temporarily saved on the phone. I would really appreciate anyone's input in what might help, or what the problem could be.


Is there a way to block (by a password/PIN code or what else) all kinds of software installation on an Android tablet/smart phone?  I understand it is possible to block by a PIN code Market app instalation, but that only works for paid apps, and there are other ways to install applications other than the Market.  Rooting is not a problem.  Thank you!


For my project, I'm trying to work with the principle of electrovibration. This principle is about simulating textures using low current electricity on an insulated conductive surface ().  In order to do this, I will be experimenting with generated AC signals of 80 to 160 Vpp at 60Hz to 400Hz. I will do this by using an DC - AC converter, usually used for EL lamp applications.  My only concern is how to limit the current coming from the converter. Are the techniques for limiting AC current the same as DC, by using a simple resistor? Or is it, as I expect, more complex?  I need to limit the current to 0.5mA, for safety reasons.


Windows System (PID 4) spurious disk writes

I'm running Windows 7 x64, and since yesterday, it's been constantly writing to the hard disk from PID 4, to no purpose. I've tried disabling updates and antivirus, but this makes no difference. Apparently cache prefetching can generate spurious disk traffic, but presumably that would be just reads, and this is specifically and almost entirely writes.  What else could be causing it? Is there a way to find out what's generating the write traffic?  Edit: not a duplicate because:   This is specifically and only writing, not reading. The answers to the other question discuss Windows updating (which I have already tried disabling), sharing the C drive (which I'm not doing) and Autodesk software (which is not installed on this machine).


Are all Bell tests valid only for linearly-polarized photons?

In , it is argued that all photons are necessarily circularly polarized, and linearly-polarized photons must be a superposition of such circularly-polarized photons. Besides, it and suggests that Bell experiments may really be measuring correlations of photon pairs.  My question is, do all Bell tests assume linear polarization, and will the Bell's theorem be invalidated if all photons are really as described in the mentioned paper?


Make different-sized displays match edges

I have two displays running in my current setup: A 27" monitor (it's not 4k, but it's got a somewhat higher resolution than 1920x1080), and a 15" MacBook with the Retina display.   The minor inconvenience I'm running into is that the mouse sometimes gets stuck on the large monitor and won't cross the gap to the laptop display.  As far as I can tell, this is because the edges of the displays are not scaled/mapped to each other's edges. So if the mouse is in the top-right or bottom-right corners of the larger display it's can't cross to the laptop because no shared edge exists there:     I remember running into this issue on a Linux machine and being able to change the mapping/scaling of the display edges so that the mouse can always cross that gap.   So I'm wondering, on El Capitan or Sierra, is there a way to make both displays share a common edge? Either through a setting, config, or even a third-party app?


Is there any standard way of initializing the LIVE AGENT chat from withing Lightning Components in Community Builder. I have a prechat from within Community builder which is to be used to initialize the chat.  The chat window at user's end open up with below URL, which also cannot be reused due to variation in the session ID everytime    Appreciate the help!


What contributes to expanded company details being displayed in Google search results?

For some results returned in Google Search, on the right side it displays the company details, logo, contact numbers, etc...   For example, see the following screenshot:    I'd like to know what contributes to this so that I can try to achieve it for my site too.


I am trying to create a basic banking system to practice using classes, after creating the parent class "Account", I tried to create a "savings" class which will be the child class and inherit the attributes and methods, however, no matter what I look up nothing will tell me how to do this. I get errors such as "must declare a body because it is not marked abstract, extern or partial", and so on. I really don't know what to do to get it working, so I'm hoping someone here can help, here's my code:  public class Account {     protected string name;     protected string birthdate;     protected string address;     protected double balance;     protected string status;     protected string type;      public Account(string customerName, string customerBirthdate, string customerAddress, int customerBalance)     {         name = customerName;         birthdate = customerBirthdate;         address = customerAddress;         balance = customerBalance;         status = "Ok";         type = "Basic";              }      public void customerDetails()     {         Console.WriteLine("Name: {0}, Birthdate: {1}, Address: {2}", name, birthdate, address);     }      public void accountDetails()     {         Console.WriteLine("Balance: £{0}, Account Status: {1}, Account Type: {2}", Math.Round(balance, 2), status, type);     }      private void updateStatus()     {         if (balance < 0)         {             status = "Overdrawn";         }         else if (balance > 0 )         {             status = "Ok";         }     }      public void deposit(int amount)     {         balance += amount;         updateStatus();     }      public void withdraw(int amount)     {         balance -= amount;         updateStatus();     } }  public class Savings : Account {     public Savings(string customerName, string customerBirthdate, string customerAddress, int customerBalance) : Account(customerName, customerBirthdate, customerAddress, customerBalance)     {         name = customerName;         birthdate = customerBirthdate;         address = customerAddress;         balance = customerBalance;         status = "Ok";         type = "Basic";     } }   Thanks in advance if anyone can help me out!


How to Activate and deactivate the RTL features in AI and PS CC 2014

how to get access to all Arabic / Hebrew language features in the last updated Adobe products 2014.1 specially Illustrator.


Single line command to cat last file in ls -lrt output?

System log files are serialized and I use ls -lrt to show me the most recent file. I then cat that file. This requires typing a long serial number each time.   How can I cat the last file appearing in my ls -lrt output in one command?  I'm using cygwin and the the output from ls -lrt foobar_job* look like this:  -  -rw-r--r-- 1 zundarz Domain Users   1133 Jul 31 16:54 foobar_job4855125.log -rw-r--r-- 1 zundarz Domain Users   1256 Jul 31 17:10 foobar_job4855127.log -rw-r--r-- 1 zundarz Domain Users   1389 Aug 11 10:20 foobar_job4887829.log -rw-r--r-- 1 zundarz Domain Users   1228 Aug 11 10:39 foobar_job4887834.log


My BCM 4311 Wireless is not working. How can I fix this?

Hi I've spent hours trying all the suggestions listed on Forums on this problem all over the Internet and I still can't get my wireless working. It's very discouraging because it might force me to go back to Windows which I hate. Can someone help?  Perhaps I can give you some information to help identify what the issue is? b43 isn't coming up in my list of drivers...just Broadcom STA which doesn't work.  I think I've removed all the blacklisted stuff.


does there exist example of this paticular type of function?

consider $f:[a,b]\to \mathbb{R}$ such that $f(x) \in \mathbb{Q}$ when $x \in \mathbb{R} \setminus \mathbb{Q} \cap [a,b]$ and $f(x) \in \mathbb{R} \setminus \mathbb{Q}$ when $x \in \mathbb{Q} \cap [a,b]$. Then does there exist continuous function of this type ? I need an example ..if not then why?


I was wondering what sort of tool works best for removing traces on a stripboard like the following:   .  Product page on .   Image from


Software needed for ATMEL ATMEGA8A-PU microcontroller in Ubuntu 18.04?

A few days ago I discovered a ATMEL ATMEGA8A-PU microcontroller and I wanted to write code on it . But I don't know what software to use in Ubuntu 18.04 for the microcontroller.  Can I use the Arduino IDE for writing code for it ?? How do I burn the code into the microcontroller ?? Do I need additional drivers for it ?? & If yes then what are those drivers ??  Please help me , I am a beginner for AVR microcontrollers.  Note :- I use Ubuntu 18.04 as OS & I am looking for the software suite for writing and burning code into my microcontroller.


Why is it that a real scalar field is charge neutral whereas a complex scalar field (or a spinor field like Dirac theory) describe charged fields?


I have a Toshiba Satellite c640 laptop with Ubuntu 14.04 and Windows 7 installed. It was working fine for more than two years and for the last month I didn't use it. Yesterday I tried to turn on my laptop, it got stuck on the following screen.    I am unable to select the loader using keyboard arrow keys and also Ubuntu is not loading by default (it was working fine earlier if I didn't choose loader, Ubuntu will be loaded after 8 seconds).  More details: I am getting a continuous beep sound for some time before the screen shown above appears.  EDIT: I cannot say ubuntu is crashed as the system is not loading any OS and is stuck in the OS selection.


So I have a cylinder (Or any curved shape) and I want to wrap the door to it. I can give the door more depth and move it close to the cylinder but the edges won't be equal from all sides, and I want them to be equal. So any idea how can I wrap it around the cylinder?


Why do these two 2d list methods return different results in memory?

I was having some trouble with 2d lists in Python due to a line of code I wrote: size_x = 8 size_y = 8 board = [[0]*size_y]*size_x  The output looked fine:  [[0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]]  However, after much confusion, I came to the conclusion that each row was identical, in that they shared the same memory address. Sure enough, a check with id(board[0]) == id(board[1]) == ... === id(board[n]) proved it. All is well now. I've changed my line to board = [[0]*size_y for row in range(size_x)]  and all rows are now unique. (I think it's a little ugly, would appreciate cleaner suggestions, if any.) I'm just curious, why does this happen, and where can I read up on why this happens? I spent what I would consider an inordinate amount of time debugging due to a hiccup like this. I love Python, and I want to... well, get better avoiding situations like this. Sorry if this is a duplicate of another post and I don't know it, and thank you for any help you can offer. Cheers!


Heat energy in special theory of relativity

Is heat energy invariant under Lorentz transformation? If so then how?


How to order rows in MySQL when using in

I am using this query to select rows in MySQL  SELECT * FROM `table` WHERE `id` IN (5,2,3,1,4);   Now by default the rows will be ordered by their id: 1, 2, 3, 4, 5  Is there any way that I can order rows as they are in the query, so the order should be: 5, 2, 3, 1, 4 ?