don't know why but background color doesn't work. It disappeared after i added float:right. Hope you can help me. Thank you!   body {   margin: 0; }  #wrapper {   margin: auto;   width: 920px; }  #wrapper #menu {   background-color: #B8B8B8; }  #wrapper #menu ul {   margin: 0;   padding: 0; }  #wrapper #menu ul li {   display: inline; }  #wrapper #menu ul li a {   text-decoration: none;   float: right;   padding: 10px; }

Although elements like
s normally grow to fit their contents, using the float property can cause a startling problem for CSS newbies: If floated elements have non-floated parent elements, the parent will collapse. For example:

Div 1

Div 2

    The parent div in this example will not expand to contain its floated children - it will appear to have height: 0. How do you solve this problem? I would like to create an exhaustive list of solutions here. If you're aware of cross-browser compatibility issues, please point them out. Solution 1 Float the parent.

Div 1

Div 2

    Pros: Semantic code. Cons: You may not always want the parent floated. Even if you do, do you float the parents' parent, and so on? Must you float every ancestor element? Solution 2 Give the parent an explicit height.

Div 1

Div 2

    Pros: Semantic code. Cons: Not flexible - if the content changes or the browser is resized, the layout will break. Solution 3 Append a "spacer" element inside the parent element, like this:

Div 1

Div 2

    Pros: Straightforward to code. Cons: Not semantic; the spacer div exists only as a layout hack. Solution 4 Set parent to overflow: auto.

Div 1

Div 2

    Pros: Doesn't require extra div. Cons: Seems like a hack - that's not the overflow property's stated purpose. Comments? Other suggestions?


I'm trying to add an element to the circular linked list but it throws NullPointerException whenever I try to access the node. Here's my code: EDIT: I already read the post explaining NullPointerExceptions but nothing worked.  public class CircularLinkedList<T> { static private class Node<T> {     public T data;     public Node<T> next;      Node(T data, Node<T> next) {         this.data = data;         this.next = next;     } }  private Node<T> first;  public void addFirst(T x){     if (first.data.equals(null)){         first.data = x;         first.next = first;     }else{         Node<T> second = first;         first.data = x;         first.next = second;     } }   EDIT: I already initialized the Node with private Node<T> first = new Node(null, null);, keeps throwing the error. Also compared with first.data == null, now it terminates the process.  EDIT:Here's the full code:  public class CircularLinkedList<T> {     static private class Node<T> {         public T data;         public Node<T> next;          Node(T data, Node<T> next) {             this.data = data;             this.next = next;         }     }      private Node<T> first = new Node(null, null);      public void addFirst(T x){         if (first.data == null){             first.data = x;             first.next = first;         }else{             Node<T> second = first;             first = new Node(x, second);         }     }      public void print() {         while (first.data == null) {             System.out.println(first.data);             first = first.next;         }     }      public static void main(String[] args) {         CircularLinkedList<String> lst = new CircularLinkedList<String>();         lst.addFirst("Z");         lst.addFirst("A");         lst.addFirst("B");         lst.print();     } }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


For every family A of subsets in X there exists a unique minimal σ-algebra containing A. How do we prove this ? Can somebody help me please ?

It is well-known that:     Given a set $X$ and a collection $\cal S$ of subsets of $X$, there exists a $\sigma$-algebra $\cal B$ containing $\cal S$, such that $\cal B$ is the smallest $\sigma$-algebra satisfying this condition.   Certain texts, Lieb and Loss, Analysis, for instance, state that the proof of this assertion requires transfinite induction. On the other hand, one can define $\mathcal B$ to be the intersection of all $\sigma$-algebras containing $\cal S$. Which statement is correct? Or, is there a hidden transfinite induction contained somewhere?  I must confess here that I have only vague ideaos of the rigorous set-theoretic foundations of mathematics.


I understand frequency depicted as an oscillation over time, (sound pressure, pendulum swing, etc.). What then can be meant by the frequency of a photon, which we think of as traveling in a straight line (not a wave) and having a fixed energy level?

in classical physics frequency represents how many cycles in one unit time, but I do not know how we define a frequency for a particle? what does it mean for a particle to have a frequency, the book I read it from just says Energy is proportional to the frequency of the photon but where is frequency?


Let $e_n$ be $(1+\frac{1}{n})^{\frac{1}{n}}$. Let $E_n$ be $\sum_{k=0}^{n} \frac{1}{k!}$. Suppose the convergence of $(e_n)$ and $(E_n)$ are established and let $e =lim_{n\to\infty}(e_n)$.  By Binomial Theorem, $$e_n = 1+1+\frac{1}{2!}(1-\frac{1}{n})+\ldots+\frac{1}{n!}(1-\frac{1}{n})(1-\frac{2}{n})\ldots(1-\frac{n-1}{n})$$ Let $\epsilon >0$. Since $e =lim_{n\to\infty}(e_n)$, there exists $N \in \mathbb{N}$ such that for each $n\ge N$, $|e_n-e| < \epsilon /2$.  I was trying to show that there exists $N_2 \in \mathbb{N}$ such that $|E_n-e_n| < \epsilon /2$, but I failed.    How to prove that the two sequences converge to the same limit?

Here's the problem: Let $x$ be any real number. Show that $$ \lim_{m \to \infty} \left( 1 + \frac{x}{m} \right)^m = \sum_{n=0}^ \infty \frac{x^n}{n!}  $$ I'm sure there are many ways of pulling this off, but there are 3 very important hints to complete the exercise in the desired manner:   Expand the left side as a finite sum using the Binomial Theorem. Call the summation variable $n$. Now add into the finite sum extra terms which are $0$ for $n>m$, in order to make it look like an infinite series. What happens to the limit on $m$ outside the series?   So far I was able to use Hint 1 to expand the left side: $$ \lim_{m \to \infty} \left( 1 + \frac{x}{m} \right)^m = \lim_{m \to \infty} \sum_{n=0}^m \binom {m}{n} \left( \frac{x}{m} \right)^n $$  No matter what I do with the binomial coefficients and factorials, I can't figure out what extra terms to add per Hint 2. Any suggestions?


Show that $$\lim_{n \to \infty} \sum\limits_{k=1}^n \frac{n}{n^2+k^2} = \frac{\pi}{4}.$$  I am familiar with Taylor series and Fourier series of the standard functions. I tried to compare with those and see if there is a relation, I don't seen to find any. How do I tackle this?

How to compute this limit:  $$\lim_{n\to\infty}\left(\frac{n}{n^2+1^2}+\frac{n}{n^2+2^2}+\cdots+\frac{n}{n^2+n^2}\right)$$  Please give me some hint.


Find the last $3$ digits of $3^{352}$ ?  Apart from , any other way of solving it ?

I was wondering if there is a simpler way to find the last to digits of a power such as $3^{45}$. I reduced it modulo 100 to get the answer, which is 43. But I was curious if there was a simpler, or more eloquent way to get this result.  Here's my method:  Using the fact that $3^4=81\equiv -19 \pmod{100}$ and $19^5=2,476,099\equiv -1 \pmod{100}$  $$ 3^{45}\equiv 3(3^4)^{11}\equiv 3(-19)^{11}\equiv 3(-19)(19^5)^2\equiv 3(-19)(-1)^2 \equiv -57 \equiv 43 \pmod {100} $$  I just felt like this was sort of a messy way to find out that the last two digits are 43.


I have a problem. I mad an software application and everything is running perfectly, however i found out that it is unsafe to use because i didnt prevent SQL-Injections. I googled a bit and found that you could you mysql_real_escape_string. However if i add this around a variable in my php file the whole php file will stop working properly. Does anybody know how to fix this?  Here is a example php-file that i am using:      <?php             $server = "";             $username = "";             $password = "";             $database = "";             $con = mysql_connect($server, $username, $password) or die ("Could not connect: " . mysql_error());             mysql_select_db($database, $con);             $id = $_GET['id'];             $sitze = $_GET['sitze'];             $farbe = $_GET['farbe'];             $kennzeichen = $_GET['kennzeichen'];             $automarke =$_GET['automarke'];             $rauchen = $_GET["rauchen"];             $essen = $_GET["essen"];             $trinken = $_GET["trinken"];                                 //Insert Fahrten             $sql = "INSERT INTO fahrzeuge (sitzplaetze, farbe, kennzeichen, automarke, rauchen, essen, trinken, user_user_id) VALUES ('$sitze','$farbe','$kennzeichen','$automarke','$rauchen','$essen','$trinken','$id')";             if (mysql_query($sql) === TRUE) {                 $records[] = "success";                 $idfahrt= mysql_insert_id();                 $records[] = $idfahrt;             } else {                 $records[] = "Es ist ein Fehler aufgetreten!!";             }                    //end Insert Fahrten              mysql_close($con);         echo $_GET['jsoncallback'] . '(' . json_encode($records) . ');'; ?>

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


How to solve this SDE: $dX(t)=X^\alpha(t)dt+\sigma X(t)dW(t), for X(0)=x_0$ $dW(t)$ is Wiener process.  Also I have to use $f(t)=X(t)exp(-\alpha W(t)+1/2\alpha^2t)$ as integration factor.  I tried to solve it looking at solutions of other SDE, but can't find the way for solving non-linear one as I started studying SDE just recently.   The only idea I have is to multiply both sides by integration factor. But what I can do with non-linear part?

How to do stochastic integration $dS = a S^b dt + c S dW$, where $a$, $b$ and $c$ are constant, $b > 0$, and $W$ is the Wiener process.  I know how to do integration for $dS = aS dt + cS dW$, or $dS / S = a dt + c dW$:  According to Ito's lemma, for $dx = \mu dt + \sigma dW$, and $f(t,x)$,  $$df(t,x) = (\frac{\partial f}{\partial t} + \mu \frac{\partial f}{\partial x} + \frac{1}{2} \sigma^2 \frac{\partial^2f}{\partial x^2} ) dt + \sigma \frac{\partial f}{\partial x} dW  $$  Submitting in $S\rightarrow x$, $aS \rightarrow \mu$, $cS \rightarrow \sigma$, and $ln(S)\rightarrow f(t,x)$, will get:  $$d[ln(S)] = (a - \frac{1}{2} c^2) dt + c dW$$  , then we'll have $$S(t) = exp[(a - \frac{1}{2} c^2) t + cW_t]$$  But if $S^b$ is introduced, how could I solve it?


It just strikes me as very odd that all representations of the actual physics of NPN transistors in textbooks is perfectly symmetrical, yet neither the diagram used to represent them nor the mathematical model used to simulate them seem to reflect that.  Could someone explain where and how the symmetry disappears when going from the physical model to the mathematical one ? Is that asymmetry not important enough that it's just not worth depicting it ?  Here's an example of what I mean :    (source: )

What will happen if for a BJT transistor, it's emitter terminal is treated as collector and collector as emitter in a common emitter amplifier circuit?


I would like to clean up disk space used by old versions of QGIS.    Can I use the Windows Uninstaller without damaging the current installation or should I only delete the directory in the Programs folder?    The screen shot of my installed versions is shown in the picture.

I have installed up to 2.6.1 of QGIS on my computer.    Is it recommended that i remove all older versions or will it cause conflicts if they remain?


In latex, how can we ensure that a figure is placed nearest to the place where it was defined or before?   The issue I'm getting is that sometimes many of many figures are getting on the same page which make it very confusing

Is there any package or a method to force LaTeX to keep floating environments like table and figure closer to where they are declared?


As the title states, I'm trying to prove that the series $ \sum\limits_{n=1}^{\infty} \frac{(-1)^{\left \lfloor{\sqrt{n}}\right \rfloor}}{n}$ is not convergent. I managed to bring it down to: $ S = \sum\limits_{n=0}^{\infty} (-1)^n \left( \frac{1}{n^2} + \frac{1}{n^2+1} + \ldots + \frac{1}{(n+1)^2-1} \right) = \sum\limits_{n=0}^\infty (-1)^n b_n$, but I cannot prove that $b_n$ is monotonically decreasing/increasing.

I have a problem with solving the convergence of $\sum_{n=1}^{\infty }\frac{(-1)^{[\sqrt{n}]}}{n}$ where $[a]$ means floor function of $a$. I've already made the first thep and rewrote it with the $\sum_{n=1}^{\infty }(-1)^{n}\sum_{k=n^2}^{(n+1)^2-1}\frac{1}{k}$, which converges if and only if the previous one converges. Now I want to use Leibniz criterion, but I cannot prove that the second sum in the previous expression is monotonic. Does anyone know how to do it? (I cannot use Riemann integral, we haven't defined it yet)


