a) Let $T: \mathbb{R}^2 \rightarrow\mathbb{R}^2$ be a linear transformation such that $T(1,1) = (1,2)$ and $T(1,2)=(3,4)$. Find $T(5,8)$ and $T(3,-2)$ ?  b) Let $T: \mathbb{R}^3 \rightarrow\mathbb{R}^2$ be a linear transformation such that $T(1,0,-1) = (2,3)$ and $T(2,1,3) = (-1,0)$. Find $T(8,3,7)$?

Let $T\colon\mathbb{R}^2\to\mathbb{R}^3$ be the linear transformation such that $T(1,1)=(1,0,2)$ and $T(2,3) = (1,-1,4)$.       Does such a linear transformation exist?  So far I've worked out that it cannot exist, as the first entry for $T(1,1)$ is 1, whereas the first entry for $T(2,3)$ is 1, which can only be obtained through 3-2, or half of 2.  Is there any way of presenting this formally?


When gales tear at the mountain peaks, it's better to be a horse in Sunnfjord than an emperor in Russia.”    Should I use the being form there instead of to be? Why or why not? Are both ok, or is one wrong? How can you know?

Some verbs are followed by ing, e.g. I enjoy swimming. We can't say I enjoy to swim. Likewise, some verbs are followed by to, e.g. I decided to make a plan.   Which particular verbs are followed by ing and to? Can you please provide a list for that?  Moreover, which verbs can be followed by both without having the meaning changed?


I'm doing my semi-annual look around via Disk Inventory X, and I'm seeing some .pkg files located at /Library/Updates/061-41421 with names like macOSUpd10.14.6.pkg and FullBundleUpdate.pkg weighing in at sizes like 1.7gb. They cannot be casually moved to the Trash and sudo rm macOSUpd10.14.6.pkg yields the Operation not permitted message.  Can anyone tell me what these are for? / Are they necessary to keep around? / If no, how do you remove them? And most importantly, why in the world would Apple keep these on board after the contents have been distributed via an update?  Thanks

I have answered 'No' to Siri initial prompt, but I can still see it in my process list. I've tried to kill it, but it loads again immediately. How can I unload and remove Siri from my Mac?


PHP is intermittently reporting ridiculous allocation errors.      Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 4348209864 bytes) in Unknown on line 0   It tried to allocate more than 4GB of memory.  What?  Where is Unknown line 0?  Where did it try to allocate?  I am not explicitly allocating any memory in my PHP code and I am not using anything other than stock PHP calls.  I see that the last line of raw HTML in my PHP file (after i exit the php block) is emitted and in the loaded page, so the problem doesn't appear to be occurring in my actual PHP code.  Code it be something that I am doing that is triggering this?  I have found that this seems to happen more frequently if I try to reload a PHP file in the browser shortly after having edited the actual PHP file, but I don't know if this is a good data point or not.  PHP version is 5.3.26.  Why am I getting these errors, and is this something I need to worry about for production?

This error message is being presented, any suggestions?     Allowed memory size of 33554432 bytes exhausted (tried to allocate   43148176 bytes) in php


