I found a possible bug in the reputation graph, i.e. the bar chart, showing reputation for each single day (go to user profile -> activity -> reputation -> graph). Actually, there seem to be two bugs, but those are probably closely related:   all of the bars are one-off: the "half bar" for the current day shown the correct reputation, but the tool-tip shows the date of the previous day, and accordingly for all other days when I click the bar, the reputation breakdown below the chart shows the reputation for the previous day (i.e. the same day as in the tool-tip)   In other words, for each single day,   the height of the bar is correct the reputation shown in the tool-tip is correct the date in the tool tip is the date of the previous day the reputation shown below the graph is that of the previous day   I searched for related questions, and the bug seems to be the same as  and , but those are 5 years old and reportedly fixed. Also, I can't remember experiencing this bug some time ago, so if this is the same bug, it must have reappeared.  Using Firefox 44.0.2 on Xubuntu 14.04, in case it matters.

So when we view reputation, there is graph view. However, it seems to be off by a day. Here's what I mean:   I'm sure 70 + 20 + 15 is not 15. Its 105, which is what we see below:   And 40 + 10 is NOT 105, unless you did  :)     Anyways 40 + 10 is 50:   So yeah. Did you do what that post on codegolf says? Devs better fix that :)


I'm on a genocide run, and I have been searching everywhere to find the last encounter in Snowdin. What is the best place/way to search for it?

Say I'm speedrunning Undertale. This usually means you're doing a genocide run, and need to kill a certain number of enemies per section.  Snowdin in particular seems difficult to get the right number of enemies to spawn.   In the Ruins, you can run circles in the room right under the candy. Hotland is quite easy to get the right number of kills just by taking the usual path. The Core has the final bridge before the Mettaton fight.   I can't figure out Snowdin. Where should I walk to maximize the number of encounters?


This is a novice question. It is theorized that Cosmic Microwave Background (CMB) is remnant of radiation from very early time of universe creation. As these were photons that have been traveling, they must be traveling at speed of light or very close. Universe is certainly expanding much slower rate than this. Then how is it that all these photons haven't passed us by now? We are receiving them as if universe expanded much quicker than speed of light and only now these photons are catching up.

I understand that we can never see much farther than the farthest galaxies we have observed. This is because, before the first galaxies formed, the universe was opaque--it was a soup of subatomic particles that scattered all light. But before the universe was opaque, the  happened, which is where the  (CMB) comes from.  If the opaque early universe scattered all light, and the first few galaxies are as far back as we can see, why is the CMB observable? Where is it coming from?


Wondering if there is any math symbol for the greek letter $U$? I know $\mu$. Any similiar looking symbol that I can draw in latex?

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I am trying to create a bounding box for my sprite using box2d, but the box is being created at the wrong spot. I followed a tutorial on the wiki using this code      BodyDef bodyDef1 = new BodyDef();     bodyDef1.type = BodyDef.BodyType.DynamicBody;     bodyDef1.position.set(player.getX(), player.getY());     playerBody = world.createBody(bodyDef1);     PolygonShape square = new PolygonShape();     square.setAsBox(player.getWidth() / 2, player.getHeight() / 2);     FixtureDef fixtureDef1 = new FixtureDef();     fixtureDef1.shape = square;     fixtureDef1.density = 0.1f;   Player is a just the sprite that I am trying to create the box around.

I found out about this using a debug renderer. When the game starts, everything is in order. But when a collision happens, the sprite's rotation is way larger than its body. The sprite and body match when the body is completely horizontal.    The sprite's rotation origin seems far distant from where it should be. Here's my code:  Sprite sprite = data.sprite; position = body.getPosition(); sprite.setPosition(     position.x - sprite.getWidth()  / 2,     position.y - sprite.getHeight() / 2 ); sprite.setOrigin(position.x, position.y); sprite.setRotation(MathUtils.radiansToDegrees * body.getAngle());   As you can see, I am even trying to set center of its rotation with setOrigin without success. How can I fix this?


Since I was a kid, I used to watch 007 just to see what new weapon he will be using. I bought two PS2 games just to use these cool weapons and drive the BMW which can fire rockets! Or to use the watch and break the glass.  I didn't watch 007 because I like the actors, every new Bond movie has different cast, I didn't watch it because I loved the plot or because I want to see a story, we all know how bond movie ends: he falls in love with a blonde girl, who is a bad girl, the good girl is black, the blonde dies, Bond kills the bad guy and fall in love with the good girl.  I watched 007 because I wanted to see incredible weapons never seen before and we used to talk about it for months!  Skyfall on the other hand is good, however they used a fake Q and fake weapons, they killed the blonde girl too early and made her a hopeless girl. The black girl didn't do anything in the movie beside shooting Bond in the first scene.  There's something wrong! Who will watch Iron Man if he doesn't have that fancy suit and a billion different weapon? Same story with Bond, the story is good, but it seems more like a Jason Bourne movie, not James Bond (Jason does what James does without having the cool weapons).  So why didn't the director give Bond his cool guns and car? Is it a lack of creativity or what? And can we expect to see the cool guns in the next Bond? or is the future of the franchise going to be about a man who kills using traditional - old weapons?

The most recent installments of  (ones featuring Daniel Craig) have fewer gadgets but more raw action (like the chase sequences in Casino Royale and Quantum of Solace). Is it because of plot related changes to the MI:6 or have the movies been altered to suit the audiences?


Here is a portion of my script:  read main_menu  case "$main_menu" in      "0" )   exit             ;;     "1" )   cp /etc/bamt/cgminer.conf.X11 /etc/bamt/cgminer.conf;             sudo mine restart;             ;;   How can I make it so after the user enters 0 or 1, 2 etc, he doesn't have to press the Enter key? Practically, when you enter the number it would directly jump to the next menu or function without the needing to press Enter.  Can you help me implement it here?  while : do     echo -e "\n Test script"     echo -e "\t (0) Exit"     echo -e "\t (1) Option 1"     echo -n "Enter choice:"       read main_menu       case "$main_menu" in          "0" ) exit          ;;          "1" ) exit          ;; esac done

I've been trying to use bash to read a file character by character.  After much trial and error, I have discovered that this works:  exec 4<file.txt  declare -i n while read -r ch <&4;       n=0      while [ ! $n -eq ${#ch} ]            do  echo -n "${ch:$n:1}"                (( n++ ))           done      echo ""       done   I.e., I can read it line by line and then loop through each line char by char.  Before doing this, I had tried: exec 4<file.txt &&  while read -r -n1 ch <&4; do; echo -n "$ch";  done but it would skip all whitespaces in the file.  Could you please explain why? Is there a way to make the second strategy (i.e. reading char by char with bash's read) work?


In the line of this , I am looking for a way to compile a large document (~400 pages with 10 chapters) into a single pdf file and one additional pdf file per chapter.   Currently, I use pdftk to manually split the large pdf file after its pdflatex compilation. However, this is tedious in the sense that the page split may vary (addition in chapter 1 will shift page numbers of following chapters...).  Is there a way to compile a latex file between two labels for instance ? Ideally I would like to keep hyperlinks active in the final sub-pdf files (which is the advantage of pdftk...).  The only thing I can think of is the use of \ifnum in order to consider specific parts of the document but this will necessarily break all hyperlinks.

I'd like to be able to create a TeX file that will output multiple PDF files with one compilation.  I'm not even sure if this is possible.  Here is the setup:  I am writing dozens of cover letters for job applications, and wish for them to all look "personalized".  So I defined a function which calls multiple variables, such as the address, name of the institution, open position, etc., and outputs a "personalized" cover letter for each function call.  The problem is that compilation of the TeX file outputs just one file.  Since I will be submitting all of these files online eventually, I would like each letter to be in its own file.  Is there a way to do this at the TeX level?


Wolfram Alpha said that $$\int_0^{\infty}\frac{\ln x}{1+e^x}dx = -\frac{\ln^22}{2}.$$ I have attempted to multiply top and bottom by $e^{-x}$ and then use the geometric series on $\frac{1}{1+e^{-x}}$, but that eventually led to me having to deal with expressions involving $\eta’(1)$. My alternative attempt was to use the fact that $\ln x=\int_0^{\infty}\frac{e^{-t}-e^{-tx}}{t}dt.$ $$\int_0^{\infty}\frac{\ln x}{1+e^x}dx$$$$ = \int_0^{\infty}\int_0^{\infty}\frac{e^{-t}-e^{-tx}}{t(1+e^x)}dtdx$$ I am confident there is a way to go from here involving symmetry or some manipulations that lead to the answer. Any help or hint for going from my double integral step would be appreciated.

Evaluate $$\int_0^{+\infty}\frac{\log x}{1+e^x}\,dx.$$  I have tried using Feynman's Trick (in several ways, but for example by introducing a variable $a$ such that $I(a)=\int_0^{+\infty}\frac{\log ax}{1+e^x}\,dx$), but that doesn't seem to work. Also integration by parts and all kinds of substitutions make things worse (I have no idea how to substitute such that $\log$ and $\exp$ both become simpler.  (Source:  - Level 5/5)


I'm creating a new table that contains a 'user'. So far, the table looks like:  create table users(   id primary key,   code varchar )   Currently, the "universe" of codes consists of: A or B.  Is it worthwhile, from a DB Design point of view, to create a codes table that contains all known codes?  create table codes(   value varchar, -- with unique constraint   description varchar )   Then, I could update my users table's code column to have a foreign key relationship to the codes.table column.  Does this change seem to be useful for my above case?

I want to know why I should use an int as a lookup table's primary key instead of just using the lookup value as the primary key (which in most cases would be a string).  I understand that using a nvarchar(50) rather than an int would use way more space if it is linked to a table with many records.  On the other hand, using the lookup value directly would basically save us doing a join. I can imagine this would be a big saving if the join is always required (We're working on a web app so this counts quite a bit).  What are the advantages of using a int primary key (specifically for a lookup table) other than it being "the standard thing to do"?


The instruction I received is to build a set $B\subseteq A$, $|B|=\aleph_{0}$. And use induction to prove. I don't really know how to use induction here to prove. Thanks for any help.

I'm trying to show that one infinite always has a countably infinite subset, but I'm confused with something on the proof. Let $S$ be one infinite set. In that case, to show it has one countably infinite subset means to find a subset $S_0\subset S$ such that there is a bijection between $S_0$ and $\mathbb{N}$.  The procedure I considered is: pick one arbitrary $a_0\in S$ and consider $S\ \setminus \{a_0\}$. This new set will also be infinite, so we can pick $a_1\in S\setminus \{a_0\}$ and consider $S\setminus \{a_0,a_1\}$. This new set is again infinite. We can repeat this procedure $n$ times, for every $n\in \mathbb{N}$ and thus construct a set $\{a_0,a_1,\dots\}$ which will clearly be in bijection to $\mathbb{N}$.  Now there is a point I'm quite unsure. This idea that: we pick $a_0$ from $S$ then we pick $a_1$ from $S\setminus \{a_0\}$ and so forth. It seems to me that in the way I wrote, this is not fully rigorous.  Is that the case? If so, how can this idea be made rigorous?


