I am new to data analysis and now working on a Mixed Effects Logistic Regression Model.Currently I have a data frame (model_data) that looks like the following:  Vehicle_id    entry_time         exit_time          last_veh_time  vehicle_type  __________     ___________       __________        ____________    ____________     1        2017-01-31 00:00:00  2017-01-31 00:00:00    300         4 wheel    status _______   0    Likewise, I have information(nearly a million rows) on all vehicles entering a place and exiting the same place. status can be either 1 or 0 for all of these. last_veh_time is the last vehicle passed the same place before how much time. I want to know the probability of a getting status 0 for a vehicle based on entry_time and last_veh_time. So here my response is status and which will be my dependent variable?Is it entry_time and  last_veh_time?Any help is appreciated
I am new to data analysis and now working on a Mixed Effects Logistic Regression Model.  Currently, I have the following data frame (model_data):  Road Id Vehicle_id  entry_time           exit_time          1        1        2017-01-31 00:00:00  2017-01-31 00:00:00 last_veh_time  vehicle_type     status 300            4 wheel          0    Likewise, I have the information (nearly a million rows) of all the vehicles entering a place and exiting the same place.  Status can be either $1$ or $0$ for all of these.  last_veh_time is the last vehicle passed the same place before how much time.    I want to know the probability of a getting status $0$ for a vehicle based on the entry_time and last_veh_time. To do this, I created the model:   model = glmer(status ~last_veh_time + (1 |link ),               data=model_data, REML=FALSE)   Is this the right approach?  Any help is appreciated.
At the onset of my live usage in Ubuntu Gnome 15.10, use a bash script to set the colour of my gnome-terminal. The code used is link=/org/gnome/terminal/legacy/profiles:/:b1dcc9dd-5262-4d8d-a863-c897e6d979b9 dconf write $link/background-transparency-percent '10' dconf write $link/scrollback-unlimited true dconf write $link/use-theme-colors false dconf write $link/use-theme-transparency false dconf write $link/use-transparent-background true dconf write $link/foreground-color 'rgb(0,43,54)' dconf write $link/background-color 'rgb(131,148,150)'  The last 2 lines of the code give a key-value error. When I look at the dconf-editor org&gt;gnome&gt;terminal&gt;legacy&gt;profiles:&gt;{Default profile} the attributes  foreground-color background-color  are unavailable. How do I get rid of the error? Note: When done manually via gnome-ternimal&gt;Edit&gt;Profile Preferences&gt;Colours&gt;Built-in schemes the above attributes appear in the same location in dconf-editor. Why does lightning emit light? What exactly is causing the electric discharge coming from the clouds to emit light while traveling through the air. I've read and thought about it a little but with my current knowledge I cant really figure what is happening at a subatomic level. In other words, what causes the emission of photons during lightning. What I want to know is, is there some sort of collisions taking place that produces the photons we see, or is it some other interaction that is causing it?. I don't know too much about particle physics, I've only read a couple of pages in the Introduction to Elementary Particles by Griffihts. So if you could keep the answer simple then that would be great. Sorting hashmap based on keys What formula should be used to determine "hot" questions? Disappointed to see that the 18.04 installer no longer offers the option to encrypt the home directory. According to  bug report referenced in the installer, the recommended method for encryption these days is full-disk with LUKS, or fscrypt for directories. Full-disk encryption seems a bit overkill for my needs, and all the bugs and caveats mentioned on the  don't make it a very attractive option. All I really want is to protect my home directory from someone accessing my documents, photos, etc. if my laptop were to get stolen, making fscrypt the option for me.  The  has some examples on how to set it up, but I can't find any documentation aimed at encrypting the home directory on Ubuntu. The old ecryptfs tool is still available, but after setting it up Ubuntu would sometimes freeze at the login screen.  So my question is: How do I setup fscrypt to encrypt my /home directory and decrypt when I log in? I also liked how ecryptfs allowed decrypting the folder manually (eg. from disk images).  (A similar question was posted  and was unfortunately closed for being an "off-topic" bug report. To clarify, this is not a bug report. The fact that the encrypt home directory option was removed from the installer was intentional. All I'm asking here is how to setup fscrypt.) Difference between Hashing a Password and Encrypting it How do I connect to a MSSQL database using Perl's DBI module in Windows? How do I connect to a MSSQL database using Perl's DBI module in Windows? Why Does the Transaction Log Keep Growing or Run Out of Space? How can I unlock my phone? I locked it using Android Device Manager, but it claims I entered a wrong password I have an Samsung Galaxy S3 Neo.  Bus 002 Device 042: ID 04e8:6860 Samsung Electronics Co., Ltd GT-I9100 Phone [Galaxy S II], GT-I9300 Phone [Galaxy S III], GT-P7500 [Galaxy Tab 10.1]   The keyboard &amp; language setting is português.  I today installed Android Device Manager and to test it's functionality I locked the phone with the password: "abcd" (4 letters were required).  After entering the password and confirming with the "OK" button of my keyboard, the phone showed me that the password is wrong. "Senha incorreta".  I reset the password after some tries to "123456" and the phone reloaded the lock screen. Again the password showed up to be wrong. I also tried the alphabetic password: "abcdefg" - same error.  I changed the language of my Google account from German to Portuguese and reset the password to "123456" again and I tried to really reboot my phone and unlock the SIM card again. But anyways I can not get through my lock of the Android Device Manager.  I tried to enter the password 35 times wrong with hope to get a chance to authenticate with my Google Account login.  I also tried to connect the phone with adb but it does not show up in this state with:  adb devices   So what can I do to get access to my phone again? Using the expression "the same" for a previously mentioned item Heap versus Stack allocation implications (.NET) From an 1 about Heap and Stack, it raised me a question: Why it is important to know where the variables are allocated?  At  someone pointed that the stack is faster. Is this the only implication? Could someone give a code example where a simple allocation location change could solve a problem (eg. performance)?  Note that this question is .NET specific  1 the question is removed from SO. I have a scenario where I have multiple threads adding to a queue and multiple threads reading from the same queue. If the queue reaches a specific size all threads that are filling the queue will be blocked on add until an item is removed from the queue.  The solution below is what I am using right now and my question is: How can this be improved?  Is there an object that already enables this behavior in the BCL that I should be using?  internal class BlockingCollection&lt;T&gt; : CollectionBase, IEnumerable {     //todo: might be worth changing this into a proper QUEUE      private AutoResetEvent _FullEvent = new AutoResetEvent(false);      internal T this[int i]     {         get { return (T) List[i]; }     }      private int _MaxSize;     internal int MaxSize     {         get { return _MaxSize; }         set         {             _MaxSize = value;             checkSize();         }     }      internal BlockingCollection(int maxSize)     {         MaxSize = maxSize;     }      internal void Add(T item)     {         Trace.WriteLine(string.Format("BlockingCollection add waiting: {0}", Thread.CurrentThread.ManagedThreadId));          _FullEvent.WaitOne();          List.Add(item);          Trace.WriteLine(string.Format("BlockingCollection item added: {0}", Thread.CurrentThread.ManagedThreadId));          checkSize();     }      internal void Remove(T item)     {         lock (List)         {             List.Remove(item);         }          Trace.WriteLine(string.Format("BlockingCollection item removed: {0}", Thread.CurrentThread.ManagedThreadId));     }      protected override void OnRemoveComplete(int index, object value)     {         checkSize();         base.OnRemoveComplete(index, value);     }      internal new IEnumerator GetEnumerator()     {         return List.GetEnumerator();     }      private void checkSize()     {         if (Count &lt; MaxSize)         {             Trace.WriteLine(string.Format("BlockingCollection FullEvent set: {0}", Thread.CurrentThread.ManagedThreadId));             _FullEvent.Set();         }         else         {             Trace.WriteLine(string.Format("BlockingCollection FullEvent reset: {0}", Thread.CurrentThread.ManagedThreadId));             _FullEvent.Reset();         }     } } Any way to change my review of suggested edit? I goofed and rejected a suggested edit, a vote that was actually directed at the previous edit that I was reviewing. As this is unfair to the user who posted the suggested edit in question, is there any way in which to change/cancel my reject? Show $f(x)=x\ln x$ is not uniformly continuous Show $f:(0,\infty)\rightarrow \mathbb{R}, f(x)=x\ln x$ on $(0,\infty)$ is not uniformly continuous.    I think that the general way to prove that something is not continuous in a metric space is to let $\epsilon=...$ and show that $\forall\delta&gt;0$, $d&#39;(f(x)-f(y))&gt;\epsilon$. I can't use the Mean Value Theorem because we haven't gone over it yet.    Here's an attempt: Let $\epsilon=1$. Without loss of generality, let $x&gt;y&gt;0$. $|x\ln x-y\ln y|&lt;|(x-y)(\ln x)|\leq|x-y||\ln x|$...$\delta=\frac{\epsilon}{\ln x}$ and therefore doesn't work for all $x$? $3$ never divides $n^2+1$ Problem: Is it true that $3$ never divides $n^2+1$ for every positive integer $n$? Explain.  Explanation: If $n$ is odd, then $n^2+1$ is even. Hence $3$ never divides $n^2+1$, when $n$ is odd.  If $n$ is even, then $n^2+1$ is odd. So $3$ could divide $n^2+1$.  And that is where I am stuck. I try to plug in numbers for $n$ but I want a more general form of showing that $3$ can't divide $n^2+1$ when $n$ is even. How can I find posts related to lost reputation due to a "user was removed" message? Today I noticed that my reputation got truncated by 64 points, and when I looked at my reputation history, I saw  notifying me of points removal along to a "user was removed" message. Each has a slightly different timestamp, ranging from 12:39:04 to 12:39:43.    I can't find the questions/answers concerned by this (and I don't remember having won as much as 65 points once, making this even stranger). I would like to find out how I could have lost 65 points while I never won as much in a single question/answer.  Is there a way I can check which of my posts were impacted? I came across a phrase for a type of question which is designed to discover someone's religious background, particularly in the context of sectarianism and divided societies but can't for the life of me remember it.   For example, if you are in Scotland and I ask you what football team you support, that may reveal your religion. Or in N.Ireland, if I ask what school you attend, likewise that may do the same.  It's like a 'veiled question' only that's not the term I'm looking for. Any help appreciated.  I've a feeling that the second part of the phrase is (question) as in, a INSERT TERM question, but not 100% sure. Ok, so at my school, everybody was supplied with a Macbook Pro. I set up the Messages app and it was all great until the county decided to block it. Now, instead of receiving text messages on my phone they go to my Mac. I have no idea how to fix this because I can't open the Messages app. Please help?! How do I show that the sum $(a+\frac12)^n+(b+\frac12)^n$ is an integer for only finitely many $n$? Show that if $a$ and $b$ are positive integers, then $$\left(a +\frac12\right)^n + \left(b+\frac{1}{2}\right)^n$$is an integer for only finitely many positive integers $n$.   I tried hard but nothing seems to work. :( The iOS-app should provide (at least) the same features as the site and the ability to edit your profile is not so unimportant.  In my opinion, the user should be able to change the every single info-field in his profile (including, but not limited to nickname, description, profile picture) by pressing an "Edit" button which should be located somewhere on his or her profile view.