When trying to select data from a table in Access, I get a java.lang.NullPointerException errror. The code works for other tables though. This is the code that works: //cun is passed as a parameter          try {             ResultSet rs = db.queryTbl("SELECT * FROM tblCustomer WHERE CustomerUName = '" + cun + "';");             while (rs.next()) {                 cusFName = rs.getString("CustomerFName");                 cusSName = rs.getString("CustomerSName");             }             rs.close();         } catch (SQLException ex) {             Logger.getLogger(Customer.class.getName()).log(Level.SEVERE, null, ex);         }  This is the code that doesn't work: //dun is passed as a parameter          try {             ResultSet rsDri = db.queryTbl("SELECT * FROM tblDriver WHERE DriverUName = '" + dun + "';");             while (rsDri.next()) {                 driFName = rsDri.getString("DriverFName");                 driSName = rsDri.getString("DriverSName");             }         } catch (SQLException ex) {             Logger.getLogger(Driver.class.getName()).log(Level.SEVERE, null, ex);         }  The error takes me to the line: ResultSet rsDri = db.queryTbl("SELECT * FROM tblDriver WHERE DriverUName = '" + dun + "';");  Please can you help?

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


This might be repetitive, but I haven't found a solution that serves my purpose 100%. What I'd like to achieve is to have a script (or SP) that'll list all tables that a user has permissions on. Any insight will be helpful.  PS: I'm not very good with TSQL. :(  Thanks a lot.

We have a SQL Server 2008 database and have restricted all tables and views away from a specific user ID.  Over the years we have granted back tables and views one at a time based on user need.    We had to do it this way because the vendor provides read/write access to the public role out of the box, so we had to create a role for this user, remove all access and grant back only what they needed.    Today we are going to create a replicated database containing only these tables and views so the user can run reporting on without degrading the production system.  The issue is I'm not sure what tables and views this user has access to, because many people have granted access one at a time over the years.  Is there a query to check this users access?  PS Im an apps developer so please feel free to explain this as elementary as needed.    EDIT - How the role and access was originally created    ------------------------------ -- CREATE ROLE db_finrep_deny ------------------------------  DECLARE @RoleName sysname set @RoleName = N'db_finrep_deny' IF  EXISTS (SELECT * FROM sys.database_principals WHERE name = @RoleName AND type = 'R') Begin     DECLARE @RoleMemberName sysname     DECLARE Member_Cursor CURSOR FOR     select [name]     from sys.database_principals      where principal_id in (          select member_principal_id          from sys.database_role_members          where role_principal_id in (             select principal_id             FROM sys.database_principals where [name] = @RoleName  AND type = 'R' ))      OPEN Member_Cursor;      FETCH NEXT FROM Member_Cursor     into @RoleMemberName      WHILE @@FETCH_STATUS = 0     BEGIN          exec sp_droprolemember @rolename=@RoleName, @membername= @RoleMemberName          FETCH NEXT FROM Member_Cursor         into @RoleMemberName     END;      CLOSE Member_Cursor;     DEALLOCATE Member_Cursor; End GO -- dropping the role itself IF  EXISTS (SELECT * FROM sys.database_principals WHERE name = N'db_finrep_deny' AND type = 'R') DROP ROLE [db_finrep_deny] GO   ------------------------------ -- Grant access (read/write/select/upd) to only select tables ------------------------------ CREATE ROLE [db_finrep_deny] AUTHORIZATION [dbo] GO exec sp_addrolemember 'db_finrep_deny', 'finrep' GO  -- run the dynamic sql generated by this statement select  'DENY SELECT, INSERT, UPDATE, DELETE ON '         + ss.name         + '.'         + st.name         + ' TO db_finrep_deny;' from sys.tables st inner join sys.schemas ss on st.schema_id=ss.schema_id where st.name not in ('TABLE1','TABLE2','TABLE3','TABLE4') order by ss.name, st.name;  grant select on dbo.vwFINMASTER to db_finrep_deny;     Aaron - this is what I get when I run your query, it shows only views, but no tables    (No column name)    name    permission_name dbo     dtproperties    REFERENCES dbo     vwFINMASTER     SELECT dbo     vwLEDGERVIEW    SELECT


Passage:  by Mark Shepherd, page 146. =  Don't read the entire PDF. Sorry, this passage is hard for me to apprehend, so I don't even know what to quote.   :  Which of the following is an unstated assumption made about rural spaces? (a) They are capable of being moved to urban areas (b) They represent the principal area of production (c) They are capable of being contained in arcades (d) They are totally different in character to urban spaces (e) They are specifi cally linked with individual spaces of consumption      (b) CORRECT. It is said that ‘the spaces of production are paradoxically rural spaces located within urban environments’, and a number of references are made to new forms of rural spaces. Given that such references feature in a discussion about production, the assumption must be made that rural spaces represent the principal area of production, otherwise the logic of the argument is lost.      Please simplify this abstract answer (to me) to explain why it's right? Why must we assume this? Moreover, what's the logic of the argument?

Passage:  by Mark Shepherd, page 146. =  Don't read the entire PDF. Sorry, this passage is hard for me to comprehend, so I don't even know what to quote.   :  Which of the following is an unstated assumption made about rural spaces? (a) They are capable of being moved to urban areas  They represent the principal area of production. (c) They are capable of being contained in arcades (d) They are totally different in character to urban spaces (e) They are specifi cally linked with individual spaces of consumption      (a) INCORRECT. It is stated that rural spaces are capable of being moved to urban areas, so this cannot be said to be an unstated assumption. (b) CORRECT. It is said that ‘the spaces of production are paradoxically rural spaces located within urban environments’, and a number of references are made to new forms of rural spaces. Given that such references feature in a discussion about production, the assumption must be made that rural spaces represent the principal area of production, otherwise the logic of the argument is lost. (c) INCORRECT. It is suggested that it is consumption, not production, which takes place within the arcades. (d) INCORRECT. Although it may be the case, it is not a necessary assumption to make that rural spaces are totally different in character to urban spaces. (e) INCORRECT. No fi xed link between rural spaces and individual spaces of consumption is suggested or assumed.      Why's (a) wrong? Where does the passage state that? Why's (c) wrong? Does the passage equate 'rural spaces' with production? Why's (d) wrong? Why's that assumption unnecessary?   This article is too abstract, so please enlarge on and simplify why (b) is right?  What's the logic of the argument?


I want to tame a wild horse or a donkey in Minecraft but I don't really know where to start.

When Minecraft 1.6.1 was released, there were donkeys, mules, and horses added to the game. I have spawned a couple of horses using the spawn egg on creative and tried to ride one but I get thrown off straight away.   I'm guessing that I have to tame it but approaching it with a carrot doesn't seem to cause any reaction. If I try sneaking up behind it the horse just rears up, preventing me from putting the saddle on it.


I know that with iCloud Drive I can sync the Desktop and Documents folder on iCloud. But I wonder if there is a way I can sync other folders on iCloud such as Applications, Photo Library, Downloads, etc.?

I need to sync the Downloads folder to iCloud and then all the downloads should automatically sync with iCloud.   I tried to:   Create a new Downloads folder in the terminal of MacBook in the Documents directory. Tried to move the default Download folder to the newly created folder.   When I tried to use the mv command to move the default Downloads folder to the newly created Downloads folder in Documents in the terminal, it gives permission denied error.  I am trying to achieve what was suggested by user PhillipHolmes in the below thread, please. Thank you:    Thank you


Looking for people to hire, I was wondering if is there any way to search for person of one particular country and maybe contact them.  Is there a place for that ?  Thanks, and sorry if this question is out of topic, I wasn't sure after reading the FAQ.

This was talked about a few podcasts ago. And they referenced some other site that does this.  Currently location is a string but adding a country dropdown (and for the usa a state drop down) could be a great addition to the site.  Then allow for user filtering by country / state.


This question   suggest to ignore them, and while it is an alternative I don't really want to have them moving the .ignore file all that much, seems like dirty to me.   Most of the team members have some sort of configuration in a number of versioned files which are not to be committed to the main branch.  ie. app.config file with the local database etc.   How to deal with these files? They need them to have their environments running but at large they tend to forget to add new files to the repo because they start ignoring modified files.   I was thinking have some sort of script the removes them from the local file system when they compile so they can tell if the whole solution will stil compile or not when pushed into the repo, but I wonder is there is a better solution?

Let's say you have a typical web app and with a file configuration.whatever. Every developer working on the project will have one version for their dev boxes, there will be a dev, prod and stage versions. How do you deal with this in source control? Not check in this file at all, check it with different names or do something fancy altogether?


When viewing my post in edit mode, the code blocks do not have syntax highlighting, even after .  After submitting it,  does have syntax highlighting.   I can also get the syntax highlighting to update in edit mode if I explicitly add the <!-- language: lang-c# --> before the code block, but without it will never update with highlighting.  Is this considered as a bug? Sometimes I take some time to find why the code is not being syntax highlighting and I find it difficult to reviewing my code blocks in edit mode without it.  Update: Syntax highlighting seems to work in the preview when I modify an already-posted post in just about any way {, }, but for new posts it just refuses to work unless given a language hint.

Is syntax highlighting only applied to code after the post is posted?  // test code  for (int i = 1; i < 4; i++) {    s = s + "abc" + 'd' }   Also, will the formatted blocks that were shown as being separate after each time I hit Enter be merged?


I have a SSD 256 GB and a HDD 1000 GB mounted.  I suppose it would be best to use the SSD for standard software and the HDD for user data. Is this the preferred usage? If 256 GB is not sufficient, can I put some of the software on HDD?  How should I partition the disk space for installing Ubuntu?  (no dual boot for Windows or other OS) I'm using gparted.  What kind of formatting should I use?  I'd appreciate a detailed answer as I am new to this.

What partitioning scheme do you recommend for a desktop? I've always created three or four primary partitions -- root, swap, home, and sometimes a separate boot partition. Ubuntu's default install offers LVMs. I've never had to add additional drives or space, so it never seemed like a big deal. Whenever I do a fresh install, though, I always think there might be a better way.


I have a cummulative 3.5 GPA from a top 20 school but a 3.1 GPA in my math classes. In particular I got a BC in linear algebra and a C in abstract algebra. My goal was always to go to graduate school but I fear these two classes are going to crush that. Also my school doesn't allow for retaking of classes (BOO!). Any advice besides the obvious of trying to raise the GPA, ace the GRE, get great letters of recommendation or do research? Or will this be too much to overcome?

When applying to a PhD program in the US, how does the admissions process work? If an applicant is weak in a particular area, is it possible to offset that by being strong in a different area?  Note that this question originated from this . Please feel free to edit the question to improve it.


Is there a mathematical method to figure out what room the Mysterious Stranger will go into next after we previously got him?

When ever I hear the music to indicate the Mysterious Stranger has arrived, I can never find him. It is almost like he is not in the vault.  What is a good way to catch the Mysterious Stranger? Where does he usually show up?


My uncle gave me a hard-drive to troubleshoot. When I plug it to the power and USB the hard-drive does a clicky sound () which sounds kinda weird but it's already a sign of failing. If I incline the disk it stops but this disk can't be detected in Disk Management as well.  This disk is already dead?

My  is not recognized by windows. When I connect it to the computer I do not see "Mass Storage Device" Under "Universal Serial Bus Controller". I already check the troubleshoot and test for everything (Cable is OK, I checked in another computer, etc)  It happen after I connect the Hard Drive to another computer which then I realized it's USB Port was corrupted and problematic.  Is there a way I can fix this Hard Drive? Or any utility which can access this hard disk? When I connect Hard Disk, it turned On (The Light become green) and it start vibrating.  P.S: I check my drive again SeaTools, but  cannot recognize it too.


So i want to hide all elements and use  $('[id^=option_]').hide();   And that works fine, however it is hiding things i dont want it to hide. I have dynamically generated ids such as  option_1 option_1_form option_2 option_2_form  So as you can see it will also hide the forms. So i was wondering if there was a way to either filter _form out or use a regular expression of some sort for the selector  ('[id^=option_][id$=/[^0-9 ]+/]')   Not that the example would work, but an example of what i mean! This would force the _form to be excluded since it would have to end in a numeric value. If you know of a better way, i am all for it too. I am no jQuery wiz.

I am after documentation on using wildcard or regular expressions (not sure on the exact terminology) with a jQuery selector.  I have looked for this myself but have been unable to find information on the syntax and how to use it. Does anyone know where the documentation for the syntax is?  EDIT: The attribute filters allow you to select based on patterns of an attribute value.


Shokugeki no Soma has hell ton of dishes, and in the anime at least, they all look freaking tasty. Now I understand that there is a difference between anime and reality and due to which, taste and look differs. I also found on internet, that the mangaka of Shokugeki no Soma uses assistance of a pro chef while writing stories.  There are tons of videos on YouTube trying to replicate the dishes, but most of them change the recipe or something while cooking the dish.  Are there videos or pages on the internet where they have exact recipe and same method used in the anime/manga?

I'm reading Shokugeki no Soma and at some points, I thought it would be nice to cook some of these dishes. Unfortunately, I haven't found more than the mackerel burger recipe. I know that not all recipes are published, but I would like to know if there were also other ones that were published.


I have an Acer Nitro 5. I tried installing Ubuntu 18.04, but when I installed it the wifi option was not there. I tried, but I couldn't install the wifi driver.  $ lspci -nnk | grep 0280 07:00.0 Network controller [0280]: Intel Corporation Device [8086:2723] (rev 1a)

My wifi card is an Intel® Wireless-AX200 (802.11/a/b/g/n/ac/ax), Bluetooth® 5, and bluetooth is working. I've tried following various guides, however these drivers are apparently yet to make it into the kernel.  Their product brief states linux is supported:    And yet their driver page has no listing for them:    sudo lshw -c network => mark@m-blade-2019:~$ sudo lshw -c network   *-network UNCLAIMED               description: Network controller        product: Intel Corporation        vendor: Intel Corporation        physical id: 0        bus info: pci@0000:02:00.0        version: 1a        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress msix cap_list        configuration: latency=0        resources: memory:cf300000-cf303fff   *-network        description: Ethernet interface        physical id: 2        logical name: enx0050b6b47e72        serial: 00:50:b6:b4:7e:72        capabilities: ethernet physical        configuration: broadcast=yes driver=cdc_ncm driverversion=22-Aug-2005 firmware=CDC NCM ip=192.168.1.17 link=yes multicast=yes   I'm running kernel version Linux 5.0.0-13-generic, any help is greatly appreciated.  EDIT: results of lspci -nnk | grep 00280 -A3:  mark@m-blade-2019:~$ lspci -nnk | grep 0280 -A3 02:00.0 Network controller [0280]: Intel Corporation Device [8086:2723] (rev 1a)     Subsystem: Intel Corporation Device [8086:0084]     Kernel modules: wl, iwlwifi 03:00.0 Non-Volatile memory controller [0108]: Samsung Electronics Co Ltd NVMe SSD Controller SM981/PM981 [144d:a808] mark@m-blade-2019:~$


A little while ago, I read a novel called "Redshirts" by John Scalzi.  The novel specifically references Star Trek and the redshirt effect - with the statistics and narrative patterns (including fatalities) from Star Trek serving as an in-universe plot point.      Proving that the ship they're on has the same patterns, and for the same reasons (being in or influenced by the script of a tv show)   This got me wondering... Is there, in any version of Star Trek, some in-universe mention of the redshirt effect?  where the characters discuss or reference the fatality statistics among the crew, act superstitious over away missions, or react (whether predicting or denying them) to the kinds of narrative patterns people would react to in real life, but accept in stories?  I know there were a lot of out-of-universe references to, and jokes about, the redshirt effect, but I'm not familiar enough with the stories to recall any in-universe mention.  And the other questions I saw when I looked ask about fatalities, not how they're referenced in-universe - my apologies if I missed this being answered before!

As I channel surfed the other day, I accidentally found an episode of Star Trek TOS, and I settled in to watch it. As always, it was a bad day to be a landing party Red Shirt Security person.    Their apparent lack of skill (training?) made me wonder: Was Red Shirt Security a rotating detail, like K.P. (Kitchen Patrol), that crew members with regular assigned duties were ordered to do when it was their turn, or was it a dedicated branch of Star Fleet like the M.P's (Military Police) are to the US Army?


Why does my .bib entry only show part of the author field? The entry: @misc{pdal_contributors_2018_2556738,   author = {PDAL Contributors},   title = {PDAL Point Data Abstraction Library},   month = nov,   year = 2018,   doi = {10.5281/zenodo.2556738},   url = {https://doi.org/10.5281/zenodo.2556738} }  And use it like: \parencites[]{pingel}[]{pdal_contributors_2018_2556738}  And it shows as:  (Pingel, Clarke ja Mcbride 2013; Contributors 2018),  When it should be:  (Pingel, Clarke ja Mcbride 2013; PDAL Contributors 2018),

I want to list a company name in the author field of a bibliographic entry:  @book{CUDA,   author    = {NVIDIA Corporation},   title     = {NVIDIA CUDA Compute Unified Device Architecture Programming Guide},   publisher = {NVIDIA Corporation},   year      = {2007} }   But the entry keeps showing up "N. Corporation".  Is there a way to get the full author name to show up?  I'm currently using the siam BibTEX style.


I have two solid state HDDs in my computer: one with Windows10 and the other one with Linux. The Windows OS does not see the second HDD (with Linux), because I deallocated it before installing Linux. I also want the Linux OS to not see the fist HDD on which Windows is installed. This is just to make sure that users of one OS could not corrupt the files of the other OS.  What is the proper way to make the HDD with WindowsOS invisible/inaccessible to the LinuxOS that is being run from the other HDD?

I need to hide an NTFS partition from listing in the nautilus. How can I achieve that?   Is there any tool to do that?   And how can I hide files in ubuntu (except . operator)


I'm making an HTTP request to my backend and I receive a JSON from the server, so with the response I set my dataSource like so:    await this.apisService.getList(_token).then((data) => {   this.arrList = data;   this.arrListHelper = data; ...   And if I'm changing something in the arrList, the helper is changing as well, so I made a test function to check different methods I found online and only the JSON parse thing solved my problem. I get why is this is happening I just don't get why these solutions doesn't work:  const _aaa = this.arrList.slice(); const _bbb = Object.create(_aaa); const _ccc = Array.from(_bbb); const _ddd = { ..._ccc }; const _eee = Object.assign({}, _ddd); const _fff = JSON.parse(JSON.stringify(_eee));  this.arrList [0]['Name'] = 'ASD'; console.log(_aaa[0]); // ASD console.log(_bbb[0]); // ASD console.log(_ccc[0]); // ASD console.log(_ddd[0]); // ASD console.log(_eee[0]); // ASD console.log(_fff[0]); // original

What is the most efficient way to clone a JavaScript object? I've seen obj = eval(uneval(o)); being used, but . I've done things like obj = JSON.parse(JSON.stringify(o)); but question the efficiency.  I've also seen recursive copying functions with various flaws.  I'm surprised no canonical solution exists.


how do i access the Ubuntu one folder while using Ubuntu 14?  I am doing a school project and need to solve this.    I have tried searching for it, and can't find it anywhere in the Operating System.  I have also tried updating my software to current, but still no luck.

I have purchase new laptop from Dell with ubuntu 12.04 preinstalled. while connecting to Ubuntu One following occurs and I am not able to sync with Ubuntu One.   WebClientErr u'Error downloading https://one.ubuntu.com/api/account/ - server replied:Not       Found' u'<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML 2.0//EN">\n \n<title>404 Not Found</title>\n\n
 Not Found
\n
The requested URL /api/account/ was not found on this server.
\n
\n<address>Apache/2.2.22 (Ubuntu) Server at one.ubuntu.com Port 443 </address>\n\n'


If yes, can someone point me in the right direction to where to start looking?

I have a program in which I've lost the C++ source code.  Are there any good C++ decompilers out there?  I've already ran across .


I use plpython3u call pdi kitchen.bat execute a job task. subprocess.Popen('PG_inter_exec.bat > pg.log 2>&1', cwd='E:\\temp\\data-integration-83\\', shell=True)  execute in python env is OK. I create a language plpython3u function in Postgresql 13 on windows CREATE OR REPLACE FUNCTION public.f_exec_cmd2(     cmd text)     RETURNS SETOF text      LANGUAGE 'plpython3u'     COST 100     VOLATILE PARALLEL UNSAFE AS $BODY$ import subprocess       process = subprocess.Popen('PG_inter_exec.bat  > pg.log 2>&1', cwd='E:\\temp\\data-integration-83\\'                            , stdout=subprocess.PIPE, stderr=subprocess.PIPE, shell=True) stdout, stderr = process.communicate() return stderr $BODY$;  execute this function, the pg.log display error as followings: E:\temp\data-integration-83>"C:\Program Files\Java\jdk1.8.0_241\bin\java.exe"  "-Xms1024m" "-Xmx2048m" "-XX:MaxPermSize=256m" "-Dhttps.protocols=TLSv1,TLSv1.1,TLSv1.2" "-Djava.library.path=libswt\win64" "-DKETTLE_HOME=" "-DKETTLE_REPOSITORY=" "-DKETTLE_USER=" "-DKETTLE_PASSWORD=" "-DKETTLE_PLUGIN_PACKAGES=" "-DKETTLE_LOG_SIZE_LIMIT=" "-DKETTLE_JNDI_ROOT=" -jar launcher\launcher.jar -lib ..\libswt\win64  -main org.pentaho.di.kitchen.Kitchen -initialDir "E:\temp\data-integration-83"\ /rep:pg_rep /user:admin /pass:admin /job:Test_PG_PDI_JD /param "checkPeriod=1908338"  06:40:04,909 INFO  [KarafBoot] Checking to see if org.pentaho.clean.karaf.cache is enabled 06:40:13,147 INFO  [KarafInstance]  ******************************************************************************* *** Karaf Instance Number: 1 at E:\temp\data-integration-83\.\system\karaf\ *** ***   caches\kitchen\data-1                                                 *** *** FastBin Provider Port:52901                                             *** *** Karaf Port:8802                                                         *** *** OSGI Service Port:9051                                                  *** ******************************************************************************* 六月 04, 2021 6:40:13 上午 org.apache.karaf.main.Main$KarafLockCallback lockAquired 信息: Lock acquired. Setting startlevel to 100 2021/06/04 06:40:13 - Kitchen - Start of run. java.lang.NullPointerException     at org.pentaho.di.core.plugins.PluginRegistry.getPluginId(PluginRegistry.java:689)     at org.pentaho.di.core.plugins.PluginRegistry.getPlugin(PluginRegistry.java:715)     at org.pentaho.di.core.plugins.PluginRegistry.loadClass(PluginRegistry.java:370)     at org.pentaho.di.base.AbstractBaseCommandExecutor.establishRepositoryConnection(AbstractBaseCommandExecutor.java:195)     at org.pentaho.di.kitchen.KitchenCommandExecutor.execute(KitchenCommandExecutor.java:115)     at org.pentaho.di.kitchen.Kitchen.main(Kitchen.java:286)     at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)     at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)     at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)     at java.lang.reflect.Method.invoke(Method.java:498)     at org.pentaho.commons.launcher.Launcher.main(Launcher.java:92) Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=256m; support was removed in 8.0  PG_inter_exec.bat as follows: E:\\temp\\data-integration-83\\Kitchen.bat /rep:pg_rep /user:admin /pass:admin /job:Test_PG_PDI_JD /param="checkPeriod=1908338"   OS: windows 10 pro PDI: 8.3 Postgresq: 13.3.2 JAVA:  jdk1.8.0_241  Thanks!

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


