my case:  I try to get a value from my MySQL database. This data is defined as a VARCHAR. This is done in java with a prepared statement and resultset.  String add1 =rs.getString("include");   according to  website table 5.1 states "Can always be converted to these Java types".  therefore a VARCHAR should be able to be converted in a java.lang.string. When i check the data type in java it indeed gives java.lang.string. So for so good.  My issue is when i try to compare this obtained "String" value to a in java defined String value they don't seem to be equal.  Let's give a simple example. I get the (VARCHAR) value "1" from the database and store in in String add1  I want to check if this value is indeed "1" and therefore I use the following statement  if(add1=="1") {       /* do something */    }       Only the values are , according to java, not the same. So I was curious about why this is.  I started searching why those two "Strings" are not equal.  First of I checked the length of both strings. Both came out to be 1 in length as expected.  Afterwards I checked the value of both. To see if both values where indeed the same i wanted to check their hexadecimal representance. Both came out with the value 0x31. Still as expected.  But then why isn't my if statement accepted by java if both seem to represent the same string-hex-bin-you name it value.  In short: Why is my VARCHAR "String" obtained from a MySQL databse in java not the same as a String defined in java.

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


sorry, but i'm a little bit convused... The properties of the simpleXMLElement, created by the simplexml_load_string method, returns always an one-dimensional array with exactly one . It's no matter if i use one, more or no index - it's all the same result... the only exception is echo:  $xml = simplexml_load_string("<main><name>Alfred</name></main>"); echo $xml->name; //-> Alfred  print_r($xml2->name);  // -> SimpleXMLElement Object ( [0] => Alfred )  print_r($xml2->name[0]);  // -> SimpleXMLElement Object ( [0] => Alfred )  print_r($xml2->name[0][0]);  // -> SimpleXMLElement Object ( [0] => Alfred )  $arr['name'] = $xml2->name; echo(json_encode($arr)); //-> {"name":{"0":"Alfred"}}   And if i use the attribute notation, i get null:  $arr['name'] = $xml2['name']; echo(json_encode($arr)); //-> {"name":null}   But if i use any string method, i get a clear string:  $arr['name'] = $xml2->name.""; echo(json_encode($arr)); //-> {"name":"Alfred"}  $arr['name'] = strtolower($xml2->name); echo(json_encode($arr)); //-> {"name":"alfred"}   So, can me anybody explain this behavior? Should i just use strval() or what's the correct or most beautyfull way to get the property as string?

Let's say I have some XML like this  <channel>   <item>     <title>This is title 1</title>   </item> </channel>   The code below does what I want in that it outputs the title as a string  $xml = simplexml_load_string($xmlstring); echo $xml->channel->item->title;   Here's my problem.  The code below doesn't treat the title as a string in that context so I end up with a SimpleXML object in the array instead of a string.  $foo = array( $xml->channel->item->title );   I've been working around it like this  $foo = array( sprintf("%s",$xml->channel->item->title) );   but that seems ugly.  What's the best way to force a SimpleXML object to a string, regardless of context?


