My 4 month old son happily sleeps soundly for hours at a stretch during the day but when it comes to the night he won't go to sleep until 4 - 5am and when he does go down, he fidgets himself awake.   He suffered from really bad wind and reflux which kept him up until 5am and now his wind and reflux is getting better, his bed time just seems to be stuck at 5am.   We are trying to adjust his bed time by limiting his naps during the day (he currently has 3 naps daily between 1-2 hours), and putting him down at the earlier cycle (usually around 2am) but even when he goes to sleep, he's up after half an hour and then up until 5am. We are also waking him up around 11/12 but don't want to deprive him of sleep. We currently have a bedtime routine of bath, baby massage and feeding to sleep. We also control the light so it's bright and loud during the day and quiet and dark in the evenings.   Is there any advice on how to change a baby's sleep pattern without depriving them of sleep and avoiding controlled crying?
So our 6-month-old boy still doesn't sleep through the night. He still wakes up at least once and wants to eat.  He takes 3 naps during the day, ranging from 30 minutes to 1.5 (sometimes 2) hours.  We usually put him down for the night at least 2 hours after his latest nap, but we haven't been able to get him down to 2 naps per day because he gets pretty cranky during the evenings. Depending on the duration and times of his naps, his bedtime ranges between 10 and midnight.  We have started feeding him a small amount (2 tablespoons dry) of rice cereal after his morning and evening naps in the hopes that he'll have a fuller stomach through the night, but he still wakes up hungry after sleeping between 3 and 6 hours. I can handle the 6 hours, since that means I get 6 hours of pretty much uninterrupted sleep, but it's usually more like 3-4.  Any suggestions?
I'm trying to migrate a MySQL-based app over to Microsoft SQL Server 2005 (not by choice, but that's life).  In the original app, we used almost entirely ANSI-SQL compliant statements, with one significant exception -- we used MySQL's group_concat function fairly frequently.  group_concat, by the way, does this: given a table of, say, employee names and projects...  SELECT empName, projID FROM project_members;   returns:  ANDY   |  A100 ANDY   |  B391 ANDY   |  X010 TOM    |  A100 TOM    |  A510   ... and here's what you get with group_concat:  SELECT      empName, group_concat(projID SEPARATOR ' / ')  FROM      project_members  GROUP BY      empName;   returns:  ANDY   |  A100 / B391 / X010 TOM    |  A100 / A510   So what I'd like to know is: Is it possible to write, say, a user-defined function in SQL Server which emulates the functionality of group_concat?   I have almost no experience using UDFs, stored procedures, or anything like that, just straight-up SQL, so please err on the side of too much explanation :) It is usually said that existence of discrete spacetime violates Lorentz symmetry. What quantity is used to quantify such violation? I mean could someone points a reference for a derivation that shows such analysis.  My other question is: if Lorentz symmetry is violated, does that imply space-time is discrete? or not necessarily?) I would like to clarify the differences between by value and by reference.  I drew a picture     So, for passing by value,  a copy of an identical object is created with a different reference, and the local variable is assigned the new reference, so to point to the new copy  How to understand the words: " If the function modifies that value, the modifications appear also within the scope of the calling function for both passing by value and by reference "  Thanks! How can I have a "Dear %firstname%" template in my Gmail? It seems to be a very easy thing but I am struggling to see how. I need a "Dear %firstname%,  [cursor here] Kind Regards etc" template in my Gmail account, so every time I click reply, it is already there. How can I do that? How to prove that the ideal $I=(x^3-y^2)$ in $k[x,y]$ is prime?    I have constructed a map from $k[x,y]$ to $k[t]$, which maps $x$ to $t^2$, and $y$ to $t^3$. Then, I want to show that the kernel is exactly $I$. But the difficulty is that how to prove the kernel is contained in $I$.  Could you help me? Thanks a lot! I've noticed confusing definitions about permutation and substitution, preventing me from understanding the difference.  A permutation changes the order of distinct elements of a set, but this can be written as a function changing one element by another, exactly as a substitution.  So, how exactly can we distinguish between these two notions?  This question is interesting since we have these two notions in block ciphers, in which S-boxes perform substitution. The problem is that this table is used to replace one element by another, exactly like a permutation. I need to get rid of the GNOME Desktop Environment which has been installed by default when I updated my pc from 15.10 to 16.04.  After a while, I found myself not only with GNOME DE, but also with Cinnamon alongside (in the login screen, I could choose at least five or six DE!)  Now I am using Unity, and I'm happy with that, and I successfully uninstalled Cinnamon, but now I'm afraid that after uninstalling GNOME I will mess up the Unity DE, since I see many packages running in unity with the packagename starting with gnome-... Would someone mind to help me? Thx in advance Inverse of function is continuous or not? If $f:I\subseteq \Bbb R \rightarrow \Bbb R$ is injective and everywhere continuous in its domain then $f^{-1}$ is also continuous everywhere. Here  $I$ cannot be discrete set and $f$ is single variable function The above statement is always correct or not? I thought it is always correct. Am I correct or not? How would I prove there is no smallest positive rational number? what is the best method to prove this statement? Should there always be a comma after "therefore","However" etc.? Adding the consensus to review's history Book set in contemporary times about a travel writer who is inducted into the world of the supernatural Is it possible to make LaTeX mark overfull boxes in the output? Is it possible to make LaTeX mark overfull boxes in the output, for example by drawing red rectangles in the PDF where the boxes overflow? The purpose -- to more easily "see" where the problems are in the output. How do you clone an Array of Objects in Javascript? Proof a $2^n$ by $2^n$ board can be filled using L shaped trominoes and 1 monomino I just bought a SATA SSD, and wish to install Windows 7 directly on it, but when Windows asks me where do I want to install it, it doesn't recognize any drives.   I have disconnected all my other HDDs My BIOS recognizes the SSD. I went back to my original installation of Windows and my SSD is recognized Installing Wine on 64 Bit I have tried to install wine through the software center and terminal and I get this error.  chris@ubuntu:~$ sudo apt-get install wine1.5 [sudo] password for chris:  Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  wine1.5 : Depends: wine1.5-i386 (= 1.5.16-0ubuntu1) but it is not installable            Recommends: gnome-exe-thumbnailer but it is not going to be installed or                        kde-runtime but it is not going to be installed            Recommends: ttf-droid            Recommends: ttf-mscorefonts-installer but it is not going to be installed            Recommends: ttf-umefont but it is not going to be installed            Recommends: ttf-unfonts-core but it is not going to be installed            Recommends: winbind but it is not going to be installed            Recommends: winetricks but it is not going to be installed E: Unable to correct problems, you have held broken packages. Repeat copies of array elements: Run-length decoding in MATLAB How can a distribution have infinite mean and variance? It would be appreciated if the following examples could be given:   A distribution with infinite mean and infinite variance. A distribution with infinite mean and finite variance. A distribution with finite mean and infinite variance.  A distribution with finite mean and finite variance.   It comes from me seeing these unfamiliar terms (infinite mean, infinite variance) used in an article I am reading, googling and reading a thread on the , and not finding it a sufficiently clear explanation. I also haven't found any explanations in any of my own textbooks. Circles importing as crossed boxes into Adobe Illustrator