text
stringlengths 3
1.74M
| label
class label 2
classes | source
stringclasses 3
values |
|---|---|---|
Ex broke up with live in GF. Hi All
First, thanks in advance for any input or advice, especially if you have gone through something similar.
Background:
I (34/F) live with my fiancee (35/m) and my daughter (9). We have all been living together for 3 years. Prior to that, my daughter and I lived alone from when she was 14 months. My ex (36/m) lives about 1 1/2 hours away and has our daughter every other weekend. He has been living with his girlfriend (25?) for about three years, dating for about the same amount of time. My daughter LOVES the girlfriend. She is a preschool teacher and spends a lot of time doing cool activities when my daughter visits. They paint nails, cook, play, etc... THe Girlfriend is awesome and only over-stepped once. I said something to my ex and it immediately stopped. She is nice and polite where the ex is generally scowly and ignores me and my fiancee. I like The Girlfriend even though I can't figure out why the hell she is with my ex. When my daughter comes home from weekends at her dad's, she talks about The Girlfriend. When I ask about her dad, she says that her dad played video games and slept... Not all of the time, but a lot of the time.... for the past THREE YEARS.
The problem:
My ex called me on Thursday. He broke up with The Girlfriend. She is gone and not coming back- not even to say goodbye to our daughter. This is his weekend with our daughter. He didn't want our daughter to be upset and cry. To which I respond that she SHOULD cry because it is healthy and an appropriate response. I also say that he should let our daughter know that HE is also sad as a way to validate her feelings.
Here is where I need help...
What do I say to my daughter? Part of me is pissed off at my ex for being an idiot and letting The Girlfriend forge such a close relationship with our daughter if this wasn't a relationship that was going anywhere. I asked him a year ago if he thought this was it for him and he wasn't sure. Well that's fine, but on your weekends don't sit on your ass and let the GF take over!
The other part of me is so sad for my daughter. She lost someone who she considered to be a parental figure without any warning and no chance to say goodbye. I want to help her through this, but I don't know how... My daughter can be very emotional and sometimes struggles to display her emotions. I'm worried that she will bottle this up and won't talk about it with me. I don't trust my ex to talk about it with her... His plan is to put on a happy face and pretend everything is hunky dory. Our daughter is 9, not 4... pretending isn't going to help her. I've thought about having her write The Girlfriend a letter. I feel like having The Girlfriend fade away gradually is a far better way to deal with this then just cutting her out completely. Shouldn't our daughter at least get to say goodbye, get her address and send her a note on occasion??
UPDATE: Ex's sister is going to give The Girlfriend my phone number and address if she hears from her. If she doesn't make contact in the next week or so, I will call/ Facebook The Girlfriend. I haven't called during one of their visits in years, but I did call today to check on them. The ex and daughter are having a good weekend so far and playing lots of games and doing stuff. I didn't mention The Girlfriend to my daughter. We just picked on her dad because he was losing the game they were playing- all in good fun to keep them both smiling. | 0non-cybersec
| Reddit |
Grub menu not being shown after installation of kubuntu 15.04. <p>I am using windows 10 ( upgraded from 8.1 ) and I installed kubuntu 15.04 using a bootable usb. I installed this into sda5 with 40GB capacity. I also created a swap partition of 8GB. After installation when it asked me to reboot, I did so. No GRUB menu was being shown and the system went directly into windows 10. Inside windows, the partitions (40GB and 8GB) were shown as RAW file systems and I am asked to format those when I try to access them from Windows. In UEFI boot settings, I had enabled legacy boot and disabled secure boot for installing kubuntu. </p>
<p>Please help me in bringing out the GRUB menu so that I can use kubuntu from the start itself. Otherwise I have to go to UEFI boot options each time and select boot from Notebook Hard disk option. Also when Windows starts it shows "Scanning and repairing drive(J)". (One of the above mentioned partitions) </p>
| 0non-cybersec
| Stackexchange |
Prove that if $p_1,\dots,p_k$ are distinct odd primes then 1 has $2^k$ square roots $\mod m$ where $m$ is the product of the primes.. <p>I think I am most of the way through this proof but I am stuck. Here was my approach: I looked at the square roots of $1$ mod $105$, and noticed that each one corresponded to one less than an integer multiple of a subset of the prime factors of $105$, i.e. we have for instance $71=24\cdot3-1$ or $29=2\cdot(3\cdot 5)-1$ and so on. I conjectured that given a subset of the prime factors of $m$, I could construct a unique square root of $1$ mod $m$, which would show that there are (at least) $2^k$ of them.</p>
<p>So I did that and I think that it worked. Pick some set of the prime factors of $m$, say $p_{a_1},\dots,p_{a_j}$. Claim: we can find a corresponding $n$ such that $n\prod_{i=1}^jp_{a_i}-1$ is a square root of $1$ mod $m$.</p>
<p>Proof: We are looking for a solution to </p>
<p>$$\left(n\prod_{i=1}^jp_{a_i}-1\right)^2\equiv 1 \pmod m$$
which may be rewritten as </p>
<p>$$\left(\prod_{i=1}^jp_{a_i}\right)^2n^2 - 2\prod_{i=1}^jp_{a_i}n\equiv 0 \pmod m$$</p>
<p>Now since $\prod_{i=1}^jp_{a_i}|m$ we may write this as $$\prod_{i=1}^jp_{a_i}n^2-2n \equiv 0\mod \frac{m}{\prod_{i=1}^jp_{a_i}}$$</p>
<p>or</p>
<p>$$n\left(\prod_{i=1}^jp_{a_i}n-2\right) \equiv 0 \mod {\frac{m}{\prod_{i=1}^jp_{a_i}}}$$</p>
<p>This has solutions when $n\equiv0\mod \frac{m}{\prod_{i=1}^jp_{a_i}}$ or when $\prod_{i=1}^jp_{a_i}n-2\equiv 0 \mod \frac{m}{\prod_{i=1}^jp_{a_i}}$. In the first case we end up with the same root for any choice of $p_{a_i}$'s so that's sort of a degenerate one. But in the second case we have $\prod_{i=1}^jp_{a_i}n\equiv 2 \mod \frac{m}{\prod_{i=1}^jp_{a_i}}$, which has a unique and nonzero solution for $n$. Plugging that $n$ back into $n\prod_{i=1}^jp_{a_i}-1$ thus gives a square root of $1$ mod $m$ which corresponds uniquely to your choice of prime factors, thus showing that there are (at least) $2^k-1$ square roots of 1. Then we add 1 in which corresponds to the empty set of prime factors and we get the full $2^k$.</p>
<p>My problem is ruling out the possibility of <em>more</em> square roots of 1, i.e. if $x^2\equiv1\mod m$ I need to show that it corresponds uniquely to something of the form $n\prod_{i=1}^jp_{a_i}-1$. This is proving to be difficult if not impossible.</p>
<p>I put a lot of work into going the one way and I really don't want it all to be for nothing. Can anyone see a way to go the other direction?</p>
| 0non-cybersec
| Stackexchange |
The best part is the dog licking him as if to say, "thanks for showing me that buddy.". | 0non-cybersec
| Reddit |
Farmville: What is it teaching people?. | 0non-cybersec
| Reddit |
DevOps vs Docker. <p>I am wondering how exactly does docker fit into CI /CD .
I understand that with help of containers, you may focus on code , rather than dependencies/environment. But once you check-in your code, you will expect tools like TeamCity, Jenkins or Bamboo to take care of integration build , integration test/unit tests and deployment to target servers ( after approvals) where you will expect same Docker container image to run the built code.
However, in all above, Docker is nowhere in the CI/CD cycle , though it comes into play when execution happens at server. So, why do I see articles listing it as one of the things for DevOps.
I could be wrong , as I am not a DevOps guru, please enlighten !</p>
| 0non-cybersec
| Stackexchange |
If $M_c$ is finitely generated, then it is a principal ideal.. <p>The following question is a part of <a href="https://math.stackexchange.com/questions/1447559/m-a-f-in-c0-1-fa-0-for-a-in-0-1-is-m-a-finitely-gene?rq=1">this</a> problem. </p>
<p>Let <span class="math-container">$R = \{ f: [0,1] \to \mathbb{R} \; | \; f \text{ is a continuous map} \}$</span> be the ring of continuous functions. We define <span class="math-container">$M_c = \{ f \in R \; | \; f(c)=0 \}$</span>. It is very easy to prove that <span class="math-container">$M_c$</span> is a maximal ideal. The final result we want to prove is: </p>
<blockquote>
<p><span class="math-container">$M_c$</span> is not a finitely generated ideal.</p>
</blockquote>
<p>One of the claims which I saw while reading from <a href="http://www.math.lsa.umich.edu/~kesmith/593hmwk2-2014-solutions.pdf" rel="nofollow noreferrer">here</a> is the following:</p>
<blockquote>
<p>If <span class="math-container">$M_c$</span> is finitely generated, then it is a principal ideal.</p>
</blockquote>
<p>(Later they use this result that since <span class="math-container">$M_c$</span> is not a principal ideal, and hence <span class="math-container">$M_c$</span> is not finitely generated.)</p>
<p><em>Proof.</em> Assume that <span class="math-container">$M_c = \left<f_1,\dots,f_n\right>$</span>. The function <span class="math-container">$f_{1}^{1/3}$</span> is also in <span class="math-container">$M_c$</span> so write it as <span class="math-container">$\sum_{i=1}^n g_if_i$</span> for some <span class="math-container">$g_i \in R$</span>. Cubing both side, we have:
<span class="math-container">$f_1 = \sum h_if_i$</span> where, in particular, <span class="math-container">$h_1$</span> vanishes at <span class="math-container">$c$</span> (gathering up coefficients of <span class="math-container">$f_1$</span> in <span class="math-container">$(\sum g_if_i)^3$</span>; we see the coefficient <span class="math-container">$h_i$</span> is in the ideal <span class="math-container">$<f_1, \dots, f_n>^2$</span>).</p>
<p>So, <span class="math-container">$(1 − h_1)f_1 \in <f_1, \dots, f_n>$</span>. Since <span class="math-container">$1 − h_1$</span> does not vanish at <span class="math-container">$c$</span>, we can find an interval <span class="math-container">$B = [a, b]$</span> containing <span class="math-container">$c$</span> where it also doesn’t vanish. </p>
<p>Here is what I don't understand: </p>
<p>Doubt: In the ring <span class="math-container">$S$</span> of continuous functions on <span class="math-container">$B, \; 1 − h_1$</span> is a unit, hence on this ring <span class="math-container">$S$</span>, the ideal <span class="math-container">$M_c$</span> is generated by <span class="math-container">$<f_2|_{B}, \dots, f_n|_{B}>$</span>.
How does this follow?</p>
| 0non-cybersec
| Stackexchange |
Missing an elementary step about the frame of strings in Barr-Diaconescu theorem. <p>I'm trying to understand the proof of the Barr-Diaconescu theorem about Boolean covers for Grothendieck sites. Precisely, the versions you can find in Jardine's book "Local Homotopy Theory" or in Mac Lane - Moerdijk "Sheaves in Geometry and Logic", which are essentially the same. That is,</p>
<p><strong>Theorem.</strong> For every Grothendieck topos $\mathcal{E}$ there exists a complete Boolean algebra $\mathcal{B}$ and a topos morphism $p: \mathbf{Sh}(\mathcal{B}) \longrightarrow \mathcal{E}$ such that the inverse image functor $p^* : \mathcal{E} \longrightarrow \mathbf{Sh}(\mathcal{B}) $ is faithful.</p>
<p>Particularly, I'm having troubles with something that must be definitively elementary. In both books the first step goes like this: you take a Grothendieck site $\mathcal{X}$ such that $\mathcal{E} = \mathbf{Sh}(\mathcal{X})$ and you consider the poset of strings of arrows $\mathbf{String}({\mathcal{X}})$ of $\mathcal{X}$, where a <em>string</em> is a sequence of composable arrows in $\mathcal{X}$,</p>
<p>$$
s = \left( U_n \stackrel{\alpha_n}{\longrightarrow} U_{n-1} \stackrel{\alpha_{n-1}}{\longrightarrow} \dots \stackrel{\alpha_1}{\longrightarrow} U_0 \right)
$$</p>
<p>These strings carry a natural partial order, both books say (and here, perhaps, begins my problem):</p>
<p><strong>For two strings $s$ and $t$ we write $t \leq s$ if $t$ prolongs $s$ to the left.</strong></p>
<p>That is, for a string $s$ like the one above, $t$ must be of the form</p>
<p>$$
t = \left( U_{n+m} \longrightarrow \dots \longrightarrow U_{n+1} \longrightarrow U_n \stackrel{\alpha_n}{\longrightarrow} \dots \longrightarrow U_0 \right) \ .
$$</p>
<p>So far so good, but, if I understand everything correctly, now this poset $\mathbf{String}({\mathcal{X}})$ must also be a <em>frame</em>. Because: (1) Mac Lane-Moerdijk says so in his theorem 1; (2) also because the second step of the Diaconescu-Barr theorem (theorem 3.39 in Jardine's book, lemma 3 in Mac Lane-Moerdijk's one) says:</p>
<p><strong>Proposition.</strong> <em>For every frame</em> $\mathcal{S}$ there exists a complete Boolean algebra $\mathcal{B}$ and a topos morphism $i: \mathbf{Sh}(\mathcal{B}) \longrightarrow \mathbf{Sh}(\mathcal{S})$ such that the inverse image functor $i^*: \mathbf{Sh}(\mathcal{S}) \longrightarrow \mathbf{Sh}(\mathcal{B}) $ is faithful.</p>
<p>Hence, you put $\mathcal{S} = \mathbf{String}({\mathcal{X}}) $ in this proposition and you are done: you have the Diaconescu-Barr theorem proved for you. Notice, however, that in the proof of this proposition you do indeed need the frame structure of $\mathcal{S}$.</p>
<p>Ok, so my question is the following:</p>
<p><strong>Question.</strong> Which are the meets $\wedge$ and joints $\vee$ of the frame $\mathbf{String}({\mathcal{X}})$? </p>
<p>Neither book says anything about them, so I imagine this must be an easy exercise -that I'm unfortunately unable to solve. </p>
<p>Let me explain my lack of understanding to you. </p>
<p><strong>(1)</strong> As for joints, I would say that, given strings</p>
<p>$$
s = \left( U_n \stackrel{\alpha_n}{\longrightarrow} U_{n-1} \stackrel{\alpha_{n-1}}{\longrightarrow} \dots \stackrel{\alpha_1}{\longrightarrow} U_0 \right)
$$</p>
<p>and </p>
<p>$$
t = \left( V_m \stackrel{\beta_m}{\longrightarrow} V_{m-1} \stackrel{\beta_{n-1}}{\longrightarrow} \dots \stackrel{\beta_1}{\longrightarrow} V_0 \right)
$$</p>
<p>their meet could be something like the $0$-string </p>
<p>$$
s \vee t = U_0 \sqcup V_0 \ ,
$$</p>
<p>where $\sqcup$ is the coproduct in the category $\mathcal{X}$: by definition, we have morphisms $U_0 \longrightarrow U_0 \sqcup V_0 \longleftarrow V_0$, so both $s$ and $t$ prolong $s\vee t$ to the left. Right.</p>
<p><strong>But:</strong> the existence of coproducts is <em>not</em> included in the definition of the Grothendieck site $\mathcal{X}$, is it?</p>
<p><strong>(2)</strong> As for meets, my lack of understanding is even worse: if $s \wedge t$ should prolong both $s$ and $t$ to the left, then I cannot imagine how every pair of strings $s$ and $t$ could have a meet.</p>
<p><strong>Because,</strong> if there is a string $s\wedge t$ that prolongs <em>both</em> $s$ and $t$ to the left, then shouldn't $s$ and $t$ be essentially the same string (except for having, perhaps, some arrows deleted in one of them with respect to the other)?</p>
<p>I guess the answers to my questions are pretty obvious, but at this moment I'm stuck with them. What am I missing? Thank you for your help, even if you embarras me a lot.</p>
| 0non-cybersec
| Stackexchange |
MRW I walk out of work, realizing it's weekend. | 0non-cybersec
| Reddit |
Finding the limit. <p>I need to find the limit of this problem. I pretty much know you have to multiply by the conjugate but I get lost after I do that.</p>
<p>$$\lim\limits_{x\to 1} \frac{(1 / \sqrt{x}) - 1}{1-x}$$</p>
| 0non-cybersec
| Stackexchange |
Which products have you blacklisted and why?. I'd like to see which products break people out, don't hold up to their claims, just really sucked, etc.
I'll start. I have blacklisted Guerlain bronzers because the second they touch my skin, it's an instant burn. I think it's the perfume or talc, not sure though. | 0non-cybersec
| Reddit |
Showing that only $(n+1)^{n-1}$ of all the possible $n^n$ choices assure a full car park. <p>This exercise is taken from the site of Queen Mary University of London:</p>
<blockquote>
<p>A car park has <span class="math-container">$n$</span> spaces, numbered from <span class="math-container">$1$</span> to <span class="math-container">$n$</span>, arranged in a row. <span class="math-container">$n$</span> drivers each independently choose a favourite parking space in the park. As each driver enters the park, he drives to his favourite space. If it is empty, he parks there. Otherwise, he continues along the line and parks in the first free space. If all spaces between his favourite and <span class="math-container">$n$</span> are taken, he leaves in disgust.</p>
<p>Show that, out of the <span class="math-container">$n^n$</span> choices of favourite spaces that the drivers can make, just <span class="math-container">$(n+1)^{n-1}$</span> lead to all drivers parking successfully.</p>
</blockquote>
<p>Now, my question is whether my (attempt of ) solution is wrong and what a different approach could be. Here's my idea: proving the claim by (a kind of) induction. It is easy to verify truthfulness for <span class="math-container">$n=1$</span> and <span class="math-container">$n=2$</span>, so having this base case, we shall prove that if the claim holds for all <span class="math-container">$1\le n\le k$</span>, then it does also for <span class="math-container">$n=k+1$</span>.</p>
<p>Let us assume WLOG there is an already established order of appearance of the drivers, since a different order yields the same number of successful choices: it just suffices to swap the drivers. Let us call <span class="math-container">$d_m$</span> the space chosen by the <span class="math-container">$m$</span>-th driver.</p>
<p>Now, consider the cases in which <span class="math-container">$d_1=1$</span>. By inductive hypothesis, the other drivers have <span class="math-container">$n^{n-2}$</span> successful choices. In fact, the same goes for all the other <span class="math-container">$n-1$</span> choices of the first driver, so that in total, as a "first outcome", we have <span class="math-container">$\color\red{n^{n-1}}$</span> successful choices. We somewhat can do the same reasoning with the second driver, but we must keep in mind that for each of his choices, we have already counted those in which the first driver occupies the other spaces. For example, we need to subtract the successful cases in which at the same time <span class="math-container">$d_2=1$</span> and <span class="math-container">$d_1=2$</span>: that is <span class="math-container">$(n-1)^{n-2}$</span>. This happens for all the spaces not chosen by the second driver, and so we actually need to subtract <span class="math-container">$(n-1)^{n-1}$</span>. Finally, letting vary <span class="math-container">$d_2$</span> yields the "second outcome" <span class="math-container">$\color\red{n^{n-1}-n(n-1)^{n-1}}$</span>. And so on, and so on. The final outcome would be the sum of all the red expressions. However I'm afraid no nice power would be a result of this. Is there a mistake in my reasoning?</p>
| 0non-cybersec
| Stackexchange |
recurrence formula for *i*-th Chern class of $CP^n$. <p>one can show that the relation between first Chern class and second Chern class of $CP^n$ is</p>
<p>$\frac{2(n+1)}{n} c_2 (M)=c_1 (M)^2$ </p>
<p>here $c_1 (M)^2=c_1 (M)∧c_1 (M)$.
So is there any recurrence formula for <em>i</em>-th Chern class of $CP^n$ ?</p>
| 0non-cybersec
| Stackexchange |
Preorders for Atari VCS live on Indiegogo.. | 0non-cybersec
| Reddit |
Why You Don't Mess With The Queens Guard Funniest Montage. | 0non-cybersec
| Reddit |
When the initial capacity of the HashSet (i.e 16) gets filled up how is the new capacity is calculated? What is the formula?. <p>When the initial capacity of the HashSet (i.e 16) gets filled up how is the new capacity is calculated? What is the formula?</p>
<p>for example:
as the size of array list increases by the formula
New capacity = (current capacity * 3/2) + 1 </p>
<p>and for vectors it is
New capacity = (current capacity * 2)</p>
| 0non-cybersec
| Stackexchange |
Taken at Second Sky. | 0non-cybersec
| Reddit |
Gremlin, Me, Acrylic on Wood, 2020. | 0non-cybersec
| Reddit |
YSK that if you use Google Chrome, you can highlight text and drag it to the "new tab" button to do a Google Search for the highlighted material. This is quicker than any other method.. | 0non-cybersec
| Reddit |
Franco-Prussian War, Battle of Sedan, 1 September 1870. This image is considered to be the first actual photograph taken of a battle. It shows a line of Prussian troops advancing. The photographer stood with the French defenders when he captured this image. [1459x859]. | 0non-cybersec
| Reddit |
Name this paradox about most common first digits in numbers. <p>I remember hearing about a paradox (not a real paradox, more of a surprising oddity) about frequency of the first digit in a random number being most likely 1, second most likely 2, etc. This was for measurements of seemingly random things, and it didn't work for uniformly generated pseudorandom numbers. I also seem to recall there was a case in history of some sort of banking fraud being detected because the data, which was fudged, was not adhering to this law. </p>
<p>It was also generalisable so that it didn't matter what base number system you used, the measurements would be distributed in an analagous way. </p>
<p>I've googled for various things trying to identify it but I just can't find it because I don't know the right name to search for. </p>
<p>I would like to read some more about this subject, so if anyone can tell me the magic terms to search for I'd be grateful, thanks!</p>
| 0non-cybersec
| Stackexchange |
Saturn moon Iapetus' huge landslides stir intrigue. | 0non-cybersec
| Reddit |
Get byte array of file from filefield ExtJs. <p>Hello friends I have the following <code>filefield</code>:</p>
<pre><code>{
xtype:'filefield',
buttonText: 'choose',
buttonOnly: true,
listeners: {
change: function(fb, v) {
// ...
}
}
}
</code></pre>
<p>and I want to get the chosen file in a byte array</p>
<p>Please help me if you can.</p>
| 0non-cybersec
| Stackexchange |
TOC space after number always equal?. <p>There are already many questions here about the space after a number in a table of contents. <a href="https://tex.stackexchange.com/questions/123952/increasing-spacing-between-section-number-and-title-in-the-table-of-contents">This</a> one already displays the problem I am facing, but I don't like the solution provided.</p>
<p>What I'd like is all TOC texts after numbers to have the same distance to the numbers, instead of setting one static value for one level, which results in different distances, when the numbers begin to take more space, because of more digits. In other words, I would like the space after the TOC numbers to be always equal.</p>
<p>How can I achieve that?</p>
<p>Here is a tiny example of the wanted result:</p>
<pre><code>...
9. [space equal] TEXT
10. [space equal] TEXT
...
100. [space equal] TEXT
...
100000. [space equal] TEXT
</code></pre>
<p>Instead of the space varying the text moves further to the right, to allow the same space everywhere.</p>
<h1>Edits</h1>
<ul>
<li>I am using the book class.</li>
<li>My document does not have thousands of chapters, it is only an example to make the meaning even more obvious : ) A general solution to such a problem independent of the range of chapter /section / subsection / ... numbers would be great though, as I imagine there might be others who could want this in the future.</li>
</ul>
| 0non-cybersec
| Stackexchange |
Clarification regarding an exercise about primitive permutation group. <blockquote>
<p>Let <span class="math-container">$G$</span> be a transitive group of permutations of a set <span class="math-container">$X$</span> and <span class="math-container">$H$</span> the
stabiliser of an element <span class="math-container">$x\in X$</span>. Show the equivalence of the
following properties:</p>
<ol>
<li>Every subgroup of <span class="math-container">$H'$</span> of <span class="math-container">$G$</span> containing <span class="math-container">$H$</span> is equal to <span class="math-container">$H$</span> or <span class="math-container">$G$</span>.</li>
<li>Every subset <span class="math-container">$Y$</span> of <span class="math-container">$X$</span> such that, for all <span class="math-container">$g\in G$</span>, <span class="math-container">$gY$</span> is either contained in <span class="math-container">$Y$</span> or disjoint from <span class="math-container">$Y$</span>, is equal to <span class="math-container">$X$</span> or
consists of a single element.</li>
</ol>
</blockquote>
<p>Presumably this means that <span class="math-container">$G\leq\mathfrak{S}_{X}$</span> (<span class="math-container">$\mathfrak{S}_{X}$</span> is the symmetric group of <span class="math-container">$X$</span>) and that there exists an element <span class="math-container">$a\in X$</span> such that
<span class="math-container">$$\omega_a(G)=X,$$</span>
where <span class="math-container">$\omega_a$</span> is the orbital mapping defined by <span class="math-container">$a$</span>. I don't quite understand what the exact equivalence it is that I am asked to prove. Is it an equivalence between the following statements?</p>
<ol start="3">
<li><span class="math-container">$(\forall x)(x\in X\implies(\forall H')(H'\leq G\land\text{stab}(x)\subset H'\implies H'=\text{stab}(x)\lor H'=G))$</span>;</li>
<li><span class="math-container">$(\forall Y)(Y\subset X\land(\forall g)(g\in G\implies gY\subset Y\lor gY\cap Y=\emptyset)\implies Y=X\lor (\exists y)(Y=\{y\}))$</span>.</li>
</ol>
<p>Are <span class="math-container">$3,4$</span> correct translations of <span class="math-container">$1,2$</span>?</p>
| 0non-cybersec
| Stackexchange |
Git uninstalled by itself. What can cause that?. <p>I was installing the C++ packages for VS 2015 while looking for unused game folders to pass the time. Suddenly out of nowhere Git uninstalls itself! (the horror...)
Granted, I was actively deleting things, however they were 5kb empty folders, not the most important program on my machine.</p>
<p>I was not prompted by ANY dialog of "Are you sure?" or "Do you want to delete X?". Git uninstall window just popped out of nowhere and even task manager didn't manage to kill it.</p>
<p>My only guess is that maybe because one of the VS 2015 packages I chose to install (together with the C++ package) was Github integration to VS (to which I thought "hell why not") but it's hard for me to believe MS would just delete my Git without so much as a warning...</p>
<p>Edit: installer finished and this came up:</p>
<p><a href="https://i.stack.imgur.com/tjZAa.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/tjZAa.png" alt="enter image description here"></a></p>
| 0non-cybersec
| Stackexchange |
What does $y = Ar^t$ mean?. <p>I keep coming up in this question and its variants in my math tests, but it has not been explained to me so I can't really answer it. As such, I am at risk of failing the year.</p>
<p>An example question is as below:</p>
<blockquote>
<p>Bob bought a farm in 1980. In 2017 he sold it for $500,000 and calculated it rose exponentially at a rate of 4% over that time.</p>
<p>(i) Assuming that it increased in value according to the formula <span class="math-container">$y = Ar^t$</span>, where <span class="math-container">$A$</span> is the purchase price and <span class="math-container">$^t$</span> is the time in years, what was his profit?</p>
</blockquote>
<p>As you can see, the values of <span class="math-container">$A$</span> and <span class="math-container">$^t$</span> are pretty clearly defined, and <span class="math-container">$y$</span> is implicitly defined, but nowhere is the value <span class="math-container">$r$</span> defined.</p>
<p>So what is <span class="math-container">$r$</span> supposed to be, and how would I go about answering this question?</p>
| 0non-cybersec
| Stackexchange |
Zooey Deschanel Showing Goodies (nsfw). | 0non-cybersec
| Reddit |
Bought this copper pot/goblet thing. Anyone know what the crest means, and represents???. | 0non-cybersec
| Reddit |
Please help,,, What kind of fishing reel is this?. | 0non-cybersec
| Reddit |
Location Selection Algorithm in Solar Engineering. <p>This is a practical problem in energy generation with heliostats.</p>
<p>We have a number of heliostats basically forming the shape of a doughnut. The facility needs to deploy hubs on those heliostats. One hub can support 12 harnesses (a kind of cable) and one harness can support 16 heliostats; namely, one hub can support 192 heliostats. The cost of deploying a hub and harness per meter are given. In other words, every harness starts from a hub and can connecting at most 16 heliostats. Deployment of a hub results in a cost. Also, the cost of harnesses result from its distance from the hub to the furthest heliostat on this harness. However, there is no distance from heliostats to its connecting harness. </p>
<p>Currently my approach is to use k-means to cluster the whole region and run greedy on distance from harness for each split region, though I do not think this is a good approach. </p>
<p><a href="https://i.stack.imgur.com/4ZFf8.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/4ZFf8.jpg" alt="enter image description here"></a></p>
<p>This is a pattern generated by my algorithm. As you can see, some harness only support 1 or 2 heliostats and result in a waste of harness. </p>
<p>Our job is to optimize the cost. In the end, the algorithm should return locations of hubs, harness topology patterns, and the total cost. </p>
<p>Can anyone enlighten me potential algorithms on this?</p>
<p>(Every point on the image is a heliostat, there are 40981 in total<a href="https://i.stack.imgur.com/roi28.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/roi28.jpg" alt="enter image description here"></a>)</p>
<p>----------- Updated 14/12/2016 -----------</p>
<p>More details on the question, thanks D.W's suggestion: </p>
<ol>
<li><p>Coordinates of heliostats are given. These coordinates correspond to real-world metrics (meters).</p></li>
<li><p>The placement of hubs are not constrained. However, one harness cannot be longer than 45 meters due to voltage requirement. </p></li>
</ol>
<p>----------- Updated 15/12/2016 -----------</p>
<ol>
<li>The classification on "furthest" in "the cost of harnesses result from its distance from the hub to the furthest heliostat on this harness": Furthest is in the sense of "last", not "furthest" in the sense of "having the largest Euclidean distance from the hub"</li>
</ol>
| 0non-cybersec
| Stackexchange |
Red color palette for gnuplot. <p>I am looking for a palette in gnuplot for red color from very-light-red to deep-red. I found a script for black here <a href="http://gnuplot.sourceforge.net/demo_5.3/pm3dcolors.16.gnu" rel="nofollow noreferrer">http://gnuplot.sourceforge.net/demo_5.3/pm3dcolors.16.gnu</a> </p>
<p>I tried by changing <code>set palette functions red, red, red</code> in the above script, but it is not working.</p>
| 0non-cybersec
| Stackexchange |
Best place to buy New Nintendo 3DS face plates?. Just got the new 3ds animal crossing version and was wondering the best place to buy those awesome face plates without spending a fortune? Thanks :) | 0non-cybersec
| Reddit |
ITV's 'This Morning' is great for clips like this!. | 0non-cybersec
| Reddit |
How is/can front- and backend be separated in Django?. <p>I am evaluating frameworks and I would like to understand Django's architecture better. </p>
<p>Coming form a Java background I developed components separately namely front and backend. More concretely for my backend I use Dropwizard and start a HTTP server. For the front end I use a nginx webserver with some forwarding to connected to my backend api via REST with Json objects. The front end is just plain html and a little JavaScript in vue.js. </p>
<p>Now I have been reading about Django's Model-Template-View concept. with a single page application and JavaScript a Web app can be deployed and so a separation of backend and frontend is given. </p>
<p>To my understanding this is a little to sparse. Could some please clarify? And could you develop in Django so that the front end is independent from the backend? and if yes using the stack above could you give some hints how this is accomplished? </p>
| 0non-cybersec
| Stackexchange |
Closure properties of undecidable languages. <p>I know that the decidable are close under: complementation, union, intersection and concatenation?</p>
<p>What about the undecidable languages? I think they are close under complementation, but not under concatenation, union and intersection. But I don't know how to prove it...</p>
<p>My prove</p>
<blockquote>
<p>"Lets say L is undecidable lang. Because L is undecidable lang we know
one of the following:</p>
<ol>
<li><p>there is a word w1 from L that there is no TM that stop for this
word</p></li>
<li><p>there is a word w2 in L that stopping in reject state in every TM</p></li>
<li><p>there is a word w3 Not from L that stopping in accept state in
every TM</p></li>
</ol>
<p>L' is the complementation lang of L</p>
<p>If 2, the word w2 that stopping in reject state, will stop in the
accept state for every TM, but w2 not in L' so L' is Undecidable.</p>
<p>If 3, the word w3 that stopping in accept state, will stop in the
reject state for every TM, but w2 is in L' so L' is Undecidable.</p>
<p>If 1, so all the TM are not stopping for w1 so L' is Undecidable???? "</p>
</blockquote>
| 0non-cybersec
| Stackexchange |
Windows 7 - disabling focus change on left click. <p>Is there a possibility to turn off the focus change on left mouse click in windows 7? I would like to click on things in my background, but keep one of the windows constantly focused (it's a game which has built-in pause on focus lose, without ability to disable it). Making a window unable to lose focus would solve my problem as well, but disabling focus change on left click seems more realistic. Note that I don't want the window just to stay on top visually, I want it to have focus.</p>
| 0non-cybersec
| Stackexchange |
First time in history that a meteorite has been filmed in the air after its light goes out. | 0non-cybersec
| Reddit |
BSC channel probability, (binary symmetric channel). <p>I have question regarding the binary symmetric channel (BSC), which assume each channel use is indepedent (i.e, if you send a '0', then you send '1', each time you send it is indepedent of others). Basically, the model of BSC is depicted as below. </p>
<p><img src="https://i.stack.imgur.com/HOjDl.png" alt="enter image description here"></p>
<p>Assume we use repetition of length 3, i.e, if we want to send '0', we actually send '000'; if we want to send '1', we actually send '111'. </p>
<p><strong>Question 1). Given Bob receive '000', what is the probability that Alice send is '1'?
Question 2) What happen if we don't use repetition? I.e, we want to send '1', and we actually send a '1' instead of '111'. Given Bob receive 000, what is the probaiblity Alice send '111'?</strong></p>
<p>I got stuck on the second question. I think I have problem calculating $P(B=000)$ using the total probability theorem.</p>
<hr>
<p>Attempt:</p>
<p>Question #1.
$P(A=1|B=000)=P(B=000|A=111)*P(A=111)/ P(B=000)$</p>
<p>On the other hand, $P(B=000)=P(B=000|A=111)*P(A=111)+P(B=000|A=000)*P(A=000)$
using independence, we have $P(B=000)=P(B=0|A=1)^3*P(A=1)^3+P(B=0|A=0)^3*P(A=0)^3$</p>
<p>and all we need to do is to plug in $p$ into $P(B=0|A=1)$ and $P(B=1|A=0)$ into the equations.</p>
<hr>
<p>Update 2:</p>
<p>For Case1: $P(B=000)=P(B=000|A=111)*P(A=111)+P(B=000|A=000)*P(A=000)$</p>
<p>However, for Case2:</p>
<p>$P(B=000)=P(B=000|A=000)*P(A=000)+P(B=000|A=001)*P(A=001)+P(B=000|A=010)*P(A=010).... +P(B=000|A=111)*P(A=111)$</p>
| 0non-cybersec
| Stackexchange |
Three visible galaxies in one photo that I took from a beach in New Zealand. | 0non-cybersec
| Reddit |
PHP include absolute path. <p>I have a variable on my site called $basePath which is set as:</p>
<pre><code>$basePath = '/Systems/dgw/';
</code></pre>
<p>I am using it on all my css, js and images tags as so (shortened for better visibility):</p>
<pre><code><link href="<?php echo $basePath; ?>include/assets/css/bootstrap.min.css">
</code></pre>
<p>I have no problem with those includes and they work fine in wherever file and in whatever folder I am.</p>
<p>I have a certain included page which has the following line:</p>
<pre><code><img src="<?php echo $basePath; ?>images/new_logo.png" alt="logo"/>
</code></pre>
<p>And the image shows just fine. The line after it states:</p>
<pre><code><?php include($basePath.'include/assets/common/topMessages.php');?>
</code></pre>
<p>But the include doesn't happens. When I try it like this:</p>
<pre><code><?php include('../../include/assets/common/topMessages.php');?>
</code></pre>
<p>It works.</p>
<p>Anybody has any idea what could be wrong?</p>
| 0non-cybersec
| Stackexchange |
I Would Like To Order A CNN With Lime Or A Lemon Please. | 0non-cybersec
| Reddit |
PsBattle: This seductive turnip. | 0non-cybersec
| Reddit |
If light is both a particle and a wave, how do we understand waves considering reality is of 3 dimensional space and therefore a wave would have to also be 3 dimensional?. If we look at a wave on a 2d plane we see an x and y but life is 3d and has a z dimension. Does this mean that there is always a peak but that it would be on a z direction when the wave is not at a positive or negative peak on the 2D plane?
Would that mean that when we talk about waves that we are instead talking about spirals / coils and not actually waves?
| 0non-cybersec
| Reddit |
Brazil Catholic Priest Excommunicated For Defending Gay Rights. | 0non-cybersec
| Reddit |
What are some of the practical applications of CSP process algebra?. <p>CSP is used for the description and representation of concurrent systems, how it is used in practice (theoretically and programmatically)? </p>
<p>What are the application areas (other than concurrent and parallel systems) where it is used?</p>
| 0non-cybersec
| Stackexchange |
On a semiconductor chip, what state (on/off or read/write) corresponds to conducting or insulating behavior?. <p>My textbook has a brief explanation of how semiconductors are used in modern computer chips because they can be made to conduct (by applying enough voltage to excite electrons across the band gap) or to insulate (by dropping the voltage to a lower level or shutting it off entirely) and this conditional, binary state can be used as an 'on/off' logic gate.</p>
<p>In modern computer systems, which state is "on" and which is "off"? In other words, is it the case that when we increase the voltage to cause conductance in the semiconductor that we have a "1" value and that when we drop the voltage down, we have a "0" value, or is it the other way around?</p>
<p>Or is it more appropriate to say "read" vs "write"?</p>
<p>Does the on/off or read/write state vary from one manufacturer to another? Or from one type of memory to another? I.e. does DDR SDRAM use conducting as "on" and insulating as "off" while other forms do it the other way around?</p>
<p>P.S. If comp sci isn't the right SE, please could you advise a better SE for this question?</p>
| 0non-cybersec
| Stackexchange |
Coalgebra dual to the symmetric algebra. <p>I'm interested in the coalgebra dual to the symmetric algebra $S(V)$ on some finite dimensional vector space $V$. I'd like to know explicitly what the comultiplication map is. </p>
| 0non-cybersec
| Stackexchange |
Get service name from it's PID (powershell). <p>I am having trouble solving a minor issue. So for processes, I can store its name from its $PID using the following line:</p>
<blockquote>
<p>$process_name=get-Process -id $PID |select -expand name</p>
</blockquote>
<p>However, I want to run the process as a <strong>service</strong>. I want to complete the same operation, that is: store the service's name e.g. [service_name].exe into a variable $service_name.</p>
<p>The reason for this is because I want to have just one .ps1 file, that I can then turn into multiple services that uses its own .exe.config files. So that just one .ps1 file can be compiled multiple times into services such as </p>
<p>[service1.exe, service2.exe, service3.exe, ...] </p>
<p>and each service uses its corresponding .exe.config file such as </p>
<p>[service1.exe.config, service2.exe.config, service3.exe.config, ...]</p>
<p>Is there any way to do this with powershell?</p>
| 0non-cybersec
| Stackexchange |
[Update] I [23F] am going into business with my ex [24M], some weeks I see him more than my bf [25M]. [OP](http://www.reddit.com/r/relationships/comments/2zqh2t/i_23f_am_going_into_business_with_my_ex_24m_some/)
I love update posts so I thought I'd give an update.
The day after I posted, I saw my ex to go over our pitch. I was feeling very on-edge because of all the negative feedback I received. I told him that it was hard to balance the business and my relationship, and he understood. Me, him, and our third co-founder are all trying to get our work-life balance together.
Later in the day I saw my bf and I told him everything I'd been thinking about. I told him I wanted to have a conversation about something, which freaked him the fuck out. I said that I wanted to make sure he was a priority and with all the time I was spending on my business, I was concerned he might feel like I wasn't spending enough time on us. He actually laughed out loud at the idea: he's really enjoyed seeing me throw myself into something. I pushed a bit further and brought up the fact that I was working closely with my ex. (I even told him about my post here and the criticisms I'd received.) He understood that it was an unusual situation, and he had been concerned about my friendship with my ex at first. When they met, however, my bf was able to see that there is no sexual or romantic tension between my ex and I. So to my bf, the ex is really just another guy.
We got into an enlightening conversation about my relationship with my ex. My boyfriend (who usually doesn't want to talk about past relationships) was really curious why he wasn't bothered by my working so closely with my ex (which he answered himself: the relationship lacks any sexual energy), then was interested in how I could have been in a relationship without there being lingering romantic (or hurt) feelings. We explored that a bit (I think he felt like he was cracking a psychological puzzle) and I could tell my boyfriend felt completely and totally secure about us. He deeply appreciated that I brought up the issue at all, and I'm glad I now know he's not harboring secret fears. That night we worked a bit on my pitch and he helped me analyze some market research, which he was really interested in. In all: lots of support and good vibes.
Since then, the really busy period for my startup has passed and I've been able to spend more time with my bf. He still has doubts about me being over-committed and stressed, but he (and my parents + therapist) acknowledge that having an outlet for my ambition is a really good thing. (Before this, I was very depressed about my deadend toxic day job, which I'm still trying to leave.)
**TL;DR**: Seems like a weird situation to outsiders but everything was just peachy! | 0non-cybersec
| Reddit |
Waking up to a fresh flood of karma [OC]. | 0non-cybersec
| Reddit |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
Not all hero's wear capes. | 0non-cybersec
| Reddit |
Wyoming Wind Sock. | 0non-cybersec
| Reddit |
investmentweek.co.uk left 330k user records exposed. | 1cybersec
| Reddit |
Look at that van go.. | 0non-cybersec
| Reddit |
I started working at an growing company, they needed an IT guy/Sysadmin/Programmer....Excel Sheets...Good God.. | 0non-cybersec
| Reddit |
Ladies. What does a great life look like for women over 35 ?. I am turning 35 in a month. I will be over the proverbial hill. I am Married. Beautiful one year old boy. I love my life on paper. But living it is so much different. My looks are starting to age. My career options are more set in stone. My powers of attraction are fading. Men my age are chasing 20'something women. My decisions are becoming irreversible.
Is it possible to have a mid life crisis at 35? | 0non-cybersec
| Reddit |
Anyone know where to find Nothing but Trouble (Dan Aykroyd) in High Definition? I've searched everywhere with no luck.... | 0non-cybersec
| Reddit |
Yep, Seems Legit. | 0non-cybersec
| Reddit |
How to reset Ubuntu's Keyboard Media Short Cut back to Default. <p>While testing the media keyboard shortcuts for various players, I change the hotkeys to keystrokes. Now I'm trying to get them back to the defaults.</p>
<p>The prompt shows options for either setting a new key by hitting the keystroke, or to clear the setting by hitting the backspace. I don't see an option to change it to the default.</p>
<p>The defaults have words, for instance the <strong>Play (or play/pause)</strong> has the words, <strong>Audio play</strong> and the <strong>Pause playback</strong> has the words <strong>Audio pause</strong>.</p>
<p>I'm trying to get the default settings back where it has the words. Some of the media apps don't work well with the keystrokes I have assigned.</p>
| 0non-cybersec
| Stackexchange |
Show that the Gaussian binomial coefficient is a symmetric polynomial. <blockquote>
<p>Deduce that ${{n} \brack {k}}_{q}$ is a symmetric polynomial of $q$, that is, if
\begin{equation*}
{{n}\brack {k}}_{q} = a_0 + a_1q + a_2q^2 + \ldots + a_Nq^N
\end{equation*}
with $a_N \neq 0$, then $a_i = a_{N-i}$ for all $i$.</p>
</blockquote>
<p>I'm having trouble proving this. Is this simply by symmetry of the Gaussian binomial coefficient (${n \brack k} = {n \brack n-k}$)?</p>
| 0non-cybersec
| Stackexchange |
Headphone no sound in Windows 7. <p>It worked fine for two years, but the Windows 7 on my laptop no longer plays sound through headphones. When plugged in, the speakers stop (I've read that some people's speakers play instead of headphones, but not the case with mine). Everything works fine on my Ubuntu partition of the same laptop.</p>
<p>Here are pictures of the "Sound" window</p>
<p>headphones not plugged in:</p>
<p><img src="https://i.stack.imgur.com/w0Xo5.png" alt="enter image description here"></p>
<p>plugged in:</p>
<p><img src="https://i.stack.imgur.com/QuL4u.png" alt="enter image description here"></p>
| 0non-cybersec
| Stackexchange |
On the Continuum Hypothesis. <p>Let me start out by saying that I am not a mathematician. I read an article over at <a href="http://www.scientificamerican.com/article.cfm?id=infinity-logic-law">Scientific American</a> that discussed the <a href="http://en.wikipedia.org/wiki/Continuum_hypothesis">Continuum Hypothesis</a>. I developed the following thought experiment that would seem to prove the theory true, but as far as I know it is unprovable. Thus here I am asking for your help.</p>
<ol>
<li>Start with the set of all integers $(-\infty,...,-1,0,1,...,\infty)$</li>
<li>This set can be considered 1-dimensional in that for each position in the set, there is only one possible number</li>
<li>Consider adding an additional dimension to the set that has only one possible value (0): $(<-\infty;\ 0>,...,<-1;\ 0>, <0;\ 0>, <1;\ 0>,...,<\infty; 0>)$</li>
<li>Clearly this set has the same cardinality as the integers as there is a clear mapping between them</li>
<li>Now consider having two values instead of one (0 and 5), and let's represent everything in the second dimension a decimal whose value is added to the first number</li>
<li>This makes the set $(<-\infty;\ 0;\ 5>,...,<-1;\ 0;\ 5>, <0;\ 0;\ 5>, <1;\ 0;\ 5>,...,<\infty; 0;\ 5>)$, which can be expanded to $(-\infty,...,-1.0, -0.5, 0.0, 0.5, 1.0, 1.5,...,\infty)$</li>
<li>This new set still has the same cardinality as the set of all integers since each number can be mapped directly to an integer</li>
<li>This property of the set's cardinality should continue as more numbers are added to the set, up until the point that infinitely many numbers are added</li>
<li>Once there are infinitely number of numbers added to the second dimension (sequentially), then the mapping to the integers cannot be performed because the infinite size and the maximal density (all integers from 0 to $\infty$)</li>
<li>This final set would be expanded to be exactly the same as the real numbers, and would seem to indicate that it is impossible to have a cardinality between the integers and real numbers</li>
</ol>
<p>I guess it comes down to statement #9. It seems to me that it's most important that this set of numbers includes every combination of numbers from 0 to $\infty$ to ensure that the irrational numbers would be included.</p>
| 0non-cybersec
| Stackexchange |
qemu -cdrom ubuntu.iso -boot d -m 1024 -curses. <p>How do I disable frame buffers in Ubuntu 13.10 Saucy kernel,
I tried all kinds of kernel parameters but none work?</p>
<pre><code>DEFAULT ramdisk
LABEL ramdisk
kernel /casper/vmlinuz
append boot=casper toram initrd=/casper/initrd.img -- vesafb.nonsense=1
LABEL isotest
kernel /casper/vmlinuz
append boot=casper integrity-check initrd=/casper/initrd.img -- vesafb.nonsense=1
LABEL memtest
kernel /install/memtest
append -
DISPLAY isolinux.txt
TIMEOUT 300
PROMPT 1
</code></pre>
| 0non-cybersec
| Stackexchange |
Problem with tables in document. <p>i have problem with tables in my document. Tablica 1 and Tablica 2 sould be under "5. Opracowanie wyników pomiarów" and over \paragraph{1...} . Here is a code, copied from <a href="http://pastebin.com/BqEXbst1" rel="nofollow">http://pastebin.com/BqEXbst1</a>:</p>
<pre><code>\documentclass[a4paper,titlepage,10pt]{article}
\usepackage[polish]{babel}
\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{times}
\usepackage{enumerate}
\usepackage{url}
\usepackage{rotating}
\renewcommand{\arraystretch}{1}
\usepackage{caption}
\usepackage{titlesec}
\titlelabel{\thetitle.\quad}
\usepackage{caption}
\captionsetup{labelsep=space,justification=justified,singlelinecheck=off}
\usepackage{amsmath}
\usepackage{makecell}
\begin{document}
\begin{table}[!htbp]
\centering
\begin{tabular}{|c|c|c|c|c|} \hline
\textbf{EAIiB} & \thead{1.\\ 2. } & \thead{Rok: \\ II} & \thead{Grupa: \\ 2} & \thead{Zespół: \\ 5} \\ \hline
& \multicolumn{3}{|c|}{\textbf{Temat: } Wahadło fizyczne.} & \thead{nr ćwiczenia: \\ 1} \\ \hline
\multicolumn{4}{|c|}{\thead{Data oddania: \\ 25.11.2015r.}} & \thead{Ocena: \\ } \\ \hline
\end{tabular}
\end{table}
\section{Cel ćwiczenia}
Celem ćwiczenia było zapoznanie się z ruchem drgającym wahadła fizycznego i wyznaczenie momentu bezwładności brył sztywnych przez pomiar okresu drgań wahadła oraz na podstawie wymiarów geometrycznych.
\section{Układ pomiarowy}
\begin{itemize}
\item Statyw na którym zawiesiliśmy bryłę sztywną.
\item Pręt i pierścień.
\item Metalowy przymiar milimetrowy
\item Suwmiarka.
\item Waga elektroniczna.
\item Sekundomierz.
\end{itemize}
\section{Wykonanie ćwiczenia}
\begin{enumerate}
\item Zmierzyliśmy masę pręta i pierścienia.
\item Wyznaczyliśmy rozmiary pierścienia i uzupełniliśmy tabelki.
\item Umieściliśmy kolejno pręt i pierścień na statywie, wprowadziliśmy go w ruch drgający o amplitudzie nie przekraczającej trzech stopni i zmierzyliśmy czas kilkudziesięciu drgań, dziesięciokrotnie potworzyliśmy pomiar zarówno dla pręta jak i pierścienia. Wyniki zanotowaliśmy w tabelkach.
\end{enumerate}
\section{Wyniki pomiarów}
\begin{table}[!htbp]
\caption{Pomiar masy i długości}
\begin{tabular}[t]{|c|c|c|} \hline
\multicolumn{3}{|c|}{Pręt} \\ \hline
& wartość & niepewność \\ \hline
m[g] & 658 & 1 \\ \hline
l[mm] & 746 & 1 \\ \hline
b[mm] & 97 & 1 \\ \hline
a[mm] & 276 & 1 \\ \hline
\end{tabular}
\quad
\begin{tabular}[t]{|c|c|c|} \hline
\multicolumn{3}{|c|}{Pierścień} \\ \hline
& wartość & niepewność \\ \hline
m[g] & 1343 & 1 \\ \hline
$D_{w}$[mm] & 262 & 1 \\ \hline
$D_{z}[mm]$ & 290 & 1 \\ \hline
$R_{z}[mm]$ & 131 & 1 \\ \hline
$R_{w}[mm]$ & 146 & 1 \\ \hline
e[mm] & 11 & 0,05 \\ \hline
a[mm] &135 & 1 \\ \hline
\end{tabular}
\end{table}
\begin{table}[!htbp]
\caption{Pomiar okresu drań}
\begin{tabular}[t]{|c|c|c|c|} \hline
\multicolumn{4}{|c|}{Pręt} \\ \hline
Lp. & \thead{Liczba\\ okresów k}
& \thead{Czas t[s]\\ dla k okresów} & Okres $T_{i}[s]$ \\ \hline
1 & 30 & 39.32 & 1.310 \\ \hline
2 & 30 & 39.16 & 1.305 \\ \hline
3 & 30 & 39.57 & 1.319 \\ \hline
4 & 30 & 38.91 & 1.297 \\ \hline
5 & 30 & 39.39 & 1.312 \\ \hline
6 & 30 & 39.16 & 1.304 \\ \hline
7 & 30 & 40.02 & 1.334 \\ \hline
8 & 30 & 39.27 & 1.309 \\ \hline
9 & 30 & 38.97 & 1.299 \\ \hline
10 & 30 & 39.44 & 1.314 \\ \hline
\multicolumn{4}{|l|}{Wartość średnia okresu $1.3103$} \\ \hline
\multicolumn{4}{|l|}{Niepewność $u(t): 3.38 * 10^{-3}$} \\ \hline
\end{tabular}
\quad
\begin{tabular}[t]{|c|c|c|c|} \hline
\multicolumn{4}{|c|}{Pierścień} \\ \hline
Lp. & \thead{Liczba\\ okresów k}
& \thead{Czas t[s]\\ dla k okresów} & Okres $T_{i}[s]$ \\ \hline
1 & 30 & 30.68 & 1.023 \\ \hline
2 & 30 & 30.75 & 1.025 \\ \hline
3 & 30 & 30.87 & 1.029 \\ \hline
4 & 40 & 40.93 & 1.023 \\ \hline
5 & 40 & 40.81 & 1.020 \\ \hline
6 & 30 & 30.52 & 1.017 \\ \hline
7 & 30 & 31.02 & 1.034 \\ \hline
8 & 40 & 41.11 & 1.028 \\ \hline
9 & 40 & 40.57 & 1.014 \\ \hline
10 & 30 & 30.65 & 1.022 \\ \hline
\multicolumn{4}{|l|}{Wartość średnia okresu $T: 1.0235$} \\ \hline
\multicolumn{4}{|l|}{Niepewność $u(t): 1.82 \cdot 10^{-3}$} \\ \hline
\end{tabular}
\end{table}
\section{Opracowanie wyników pomiaru}
\paragraph{1. Moment bezwładności $I_{0}$ względem rzeczywistej osi obrotu}
\begin{equation}
T = 2 * \pi \sqrt{\frac{I_{0}}{mga}}
\end{equation}
Po przekształceniu:
\begin{equation}
I_{0} = \frac{m g a T^{2}}{4 * \pi^{2}}
\end{equation}
\noindent Gdzie:\newline
m - masa \newline
g - przyśpieszenie grawitacyjne \newline
a - odległość punktu zawieszenia od środka\newline
T - okres \newline
\paragraph{Dla pręta:}
\begin{equation*}
I_{0} = \frac{0,658 \cdot 9,81 \cdot 0,276 \cdot 1,717}{4 \cdot 3,14^{2}} = 7,76 \cdot 10^{-2} [kg \cdot m^2]
\end{equation*}
\paragraph{Dla pierścienia: }
\begin{equation*}
I_{0} = \frac{1,343 * 9,81 * 0,135 * 1,048}{4 * 3,14^{2}} = 4,72 \cdot 10^{-2} [kg \cdot m^2]
\end{equation*}
\paragraph{2.Moment bezwładności $I_{s}$ korzystając z twierdzenia Steinera}
\begin{equation}
I_{s} = I_{0} - m \cdot a^{2}
\end{equation}
\paragraph{Dla pręta}
\begin{equation*}
I_{s} = 7,76 \cdot 10^{-2} - 0,658 \cdot 0,276^{2} = 2,75 \cdot 10^{-2}
\end{equation*}
\paragraph{Dla pierścienia}
\begin{equation*}
I_{s} = 4,73 \cdot 10^{-2} - 0,658 \cdot 0,135^{2} = 2,28 \cdot 10^{-2}
\end{equation*}
\paragraph{3. Moment bezwładności względem osi przechodzącej przez środek masy $I_{s}^{geom}$}
\paragraph{Dla pręta}
\begin{align*}
I_{s}^{geom} = \frac{1}{12} \cdot m \cdot l^2 = \frac{1}{12} \cdot 0,658 \cdot 0,746^{2} = 3,05 \cdot 10^{-2}
\end{align*}
\paragraph{Dla pierścienia}
\begin{equation*}
I_{s}^{geom}= \frac{1}{2} \cdot m \cdot (R_{z}^2 + R_{w}^2) = \frac{1}{2} \cdot 1,343 \cdot(0,145^2 + 0,131^2) = 2,58 \cdot 10^{-2}
\end{equation*}
\paragraph{4. Obliczanie niepewności pomiarowych}
\begin{equation}
u(T) = \sqrt{\frac{\sum (T_{i} - \bar{T})^ 2 }{n(n-1)}}
\end{equation}
\paragraph{Dla pręta}
\begin{equation*}
u(T) = 3,38 \cdot 10^{-3}
\end{equation*}
\paragraph{Dla pierścienia}
\begin{equation*}
u(T) = 1,82 \cdot 10^{-3}
\end{equation*}
\paragraph{5. Obliczanie niepewności złożonej momentu bezwładności $I_{0}$ oraz $I_{s}$}
\begin{equation}
u(I_{0}) = I_{0} \cdot \sqrt{\left(2\cdot \frac{u(T)}{T}\right)^2 + \left(\frac{u(m)}{m}\right)^2 + \left(\frac{u(a)}{a}\right)^2}
\end{equation}
\begin{equation}
u(I_{s}) = \sqrt{[u(I_{0})]^2 + [a^2 \cdot u(m)]^2 + [-2\cdot a \cdot m \cdot u(m)]^2}
\end{equation}
\paragraph{Dla pręta}
\begin{equation*}
u(I_{0}) = 4,405 \cdot 10^{-4}
\end{equation*}
\begin{equation*}
u(I_{s}) = 5,76 \cdot 10^{-4}
\end{equation*}
\paragraph{Dla pierścienia}
\begin{equation*}
u(I_{0}) = 3,90 \cdot 10^{-4}
\end{equation*}
\begin{equation*}
u(I_{s}) = 5.32 \cdot 10^{-4}
\end{equation*}
\paragraph{6.Obliczanie niepewności $u_{c}(I_{s}^{geom})$}
\begin{equation}
u(I_{s}^{geom}) = I_{s}^{geom} \cdot \sqrt{\left[\frac{u(m)}{m}\right]^2 + \left[2\frac{u(l)}{l}\right]^2}
\end{equation}
\paragraph{Dla pręta}
\begin{equation*}
u(I_{s}^{geom}) = 9,404 \cdot 10^{-5}
\end{equation*}
\paragraph{Dla pierścienia}
\begin{equation*}
u(I_{s}^{geom}) = 2.63 \cdot 10^{-4}
\end{equation*}
\paragraph{8. Porównywanie dokładności metod wyznaczania momentu bezwładności}
Wyniki $u(I_{s})$ oraz $u(I_{s}^{geom})$ są w dużym stopniu zbliżone.
\paragraph{8. Porównywanie dokładności metod wyznaczania momentu bezwładności}
\begin{equation}
z = \frac{|I_{s} - I_{s}^{geom}|}{\sqrt{u^2(I_{s}) + u^2(I_{s}^{geom})}}
\end{equation}
\paragraph{Dla pręta}
\begin{equation*}
z = 0,5219
\end{equation*}
\paragraph{Dla pierścienia}
\begin{equation*}
z = 0,51639
\end{equation*}
\begin{table}[!htbp]
\caption{Wyniki obliczeń momentów bezwładności dla pręta}
\begin{tabular}[t]{|c|c|c|c|} \hline
& \thead{$I_{0}$ wyznaczone \\ z okresu drań $[kg m^2]$ } & \thead{$I_{s}$ wyznaczone \\ z twierdzenia Steinera $[kg m^{2}]$ } & \thead{$I_{s}$ wyznaczone \\ z pomiarów geometrycznych $[kg m^2]$} \\ \hline
Wartość & $7,76 \cdot 10^{-2}$& $2,75 \cdot 10^{-2}$ & $3,05 \cdot 10^{-2}$\\ \hline
Niepewność & $4,405 \cdot 10^{-4}$ & $5,76 \cdot 10^{-4}$ & $9,404 \cdot 10^{-5}$ \\ \hline
\end{tabular}
\end{table}
\begin{table}[!htbp]
\caption{Wyniki obliczeń momentów bezwładności dla pierścienia}
\begin{tabular}[t]{|c|c|c|c|} \hline
& \thead{$I_{0}$ wyznaczone \\ z okresu drań $[kg m^2]$ } & \thead{$I_{s}$ wyznaczone \\ z twierdzenia Steinera $[kg m^{2}]$ } & \thead{$I_{s}$ wyznaczone \\ z pomiarów geometrycznych $[kg m^2]$} \\ \hline
Wartość & $4,72 \cdot 10^{-4}$& $2,28 \cdot 10^{-2}$ & $2,58 \cdot 10^{-2}$ \\ \hline
Niepewność & $5,76 \cdot 10^{-4}$ & $5,32 \cdot 10^{-4}$ & $2,63 \cdot 10^{-4}$ \\ \hline
\end{tabular}
\end{table}
\paragraph{9. Wnioski}
Wartości momentów bezwładności uzyskano za pomocą dwóch metod:
- pomiaru okresu drgań wahadła fizycznego, a następnie obliczenia momentu z odpowiedniego wzoru
- zmierzenia masy i wymiarów, a następnie obliczenia momentu ze wzoru.
Otrzymane wyniki są porównywalne dla pomiarów otrzymanych na oba sposoby, jednak pomiary wykonywane pierwszą metodą są obarczone dodatkowo błędem systematycznym wynikającym z tłumienia drgań
\end{document}
</code></pre>
| 0non-cybersec
| Stackexchange |
New Stonemaier game Pendulum.
In **Pendulum**, each player is a powerful, unique noble vying to succeed the Timeless King as the true ruler of Dünya. Players command their workers, execute stratagems, and expand the provinces in their domain in real time to gain resources and move up the 4 victory tracks: power, prestige, popularity, and legendary achievement.
Players must use actual time as a resource in managing their strategy to best their opponents, using time on different action types and balancing it with time spent planning and analyzing. The winner will be the player who manages and invests their time most effectively and who builds the best engine, not the player who acts the quickest.
Pendulum is the highest-rated protoype in the history of the Stonemaier Games Design Day. If you enjoy Tzolk’in (time and resource optimization) and 7 Wonders (simultaneous play), we think you’ll enjoy Pendulum. Please join us in the [Pendulum Facebook group](https://www.facebook.com/groups/pendulumboardgame/) to discuss the game!
​
[https://stonemaiergames.com/games/pendulum/](https://stonemaiergames.com/games/pendulum/) | 0non-cybersec
| Reddit |
Bear Runs In Front of Car and Both Get Demolished [0:31]. | 0non-cybersec
| Reddit |
Announcement: Official /r/photography Discord Server. Hello, all!
Recently there have been more than a few people asking if there is a place to hang out and chat about photography, and while we have a Slack and an IRC, many were more interested in a Discord alternative.
Now you can join us at [this link!](https://discord.gg/GJZTp9s)
Note: to help curtail spam, you have to ask the moderators in the Requests channel for the @photographer role before you can access the usual channels.
Have fun! | 0non-cybersec
| Reddit |
Why Don’t More Muslims Denounce Their Co-Religionists’ Barbarism?. | 0non-cybersec
| Reddit |
How to solve $\cos^2x - \sin^2x -1 = 0$?. <p>The answers from the back of the book says the answers are $\pi/2$ and $3\pi/2$. I thought that you can use the double angle formula in this problem, but it doesn't seem right? </p>
| 0non-cybersec
| Stackexchange |
If every movie followed the 2 Fast 2 Furious naming scheme for sequels, which would be the funniest resulting movie title?. Title pretty much says it all. What would be the best results if every movie named itself like the second Fast and Furious movie, which we all agree is the greatest title in movie history.
Examples include:
* 2 American 2 Sniper
* 2 Mad 2 Max.
* 2 Big 2 Short
* 2 Risky 2 Business
What other ones can you guys come up with? | 0non-cybersec
| Reddit |
You don't want to visit Death Valley in winter.. Trust me, I did. And what I saw there shook me and stayed with me, and I’m saying that literally. It was the first time I got what I like to call a “blemish”. That’s what happens when a part of me is stained forever.
But before I get to that, who even *wants* to visit Death Valley in winter? The only thing it’s famous for is being so damn hot, I can’t imagine anyone making plans to go in, say, December of a given year. I mean you’d have to be bonkers.
Enter my mom, who in the middle of December, on a Friday evening, sprung it on my dad and I that we’d be taking a family trip that weekend to, you guessed it, Death Valley. Now mind you, I didn’t know a damn thing about Death Valley, and my dad probably did, but he’d learned over the years not to poopoo ideas my mom was enthusiastic about.
And also understand that this wasn’t a normal family outing. I was 13, [my boyfriend had just died](https://www.reddit.com/r/nosleep/comments/amshmn/my_first_boyfriend_and_the_thing_that_killed_him/), and even though you might think that I should be the one taking it the hardest, my mom was falling apart over the whole ordeal. I can’t say if she was falling apart in earnest, or if the news gave her an outlet to fall apart-- even to feign falling apart. My mom’s complicated, and as cynical as it sounds, I wouldn’t put it past her to capitalize on something like that…
But if there’s proof that it was truly grief, then this trip was it. It seemed as if she didn’t know what to do with herself, and the idea of being with me over yet another weekend, where all I did was stay at home depressed, was probably too much for her. *I have to get her out of the house*, she must have been thinking, *And get her mind off everything*.
Well, it worked, but for all the wrong reasons. We got in the car early Saturday and headed on over. I’ll spare you the many cringy pains I went through on that car-ride, but let me say that there was palpable irony in the fact that in order to ostensibly get me out of the house we ended up spending hours stuck in the car, which was not much larger on the inside than a small closet.
And of course, as you guessed, we discovered some things rather quickly. One: my mom did not know anything about Death Valley before she got there. How does that happen? Don’t ask me. She expressed great dismay that there was nothing to do there, and that the main reason to go was to experience the summer heat. When the employee and the information center clarified that December tends to be one of the slower months for tourism, my mom’s anxiety rose even moreso.
“Heat heat heat, that’s all I’m hearing!” she finally interrupted, flailing her arms melodramatically, “Tell me what we can do *now!*”
She snatched randomly at a pamphlet below the counter, and she just so happened to pull up the worst possible one.
“Badwater Basin-- what is that?” she demanded.
The employee told us it was the lowest geological point in North America. A giant concave dimple on the earth, in other words, and that it was a popular tourist destination that was open, even in December. He was a really polite worker, and I felt horrible that my mom was plastering her frustration all over him. He had a nice, mellow brownish aura, and with each exasperated question my mom delivered I saw it get rattled, like a lake of still water that’s getting pebbles thrown into it.
Without much more than a hasty goodbye, my mom snatched me by the hand and headed for the car. My dad-- my poor dad!-- gave a quick apology to the employee and trailed behind. I can’t imagine their relationship, to be honest, my mom and dad. He always seems like he’s along for the ride, and he’s such a sweet dad, always in good spirits. I would die if I had to live like that, and yet as long as I can remember he had this kind of zen attitude about the whole thing. But look at me, I’m getting way off track…
Let me make clear that I had no interest in seeing Badwater Basin. To me, it sounded like a big hole in the ground. Not even a hole, really, just a big, well, dimple. I mean, I can picture that just fine without the several-hour drive. But there we were, about a mile out, heading straight for it.
And this is when shit got weird, because while I was used to my special gift of seeing other people’s auras, I wasn’t used to seeing auras just floating around completely unattached to human beings.
But even a mile out, as my dad turned to me and said “Just up ahead, honey,” and I looked through the front windshield, I saw some swirling trails of auras off in the distance.
“I’ll bet it’s packed with people,” I said.
“I doubt it, honey. That information center was empty,” my dad responded in his characteristically mellow tone, “But who knows.”
It wasn’t until we reached the parking lot that I realized for sure that something wasn’t right. Not a single car parked anywhere, and yet the trails of auras that floated up out of the basin suggested there must have been a zillion people down there. We parked and I was the first out of the car.
“I can’t wait to see it!” I said quickly, prying the door open in a haste and bolting from the car. Mom and dad thought somehow I’d gotten an instantaneous urge for geology, but in truth my curiosity was piqued by these colorful spouts and swirls of auras that wafted just over the basin.
But as I reached the edge of the parking lot and looked down into the basin, I was dismayed to find not another human being down there. On the contrary, what I saw was a sea of multi-colored auras, like a giant slush that swirled and ebbed and flowed. It was like a lake, steaming some trails up into the air, and none of it made a shred of sense to me.
“Come on honey, let’s get down there,” my dad said, behind me. Apparently they’d caught up to where I was already.
“Honey?” he asked again, somewhat disconcerted.
“She’s been like this for twenty minutes!” my mom’s exasperated voice shrieked.
I snapped my head back, surprised.
“Addy, are you alright?” my father asked, putting his hand on my shoulder.
Twenty minutes? Was that true? It felt like I’d just glanced at that ominous lake for a second. I knew my mom exaggerated all the time, but let’s say she did: twenty minutes in mom time was at least still ten minutes. Had I really tranced out for ten minutes? It felt like I'd just looked at it for a second...
“I’m fine!” I said back cheerfully. No need to worry them, I figured, and there was no way to explain what was bothering me anyway. They'd just have thought I'd gone crazy. Or crazier, depending on which of the two you asked.
“Great, let’s go down and check it out,” my dad said again, patting me on the back.
Down *there*, I thought? That’s the last place I wanted to be. All my experiences with colorful auras have spelled disaster for me, and this looked like a veritable smorgasbord of crap that I had no intention of walking into.
“I’ll… uh, I’ll stay here a little while,” I said after a moment.
“Suit yourself,” my dad said cheerfully, “I’ll go make sure there aren’t any monsters down there, how about that?”
My God, the irony was overwhelming.
My parents made their way down into the basin, and with each step further down I saw the swirl get disturbed more and more. It was like they were wading into a shallow-water pool that moved as if it was in low gravity. Each step disturbed it more, and kicked up more auras that now revealed themselves to be quite brilliant in color. At the bottom of all those auras, strange, bright letters appeared, so strange that the first impulse I had was to write it down as best I could:
pahimooyüntü sümüttüm ma to’engkünna
What it meant I had no idea, but the letters glimmered in bright bands and seemed to be themselves auras, just constrained into letters. They were covered up mostly, but my parents kicking up the swirl of auras revealed them to me.
Also, by this point in my life I realized auras were a lot like reptiles. The most beautiful ones were likely to kill you if you got close. But what I didn’t ever see was an aura without a human, and the thought alone gave me grave concerns.
“Come on in honey,” my dad now yelled from the middle of the basin, “The water’s fine!”
It was as if even without my gift of seeing auras, he was accidentally making dad-jokes. Meta-dad-jokes: the next frontier of driving your kids crazy.
“Just let her be!” my mom shushed him quickly, “She’s going through a lot!”
He shrugged his shoulders, and kicked around at the ground as he stood there.
What I saw next, I’d never seen before. The auras down by his feet started to swirl with much more energy, specifically around him. They passed through my mom like she wasn’t even there.
And in their swirling they climbed up, higher and higher, around his legs. I wanted to scream for him to get out, but at the same time I’d been on my best behavior so that my parents didn’t think I was going nuts from the stress of my boyfriend’s death. I hesitated, and it was as if the pool of auras sensed that immediately, because within a second at most they’d suddenly enveloped my dad entirely.
“Jim?” my mom shrieked, “Jim!”
My dad, who now I only saw as a silhouette of various colors, collapsed abruptly. While my mom saw none of this, she did see him fall over and immediately rushed to his side, and without another thought I ran as fast as I could toward him. The lettering disappeared completely, but under my feet as I ran I saw new letters came up all around me:
ünnü
Running into that pool of auras isn’t anything I’d have done in any other circumstance, but it’s one of those things, when you see someone you love in danger. I almost forgot they were there. As I ran in I felt chills along my body as they lapped up against me, but I got hold of my dad and I told my mom we had to pull him to the car. We hoisted him up and with one of us under each arm, we half-dragged half-hobbled him away from the basin. With each step out of there I felt the chills subsiding, and once he was in the car he started to come to.
“Where am I?” he mumbled incoherently.
Before I could answer my mom had started the car and slammed on the gas. We got to the nearest hospital in what I assume must have been record time, but after many hours of waiting we discovered nothing wrong with him. The doctors assumed, based on what my mom had told him, that he’d had a panic attack.
My dad, a panic attack. How absurd, I thought. He was the most mellow person I knew. But for my mom, the thought gave her pause. My boyfriend dying, everyone being on edge, and my dad was the rock that kept it together. No matter how down I was, or how frantic my mom became in the weeks and months after Billy died, he was always something we could lean on. And one thing is true for all rocks, my mom now realized: even the hardest ones break under enough pressure.
It was late by the time we finished at the hospital, and my mom decided to get a hotel for the night rather than to deal with the several-hour car ride. We checked in at a little place just next to Badwater Basin for the night, and my dad by this point was more or less back to himself, though fatigued.
But for me, there was something more sinister at play. My mom and dad have regular, healthy, benign auras; my dad’s is richly yellow, like a sun, and my mom’s is a more muddled yellow-brown. But as we sat there in the hotel room, I saw my dad’s aura on full display, and right by his chest, over where his heart would have been, there was a little round blotch on his aura that was solid lilac. It pulsed the way a heart pulses, and it scared the shit out of me. I wondered if it had to do with the lettering I'd seen at the basin earlier, and while I couldn't pull out my notebook and start researching in front of my parents, I did intend to do that as soon as I possibly could, because whatever was stuck on my dad's chest, completely unknown to him but almost blinding to me, needed to get away.
And I knew it could have only come from the basin, and I had a feeling deep in my gut that it would grow and destroy him. Lilac was the one color I’d figured out by that point, and everything about it was malevolent, malicious, and dangerous. And I knew that that night, when everyone had gone to sleep, I would need to sneak out of that hotel room and get back to that basin and face whatever was in there, or at the very least understand it, so that I could get this damn thing away from my dad for good.
Because the only reason any of us were here was because of me-- because of how much they wanted me to get my mind off Billy’s death. And now here we were, my dad poisoned and my mom frantic, and a pool in a basin that only I could see was threatening the only good man I had left in my life. I waited for everyone to sleep, and then I left that hotel to face the unknown that swirled and pooled just a ways down the road.
​
[Part 2 (final) part here.](https://www.reddit.com/r/nosleep/comments/asdbrc/you_dont_want_to_visit_death_valley_in_winter_the/)
​
​ | 0non-cybersec
| Reddit |
Can't get rid of Google's pagespeed insights warnings (the website has a blocking css). <p>When checking my website on Google's page-speed insights, it gives me alert, that the website has a blocking css: <a href="https://developers.google.com/speed/pagespeed/insights/?url=https%3A%2F%2Fwoohoocasino.com%2F&tab=mobile" rel="nofollow noreferrer">Google pagespeed insights</a>. This is the code I have:</p>
<pre><code><head>
<%= stylesheet_link_tag 'application', media: 'all', 'data-turbolinks-track': 'reload' %>
</head>
</code></pre>
<p>I tried to move it into the body, right before <code></body></code>, but it didn't help, it even reduced the points. What can be done to solve this issue? Thanks.</p>
| 0non-cybersec
| Stackexchange |
Rattlesnakes Rarely Strike When Stepped On. | 0non-cybersec
| Reddit |
What is the difference between `->>` and `->` in Postgres SQL?. <p>What is the difference between <code>->></code> and <code>-></code> in SQL?</p>
<p>In this thread (<a href="https://stackoverflow.com/questions/19422233/check-if-field-exists-in-json-type-column-postgresql">Check if field exists in json type column postgresql</a>), the answerer basically recommends using,</p>
<pre><code>json->'attribute' is not null
</code></pre>
<p>instead of,</p>
<pre><code>json->>'attribute' is not null
</code></pre>
<p>Why use a single arrow instead of a double arrow? In my limited experience, both do the same thing.</p>
| 0non-cybersec
| Stackexchange |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
Java Compiler for Less CSS?. <p>I am looking for Java-based Less CSS compilers.
On Github, I have stumbled across</p>
<ul>
<li>lesscss4j</li>
<li>lesscss-java</li>
</ul>
<p>Both are from the same developer. Unfortunately I cannot quite figure out the difference between them.</p>
<p>Can somebody tell me?
Which other compilers do you know?</p>
| 0non-cybersec
| Stackexchange |
Binding eigenvalue properties with normal operators. <p>Let $N$ be a <strong>normal</strong> transformation over $\Bbb C$.</p>
<p>A) True/False:$$N = N^* \Leftarrow\Rightarrow \lambda \in \Bbb R$$
(where $\lambda$ is any eigenvalue of $N$)</p>
<p>B) True/False:$$N^* = N^{-1} \Leftarrow\Rightarrow |\lambda|=1$$
(where $\lambda$ is any eigenvalue of $N$)</p>
<hr>
<p>In both cases, I am able to prove the direction $\Rightarrow$ quite easily.
but in the other direction i am having a struggle (perhaps its false?).</p>
<p>for ex. statement B: I thought of showing that since $N$ is normal, then it is diagonalizable, therefore $N^*$ is also diagonalizable with the conjugate eigenvalues on its diagonal, therefore for any $\lambda = (a+bi)$ then $NN^*$ has $(a+bi)(a-bi)$ on its diagonal, which is the identity matrix (since $|\lambda|=1$) and therefore $N$ is unitary, but i'm not sure my transitions are valid.</p>
<p>Anyway, any help much appreciated on both statements!</p>
| 0non-cybersec
| Stackexchange |
Actor Zachary Quinto Signs Up For The HITMAN Video Game Movie. | 0non-cybersec
| Reddit |
Misty Oregon river looks like a painting [oc][4048x3036]. | 0non-cybersec
| Reddit |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
What are you making for dinner this week?. Sorry if this is against the rules. I'm trying to feed a family of 3 (myself and my parents) and need some cheap dinner inspo. Bonus points if the recipes are less than 8 ingredients. Thanks! | 0non-cybersec
| Reddit |
Amazing Arya Drawing. | 0non-cybersec
| Reddit |
1+1=3 if you don’t use a condom. | 0non-cybersec
| Reddit |
Never noticed this until I installed iOS7. Seems like an awful lot of data for some messages. Anyway to delete it?. | 0non-cybersec
| Reddit |
How to format numbers as strings (1k, 2M...) without rounding up in python?. <p>I'm trying to round floor to <code>int</code> or to <code>1 decimal</code> for non-zero <code>float</code> with letters <code>k, M, B...</code>.</p>
<pre><code>def human_format(num):
num = float(f'{num:.3g}')
magnitude = 0
while abs(num) >= 1000:
magnitude += 1
num /= 1000.0
num = int(num * 10) / 10
return f"{f'{num:f}'.rstrip('0').rstrip('.')}{['', 'k', 'M', 'B', 'T'][magnitude]}"
</code></pre>
<p>Now this function returns as expected in this case:</p>
<pre><code>human_format(1294)
'1.2k'
</code></pre>
<p>And rounds up in the case below:</p>
<pre><code>human_format(1295)
'1.3k'
</code></pre>
<p>The rounding happens due to the flag <code>g</code> in string format and I don't know how to tune it.
How can I avoid rounding up, keeping everything else the same?</p>
| 0non-cybersec
| Stackexchange |
What is the correct way to solve $|2K^3-2K^4|$ determinant?. <blockquote>
<p>Given -
$$K_{3\times3} = \begin{bmatrix} 1&1&1 \\ 3&2&1 \\ 1&2&1 \end{bmatrix}$$
$$|K| = 2$$
Find -
$$|2K^3-2K^4|$$</p>
</blockquote>
<p>I tried this:</p>
<p>Since $|A+B|=|A|+|B|$ ( <strong>$\Leftarrow$ This is the main mistake</strong> ) -
$$|2K^3-2K^4|=|2K^3+(-2K^4)|=|2K^3|+|(-2K^4)|$$</p>
<p>Now using $|\alpha A_{n\times n}|=\alpha ^n|A|$ -
$$=2^3|K^3|+(-2^4)(K^4)|=8*8+(-16)*16=-192$$</p>
| 0non-cybersec
| Stackexchange |
Appending a template string. <p>Is it possible to append a template string to a div? I'm trying to optimise my code and currently my code is having to create element, add classes, add a text node and then append all together. I was wondering if its possible to just create a template string and then append that, to be more efficient? I don't want to wipe out the current div's html with innerHTML.</p>
<pre><code>socket.on('coinFlip', (result) => {
const messages = document.querySelector('#messages');
const output = `<li class="message broadcast">${result.result}</li>`;
messages.appendChild(output);
});
</code></pre>
<p>Current code that works is:</p>
<pre><code>socket.on('coinFlip', (result) => {
// Grab dialog box
const messages = document.querySelector('#messages');
// Render messages
const li = document.createElement('li');
li.className = "message broadcast";
const text = document.createTextNode(`${result.result}`);
li.appendChild(text);
messages.appendChild(li);
});
</code></pre>
| 0non-cybersec
| Stackexchange |
ITAP of a wave breaking at sunset. | 0non-cybersec
| Reddit |
OLPC cuts price of XO 1.75 laptop to $165, power by half. | 0non-cybersec
| Reddit |
What's the best way to edit Microsoft Word documents on iPad?. <p>I'm on the road and have the need to update my CV which is a Microsoft Word document. My CV is accessible via WebDav but I've also got it stored on the iPad using the Synology DS File app.</p>
<p>What is the best way to edit my CV using the iPad? Is there a native or web based app that can do this for me? I would expect that the formatting and tables in the document to be preserved when it is saved.</p>
| 0non-cybersec
| Stackexchange |
Mature skin make up. MCBB. I am very glad how my make up turned up even that I just recently started using. Thanks to all of you MUA. | 0non-cybersec
| Reddit |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
Make me love avocados. I love food, especially good food. It pains me that I can't get into avocados. I feel like I'm missing out on something amazing.
Reddit please show me the light. Post your favorite recipes involving avocados! Pleaseeeeee =) | 0non-cybersec
| Reddit |
What song is eargasm inducing?. | 0non-cybersec
| Reddit |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
Could you recommend a few guides for someone with
zero experience?. My girlfriend is getting really interested in drawing again for the first time since elementary school, and needs some help with technique and simple anatomy. I've search around this subreddit, but all of the advice I have been able to find looks too advanced. What books and authors would you reccomend she check out?
I have a few Imgur albums of her drawings, if you wish to get an idea of her skill level:
http://imgur.com/a/zVAaK
http://imgur.com/a/QGCRa
Thanks for your help, [/r/drawing](/r/drawing)
EDIT: Those drawings are all based on the comic ["Homestuck"](http://mspaintadventures.com/).
EDIT 2: I'm sorry if this is in the wrong place, I'll move it if it is. | 0non-cybersec
| Reddit |
Cookies in IdentityServer4. <p>Can someone explain the purpose of the cookies which are sent to the user browser after successful login in Identity Server4. Also I have three smaller related questions at the bottom.</p>
<p>The client is using cookie middleware in ASP.NET Core defined in the <strong>Startup.cs</strong> file.</p>
<pre><code>app.UseCookieAuthentication()
</code></pre>
<p>It's quite obvious which tokens Identity Server created and which cookies the ASP.NET Core middleware creates, but I'm not sure what content each cookie containts.</p>
<p>ASP.NET Core middleware decided to create chunked cookies probably due to the cookie size (4050B + 865B).</p>
<p>I have been trying to find a way of decrypting the cookies to read the values using the <a href="https://docs.asp.net/en/latest/security/data-protection/index.html" rel="noreferrer">Data Protection</a> API provided by ASP.NET Core without any luck.</p>
<ul>
<li>idsvr</li>
<li>idsvr.session</li>
<li>.AspNetCore.coookie</li>
<li>.AspNetCore.coookieC1</li>
<li>.AspNetCore.coookieC2</li>
<li>.AspNetCore.Antiforgery.</li>
</ul>
<p><a href="https://i.stack.imgur.com/5IdbA.png" rel="noreferrer"><img src="https://i.stack.imgur.com/5IdbA.png" alt="Screenshot from developer tools in Internet Explorer"></a></p>
<ol>
<li>Which cookie contains the id_token, access_token issued by Identity Server?</li>
<li>CookieName can be used to change the name of the cookie created by ASP.NET Core middleware, should different clients share same cookie name or do they need to have separate session cookies?</li>
<li>Can the Identity Server cookies be decrypted by using the <a href="https://docs.asp.net/en/latest/security/data-protection/index.html" rel="noreferrer">Data Protection</a> API?</li>
</ol>
| 0non-cybersec
| Stackexchange |
Linux: Merging multiple files, each on a new line. <p>I am using <strong>cat *.txt</strong> to merge multiple txt files into one, but I need each file to be on a separate line.</p>
<p>What is the best way to merge files with each file appearing on a new line?</p>
| 0non-cybersec
| Stackexchange |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.