I am logged in on my android app.  I followed a link from reddit to an apple.stackexchange.com question and I wanted to cast a vote.  A slide out red message appeared stating:     The account associated with the access_token does not have a user on the site   Is there a way to create a user on a site from the app? Should it be easy to get to following a no user on site error?

When I try to answer a question on a site on which I don't have an account, it should be pointed out to me that I am currently not a member and it should bring me to a register page. At the moment, if I try to answer or comment I get the following message :  Please fix the following The account associated with the access_token does not have a user on the site


In the background is a white wall or in the background there is a white wall?

I just recently read this paragraph: "Think of an ad campaign that you still remember long after viewing it. Consider a book that might have inspired you. Behind those memories are solid writing."  I would say grammatically, the subject of that bolded sentence is "writing," and "behind those memories" is a prepositional phrase modifying "writing." Therefore, the verb would be "is" not "are" since it needs to agree with the subject. (solid writing, which is singular).  But even if it were changed to "Behind those memories is solid writing," I still find the sentence awkward. I am trying to figure out how I would reword, but perhaps, I am wrong, and it is fine as is.


I fitted an ARIMA model on a time series and then did an ARCH-LM Test which shows heteroscedasticity. So I want to get an ARIMA-GARCH model.  My question: Do I need to reestimate the parameters of ARIMA (that I got initially without GARCH) together with the GARCH parameters, or do I keep the same ARIMA parameters and only estimate GARCH parameters?

I have a time series that shows a nonstationary seasonal autoregressive component as well as known heteroshedasticity. In order to model the series, I have fit a seasonal ARIMA model for the mean with the auto.arima model in the forecast package in R and a GARCH model on the residuals of the ARIMA model.   Is the procedure of sequentially estimating ARIMA and GARCH model correct or would it have been better to jointly model the mean and the variance of the series? If this were correct, is there a (possibly R) function to do it?


Definition A seperable space $X$ is a topological space which contains a countable subset $A$ dense in $X$. For example, $\mathbb{R}$ is separable as $\mathbb{Q}$ is a countable subset of $\mathbb{R}$ and $\bar{\mathbb{Q}}=\mathbb{R}$. Now I need to show that a subspace of a separable space is not necessarily a separable one. I guess the subspace of all irrational numbers $I:=\mathbb{R}-\mathbb{Q}\subset \mathbb{R}$ may work it out, but I just don't know how to get a contradiction if $I$ has a countable dense subset. Also it seems vague to me what topology is appropriate for $I$, the one inherited from open intervals or 'left topology' with basis $[a,b)$, or something else...? Any help would be appreciated! Thanks!

I'm trying to find an example of a non-separable subspace of a separable space.  What kind of examples are there?


There is a global mutex used by different applications. If one application blocks this mutex then other applications will not be able to start. Given the mutex name how can I find out in C# which process is owning this mutex currently. I need to build a utility to findout this process and kill which is holding this mutex.

I have a shared mutex between 2 applications. I want to create an administration console that shows the current owner's name of the mutex.  How can I get the application name that currently owns the Mutex?


Is it correct to use either "to+infinitive" or "for+ing" in sentences like the following:     He has all the tools to become/for becoming a great actor.   I think "for +ing" sounds better in these types of sentences because we are talking about the purpose of a thing, the "tools" (the "tools" will help him become a great actor). However, I did a google search and found lots of examples with the "to+infinitive" structure, and, honestly, it doesn't sound bad either. So, is there any difference between using one or the other structure in sentences like the example? If there's no difference, could you please explain why?  By the way, I wrote "to+infinitive vs. for+ing to express purpose" as the title of this question. Would it be correct if I wrote "to+infinitive vs. for+ing for expressing purpose." If yes, why? If no, why not?