Im arguing with some friends whether it is necessary to put parenthesis around a sum in an integral: can we write $\int_a^b x^2+x ~ \mathrm d x$ or do we need to write $\int_a^b(x^2+x)\mathrm d x$?  My friends are arguing that we are not integrating $f$ but rather the differential form $f\cdot \mathrm d x$. Since this is a product we need parenthesis if $f$ is replaced by a sum.  My argument is, that i see the integral as an operator $\int_a^b \cdot \mathrm dx: L^1\to\mathbb C$, so the full notation would be $\int_a^b (x\mapsto x^2+x)dx$. Both of the suggestions above would then just be shortcuts to save some time and the necessity of paranthesis would then just be an arbitrary cut of how much of a shortcut is allowed.  I think both arguments do have some validation.   So my questions: Do we need them or don't we?

Suppose I want to integrate $f(x)+g(x)$. Can this be written as $\int f(x)+g(x)\, dx$ or are brackets necessary, i.e.  $\int \left(f(x)+g(x)\right) \,dx$?


Today the problem given is, that I want to prevent the hyphenation of all words defined with \newacronym for the glossaries package.  An example of a document that would have HStA break between S and t which is not desired:  \documentclass{article} \usepackage[ngerman]{babel} \usepackage[nomain,acronym]{glossaries} \usepackage[a6paper,textwidth=40mm]{geometry}  \newacronym[sort=HStA]{HStA}{HStA}{Hauptstaatsarchiv}  \begin{document} \gls{HStA} is illustrating the problem. Because with a long wooooooooooooooord \gls{HStA} will be broken with a hyphen. \end{document}   The manual way of doing this would be:  \newacronym[sort=HStA]{HStA}{\mbox{HStA}}{Hauptstaatsarchiv}   The abbreviation can be accessed with \gls{HStA} and is typeset as \mbox{HStA}, so it stays in one line, because it is protected by an \mbox, no matter what.  But is there a way to automate this or tell glossaries by default to not allow breaking abbreviations?