The last time I saw that anime I was a kid, so sorry if I'm gonna make some stuff up, I gonna try my best to remember it.  So in the first season, I remember that the story somehow started with a pretty young dude that had a gem that summoned some sort of knight with a spear drill and yellow tint to everything. He was really similar to Orion (from Brawlhalla). I can't remember more except that there were people that used magic too...

I am from India, this anime or animated series (I can't remember this was made by the Japan or other countries) was aired between 2009 and 2012 probably in Jetix/Disney XD (but I'm not sure).   This anime starts with a boy (the main character, I forgot his name) who find a stone (or crystal like thing) in his dad's property, his dad was missing that time. Some day he accidentally hire a creature/monster from that stone. Other day some creature attack him and he was saved by his creature and the story begins.   In his journey to solve the mystery he meets a middle aged man 'Dante' (probably that was the name; this is the only character name I can remember). He had also some stone. After that they meet with one girl and a women (one of the girls is same age with the main boy character and probably will become his partner as the story goes on). Another women probably Dante's partner.  Four of them started their journey to collect all the stone/crystal. They are collecting twelve legendary creatures to defend against their enemy. I watched till they collect 4 legendary creatures' stones. This anime is kind of touch with archeological things.  This story kind of matches with 'Kiba' anime series. This animation series name probably between 5 to 6 letters. That  galactic football was also hiring besides this anime series.


Wakanda, which is sitting on a rich reserve of Vibranium, is depicted as a more advanced civilization then the rest of the world in Black Panther.    In Avengers: Infinity War, during the battle of Wakanda with the Black Order, we see that they have one hell of a defense with a dome shaped energy shield, nearly impenetrable. But when the shield does get penetrated, the only weapons Wakandan's use are spears that also shoot energy blasters which are not very efficient attack weapons. The War Machine single-handedly does more damage than possibly all Wakandans.     Why was their attack so weak? Why didn't they use tanks & stuff or have aerial backup like helicopters? Why was their attack strategy focused on hand to hand combat only despite having a technologically advanced civilization?

In Black Panther, Ulysses Klaue describes his arm cannon as a leaf blower in comparison to the cannons/weapons that Wakanda has.  Infinity War comes after the events of Black Panther, so the weapons should exist. During the final fight with the children of Thanos and Space Dogs (as Rocket refers to them), Wakandans could have used these powerful cannons, pointing them at the opened section of barrier. Instead they chose a fist fight.  Even M'Baku says that it would be the end of Wakanda, so the magnitude is huge and risks are very high. Why were these powerful weapons not used?    Edit 1: I watched the movie again and planes are there in the fight. But they were only used to destroy the spaceships that crashed.


I confess! Being a non-native speaker, I struggle a lot especially when I come across a new word. And I wonder how do native speakers pronounce perfectly even though they read the word for the very first time. There should be some rule/technique? I'm not sure.  Let's take a case.   If I see a word having 'ch' for the very first time, how do I guess it? Remember, I don't have dictionary. Nor do I have access to this great site when I encounter that word. For example,   Take the word 'chariot'. Being a non-native with quite limited knowledge of orthography, I know that 'ch' is pronounced as in 'Charles'  But then, imagine, I came across the word 'charade'. Undoubtedly, for me, it is 'ch (as in Charles)-re-d-s'. But then, actually, 'ch' there is 'sh' (as in Shane).   It's not just 'ch' but it goes for 'g' as well. 'G' as in 'goat' or 'g' as in 'gymnastic'. Is there any source that teaches how to pronounce a letter if it is placed after/before certain letter? Is there any such rule? The one I remember is when a word ends with 'mb', you don't pronounce 'b'. 'Bomb', 'Comb', 'Tomb' and .      There are a few more words that add another nail in the coffin of my pronunciation complexity!      penis (pee, and not as in 'pen')  asthma (no 'th' pronounced)  Dengue (dengeee)  and many more...

I have learned English for many years, and from the first day I began to learn it I know the dictionary is necessary for the study.  One of the important aspects is that English words, unlike German and Spanish, usually can not be read correctly without phonetics.  But recently, I talked with some native speakers and they told me they can read any word directly and rightly even though they never learned it before.  I just want to know how they can do that -- there is no ordinarily acceptable method to read an English word?


I have a Canon 60D (APS-C) body and I want to use a Canon 100-400mm L lens with the Canon 2.0x extender.  I want to know if this combination will work well or not?  I read that extenders have some problems working with APS-C bodies but my one is high end APS-C so I thought it should work well, especially with a good lens like the 100-400 L.

My wife has a Canon EF 100-400 f4.5-5.6L IS USM Telephoto Zoom Lens. Price is not that important to me, but I am unsure which of the four extenders I should purchase.  Canon has four extenders that I have found:    1.4x EF MIII  1.4x EF MkII 2x EF MkIII  2x EF MkII   Logic would state that the 2x units should give the benefit of much further distances to be accessible, however the 2x units seem to get a much worse press than the 1.4x. Again logic states that the Mk IIIs should be better than the Mk IIs but again I am left confused by the reviews I have found.  It appears that with most of these lenses autofocus may be lost, we tried a non expensive lens from the store(£80) which had the same problem, however the image on the camera appeared good.  I am a complete amateur.


I came across this post  and this image    I didn't get why the Bayesian statistician is saying no. Any suggestion

makes fun of a frequentist statistician who derives an obviously wrong result.  However it seems to me that his reasoning is actually correct in the sense that it follows  the standard frequentist methodology.   So my question is "does he correctly apply the frequentist methodology?"    If no: what would be a correct frequentist inference in this scenario? How to integrate "prior knowledge" about the sun stability in the frequentist methodology? If yes: wtf? ;-)


I intend to start incremental backups of my Fedora 20 system, and would like to know what root directories I should include, and what directories it is useful to exclude. I know there is a lot of information on this on the 'net already, but none of it seems to answer this simple specific question. Looking at the answers already available on this site, they are useful, but so many end in etc, instead of being specific, which is not really very helpful.  I assume that I needn't or shouldn't backup directories that are created or filled in by the system as it runs, for instance certainly not /run/media/Harry/CA6C321E6C32062B which is the hard drive that I will be saving the backup on. Are there any more like this?  I will be using rsync in the system described , which I have already tested on small runs. I have looked into luckyBackup as a GUI front end, but get lost in its technicalities (please see my footnote). I will use its task manager to form the command I need for rsync, when I know what files to include and exclude.  In the event of a crash I envisage a re-installation of Fedora, then using the backup as a resource as I get going again, rather than trying to exactly reproduce the state just before the crash.  What files should I include and exclude specifically?  Footnote: In luckyBackup I do not see the way to use datestamps as in the reference I give, and I do not understand how to use the log of a dry run: why is it printed red, after some black lines at the start which I can no longer access because the log is so long?, and how do I find details of the errors to know if they matter? These are rhetorical questions, my real question is still only : what files to include and exclude, please?

I'm planning a backup strategy based on .  I want to do a full system backup excluding files and directories that would be useless for the restore to have a working system again. I already excluded:  # System: exclude /dev/* exclude /proc/* exclude /sys/* exclude /tmp/* exclude /run/* exclude /mnt/* exclude /media/* exclude /lost+found  # Application: exclude /*.pyc exclude /*.pyo   I wonder which other entries I can add to the exclude list without compromising the restored system. Talking about a "generic" Linux system, can you suggest further glob extensions, temporary directories, caches, etc. I can exclude safely?


I remember reading a book when I was younger (maybe 8-10 years ago) that depicted a war between knights and large black non-humanoid monsters. It was a thick book probably 500+ pages and may have had a number of knights displayed on the cover. There may have been sequels but I don't recall, I found it in the teen section of my local library. I think the monsters varied in size and came out of the earth, but could be mistaken.   I believe the characters were mostly adult men, i.e. not teenagers.

I read a fantasy novel years back. I honestly don't remember much of the plot (it was SEVERAL years back) but I remember the magic system that was used.  It was possible for an individual to grant portions of their physical and/or mental powers to another person.  For example, a person could grant his/her sight to someone else and spend the rest of their life blind (or with exceedingly poor vision) while the recipient would see twice as well as anyone else. In the book there were whole cities devoted to enhancing the nations army, or a specific person, etc.  Anyone have a thought what this book or series is?


The power series $f(z)=\sum_{n=0}^{\infty}a_nz^n$ has convergent radius $r>0$, so $f(z)$ is analytic in $|z|<r$. MOREOVER, we suppose $f(z)=\sum_{n=0}^{\infty}a_nz^n$ is continuous on the closed disk $|z|\leq r$. My question is that: Does the series $\sum_{n=0}^{\infty}a_nz^n$ converge uniformly on the closed disk $|z|\leq r$? In my opinion, I can give a example such as: the series  $$f(z)=\sum_{n=1}^{\infty}\frac{z^n}{n^2}$$ has radius $r=1$ and converges uniformly on the closed unit disk $|z|\leq1$. I do not know whether my question is right or wrong. Any hints will welcome!

I am wondering whether there exist a function $f(z) = \sum_{n\geq0} a_n z^n$ such that:   $f$ converges and is continuous on the closed unit disk $D$ and the series $\sum_n a_n z^n$ does not converge uniformly on $D$.   I have tried to construct a counter-example, but with no success so far.


Someone asked me     What if someone hides their instagram stories from you?   I replied      I'd hide them from my life.   Is my sentence right  Does hide mean to make disappear?  If not What else could I have used here?  Someone told me the object of preposition "from" is a person who is not supposed to see or find that which is hidden  So what about this sentence?      the magician hid(made her disappear) from the stage?   Is it wrong?

Someone asked me  What if someone hides their instagram stories from you?  I replied I'd hide them from my life  Is my sentence right  Does hide mean to make disappear?  If not What else could I have used here?  Object of preposition from can not be a place like the magician hid(made her disappear) from the stage?


Tomorrow I have my third wedding to photograph, but its going to rain and its going to be cold. It's more or less the opposite of what the couple wants and they are going to be pissed. It's also rather cold for this period of the year, so people planned to be quite "undressed" especially the ladies, and they are going to feel pretty cold tomorrow.  What I would like to know is how to use this bad weather to my advantage and how to keep the mood of the shots positive given the circumstances.  Thanks