Are the following sentences grammatical or not? If not, does substituting a to-infinite make them grammatical? (Optional: designate if the sentence expresses purpose, reason, aim, or function)  1 I have decided to purchase a jet for getting to NYC and back more quickly. 2 I have decided to buy a jet for having a quicker way to get to NYC and back.  This is my only reason and aim; this will be the jet's only purpose and function.  3 I hate hairdryers, so I am buying a space heater for drying my hair more naturally, and that is my only aim & purpose & reason and that will be its only function 4 For having a lasting shine in your hair, buy ShineOn Shampoo. 5 My neighbor and I have decided to cooperate more for having a better life together.   Research done: ELL  (Note the  here is a restatement of Cambridge Dictionary's ) ELL  ELL  BBC English  (Currently the best site I've found.) ELU  All of which have answers that I find  (i) incomplete (ii) contradictory (iii) terribly confusing, if not (iv) wrong. To sort through the haze, I am focusing on one issue. Background Some sources say that you need to use a to-infinitive for expressing purpose, aim, function, reason, etc. I find these to be rather hazy distinctions, given that the ODO defines  as The reason for which something is done or created or for which something exists and the same work lists as : aim, reason, function, etc. It is my assertion that at least some of the following sentences demonstrate that one can use the -ing form (be it a gerund, verbal noun, participle) to express individual purpose (aim, reason, function, intention, whatever you want to call it). Do you agree, or not? Why (not)?  In shorter terms, are the sentences grammatical? or do we have to substitute a to-infinitive (including in order to + infinitive) to make them grammatical? (Optional: designate if the sentence expresses purpose, reason, aim, function, etc.)


Someone knows how to "unfloat" a table or figure environments. I mean, I want to put a float environment after a specified paragraph. I need some help.

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


I have one file with root ownership,   -rw-r--r--    1 root    staff  92229 Feb  6 10:51 oneFile -rw-rw----@   1 John  staff     5242880 Feb  7 00:14 anotherFile   How can I change oneFile ownership and read write permission to be the same as anotherFile?

Can you explain briefly the main concepts and command line tools used to manage file permissions?


I have been workin with time-series data. I haven't been able to find any way of analysing automatically if a given time-series has a seasonal behaviour (when I say automatically, I mean in a way I can program an algorithm to take the time-series as an input and return a True or False, instead of someone having to manually analyse the graphical representation). Does anyone have any code suggestions (preferably in Python) or references to good papers on that matter? If it is applied to big data even better, but if not anything will help.

I am having sales volume data for 100 stock-keeping units (SKUs). Is there a statistical way of identifying seasonal time series?


Is there any way that we can detect if a child Dialog is opened ?  I tried googling there  is not any good article There should be a very simple solution to this.  Can anyone tell me how to do this ?  Is there any method or property in .Net Framework that I can call to get a boolean value somehow whether there is a Modal dialog is opened over my current window ?

How, being inside the main form of my WinForm app can I tell if there are any modal windows/dialogs open that belong to the main form?


Define a subset $X$ of $\mathbb{R}^n$ to have property C if every sequence with exactly one accumulation point in $X$ converges in $X$. (Recall that $x$ is an accumulation point of a sequence $(x_n)$ if every neighborhood of $x$ contains infinitely many $x_n$.)  Show that any subset $X$ of $\mathbb{R}^n$ satisfying property C is compact.  Since $\mathbb{R}^n$ is Euclidean, compactness $\iff$ closed and bounded. To show $X$ is closed, we can take any limit point $x$ of $X$. By definition of a limit point, we can find a sequence in $X$ converging to $x$. Then $x$ is the unique accumulation point of the sequence and hence by hypothesis $x\in X$  How can I show that $X$ is bounded?  Alternatively, I could show that $X$ is sequentially compact, but I don't know how to proceed.

I found the following question about compactness:     A set $S\subseteq \mathbb{R}^n$ has the following property:   if a sequence of $S$ has exactly one accumulation point in $S$, then it converges in $S$. Prove that $S$ is compact.    We know that in $\mathbb{R}^n$ compact sets correspond to closed and bounded sets.   (1) I am trying to prove that $S$ is closed. The condition in the question says if a sequence of $S$ has an accumulation point in $S$ then it converges in $S$. I think instead the condition should be if a sequence of $S$ has an accumulation point( in $\mathbb{R}^n$, not necessarily in $S$ )then it converges in $S$.  Am I correct?  (2) How to prove that $S$ is bounded?  P.S. I have made an edit (there is exactly one accumulation point).  Source of the question:  of this problem set.


I am using 11.10 and I really want to update to 12.04 but it's impossible. I cannot see it in the update manager (I did select the option for the releases). I tried sudo update-manager d, and sudo-apt get upgrade and sudo apt-get upgrade release d but nothing. And sudo do-release-upgrade is not working as well! (I get "no release found" message.)  So finally I did put on a live USB and when I boot, I click on install, then it's telling me that I do have 11.10 and I can select for erase all and install Ubuntu 12.04 or I can install along 11.10 and the second option to update 11.10 to 12.04 is grey. I cannot selected it! Why? Am I running out of options?   What else can I do to upgrade to 12.04?

How can I safely upgrade an Ubuntu installation from one release to another? What should I do before upgrading to ensure it goes smoothly, and is there any clean-up I need to do afterwards?  In particular, do I need to do anything special if I am using packages from PPAs, if I have a graphics card that needs drivers, or if I'm running a custom Linux kernel?  This is a general question , but as example we take Ubuntu 12.04 and Ubuntu 12.10


I've been googling this, but although I see people using them, I see no explanation for it. I've also tried "find and sed" searches, but again no explanation on these. The sed man and other sed guides out there also don't include it.   Now, I'm using the find command to find several files and then using sed to replace strings whithin the files. I believe that these "{}" and "\;" at the end of the sed are what allows sed to take each file name from find and search through its text. But I'd rather not guess and know for sure what they are and why they're there. Here's my current command:  output=$(find . -type f -name '*.h' -o -name '*.C' -o -name '*.cpp' -o -name "*.cc" -exec sed -n -i "s/ARG2/ARG3/g" {} \;)   I'm also concerned that the ";" at the end may not be necessary since I'm wrapping it also and throwing it into a variable. Could someone clarify what those curlies and backslash are doing and whether I need them?  EDIT: It turns out that they're properties of find -exec, not sed. So I've been looking in the wrong place. Thanks!

With this set of commands, what are the {} and \; characters for? find . -name '*.clj' -exec grep -r resources {} \;


Running Ubuntu 14.04. I want to delay Cairo-Dock. What should be in the command in "Startup Applications". I tried it with: "sleep 10; cairo-dock" but that doesn't work. What is the proper syntax to use... FYI I want to delay Cairo-Dock because when it starts immediately it ruins the shutdown options in the top panel (seems to be a known but unsolved bug)

How to delay a program such as cairo-dock (No openGL) or Firefox?  Sometimes programs crash when started with other startup apps. I want programs to start 10 seconds late to avoid a crash.


It's quite annoying to find that you can't edit comments past five minutes, I completely understand not editing comments after 5 minutes that have a reply after them (although it's a bit weird you can delete them), but if the comment is still the last in the "thread". You can copy the comment, delete it and repost it edited. That overrides what you have on the clipboard, is annoying and gives more a chance for you comment to become out of place if someone posts, while you are copying, editing and pasting.


I want to put in this kind of code is user connected to network or not. If is connected to do this then blocks or if its NOT connected to do something other, such as get data from local storage. I'm confused how to do that.      getStorageWarents() {        this.storage.ready()         .then(() => {           this.warrentsInStorage = JSON.parse(localStorage.getItem('__mydb/_ionickv/DodNalog'));           console.log("Warrents in storage: ", this.warrentsInStorage);          })         .then(() => {           this.getAssignedWarrents();         })         .then(() => {           this.getAllGoods();         })         .then(() => {           this.getAllCancelTypes();         })         .then(() => {           this.getAllDeviceTypes();         })         .then(() => {           this.getAllManufacturers();         })         .then(() => {           this.getAllIntereventionTypes();         })     }

How to detect the Internet connection is offline in JavaScript?


I wanted to search an old post of mine that contained the word "router". So I went to the stackexchange main page and looked for "user:me router". I got many results, but none of them is a post of mine:  What am I doing wrong?

I mean the topics which I have started. That is, whole topics, not my posts only.  For example, a situation when someone answers my question some time ago, but since then I have forgotten the whole thing, but remember some words from that answer. I could spend a day walking across my posts. Also I know that I can put a filter for particular user, here user:me, but in this case I would only find my text.  The situation that arose here so I'm asking this is that I remember someone answering for a unrelated question gave me a tip of useful GCC parameters additional to -Wall. I didn't asked for it so I don't know in what topic to look for it and who was that. Now I must search all my topics for this keyword, but exclude my own writing.


I know the binomial distribution is used to calculate the probability of N heads in M coin tosses. But what if I want to calculate the number of ocurrences of particular pair of events, such as 'HH', in a random string?

I'm trying to find the probability of getting 8 trials in a row correct in a block of 25 trials, you have 8 total blocks (of 25 trials) to get 8 trials correct in a row. The probability of getting any trial correct based on guessing is 1/3, after getting 8 in a row correct the blocks will end (so getting more than 8 in a row correct is technically not possible). How would I go about finding the probability of this occurring? I've been thinking along the lines of using (1/3)^8 as the probability of getting 8 in a row correct, there are 17 possible chances to get 8 in a row in a block of 25 trials, if I multiply 17 possibilities * 8 blocks I get 136, would 1-(1-(1/3)^8)^136 give me the likelihood of getting 8 in a row correct in this situation or am I missing something fundamental here?


Suppose I'm defining a macro of some word I'm using a lot: \providecommand{\pv}{\emph{p-valor }} I already put the trailing space because most of the time it'll save from adding it manually (yes, I try to save myself from adding a space). However, sometimes I need to add a comma or something after the command, but using \pv. renders as      With a space after between the stop and the command. How do I prevent this space from appearing after the command? Note that removing it from macro definition is not an option and I'm looking for something between the command and the stop that "eats up" the trailing space.

I have a definition:  \newcommand{\arnold}{Arnold Schwarzenegger}   When I refer to it by:  \arnold is a   it is rendered as:   Arnold Schwarzeneggeris a    In order to have a space in front of "is" I would need to write  \arnold\ is a   Is there some other shorter way?


I want to do blog.mysite.com but i know it will negatively impact my PR with Google. When is it preferable to structure your site like that vs mysite.com/blog? Is it only for the benefit of PR?

If I have example.com, and blog.example.com, do search engines see those as one site or two? Will using subdomains hurt SEO? I have some technical reasons why I can't use example.com/blog.


I recently found a second-hand bike that looks interesting, but the brand is KCP, and even with a lot of search, I'm not able to find any result about it.  You can find below a picture and a link to the  mountain bike   What is "KCP"? Should I trust this supposed "brand"? Do you recommand me not to buy this and look into well-known or better known brands?

I'm a biking amateur, but I've been wanting to upgrade and get more serious.  Just recently, I was gifted a pretty new bike and I'm wanting to figure out how BSO it is so I can either upgrade it or get rid of it get a new, nicer bike.  What should I check to tell how much of this bike is cheap BSO material and how much will last?  I'd really like a part-by-part list so I can replace them or decide if it's not worth it.


Online, I have seen people with shrubs around their town tree. My tree is developed enough that I can see the town history. I also have the golden shovel, but I cannot figure out how to plant shrubs around my town tree. please help me out.

I purchased a "Y-hibiscus starter" from the tropical island's shop today.  After some research I discovered that this would grow into a new class of plants -- bushes.  Do bushes have the same growing patterns and restrictions as trees?  For example, can they be planted near structures?  Can they be planted next to each other?


This question has probably been answered and I have found part of the solution  for Postgres.  I am running version 9.1 of Postgres and this is what I am trying to do. I have a table:   col1 |   col2    | col ------------------------   1   | 1 jan 12  | Joe   1   | 1 jan 12  | Bill   1   | 1 jan 12  | Sue   2   | 2 may 13  | Bob   2   | 2 may 13  | Mary   I want:   col1 |   col2    | col3 ------------------------   1   | 1 jan 12  | Joe, Bill, Sue   2   | 2 may 13  | Bob, Mary   I am sure the solution is simple, I just have not been able to come up with it despite searching. I am guessing that array_agg is probably part of my solution.

I am looking for a way to concatenate the strings of a field within a group by query. So for example, I have a table:  ID   COMPANY_ID   EMPLOYEE 1    1            Anna 2    1            Bill 3    2            Carol 4    2            Dave   and I wanted to group by company_id to get something like:  COMPANY_ID   EMPLOYEE 1            Anna, Bill 2            Carol, Dave   There is a built-in function in mySQL to do this


For some reason faces in UV Editing are glued to each other. How do I split them from eachother?

How do I break the selected UV map from its surrounding vertices?


In CentOS and Ubuntu, how do I find out how much free disk space I have left and other disk stats like disk usage?

I'm looking for a linux alternative to . I would like to know what is taking up space on my hard drives.  A program that works on console and doesn't require a UI is preferred .


I tried all methods I heard of for setting environment variables on OS X 10.8 but none of them seems to work.  To test, run a bash script from inside a gui application like Eclipse or IntelliJ IDEA.  #!/bin/bash set|grep PATH   Things I tested and that are not working even after reboot:   /etc/paths and /etc/paths.d/something /etc/launchd.conf ~/.bash_profile ~/.MacOSX/environment.plist (binary plist made as recommended) running launchctl setenv PATH $PATH from the command line, this was supposed to update the PATH for GUI apps, at least for current session. Guess what, no change.   It seems that PATH is always PATH=/usr/bin:/bin:/usr/sbin:/sbin for GUI apps.

Apps launched via Finder seem to not respect the PATH as set in .bash_profile.  So when I try to run code from an IDE (Intellij) I no longer have access to programs in /usr/local/bin, which is normally added to my path in the Terminal.  Apparently .MacOSX/environment.plist  to do this, but it no longer works in Lion.  How can I set the PATH for Finder-launched applications?


I'm hesitant about installing X11 on a server machine because I want it to contain the absolute minimal amount of software needed.  However, some GUIs (for FFMPEG encoding, etc) are useful so I was thinking about installing X11.  What is the absolutely minimum number of packages I would need to install in order to run some simple (?) GUIs like the frontends for FFMPEG, etc.  I don't think I need a window manager or anything else, etc.

My 12.04 x64 system won't boot into GUI, but I can still use virtual console with my own account, so apparently it's the Windows Management System that's causing it, how can I reinstall it from tty, what's the apt-get command?


I'm about to go on a search for a dozen or so stock photos representing our target audience and user-base (for a high-tech, B2B SaaS product). these will be used in marketing collateral as well as emails/landing-pages and other web pages. Our brand has not historically used a lot of photography so the few times we've need photos, we've gone to ShutterStock. I started my search there and while they have a vast selection and they are fairly inexpensive, a lot of their images are a bit too generic for our tastes...  after not too long they start looking like the horrible, happy-techy-people-working-in-offices that were so horribly, horribly overused (imo) back in the late 90s/early 2000s. I'd like to step the quality up a little bit... find something a decent set resembling more of a "portrait" (with evocative qualities) than a cheap stock photo (even that's what it is). Looking quickly, both Adobe Stock and iStock seem like they're closer to the quality I'm in search of. For purposes of uniqueness and again, that evocative quality, does anyone recommend 1 over the other... or perhaps have another in their price range to suggest?

I'm always on the hunt for free stock images to use while I design, what are some good resources for images that are under a a royalty free or creative commons licence?


I've been attempting to update my machine for the past few hours and I can't seem to get it to work.  I ran:  sudo apt update && sudo apt upgrade   This found multiple packages for things like updating the linux headers etc. I let it run over night and noticed that it had not made any progress and I could not kill it using ctrl+c.  I closed out the terminal and deleted the locks and ran:  sudo apt update sudo apt-get clean sudo dpkg --configure -a   Which also hung. I deleted the locks once more, restarted my machine and now it's hanging at:  sudo apt upgrade Reading package lists... Done Building dependency tree        Reading state information... Done Calculating upgrade... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 9 not fully installed or removed. After this operation, 0 B of additional disk space will be used. Do you want to continue? [Y/n] y Setting up linux-headers-4.13.0-17-generic (4.13.0-17.20) ... Examining /etc/kernel/header_postinst.d. run-parts: executing /etc/kernel/header_postinst.d/dkms 4.13.0-17-generic /boot/vmlinuz-4.13.0-17-generic  Progress: [  0%] [..........................................................]    I'm totally stumped. How do I get it to install these packages, or where can I search for errors?

I just installed a new kernel on Ubuntu GNOME 17.04 that came in through the normal updates. However, it is now stuck for a while on the following line:  Setting up linux-headers-4.10.0-20-generic (4.10.0-20.22) ... Examining /etc/kernel/header_postinst.d. run-parts: executing /etc/kernel/header_postinst.d/dkms 4.10.0-20-generic /boot/vmlinuz-4.10.0-20-generic   Something seems to hang the process. Does someone know what could cause this?  EDIT: This is the content of /boot as requested:  abi-4.10.0-19-generic     grub                          System.map-4.10.0-19-generic abi-4.10.0-20-generic     initrd.img-4.10.0-19-generic  System.map-4.10.0-20-generic config-4.10.0-19-generic  memtest86+.bin                vmlinuz-4.10.0-19-generic config-4.10.0-20-generic  memtest86+.elf                vmlinuz-4.10.0-19-generic.efi.signed efi                       memtest86+_multiboot.bin      vmlinuz-4.10.0-20-generic   EDIT 2: Just tried purging the new kernel but got this:  E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem.   Using that command returns me to the original problem. I am stuck now :(


I have the Toshiba Satellite A100-011 and i upgrade the RAM from 2GB to 4GB but when i boot to windows i have usable only 3GB RAM and on Ubuntu have 2.9Gib RAM. The BIOS see 3143680KB of RAM. I try these fixes:  I run memtest86+ and and is not find any problem. But below of the test information is display and the 2 RAM modules with the correct size of each module. I switch the position of RAM modules, and again is not see 4GB on any OS.

I have recently upgraded a Windows 7 Home Premium PC with 12 GB of RAM. For some reason once I looked in the System tab it said only 7.96 GB of 12 GB of RAM is usable. I have already tried to go into the msconfig to see if the Maximum Memory was ticked, which it wasn't.  Is there a solution to this error? The other topics that I have viewed on Super User did not help me at all.  Installed RAM:   msconfig:   My Windows Edition is showing "Home Premium":   Resource Monitor:


This may seem to be similar to other questions asked on this site, but I feel the answers given there do not answer my query. Hence this question.  For 3-4 days now, I have been unable to ask questions on . Apparently, it is because I have asked more than 50 questions in a period of 30 days, which I don't believe to be true.   How can I work around this? I self-study mathematics, and this has destroyed my flow. StackExchange has been the best thing about my life for some time now, and I don't know what to do now that it is beyond reach.

I get a message:     Sorry, you are only allowed to ask 50 questions in a 30 day period   Why is there a question limit? 50/month is just not enough :)


I am asked this question :  Let $f(z)=a_0+a_1z+...+a_nz^n$ be a complex polynomial with complex coefficients. Prove that :  $$\frac{1}{2\pi i}\oint\limits_{|z|=r}z^{n-1}|f(z)|^2\mathrm{dz}=a_0a_n^*r^{2n}$$  I have tried pretty much everything and I am still lost. I am pretty sure that Cauchy's Theorem gets the job done but I didn't have any luck yet.

Let $f(z) = A_0 + A_1z + A_2z^2 + \ldots + A_nz^n$ be a complex polynomial of degree $n > 0$.  Show that $\frac{1}{2\pi i} \int\limits_{|z|=R} \! z^{n-1} |f(z)|^2 dz = A_0 \bar{A_n}R^{2n}$.


I'm trying to remount system on a rooted Samsung GT-S6102 running Android 2.3.6:  # mount -o rw,remount,rw /system  Usage: mount [-r] [-w] [-o options] [-t type] device directory  This is exactly like in , so I'm not sure why I'm getting this usage error.

I try desesperately to push an app with adb  on the /system/app folder (to install the PlayStore on my low cost tablet). So i tried to remount the /system partition with root rights :  mount -o remount,rw /system    But it give me everytimes the same response :   mount: Read-only filesystem   And i tried also with this command :  mount -o remount,rw -t ext4 /dev/block/actc /system   but it's the same thing... And i don't understand really why, even with the root user, i can't modify this...  So if someone have an idea, it could be save one person in distress :p


In ms-office-word shortcut-key for special characters can be applied as following:    But now I am using Libre-office Which is pre-installed with Ubuntu! and want to put shortcut-key for special characters. But there is not such option available:    It is difficult for me to write every-time with Unicode Ctrl+Uthen055thenEnter(0055 is only example for U which is not special-character).  Thus, Help me to add shortcut-key or any other method as I am leaving ms-office and working with libre-office Version: 4.2.3.3 (open-source and pre-installed with Ubuntu 14.04)

Currently I use the character palette applet in gnome panel to put special characters into text.  This is okay, but I have to stop typing, select the character I want from the applet and then copy and paste.  Is there a way to simply type special characters with different key combinations? If so, how do I do it?


I have recently found the following. I do know the first sentence is wrong.  (1) "I am not a fan of him." Meaning : I am not his fan. (2) I am not a fan of his. Meaning : I am not one of his fans.  But this is controversial. Are they correct? Some people say YES YES YES; others say NO NO NO. Please clarify it.

As  shows, we nearly always use the possessive form of personal pronouns for friend of mine/his/ours/etc.  But when it comes to actual names, we prefer  without the possessive apostrophe. That preference is even more marked with, say, . Not that I think the usage itself is particularly American - it's much the same with .  Personally, I find friend of him grates. In general I've no strong feelings either way as to whether it's friend of Peter or friend of Peter's (though I deplore the possessive in ), but in line with many others, I really don't like the possessive in relation to things like countries.  Why is this?   Edit: Noting an apparent "progression" (pronoun -> person -> nation) marked by reduction in use of the possessive, I checked at a finer "granularity". NGram shows that although it does occur,  virtually "flatlines" against friend of mine. But the bias reduces through of you, of us, and by the time I get to  it's much less extreme. There seems to be something "egocentric" about the double possessive.  Presumably when babies learn to speak, they soon notice that possessive pronouns, possessive apostrophes, and the word "of", all do the same job. Parents would correct a child who says "of mine's", but probably wouldn't even notice the same "redundancy" in "of Peter's". Younger speakers are unlikely to even be talking about something "of America's". Perhaps as we mature we tend to discard the "double possessive" for the more "distant" things that only adults are likely talk about, but we keep it for "closer" people because that's how we spoke when we were younger.  EDIT2 I note that I'm a great fan of him is vanishingly rare compared to ...fan of his, but with ...fan (of John) the double possessive occurs far less often than ...friend (of John's). Usage seems to be affected by the noun before "of" as well as the one after it. This is getting complicated...


How do I automate entering (not generate) statistics for a Pathfinder character or monster, and get some formatted text of a proper stat block that I can use in Microsoft Word or Adobe Indesign?

What procedure can I use so I can enter the statistics for a Pathfinder character or monster, and get some formatted text of a proper stat block? Either to print or to use in software like Microsoft Word or Adobe Indesign.  For example, when I wrote 3.5 adventures I used DM Genie which had a screen where I could enter all the stats. Which filled out a text box. Then I could copy and paste a proper 3.5 stat block into Word or Indesign.  This is an issue that effects several of the more popular RPGs other than Pathfinder. So a good answer would benefit many who struggle to write and share material for these games as the writing of detailed stat blocks is labor intensive.


I have an issue of installing Docker on ubuntu 18.04   When I try the following lines I get an https error due to there being no http version and we are behind a company proxy so it fails.  sudo add-apt-repository "deb [arch=amd64] https://download.docker.com/linux/ubuntu bionic stable"  sudo apt update   Fails with.  Certificate verification failed: The certificate is NOT trusted. The certificate issuer is unknown.  Could not handshake: Error in the certificate verification.   Is there an alternative way to install even for a one of version using curl or wget?  Is there a way of bypassing a proxy in the apt conf to tell it to ignore the certificate error?  Edit  I tried with the [trusted=yes] flag but this didn't work I think because this reverts to http and there is no http URL.  Err:6 https://download.docker.com/linux/ubuntu bionic Release                                         Certificate verification failed: The certificate is NOT trusted. The certificate issuer is unknown.  Could not handshake: Error in the certificate verification. E: The repository 'https://download.docker.com/linux/ubuntu bionic Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.

Running sudo apt-get update on my AWS EC2 Ubuntu 18.04.01 LTS instance fails because my Certificate verification failed: The certificate is NOT trusted. The certificate issuer is unknown when trying to access the deb.nodesource.com/node_10.x bionic Release  Here is the result after running sudo apt-get update  Hit:1 http://us-east-1.ec2.archive.ubuntu.com/ubuntu bionic InRelease Get:2 http://us-east-1.ec2.archive.ubuntu.com/ubuntu bionic-updates InRelease [88.7 kB] Ign:3 https://deb.nodesource.com/node_10.x bionic InRelease Get:4 http://us-east-1.ec2.archive.ubuntu.com/ubuntu bionic-backports InRelease [74.6 kB] Err:5 https://deb.nodesource.com/node_10.x bionic Release   Certificate verification failed: The certificate is NOT trusted. The certificate issuer is unknown.  Could not handshake: Error in the certificate verification. [IP: XX.XXX.XX.XX 443] Get:6 http://security.ubuntu.com/ubuntu bionic-security InRelease [83.2 kB] Reading package lists... Done W: https://deb.nodesource.com/node_10.x/dists/bionic/InRelease: No system certificates available. Try installing ca-certificates. W: https://deb.nodesource.com/node_10.x/dists/bionic/Release: No system certificates available. Try installing ca-certificates. E: The repository 'https://deb.nodesource.com/node_10.x bionic Release' no longer has a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   It seems like my current installation of Node.js is causing the problem.   I've tried installing and updating ca-certificates in etc/ssl/certs, however, this did not help. I'm not exactly sure how to proceed from here to resolve this issue.  I'm not looking for a quick workaround that would compromise the security of the server.   Thanks in advance!


Is there a site or way to output all of the permutations of a regex pattern?  I made a simple pattern here with desired output from this 'app':    or see below:  (?<TERM>(Big |Small )(Brown |Green |Red )(Ball|Box))    Big Brown Ball Big Green Ball Big Red Ball Small Brown Ball Small Green Ball Small Red Ball Big Brown Box Big Green Box Big Red Box Small Brown Box Small Green Box Small Red Box

I am writing a Java utility which helps me to generate loads of data for performance testing.  It would be really cool to be able to specify a regex for Strings so that my generator spits out things which match this.  Is there something out there already baked which I can use to do this?  Or is there a library which gets me most of the way there?  Thanks


I have looked up the pronunciation of these two words, ancient and conscience, in the Oxford Advanced Learner’s Dictionary as well as other online dictionaries such as dictionary.com and dictionary.cambridge.org. Their pronunciations are given as /ˈeɪnʃənt/ and /ˈkɒnʃəns/. However, I have heard a lot of American people pronounce them as /ˈeɪntʃənt/ and /ˈkɒntʃəns/, meaning they pronounce the starting sound of the second syllable as /tʃ/ instead of /ʃ/. Is this considered a mispronunciation by some people or is it actually a correct pronunciation in American English?

Ok, see the word "conscious" has the IPA /ˈkɑːnʃəs/ in the   However, when you listen clearly, you will feel like it should be /ˈkɑːntʃəs/ not /ˈkɑːnʃəs/.  So it should read /tʃ/ rather than /ʃ/.  In some other dictionaries, which use different transcription systems, they give the entry "ˈkän(t)-shəs" , for example in the . Here we see it with a /t/.  So, should the IPA for the word "conscious" be /ˈkɑːnʃəs/ or /ˈkɑːntʃəs/?


since $( b|c)$, $c = xb$ So, $\gcd(a,b) = \gcd(a + xb, b)$ Euclidean algorithm shows shows that for $a=bq + r$, $\gcd(a,b) = \gcd(b,r)$ This is where im stuck, I've approached this quesiton so many ways but can't figure out how to apply the algorithm for the proof.

Given: $a = qb + r$. Then it holds that $\gcd(a,b)=\gcd(b,r)$. That doesn't sound logical to me. Why is this so?    Addendum by LePressentiment on 11/29/2013: (in the interest of  and averting a duplicate)  What's the intuition behind this result? I only recognise the proof and examples solely due to algebraic properties and formal definitions; I'd like to apprehend the result naturally.


I am trying to create a 2d array of hashmaps. I do this with the following code:     @SuppressWarnings("unchecked")     Map<String, Boolean>[][] arrayBlock3 = (Map <String, Boolean>[][]) new Map[6][6];   When I try to add elements to the array however, at runtime there is a null pointer exception at the first line adding an element to the array.  The code to add an element is:      arrayBlock3[0][0].put("B", false);     arrayBlock3[0][1].put("G", false);     arrayBlock3[0][2].put("B", false);     arrayBlock3[0][3].put("B", false);     arrayBlock3[0][4].put("G", false);     arrayBlock3[0][5].put("B", false);    Error Message  Exception in thread "main" java.lang.NullPointerException at main.main(main.java:20)   I would really appreciate your help, thanks.

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


I often use the \lstinputlisting command from the  package to import whole or portions of standalone <codingLanguage> code files into my documents.  Problem  When I want to insert an except from the whole <codingLanguage> script, I use:  \lstinputlisting[caption     = {Caption},                   label       = COD:script,                   firstline   = 7740,                   firstnumber = 7740,                   lastline    = 7766                 ]                 {\main/Scripts/script.m}   in which case, I am specifying by line number.  The problem is that edits to that code shift the line numbers, making the document latex code obsolete and requiring manual fixing.  I read through the listings package manual, but did not find anything. I admit that I may have read the answer and not known it was the answer.  Desired Resolution:  How can I start and stop excepts with less volatile parameters?  I would much prefer to place some form of marker in the <codingLanguage> code for which the latex code \lstinputlistings could search, (and I'd need to be able to have multiple unique markers).

Is there a way to input particular sections of source code using \lstinputlisting (from the listings package) in a flexible way?  It's possible to use the firstline and lastline options to input particular line ranges, but this isn't robust to changes to the source file.  For example, suppose that the input source file is:  int square(int x) {   return x * x; }  int cube(int x) {   return x * x * x; }   In my LaTeX document, I can include the cube procedure using the command \lstinputlisting[firstline=5,lastline=7]{source.c}.  But suppose I later decide to rewrite the cube procedure.  The input source file becomes:  int square(int x) {   return x * x; }  int cube(int x) {   int x2;   x2 = square(x);   return x * x2; }   Now my LaTeX document will not show the final two lines of cube because the listing uses only lines 5-7.  I could manually update the line range, but this is tedious and error-prone.  Is there a way to mark sections of source code with some kind of label so that the listing will be robust to these sorts of changes?  For instance, perhaps the input source file would be something like  int square(int x) {   return x * x; }  /**\beginlabel{lst:cube} **/ int cube(int x) {   int x2;   x2 = square(x);   return x * x2; } /**\endlabel{lst:cube} **/   so that I could use something like \lstinputlisting[lines=lst:cube]{source.c} to include the section that I want and remain robust to changes.  I am open to using other packages for source code listings (e.g., minted) if helpful.


If $\alpha$ and $\beta$ are solutions $a\tan\theta+ b\sec\theta = c$   then show that:       $\tan(\alpha+\beta)= \dfrac{2ac}{a^2-c^2}$   This is the first time I am attempting such a question so I am confused. Nevertheless, I gave it a try:  $\dfrac{a\sin\theta}{\cos\theta}+\dfrac{b}{\cos\theta}=c $  $\implies a\sin\theta -c\cos\theta= -b$  Now,  $-\sqrt{a^2+c^2}\le a\sin\theta -c\cos\theta\le\sqrt{a^2+c^2}$  or,  $-\sqrt{a^2+c^2}\le -b\le\sqrt{a^2+c^2}$  I don't know how to proceed from here. Also, is this a valid approach to the question?

If $\alpha$ and $\beta$ are the solution of $$a \cdot \tan\theta + b \cdot \sec\theta = c$$, then show that $$ \tan(\alpha + \beta) = \frac{2ac}{a^2 - c^2}$$  I did the following:     $$a \cdot \tan\theta + b \cdot \sec\theta = c$$       Squaring both sides,  $$a^2 \cdot \tan^2\theta + b^2 \cdot \sec \theta + 2 \cdot a \cdot b \cdot \tan \theta \cdot \sec \theta = c^2$$      This implies $$(a^2 + b^2) \cdot \sin^2 \theta + 2 \cdot a \cdot b \cdot \sin \theta + (b^2 - c^2) = 0$$       Hence I get $$\sin \alpha + \sin \beta = \frac{-2ab}{a^2 + c^2}$$ and $$\sin \alpha \cdot \sin \beta = \frac{b^2 - c^2}{a^2 - c^2}$$   But I am not able to solve it further.


I recently went away on a trip without my computer. I had a 51 day streak on Spanish Stack Exchange, about half way to my first gold badge.  Realizing that the streak would go away without a login, I downloaded the app, signed in to my account, went on Spanish Stack Exchange and voted a couple of answers up and down to keep the streak going.  When I returned home to my computer, I found out that the streak was gone. I researched this but only found a similar question about the Android app. Is there a way to fix this for the iOS app?

This isn't directly related to the app, but probably more on the APIs it's using. The last seen on the profile page doesn't seem to reflect that I'm actively using the Android app, or taking actions. I was able to vote on items and the last seen property on the profile page said I was last seen 50 minutes ago, when I was using a computer.  I'm assuming it won't count as a visit for the Enthusiast and Fantic badges either. I don't want someone angrily posting on Meta swearing they used the app for a day, yet they lost the consecutive days and has to prove it by showing they voted for something (we're probably far from this situation since it's alpha...)


My code  import math import itertools  with open('/home/milenko/OCCAM2DMT_V3.0/13042/ITER04.iter') as f:     lines_after_19 = f.readlines()[19:]     p = []     for line in lines_after_19:         line = line.split()                  line = [float(i) for i in line]         p.extend(line)      a1=p[1:81] for i in a1:     b1=math.pow(10, i)    a2=p[83:163] for i in a2:     b2=math.pow(10,i) a3=p[165:245]    for i in a3:     b3=math.pow(10,i) a4=p[247:327] for i in a4:     b4=math.pow(10,i) a5=p[329:409]  for i in a5:     b5=math.pow(10,i) a6=p[411:491] for i in a6:     b6=math.pow(10,i)  c = itertools.chain(b1, b2, b3, b4, b5, b6)  print type(c)   I need to convert c to numpy array,for reshape and then further calculations.

How can I build a numpy array out of a generator object?  Let me illustrate the problem:  >>> import numpy >>> def gimme(): ...   for x in xrange(10): ...     yield x ... >>> gimme() <generator object at 0x28a1758> >>> list(gimme()) [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] >>> numpy.array(xrange(10)) array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) >>> numpy.array(gimme()) array(<generator object at 0x28a1758>, dtype=object) >>> numpy.array(list(gimme())) array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])   In this instance, gimme() is the generator whose output I'd like to turn into an array. However, the array constructor does not iterate over the generator, it simply stores the generator itself. The behaviour I desire is that from numpy.array(list(gimme())), but I don't want to pay the memory overhead of having the intermediate list and the final array in memory at the same time. Is there a more space-efficient way?