As I have unfortunately recognized, using the abbreviation functionality of the glossaries package leads to undesired hyphenation of longer abbreviation at the end of lines.  The following code is an mwe to demonstrate this behaviour:  \documentclass{scrreprt} \usepackage[acronyms,shortcuts]{glossaries}  \newacronym{RuPhos}{RuPhos}{abbreviation with more than three letters}  \begin{document}  \noindent this is a random text to ensure hyphenation of the abbreviation  word fills the linei  \acs{RuPhos}   this is a random text to ensure hyphenation of the abbreviation  this is a random text to ensure hyphenation of the abbreviation  this is a random text to ensure hyphenation of the abbreviation  \end{document}   Compiling this code with either pdflatex or latex, dvips, ps2pdf leads to "RuP-hos".  I am aware of the possibility to enclose the short form in an mbox to prevent hyphenation  \newacronym{RuPhos}{\mbox{RuPhos}}{abbreviation with more than three letters}   or to manually specify the hyphenation using the following command  \hyphenation{RuPhos}   but I would like to know if there is a more convenient and maybe even automatized way to achieve this.


I have to differenciate between two types of files (RIS-file and bibTex file).  I know how to get the complete filename (example: uploadedfilename = file.filename). But I need to get only the type of the file and my current code only gives me something like this: "uploadedfilename: test.ris".  Is there a way to get only the file type so that I could do something like this:  if(filetype=="ris"):       do some stuff?  Thanks for your help

Is there a function to extract the extension from a filename?


$$\frac{0.314^5}{120}=2.5437065e\!−\!5$$  I did this calculation by my android phone's calculator.  I can't understand the result I got (The RHS of calculation).  Please help. What is this?

I often find this at the bottom of pages.  Page generated in 0.00013899803161621  Sometimes, I come across  Page generated in 9.0122222900391E-5  What does that time mean? I tried searching Wikipedia for E and maths but found the . My guess is E stand for Exponential and -5 is the power it is raised to. And the displayed time is a really small number. But that doesn't make sense when compared to the other time in the question. 0.00013899803161621 is bigger than 9.0122222900391E-5. If it means x times $10^{-5}$, then 9.0122222900391E-5 will be 0.000090122222900391 which is smaller than 0.00013899803161621. What does E stand for?


I have a question concerning u substitution for integrating. Suppose I needed to set $u = 3x^2 + 1$. Then $du = 6x dx$. So why are we incorporating the $dx$ with it?   I understand that $\displaystyle\frac{du}{dx} = 6x$, but I was under the impression that $\displaystyle\frac{du}{dx}$ could not be thought of as a fraction. Its just a way of symbolizing the derivative of $u$ with respect to $x$. But it seems like it is being treated like a fraction because both sides are being multiplied by $dx$.

In the book Thomas's Calculus (11th edition) it is mentioned (Section 3.8 pg 225) that the derivative $dy/dx$ is not a ratio. Couldn't it be interpreted as a ratio, because according to the formula $dy = f'(x)dx$ we are able to plug in values for $dx$ and calculate a $dy$ (differential). Then if we rearrange we get $dy/dx$ which could be seen as a ratio.   I wonder if the author says this because $dx$ is an independent variable, and $dy$ is a dependent variable, for $dy/dx$ to be a ratio both variables need to be independent.. maybe?


I'm trying to figure out how to find a count of the most frequent element in an array of integers. I can think of a few methods that might be helpful but when I get to writing an expression inside the block I get complete lost on how to compare an element with the next and previous element. Any ideas? All help is really really appreciated!!!

How do I find an item in array which has the most occurrences?  [1, 1, 1, 2, 3].mode => 1  ['cat', 'dog', 'snake', 'dog'].mode => dog


I can't figure out what passing by reference and passing by value looks like (I know what they mean in theory). Can you tell me whether the below function is passing arguments by value ore reference? BTW this is my first post :)   var number_1 = 32; var number_2 = 43;  function addition(num1,num2) {     alert (num1*num2) ; }  addition(number_1,number_2); /*is this passing by reference?*/

The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?


