My laptop is used in long time intervals without restarting. The OS tends to use extensive memory (~8GB) as time passes. Below are screenshots of two different states with exactly the same programs are running.  Long Time      Right After Boot      It seems that caching causes this situation. I have two questions:   Is this amount of memory usage a bad thing and therefore something to fix?  Why cached amount increases as time passes?    Edit  Here's the Poolmon output as I appear to be using 6GB of RAM in another long session. Anything suspicious here?

I have 16GB of system RAM. On startup with no applications open except the task-manager Windows is using about 3gb of RAM. I looked in the processes tab, but nothing seems to be out of the ordinary. How can I find out why my Windows is using so much RAM.    all processes from all users      Reading from the poolmon it seems that my wireless broadcom driver is using about 0.4GB of of RAM. Even if I remove  it would still be using  2.6GB on start-up, which is still too much.      After reinstalling the wireless driver associated with the memory leak. I have a new screenshot and would like to confirm that it was indeed a memory leak.


He looked as though he had never heard of the word patience.   Should the term patience be in italics or quotation marks?

If I want to mention the word "furlong", for example, should I use furlong, "furlong", or 'furlong'? Also, am I correct in putting the punctuation outside the quotes?


I am attempting to remove lines from this text file (foo.txt): cat mouse  animals: 2  I want to remove the two lines from the end:  animals: 2  So I end up with this: cat mouse  However, when using variable="$(sed '$d' foo.txt)", both lines appear to be removed, even though I only specified one $d. Even though this gives me the result I am looking for, I can't help but wonder why this is happening. When attempting to NOT store the output in a variable, I get the output I expect to see: user$ sed '$d' foo.txt cat mouse  user$   Oddly enough, using $ sed '$d;$d' foo.txt only removes the animals: 2 line, and not the newline before it. Could somebody de-mystify this for me? Thanks. For the record, BSD sed is being used in this case.

I want to be able to capture the exact output of a command substitution, including the trailing new line characters.  I realise that they are stripped by default, so some manipulation may be required to keep them, and I want to keep the original exit code.  For example, given a command with a variable number of trailing newlines and exit code:  f(){ for i in $(seq "$((RANDOM % 3))"); do echo; done; return $((RANDOM % 256));} export -f f   I want to run something like:  exact_output f   And have the output be:  Output: $'\n\n' Exit: 5   I'm interested in both bash and POSIX sh.


I got a MS SQL table for translation of my webpagel, when I change my language to german there are words what are not shows properly an example in DB:  EL_ID   TEXT_EN TEXT_DE el10    Reset   Löschen   but when I use in my html/php page it is not showing properly:  [10] => Array         (             [0] => el10             [1] => L�schen         )   in my webpage I got activated:  <!DOCTYPE html> <HTML>   <HEAD>     <meta charset="UTF-8">     <TITLE>     </TITLE> ...   It is the data what is carried out from the DB or the HTML presentation the issue?

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I have a common error function which is called from many places. I want to know from which function this was called. Is there any way to do it?