I was hoping someone could review my proof, thanks!   Question: For any integer $a$, $a$$^{37}$ $\equiv$ $a$ (mod 1729)   Proof:   Note first that 1729 = 7 * 13 * 19.   Then we have $a$$^{37}$ $\equiv$ $a$ mod 1729 if and only if the following set of equations all hold true for $a$:   $a$$^{37}$ $\equiv$ $a$ mod 7   $a$$^{37}$ $\equiv$ $a$ mod 13   $a$$^{37}$ $\equiv$ $a$ mod 19   For a proof of the reverse direction of the above if and only if statement, consider that if $a$ satisfies all 3 equations, then since all 3 numbers are relatively prime we have $a$$^{37}$ $\equiv$ $a$ mod lcm(7,13,19) = 1729.   Hence note that by Eulers Theorem we have a$^{\phi(7)}$ = a$^6$ $\equiv$ 1 mod 7, which implies a$^{37}$ $\equiv$ $a$ mod 7, for all $a$ such that gcd($a$,7) = 1. Similarly we have $a$$^{37}$ $\equiv$ $a$ mod 13 and $a$$^{37}$ $\equiv$ $a$ mod 19. Hence when $a$ satisfies the condition gcd($a$,7) = gcd($a$,13) = gcd($a$,19) = 1, then $a$$^{37}$ holds.   Suppose $a$ is divisible by either 7, 13, or 19. Then WLOG suppose $a$ $\equiv$ 0 mod 7. a$^{37}$ $\equiv$ $a$ mod 1729 if and only if the above 3 equations hold. The first equation holds as 0$^{37}$ $\equiv$ 0 mod 7. The other 2 equations also hold as gcd(7,13) = 1 and gcd(7,19) = 1, so Euler's Theorem still applies in those cases. Hence the original claim holds for all a $\in$ $\mathbb{Z}$.