I've shot weddings before, but being in Minnesota they almost always have an indoor venue available due to the long cold winters that we have. I am coming up on a wedding that I will likely be shooting outdoors and in the rain. I'm not as worried about my equipment, I am more concerned with how to capture the shots that I need such as b&g alone, the wedding party, family posed portraits, etc while potentially being stuck in poor weather.   Should I come prepared with 10 umbrellas? Should I make all possible attempts to find a sheltered area for the posed portraits? Do I have an assistant hold an umbrella out of the frame to protect the b&g during alone shots? Just some ideas I've had, but I've never actually shot an outdoor ceremony during the rain.


How can I delete one of the pics on my look back movie? There is no edit button or delete button, only share.

Can you edit the Facebook "looking  back" video, swapping some pictures?   Trying to change some photos, does anyone get a prompt to do that anywhere?


Suppose we have a person A and a person B.  Person B travels very close to speed of light and never returns. He's constant in speed. Then, we can say two things:   B is younger than A. A is younger than B (since we can consider B's reference as inertial).   Who is correct between the two?

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


I just learned  from my Statistics course. The teacher says that the whole population is unknown, however we have some sample set $\mathcal{D}$ with sample size $N$. Then we use this sample set $\mathcal{D}$ as population and sample from $\mathcal{D}$ with replacement to compute all statistics we want (like mean, variance, median, or train a ML model from resampled set, etc.). We will have a fantatic result from this method (average result from all resampled sets). However, I totally cannot understand the spirit of resampling from $\mathcal{D}$. For example, the actual distribution is Bernoulli distribution with $p = 0.5$. I get a sample set $\mathcal{D}$ with sample size $100$ from this distribution with $52$ of one and $48$ of zero. If I resample with replacement from $\mathcal{D}$, it just means that I have a Bernoulli distribution with $p = 0.52$. My Questions:  Why shouldn't I directly compute all statistics I want from $\mathcal{D}$? No matter how many times of resampling, I can only get converged $\text{mean} = 0.52$ and $\text{var} = 0.52 * 0.48$. I don't think I can get any improvement from resampling or I can even recover the underlying distribution. Am I right?  What's the loophole of my arguments? What's the advantage of Bootstrap? For example, is there anything I cannot get from sample set $\mathcal{D}$ but from $Bootstrap$?

I recently used bootstrapping to estimate confidence intervals for a project. Someone who doesn't know much about statistics recently asked me to explain why bootstrapping works, i.e., why is it that resampling the same sample over and over gives good results. I realized that although I'd spent a lot of time understanding how to use it, I don't really understand why bootstrapping works.  Specifically: if we are resampling from our sample, how is it that we are learning something about the population rather than only about the sample? There seems to be a leap there which is somewhat counter-intuitive.  I have found a few answers to this question here which I half-understand. Particularly . I am a "consumer" of statistics, not a statistician, and I work with people who know much less about statistics than I do. So, can someone explain, with a minimum of references to theorems, etc., the basic reasoning behind the bootstrap? That is, if you had to explain it to your neighbor, what would you say?


I'm trying to call an executable that has parentheses in the name (e.g. 'test(1).exe').  With Python 3.6.2, when I try the following:  os.system('test(1).exe')   I get:  'test' is not recognized as an internal or external command, operable program or batch file.  But if I change the filename to 'test1).exe' by removing '(', then the following works successfully:  os.system('test1).exe')   Any ideas why the left parenthesis is causing an issue with os.system?

When using os.system() it's often necessary to escape filenames and other arguments passed as parameters to commands.  How can I do this?  Preferably something that would work on multiple operating systems/shells but in particular for bash.  I'm currently doing the following, but am sure there must be a library function for this, or at least a more elegant/robust/efficient option:  def sh_escape(s):    return s.replace("(","\\(").replace(")","\\)").replace(" ","\\ ")  os.system("cat %s | grep something | sort > %s"            % (sh_escape(in_filename),               sh_escape(out_filename)))   Edit: I've accepted the simple answer of using quotes, don't know why I didn't think of that; I guess because I came from Windows where ' and " behave a little differently.  Regarding security, I understand the concern, but, in this case, I'm interested in a quick and easy solution which os.system() provides, and the source of the strings is either not user-generated or at least entered by a trusted user (me).


I am new to Ubuntu. I am loving it but I have this problem that I have not been able to solve even after reading the answers here. So, what should I do?

I get this error when trying to use apt-get:  E: Could not get lock /var/lib/dpkg/lock - open (11 Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/) is another process using it?     How can I fix this?


Let $\beta>2$ be a real number, is it always possible to construct a real number $x$ such that $\mu(x)=\beta$? where $\mu$ denotes the irrationality measure.    The problem as I see it is to find $(a_n)_n$ an unbounded sequence of positive integers such that $\limsup \ln_{q_n}(q_{n+1})=\beta-1$ where $q_n$ is the numerator of the $n$-th convergent of $[a_0;a_1,a_2,\dots]$. But I was not able to continue.

Is it possible to generate transcendental numbers of arbitrary irrationality measure ? I am thinking of something like an infinite series which depends on a parameter fixing the irrationality measure.   All I have found so far is bounds on the irrationality measure of famous numbers, I have not been able to find something going the other way around.


I was just wondering if they was an option for line correction on photoshop. In clip studio plant there is an option which is called post correction which can be adjust to make the lines actually straight. I am new in photoshop so I am not sure if there is a similar option like in Clip studio paint. Please let me know if anyone knows.

Illustator has a nice effect on it pencil tool : curve auto-correction. When you draw line, it automatically correct your hand, making it more neat and round. Sadly, I don't see this option on the photoshop pencil tool.  And well, I can't /don't want use Illustrator for several reasons, including the fact it's not really suitable for drawing. I'm quite surprised don't found it on Photoshop, according to how usefull it is.  So there is my question : is there any plugin or way to benefit it on Photoshop ? Many thanks.


Let $f(z)$ be an entire function satisfying $|f(z)|\leq k|z|$ for some positive constants $k$ and all $z$. Show that $f(z)=az^2$ for some constant $a$.

Let $f$ be an entire function such that $\mid f(z) \mid \leq A \mid z \mid$ for all $z$, where $A$ is a fixed number. Show that $f(z)=a_1z$, where $a_1$ is a complex constant.


I'm trying to monkey-patch a class instance, but don't quite see how I can patch a class method no problem.  >>> class Simple(object):  ...     def make(self, arg): ...         return arg * 2 ...  >>> s = Simple() >>> def times_four(self, arg): ...   return arg * 4 ...  >>> Simple.make = times_four >>> s.make(10) 40   But say I only wanted to replace make in the instance, what's the easiest way to do that?  >>> def times_eight(self, arg): ...   return arg * 8 >>> s.make = ???

I've read that it is possible to add a method to an existing object (i.e., not in the class definition) in Python.   I understand that it's not always good to do so. But how might one do this?


