I'm using the above computer, and it still works reasonably well. There is one huge issue though - there seems to be some sort of current leak that prevents the trackpad from functioning correctly. To make it work properly, I have to 'ground' the chassis with one hand. When it's really bad, the whole computer 'hums' with current. Over time, the current seems to increase, leading to very little 'shocks' which feel like the hairs on my forearm are being pulled. It can be discharged by touching a conductive item, like my iPhone(!) or the radiator, but that really isn't ideal. I've put stacks of research into this, so I can tell you that I'm using the grounded (3 pin Uk) adaptor, both directly into the wall socket and/or into surge protector mains adapters, and both with the long lead and the plug that fits onto the line-lump - neither make a difference. It happens when I'm barefooted, when I have my trainers on, on wooden floors and carpeted floors. I've even tried placing both hands on the computer and jumping into the air so that there is no ground. There is no longer a battery attached - after the 2nd one expanded I decided not to buy another. I've read that prolonged use could lead to long-term health risks, but I can't afford to replace the computer, and besides, I've read that the issue is also common on newer Macs. Is there anything that can be done? All my research up to this point suggests that there isn't, but I'm hoping there's a Super User with a solution. Thanks for looking.


Is there an additional reward for completing all bounties in all acts in a single game?

Compared to, for example, completing 5 bounties in each of 5 different games.


Field of Fractions over Formal Power Series

I want to show that every element in the field of fractions of $K[[X]]$ can be written as $\sum_{k=-n}^\infty a_kX^k$ where $a_k\in K, n\in\mathbb{Z}$.  My first attempt was to rewrite  $\displaystyle \frac{\sum_{i=0}^\infty a_iX^i}{\sum_{j=0}^\infty b_jX^j}=\lim_{N\to \infty}\frac{\sum_{i=0}^N a_iX^i}{\sum_{j=0}^N b_jX^j}$  where I am not completely sure, if this is correct. I know that I can write an element of $R[[X]]$ where $R$ is a ring like this. Then I tried polynomial division and some similar things. Also I know that if $b_0$ would be not zero, I can invert the whole polynomial and arrive at the conclusion, even with $n=0$.   However, I was not able to progress from here.


Is it possible to use EXT4 partition in windows 10?

This may seem like a noob question, most probably because it is. I am currently on a dual-boot system with windows 10 and ubuntu 16.10. I am syncing github sources to my hard disk on ubuntu(for building roms). The sources are are 25gb and with crappy internet speeds, takes days for me and there are times when I have to use windows. So, is there any way I can view the partition in windows so that I can continue to sync the sources even when I'm using windows?  Thanks a lot for your help.


Calculating the distance between a set of UTM coordinates

I would like to calculate the distance between several GPS points, these data are projected into UTM Zone 30.  I am using Postgresql 9.3 but I am happy to see results with any software or website such as Microsoft Excel.  PS: This data is from Madrid (Spain)  Eg:               442778 (x) 4475112 (y)     442767(X)     4475268(y)


Is there a word for the opposite of an intended effect?

Is there a word in English connected to a process resulting in not just an unexpected outcome, but the direct opposite of its intended effect? Like feeling more tired after waking up? Or feeling dirtier after washing your hands (because the bathroom isn't clean)?  Example Sentence:     "I got 8 hours of sleep but I'm more tired than when I went to sleep.   That's so _____."


Paradox of language: smelly feet and runny nose

How come our nose run and our feet smell? What is the etymology of this paradox phrase?


I have been banned from asking questions on Stack Overflow, but after I read really much about this ban thing, it seems that this could be a bug. I have only one closed question, and a deleted one. Besides, I have more than 10 normal questions, and some upvoted. I really am in a struggle, because I read that I shouldn't just write to a moderator for such a small thing, and I don't want to get banned completely for doing so.   I know I should answer other questions, but I'm a beginner in programming.  EDIT: This question is not about asking how to get out of ban, this is about ban bugs and how to report them.


Is there a word or phrase for someone who tries to avoid hearing bad news?

Such as hearing about people's personal life problems or watching the news due to all the sad stories in it. Emphasis on the word avoid rather than just be "upset by".  I prefer not to talk politics or share my problems with people who are ____ because most people are empaths who end up feeling sad if they hear any topic of conversation they deem to be negative or unfortunate. It ruins their day, they become sadenned and they say it burdens them.  The words snowflake, empath of sensitive is not suitable.


Recently I bought a mountain bike with hydraulic disk brakes.  But when I ride it the front wheel makes screaming sounds, possibly from the disk brake.   I contacted my local dealer and they helped me adjusting the brakes, and I even learn how to do it also.   But it seems the problem happens more than once, every time after I put back the front wheel and start riding. The problem is frustrating; I need about 5 minutes to adjust the brake and tyres every time.   What can I do, should I replace anything?


How are these two exponential logarithmic equations equal?

How does following assertion hold? I have tried some real values but can anyone explain it to me mathematically/algebraically?  $$ a^{\log_{b}n} = n^{\log_{b}a} $$  I'm reading something that asserts this, but I do not see the connection. Any help would be appreciated.


Boot to black screen, nomodeset doesn't help

So, I just got a new lenovo Y510p with windows 8 on it by default. I had read up about UEFI and all that, and was ready to go when it arrived today. I first tried disabling UEFI so I could install 12.04 64 bit because I wanted a stable version. It was a black screen on the installer so I googled it and enabled nomodeset to fix the problem. 12.04 installed fine, but now when I try to boot normally its a black screen again. I assumed it was the same problem so I googled how to enable nomodeset outside of the installer. I found three methods people were saying,  that says to replace quiet splash with nomodeset in GRUB,  which seems to say to replace quiet splash with nomodeset and link it with $vt_handoff with an underscore, and  which shows adding nomodeset to the end of the linux /boot line. All of these methods I tried on 12.04 and 13.04 (with UEFI reenabled) to no avail. However, on two of the methods I did get a list of checks showing if different things pass or fail on which the "generic graphic drivers" or something along those lines showed a fail. Anything I can do here??


Stop terminal auto executing when pasting a command

Right, this is a slightly annoying feature because something this happens, and other times it doesn't, very odd.  I paste a command into the terminal with a view to tweaking its arguments, and sometimes it executes the second I paste it. Sometimes it doesn't.  This ranges from embarrassing ( posting nonsensical comments on an IRC ) to dangerous.   How can I shut this feature off for good? I never, never, never want the terminal to auto execute when I paste to it.


Dual boot system Windows 10 and Ubuntu 12.04

How to get the both of the systems to show correct time? As of now what I get is every time after using Ubuntu, Windows' time gets changed by +4 hrs. None of the solutions posted here are working.


Lagrangian density of a free electromagnetic field

How do you derive the result for the lagrangian density of a free electromagnetic field


In laymen's terms, as much as possible: What is the Riemann-Zeta function, and why does it come up so often with relation to prime numbers?


"ench" NBT tag doesn't work in Minecraft 1.13

I want to get a bow with a top-level Power enchantment. A command similar to this worked before:  /give @p minecraft:bow{ench:[{id:48,lvl:32767}]}   ...But not in 1.13. Changing the ID to power didn't work either:  /give @p minecraft:bow{ench:[{id:power,lvl:32767}]}   It just gave an ordinary, unenchanted bow. Quotes didn't change anything either:  /give @p minecraft:bow{ench:[{id:"power",lvl:32767}]}   I don't know what to do with the command format being changed in 1.13. Does anyone know how to fix the ench NBT tag?


We have a requirement to export the content and import into another org.  We used file exporter to export the content, but getting the below error: "A duplicate file name exists , or the file cannot be found"  all the files are exported but the size is 0.   Can anyone please suggest a better way to export the content and import it to another org.


So lets say I have a cube with length of 6 and I would like to slice it in 4 pieces, leaving me with 4 cubes with length of 1.5 each. I am aware that I can do that with knife tool, but how to slice cube in exact 4 pieces?  Is that possible with Blender?  UPDATE:  Slicing with Loop Cut and Slide as will work on normal cube, but in case geometry is a bit complex, it will not work.


Editing a chat message causing a new message to be posted

This has been happening regularly in the new mobile chat for a week or two:  If I send a message, tap it, edit it, and submit my edit, then instead of my post getting edited, a new message is sent with the edited version's text.


How to write subscript or superscript labels in QGIS 3.4?  Is there any function to do it without any external involvement like Character Map or etc?   I'm EXPLAINING that this is not a duplicate question and I want to use those scripts not only in MAP LAYOUT but everywhere!  For example like this below ▼


What is the difference between a static and a non-static initialization code block

My question is about one particular usage of static keyword. It is possible to use static keyword to cover a code block within a class which does not belong to any function. For example following code compiles:  public class Test {     private static final int a;         static {         a = 5;         doSomething(a);     }     private static int doSomething(int x) {         return (x+5);     } }   If you remove the static keyword it complains because the variable a is final. However it is possible to remove both final and static keywords and make it compile.   It is confusing for me in both ways. How am I supposed to have a code section that does not belong to any method? How is it possible to invoke it? In general, what is the purpose of this usage? Or better, where can I find documentation about this?


How is the lasso orthogonal design case solution derived?

In orthogonal design of lasso, we get  $\hat{\beta}_j^{\text{lasso}} = 0 \text{ if abs}(\hat{\beta}_j) \le \lambda /2$. WHY?   I've seen the answer and derived it myself, but don't know why.  We begin with definition of lasso, $$\hat{\beta}^{\text{lasso}} = \underset{x} {\arg\min}  \sum_{i=1}^{n} ( y_i - \sum_{j=1}^{p}\beta_{ij}x_{ij} )^2 + \lambda \sum_{j=1}^{p} |\beta_j|  $$  In orthogonal design case where $X^T X= I$, $\hat{\beta} = (X^TX)^{-1}X^{T}y = X^Ty$  \begin{align} L(\beta, \lambda) & = \sum_{i=1}^{n} ( y_i - \sum_{j=1}^{p}\beta_{ij}x_{ij} )^2 + \lambda \sum_{j=1}^{p} |\beta_j| \\  & = (Y - X \beta)^T(Y - X \beta) + \lambda \mathbf{I}_p \text{ abs}(\beta) \\  & = Y^TY -2\hat{\beta}^T\beta + \beta^T \beta+ \lambda \mathbf{I}_p \text{ abs}(\beta) \\  & = Y^TY + \sum_{j=1}^{p} L_j(\beta_j, \lambda) \end{align}  where $L_j(\beta_j, \lambda) = -2 \hat{\beta}_j \beta_j + 2\beta^2_j + \lambda \text{ abs}(\beta_j)$.  Leave aside $\beta_j=0$, take dereivative w.r.t. $\beta_j$ for abs$(\beta_j) > 0$, $$\frac{L_j(\beta_j, \lambda)}{\partial \beta_j}  = -2 \hat{\beta}_j + 2\beta_j + \lambda \text{ sign}(\beta_j)$$  and $\hat{\beta}^{\text{lasso}}$ is either zero or solve, $$\beta_j + \lambda \text{ sign}(\beta_j) / 2 = \hat{\beta}_j,$$  which is, $$ \hat{\beta}^{lasso}_j =  \begin{cases}     \hat{\beta}_j - \lambda/2, & \text{if } \hat{\beta}_j > \lambda/2\\     \hat{\beta}_j + \lambda/2, & \text{if } \hat{\beta}_j < -\lambda/2 \end{cases} $$  My question is the following derivation,  If abs$(\hat{\beta}_j) \le \lambda / 2$, we get $$L_j(\beta, \lambda)  = -2 \hat{\beta}_j \beta_j + 2\beta^2_j + \lambda \text{ abs}(\beta_j)  \ge -\lambda \text{ abs}(\beta_j) + \lambda \text{ abs}(\beta_j) \ge 0 = L_j(0, \lambda)$$ and, we can tell $\hat{\beta}_j^{\text{lasso}} = 0 \text{ if abs}(\hat{\beta}_j) \le \lambda /2$ (Why? How can you tell?)  Why $\mathbf{\hat{\beta}_j^{\text{lasso}} = 0}$? The explanation of $L_j(\beta_j, \lambda) \ge L_j(0, \lambda)$ does not seem to justify the reason.


What are all the reasons that transformers are considered safer?

I am making a circuit for measuring AC mains voltage and current and I want to avoid using a transformer because it introduces distortions. But everyone says that the circuit will be considered unsafe (without explaining why).  I know one of the reasons for this is that using a transformer separates the neutral and it is harder to complete a short circuit. But this isn't a big downside for safety in a case enclosed circuit (or at least that's what I think).  What are the other reasons? How is using a transformer different than using a voltage divider (apart from the neutral separation)? Is it because of possible malfunction of a resistor causing it to short?