I'm asked to show that $a^{61} \equiv a\pmod{1001}$ for every $a \in \mathbb{N}$. I've tried to tackle this using Fermat's Little Theorem and Euler's Theorem, but I can't even get started. My main problem seems to be the "for every $a \in \mathbb{N}$" part, because if it restricted $\gcd(a, 1001) = 1$ I would be able to factor out 1001 and try to show that it's factors divide $a^{61} - a$. I'm kinda lost here. Any help is appreciated.


As far as I understand,  function sum(x,y){    return x+y; }   and  var sum = function(x,y){    return x+y; };   ...are equivalent with the exception of function declaration hoisting in that:  alert(sum(20,30));   at the top of the script will run in the former case (function declaration) and cause an error in the latter (function expression).  Would it be logical to make a conclusion that it's better to always use function declaration? Or am I missing something? To me it seems that it might be useful if you can use your functions first and then define what they should do.

I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent.  The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not.  The two ways are:  var functionOne = function() {     // Some code };     function functionTwo() {     // Some code }   What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other?


Is the Russell paradox the only possible contradiction to the axiom schema of comprehension due to Frege (1893)? The axiom that says that if $\varphi$ is a property, then there exists a set  $Y = \{X: \varphi(X)\}$ of all elements having property $\varphi$.  If not then what are other paradoxes that result from that axiom?

As is well known, the General Set Comprehension Principle (any class is a set) leads to the Russell Paradox (the class $x \notin x$ cannot be a set). As a result, set theories must restrict the Comprehension Principle to avoid self-reference. For example, in the case of ZFC, this is done by enumerating a small list of "safe" comprehension schema such as Separation.  Does General Comprehension lead to other types of paradox than Russell's? Or is this basically the only thing that can go wrong?


Say I have 8 equations all of different length including equations that are 3 lines long on an A4 paper. When I type them on Latex, I can separate the long sentence by using "$$$$" to break it and it then continues on the line below. What disturbs me though is that the calculations do not look neat. They look like:  (x+y)+(x+z)+(f+p)+e^s+ ....+p^y=0  l+p+i+....-(i+d)^y+(fg+1)^7....+   \hspace{2cm}6+0+9-(io+8)^7+(54)^i+xvy+....+p^s+kope^x =0    where {what I wrote} is any algebraic data you would like to insert and the \hspace is what my latex is giving me without me intending to put that space. How to make those looks neater. To start from the same point and each broken line to start directly under the line before it without me going and studying where to put the "$$$$" and breaking it so as it looks neat and then it turns out that it does not and so on and so forth... Maybe if you have another idea for how to structure those in a nicer way than the one I asked about, I would be thankful.

So as I have learned from a previous post that the  \begin{aligned}... \end{aligned} with the usage of "&" before "=" will help arrange neatly the equations where the equal sign of each equation will be just below the equal sign of the following equation and so on.  My question is if I have a total of 8 equations, how to number each equation and at the same time preserve the alignment of the equal signs.  Note if I use \begin{equation}... \end{equation}, I get only one number for the collection of 8 equations at the very end which is not what I want.


I have a code: keys = {'a','e','i','o','u'} value = [1] vowels = { key : list(value) for key in keys } print(vowels) value.append(2) print(vowels)  The result of this code: {'a':[1],'e':[1],'i':[1],'o':[1],'u':[1]} {'a':[1],'e':[1],'i':[1],'o':[1],'u':[1]}   The following code: keys = {'a','e','i','o','u'} value = [1] vowels = { key : value for key in keys } print(vowels) value.append(2) print(vowels)  gives me another result: {'a':[1],'e':[1],'i':[1],'o':[1],'u':[1]} {'a':[1,2],'e':[1,2],'i':[1,2],'o':[1,2],'u':[1,2]}  Why it happens if value and list(value) are both give the same list object?

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


I do not have any drives, so I have to do without anything. What should I do?

As you can guess, I am trying to dual boot Ubuntu and Kali.  But the thing is that i don't have a spare ubuntu iso(which would allow me to live boot ubuntu and then create a partition using g parted or any other app since my hd remains unmounted). So, it would be very awesome if anyone could provide me a way to create a new partition without unmounting it.. TIA


Reading  comment makes me ask what does that actually mean that     In fact, if you are close enough to $c$, the mass-equivalent of your kinetic energy may be enough to make you appear as a black hole to an external observer   ? Does it mean that any object travelling at a near the speed of light will act as a black hole even if its mass isn't contained within the necessary Schwartzschild Radius? If yes, then what would cause the regular properties of the black hole (such as event horizon as point of no return etc) to appear just because the object is moving fast?  Or what does "appear as a black hole" mean in this case?

I'm a big fan of the podcast Astronomy Cast and a while back I was listening to a Q&A episode they did. A listener sent in a question that I found fascinating and have been wondering about ever since.   From the show :      Arunus Gidgowdusk from Lithuania asks: "If you took a one kilogram mass and accelerated it close to the speed of light would it form into a black hole? Would it stay a black hole if you then decreased the speed?"   Dr. Gay, an astrophysicist and one of the hosts, explained that she'd asked a number of her colleagues and that none of them could provide a satisfactory answer. I asked her more recently on Facebook if anyone had come forward with one and she said they had not.  So I thought maybe this would be a good place to ask.


I have a Samsung SSD 750 Evo 250 GB but not all disk managers are showing the same capacity, even between partitions already created.    I don't know if is need it but I have:  Intel i3-6100  8 GB RAM   Radeon RX 460

I created an ext4 partition to back-up my files to, and partitioned it for 102GB in Gparted using a live USB. After I booted into Ubuntu, I opened Disk Utility, and it said that the partition was actually 108GB. Confused, I opened the mounted partition in Nautilus, and it said the partition was only 98GB.  Which is correct? Did I partition it wrong?


I just encountered this sentence in a passage, which begins with an adverb and adjective.     Probably blind from birth, he was born into a noble family...   'Probably blind from birth' - What kind of phrase is this?

What kind of clause or phrase is used in the first part of the following sentence (Frail and seemingly disoriented at times)? Would you elaborate on its structure.     Frail and seemingly disoriented at times, he is looking vulnerable.


There are  and  similar Phys.SE questions, but I didn't find what I'm looking for, nor was the person's question specific enough. How did  figure out $$F=GMm/ r^2~?$$ What was his reasoning? What evidence led him to think this?

This question is puzzling me since I learnt about the gravitation law in school. Why did Newton guess/assume that gravitational force is inversely proportional to the square of distance?  Did he verify that experimentally? (I remember hearing that the first experimental verification of the law of gravitation was after Newton's death.)  If the answer to the above question is no, is it for example more plausible to suppose that $F\propto1/r^2$ than to suppose that $F\propto1/r^4$? Did Newton carry out a thought experiment that makes $F\propto1/r^2$ a plausible guess?  So in summary: Why did Newton choose exponent of $-2$ instead of any other exponent? Was it a guess that depended on pure luck or an educated guess?


I have  but I couldn't understand the answer there.  According to Hubble's Law, the farther a galaxy is, the farther it is moving away. But do we take into account the fact that we are actually looking in the past? For example, there are two galaxies A and B at distance of 5 and 10 billion light years respectively. Now, when we observe A we are looking at how it was moving 5 billion years ago. The same applies for B. So, now we conclude that 5 billion years ago space was expanding at a slower rate while it was expanding comparatively faster 10 billion years ago. What's wrong with this conclusion?

Folks, I have a naive question regarding the subject of dark energy and an accelerating universe:  From what I understand/read, it seems that the further we look out into deep space, the faster the objects are moving away from us - in all directions.   Is this basically what is meant by "accelerating universe"?  Because it seems that this situation is exactly what we should expect to see (according to Big Bang theory). The further out we peer into space, the further back in time we are "seeing", so wouldn't we expect to see higher rates of acceleration/expansion the further back in time we peer?


Keep in mind that this question is not asking for merely a time limiter! Please read the full question and see that I also want to limit application and internet access. The solution doesn't have to be one single application, but it does have to be automatic enough that a technically illiterate person wouldn't have to fiddle with it.        Migrated to  as requested     I'm completely aghast at the lack of parental controls in Tahr, and how even  are so out-of-date that some are impossible now.   I need something that will:   Allow general computer time to be limited Allow application access to be limited (searching, installing, and running) Allow internet browsing time to be limited (might also cover most of the above point) Allow sites to be blocked without manually maintaining a list Allow specific sites to be whitelisted NOT set up or connect to a proxy or alternative DNS, as we're with Comcast and they're very keen to drop service at the slightest hint of alternative internet usage   I can't use something like:   Timekpr, Timoutd, or Nanny, as they're no longer available or supported OpenDNS as I don't know how Comcast will treat that. Even if they don't mind at first, their actions going forward seem to show they won't be kind to it sometime soon. Scrubit because our modem/router is rented from Comcast.

Access to our computer (not only to the internet) needs to be restricted for the accounts of my kids (7, 8) until they are old enough to manage this by themselves. Until then we need to be able to define the following:   the hours of the day when computing is o.k. (e.g. 5 - 9 pm) the days of the week when computing is not o.k. (e.g. mondays to fridays) the amount of time allowed per day (e.g. 2 hours)   In 11.10 all of the following that used to do the job don't work any more:   : for > 11.10 no more available through the ppa. : command line alternative, but from 11.10 removed from the repositories. : Looks great but repeatedly crashes to force restarting X-server. So we can't use or recommed this program at the moment.   Are there any other alternatives?


I am trying to install sshd on my Ubuntu system but I am unable to do so. I tried below things.  sudo apt-get install openssh but I received below error.   When I am checking with which command for ssh, I am getting result for ssh but not for sshd.  While checking for status of ssh, I am getting an error of unrecognized service.   Please help me to overcome this as I am new to Ubuntu and I need both ssh and sshd to be available in my system.

The computer gave me this output in a window:  E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_natty_main_binary-i386_Packages E: The package lists or status file could not be parsed or opened.   How can I fix this?


I've been developing a make target that uses dd (actually dcfldd) to write a Raspbian Jessie image to an SD card. The target is just   flash:     sudo dcfldd bs=4M if=$(IMGPATH) of=$(SDX)     sync   where $(SDX) is /dev/sdc. See  for a couple more details.  At one point, I removed the SD card from the USB card reader, tested it in the Raspberry Pi, and made some notes for changes to the script. However, I forgot to take it out the RPi and put it back into the reader (which was still in the USB socket) before calling the make target again. Bizarrely, no errors were thrown; but the ~4GB of data was "written" in seconds.  After this, putting the card in properly and calling the target again resulted in the same super-fast "copy", but the card did not appear to be altered.  I tried reformatting the card multiple times with the "Disks" tool in Ubuntu and with gparted, but the only way to get it flashing properly again was to reboot the machine. Of course, I also tried removing and reinserting the reader from the USB socket.  With the reader inserted, but with no card, I see only /dev/sdc. With the card also inserted, I see /dev/sdc, /dev/sdc1, and /dev/sdc2 (with the Raspbian image on the card).  I'm wondering   Where was dd putting the data it thought it was writing? Was there some way I could reset the card reader without rebooting?

I have a USB where I'm coping an ISO of 5 Mb aprox with a small OS with its own grub. If I connect the device and check it sudo fdisk -l I get:  ... Device     Boot Start   End Sectors  Size Id Type /dev/sdb1  *        1  9551    9551  4.7M cd unknown   If I copy with dd the ISO sudo dd if=my_os.iso of=/dev/sdb   14852+0 records in 14852+0 records out 7604224 bytes (7.6 MB) copied, 0.538487 s, 14.1 MB/s   It works perfectly. An boot from BIOS in other PC.  The problem is, sometime I forget to connect the USB after update the BIOS, so I do ff WITHOUT the USB connected,  the output is:  14852+0 records in 14852+0 records out 7604224 bytes (7.6 MB) copied, 0.00987684 s, 770 MB/s   Now, the /dev/sdb register is corrupted, the copy speed (770 MB/s) have no sense, and cannot user again dd until reboot.  I have tried to repair it with ddrescue and it doesn't work  sudo ddrescue /dev/zero /dev/sdb conv=noerror,sync   My question is, what is happening exactly and if is possible, how to repair /dev/sdb to avoid reboot and dd start working again?  Thanks.


Assuming an anatomical figure from a popular anatomy book is drawn completely from scratch, and I have the PSD file to prove it, would it still be considered copyright infringement, even though it's of the human body? I mean the muscles, arteries etc, are the same for almost everyone.

I can't quite figure this one out. I am not copying a custom piece of work, I am copying something that is available in nature, bones. I am also not tracing it, I am drawing by hand using them as a reference for accuracy. So, is that considered copyright infringement? Does it depend on how similar my drawings are to the ones I visually copied?  So if I look at a medical website or book and see a knee bone, then I draw one on paper or in a graphics editing tool by looking, with my eyes, at the referenced image, is that going to get me in trouble somehow?  I mean, surely I don't have to go find my own skeleton to draw from... right??


Let $E/F$ be a field extension and let $A, B$ be $n\times n$ matrices over $F$. Assume that $A, B$ are similar over $E$, i.e. there exists $P\in \mathrm{GL}_{n}(E)$ s.t. $B = PAP^{-1}$. Are $A, B$ also similar over $F$, i.e. can we find $Q\in \mathrm{GL}_{n}(F)$ s.t $B = QAQ^{-1}$?  This statement is true when $E=\mathbb{C}$ and $F = \mathbb{Q}$. More generally, the statement is true for characteristic 0 fields, and the proof can be found in . However, the proof doesn't work for the char $p$ case, since there exists nonzero polynomials over a characteristic $p$ field (for example, over $\mathbb{F}_{p}$) which became zero for any evaluation. (For example, $f(x) = x^{p}-x\in \mathbb{F}_{p}[x]$ is a nonzero polynomial, but $f(a)=0$ for any $a\in \mathbb{F}_{p}$.) So I want to know whether the theorem is also true for characteristic $p$ case of there's a counterexample. Thanks in advance.

Given a field $F$ and a subfield $K$ of $F$. Let $A$, $B$ be $n\times n$ matrices such that all the entries of $A$ and $B$ are in $K$. Is it true that if $A$ is similar to $B$ in $F^{n\times n}$ then they are similar in $K^{n\times n}$?   Any help ... thanks!


I was looking at the Top Users page on  and I saw that it showed that in the past 30 days I had answered two questions for a total score of 3:  This seemed odd, as I had recently answered a question in this tag that has a score of +7 (i.e. more than the total of all my answers in the past 30 days according to the listing). At first I thought that it might not be counting my most recent answer (i.e. the system might only update every so often and it had not updated since my last answer), and indeed in  it is claimed that it gets updated at midnight UTC. However, if you don't count my most recent answer then I have only one answer within the last 30 days. As you can see in my profile, my previous answer in this tag (prior to the one that is definitely being counted) was back in August, which is well more than 30 days ago:  The Top Users listing must necessarily then be counting my most recent answer, and it is counting it as having a score of +1. I then thought that perhaps if it updated at midnight then it might have only had +1 at midnight with the other upvotes coming on the next day. However, the timeline of the answer shows that all the upvotes came on the same (Stack Exchange) day:  In fact, if you look at the timestamp of the answer you can see that it was posted less than two hours after midnight. I am almost 100% certain that more than one of the upvotes came within the first 22 hours. It is also worth noting that it seems to be only the "Last 30 Days" column that has this issue; the "All Time" column lists my score as 292, which seems to be up to date as that is what it shows in the tag page of my profile:  So, is there a bug in the calculation of score for Top Users? Or is there some other calculation of the updates that explains how it would have been updated when there was only one upvote on the answer?

I'm kind of wondering… why can't there be cached tag scores updated live (e.g. when one of my answers is upvoted), like there are for reputation? I'm not saying that there shouldn't be the script running nightly, but it would be nice to see my scores go up immediately when my posts are upvoted, as opposed to the excruciating wait for 4AM UTC.


Why is it "teen" instead of ten? Where did the word "teen" originate? When you say "sixteen" you are obviously saying six and ten. How did it become six and teen? I already saw the post on "Why do eleven and twelve get unique words."

In short, why is it not oneteen and twoteen, and we start at thirteen in English?  In another thread, I supposed that despite that fact that people have ten fingers, amounts of items leading up to and including twelve were more common because twelve is more easily divisible evenly by two, three, four, and six. Both English and German (which are related) switch to a -teen (-zehn auf Deutsch) ending after twelve. Based on that thread, so does Norwegian. Could this be the explanation?  Looking at other languages (Arabic, Japanese, even a related romance language of French), this doesn't seem to apply, and you'd think that if something so fundamental as divisibility were the explanation, we'd see a more universal distribution across them.


I wanted to use the parallel hint that would give the best performance in my query which is a equi-join query where the two tables are in a cluster and the join column is a cluster index. I wasn't sure if I should use the parallel option on one of the tables PARALLEL(table1, 4), both of the tables PARALLEL(4) or on the clusters index PARALLEL_INDEX(index_name, 4)? Here was my query:  SELECT /*+ USE_HASH(a, b)  */ a.NAME     ,b.price     , FROM Customer a     ,Sales b WHERE b.Cust_id < 2000     AND b.Cust_id = a.Cust_id;   Here is the execution plan for this query:

I'm trying out oracles parallel option on a cluster and surprisingly I am getting worse results with the parallel option. I was expecting some improvement with the parallel option but certainly not worse results. I am wondering why this is the case, and if there is anything wrong with the way I am using the parallel option on my cluster.   I am using a degree of 4 when the number of CPU's I have is 8. I have tried adding parallel to the cluster directly ALTER CLUSTER cluster PARALLEL 4 as well as at the statement on both the index /*+ PARALLEL_INDEX(clust_index, 4) */and tables /*+ PARALLEL(4) */,   Here is my trace from the parallel:    Without parallel:


So Googling shows up this link on travis, which seems to have happen only recently:    Therefore I suspect that the key somehow got changed again?  ==========  Background: I'm trying to change my docker file to include a new R package dependency, the base image is Ubuntu Bionic, and was hit by this error:  W: GPG error: https://packagecloud.io/github/git-lfs/ubuntu bionic InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 6B05F25D762E3157 E: The repository 'https://packagecloud.io/github/git-lfs/ubuntu bionic InRelease' is not signed.   And the lines in my Dockerfile that raised the error is the following:  RUN DEBIAN_FRONTEND=noninteractive \     apt-get update && apt-get full-upgrade -y && \     apt-get install -qqy --no-install-recommends \         libcurl4-openssl-dev libssl-dev libxml2-dev && \     apt-get autoremove --purge -y && apt-get autoclean -y && \     rm -rf /var/cache/apt/* /var/lib/apt/lists/* /var/tmp/* /tmp/* /usr/share/man/?? /usr/share/man/??_* ENV APT_KEY_DONT_WARN_ON_DANGEROUS_USAGE=DO_NOT_WARN RUN apt-key adv --keyserver keyserver.ubuntu.com --recv-keys E298A3A825C0D65DFD57CBB651716619E084DAB9 && \     add-apt-repository 'deb https://cloud.r-project.org/bin/linux/ubuntu bionic-cran35/' && \     DEBIAN_FRONTEND=noninteractive apt-get update && apt-get full-upgrade -y && \     DEBIAN_FRONTEND=noninteractive apt-get install -qqy --no-install-recommends \         r-base   And the key is E298A3A825C0D65DFD57CBB651716619E084DAB9  Anyone know if the key is somehow changed, or something else that I wasn't understanding?  Thank you very much!  UPDATE  After adding the suggested missing public key, the issue is solved. So here are the updated lines to fix the issue (note the extra key):  RUN DEBIAN_FRONTEND=noninteractive \     apt-get update && apt-get full-upgrade -y && \     apt-get install -qqy --no-install-recommends \         libcurl4-openssl-dev libssl-dev libxml2-dev && \     apt-get autoremove --purge -y && apt-get autoclean -y && \     rm -rf /var/cache/apt/* /var/lib/apt/lists/* /var/tmp/* /tmp/* /usr/share/man/?? /usr/share/man/??_* ENV APT_KEY_DONT_WARN_ON_DANGEROUS_USAGE=DO_NOT_WARN RUN apt-key adv --keyserver keyserver.ubuntu.com --recv-keys E298A3A825C0D65DFD57CBB651716619E084DAB9 6B05F25D762E3157 && \     add-apt-repository 'deb https://cloud.r-project.org/bin/linux/ubuntu bionic-cran35/' && \     DEBIAN_FRONTEND=noninteractive apt-get update && apt-get full-upgrade -y && \     DEBIAN_FRONTEND=noninteractive apt-get install -qqy --no-install-recommends \         r-base

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


I am using Windows 7 Ultimate (32 bit). I downloaded Ubuntu 14 LTS through torrent. But the installation does not go through. I get the error "Can not download the metalink and therefore the ISO". I have tried this 3 times, and each times I get same error.  Kindly suggest me an installation method that does not require internet connection or solve this problem.

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


I've been tasked with writing a function called "getAllWords".  Given a sentence, "getAllWords" returns an array containing every word in the sentence.   Notes: * If given an empty string, it should return an empty array.    What I've come up with is:  function getAllWords(str) {   var array = [];   for (var i = 0; i < str.length; i++) {      array.push(str[i]);    }    return array;    }     getAllWords('Radagast the Brown');   What I get is:    [ 'R','a','d','a','g','a','s','t',' ','t','h','e',' ','B','r','o','w','n']   but what I'm trying for is:      ['Radagast', 'the', 'Brown']

I have this string  'john smith~123 Street~Apt 4~New York~NY~12345'   Using JavaScript, what is the fastest way to parse this into  var name = "john smith"; var street= "123 Street"; //etc...


This question appeared in KVPY online exam held on Nov 5. This equation is the equation of a hyperbola so any solution must be of the form $a\sec(k),a\tan(k)$. So no solutions.

Prove that the equation $x^2 − y^2 = 2002$ has no integer solution.   If I had the equation $x^3 - 7y = 3$ I would easily conclude that for it to have any integer solution then $$x^2\equiv3\pmod 7$$ must be true.  Applying the same logic here, I know that $x² = y^2 +2002$ so I can conclude that for it to have any integer solution then $$x^2\equiv2002\pmod y$$ must be true.  Is this conclusion correct?  From that congruence I can prove that the equation hasn't any integer solution without much trouble but I am not sure if that congruence is valid.


I tried watching Netflix in Ubuntu, but browsers are not supported. It asks for IE. Is there any solution?

Is there a way to stream Netflix content to my Ubuntu machine?


It is well known that the iteration scheme   $$ x_{n+1} = \frac{1}{2} (x_n + \frac{2}{x_n })$$   converges to $\sqrt{2}$ very fast. More precisely, it converges quadratically. The problem is, is there any even faster algorithm? Namely, can we find another polynomial $P(x, 1/x)$ of $x$ and $1/x$ with rational coefficients, such that the iteration scheme   $$x_{n+1} = P \left(x_n , \frac{1}{x_n} \right)$$  converges even faster?   The conjecture is that no such algorithm exists. But I have no idea how to prove it.

What is the fastest algorithm for finding the square root of a number?  I created one that can find the square root of "$987654321$" to $16$ decimal places in just $20$ iterations   I've now tried Newton's method as well as my own method (Newtons code as seen below)  What is the fastest known algorithm for taking the second root of a number?  My code for Newton's Method (*Edit: there was an error in my code, it is fixed in the comments below):        a=2   //2nd root     b=97654321   //base     n=1   //initial guess     c=0   //current iteration (this is a changing variable)     r=500000   //total number of iterations to run     while (c<r)      {         m = n-(((n^a)-b)/(a*b))  //Newton's algorithm         n=m         c++;         trace(m + "  <--guess   ...   iteration-->  " + c)     }


I am having trouble deciding between the D7200 and the D610. I am upgrading from the D3200, so both camera would make a great difference.  At the moment, I have four lenses. The 70-200mm f2.8 (tamron) and 50mm f1.8G. The other two are for dx and I don't use them anymore.  Next year, I will be the photographer for sports at my local college. Which are ice hockey, football, soccer, basketball, and volleyball. I also want to shoot music shows and open a little studio to do headshots at home.   I would like to go full frame for everything other than sports, but I feel like the D7200 would be better for sports than the D610.   What do you think would be better? Could the D610 be enough for sports?  I am really having hard time choosing.  Edit: The two other lenses are: 18-55mm f3.5-5.6 and the 55-200f4-5.6 (both for DX)  Ialso do not plan on selling my D3200, I will use it as a backup/second camera

I was reading about crop factor from various places on the internet, and the general idea that kept building in my mind was that full-frame cameras are good for wide-angle shots but not that good for tele-photo. In :     [...] a 200 mm lens on a camera with a crop   factor of 1.5 has the same angle of   view as a 300 mm lens on a full-frame   camera. The extra "reach", for a given   number of pixels, can be helpful in   specific areas of photography such as   wildlife or sports.   It makes sense, but how high would the level of detail be on a full-frame with 300mm compared to the other example?


This post shows a sequential computation of the sample covariance matrix:  Original $$\hat \Sigma_n = \frac{1}{1-n}\sum_{i=1}^n (X_i-\hat \mu_n)(X_i -\hat \mu_n)^\top$$ Sequential $$\hat \Sigma_n = \frac{n-2}{n-1} \Sigma_{n-1} + \frac{1}{n} \Delta_n\Delta_n^\top \quad \text{with} \quad \Delta_n = X_n - \hat \mu_{n-1}$$ How can this be extended to batch updates?

I'm calculating the covariance of a distribution in parallel and I need to combine the distributed results into on singular Gaussian. How do I combine the two?  Linearly interpolating between the two almost works, if they are similarly distributed and sized.   provides a forumla at the bottom for combination but it doesn't seem right; two identically distributed distributions should have the same covariance, but the formula at the bottom of the page doubles the covariance.  Is there a way to combine two matrices?


I'm a usa cycling road racer. I just got a recommended lube Pedros Ice Wax. I ride about 100 miles a week. How often should I lube my chain with it and how often should I clean it?

I know I should lubricate my chain regularly. I got some lube at my LBS; how should I apply it? Do I just drip some on one spot, and turn the pedals around a few times to spread it out? Drip it all over the chain? Do I clean the chain first? How can I tell if it needs lube, or if I've put enough on?


I am running a multinomial logistic regression and have my final model, but now want to check for interactions between my two exposure variables and my independent variables. When I run this, one of my exposure variables is no longer significant, but some of the interactions between the levels of that variable are significant. I was wondering what the rule was for keeping or removing interaction terms in my model. Do I remove the insignificant variables and consequently any interactions involving that variable? All of my variables are categorical and relevant so there is not a question about whether or not insignificant interactions should be included. THANKS!

As an example I use Pinheiro, J. C. & Bates, D. M. 2000. Mixed-effects models in S and S-PLUS. Springer, New York. page 225. Rats whose body mass has been measured are fed by 3 different diets over time.   Response: Body mass, fixed effects Time*Diet, random effect ~Time|Rat. The main question with this test was if the interaction term is significant (i.e. difference in growth rate between diets). However, my question is could I also look at the p-values of the main effects to say that body mass increased significantly with time for Diet1 (which is the "dummy variable")?   From Pinheiro, J. C. & Bates, D. M. (2000)   Fixed effects: weight ~Time * Diet                   Value        St.error         DF        t-value         p-value   Intercept       251.60         13.068         157         19.254          <.0001  Time              0.36          0.088          13          4.084          0.0001  Diet2           200.78         22.657          13          8.862          <.0001  Diet3           252.17         22.662         157         11.127          <.0001  Time*Diet2        0.60          0.155         157          3.871          0.0002  Time*Diet3        0.30          0.156         157          1.893          0.0602    As stated by Pinheiro & Bates, the growth rate of diet 2 (TimeDiet2) differs significantly from diet 1. Although could I state like this for the effect of time on Diet1: f(x) = 251.60 (+/-13.068) + 0.36 x (+/- 0.088), t = 4.084, p = 0.0001? I have seen that people have claimed that it is wrong to interpret p-values for the main effects when the interaction is significant. And is it more proper to split the data and run the test  (weight ~Time) for each diet separately, when only looking at the effect of  time on body mass?


I defined another random variable $W = \frac{Y_3-Y_1}{2}$, then we get $Y_1 = Z-W$ and $Y_3 = Z+W$. I then used the change of variables method and get the joint pdf of $Z$ and $W$ is $h_{W,Z}(w,z) = 24w$, but I do not think this is correct since when I integrate everything out I do not get $1$.

Let $X_1,X_2, \ldots , X_n$ be independent and identically distributed Uniform random variables on the interval (0, a) for a > 0, each having a density function $f(x) = \frac{1}{a}$, $0<x<a$. Let $X_{(1)},X_{(2)}, \ldots , X_{(n)}$ denote the order statistics. The range of the data is defined as $R = X_{(n)}−X_{(1)}$ and the midrange is defined as $V = \frac{1}{2}(X_{(1)}+X_{(n)})$ Derive the joint distribution of $(R, V )$ and deduce the marginal distributions of $R$ and $V.$  Attempt:   First I am attempting to generate the joint distribution of $(V,X_{(1)})$ and then integrate out the $X_{(1)}$.   For the joint distribution of $(V,X_{(1)})$ I have:   $$ f_{v,x_{(1)}}(v,x_{(1)})=2n(n-1)\int_{-\infty}^v [F(2v-x_{(1)})-F(x_{(1)})]^{n-2} f(2v-x_{(1)})f(x_{(1)}) \, dx_{(1)}$$  At this point I have no idea how to integrate out the $x_{(1)}$.  Edit: I have located the joint distribution of the range and mid-range:  $$ f_{r,v}(r,v) = n(n-1) \left[F\left(v+\frac{r}{2}\right) - \left(F\left(v-\frac{r}{2}\right)\right)\right]^{n-2} f\left(v-\frac r 2 \right) f(v+\frac{r}{2})$$  For each marginal distribution, I have to integrate out:  $$ f_r(r) = \int_{-\infty}^\infty n(n-1)[F(v+\frac{r}{2})-(F(v-\frac{r}{2})]^{n-2}f(v-\frac{r}{2})f(v+\frac{r}{2}) \, dv$$  $$ f_v(v) = \int_0^{\infty}n(n-1)[F(v+\frac{r}{2})-(F(v-\frac{r}{2})]^{n-2}f(v-\frac{r}{2})f(v+\frac{r}{2}) \, dr$$


When pulling, i noticed git fetch behavior also occurs.  I assume a pull is actually  pull = fetch + x  I was wondering if this is the case, and if so, what is x?

What are the differences between git pull and git fetch?


In Harry Potter and the Deathly Hallows, Voldemort thinks that killing Snape will give him full control of the Elder Wand. He uses his snake, Nagini, to kill Snape rather than any number of spells he knows. This allows Snape to live long enough to help Harry defeat him.  Why?  Is there any reason that gaining complete control of the Elder Wand would be better facilitated by using Nagini than say Avada Kedavra? Or is this the equivalent of Voldy monologuing?

Voldemort was very fluent in Avada Kedavra. He never ever hesitated before using that. Also, there was no thumbs down in using it. Avada Kedavra was quick and effective.  Why didn't Voldemort kill Snape with Avada Kedavra?


I am using New York's  lot data in QGIS for a project.   Right now, the shp file automatically imports with a custom CRS, allowing it to visually line up with a separate layer of subway entrances (with that subway layer using WGS84).  That all works fine visually, with both layers overlaying each other on my map.   However, when I attempt to do some analysis in python on my PLUTO features via print feature.geometry().centroid().asPoint() I find that instead of a lat/lon pair, I get a weird set of x/y coordinates with values in the hundreds of thousands.   I assume that this is related to some sort of "state plane" or "local plane" coordinate reference system.   What I would rather see is a set of coordinates closer to lat 40 and lon -73.  Is there any way to convert my PLUTO layer so it will act more like a WGS84 layer?    Here is the CRS that gets displayed in the "Layer Properties" dialogue box: Selected CRS (USER:100000, * Generated CRS (+proj=lcc +lat_1=40.66666666666666 +lat_2=41.03333333333333 +lat_0=40.16666666666666 +lon_0=-74 +x_0=300000 +y_0=0 +ellps=GRS80 +towsgs48=... (at which point the screen cuts off the extended text).    Simply using the "save as" dropdown on the layers palette to resave the layer as a WGS84 shapefile does not solve this problem. The new shapefile generated by that process still imports with a custom CRS, and analysis of that generated shapefile still returns coordinates like x:997248.532881, y:221815.926017. So this does not seem to be a duplicate of the flagged-as-duplicated problem.

I have a series of layers of lines (shapefiles) in My Project. The CRS of some are different and to merge them they all must have same CRS.  When I use Processing/Toolbox/Qgis_algorithims/Reproject_layer the reprojection only works if it is allowed to save to temporary file somewhere (it will not change the CRS when I reproject if I try to save and replace it in My Project directory);   I must remove the original from the layer list and reproject the temp file (without changing the CRS) to get it into my project and name it appropriately.  Is there a better way to reproject a layer in Qgis?


I was wondering if there's a way that I can download apps from google play to my external sd card because every time I try downloading a game or a app it says "sorry, there's not enough storage on the device" and I have a 32gb sd card in and I tried going to applacation manager and moving apps manualy but some don't allow  me to move to my sd card and i have my default write disk on sd card and I have a samsung galaxy s5 mini

If you're running out of memory which happens a lot on low-end android devices like Samsung galaxy Y, Samsung galaxy Y-DUOS etc. and want more free space for your apps, then this post is for you..


Show that $$\int_{0}^{\infty}\frac{cosh(ax)}{cosh(x)}dx= \frac{\pi}{2cos(\frac{\pi a}{2})}, |a|<1$$ We want to compare it to a complex function. Then let C be a rectangle with vertices $z=\pm R, z= \pi i \pm R$, so that when $R \rightarrow \infty$ we will be able to reach $\pm \infty$. This is what I have done so far: $$\frac{cosh(ax)}{cosh(x)}=\frac{cos(iaz)}{cos(iz)}=\frac{e^{-az}+e^{az}}{e^{-z}+e^{z}}$$ I don't know if I am not using the right comparison of a complex function or what, but once I get here, I am not sure how to find the zeros (poles) of the denominator so that I can plug it into the residue equation. Am I jumping ahead or am I not comparing it to the right complex function? Any help will be appreciated!

Use residues to evaluate $$ \int_0^\infty \frac{\cosh(ax)}{\cosh(x)}\,\mathrm{d}x $$ where $|a|<1$.  Try considering the integral of the form  $$ \int_C \frac{\exp(az)}{\cosh(z)}\,\mathrm dz, $$ where $C$ is the contour given by $y=0,\, y=\pi,\, x=-R,\, x=R$.


Imagine that a user reaches 10K reputation and gains the moderation privilege. Now he can edit posts immediately. The day after he gets a vote down for one of his answers/questions. Will he lose his moderation privilege? Or is it given to him anyway?  My concern is because I think for either way it has some problems. In example above there isn't any problem if the given privilege is not taken back, but what if the loss of reputation is due to a spam user's removal (that was created by the user to generate fake reputation)?

For example, if your reputation starts above 50 and then falls below 50, do you lose the ability to leave comments? Or, are privileges forever, once earned?


Given:   let rows = [     { Amount: 190615.83 },     { Amount: -175867.95 },     { Amount: -14747.88 }, ] const sum = rows.reduce((runSum, v) => runSum + v.Amount, 0); console.log(sum);    The sum should return 0 but it returns -2.3646862246096134e-11 see:  How can I make this add correctly?

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


The question is in the title.    I just upgraded an office from older keyboards which were starting to fail from overuse.    The new K235 units have a nice feel and am hearing no complaints about the decision to go with this less-expensive model.  But I am getting some grumbling from some people that the new ones do not have a caps lock light.    (They don't appreciate my telling them that I merely removed that keycap from mine).    Almost every day I hear about someone who was touch-typing only to discover they had bumped the caps lock key and then had to go back and retype what they had just finished.  So is there a way I can help these hard workers?

just got a new Samsung laptop running Windows 8. The laptop keyboard has no indication if capslock enabled or not. Is there some way I can get it to display in the system tray, or to flash on the screen when it changes?


I want to be able to print out my UV layout, so as to be able to assemble the model out of paper (or wood, if I lasercut). Is there an easy way to turn the edges in the UV editor into outlines on the image, so I can see where to cut?

I have a 3D truck model already textured and properly imported into Blender. This is a game model and I need to "re-paint" with design from other transport companies. The problem is that I don't have a UV layout (skin template) to serve as a guide for future paintings.  Is there a way to "extract" an UV Layout to .JPG or .PNG to serve as guide for .DDS texture editing?  Please note that I don't want to remap the model. I still want to use the actual UV Mapping and just need to edit the actual textures.


In a SVM with linear kernel, could you explain to me what exactly the C parameter is/represents?  An example why it's important to select a good value for C would also be appreciated.  Thank you.

I am trying to fit a SVM to my data. My dataset contains 3 classes and I am performing 10 fold cross validation (in LibSVM):   ./svm-train -g 0.5 -c 10 -e 0.1 -v 10 training_data   The help thereby states:  -c cost : set the parameter C of C-SVC, epsilon-SVR, and nu-SVR (default 1)   For me, providing higher cost (C) values gives me higher accuracy. What does C in SVM actually mean? Why and when should I use higher/lower values (or the LibSVM given default value) of C?


I am having some problems trying to translate this to nginx, today I can't make my brain to work well and solve this!  RewriteEngine on  RewriteCond %{REQUEST_FILENAME} -f RewriteRule ^(.*)$   $1                 [L]  RewriteRule ^(.*)$   index.php?url=$1   [QSA,L]

I'm using this .htaccess that pass everything after URL to $param, so example.com/news/id goes to PHP as $_GET['param']='news/id'. But Nginx is always throwing me to 404 page.  My .htaccess:  RewriteEngine On RewriteCond %{SCRIPT_FILENAME} !-f RewriteCond %{SCRIPT_FILENAME} !-d RewriteRule  (.*) index.php?param=$1    What I tried in Nginx default.conf:   server {         listen 80;         listen [::]:80;     server_name domain.com;         root    /var/www/html;          location / {                 if (!-f $uri){                         set $rule_0 1$rule_0;                 }                 if (!-d $uri){                         set $rule_0 2$rule_0;                 }                 if ($rule_0 = "21"){                 rewrite ^(.*) index.php?param=$1;                 }         } }


I want to ask between the mvp and mvc  i have a two part  1.can i use a web crawler to compare mvp and mvp in performance? 2.can give an other example study case to compare mvp and mvc?

When looking beyond the  (drag-drop and configure) way of building user interfaces that many tools encourage you are likely to come across three design patterns called ,  and . My question has three parts to it:   What issues do these patterns address? How are they similar? How are they different?


I need to give an example of this, or provide an argument for why it's impossible.  Two sets $A$ and $B$ with A intersection $B = \emptyset$ $\sup A = \sup B$, $\sup A$ is not an element of $A$ and $\sup B$ is not an element of $B$.  I was thinking if both $A$ and $B$ are the empty set and their supremum is negative infinity that this would satisfy the question. Are we allowed to say the empty set is bounded and are we allowed to set negative infinity as a bound?  If it's not allowed I'm just going to say something like $A =\{x:\;x\text{ is a rational number and }2 < x < 3\}$ and $B =\{x:\; x \text{ is irrational and }2 < x < 3\}$. This doesn't seem nearly as interesting though.

I read in a paper on set theory that the supremum and the infimum of the empty set are defined as $\sup(\{\})=-\infty$ and $\inf(\{\})=\infty$. But intuitively I can't figure out why that is the case. Is there a reason why the supremum and infimum of the empty set are defined this way?


I'm having the same problem as the  where our Android app is not available for download in the Isle of Man, from the Google Play store.   As IoM is part of the UK, it should be available already as the UK is a selected territory.  Does anyone know of a workaround apart from our users travelling to the UK and downloading it?

I'm travelling to country X. I want to install an application which isn't available in my country, but is available in country X; but I prefer to download and install it in advance, while the data connection is still cheap.  Unfortunately, the Play Stores does not allow me to install this app. Is there any way to circumvent this limitation?


The limit is: $$\lim\limits_{n \to \infty}\left\{n\left[\ln{\left(n+1\right)}-\ln{n}\right]\right\}$$ I think this can be solved by converting the given limit into the form: $$\left(1+x\right)^{\dfrac{1}{x}}$$ But I can't convert it.

Find   $$\lim _{x\to \infty }x\Big(\ln\left(x+1\right)-\ln x\Big)$$  Here's how I do it:  $$x\Big(\ln(x+1)-\ln x\Big) = x\Bigg(\ln(x(1+\frac{1}{x}) - \ln x\Bigg)$$ $$x\Big(\ln x + \ln(1+\frac{1}{x}\Big)-\ln x =x\ln\Big(1+\frac{1}{x}\Big)$$ $$\ln\Bigg( \Big(1+\frac{1}{x}\Big)^x \Bigg) \rightarrow \ln 1^\infty = 0$$  What am I doing wrong? The answer is supposed to be $1$, but I get $0$.


I have just asked a question on   I read from this meta answer  that suggested     From a desktop support perspective there are certainly cases where a   large(r) number of machines will be affected by something, in which   case it's appropriate for SF. There are then others that are isolated   to a single computer, these tend to be the ones I vote to move to SU.   Since my question is clearly not about a single computer and is external to a single computer, I turned to ServerFault. I thought the question is about how to replicate a network admin strategy on my own (home) network. My question is, however, marked as off-topic, and I did see that homenetwork questions are off-topic. But this is not a single computer issue either.  My question is:  Where should such home/small network questions be asked?  What's the real difference between "professional" networks and the smaller networks that I build for my home or lab with a handful computers?  -- UPDATE --  The question asked here is different from the said duplicate question  as that question is about the difference among computer science and programming SE sites. It has nothing to do with network administration, whether it's large or small networks. None of the two SE sites in question (Server Fault and Super User) is even mentioned in the question or in the 2 cited answers.  -- UPDATE2 --  This question is not a duplicate of , which was cited in the OP and was the cause of this question. That question does not cover the overlapping area of small networks, which could both be for work and for home network.

I see a lot of desktop admin questions being migrated to Super User.  Are we positing that enterprise desktop support belongs on Super User?  To me it's just as valuable for Server Fault to have information on things like troubleshooting a  on Windows XP on Server Fault because the troubleshooting steps for a desktop BSoD and a server BSoD are the same.  To me, Super User was put out as the consumer/non-business version of Server Fault.


I've read (too late) that it's best to use another schema to store data tables in than the public schema when using PostGIS.  e.g. here:   Considering this is all quite old (e.g. the above accepted answer is from 2012), I'm wondering if this is still as valid as it was back then for current versions of PostgreSQL and PostGIS ?

I'm currently setting up a fresh install of PostGIS 2.0.2 and PostgreSQL 9.1.6 on Ubuntu.  I've recently come across   indicating that using the public schema to store all data is not a good idea.  For this reason, I've set up a schema called data and made myself the owner, but is it a good idea?  My concerns are:   Besides setting the owner, I may need to pay attention to things on the Privileges tab when creating this new schema (through pgAdmin III); I may not get the same benefits by storing my data in the public schema and dumping all data into a separate schema before doing a backup/restore (this would save a few keystrokes when using ogr2ogr); and I may run into trouble by not having the default PostGIS tables and views in my new data schema (they are in the public schema within the same database).