So i have a table (linked below) and for each unique PropertyID, i need to find the highest percentage value and extract that to a different table. I need to retain all the other attribute information as well, (which summarize or dissolve doesn't do).   I'm using ArcMap 10.3

I am trying to calculate a mean across a multiple number of attribute rows and have this value added to a new field that I have entered in the attribute table. I have an attribute table which has a number of different ecoregion types associated with them.  For example:  If I select "Arid Canyonlands" there are 3 attribute rows that are selected, each with their own "mean". I am trying to add a new field to the attribute table which will take the "mean" of these three and populate that value in the new field created. I could manually do it through an editing session and using a calculator but just wanted to know if there is an easier way to actually do it through field calculator?


What is the right variant?  there were 3.5 millions of people  or  there was 3.5 million of people

Which is correct?  The molecular weight of this substance ranges from   two hundred to two hundred and sixty. two hundreds to two hundred and sixty.   I need to spell the numbers out for some reasons and I'm stuck.  Thank you for your help!


How does evaluate the determinant of the following $(2n+1)\times (2n+1)$ matrix?   \begin{equation}     \det A = \begin{array}{|cccccccccc|cc}       1       & -1 & 0 & \dots & 0 & 0 & 0 & \dots & 0 & 0 & & {\color{blue}{\text{row }1}}\\       -1       & 2 & -1 & \dots & 0 & 0 & 0 & \dots & 0 & 0& & {\color{blue}{\text{row }2}} \\       0       & -1 & 2 & \dots & 0 & 0 & 0 & \dots & 0 & 0& & {\color{blue}{\text{row }3}} \\       \vdots  & \vdots&  \vdots   & \ddots      & \vdots    & \vdots & \vdots & \ddots & \vdots& \vdots  & &{\color{blue}{\vdots}}\\       0 & 0 & 0 & \dots & 2 & -1 & 0 & \dots & 0 & 0  && {\color{blue}{\text{row }j-1}}\\       0 & 0 & 0 & \dots & -1 & 3 & -1 & \dots & 0 & 0 &{\color{blue}{\rightarrow}}&  {\color{blue}{\text{row }j}}\\       0 & 0 & 0 & \dots & 0 & -1 & 2 & \dots & 0 & 0 && {\color{blue}{\text{row }j+1}} \\       \vdots  & \vdots&  \vdots   & \ddots      & \vdots    & \vdots & \vdots & \ddots & \vdots& \vdots    & &{\color{blue}{\vdots}}    \\     0       & 0 & 0 & \dots & 0 & 0 & 0 & \dots & 2 & -1 && {\color{blue}{\text{row }2n}} \\         0       & 0 & 0 & \dots & 0 & 0 & 0 & \dots & -1 & 1 && {\color{blue}{\text{row }2n+1}}\\     \end{array}   \end{equation} The coefficient $3$ is at the $j$-th row for some $2\leq j\leq 2n$. Therefore,  $$ \det (L_{A_{11}}) = (-1)^n 2^{n-1}. $$  If $n+1\leq i\leq 3n+1$ we denote the resulting matrix by $A_{12}$ after deleting the $i$-th row and column of $L_A$. Then, by a similar computation, we have  $$ \det (L_{A_{12}}) = (-1)^n 2^{n}. $$     Should we thus conclude that    $$ \det A = (-1)^n 2^{n-1}n + (-1)^n 2^{n}(2n+1)=(-1)^n 2^{n-1}(5n+2) $$   is equal  to $(-1)^n 2^{n-1}(5n+2)$ ?

How to show that the determinant of the following $(2n+1)×(2n+1)$ matrix $A$?    \begin{equation}     \det A = \begin{array}{|cccccccccc|cc}       1       & -1 & 0 & \dots & 0 & 0 & 0 & \dots & 0 & 0 & & {\color{blue}{\text{row }1}}\\       -1       & 2 & -1 & \dots & 0 & 0 & 0 & \dots & 0 & 0& & {\color{blue}{\text{row }2}} \\       0       & -1 & 2 & \dots & 0 & 0 & 0 & \dots & 0 & 0& & {\color{blue}{\text{row }3}} \\       \vdots  & \vdots&  \vdots   & \ddots      & \vdots    & \vdots & \vdots & \ddots & \vdots& \vdots  & &{\color{blue}{\vdots}}\\       0 & 0 & 0 & \dots & 2 & -1 & 0 & \dots & 0 & 0  && {\color{blue}{\text{row }j-1}}\\       0 & 0 & 0 & \dots & -1 & 3 & -1 & \dots & 0 & 0 &{\color{blue}{\rightarrow}}&  {\color{blue}{\text{row }j}}\\       0 & 0 & 0 & \dots & 0 & -1 & 2 & \dots & 0 & 0 && {\color{blue}{\text{row }j+1}} \\       \vdots  & \vdots&  \vdots   & \ddots      & \vdots    & \vdots & \vdots & \ddots & \vdots& \vdots    & &{\color{blue}{\vdots}}    \\     0       & 0 & 0 & \dots & 0 & 0 & 0 & \dots & 2 & -1 && {\color{blue}{\text{row }2n}} \\         0       & 0 & 0 & \dots & 0 & 0 & 0 & \dots & -1 & 1 && {\color{blue}{\text{row }2n+1}}\\     \end{array}   \end{equation}  By a direct calculation of  determinant. here $3$ is at the $j$-th row for some $2\leq j\leq 2n$. Therefore, $\det (L_{A_{11}}) = (-1)^n 2^{n-1}.$  if $n+1\leq i\leq 3n+1$ we denote the resulting matrix by $A_{12}$ after deleting the $i$-th row and column of $L_A$. Then, by a similar computation, we have $\det (L_{A_{12}}) = (-1)^n 2^{n}.$  $ \det A = (-1)^n 2^{n-1}n + (-1)^n 2^{n}(2n+1)=(-1)^n 2^{n-1}(5n+2)$  equal  to $(-1)^n 2^{n-1}(5n+2)$ ?


I have a Thinkpad T440p and the fan seems to be dirty from no hot air coming out of the laptop. All the disassembly guides show that I need to take the whole fan assembly out but I have no thermal paste left nor do I have any cans of compressed air.  Can I just take a vacuum cleaner to the fan and clean it that way?

To get rid of dust that had gathered near the fan, I put a vacuum cleaner to the air intake (with the computer turned off).  This removed the dust.  It also caused the fan to rotate at a fairly high speed. Quite faster than normal speed, judging from the sound.  Do I risk destroying stuff by doing this?


I want to get this right, so I’ve decided to get the opinion of all you smart folks out there.  I’ve seen the word written both ways, I personally write cellphone as one word, but I’ve seen it written as two words too.  Technically I would imagine that I can’t go wrong if I write cell phone, but I would feel better if I heard other opinions on the subject.

Some compound words are written without hyphens (nonaggression, nonbeliever), some with hyphens (well-intentioned), and others with spaces (post office).  Is there a rule or good guide as to which option should be used?


I want to know does any solution exist to add a circle around the cursor when I click on the screen?

Due to a stroke, I have had some vision impairment in that I sometimes have a hard time locating my mouse pointer on the screen.  I have tried making the mouse pointer larger which helps but is still not the solution.  I am new to the Mac world and would appreciate your help.  In Windows, there is an option where pressing the CTRL key will help to identify the mouse pointer using a temporary display of several radiating concentric circles around the mouse pointer.  Is there something like this on OS X?


There's now this super annoying pop up on all questions across all sites:    To turn it off  you  have  to  hide  it  every  single  time.  How can it be disabled permanently on all questions across all sites?

We are happy to announce that the  follow question and answer feature is now live across the Network, including Stack Overflow, all Stack Exchange sites, and all Meta sites. (International Stack Overflow sites will have it turned on in a day or two once we have translations all set.) You can follow any question or answer (that you did not author) by clicking on the [follow] button that is shown in the menu immediately below the post (alongside the [share] button):    After you have followed a post, you will get inbox notifications for all new answers (in the case where you followed a question), comments, edits, and notices. You will not receive notifications for any action that you performed. As was mentioned in the earlier post, we are not making changes at this point to the notifications received by a post owner, or due to @mentions. The initial release had been planned to only include question following. Thanks to many folks who chipped in over the past few weeks, we are happy to release both question and answer following at the same time. These are available in both the regular and mobile views. We are still planning on two more related releases:  Follows profile tab and question listing filter: A tab for follows will be added to your user profile activity page. Each user will be able to view this tab that will provide a listing of followed questions and answers, with standard sorts, and the ability to unfollow from the listing. Users (with the exception of moderators and authorized staff) will not be able to see this information about other users (nor will it be made public in the API, SEDE, or data dumps). We will be renaming the Favorites feature to Bookmarks. As we mentioned in the preview post, the feature will be the same as Favorites, with the name and icon updated to more accurately represent user expectations and usage. And you will be able to both "bookmark" and "follow" a question.  We hope that this new feature will allow you to have better access to the content that you care about and want to keep tabs on. Update (June 11, 2020): The user profile tab and the rename of Favorites to Bookmarks have been released.


What is the proper usage of "has been" in the sentences below?      He has been working on it.    He started working some time back (it may be near or long past) and still working. He started working some time back and is now not working. He started working some time back and one cannot say whether he is working still. All of them are wrong: please give its meaning.   In a , have been eating is shown as starting some time ago and ending a little before the present.  However, if I say "He has been working on it," does that mean that there is no possibility that having started to work on whatever it is  some time ago, he is still working on it? Does that construction always mean that work has stopped?  If there's a time mentioned, "He's been working on it for three months," does that make a difference?

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


Newish to R Very new to GIS  I've grabbed some vector spatial census data using the cancensus package. I now have a spatial data frame with variables and geometry I plot it and decide to focus on a part of the whole province  My thinking here is to create a rectangle with the coordinates that I am interested in using extent(xmin, xmax, ymin, ymax)  Assign it the same CRS as the spatial data frame and then use st_intersection. Is this the right approach?  extent(box) <- c(-81, -74, 41.68, 45) st_set_crs(box, "+proj=longlat +datum=WGS84 +no_defs") # Fails ont_crop <- st_intersection(census_data, box)   I'm not sure how to show you a reproducible example since census data is large. Please let me know what I am doing wrong.

Is there a function to crop sf map object, similar to maptools::pruneMap(lines, xlim= c(4, 10), ylim= c(10, 15)) used for SpatialPolygon or SpatialLine?   I am considering st_intersection() but there can be proper way.


i have try to search over the internet but got nothing  this is my situation,  i have more than 30 vps running ubuntu server 12.04  i need to install openssh, webserver (apache + php) & database server (mysql) to all of this vps.   unfortunately, my bandwidth is limited  my question is : how to create local repo that contain needed application only so my other vps don't need internet connection to install this application ?  looking forward for your response

I have more than 500 systems running ubuntu 10.04, ubuntu 10.10 and ubuntu 11.04. It is difficult for us to install new packages to these machines from internet, because of the high bandwidth usage. I am planning to set up an apt-cacher server, such that it should install packages from a local machine, instead of installing packages from the internet. Can anyone give me a neat solution please? Thanks in advance. Error in server configuration: root@karthick:~# sudo /usr/share/apt-cacher/apt-cacher-import.pl /var/cache/apt/archives Importing: acl_2.2.49-3_i386.deb Failed to rename acl_2.2.49-3_i386.deb. Try read-only (-r) or symlink (-s) options. at /usr/share/apt-cacher/apt-cacher-import.pl line 154.  Error in client on installing packages  Can anyone sort out pls?


Why is $\mathbb{Q}$ the minimal field that contains $0$ and $1$ ?   Why isn't it $\mathbb{Z}_2$ ?

the definition of a prime subfield that I have been provided with is the following:      It can be shown that for any subset $S$ of $F$ there exists a minimal subfield $K$ of $F$ which contains $S$. One very important case is when the set $S$ is empty, i.e., every field $F$ contains a unique minimal subfield. This subfield is called the prime subfield.   I further know that any subfield $K$ of a field $F$ contains the elements $0$ and $1$ and is closed under addition, multiplication, and taking negatives and inverses of non-zero elements.   And since the prime subfield is the intersection of all possible subfields across $F$, why is it not the case that the prime subfield is always equal to $0$ and $1$?   Thank you for the help!


I want to know what kind of font is this :    Thanks.

Is it possible to identify the font used in a specific document/picture?  Answers to this question should identify:   Possible methods to do this (perhaps one answer per method) and adequately describe how to use it (as opposed to merely stating it); Ways of finding the identified fonts, if possible (free or not); and Any prerequisites associated with the method used, if required (for example, "In order to use method X, your document has to be in format Y").   This question is meant as an FAQ, based on an . Its aim is to facilitate the community with the general procedures involved in font identification. Similar cases are solved on a per-usage basis on 's  tag.


In Peskin's QFT book chapter 11.5, the author gives a graph(see below) and claims that the third functional derivative for effective action $\Gamma$ gives the 1PI (one-particle-irreducible) 3-point Greens's function.  When computing the electron propagtor, I learned that the full electron propagtor is a geometric series of 1PI bubble(1PI bubble=sum of all 1PI diagrams). So how can I see that the white bubble is the 1PI 3-point Green's function? Is it a geometric series of something? What does the white bubble contain?

In all text book and lecture notes that I have found, they write down the general statement \begin{equation} \frac{\delta^n\Gamma[\phi_{\rm cl}]}{\delta\phi_{\rm cl}(x_1)\ldots\delta\phi_{\rm cl}(x_n)}~=~-i\langle \phi(x_1)\ldots\phi(x_n)\rangle_{\rm 1PI} \end{equation} and they show that it is true for a couple of orders.  I heard that Coleman had a simple self contained proof for this statement (not in a recursive way), but I cannot find it. It might have been along the line of comparing to the $\hbar$ expansion but I'm not sure.  Do you know this proof? Is there a good reference for it?  Comment: Weinberg does have a full proof but it is hard and not intuitive.


So I've been trying to create a hotspot using create_ap but I'm getting the error ERROR: Your adapter does not support AP (master) mode The iw list also does not list AP as a supported interface but I am able to create a hotspot in windows. I'm not asking how to create the hotspot I know the process. The thing that's stopping me from doing this is that the system does not show AP as a supported interface but since the same is possible by windows I suspect there's some other issue that is causing AP not to be a supported interface

I know how to create a hotspot when connected to a wired network, but when I am using internet from a WiFi connection, this disconnects the wireless connection the moment I activate the hotspot.  In Windows I can use , which enables me to share the internet connection from the same wireless adapter as I am creating an access point on. As you can read on the :     Access Point mode allows you to create a hotspot using the same Wi-Fi card that you are using to access the Internet.   How do I do this on Ubuntu?


I have posted this question before but the people who were kind enough to answer did not address the problem as posed and the post is now dry - i.e. no-one addressing it. So, I repost the question, hopefully clarifying my problem: After recently upgrading from Ubuntu 18.04 to 20.04 I found icons on my desktop that were not there before - see attached screenshot. When using Gnome-Tweaks I can remove my personal folder and the Wastebasket but the others remain and I don't know how to remove them. I should be most grateful if someone could help. Thank you.

As of now, my desktop has begun showing the contents of my home folder (~) instead of the contents of ~/desktop. I must have changed something, but I have no idea what, or what I was doing exactly when it happened.  How do I re-point gnome to the right folder?  I'm running Ubuntu 11.04.


I have asked a question at mathstackexchange but i have not got an answer yet so i am referencing the question here so that maybe one of you can help in understanding the problem:   Please do help and thanks in advance. (and sorry for the inconvience)

I need your expertise in understanding and hopefully solving the following problem:  Let $C \subset \mathbb{R}^d$, and lets assume that $C$ is not centrally symmetric, thus when computing the $MVEE(C)$ (i.e the minimum volume enclosing ellipsoid), they use the following "lifting step":  $$ C^\prime = \left\lbrace \pm \begin{bmatrix} x\\ 1 \end{bmatrix} \middle| x \in C \right\rbrace,$$ where $C^\prime$ is centrally symmetric.  It is proven that for any $\varepsilon > 0$, $MVEE(C^\prime) \cap \Pi$ is a $(1 + \varepsilon)$-approximation to $MVEE(C) \times \left\lbrace 1 \right\rbrace$, where $\Pi = \left\lbrace x \in \mathbb{R^{d+1}} \middle| x_{d+1} = 1 \right\rbrace$.  Let $G \in \mathbb{d \times d}$ be an invertible matrix, let $ v \in \mathbb{R}^d$ such that the pair $(G,v)$ represents the matrix and the center of $MVEE(C)$ respectively. Let $\hat{G} \in \mathbb{R}^{(d + 1) \times (d + 1)}$ be an invertible matrix such that the pair $(\hat{G},\overset{\to}{0})$ represents the matrix and center of $MVEE(C^\prime)$ respectively.  Then, $\forall x \in MVEE(C)$ $$ \left| \left| \left[ x , 1 \right] \hat{G} \begin{bmatrix} x\\1 \end{bmatrix} \right| \right|_2 = (1 + \varepsilon) \cdot \left| \left| (x - v) G (x - v)^T \right| \right|_2 .$$  Regarding $x \not\in MVEE(C) $, then it is easy to see that the above term is not satisfied and moreover the right term is bigger or equal to the left term.  What I need to know is whether it possible the bound the right term by the left term (maybe because $MVEE(C) \times \left\lbrace 1 \right\rbrace \subseteq MVEE(C^\prime)$), i.e. $$ poly(d) \cdot \left| \left| \left[ x , 1 \right] \hat{G} \begin{bmatrix} x\\1 \end{bmatrix} \right| \right|_2 \geq (1 + \varepsilon) \cdot \left| \left| (x - v) G (x - v)^T \right| \right|_2 \ ?$$  Please Do correct if I am wrong and thanks in advance.


Consider: {     "one": {         "one1":"one11",         "System Name":"ssss"     },     "two2": [         ["two20", "two200"]     ] }  If I use '/* comments */' or //comments, I can not get JSON data. But I have too much data, and I must add comments. Is there another way to do it?

Can I use comments inside a JSON file? If so, how?


So I think I found these  $$27y + 23 = 32x$$ $$81y + 85 = 128x$$ in a text-book or something, and it was a graphing problem. (These are not simultaneous equations, they are separate.)  I tried to find integer solutions to this and after putting in some numbers I still couldn't find any.   I used some graphing software and still could not find any integer solutions for $x, y \in \Bbb Z$.  So I wonder, do any solutions exist? But more importantly, is there a technique for checking if equations like these actually have integer solutions, if so what is the technique.  This isn't overly important, but if there was such a technique that would be helpful.  Thank you.

I want to find a set of integer solutions of Diophantine equation: $ax + by = c$, and apparently $\gcd(a,b)|c$. Then by what formula can I use to find $x$ and $y$ ?   I tried to play around with it: $x = (c - by)/a$, hence $a|(c - by)$.     $a$, $c$ and $b$ are known. So to obtain integer solution for $a$, then $c - by = ak$, and I lost from here, because $y = (c - ak)/b$. I kept repeating this routine and could not find a way to get rid of it? Any hint?  Thanks, Chan


In academy graduation, Iruka said to Naruto that you fail graduation last year and year before that. Then how come he is in same year as Sasuke and Others. Thus that means Naruto is older then all ?

Naruto wasn't able to complete the Genin exam for some time. Either he was just a young starter and Sakura & Sasuke started after he failed, or a result that he was quite older. They say he was the same age, but never really told us to which day he started.  Doesn't that mean Naruto is older than Sasuke and Sakura?


I have got ManyToMany Relation Ship @ManyToMany @JoinTable(name = "competition_tag",         joinColumns = @JoinColumn(name = "competition_id"),         inverseJoinColumns = @JoinColumn(name = "tag_id")) private Set<CompetitionTags> tags = new HashSet<>();   public void addTagToCompetition(CompetitionTags competitionTags) {     this.tags.add(competitionTags);     competitionTags.getCompetitions().add(this); }  But when i use addTagToCompetition I getting NullPointerException. Can you please give me any advice/tip why this happen. I add whole object. If this will be needed , whole class is on :

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 just I feel scammed when I got a laptop with Nvidia graphics card which preforms poorly with Ubuntu or any other Linux distro. I've tried Fedora, Ubuntu, OpenSuse and many other, thanks to Nvidia their drivers break the system.   I've installed Ubuntu 16.04 LTS and I installed Nvidia GTX 960M driver, from additional drivers utility. Whenever I restart my notebook, as long as I don't change the driver settings to Intel the system works fine. The moment I change the driver to Intel, the system breaks and I had to use recovery mode to remove the Nvidia driver. Swiching to Intel from nvidia-prime causes the fan to rotate fast and I get nothing once I reboot, I just see a black screen with nothing in it.   For Ubuntu 17.04 I can't speak. I feel lucky to be able to install Nvidia driver in Ubuntu 16.04. Under 17.04 once I install the driver, I had to go back to recovery mode and remove the Nvidia driver completely. I had probably installed Ubuntu and other Linux distro multiple times and I just think now about getting rid of my notebook which is Asus GL-752VW for the sake of installing Linux. I can't cope with Windows by nature.  I also tried to install Nvidia driver from nvidia.com, it didn't work.  For the moment, I don't care if Nvidia graphic card will run on my machine, I just need to make the Intel graphic card work and let Nvidia card to shut the f*** up. When I tried to just use Intel, Ubuntu will not boot or shutdown properly, because it tries to detect GPUs which takes forever, so I have to press the shutdown button each to force the shutdown. How can I use Intel graphic card alone? I just don't need to use Nvidia with Linux and I'll never buy anything from this company ever again.

I have an acer laptop with these GPUs: - GPU0: Intel HD Graphics 4000 (M) (obviously integrated) - GPU1: NVIDIA GeForce GT 710M  I uninstalled all nvidia-drivers because I was experiencing a lot of bugs and I read here and there that they are not supposed to work with Optimus without either bumblebee or nvidia-prime.  As far as I understand, nvidia-prime would allow me to have the NVidia GPU always on. And to choose between that or always off (i.e. always use Intel)  So now I installed nvidia-prime with  sudo apt-get install nvidia-prime   What am I supposed to do now?  I thought nvidia-prime provided a graphical interface which would allow me to choose which graphic card to use, and even to install the needed nvidia drivers.  By typing "nvidia" in the dash, nothing shows up. From a terminal, the only command available starting with "nvidia" is "nvidia-detect" which just prints "none".  So, I installed nvidia-prime, how do I use it?


My previous assumption was that magic armor and magic shields gain an enhancement bonus to their own armor/shield bonuses, which indirectly translates to increased AC. However, in the process of answering , I ended up taking a more careful reading of the rules for magic shields, and ran across some inconsistencies in this interpretation. The  section is vague on the subject, only ever stating that magic armor grants an enhancement bonus (without ever specifying where to apply said bonus). So, reading further down the page, we find some circumstantial evidence against my previous interpretation:     Shield enhancement bonuses stack with armor enhancement bonuses.   This clarification is only needed if both enhancement bonuses are being applied to the same value (i.e. directly to armor class). If one is being applied to an armor bonus and the other is being applied to a shield bonus, the stacking rules wouldn't even apply.     A shield could be built that also acted as a magic weapon, but the cost of the enhancement bonus on attack rolls would need to be added into the cost of the shield and its enhancement bonus to AC.   Emphasis mine. There's no mention of an "enhancement bonus to shield bonus to AC," merely "enhancement bonus to AC."  As a result, I'm inclined to believe that magic shields and armor provide enhancement bonuses directly to the user's AC, rather than simply increasing the items' existing armor and shield bonuses. The distinction between the two rules interpretations is relevant in a few edge cases - for instance, in the linked question, a strict reading of the rules for Wild equipment would allow its user to benefit from a shield's enhancement bonus to AC, but not from a shield's enhancement bonus to its own shield bonus.  Is my understanding of these rules correct, and has Paizo ever made any statements clarifying the situation?

Given this discussion I had  about combining Magic Vestment and Coat of Many Stars:  Targeting what you're wearing would get you two different, non-stacking sources of Armor bonus. –  Zachiel   Things don't need to be armor to grant you Armor bonuses and "a magical effect that mimics armor" is, by definition, not an armor. [...] –  Zachiel   @Zachiel, Magic Vestment gives you an enhancement bonus, so this will stack with the armor bonus of the CoMS. –  rojomoke   @rojomoke No, Magic Vestement would give your dress an Enhancment bonus to their starting Armor bonus of +0, effectively giving you two items with a positive armor bonus. To have them add up you'd need to cast the Vestment spell on the effect giving you the Armor bonus, to increase it thanks to the Enhancement bonus. –  Zachiel  Does an Enhancement bonus turn into an Armor bonus if applied to an article that isn't armor?


I use an Android phone but many of my friends and family have iPhones.  Starting a few months ago I discovered that several people sent me text messages that didn't go through.  And after digging into the problem, I discovered that their messages appeared as blue on their phone, not green, indicating that iMessage didn't convert it to a standard text. Then I discovered that (at least for some of the people), their texts were being sent to my email, not my phone number.  The weird thing is that I don't even think some of these people had my email.  I do have an iCloud account because I own a Mac, and somebody has indicated that can lead messages to your email address.  But I'm not sure.  How can I, once and for all, deregister my email (not my phone number, that's already been asked) from receiving iMessages and have my friends' Messages apps only suggest my phone number as a destination to text me at?  tl;dr: My email is registered as an iMessage destination, but I need to deregister it so my iPhone-using friends only send SMSs to my phone number.  Just to be clear: This post is not a duplicate of asking how to deregister your phone number from iMessage.  I never had an iPhone when iMessage existed and when I try using  it just says my phone number is not registered with iMessage.

I recently changed from iphone to android and i have been having trouble recieving messages from my iphone friends since my iphones screen is broken i cant do anything on it. Any way to fix this problem through icloud or something?


I think there is not.  In order to proof this I've written all the element's order and I've seen that the possible orders in A4 were only 1,2 and 3 (3 elements whit order 2 and 8 elements whit order 3). The orders in D4 were 1,6, 3 and 2 but there were 7 elements with order 2. So because an isomorphism is first of all an homomorphism, my map have to respect this condition: ord(f(x)) divides ord(x), but in my exemple I have 8 elements whit order 3 in the domine and 3 elements whit order 3 or 1 in the codomine, so I'm forced to send seven elements in only three, so the map can't be injective, so can't be an isomorphism.  I think it is correct, but I would like to know if there is a smarter way to proof this involving generators.  Thanks!

How do i show that $D_6$ has an element of order 6 but $A_4$ has only elements of order 3 and 2 and thus,  $A_4$ is not isomorphic to $D_6$? Can someone explain to me? Thanks!


Find all integers s.t. $\phi(n)=24$.    I keep practicing these and keep getting frustrated cause I keep missing numbers. I'm going off Elementary Number Theory and Its Applications by Kenneth H. Rosen His strategy it to get it's divisors, which in this case    $$m|24, m\in \{(1,24),(2,12),(3,8),(4,6)\} $$  Then to put the equation in both these formats and solve $$\phi(n)=(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})$$ $$\phi(n)=2^{k-1}(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})$$ Where $p_i$ is a prime and $2^k|\phi(n), k\in N$  So in the first format it can be in the following formats: $\phi(n)=(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})$ $\phi(n)=24=1\times24=2\times12=3\times8=4\times6$ So from the above we can eliminate $1\times24$ because 25 isn't prime and eliminate $3\times8$ because no prime minus itself to 1 less power equals 3. So from the first round we get n={39, 35, 45}     Then with k=1 $\phi(n)=2^{k-1}(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})=(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})$ So we just multiply what we have so far for n by 2. n={39,35,45,90,78,70}    Then with k=2 $\phi(n)=2^{k-1}(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})=2(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})$ So only $2\times 12$ works here so we get $2^2\times13$ n={39, 35, 45, 90, 78, 70, 52}    Then with k=3 $\phi(n)=2^{k-1}(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})=2^2(p_1^{a_1}-p_1^{a_1-1})\times...\times(p_r^{a_r}-p_r^{a_r-1})$ $24=4\times6$ so the only ones that can equal 6 are $(3^2-3)$ and $(7-1)$. So we get $2^3\times 3^2$ and $2^3 \times 7$ n={39, 35, 45, 90, 78, 70, 52, 72, 56}    But I ended up missing 84. I always end up missing 1 or 2 so any suggestions on how to do this better and not miss any would be great.