I recently stumbled upon an indefinite integral . sin(x)/x [ Another similar one is root (x) times sin x. However if we substitute sin(x) in terms of x as Maclaurin series we could get a series of infinite yet integrable polynomials . What's the catch?

In the past, I've come across statements  along the lines of "function $f(x)$ has no closed form integral", which I assume means that there is no combination of the operations:  addition/subtraction multiplication/division raising to powers and roots trigonometric functions exponential functions logarithmic functions  which when differentiated gives the function $f(x)$. I've heard this said about the function $f(x) = x^x$, for example. What sort of techniques are used to prove statements like this? What is this branch of mathematics called?  Merged with "" by : Sometimes we are told that some functions like $\dfrac{\sin(x)}{x}$ don't have an indefinite integral, or that it can't be expressed in term of other simple functions. I wonder how we can prove that kind of assertion?


I wanted to know how to solve this question without the use of the cauchy-schwarz inequality and using more standard methods/tests (such as ratio test, comparison test etc.) for convergence/divergence if possible. Thanks in advance.

Firstly we are given that $a_k\in\mathbb C$ and $\sum\limits_{k=1}^\infty {a_k}^2$ converges absolutely. The question then asks to show that $\sum\limits_{k=1}^\infty \frac{a_k}{k}$ converges absolutely.  I know that absolute convergence of the first series this implies that $\sum\limits_{k=1}^\infty ||{a_k}^2||$ converges.  Thus by the Cauchy-Schwarz inequality I get  $$ \sum\limits_{k=1}^\infty ||{a_k}^2|| \leq \sum\limits_{k=1}^\infty ||{a_k}||.||a_k|| $$  From this point onwards I have no idea of how to proceed. (Should I make use of Cauchy products?)


static struct fuse_oprations hello_oper = {   .getattr = hello_getattr,   .readdir = hello_readdir,   .open    = hello_open,   .read    = hello_read, };   I don't understand this C syntax well. I can't even search because I don't know the syntax's name. What's that?

I want to initialize a struct element, split in declaration and initialization. This is what I have:  typedef struct MY_TYPE {   bool flag;   short int value;   double stuff; } MY_TYPE;  void function(void) {   MY_TYPE a;   ...   a = { true, 15, 0.123 } }   Is this the way to declare and initialize a local variable of MY_TYPE in accordance with C programming language standards (C89, C90, C99, C11, etc.)? Or is there anything better or at least working?  Update I ended up having a static initialization element where I set every subelement according to my needs.


Users are able to enter a URL into a text field, I would like to add a jQuery based feature that would be able to check if a page at least exists so that I could warn a user if they may have accidentally entered an incorrect URL, before they hit "save"  Currently I am trying to use the following code, though it seems to always return the "Error: Does not exist" message:  $('#Inventory_edocsUrl').blur(function(){     $.ajax({         url:$('#Inventory_edocsUrl').val(),         type:'GET',         success: function()         {             console.log('Success, file exists!');         },         error: function()         {             console.log('ERROR:Does not exist');         }     }); });   I tested with http://google.com as a test url in the text field and it still returned the error. Upon switching the url to google.com (not http), I got the same error message along with another error message:   GET http://localhost/inventory/web/inventory/google.com 404 (Not Found)    It makes sense that this second version does not work as there is no http:// and therefore the error should be returned, but I don't see why the first correct url is returning the programmed error message, but is actually returning no console errors like the second trial.  Is there something I am doing wrong?

Is it possible to do a HTTP Head request solely using an XMLHTTPRequest in JavaScript?  My motivation is to conserve bandwidth.  If not, is it possible to fake it?


I am trying to make my appache server, server a javascript file which I have compressed my self. I don't want my javascript to be compressed on the fly for example with mod_deflate or mod_gzip. I have already compress the file my self and I just want to serve it. Among others I have follow the instructions from this post (which is my current configuration).   and from  .  I have also tried some other partial solution that I read here and there but I cannot make it work.  Currently my .htaccess configuration is like this:   <IfModule mod_rewrite.c>     RewriteCond %{HTTP:Accept-Encoding} gzip     RewriteCond %{REQUEST_FILENAME}.gz -f     RewriteRule (.*\.(js|css))$ $1.gz [L] </IfModule> AddEncoding x-gzip .gz <FilesMatch .*\js.gz >  ForceType application/x-javascript </FilesMatch>   I have read a lot of solution but they do not work for my inlucding this  I dont know what I am doing wrong and I have not get an answer. Besides I think the above solutionshould work without Mutliviews because it use rewrite to rename the requested files. Can someon please helpe me with the correct configuration?  For testing purpose I have jquery.min.js and jquery.min.js.gs  The file that server is not the compressed one but the uncompressed.  I am hosted on plesk 11.5 using centos 6.5 and apache 2.2.15.  I have tried lots of thinks but I can not make it work. Any help would be appreciated  you can test my page here    thanks for yout time.

I am serving all content through apache with Content-Encoding: zip but that compresses on the fly.  A good amount of my content is static files on the disk.  I want to gzip the files beforehand rather than compressing them every time they are requested.  This is something that, I believe, mod_gzip did in Apache 1.x automatically, but just having the file with .gz next to it.  That's no longer the case with mod_deflate.


Im not sure why my code does not do what I want (I want to return a list of unique items)  B = ["blue", "blue", "red",   "green", "red",  "blue", "yellow", "green", "blue", "red"] def makeUnique(list):     unique = []     for i in range(0, len(list)):         if list[i] not in unique:             unique.append(item)     return unique print makeUnique(B)   It returns  ['red', 'red', 'red', 'red', 'red', 'red', 'red']   Edit: idents might be incorrect, when pasting some was missing, so its not a ident error or sth

Is there a built-in that removes duplicates from list in Python, whilst preserving order? I know that I can use a set to remove duplicates, but that destroys the original order. I also know that I can roll my own like this:  def uniq(input):   output = []   for x in input:     if x not in output:       output.append(x)   return output   (Thanks to  for that .)  But I'd like to avail myself of a built-in or a more Pythonic idiom if possible.  Related question:


This is a simple program using Hash maps where it utilizes a ranking system for names for baby boys and girls from a file with name ex: "babynameranking2008.txt". I am receiving a null pointer exception in my switch case for my variable ranking,    The error is only occurring in the variable for each switch case for boy and girl in for example: "ranking=boys[index].get(name);". If I make ranking equal to 0 it removes the exception.  public class Lab08 {     @SuppressWarnings("unchecked")     private static Map<String, Integer>[] boys = new HashMap[10];     @SuppressWarnings("unchecked")     private static Map<String, Integer>[] girls = new HashMap[10];      public static void main(String[] args) throws IOException {         Scanner input = new Scanner(System.in);         String answer;         readNames(); // method to read the info from the files and add to our Map array                              // Get user input and continue until done          do {             System.out.print("ENter a year (2008-2017): ");             int year = input.nextInt();input.nextLine();             System.out.print("Boy or girl? ");             String sex = input.nextLine().toLowerCase();             System.out.print("ENter a name: ");             String name = input.nextLine();              sex = sex.toLowerCase();             int index = 0;             int ranking = 0;             switch (sex) {                 // display the output based on the sex (boy or girl)                 case "boy":                    index = year - 2008;                    ranking = boys[index].get(name);                    System.out.printf("The Boy named %s is ranked %d in %d \n",name,ranking,year);                                      break;                  case "girl":                    index=year-2008;                    ranking=girls[index].get(name);                    System.out.printf("The Boy named %s is ranked %d in %d \n",name,ranking,year);                    break;                  default:                    System.out.println("sex should be boy or girl");                    break;             }             //input.close();             System.out.print("Do you want check another name (yes or no)?");             answer = input.nextLine().toLowerCase();         } while (answer.equals("yes"));     } // end main      //read information from each file and add to appropriate Map array     public static void readNames() throws IOException {         String fixedName="babynameranking";         int year=2008;         String type=".txt";          File infile;         for(int i=0;i<10;++i) {             boys[i] = new HashMap<>();             girls[i] = new HashMap<>();                      }                         for(int i=0;i<=9;++i) {               // construct the file name             String filename = fixedName+Integer.toString(year)+type;// construct the file name ;             infile = new File(filename);              Scanner in = new Scanner(infile);             while(in.hasNext()) {                 // read info from the file and add to Map arrays                 int ranking=in.nextInt();                    String boyName=in.next();                    in.next();                     String girlName=in.next();                    in.next();                   //put in map                    boys[i].put(boyName, ranking);                    girls[i].put(girlName, ranking);              } // end while             in.close();              year=year+1;          } // end for loop     } // end readNames()   } // end Lab08

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?


How can black holes emit detectable magnetic fields and gravity if nothing can escape the event horizon?

My understanding is that light can not escape from within a black hole (within the event horizon).  I've also heard that information cannot propagate faster than the speed of light.  It would seem to me that the gravitational attraction caused by a black hole carries information about the amount of mass within the black hole.  So, how does this information escape?  Looking at it from a particle point of view: do the gravitons (should they exist) travel faster than the photons?


does anybody have an idea where to get the official win7 iso? All the download links that i found on the web seems to be invalid. (iam not talking about pirated versions from dubious sources. just the iso's of the original installation medias that microsoft provides totally legally)  e.g.:      (looking for german versions)  does anybody have some newer informations?  thanks.

I just bought a serial for Windows 7 on-line from the Microsoft store (the most painful shopping experience EVER!). I selected that I wanted to download my version of Windows 7 after purchase. After payment, I have listed a Product Key but no download link in sight.   Where do I download my Windows 7 ISO to burn to disk?  Note: I'm not a Technet or MSDN subscriber.


I have a file like this:  1 2 3   I need to copy data n times with an empty line after each copy. I used these commands  #!/bin/sh num=$(sed -n '1 p' FILE.txt) for i in {1..  $num }; do cat distance_k.txt >> distance.txt; done   n is a number taken from another file 'FILE.txt' (FILE.txt have form like this :   90 Abcbaahjfh ...   However, it copied only 4 times. Could you please help me? Thank you so much!  bash shell  Output  1 2 3  1 2 3  1 2 3  1 2 3   1 2 3  ...

How do I iterate over a range of numbers in Bash when the range is given by a variable?  I know I can do this (called "sequence expression" in the Bash ):   for i in {1..5}; do echo $i; done   Which gives:     1    2    3    4    5   Yet, how can I replace either of the range endpoints with a variable? This doesn't work:  END=5 for i in {1..$END}; do echo $i; done   Which prints:     {1..5}


Prove that     $\lim_{n \to \infty} \frac{n!}{n^n} = 0$    I've already considered using l'Hoptials rules but I cannot take the derivative of a factorial (as it is a discrete function).   Thanks

I am trying to calculate the following limit without Stirling's relation.  \begin{equation} \lim_{n \to \infty} \dfrac{n!}{n^n} \end{equation} I tried every trick I know but nothing works. Thank you very much.


I can't install or remove any software and the Ubuntu software center shows me this message when I install software:  Software can't be installed or removed because the authentication service is not available.  (org.freedesktop.PolicyKit.Error.Failed: ('system-bus-name', {'name':  ':1.88'}):  org.debian.apt.install-or-remove-packages    and after I press ok, a second massage appears:  org.freedesktop.PolicyKit.Error.Failed: ('system-bus-name', {'name': ':1.88'}):  org.debian.apt.install-or-remove-packages   Can anyone help me?

I have 12.10 ubuntu and when I try to remove / install programs I get notification :      Software can't be installed or removed because the authentication service is not available.    (org.freedesktop.PolicyKit.Error.Failed: ('system-bus-name', {'name':  ':1.104'}): org.debian.apt.install-or-remove-packages   When I log in as root user (instead of user account that I regulary use) i have no problems.


I wish to upgrade my OSX and am worried I lose my Adobe CS apps since they were issued by my (ex)college and i do not have the keys/seriel#'s  I didnt quite understand the answer given. Will a TM backup save all this apps/data so if my new osx gives me problems I can 'go back' and recover the previous osx and ALL my apps/data incl the Adobe stuff! ?  thanks D

I want to upgrade my OS X to Yosemite from Lion and also upgrade my HDD to a SSD but im worried about loosing my programs since I don't have the installers or serial keys. Specifically Adobe cs5 master collection and iWork.


I'm using Ubuntu 16.04.01. About 2 days ago I updated my Ubuntu and restarted as recommended.    But after that, gnome terminal stopped working.  No response when I click the gnome terminal icon.    I tried to execute terminal as below.  $/usr/bin/python3 /usr/bin/gnome-terminal # Error constructing proxy for org.gnome.Terminal:/org/gnone/Terminal/Factory0: Error calling StartServiceByName for org.gnmome.Terminal: Timeout was reached   When I checked my python3 I found its version is 3.6.6.    How can I fix this?

I just tried to install python 3.6 on my Ubuntu 16.04 system, and now I can't run the terminal from the launcher or from Ctrl + Alt + T. I tried to run gnome-terminal from XTerm and got the following message:  Traceback (most recent call last):   File "/usr/bin/gnome-terminal", line 9, in <module>     from gi.repository import GLib, Gio   File "/usr/lib/python3/dist-packages/gi/__init__.py", line 42, in <module>     from . import _gi ImportError: cannot import name '_gi' Error in sys.excepthook: Traceback (most recent call last):   File "/usr/lib/python3/dist-packages/apport_python_hook.py", line 63, in apport_excepthook     from apport.fileutils import likely_packaged, get_recent_crashes   File "/usr/lib/python3/dist-packages/apport/__init__.py", line 5, in <module>     from apport.report import Report   File "/usr/lib/python3/dist-packages/apport/report.py", line 30, in <module>     import apport.fileutils   File "/usr/lib/python3/dist-packages/apport/fileutils.py", line 23, in <module>     from apport.packaging_impl import impl as packaging   File "/usr/lib/python3/dist-packages/apport/packaging_impl.py", line 23, in <module>     import apt   File "/usr/lib/python3/dist-packages/apt/__init__.py", line 23, in <module>     import apt_pkg ModuleNotFoundError: No module named 'apt_pkg'  Original exception was: Traceback (most recent call last):   File "/usr/bin/gnome-terminal", line 9, in <module>     from gi.repository import GLib, Gio   File "/usr/lib/python3/dist-packages/gi/__init__.py", line 42, in <module>     from . import _gi ImportError: cannot import name '_gi'   How can I fix this error?  It should also be noted that:   My gnome-terminal file is now a python script. The gnome-terminal.real file will open the terminal as expected. python3.5 gnome-terminal will open the terminal as expected.


I am self-employed as an indie game developer and would like to visit New Zealand and Australia to do some touristing.  Can I work on my projects (programming/design/online marketing/support) while visiting another country, say New Zealand or Australia? Can I do that for a month-long visit? What about longer periods: 90 days, 6 months? Can I do that under a regular tourist visa or do I need a different visa? Do I need to worry about taxes?  Not as important, but:  Does the answer change if I (a) take on any (online) freelance work or (b) hire out some (online) freelance work while there?  Note that I am a US citizen. Also, assume things will return to the pre-COVID normal and the travel will take place long after the pandemic is over. Similar questions, but asking about the UK:  (answer is no?) and Japan:  (conflicting answers, but it also seems like a no?).

I'm planning to work with a company in the USA while I travel the world (I'm a US citizen). I don't plan to be in any country more than a month, and plan to stay in hotels, hostels, and Airbnb's.  Will I need to obtain a work visa in each country?


Everyone seems to hate Jar Jar Binks.  So why did George Lucas create him?  The story of Binks and his people doesn't really contribute anything to the story, and I find that the parts involving Binks and his people are annoying or boring, adding unnecessary length to The Phantom Menace (which is boring enough with all that trade federation stuff and the endless pod racing).  So why exactly did he do it?  What necessary element did Lucas feel that Binks was contributing that Star Wars would have lacked otherwise?   Has he ever said anything directly about Binks?

I'm not asking about just an in-universe explanation.  I'm talking about from the point of view of a writer or of someone analyzing a film or written story.  I recently re-watched all six Star Wars movies and the only actual act Jar-Jar performed was when he filled in for Padme in the Senate and supported giving emergency powers to Palpatine.  This isn't an action that had to come only from Jar-Jar.  Any of a number of Senators could have been bribed or blackmailed into doing this.  He does not work effectively as a foil to other characters since he is too extreme and doesn't really contrast directly with anyone.  (And if he's a foil for the Jedi, then having Qui-Gon act as his foil by grabbing his tongue really breaks that possibility up.)  I know he's the most reviled character in Star Wars, so I don't want to get into hate speeches or anything.  I just want to know: Does the character of Jar-Jar Binks serve any actual purpose in Star Wars?


I've written hello.py (a basic "hello world" program) and would like to be able to quickly run it on my Ubuntu machine by pressing the Win key to open Dash, then type the name of the script (or something similar to that).  However, when I type hello.py into Dash, it opens the file in an editor rather than execute it. I added a shebang line #!/usr/bin/env python3 and run chmod u+x hello.py, it still opens the file in an editor.  I tried creating a hello.sh shell script that will run the Python script, but the shell script also gets opened in the editor when I type its name into Dash.  Is there a way to run a Python script by typing its name into Dash? Or is there another easy way to run an arbitrary Python script? Essentially, what I want is something like the Windows Run Dialog Box that appears when you press Win-R, which can run any program on the system PATH.

Will Unity allow making custom launcher icons from .desktop files or via menu editing system? (Right now the launcher doesn't give the option to "keep in launcher" on all programs.  For some programs I use, I have to make custom launchers or .desktop files.  For instance, daily blender builds are generally just folders with an executable.  In basic Gnome or KDE, I can make a new menu entry with the menu editing system. Then, I can also add it to Docky either from the menu or by dragging a .desktop file to it. Unity launcher doesn't support drag and drop, so thats not a bug or anything, but when I open a .desktop file, it has unpredictable results. Most time it will not have "keep in launcher". Sometime it will have a pinnable item without the .desktop's icon, and if I pin the item to the launcher, it will not call upon the program again after closing it. I've also gotten it to just work with a .desktop file for celtx.


I've read the latter compares the branches starting from their ancestor. What exactly does that mean?

Some Git commands take commit ranges and one valid syntax is to separate two commit names with two dots .., and another syntax uses three dots ....  What are the differences between the two?


I want to make a tikz-picture of a Hasse diagram and by problem is that the lines between nodes stop a bit short of the border of the node and I can't figure out how to fix this.  Here is my code:  \begin{tikzpicture}[scale=\tikzscale, source/.style={draw,thick,rounded corners,inner sep=2pt}] \node[source] (min) at (0,0) {$\emptyset$}; \node[source] (A1) at (-2,1) {$a$}; \node[source] (A2) at (-1,1) {$b$}; \node[source] (A3) at (0,1) {$h$}; \node[source] (A4) at (1,1) {$c$}; \node[source] (A5) at (2,1) {$d$}; \node[source] (B1) at (-3.5,3) {$ab$}; \node[source] (B2) at (-2.5,3) {$ah$}; \node[source] (B3) at (-1.5,3) {$bh$}; \node[source] (B4) at (-0.5,3) {$ad$}; \node[source] (B5) at (0.5,3) {$bc$}; \node[source] (B6) at (1.5,3) {$ch$}; \node[source] (B7) at (2.5,3) {$dh$}; \node[source] (B8) at (3.5,3) {$cd$}; \node[source] (C1) at (-3,5) {$abh$}; \node[source] (C2) at (-1.5,5) {$adh$}; \node[source] (C3) at (0,5) {$abcd$}; \node[source] (C4) at (1.5,5) {$bch$}; \node[source] (C5) at (3,5) {$cdh$}; \node[source] (max) at (0,6.5) {$abcdh$}; \draw[thick] (min) -- (A1); \draw[thick] (min) -- (A2); \draw[thick] (min) -- (A3); \draw[thick] (min) -- (A4); \draw[thick] (min) -- (A5); \draw[thick] (A1) -- (B1); \draw[thick] (A1) -- (B2); \draw[thick] (A1) -- (B4); \draw[thick] (A2) -- (B1); \draw[thick] (A2) -- (B3); \draw[thick] (A2) -- (B4); \draw[thick] (A3) -- (B2); \draw[thick] (A3) -- (B3); \draw[thick] (A3) -- (B6); \draw[thick] (A3) -- (B7); \draw[thick] (A4) -- (B5); \draw[thick] (A4) -- (B6); \draw[thick] (A4) -- (B8); \draw[thick] (A5) -- (B4); \draw[thick] (A5) -- (B7); \draw[thick] (A5) -- (B8); \draw[thick] (B1) -- (C1); \draw[thick] (B1) -- (C3); \draw[thick] (B2) -- (C1); \draw[thick] (B2) -- (C2); \draw[thick] (B3) -- (C1); \draw[thick] (B3) -- (C4); \draw[thick] (B4) -- (C2); \draw[thick] (B4) -- (C3); \draw[thick] (B5) -- (C3); \draw[thick] (B5) -- (C4); \draw[thick] (B6) -- (C4); \draw[thick] (B6) -- (C5); \draw[thick] (B7) -- (C2); \draw[thick] (B7) -- (C5); \draw[thick] (B8) -- (C3); \draw[thick] (B8) -- (C5); \draw[thick] (C1) -- (max); \draw[thick] (C2) -- (max); \draw[thick] (C3) -- (max); \draw[thick] (C4) -- (max); \draw[thick] (C5) -- (max); \end{tikzpicture}     Can anybody help me? Thanks!

When I use TikZ tree with nodes with rounded corners, the connecting lines do not touch the nodes (near corners) but end where would rectangle end. Is there an easy way around it?  \documentclass{standalone} \usepackage{tikz} \begin{document} \begin{tikzpicture} [sibling distance=100]    \node[rectangle, draw, rounded corners = 3]{ }   child { node { } }   child { node { } }   ; \end{tikzpicture} \end{document}


I am currently using Ubuntu 15.04.  My Linux experience is limited.  I would like to execute fstrim weekly.  Ubuntu already has a script set up in /etc/cron.weekly/fstrim, but it does not do exactly what I want it to.  I would like to save the output of this to a cumulative log and I am wondering: what is the best way to achieve this.  At the same time, I wish to facilitate my installs so I have personal requirements:   From a fresh OS install, sudo crontab -e is the only acceptable change outside of /home for the solution to work (i.e. no need to modify default file /etc/cron.weekly/fstrim) Log files must be stored to my preferred format, in a dedicated file in /home/user/path/to/mylogfile.txt   So I now understand that it is safe to sudo vi /etc/cron.weekly/fstrim as it is a script file rather and than a crontab (in other words: a command similar to crontab -e is not required for OS-native weekly jobs stored there), but...  Question #2 - The end goal is calling fstrim weekly while ensuring it is performed only once per week on the system.  Are there any errors or problems with the following solution?:  Set up root's crontab such that:  $ sudo crontab -l @weekly /home/user/path/to/myscript.sh   Have an executable file /home/user/path/to/myscript.sh that contains:  #!/bin/bash  if [ -f /etc/cron.weekly/fstrim ]; then     mv /etc/cron.weekly/fstrim /home/user/cron_backups/fstrim.orig fi  # trim all mounted file systems which support it, and log results /sbin/fstrim -v --all || true >> /home/user/path/to/mylogfile.txt   [END]

I recently installed an SSD and AFAIK Ubuntu makes a weekly FSTrim on SSD's that support it.  Is there a log file of this trims?


In Harry Potter, what makes a wizard a wizard and a witch a witch? Apparently, wizards can be both men and women. But I'm not sure if men can be witches. So in this universe what is the distinction?  According to the sci fi stack exchange :     "Wizard" can be used for males and females.   According to this question:      Well, when Hagrid describes Muggles to Harry as "non-magic folk" it   might imply that 'magic' is a collective term used to describe witches   and wizards. An example sentence might be, "All the non-magic folk to   the right, the magic to the left." Also, 'magic' is the word I've most   commonly seen/heard as used to describe the genetic attribute that   makes a person a witch or wizard. Either a person has the magic gene   or they don't.   Because magic means both witches and wizards, this means there is a difference. Women can be wizards and in history men can be witches.  Therefore there is a difference between the magic abilities of witch and wizard.  I'm not seeing the clear definition though of what makes one or the other. The question related to a term for both wizards and witches, however, reports it as two separate entities, therefore there exists a distinction between witch and wizard, in the Potterverse anyway, but what makes one or the other according to J.K. Rowling I have not found an explanation that she gives.

In the Harry Potter world, there's the term "muggle" for people with no magical abilities, "muggle-born" for those with magical abilities who's parents are muggles and "squib" for those with no magical abilities who's parents are magical.  But is there any collective term for all magical people (as opposed to wizards for males and witches for females)?  I don't recall seeing any word that refers to all men and women and children with magical abilities, and it's the only group left without noun or collective noun to describe them.


I have a class Bill, and I wrote this functor in this class  //functor       bool operator==(const Bill& other) const;      void operator()(int x) { sumCost -= x; }   What I don't know, is how to use it in main.  Thanks for help!

I keep hearing a lot about functors in C++. Can someone give me an overview as to what they are and in what cases they would be useful?


The hope is that his son will/would return.    What’s the difference in meaning of the sentence when will and would are used one at a time?  Should we use only would inasmuch as hope is only hypothetical??

I hope someone, once and for all, can clarify (with examples) the difference in usage of will vs. would vs. would have vs. will have.


The idea behind Cox regression in survival analysis is that it does not require knowing the baseline hazard rate, $\lambda_0(t)$. Yet, one often needs this rate, and many software packages do estimate both the baseline hazard and the baseline survival function. Question: How are the baseline hazard and/or survival function estimated? Does one reduce it to applying Kaplan-Meier estimator or is there a procedure in the spirit of Cox likelihood? To clarify: I did search the other posts, and there are many similar questions. However, they all seem to ask for a specific R or Python function for a specific package, whereas my question is about a math behind. (In order to understand the issues that I have with one such package.)

I am doing a multivariate Cox regression, I have my significant independent variables and beta values. The model fits to my data very well.   Now, I would like to use my model and predict the survival of a new observation. I am unclear how to do this with a Cox model. In a linear or logistic regression, it would be easy, just put the values of new observation in the regression and multiply them with betas and so I have the prediction of my outcome.  How can I determine my baseline hazard? I need it in addition to computing the prediction.  How is this done in a Cox model?


I'm building an isometric engine.  I use TILE_SIZE * TILE_SIZE (minecraft like) tiles. (I'm using 64 * 64 tiles but I can change the number when I want)  I can access for each tiles to this informations :   - OFFSET_LEFT(same for every tile on a layer)  - OFFSET_TOP(same for every tile on a layer)   - x (classic 2D tiled coordinates)  - y(//)   - isometric i   - isometric j   Tile are drawed at (i * TILE_SIZE, j * TILE_SIZE) I use the following formula to get from x to i and y to j :  int i = (x - y) / 2,     j = (x + y) / 4;   No problem for displaying, I got my diamond shape :    I try to find a formula to convert my cursor coordinates into those isometrics ones(i, j) with the following questions in mind I wrote on the screenshot.  After doing i * TILE_SIZE, etc... Finding a way to handle offsets(??????)...  I'm gonna render this off-screen :    And banzai, tile detection with some getPixel()...  But to do that, I have to resolve the problems I highlighted with the balise  in the following topic.  Final purpose : get the tile index in my tile array(wich I suppose I can have with i + j ?)  I'm without a clue for days, reading a lot of topic, but some of them sprout some chinese like sqrt(what the... is this creature ?) or matrix transform ????  So even with all the topic on the subject here, I was unable to find a proper solution fulfilling my project's need. Thanks for reading me; ask me if I missed some informations.  EDIT : About the link you gave :  int i = y / tile_size + x / (2 * tile_size), j = y / tile_size - x / (4 * tile_size);   This one give some 'good results'(I don't really know if it's working but the numbers seem rights) but I can't handle :  - offsets - when I click outside the map

I have a function isoToScreen(x, y) that converts Isometric coordinates to Screen coordinates.  var tileW = 16; var tileH = 16;  var isoToScreen = function(x, y) {     var posX = (x - y) * tileW;     var posY = (x + y) * tileH / 2;      return [posX, posY]; };   But how would I make a function that converts screen coordinates back to Isometric coordinates?  var pos = screenToIso(16, 8);  pos[0] = 1; // Iso X pos[1] = 0; // Iso Y


Let $I,J$ be left ideals in a ring $A$ such that $\forall x\in I \ \ \forall y \in J$ we have that  $x,y$ are nilpotent. Is then true that every element of $I+J$ is nilpotent? Now, if the ideals are bilateral, expanding $(x+y)^{n_0}$ and "playing" a little bit with the exponent $n_0$ we've proved that the answer is: yes. But I think a different approach is needed with the hypothesis that $I,J$ are left ideals. Any suggestion?

Is an arbitrary sum of nil (nilpotent) right ideals a nil (nilpotent) right ideal?  If $I=\sum I_i$ is a sum of nil ideals then each element $x$ of $I$ is a finite sum $x=x_1+...+x_n$ of elements $x_k\in I_k$ a power ${x_k}^{p_k}$of each of which is zero. But, since each power of $x$ is a finite sum constituting of  summands of the form $∏{x_i}^{t_i}  $( of course, in this product the $x_i$'s may be repeated with different powers), I guess that one could choose the power of $x$ so "big" that it be annihilated.   Is my guess true? How?  Thanks!


Wouldn't it have been more adaptive to develop light skin and so reflect incoming light?

I don't understand why darker skin is advantageous in hotter climates. Wouldn't it absorb more of the heat? I have heard that it reduces the incidence of cancer, but I would think absorbing more radiation would increase the risk?


I am capturing images in Raw format now. I have a Canon 750d with me.  The format of the files is .CR2 While trying to open these in Lightroom,  it throws an error and wasn't able to open them.  I am using Lightroom 3 at the moment because I can't afford to spend a monthly fee for Lightroom latest.  Can I download a later version of Lightroom from somewhere? What are my alternates?

I ordered a Canon 7D mark II (to replace a stolen 7D),and shot a friend's  wedding in RAW. But now, I can only view the pictures in very poor quality on my computer's photo viewer. I am not able to import the pictures into Lightroom 3 or my PSE 13. The software says no updates are available. What is wrong and what can I do?


I'm pretty sure it's possible to find a biijection from (a,b) to [c,d], but as far as proving them not homeomorphic, is it sufficient to say that the endpoints can't map to each other since the open interval does not contain its LUB and GLB? My other thought was proving the bijjection between them can't be continuous.  The question does not say whether these are in the real line or any other particular space.

Prove that an open interval $(a,b)$ and a closed interval $[c,d]$ are not homeomorphic.  I'm trying to prove this statement but have only vague ideas on how to start. How may I use the property of connectedness to show this?


I intend to travel to Spain using Schengen visa. From my research, I found out I must show I have EU77.07/day available during my stay, I must have a return ticket and I must have insurance coverage during my stay. Is this correct?  Moreover, the return ticket requirement is clear, but I was not able to find anything substantial on how I can prove the availability of EU77.07 per  day. Do I show a copy of my account balance for this total?   For the insurance coverage: I was not able to find anything that seemed reliable. Can anyone suggest on any plan or the conditions that must be met for the required coverage?  EDIT 12/17/19: I am in the list of countries that do not require a visa application. Sorry for not being clear.  And I don't intend to go anywhere outside of Spain while there. Thank you all for your comments. I was in Spain when I wrote my profile, thought would stay there but things changed and I am not there anymore.   EDIT2: Thank you all, thanks for your comments, sorry for not being clear. According to my research, while not needing a visa per se. My doubts are strictly about the specs on the requirements  to certify my ability to support myself to the tune of $EU77.07 /Day and show health coverage: How do I certify I have the required funding and what type of specs are need for the health certificate?

Lots of people would like to visit the EEA area to take holiday or to visit family or even to go for longer term visa arrangements in the Schengen zone.  In order to do this, they need a Schengen (or national) visa.  This appears to be a fairly straightforward process, but hints and tips can always be helpful.  Without focusing on any individual's circumstances, what are some helpful hints that can improve the likelihood of a successful application?


Now these days I am customizing Ubuntu and I want some icons on my desktop in customizes OS like   My computer Home Trash   How can I create these icons on my desktop. And I am in chroot environment so I can use only terminal to do any thing with my customize OS. So please tell me how can I do that with the help of terminal.

I've googled quite a bit but nothing I've found works. I just want to display the Trash, Home folder, Computer etc icons on my Desktop in Ubuntu.  The closest I've come is installing dconf-tools, running it, going to org -> gnome -> desktop -> background and checking show-desktop-icons then org -> gnome -> nautilus -> desktop and checking the icons I want to show.  Nothing happens.  I've also tried looking in compizconfig-settings-manager and gconf-editor but can't find anything there.  Ideas?


I downloaded a .tex file and after changing some Helvetica fonts to Times New Roman, I can finally see the pdf. Changing to Times New Roman was a wild guess that worked, but the result is not aesthetically pleasing. However, I didn't like the Helvetica font much either. How can I check which fonts are already installed to experiment a little? I have Miktex 2.9 installed.

Very neat that I can use any available Truetype font on my Windows machine with MikTeX and XeTeX.  %!TEX TS-program = xelatex %!TEX encoding = UTF-8 Unicode \documentclass[]{article} \usepackage{xltxtra,fontspec,xunicode} \defaultfontfeatures{Scale=MatchLowercase} \title{Fonttest}    \begin{document}    \section{Section Title} {     \setromanfont{Palatino Linotype}       The quick brown fox jumps over the lazy dog.   }   \section{Section Title} {     \setromanfont{ProggyCleanTTSZBP}       The quick brown fox jumps over the lazy dog.   } \end{document}   Is there a way to automatically generate a font test page for every available font? So that I do not have to type a test page for every available font by hand?  Actually, I do not even know how to get to the Long Font Name required for \setromanfont -- short of typing it from the screen:   The Windows directory only lists the file names, obviously. Maybe this can be done in TeX itself, but I could manage it with a Python script or such like.


I was told by one of my teachers that Galois Representation is a major tool to study Gal($\overline{\mathbb{Q}}|\mathbb{Q}$). If we know this Galois group, what knid of questions can we answer ? In short, what motivated people to study this group ?

Let's start for a simple quote from wikipedia:     "No direct description is known for the absolute Galois group of the   rational numbers. In this case, it follows from Belyi's theorem that   the absolute Galois group has a faithful action on the dessins   d'enfants of Grothendieck (maps on surfaces), enabling us to "see" the   Galois theory of algebraic number fields."   What does  wikipedia mean exactly  by "a direct description" of $\operatorname{Gal}\left(\overline{\mathbb  Q}/\mathbb Q\right)$?   It seems that the absolute group of rationals is very important in mathematics, in fact there are several tools from algebraic geometry whereby we try to study it (I'm measuring the importance of an object simply estimating the amount of forces invested on investigations about its nature). But why to give  this importance  to this particular object? For example why $\operatorname{Gal}\left({\overline K}/K\right)$, where $K$ is a generic field, is not "beautiful" as $\operatorname{Gal}\left(\overline{\mathbb  Q}/\mathbb Q\right)$?  Thanks in advance.


I am an Indian Citizen travelling from Mumbai(India) to Berlin(Germany) via British Airways which goes from Mumbai to London.  I already have a Schengen visa C-Type  Do I need a British Transit visa in this case?  Just to clarify i am not stopping at London. My destination is Berlin. But the British airways flight goes from Mumbai to London with a stop in Berlin.

Is there a website or some other way to find out if I need a transit visa for a short stop in the UK on my way somewhere else? Ideally this should give me the answer for all nationalities, and take into account any other visas I may have.


Let $a$ be a positive integer.  If $S(a)$ is the sum of 3-digit part of $a$, then prove $a$ is divisible by 37, if and only if $S(a)$ is divisible by 37.  I mention a, is the sum of 3 digit parts of a. For example, $a=5987654321$, then $S(a)=5 + 987 + 654 + 321 =1967$. I think this is very similar to the divisibility by 3, like all the digits sum is divisible by 3 then the number is divisible by 3. I think it can use decimal representation and then prove like that. And use congruences to help proove it. Can someone help judge if this is right?

I don't know if this is a well-known fact, but I have observed that every number, no matter how large, that is equally divided by $9$, will equal $9$ if you add all the numbers it is made from until there is $1$ digit. A quick example of what I mean:  $9*99 = 891$ $8+9+1 = 18$ $1+8 = 9$  This works even with really long numbers like $4376331$ Why is that? This doesn't work with any other number. Similarly for $11$ and alternating digits sums.


I'm not getting notifications for any comments on my Example Questions in Area51

The new Top-Bar does not show reputation changes from Area 51.


I have read the description of the ELM in , but a lot of it goes over my head.   What is a less mathematical, more intuitive understanding of ELM?

I've been thinking about, implementing and using the Extreme Learning Machine (ELM) paradigm for more than a year now, and the longer I do, the more I doubt that it is really a good thing. My opinion, however, seems to be in contrast with scientific community where -- when using citations and new publications as a measure -- it seems to be a hot topic.  The ELM has been introduced by  around 2003. The underlying idea is rather simple: start with a 2-layer artificial neural network and randomly assign the coefficients in the first layer. This, one transforms the non-linear optimization problem which is usually handled via backpropagation into a simple linear regression problem. More detailed, for $\mathbf x \in \mathbb R^D$, the model is  $$ f(\mathbf x) = \sum_{i=1}^{N_\text{hidden}} w_i  \, \sigma\left(v_{i0} + \sum_{k=1}^{D} v_{ik} x_k \right)\,.$$  Now, only the $w_i$ are adjusted (in order to minimize squared-error-loss), whereas the $v_{ik}$'s are all chosen randomly. As a compensation for the loss in degrees-of-freedom, the usual suggestion is to use a rather large number of hidden nodes (i.e. free parameters $w_i$).  From another perspective (not the one usually promoted in the literature, which comes from the neural network side), the whole procedure is simply linear regression, but one where you choose your basis functions $\phi$ randomly, for example  $$ \phi_i(\mathbf x) = \sigma\left(v_{i0} + \sum_{k=1}^{D} v_{ik} x_k \right)\,.$$  (Many other choices beside the sigmoid are possible for the random functions. For instance, the same principle has also been applied using radial basis functions.)  From this viewpoint, the whole method becomes almost too simplistic, and this is also the point where I start to doubt that the method is really a good one (... whereas its scientific marketing certainly is). So, here are my questions:   The idea to raster the input space using random basis functions is, in my opinion, good for low dimensions. In high dimensions, I think it is just not possible to find a good choice using random selection with a reasonable number of basisfunctions. Therefore, does the ELM degrade in high-dimensions (due to the curse of dimensionality)? Do you know of experimental results supporting/contradicting this opinion? In the linked paper there is only one 27-dimensional regression data set (PYRIM) where the method performs similar to SVMs (whereas I would rather like to see a comparison to a backpropagation ANN) More generally, I would like to here your comments about the ELM method.


If the elliptic curve has prime order of points, then all of its points are generator. Is this true? If so, how can I find the optimized generator(which generates more number of points) among them?

If the order of elliptic group is prime then every point is a generator of that group. I tested the above statement on some elliptic curves and found it true. Does that really work on all curves?  Is there any lemma or theorem which states that?


I'm trying to deploy a Controller, VF Page, and Test Class into Production, but keep getting an error that my Code Coverage is under 75% in Production - even though the Code Coverage is over 90% in Sandbox.   Did some digging and found an old Test Class created by a previous Admin that is failing in Sandbox.   Here's the code for the Test Class:  @isTest  public class MyCustomVFPage_CTR_Test  { static testMethod void testMethod1()  {  Account a=new Account(Name='Test',Website='Test');     insert a;          Contact contact=new Contact(LastName='Doe',FirstName='John', Account=a,  Qualification__c='Marketing Qualified');     insert contact;         Test.StartTest();           PageReference pageRef = Page.MyCustomVFPage; // Add your VF page Name here         pageRef.getParameters().put('ResponseCode', 'Test');         pageRef.getParameters().put('ObjectId', String.valueOf(contact.Id));         Test.setCurrentPage(pageRef);          MyCustomVFPage_CTR obj = new MyCustomVFPage_CTR();          obj.InitPage();       Test.StopTest(); } }   Here's the code for the VF Page:  <apex:page id="Page" showHeader="false" controller="MyCustomVFPage_CTR" action="{!InitPage}" cache="false">     <apex:form >         Thank you for your response.     </apex:form> </apex:page>   Here's the code for the Controller:  <apex:page > </apex:page>   We no longer use this VF page. Can anyone advise on either: 1). How to update the Test Class so that I can deploy my new code or 2). How to delete the old, unused code so that I can deploy the new code?

I cannot install Eclipse, even if I wanted to.  It is not approved software for my org.  How can test classes be deleted from production, using deployments? There no 'active' checkbox when I am editing the classes in sandbox mode, so I can't just deactivate the test class, and i cant deploy a deleted class to prod...  how the heck is this done?  I dont want to use ANT or special software.  SF must have a native way to achieve this.  And if not...  then I am very disappointed in humanity.


Here is function:  def runaction(ENV, action_list):      appmanage_list = ['status']      for action in action_list.keys():         print('Action: %s' % action)          if action in appmanage_list:              from lib import appmanage_functions             a = appmanage_functions.AppManage(ENV)             a.[SOMETHING_GOES_HERE](ENV)   It's called like:   runaction(env, main_f.opts2)   action_list (main_f.opts2 argument in function call) - is dictionary from argparse with {'optionname':True};  appmanage_list - will include all options, which need to be call with code above;  action - options name, same as method from appmanage_functions.AppManage class, need to be called.  In place of [SOMETHING_GOES_HERE] I want add action variable, to call appropriate method from class.  I tried something like:  (a. + action + (ENV))   and:  a.('%s' % action)(ENV)   But sure - this not works...  Python 2.7

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


From what I understand, pointers hold the addresses of a value, and references can be thought as const pointers.  From this sample code:  int main() {     int i = 1;     int &ri = i;     int *pi = &i;     return 0; }   The disassembly, both pointer and reference look exactly the same:  main:     push    ebp     mov ebp, esp     sub esp, 16     mov DWORD PTR [ebp-12], 1     lea eax, [ebp-12]     mov DWORD PTR [ebp-8], eax     lea eax, [ebp-12]     mov DWORD PTR [ebp-4], eax     mov eax, 0     leave     ret   Are pointers and references only enforced by the compiler?

I know references are syntactic sugar, so code is easier to read and write. But what is the difference between a pointer variable and a reference variable?


I's looking for simple(easy to implement algorithm) to check whether a point is inside the square/rectangle/polygon(convex)  I use CAShaperLayer to draw the polygon and I know there is hittest method in CAShaperLayer. For some reason, I don't allow to use hittest.  What I did so far:  I use a circle to approximate the polygon and check whether a point is inside the circle(choose three points and generate a circle since three point determine a circle). The approximate method works but it is not accurate.

I'm trying to create a fast 2D point inside polygon algorithm, for use in hit-testing (e.g. Polygon.contains(p:Point)). Suggestions for effective techniques would be appreciated.


I was able to disable the shutdown option in the start screen using Group Policy but how do I disable the shutdown button at the login screen? I'm using Windows 8.1 Update 1.

I'm using Windows 8 and I find the power button and the accessibility options very annoying. It's a computer that is in a public place surrounded with kids and they keep on changing the accessibility options and turn off the computer.  Is there a way to remove those two features from the logon screen and make it available for authenticated users only?


I'm creating exam paper using exam class as mentioned below:   \documentclass[a4paper,addpoints,answers,10pt]{exam} \usepackage{tikz} \usepackage{graphicx} \usepackage{wallpaper} \TileWallPaper{\paperwidth}{1\paperheight}{QPborder} \begin{document} \thispagestyle{empty} \begin{figure} \includegraphics[width=1.25\linewidth, height=1.15\textheight, keepaspectratio=true]{Std3Qpcover} \end{figure} \end{document}   Before Starting questions, I want to add image on the first page occupying full size of A4 page (without margin & wallpaper background).  I tried many options already mentioned on the forum, but somehow nothing is working. Can you please suggest, how can I add full page Image without margin & border & background image?

Background  Wrote a technical manual in LyX. The technical manual currently has two parts:   Cover image (PDF) Manual text (PDF)   Problem  When merging the two PDF files (with GhostScript or other software tools), there are a number of issues:   Bookmarks (lost in merging) Colours (obvious changes) PDF tags (lost in merging)   I would rather include the cover page image as a full page (no margins) at the start of the manual and have LyX (LaTeX) generate the front page when it creates the PDF. In this fashion, the cover page and the manual text need not be merged as a separate step.  Question  How do you instruct LaTeX to generate a full page image as the first page in a PDF using KOMA-Script?  Update  Using the pdfpages package produces the following result:    Note the white space above and below the image. The white space is removed using the following:  \includepdf[fitpaper]{cover}   Update  Part of the preamble contains:  % Resize figures that are too wide for the page. \let\oldincludegraphics\includegraphics \renewcommand\includegraphics[2][]{%   \graphicsformat{%     \oldincludegraphics[width=\ScaleIfNeeded,#1]{#2}%   }% }   The full preamble is at:   The error message is:  !pdfTeX error: pdflatex (file cover.pdf): cannot find image file   The file ch_02.lyx and test.latex are in the same directory. The file test.latex is the document in Martin's post. The file test.latex can find the file cover.pdf, yet the file ch_02.lyx cannot find the file. Both use the following code:  \includepdf[fitpaper]{cover.pdf}   Update  The most minimal LyX example that produces the problem:  #LyX 1.6.7 created this file. For more info see http://www.lyx.org/ \lyxformat 345 \begin_document \begin_header \textclass scrbook \begin_preamble \usepackage{pdfpages} \end_preamble \use_default_options false \language english \inputencoding utf8 \font_roman lmodern \font_sans helvet \font_typewriter courier \font_default_family default \font_sc false \font_osf false \font_sf_scale 100 \font_tt_scale 100  \graphics default \float_placement H \paperfontsize default \spacing single \use_hyperref true \pdf_bookmarks true \pdf_bookmarksnumbered false \pdf_bookmarksopen false \pdf_bookmarksopenlevel 1 \pdf_breaklinks false \pdf_pdfborder false \pdf_colorlinks false \pdf_backref false \pdf_pdfusetitle true \papersize letterpaper \use_geometry false \use_amsmath 2 \use_esint 1 \cite_engine basic \use_bibtopic false \paperorientation portrait \secnumdepth 3 \tocdepth 3 \paragraph_separation indent \defskip medskip \quotes_language english \papercolumns 1 \papersides 1 \paperpagestyle default \bullet 0 5 11 -1 \bullet 1 5 24 -1 \bullet 2 0 0 -1 \tracking_changes false \output_changes false \author ""  \author ""  \end_header  \begin_body  \begin_layout Standard \begin_inset ERT status collapsed  \begin_layout Plain Layout   \backslash includepdf[fitpaper]{cover.pdf} \end_layout  \end_inset   \end_layout  \begin_layout Standard Test \end_layout  \end_body \end_document   Thank you!


I'm trying to set up a server that will be used only for mod rewrite.   Most of my cases are described by a single rule that I want at the bottom of the htaccess file.   I also have a few dozen specific hosts and URI strings that I need to handle, eg:  www.example.com => anotherdomain.com subdomain.example.com => yetanotherdomain.com/subdirectory   etc which I'd like to be able to state in a single rewrite map directive.   the rewrite map file (QA) would look something like   www.example.com anotherdomain.com subdomain.example.com yetanotherdomain.com/subdirectory    Is there a ready way to do so? Most of what I've seen focuses on substituting a specific part of the URI, not the entire body.   I was thinking something like this would work but it isn't quite doing the trick.   RewriteCond %{HTTP_HOST} ${qa:%{HTTP_HOST}} RewriteRule (.*) ${qa:%{HTTP_HOST}}   What am I missing? How can I do this cleanly?

This is a  about Apache's mod_rewrite.   Changing a request URL or redirecting users to a different URL than the one they originally requested is done using mod_rewrite. This includes such things as:   Changing HTTP to HTTPS (or the other way around) Changing a request to a page which no longer exist to a new replacement. Modifying a URL format (such as ?id=3433 to /id/3433 ) Presenting a different page based on the browser, based on the referrer, based on anything possible under the moon and sun. Anything you want to mess around with URL   Everything You Ever Wanted to Know about Mod_Rewrite Rules but Were Afraid to Ask!  How can I become an expert at writing mod_rewrite rules?   What is the fundamental format and structure of mod_rewrite rules? What form/flavor of regular expressions do I need to have a solid grasp of? What are the most common mistakes/pitfalls when writing rewrite rules? What is a good method for testing and verifying mod_rewrite rules? Are there SEO or performance implications of mod_rewrite rules I should be aware of? Are there common situations where mod_rewrite might seem like the right tool for the job but isn't? What are some common examples?   A place to test your rules  The  web site is a great place to play around with your rules and test them. It even shows the debug output so you can see what matched and what did not.


I usually know how to do these but this one gives me trouble.  If a ball is thrown into the air with a velocity of 46 ft/s, its height in feet t seconds later is given by $y = 46t − 16t_{2}$.  (a) Find the average velocity for the time period beginning when t = 2 and lasting for each of the following.       .5 seconds ______       .1 seconds ______       .05 seconds _______       .01 seconds ______  (b) Estimate the instantaneous velocity when $t = 2$.  _______ ft/s

This is a question from my Calculus book.  I was showed the correct answer but I really need to learn what the process is to achieve the answer.  Here is the question:  If a ball is thrown into the air with a velocity of $40 \frac{ft}{s}$, its height in feet $t$ seconds later is given by $y=40t - 16t^2$ .  Find the average velocity for the time period beginning when $t = 2$ and lasting   (i) 0.5sec   (ii) 0.1sec   (iii) ...


The statement I'm trying to prove is:     $(x+y)^c\le x^c+y^c$ whenever $0\le x,y$ and $0\le c\le1$.   This comes up in the proof that $|x|_*^c$ is an absolute value whenever $0<c\le1$ and $|x|_*$ is an absolute value over some integral domain $D$. The given statement, however, is simply a question about a real inequality. How do you prove this one?  The case $x=0$ or $y=0$ is trivial, so we can assume that $x,y>0$. Then expanding the definitions we have $e^{c\log(x+y)}\le e^{c\log x}+e^{c\log y}$, but the addition doesn't play well with the exponentials and logs, so I don't see what else can be done. This feels like a convexity result, but I'm not seeing exactly how to make the connection (not to mention that I still haven't proved that $\exp$ is convex and $\log$ is concave, so if I can avoid that I'd prefer to).

If $p,q$ are positive quantities and $0 \leq m\leq 1$ then Prove that $$(p+q)^m \leq p^m+q^m$$    Trial: For $m=0$, $(p+q)^0=1 < 2= p^0+q^0$  and for $m=1$, $(p+q)^1=p+q =p^1+q^1$.   So, For $m=0,1$ the inequality is true.How I show that the inequality is also true for $0 < m < 1$.   Please help.


I'm experiencing some slowness on my laptop (SSD, I7 4th gen, 16GB) lately. I can't really figure out what it is, but one thing that I noticed is that the memory usage is quite high (8GB of the 16GB), even when I'm doing nothing. So in this image it shows my memory (geheugen) usage:    I am using 856Mb (it was 400MB before I started typing this question in Chrome) , but 53% of my memory, so more than 8GB, is used. So I wonder: where did the rest go? There are no other users logged on, I run SqlServer but I already limited it's memory usage.  Also found this datasheet in process explorer:   These are the processes using > 10MB:    This shows 'hard errors'. Is this a problem?   The 'memory' view   2 screenshots from rammap:     Do you have any idea what it can be?

I checked using RAMMap on my PC that about 1.5 GB of my installed 4 GB RAM is driver-locked.  Most results from google searches tell me that this is usually caused by drivers of virtual machine management tools like VMWare, etc but that's not the case here since I don't have any such tools installed on my PC.  How can I pinpoint exactly which driver(s) is/are causing this and how can I make the memory available to other processes?  I was thinking that the locked memory would normally be freed up and taken by other processes when required but that's not happening and my browser (Firefox) freezes everytime the memory usage for it becomes >350 MB which is very low (just playing a song from youtube and opening up facebook makes the browser freeze after a few minutes). What can I do to solve this?


For some reason, it seems that C++ doesn't like it when you split a template class (i.e. a class declared as template <typename T> class Thing) into a .h and a .cpp file, like you would do with any other class.  Does that mean that when writing a template class, I should just write it all in the header file? What do C++ programmers do in these cases?  EDIT: I understand that there are alternatives to writing it all in the .h file. But what's the best option? Or what the most common option?

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


I want to download Git in Ubuntu but my shell is giving me this:  user@user-Y11C:~$ sudo apt-get install git E: Malformed entry 1 in list file /etc/apt/sources.list.d/vscode.list (Component) E: The list of sources could not be read. E: Malformed entry 1 in list file /etc/apt/sources.list.d/vscode.list (Component) E: The list of sources could not be read. user@user-Y11C:~$   P.S : I am new to Ubuntu.

I have unistalled and reinstalled the Ubuntu Software Center as per info I found in a similar thread and I got the same response about line 91 or something like that.  I just tried to upload a screen shot but since I'm new it won't allow me to.  I also can not figure out how to cut and paste anything so I have to hand type what the error screen says, both when I attempt to open the software center and nothing happens, when I try to enter commands into the terminal to uninstall, reinstall, whatever I get the same following:  COULD NOT INTITIALIZE THE PACKAGE INFORMATION An unresolvable problem occured while initializing the package information Please report t:his bug against the 'update-manager' package and include the following error message: 'E: Malformed line 91 in source list/etc/apt/sources.list (dist parse)  E: The list of sources could not be read.,  E: The package list of status file could not be parsed or opened.   How do I report bugs?  What can be done about this.  I have searched and everything everyone says to do leads me back to the same line error message.  So, I don't know how to get to line 91 in the source list; to tell you what it says. Sorry, I'm really new to this. That is what I need is to find out how to get there and fix what it says. I would really like to NOT have to re partition my hard drive and start from scratch, so I'm really looking forward to getting this problem solved. I need to be able to install new software.


I am unable to rank my website, even I have tried all the possible efforts like off-page activities (bookmarking, classifieds, forum posting, blog commenting, etc.) and I have done completely on-page changes meta tags, web content. But my website is not getting rank. Please help me and give suggestions...

What are the best ways to improve a site's position in the Google search results?


Given a sequence of complex numbers that $$\sum_{l=1}^{n}|z_l|=1$$ I want to find the following number $$\inf\left\vert\sup\limits_{I\subset \mathbb{Z}_n}\sum\limits_{i\in I}z_i\right\vert$$ This arises from the third problem of CMO, 1986. Somebody told me that the result is $1/\pi$ which should use some complex analysis. Besides, I am also interested in the example that is sufficiently close to the infimum.

Consider the following problem.  Fix $n \in \mathbb N$. Prove that for every set of complex numbers $\{z_i\}_{1\le i \le n}$, there is a subset $J\subset \{1,\dots , n\}$ such that   $$\left|\sum_{j\in J} z_j\right|\ge \frac{1}{4\sqrt 2} \sum_{k=1}^n |z_k|.$$  I believe I proven have a stronger statement. Is this proof correct, and if so, what is the optimal constant?  My proof. Consider all the $z_i$ with positive real part. Call the real part of the sum of these numbers $X^+$. In a similar way, form $X^-$, $Y^+$, and $Y^-$. Without loss of generality, let $X^+$ have the greatest magnitude of these.  Note that because $|\operatorname{Re}(z)|+|\operatorname{Im}(z)|\ge |z|$, we have  $$ \left(\sum_{k=1}^n  |\operatorname{Re}(z_k)|+|\operatorname{Im}(z_k)| \right) \ge \sum_{k=1}^n |z_k|.$$  But note that $\sum \limits_{k=1}^n  |\operatorname{Re}(z_k)|+|\operatorname{Im}(z_k)| = X^+ + |X^-|+ Y^+ +|Y^-|$, so we have  $$ 4X^+ \ge \sum_{k=1}^n |z_k|.$$ By choosing $J$ to be the set of complex number with positive real part, this proves a stronger statement, because the factor of $1/\sqrt 2$ isn't needed.