function main() {    Hello(); }  function Hello() {   // How do you find out the caller function is 'main'? }   Is there a way to find out the call stack?


Let $S$ be open subset of $R^2$ and let $f$ be twice differentiable real valued function on $S$. Suppose that there exists $(a,b) \in S$ such that $f(x,y) \leq f(a,b)$ on $S$, then show that $(\Delta f)  (a,b) \leq 0$ where $\Delta f = f_{xx} + f_{yy}$  I have proved a similar result for functions define on $R$. If $g$ is a function defined on an open interval $I$ such that $a\in I$ and $g(x) \leq g(a) $ on $I$, then $g''(a) \leq 0$ I proved the above using the fact that $g''(a) =\lim_{h\to 0} \frac{g(a+h) + g(a-h) - 2g(a)}{h^2}$ and by observing that $g(a+h) + g(a-h) - 2g(a) \leq 0$ Can I use this somehow to arrive at the required result?

Suppose we are in $\mathbb R^n$. What can we say about the sign of $\Delta u(\vec x)$ if u($\vec x$) has a local max/min at $\vec x$? I've tried looking at the reverse of the second partial derivative test and it seems to suggest that $\Delta u(\vec x) \leq 0$ if $\vec x$ is a min and $\Delta u(\vec x) \geq 0$ if $\vec x$ is a max. However, I'm not convinced of this result. Can somebody point me towards a statement (theorem, etc.) involving the above. I appreciate the help.


I wanted to know the  of a certain software (omc), so I ran first    which omc file /usr/bin/omc   and that gave me all information I needed. Before telling my colleagues, I wanted to shorten it to a single line:    which omc | file   but that did not work. But why not?

I've been studying about the command line and learned that | (pipeline) is meant to redirect the output from a command to the input of another one. So why does the command ls | file doesn't work?  file input is one of more filenames, like file filename1 filename2  ls output is a list of directories and files on a folder, so I thought ls | file was supposed to show the file type of every file on a folder.  When I use it however, the output is:      Usage: file [-bcEhikLlNnprsvz0] [--apple] [--mime-encoding] [--mime-type]         [-e testname] [-F separator] [-f namefile] [-m magicfiles] file ...     file -C [-m magicfiles]     file [--help]   As there was some error with the usage of the file command


Just like the previous question,  Even I have been studying Hawking's A Brief History Of Time and even I was thinking of Einstein's General Relativity. But I was unable to accept his view of GRAVITY. I have been working on a theory which needs that Gravity effects Light. And so my question is that, Is there any kind of mass for Light? as it was being effected by Gravity?    Excuse me if any mistakes were done.   Plzz answer me.

I know a photon has zero rest mass, but it does have plenty of energy. Since energy and mass are equivalent does this mean that a photon (or more practically, a light beam) exerts a gravitational pull on other objects? If so, does it depend on the frequency of the photon?


I would like to get into photography, and I'm thinking about buying a starter D-SLR camera (450D, 500D).   Which Canon lenses do think fit to my purposes as considering I'm a beginner and my budget is very tight for the moment.  I know this question will overlap some other questions, but my question is very specific.

I am considering buying my first DSLR.  How do I know whether I need a 18-200 lens, 17-85, or 18-55? Or something else?


I have occasionally encountered and often written a three-word adjective of the form 'X-cum-Y' to describe a person, where the X and Y are normally set somewhat in tension with one another, if they are not outright contradictory states. I've seen this device used to denote character development; for example, if a nominally-celibate priest is discovered to have taken a lover, they might be described as a 'priest-cum-philanderer'.  Of course, given the euphemistic use of 'cum', such usage as I describe above has become rare (if it ever was common to begin with), but I am curious about it, regardless.  What is the function of what I call "the interstitial 'cum'"? What is the history of its usage? Are there any rules or general guidelines for deploying it appropriately in prose?  I would be grateful for any information on the topic.

I'm talking about the Latin cum, which I've seen used conjunctively, as in A-cum-B.  What does it mean, and how do you use it?


I just did an upgrade to a custom rom but then my network failed to work for me and I also failed to make a backup. Can someone tell me a solution for restoring the efs?

I used to do a full factory wipe then flashed a stock firmware with Odin, that helped me get back to having access to my mobile network then I flashed to Resurrection Remix 5.5.3 and lost access to my mobile network (Emergency Calls Only) I checked my IMEI and it appears to be valid. I didn't backup my /efs I didn't do anything to it. What seems to be the solution? I have a Samsung Galaxy S3 (I-9300)


Is there a way to reference an entire spreadsheet with a cell reference in Google Sheets?  Say I wanted to find out how many cells in Sheet1 were non empty. In sheet two I'd want to do something like  =COUNTA(Sheet1!<magic reference>)   I've tried some common sense things like just using a colon e.g. Sheet1!:, but that doesn't work.  Alternatively you can do something like Sheet1!A:ZZZ or Sheet1!1:1000 but obviously this misses an "infinite" number of rows or columns.  I haven't been able to find any documentation on the language of cell referencing.

The best workaround I have found so far is:  worksheet_name!$A$1:$YY   but ideally I would like to be able to simply write, e.g.:  worksheet_name!   So, does anyone know: is there a syntax for specifying a whole sheet as a range?


I'm using Unity 2017 and am writing a game wherein you shoot a ball, and when said ball hit something (a cube for example), I want it to remain in that position that it hit.  I tried this but it didn't work:  ball.transform.localPosition = gameObject.transform.localPosition;   Something like this picture :

How can I make a gameObject "stick" to another gameObject after it has collided with it? Right now the gameObject just passes through! [C#]


Tried doing an update on 18.04 using sudo apt-get update; when I type that in it is displaying this

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


I would like to "force-load" an instance of a page every time it's accessed.   The website in question is a "build your custom product"-kind of site and uses a multi-step form to guide customers through the steps of the product building. The client wants the site to be such that every time a user access the site, whether by direct url or by clicking on the "back" and "forward" buttons on the browser, it must refresh. In other words, no caching (right?).  I've tried to use the solutions I found on SO and on other websites, which mainly consisted of  header("Last-Modified: " . gmdate("D, d M Y H:i:s") . " GMT"); header("Cache-Control: no-store, no-cache, must-revalidate"); header("Cache-Control: post-check=0, pre-check=0", false); header("Pragma: no-cache");   But that didn't work.  So I tried my own solution:  $location = "/fabriquer/"; if(isset($_COOKIE['first_load']) && $_COOKIE['first_load'] == "true") {     setcookie('first_load', 'false');     header("Location: " . "http://" . $_SERVER['HTTP_HOST'] . $location); } else {     setcookie('first_load', 'true'); }   But that also seems to not be working properly. When I press the back button on my browser to get back on that site, the refresh does not happen, but the cookie is set to true/false in the second solution.   Any ideas?

Our investigations have shown us that not all browsers respect the HTTP cache directives in a uniform manner.  For security reasons we do not want certain pages in our application to be cached, ever, by the web browser. This must work for at least the following browsers:   Internet Explorer 6+ Firefox 1.5+ Safari 3+ Opera 9+ Chrome   Our requirement came from a security test. After logging out from our website you could press the back button and view cached pages.


Consider the following example:   It is you who has taken the garbage out.  It is you who have taken the garbage out.    Does one use "has" or "have" in this sentence construction? Which of the two best fits? Which is grammatically correct?

Possible Duplicate:          This is a line spoken by the . I always wondered if this is grammatically correct.  Luke says something like "You are mistaken ..." which the Emperor answers with     No, it is you who are mistaken!   Why wouldn't he say     No, it is you who is mistaken!   instead?  I don't know what rules apply here but my stomach tells me the latter is (at least also) correct, although you would say "you are mistaken". It feels as if he should be referring to "you" in the third person.  Could you please shed some light? Are both correct or – if not – which one is correct? And why?


It seems like good way of being nice to users: I mean, you simply say that you got their feedback instead of forcing them to sign up / log in.  But I am a bit suspicious about it so I wanted to ask. Is it really sent and (if yes) does it affect anything?

I just read . I found the explanation very clear and interesting, but I don't want to create an account on that site. So, I clicked Yes by "Was this post useful to you?"  Who will get that feedback?


I made a scene of two wine glasses on a flat surface, with an overhead light source. For some reason, when I'm viewing the objects as solids, there are strange shading artifacts that appear on all the objects. The planes do not always show the issue; you can see on the perspective on the left, the overhead plane looks normal, but in the perspective on the right it's entirely black (side note, it's an emission plane). These shadows do not appear in other object viewing modes (wire frame, materials). I'm running Blender 2.71 on a MacBook Pro with OSX Mavericks. This is my home computer, and at my work computer, which runs Windows XP, I don't have this issue ever. I'm very new to Blender, so it may be a simple fix, but I don't understand the program enough to understand what's happening and where to look to make the fix. Any suggestions would be greatly appreciated!

While rendering a mesh with smooth shading on, I get a dark region/shadow on certain faces. The effect is more evident when smooth shading is applied to a mesh containing ngons, with the ngons turning black when rendered.   The blackening effect is visible in the viewport too.  How can I solve this problem?


This is a double question.  The first one is: can I put a terminal shortcut on an Ubuntu desktop and how (the double-click is supposed to launch the terminal window)  The second is: is it possible to launch the terminal directly with a command? That is, any time it starts it must directly call sudo apt-get...  Any help is appreciated.

Let me start by saying that I'm very new to Ubuntu in general, so I realize this may be a basic question. I'm using xubuntu 14.04. I recently got a wireless usb working by following the steps .  The instructions say that anytime the kernel updates, I must recompile by entering the following into the terminal:  cd ~/mt7601/src make clean make sudo make install sudo modprobe mt7601Usta   I'd like to know if there's anyway to create an icon on my desktop that I can just double click that will have the effect of entering the above commands into the terminal?


I have recently read that      $$\frac{d}{dx}\sin(x)=\cos(x)$$   But,unfortunately I have not been able to make out what it exactly means that the rate of change of $\sin(x)$ is $\cos(x)$?  What does it simply mean that rate of change of $\sin(x)$ is $\cos(x)$?  I am a beginner in this branch of mathematics.  Any help is welcome.

One of the first things ever taught in a differential calculus class:   The derivative of $\sin x$ is $\cos x$. The derivative of $\cos x$ is $-\sin x$.   This leads to a rather neat (and convenient?) chain of derivatives:   sin(x) cos(x) -sin(x) -cos(x) sin(x) ...   An analysis of the shape of their graphs confirms some points; for example, when $\sin x$ is at a maximum, $\cos x$ is zero and moving downwards; when $\cos x$  is at a maximum, $\sin x$ is zero and moving upwards.  But these "matching points" only work for multiples of $\pi/4$.  Let us move back towards the original definition(s) of sine and cosine:  At the most basic level, $\sin x$ is defined as -- for a right triangle with internal angle $x$ -- the length of the side opposite of the angle divided by the hypotenuse of the triangle.  To generalize this to the domain of all real numbers, $\sin x$ was then defined as the Y-coordinate of a point on the unit circle that is an angle $x$ from the positive X-axis.  The definition of $\cos x$ was then made the same way, but with adj/hyp and the X-coordinate, as we all know.  Is there anything about this basic definition that allows someone to look at these definitions, alone, and think, "Hey, the derivative of the sine function with respect to angle is the cosine function!"  That is, from the unit circle definition alone.  Or, even more amazingly, the right triangle definition alone.  Ignoring graphical analysis of their plot.  In essence, I am asking, essentially, "Intuitively why is the derivative of the sine the cosine?"


Is there a way to create a kind of audit trail of what commands were run in bash together with timestamp? I know history logs all commands. But it doesn't add a timestamp to the history.

I would like to keep timestamps on the commands logged in my Bash $HISTFILE, is it possible?  I did not manage to set it up using man bash as an information source.   My other options are as follows:  function thebanana() {   local -r -a bash_commands=(     "ls"     # ... more coconut commands   )   for bash_command in "${bash_commands[@]}"; do     printf "${bash_command}"     printf ":"   done } export HISTFILE=banana export HISTIGNORE="$(thebanana)" export HISTSIZE=999999 export HISTFILESIZE=999999999 export HISTCONTROL=ignoredups:erasedups   I should have mentioned I am on OS X Mountain Lion (sigh). uname -a gives me:  Darwin CoconutMac.local 12.2.0 Darwin Kernel Version 12.2.0: Sat Aug 25 00:48:52 PDT 2012; root:xnu-2050.18.24~1/RELEASE_X86_64 x86_64   and echo $BASH_VERSION gives me:  3.2.48(1)-release   Tried adding this:  export HISTTIMEFORMAT='%b %d %I:%M:%S %p '   and it only prefixes this kind of timestamps to commands:  #1349057791   I try echoing back the variable (echo $HISTTIMEFORMAT), it has the right value.  Interesting!  I even removed .profile completely to debug this. Still only funny timestamps:  #1349058320   I don't know how to further troubleshoot this... :(  Solution: I was using a script that reads the $HISTFILE directly, not the history built-in so the epoch-based timestamp (secs since Coordinated Universal Time (UTC) of January 1, 1970) was not being translated using the date formatting string. Plain-old history works fine, I'll use that instead.


I have a SWF on SkyDrive in public folder. How can I get the link to this file so that using  tag it will be directly rendered on the webpage. I was unable to get such link that will allow to render the file. I tried Embed link. It showed the file icon instead of rendering. When clicked it redirected to the SkyDrive folder.  However I was able to do this on DropBox since it provides direct link to the file instead querying with resource id as in case of SkyDrive:  <html>    <head>    </head>    <body>       <embed src="https://dl.dropbox.com/u/93470848/helloworld.swf" />       <embed src="https://skydrive.live.com/embed?cid=B9A9203330B6DFFE&resid=B9A9203330B6DFFE%211085&authkey=AIRyW-raOQXH2-g" />     </body> </html>

I'm using Skydrive to host files for my blog, such as zip files of source code. I'm trying to provide direct links that users on my blog can click to immediately download the file in question, without being confronted with a Skydrive page filled with all the files related to all posts on my blog.  Is there a way to do this? I've tried getting a link to the file, shortening it et cetera, but visiting this link always shows the Skydrive page. Here is .  At this point I can only assume Skydrive is doing this on purpose and am also wondering whether there's another provider I can switch to that will yield a better user experience.


Villas and Farkas are always chasing after me with their weapons raised, but they won't attack me (I'm the companions harbinger). I just did the Liberation of Skyrim quest so I'm wondering if I accidentally killed someone with my shout? How can I fix this? I can't fast travel any more because they won't stop chasing me.

I was doing a quest for the companions. When I entered Jorrvaskr, Farkas pulled out his sword and began to talk to me. Every time I would try to leave the conversation he would just follow me and try to talk to me again. This lead to me paralyzing Farkas and running away.   By the time I got to the gates of Whiterun he had already gotten up, ran to me and started another conversation. I quickly made it to the gates and exited, he followed me through the gates but I whirlwind sprinted to Shadowmere then attempted to fast travel - which game me the "Can not fast travel when guards are pursuing you" message even though no guards were following me.   I knew Farkas wasn't far behind so I quickly jumped on a carriage and I traveled to the nearest hold which was Dawnstar. Now I can't leave Dawnstar because the same message appears. I have tried to pay off my debt to the Dawnstar guards but it didn't fix the problem. How can I resolve this issue?


I currently have several regular http servers and 1 https server. I would like to add another https server with the same public ip.  I have something similar to   server {     listen          443 ssl;     server_name     sub1.example.com;     ssl_certificate sub1.example.com.crt;     ... } server {     listen          443 ssl;     server_name     sub2.example.org;     ssl_certificate sub2.example.org.crt;     ... }   The issue I am encountering is with IE8. I receive sub1's certificate instead of sub2's. Other browsers do not have this issue. Upon reading  I see that I need to do something like this  server {     listen          192.168.1.1:443 ssl;     server_name     sub1.example.com;     ssl_certificate sub1.example.com.crt;     ... } server {     listen          192.168.1.2:443 ssl;     server_name     sub2.example.org;     ssl_certificate sub2.example.org.crt;     ... }   I am unsure how to actually set up or allocate the IPs. I tried just placing those IP from above into my nginx conf but it didn't work. After restarting nginx neither of my sites worked. When I try to load the website I get an error saying it couldn't connect to the server.  I have CentOS 6.5 and Nginx 1.6

By now I've not used SNI with nginx yet. But as IP address pools are quite filled and commercial XP support is about to cease (finally) I'm thinking about converting a few sites to SNI.  I'm aware of the general limitations and pitfalls that might come along with SNI (XP issue, very old browsers). But beyond that is there anything I should be aware of?   Like - nginx related pitfalls when using SNI - issues/bugs with recent (notable!) browsers


Can you recommend an open source Java library (preferably ASL/BSD/LGPL license) that converts HTML to plain text - cleans all the tags, converts entities (&,  , etc.) and handles <br> and tables properly.  More Info  I have the HTML as a string, there's no need to fetch it from the web. Also, what I'm looking is for a method like this:  String convertHtmlToPlainText(String html)

Is there a good way to remove HTML from a Java string? A simple regex like replaceAll("\\<.*?>", "")   will work, but things like &amp; wont be converted correctly and non-HTML between the two angle brackets will be removed (i.e. the .*? in the regex will disappear).


Ever since I first watched Inside Out, I've always wondered why Riley's emotions all had such different designs. When it shows her mom's, they all have similar hair and glasses and they're all female, her dad's all have suits and mustaches and they're all male, and the curly headed kid's all have curly hair and hats and were all boys. Riley's emotions all have very different appearances and different genders, and I never really understood why that was.I don't know if it's just to make Riley's character stand out, or if it was just part of the design process, but I was always just curious.

In the movie Inside Out, I found that the personified emotions Anger and Fear inside the main character (Riley) are male whereas Joy, Disgust and Sadness are female. Is there any reason why it has been designed like that for a 11 year old girl?  In  we see that the emotions inside the mother are all female, while the ones inside the father are all male. On top of that, while each emotion (Anger, Joy, etc) look alike from person to person, all the emotions inside the mother and the father look like them (The mother's emotions all have her same haircut & glasses, the father's have his haircut & mustache).  Is there a in world or out of universe explanation for the mix & match look of Riley's emotions?


Does $$\sum_{n≥2}\frac{1}{n (\ln(\ln n))^a}$$ converge if a>1 ?  I already know that $$\sum_{n≥2}\frac{1}{n (\ln n)^a}$$ and $$\sum_{n≥2}\frac{1}{n \ln n  (\ln(\ln n))^a}$$ converge if a > 1.

Lets have this problem. $$\sum_{n=3}^\infty\frac{1}{n (\ln(n))^p(\ln\ln(n))^q}$$ I have rewritten this to a form $$\sum\frac{1}{np'^{\ln\ln(n)}q'^{\ln\ln\ln(n)}}$$ For $p,q\in\mathbb{R}$. Obviously, $p',q'>0, p=\ln(p'),q=\ln(q')$


I am having some questions on the ordering of indices that are both upstairs and downstairs. Let's take an example: $\Lambda^\mu_{\space\space\nu}$ is a Lorentz transfom if the following equation is satisfied: $$ \Lambda^\mu_{\space\space\sigma} \eta^{\sigma \tau}\Lambda^\nu_{\space\space\tau}=\eta^{\mu \nu}. $$ In matrix notation that means $$ \Lambda \eta^{-1}\Lambda^T =\eta^{-1}. $$ My question is: why must we place $\mu$ before $\nu$ in the expression $\Lambda^\mu_{\space\space\nu}$? (rather than just vertically above it) I have thought about this for a moment, and get the following ideas:  Putting $\mu$ before $\nu$ reminds us to write the notation is the usual order of matrix multiplication. Usually we write $\Lambda^\mu_{\space\space\nu} x^\nu$ rather than $ x^\nu\Lambda^\mu_{\space\space\nu}$, because we'd like $\nu$'s to be "closer together". This matches our ordering of writing a matrix multiplying a (contravariant) vector $\Lambda \mathbf x$. There are exceptions to point 1, for example $\Lambda^\mu_{\space\space\sigma} \eta^{\sigma \tau}\Lambda^\nu_{\space\space\tau}$, because here we are transposing the second Lorentz matrix. However, if we have more than two indices, the above ideas make little sense. If we have and expression like $A^{\mu_1\mu_2 \ldots \mu_k}_{\nu_1 \nu_2 \ldots \nu_l} x^{\nu_1}\ldots x^{\nu_n}y_{\mu_1}\ldots y_{\mu_n}$, who knows what is the "correct" order of indices of $a$ and $x,y$? Mathematically there doesn't seem to be a reason for a particular ordering, because a tensor product of vector spaces does not depend on the order (up to isomorphism) in which we take the product.  Are the above observations correct? Are there any other reasons for the ordering? Finally, will we ever see something like $$ \Lambda^{\space\space\mu}_{\sigma}? $$ i.e. downstairs before upstairs.

A Lorentz transformation between two different coordinate systems is given by:  $$(x')^\mu = {\Lambda^\mu}_\nu~ x^\nu$$  where $\Lambda$ is the Lorentz transformation matrix. I am a bit confused by the ordering of the indices using this notation, that is why do we write ${\Lambda^\mu}_\nu$ instead of $\Lambda^\mu_\nu$ or ${\Lambda_\nu}^\mu$. Is there an explicit convention of which index comes first in the left-to-right ordering? Is ${\Lambda_\nu}^\mu$ different from ${\Lambda^\mu}_\nu$ and if yes, how do they relate to each other.  What about the ordering of the indices from left to right of the general tensor? Does the order here just specify which position in the "N-dimensional matrix" we are considering, i. e. first index gives the row, second the column, third the "depth", etc.?  Any help in clarifying these points will be greatly appreciated.


$R=\{a+bi|a,b\in \mathbb{Z}\}$, Prove $R/(1+i)$ is a field.   I can write the element of $R/(1+i)$  exactly. Actually $R/(1+i)=\{\bar{0},\bar{1}\}$. And I can examine every condition that make a set to be a field. But I think this makes it a little inelegant. What's the more effective ways.

I understand geometrically why the Gaussian integers modulo $i+1$ is $\mathbb{Z}_{2}$, using lattices. Is there an algebraic isomorphism construction, however?


Making cinnamon buns and recipe calls for dry yeast, I don't have any yeast and was hoping someone has encountered same issue.  Any suggestions to alternatives?

I was wondering if I could get some advice as I have intolerances to yeast and have heard of a few substitutions from: baking soda, baking powder, lemon juice, milk and yogurt. The question comes to how do I measure these into bread or baking to make whatever I am making rise? I have heard that in the middle east they rarely use yeast for bread baking and their bread still rises. I just don't know the proper measurements I would use, if a bread recipe calls for 1 or 2 packets of yeast and mixing them in water do you mix one tsp of baking soda and 1 tsp of lemon juice in together?   If you can give me any advice on this that would be greatly appreciated, thanks.


I am having problems when I run: sudo apt-get update  I get a few 404 not found errors, as seen in  and the following text:  E: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/bionic/main/binary-armhf/Packages  404  Not Found [IP: 2001:67c:1560:8001::14 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/bionic-updates/main/binary-armhf/Packages  404  Not Found [IP: 2001:67c:1560:8001::14 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/bionic-backports/main/binary-armhf/Packages  404  Not Found [IP: 2001:67c:1560:8001::14 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/bionic-security/main/binary-armhf/Packages  404  Not Found [IP: 2001:67c:1560:8001::14 80] E: Some index files failed to download. They have been ignored, or old ones used instead.   I'm not sure what is causing this, I tried changing the update server, and I tried using a VPN to ensure my IP hasn't been blacklisted. Neither of those worked. Anyone know how to fix this? I am using Ubuntu 18.04  I tried , but that didn't fix the problem. Below is my /etc/apt/sources.list:  # deb http://security.ubuntu.com/ubuntu/ bionic-security main deb http://archive.ubuntu.com/ubuntu bionic main universe deb http://security.ubuntu.com/ubuntu/ bionic-security main universe deb http://archive.ubuntu.com/ubuntu bionic-updates main universe   If I comment out everything in /etc/apt/sources.list, then I do not get any errors, but it does not check for Ubuntu updates as seen below:  $ sudo apt-get update Hit:1 http://linux.teamviewer.com/deb stable InRelease Hit:2 http://linux-packages.resilio.com/resilio-sync/deb resilio-sync InRelease Hit:3 http://ppa.launchpad.net/bitcoin/bitcoin/ubuntu bionic InRelease         Reading package lists... Done   I also tried leaving 1 line uncommented at a time, to see if any of them would work, but they all caused errors.  I do not believe IPv6 is the issue, as I was able to run ping6:  $ ping6 2001:67c:1560:8001::14 PING 2001:67c:1560:8001::14(2001:67c:1560:8001::14) 56 data bytes 64 bytes from 2001:67c:1560:8001::14: icmp_seq=1 ttl=54 time=90.4 ms 64 bytes from 2001:67c:1560:8001::14: icmp_seq=2 ttl=54 time=89.8 ms 64 bytes from 2001:67c:1560:8001::14: icmp_seq=3 ttl=54 time=86.7 ms 64 bytes from 2001:67c:1560:8001::14: icmp_seq=4 ttl=54 time=86.2 ms 64 bytes from 2001:67c:1560:8001::14: icmp_seq=5 ttl=54 time=95.2 ms   Running dpkg --print-foreign-architectures returned:  i386 armhf   I tried using ports.ubuntu.com by adding deb http://ports.ubuntu.com/ubuntu-ports bionic main to my /etc/apt/sources.list, as shown in , but I still got the same errors.  I am ultimately trying to install a Nextcloud server, but I'm unable to install MariaDB for it, and I think this update issue the cause.

I am using Ubuntu 16.04 Beta 2 at the moment and every time I try to update at home via sudo apt-get update or upgrade trough sudo apt-get upgrade I wont get any feedback. Even installing of anything will have the same result. It will just "hang up" on 0% while fetching data.  $ sudo apt-get update [sudo] password for niclas:  0% [Connecting to archive.ubuntu.com (2001:67c:1560:8001::11)] [Connecting to archive.canonical.com (2001:67c:1360:8c01::1b)]   I have no idea how to solve the problem. I already tried to ping6 archive.ubuntu.com with 100% packet loss while just ping wont have any loss.  I changed the DNS-Server (IPv4 & IPv6) to Google's one no solution either.


I am trying to create an alias for redirecting both standard output and standard error of gedit to /dev/null, whilst sending the command to background.  This works:  $ alias gedit='gedit $1 > /dev/null 2>&1' $ gedit file.txt &   However, adding the background instruction & to the alias string fails to work because it gets immediately interpreted:  $ alias gedit='gedit $1 > /dev/null 2>&1 &' [1]+  Done                    gedit > /dev/null 2>&1   How should I add this & background instruction to the alias command?

For bash script, I can use "$@" to access arguments. What's the equivalent when I use an alias?


I am frequently using public WiFi, or in Hotels etc. When checking e-mails, I always look in the browser to see if the traffic goes through a https:// website.  Is it possible that the router my traffic goes through is manipulated? E.g. if it uses its own server but says it is gmail? Then it would be possible to retrieve the passwords and data I sent to their server (even if the browser says it is gmail)? Sorry if it is kind of a naive question.

Is it possible for my ISP to see the passwords that I enter on websites and in chat programs? And what about SSL websites that start with https, do they encrypt my username and password before reaching the ISP?


Wondering if having identical, verified correct by the Google Structured Data Testing Tool, JSON-LD Schema data on index and the same JSON-LD Schema Data on all subpages would create any sort of problem with google search engine?  Could this be hurting my ranking?  Webmaster Console recognizes pages with it, and is not complaining.

We have added JSON-LD structured data to our website, so Google knows information about our company (company name, url, logo, address, etc.). We worked from the template on Google's .  One thing I couldn't find an answer to is where exactly should this JSON-LD snippet be included on our website? Right now, I only have it on our home page. I didn't know if it would look bad to search engines to have the Organization markup on every single page. But is there any recommendation?  Should Organization markup about our company be included on every page or only on certain pages?


Most monitors I use come with a driver. These drivers usually have an .icm file. When I install the driver, the icm is also installed and associated to that monitor. What I notice is that these icm files always causes the color to seem "washed-out". Vibrant colors become noticeably unsaturated. For example, I have Dell S3220DGF. The monitor can display 90% DCI-P3, but it looks as if the  forces the monitor to only display the limited colors in sRGB colorspace. In contrast, if I calibrate the monitor with DisplayCAL and apply that icm, there is no such problem. So what does these driver icm do at all? Should I use them or not? S3220DGF icm profile information:

I have download the ICM profile for my monitor but Windows XP shows me colors in a way, Firefox and GIMP in another.  So my question is what really is an ICM profile and how Windows and other application software manage it?


I am running a logistic regression model in R using glm. I received a warning that complete separation occurred. How do I determine which variable is causing this? R doesn't tell you what variable is the issue.

If you have a variable which perfectly separates zeroes and ones in target variable, R will yield the following "perfect or quasi perfect separation" warning message:  Warning message: glm.fit: fitted probabilities numerically 0 or 1 occurred    We still get the model but the coefficient estimates are inflated.   How do you deal with this in practice?


All i need to know is from   where can i see whose viewed my profile? where can i see whose downvote and upvoted my question and answere? where can i see whose viewed my questions?   Is there a feature in stackoverflow so user can find above information.

Is there a way to see who voted (upvotes and/or downvotes) on your answers and/or questions?


I have an exercise where I need to manipulate different sets of ideals. So suppose you have $I$ and $J$ two ideals, then what would $IJ$ be equal to? Would it be $$IJ =I \times J = \{(i,j)| i \in I, j \in J \} $$ Or maybe $$IJ= \{ij| i \in I, j \in J \}$$  Or something else?

Where does the "naive definition" of the product of two ideals $I$ and $J$, $IJ = \{ ij \mid i \in I, j \in J \}$ fall apart? (The product of two ideals $I$ and $J$ is defined to be $IJ := \sum_i a_ib_i$, where each $a_i$ is in $I$ and each $b_i$ is in $J$.)  Note: This is a question from a problem set I'm working on. I am not expecting a full solution for the answers, but I'd like some help knowing where to look. It seems to work fine in $\mathbb{Z}$ and $\mathbb{C}[x]$.


An $\mathbf{R}$-sequence is a sequence $(c_1,\ldots,c_n)$ of integers $c_i\geq -1$ such that $c_1+\cdots +c_n=0$ and for all $1\leq i \leq n$, $c_1+\ldots+c_i\geq 0$. For each $n\in \mathbb{N}$, determine the number of $\mathbf{R}$-sequences of length $n$.  An approach I have been considering is to compute the number of $\mathbf{R}$-sequences by constructing a surjective function $f:\mathcal{M}\rightarrow\mathbf{R}$, where $\mathcal{M}$ is the set of Motzkin paths (2D lattice paths that start at $(0,0)$ with NE,E,SE steps, ending at $(n,0)$ and never going below the $x$-axis) and determining the size of the pre-image $|f^{-1}(R)|$ for each $R\in \mathbf{R}$. Indeed, given a Motzkin path $\mathcal{P}$, for each strictly rising NE-subsequence $r_1,\ldots,r_\ell$ of $\mathcal{P}$ there are $comp(\ell)=2^{\ell-1}$ ways to construct that corresponding segment of the corresponding $\mathbf{R}$-sequence. So if $\mathcal{P}$ has $k$ rising NE-subsequences each with length $\ell_k$, there are $$\frac{2^{\sum_i^k \ell_i}}{2^k},$$ possible $\mathbf{R}$-sequences. So we have reduced the problem to determining the number and length of each of such rising subsequences in the set of Motzkin paths. For completeness, the generating function for class of Motzkin paths is given by $$M(x)=\sum_{n=0}^\infty \sum_{k=0}^{\lfloor n/2\rfloor}\binom{n}{2k}\frac{1}{k+1}\binom{2k}{n}x^n,$$ where $$m_{n,k}=\sum_{k=0}^{\lfloor n/2\rfloor}\binom{n}{2k}\frac{1}{k+1}\binom{2k}{n},$$ is the number of Motzkin paths of length $n$ with $k$ NE-upsteps.  Looking for any insights into making this work, or another valid approach to counting these objects.

I need help in prooving that the cardinal number of the following set is $C_{n}$:  The set of all sequences   $a_{1}, a_{2}, .., a_{n} \in \mathbb{Z} \\ s.t \\ a_{1}+a_{2}+....+a_{n} = 0$  and for every $1 \leqslant i \leqslant n$ , $ a_{i}\geq -1$ and $a_{1}+a_{2}+....+a_{i}\geq 0$  For example, if $n =3$:  the series in the set will be: $(0, 0, 0),(0, 1, −1),(1, 0, −1),(1, −1, 0),(2, −1, −1)$  EDIT: I thought of presenting the problem using parenthesis. Every sequence as a total equal number of "(" and ")". Every sub-sequence has more "(" than ")".  $0$ is presented by "$\color{blue}(\color{blue})$",   $1$ by "$\color{red}($"   $-1$ by "$\color{green})$"  The problem is that the number of parentheses isn't fixed for a given $n$. For example when $n=2$ the series could be $\color{blue}(\color{blue})\color{blue}(\color{blue})$ or $\color{red}(\color{green})$   Also, I don't know how to "translate" the term $ a_{i}\geq -1$  And for $n=3$ the representation of the sequences $(0,1,-1)$ and $(1,-1,0)$ is the same - "$()()$"


While having this conversation with my manager, my manager wanted to discuss few things with me. So since I was busy with another project which one is appropriate to use? "Can I please call in few minutes" or "May I please call in few minutes"?

Just now, I wanted to ask a question that was something like, "Can I get a thorough list of all the parts of speech that a sentence can be broken down into?" But then a nagging voice appeared in my head and said,  "Of course you can! You certainly have the capability -- but that's not what you want, is it." "You're asking for help, so use may."  My question is: Should I invariably trust that voice, instilled in students by grammar school teachers everywhere? What do serious linguists and language enthusiasts think about the "Can I"/"May I" distinction?  Would they agree, or is it fair to say that using "can" there has become proper idiomatic English? I ask because I couldn't really think of a quick way to rephrase that sentence using "may", and began to wonder whether it was just another one of those kludgy myths megalomaniac teachers enforce on their students...


I can't make out which one of these questions is correct: "What impressed him most?" or "what impressed him the most?" If both are correct, what is the difference in meaning and what kind of context do they derive from?

(1) She says the U.N.  does not have  enough food for all  of the   refugees, so  it  helps  those  most at risk.      (2) Last year, U.N. agencies  worked to establish who were the most   at risk among all registered Syrian refugees.   How should I understand "most " in (1)sentence and "the most" in (2)sentence?  Are they the same? Do they both modify the words at risk in the same way?


I don't know how it's supposed to work, but I think it doesn't work at all right now.  Try clicking the lowest link in this widget:    I just get the list of all sites and on top of the page despite the anchor link in the url.

Currently, on all beta sites, the current site stats is placed prominently on the front page, which is great for knowing how the site is currently doing.  However, it doesn't say anything about the trend of the numbers - whether the site is sailing or it is sinking compared to the last month. According to Madara Uchiha, our moderator on Anime & Manga SE, . Disregarding data which are not already public, , I can't see any reason why we are not allowed access to graphical representation of public site statistics. In fact, there is already a third-party app that scraps the information from the home page and . Can we have a beautiful visualization on how our beta sites evolve over time, from pony to unicorn?   Images stolen borrowed from Bulbapedia


I have Ubuntu 17.10 on my PC, and I have installed gparted. But it seems that I can't add the unallocated space to /dev/sda4, because I can't move it down.    I have looked online, but found nothing.

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


Let $R$ be a commutative ring with identity such that every ascending chain of ideals terminate. Let $f:R \to R$ be a surjective homomorphism. Prove that it is an isomorphism.

I am revising for my Rings and Modules exam and am stuck on the following two questions:  $1.$ Let $M$ be a noetherian module and $ \  f : M \rightarrow M \  $  a surjective homomorphism. Show that $f : M \rightarrow M $ is an isomorphism.  $2$. Show that if a semi-simple module is noetherian then it is artinian.  Both these questions seem like they should be fairly straightforward to prove but I cannot seem to solve them.


I want a Regex for the Saudi national ID  The length is always 10 numbers  It always starts with "1" or "2"

I don't really understand regular expressions.  Can you explain them to me in an easy-to-follow manner?  If there are any online tools or books, could you also link to them?


What does the symbol := mean in mathematics? for example, C(continuum) := |R|

I am sorry if this is quite elementary question. But I always think, that why we use $:=$ at some places, instead of $=$. Is there any fundamental difference between these two? Before reading Terry Tao's blog (4 months ago), I had never seen a symbol like this (:=).


We on earth see the space black only at night. But on moon it observed that the space is black in both day and night even though the source is same for both ( the sun).Why?  And also there are many other stars in this universe which make the background bright, but why the space still black?

Why is the sky of the moon always dark compared to the sky of the earth, doesn't it have day and night like earth?


I am a GIS newbie. I'm having a problem that, from the looks of things on this website, is a fairly common problem. I have 3 layers, all in the same GCS that do not line up. I have read all the the strings that others have posted on this website regarding this kind of problem, but I still haven't been able to figure out how to fix my particular issue. I am just a social studies student, trying to do a project. I don't have GIS training, so I feel very lost at sea, with all the complex technical terminology.  Here are the details:   I am working with data for the City of Chicago, USA. I have a street map for Chicago (chicagostreets1999, derived, I think from the US Census), a map of census tracts for the year 2000 (tracts2000, from the US census), and a zoning map (Zoning_nov2012, provided online by the Chicagy City Hall).   Census tract boundaries run along streets. The tract boundaries in tracts2000 line up nicely with the street map from chicagostreets1999. Zoning boundaries also follow streets, but the zoning map does not line up properly with these two other files. When I compare the zoning map to the street file, its lines are about 175 feet (53 meters) south, and 148 feet (45 meters) east of the relevant lines on the street map.  I looked at the "source" information on each file in arcGIS. Here is the info on their Geographic Coordination Systems.  Tracts 2000***** Data Type:  Shapefile Feature Class  Geometry Type:  Polygon  Geographic Coordinate System:   GCS_North_American_1983 Datum:  D_North_American_1983 Prime Meridian:     Greenwich Angular Unit:   Degree ![Misalignment, zoom in][1\  *Chicago streets 1999****  Data Type:  Shapefile Feature Class  Geometry Type:  Line  Geographic Coordinate System:   GCS_North_American_1983 Datum:  D_North_American_1983 Prime Meridian:     Greenwich Angular Unit:   Degree  **Zoning_nov2012*******************  Data Type:  Shapefile Feature Class  Geometry Type:  Polygon  Projected Coordinate System:      NAD_1983_StatePlane_Illinois_East_FIPS_1201_Feet Projection: Transverse_Mercator False_Easting:  984250.00000000 False_Northing: 0.00000000 Central_Meridian:   -88.33333333 Scale_Factor:   0.99997500 Latitude_Of_Origin: 36.66666667 Linear Unit:    Foot_US  Geographic Coordinate System:   GCS_North_American_1983 Datum:  D_North_American_1983 Prime Meridian:     Greenwich Angular Unit:   Degree  I tried setting the coordinate system for all three files by double clicking the "Layer" meta-category in the data view window, and then selecting "Coordinate System" within the data frame properties window. The coordinate system was already defined as:  *Layers**** NAD_1983_StatePlane_Illinois_East_FIPS_1201_Feet Projection: Transverse_Mercator False_Easting: 984250.000000 False_Northing: 0.000000 Central_Meridian: -88.333333 Scale_Factor: 0.999975 Latitude_Of_Origin: 36.666667 Linear Unit: Foot_US  GCS_North_American_1983 Datum: D_North_American_1983  This seemed to be the same as all three layers, so I did not change it.   I asked the GIS librarian at my university what the problem might be and what, if anything could be done, to fix the misalignment. He said that he did not know how to fix it, and that the problem was probably due to the City Hall GIS people scanning in their zoning map "at a different scale" than the Census people did. I don't know whether that is true, but I really would like to get these files to align properly with each other. It will make the process of analysis a lot easier (ie not horribly visually confusing), and also more accurate.  I am happy to share the files in question with anyone who might be able to help. The Zoning data, for instance, is freely available here on the City of Chicago's City Hall government website:     I can email the street file to anyone who is willing to help.  Thanks so much for your advice!

I put 4 different layers into my ArcMap document, but only one of them will show up on the map! I should be seeing the other 3 layers as well. When I do a Zoom to layer, I can see one layer, but I cannot figure out how to make the other 3 show up at once on top of each other.  Before I opened ArcMap, I used ArcCatalog where I right-clicked 3/4 of the shapefiles and  clicked Properties → Coordinate system → Import and then clicked on my Trees layer, which has the coordinate system I want the other 3 to have. But when I opened ArcMap the 4 layers did not overlap, nor could I move them above or below each other.


I have a Google Spreadsheet with two sheets. The first uses formulas to manipulate the second sheet row by row, and the second is fed by a Google form. My first sheet has formulas as such:  A2: int('Form Responses 1'!A2) B2: 'Form Responses 1'!B2&" and "&'Form Responses 1'!C2  This is copied down 100 rows, where each row references the same row in the second sheet. However, when I submit the Google form, the formulas point to the next row, skipping entirely over the form data.   If I submit the form once: A2: int('Form Responses 1'!A3) B2: 'Form Responses 1'!B3&" and "&'Form Responses 1'!C3  Each row points to the next row in the second sheet. This repeats for every form submition, so after three submitions, the formulas look like:  A2: int('Form Responses 1'!A5) B2: 'Form Responses 1'!B5&" and "&'Form Responses 1'!C5  I can also reproduce this problem if I insert a row above the row where the formulas point to. It seems they point to an actual row, and move their references when the row moves, rather than pointing to a certain row number and column number. How can I get out of this?

I have a sheet with form response data in several columns, say A:G. Some of the data are numerical and I'd like to have some calculations done on them, e.g. in columns H through J. I have already found out any stretched formulas get wiped out as new lines from the form get pulled in.  So I created a new sheet, imported the data using arrayformula, but still, I don't know how to have a formula for every row in columns H:J (except the header). I can only stretch the formula within a fixed number of rows, but don't know how to make it autoadjust to newly incoming data.  I wondered if I could use a script that would be triggered with the form being submitted, adding the formulas to the new lines, but that's rather inelegant.  : Sheet1 contains form data, Sheet2 imports them using arrayformula.


I am new to multithreading in Java and EJB too. I have a scenario where I have to hit a web service concurrently using threads. I have got two approaches for that.   Using ExecutorService with Callable to hit the service concurrently. Using @Asynchronous annotation of EJB.   What I have read is: EJB recommends to use @Asynchronous over writing our own threaded implementation. After reading this I am confused about why EJB says so. Because underneath EJB works on JVM and all threads will be created from JVM. So why EJB restricts us on using it's @Asynchronous rather than our implementation.  I searched on google but did not found any satisfactory answer. If anyone knows the details of thread creation and management in EJB please clear my doubts.

One of the first things I've learned about Java EE development is that I shouldn't spawn my own threads inside a Java EE container. But when I come to think about it, I don't know the reason.  Can you clearly explain why it is discouraged?   I am sure most enterprise applications need some kind of asynchronous jobs like mail daemons, idle sessions, cleanup jobs etc.  So, if indeed one shouldn't spawn threads, what is the correct way to do it when needed?


I am a home owner & have just replaced the sloped ramp to our storage shed with 1/2" PT 2 weeks ago.  We live in the Atlanta, GA area so temps have been 90s for highs, with showers frequently.  1)  How long do I wait to paint ramp?  & 2)  do I prime before painting?

My husband is installing a new deck with pressure-treated lumber at our home in Tennessee.   How long does he need to wait to paint, or should he stain the deck now?


I want to prove that: $\ln(x+1)< x$.  My idea is to define:  $f(x) = \ln(x+1) - x$, so:  $f'(x) = \dfrac1{1+x} - 1  = \dfrac{-x}{1+x} < 0, \text{ for }x >0$.  Which leads to $f(x)<f(0)$, so $\ln (x+1)-x<0$.  Is that a valid proof? Any other ideas?  Thanks.

I want to show that $$\frac{x}{1+x}<\log(1+x)<x$$ for all $x>0$ using the mean value theorem. I tried to prove the two inequalities separately.  $$\frac{x}{1+x}<\log(1+x) \Leftrightarrow \frac{x}{1+x} -\log(1+x) <0$$  Let $$f(x) = \frac{x}{1+x} -\log(1+x).$$ Since $$f(0)=0$$ and $$f'(x)= \frac{1}{(1+x)^2}-\frac{1}{1+x}<0$$ for all $x > 0$,  $f(x)<0$ for all $x>0$.  Is this correct so far?  I go on with the second part: Let $f(x) = \log(x+1)$. Choose $a=0$ and $x>0$ so that there is, according to the mean value theorem, an $x_0$ between $a$ and $x$ with   $f'(x_0)=\frac{f(x)-f(a)}{x-a} \Leftrightarrow \frac{1}{x_0+1}=\frac{ \log(x+1)}{x}$.  Since $$x_0>0 \Rightarrow  \frac{1}{x_0+1}<1.$$ $$\Rightarrow 1 > \frac{1}{x_0+1}= \frac{ \log(x+1)}{x} \Rightarrow x> \log(x+1)$$


Boot stops at - /dev/sda1 clean message Ubuntu 18.04 LTS  fstab UUID=af55b809-e9eb-4766-b06f-64e0897eab6b /               ext4    errors=remount-ro 0       1 /swapfile                                 none            swap    sw              0       0  blkid /dev/sda1: UUID="af55b809-e9eb-4766-b06f-64e0897eab6b" TYPE="ext4" PARTUUID="bcd123f6-01"  I also removed nvidia drivers sudo apt-get purge *nvidia  The only difference is that now current kernel doesnt blink with /dev/sda1 clean message.

I'm using Ubuntu 11.04 and I want to free up some space in my root directory, which is overloaded. I especially want to change the path used for installing applications (they are getting installed directly to the root drive).  Another consideration is that I'm working on a MySQL database server. The server is installed in the root directory itself, so I don't want to  risk losing any data.  Please give me some tips to help sort out this problem.


So I'm about to come to the end of my stay in Spain on my Youth Mobility Visa. Now I just married my partner and we have an appointment to get my residency card here, but it is after the expiry date of my visa. As an Australian, I get a 90-day tourist visa. Do I need to leave the country and get another entry stamp? or once my visa is expired, or do I just move onto the 90-day tourist visa?  Thanks for your help

I have a 1-year residence permit from one Schengen country that is now expiring. Upon its expiration, I would like to get my 90/180 days validity as a tourist to stay, or return here as soon as possible.  I understand that the tourist short-stay scheme is based on the 90/180 days "counter". But what happens if my previous stay was not tourism but residence (as searching year). Wouldn't that mean that I can quickly exit and re-enter the Schengen area to activate my tourist stay?   Also, is there a way to change this purpose of stay without exiting the Schengen area?


I'm working on a dynamic calendar that allows user to click on individual days to change whether they're available or unavailable. It works as it's supposed to up until I select another month or year. Once that happens the "click" event on individual cells/days doesn't work.   // Changes cell background of the calendar var changeColor = function(temp) { // if cell background is white -> change to green if(temp.css('background-color') == "rgba(0, 0, 0, 0)") {     temp.css('background-color', 'green');     // if cell background is green -> change to red } else if (temp.css('background-color') == "rgb(0, 128, 0)") {     temp.css('background-color', 'red'); } else {     // else change back to white     temp.css('background-color', ''); } };   Here is were it's used   $(document).ready(function() { // When a date-cell is clicked - changes color to green -> red -> white $(".calCell:not(.empty)").click(function() {     changeColor($(this)); });  });   The two buttons that change the whole calendar to red or green seem to work fine with each month selected.   // When Available button is click -> changes whole calendar to available $("#yes").on("click", function() {     $(".calCell:not(.empty)").css('background-color', 'green'); });  // When Unavailable button is clicked -> changes whole calendar to unavailable $("#no").on("click", function() {     $(".calCell:not(.empty)").css('background-color', 'red'); });   Example:

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


Can anybody share Regular Expression below example:  minimum 3 alphanumeric and then add only one '@' then again minimum 3 alphanumeric  example: rohit@tcs or himansu@infosys

Over the years I have slowly developed a  that validates MOST email addresses correctly, assuming they don't use an IP address as the server part.  I use it in several PHP programs, and it works most of the time.  However, from time to time I get contacted by someone that is having trouble with a site that uses it, and I end up having to make some adjustment (most recently I realized that I wasn't allowing 4-character TLDs).  What is the best regular expression you have or have seen for validating emails?  I've seen several solutions that use functions that use several shorter expressions, but I'd rather have one long complex expression in a simple function instead of several short expression in a more complex function.


It is  that the Harmonic numbers  $$H_n=\sum_{k=1}^n \frac{1}{k}$$  are never integers for $n>1$.  Can the difference of two Harmonic numbers  $$H_n-H_m=\sum_{k=m+1}^n \frac{1}{k}$$  be an integer if $n>m>1$?

Assume that $k,n\in\mathbb{Z}^+$. Prove that the sum \begin{equation*} \dfrac{1}{k+1}+\dfrac{1}{k+2}+\dfrac{1}{k+3}+\ldots +\dfrac{1}{k+n-1}+\dfrac{1}{k+n} \end{equation*} is not an integer.   The case $k=0$ is proved in this question: ""


I am getting the following error.    Attempt to invoke interface method 'java.util.concurrentScheduledFuture java.util.concurrent.ScheduledExecutorService.scheduledWithfixdedDelay(java.lang.Runnable, long, long, java.util.concurrent.TimeUnit)' on a null object reference.     I do not see what is null here.    I have read     and I do not see what is null here.  All the values are filled in manually, and task1 is set by Runnable.  What am I missing or doing wrong here?  // Here are the relevant imports (I think);  import java.util.concurrent.ScheduledExecutorService; import java.util.concurrent.ScheduledFuture;   // Here I setup backgroundExecutor  ScheduledExecutorService backgroundExecutor;     // Here is the start for the runnable process to be delayed.      public void start() {     Runnable task1=new Runnable() {         public void run() {             pauseFunction();         }     };      backgroundExecutor.scheduleWithFixedDelay(task1, 5, 0, TimeUnit.SECONDS); }   I am expecting the TimePassed function to be called with a true.    However I am getting the above Null error.

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?


While doing other projects I discovered that my receptacles (garage ceiling) are 15 amp rated but are on 20 amp circuit. House is 20+ years old. What does it mean?  20-year old code allowed this? Special case for garage ceiling receptacles? House was not built according to the code? Somebody did the work not according to the code afterwards (previous owner)?  Also - these receptacles are not GFCI protected. Inspector did mention another not protected receptacle (at the time code didn't require it) but didn't mention that these receptacles need to be protected. Does it mean there is something special in this case?

I have noticed in a few different houses in Oklahoma that 20 amp breakers are used, but all of the outlets and switches only seem to be rated for 15 amps. This goes against everything I know to be proper and safe. The wire used is 12 gauge, so at least that is fine.  I have started to replace all of the switches and outlets with the decorative switches (the rectangular ones) and have found it very difficult to find switches that are rated for 20 amps. As for the outlets, I have can find them rated for 20 amps, but not in the 10 packs that I see for the 15 amp versions. To be clear I am not speaking about the shape of the plug, rather I am talking about the rating of the internal components of the outlet.  Is there something about electrical code that I am missing?


How do you prove that a number is divisible by 3 iff the sum of its digits is divisible by 3? Please avoid using the modulus or any other operations or advanced terminology from number theory because I have never taken that class.

The divisibility rule for $3$ is well-known: if you add up the digits of $n$ and the sum is divisible by $3$, then $n$ is divisible by three.  This is quite helpful for determining if really large numbers are multiples of three, because we can recursively apply this rule:  $$1212582439 \rightarrow 37 \rightarrow 10\rightarrow 1 \implies 3\not\mid 1212582439$$ $$124524 \rightarrow 18 \rightarrow 9 \implies 3\mid 124524$$  This works for as many numbers as I've tried.  However, I'm not sure how this may be proven.  Thus, my question is:     Given a positive integer $n$ and that $3\mid\text{(the sum of the digits of $n$)}$, how may we prove that $3\mid n$?


How much of an impact would the discovery of an exact formula that is equivalent to the prime counting function have on the mathematics community and acedemia as a whole?

Is the below formula for the $n^{th}$ prime number in elementary functions useful somehow?  $$p(n)=\sum _{a=2}^{2^n} \sin \left(\pi  2^{\left(n-\sum _{b=2}^a \frac{\sin ^2\left(\frac{\pi }{b}((b-1)!)^2\right)}{\sin ^2\left(\frac{\pi }{b}\right)}\right)^2-1}\right)\frac{a \sin ^2\left(\frac{\pi }{a} ((a-1)!)^2\right) }{\sin ^2\left(\frac{\pi }{a}\right)}.$$


I have an AJAX call when the user enters the parameters, which the MySQL database returns a row, and shows it to the user through a table. I want to have it so that when they click a row, it calls back for the MySQL database, using a unique hash, to get the contents of the row that they clicked and show it in a div. So for instance, if there's a table like  JOHN | 21 | foo.com AMY  | 29 | bar.com   that the MySQL database returned, the user can click on the row John | 21 | foo.com and get something like  John have been working at foo.com for 22 years...   on the div below the table. I've been able to work out most of it, but having the row be clickable is a bit of a challenge. Since I have Jquery, if I do something like  $('.dashboard_main_row').click(function(){             alert('This is an alert');         });   It doesn't work, as I assume the AJAX call is made after the page has been loaded, although it does on something like a static webpage in jsfiddle. So I have two questions:   How would I implement this in JQuery where the rows are getting re-generated every time the user desires? How can I have a row be identifiable so that if they click john I get the contents of john not amy? (I do have a column hidden by CSS where it does show unique hashes.)   EDIT: I did try the method that the one the mod linked as "duplicate":  $('.dashboard_main_row').on('click', 'tr', function(){             alert('This is an alert');         });   And it doesn't work. That's why I switched to .click() instead.  Just for conciseness, here's my html code:  <table>     <tbody id = "dashboard_tbody">     <tr class = "dashboard_main_row">          <td> John </td>          /* ... */     </tr>     </tbody> <table>


Let $\mu$ and $\nu$ be finite measures s.t $\nu<<\mu$. Is it true or false that there exists a constant $C$ for every $A\in\mathcal{B}([0,1])$ s.t. $\nu(A)\leq{C\mu(A)}$.  my intuition tells me no, but I can't think of counter example.

I'm trying to figure out if the following is true or false:  Let $\mu$ and $\nu$ be finite measures on Borel subsets of $[0,1]$,and $\nu \ll \mu$ ($\nu$ is absolutely cts with respect to $\mu$). Does there exist always a $C \in \mathbb{R}$ such that $\forall A \subseteq [0,1]$ that is Borel, we have $\nu(A)$ $\lt$ $C \mu (A)$.  The Radon-Nykodym theorem seems to almost suggest that is true, if I knew it was bounded, then I could say $\nu (A) \le \int_{A} g \ d\mu \le \int_{A} C \ d\mu \le C\mu (A)$, where $C$ is the bound. However, I don't know if it is bounded and in fact, I could take an unbounded function that is still integrable on $[0,1]$, such as $\frac{1}{\sqrt x}$.  I can't even be sure if it is true or false.   Thank you!


Does it follow that:  $$\left\lfloor\frac{\lfloor\frac{a}{b}\rfloor}{c}\right\rfloor = \left\lfloor\frac{\lfloor\frac{a}{c}\rfloor}{b}\right\rfloor = \left\lfloor\frac{a}{bc}\right\rfloor$$  I believe that the answer is yes.  Here's my thinking:  $$\left\lfloor\frac{a}{b}\right\rfloor = \frac{a}{b} - \left\{\frac{a}{b}\right\}$$  $$\left\lfloor\frac{\frac{a}{b}-\left\{\frac{a}{b}\right\}}{c}\right\rfloor = \frac{\frac{a}{b} - \left\{\frac{a}{b}\right\}}{c} - \left\{\frac{\frac{a}{b}-\left\{\frac{a}{b}\right\}}{c}\right\} = \frac{a}{bc}-\left\{\frac{a}{bc}\right\}-\left\{\left\{\frac{a}{bc}\right\} -\left\{\frac{a}{bc}\right\}\right\} = $$  $$ = \frac{a}{bc}-\left\{\frac{a}{bc}\right\} =  \left\lfloor\frac{a}{bc}\right\rfloor$$  Am I right?

Given $x\in\mathbb R_+$ and $m,n\in\mathbb Z_+$, is it true that $$\bigg\lfloor\frac{\lfloor \frac{x}{m}\rfloor}{n}\bigg\rfloor=\bigg\lfloor \frac{x}{mn}\bigg\rfloor?$$    Thanks for at least three different and convincing proofs! I'll use this result  trying to code the prime counting formula from Wikipedia $(2)$:  Given $m$, select $y$ so that  $\sqrt[3]{m}\le y\le\sqrt{m}$ and let $n=\pi(y)$. Then  $(1)\;$ $\pi(m)=\phi(m,n)+n-1-P_2(m,n)$, where  $(2)\;$ $\displaystyle \phi(m,n)=\phi(m,n-1)-\phi\Big(\frac{m}{p_n},n-1\Big)$,  $\;\phi(m,0)=\lfloor{m}\rfloor$ and  $(3)\;$ $\displaystyle P_2(m,n)=\sum_{y<p\le\sqrt{m}} \Big(\pi\Big(\frac{m}{p}\Big)-\pi(p)+1\Big)$, $\;p$ is a prime.


I have tried installing 'additional drivers' and going through several of the posts on the forum looking for a solution.  However, I cannot figure it out.  Can someone please help me get my wifi working?  lspci -knn | grep Net -A2 08:00.0 Network controller [0280]: Broadcom Limited BCM4352 802.11ac Wireless Network Adapter [14e4:43b1] (rev 03)     Subsystem: Lenovo BCM4352 802.11ac Wireless Network Adapter [17aa:0623]     Kernel driver in use: bcma-pci-bridge     Kernel modules: bcma, wl   And then  sudo lshw -C network   *-network                       description: Network controller        product: BCM4352 802.11ac Wireless Network Adapter        vendor: Broadcom Limited        physical id: 0        bus info: pci@0000:08:00.0        version: 03        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress bus_master cap_list        configuration: driver=bcma-pci-bridge latency=0        resources: irq:17 memory:d1600000-d1607fff memory:d1400000-d15fffff   *-network        description: Ethernet interface        product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:09:00.0        logical name: enp9s0        version: 10        serial: f0:76:1c:5b:c8:2d        size: 1Gbit/s        capacity: 1Gbit/s        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress msix vpd bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt 1000bt-fd autonegotiation        configuration: autonegotiation=on broadcast=yes driver=r8169 driverversion=2.3LK-NAPI duplex=full firmware=rtl8168g-3_0.0.1 04/23/13 ip=192.168.1.90 latency=0 link=yes multicast=yes port=MII speed=1Gbit/s        resources: irq:30 ioport:3000(size=256) memory:d1804000-d1804fff memory:d1800000-d1803fff

I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.


A proper wanna-be generalization of the "tower property" of conditional expectations would be:  $$\mathbb E(\mathbb E(X\mid \mathcal F) \mid \mathcal G) = \mathbb E(X \mid \mathcal F\cap \mathcal G)$$  regardless of, whether the $\sigma$-algebras $\mathcal F$ and $\mathcal G$ can be compared with $\subseteq$.  My guess is this is false. What is a counterexample? (or proof?)

$(\Omega, \mathcal{F}, P)$ is a probability space. $X$ is a r.v. defined on it, and $\mathcal{G}_1, \mathcal{G}_2$ are two $\sigma$-algebra, can we claim the following: $$ \mathbb{E}\{\mathbb{E}[X|\mathcal{G}_1]|\mathcal{G}_2\}=\mathbb{E}\{\mathbb{E}[X|\mathcal{G}_2]|\mathcal{G}_1\}=\mathbb{E}[X|\mathcal{G}_1\cap\mathcal{G}_2]. $$ If this is not true, why the following is true: $X_1,X_2,\ldots,X_n$ are independent r.v. on the same probability space, $Z=f(X_1,X_2,\ldots,X_n)$ is another r.v. And we have: $$ \mathbb{E}\{\mathbb{E}[Z|X_1,\ldots,X_{i-1},X_{i+1},\ldots,X_n]|X_1,\ldots,X_i\}=\mathbb{E}[Z|X_1,\ldots,X_{i-1}]. $$


I have an Issue with the UTF-8 Charset.  When I define UTF-8 as the used charset on my Webpage, all my special characters transform into �. I tried the following methods and everything gave me the same result.   via PHP   header('Content-Type:text/html; charset=UTF-8');   via HTML   <meta charset="utf-8">   via .htaccess   AddDefaultCharset UTF-8     EDIT: All my Databases in MySQL (where my Text-Content lies) are defined as utf8_general_ci       +EDIT: Solved The Issue lied in PDO. After adding following code it worked.  $dbh->exec("set names utf8");

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I've known that the possessive case of the proper noun ending in "-s" such as "James" is formed by adding just "an apostrophe" or "an apostrophe and -s". Is it right? Then what's the possesive case of "Mars"? Mars'    and     Mars's Are they both "grammatically" correct?

Many questions already ask about this topic ( , , etc.) and their answers vary, but they always give exceptions to the apostrophe-s rule, for example:      6.24 The general rule for the possessive of nouns covers most proper nouns, including most names ending in sibilants."   Examples they give include Kansas’s, Ross’s land, and Jones’s reputation. Exceptions include Jesus’  and Moses’.  Which names does this apply to?  Is the Aeneas’  form correct, or is it Aeneas’s instead?


I created program in java. which reads files from several ftp servers. But it reads first file by bufferreader and second time occures NullPointerException. Here is my code:      while(true){//READ .CSV AND WRITE TO DB         client=new FTPClient();         try {             client.connect(ftps.getIp());             client.enterLocalActiveMode();             client.login(ftps.getLogin(),ftps.getPassword());             System.out.println("Connected with ftp "+ftps.getName());             String[] files = client.listNames();             InputStream ins;             BufferedReader bf;             for(int i=0;i<files.length;i++){                 ins=client.retrieveFileStream(files[i]);                 bf= new BufferedReader(new InputStreamReader(ins));                 try {                     String str = "";                     do                     {                         lines.add(str);                                                     str = bf.readLine();                     } while (!str.equals(null));                 }catch (NullPointerException ex){                                         }                 catch (Exception ex){                     System.out.println("Error while reading file "+files[i]+" from ftp "+ftps.getName()+" ERROR "+ex.toString());                 }                 finally {                     bf.close();                                         }             }         } catch (Exception e) {             System.out.println("Error in executing ftp "+ftps.getName()+e.toString());          }finally {             if(client.isConnected())                 try{                     client.disconnect();                 }catch (Exception ex){                     System.out.println("Error while disconnecting with  ftp "+ftps.getName());                 }                 System.out.println("Disconnected with ftp "+ftps.getName());         }   Error in executing ftp ftpserver's name appeares in console.

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?


I am receiving an error when trying to add a chatter comment. I have a system of classes and 2 triggers that send a custom email notification when a chatter post has been added to a case or when a comment has been added to a chatter post. The handler and gateway for the FeedItems seems to be working fine, but I get an error when adding a comment to a chatter post. The error says: "Non-Selective Query against a large object type (more than 10000 rows). The query in my code that is throwing this error is:   User itemOwner = [select id, Email, Case_Chatter_Email_Notifications__c From User where id IN (select CreatedById From FeedItem Where Id =: feedItemId )];   return itemOwner;   Since I am using IDs, I am having a difficult time determining why this query is non-selective. Any input on where I should be looking would be greatly helpful.

I have a SOQL Query with subquery that fails to execute because it is non-selective. I don't understand why and cannot interpret the results. All I know is that tearing parent und sub query apart solves this.  I have CustomObjectA__c and CustomObjectB__c which can be N-M linked via Linker__c. In my query I am fetching all childs of some CustomObjectA___c records:  NON-SELECTIVE  for(CustomChildObjectA__c a : [SELECT TextField__c                                FROM CustomChildObjectA__c                                WHERE mdr_Parent__c IN (SELECT mdr_CustomObjectA__c                                                        FROM LinkerObject__c                                                        WHERE mdr_CustomObjectB__c = 'a0CG000000UW2LT')]) {     ... }   Rewriting the code with two seperate queries instead of one with subquery solves this:  SELECTIVE  List<LinkerObject__c> linker = [SELECT mdr_CustomObjectA__c                                  FROM LinkerObject__c                                  WHERE mdr_CustomObjectB__c = 'a0CG000000UW2LT']; if(!linker.isEmpty()) {                                 for(CustomChildObjectA__c a : [SELECT TextField__c                                    FROM CustomChildObjectA__c                                    WHERE mdr_Parent__c IN :linker]) {        ...    } }   In the system there are only a handful of LinkerObjects__c so the inner query is not only using an autoindex MDR filter but also return very few results.   Few data, only auto-index-filters, and extra selective subquery. How can this be non-selective??  This is the result of the query plan:


In reading about , I am led to prove the following combinatorial identity, which I cannot find anywhere, nor do I have any idea how to prove it. $$\sum\limits_{j=1}^k(-1)^{k-j}j^k\binom{k}{j}=k!.$$ After some reductions (including $\binom{k+1}{j}=\binom{k}{j}+\binom{k}{j-1}$) and "simplifications", I am still stuck and have no clues how to proceed. I do not know if this is true, either, though I think it should be.    Any help or reference is sincerely welcomed, thanks in advance.

The successive difference of powers of integers leads to factorial of that power. Here's the formula:     $$\sum_{r=0}^{n}\binom{n}{r}(-1)^r(n-r)^n=n!$$   Can anyone give a proof of this result?  Note: The original question was to prove the more general     $$\sum_{r=0}^{n}\binom{n}{r}(-1)^r(l-r)^n=n!$$   for an integer $l$, which some of the answers address.


For example, let's say I'm a physicist, so I'm not stupid. But, I'm talking to someone who is an accountant and they insult me for not knowing accounting jargon or how to do things involved in their field during a conversation.

Usage in sentence:  Person A: Ooh - look at that crow!  Person B: Well, actually, as someone who is a scientist who studies crows, I am telling you, specifically, in science, no one calls jackdaws crows. They're not the same thing. If you're saying "crow family" you're referring to the taxonomic grouping of Corvidae, which includes things from nutcrackers to blue jays to ravens. It's not one or the other, that's not how taxonomy works.  Person A: Are you always such an XXX?   "Pedant" is close, but not quite.  It would be a mix of "know-it-all", "condescending" and "arrogant".


Background  I apologize for not providing any code, but I am just looking for some help getting started. I am trying to create a very simple LaTeX template for my university, nothing fancy. Another university in my country has made this template , and I could adapt it for my needs. However, this solution seems way too advanced for what I am trying to achieve. Using it would feel like swatting flies with a sledgehammer.   I will make a small list below of what I am trying to achieve. My purpose with this post are some pointers for where to start, and what tools might be best suited to accomplish this task.   My template only needs two different page types. The first is a frontpage and the second is a plain background.  I need some settings to switch language and change the logo on the frontpage depending on the language chosen. I need to select the colors to be used in the template (according to the universitys color specifications). The background is just the image depicted below   One of the logo's I need to switch between is shown below     If possible the frontpage should be structured like this "Tittel dokument " = Document title and the smaller text bellow is an optional subtitle. The text at the bottom is the authors and address field    Combining the frontpage with the logo should hopefull look something like this    The plain background looks like this    Question   I am not asking for a full solution here. I am just looking for some help on how to get started creating my own simple template from scratch.

No matter how hard I search, I cannot find any information on creating a Beamer theme from scratch, as opposed to LEGOing it together from the built-in inner, outer and color themes, maybe modifying one or two beamer templates by using cryptic commands without explanation.  The reason I want to do this is that none of the built-in inner, outer and color themes suit my taste. All of them are instantly recognisable as Beamer, and there is very small visual change between them.  What I would like to implement is something along the lines of certain PowerPoint templates:    and I would also like to port the beautiful  themes (see ), such as the KlopeSpring theme to Beamer, as Powerdot is very inconvenient for having to convert all images to EPS.  So how do I go about all those geometric decorations and placing text above/below/on them? Oh, and I almost forgot to mention that I know about the easy solution of "include an empty slide PDF as background image", but that is no fun.


Can you help me? I write command line script in php. I need to read char from file , which i open by fopen. I use fgetc, but letter like á, ž, é, ř etc. are incorrect.   $this->inputFile=fopen(arguments::$input, "r"); $char=fgetc($this->inputFile); echo "char: ".$char."\n";   output of á or ř is �


Interested to modifying the fontawesome.sty file?

Yesterday I did some changes in the layout of my TeX document. I couldn't accomplish the changes until I opened the .sty files and modified some of their code. I am sure this is not the best idea. For one reason, after the packages got an update, I will have to modify the file again (and again and again).  Another way would be to create my own version of that .sty file and call that instead of the original one, but this might not be the best idea either. (again: at least the updates speak against it)  How can I accomplish the following changes by adding code to a local file (e.g. my .tex preamble) instead of changing global files (like the package .sty files)?  I wanted to change the following lines in ledmac.sty:  \def\printlines#1|#2|#3|#4|#5|#6|#7|{\begingroup   \setprintlines{#1}{#2}{#3}{#4}{#5}{#6}%   \ifl@d@pnum #1\fullstop\fi   \ifledplinenum \linenumrep{#2}\else \symplinenum\fi     %% #2 into: \arabtxt{\n{#2}}   \ifl@d@ssub \fullstop \sublinenumrep{#3}\fi   \ifl@d@dash \endashchar\fi   \ifl@d@pnum #4\fullstop\fi   \ifl@d@elin \linenumrep{#5}\fi   \ifl@d@esl \ifl@d@elin \fullstop\fi \sublinenumrep{#6}\fi \endgroup}   The second thing is a line in ledpar.sty:  \newcommand*{\l@dlinenumR}{%   \numlabfont\linenumrepR{\line@numR}\Rlineflag%       %% numlabfont into: numlabfontR   \ifsublines@     \ifnum\subline@num>\z@       \unskip\fullstop\sublinenumrepR{\subline@numR}%     \fi   \fi}   (In the latter case, just adding \renewcommand with the modified code did not work.)


On Windows it is possible to enable revealing the mouse pointer position by pressing the CTRL key.  Is this possible in Gnome? There doesn't seem to be a setting, unless it's hidden somewhere.

I'm looking for a solution that would display the current mouse cursor coordinates in realtime (i.e. NOT xdotool and NOT xev).  I need to move the mouse to a certain position, then press Alt-Tab to flip to another window and record the coordinates there. (This would not move the mouse, so the coordinate display would stay the same).  There's a Windows program that works BEAUTIFULLY for this purpose -   ...but it doesn't even start up in Wine.  Alternately, instead of displaying the coordinates, if this solution could copy the coordinates (in XXX,YYY format) to the clipboard, upon pressing a hotkey, that would be even better.  Any suggestions would be much appreciated!  P.S. I'm running Ubuntu 12.04 LTS.


I was wondering, is the anime ending and the manga ending the same for Boku dake ga Inai Machi? Or is there going to be a sequel for the anime version?

As stated in the title, I want to know what the major differences between the manga and the anime adaptation are. From what I've read online, the anime adaptation diverged from the manga. So where does this diversion occur? Does it start from a particular chapter of the manga or has it been taking its own course gradually from the very beginning?


I am a Canadian citizen and currently visiting the UK to be with my girlfriend. I have the 6 month tourist visa stamp and have a return flight booked back to Canada on February 2nd.     My question is can I travel to Barcelona with my girlfriend for a few days before I fly back to Canada. Will they allow me back into the UK to get on my flight back to Canada?

I am a United States citizen with a 6-month Tourist visa to the UK (a stamp in my passport). Additionally, in 2013 I spent about two months in the UK on tourist visas, split between two separate occasions (one month in April-May, and one in August-September). My passport was stamped in December of 2013, and I have two other stamps from those previous visits (so three total, now)  My original intended departure date from the UK was March 1, but that is no longer the case, as I plan to stay out the duration of my visa.  My question is, can I leave the UK (to travel in Europe for a week, for example) and come back in with this visa? Will they re-stamp me, or see that my existing stamp is still valid? Will it be a problem that I've been coming-and-going in the UK relatively frequently? Are there any other concerns I should be aware of?


Let $f:\mathbb{R}\to\mathbb{R}$ be a continuous function such that $f(x)=f(x^2)$ for all $x\in\mathbb{R}$. I've proven that also $f\left(y^{(2^{-n})}\right)=f(y)$ for all $n\in\mathbb{N}, y\geq0$. How can I deduce that $f$ is constant?

Given a continuous function $$ f: \mathbb{R} \rightarrow \mathbb{R} \quad \text{with} \quad f(x) = f(x^2) \quad\quad \forall x \in \mathbb{R} $$  How can I show that $f$ must be constant?


I am trying to change my site's page headings to better emphasize the structure of the page's content hierarchy. I am hoping this will encourage Google Sitelinks and list snippets.   Current headings are not optimized: I would like to use the
 heading as an internal link.  Will this encourage Google sitelinks and better content indexing?
text

My website used to have sitelinks and now it doesn't. It's very possible that it's due to changing the website to a sidebar design instead of having an "interstitial" type landing page which limited the number of choices, but I'm not sure.  Here is how sitelinks might look for a site:    What are some things that I can do to improve my chances of getting sitelinks?


\documentclass[12pt, UTF8]{ctexart} %\documentclass[12pt, UTF8, scheme = plain]{ctexart} %\documentclass[12pt, UTF8]{article}  \begin{document}  This is \textit{a test}.  \end{document}  \textit{} stopped working in ctex package after recent update? It looks like normal texts instead of in _italic_....

Including CJK seems to disable the effects of \bf and \it. For instance, the picture  is generated by the following code: \documentclass{article} \usepackage{CJK} \begin{document} One \bf{two} \it{three}. \end{document}  I am using macOS Big Sur 11.4 + TeX Live 2021 (with all packages updated to the latest versions via TeX Live Utility 1.49.) Commenting off the second line gets the following normal picture.


I've just finished watching the  movie and having had time to reflect a bit more on it, I still cannot understand why the government would not just send a second pod through the machine if they seriously did not believe Dr. Arroway. I mean, the thing cost what? Half a trillion dollars to build, why not use it at least a second time? Unlike religion there is actually a way to test the testimony and they do not have to take it on faith at all.  Note that I did not read the novel (yet) and I would appreciate it that if it is answered in the novel that somebody tells me.

I recently re-watched Contact for the first time since my childhood, and while I thoroughly enjoyed it, I realized that there was something I'd never understood: why couldn't they corroborate Ellie's account of her journey?  As far as I could tell, the pod fell harmlessly through the machine.  That is, it didn't break anything, and the machine wasn't destroyed.  I don't recall any dialogue about circuits being fried or the system shutting down, so presumably it wouldn't be hard to simply hoist the pod up and go again.  I imagine the energy draw was substantial on the local Japanese power grid, but given the amount of effort and money already invested in the machine, surely "Round 2" wasn't out of the question?  I mean, they almost certainly expected that this machine would get more than one good use out of it, anyway!  So given Ellie's vehement insistence that the machine had worked, the public nature of the controversy surrounding her testimony, and the government's (secret) findings that her device had recorded 18 hours of static, why wasn't it the obvious choice to have someone else suiting up the next day, ready to drop through the machine and corroborate her story?


I would like to activate a conda environment by a shell script, as suggested , I have tried: #!/bin/bash -i source $(conda info --base)/etc/profile.d/conda.sh conda activate myenv  but it doesn't change the actual environment, why? Update: I am using Xubuntu-20.04.01. I don't get any error messages, but the environment remains the same (base). I have tried to add eval $(conda shell.bash hook) in the script, but it doesn't work.

When loading a python virtual environment I need to run:  source venv/bin/activate   I want an alias for this command because I have to run it all the time. So I put the following in a file called "load.sh":  #!/bin/bash source venv/bin/activate   And ran  chmod +x load.sh   However, now when I run ./load.sh there is no effect. My suspicion is that the word "source" may be the issue. But I don't know. Any ideas? Thanks.


Can anyone help me figure out what I am doing wrong when trying to get the sum and the average of the elements in the array? My assignment is: You are preparing for the Boston Marathon. In order to prepare, you need to train for 10 weeks, running an increasing number of miles per week, starting at running at least 2 miles your first week up to 26 miles by week 10. One question states to find the sum of the total miles ran over ten weeks and the average miles ran over the ten weeks, and what I have will execute without errors, but the sum is coming out as 26.000000000004 which I know is wrong. Any advice would be greatly appreciated. I am new to this.      public class arrayTest     {     public static void main(String[] args) {            double[] miles = new double [10];                  double milesPerWeek = 26.0 / 10;                 double totalMiles = 0;                 double sum = 0;                 double average = 0;                  System.out.println("Week\tMiles");                  for (int i = 0; i < miles.length; i++)                 {                       miles[i] += milesPerWeek;                       totalMiles += miles[i];                    System.out.println("Week " + i + " miles " + totalMiles);                      }                 for (int i = 0; i < miles.length; i++)                 {                                     sum = sum + miles[i];                       average = sum / miles.length;                    }                   System.out.print("the sum of the miles ran is: " + sum + "\n");                    System.out.print("the average miles ran is: " + average);                 }           }     The result reads:     Week    Miles     Week 0 miles 2.6     Week 1 miles 5.2     Week 2 miles 7.800000000000001     Week 3 miles 10.4     Week 4 miles 13.0     Week 5 miles 15.6     Week 6 miles 18.2     Week 7 miles 20.8     Week 8 miles 23.400000000000002     Week 9 miles 26.000000000000004     the sum of the miles ran is: 26.000000000000004     the average miles ran is: 2.6000000000000005

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


E: Type' ://ppa.launchpad.net/bisigi/ppa/ubuntu' is not known on line 2 in source list/etc/apt/sources.list.d/bisigi-ppa-maverick.list  E:Unable to lock the list directory   This is blocking me from entering the Synaptic Package Manager! What is going on?  Help!

Every once in a while I see users having issues to update due to errors like this:  E:Type 'ain' is not known on line 1 in source list /etc/apt/sources.list.d/some-ppa.list'   with varying types/line numbers/source list files (often after removing a PPA).  How can such an error be fixed?


I have a text file that has a multiple lined string of text I'd like to scan the file for and remove all instances that it finds of that multilined and potentially sometimes duplicate string.  example string:  recursive-test yes; test-limit{ tests 10; }; location "testLoc" { type test; }; location "testLoc2"{ type test; file "/etc/var/test.sql"; }; include "/etc/var/test.conf"; };    recursive-test yes; test-limit{ tests 10; }; location "testLoc" { type test; }; location "testLoc2"{ type test; file "/etc/var/test.sql"; }; include "/etc/var/test.conf"; };  otherTestTextHere 123 321  recursive-test yes; test-limit{ tests 10; }; location "testLoc" { type test; }; location "testLoc2"{ type test; file "/etc/var/test.sql"; }; include "/etc/var/test.conf"; };   As you can see, the repetitive string of text in the text file is always the same, from start of the string, to the end of the multiple lines, it's always the same:  recursive-test yes; test-limit{ tests 10; }; location "testLoc" { type test; }; location "testLoc2"{ type test; file "/etc/var/test.sql"; }; include "/etc/var/test.conf"; };   The multilined string should not be duplicated normally, but as a failsafe I'm looking also for a method that will just scan for all instances and remove it entirely if for some reason the string ever gets duplicated from another application that's writing to the text file.  Using sed I can only figure out how to delete one line at a time, however that wont work for me since sometimes some of the words on some of the lines in the multilined string, show up in other multilined strings that are similar but I want to keep. I'm really just trying to search for 'exact' duplicates of this multilined string from start to finish of the string.  I'm trying to keep it to a one line command line/optimized.

I've noticed that, if I add \n to a pattern for substituting using sed, it does not match. Example:  $ cat > alpha.txt This is a test Please do not be alarmed  $ sed -i'.original' 's/a test\nPlease do not/not a test\nBe/' alpha.txt  $ diff alpha.txt{,.original}  $ # No differences printed out   How can I get this to work?


It's about using the right punctuation when abbreviation is used at the end of sentence. It has been asked here when the sentence is a question: .  What about sentences like the following:  The opinions of this articles are those of the author(s), and do not necessarily reflect the views of Google Inc..   Two dots or one dot?

Example:     It's all about apples, oranges, bananas, etc.   VS.     It's all about apples, oranges, bananas, etc..   Update  What happens if the abbreviation is inside parentheses, do you place a dot after and before the closing parenthesis?     It's all about fruit (apples, bananas, etc.).


A photon's geodesic equation is defined by re-parameterizing the geodesic equation to some parameter other than proper time. This is done because $ds=0$ for the photon.   Again if we use affine parameter (say $\lambda$) for the path of the null geodesic, we get that the new parameter used is some linear function of proper time.  My question is: If $ds=0$, if the new parameter is linear with proper time,  $d\lambda=0$. Then how can this parameter be used to write the null geodesic.

For time-like geodesic, the affine parameter is the proper time $\tau$ or its linear transform, and the geodesic equation is   $$\frac{\mathrm d^{2}x^{\mu}}{\mathrm d\tau^{2}}+\Gamma_{\rho\sigma}^{\mu}\frac{\mathrm dx^{\rho}}{\mathrm d\tau}\frac{\mathrm dx^{\sigma}}{\mathrm d\tau}=0. $$  But proper time $\Delta\tau=0$ for null paths, so what the physical meaning of is the affine parameter for null geodesic?


I am a super newbie so I hope this is not a stupid question but what will I need to qualify to run this software package? I've installed openssh and apache2 and they work fine so I think many of the server attributes may be on my system but how might my system yet be lacking?

What's the difference between the server version of Ubuntu and the desktop version?