I have this homework problem assigned and I'm a little confused in solving it:  Find all solutions of $\phi(n)=16$ and $\phi(n)=24$ (where $\phi(n)$ is the Euler phi-function).  The hint that's provided says:  If $n=p_1^{k_1}p_2^{k_2}\cdots p_r^{k_r}$ satisfies $\phi(n)=k$, then $n=\frac{k}{\prod (p_i-1)}\prod p_i$. Thus the integers $d_i=p_i-1$ can be determined by the conditions (1) $d_i\mid k$, (2) $d_i+1$ is prime, and (3) $\frac{k}{\prod d_i}$ contains no prime factor not in $\prod p_i$.  I'm ok with proving the statements in the hint and I know how to get them, but I'm not sure how to apply them to solve the problem.


I received a warning in Bing webmaster tools that one of my site pages was infected with malware. this message was delivered several days ago, and unfortunately I only was informed of it today. Currently the malware tab is empty. The message itself is very generic and does not include a specific URL that was affected. I checked the home page and it does not look like anything was injected there. Is there a way to know which page exactly was affected? Can I assume it was only one page and there is no threat now?

Bing Webmaster Tools started flagging some of my pages as infected with malware.   Despite my best efforts, I have been unable to figure out what the problem might be.    The "help" message about the malware is:     Malware Network Reference      Reference to known malware distribution network detected. This could be via inclusion of an iframe or frame tag, an embedded object, or a script tag.   So far I have:   Verified that the source code for the website is unchanged (I verified that it matches what is checked into git, and that there is nothing weird in the commit history) I fetched the page as Bingbot and compared it to a version that I downloaded using another user agent to make sure that there isn't something serving Bing an altered page I grepped the page source for case insensitive script, frame, object, and embed to make sure that I recognize all the code. I grepped the page source for case insensitive https?:// to make sure I recognize all the links   What else should I be looking for?  The only scripts that are in the page are either inline scripts that I wrote myself, or tags that include AdSense ads via DFP.   Could the ads be inserting content that Bingbot is complaining about?  Is there any way to get further information from Bing?   I was unable to find anything further that might be helpful in their webmaster tools.  I couldn't find that they said anything about which specific malware, or what code snippets from my site might be problematic.