Ubuntu copy dialogue stops at the last moment for a long time

Whenever I try and copy a file to an USB flash disk, the progress bar runs till the end very fast and stops for an indeterminable time before it is complete.  Is there an issue with ubuntu or my flash disk is what I am not able to figure out. All I want is a realistic copy dialogue


As one of the business feature the upcoming iOS 7, Apple has announced the ability to configure VPN on application basis. However, details about this feature are hard to find on the web. I am wondering, if this configuration will be something that can be done on the Device itself, or if it has to be something that has to be set up by an IT administrator in the network?


How to get input from user using JAVASCRIPT and compare it with array if that value is present in array show present if not show not present.

I have been trying this and i have no idea what i am doing , i think it will use for loop but i dont know how to use it      <script LANGUAGE="javascript">     function check(a)     {         if(a===list[a])     {     document.write("Number is Present");      }else{     document.write("Number is not Present");     }     }     </script>     <script LANGUAGE="javascript">     var list=[10, 20, 30, 40, 50, 60, 70, 80, 90, 100];     var n = prompt("Enter any Number");     check(n);     console.log(list);     </script>


I've got a long-haul flight booked with China Airlines (A330 and an A340) from LHR to SYD, and only after I booked it did I decide to read up on their safety record. Suffice to say I regret doing that; for example see their .  Does anyone have any experience with China Airlines? Am I being a wuss?  I'm considering cancelling my flight (it's a long way off yet anyway) and rebooking with someone I've flown with before (Singapore or Virgin Atlantic probably).  Edit: Just to clarify, I understand all airlines have issues; however, I'm slightly concerned that China Airlines seem to tend to have more "and there were no survivors" kind of issues.


I have this code -
Hello World
       This generates a simple html page on the browser. I want to generate a pdf file of this html page. I tried using fpdf.php with the following code:  require("fpdf.php"); $data = $this->fpdf->Open(); $data = $this->fpdf->AddPage(); $data = $this->fpdf->SetFont('Arial','',8); $data = $this->fpdf->Cell(80); $data = $this->fpdf->Cell(0,0,"Hello World",0,1,'R'); $data = $this->fpdf->Output("../pdf/"sample.pdf");   I want to give the HTML file as the input, and get the PDF document of that HTML page. Most of the libraries available either work as above or require payment. I tried finding a free API which helps me to do this but in vain. Can anyone help me out here?


im a beginner at python and i've come across what is probably a simple problem. I want the code below to print the "." x times, each .100 of a second after each other. This is what ive got, but it just prints it all at once after x * .100 seconds. It would also help if you could redirect me to something that explains why it dosnt work or if you explained why it dosnt work.  import time for i in range(x):     print(".", end="")     time.sleep(.100)   Thanks in advance.  PS. If the code is completely wrong please say so.


SQL Server Error, "Invalid usage of the option FIRST in the FETCH statement."

From 2012 onward the SQL Server docs show they support  which I'm trying to use instead of a LIMIT.  The following works fine in PostgreSQL to sample a result set,  SELECT * FROM ( VALUES (1),(2),(3) ) AS t(x) OFFSET 0 ROWS FETCH NEXT 1 ROWS ONLY;   However, with SQL Server, I get  Msg 153, Level 15, State 2, Line 4 Invalid usage of the option FIRST in the FETCH statement.   What's going on here? Does SQL Server support the standardized OFFSET .. FETCH?


Custom question lists: finding questions you can answer

Update:   Once upon a time there was a feature called . Its goal was to help our most active users find the questions they can answer. "New nav" never made it out of beta and that beta only ever made it to Stack Overflow users. Several months ago we gave new nav a sad, but overdue burial. As we promised, we've been working on a replacement for new nav, and now it's time for us to start rolling it out. We're calling it custom question lists and we are really excited about its potential to help all users get at the questions that are most interesting to them. While we hope what we've built hits the mark for many of you who have requested a feature like this (e.g., , , , , , ), we know how difficult it is to make something complex simple. So, we are rolling this out in beta to gather feedback from you and iterate on it. (Don't worry, we promise to actually release it this time.) When it's live later you'll be able to opt-in to the beta by turning on a new account preference. This will enable the feature for Stack Overflow, Meta Stack Overflow, and Meta Stack Exchange. It will be available for all network sites when the beta period is over. Schedule for future improvements This feature will roll out in four phases:  Phase I: Filter and sort controls to let you modify a question list view (Julyish) Phase II: Saved custom lists (In progress, ETA November 2018) Phase III: Notifications on custom lists (December 2018) Phase IV: Final fixes and official release (January 2019)  Sneak peak Phase I: Filter and sorts We'll add filter and sort controls to question lists. This does two things:  Clarifies the definition of built-in views - Naming is hard and short names can't always describe what a view is showing you. By exposing the filter and sort controls it is more obvious. Introduces the ability to create new custom views - This won't be super useful until we add the ability to save the views to the UI (phase II). Until then you can bookmark the URL and get back to your views.  Question list with new controls   Views drop down   Filter   Sort   Phase II: Saved custom question lists In this phase we will add the ability to save your custom questions lists. Create custom list In our current design, a dialog will be pre-populated based on the filters and sorts you're currently using. Give it a name, confirm your options, and click save.  Accessing your saved lists When you save your custom lists they will show up in the "More" drop down for question list views. Additionally, you can add them to the left navigation bar for easy access (see image below).  Phase III: Notifications For phase III we'll enable indicators for when new items are available in a custom question list. When you pin a question list to the left nav you can see a dot on any list with new items.  Feedback welcome As usual, we're interested in your constructive feedback. This is a work in progress and, as mentioned, will be rolled out in phases. You can provide feedback on the concepts now based on the information in this post and provide feedback based on the working elements as they are released.


Verification of $\lim_{n \rightarrow \infty} \sqrt[n]{n^3}=1$

I am interested in the limit     $$ \lim_{n \rightarrow \infty} \sqrt[n]{n^3}$$   Can we simply conclude that: $$ \lim_{n \rightarrow \infty} (\sqrt[n]{n})^3= 1^3=1.$$ I have proven that $\sqrt[n]{n}\rightarrow1$ earlier in this textbook. Also since the limit of a power is the power of the limit.


I have a list U of lists such that U=[a[1], a[2], a[3]] and where a = [[0,1,2], [0,0,0],[1,1,1]]. I am trying to change U in a way that it will only contain lists without 2. I know that if I want  U = [a[2], a[3]] I have to do it like this:  for j in range (0,2):     U= [f for f in U if f[j]!=2]   But now I want it to return  only the index of the lists, I mean  at the end U should be [2,3]. Is it possible to do it ?  Thanks for the help !


Why can't we see the shadow of a black hole cast on Earth. Shouldn't the black hole block some light from a star or a galaxy far behind as they line up?


How to find $\sum_{n=1}^{\infty} \frac{(-1)^n}{n^2}$ using complex analysis?

Consider the series $\sum_{n=1}^{\infty} \frac{(-1)^n}{n^2}$. How to find its value using complex analysis?  I am considering $f(z)=\sum_{n=1}^{\infty} \frac{z^n}{n^2}$. It is absolutely convergent in $|z|<1$. So it is holomorphic and can be differentiated termwisely, namely $f'(z) = \sum_{n=1}^{\infty} \frac{z^{n-1}}{n}$, thus $zf'(z)=\sum_{n=1}^{\infty} \frac{z^n}{n} = \log (1-z)$ where $\log$ takes principal branch such that $\log1=0$. Thus we have $$ f'(z) = \frac{\log (1-z)}{z} $$ I cannot proceed now. Is it possible to use complex analysis theories to tackle this?  Thank you for any help!


I have 2 divs, one is the navbar one is a tagline. I am trying to center the tagline vertically, but I can't. When I set the height to 100%, the div gets to big and the page scrolls.   .header {   text-align: center;   background-color: black;   background-size: cover;   width: 100vw;   height: 100vh;   color: white; }  .navbar {   display: flex;   width: 100%;   height: 5%; }  .nav-items {   margin: 0 auto;   width: 97%;   font-size: 1.8em;   text-transform: uppercase; }  .brand {   float: left;   font-weight: bold; }  .nav-item {   display: inline;   list-style-type: none;   float: right;   padding: 0 15px; }  .nav-link {   color: white;   text-decoration: none; }  .tagline-container {   line-height: 1.5;   vertical-align: middle;   margin: 0 auto;   font-size: 2.5em; }

         Rainey 13 Foundation
Home

About

Contact

Donate

Fostering the First Steps, and Beyond!

    How can I vertically center the tagline without the div getting too big?


Select screen in detached screen session

In screen there is a kill command, which kills the current window. This command can be sent even to a detached screen session by running:  screen -S SessionName -X kill   This works to kill the current window only. To kill any other window, it appears the only way is to first switch to that window and then kill it. The select command allows switching between windows in a screen session. Typing the following while attached to a screen session will select the window named foo.  ^A:select foo   However, when not attached to the session, it appears the select command has no effect. Running the following two commands will kill the current window, rather than the window named foo (unless of course that is the active window).  screen -S SessionName -X select foo screen -S SessionName -X kill   I have verified that this occurs even if I attach and detach from the session before attempting to select a window (a known workaround for some other screen quirks).


How exactly can't $\delta$ depend on $x$ in the definition of uniform continuity?

I'm told that a function defined on an interval $[a,b]$ or $(a,b)$ is uniformly continuous if for each $\epsilon\gt 0$ there exists a $\delta\gt 0$ such that $|x-t|\lt \delta$ implies that $|f(x)-f(t)|\lt \epsilon$. Then it gives a little note saying that $\delta$ cannot depend on $x$, it can only depend on $\epsilon$.   With ordinary continuity, the $\delta$ can depend on both $x$ and $\epsilon$. I'm just a little lost on why $|x-t|\lt \delta$ implies $|f(x)-f(t)|\lt \epsilon$, and how $\delta$ can't depend on $x$ but only $\epsilon$.


Prove that $B[x] \cap B[x^{-1}]$ is integral over $B$

Let $A$ and $B$ be two commutative rings with a unit element, with $B$ subring of $A$. Suppose $x$ is an invertible element in $A$. Then prove that the intersection of the two rings $B[x] \cap B[x^{-1}]$ is integral over $B$, i.e., prove that for any $a \in B[x] \cap B[x^{-1}]$ there is a monic polynomial $f$ with coefficients in $B$ such that $f(a)=0$.


User wants to delete his answer but can't

The user that posted this answer    wants it deleted, but he can't delete it (he says in the comments). I can only vote for deletion so my questions would be:  a) what is needed for a user to delete his answer? Or is this behavior a bug?  b) (Done) can you help delete this specific answer, since the author doesn't want it, and it is not of much use for the site


It seems like pretty much everywhere I look, serial numbers can't do the things that it seems they should be able to do.  They can't help people figure out what bike they have.  They can't help at all when recovering a stolen bike, unless you have the bike's number linked to your identity somehow (good luck finding the bike in the first place).  It seems like the only thing they're useful for is warranty fulfillment. You take your bike to the shop, and they check the serial number to make sure that it's the same one you bought from them three months ago. Is this the only intended purpose of a serial number?


When I do sudo apt-get update I see an output like this: Hit:1 http://security.ubuntu.com/ubuntu focal-security InRelease Ign:2 http://ppa.launchpad.net/gnome-terminator/ppa/ubuntu focal InRelease      Err:3 http://ppa.launchpad.net/gnome-terminator/ppa/ubuntu focal Release          404  Not Found [IP: 91.189.95.85 80] Hit:4 http://packages.ros.org/ros/ubuntu focal InRelease                  Err:5 http://tr.archive.ubuntu.com/ubuntu focal InRelease                   Temporary failure resolving 'tr.archive.ubuntu.com' Err:6 http://tr.archive.ubuntu.com/ubuntu focal-updates InRelease   Temporary failure resolving 'tr.archive.ubuntu.com' Err:7 http://tr.archive.ubuntu.com/ubuntu focal-backports InRelease   Temporary failure resolving 'tr.archive.ubuntu.com' Reading package lists... Done            E: The repository 'http://ppa.launchpad.net/gnome-terminator/ppa/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.  What should I do?


The hint is: Let F has as elements $a_1,...,a_n$. Note that if $$f_i(x)=c(x-a_1)...(x-a_{i-1})(x-a_{i+1})...(x-a_n)$$, then $f_i(a_j)=0$ for $i\neq j$ and the value $f_i(a_j)$ can be controlled by the choice of $c\in F$. Use this to show that every function on F is a polynomial function.  Using Fraleigh’s seventh edition of A First Course in Abstract Algebra. Need help with problem 22.31c. I’m completely lost. Thank you!


Some Latinisms are usually italicized in English whereas some Latin loanwords are not, even in the same text. However, I cannot find any clear pattern. Are there clear rules or guidelines about it? For example, should I italicize 'qua',  'a priori', or 'post factum'?


How can I resize a group of images with reference to their center?

I have a group of a few hundred objects in specific locations, and they are all slightly too small. I would like to resize all of them at once. However, resizing the whole group drags the items out of their original location to respect the increasing change in empty space between the objects too. I don't want this. I want each object to increase in size, perhaps 130%, with respect to it's original position. I don't mind if the objects grow so large they begin to overlap. Is there any way to do this?


I'm brand new to Ubuntu and I was trying to get multiple monitors to work. After messing around in the nvidia settings, I tried restarting lightdm and it made a noise and prompted me for my password. When I typed it in, it made a noise again and prompted me for my password again. And again, over and over.  I thought it might have been because I ran "sudo lightdm restart &". I restarted my computer but when it came back up, it was still doing this.  I can get at the command prompt but I can't get at the UI/X-Server (still learning the terminology).  How can I log in and actually get at the UI again without it just restarting immediately?


Include prior knowledge in regression model

I've a classical dataset with real attributes and I want to perform a regression.  But, not all the entries in the training dataset are trustworthy; there is an attribute that I can turn into a confidence value (between 0 and 1) to say how much I can trust the label value. For example, if the confidence value is 0, I mustn't take the entry into consideration.  Is there a way to do this?


Why probability of picking a random prime is 0?

"It's well known that there are infinitely many prime numbers, but   they become rare, even by the time you get to the 100s," Ono explains.   "In fact, out of the first 100,000 numbers, only 9,592 are prime   numbers, or roughly 9.5 percent. And they rapidly become rarer from   there. The probability of picking a number at random and having it   be prime is zero. It almost never happens."      --Source:    I feel really skeptical about the statement in bold above. I think the probability tends to approach zero but can never be zero. Please explain how the probability is being calculated mathematically?


Using a given result to prove that $\int_{0}^{\infty} \frac{ \sin^4 (x)} {x^4} = \pi/3$

Question: Assuming $\int_{0}^{\infty} \frac{ \sin^4 (x)} {x^2} = \pi/4$,  prove $\int_{0}^{\infty} \frac{ \sin^4 (x)} {x^4} = \pi/3$. This question is from Apostol mathematical analysis (Lebesgue integration section) and I was struck In 1 part so thought of posting it here. I used integration by parts but can't prove it. Can you please help me with this Thanks!


Prove that for a natural number $n$ is true $1^3 + 2^3 +...+ n^3 = (1 + 2 +...+ n)^2$

So I have to show that for all natural numbers $n$ is true   $$1^3 + 2^3 +...+ n^3 = (1 + 2 +...+ n)^2$$  For $n = 1$ I proved it and I came this far:  $$1^3 + 2^3 +...+ n^3 + (n + 1)^3 = (1 + 2 +...+ n)^2 + (n + 1)^3$$  I do not know how to prove that part. Any help?


How to choose the default gcc and g++ version?

So I have installed gcc-4.4 and gcc-4.3 (same for g++). Now as far as I remember there is a tool in Ubuntu which sets the symlinks for you if you just tell it which version you want. However it does not seem to work in the newest version, which I find disappointing.  root@nexus:~# update-alternatives --config gcc update-alternatives: error: no alternatives for gcc. root@nexus:~# update-alternatives --config cc There is only one alternative in link group cc: /usr/bin/gcc Nothing to configure.   root@nexus:~# dpkg -l | grep gcc | awk '{print $2}' gcc gcc-4.3 gcc-4.3-base gcc-4.3-multilib gcc-4.4 gcc-4.4-base gcc-4.4-multilib gcc-4.5-base gcc-multilib lib32gcc1 libgcc1   Any ideas?


I'd like to change the style of our Windows Mobile application to follow the Modern UI style (as in Windows 8 or Windows Phone 7). While there are excellent guidelines for layout, fonts and sizes, I'm not able to find suitable icons to use in our toolbar (little images showing the state of the network or the battery). Those are the flaws of the icon packs I already found:   Usually there are just one or two battery icons, whereas I need several to indicate the different states The icons get very blurry when resized to 16x16 pixels (even for vector graphics) A lot of icon sets contain gradients, shadows or gray pixels Most of the icon sets contain only a hundred to five hundred icons   If you have a look at the , they're very clear and sharp. I already know , but the icons get very blurry when resized to 16x16 pixels as well. Currently we're using the icons from , but they don't provide suitable icons for Modern UI applications.  So my question is basically: Where can I find professional, high-quality icon packs with a lot of different icons (either PNG or vector graphics)? They don't have to be free, but must be allowed to be used for commercial applications. What are the major icons vendors and what platforms are available to obtain icon packs from?


What is the maximum number of partitions I can create in WindowsXp?

I know that I can create up to 24 partitions (C to Z), can we create more? and how?  Thanks.


I have come upon the situation where I see a question that really interests me.  I have nothing to add to this question at the moment, not a comment not answer but I'm particularly interested in what people have to say about this.  This leads me to think that in this situation, the favorite isn't enough.  My argument:  One of the main ideas of this site is that the questions you post may help others too, so that "allows me" to be as interested as the OP in the answers and comments to that question. (Even though it's not mine).  This is why I think that the favorite doesn't "notify enough", in the case where you want to be a very active participant/viewer of the question, even though you didn't ask it yourself.  Just to clarify, you should receive the same notifications as if you had asked the question.  The counter-argument:  I realize that this is particular situation, it is not every question that you would need to do this in every question.  It would probably need another button in the SE interface, and that is a BIG change.  It may mean too much information if over used.  Conclusion:  Despite this I think it would make a pretty good and useful feature that would benefit the site because of a greater user involvement in a question.  Thanks in advance.    EDIT: As ChrisF points out in his comment there is also the RSS feed, I'm not a big fan and I like to keep my inbox very clean, but it true that it is quite similar to what I have "requested". The difference is that this feature keeps everything on-site.       Somehow related:


Pipe the result of a cut command to curl

I have a csv file that contains 3 fields per line.  firstname,lastname,url  I'm trying to access the url via the following pipeline:  grep theName file.csv | cut -d, -f 3  then I want to add another pipe and use the results of the cut command in a curl command like so:  grep theName file.csv | cut -d, -f 3 | curl > result.txt  problem is, when i do the above, the curl command throws an error, i assume because curl doesn't have an argument?  how can I use the result of cut to curl the resulting url? Thanks in advance. =)


When is $\sqrt[3]{a+\sqrt b}+\sqrt[3]{a-\sqrt b}$ an integer?

I saw a  in which it was shown that $$(7+50^{1/2})^{1/3}+(7-50^{1/2})^{1/3}=2$$ Since there are multiple values we can choose for the $3$rd root of a number, it would also make more sense to declare the value of this expression to be one of $2, 1 + \sqrt{-6},$ or $1 - \sqrt{-6}$  We may examine this more generally. If we declare $x$ such that  $$x=(a+b^{1/2})^{1/3}+(a-b^{1/2})^{1/3}$$ $$\text{(supposing } a \text{ and } b \text{ to be integers here)}$$ one can show that $$x^3+3(b-a^2)^{1/3}x-2a=0$$ Which indeed has $3$ roots.  We now ask      For what integer values of $a$ and $b$ is this polynomial solved by an integer?   I attempted this by assuming that $n$ is a root of the polynomial. We then have $$x^3+3(b-a^2)^{1/3}x-2a$$ $$||$$ $$(x-n)(x^2+cx+d)$$ $$||$$ $$x^3+(c-n)x^2+(d-nc)x-nd$$ Since $(c-n)x^2=0$ we conclude that $c=n$ and we have  $$x^3+3(b-a^2)^{1/3}x-2a=x^3+(d-c^2)x-cd$$ And - to continue our chain of conclusions - we conclude that $$3(b-a^2)^{1/3}=d-c^2 \quad\text{and}\quad 2a=cd$$ At this point I tried creating a single equation and got $$108b=4d^3+15c^2d^2+12c^4d-c^6$$ This is as far as I went.


How can I turn my screen mode to grayscale?

I would like to temporarily turn my screen gray, to estimate how certain images would appear if printed with a black-and-white printer.  I think xcalib could do it but I don't know how.  Does anyone know how to get the desired effect?  For instance, to view inverted colors, I run xcalib -invert -alter to toggle the effect and it works great.  Is there a similar way to get a grayscale screen?


Use of contraction for I have where have is used to denote possession

"I have" can be contracted to "I've" when the "have" word is used followed by an action or experience. For example, "I have been there" can be contacted to "I've been there"  Is the same valid for the "have" word denoting possession? For example, Can "I have a pen" be contacted to "I've a pen"?  I've seen usages like "I've got a pen" for "I have got a pen" and I suppose that is correct anyway. But what about when there's no "got" ?


My reverse method doesn't reverse anything?

Here is my code: public static void numberToWords(int number){     int lastDigit;      if(number < 0){         System.out.println("Invalid Value");     }     while(number != 0) {         lastDigit = number % 10; // lastDigit = 3         number = number / 10;         reverse(number);          if (lastDigit == 0) {             System.out.println("ZERO");         }         if (lastDigit == 1) {             System.out.println("ONE");         }         if (lastDigit == 2) {             System.out.println("TWO");         }         if (lastDigit == 3) {             System.out.println("THREE");         }         if (lastDigit == 4) {             System.out.println("FOUR");         }         if (lastDigit == 5) {             System.out.println("FIVE");         }         if (lastDigit == 6) {             System.out.println("SIX");         }         if (lastDigit == 7) {             System.out.println("SEVEN");         }         if (lastDigit == 8) {             System.out.println("EIGHT");         }         if (lastDigit == 9) {             System.out.println("NINE");         }     } }  public static void reverse(int a){     int finalDigit = 0;     int reverse1 = 0;      while(a > 0) {         finalDigit = a % 10;         reverse1 = reverse1 * 10 + finalDigit;         a = a / 10;     } }  My digits are printed as strings as desired, but they come in reverse order. I tried to add the reverse method into the conversion method but the results are always the same, can't figure out how to reverse it.


Error CS0311 when using ExecuteQuerySegmentedAsync

I am new to Azure and have run into a issue were I think azure is trying to tell me that my tableEntity model that I am using does no inherit TableEntity, but it does. I am not sure what is going on and would appreaciate some advise to correct this. Here is the code and model used. this line var query = seems to be the issue I think. faulting out on the next line var segment = Code public class CustDataTableEntity:TableEntity      {                public DateTime CreatedTime { get; set; }         public int CustomerID { get; set; }         public int LocationID { get; set; }         public int SystemID { get; set; }         public Single TorqueAKPI { get; set; }         public Single AirAssistKPI { get; set; }         public string CustomerName { get; set; }         public string LocationName { get; set; }         public string Name { get; set; }         public string Location { get; set; }         public string TotalCycles { get; set; }     }      [FunctionName("GetCustData")]     public static async Task<IActionResult> GetCustData(         [HttpTrigger(AuthorizationLevel.Anonymous,"get",Route ="custData")]HttpRequest req,         [Table("custdata", Connection = "AxureWebJobsStorage")] CloudTable custTable,         ILogger log)     {         log.LogInformation("Getting customer data list items");         var query = new TableQuery<CustDataTableEntity>();          var segment = await custTable.ExecuteQuerySegmentedAsync(query, null);         return new OkObjectResult(segment.Select(Mappngs.ToCustomerdata));       }


Prove that $\frac{b-a}{\cos^2 (a)}< \tan b - \tan a < \frac{b-a}{\cos^2 b}$ where $0 < a < b < \frac{\pi}{2}$.   I can't even start solving this. Could you please help me? :D


MS Access + MS SQL Server for 1160+ users - Is it worth it? (Please Help!)

Our school in Delhi (India) wants to develop a professional and robust in-house database (SIS) that should handle vast amount of student information, including admissions, registration, re-enrollment, student behavior management and grading. We noticed that over-the-shelf products are unable to complete our specific tasks without major customization and costs. Hence, we decided to develop this ourselves since we have full control as to how we want our information to be reported to our education board (as per their specifications) and have control on our complex grading system (which is continuously updated to meet the dynamic benchmark needs of our education board).   We have begun using MS Access and is still in the primary stages of development. We want to know whether we should use MS Acess as a front-end and MS SQL as a back-end DB since we want to accomplish the following:   Ability for 80+ employee users to simultaneously access, post, update and delete customer records within the SIS DB (on campus). Ability for our SIS DB to have web-based functionality with a student login portal integrated within our school website so 1080+ students can simultaneously access a specific web-based DB form from their homes (by using the student login portal) for updating personal records, checking grades, and other performance summaries. Ability for our SIS DB to be highly secure and functional 24/7 without interruptions and security breeches (we read that MS Access alone cannot accomplish this). Ability to integrate our SIS DB with another in-house database that will provide digital learning materials to students within the comfort of their homes (also accessed through student login portal). The digital learning materials DB is another DB we are creating that should have ability to store 100 GBs worth of multi-media materials. Ability for data to be quickly pulled from tables to the GUI without delay.   A major factor for our school in this matter is COST. They want to create the DB under USD 1,500 and would like to have many users being able to access this system at the same time. Please help me to decide how I should go about this situation, both performance-wise and cost-wise. I apologize for the long details provided. I am really confused and would deeply appreciate if any one could help me on this matter.  In addition, we wanted our forms to be professional like the ones seen in major DB systems. We noticed that Access can create forms but only to a certain extent. Is there any other system programming-friendly platforms we can use for creating highly complex and professional DB forms (lke Visual Studio, for example)? Help on this subject as well will be extremely appreciated.  Ankith


I would like to change the default language for Office but I only have two choices:    Same as Microsoft Windows (which is in English) Français   I would like to switch to English for all my office suite, but this option appear nowhere. What should I do?  I have Microsoft Office 2016 MSO and I have already tried to install the Language Pack setuplanguagepack.x64.en-us_.exe, but I got this error:    You can see here that I have no options to set my interface in english:


Hide partition with VHD file during specialize or OOBE pass

I am creating a system based on VHD. The partition is like this:  +----------+-----------+ | VHD file | User Data | +----------+-----------+ 　　| +------------+ |   SYSTEM   | +------------+  The system volume has a default drive letter C. Windows 7 automatically assign letter D for "VHD file" volume and E for "User Data" The "VHD file" volume also contains bootmgr and page file.   My purpose is to hide "VHD file" volume so that no page file will be located in it and user cannot see vhd file and boot directory in it.  Windows 7 doesn't allow to remove letter after OOBE because the page file is in it. (Thus, we have to relocate page file, restart, and remove letter).  So my guess is do it during OOBE or specialize pass.  The result should be like "SYSTEM RESERVED" 100MB partition -- no drive letter, no page file, but with key files in it.  Any ideas are welcome!


What happens if you push a lot of (ideal) balls that are perfectly aligned?

Assume the line of balls is 2 light years long. When I push the first ball, will the last one react instantaneously? This would break the light speed limit. I'm pretty sure the answer is no, but I don't know why.   Also, assume the balls and the environment are ideal: no deformation can happen to the balls, no friction occurs etc


How to compute the limit of the infinite series $\sum_{n=1}^{\infty} \frac{1}{n(n+1)\ldots(n+m)}$, $m \in \mathbf{N}$

For having some fun with infinite series, I am having a go at some of the exercises in Problems in Mathematical Analysis by Kaczor and Nowak. I would like to ask, if my approach is in the correct direction or if there's another clever way of algebraically manipulating this. Please don't post the solution - but rather a hint/tip. Problem 3.1.4(a)  \begin{align*} \sum_{n=1}^{\infty}\frac{1}{n(n+1)(n+2)\ldots(n+m)}, \quad m \in \mathbf{N} \end{align*}  Solution. My approach would be to somehow, express this infinite sum as a telescopic series. Let's start with a simpler case $n=3$. We would like to determine coefficients $A,B,C,D$ such that: $$\frac{1}{n(n+1)(n+2)(n+3)}= \frac{A}{n} + \frac{B}{n+1} + \frac{C}{n+2} + \frac{D}{n+3}$$ So, \begin{align*} 1 = A(n+1)(n+2)(n+3) + Bn(n+2)(n+3) + Cn(n+1)(n+3) + Dn(n+1)(n+2) \end{align*} Substituting the values $n=0,-1,-2,-3$, we find that, $A=\frac{1}{6},B=-\frac{1}{2}, C=\frac{1}{2}, D=-\frac{1}{6}$. Thus, $$\frac{1}{n(n+1)(n+2)(n+3)}= \frac{1}{3!}\left(\frac{1}{n} - \frac{3}{n+1} + \frac{3}{n+2} - \frac{1}{n+3}\right)$$ Similarly, $$\frac{1}{n(n+1)(n+2)(n+3)(n+4)}= \frac{1}{4!}\left(\frac{1}{n} - {4 \choose 1} \frac{1}{n+1} + {4 \choose 2}\frac{1}{n+2} - {4 \choose 3}\frac{1}{n+3} + \frac{1}{n+4}\right)$$ In general, $$\frac{1}{n(n+1)(n+2)(n+3)\ldots(n+m)}= \frac{1}{m!}\left(\frac{1}{n} - {m \choose 1} \frac{1}{n+1} + {m \choose 2}\frac{1}{n+2} - {m \choose 3}\frac{1}{n+3} + \ldots+ \frac{1}{n+m}\right)$$ (This should be proved rigorously using mathematical induction.) But, if now look at the partial sum $s_n$ and write it for simplicity as - \begin{align*} s_n &= \frac{1}{m!} \left[1 - {m \choose 1} \frac{1}{2} + {m \choose 2}\frac{1}{3} - {m \choose 3 }\ \frac{1}{4} + \ldots + (-1)^m\frac{1}{1+m}\right]\\ &+ \frac{1}{m!} \left[\frac{1}{2} - {m \choose 1} \frac{1}{3} + {m \choose 2}\frac{1}{4} - {m \choose 3 }\ \frac{1}{5} + \ldots + (-1)^m\frac{1}{2+m}\right]\\ &+ \vdots \\ &+ \frac{1}{m!} \left[\frac{1}{n} - {m \choose 1} \frac{1}{n+1} + {m \choose 2}\frac{1}{n+2} - {m \choose 3 }\ \frac{1}{n+3} + \ldots + (-1)^m\frac{1}{n+m}\right]\\ \end{align*} This doesn't really yield anything familiar, even if collect the terms for each fraction $\frac{1}{2},\frac{1}{3},\ldots$.


How to prove the ring of Laurent polynomials over a field is a principal ideal domain?

Disclaimer: this is a homework question. I'm looking for direction, not an answer.     Given a field $F$, show that $F[x,x^{-1}]$ is a principal ideal domain.   I'm unsure how to proceed. Would it be better to prove this directly? (ie, let $I$ be an ideal, show that $I = (f)$ for some $f \in F[x,x^{-1}]$). The proof that polynomials are a PID would involve (I imagine) division by remainder and use of degree, both of which don't seem to have obvious parallels for Laurent polynomials. Should I try and devise some parallels and mimic the proof for polynomials? Or is this overkill? (or just wrong?)  edit 1: I guess the approach I mentioned above amounts to showing that Laurent polynomials are a euclidean domain (we know that euclidean domain => principle ideal domain, so this would be sufficient) Are they a euclidean domain though? (it seems like this would have been the question if they were, instead of asking if they were a PID).  edit 2: I've spat this out, think most parts of it are correct, though it seems kind of ugly/cumbersome (but that might just be me trying to spell things out more than is needed):     Given a Laurent polynomial $f \in F[x,x^{-1}]$, define its "negative   degree" $\deg^-(f)$ to be the largest power of $x^{-1}$ that appears   in $f$.      Let $I$ be an ideal of $F[x,x^{-1}]$. Note that $\{x^{-\deg^-(f)}f \mid f \in I\} \subseteq F[x]$. Let $J$ be the   ideal in $F[x]$ generated by this set. $F[x]$ is a principal ideal   domain, so $J$ is a principal ideal and we have $J = (j)$ for some $j \in F[x]$.      We claim $I = (j)$ (now meaning an ideal of $F[x,x^{-1}]$).      Let $f \in I$. Then $x^{-\deg^-(f)}f \in J$, meaning $f = x^{\deg^-(f)}g$, where $g = x^{-\deg^-(f)}f$ is in $J$. Because $g \in J = (j)$, there exists $g' \in F[x]$ such that $g = g'j$, and thus $f = (x^{\deg^-(f)}g')j$ is a multiple of $j$, so $f \in (j)$.      Let $f \in (j)$. Then $f = gj$ for some $g \in F[x,x^{-1}]$. But note   that $j = x^{-\deg^-(f')}f'$ for some $f' \in I$, so $f = gx^{-\deg^-(f')}f'$, so $f$ is a multiple of an element of an ideal   $I$, so $f$ itself is in $I$.      This shows $I = (j)$. So an arbitrary ideal of $F[x,x^{-1}]$ is   principal, so $F[x,x^{-1}]$ is a principal ideal domain.   I kind of feel like I still don't "get" the proof (I more-or-less see how each part works with the others but I'm having trouble seeing the bigger picture), though this may be due to a poor handle on ideals in general.


SQL Server select results as string separated with ','

I have a select query that returns one column and I want to convert that to string rows separated  with ','   Select name  from tblUsers   Gives a result:  Row1; asieh Row2:amir Row3:safoora   I want to return   Row1: asieh,amir,safoora


Can I remove openbox if I want to keep lxde?

In the user greeting session, I have 'ubuntu', 'lxde' and 'openbox'. I don't know why I have openbox, so can I remove it by typing:   sudo apt purge --autoremove openbox   Does this command affect my lxde desktop environment?


Followup to:   So this is a particularly ridiculous idea, but it might work.  A simulacrum normally cannot regain spell slots, but a spellcasting monster can. An archmage is in the table of monsters (with a CR of 12!) so it is definitely a valid true polymorph target. Spellcasting monsters recover spell slots by long rest, just like players.  The accepted answer on the other question has the text "The simulacrum's statistics are replaced."  Can a simulacrum true polymorphed into an archmage regain spell slots?


How do I install Ubuntu Server 12.04 without losing my Windows 7 files?

I have 3 partitions on my Compaq Presario CQ 57 in which:   Partition 1 has 55 GB (it has Windows 7). Partition 2 has 225 GB with no data stored Partition 3 has 18GB free.   So, I want to install Ubuntu Server 12.04 in partition of #3 but I don't know how to make it and I don't want to lose my windows 7 files.  Please help me.


Can we prove the Riemann-Lebesgue lemma by using the Weierstrass approximation theorem?

I'd like to prove the following version of the Riemann-Lebesgue lemma:     Let $f: [0,1] \to \mathbb R$ be continuous. Then $$\int_0^1 f(x)\sin(nx) \, dx \xrightarrow{n \to \infty} 0$$   It's quite easy to show the lemma for the case $f\in C^1$. So I was hoping that one can approximate the $f\in C^0$ with polynomials (by using the Weierstrass approximation theorem) and then apply the already shown case for $f\in C^1$. Yet it didn't work out for me. Is this a feasible way?


TV Arcs with Cablebox through both Coax and HDMI

Here is our setup  Outlet in older house that was replaced with a GFI last year. (no issues until recent)  The GFI doesn't have a ground wire running up from the basement. Just the white and black wires. (From my understanding this is an acceptable configuration)  The outlet reads 119.0v when checked with my multi-meter.  The outlet reads less than a volt when the "positive" line and the ground are checked with the multimeter. Same with the "negative" with the ground.  A (real) surge protector plugged into the outlet  A large tv plugged into the surge protector  A cox cable box plugged into the surge protector  A coax cable (run by cox) from the outside of the house, split and sent to a modem and the cable box. The coax reads 0v (no leakage at all) when a multimeter is placed on the inner coax wire and the outer shielding. I tried this on both DC and AC settings on multimetter   The problem: When either a coax cable or HDMI cable is run from the cable box to the TV, an Arc appears. This has already fried one TV. My theory: The coax cable is improperly grounded. I just need a way to prove it. The basis for this theory is the coax cable in a separate apartment tests with an AC voltage of 1.5v. The cable technicians are somehow less informed about circuitry than me. This is a hobby for me so I am lost in the sauce. Any Ideas? Update So I took the time to diagram what I have observed. This further supports my theory that the cable isn't grounded properly. I'm not 100% sure how coax is supposed to be run from a telephone pole though so I could be incorrect. Just in case there is confusion, no the neutral is not plugged into the ground. I was just demonstrating that there is only two wires going to the GFI.  (Please right click and select open in new tab to see full size image.)


font problem in photoshop used via playonlinux

I had installed Photoshop under Playonlinux , but i got a problem with fonts in the dialog; for example when i want to create a new PSD document as shown:    I had searched in google for a solution , and i had seen many people said that they resolved the problem by installing Microsoft fonts but i din't find it.


I think I found a bug in LuaLaTeX. I use the current version from TeX Live 2012.  lualatex --version This is LuaTeX, Version beta-0.70.2-2012052410 (TeX Live 2012)   When I compile the following document  \documentclass{standalone} \begin{document} $\displaystyle\sqrt{\sum_{k=1}^{n} x_k}$ \end{document}   it works fine with pdflatex; .  But with lualatex I get .  So, where should I report this? And how can I get around it?


How to add caves to a terrain mesh generated with 2D noise

Am I getting it right, that when I'll make a single mesh that represents terrain using unity's built-in 2D Perlin noise function, then I'll be able to somehow add caves using whatever (Perlin worms for example)? Or do I need to find solution with 3d noise?


If $A \subseteq B$, then $A_{\mathfrak p} \subseteq B_{\mathfrak q}$?

Let $A \subseteq B$ be commutative rings with identity, $\mathfrak q$ a prime ideal of $B$, and $\mathfrak p = A \cap \mathfrak q$.  Is the 'identity' ring homomorphism $A_{\mathfrak p} \rightarrow B_{\mathfrak q}$ always an injection?  The 'obvious' method of proving this seems to lead to a dead end: if $\frac{a}{s} \in A_{\mathfrak p}$ is the zero element in $B_{\mathfrak q}$, then there exists a $t \in B$, but not in $\mathfrak q$, such that $ta = 0$.  But it isn't clear whether $t$ may be chosen to lie in $A$.  So my guess would be that this map doesn't need to be an injection.  The reason I'm asking is that it is an exercise in Hartshorne (II, 2.18) to show that a homomorphism of rings $\phi: A \rightarrow B$ is injective if and only if the corresponding morphism of sheaves $f^{\#}: \mathcal O_X \rightarrow f_{\ast} \mathcal O_Y$ is injective ($X$ and $Y$ are the spectra of $A, B$, and $f: Y \rightarrow X$ is the map $f(\mathfrak q) = \phi^{-1} \mathfrak q$).  Assuming $\phi$ is injective, I want to show that $f^{\#}$ is injective by showing the corresponding homomorphism on the stalks $A_{\phi^{-1}\mathfrak q} \rightarrow B_{\mathfrak q}$ is injective.  But if I am not mistaken, this homomorphism on the stalks is exactly the map $\frac{a}{s} \rightarrow \frac{\phi(a)}{\phi(s)}$ I just described.    EDIT: Someone has asked the same question before, and as I suspected the homomorphism $A_{\mathfrak p} \rightarrow B_{\mathfrak q}$ does not have to be an injection.  So my question now is why this counterexample does not invalidate exercise II.2.18(b) in Hartshorne.  EDIT 2: I just now realized the homomorphism on the stalks isn't the natural map $A_{\phi^{-1}\mathfrak q} \rightarrow B_{\mathfrak q}$; the codomain isn't correct.  Rather, if $\mathfrak p = \phi^{-1}\mathfrak q$, $(f_{\ast} \mathcal O_Y)_{\mathfrak p}$ is the direct limit of the rings $\mathcal O_{Spec B}(f^{-1}U)$, where $U$ runs through the open neighborhoods of $\mathfrak p$.


How can I comment like this in my equations. Any help would be much appreciated!


I'd like to make the ultimate bootable USB with several distributions on it. How?

I have a USB key attached to my keyfob, and I'd like to turn it into a toolbox where I have bootable images on it (DBAN, Clonezilla, Kali, Ubuntu...)  Is there a way to have all these images on the stick, and have a GRUB when I boot off it to select which distribution to launch? I would also like to make it easy to upgrade the various distributions independently.  I suspect some kind of multiboot, but don't know if that's the right way to go or where to start.


I've read over the information I can find on 17.04 Zesty Zapus    The only information I can go off of for official support:  "Ubuntu 17.04 will be supported for 9 months until January 2018. If you need Long Term Support, it is recommended you use Ubuntu 16.04 LTS instead."  Does this indicate that 17.x will not at any point have long term support?  Edit: This was specifically related to if 17.04 Zesty Zapus was going to be receiving LTS. Not about defining the difference between Non-LTS and LTS. This is meant to be informational to this specifically, not a duplicate of a more broad question.


Rank of product of a matrix and its transpose

How do we prove that  $\operatorname{rank}(A) = \operatorname{rank}(AA^T) = \operatorname{rank}(A^TA)$ ?  Is it always true?


How to resolve the nullpointer exception

While working on a GUI project i am stuck with an error called null pointer error. I am unable to resolve this problem. The line which shows the error is closed by double asterisk on both sides(**).(line 80) I have connected this with a SQL database and error erupts while assigning Jtable its value and structure. package connectsqlite;  import java.awt.BorderLayout; import java.awt.EventQueue;  import javax.swing.JFrame; import javax.swing.JPanel; import javax.swing.border.EmptyBorder; import javax.swing.JLabel;  import java.awt.Font;  import javax.swing.JButton;  import java.awt.event.ActionListener; import java.awt.event.ActionEvent;  import javax.swing.JTable;  import java.sql.*;  import javax.swing.*;  import net.proteanit.sql.DbUtils;  public class afterLogin extends JFrame {      public JPanel contentPane;     private JTable table;     /**      * Launch the application.      */     public static void main(String[] args) {         EventQueue.invokeLater(new Runnable() {             public void run() {                 try {                     afterLogin frame = new afterLogin();                     frame.setVisible(true);                 } catch (Exception e) {                     e.printStackTrace();                 }             }         });     }      /**      * Create the frame.      */     Connection connect = null;               public afterLogin() {         connect = sqliteConnection.conn();         setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);         setBounds(100, 100, 695, 422);         contentPane = new JPanel();         contentPane.setBorder(new EmptyBorder(5, 5, 5, 5));         setContentPane(contentPane);         contentPane.setLayout(null);                  JButton btnBack = new JButton("Log out");         btnBack.addActionListener(new ActionListener() {             public void actionPerformed(ActionEvent e) {                  Connecting window = new Connecting();                  window.frame.setVisible(true);                                                                                }         });         btnBack.setBounds(10, 62, 114, 23);         contentPane.add(btnBack);                  JButton btnNewButton = new JButton("Load Details");         btnNewButton.addActionListener(new ActionListener() {             public void actionPerformed(ActionEvent e) {                 try{                     String query = "SELECT * FROM Appointments";                     PreparedStatement pst = connect.prepareStatement(query);                     ResultSet rs = pst.executeQuery();                     **table.setModel(DbUtils.resultSetToTableModel(rs));**                                      }                 catch (Exception e1) {                     e1.printStackTrace();                 }                                        }         });          btnNewButton.setBounds(10, 28, 114, 23);         contentPane.add(btnNewButton);                  JScrollPane scrollPane = new JScrollPane();         scrollPane.setBounds(162, 57, 435, 305);         contentPane.add(scrollPane);                  JScrollPane scrollPane_1 = new JScrollPane();         scrollPane.setViewportView(scrollPane_1);     } }


I have a string which contains both form $date0$ and ''$date0$'' (single '). I am using this regex to match (\$([^\$]+)\$) but it's only matching $date0$. What regex should I use that matches both?


I'm wondering: Is there a statistical test for determining "no correlation"? I would not want to use Fisher's transformation.


\subsubsection in a report style document

I am trying to make a subsubsection in a report document. It does this successfully, however it removes the subsection from the contents section of the document.  Is there anyway to rectify this?  I tried using, for example,  \addcontentsline{toc}{subsubsection}{Photoelectric Effect}  but this does not work. Nothing shows up.


My S3 has a damaged motherboard (says Samsung Tech Center), only boots into safe mode.  If I am to keep using the device I have to make the apps into system apps, so they run in safe mode.  One way is to use titanium backup (or other root file app) to make the app system, but the phone came back from Samsung wiped clean. It is still rooted, have SuperSu app installed.  Does anyone know how I can make a Play_Store or Downloaded_APK app system?


Person who pretends to not understand unless one speaks in exactly the words they expect

I just realized there are some people around my workplace who     always try to correct me when using a certain word, saying that that's not how I should speak, and I should use other words (the ones they provide me with)   or pretend they didn't understand what I was saying, but it's pretty clear that they did understand. This again with the same purpose, of making me rephrase, or use the words they expect.     When doing this, they use, among others, the argument that they sure have understood, but others might not. But then, nobody else complains of not having understood what I was saying. Another argument they use is that even if they understood it, what I said was incorrect.  I make the assumption that when I express my ideas in words, I use enough details to get the point across.  I would call this type of non-constructive attitude a 'hater' attitude, but I'm curious whether there's a more specific word for this.    meta: I'm not a native English speaker, and I don't know a word for this in my language, I'd just use the dictionary to find out if my language has an analogous word. Anyway it would be good to know if there's a word for this concept in these two languages. meta: Also, the situations I refer to happen (mostly) when I'm speaking my own language, but the language really isn't the point here, because I do speak multiple languages and I did meet this behavior (though very rarely) when speaking any language.


What software is available for drawing plans?

I want to draw a plan with measurements, trees, entries, North sign, paths, something similar to AutoCad but for lands.  What would you recommend?


Iterating each character in a string using Python

In C++, I can iterate over an std::string like this:  std::string str = "Hello World!";  for (int i = 0; i < str.length(); ++i) {     std::cout << str[i] << std::endl; }   How do I iterate over a string in Python?


Why are Starfleet vessels not fitted with seatbelts or harnesses of some kind?

Simple question, seatbelts. I'm looking to see if it's ever mentioned canonically or not.  I was watching an early episode of TNG last night, giggling at Riker's dance-like twitching as the Enterprise shook, and, as Worf took a less-than-realistic 'safety-dive' toward the deck while almost breaking the set, my partner-in-crime asked me "Why don't they have seatbelts?". I was kind of caught off-guard... why, in all the time I've spent watching Janeway's hair flapping out of its restraints, have I never asked myself this question?  Yes, they have inertial dampers but yes, they fail or, more accurately, are reported "offline" often during hostile encounters and rough rides and I'm left wondering how many of the Alpha Quadrant's finest would have been saved by a simple (yet advanced) chair-harness of some kind? Do they not remember the "Clunk-click, every trip" campaign?  In the TV series, they seem to take it for granted that if the inertial dampers go offline, they are at the mercy of their environment, they know they have no kind of restraint other than the gravity plating which is marginally beneficial in that situation. At least after the torturous rag-doll-ing, they know they'll end up back on the floor!  So was it ever mentioned on TV or off? I'd even stretch to non-canon for this. Maybe they came up with some general reason somewhere that will settle my mind a bit.  Edit: There is a question regarding . But this doesn't seem to answer this question, in fact, it confounds some of my theories because now I realize that they were used in certain places but not in other places where they would be equally or even more beneficial. Even if they had the ability to use a seatbelt but chose not to would satisfy me.


How do TTL flash metering systems calculate how much power is needed?

Does anyone know how TTL calculates the amount of power to put in after the preflash is done? I understand that the value is somewhat brand specific, but what is the general logic? Because if you think about it, before flash the camera calculates the exposure to the 18% rule. But this makes no sense for flash.   For example, if I'm already at the perfect exposure (18%) before flash, the flash will still fire. If it followed that logic, it should not fire at all.   Also, if the logic is to bring the whole scene to 18%, doesn't that mean the flash power is inversely proportional to my continuous light exposure? i.e., the more I underexpose the background, the more power it will flash?


The square root of a prime number is irrational

If $p$ is a prime number, then $\sqrt{p}$ is irrational.  I know that this question has been asked but I just want to make sure that my method is clear. My method is as follows:  Let us assume that the square root of the prime number $p$ is rational. Hence we can write $\sqrt{p} = \frac{a}{b}$. (In their lowest form.) Then $p = \frac{a^2}{b^2}$, and so $p b^2 = a^2$. Hence $p$ divides $a^2$, so $p$ divides $a$. Substitute $a$ by $pk$. Find out that $p$ divides $b$. Hence this is a contradiction as they should be relatively prime, i.e., gcd$(a,b)=1$.


How to create a deterministic tar.gz using tar?

I have followed following answer for  and . My goal is to generate deterministic compressed file in tar.gz format (having the same md5sum hash), if the compressed files' contents are not change. $ cd /home/user/folder_to_zip $ echo "helloworld" > data.txt && md5sum data.txt d73b04b0e696b0945283defa3eee4538  data.txt $ echo "life" > data1.txt $ md5sum data1.txt 5b019d44541d974a2cbf3299c8279c10  data1.txt $ ls -lA -tr -h total 8.0K -rw-rw-r-- 1 alper alper alper 11 2021-01-24 17:20 data.txt -rw-rw-r-- 1 alper alper alper  5 2021-01-24 17:31 data1.txt $ find . -print0 | LC_ALL=C sort -z | \   PIGZ=-n tar -Ipigz --mode=a+rwX --owner=0 --group=0 --absolute-names --no-recursion --null -T - -cvf ../file.tar.gz && md5sum ../file.tar.gz ./ ./data.txt ./data1.txt b117eaf020ba2d85cca84a169e4df750  ../file.tar.gz  I have done the same operation but keeping the contents of the data.txt exactly same: $ echo "helloworld" > data.txt && md5sum data.txt d73b04b0e696b0945283defa3eee4538  data.txt $ echo "life" > data1.txt && md5sum data1.txt 5b019d44541d974a2cbf3299c8279c10  data1.txt $ ls -lA -tr -h total 8.0K -rw-rw-r-- 1 alper alper alper  5 2021-01-24 17:35 data1.txt -rw-rw-r-- 1 alper alper alper 11 2021-01-24 17:35 data.txt $ find . -print0 | LC_ALL=C sort -z | \   PIGZ=-n tar -Ipigz --mode=a+rwX --owner=0 --group=0 --absolute-names --no-recursion --null -T - -cvf ../file.tar.gz && md5sum ../file.tar.gz ./ ./data.txt ./data1.txt 5218abe2ece732c74314d36b7e712c88  ../file.tar.gz  At the end, generated md5sum hash differs between the each compressed files, even though the data they are compressing is exactly same. What may be the main reason of this and is it possible tofix it?


If jquery click function not working after Ajax?

$('.getLocation').on("click", function(){              $.getJSON("searchJson.php",{address:address},function(json){                 if(json!=null){                      var str = "";                      $.each(json,function(index,array){                          str =  '

';                          str += ...;                         str += '

';                      });                  }                 }             });      });     $('.getLocation2').click(function(){         //do something...         loadIframe(address);     });  }); function loadIframe(url) {//do something...}   Before click the getLoction class,the getLocation2 function is working well.  But after click the getLoction class,the getLocation2 function is not working.  So I confuse that if the jquery click function not working after Ajax ?  this is my website:   the getLocation class is in the dropdown list ,after click I wish to load the google map and refresh the data from db throught the ajax. After loading the data from ajax,the getLocation function is not working anymore.


I've got a camera tracked to an empty, and I'd like to add keyframes with constant interpolate to have the camera "click" forward.  How can I scale the distance between objects, without affecting their size? Even better would be setting an absolute value of the distance between the objects.


Flashing BIOS update on Dell XPS 13 (2015)

I have been trying to flash my BIOS to upgrade it to version A05, as suggested to me by Dell (since my computer has some bugs that make it unusable).   I created a FreeDOS disk with Unetbootin, copied the file from Dell on there; 9343_BIOS_Rev_A05.exe ; and when I boot the disk, the file doesn't seem to be on there.   I also read some people the image (I don't really have an image, but an exe file), in /boot/xxxx, but I use grub instead of sputnik's default.   I tried running the exe with wine to extract it, but it gives an error. Any ideas? I don't have a UEFI system.


Is there an in-universe explanation for why humans look like time lords?

Amy: You look human.      Doctor: No, you look time lord.  We came first.      (from Series 5, episode 2, The Beast Below   Is there an in-universe explanation for why time lords and humans look exactly the same?


What are the advantages,disadvantages of Changesets ,Force.com IDE(Eclipse)

Can any one help me out with the advantages,disadvantages of Changesets ,Force.com IDE(Eclipse),Migration tool.  Which tool is preferred.  Correct me if im wrong  Changes Sets :Track the history,profiles can be moved.  Eclipse :profiles,premission sets cannot be moved,Any changes done in sandox is updated in production whereas in changeset we need to select nd move in to production.  Any help very much appreciated.


Replace NA's with 0 for raster data using R?

I am new in R. How can I replace NA's with 0 for my raster data which have spatial information?


How to forward traffic out to the internet from Ethernet through WiFi while interfaces on a different subnet?

On my MacBook I am connected to internet through WiFi but I also have a router for my lab connected to Ethernet port.  wifi(en1): 192.168.0.4/24 with 192.168.0.1 gateway.   ethernet(en0): 192.168.1.254/30 with no gateway.   When I try ping 192.168.1.254 or even ping 192.168.1.253 which is the other end of my Ethernet I do get a reply but when I run ping -S 192.168.1.254 192.168.0.4 or ping -S 192.168.1.254 192.168.0.1 ping an address on the internet I get this:  ~ ping -S 192.168.1.254 192.168.0.4  PING 192.168.0.4 (192.168.0.4) from 192.168.1.254: 56 data bytes ping: sendto: No route to host ping: sendto: No route to host Request timeout for icmp_seq 0 ping: sendto: No route to host Request timeout for icmp_seq 1   So while WiFi can ping Ethernet and further to it, Ethernet cannot ping WiFi or my ISP's router or go out to the internet.  My question is how I can make Ethernet reach my ISP's router and therefore internet as well as other devices on my WiFi network.  I tried static routes but it is not working. I was only able to ping WiFi (192.168.0.4) by sharing my WiFi connection to Ethernet from preferences, and then assigning  the IP address of eth to the bridge that was created with the following command sudo ifconfig bridge100 inet 192.168.1.254/30 but still I could not ping 192.168.0.1 or any other device on the WiFi network.


Null object reference using setAudioAttributes

I am trying make a radio streaming app in android studio using setAudioAttributes, but i when install the application in my phone shows the next error:  error java.lang.nullpointerexception: attempt to invoke virtual method void android.media.mediaplayer.setaudioattributes(android.media.AudioAttributes) on a null object reference  Thanks.  public class Radio extends Fragment {  Button play_pause; MediaPlayer mp; @Override public View onCreateView(LayoutInflater inflater, ViewGroup container,                          Bundle savedInstanceState) {     View view = inflater.inflate(R.layout.radio, container, false);     play_pause = (Button) view.findViewById(R.id.btnplay);     try {         if (android.os.Build.VERSION.SDK_INT >= android.os.Build.VERSION_CODES.O) {              mp.setAudioAttributes(new AudioAttributes.Builder()                     .setContentType(AudioAttributes.CONTENT_TYPE_MUSIC).build());             mp.setDataSource("http://198.27.83.65:9962/;stream.mp3");             mp.prepare();             mp.start();         }         else {             Toast.makeText(getContext(),"Error",Toast.LENGTH_SHORT).show();         }      }      catch (Exception e){          Toast.makeText(getContext(),"Error" + e,Toast.LENGTH_SHORT).show();      }      //mp = MediaPlayer.create(this.getContext(), R.raw.radio);         play_pause.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View v) {                      if(mp.isPlaying()) {                         mp.pause();                         Toast.makeText(getContext(),"Stop",Toast.LENGTH_SHORT).show();                     }                     else {                         mp.start();                         Toast.makeText(getContext(),"Start",Toast.LENGTH_SHORT).show();                     }             }         });     return view; } }


Why am I getting rounded faces when combining Edge Split and Subsurf?

What's going on here? I'm trying to apply a normal edge split with a subdivision to make it look high poly with good edges. But when I applied it on this model it did this.


"each day" → "daily"; "every other day" →?

Is there an adjective that means "every other day"? I found "bidaily" but it seems to mean "twice a day", not "every second day" (not even both as "biweekly" does).  I'd need this word to very concisely describe a questionnaire by its issuing frequency.


Times New Roman font missing in LibreOffice Writer

There is no Times New Roman Font present in LibreOffice Writer. I looked upon the question . But I have the fonts installed on my system already, but is it not showing up on Libreoffice Writer?  My system specs  $ libreoffice --version LibreOffice 5.1.2.2 10m0(Build:2)


How can I reduce the line spacing in references?

I am trying to reduce the spacing in between the references to save some space. However, I couldn't do it by myself. I am using the article class, and a portion of my code is as follows:  \documentclass[9pt]{extarticle} \providecommand{\keywords}[1]{\textbf{\textit{Index Terms---}} #1} \usepackage{spconf,amsmath,graphicx} \usepackage{epstopdf}   \usepackage{graphicx} \usepackage{color} \usepackage{placeins} \usepackage{float} \usepackage{tabularx,colortbl} \usepackage{amssymb} % \in \usepackage{amsmath} % For align command \usepackage[breaklinks=true]{hyperref} \usepackage{setspace} \usepackage{cite} \usepackage{subfigure}  \begin{document} Huuuuuuuuuuuuuuuuuuu!!  \bibliographystyle{IEEEbib} \bibliography{references}  \end{document}   How can I manage to reduce the line spacing in reference section?  Thanks in advance.


I thought you have to say a mapping is onto something... like, you don't say, "the book is on the top of"...  Our book starts out by saying "a mapping is said to be onto R^m", but thereafter, it just says "the mapping is onto", without saying onto what. Is that simply the author's version of being too lazy to write the codomain (sorry for saying something negative, but that's what it looks like to me at the moment), or does it have a different meaning?


Special characters in mysql password using mysqldump

I have the following ssh script:  #Here I am getting the mysql password for the root user password=$(cat /root/.my.cnf | grep "password" |  awk -F\" '{print $2}')   #here I am trying to dump the database remotely mysqldump -uroot -p$password $db |  ssh root@$destination_server "cat > /backup/mysql/$db.sql"   The thing is that I am getting the following error:  /bin/bash: -c: line 0: syntax error near unexpected token `)' /bin/bash: -c: line 0: `mysqldump -uroot -pbyt)uy6 database_name '   I have tested quite a lot and I found that the error is caused due to the special character in the password. Since I am getting the password from the .my.cnf file I am unable to escape it by hardcoding the escape characters.   Can anyone offer me a way to maybe search for those special characters in the $password variable and add to those escape slashes ("\").   EDIT: I forgot to mention that I am executing this via OpenVZ partial virtualization by using the vzctl exec command which is the reason why I needed a method which will allow me to escape the special characters as I have requested. The method I have developer was a simple use of the sed command:  sed 's/[!-+]/\\&/g'    Thank you all for your help.  Best Regards!


How does Stack Overflow implement its search indexing?

How does Stack Overflow implement search indexing?  Does it index the questions and answers as soon as the user posts them or will it run a batch job for indexing content (questions and answers). Does it have a single index or multiple indexes?  I know it uses Lucene.net for searching and indexing, since writing into Index is a IO operation, how does it manage the writing part?  Please shed some light into indexing policy at Stack Overflow?


While reviewing some Late Answers and First Posts noticed that it's not possible to click "follow" and start following the post.  In order to do it at the moment, I had to go to the page where the answer resides outside of the Review queue.  This behaviour was first noticed in Stack Overflow but I was able to reproduce it in other sites like Project Management Stack Exchange.


I found some batch code using ogr2ogr in order to convert and reproject vector layers. The difficulty for me is to know what to install and which gdal commandline should I use, and how to configure it...  The fact is I'm quite lost with all the packages that gdal offers and I don't know :   which package am I supposed to install : OSGeo4W, FWTools, MS4W,...?? What is the difference between them ? Can I use any of them ? What is the procedure to set PATH and environment variables ? I work with windows 7. I have already QGIS and GRASS installed on my computer. Is an installation of gdal could damage anything ?


Show that $\deg f$ is even when $n$ is odd.

A map $f:S^n\rightarrow S^n$ satisfying $f(x)=f(-x)$ for all $x\in S^n$ is said to be an even map. Show that if $f:S^n\rightarrow S^n$ is an even map, then $\deg f=0$ when $n$ is even and $\deg f$ is even when $n$ is odd. Moreover show that when $n$ is odd, there exist even maps of any given even degree.   My Try:  So $f=(-I)\circ f$. Then $\deg f=\deg (-I)\times \deg f$. If $n$ is even $\deg (-I)=-1$. Hence, $2\deg f=0$, so $\deg f=0$. But how do I show the results when $n$ is odd. No clue at all. This problem is in Hatchers book (A very complicated text). There is a hint but I do not understand it. Can somebody help me to proceed?


I am fetching some results from three different tables Orders, OrderDetails and Customers. I am trying to combine two fields OrderDetails.ProductCode and OrderDetails.Quantity into one and group the results by OrderID.   What I am getting is  OrderID ProductCode Quantity Email 1       A           2        john@gmail.com 1       D           1        john@gmail.com 2       E           5        warren@gmail.com 3       B           3        david@gmail.com 3       F           1        david@gmail.com   This is what I want  OrderID ProductCode_Quantity Email 1       A_2, D_1             john@gmail.com 2       E_5,                 warren@gmail.com 3       B_3, F_1             david@gmail.com   My current query is  SELECT Orders.OrderID, OrderDetails.ProductCode, OrderDetails.Quantity, Customers.EmailAddress FROM Orders JOIN OrderDetails ON Orders.OrderID = OrderDetails.OrderID JOIN Customers ON Orders.CustomerID = Customers.CustomerID


What is the value of   $$\int\frac{1}{\log x}dx$$ I have tried many times, but failed everytime.   Can anyone help me out in solving this question.


While computing densities for some distributions, I stumbled on the following family of parametrized integrals:  $$ p (x)  := \sqrt{\frac{2}{\pi}} \int_{\mathbb{R}_+} e^{-\frac{x^2}{2 y^2} - y^2} \ d y.$$  They are obtained by playing around with normal distributions and exponential distributions. Using Wolfram Alpha, the following conjecture seems to hold:  $$ p (x)  = \frac{1}{\sqrt{2}} e^{- \sqrt{2} x}.$$  However, I have no idea about how I should prove this equality. I don't think a residue computation may work, because the singularities are essential, but my complex analysis classes are a bit far away, and perhaps there is some nifty trick to solve this problem...  Thank you very much.


Recently I scanned my Windows PC using Avast and it showed the presence of some weird malware in the result. It couldn't remove all of them nor it could move all the malware to the chest.  Now I am facing some serious trouble:   My start menu is not working nor Cortana (search) is opening. Task bar icons are not showing up. I am able to click the task bar icons but I can't see the icons. My internet connection (modem) is getting disconnected by itself. When I click on the personalize settings, it says "This file has no program associated with it." There are some serious troubles.   Please help me. Will restoring to a previous point remove the malware?


ubuntu how to assign key to email address

I would like to assign a key combination to enter my email address I get tired of having to type it out.


I own, an about a year old, rig which carries quite the punch. And for a year, I was happy. Not that long ago things began to crumble.  I first detected the problems running my dual monitor setup. For some reason, tearing and artifacts are appearing when I run with two monitors plugged in my nVidia GTX 460. I thought it was a graphics hardware problem and switch to an older RADEON 5850, but the problem did not go away.  I began experiencing BSODs on very specific things related to USB devices. If I shutdown the computer with my external banking security device plugged, it will BSOD, if I connect my external Rig Kontrol 3 audio interface it will BSOD as soon as I try to run any ASIO applications that use the audio interface. I also noticed magic ISO randomly blue screening the computer.  I've learned to avoid these BSODs because they are very predictable and the computer feels stable enough, but it also feels a lot slower than it used to be. The problem is that I have no way of actually measuring this, it's only a feeling I have, that something is a miss. If only there was to a way to compare my benchmarks against other systems with similar hardware.  This seems to be mostly noticeable during software installation processes and during draw calls in Windows.  I'm not ruling out that there's a problem with my GTX 460 card, but I think my motherboard is bad and thinking about replacing it. I've ran all diagnostic tools I know of (memtest, scan disk) to rule out memory issues and corrupt drivers. I've tried reinstalling everything, but to no avail. If anyone have any experience dealing with this kind of situation I love to hear about it. Because I hate to throw away money on something which wont fix the problem.  Edit  The motherboard in question is a Gigabyte P55 UD4 R1.1. BIOS F9 from 06/25/2010. Though that reminded me about another problem I have. If I run the @BIOS update utility the computer will BSOD. This used to work fine, but at the same time everything else started to break down, I got instant BSOD if I tried to launch that program.  Edit 2  I'm gonna keep adding to this question for every time I experience another damned and forsaken hardware glitch until I get a satisfactory answer/solution to this.  Today, the computer ran through POST then black, just black. Everything appared to be fine, except no video signal... reboot. same thing, but this time the POST screen never appeared. After a minute or so the video signal came back. I checked the cables, didn't find anything that indicated a loose connection.  I'm placing a order for a new mainboard today.


What to do when a user radically changes their own question?

I'm looking at , which was closed as off-topic a few days ago. Just a few minutes ago, the OP radically revised it; it doesn't even resemble the original question anymore. In fact, the two versions only share about seven words and some punctuation. Here's a screenshot of the most recent revision:    So, the question for the community is this: Is this proper, or should it be rolled back?  Edit: I went ahead and rolled it back because it has a couple of answers already (responding to the old version). But I would still like to know the community consensus on this.


Run as different user from Windows 10 Start Menu

In previous editions of Windows you could hold Shift and then Right Click an application from the Start Menu and you would see the "Run as different user" option. In Windows 10 it just closes the menu.  I know if I do it from the desktop/file explorer it works but I would like to get this working from the Start Menu when you search applications.


There're some easy concepts which I don't get exactly in my mind. I'm afraid I've been studying these things for two years of my engineering but they still bother me. Capacitor is one of them. Can someone explain?    What does a capacitor do? Does it store charges? If so, then how does it do?   I have searched it on Google and Yahoo but didn't find any helpful thing there (for me). So I will be glad if I got my problem solved here.  P.S. I hope that the question would not again be an off-topic, as it always does and moreover people don't suggest then where to go. It's a real sad thing.


I signed up to Stack Exchange to get help from this community and asked a question. Nobody answered and it was down-voted 10 times by this community. I was wondering what could have I done wrong? Have people lost values? Nobody seems to provide any suggestions of rights and wrongs to the least of which I would have really appreciated. It is cowardice.


Is it possible to combine two hash functions in such a way that cracking the constructed hash would require cracking the constituent hashes?

Suppose A is some arbitrary hash function, for example BCrypt or MD5. And B be some other arbitrary hash function, maybe SHA256 or SCrypt. Let passwordHashedWithA = A(password) and  passwordHashedWithB = B(password). If an attacker is given just passwordHashedWithA and finds a pA such that: passwordHashedWithA == A(pA) Then the attacker has performed a successful preimage attack on A. I want to know if it is theoretically possible to construct a hash function C out of two arbitrary hash functions A and B, such that for any A and B, performing a successful preimage attack on C would require performing a preimage attack on both A and B. The question can be extended to build C from N arbitrary hash functions. I strongly suspect that this is theoretically impossible; it seems like a free lunch. But I cannot begin to think how to prove it. If such a thing does exist then it would be incredibly useful: we could combine old, proven hashes like BCrypt with slightly newer and fancier hashes like SCrypt, such that we have the best of both worlds. Like I said - sounds too much like a free lunch. I am asking this from a theoretical perspective, I'm aware that BCrypt or SCrypt are probably good enough for most production systems. I'm looking for a proof that this is impossible, or a construction of C that provides these properties. Examples of C that don't work Suppose we try C(password) = A(password) + B(password) where + is just concatenation of the hashes. The result of this is obviously a weaker hash: we can preimage C by finding the original password by cracking  A or B. If we try C(password) = A(B(password)), this initially looks stronger but you really can't say much about C without looking at the specifics of A and B. For example if A was a completely useless hash that always returned a constant string, the strengths in B would be irrelevant, and any string would be a preimage of C.


Do I get the regular download link to download Ubuntu in folder not an ISO file

How to get Ubuntu download in folder format not iso


Checking if two strings? are identical and returning true if they are

I have a question regarding comparing two strings? and checking if they are identical. Below is the question explenation  // returns true if f.makeMolecular() is is equal to this.makeMolecular      // e.g. terms = {Term('B',3),Term('A',6)} and f = {Term('B',1),Term('A',3),Term('B',1),Term('A',3)}      // would return true      // The makeMolecular() method sorts the Term Strings into Alphabetical order with the number linked to the letter added and following behind the letter.    E.G  Both of the makeMolecular should return a string of "A6B3"  I want to check if  they are identical using and IF statement and taking advatange of the == method in Java.  Below folows one solution to checking if the strings are identical, but as mentioned i would like to do it with an iff statement.    {    this.makeMolecular();     f.makeMolecular();     return identical(f);    }   This is what i have tried so far:  char b = f.makeMolecular();   char b = f.makeMolecular();    if (a==b){       return true;     }     else{         return false;     }   and i get the following error: Incompatible types: void cannot be converted to char. I am quite certain the use of "char" is incorrect here, but i am not sure of what to use instead.  So I am wondering how to convert these strings(?) to a constant and then checking if  they are identical via an IF-statement.  // Edit:  By request; this is the method for  makeMolecular()  public void makeMolecular() {      char element = ' ';     int atoms = 0;     ArrayList<Term> mol = new ArrayList<Term>();      while (terms.size() > 0){         if (mol.size() > 0 && mol.get(mol.size() - 1).getElement() == nextElement().getElement()  ){             atoms = mol.get(mol.size() - 1).getAtoms() + nextElement().getAtoms();             element = nextElement().getElement();             mol.remove(mol.size() - 1);             mol.add(new Term(element,atoms));         }         else {             mol.add(nextElement());         }         terms.remove(nextElement());     }      terms = mol; }


Finding the number of zeros of $f(z) = z^n$ if $|f(z)| < 1 $ for all $z$ with $|z|=1$.

Suppose $f: \overline{\mathbb{D}} \to \mathbb{C}$ is continuous, analytic in $\mathbb{D}$ and satisfies $|f(z)|<1$ for $|z|=1$. Find the number of solutions to the equation $f(z) = z^n$ where $n$ is a positive integer. ($\mathbb{D}$ is the unit disk).  Some of my own attempts: Using the Maximum/Minimum Principle, we can split up the the problem in $2$ parts: Suppose $f$ is constant. It then holds that $z^n = c$ has exactly $n$ zeros because of the fundamental theorem of algebra.  Suppose $f$ is not constant. It holds that $f$ has at least one zero  in $\mathbb{D}$. It of course also holds that $z^n$ has a zero of multiplicity $n$ at the origin. I think I'm supposed to hit with stuff like Rouché's theorem, the Argument Principle or Schwartz lemma, but nothing seems to fit.   Thanks in advance.


Nginx 1 FastCGI sent in stderr: “Primary script unknown”

My first time using Nginx, but I am more than familiar with Apache and Linux. I am using an existing project and when ever I am trying to see the index.php I get a 404 File not found.  Here is the access.log entry:  2013/06/19 16:23:23 [error] 2216#0: *1 FastCGI sent in stderr: "Primary script unknown" while reading response header from upstream, client: 127.0.0.1, server: localhost, request: "GET /index.php HTTP/1.1", upstream: "fastcgi://127.0.0.1:9000", host: "www.ordercloud.lh"   And here is the sites-available file:  server {     set $host_path "/home/willem/git/console/www";     access_log  /www/logs/console-access.log  main;      server_name  console.ordercloud;     root   $host_path/htdocs;     set $yii_bootstrap "index.php";      charset utf-8;      location / {         index  index.html $yii_bootstrap;         try_files $uri $uri/ /$yii_bootstrap?$args;     }      location ~ ^/(protected|framework|themes/\w+/views) {         deny  all;     }      #avoid processing of calls to unexisting static files by yii     location ~ \.(js|css|png|jpg|gif|swf|ico|pdf|mov|fla|zip|rar)$ {         try_files $uri =404;     }      # pass the PHP scripts to FastCGI server listening on 127.0.0.1:9000     #     location ~ \.php {         fastcgi_split_path_info  ^(.+\.php)(.*)$;          #let yii catch the calls to unexising PHP files         set $fsn /$yii_bootstrap;         if (-f $document_root$fastcgi_script_name){             set $fsn $fastcgi_script_name;         }          fastcgi_pass   127.0.0.1:9000;         include fastcgi_params;         fastcgi_param  SCRIPT_FILENAME  $document_root$fsn;          #PATH_INFO and PATH_TRANSLATED can be omitted, but RFC 3875 specifies them for CGI         fastcgi_param  PATH_INFO        $fastcgi_path_info;         fastcgi_param  PATH_TRANSLATED  $document_root$fsn;     }      location ~ /\.ht {         deny  all;     } }   My /home/willem/git/console is owned by www-data:www-data (my web user running php etc) and I have given it 777 permissions out of frustration...  My best guess is that something is wrong with the config, but I can't figure it out...  UPDATE So I moved it to /var/www/ and used a much more basic config:  server {     #listen   80; ## listen for ipv4; this line is default and implied     #listen   [::]:80 default ipv6only=on; ## listen for ipv6      root /var/www/;     index index.html index.htm;      # Make site accessible from http://localhost/     server_name console.ordercloud;      location / {         root           /var/www/console/frontend/www/;                 fastcgi_pass   127.0.0.1:9000;                 fastcgi_index  index.php;                 fastcgi_param  SCRIPT_FILENAME  /var/www;             include        fastcgi_params;     }      location ~ \.(js|css|png|jpg|gif|swf|ico|pdf|mov|fla|zip|rar)$ {             try_files $uri =404;         }      location /doc/ {         alias /usr/share/doc/;         autoindex on;         allow 127.0.0.1;         deny all;     }  }   Also if I call localhost/console/frontend/www/index.php I get a 500 PHP which means it is serving there. It just isn't serving off console.ordercloud ...


If $a\equiv b \pmod m$, prove that $\frac{a}{\gcd(a,b)}\equiv \frac{b}{\gcd(a,b)} \pmod{ \frac{m}{gcd(m,(a,b))}}$

This is one of the basic properties of modular arithmetic: $$a\equiv b \pmod m \Longleftrightarrow \dfrac{a}{\gcd(a,b)}\equiv \dfrac{b}{\gcd(a,b)} \pmod{ \dfrac{m}{\gcd(m,\gcd(a,b))}}.$$ How would I prove it rigorously?


How to draw a two dimensional graph in LaTeX?

I have a set of data containing x-values and y-values. Say x=1,3,5,7,9 and y=26,28,30,28,26.   How to plot it in LaTeX? The graph will be a straight line increasing till x=5, and then will start decreasing on x=7,9.


Does salt do anything more for baked products than just add flavor?

From a chemical scientific stand point... What roles does salt play in food besides the usual afterthought of sprinkling some on top of your food item to increase/enhance the flavor.  I know this is vague so lets just say bread.  Why all these years have chefs/food scientist bothered adding salt to almost every bread recipe?    Does salt control moisture?  Does salt control yeast activity? does salt control sugar regulation between the yeast through osmosis?   (Side not: Sorry if some of this is worded oddly.  There thoughts straight off the brain.)


When is the exponential map between matrices injective?

Consider a complex matrix $A$. When does $e^A=e^B$ imply $A=B$?  Is there any general statement that can be made as to when this holds?  It is clearly not true in general, a trivial example being when $A$ and $B$ are diagonal in the same basis but with eigenvalues differing by $2\pi i\mathbb Z$. This is also mentioned .   also seems to provide an answer to this question, but I'm not familiar with the theory of Lie algebras so I'm not sure, and I wouldn't know how to translate it into more elementary statements about matrices (if that is even possible).