i have not created the array name then why this C program is working.`  #include<stdio.h> int main() {   printf("%c",7["sundaram"]);   return 0; }

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


Is there a LaTeX parameter (e.g., a penalty parameter) or any complex solution that can be setup maximum length of the last line in the all paragraphs throughout the text? Let's say, 2 em horizontal white space at the end of a paragraph?  Manual addition of horizontal space at the end of the paragraph is not appropriate.  Thank you.

Old school typesetters never allowed the last line of a paragraph to be just nearly filled. Either it would be clearly shorter than the other lines or it would be stretched to align with the right margin. (I assume the standard value where they decided to stretch the line was the depth of the indentation.)  If you have the time the same result can be achieved by checking all pages and manually adding \parfillskip=0pt to all offending paragraphs.  For example, this document:  \documentclass{article} \usepackage[paperwidth=3in,paperheight=3in]{geometry} \begin{document} \thispagestyle{empty} asdfjk adsf af dsasdf f dasf fdsa fds afsd fdsaf asdfsdafdsa asdf dsaf asdf sadf asdfjk adsf af dsasdf f dasf fdsa fds afsd fdsaf asdfsdafdsa asdf dsaf asdf sadf sasdfjk adsf af dsasdf f dasf fdsa fds afsd fdsaf asdfsdafdsa asdf dsaf asdf sadf asdfjk adsf af dsasdf f dasf fdsa fds afsd fdsaf asdfsdafdsa asdf dsaf asdf sadf asdfjk adsf af dsasdf f dasf fdsa fds afsd fdsaf asdfsdafdsa asdf dsaf asdfxx  \end{document}   renders to a  paragraph with an almost-full last line:    I've earlier been told that it would most probably be impossible to get pdfLaTeX to do this automatically.   If this is true -- could it be done with LuaTeX?


Show that if $a, b$, and $c$ are integers with $(a,b)=(a,c)=1$, then   $(a,bc)=1$   I don't know exactly that I should use the division algorithm or $(a,b)=d$, $(a/d,b/d)=1$.  This is my first time to study number theory... it's very hard...T^T I can't understand basic thms in this study...

How do I go about proving this?  If $\gcd(a,b)=1$ and $\gcd(a,c)=1$, then $\gcd(a,bc)=1$. I'm very confused with gcd proofs.


I am trying to run this SQL script on a SQL Server instance to restore a test database to a newer copy of the live database.  RESTORE FILELISTONLY    FROM disk = '\\staging_server\path\to\db_backup.bak'     -- Restore the files for  RESTORE DATABASE Test_DB    FROM disk = '\\staging_server\path\to\db_backup.bak'    WITH replace,    MOVE 'Test_DB' TO 'D:\R2_BIN\Test_DB.mdf',     MOVE 'Test_DB_log' TO 'D:\R2_BIN\Test_DB_log.ldf',     stats = 5 GO   However, on running the script I receive the following error.     Msg 3101, Level 16, State 1, Line 5   Exclusive access could not be obtained because the database is in use.   Msg 3013, Level 16, State 1, Line 5   RESTORE DATABASE is terminating abnormally.   Is there some way I can force this operation to go through, and kill any connections it needs to to get it done? I tried to close down any applications that may connections to the DB, but some of the connections I simply cannot identify. There are several from my username and yet I only have one instance of SQL Server Management Studio open.  Anyway, is there some way to kill all connections to a specific database? There are quite a few databases running on this instance, so I don't want to just shutdown and restart the instance all together if I can help it.

--first command  use master  Go -- second command ALTER DATABASE MyDB SET SINGLE_USER WITH ROLLBACK IMMEDIATE   Go  -- Third command RESTORE DATABASE [MyDB] FROM  DISK = N'D:\Restore_Backup\Restore_05042015\AcctDB.bak'  WITH  FILE = 1,   MOVE N' AcctDB '  TO N'D:\Program Files\Microsoft SQL Server\MSSQL10_50.MSSQLSERVER\MSSQL\DATA\WFStageAcct.mdf',   MOVE N' AcctDB _log'  TO N'D:\Program Files\Microsoft SQL Server\MSSQL10_50.MSSQLSERVER\MSSQL\DATA\WFStageAcct_log.ldf',   NOUNLOAD,   REPLACE,   STATS = 10  GO  --forth command  ALTER DATABASE MyDB SET MULTI_USER   Go   I run the above commands, one by one to restore database in different server. But sometime I cannot restore the database after changed to single user mode, because it is accessed by other connection. If I run the whole script except the last part together would that block other connection so I will be the only user?


Nothing happens after I connect to the 5GHz Wifi network. Please show me how I can connect. This question is a follow up to a previous question which was posted on SO as well.   Looks like there is no support for my wifi card on 16.04 .  Should I just ditch 16.04 and take 14.04 instead ?   Thanks.

I am running Ubuntu Gnome 16.04, and this morning the Network Manager suddenly stopped showing any WiFi networks at all. One moment I was connected to a local wireless network, and the next I was not. Even worse, although the system recognises the wifi adapter, no wifi networks appear to show up.  "enp0s29u1u4c4i2" is an iPhone I am using as an access point to post this question, but usually there are only three devices (eno1, lo, wlp2s0). I am attaching the outputs of ifconfig, iwconfig and iwlist scan, all ran as sudo.  ifconfig  eno1      Link encap:Ethernet  HWaddr 24:b6:fd:fc:9b:06             UP BROADCAST MULTICAST  MTU:1500  Metric:1           RX packets:0 errors:0 dropped:0 overruns:0 frame:0           TX packets:0 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:0 (0.0 B)  TX bytes:0 (0.0 B)           Interrupt:20 Memory:e1c00000-e1c20000   enp0s29u1u4c4i2 Link encap:Ethernet  HWaddr da:cf:9c:c6:b7:a0             inet addr:172.20.10.2  Bcast:172.20.10.15  Mask:255.255.255.240           inet6 addr: fe80::6eaa:eff8:b247:91b4/64 Scope:Link           UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1           RX packets:6422 errors:0 dropped:0 overruns:0 frame:0           TX packets:5985 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:4361666 (4.3 MB)  TX bytes:964896 (964.8 KB)  lo        Link encap:Local Loopback             inet addr:127.0.0.1  Mask:255.0.0.0           inet6 addr: ::1/128 Scope:Host           UP LOOPBACK RUNNING  MTU:65536  Metric:1           RX packets:2653 errors:0 dropped:0 overruns:0 frame:0           TX packets:2653 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1            RX bytes:209742 (209.7 KB)  TX bytes:209742 (209.7 KB)  wlp2s0    Link encap:Ethernet  HWaddr e0:06:e6:02:40:ae             UP BROADCAST MULTICAST  MTU:1500  Metric:1           RX packets:0 errors:0 dropped:0 overruns:0 frame:7           TX packets:0 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:0 (0.0 B)  TX bytes:0 (0.0 B)           Interrupt:17   iwconfig  lo        no wireless extensions.  enp0s29u1u4c4i2  no wireless extensions.  eno1      no wireless extensions.  wlp2s0    IEEE 802.11abg  ESSID:off/any             Mode:Managed  Access Point: Not-Associated   Tx-Power=200 dBm              Retry short limit:7   RTS thr:off   Fragment thr:off           Encryption key:off           Power Management:off   iwlist scan  lo        Interface doesn't support scanning.  enp0s29u1u4c4i2  Interface doesn't support scanning.  eno1      Interface doesn't support scanning.  wlp2s0    No scan results   According to lspci, my network controller is a "Broadcom Corporation BCM43228 802.11a/b/g/n". I had some issues getting the OS to recognise it right after installing 16.04, but I solved them long ago by switching the default drivers. What can I do to start seeing wifi networks again?   Thanks!  Gonzalo  EDIT  As per Pilot6's suggestion, I am adding the output of lspci -knn | grep Net -A2  00:19.0 Ethernet controller [0200]: Intel Corporation 82579LM Gigabit Network Connection [8086:1502] (rev 04)     DeviceName:  Onboard LAN     Subsystem: Dell 82579LM Gigabit Network Connection [1028:04a9]     Kernel driver in use: e1000e     Kernel modules: e1000e -- 02:00.0 Network controller [0280]: Broadcom Corporation BCM43228 802.11a/b/g/n [14e4:4359]     Subsystem: Dell Wireless 1530 Half-size Mini PCIe Card [1028:0011]     Kernel driver in use: wl   Also, here's the result of running the  mentioned by @eldergeek:


I have two computers set up next to each other - one Mac and one PC. Is there a mouse out there (Bluetooth, perhaps?) that I can use on both - one computer at a time - without linking the desktops? I'm thinking maybe a mouse that has a side toggle that switches which machine it's hooked up to at any given time. Doable?

How can I control two computers (with seperate monitors) with the same keyboard and mouse?  Is there a software solution to this?  Can the computers be running different OSs?


What is the name and what are the properties of the smallest integer divisible by all integers $1\ldots n$?  Clearly, $n!$ would do the trick, but it is generally not the smallest such number.  So far, I only came up with a recursive definition, i.e.  $f(n)=\frac{n\,f(n-1)}{\mathrm{gcd}(n,f(n-1)}$ starting with $f(1)=1$.  This nicely gives e.g. the first 12 such numbers: 1, 2, 6, 12, 60, 60, 420, 840, 2520, 2520, 27720, 27720.  Someone must have come across this before... Thanks.

What's the smallest positive integer which is divisible by all integers $1, 2, \dots, n$?  Is there a simple way to represent the answer?  Call it $f(n)$ here.   Clearly factorial ($n!$) satisfies the condition of divisibility.  But once you get to $f(4)$ (which is $12$), factorial ($24$) is too large, because it includes as factors both $4$ and $2$, which are redundant.  Multiplying all the prime numbers up to $n$ gives you another estimate, which is this time too low, because you need to include primes multiple times when they're repeated in the factorization of the inputs.  So the answer is somewhere between factorial, and the product of primes.  Is there a simple answer?


I have a FAT32 partition in windows server 2008 machine. How can I convert the partition to NTFS without formatting?     My intention is to resize the partition and add some     P.S.  exits with errors on server 2008.

How to easily convert fat32 local disk to ntfs? Can I do it without formatting the local disk?


I am trying to force publish 'future' or 'scheduled' posts, and I am having trouble  The reason I am asking is because I am creating a site that allows users to do the editing on the front of the site, so I need a button that will allow users to force publish scheduled posts.   Right now I am just trying to find a process or idea that works consistently, and all I have come up with is this:  1) Adjust the scheduled time to the past  2) Changing post status from future to draft 3) Change draft back to scheduled 4) Server realizes the scheduled post time has past and marks it published  Needless to say this isn't ideal. For other status changes I was able to use the status button seen here:  .  I am at a loss on this one because I can't even get the process working on the backend I have looked around a great deal and see that others have had similar problems (e.g. ) but cannot find a solution.  Asking the community for any ideas?

Use case:  I have a post type that relates to a music show. The 'show time' is grabbed through the post publish date which is set to some time in the future. I've found a function that takes future dated blog posts and leaves the date but marks the post as published on save but haven't been able to figure how to customize it for a custom post type.  The function is below.  <?php     function setup_future_hook() {         // Replace native future_post function with replacement         remove_action('future_post','show', '_future_post_hook');         add_action('future_post', 'show', 'publish_future_post_now');     }      function publish_future_post_now($id) {         // Set new post's post_status to "publish" rather than "future."         wp_publish_post($id);     }      add_action('init', 'setup_future_hook'); ?>


Show that a finite-dimensional vector space $V$ is complete.    I'm not sure on how to start with this problem. I kind of think that one should use the fact that any two norms on the finite vector space are equivalent, but I don't know how to proceed forward. What would be a way to solve the problem?  Thanks for the help.

Can you read my proof and tell me if it's correct? Thanks.  Let $V$ be a vector space over a complete topological field say $\mathbb R$ (or $\mathbb C$) with $\dim(V) = n$, base $e_i$ and norm $\|\cdot\|$. Let $v_k$ be a Cauchy sequence w.r.t. $\|\cdot\|$. Since any two norms on a finite dimensional space are equivalent, $\|\cdot\|$ is equivalent to the $l^1$-norm $\|\cdot\|_1$ which means that for some constant $C$, $\varepsilon > 0$, $k,j$ large enough, $$ \varepsilon > \|v_j - v_k\| \geq C \|v_j - v_k\|_1 e_i= C \sum_{i=1}^n |v_{ji} - v_{ki}| \geq |v_{ji} - v_{ki}|$$ for each $1 \leq i \leq n$. Hence $v_{ki}$ is a Cauchy sequence in $\mathbb R$ (or $\mathbb C$) for each $i$. $\mathbb R$ (or $\mathbb C$) is complete hence $v_i = \lim_{k \to \infty} v_{ki} $ is in $\mathbb R$ (or $\Bbb C$) for each $i$. Let $v = (v_1, \dots , v_n) = \sum_i v_i e_i$. Then $v$ is in $V$ and $\|v_k - v\| \to 0$:  Let $\varepsilon > 0$. Then $$ \|v_k - v\| \leq C \|v_k - v\|_1 = C \sum_{i=1}^n |v_{ki} - v_i| \leq C^{'}n \varepsilon$$  for $k$ large enough.


I'm designing an API for a web service and I can't decide between using XML attributes, elements or a mixed architecture.  Let me show you an example. Let's assume I have an object called Domain. This model has 3 properties (tld, sld, trd and the name itself) and a method valid? that returns true if the domain is valid.  # I'm using ruby but  # consider this as pseudo-code class Domain   attr_accessor :tld, :sld, :trd, :name    def valid?     true # force true   end end   My api called /domain/parser takes a domain in input and returns the parsed response. The first possibility is to use an element for every domain attribute.  <result>   <domain>     <name>www.google.it</name>     <tld>it</tld>     ...     <valid>true</true>   </domain> </result>   But some interfaces use attributes.  <result>   <domain tld="it" sld="google.com" trd="www" rule="*.foo" name="www.google.it" valid="true" /> </result>   And don't forget attributes and value.  <result>   <domain tld="it" sld="google.com" trd="www" rule="*.foo" name="www.google.it" valid="true">     www.google.it   </domain> </result>   In your opinion, which is the more powerful, flexible and expressive choice? Also, consider the response will be served in XML and JSON (soon).

At work we are being asked to create XML files to pass data to another offline application that will then create a second XML file to pass back in order to update some of our data. During the process we have been discussing with the team of the other application about the structure of the XML file.   The sample I came up with is essentially something like:  <INVENTORY>    <ITEM serialNumber="something" location="something" barcode="something">       <TYPE modelNumber="something" vendor="something"/>     </ITEM> </INVENTORY>   The other team said that this was not industry standard and that attributes should only be used for meta data. They suggested:  <INVENTORY>    <ITEM>       <SERIALNUMBER>something</SERIALNUMBER>       <LOCATION>something</LOCATION>       <BARCODE>something</BARCODE>       <TYPE>          <MODELNUMBER>something</MODELNUMBER>          <VENDOR>something</VENDOR>       </TYPE>    </ITEM> </INVENTORY>   The reason I suggested the first is that the size of the file created is much smaller. There will be roughly 80000 items that will be in the file during transfer. Their suggestion in reality turns out to be three times larger than the one I suggested. I searched for the mysterious "Industry Standard" that was mentioned, but the closest I could find was that XML attributes should only be used for meta data, but said the debate was about what was actually meta data.  After the long winded explanation (sorry) how do you determine what is meta data, and when designing the structure of an XML document how should you decide when to use an attribute or an element?


When we draw a ROC curve, how can we determine the optimal threshold? I think, the point that is closest to (0,1) vector is the best threshold. However, if we cannot calculate the distance, how can we determine the best threshold? Is there any other way to know that? Also, I think eyeballing is a pretty good way. How do you guys think about the eyeballing method?

I want to find the cut-off point for gender based on an anthropological measurement. I can draw the curves and I know that in case sensitivity and specificity are both similarly important, the point closest to the upper left corner of the frame (or if the curve is negative, the closest point to the lower right corner) should be determined as cut-off.   However, I don't know whether there is any already implemented function in R or any other programs for determining this, simply? I just know SPSS doesn't have such a function. Do you know any programs, or R which can do it via an already implemented function?


Prove that the following is true for every $n∈ℕ$: $$7\mid(3^{2n+1}+2^{n+2}).$$  I've noticed $$3^{2n+1}+2^{n+2} =3^{2n} \cdot 3+2^{n} \cdot 4.$$ Any suggestions how to continue from there to get something like $7k$ for $k\in\mathbb{N}$. Thank you in advance!

Expanding the equation out gives  $(3^{2n}\times3)+(2^n\times2^2) \equiv 0\pmod{7}$   Is this correct? I'm a little hazy on my index laws.  Not sure if this is what I need to do? Am I on the right track?


I want to match everything starting from the line /Subtype /Widget until the line <<  With this code nothing is matched  preg_match('#/Subtype /Widget([.\s]*)<<#', $pdf, $matches);   subject  522 0 obj  << /Subtype /Widget /V (some text) /T (Kreditor) /Rect [54.6 359.16 296.4 531.84] /P 414 0 R /DA (/Helv 8 Tf 0 g) /Ff 8392704 /Type /Annot /F 4 /TU (Kreditor:) /AP  << /N 534 0 R

For example, this regex  (.*)<FooBar>   will match:  abcde<FooBar>   But how do I get it to match across multiple lines?  abcde fghij<FooBar>


I'm writing a matrix library in c++. After some debugging I found that a simple double difference is not zero for two "equals" numbers. This is due how double are represented in a computer of course. So my question is, what I could use to improve the numeric stability? I tried to use long double but I have the same problem. The same algorithm in MATLAB works so MATLAB must use some trick about internal number representation.

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


Let $\{X_i\}_{i=1}^n$ be a family of i.i.d. random variables taking values in $[0,1]$, having a mean $\mu$ and variance $\sigma^2$. A simple confidence interval for the mean, using $\sigma$ whenever it is known, is given by $$ P( | \bar X - \mu| > \varepsilon) \le \frac{\sigma^2}{n\varepsilon^2} \le\frac{1}{n \varepsilon^2} \qquad (1). $$  Also, because $\frac{\bar X- \mu}{\sigma/\sqrt{n}}$ is asymptotically distributed as a standard normal random variable, the normal distribution is sometimes used to "construct" an approximate confidence interval.    In multiple-choice answer statistics exams, I've had to use this approximation instead of $(1)$ whenever $n \geq 30$. I've always felt very uncomfortable with this (more than you can imagine), as the approximation error is not quantified.     Why use the normal approximation rather than $(1)$? I don't want, ever again, to blindly apply the rule $n \geq 30$. Are there good references that can support me in a refusal to do so and provide appropriate alternatives? ($(1)$ is an example of what I consider an appropriate alternative.)   Here, while $\sigma$ and $E[ |X|^3]$ are unknown, they are easily bounded.  Please note that my question is a reference request particularly about confidence intervals and therefore is distinct from the  differs from the questions that were suggested as partial duplicates  and . It is not answered there.

I have read/heard many times that the sample size of at least 30 units is considered as "large sample" (normality assumptions of means usually approximately holds due to the CLT, ...).  Therefore, in my experiments, I usually generate samples of 30 units. Can you please give me some reference which should be cited when using sample size 30?


I don't know much about hardware. My PC has window 8 32-bit installed. And I want to buy a graphic card 2gb ddr3 but I'm confused that it says it has architecture of 64-bit in it. Does it install on 32-bit or should i go for it?  Zotac Nvidia gt 610 2GB ddr3  -opengl 4.2 -64 bit -1066 MhZ

On PCIe 1.0, does 64 bits graphic card could be compatible with 32 bits OS (Windows 7 32 bits) ?  Is there any restriction?  Edit:     Few peoples told in comments that bitness should not be an issue. If I   understand well, it is only a question of is there any supported   drivers for the specific OS (here Win 7 32 bits) ???   Edit2: I finally bought a 64bits graphic card with PCIe 1.0 interface and it work nicely on my Windows 7 32 bits... Thanks to all !!!


I am not using any programming language in particular, rather this is a University regular language assignment I have to do.  To explain what I have to do is basically make an:   infinite language Words must contain any number a's and b's, so no single character words words are palindromes to themselves so for example words I should get are "aabbaa","abba", "abbbba", "ababbaabbaba", "bbbaabbb"   How would I approach making this regular expression?

That was an interview question that I was unable to answer:  How to check that a string is a palindrome using regular expressions?  p.s. There is already a question "" and it gives a lot of answers in different languages, but no answer that uses regular expressions.


In Minecraft, I usually play by myself in the single player game mode. Now I had to disable the internet access on my laptop because of an overload on internet usage. When playing Minecraft I searched for some pigs and horses to bring back to my city, but after an hour of looking around I only found a few chickens (that I happily murdered).   Do animals spawn less frequently in offline mode or is this just sheer coincidence?

Are there any differences with regards to chunk generation or other settings in single-player vs server mode of equivalent versions?  I have a map I'd like to host on a private server for my friend to play with me. However, when I'm on the road without ready internet, I'd like to play it single-player as well.  Will this cause any issues, especially with chunk generation, drops, items, etc (i.e., getting a different chunk generated in server-mode than single-player would have created), or do all server-client version pairs (I'm using 1.6.2) use the same game code?  The main point is that I don't want gameplay to change at all, between single-player and server mode.


I have the following code which I took from another site and was trying to adapt in order to plot a sin function and a cos function stacked up one on top of each other:  \def\xs{1} \def\ys{6}  \begin{tikzpicture}[domain=-3:5, xscale=\xs, yscale=\ys, >=latex]   \def\tr{0.1}   \def\ts{0.6}   \def\al{1.3}   \def\n{1.6}   \def\I{0.3506}   \def\ti{0.4071}   \def\S{-0.1340}   \def\Sangle{-42}   \def\f1{0.8}    % Function1   \draw[very thin,color=gray!30] (-3-0.2/\xs,0-0.2/\ys)     grid[xstep=0.5, ystep=0.1] (5+0.2/\xs,0.7+0.2/\ys);   \draw[->, line width=1pt] (-3,0) -- (5.25,0)     node[below] {$r$};   \draw[->, line width=1pt] (-3,0) -- (-3,0.75)     node[left] {$f_\phi$};   % function   \draw [red,thick,smooth,domain=0:5] plot (\x, {cos(\x)});   % side decoration   \draw[dashed] (\I,0) node[below] {$I$} -- (\I,\ti) -- (-3,\ti)     node[left] {$u_i$};   \draw [decorate, decoration={brace, amplitude=4pt}]     (-3.5,\tr) -- (-3.5,\ts) node [black,midway,left=3pt] {$\Delta$};   % texto   \path[->, draw]     (\I,\ti) to[out=0, in=180] ++(0.75,0.1)     node[anchor=west, text ragged, text width=1.6cm, fill=white]     {Point of interest};   \node[above] at (1,0.7)     {Function $f_\phi$ definition};    % Function 2   \def\ys{3}   \begin{scope}[yshift=-0.3cm, domain=0:10, >=latex, yscale=\ys]     \draw[very thin,color=gray!30] (-3-0.2/\xs,-0.15-0.15*0.2/\ys)       grid[xstep=0.5, ystep=0.03] (5+0.2/\xs,0.03+0.15*0.2/\ys);     \draw[->, line width=1pt] (-3,-0.15) -- (5.25,-0.15)       node[below] {$\log(\psi)$};     \draw[->, line width=1pt] (-3,-0.15) -- (-3,0.05)       node[left] {$U'(\psi)$};     \draw [green,domain=0:5] plot (\x, {sin(\x)});     \node[left] at (-3,0) {$0$};     \draw[dashed] (\I,0.03) -- (\I,\S) -- (-3,\S) node[left] {$U'(I)$};     \path[->, draw]       (\I,\S) to[out=-2, in=180] ++(1.75,0.02)       node[anchor=west, fill=white] {$S$};     \node[above] at (1,0.03) {Function $F_\phi$ definition};   \end{scope} \end{tikzpicture}   But I get lines!!!    I have tried changing the domain range and the scale values. I don't really understand what's happening here! How can I get my functions to display?  Thanks

I'm trying to plot a function with pgfplots for LaTeX. Unfortunately, pgfplots plots the function incorrectly.  Here is the LaTeX code I use:  \begin{figure}[H] \centering \begin{tikzpicture}     \begin{axis}[xlabel=Gameplays,ylabel=Rating]         \addplot+[gray,domain=1:30]         {0.5 + 0.5 * ((atan(x) * 2 / pi)^11.79)};     \end{axis} \end{tikzpicture} \caption{Omzetten van aantal gameplays tot impliciete rating} \label{fig:omzetten_impliciete_ratings} \end{figure}   Here is how the function should look like:     This is how it is plotted:    Does anyone know what I do wrong?  Thanks in advance!


So , i used UNetBootin to install Ubuntu 18.04 on my pc , i installed it on a parititon i created from my hard drive     i opened the installer i think it was something like Ubuntu 18.04 Installer it was on the desktop i partitioned the drive on the partition i created 100 gbs i set it to ext4 then installed told me to restart now i dont know how to get into it   What do i do then ! Thanks  EDIT : Dual boot : I have windows 10

I would like to see a full how-to guide on how to install Ubuntu.


Looking through some of our app code I found the following:  for (prop in aBunchOfData.properties) {   if (!aBunchOfData.properties.hasOwnProperty(prop)) continue;   doABunchOfProcessing(aBunchOfData.properties[prop]); }   As far as I understand, for ... in will only loop through the "own" properties of an object. Can the hasOwnProperty check here ever make a difference? If so, under what conditions?  Thanks!

How do I check if an object has a specific property in JavaScript?  Consider:  x = {'key': 1}; if ( x.hasOwnProperty('key') ) {     //Do this }   Is that the best way to do it?


It was a prospective, randomised clinical trial in which 245 volunteers participated in.    Does the above read / sound correct?   Would it be better to say:      It was a prospective, randomised clinical trial which 245 volunteers participated in.    or even:      It was a prospective, randomised clinical trial in which 245 volunteers participated.

Like many others, I commonly find myself ending a sentence with a preposition.  Yes, it makes me cringe.  I usually rewrite the sentence, but sometimes (in emails) I just live with it.  To, with... you know who you are.  Should I keep fighting myself on this one, or is it okay in some circumstances?


Let $G$ be a group with a subgroup $H\subset G$. Then if for $g\in G$ we have $gHg^{-1}\subset H$, is it true that $gHg^{-1}= H$? At first sight I thought this should be true because $x\mapsto gxg^{-1}$ is an automorphism on $G$, but now I start believing that my initial intuition was wrong, since I fail to prove it. If it isn't true, could you add an explicit counter example?

Let $G$ be a group, $H\subseteq G$ a subgroup and $a\in G$ an element of the group. Is it possible that $aHa^{-1} \subset H$, but $aHa^{-1} \neq H$?   If $H$ has finite index or finite order, this is not possible.


I just randomly discovered the following in Node.js  0.3 + 0.2 === 0.5 true  0.1 + 0.2 === 0.3 false   Anyone does have an explanation for what goes on here? The tested version is Node.js v6.9.1 on a 4.4.0-57-generic kernel. Cheers to anyone able to explain this to me!

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


Paid off a 2003 gmc Yukon in july, low and behold a month later my girlfriend of 2 1/2 years leaves me for another woman. took the vehicle that I have invested approximately 10,000$ between repairs and payments. I made the mistake of putting her name on the title. I have asked repeatedly for 3500$ and I would sign off on the vehicle. no attempt has been made to pay me for anything. always excuse after excuse. would it be wise to take to small claims to obtain the vehicle that I paid for that she has possession of?? the total cost of the vehicle was 7600$ then I put approximately 3000$ into repairs all over the vehicle to keep it in good running condidition with proof of repairs done out of a shop. will not pay insurance or license plate tags and is letting her now Wife drive the vehicle that she is uninsured on. I am still paying insurance on the vehicle cause I do not want anything to happen to me if the vehicle is wrecked. but with her wife driving the vehicle illegally how can I get the vehicle back. knowing I will never see the 3500$ wether or not I take her to court. need to know what options I have in this matter. local police will not help me. can I have it towed to my house and disable it til I see some money??? what can I do. theres no getting along anymore yet its all excuses and saying its her vehicle. yet I am listed first on the title and I have made 95% of the payments through a buy here pay here dealer with proof of payment. she had no legitimate job to pay for the vehicle so there is no income from her that proves she made any payments on the vehicle. PLEASE HELP!!!!

As a co-buyer on an automobile, can the other party take full possession? Both parties names are listed as the Purchaser's. Only one purchaser signed the retail order for the motor vehicle, and if so, how can one become a no co-buyer?


Is there a way to allow plugin to be activated only from NETWORK DASHBOARD (if using Multisite).  In not multisite, allow to be activated normally.

I'm developing the  plugin.  Its purpose is to scan for altered files and it works fine for a single installation of WP. But when you look at multi-site it's not something that wants to be enabled on all sub sites, as they all share the same files and (to be honest) only a network admin should be the one that wants to be notified against file changes.  So my question is this:      How would I program it, to only be allowed to be installed/run from the root site of a multi-site installation? So: that means not allowing it to be network installed and only activated from the root blog.   Anyone know of any ways on how I could achieve this?


I am looking for a way to convert an int to a string of a given length. If the representation of the number is shorter, it should be zero-filled.  I.e., what I'd like to see:  snprintf(buffer, 3, "%d", 5); -> 005 snprintf(buffer, 2, "%d", 55); -> 55   Actually, snprintf(buffer, 3, "%d", 5); just return 5 in string.  Is there a simple way to do this ?

I'm trying to find a good way to print leading 0, such as 01001 for a . While the number would be stored as 1001, what is a good way to do it? I thought of using either case statements or if to figure out how many digits the number is and then convert it to an char array with extra 0's for printing, but I can't help but think there may be a way to do this with the printf format syntax that is eluding me.


I was wondering off to find a wolf, and I got lost. I flew in the air to look for my BIG house and I can't find it. Now, I am totally confused and worried and I don't want to rebuild because it is AWESOME and I used a map, looked it up, and tried everything. So can you please help me? I even tried to teleport but it wouldn't work. I also live by a lake.

I wandered too far to go look for sheep and now I'm on a completely different island.  How do I find my way back to my house?


If a site contains 94% of unique content and remaining 6% of the content coming under duplicate, then can it be considered as bad for SEO?

This is a general, community wiki question regarding duplicate content.  If your question was closed as a duplicate of this question and you feel that the information provided here does not provide a sufficient answer, please open a discussion on .     What does Google consider to be duplicate content? Will the way I am presenting my content result in a duplicate content penalty? How can I avoid having my site's content treated as duplicate content?


Example:   I have alias chrome='google-chrome'. I want which chrome to return the same thing which google-chrome returns, i.e.:  /usr/bin/google-chrome  Is that possible?

Like most users, I have a bunch of aliases set up to give a default set of flags for frequently used programs. For instance,  alias vim='vim -X' alias grep='grep -E' alias ls='ls -G'   The problem is that if I want to use which to see where my vim/grep/ls/etc is coming from, the alias gets in the way:  $ which vim vim: aliased to vim -X   This is useful output, but not what I'm looking for in this case; I know vim is aliased to vim -X but I want to know where that vim is coming from.  Short of temporarily un-defining the alias just so I can use which on it, is there an easy way to have which 'unwrap' the alias and run itself on that?  Edit: It seems that which is a shell-builtin with different behaviors across different shells. In Bash, SiegeX's suggestion of the --skip-alias flag works; however, I'm on Zsh. Does something similar exist there?


Wizarding families are all magical, spells and charms being performed by older siblings and parents on a regular basis. Families of Muggle-borns are just Muggle normality, up until the Muggle-born’s 11th birthday. Then we have those who are born to a wizard and a Muggle (those who actually LIVE with them (like Lockhart and Umbridge). Would the Wizarding parent perform spells and charms around the house, for example?

Most of the wand-carriers that come from a non-Muggle family seem fairly uneducated when it comes to interacting with Muggles.  This implies that they don't go to any type of Muggle school before entering into their education at Hogwarts (or whichever Wizarding school they go to), or else they would at least understand some Muggle culture.  What do children from magical families do before going to Hogwarts if they don't go to a traditional school?  Is there any evidence that they're homeschooled?


Bolstered by evidence from   It's a common problem across the sites that users -- new, old, and apathetic -- will sometimes leave their question without accepting an answer for an inordinate amount of time (usually to the extent of "ever").   I thusly request adding an answer acceptance timer or an option for those with enough rep to vote to accept an answer.   While some questions have no immediate answers (like questions about plot elements in unreleased films), many questions have clear and decisive answers that deserve commendation.    Perhaps tying it to the number of votes for the existing answers? Surely a bad answer - which the asker could change if they ever returned -- is better than no answer at all.

As a disclaimer, I must admit this may benefit me (I haven't checked), but probably not as significantly as most others. This issue is also something that has prevented me from answering questions by users with 1 rep in the past, especially if they are poorly fashioned. The Problem New users with a programming question find SO from various methods, such as google. They ask a question with haste, hoping for a quick answer -- which they usually receive. Many of these users have no interest in Stack Overflow itself, but are simply interested in getting the solution they require. As a result of this, they'll check the site regularly for the first day or two until a sufficient answer has been posted. Once they get what they need, they bail; without the required rep or understanding that they should up-vote and select a response as the answer. The Result A great many questions on SO are abandoned by users with no intention of ever coming back. The answer they require has been provided, but for one or more reasons they have neglected their duty of contributing back by way of awarding reputation. The Reach (Since Jeff loves Datum) Some queries on the data dump examine the reach of this 'problem'. The query I used is based on extensions of the following base query; SELECT p1.Id, p1.Score, p1.OwnerUserId, p2.OwnerUserId, p2.Score FROM posts p1  INNER JOIN posts p2 ON (p1.Id=p2.ParentId) LEFT JOIN users ON (p1.OwnerUserId=users.Id) WHERE p2.Score >= 2  AND p2.Score = ( SELECT MAX(p3.Score) FROM posts p3 WHERE p3.ParentId=p1.Id ) AND users.Reputation < 15 AND p1.PostTypeId = 1 AND p1.AcceptedAnswerId = 0  Result: 3,288 Questions by users with under 15 rep which have answers with 2+ up votes that have no accepted answer. Adding: AND (users.LastAccessDate-p1.LastActivityDate) < 604800 // 1 week AND p1.CreationDate < 1249084800 // 1249084800 is 1 week before latest dump data  to the where clause further reveals that 877 questions that have answers with 2+ up votes have no accepted answer, and the owner of the question has not returned since the week the question was asked. Modifying there where clause, and removing the left join: AND p1.OwnerUserId = 0    Reveals a staggering 3,675 questions with answers of 2+ votes by deleted users.  These are questions that were probably answered but the users who did the work can never be recognized. Building off the previous and using an even more restrictive WHERE clause WHERE p2.Score >=5  Still 1,178 posts that can never have an accepted answer. How many posts are there with over 5 up votes that don't provide the correct answer? Modifying the where clause for Reputation to AND users.Reputation = 1  Still reveals 388 questions by users with 1 rep have been abandoned. Solution Similar to how bounty questions work, if a user has abandons the site (not active since x time after the question was asked) with a question that has answers with 2+ up votes, force the answer with the most up votes to be the selected answer. This will reduce the amount of questions that are unanswered, and also give users more of an incentive to answer questions by new users without extra hesitation.  Update Added more statistics for deleted users.  Please feel free to add/remove rules to make this a truly practical feature.


After a long gap away from SE, I have returned to find innumerable requests to reinstate someone. As you can imagine my curiosity is piqued but, more importantly, I would like to know enough to form an opinion about the matter. Clearly this concerns what journalists would describe as "public interest" - indicating that publication may be justified even at the cost of betraying some confidences. It seems that the matter is already out in the open but without those in the know explicitly describing the events. Is it acceptable to ask what happened and why?

Across all Stack Exchange network sites I have seen a lot of users with "Reinstate Monica" in the username, and I am not sure what this means.


The exercise goes like this... Let $(a_n) \subset \mathbb{R}$ given by $a_1=\sqrt{21}$ and $a_{n+1}=\sqrt{21a_n}$ a) Find the value of $L=\lim_{n \to \infty} a_n$ b) Prove that $L=\lim_{n \to \infty} a_n$ I managed to prove that the sequence is monotonic increasing and bounded above by $21$ by induction so i can assume that $(a_n)$ converges and show that $L=21$ using a little bit of algebra. But for b) I'm asked to prove the fact using the $\epsilon - N$ definition of limit I'm used to struggle a lot proving limits for non-recursive sequences using the formal definition of limit, so in this case I don't really know how to proceed. Any suggestions?

Prove that $(a_{n})_{n \in \mathbb{N}}$ is convergent with $a_{0}=1$,   $a_{n+1}= \sqrt{2a_{n}}$ and calculate its limit.      You got the info that the square-root-function is strictly monotonic   increasing and also continuous.   I'm very confused how this could be solved because there isn't really a sequence given here. It seems to be a recursive one and I also don't know how to form $a_{n+1}$.  Could I form it to $a_{n}+ a_{1}$ ?(I don't care if it's useful here but I'd like to know if this would be correct at first.)    I have started by forming to $a_{n}$:  $$2a_{n} = (a_{n+1})^{2}$$  $$a_{n}=\frac{(a_{n+1})^{2}}{2}$$  Then I also formed to $a_{1}:$  $$a_{n}+ a_{1} = \sqrt{2a_{n}}$$  $$a_{1} = \sqrt{2a_{n}} - a_{n}$$  But it seems like this won't lead to anything.. Also I don't know what we can do with the given info, $a_{0} = 1$, the continuity and monotonic increasing...


What is correct:      helping one to accomplish the dreams?    OR      helping one accomplish the dreams?    The question I have is about the use of to in the first sentence?

What is the correct way to use infinitive after the verb "help": with or without "to"?  For example:     Please, help me to understand this.   or:     Please, help me understand this.


I want to be able print line 1,2,3,4,7 by skipping Lines 5,6,8,9 and repeat the pattern till the end of file.  Sample INPUT:  Line 1 Line 2 Line 3 Line 4 Line 5 Line 6 Line 7 Line 8 Line 9 Line 10 Line 11 Line 12 Line 13 Line 14 Line 15 Line 16 Line 17 Line 18   Desired Output:  Line 1 Line 2 Line 3 Line 4 Line 7 Line 10 Line 11 Line 12 Line 13 Line 16   Using Solaris 10, KSH. Would love an nawk or sed solution

I have a large file and I would like print from each sequential 50 lines , the 15th and 25th lines.  sed -n '15,25p' inputfile   How to modify this command to print only lines 15 and 25 and to loop over each 50 lines in the file.


Calculate the following indefinite integral:   $$ \int \frac{x}{x^3+5}\, dx $$   I understand that I should first do the  of the integrand and then integrate each part of the integrand to calculate the integral.   However, I don't know how to decompose $\frac{x}{x^3+5}$. Could anyone show me how?    [Notes from the editor. 9/4/19]   This integral is of the form $\int \frac{x}{x^3+a}\, dx$. More generally, it is an integral of the . See also the following similar questions:

I'm new here!  The problem: integrate from zero to infinity x over the quantity x cubed plus one dx. I checked on wolfram alpha and the answer is that the indefinite integral is this:  $$\int \frac{x}{1+x^3} dx = \frac{1}{6}\left(\log(x^2-x+1)-2 \log(x+1)+2 \sqrt{3} \arctan((2 x-1)/\sqrt{3})\right)+\text{constant}$$  and the definite integral is this:  $$\int_0^\infty \frac{x}{1+x^3} dx = \frac{2 \pi}{3 \sqrt{3}}\approx 1.2092$$  I am trying to figure out all the steps in between. I see that there are logs, which are equivalent to the ln variant that i am more familiar with, which means it was integrating $1/x$ at some point; I also see an inverse tangent in there.  I started with long division to simplify and I got (which could be wrong because I am very tired right now) $x/(x^3+1) = x^2+ 1/(x^3+1)$ which seems to be a step in the right direction. Wolfram Alpha thinks I definitely did that step wrong. The two equations do not evaluate as equal.  Then I cheated and took the wolfram alpha factorization of $(x^3+1) = (x+1)(x^2-x+1)$...I probably should have known that but didn't offhand. Now it is looking like $x^2$ plus the partial fraction decomposition $1/(x^3+1) = A/(x+1)+(Bx+C)/(x^2-x+1)$. Am I heading in the right direction with this? At this point do I just plug in and crunch?


From      What is true is that trivially small effects can be found with very large sample sizes. That does not suggest that you shouldn't have such large sample sizes. What it means is that the way you interpret your finding is dependent upon the effect size and sensitivity of the test. If you have a very small effect size and highly sensitive test you have to recognize that the statistically significant finding may not be meaningful or useful.   Why "If you have a very small effect size and highly sensitive test you have to recognize that the statistically significant finding may not be meaningful or useful"?

In a  of Amstat News, the authors (Mark van der Laan and Sherri Rose) stated that "We know that for large enough sample sizes, every study—including ones in which the null hypothesis of no effect is true — will declare a statistically significant effect.".  Well, I for one didn't know that. Is this true? Does it mean that hypothesis testing is worthless for large data sets?


When I graph a density plot in R, and all the numbers are slightly greater than 0, I get essentially a vertical line at x = 0.  But when all the numbers are exactly equal to 0, I get some sort of bell curve.  Why is that?  It seems counterintuitive.  The command I used to plot the curves was  for (i in 0:60) {     cur_data = subset(data, time == i)     p <- ggplot(cur_data, aes(x=error)) +                 geom_density() +                 theme_bw() +                 xlab(paste("Error distribution (minute ", i, ")", sep="")) +                 xlim(0, 1)     ggsave(...) }   At i = 60, cur_data should be entirely populated by the values 0.0.      (Originally posted on Stack Overflow; was told to post here.)


I would like to know how can I use the terminal? The functionality of commands. I don't know how can I use the terminal for download movies or software.

What is a terminal? How do I open a terminal window? How do I use the terminal?


When I set this template as homepage, pagination doesn't work. I see the buttons, but when I click the button for page 2, nothing happens, doesn't go on page 2, it still remain in page 1.  What is wrong? Where is the mistake? I read all posts from here & from internet about this issue, but nothing works.  Solution for pagination is this: .  Here is the code:

              <?php if (have_posts()) : while (have_posts()) : the_post();?>              <?php                $template_name =   get_post_meta( $wp_query->post->ID, '_wp_page_template', true );             $post_type =  str_replace( array('template-', '.php'), array(''), $template_name);             ?>              <?php the_content(); ?>              <?php endwhile; endif; ?>             <?php              $loop = new WP_Query("post_type=$post_type&paged=$paged");             if ($loop->have_posts()) : while ($loop->have_posts()) : $loop->the_post(); ?>               <?php get_template_part('loop', $post_type) ?>                                          <?php endwhile; ?>                                         <?php else: ?>                 <?php require THEME_DIR.'/empty.php'; ?>                                        <?php endif; ?>                                          <?php pagination($loop->max_num_pages); ?>
          <?php get_sidebar(); ?>

I've got a custom loop that I'm using to display some Real Estate listings that will be available within 60 days. I'm calling it with the following function:   <?php  $sixtydays = date('Y/m/d', strtotime('+60 days')); $paged = (get_query_var('paged')) ? get_query_var('paged') : 1; $query = new PostsOrderedByMetaQuery(array(   'post_type' => array('post', 'real-estate'),   'meta_key' => 'Time Available',   'meta_compare' => '<=',   'meta_value' => $sixtydays,   'paged' => $paged,   'orderby_meta_key' => 'Price',   'orderby_order'    => 'ASC' )); ?> <?php while ($query->have_posts()) : $query->the_post(); ?>   While the loop works great, I can't get it to paginate. It shows the first 10 (my default) posts but doesn't show the pagination. The only way to display all posts is to show them on one page by adding 'posts_per_page' => -1, I have similar loops on other pages that have no problem paginating. The only difference with this one is that there are two meta keys that are filtering the posts.   I'm using WP Page Navi for this and the rest of my pages. I'm closing the loop and adding the pagination using the following code:   <?php endwhile; // End the loop. Whew. ?> <?php wp_pagenavi(); ?> <?php wp_reset_query(); ?>   How can I go about fixing this?


I had a bit of confusion earlier about a discussion in astrophysics.   I was reading that the ISS orbits the earth at $8 kms^{-1}$ but then when I calculated the total energy that the ISS had, I was considering:   It's Kinetic Energy $\frac{1}{2}mv^2$ It's Gravitational Potential Energy $-\frac{GMm}{r}$   where    $m$ is the mass of the ISS $M$ is the mass of the Earth $v$ is the speed of the ISS   When I did my calculations, something got me confused.   Using the following data:     ISS circles the Earth at a height of $4.0 \times 10^5$m.     ISS has a mass of $4.2 \times 10^5$ kg    The radius of the Earth is $6.4 \times 10^6$ m    The mass of the Earth is $6.0 \times 10^24$kg   It turned out the magnitude of the Gravitational Potential Energy is greater than the magnitude of the Kinetic energy.  $$E_K < |E_{GPE}|$$  But in the lecture notes I was reading for astrophysics, the overall Energy is negative as you add both Energies together.   Is it possible for the energy of an object to be negative, and is it valid in this case?  I was thinking to add the magnitudes of both $E_K$ and $E_{GPE}$ as I assumed the total energy of the ISS was equal to the sum of these energies, hence giving a positive value.

Assume it's an circular orbit. Object A orbits around object B. Take object B as frame of reference.  .$E=KE_a + GPE$  .$E=\frac 12m_av_a^2 +(-\frac {GM_bm_A}r)$  .$E=\frac 12m_a(GM_br)+(-\frac {GM_bm_a}r)$  .$E=-\frac {GMm}{2r} < 0$  What does negative total energy at any instant of time mean?


I heard about it. I have heard about it. I knew him. I have known him. He has played really well. He played really well.

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


I need to make the .content div use the remaining screen height. I don´t know what´s the height of .header - I can´t use calc(100vh - headerHeight)  HTML structure
header

content
         CSS  html, body {     height: 100%; }   Tried with  .content {     display: flex;     flex-grow: 1; }   using 100vh didn´t work because it generated some vertical scroll (with the height of the .header)  .content {     height: 100vh }   it should look like this  +-------------------------------+ |            header             | +-------------------------------+ |                               | |                               | |            content            | |                               | |                               | +-------------------------------+

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


Is there any way that you can easily and I mean easily install Oracle Java JDK 7 in ubuntu with absolutely no internet connection. I'm asking because I am completely new to things(noob and newb) like this in Ubuntu. I have access to a Windows OS based computer that has internet but not at home which is the computer that has Ubuntu installed so I can download the needed files/materials to install and later bring them to my computer at home to install. I would like it if somewhere there were instructions that give every detail(even such as what application to open exactly what directory and how to access the directory etc...) to what must be done to get Oracle Java JDK 7 installed. Thanks in advance.

I want to install Oracle's JRE and to update to the latest version with the Software Updater when they released. Is there a Ubuntu package that is provided by Canonical or Oracle?  Before release Java 7, I followed  to install Java 6.  But it doesn't work for Java 7. There is no package sun-java7-xxx. How can you install Java 7?


I have problems with this code and I have no idea how to fix it:  \documentclass[10pt]{article} \usepackage{makeidx} \usepackage{multirow} \usepackage{multicol} \usepackage[dvipsnames,svgnames,table]{xcolor} \usepackage{graphicx} \usepackage{epstopdf} \usepackage{ulem} \usepackage{hyperref} \usepackage{amsmath} \usepackage{amssymb} \author{NAME} \title{TITLE} \usepackage[paperwidth=612pt,paperheight=792pt,top=28pt,right=34pt,bottom=35pt,left=34pt]{geometry}   \begin{document}  \noindent \textbf{ABSTRACT}  \noindent \textbf{}  {\raggedright  \vspace{3pt} \noindent \begin{tabular}{|p{514pt}|} \hline \parbox{514pt} {\raggedright  \vspace{3pt} TEXT \textbf{. } TEXT } \\ \hline \end{tabular} \vspace{2pt}  }  \end{document}   The error that I got is this:  Command Line:   latex.exe --src --interaction=errorstopmode --synctex=-1 "file.tex" Startup Folder: C:\Users\*****  This is pdfTeX, Version 3.14159265-2.6-1.40.16 (MiKTeX 2.9 64-bit) entering extended mode (file.tex LaTeX2e <2015/01/01> patch level 2 Babel <3.9m> and hyphenation patterns for 1 languages loaded.  ! LaTeX Error: Missing \begin{document}.  See the LaTeX manual or LaTeX Companion for explanation. Type  H <return>  for immediate help.  ...                                                l.1 ï      »¿%\documentclass[10pt]{article} ? x No pages of output. Transcript written on file.log.     LaTeX Compilation Report (Pages: 0)  Errors: 1   Warnings: 0   Bad Boxes: 0      Any help is appreciated.   Thanks in advance

Unicode applies the convention of using a  as signature at the beginning of a text stream, identifying the encoding used within it. The following three bytes at the beginning of a file: EF BB BF, identifies this file as a UTF8 file. Vi and most text editors gracefully ignore this signature. Open office does that as well, but it adds this signature at the beginning.  Now, if I open a TeX file with OpenOffic.org, and I do that quite a lot (for mixed directionality editing), the signature is added, and baffles LaTeX, which produces an error message such as:   ! LaTeX Error: Missing \begin{document}.   See the LaTeX manual or LaTeX Companion for explanation.  Type  H <return>  for immediate help.  ...                                                l.1   ��\documentclass{article}   whereas a simple dump of the file does not show the problem. Is there a way to eliminate this problem, while staying in the realm of latex?


In Fraklin's new Safehouse can you safe 2 cars? Also where do cars go if they disappear from there? And they aren't in the Impound is it a glitch?

How does the garage system in GTA V work? It feels kinda inconsistent at the moment   Will the car I leave at my home garage be saved or will it always be replaced with the "Standard-Car" from the character? How do the additional garages work? If I have car and tune it (--> spending much money into) and then I use and lose it on the way (for example if I have to chase someone on foot) will it be lost forever??   edit:   Whats the point of the depot where you can get some cars back? On what does it depend that a car will be stored there?


12.04 LTS with Windows 7 dual booted.  I installed Ubuntu from windows 7 via WUBI so that I can dual boot both.  When I try to boot Ubuntu the grub menu appears and I am not able to boot Ubuntu  I have some important data stored in it.  grub menu displays this message   GNU GRUB version 1.99.21ubuntu 3.14 minimal BASH-like line editing is supported for the first word ,TAB lists possible command completion, Anywhere else RAB lists possible device or file complete.

I have Ubuntu 12.04 installed through Wubi on my laptop. For some reason when i click on Ubuntu on start up (when you have to either select windows or Ubuntu) I get the following screen, the grub cursor keeps flashing.  Gnu grub version 1.99-21 Ubuntu 3.4   Minimal bash-like line editing is supported. For the first word, tab lists possible command completions. Anywhere else tab lists possible device or file completions.   grub>   Could you tell me what I can do to fix this problem and to start Ubuntu normally?


import java.util.Scanner; public class z { public static void main(String[] args) { String[] arr = {"me", "my", "mine", "i"};     whatIsThis(arr);     for (int k = 0; k < arr.length; k++) {         System.out.print(arr[k] + " ");     }     System.out.println(); }  public static void whatIsThis(String[] arr) {     arr = new String[5];     arr[0] = "I";      arr[2] = "loving"; } }   Why does this code output "me my mine i" instead of "I my loving i" This is a question on my sample final exam and I want to make sure I understand.

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


I would like to know the recommended way to move our code from a SVN repository to a GIT repository, so that we transition our developers team & start using GIT.  Can we do the transition and keep all the commits done in the SVN repository ?  Also, our team is happy with SVN currently, but, they don't know that branching in GIT is much easier than SVN, where can I find a practical example that proves power of GIT in branching ?

I read the Git manual, FAQ, Git - SVN crash course, etc. and they all explain this and that, but nowhere can you find a simple instruction like:  SVN repository in: svn://myserver/path/to/svn/repos  Git repository in: git://myserver/path/to/git/repos  git-do-the-magic-svn-import-with-history \ svn://myserver/path/to/svn/repos \ git://myserver/path/to/git/repos   I don't expect it to be that simple, and I don't expect it to be a single command. But I do expect it not to try to explain anything - just to say what steps to take given this example.


I need to Write an awk command that will return the identification number from the following table for only the lines where the title is Turtle. This table is stored in turtle.txt  Id Num. Title           CatchDate 433417  RedTurtle       2001-06-29 493303  BlueTurtle      1998-09-20 259497  Turtle          1985-05-08 229505  RedTurtle       1994-07-13 473076  OrangeTurtle    2002-03-08 221907  Blueturtle      1999-07-02 457032  Turtle          1993-04-09 490359  RedTurtle       1996-11-12 494595  SnappingTurtle  1985-05-20 402421  BlueTurtle      1999-08-16

I want to print the countries which which have to after ~:.  welcome~:to~:Germany welcome~:no please~:Italy welcome~:to~:Brazil welcome~:not ok~:China   Note: I do not know what will be there other than "to". It can be anything and can be changed (like no please, not ok).  I am tried using cut, awk, sed. But I am unable to figure out.   awk -F "~:" '{print $2 $NF}'   But I get output like:  toGermany no pleaseItaly toBrazil not okChina   How to filter countries other than to.  UPDATE:  Alternative solution:(Figured out with cut) :-)  grep -v "to" |cut -d ':' -f3


Let $f : A \to B$ and $g : B \to C$ be functions.      If $g \circ f$ is injective and $f$ is surjective, then $g$ is   injective.    question that correctly proves this theorem, but my proof seems to be different, so I'd like clarification on whether it's correct.  My Proof  We want to show that, for any $b_1, b_2 \in B$, $g(b_1) = g(b_2)$ iff $b_1 = b_2$.  Let $g(f(a_1)) = g(f(a_2))$, where $a_1, a_2 \in A$.  $\therefore f(a_1) = b_1$ and $f(a_2) = b_2$, where $b_1, b_2 \in B$. (Since $f$ is surjective.)  $\therefore g(b_1) = g(b_2)$, where $b_1 = b_2$. (Since $g \circ f$ is injective.)  $\therefore$ $g$ is injective. $\ \ \ Q.E.D.$  I would greatly appreciate it if people could please review my proof and elaborate on anything I've done incorrectly.

Let $f:A\rightarrow B$ and $g:B\rightarrow C$ be functions, prove that if $g\circ f$ is injective and $f$ is surjective then $g$ is injective.  I need advise or correction if something is incorrect with my proof. Thank you beforehand.  We must show that $g$ is injective, i.e for $x,y\in B, g(x)=g(y)\implies x=y$  Let $x,y\in B$ such that $g(x)=g(y)$. Because $f$ is surjective there exists $a,b \in A$ such that $f(a)=x$ and $f(b)=y$  $\implies g(f(a))=g(f(b))$  $\implies g\circ f(a)=g\circ f(b)$  $\implies a=b$ (by injectivity of $g\circ f$)  $\implies f(a)=f(b)$  $\implies x=y$  Would appreciate any correction in proof writing also!


Let $X,Y$ be normed vector spaces and $B:Y^*\rightarrow X^*$ a linear operator. We want to show that $B$ is $weak*-weak*$ continuous iff $B=A^*$ for some $A \in \mathcal{L}(X,Y)$. My intial idea was to set $A=\iota^{-1}_Y\circ B^{*}\circ\iota_X$ where $\iota:X \rightarrow X^{**}$ is the canonical embedding $x \mapsto ev_x$, the evaluation map of $x$ ie $\iota(x)f=f(x)$. I think this will work except how can I know $\iota^{-1}$ is defined (that is, how can I guarantee $B^*(\iota(x)) \in \iota (Y))?$ If this where Banach space I would be done, but I don't know what to do in this setting. Am I even on the right track? EDIT: I found  but I'm not clear on the setting. It looks to me (admitly naively) they are assuming reflexivity of $Y$ (and, or that $Y$ Banach, which I don't have?

As the title says, the question is how to prove  Let $X,Y$ be Banach spaces. A linear map $S:Y^*\to X^*$ is weak$^*$ continuous if and only if $S=T^*$ for some $T\in B(X,Y)$


Below, in the image, there is a math formula which has a pink underline (namely Ann_{f(A)+J}(J)=0). As you see the alignment isn't acceptable (highlighted). Question.  What command can I use to break the formula to have the alignment acceptable? I don't want to use break commands such as \ \ (since the text or format will probably change).

When I compile my document in LaTeX, some formulas in the document in math mode, between $ $, go into the right margin area beyond all the text.  Is there a way to fix this aesthetic problem?


I have a web page that displays 5 items (each with a headline, image and short content like in a microblog).  Item 1 Item 2 ... Item 5   Based on the query parameter in the URL, I will be sorting the items by date, votes, etc.   I in a dilemma to choose from one of the below solutions to avoid duplicate content issues.    Should I stick with a rel canonical tag to point to the original page from all the pages with query parameters (for sort)?  Or will it be better to disallow robots when query parameters are present in the URL?

Please consider a list of items (forum comments, articles, shoes, doesn't matter) which are spread over multiple pages. Different sort orders are supported (by date, by popularity, by price, etc).  So, an URL might look like this (I use the query style here to simplify things):  /items?id=1234&page=42&sort=popularity  /items?id=1234&page=5&sort=date  Now, in terms of SEO, I think I should be worried about duplicate content. After all, each item appears at least as many times as there are sort orders.  I've seen Matt Cutts talking about the rel=canonical link tag, but he also said that the canonical page should have very similar content. But this is not the case here because page #1 in a non-canonical sort order might have completely different items than page #1 in the canonical sort order. For a given non-canonical page, there is no clear canonical page listing all the same items, so I think rel=canonical won't help here.  Then I thought about using the noindex meta tag on all pages with non-canonical sort order, and not using it on all pages with canonical sort order.  However, if I use that method, what will happen with backlinks that are going to non-canonical pages -- will they still spread their page rank juice, even though the first page googlebot (or any other crawler) is going to encounter is marked as "noindex"?  Can you please comment on my problem and what you think is the best solution?  If you think you have a better solution, please consider that 1) I do not want to use Javascript for this, 2) I do not want all the items to be on one page.  Thank you.


In the setting of linear regression, when we want to test the hypothesis $H_0 : \beta_j = 0$, we can use either t-test or F-test, with test statistics $t = \frac{\hat{\beta_j}}{SE(\hat{\beta_j})}$ and $F = \frac{RSS(m) - RSS(m)}{RSS(M)/(N-P-1)}$ , where $RSS(M)$ is the RSS under the full model, and $RSS(m)$ is the RSS under the model that has $\beta_j = 0$. I know that $F = t^2$, but how to prove it?  Thanks!

I need to show that F test is equal to T test squared, when the T test is for 2 independent groups and assuming variances are equal.  I know that $F=\frac{MSB}{MSW}=\frac{SSB/k-1}{SSW/N-K}$ and I know that $T=\frac{X-Y}{S_p \sqrt{\frac{1}{n}+\frac{1}{m}}}$,   so $T^2=\frac{(X-Y)^2}{S_p^2 ({\frac{1}{n}+\frac{1}{m}})}$  I've seen this proof in Regression but here we're not using MSE and MSR, so i'm not sure how to connect between the two.


I have a string as follows:  "[Monday, Tuesday]"   I want to convert this string to a list of enums of type "Day". My "Day" enum is as follows:  public enum Day {     Monday,Tuesday; }   I obtained my input string by calling toString() on a List of "Day"s. As follows:  List<Day> days = new ArrayList<Day>(); days.add(Day.Monday); days.add(Day.Tuesday);  String input = days.toString();   I know that I can parse the input string by commas and brackets. But, is there any efficient way to do this?  To repeat, I want to covert string to a list of enums.  ** EDIT **  Question is not just about converting String to enum and vice versa. It involves lists and string parsing.

Say I have an enum which is just public enum Blah {     A, B, C, D }  and I would like to find the enum value of a string, for example "A" which would be Blah.A. How would it be possible to do this? Is the  the method I need? If so, how would I use this?


I tried to install Skype by using below commands:  sudo dpkg --add-architecture i386 sudo add-apt-repository "deb http://archive.canonical.com/ $(lsb_release -sc) partner" sudo apt-get update && sudo apt-get install skype   On Ubuntu 16.04 but it shows error saying:  Reading package lists... Done Building dependency tree        Reading state information... Done Package skype:i386 is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source However the following packages replace it: skype-bin:i386  E: Package 'skype:i386' has no installation candidate.   How can I solve the problem and install Skype?

I want to install Skype, but I can't locate it in Software Center or by using Synaptic Package Manager. Can anyone help me?


Apparently all objects have wavelike properties, so, if we kick a football (soccer ball, if you must) through a pair of posts, does the ball in any sense diffract?  If this is ridiculous then let me know and I will delete the question.

Many introductory quantum mechanics textbooks include simple exercises on computing the de Broglie wavelength of macroscopic objects, often contrasting the results with that of a proton, etc.  For instance, this example, taken from a textbook:     Calculate the de Broglie wavelength for      (a) a proton of kinetic energy 70 MeV      (b) a 100 g bullet moving at 900 m/s   The pedagogical motivation behind these questions is obvious: when the de Broglie wavelength is small compared to the size of an object, the wave behaviour of the object is undetectable.  But what is the validity of the actual approach of applying the formula naively? Of course, a 100g bullet is not a fundamental object of 100g but a lattice of some $10^{23}$ atoms bound by the electromagnetic force. But is the naive answer close to the actual one (i.e. within an order of magnitude or two)? How does one even calculate the de Broglie wavelength for a many body system accurately?


I want to completely disable my trackpad, from startup if possible.  The trackpad on my 2013 macbook pro is not working properly anymore. Click/Tap does not register and neither alternate click. I believe the trackpad is in a "always clicking" state because hovering over elements that usually change their color is not triggered either.   Connecting a mouse, even with “Ignore built-in trackpad when mouse or wireless trackpad is present” option enabled, is not working either, the mouse click does not register, only right click works.   Only way I managed to make my mouse work properly was disabling some kexts ( I dont remember which ) and then restarting the computer with the mouse plugged in already. However, after removing the mouse and plugging it back again, it stopped working.  I don't have any possibility to go to a service due to the current situation, so I am looking for any temporary workaround that will allow me to use a mouse.

I have a mid-2007 MacBook Pro, the one with the trackpad that had the physical button on along the bottom edge. The trackpad is not well and using it can cause it to stick and freak out OS X.  Is there a way to disable the trackpad that's a little more low-level than ? A BIOS setting perhaps? I'd like the trackpad to never be useable on the unit, whether an external mouse is connected to it or not.


I have a class that contains some variables.Let's name it "Var" class. In "Var" class i have some variables like int width ,int height and so on. Some classes need this variables in order to work, also this variables are changing. My problem is, when i am creating an object of "Var" class in diffrent classes , each object contains its own int width and int height, and i dont want that.So, how to access variables from "Var" class from multiple classes?

To be specific, I was trying this code:  package hello;  public class Hello {      Clock clock = new Clock();      public static void main(String args[]) {         clock.sayTime();     } }   But it gave the error      Cannot access non-static field in static method main   So I changed the declaration of clock to this:  static Clock clock = new Clock();   And it worked. What does it mean to put that keyword before the declaration? What exactly will it do and/or restrict in terms of what can be done to that object?


I copied my whole HDD from MBPOld to MBPNew, but saw the "Local Objects" Keychain is empty.  I then saw there is a folder in ~/Library/Keychains named like the UUID of the Mac. (which can be retrieved with system_profiler SPHardwareDataType | grep 'Hardware UUID' | awk '{print $3}').  I restarted the Mac in recovery mode (by holding down Cmd + R) and opened up Terminal to rename the folder from OldMBP-UUID to NewMBP-UUID but still the local objects keychain is empty.  Is there any way to get this done?

After preforming a Mavericks-Mavericks migration using Migration Assistant, I have a "Local Items" Keychain on my new machine in which many (perhaps most) items are out of date (using old passwords), and some are missing altogether. While I have access to a copy of the entire contents of the ~/Library/Keychains/ directory from my old machine, which presumably contains all the information I'm missing, I see no way of importing that information into my new machine.  How can I import the "Local Items" from my old Keychain into the Keychain on my new machine?


I read this book when I was very young and I wanted to find it again.  Things I remember:    Male and female humans as main roles Dragons are normal part of the world Riding dragons without proper saddles or doing it in a certain way can lead to major injuries or death Towards the end the whelpling grows up and has its own hatchlings and the two main characters end up taking care of them after the original dragon dies and they have to hide in its belly to survive freezing cold weather. Afterwards they had special eye power things? Like they saw in prism colors or something.

I'm trying to remember the name of a series of books about a boy who works with dragons.  Dragon's blood (or maybe it was slobber?) is acidic, and the children who wrangle these dragons often end up with deep pock marks.  On this world, days are like ours but nights get very cold, requiring anyone stuck outside to find a shelter until dawn (not the false dawn)  The other thing I remember is that in one of the books by slicing open a dragon and spending the night, the character emerged with special dragon powers.


I often see a lot of articles that say that rooting can brick your phone and render it useless like a brick, hence the name brick. But anyone who's ever fiddled around in rooting phones and installing ROMS surely knows that if you fail a ROM installation or root, the device can easily be saved by flashing a clean ROM. So what do all those articles mean by 'bricking'? Is there a way to brick a phone to the point that it doesn't even boot to the bootloader and let you install a custom recovery?

I'm considering unlocking the bootloader on my Verizon Galaxy S3 (SCH-I535).  However, a  I was reading made this statement:     Once you have unlocked your phone’s bootloader using this app, you must not receive any over-the-air (OTA) updates or via Samsung Kies. Doing so will result in bricking your phone.   I understand that bricking a phone means rendering it unusable, but does this also mean unrecoverable?  When a phone is "bricked", does that mean it is virtually impossible to restore it to a working state?  I'm a little concerned about the risk if that is the case.


I know it's easiest on Steam but I got the game from GamersGate which lets you download the game with their own installer. I'm asking about this game specifically because I know it runs on Linux. Is there a way to install it on (X)ubuntu?

Can .exe and .msi files (Windows software) be installed in Ubuntu?


I am a little confused in a specific case with the Big O notation and the Asymptotic behavior of algorithms. While I was reading the blog  that describes these notations very well I came across this statement whether it is true or false:  A O( n ) algorithm is Θ( 1 )  The answer says that this may or may not be true depending on the algorithm. In the general case it's false. If an algorithm is Θ( 1 ), then it certainly is O( n ). But if it's O( n ) then it may not be Θ( 1 ). For example, a Θ( n ) algorithm is O( n ) but not Θ( 1 ).  I am trying a little hard to comprehend this answer. I understand that Big O implies that a program can asymptotically be no worse. So I interpret that above statement where O( n ) is worse than Θ( 1 ) and is true.  Can someone explain with an example?

Sometimes I see Θ(n) with the strange Θ symbol with something in the middle of it, and sometimes just O(n). Is it just laziness of typing because nobody knows how to type this symbol, or does it mean something different?


If somebody calculated the electric flux of the entire universe, would it be zero?  I got this question from a quote that each "electrical state super induces the other" (By Ralph Waldo Emerson). This lead me to question is there an equal distribution of positive and negative charges in the universe?  To put it in another way; for example, taking: Newton's Law of Action and Reaction, for each positive charge created there should be an equal and opposite charge.

I've always wondered why the number of protons in the Universe exactly matches the number of electrons. They are such different particles with totally different cross sections. So, first of all, is this true? And, secondly, how could it be that they have been produced in the same amount after the Big-Bang?


We have a hp pavilion v72 desktop computer from the year 2004. It had Windows XP running on it,  and we have been trying to install Linux on it.   After Ubuntu, we tried to install the 32 bit version of Lubuntu 13.10 from a disk image downloaded directly from the lubuntu.net web page, and it said it was successfully installed but after re-start it doesn't start the graphical user interface, eg. the screen remains black after the spash screen. The same happens, when we choose the option "Try Lubuntu". The computer's specifications meet the requirements of the lubuntu distribution. It has two graphic cards, one onboard, which can't be disabled in the bios and another one, which is configured as primary display adapter in the bios. The system can be booted to root shell and everythings appears to be fine, but when x-windows is started, the computer again hangs with an empty screen.  Do you have any suggestions, if trying another linux distribution (like xubuntu) might potentially solve the problem? Until recently, when we wiped the windows xp system, the computer worked perfectly well, so we don't assume, that the computer's hardware is defective.  Many thanks.  Anne

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


How could I add metadata and tags to folders? I know that I can add metadata and tags to files supported by File Explorer. For unsupported files, I use , but it seems not supporting adding metadata and tags for folders. I'm using Windows 10.    There's  that's asking about adding files/folders metadata for Windows 7. My question is asking about adding metadata as well as tags specifically for folders on Windows 10.

I want to tag different file types (i.e. .pdf, .epub, .iso, .bin, folders,..) using the same descriptive fields. For example i would like a metadata field "type" which would be "eBook" on pdf- and epub-files, "CD-Image" on iso- and bin-files.  I read about Alternate Data Streams (ADS) to make this possible. Does anyone know a good program for Windows 7 to tag different files and search for them? It is important for me, that the metadata is NOT stored in a separate database. I move the files a lot and need to stay flexible (ADSs 'stick' to the files).  Any ideas?


I am trying to prep myself for data science interview & I saw the following question on a forum  You have several variables that are positively correlated with your response, and you think combining all of the variables could give you a good prediction of your response. However, you see that in the multiple linear regression, one of the weights on the predictors is negative. What could be the issue?  My guess is this could be due to multicollinearity, but I am not sure. Can some body help?  Any help will be appreciated

Imagine   You run a linear regression with four numeric predictors (IV1, ..., IV4) When only IV1 is included as a predictor the standardised beta is +.20 When you also include IV2 to IV4 the sign of the standardised regression coefficient of IV1 flips to -.25 (i.e., it's become negative).   This gives rise to a few questions:   With regards to terminology, do you call this a "suppressor effect"? What strategies would you use to explain and understand this effect? Do you have any examples of such effects in practice and how did you explain and understand these effects?


I have a question which i could not figure out the answer to, it was the hardest of them all that i got and i couldnt figure it out, its a proof of fibonaccis serie using matrixes and i need som help  The question: The Fibonacci Numbers are recursively defined as $f_0 = 1$, $f_1 = 1$ and $f_{n+2} = f_{n+1} + f_n,$ for all $n ≥ 0$. Set $M = \binom{1\quad1}{1\quad0}$ and consider the powers $M, M^2, M^3,$ ... of this matrix. Prove that $M^n = \binom{f_n\quad f_{n-1}}{f_{n-1}\quad f_{n-2}}$ for all $n ≥ 2$. Powers of a matrix are the products $M^0 = I,\quad M^1 = M,\quad M^2 = M*M,\quad M^3 = M*M*M, . . . .$  can someone help and show me how to do this please? the proof

$$\begin{pmatrix}1&1\\1&0\end{pmatrix}^n=\begin{pmatrix}F_{n+1}&F_n\\F_n&F_{n-1}\end{pmatrix}$$  Somebody has any idea how to go about proving this result? I know a proof by mathematical induction, but that, in my opinion, will be a verification of this result only. I tried to find through the net, but in vain, if someone has some link or pointer to its proof, please provide, I'll appreciate that.  Thanks a lot!


I want my pc to hibernate even when I press "shut down".  Either that, or simply remove the "shut down" button from the start menu.  Is there a way to do any of these?

I want my PC to hibernate when I press shutdown (exactly shutdown button) but I don't know how can I modify something like registry or group policy to achieve my goal. Is there any way to do that?


Python 2.7.13 Windows AMD64  Having trouble handling a JSON file using \u Unicode format.  Test Case  import json  testJ = json.load(open("simple.json")) print(testJ['a'])   simple.json  {"a": "\u00AA"}   output  ┬¬   desired output  ª   How do I get the desired output using Python? If I use jq tool  jq ".a" < simple.json   I get the expected output

When I try to print a Unicode string in a Windows console, I get an error . UnicodeEncodeError: 'charmap' codec can't encode character .... I assume this is because the Windows console does not accept Unicode-only characters. What's the best way around this? Is there any way I can make Python automatically print a ? instead of failing in this situation? Edit:  I'm using Python 2.5.  Note: @LasseV.Karlsen answer with the checkmark is sort of outdated (from 2008). Please use the solutions/answers/suggestions below with care!!  is more relevant as of today (6 Jan 2016).


What is the difference between the phrase "They won't let me go." and "They don't let me go." Is the latter correct?

When do we use each of the following?     I don't want to ...      I won't want to ...      I wouldn't want to ...


After Palpatine became Chancellor, why not hedge his bets by getting DNA from Anakin and secretly cloning an army of super-Force-sensitive warriors pre-programmed to serve only him? A Sith master must always worry about their apprentice turning on him, and the Kaminoans were shown capable of programming genetic orders into their clones that could not be disobeyed. Plus, the Anakin Clone Army could be ready in about 10 years which would not be too long for his plans.

Just seen a picture of Vader Force-choking a trooper. And then I started wondering: what if they had cloned a Sith (or a Jedi). Would the clones have the Force? Specifically, would they have the same Force as the original?


I just started learning python. I come from C++/Java background. To understand two dimensional arrays. I have written the following snippet  x = [[0]*3]*3 for i in range(0,3):    for j in range(0,3):       x[i][j] = i+j  for i in range(0,3):    for j in range(0,3):       print x[i][j],    print ""   Why is this program printing  2 3 4 2 3 4 2 3 4   instead of my expectation  0 1 2 1 2 3 2 3 4   I thought about the reason for this and I am not able to conclude anything. Is this something to do with reference variables?

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


I'm new to Ubuntu. Whenever I try to install anything using sudo on my PC, it shows:  The following packages have unmet dependencies:     google-chrome-stable : Depends: libappindicator1 but it is not going to be installed   I tried the following commands:  sudo apt-get clean sudo apt-get autoclean   but none of them worked. Please tell me how can I fix this error.  P.S.: I'm using Ubuntu 16.04 LTS (Xerial Xenus).  Such as when I try to install VirtualBox:  user@User:~/Desktop$ sudo apt-get install virtualbox Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies:  google-chrome-stable : Depends: libappindicator1 but it is not going to be installed  virtualbox : Depends: virtualbox-dkms (>= 5.0.40-dfsg-0ubuntu1.16.04.1) but it is not going to be installed or                        virtualbox-source (>= 5.0.40-dfsg-0ubuntu1.16.04.1) but it is not going to be installed or                        virtualbox-modules               Depends: libgsoap8 but it is not going to be installed               Depends: libvncserver1 (>= 0.9.10) but it is not going to be installed               Recommends: virtualbox-qt (= 5.0.40-dfsg-0ubuntu1.16.04.1) but it is not going to be installed               Recommends: libqt4-opengl (>= 4:4.5.3) but it is not going to be installed E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).   I am not able to install anything. Plus, my Chrome is installed and working. However, when I try to install it with sudo, this error occurs:  ~/Desktop$ sudo apt-get install google-chrome-stable_current_amd64.deb Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package google-chrome-stable_current_amd64.deb E: Couldn't find any package by glob 'google-chrome-stable_current_amd64.deb' E: Couldn't find any package by regex 'google-chrome-stable_current_amd64.deb'

I installed Ubuntu 16 desktop a few weeks ago. Added Chrome and all fine. However now when I try sudo apt-get install ffmpeg, I get this error message:  Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies:  google-chrome-stable : Depends: libappindicator1 but it is not going to be installed E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).   What's the problem and what should I do?


I am from India and I came to Spain for business meetings. My plan was to stay for one month [but found out the business will be closed for one week for Christmas]. My visa is valid from 2nd December 2016 to 15 January 2017; the duration of stay is 30 days. I arrived in Barcelona on the 4th of December, per the visa, and I planned to leave by the 4th of January. I want to extend the stay until the 14th of January.   How do I apply for a visa extension? Is it actually necessary to apply for an extension since I am leaving before the expiry date on the visa (15 January)?

My daughter applied at the Italian Consulate in Philadelphia, and they gave her two entries for 20 days (we thought it was for 20 days each entry). She was in Italy 12 days, then went to England for 1 week and flew to Venice to take a 10-day cruise. She couldn't make it because they said she has only 8 remaining days, but she still has a land tour already paid this week.  What can she do? Can she extend the Schengen visa for 12 more days? Right now, she is in Madrid, but next week she has to fly from Barcelona to Paris to start with the tour. What would happen if she decides to take the tour with the expired visa? She is a US permanent resident.


I was modeling something when suddenly I was unable to pan around using shift + middle mouse.  I tried changing the controls in user preferences, closing and reopening the program, and everything else I could think of, all to no avail.  I'm working with 2.69.  Any help would be much appreciated.  EDIT:  Still not sure what happened, but I copied everything in the file into a new one and now it's working.

When I pan with the Shift + MMB, it doesn't work. I think I might have accidentally pressed some sort of key-shortcut. It works for other views, so it's not my mouse. What sort of shortcut could I have pressed?


I have this float 98.01645 and I'm getting 98.02 with this function:     String lastCredit = String.format("%.2f", AppSingleton.getInstance().credit);  That I want is get 98.01 (only two decimals or not rounded number). I'm trying but I can't get the way to do it work.

What I would like is a method to convert a double to a string which rounds using the half-up method - i.e. if the decimal to be rounded is 5, it always rounds up to the next number. This is the standard method of rounding most people expect in most situations.  I also would like only significant digits to be displayed - i.e. there should not be any trailing zeroes.  I know one method of doing this is to use the String.format method:  String.format("%.5g%n", 0.912385);   returns:  0.91239   which is great, however it always displays numbers with 5 decimal places even if they are not significant:   String.format("%.5g%n", 0.912300);   returns:  0.91230   Another method is to use the DecimalFormatter:  DecimalFormat df = new DecimalFormat("#.#####"); df.format(0.912385);   returns:  0.91238   However as you can see this uses half-even rounding. That is it will round down if the previous digit is even. What I'd like is this:  0.912385 -> 0.91239 0.912300 -> 0.9123   What is the best way to achieve this in Java?


It never works. And when I do a var dump on the sql query I see that the question marks are still in it. Which means that the values have not been binded right?  I don't understand why it's not binding the values.  Can anybody help me out?  PHP  $ruleValue = "value1"; $input = "value2"; $inputValue = "value3";  $this->_db->query('SELECT * FROM ? WHERE ? = ?', array($ruleValue, $input, $inputValue));   Method  public function query($sql, $params = array()) {     $this->_error = false;      if($this->_query = $this->_pdo->prepare($sql)) {         $x = 1;         if(count($params)) {             foreach($params as $param) {                 $this->_query->bindValue($x, $param);                 $x++;             }         }          if($this->_query->execute()) {             $this->_results = $this->_query->fetchAll(PDO::FETCH_OBJ);             $this->_count = $this->_query->rowCount();         } else {             $this->_error = true;         }         var_dump($this->_query);     }      return $this; }   var_dump  object(PDOStatement)#5 (1) { ["queryString"]=> string(27) "SELECT * FROM ? WHERE ? = ?" }

Why can't I pass the table name to a prepared PDO statement?  $stmt = $dbh->prepare('SELECT * FROM :table WHERE 1'); if ($stmt->execute(array(':table' => 'users'))) {     var_dump($stmt->fetchAll()); }   Is there another safe way to insert a table name into a SQL query? With safe, I mean that I don't want to do  $sql = "SELECT * FROM $table WHERE 1"


I am  developing an iphone app which ask for one time set up details like user name in the first two screens when the user launches the app for the first time. I dont want these 2 screens to come up when I am launching the app once the user has given the details.   I tried getting the info from internet but I was not able to how to find it out. May be I am missing the technical term or wordings involved in doing this. Could any one please help in accomplishing this scenario. Any sample code would be very helpful.  Thanks for your time

How do I detect when an iOS app is launched for the first time?


So I decided to have a little fun today and try to find the answer with the most down-votes on a few Stack Exchange sites. Pretty simple I just search for:     is:answer   Sort by votes and clicked the last page. This seemed to work fine on Stack Overflow, but I noticed it did not when I tried it on Code Review. I figured at first that perhaps deleted answers were somehow included in the pagination, but I also tried this on Meta Stack Overflow and Software Engineering, and noticed the same thing: using my search method, there are no answers found after page 666, no matter how many pages of answers I see.  Have I discovered an obscure bug (feature?), or is my search perhaps cursed?

If you make a search for something that returns more than 10,000 items in result. For example, search for  return 161,338 results on MSE. But if you select a page where 10,000+ result should be shown:        In the edge case  shows zero results:        But this is actual for any page where per_page * page_number is more than 10,000.  Though this does not happen for Stack Overflow in English. It looks like all other sites are affected.  Related bug report on ruSO.meta:


How do I resolve the Unindent does not match any other indentation level syntax error in line 3 of this code?  if userInput==1:    oneD() elif userInput==2:     twoD() elif userInput==3:     threeD() elif userInput==4:     fourD() elif userInput==5:     fiveD()

When I compile the Python code below, I get      IndentationError: unindent does not match any outer indentation level     import sys  def Factorial(n): # Return factorial     result = 1     for i in range (1,n):         result = result * i     print "factorial is ",result     return result   Why?


I am just using the regular library ( not pytest) and trying to confirm a ValueError.   test:  data = get_time_zone("sun/10-21 tz:US/Eas2tern")    Result:  if zone not in pytz.all_timezones:     raise ValueError("Invalid Time Zone Used: " + time_zone)  >>> ValueError: Invalid Time Zone Used: US/Eas2tern   I would like to test it with a similar structure;  Assert "valueError"  etc...

How does one write a unittest that fails only if a function doesn't throw an expected exception?