$$\frac{x}{\sqrt{y}}+\frac{y}{\sqrt{x}}\geq\sqrt{x}+\sqrt{y}$$ where $x,y>0$   How should I approach this?

Prove: $$\frac{x}{\sqrt{y}}+\frac{y}{\sqrt{x}}\geq \sqrt{x}+\sqrt{y}$$ for all x, y positive   $$\frac{x}{\sqrt{y}}+\frac{y}{\sqrt{x}}-\sqrt{x}-\sqrt{y}\geq 0$$  $$\frac{x\sqrt{x}+y\sqrt{y}-x\sqrt{y}-y\sqrt{x}}{\sqrt{y}\sqrt{x}}\geq 0$$  $$\frac{x(\sqrt{x}-\sqrt{y})+y(\sqrt{y}-\sqrt{x})}{\sqrt{y}\sqrt{x}}\geq 0$$  $$\frac{x(\sqrt{x}-\sqrt{y})-y(-\sqrt{y}+\sqrt{x})}{\sqrt{y}\sqrt{x}}\geq 0$$  $$\frac{(x-y)(\sqrt{x}-\sqrt{y})}{\sqrt{y}\sqrt{x}}\geq 0$$  $$\frac{(\sqrt{x}-\sqrt{y})(\sqrt{x}+\sqrt{y})(\sqrt{x}-\sqrt{y})}{\sqrt{y}\sqrt{x}}\geq 0$$  $$\frac{(\sqrt{x}-\sqrt{y})^2(\sqrt{x}+\sqrt{y})}{\sqrt{y}\sqrt{x}}\geq 0$$  All the elements are positive and if $\sqrt{x}=\sqrt{y}$ we get $0$  Is the proof valid?


I'm trying to 'ORDER BY' a String field which contains numbers. It orders like this:  1 10 2 3 ...  I've tried whith LPAD, VALUE, *1, but nothing works.  THANKS all for ur help!

I want to get records from custom object sort by a field as number. The field I want to sort is string type. Is there any way to do that? I am storing result in list, is there a way to sort list based on the string field but sort it as number?


As we know dispersion is caused by a convex lens.our human eye also has a convex lens so dispersion must take place in eye also this leading to a formation of blurred image on retina.then why are we able to see clear images?

Fairly straightforward question. If not, why not?  I suspect that if they do, it is not perceived due to the regions of highest dispersion being in one's region of lowest visual acuity.


I'm trying to log out of Stack Overflow.  I can't.  It used to work when I had MyOpenId credentials.  But I just created a new Stack Exchange account.  I can choose the down arrow next to my name, and choosing "log out", then clicking the "Log out" button.  Stack overflow then says I'm logged out.  But if I choose to log in again, when I choose to log in via a Stack Exchange account I just get a "log in" button that works without asking me my username or password.  How the flip do I really log out?  If it matters, I'm using Chrome.  (This may or may not be a dupe of  - it sounds similar).  Edited to add:  This is NOT a dupe of  because I'm not using an external OAuth provider, I'm using Stack Exchange's own account system.  And AFAICT there's no way to log out of Stack Exchange's own account system?

I have noticed that by signing on to Stack Overflow, I am also signed on to my email account. But when I log out, it only logs me out of the site without logging me out of my email. This means I am running around saying "hey, you should XSS me". Is this specific to the way OpenID behaves, or is it specific to the way Stack Overflow implemented it?


In Dr. House series, the doctors know each other well and are supposed to be colleagues/friends. Why not say Gregory/Robert/Eric, etc. among themselves instead of House/Chase/Foreman, etc?

Watching the German version of  on Netflix I discovered something that seems strange to me:  Whenever someone of the core CBI team member talks to another team member, they only refer to each other by their last name.  E.g. when Patrick Jane talks to Teresa Lisbon he might say:     Hi Lisbon, …   I.e. he does not say:     Hi Teresa, …   Nor does he say:     Hi mrs. Lisbon, …   (I'm only watching the German dubbed version, I would expect the behavior to be the same in the original US version).  I do consider it disrespectful to call someone by her/his last name only.  So my question:  What is the reason behind the CBI members only calling each other by their last name?


There is a statement on my homepage, and I'm not sure the correct order, or if it really matters.   "Your first impression only happens once."  Now should that be flipped around? i.e. ... happens only once.  Is there a correct order here?

Which is grammatically correct?  I can only do so much in this time.  or  I can do only so much in this time.


Could someone tell me whether "and" is necessary in the space:  I like different types of fruits, such as apples, oranges, bananas, [and] pineapples.

He called her, emailed her, texted her, tweeted her—all to no use.   Strictly speaking, I would need to write texted her and tweeted her, but I'm omitting and to convey a rhythm and sense of urgency. What do you call this kind of construction, and is it accepted grammar (at least for creative writing, if not in an academic context)?


I'm trying to create a program that removes a given character from an array and then prints out the new array and whenever I print it out I get weird results like [I@120acab  public static int[] removeVal(int[] numArray, int val) {     int purge = 0;     int keep = 1;     int arrayVal = 0;     for (int item : numArray)     {         if(item == val)         purge = purge + 1;         else         keep = keep + 1;     }         int[] newArray = new int[keep];     for (int taco : numArray)     {         if(taco != val)             newArray[arrayVal] = taco;             arrayVal = arrayVal + 1;     }     return newArray; }

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


In one English student's book i encountered the following sentence: "The weather was no obstacle to my expeditions."  As i understand the essential constrain is: [1] Subject + is + no + noun  Apparently it's a kind of negation. But i can't find any grammar rule for this constrain.  It's similar to "The weather was not an obstacle to my expeditions.": [2] Subject + is + not + a + noun  Or "The weather had no obstacle to my expeditions.": [3] Subject + has + no + noun  But seems it doesn't fit into them. What a grammar constrain is it? Which one of ([2] or [3]) constrains is it closer to?

I was thinking about these negations. Do these mean the same thing?     There is no point in ...   There is not a point in ...   or:     I have no clue   I do not have any clue     etc.


So on several websites, including phys.org and physics.stackexchange, I have read that photons do not experience time. And that if you travel at the speed of light, time and distance shrink to 0.  Is this really the case? Or is this simply one of those analogies gone wrong type thingy?  If this is the case, I have a couple of questions:   If light emitted from a star x lightyears away reaches earth, has it truly not experienced time, or any change?  Does this mean that from its point of view, as soon as it left x, the earth was already there? This seems very counterintuitive, since then for light the future is already set in stone, leading to a deterministic universe? What happens if at the time it leaves x, I put something in its path to earth? Yet before it reaches it, I put it away again. Will that object never have existed? How does it deal with the time it took me to put the obejct there and remove it?  Given 3, is there simply no space and time between begin and endpoint? Does it simply not exist between these points? Since speeds are relative, one could just as easily take a perspective that the photon is fixed in space and everything else is moving relative to it.. So where does from its perspective the earth get its energy from to attain this speed? What is a good book to read on relativity, or about the maths needed to understand this? Because I get a feeling it's always the case that the explanations are faulty when there was no math involved. Can we even take the reference frame of a photon? Because since it appears if we can it would lead to all these problems above, so I'm guessing for some reason we can't? If so, why not?   Feel free to answer one, multiple or all questions. I'm not afraid of math although my understanding is lacking, so explanations in that regard would be much appreciated. :)  Bonus question (really out there and more philosophical what-if than semi-serious pondering): 8. If all reference frames are equally valid (perhaps not the photon), and assuming spacetime is grainy at the planck scale, could this not lead to an apparent continuous spacetime since all dilations and contractions would be equally valid? In a sort of integer to rational numbers type difference?

To an an external observer it appears that time has stopped for photon. But this relation is reflexive, so for an observer travelling with the photon it appears the universe has stopped everywhere.  Is this right?  Space also gets distorted parallel to the direction of motion, but not perpendicular to it.   Does this mean that for an observer travelling with a photon sees spacetime as a flat plane?  Note 1: I'm using language vividly not literally when I say a photon experiences space and time. Not that I'm against idealist or panpyschist interpretations of matter or energy come to that.  Note 2: Since it's been pointed out that an inertial frame can't be boosted into the frame of a photon and moreover there is no limiting behaviour here - no matter what frame you are boosted into, light will always appear to travel at c. Nevertheless, when an external observer watches a train chasing a photon by gradually increasing its speed, he will note that the train speed is approaching the speed of the photon (but will never match it) and when he looks at the clock inside the train he will not too that it is gradually slowing down (but never actually stops). Using this picture, we can attempt the thought experiment - if not one that can be carried out - of what a world looks like to a photon.