I have a simple class named "Trida"  public class Trida {     public double[] append(double[] pole1, double[] pole2){         int length = pole1.length + pole2.length;         double[] pole3 = new double[length];         for (int i = 0; i < pole1.length; i++){             pole3[i] = pole1[i];             pole3[i + 1] = pole2[i];         }         return pole3;     }  public static void main(String[] args) {         Trida trida = new Trida();          double[] pole1 = {1.0, 3.0};         double[] pole2 = {2.0, 4.0};         System.out.println(trida.append(pole1, pole2));     }   When I run this code, terminal said [D@15db9742, but I want print field like that - [1.0, 2.0, 3.0, 4.0] Can you help me?

In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]


I came across someone using the command zcat [filename].gz | less to open a file. What does | generally do when it's using in this manner? I've tried googling the question but haven't found the answer yet.  EDIT: actually the answer is here:

I often see tutorials online that connect various commands with different symbols. For example:  command1 |  command2 command1 &  command2 command1 || command2     command1 && command2   Others seem to be connecting commands to files:  command1  > file1 command1  >> file1   What are these things? What are they called? What do they do? Are there more of them?    .


If a person has already eaten one Devil Fruit, what will happen to him if he eats another Devil Fruit?

Can Blackbeard consume more than just one Devil Fruit? If yes, then what is the upper limit?  When he reaches the maximum number of Devil Fruits, can he change them, i.e. can he lose one of the Devil Fruits to consume a new one?


How many solutions are there to $x_1 + x_2 + ... + x_n = S$ for given $S$ assuming that $0 \le x_i \le 25$? I can solve it when there are no constraints on $x_i$ other that $x_i$ must be non-negative.

I think there are $\binom{b+ c - 1}{c-1}$ ways to distribute $b$ balls in $c$ containers. (Please correct me if that's a mistake.) How does this change if I am not allowed to place more than $n$ balls in any given container?  If we call this number $N(b,c,n)$ then I can come up with  $$N(b,c,n) = \sum_{k=0}^n N(b-k, c-1, n)$$  with the base cases  $$N(b,c,n) = \binom{b+ c - 1}{c-1}$$  for $n\geq b$, and  $$N(b,c,n) = 0$$  for $n<b/c$.  Is there some better way of writing this than that recursion relation?


How I can turn off the Two-Step verification, it's driving me crazy.  here is ICLOUD security settings from my MacBook Pro-2015   As you can see from the below pictures I don't have the option to turn off the two-Factor authentication.    Another screenshot of my ICLOUD's security

How to disable Apple’s Two-Factor Authentication for macOS?   Older Macs do not support Two-Factor Authentication. As a side-effect, a user cannot access their iTunes account in iTunes on any older Mac, and cannot buy music.


I am new to PostgreSQL, so please ignore if my question sounds stupid. Imagine we have three databases in PostgreSQL and someone mistakenly ran a TRUNCATE command an hour ago on one of the databases. Now we want to do a PITR for that database alone, since there is an issue with only one database. Is it possible in PostgreSQL to do PITR for one specific database OR it can happen only at instance level? I read the documentation for . It looks like it can only be done at instance level (I guess we say instance as "Database Cluster" in PostgreSQL world, I come from SQL Server world).  As with the plain file-system-backup technique, this method can only support restoration of an entire database cluster, not a subset.  If PITR is not possible at DB level, then how Prod DBAs are handling this situation? Also one last thing, I have a test server with multiple DBs and if PITR is possible at DB level, then please share me the steps so that I can test it myself. I am mainly interested in supported versions of Postgres. My test server is PostgreSQL 9.6.16.

I have PostgreSQL instance with n databases on it. Is it possible to restore just a single database using PITR ? # restore tar xvfz /var/lib/postgresql/db_file_backup.tar.gz -C /var/lib/postgresql/10/main/  # add recovery.conf nano /var/lib/postgresql/10/main/recovery.conf    restore_command = 'cp /var/lib/postgresql/pg_log_archive/%f %p'   recovery_target_time = '2018-02-22 15:20:00 EST'  # start DB sudo systemctl start postgresql@10-main  I see that pg_restore contains dbname parameter. But it's logical. I need to restore to specific Point-In-Time. pg_restore --help pg_restore restores a PostgreSQL database from an archive created by pg_dump. Usage:  pg_restore [OPTION]... [FILE] General options:  -d, --dbname=NAME        connect to database name


Sometimes I come across photos that have some effect/filter applied to them, and I cannot understand/explain what that is. It looks really attractive, and I would like to be able to reproduce this effect in Photoshop or alike. The effect that I am looking for can be seen, for example, . Scroll down to the photos below “About” and “Schedule.”  I would be grateful if somebody could tell the name of this effect/filter and maybe share some recipe or just a link where I could read about it.  Thank you!  Regards, Ivan

How to get a vintage/dreamy look like this photo?   It has some yellow color cast and seems like extra blur added in post process?


So, there are two 'almost' similar structure in 'C' code  1st:  struct P1 {     int i;     char c;     char d;     int e; }; printf("3. size of struct is, %d\n", sizeof(P1));   Gives a console Output: 3. size of struct is, 12  2nd:  struct P2 {     int i;     char c;     int e;     char d; }; printf("4. size of struct is, %d\n", sizeof(P2));   Gives the console output: 4. size of struct is, 16  Can anyone explain the discrepancy? (Even though both the struct have 2 int and two char)  Thanks in advance!

Why does the sizeof operator return a size larger for a structure than the total sizes of the structure's members?


On my desktop I have a folder called biblatex containing two files I am working with: biblatex.tex and biblatex.bib. This should be my setup to become familiar with BibLaTeX. I am using Ubuntu 14.04 with TeX Live 2013 installed. After compiling my files I got this error message:   This is BibTeX, Version 0.99d (TeX Live 2013) The top-level auxiliary file: biblatex.aux I found no \citation commands---while reading file biblatex.aux I found no \bibdata command---while reading file biblatex.aux I found no \bibstyle command---while reading file biblatex.aux (There were 3 error messages)    The files I copied as an example from the web are:  biblatex.tex:  \documentclass{article} \usepackage[style=numeric,backend=biber]{biblatex} \addbibresource{biblatex.bib}  \begin{document}  You can cite an online resource \cite{ford}.  \printbibliography  \end{document}   biblatex.bib  @online{ford,     author = {Ford, Rebecca},     title  = {Earthquake: Twitter Users Learned of Tremors Seconds Before Feeling Them},     date   = {2011-08},     url    = {http://www.hollywoodreporter.com/news/earthquake-twitter-users-learned-tremors-226481} }   For my work I use Texmaker and the fast compile with PdfLaTeX + Bib(la)tex + PdfLaTeX (x2) + View Pdf.

Running the minimal example  \documentclass{article} \usepackage{filecontents} \begin{filecontents*}{\jobname.bib} @ARTICLE{example,   author  = {Other, Anthony Norman},   title   = {Some things I did},   year    = {2014},   journal = {J.~Irrep. Res.},   volume  = {1},   number  = {1},   pages   = {1-10} } \end{filecontents*} \usepackage[backend=biber]{biblatex} \addbibresource{\jobname.bib} \begin{document} Hello\cite{example}. \printbibliography \end{document}   I get the warning There were undefined references.  I have read  and know that I need to run:   LaTeX Biber LaTeX   However, my editor is only set up to run BibTeX. How do I go about setting up my editor/IDE to be able to run Biber, and how do I run the LaTeX/Biber/LaTeX cycle?  Answers (sorted alphabetically by editor name)                    Answer guidelines   Each answer should be for one editor. If the editor is cross-platform, if possible give a single answer with notes covering the minor platform variations. Please edit the question to include new answers in the 'link list' Each answer should be 'stand alone', i.e. don't say 'It's almost the same as editor Y but ...' for the editor part Instructions for 'build tools' such as arara or latexmk are welcome but should explain how to set up the editor in question as not all editors allow simple addition of arbitrary tools


I have a laptop running Ubuntu 14.04 with no internet connection. I want to use Synaptic to install software and packages to it, referring to . The problem is, I do not have synaptic installed on the laptop, so I need to download the Synaptic package and all of its dependencies (deb files) on another PC and then transfer them to the laptop. I found the deb files , but I can only download one file at a time. Is there a way that I could download Synaptic and all of its dependencies at once?

I have a friend who has got a computer that is not connected to the Internet. Is there any way to install software offline easily?


'I don't have both' - is this sentence correct grammatically?  If it is not then what is the correct way to say it?  EDIT:   Let's say Alice says 'I have an apple and a banana.'  Now, Bob does not have any of those fruits.  Then, he says, "I do not have both". Does it sound more like he does not have both at the same time (an AND condition) but he might have one of them & hence not 'both'?  Or, does it sound more like he has none of those fruits?

I've just come across a film review by an American author where he says:  "I can assure you that both are not typical in any part of this state".  In negative sentences like that, my inclination would be to use "neither one of them is..." instead (or, depending, none of them is/are...).   Is it right to say "both are not..." ?


I have a list in python, eg. [1,2,3,4,5,6,7,8,9,10,11,12]  I want to make a new list with only the 4. element from the right? .. how to do that, eg. with a one liner.  eq. to .. [4,8,12]

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


I can't see my hard drive on my desktop but I can see it on the left of my disc utility window , I can't  click the verify button or the repair ...😟 Is there a way to repair it before I format it ? Thx for ur help .

My hard drive used to display on the desktop. It's gone missing, how do I get it back?


My US VISA expired but I have my 2019 valid for more 6 months. Can I go to Canada (for about a week) and re-enter the US using the valid DS-2019?

I am currently on H1B and am planning to visit Toronto, Canada. The visa on my passport is expired by I have extended my I94. So my question is that if I go to Canada for a 5 night vacation, can I re-enter USA if I have my updated I94, I797 and passport.  Please do let me know. Am planning to go next year during the summer.


I'm looking at RAID controllers, specifically the (Avago) LSI Logic MegaRAID SAS 9261-8i.  It is a 8-port card, which I would be able to "Connect up to 128 SATA or SAS drives with eight internal 6 Gb/s SATA and SAS ports" but I only see two connectors.  Can someone please explain how the connectors/ports/devices relate? Thanks!

I've doing some researches since few days and I haven't really got an answer to my question.  I am in the process of building a huge file server for the company I work for. We bought a server case  with 24 bays and drives. Now I am stuck at the point where I have to choose the RAID card. I saw a RAID card from LSI that offer 6 internals mini-SAS 8087 ports (6x4) and would work perfectly with my build. However, it's not cheap.  I have been reading about the subject and I found something called SAS Expander. They are cheap.  with 6 mini SAS 8087 for 225$ (instead of 1150$ of the other one).  Now my question, how would I link an SAS Expander with a RAID card ? Do I need to a buy a RAID card with only 1 external 8088 port and link it with the other card ? Could someone clarify this for me because I haven't found any good documentation on it.  Thanks you.


Let $G$ be a finite group of even order, whose $2$-Sylow subgroups are cyclic. Show that $G$ is not simple.   I was trying to use Cayley theoem, place $G$ in some $S_m$ and get a contradiction with $A_n$ being simple but I couldn't get to anything...  Moreover I'm not sure how does it help that the $2$-Sylow subgroups are cyclic?

I want to prove the following:          Let $G$ be a group of order $2^nm$, where $m$ is odd, having a cyclic Sylow $2$-subgroup.     Then $G$ has a normal subgroup of order $m$.      ATTEMPT:  We will show that $G$ has a subgroup of order $m$. Let $\theta:G\to \text{Sym}(G)$ be the homomorphism which is defined as $$  \theta(g)=t_g,  \quad  \forall g\in G $$ where $t_g:G\to G$ is defined as: $$  t_g(x)=gx,  \quad  \forall x\in G. $$ Let $g$ be an element of order $2^n$ in $G$. (There exists such an element since $G$ has a cyclic Sylow $2$-subgroup.)  The cyclce representation of $t_g$ is a product of $m$ disjoint cycles each of length $2^n$. Therefore $t_g$ is an odd permutation.  Thus the homomorphism $\epsilon\circ \theta:G\to\{\pm 1\}$, where $\epsilon:\text{Sym}\to\{\pm 1\}$ is the sign homomorphism, is a surjection.  By the First Isomprphism Theorem, we conclude that the kernel $K$ of $\epsilon\circ \theta$ is of order $2^{n-1}m$.  If $n$ were equal to $1$ then we are done.  If $n>1$ then note that any Sylow $2$-subgroup of $K$ is also cyclic. This is because each Sylow $2$-subgroup of $K$ is contained in a Sylow $2$-subgroup of $G$, where the latter is cyclic.  Now we can inductively show that $K$ has a subgroup of order $m$.    What I am struggling with is showing the normality.  Can anybody please help me with this.  Thanks.


Can I have my familiar deliver only a portion of a touch spell and the caster deliver the other portion of it. The specific spell in question is  (upcast to 5th level because Warlock) and my character is in touch distance of one of the targets while my familiar is within touch distance of two others. But my character is not within touch distance of the other two and the familiar isn't in touch distance of the other one.   So my question is: "Can my familiar deliver the spell to two of the targets while I deliver it to the third?"  The DM has made the temporary ruling for now that it can't but he has also been shown to be willing to change rulings like this after receiving an answer here.

I'm a level 5 warlock with Pact of the Chain, so I can cast invisibility with a level 3 slot, and cause 2 creatures to become invisible.  Can I use my familiar to deliver invisibility to both someone who isn't in my range (e.g. 80 feet away from me) and myself with 1 casting?


I have 3 view blocks on my page which show a list of blogs(nodes) with a pager. The issue is that whenever I click the 'next' or any link on the pager, all the blocks change, not just the one Im clicking on. Is there some option which unties the paging from the other blocks??

I have multiple views with pagers on same page. But all of the pagers using the same GET argument "page", so when user chooses a page in first pager, all of the pagers changing their state to those page. How can I make things work? Drupal 6, Views 2.


I wrote a simple code just to check the values between textfields and compared whether they are the same or not. I want them to be the same, if not it will produce an error. It's about rewriting an email.      String a = studentemail.getText();     String b = rewritestudentemail.getText();      if(a != b){          JOptionPane.showMessageDialog( null, "Student Email rewritten incorrectly.","Error!",JOptionPane.OK_OPTION);      }   The program persists that there is an error even though I indicated the same string values in both of the fields. Why's that?

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?


I have tried JavaScript Number method and it returns unexpected results.  If i pass 192000000000000005 value into Number() method. It returns 192000000000000000, without 5.   If I Pass 19200000000000005 value, it returns 19200000000000004, which is unexpected.   What is that meaning of those results?  You can find the below screenshot too.  Chrome Console:

Is this defined by the language? Is there a defined maximum? Is it different in different browsers?


I have an external drive that I want to keep in my windows server as a shared volume to use to access with my main computer which is a mac laptop.  Occasionally there are some large files that can't be transferred over the network due to their size and I would like to take out the external and temporally plug it into my mac to copy these files.  Since mac cant write to NTFS formatted drives and windows won't even detect HFS+ formatted drives, is there any other workaround that will let me share the entire volume over the network through windows server but enables me to from time to time plug it directly into my mac laptop? Thanks!

I would like my external drives to be readable and writable from Linux, Mac OS X and Windows.   FAT32 works, but the 4 GB file size limit is a showstopper these days. Are there any alternatives?


What is the better way to name a new interface ? Would you write HasName or Nameable?  Is there a general computer science standard, or only a Java habbit ?

Most OO languages prefix their interface names with a capital I, why does Java not do this?  What was the rationale for not following this convention?  To demonstrate what I mean, if I wanted to have a User interface and a User implementation I'd have two choices in Java:        Class = User, Interface = UserInterface   Class = UserImpl, Interface = User      Where in most languages:     Class = User, Interface = IUser   Now, you might argue that you could always pick a most descriptive name for the user implementation and the problem goes away, but Java's pushing a POJO approach to things and   most IOC containers use DynamicProxies extensively.  These two things together mean that you'll have lots of interfaces with a single POJO implementation.  So, I guess my question boils down to: "Is it worth following the broader Interface naming convention especially in light of where Java Frameworks seem to be heading?"


As I was practicing the use of fgets() to read string from input, I found myself copying the same piece of code over and over, so I created a function to call every time I need to do it. Here is a simple example of how it works:  #include <stdio.h> #include <string.h>  void GetLine(char str[]) {     // This is the function, I added a printf() to better show what's happening     printf("Maximum size of the string in GetLine: %i\n", sizeof(str));     fgets(str, sizeof(str), stdin);      // This is for clearing the newline character     // either from the recently received string or from the input buffer     if (str[strlen(str)-1] == '\n')         str[strlen(str)-1] = '\0';     else {         char DISCARD;         while((DISCARD = getchar())!='\n' && DISCARD != EOF);     } }  int main() {     char MyString[51];      printf("Maximum size of the string in main: %i\n", sizeof(MyString));     GetLine(MyString);      printf("Contents of the string: >%s<\n", MyString);      return 0; }   Here's the output:  Maximum size of the string in main: 51 Maximum size of the string in GetLine: 4 My name is Pedro Contents of the string: >My <   Notice how str[] only have 4 spaces, instead of being the size of the string passed to it.  The workaround for this is pretty easy: make GetLine() also receive an integer that holds the size of the string, so it can read the correct number of characters without depending of sizeof(str).   However I'd really like to know both why this happens(the 4 space thing) and if I can fix this method somehow(make char str[] the same size as the string passed as argument).  Thanks in advance.

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


I'm not a techie and I don't have the space to download the 500GB planet OSM file and run through osmosis.  What is the easiest way for me to download all nodes of type City+Town+Village (as defined by OSM), pulling just these parameters: •    Node ID •    Node Latitude •    Node Longitude •    Key (city or town or village) •    Name •    Population •    is_in:state_code •    is_in:country_code Please help (in a way a non-techie can understand).  I've come across literature on many ways to pull data from OSM but instructions haven't been clean enough for me to figure out.

I have tried to retrieve them from the api with the following:  wget -O allcities.xml "http://www.overpass-api.de/api/xapi_meta?node[admin_level=8]"   however it does not seem to return all of them. From the doc Admin Level 8 should be cities, towns and villages but it seems to only contain major cities. I get a list of about 12000 nodes.  I am actually looking into getting all inhabited places on earth with at least 1000 population.  I am also downloading the whole planet in PBF format, in case using the API is not possible. How would I be able to achieve the same using such file?


As a follow up to this topic  I had a question. When we do OLS we have usually the normal model: $$ y_i=ax_i+\epsilon_i [1]$$ $$ \epsilon_i \sim N(0,\sigma^2) [2]$$ with independent residuals. Than OLS can be derived in a maximum likelihood setting maximizing the log likelihood. Fix $f(x|\sigma)=\frac{1}{\sqrt{2\pi\sigma^2}}e^{-x^2/\sigma^2}$ the density of the centered standard Gaussian. Then: $\log L(\alpha,\sigma)=\sum_i \log f(y_i-a x_i|\sigma)$ [3] and maximizing analytically one recovers ordinary OLS. Now [2] can be relaxed/changed as a hypothesis, for example we can have $\epsilon_i \sim$ Student's $t (\nu)$ or whatever parametric distribution we choose. Than [3] would change, a different $f$ should be used, and in the general case maybe one should make a numerical optimization. Is it common to have linear models with non normally distributed residuals applied in real scenario? Is there some example? If there is any software recommendation, it would also be useful :)

Consider a linear regression model: $$ y_i = \mathbf x_i \cdot \boldsymbol \beta + \varepsilon _i, \, i=1,\ldots ,n, $$ where $\varepsilon _i \sim \mathcal L(0, b)$, that is, Laplace distribution with $0$ mean and $b$ scale parameter, are all are mutually independent. Consider a maximum likelihood estimation of unknown parameter $\boldsymbol \beta$: $$ -\log p(\mathbf y \mid \mathbf X, \boldsymbol \beta, b) = n\log (2b) + \frac 1b\sum _{i=1}^n |\mathbf x_i \cdot \boldsymbol \beta - y_i| $$ from which $$ \hat{\boldsymbol \beta}_{\mathrm {ML}} = {\arg\min }_{\boldsymbol \beta \in \mathbb R^m} \sum _{i=1}^n |\mathbf x_i \cdot \boldsymbol \beta - y_i| $$  How can one find a distribution of residuals $\mathbf y - \mathbf X\hat{\boldsymbol \beta}_{\mathrm {ML}}$ in this model?


$\displaystyle \dfrac{\int_{0}^{1}{(1-x^{50})^{100}}dx}{\int_{0}^{1}{(1-x^{50})^{101}}dx} =$ $  ?$  I tried putting $x=sin(a)$ but I could do nothing about the 100 and 101 powers, they made the integration not solvable for me.  How should I do or approach this question?


When I insert two tables with \include into my main.tex file, each table floats to a separate page. I would like to fit them into one page and mesh with the rest of the document. I can do that when the code for tables is contained in the main.tex file but obviously this complicates maintenance of the document tremendously.

There are two different commands to incorporate another file into the source of some document, \input and \include. When should I use one or the other? What are the differences between them? Are there more things like them to be aware of?


I'm trying to make sort of a granite slab material for flooring. And i've tried a lot of things, but none seem to make it look good, and using the image doesn't help either since there's changes in brightness. My main idea was to use a voronoi texture as a base from where to build up. I get sort of close, but not really there. It doesn't seem that hard in theory, but making all the layers from big chunks to small details makes it all the more difficult. Could anyone tell me a way to start off? Maybe not even procedurally Edit: I'll just ask a simple question where I can go on from, how can I decrease the size of the chunks individually in the voronoi color socket?

is it possible to create this kind of material with the standard textures? The Voronoi texture (set to cells) is coming close but I don’t know if it is possible to a) set the single cells apart from each other and b) to give them seperate colors.


The warlock's Pact of the Tome option for the Pact Boon feature says:     When you gain this feature, choose three cantrips from any class's spell list. While the book is on your person, you can cast those cantrips at will.   Are these cantrips considered warlock spells for the purposes of determining attack bonuses and save DCs?  I think that might be the intent, but unless I'm missing something, I don't think the rules as written support that. Similar features seem to specify when a spell becomes a class spell, such as a cleric's domain spells:     If you have a domain spell that doesn't appear on the cleric spell list, the spell is nonetheless a cleric spell for you.   Is my interpretation correct that while the warlock can cast those cantrips, they need to use the spellcasting ability of the class whose list the cantrip comes from when casting them?

Pact of the Tome gives Warlocks access to any 3 cantrips. The feature doesn't specify whether the cantrips use the default stat (my guess), or whether they use Cha (to make the feature more useful/avoid MAD).  Contrast the omission with Magic Initiate, which explicitly calls out the stats, according to the class. So, which is it?


i am trying to replace $old  string with $new string in file where:  old=ESX_10.1.1.1\@11.11.11.11 new=host_15_11_0_111.static   I am using sed command:  sed i "s/${old}/${new}/g" /filename   but it does not replace the word and also not shows any error. I have tried it with many ways, like replacing:  sed i "s,${old},${new},g" /filename   and  sed i "s=${old}=${new}=g" /filename   but it does not work. Help me to solve this

I have a script that reads a text stream and generates a file of sed commands that is later run with sed -f. The generated sed commands are like:  s/cid:image002\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1922/g s/cid:image003\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1923/g s/cid:image004\.jpg@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1924/g   Assume the script which generates the sed commands is something like:  while read cid fileid do     cidpat="$(echo $cid | sed -e s/\\./\\\\./g)"     echo 's/'"$cidpat"'/https:\/\/mysite.com\/files\/'"$fileid"'/g' >> sedscr done   How can I improve the script to ensure all regex metacharacters in the cid string are escaped and interpolated properly?


From the moment I posted my (89th) question on History SE, it has appeared like this in the main question list:    When you click to view, it looks fine. It only appears like this on the main list. I know that downvoted and deleted posts appear faded when you 'look inside', but even these are not faded on the main question list.  I use Google Chrome and the question looks like this on both desktops (Windows XP - yes, I know it's old) and my laptop (Windows 8.1).

What are watched tags and ignored tags? How do they work? What are tag subscriptions? What are interesting tags? On Stack Overflow, the content of the main page question list appears to be influenced by watched and ignored tags. How does that work?   For more information, see "" in the .


I have been reading and watching videos about this subject for a while now.  I just can not seem to grasp the idea.  Let's say we have two clocks.  I leave one at home and keep one in my pocket. Then, I started running at speed that is close to speed of light to my school then come back to my house.  If I compare those two clocks how would they differ in time?

I read a lot about the classical twin paradox recently. What confuses me is that some authors claim that it can be resolved within , others say that you need . Now, what is true (and why)?


Why do all colors and effects not export to unity? All the white shading on edges and the brown color does not show in unity? I'm using a color palette where I scale the UV to 0 and then use g to move around on each face.

I used node textures in a mesh I exported to .FBX.  I then imported it into Unreal Engine 4 and it didn't import any textures; I clicked the Upload Textures option in Unreal Engine.  Is there something I'm doing wrong or is it Blender?


If $X$ is countable, then the cartesian product is countable. However, what about general cases? The googling suggests that the answer is the cardinality of $X$. But why? Could anyone please provide me with the proof?

Here the problem 1.4.26 from Sohrab, Basic Real Analysis  Duplicate  This are not duplicate of this question:    the answer gives no proof  despite the title is not really connected  only finite set   Problem  Show that, if $A$ is an infinite set, then $|A\times\mathbb{N}|=|A|$. Hint: Let $\mathcal{F}$ denote the set of all bijective maps $f:S\times\mathbb{N}\to S$, where $S\subset A$. Since $|\mathbb{N}\times\mathbb{N}|=|\mathbb{N}|$, we have $\mathcal{F}\neq \varnothing$ (Why?) Show that Zorn's Lemma can be applied in $\mathcal{F}$ to produce a maximal bijection $h:B\times\mathbb{N}\to B$, with $B\subset A$, and that we must have $B=A$, by examining the cases where $S\setminus B$ is finite or infinite.  Proof  Let $\mathcal{F}$ denote the set of all bijective maps $f:S\times\mathbb{N}\to S$, where $S\subset A$. Since $|\mathbb{N}\times\mathbb{N}|=|\mathbb{N}|$ (see exercise 1.4.10(i)), we have $\mathcal{F}\neq \varnothing$ (From Exercise 1.4.22(d) we know that for a infinite set $A$, we have $|A|\geq\aleph_0$, and $|\mathbb{N}|=\aleph_0$, thus there is an injection from $g:\mathbb{N}\to A$, and, by defining $S:=g(\mathbb{N})\subset A$, we get a bijective map (composition of two bijective maps) $S\times\mathbb{N}\to\mathbb{N}\times\mathbb{N}\to\mathbb{N}\in\mathcal{F}$).  If we consider the inclusion as partial order, then every chain $S_i\subset A$, $i\in I$, has $A$ as upper bound and applying Zorn's Lemma, we get the existence of a maximal $\bar{S}$ and hence a bijection $h:\bar{S}\times\mathbb{N}\to\bar{S}$, with $\bar{S}\subset A$.  Now we prove that $\bar{S}=A$. $R:=A\setminus \bar{S}$. $\bar{S}$ is infinite, since the example of element of $\mathcal{F}$, that we gave above is bijective to $\mathbb{N}$. We have to do this. The second is trying to follow the hint and is incomplete:   Consider that $A\neq\bar{S}$, then there is $r\in R:=A\setminus\bar{S}$. We chose an element $s\in\bar{S}$ and define the bijection $h':\bar{S}\cup\{r\}\times\mathbb{N}\to \bar{S}\cup\{r\}$ as follow  $h'(a,n)=\begin{cases}h(s,2n-1)&\text{for }a=s\\ r&\text{for }a=r,n=1\\ h(s,2n-2)&\text{for }a=r,n\neq 1\\ h(a,n)&\text{otherwise}\end{cases} $  Since $\bar{S}\subsetneq \bar{S}\cup\{r\}$ we get a contradiction to the maximality of $\bar{S}$. Now either $R$ is finite or infinite. 1) $R$ finite, let say $R=\{r_1,\cdots,r_n\}$. Then chose $n$ elements $s_1,\cdots,s_n\in\bar{S}$ and we define the bijection $h':A\times\mathbb{N}\to A$ as follow $h'(a,n)=\begin{cases}h(a,2n-1)&\text{for }a\in\{s_1,\cdots,s_n\}\\ a&\text{for }n=1,a\in\{r_1,\cdots,r_n\}\\ h(s_i,2n-2)&\text{for }a=r_i\\ h(a,n)&\text{otherwise}\end{cases}$  In case $n>0$ we get a contradiction with $\bar{S}$ being the maximal element.   Thus we have only to exclude the case 2) $R$ infinite. HOW TO DO THAT?   Question  Above I tried two proofs. The first part is the same. The two second parts are given by the two bullets.  The second proof tries to follow the hint.  My questions are:   - Is my proof correct?   - In which direction should go the proof from the hint?


Actually I'm trying the ability of TServerSocket in Delphi, and found always around 10K connections are activate, and for the rest, although they're showing me the status "Connected", but still, they cannot receive any message, and for sure, my server socket is broadcasting the same messages to all of them.  So, what's the limit of the TServerSocket? Why there's no data traffic even when connected? Is there any options i can turn?  BTW, I'm using Delphi5.  Thank you in advance.

I'm building a chat server with .NET. I have tried opening about 2000 client connections and my Linksys WRT54GL router (with tomato firmware) drops dead each time. The same thing happens when I have several connections open on my Azureus bit-torrent client.  I have three questions:   Is there a limit on the number of open sockets I can have in Windows Server 2003? Is the Linksys router the problem? If so is there better hardware recommended? Is there a way to possibly share sockets so that I can handle more open client connections with fewer resources?


The verb "do" often serves a meaningless purpose in questions. John McWhorter argues in his book "Our Magnificent Bastard Tongue" that this is a direct influence of the Celtic languages. In all of my studies of linguistics and philology I have never before seen anything concerning this hypothesis. Is this a widely accepted theory? If so, who are some other proponents? If not, what are other theories about the origin of the meaningless "do?"   Example of meaningless "do." Do we need to go to the store?  In most languages, this phrase would roughly be stated as... Need we go to the store?  Thank you in advance for your answers.

Modern English seems to require this verb in several circumstances, where most other European languages don't seem to need it. (See? I just used it.)    For example, in questions: "Do you have a dog?" Whereas, "Have you a dog?" would be normal in other languages or in the English of days gone by.    Another example: "I do not know him." Again, "I know him not," could be used, but sounds stilted nowadays.    So, where did this 'do' come from?


As the title suggests, I'm using a mac book pro with os x 10.9.2 and I connect to the network through the ethernet adapter thunderbolt.  Is there a way to get a reference icon in the menu bar, as is the case for the wifi?  I'd prefer not to use applications such as iStatsMenu or similar ..

I am using OSX 10.7  When I move between different ethernet networks (e.g., at work using ethernet on an external display, at home using thunderbolt ethernet), the ethernet does not always connect. However, I don't get immediate feedback. Instead, I connect to wi-fi. However, wi-fi is both slower and less reliable than ethernet. Thus, I'd like to know whether I am connected to ethernet or not. Of course I can go into preferences and network settings to see whether I'm connected to ethernet, but it would be better if there was some form of indicator in the status bar, just as there is for wi-fi. Thus, my question:  Is there a way of getting an indicator of ethernet connectivity in the OSX menu-bar?  Perhaps there is a free application that can do this.


I am doing forecasts for a lot of time series. These consist of forecasts for specific items in specific regions, where all regions belong to a country. So this is a hierarchial series.    Product 1 - Country 1   product 1 - country 1 - region 1-1 product 1 - country 1 - region 1-2   Product 1 - Country 2    Product 1 - Country 2 - region 2-1  ........  ........   And then there is of course also the "Total" of all.   My matrix cmat contains all bottom level data, i.e. for all products and regions. Every column is a time series. The name of a column is for example: 000214ABCab. The numbers are the product ID, the next 3 letters are the country, and the next two letters are the region. I want forecasts on this level, but also on the product-country level.   First I was struggling with the performance, as I have a lot of data. In the example below I only use a subset of 1000 time series.   subs = cmat[,1:1000] hh = hts(subs, characters = c(maxlength+3,2)) ally = aggts(hh)  #make list of data tables with time series  subs2 = as.data.table(t(ally)) subs2$CODE = unlist(hh$labels) datlist = subs2[, list(list(.SD)),by=CODE]$V1  setattr(datlist, 'names', subs2$CODE) #code is the identifier of products/country/region  s1 = Sys.time() fcast = NULL for(i in 1:nrow(subs2)){     if(i%%1000==0){         print(i)     }     fc = data.table(pmax(forecast(stlf(ts(matrix(datlist[[i]]),frequency=12)),h=12)$mean,0) )     names(fc) = names(datlist)[i]      fcast = rbind(fcast, t(fc)) } s2 = Sys.time()  fcasts = t(fcast) y.f = combinef(fcasts, get_nodes(hh),keep="all")  s3 = Sys.time()   I am also surprised by how fast combinef is. However, I only want positive or zero forecasts. Preferably also integer forecasts. I already do pmax(forecast, 0) in the loop. But by using combinef, I lose this again.   If I do now again pmax then I will also lose the functionality of the combinef, right? So how can I make the forecasts positive? Also, for me it is not necessary to have a "total forecast" at all, but I don't know if I can omit this?

When using the combinef function from Rob Hyndman's very useful  for forecasting hierarchical and grouped time series, there does not seem to be a way to constrain the optimally combined forecasts to be positive- the starting forecasts can be positive, but can go negative through the reconciliation process.  The forecast.gts and forecast.hts functions have an argument to keep forecasts positive, but this does not seem to be an option when using combinef by itself with forecasts obtained by other methods.  Am I correct in this understanding, and if so is there a decent workaround?


I am just modelling a small cup that I want to fill with sugar cubes. To make it look more realistic, I want to let the cubes drop into the cup. I have already physics enabled and the right collisions but I am just wondering how to freeze a single frame to take it as my initial frame. Everytime I switch back to the first frame, I lose my keyframe and the cubes are over the cup again.  I guess the answer is pretty easy but I couldn't find it in the manual yet.

Let's say I set up a Rigid Body simulation in Blender (not in GE), and then run the simulation for a number of frames. Is there a way to tell Blender to use the current state and position as the initial state? So that when I go back to frame 1, the rigid bodies stay in the same place they did in frame X.  For instance, if I want a pile of bricks, I first place the bricks in the air and then let them drop down on the ground, coming to rest. When they have come to rest, I want to use that position as the starting position.


Apparently this is a true statement, but I cannot figure out how to prove this. I have tried setting   $$(m)(m + 1)(m + 2)(m + 3) = (m + 4)^2 - 1 $$  but to no avail. Could someone point me in the right direction?

I need to prove the following, but I am not able to do it. This is not homework, nor something related to research, but rather something that came up in preparation for an exam.     If $n = 1 + m$, where $m$ is the product of four consecutive positive   integers, prove that $n$ is a perfect square.   Now since $m = p(p+1)(p+2)(p+3)$;     $p = 0, n = 1$ - Perfect Square      $p = 1, n = 25$ - Perfect Square      $p = 2, n = 121$ - Perfect Square   Is there any way to prove the above without induction? My approach was to expand $m = p(p+1)(p+2)(p+3)$ into a 4th degree equation, and then try proving that $n = m + 1$ is a perfect square, but I wasn't able to do it. Any idea if it is possible?


Note: This question is not a duplicate of similar questions where the answer calls for a javascript/php generated random number query tacked onto the end of the image names.  As I explained in the original post, I can't use javascript in the code.  The users are doing a one-time copy of the HTML and pasting it into locations that cannot run javascript    I run a web service that generates image files for users that show their progress on certain geocaching goals (geocaching is just an outdoor hobby.)  The images sit on my server.  Then, the service gives the user HTML code to reference the images and they can copy/paste that HTML into other websites such as their personal blogs or their personal profile on the main geocaching website.  The idea is that they can periodically come to my site and generate NEW updated images.  The images still have the same name on the server.  That way the HTML they previously copy/pasted still works...it references the same images, but those images have been updated.  However... caching is a problem.  Often, I'll generate the new images, but the user will still see old images on their personal blog or wherever because the old images were cached.   I can give the users HTML code that tacks a random query parameter on the image src, but that won't help because they are only copying/pasting that HTML one time.  The random query parameter will only be generated once, and after the first load, the images will be cached and there wont be a new random query parameter. I can't give the users HTML code that contains javascript to generate the random query parameter every time the HTML is read because they are copying this HTML code into fields that usually can't run scripts.  I can't try to disable caching on their end obviously since they are pasting this HTML into other sites.   Is there anything I can do to disable the caching for these images from the plain HTML?  Any img attribute I can use?  Any ideas for solving this tricky problem?

Background  I am writing and using a very simple CGI-based (Perl) content management tool for two pro-bono websites. It provides the website administrator with HTML forms for events where they fill the fields (date, place, title, description, links, etc.) and save it. On that form I allow the administrator to upload an image related to the event. On the HTML page displaying the form, I am also showing a preview of the picture uploaded (HTML img tag).  The Problem  The problem happens when the administrator wants to change the picture. He would just have to hit the "browse" button, pick a new picture and press ok. And this works fine.  Once the image is uploaded, my back-end CGI handles the upload and reloads the form properly.  The problem is that the image shown does not get refreshed. The old image is still shown, even though the database holds the right image. I have narrowed it down to the fact that the IMAGE IS CACHED in the web browser. If the administrator hits the RELOAD button in Firefox/Explorer/Safari, everything gets refreshed fine and the new image just appears.  My Solution - Not Working  I am trying to control the cache by writing a HTTP Expires instruction with a date very far in the past.  Expires: Mon, 15 Sep 2003 1:00:00 GMT   Remember that I am on the administrative side and I don't really care if the pages takes a little longer to load because they are always expired.  But, this does not work either.  Notes  When uploading an image, its filename is not kept in the database. It is renamed as Image.jpg (to simply things out when using it). When replacing the existing image with a new one, the name doesn't change either. Just the content of the image file changes.  The webserver is provided by the hosting service/ISP. It uses Apache.  Question  Is there a way to force the web browser to NOT cache things from this page, not even images?  I am juggling with the option to actually "save the filename" with the database. This way, if the image is changed, the src of the IMG tag will also change. However, this requires a lot of changes throughout the site and I rather not do it if I have a better solution. Also, this will still not work if the new image uploaded has the same name (say the image is photoshopped a bit and re-uploaded).


A counter-example (based on my misunderstanding) is, say, if $(-3)^3=-27$ then why is it not the case that $log_{-3}(-27)=3$?

Given a logarithm is true, if and only if, $y = \log_b{x}$ and $b^y = x$ (and $x$ and $b$ are positive, and $b$ is not equal to $1$), are true, why aren't logarithms defined for negative numbers?  Why can't $b$ be negative? Take $(-2)^3 = -8$ for example. Turning that into a logarithm, we get $3 = \log_{(-2)}{(-8)}$ which is an invalid equation as $b$ and $x$ are not positive! Why is this?


My final year project for university is based on the idea that a two-dimensional top-down multiplayer racing game can be made using Google Maps to dynamically generate race tracks. The idea is that the user would pick two points on a Google Map and then click a button that would generate a route between the two points.  I am able to extract the path from these points.      Now, I can't figure out how to actually transform this shape into a race track. I tried changing the stroke width, it messes up the details, like curves.  I want thicker strokes without losing details and the strokes overlapping each other so that the strokes look more like race tracks, because the camera would center the player's car and be zoomed in on it while following the car. Something like this:    Is there any way I can make the route shape into an actual race track? If so, how?

I want to generate a 3-dimensional race track around a spline that describes its shape.  .  The track should be an endless tunnel that sweeps along a 3D spline, with some obstacles thrown in.  My best idea so far has been to loft a circle shape along the spline.  I would also like some pointers into how to manage the geometry i.e. how to create it from the loft operation, manage its 'lifecycle' in memory, collision and texturing.


I would like to know if there is a way to get the a "tree-menu" on Ubuntu like in windows (see printscreen)?   I look for a solution where the user could chose any file as start point (for instance startup of the tree-menu could be /etc/emacs  or var/www/htlm  or /opt/   ...)  The number of tree-menu should be multiple : on the printscreen I have 3 tree-menu : 1"documents" 2"owncloudLA" and 3"BACKUP_AD".   I am using ubuntu 14lts.

As a happy Linux user for almost a year now, this is the bane of my existence. Does the Linux community hate tree views for some obscure reason?  I don't mean a tree view in the side panel. That's useless. I mean a proper tree view, such that, when I click the triangle, all files and subdirectories contained within the directory show beneath, and I can drag and drop files, open and close trees.   It is extremely frustrating to navigate and move files around deeply nested directories without this feature.  I've tried: Nautilus, PCManFM, emelFM2, Krusader. I find it hard to believe that even crazilly-full-featured file managers like Krusader would be missing this most obvious of features... and yet, here I am.  For all the effort put into those file managers, is this so far-fetched to ask for?    I just need a simple, single-pane file manager with a tree view option. Help!   And -- please -- HOW IS THIS FUNCTION INVOKED ??  (Do I left/right click while pressing control/alt/shift? Is some setting required?)


Since this question received absolutely zero attention, here's a complete rephrase with the aim of significantly shortening it.    I have a potful of $n$ radioactive atoms. I spend $t_\text{max}$ = 1 hour recording the times when I see an atom decay.  Then I'm left with $n-k$ atoms in the pot and $k$ measurements of the times: $t_1, \dots, t_k$.  As you know, the distribution of these times is exponential, $p(t) = a e^{-a t}$, and I wish to find the decay rate $a$ using maximum likelihood estimation.  One way is to restrict the distribution to the interval $[0, t_\text{max}]$ and use $p(t) = a e^{-a t} / (1-e^{-a t_\text{max}})$ for the deriving the MLE.  This method doesn't use the information that there were $n-k$ atoms left after $t_\text{max}$ (which in itself would be usable for estimating $a$, where this estimate may be somewhat different from what I get from the MLE).  Question: How can I make use of the number of remaining atoms in the fitting procedure, while still using maximum likelihood estimation?    My question is in fact general, and could be asked about any distribution defined on $[0, \infty)$, not only the exponential one.  The story above was just an example that made it easier to explain the problem concisely.

My dependent variable shown below doesn't fit any stock distribution that I know of.  Linear regression produces somewhat non-normal, right-skewed residuals that relate to predicted Y in an odd way (2nd plot).  Any suggestions for transformations or other ways to obtain most valid results and best predictive accuracy?  If possible I'd like to avoid clumsy categorizing into, say, 5 values (e.g., 0, lo%, med%, hi%, 1).


How can I submit a form when the user presses enter after typing in a value?  <form method="get" action="http://example.com/search.php">  <input type="search" name="q" placeholder="search"> </form>

Can someone please tell me how to submit an HTML form when the return key is pressed and if there are no buttons in the form? The submit button is not there. I am using a custom div instead of that.