The Internet is not working on my new HP Pavilion laptop (machine A). From what I read, I might be able to cure the problem by installing some extra packages on A. I'm now running on Machine B. On B I can do apt-get install blah. So how would I obtain and install blah on A, presumably using a memory stick to transfer it from B? Edit: My response to the ccomment below, the ifconfig output is: eth0 Link encap:Ethernet HWaddr 48:ba:4e:52:aa:7f UP BROADCAST MULTICAST MTU:1500 Metric:1 RX packets:0 errors:0 dropped:0 overruns:0 frame:0 TX packets:0 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:1000 RX bytes:0 (0.0 B) TX bytes:0 (0.0 B)  lo Link encap:Local Loopback inet addr:127.0.0.1 Mask:255.0.0.0 inet6 addr: ::1/128 Scope:Host UP LOOPBACK RUNNING MTU:65536 Metric:1 RX packets:181 errors:0 dropped:0 overruns:0 frame:0 TX packets:181 errors:0 dropped:0 overruns:0 carrier:0 collisions:0  txqueuelen:1 RX bytes:12784 (12.7 KB) TX bytes:12784 (12.7 KB)  I've learned that on my machine, neither wireless nor wired works on Kubuntu 14.04.5. But on 16.04, wireless works but wired does not. From poking around I've learned that the problem has to do with the Realtek drivers, which probably need to be replaced. (I want to run 14.04.5, not 16.04; in brief, the reason for that is that 14.04 is the last version of Kubuntu that supports different wallpaper on different desktops.) Atleast I've ascertained that I don't have a hardware problem. Finding and installing the corrected Realtek drivers is a challenge by itself, but at least I have a path for installing them (I think).

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


I have a Blender project set to denoise images rendered in Source Filmmaker. It actually does de-noise the images correctly, but the problem is that the setup and output is confusing. Regarding the setup in the compositor, let's say I have SFM render images 0-1999 (SFM output starts at frame 0), does that mean that the start frame when using the image sequence in the compositor is 1 and the end is 2000? Regarding the output, I noticed Blender starts at frame 1, but I want it to map the first frame to frame 0 since Source Filmmaker starts at frame 0 to avoid confusion with the output file names between both programs. How can I do this?

I want to subtract the current frame from a previous frame, I have a image sequence and I want blender to subtract the current frame from the frame with an offset of -4. If I am on frame 5 so blender will subtract and use frame 1.


I want to have a general solution for calculating orbits. Wikipedia says how to put object on circle orbit. We must give it speed $v_1 = \sqrt{g(h_o +R)}  $ Where $h_o$ - is the orbit height, and $R$ - Earth radius.  But how to calculate the speed that the object must have, if we want to place it in an elliptical orbit?  For example:   Having massive massive spherical object with mass $M$ and radius $R$.   which speed $V$ we must to give to this object to put it on elliptical orbit with eccentricity $\epsilon = E$ , and perihelium $P$?

I would like to show that a particle orbiting another will follow the trajectory   \begin{equation} r = \frac{a(1-e^2)}{1 + e \cos(\theta)}. \end{equation}  I would like to do this with minimal assumptions. Any pointers? I've read that this is nothing but the equation for an ellipse, as defined from the focus of the ellipse. But I'm not satisfied in just taking the result, I mean why should I assume that orbits are elliptical? I guess it should be derivable from energy and angular momentum considerations...


I have tried some other questions about extending root partitions but they haven't worked for me. Is there any possible way that I can shrink my home partition and extend my root partition with the extra free space?

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


I was working on a model and this started happening to it I don't know how to fix it Thanks  Nano

I am relatively new to Blender so please excuse me if this is rather amateur!   The bottom of my torus has poor surface quality, I have scaled the vertices down for a smaller (variable) tubular radius all the way around the torus and at the bottom the surface quality is awful, with inaccurate shading. Any ideas as to what is wrong and/or how I could fix this?  Thanks, itsanate


I had ubuntu 14.04.2 LTS installed in dual boot with windows 8 with grub2 as boot manager. The problem arose when the updated windows 8 for windows 8.1, now grub is no longer displayed when starting and windows 8.1 is loaded automatically. To be able to access the grub, it is necessary that when the notebook is booting, press F12 (bios boot options), there is listed, among other things, Windows 8.1 and Ubuntu, only when I select Ubuntu grub2 screen appears showing the option to select: Windows OS loader, Ubuntu, Ubuntu and advanced options. So, I wonder what to do to start to load the grub screen automatically.  Thanks for any help!

I installed Windows 7, which ate Ubuntu's boot file. When starting up the computer, it now goes straight to Windows, without giving me the option of booting Ubuntu.   How can I get Ubuntu back?


I'm trying to implement SMTP in my app. The code should work but it does not. the user and pass are valid and for testing purposes only.  I've tried everything. Set the port to 25, 465 everything..  using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; using System.Net; using System.Net.Mail;   namespace Email {     public partial class Form1 : Form     {         public Form1()         {             InitializeComponent();         }          private void Label2_Click(object sender, EventArgs e)         {          }          private void Form1_Load(object sender, EventArgs e)         {          }          private void Button1_Click(object sender, EventArgs e)         {              var smtp = new SmtpClient             {                 Host = "smtp.gmail.com",                 Port = 587,                 EnableSsl = true,                 DeliveryMethod = SmtpDeliveryMethod.Network,                 UseDefaultCredentials = false,                 Credentials = new NetworkCredential("test1020dassf5@gmail.com", "KDO30VMjkd03JM0j")             };             MailMessage msg = new MailMessage("test1020dassf5@gmail.com", "test1020dassf5@gmail.com", textBox1.Text, textBox2.Text);             {                 smtp.Send(msg);             }         }     } }    It gives me the error:   System.Net.Mail.SmtpException: The SMTP server requires a secure connection or the client was not authenticated. The server response was: 5.5.1 Authentication Required. Learn more at    at System.Net.Mail.MailCommand.CheckResponse(SmtpStatusCode statusCode, String response)    at System.Net.Mail.MailCommand.Send(SmtpConnection conn, Byte[] command, MailAddress from, Boolean allowUnicode)    at System.Net.Mail.SmtpTransport.SendMail(MailAddress sender, MailAddressCollection recipients, String deliveryNotify, Boolean allowUnicode, SmtpFailedRecipientException& exception)    at System.Net.Mail.SmtpClient.Send(MailMessage message)

Instead of relying on my host to send an email, I was thinking of sending the email messages using my Gmail account. The emails are personalized emails to the bands I play on my show.   Is it possible to do it?


I have a dual boot system and an empty hard drive. I want to access this drive from both systems. How can I achieve this?

This is not a question on  or  but is a question on access rights and how not to let them bite you in the lower abdomen...  ;-) This question will not help you how to make partitions on your disk, but will tell you what to do in , depending on your personal use case, so choose one of the following:      Note: The above questions can also be used with multiple disks, but the examples in the answers are given for one disk.


I read that I can use \int_a^b or \int\limits_a^b. With \limits, the equation looks more compact horizontally, but a little bigger vertically.  Is there some design rule to it, or just personal preference?


I want to switch from Ubuntu 16.04 to Fedora 27, so I made a bootable USB, but it always shows the error in the title.  I tried for hours to solve it, also installed intel-microcode, but nothing seem to work.  Does someone have an idea?  Thanks

I am having problems booting my Ubuntu after an attempted hardware fix today. My laptop was working fine but had some minor issues, so we tried a different motherboard, which had a major issue, so we changed it back to the original board. However, now I have problem booting.  The title pretty much says it all. I am using Ubuntu 16.04, but on boot, I get:  [    0:000000] [Firmware Bug]: TSC_DEADLINE disabled due to Errata; please update microcode to version: 0x52 (or later)   and I am now stuck at the BusyBox (initramfs).  Does anyone know how to fix this issue? I am not so familiar with bash or initramfs, so I would appreciate a detailed step-to-step guide if possible.


I have seen some of our competitors using keyword-rich CSS class names. As an example, if I were in the pet grooming business, I would name my #menu as:   #menu.pet.grooming.moreKeywords.etc { ... }   Does this have any effect on SEO? If so, what is the best practice?

I am a big fan of minifying everything whenever possible. It is a sin for me to don't do this.  However, I recently read that one of the thousands tips to boost your website rank on search engines was to:     give you content context with good class and id name in your HTML     I always change id and class names to one or two character length...  Is not that I don't believe what that guy said, but I really need some confirmation on this. For me it doesn't make sense why would that matter.   Is that point correct? (in case it is) Why?


Assume that we have a $n$-dimensional vector that shows the position of a point and two multivariate normal distributions with means $\mu_1$ and $\mu_2$, and covariances $cov_1$ and $cov_2$.  I’m trying to find a formula to calculate the subtraction of the distance between that point and each of those multivariate normal distributions.   Or if let me know how can I have subtraction of two different multivariate normal distribution.   I'd be really thankful if someone explain it for me.

Assume you are given two objects whose exact locations are unknown, but are distributed according to normal distributions with known parameters (e.g. $a \sim N(m, s)$ and $b \sim N(v, t))$. We can assume these are both bivariate normals, such that the positions are described by a distribution over $(x,y)$ coordinates (i.e. $m$ and $v$ are vectors containing the expected $(x,y)$ coordinates for $a$ and $b$ respectively). We will also assume the objects are independent.  Does anyone know if the distribution of the squared Euclidean distance between these two objects is a known parametric distribution? Or how to derive the PDF / CDF for this function analytically?


Setup I have multiple sites that are very similar and therefore share the same code base. I have a custom module common with functionality common to all sites. Then for each site I have a specific module site_a, site_b etc where site specific code resides. I want to create custom services such that common has a default implementation that site_a can override if necessary. Specific use case On user creation, for example, the different sites need to run mostly the same routines, but not entirely. In this case I would place each specific routine as methods in Drupal\common\Service\UserCreationService.php and call them one at a time from hook_user_insert(): $user_creation_service = \Drupal::service('my_module.user_creation_service'); $user_insert_service->routine_1(); $user_insert_service->routine_2(); // etc  If site A needs a different routine I would let Drupal\site_a\Service\UserCreationService.php extend Drupal\common\Service\UserCreationService.php and replace the relevant method. Of course this functionality could easily be achieved by simply reimplementing the same hook in site_a, but I find the service method much clearer and with less boilerplate. Minimal example There are two ways to override services as far as I can tell from . One is to implement the MyModuleServiceProvider::alter(), another (for core services) is to specify (an override for) the service in my_module.services.yml. The second method seems to also work for custom services, which is was prompted this question. Consider this example: # File: modules/common/common.services.yml services:   common.test_service:     class: Drupal\common\Service\TestService  // File: modules/common/src/Service/TestService.php namespace Drupal\common\Service;  class TestService {   public function sayMyName() {     return 'common';   } }  # File: modules/site_a/site_a.services.yml services:   common.test_service:     class: Drupal\site_a\Service\TestService  // File: modules/site_a/src/Service/TestService.php namespace Drupal\site_a\Service;  class TestService extends \Drupal\common\Service\TestService {   public function sayMyName() {     return 'site_a';   } }  Now echo \Drupal::service('common.test_service')->sayMyName() outputs 'common' when site_a is uninstalled and outputs 'site_a' when site_a is installed - exactly as wanted! But it seems a bit flaky, as the linked documentation says:  If multiple modules swap the same service, then neither module can predict if their swapped service will win eventually.  This should not be a problem because I define a service in one module and override it in another (even though in this example I do it in the services.yml file). But I don't completely trust that this is just a lucky coincidence when the services share the same name. I would much prefer if I could explicitly set the hierarchy and specify that the service i site_a overrides a service from common, but this does not seem to be possible. Question How can I be absolutely sure that it's the service from site_a that is fetched from the service container and not the one from common? Do I have to use MyModuleServiceProvider::alter() instead of the services.yml file, and even then can I make sure that everything works? Bonus question: Is this best practice, or should I be doing something else?

It is noted that modules implementing ServiceProviderBase to alter defined services can 'lose' to other modules overriding the same service as there is no way to know which one should overtake in that situation.  Is this 'fixable' by making your modules weight higher than the others?


This is a question thats been bothering me a while. I don't even know if it makes sense or not (like if it is a physics question or becoming a philosophical one). But here it goes. The crux of my question basically is that we all know that we can't see light (like in its photon or electromagnetic wave form) directly when it is traveling past us. However, we also know that the way we see objects is by light reflecting off them. This then means that we are "seeing" the light reflecting from the object which then sends the signal to our brain saying that we are seeing a particular object. We know that both light traveling past us and light reflected from objects are made of photons (so they are the same kind)? So then my question is that what is happening to the photon of a light after it is reflected from the objects, that causes us to see it or the object, but on the other hand we can't see light as it is directly traveling past us.

Let's say we have a cloud of dust which is a lightyear across and someone shoots a beam of light from point A to B , why it is not possible for an observer far far away to see the light while it travels through the cloud at the speed of light?


My software sources are selected to an old version of ubuntu while installing the adobe reader and im using ubuntu 14.04 LTS.now i am getting a notification in the above system tray that says "The update information is outdated.This may be caused by network problems or by the repositary that is no longer available.............." and i am getting the following errors in sudo apt-get update W: Failed to fetch   404  Not Found  W: Failed to fetch   404  Not Found unfortunately i cant post more than 2 links I want to fix this the other questions related to mine...doesn't really solved my problem

Possible Duplicate:          I had a little problem with the sources of my update, I'm running Ubuntu Natty Narwhal and I was tinkering with binaries for installing a Firefox add-on called fire sheep and I think that some how my update sources were altered and evertime I try to upate I get this error message  An unresolvable problem occurred while initializing the package information.  Please report this bug against the 'update-manager' package and include the following error message:  'E:Type 'See' is not known on line 2 in source list /etc/apt/sources.list'


In 2016 I did a summer internship at a technology firm in California. Came from Europe on a J1 visa. Filed a 1040NR-EZ, and got a tax refund in 2017.  Now, as I understand, state tax refund is taxable income if I used "Itemized Deductions" which I believe I did. So, it seems that my US income for 2017 totals to less than 2k$.  I read that below a certain amount one generally is not obliged to file a return, as they would not owe any tax anyway.  My question is: is the above reasoning correct (especially considering my status as a non-resident alien), and I simply don't have to do anything?  Additional details: in 2016 on 1040NR-EZ I entered my state tax on the line 11 (Itemized Deductions), and so it decreased my taxable income on that form, I assumed that what it means to itemize. Then I got tax refunds for both state and federal taxes. I don't think I "deducted the amount being returned" on any US form, that would be weird as I were filing them before the actual refunds, right?

I am from Europe, and I did an internship in the US (California) in 2015. When filing my 2015 taxes, I ended up having to pay some small difference for the federal taxes, but got a refund on my state taxes, of roughly $1.6k. That was all the income I had in the US in 2016.  I did not enter the US in 2016 at all.  I managed to figure out that I don't need to file any California tax forms for 2016 (source: ) but I am not sure about federal taxes.  I tried researching the problem, and got some information on it, but the situation is still a bit unclear. It seems that since I listed my state tax as an itemized deduction in my 2015 tax report, which I filed in 2016, the state refund I got in 2016 is, in fact, taxable.  In this situation, would I have to file my taxes (and possibly pay owed tax) for 2016, even though I never set foot in the US in that year, and my total income is just $1.6k?


Someone asked a question in an email addressing a group (3 people). We had to respond in the negative. I am not clear on if this sentence is grammatically correct. The response I sent was:  A, B and I have not done it.   Now, logically if I use and, it sounds incorrect because I should be using an or to represent the fact that none of us have done it. For example, if it was two people, I would probably just say:  Neither A nor I have done it.   Instead of,  A and I have not done it.   So my question is:   Is there a way to write sentence 1 in the same way as sentence 2? Is sentence 1 grammatically correct?

Given two options, we can use 'either and 'neither' to show no preference.  Do you want to watch A or B Neither, I don't like either.  The only option I can see for more than two options is: 'any' and 'none'  Do you want to watch A, B, C ... ? None, I don't like any.  Actual Question: Is there, or has there ever been a word to show no preference for 3 options?  More Information Sometimes we have an extra, sometimes uncommon, option for a 3-type question. This question is searching for a similar option for "either"  How many times have you eaten sushi? Thrice    What is your phone number? Oh, seven, double five, treble zero    9 is triple 3


I believe it is false, because an injective function never maps elements of the domain to the same element of its codomain, where as the surjective function can map an element of the codomain to any element in the domain.  I have some other explanations but they make little sense and are very messy, like this, can someone write a better explanation, or correct me entirely if I am wrong?

Is it true that for each set $M$ a given injective function $f: M \rightarrow M$ is surjective, too?  Can someone explain why it is true or not and give an example?


Let $f$ be a holomorphic function in $\mathbb{C}$. Prove that if $f$ is real when $|z|=1$, then $f$ must be a constant function.  I honestly do not know how to do this problem, consider using Schwarz's lemma, but do not get anywhere.

Let $f(z)$ be entire function. Consider the functions $e^{if(z)}$ and $e^{−if(z)}$ and applying the Maximum Modulus Theorem, show that if $f(z)$ is real when $|z| = 1$, then $f(z)$ must be a constant function.  (We take $f(z)=u(z)+iv(z)$)  I am confused as so far I have $|g(z)|=|e^{if(z)}|=|e^{-v(z)}|$ and then since $f(z)$ is real, $f(z)=u(z)$ and $v(z)=0$ so I assumed it would follow that $|g(z)|=|e^{v(z)}|=1$.  Similarly, $|g(z)|=|e^{-if(z)}|=|e^{v(z)}|=1$.  Using Liouville I assumed one could say that both $g(z)$ and $h(z)$ are bounded entire functions, they are constant and so it follows that $v(z)$ is constant, meaning that both its partial derivatives are equal to 0 and, due to Cauchy Riemann, both of the partial derivatives of $u(z)$ are equal to zero.  It would then follow that $f(z)$ is constant.  I don't know how to go about the question using the Maximum Modulus Theorem, also I feel I am overlooking the importance of $|z|=1$ perhaps?  Any help would be much appreciated!!


I have a , and the SD card is automatically mounted when the UI is visible. The problem is when I log in to the TX2 without GUI (Graphic User Interface), via SSH it doesn't read SD cards.  I watched /dev/ path, and I can't see the SD card device. So I think for some reason the SD card is not read when I disable the GUI. I tried using lsblkand fdisk -l but the device is not shown.

My computer has an SD card slot. When I put a working SD card into the slot, nothing happens. When I put a CD or DVD in, or plug in a USB drive, the medium is mounted and available. Is there something special I need to do for SD cards?  Hardware specifics  I am running 11.10 on a Dell XPS L502X. The card slot is marked "SDXC/MMC - MS/Pro" (which Wikipedia tells me are various SD card types).


Why is a predictive distribution wider than a mean response distribution?

For a prediction interval in linear regression you still use $\hat{E}[Y|x] = \hat{\beta_0}+\hat{\beta}_{1}x$ to generate the interval. You also use this to generate a confidence interval of $E[Y|x_0]$. What's the difference between the two?


I'm developing a plugin system, which of course needs to include the plugin files. So far everything works very well - exceptions get catched etc.  But my very last wish would be to even be safe from corrupt plugin files containing syntax errors. Is there a way to catch Fatal Errors in included files?

I can use set_error_handler() to catch most PHP errors, but it doesn't work for fatal (E_ERROR) errors, such as calling a function that doesn't exist. Is there another way to catch these errors?  I am trying to call mail() for all errors and am running PHP 5.2.3.


I remember from the show that the kids are live actors that are transported into another world where they use CGI for that side, or at least I think it is CGI. It is not Code Lyoko or ReBoot: The Guardian Code, but it is like those shows. Another thing I remember from the show is a red wheel on a pipe that I think has some importance in going to the other world.

I've been trying to remember this live action TV show for years now.  In it teenagers were able to enter this virtual world of sorts and they become these avatars. Their goal was to clear levels and move on to the next and I don't remember why. There were artifacts or items that help them on their way and they can return to the real world easily enough. I think they can re-enter the virtual world through someone's school.  To pinpoint a possible date I'm thinking maybe 2000s to 2004s, it is hard to remember because I was so young.


I was wondering if the integral of $\sin\left(\int(\sin(x)dx\right)$ is equivalent to 0, if it had an answer, or if there was simply no answer?

Since I started more or less formally learning the foundations of calculus, I naturally came across the Riemann definition of the integral. At first I considered this definition intuitive but not really useful since to obtain a closed form expression, one needed to add an infinite amount of values. Later on, an exercise prompted me to calculate a Riemann Integral, and from the definition and the expression for the sum of squares, I was able to calculate the limit with nothing more than I had learned at school.  This was a revelation for me, since so far I had considered the definition a mere formalism. Now I knew how it gave results. The next integral I tried to calculate this way was, for obvious reasons $\sqrt {1-x^2}$. Unfortunately, I found the sum intractable and gave up.  I started to question the usefulness of the definition again. If it only works for simple functions like polynomials, how did we ever find out that the integral of $\sin (x)$ is $-\cos (x)$? Did we use the Riemann definition or did we just say "the derivative of $-\cos (x)$ is $\sin (x)$ and therefore its integral must be $-\cos (x)$?  I would like to get some insight into the theory as well as the history that led to the tables of integrals we have today


Find $(p,x,y)$, where $p$ is prime and $x,y$ natural numbers, such that: $p+1=2x^2$ $p^2+1=2y^2$ A solution to this problem is $(7,2,5)$ and I tried to show that it is the only one, but I didn't get far. Can anyone help?

$$p+1=2n^2$$$$p^2+1=2m^2$$ Find positive integers $m,n$ and prime $p$ satisfying the above two equations.   What would people commonly do?  Subtracting both the equations.  You get:   $$p(p-1)=2(m-n)(m+n)$$  If you notice carefully, the above equation has infinitely many solutions, and this doesn't work because the generality of the equation is lost when you subtract both of them.  I noticed that $p \equiv -1 \pmod 8$. $p=7$ works fine. I don't see any other solution, but not able to contradict of existence.


My understanding is that when a user has 200 rep on an account, any accounts they have/subsequently create get a 100 rep bonus.  What are the ramifications if the account with over 200 rep then drops below 200 rep?

I recently hit 200 rep on Stack Overflow and got a big 100 rep bonus. Most know this as the 'association bonus'.  If I offer a bounty of 50 points and thereby lessen my 'base' score, do I lose that association bonus?  What if I offer a 150 point bounty and then work my way back to 200?


I just read on wikipedia that the the complex projective line is homeomorphic to the riemann sphere. How do I prove this? But, before that I have an extremely silly doubt that has been eating me. In the complex projective line, antipodal points are identified, but in the Riemann sphere they are clearly distinct. Then how can the two be homeomorphic.   I found out the following map from the complex projective line to $S^2$. But how do I prove this is a homeomorphism? Finding the inverse of this functions seems complicated, and then how do I prove that the inverse map of a open subset is a open subset, and vice versa?  $f:\mathbb{C}\mathbb{P}^1 \to S^2 = [z:w] \to \frac{(2Re(w\bar{z}), 2Im(w\bar{z}),|w|^2-|z|^2)}{(|w|^2+|z|^2)} $

Endow $S^3$ with its standard smooth structures from the stereographic projections, i.e. $$\chi_1:S^3 \setminus \{(0,0,0,1) \} \to \mathbb{R}^3, \chi(x,y,z,t) = \frac{1}{1-t}(x,y,z) $$ and $$\chi_2: S^3 \setminus \{(0,0,0,-1) \}   \to \mathbb{R}^3, \chi_2(x,y,z,t) = \frac{1}{1+t}(x,y,z).$$   Do the same for $S^2$, call the charts $\eta_1, \eta_2$ (in the same order as the ones for $S^3$). Now, consider the complex projective space $\mathbb{C} \mathbb{P}^1$ endowed with the smooth structure given by the charts $\{(U_0, \varphi_0), (U_1, \varphi_1)\},$ $$U_0 = \{[z_0:z_1] \ \mid \ z_0 \neq 0 \} \text{ and } U_1 = \{[z_0: z_1] \ \mid \ z_1 \neq 0 \},$$ where $[x:y]$ represents the complex line through the point $(x,y)$ and $0$ in $\mathbb{C}^2$, and $$\varphi_0([z_0: z_1]) = \frac{z_1}{z_0} \text{ and } \varphi_1([z_0: z_1]) = \frac{z_0}{z_1}. $$   Now define the Hopf maps: $$h: S^3 \to S^2, h(x,y,z,t) = (x^2+y^2-z^2-t^2, 2(yz-xt), 2(xz+yt)) $$ and $$H:S^3 \to \mathbb{C} \mathbb{P}^1, H(x,y,z,t) = [(x+iy):(z+it)]. $$  Is there an easier way to prove that $h$ is a well-defined smooth submersion and that $H$ is a smooth submersion (with respect to the respective smooth structures)? By this I mean we can of course compute $\eta_i \circ h \circ \chi_j^{-1}, \forall i,j \in \{1,2 \}$ and $\varphi_k \circ H \circ \chi_l^{-1}, \forall k,l \in \{1,2 \}$ and prove that they are smooth (in the classical real-analysis sense) and that they are submersions, but this is a very tedious process. So, are there easier ways to do this? Will this maybe be easier if we switch the smooth structure of the unit spheres from stereographic projections to, say, normal projections (though we increase the number of combinations of charts to verify from 4 to 48), since they induce the same smooth structure?


How can I convert 14/Jul/2015 into 14-08-2015?   It is saying invalid date format because of the Jul element, but if I put 07 then it works fine.  I have tried this:  echo "Please enter the date: " read X (here X is 14/Jul/2015) a= date --date=$X '+%d-%b-%y' echo "$a"

I want to validate the below date format in shell script   2015-Jul-13   I'm using date -d "2015-Jul-13" +"%Y-%b-%d" but its giving error as  date: invalid date '2015-Jul-13'


I recently bought Asus X53E a few weeks ago and I have a third party charger which I bought a few months ago.  Can I use the third party charger on my laptop?  My Asus charger says  100-240V 1.5A INPUT 19V 3.42A OUTPUT  And then the third party does say the exact same words,  and I can plug the third party charger onto my laptop perfectly as well.  Here is the photo of the two chargers.

I have a Toshiba Satellite laptop. My charger has stopped working.  I have access to a Lenovo charger. Can I use this charger on my laptop?


I'm writing a document which I want to split into several chapters, each chapter in its own .tex file.  My main document has the preamble and I use \include commands to include each chapter.  My question is, when I'm working on the chapter, say, ch1.tex, is it possible to compile ch1.tex so I can see the output and continue working on it that way until I'm done with it?  As I understand it, ch1 should have no preamble, right?  Would I have to make a common preamble file so that I can \include it in each chapter when I work on it, compile as necessary, and then comment it out when I'm ready to put the entire document together including all chapters?  My apologies if this question is confusing, or if it has been answered before.  EDIT: Per request of comments below, the editor I'm using is TeXShop on Mac OS X Yosemite

My problem is that I want to have different .tex files for the preamble, the presentation aroundings (my target is a beamer PDF file) and the content of the presentation.  Mostly I'll be working on the content file. I even think about partitioning this content .tex file into several chapter files for a better overview. My problem with this solution is that I have to open the presentation.tex file to typeset the whole beamer PDF for looking at the results of my previous changes on the content files. (My presentation.tex file includes the preamble and the content.)  Is there any way to get TeXShop to always typeset one particular file (my presentation.tex) although I'm currently working on a different one (e.g. the content.tex)?  A shortcut? A command in the .tex file? An option in TeXShop? Anything?


This is the disk image. I have to merge unallocated partition of 200 GB with Ubuntu partition right next to it as I have to increase my Ubuntu size:    On right-click on dev/sda7 partition, free space preceding is greyed out:    How do I do that?  If I do the merge, will I lose my data on Ubuntu or windows?

Till today I was using ubuntu 13.04 in my windows7/ubuntu dual boot. Just now I have upgraded to ubuntu 14.04. My software updater showed an updates available message. I proceeded with  Install Now . Soon I got the following window.    Then I tried sudo apt-get clean as recommended. Nothing happened! Not even a window opened. Teach me deleting the temporary packages.   Deleting temporary files may not be highly helpful in case of further updates and installs for I don't have too much space left in my /. I wanna extend my / partition with the help of the unallocated space in my HD. The following is my Gparted window.       I got an answer . But it wasn't useful for me. I had two choices. But the answer wasn't working for both my chioces.  Choice 1: I may use the 4.25 GiB unallocated space to extend my /dev/sda10. To do so, I must need to move my linux-swap partition. But my Resize/Move option is disabled for the linux-swap partition. Choice 1 failed!   Choice 2: I may use the 14.35 GiB unallocated space instead. In this case I must move more than one partition. /dev/sda4  partition is the first on the list. Even that partition has the same problem. Resize/Move option is disabled. Choice 2 failed!  I am out of choices now.  What shall I do? Help me to extend my / with Gparted.


Is there a way to retrieve the query that was used to generate a PDO Prepared statement object?

Is there a way to get the raw SQL string executed when calling PDOStatement::execute() on a prepared statement? For debugging purposes this would be extremely useful.


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


I am using Ubuntu 14.04 and it seems that these packages are not installed. How can I install them as I need them for an application ?  Err  trusty/main i386 Packages   404  Not Found

PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown:  W: Failed to fetch http://ppa.launchpad.net/ 404  Not Found   How do I fix these errors?


I would like to change the pictures that appear behind the password login when I boot win 10. Where are they located and will deleting them and adding my own to that location give me the pics I want?

Hello today I just upgraded from 8.1 to windows 10, everything went fine but I'm stuck on a simple thing.  How on earth can I change this really bad blue background on the windows login screen right after the lock screen?  I've tried changing images in C:\Windows\Web\ directories but nothing changed.  That background is driving me nuts...  UPDATE  So far the only thing that helps me get ird of the image is this (I'm posting the contents of a .reg file):  Windows Registry Editor Version 5.00  ; Created by: Shawn Brink ; http://www.tenforums.com ; Tutorial: http://www.tenforums.com/tutorials/9108-sign-screen-background-image-enable-disable-windows-10-a.html   [HKEY_LOCAL_MACHINE\SOFTWARE\Policies\Microsoft\Windows\System] "DisableLogonBackgroundImage"=dword:00000001


If $G$ is a group of order $p^2$ with $p$ a prime number then $G \simeq C_{p^2}$ or $G \simeq C_p \times C_p$  Here's my attempt  We have $|G| = p^2$, Therefore, $o(g)= 1$ or $p$ or $p^2 \forall g$ where $o(g)$ denotes the order of the element of $g \in G$  Let's differentiate the $3$ cases.   If $o(g)= 1$ then $g=e$ by unicity of the identity of G If $o(g) = p^2$ then $\langle g\rangle = G \implies G \simeq C_p^2$ Now it's obvious that I have to show that if $o(g)= p$ then $G \simeq C_p \times C_p$ But I'm not sure how to do that.

Given $|G|=p^2$ then how can you deduce $G\cong C_{p^2}$ or $G \cong C_p \times C_p$  I have shown that G is abelian, not sure what to do next


Hello everyone. I have been seeing tiny critters like this one in bed and I started to worryif they are bed bugs. Although they seem different in appearance as well as the fact that they don't seem to bite, I wanted to be sure. Sorry if the pic is a bit hazy, they are only about 1mm long. I also did have a bit of a humidity issue since the roof was leaky.  Does anyone know how to get rid of them. I tried different insecticides around the bed and on wooden part of the bed but nothing works. Could they have settled in my new mattress? :(

I have a large wooden cutting board which is used in my kitchen mainly for preparing egg pasta. The wood type is Populus (poplar or aspen or cottonwood).  The main ingredients used with the cutting board are: flour (mainly soft wheat flour), hens' eggs, white sugar, butter, and baking powder.  After the food preparation, the cutting board is cleaned by scraping away the ingredients remains.  The board has some cracks and some small unknown insects are living inside the cracks.   The board has also a lot of holes due to woodboring beetles but I think the woodworms operated long time ago and they no longer live in the cutting board.  The unknown insect has an approximate length of 1 mm (along the direction of their movements) and a width of 0.3 mm. The unknown insects do not have wings, they just walk. I am not able to see how many pairs of legs they have.  The color of the insect is pale brown.  The cutting board was free from these unknown insects some months ago but then they appeared.  My questions:   What insects are they? Are these insects poisonous to humans? How can I get rid of them?   Update  The unknown insects could be Acarus siro, I will try to get a picture of the insects.  Update 2  Here is a picture. The bottom part of the image is a one Euro coin, the top part of the image is a caliper (each bright area is one mm tick).   Some more pictures:


I recently came across some C++ Code that is supposed to illustrate the many different types of errors that are possible to be caught in valgrind, gdb, insure, and such...  One of the examples is as follows:  // ============================================================================= // A base class without a virtual destructor class Base {     public:         ~Base() { std::cout << "Base" << std::endl; } };  // Derived should not be deleted through Base* class Derived : public Base {     public:         ~Derived() { std::cout << "Derived" << std::endl; } };  // A class that isn't Base class NotBase {     public:         ~NotBase() { std::cout << "NotBase" << std::endl; } };  // ============================================================================= // Wrong delete is called. Should call ~Base, then // delete[] buf void placement_new() {     char* buf = new char[sizeof(Base)];     Base* p = new(buf) Base;     delete p; }   My question pertains to the line:  Base* p = new(buf) Base;   I have never seen this syntax before and after much Googling I am not sure what to even search for in finding an explanation.  Can anyone point me in the right direction? Much apologies if this is redundant or simple, but I'm very curious what is going on in this example.  Thank you.

Has anyone here ever used C++'s "placement new"? If so, what for? It looks to me like it would only be useful on memory-mapped hardware.


Here's the result what I need to get. These images will be used for js slide.

   So I used the code followed to render DOM. But it doesn't work correctly.      `<ul id="show" class="pic"> </ul>       `

I want to make a JavaScript application that's not open source, and thus I wish to learn how to can obfuscate my JS code? Is this possible?


From Royden & Fitzpatrick's Real Analysis, Problem 19 section 2.4:  "Let E have finite outer measure. Show that if E is not measurable, then there is an open set O containing E that has finite outer measure and for which  m*(O/E) > m*(O) - m*(E)."  My process goes like this:   1) m(E) is finite => E is bounded => There exists open set O containing E such that for all e1>0, m(O)-m(E)  2) E not measurable => there exists some e2>0 such that there exists an open set Q containing E and m(Q/E)>e2.   If I could somehow show that for the same e>0, Q=O then I would have the property immediately. But I cannot see any way that I can justify equating O with Q, and I do not see any other angle of approaching the problem, anyone can offer any hints or answers, I'd much appreciate it.

(1)  If $E$ is a subset of $\mathbb R$ with finite outer measure, i.e. $m^{*}(E) <\infty$; and   (2) $E$ is not Lebesgue measurable, i.e. there exists $F$ such that  $m^{*} (F) < m^{*}(EF) + m^{*}(FE^{c}).$  [Claim] There exists an open set $O\supset E$ with finite outer measure, such  that   $$m^{*}(O E^{c})  > m^{*} (O)  - m^{*} (E).$$  My  questions are the following.  (1) Is the above claim correct? I've seen this in Royden's book, but have a bit concern. Note that a set $E$ is Leb measurable if  it satisfies caratheodory condition: $m^{*} (F) = m^{*}(EF) + m^{*}(FE^{c})$ for  all subset $F$. If the claim is yes, it seems that measurability condition can  be reduced from all subset $F$ to Borel set $F$.  (2) If the claim is correct, a proof is needed.


Right now I have a network server that I frequently have to SSH into. Instead of typing:  ssh fox@192.168.2.24   I want to be able to say:  ssh fox@srv   And that it would SSH into the server at 192.168.2.24.  Is this possible, and if yes, how do I do that?

I have a few remote servers which I connect to through the terminal. The servers don't have a domain, only an IP address which is hard to remember when I got a few of them.  Is there a way to permanently store values in the terminal, so that I can do the following?  server1 = 111.222.111.222   And type commands like:  ssh root@server1   instead of:  ssh root@111.222.111.222


Given a list of integers, insert the operations $( ) +$ and $*$ to yield the maximum value.  Examples: $2$ $1$ $1$ $2$ is maximized with $(2 + 1)  * (2 + 1) = 9,$ and $1$ $1$ $1$ $1$ $1$ $1$ is maximized with $(1 + 1 + 1) * (1 + 1 + 1) = 9.$  Is there an algorithm that works every time to solve this problem?

Let $n>0$ be an integer. Consider all partitions of $n$, i.e. all possible ways of writing $n$ as a finite sum of positive integers,   $$n=n_1+n_2+\cdots+n_k.$$   What partition maximizes the product $n_1n_2\cdots n_k$?   Examples:   $2=2$ $3=3$ $4=2+2$ $5=3+2$ $6=3+3$ $7=3+2+2$ $8=3+3+2$ $9=3+3+3$ $10=3+2+2$ $20=3+3+3+3+3+3+2$ $30=3+3+3+3+3+3+3+3+3+3$ $40=3+3+3+3+3+3+3+3+3+3+3+3+2+2$ $50=3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+2$      Conjecture: It is the partition that has the maximum number of $3$'s among those consisting only of $3$'s and $2$'s.


I have a Centos7 server with nginx and google pagespeed. I wanted to clear pagespeed cache for a reason but i saw lots of chinese site caches in my pagespeed cache folder like baidu.com, ly.com, oray.com etc. and also there are folders like "rname", "prop_page". I have no idea how these folders created. I was getting brute force attacks from china to my SSH but they stopped when I changed the ssh port. What should I do now?  EDIT: I've found the answer here:

This is a  about Server Security - Responding to Breach Events (Hacking)   See Also:                  Canonical Version I suspect that one or more of my servers is compromised by a hacker, virus, or other mechanism:   What are my first steps? When I arrive on site should I disconnect the server, preserve "evidence", are there other initial considerations? How do I go about getting services back online? How do I prevent the same thing from happening immediately again? Are there best practices or methodologies for learning from this incident? If I wanted to put a Incident Response Plan together, where would I start? Should this be part of my Disaster Recovery or Business Continuity Planning?   Original Version       2011.01.02 - I'm on my way into work at 9.30 p.m. on a Sunday because our server has been compromised somehow and was resulting in a    attack on our provider. The servers access to the Internet   has been shut down which means over 5-600 of our clients sites are now   down. Now this could be an FTP hack, or some weakness in code   somewhere. I'm not sure till I get there.      How can I track this down quickly? We're in for a whole lot of   litigation if I don't get the server back up ASAP. Any help is   appreciated. We are running Open SUSE 11.0.            2011.01.03 - Thanks to everyone for your help. Luckily I WASN'T the only person responsible for this server, just the nearest. We managed   to resolve this problem, although it may not apply to many others in a   different situation. I'll detail what we did.      We unplugged the server from the net. It was performing (attempting to   perform) a Denial Of Service attack on another server in Indonesia,   and the guilty party was also based there.      We firstly tried to identify where on the server this was coming from,   considering we have over 500 sites on the server, we expected to be   moonlighting for some time. However, with SSH access still, we ran a   command to find all files edited or created in the time the attacks   started. Luckily, the offending file was created over the winter   holidays which meant that not many other files were created on the   server at that time.      We were then able to identify the offending file which was inside the   uploaded images folder within a  website.      After a short cigarette break we concluded that, due to the files   location, it must have been uploaded via a file upload facility that   was inadequetly secured. After some googling, we found that there was   a security vulnerability that allowed files to be uploaded, within the   ZenCart admin panel, for a picture for a record company. (The section   that it never really even used), posting this form just uploaded any   file, it did not check the extension of the file, and didn't even   check to see if the user was logged in.      This meant that any files could be uploaded, including a PHP file for   the attack. We secured the vulnerability with ZenCart on the infected   site, and removed the offending files.      The job was done, and I was home for 2 a.m.            The Moral   - Always apply security patches for ZenCart, or any other CMS system for that matter. As when security updates are released, the whole   world is made aware of the vulnerability.   - Always do backups, and backup your backups.   - Employ or arrange for someone that will be there in times like these. To prevent anyone from relying on a panicy post on Server   Fault.


OK, I just started playing Pokemon-Y. In PokemonAmie there are ways to increase the affection of your pokemon. Is this the same thing as Pokemon Happiness that is used for happiness evolutions?  If not, is there a character that tells you how happy your pokemon is?

I've risen Pokemon Amie Affection to 5 hearts on my Riolo in the hopes that it will evolve as soon as it levels up, but I'm not certain that this is the same thing as friendship, and I'd like to not waste a level.  My question is this: What is the difference between Pokemon Amie Affection and the Friendship stat?


In the following schematic the two Vss pins where are supposed to be the grounding pins don't connect to anything. Does this mean that the circuit is self-grounding (if that's even a thing)?  I'm planning on attaching this to a breadboard but I'm not sure how to power it since I don't have a direct connection to the TSL1402 ship and have to go through the accessible pins.  Here is the schematic:

I'm just a dabbler in electronic circuits and I'm really still kind of a noob. I am working on a project called the "Atari Punk Console" (Originally known as the "Stepped Tone Generator") but there are some parts of the wiring schematic that I don't understand, specifically the parts with the ground symbol.  Here is the schematic:   See those two ground symbols? I don't understand how to properly connect the circuit to ground at these points. How can I do this and be sure that I did it properly. I don't understand grounding at all so any pointers or clarification is also welcome. Thanks in advance.


So I need to make a code that opens a txt file, and then takes the content of that file and puts it into another txt file, problem is, I don't know how the command to extract the information from the file, I did some research and found this is the closest thing but It just isn't what I need:   this is my code so far:  myFile = open("Input.txt","wt") myFile.close() myFile = open("Output.txt","wt") myFile.close()

How do I copy a file in Python?  I couldn't find anything under .


There are $150$ switches. First, You turn on all $150$ switches.Next, you turn off the even indexes.Then you toggles every third index and turn it off if it is on or turn it on if it is off. After $150$th pass. in which you toggle only switch number $150$, how many switches are on?  I solved it "brut force" and I found that the answer is $75$ (correct me if I'm wrong)  But I'm looking for explanation "number theory" style.  Attempt:  $1.$ turn on all $150$ switches  $2.$ turn off all index $i=0\pmod 2$  $3.$ something $\pmod 3$

There are 1000 lockers in a high school with 1000 students.  The    problem begins with the first student opening all 1000 lockers; next    the second student closes lockers 2,4,6,8,10 and so on to locker 1000;   the third student changes the state (opens lockers closed, closes    lockers open) on lockers 3,6,9,12,15 and so on; the fourth student    changes the state of lockers 4,8,12,16 and so on. This goes on until    every student has had a turn.      How many lockers will be open at the end?   I worked out this problem by doing it for 10 lockers. The pattern was obvious (1,4,9 remained open).It's easy to then say that 31 lockers remain open at the end. I don't quite understand why only square numbers remain open at the end. Is there some deeper reason?