text
stringlengths 3
1.74M
| label
class label 2
classes | source
stringclasses 3
values |
|---|---|---|
YSK: Putting Visine in drinks *doesn't* cause diarrhea, but it can cause a laundry list of shockingly bad other ailments. http://www.snopes.com/medical/myths/visine.asp
We've all heard the "bartender puts Visine in rowdy customer's drink" stories, with the supposed effect being diarrhea. Thing is, although Visine doesn't cause diarrhea, the active ingredient Tetrahydrozoline has been shown to have these nasty effects:
* Lowering body temperature to dangerous levels
* Making breathing difficult, or even halting it entirely
* Blurring vision
* Causing nausea and vomiting
* Elevating and then dropping blood pressure
* Causing seizures or tremors
* Sending the ingester into a coma
| 0non-cybersec
|
Reddit
|
bilinear form on Hilbert space. <p>$H$ Hilbert space, $a:H\times H \to\mathbb R$ a bilinear form with $|a(x,y)|\le C\|x\| \|y\|$ and $a(x,x)\ge\alpha\|x\|^2$ $\forall x,y\in H$ , $C>0, \alpha>0$, $L$ continuous linear functional on $H$</p>
<p>I already could prove that there exists a linear operator S, such that: $a(x,y)=(Sx,y)$</p>
<p>How can it be followed that there exists an unique $u\in H$, such that $\forall v\in H: a(u,v)=L(v)$ ?</p>
<p>The second thing I am interested in is: for $a(\cdot,\cdot)$ symmetric I define $\phi(x)=\frac{1}{2}a(x,x)-L(x)\forall x\in H$. Now it should be possible to characterize $u$ through $\phi(u)=\min_{x\in H}\phi(x)$ But how?</p>
| 0non-cybersec
|
Stackexchange
|
A golden tiger, golden tabby tiger or strawberry tiger is a tiger with a color variation caused by a recessive gene. This only occurs in captivity..
| 0non-cybersec
|
Reddit
|
How to write percentile symbol in latex?. <p>I want to write percentile (‰) symbol in latex. I've tried \‰ but it can't</p>
| 0non-cybersec
|
Stackexchange
|
Is there any actual significance to home/away teams?. Not skins, but teams. Like, I get home colors and away colors, it really does look nice in my opinion and makes it easy to differentiate between teams. But is there any actual *significance* to the home/away teams, like map choosing or picking who plays offense/defense first?
| 0non-cybersec
|
Reddit
|
How to install Chromium .zip file?. <p>I have the zip file but I don't know to install it from a .zip file. Here are the contents of the extracted <em>chrome-linux.zip</em> file:
<img src="https://i.stack.imgur.com/yjaKa.png" alt="inside the folder"></p>
| 0non-cybersec
|
Stackexchange
|
Number of cards picked (with replacement) until a full set of cards appears?. <p>Suppose $X$ is a random variable defined as the number of cards chosen from a pack of $n$ cards (with replacement) until a full set of cards appears. So for example
if I begin picking cards I might get lucky and pick $n$ distinct cards, in which case I took $n$ cards to get a full set. Or I might be less lucky and take
$n+54$ cards until I get the full set of $n$ distinct cards. My question then is:</p>
<hr>
<p><strong><em>My question</em></strong></p>
<p>What is the probability mass function related to $X$? Or in other words, what's
the probability that I get the full set of $n$ distinct cards after $k$ tries?</p>
<hr>
<p><strong><em>My attempt</em></strong></p>
<p>My attempt was the following:
Best case scenario we get $n$ distinct cards after $n$ cards chosen.
Then the probability would be $\frac{1}{n} \cdot \frac{1}{n} ... \frac{1}{n} \cdot \frac{1}{n} = (\frac{1}{n})^n$.</p>
<p>Or, and this is were I get iffy, we could get $n$ distinct cards after $n+1$ cards chosen. In that case I would still have to chose $n$ distinct cards $\frac{1}{n} \cdot \frac{1}{n} ... \frac{1}{n} \cdot \frac{1}{n}$, but I would have one repeated (doesn't matter
which one so long that it is not the last, so I would have
$(\frac{1}{n} \cdot \frac{1}{n} ... \frac{1}{n} \cdot \frac{1}{n}) (\frac{n-1}{n})$</p>
<p>Following the pattern, for $m \in \mathbb{N}$ I have that my probability mass function for the
random variable Y is </p>
<p>$P(Y=n+m) = (\frac{1}{n})^n(\frac{n-1}{n})^m$</p>
<p>Is this wrong? </p>
<p>Thanks for reading!</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
|
Confused how to arrive at the factorization of this polynomial. <p>The polynomial <span class="math-container">$f(n) = 3n^3 - 39n^2 + 360n + 20$</span> I saw has one real root and it's <span class="math-container">$$n_1=\frac{13}{3}-\frac{2}{3} \sqrt{191} \sinh \left(\frac{1}{3} \sinh
^{-1}\left(\frac{4913}{191 \sqrt{191}}\right)\right)\approx -0.055223771734378147887$$</span> First, what formula, or how can that be? Second, how is it so, numerically <span class="math-container">$$f(n) = 3n^3 - 39n^2 + 360n + 20$$</span> <span class="math-container">$$f(n)=3(n-n_1)(n^2-13.055223771734378148 n+120.72095869751148663)$$</span>?</p>
| 0non-cybersec
|
Stackexchange
|
Changing the value of $HOME in .bashrc. <p>First of all a bit of background. I apologise in advance for the misuse of terminology. Please correct me where necessary.</p>
<p>For my work I am going to be running simulations remotely via ssh on several ubuntu machines. These machines are in a network and my account is linked across all of them, ie. <code>$HOME</code> is <code>/home/links/Ogaday</code> and is mirrored across each machine. So I make a directory on one machine in that folder, and it appears in another machine (this is a case where I don't know how to use the correct terms). There is also local memory on each machine, accessible by each user on that machine, called <code>/scratch/</code>. I will make a directory in <code>/scratch/</code> to do my actual work in, because I don't think I have enough memory on my account to run the simulations in $HOME, and it will be faster because it's all local, I assume. </p>
<p>Now, there is software installed on those machines that I need to use, and it is installed in directories that I have no write access to (<code>/usr/local/software/</code>). However, that software has a bash script that sets environment variables. I'm supposed to append the bash script (<code>source /usr/local/software/etc/bashrc</code>) to <code>$HOME/.bashrc</code> in order to set the necessary environment variables. Pretty standard so far, this sets everything up for this software to run when I log in, correct? Now, I think that the software on these computers hasn't been configured properly, because the <code>.../etc/bashrc</code> is supposed to set a variable called <code>$SOFTWARE_INST_DIR</code>, the install directory. By default, this is <code>$HOME/software</code>, and it is necessary to change that bashrc file so that it instead sets it to <code>/usr/local/software</code>. Of course, I don't have write access to to <code>.../etc/bashrc</code>. There are other similar issues, this is just the thing that fails first.</p>
<p>As a fix, I copied that file into <code>$HOME/software-etc/bashrc</code> and appended <code>source $HOME/software-etc/bashrc</code> to <code>$HOME/.bashrc</code> instead of appending <code>source /usr/local/software/etc/bashrc</code>, so that I can edit the variables it assigns. Is there anything fundamentally wrong with this? I thought another solution would be to, instead of copying the bashrc file from the software install location, appending <code>export $HOME=/scratch/ogaday</code> to .bashrc, which I assume would reassign my home directory to scratch. Am I correct? Is this dangerous? I wouldn't really be using these machines for anything else except running long simulations on them.</p>
<p>ps: The final solution would be to ask the IT guys to look into it I guess! I'd rather do a quick fix though if it's possible.</p>
| 0non-cybersec
|
Stackexchange
|
Urban Decay's Sale section is looking pretty sweet right now....
| 0non-cybersec
|
Reddit
|
You are now blind. [pic].
| 0non-cybersec
|
Reddit
|
Ok....???.
| 0non-cybersec
|
Reddit
|
python pptx align image to center of slide. <p>I need to add an image to a pptx slide, and want to locate it in the center of the slide, without having to calculate the size and alignment manually, </p>
<p>I found a question about doing so with text:
<a href="https://stackoverflow.com/questions/38935137/center-align-text-with-python-pptx">question about center aligning text</a></p>
<p>And the documentation about doing so with text:
<a href="https://python-pptx.readthedocs.io/en/latest/api/enum/PpParagraphAlignment.html" rel="noreferrer">documentation about center aligning text</a></p>
<p>But can't find a way to do it for an image, </p>
<p>Ideas? </p>
| 0non-cybersec
|
Stackexchange
|
Probability: Four cards face down, two are red, two are black. Aim is to find the red ones.. <p>There are four playing cards face down on a table, two are red two are black. You must guess which two are red by pointing to them, and implicitly which two are black. Assuming all configurations are equally likely, and that you do not have psychic abilities, find the probability that exactly j of your guesses are correct for <code>j = 0, 1, 2, 3, 4</code>.</p>
<p>Blitzstein, Introduction to Probability, exercise 1-30.</p>
<p>My thoughts:</p>
<ul>
<li><p>First, I do not fully understand the j guesses part. I assume it means that you play n rounds of the game, and must find the probability of <code>0, 1, 2, 3, 4</code> of the n games being won...?</p></li>
<li><p>As all configurations are equally likely, this reads as an ordered problem without replacement when picking cards in each round. Therefore probability of selecting two red cards is <code>1/6</code></p></li>
<li><p>I think the general answer is <code>P(j wins of n Games) = (1/6)**j * (5/6)**(n-j)</code> but I have invented the variable n because the initial question appears vague.</p></li>
</ul>
| 0non-cybersec
|
Stackexchange
|
find xargs and curl give an error with -C- option. <p>This command works fine </p>
<pre><code>find ~/mypath -name *.fstq -print|xargs curl -u sdd:dsdsd ftp://ftp.dsdd.nsdh.com/sdsds/ -T
</code></pre>
<p>but when I add </p>
<pre><code>find ~/mypath -name *.fstq -print|xargs curl -C- -u sdd:dsdsd ftp://ftp.dsdd.nsdh.com/sdsds/ -T
</code></pre>
<p>I get an error message</p>
<pre><code>curl: (25) Failed FTP upload: 451
curl: (3) <url> malformed
curl: (3) <url> malformed
curl: (3) <url> malformed
</code></pre>
<p>any ideas how I can use resume (-C-) option with this pipe?</p>
| 0non-cybersec
|
Stackexchange
|
These fools did WHAT with their legs!?!.
| 0non-cybersec
|
Reddit
|
Why does bit-wise shift left return different results in Python and Java?. <p>I'm trying to port some functionality from a Java app to Python.</p>
<p>In Java,</p>
<pre><code>System.out.println(155 << 24);
</code></pre>
<p>Returns: -1694498816</p>
<p>In Python:</p>
<pre><code>print(155 << 24)
</code></pre>
<p>Returns 2600468480</p>
<p>Many other bitwise operations have worked in the same way in both languages. Why is there a different result in these two operations?</p>
<hr>
<p>EDIT: I'm trying to create a function in python to replicate how the left shift operator works in Java. Something along the lines of:</p>
<pre><code>def lshift(val, n):
return (int(val) << n) - 0x100000000
</code></pre>
<p>However this doesn't seem right as (I think) it turns all numbers negatives?</p>
<hr>
<p>EDIT2: Several hours later, I've decided it is probably not the best idea to use Python for this job and will take part of the Java application and use it as a micro service for the existing Python app.</p>
| 0non-cybersec
|
Stackexchange
|
The Ingenuity of the old school "pre-bot" Gamer Generation.
| 0non-cybersec
|
Reddit
|
Happy Birthday to my Best Friend.
| 0non-cybersec
|
Reddit
|
GUYS I GOT A GIRLFRIEND. Now that I've got your attention...
If Jesus were a prostitute would you call it crosstitution
| 0non-cybersec
|
Reddit
|
My buddy, Jack, as Handsome Jack..
| 0non-cybersec
|
Reddit
|
Pro Trick: Seed a Pomegranate with no mess!. here it is: http://www.youtube.com/watch?v=-qfQ3_N7S6Y
after seeing the awesome trick for [peeling garlic](http://www.saveur.com/article/video/video-How-to-Peel-a-Head-of-Garlic-in-Less-Than-10-Seconds?cmpid=fb) on reddit, I felt like giving something back! Enjoy. (hope this isn't a repost, but after searching for a little while I didn't find anything)
| 0non-cybersec
|
Reddit
|
Calculating specific lottery winning odds. <p>In the lottery of, you select 6 out of 34 numbers.</p>
<p>Also, you can send a ticket with up to <strong>8 different combinations</strong> (that are automatically generated).</p>
<p>Starting from 3 correct number guesses you could win money back.</p>
<p>I am interested in understanding how to calculate the odds of getting <strong><em>at least</em></strong> 3 correct matches.</p>
<p>That means - if i send a lottery ticket with 8 lines of 6 selected numbers, what are the odds of me getting 3,4,5,6 correct matches?</p>
| 0non-cybersec
|
Stackexchange
|
How do I install CVS on Ubuntu manually from a rpm file?. <p>I have downloaded <code>cvs-1.11.18-cvshome.org.FC1.1.i386.rpm</code> from CVS homepage and I want to install CVS manually on Ubuntu, since I don't have an internet connection. How do I install it?</p>
| 0non-cybersec
|
Stackexchange
|
Traveling witch.
| 0non-cybersec
|
Reddit
|
Kaleidoscopic building effect.
| 0non-cybersec
|
Reddit
|
a few hundred saved seeds, to be planted tomorrow! any other ents do this?.
| 0non-cybersec
|
Reddit
|
How to have a dhcp server on top of VirtualBox in Windows 10?. <p>In Linux, by running the command below, a DHCP server takes control of IP assigning:</p>
<p><code>VBoxManage dhcpserver add --netname intnet --ip 10.10.10.1 --netmask 255.255.255.0 --lowerip 10.10.10.2 --upperip 10.10.10.100 --enable</code></p>
<p>How it can be implemented in Windows? I need a floating IP to be seen by two VMs created in VirtualBox. VMs should also be able to <code>ping</code> each other.</p>
| 0non-cybersec
|
Stackexchange
|
Interview Question in C#. <p>A Technical Lead asked me the following:<br>
He created a class, declared an object and initialized it. But in some circumstance we may get "null reference" exception.<br>
He commented that there are 1000 possible reasons for such exception and asked me to guess a single reason.<br>
I am unable to figure it out. What is (are) the reason(s) ,we may get such an exception?</p>
| 0non-cybersec
|
Stackexchange
|
When does a measurable function exist with a given distribution?. <p>Let's suppose (A,X,P) and (B,Y,Q) are two probability spaces (A,B underlying spaces, X,Y sigma-algebras, P,Q probability measures, respectively).</p>
<p>Under what (topological and/or measure theoretic) conditions on these two spaces does there exist a measurable map M: A -> B
such that </p>
<p>P(M in b) = Q(b) for an arbitrary element b of Y. </p>
<p>Thanks a lot for your help. </p>
| 0non-cybersec
|
Stackexchange
|
Closed, open subspaces, dense subsets. <p>Two questions from Dugundji's book (not hw, just practice).</p>
<p>1) Let $Y_{1}, Y_{2}$ be subspaces of $X$ and $A \subset Y_{1} \cap Y_{2}$. Assume that $A$ is open in $Y_{1}$ and open in $Y_{2}$. Prove A is open in $Y_{1} \cup Y_{2}$.</p>
<p>Can you please give a hint for this one?</p>
<p>2) a. Let $D$ be dense in $X$. Give an example to show that $D \cap A$ need not to be dense in $A$. </p>
<p>Can't we take $X = \mathbb{R}$, $D=\mathbb{Q}$ then $D$ in dense in $X$. Now take $A =$ irrationals, since the empty set is closed then it cannot be dense in $A$.</p>
<p>b. If $A$ is dense in $B \subset X$ then $A$ is dense in $\overline{B}$.</p>
<p>Attempt:</p>
<p>Let $V \subset \overline{B}$ be an open set, then by definition of subspace topology we have $V = C \cap \overline{B}$ where $C$ is an open subset of $X$. Now consider $C \cap B$ ,this is an open set in $B$ so $A$ intersects this set and hence $A$ is dense in $\overline{B}$. What bothers me, is how do we know that $C \cap B$ is non-empty?</p>
<p>Thanks.</p>
| 0non-cybersec
|
Stackexchange
|
‘Empire’ To End On Fox With Final Season Cut Short By Coronavirus Pandemic, Early Series Finale Set.
| 0non-cybersec
|
Reddit
|
About to wrap up my A.A.S. in System and Network Admin this fall. I found a B.A. program in Information Science which will cost me $0 (fin aid). Should I spend another 18-24 months in school for the B.A. or enter the working world? I'll be 25 in December. . My 2 year program houses the CCNA and CCNP cisco net academy curriculums. I will be taking the CCNA exam and Sec+ exam this summer. I already have an A.S. in liberal arts and I'll be doing an internship this fall.
Option A: Enter the working world with an Associates in System and Network admin, a CCNA cert and Sec+ cert at 25 years old.
Option B: Enter the working world with an Associates in System and Network admin, a CCNA cert and Sec+ cert **AND** a B.A. in Information Science at ~27 years old.
I'd like to have a 4 year degree for better job opportunities but I'm insecure about living at home for another ~2 years and being "old" by the time I enter the working world.
So, advice?
EDIT: I have no interest in the computer science program offered at the same school, I find the curriculum boring. The info sci curriculum is more interesting in my opinion.
| 1cybersec
|
Reddit
|
long double vs long int. <p>I'm doing a program that calculates the probability of lotteries.
Specification is choose 5 numbers out of 47 and 1 out of 27</p>
<p>So I did the following:</p>
<pre><code>#include <iostream>
long int choose(unsigned n, unsigned k);
long int factorial(unsigned n);
int main(){
using namespace std;
long int regularProb, megaProb;
regularProb = choose(47, 5);
megaProb = choose(27, 1);
cout << "The probability of the correct number is 1 out of " << (regularProb * megaProb) << endl;
return 0;
}
long int choose(unsigned n, unsigned k){
return factorial(n) / (factorial(k) * factorial(n-k));
}
long int factorial(unsigned n){
long int result = 1;
for (int i=2;i<=n;i++) result *= i;
return result;
}
</code></pre>
<p>However the program doesn't work. The program calculates for 30 seconds, then gives me <code>Process 4 exited with code -1,073,741,676</code> I have to change all the long int to long double, but that loses precision. Is it because long int is too short for the big values? Though I thought long int nowadays are 64bit? My compiler is g++ win32 (64bit host).</p>
| 0non-cybersec
|
Stackexchange
|
Oh hey there.
| 0non-cybersec
|
Reddit
|
NYC: Asian Indian businessman Vinod Dadlani, involved in one of the Largest Credit Card Fraud Schemes EVER prosecuted by U.S..
| 0non-cybersec
|
Reddit
|
Is it possible to log mysql queries from other hosts in general log?. <p>I'm having a task to figure out what are the hosts that are still running scripts that accessing our database directly so we can prevent that from happening(we only want our web app to access the database but nothing else). I just learnt that enabling <code>general_log</code> would give me a nice table of access log. My problem is that the table grows too fast and easily lost control.</p>
<p>For my specific use case, my question would be: is there a mysql feature to make <code>general_log</code> only record database access from other hosts so <code>general_log</code> could record less data? I know it's pretty unlikely to happen, so my last option is to periodically delete the records that are local access. But this might cause performance issue. Do you think it makes sense to do that? Is there a better way to do it? Thanks.</p>
| 0non-cybersec
|
Stackexchange
|
After seeing all these Halloween costumes, i definitely have a bunch of tv shows to catch up on.... Eleven is a big deal. Gotta find out what's up with that.
| 0non-cybersec
|
Reddit
|
My BF of Nine Months Told Me He Loves Me, but Will Never "Be *in Love*" with Me. . I'm 10 years older than my 29 year old boyfriend. When we met, I was in a very different mind set. I've always been very independent, worked a lot of hours and had an active social life.
A couple of years ago I got sick. I'm better now and getting back to normal since shortly before I met my BF, we'll call him Adam. I've since lost the majority of my support group in life. I work somewhere that I can't really be friends with my co-workers. A close family member died and divided the family. I lost all but a couple of family members.
At one point, before all this, Adam said he really cared about me and had never met anyone like me, etc. He said he wanted to get married and have kids one day (not specifically with me necessarily, but he wanted to know if it was a possibility and let me know that this was a general goal of his). I explained I'd already raised a kid and been married twice (first guy died, second one left me for another woman) and I didn't want to get married again.
We decided we'd just have a good time and then end it when we felt it was time.
Since then, I've been changing my mind . . . I think. After the family member died and my son went off to college, I find I have very little family left. I've been feeling alone in the world and like maybe I'll eventually have no family, no husband, no young kids to raise, really nothing.
So, I asked him again about his plans, I asked if he wanted to move forward, the two of us and he answered honestly, "I love you, but I'm not *in love* with you. I want to keep seeing you, but I don't think I'll ever have the kind of strong feelings you want me to have." He ended with a very cold sounding, "Just let me know when you want to call it" referring to breaking up.
I suppose it's relevant to mention that although he works very hard, he has little money. I have a lot of money and I pay for everything we do together. I don't pay for his car or rent, etc., but if we have a nice dinner I pay. If we go out of town I pay. At first I saw this as "We love each other and are having a good time, who cares who pays? I want him here and this is the only way it can happen." Now, justifiably or not, I'm thinking, "I'm paying so he'll stick around even though he really doesn't love me."
I never thought I would be this person. A person who questions keeping someone around, even if it's bought affection, so I don't have to be alone. I never even worried about being alone until recently. Now, I'm almost panicked by the thought.
Also relevant to note is that he is a nice person. Again, he doesn't ask me for anything, he's not hinting that his car payment is coming due, he doesn't cheat/lie/abuse drugs, etc. He kisses and hugs me and brings me flowers he picks. He spends all his free time with me. He seems to genuinely enjoy spending time with me.
Anyway, any advice is appreciated. I am so sad because when he gets off work I think I'm going to tell him I need time and space. I am worried if I stay with someone who will never really love me, I will miss a last opportunity to meet someone who will. And I'm worried that while he's "hanging out" with me in a semi-stagnant relationship, he will miss his chance to have a family. I just can't seem to pull the trigger. Advice???
Edit: To be clear, I love him. I am in love with him. I have never said this because, well, it doesn't feel great saying it after hearing him say the contrary. It's not just that I want to suddenly get married. I don't even know if I want that.
I guess the bigger question is: Do you stay with someone you love for the time being, even if they don't feel the same, but you're both otherwise happy? Or do you break up so you can find someone to be wholly happy with - someone who loves you as much as you love them? Even if it's a dice roll?
Edit: Thank so, so very much for all the advice. I just needed someone to say what I already knew.
He's not a bad guy and I appreciate that he was honest. Still hurts, but he's not in the wrong (he could have been a little more sensitive, but in his defense, he's likely tired of this conversation).
Anyway, I told him last night I needed some time to think. We had plans with his friends from out of town, but I didn't go. He even offered to cancel plans and stay with me. He gave me a big hug and said, "I still want to be with you. I really like being with you. I can't imagine you not in my life. I wish I could give you more." He kissed me on the forehead and mumbled something about me looking sexy and left. Ugh, even mature, best-case-scenario break ups hurt. Could be worse, could be worse.
| 0non-cybersec
|
Reddit
|
What is the most cost-effective and delicious way to get drunk?.
| 0non-cybersec
|
Reddit
|
A necessary condition to $F'(x)=f(x)$ for a continuous function $f$. <blockquote>
<p><strong>Theorem:</strong> Consider ,</p>
<p><span class="math-container">$$F(x)=\int_a^xf(t)\,dt$$</span></p>
<p>If the function <span class="math-container">$f:[a,b]\to \mathbb R$</span> is continuous then , <span class="math-container">$F(x)$</span> is differentiable and <span class="math-container">$F'(x)=f(x).$</span></p>
</blockquote>
<p>I know that the <strong>continuity</strong> condition of <span class="math-container">$f$</span> is <strong>sufficient</strong> condition.</p>
<p>That means there exists a discontinuous function <span class="math-container">$f$</span> for which this <span class="math-container">$F'(x)=f(x)$</span>.</p>
<p><strong>My Question:</strong></p>
<p>Does there exist a <strong>necessary</strong> condition for this ?</p>
<p><span class="math-container">$$OR$$</span></p>
<p>After imposing which extra condition on <span class="math-container">$f$</span> it is necessary that <span class="math-container">$F'(x)=f(x)$</span> ?</p>
| 0non-cybersec
|
Stackexchange
|
glibc PTR_MANGLE broken for static compiled executables: XOR with 0..
| 1cybersec
|
Reddit
|
Arnold.
| 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
|
How much are you worth?.
| 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
|
Counting curves of degree 4 in $\mathbb{P}^{3}$. <p>Let $p_1,...,p_8\in\mathbb{P}^{3}$ be points in linear general position. Then there exists a unique elliptic curve $C$ of degree $4$ passing through $p_1,...,p_8$. I am interested in what happens for nodal rational curves of degree $4$.</p>
<p>Now, let us suppose we have seven points $p_1,...,p_7\in\mathbb{P}^{3}$ in linear general position. </p>
<p><strong>How many irreducible, rational curves of degree $4$ pass through $p_2,...,p_7$ and have a singular point of multiplicity $2$ at $p_1$ ?</strong> </p>
<p>Such a curve can be constructed as a complete intersection of two quadric surfaces which are tangent at $p_1$, or as a projection of a rational normal quartic curve $C$ in $\mathbb{P}^{4}$ from a point lying on a secant line or an a tangent line of $C$.</p>
| 0non-cybersec
|
Stackexchange
|
Here's a chart for the NFL regular season I made for those who like things more visual. The winner goes in the box..
| 0non-cybersec
|
Reddit
|
TIFU by moving. So my earphones are some how incompatible with my tablet, so for them to work I have to adjusts them for 5 minutes, here the biggest FU of the day. I move, unplugging my earphones. Here go 5 minutes of my life I will never get back.
| 0non-cybersec
|
Reddit
|
Men and women: Tell us how your kink/fetish makes things interesting or fun in non-sex times. M47 been married 22 years, two full-time jobs, three kids. And I have a foot fetish, and love my wife's feet very much. Pretty much whenever I want, or whenever she asks, I can touch, feel, rub, and love on her feet. This is usually when we're watching tv and/or chilling together. If we're alone I can lick them and suck on her toes at pretty much any time I want. She doesn't object, and likes it. This doesn't lead to sex, but it does make me horny. Like this morning before work, she was on the couch watching the news, we were both drinking coffee, and I knelt in front of her feeling and licking her feet. Of course, now I'm horny for the day, but that's all right because there should be some activity tonight.
Guys and girls, what do you do in relation to your kink or fetish at non-sex times?
| 0non-cybersec
|
Reddit
|
Error:could not create the Java Virtual Machine Error:A fatal exception has occured.Program will exit. <p>I have just installed Java SE Development Kit 8u91 on my 64 bit Windows-10 OS. I set my <em>path</em> variables . I tried <strong>java --version</strong> in my command prompt it gave me an error.</p>
<pre><code>c:\Users\Onlymanu>java --version
Unrecognized option: --version
Error: Could not create the Java Virtual Machine.
Error: A fatal exception has occurred. Program will exit.
</code></pre>
<p>But when i tried <strong>java -version</strong> it worked. </p>
<p>I tried initializing <em>_JAVA_OPTIONS</em> environment variable and ever tried re-installation none of them worked. Can any one help me please?</p>
| 0non-cybersec
|
Stackexchange
|
LQR with augumented state design. <p>I am trying to design a LQR controller with Integral action (Linear-Quadratic-Integral control) for a below plant. The plant has 4 states, 2 inputs and 4 output. Is it possible to track 4 reference using LQI controller?</p>
<p><span class="math-container">$$ A = \left(\begin{matrix}-1.340&0.672&-12.9669&9.775\\-2.070&-3.275&1.707&0\\4.405&0.2345&-4.3911&0\\0&1&0.0713&0\end{matrix}\right) $$</span></p>
<p><span class="math-container">$$ B = \left(\begin{matrix}0&-3.0234\\18.624&24.110\\14.073&-7.060\\0&0\end{matrix}\right) $$</span></p>
<p><span class="math-container">$$ C= \left(\begin{matrix}1&0&0&0\\0&1&0&0\\0&0&1&0\\0&0&0&1\end{matrix}\right) $$</span>
<a href="https://i.stack.imgur.com/SCzCb.png" rel="nofollow noreferrer">Click here for Controller structure</a> (source- <a href="https://bit.ly/2LUpU7X" rel="nofollow noreferrer">https://bit.ly/2LUpU7X</a>)</p>
<p>The system is Controllable and is open loop stable.</p>
<p>Below is the script which I tried to solve in MATLAB:</p>
<pre><code>A_aug = [A, zeros(4,4); -C, zeros(4,4)];
B_aug = [B; zeros(4,2)];
Q = eye(8);
R = eye(2);
F_aug = -lqr(A_aug,B_aug,Q,R);
k = F_aug(:,1:n);
k_i = F_aug(:,end);
</code></pre>
<p>But I was getting this error.</p>
<blockquote>
<p>Cannot compute the stabilizing Riccati solution S for the LQR design.
This could be because:<br>
* R is singular,<br>
* [Q N;N' R] needs to be positive definite,<br>
* The E matrix in the state equation is singular.</p>
</blockquote>
| 0non-cybersec
|
Stackexchange
|
Enable dhcp server in Win7 for LAN. <p>This is setup,</p>
<p>Custom Board <---LAN---> Laptop[Win7] <---Wifi---> Router</p>
<p>I am implementing dhcp client on custom board, i am not able to receive any dhcp offer after sending dhcp discover to Laptop/Router[don't know to whom request is going], using wireshark for monitoring.</p>
<p>My question is how do i configure dhcp server in windows7 for lan? I tried setting LAN IPv4 configuration to Automatic, enabled internet sharing[Wifi] on LAN.</p>
<p>Also tried following softwares<br>
1.) <a href="http://www.dhcpserver.de/cms/" rel="nofollow noreferrer">http://www.dhcpserver.de/cms/</a><br>
2.) tftpd64<br>
3.) AlaxInfoDhcpServer<br></p>
| 0non-cybersec
|
Stackexchange
|
I didn't choose the 🔥 hummingbird feeder life, it chose me..
| 0non-cybersec
|
Reddit
|
Stargazers to spot the brightest Jupiter in 50 years.
| 0non-cybersec
|
Reddit
|
Table footnotes not showing. <p>I have a really large table (that i have splitted in three lines) with footnotes. When I typeset it (TeXworks), the table loads fine, while the footnotes are not showing. The labels are showing though.</p>
<pre><code>\documentclass[12pt, a4paper, oneside]{report}
\usepackage[utf8]{inputenc}
\usepackage[margin=2.5cm, left=3cm]{geometry}
\usepackage{etoolbox}
\usepackage{array}
\newcolumntype{H}{>{\lrbox0}c<{\endlrbox}@{}}
%the H columns will now be hidden
\begin{document}
\begin{table}%[p]
\textbf{\caption{Št. kolonij v odvisnosti od datuma}}
\begin{tabular}{||l||r|r|r|r|r|rHHHHHHHH|}
\hline \hline
Datum & 9.\,2.\,2017 & 10.\,2.\,2017 & 10.\,2.\,2017 & 11.\,2.\,2017 & 12.\,2.\,2017 & 13.\,2.\,2017 & 14.\,2.\,2017 & 15.\,2.\,2017 & 16.\,2.\,2017 & 17.\,2.\,2017 & 18.\,2.\,2017 & 19.\,2.\,2017 & 20.\,2.\,2017 & 21.\,2.\,2017 \\ \hline
Ura & 17.51 & 6.48 & 18.10 & 17.34 & 17.24 & 17.57 & 20.14 & 17.23 & 18.10 & 18.22 & 18.02 & 16.56 & 21.29 & 19.05 \\ \hline \hline
SD \footnote{FN1} & 18 & 19 & 17 & 23 & 23 & 24 & 25 & 25 & 28 & 38 & 39 & 38 & 37 & 37 \\ \hline
MT \footnote{FN2} & 32 & 35 & 35 & 35 & 34 & 39 & 43 & 42 & 41 & 45 & 48 & 47 & 47 & 48 \\ \hline
RT \footnote{FN3} & 4 & 4 & 4 & 4 & 5 & 5 & 5 & 6 & 6 & 7 & 7 & 7 & 9 & 8 \\ \hline
ŽR \footnote{FN4} & 6 & 6 & 6 & 6 & 8 & 8 & 9 & 9 & 10 & 10 & 11 & 11 & 10 & 10 \\ \hline
KV \footnote{FN5} & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 \\ \hline
BA \footnote{FN6} & 1 & 1 & 2 & 2 & 2 & 3 & 3 & 3 & 3 & 3 & 3 & 3 & 3 & 3 \\ \hline
KO \footnote{FN7} & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 2 & 2 \\ \hline \hline
\end{tabular}
\vspace{0.3cm} %i want to create space here, this vspace creates it below this part.
\begin{tabular}{|HHHHHHHr|r|r|r|r|rHH|}
\hline \hline
Datum & 9.\,2.\,2017 & 10.\,2.\,2017 & 10.\,2.\,2017 & 11.\,2.\,2017 & 12.\,2.\,2017 & 13.\,2.\,2017 & 14.\,2.\,2017 & 15.\,2.\,2017 & 16.\,2.\,2017 & 17.\,2.\,2017 & 18.\,2.\,2017 & 19.\,2.\,2017 & 20.\,2.\,2017 & 21.\,2.\,2017 \\ \hline
Ura & 17.51 & 6.48 & 18.10 & 17.34 & 17.24 & 17.57 & 20.14 & 17.23 & 18.10 & 18.22 & 18.02 & 16.56 & 21.29 & 19.05 \\ \hline \hline
SD & 18 & 19 & 17 & 23 & 23 & 24 & 25 & 25 & 28 & 38 & 39 & 38 & 37 & 37 \\ \hline
MT & 32 & 35 & 35 & 35 & 34 & 39 & 43 & 42 & 41 & 45 & 48 & 47 & 47 & 48 \\ \hline
RT & 4 & 4 & 4 & 4 & 5 & 5 & 5 & 6 & 6 & 7 & 7 & 7 & 9 & 8 \\ \hline
ŽR & 6 & 6 & 6 & 6 & 8 & 8 & 9 & 9 & 10 & 10 & 11 & 11 & 10 & 10 \\ \hline
KV & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 \\ \hline
BA & 1 & 1 & 2 & 2 & 2 & 3 & 3 & 3 & 3 & 3 & 3 & 3 & 3 & 3 \\ \hline
KO & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 2 & 2 \\ \hline \hline
\end{tabular}
\begin{tabular}{|HHHHHHHHHHHHHr|r||}
\hline \hline
Datum & 9.\,2.\,2017 & 10.\,2.\,2017 & 10.\,2.\,2017 & 11.\,2.\,2017 & 12.\,2.\,2017 & 13.\,2.\,2017 & 14.\,2.\,2017 & 15.\,2.\,2017 & 16.\,2.\,2017 & 17.\,2.\,2017 & 18.\,2.\,2017 & 19.\,2.\,2017 & 20.\,2.\,2017 & 21.\,2.\,2017 \\ \hline
Ura & 17.51 & 6.48 & 18.10 & 17.34 & 17.24 & 17.57 & 20.14 & 17.23 & 18.10 & 18.22 & 18.02 & 16.56 & 21.29 & 19.05 \\ \hline \hline
SD & 18 & 19 & 17 & 23 & 23 & 24 & 25 & 25 & 28 & 38 & 39 & 38 & 37 & 37 \\ \hline
MT & 32 & 35 & 35 & 35 & 34 & 39 & 43 & 42 & 41 & 45 & 48 & 47 & 47 & 48 \\ \hline
RT & 4 & 4 & 4 & 4 & 5 & 5 & 5 & 6 & 6 & 7 & 7 & 7 & 9 & 8 \\ \hline
ŽR & 6 & 6 & 6 & 6 & 8 & 8 & 9 & 9 & 10 & 10 & 11 & 11 & 10 & 10 \\ \hline
KV & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 & 2 \\ \hline
BA & 1 & 1 & 2 & 2 & 2 & 3 & 3 & 3 & 3 & 3 & 3 & 3 & 3 & 3 \\ \hline
KO & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 2 & 2 \\ \hline \hline
\end{tabular}
\end{table}
\end{document}
</code></pre>
<p>I have also tried <code>\clearpage</code> but it is not working either. And also, I want to create space between first and second "row" of tables (first and second table), where the comment is.</p>
| 0non-cybersec
|
Stackexchange
|
What is the significance of the matrix in the LAPACK logo?. <p>This is the <a href="http://www.netlib.org/lapack/" rel="noreferrer">LAPACK linear algebra library</a> logo:</p>
<p><img src="https://i.stack.imgur.com/PkkDV.png" alt="LAPACK logo"></p>
<p>What is the significance of this matrix?</p>
| 0non-cybersec
|
Stackexchange
|
TIL Bill Murray had no scripted lines in "Caddyshack" and improvised all his lines.
| 0non-cybersec
|
Reddit
|
arXiv:math/9702202v1 [math.GR] 20 Feb 1997
ar
X
iv
:m
at
h/
97
02
20
2v
1
[
m
at
h.
G
R
]
2
0
F
eb
1
99
7
Solvable Baumslag-Solitar Groups Are Not Almost Convex
Charles F. Miller III and Michael Shapiro*
The arguments of Cannon, Floyd, Grayson and Thurston [CFGT] showing that
solvegeometry groups are not almost convex apply to solvable Baumslag-Solitar
groups.
Introduction
The property of almost convexity was first introduced by Cannon in [C]. This property
has very geometric in flavor, being defined in terms of the geometry of the Cayley graph.
If the Cayley graph is almost convex then there are efficient algorithms for calculating in
G, or, if you like, constructing the Cayley graph of G.
Given a group G and a finite generating set C ⊂ G, the Cayley graph of G with
respect to C is the directed, labeled graph whose vertices are the elements of G and whose
directed edges are the triples (g, c, g′) such that g, g′ ∈ G, c ∈ C and g′ = gc. Such an edge
is directed from g to g′ and is labeled by c. We denote this Cayley graph by Γ = ΓC(G).
We will assume that C is closed under inverses.
A Cayley graph has a natural base point 1 ∈ G and a natural path metric d = dC
which results from identifying each edge with the unit interval. Each element of G has a
natural length ℓ(G) = ℓC(g) = dC(1, g). We define the ball of radius n to be
B(n) = {x ∈ Γ | dC(1, x) ≤ n} .
The group G is almost convex (k) with respect to C if there is N = N(k) so that if
g, g′ ∈ B(n) and dC(g, g
′) ≤ k then there is a path p from g to g′ inside B(n) whose length
is at most N . G is almost convex with respect to C if it is almost convex (k) with respect
to C for each k. It is a theorem of Cannon [C] that if G is almost convex (2) with respect
to C then G is almost convex with respect to C.
Thiel [T] has show that almost convexity is not a group property, i.e, that there are
groups which are almost convex with respect to one generating set but not another. Almost
convexity is fairly well understood for the fundamental groups of closed 3-manifold groups
with uniform geometries [SS]. The solvegeometry case was covered in a beautiful paper
of Cannon, Floyd, Grayson, and Thurston [CFGT]†. They show that any group which
* We wish to thank the ARC for support.
† Cannon has pointed out to us that there are problems with some of the details in their
paper. These concern the relationship between lengths in the given group G ⊂ Isom(Sol)
and the finite index subgroup A = G ∩ Sol. These problems are easily fixed and in our
view, their paper remains quite beautiful.
1
http://arxiv.org/abs/math/9702202v1
acts co-compactly, discretely by isometries on Sol cannot be almost convex with respect
to any generating set. In this paper we show that their arguments apply to solvable
Baumslag-Solitar groups
G = B1,p = 〈a, t | t
−1at = ap〉
with |p| > 1.
Theorem. Let G = B1,p be a solvable Baumslag-Solitar group with |p| > 1. Then G is
not almost convex with respect to any generating set.
Proof of the Theorem
Let G = B1,p with |p| > 1. Then G has the form
G = Z [1/p]⋊ Z,
where the generator of Z acts via multiplication by p. Thus each element of G has the
form (f, c) where f is a fraction of the form
f =
m
pn
,
and m,n, c ∈ Z. For each element (f, 0) ∈ Z[1/p] ⊂ G, we will take |(f, 0)| = |f | and if n
is minimal such that f = m/pn, we will say that |p|n is the denominator of (f, 0) written
denom(f, 0).
We fix a generating set
C = {(fi, ci)}
which we assume is closed under inverses. We take
c = max{ci | (fi, ci) ∈ C}
f∗ = max{fi | (fi, ci) ∈ C}
f∗∗ = max{denom(fi, 0) | (fi, ci) ∈ C}.
We assume (f∗, c) ∈ C realizes the first of these maxima. Notice that c > 0.
We need the following two lemmas which give information about distance with respect
to the generating set C.
Lemma 1. There is a constant M so that if (f, 0) ∈ B(n) then either |f | ≤ M |p|
nc
4 or
denom(f) ≤ M |p|
nc
4 . Further, both |f | ≤ M |p|
nc
2 and denom(f) ≤ M |p|
nc
2
Proof. First observe the following product formula:
(f1, c1) . . . (fn, cn) =
(
n
∑
i=1
fip
(0−c1−···−ci−1),
n
∑
i=1
ci
)
.
Since (f, 0) ∈ B(n), (f, 0) can be written as such a product where each (fi, ci) is in C and
∑n
i=1 ci = 0. For each i, i = 1, . . . , n, we set ei = 0− c1 − . . .− ci−1. Then ei is positive
2
for at most n/2 values of i, or ei is negative for at most n/2 values of i. Suppose that ei
is positive for at most n/2 values of i. We then have
|f | =
n
∑
i=1
fip
(0−c1−···−ci−1)
≤ f∗
n
∑
i=1
|p|(0−c1−···−ci−1)
= f∗
∑
ei≤0
|p|ei +
∑
ei>0
|p|ei
≤ f∗
(
n+
∑
ei>0
|p|ei
)
.
Let us enumerate the {ei | ei > 0} as i increases, so that these are the ⌊n/2⌋-
tuple (ei1 , ei2 , . . . , ei⌊n
2
⌋
). If there are less than ⌊n/2⌋ of these, we will consider any
final entries in this list to be 0. We now take the m-tuple (e′i1 , e
′
i2
, . . . , e′im) to be
(c, 2c, . . . , nc
4
, nc
4
, . . . , 2c, c). Here m is either ⌊n/2⌋ or ⌊n/2⌋ + 1. It is not hard to see
that for each j, eij ≤ e
′
ij
. Consequently,
|f | ≤ f∗
(
n+ 2|p|c + 2|p|2c + · · ·+ 2|p|
nc
4
)
,
and thus for suitable choice of M ′, |f | ≤ M ′|p|
nc
4 .
On the other hand if more than n/2 of the ei are positive, then less than n/2 of
them are negative, and in particular, the most negative any of these can be is −nc
4
. It
immediately follows that
denom(f, 0) ≤ f∗∗|p|
nc
4 .
Taking M = max{M ′, f∗∗} completes the proof of the first part of Lemma 1. After
suitably enlarging M , a completely similar proof gives the simultaneous bound on |f | and
denom(f)
We also need the following observation.
Lemma 2. If h, h′ ∈ Z[1/p] ⊂ G with dC(h, h
′) ≤ r then ||h| − |h′|| ≤ M |p|
rc
2 and
| denom(h)− denom(h′)| ≤ M |p|
rc
2 .
Proof. If dC(h, h
′) ≤ r then (using additive notation in Z[1/p]) h− h′ ∈ B(r). Thus
||h| − |h′|| ≤ |h− h′| ≤ M |p|
rc
2 .
On the other hand h = h′ + (h− h′) and h′ = h− (h− h′) so we have
denom(h) ≤ max{denom(h′), denom(h− h′)} ≤ denom(h′) + denom(h− h′),
and
denom(h′) ≤ max{denom(h), denom(h− h′)} ≤ denom(h) + denom(h− h′).
Consequently,
| denom(h)− denom(h′)| ≤ denom(h− h′) ≤ M |p|
rc
2 .
3
We now return to the proof of the Theorem. For each k > 0 we take
Tk = (f∗, c)
−k(1, 0)(f∗, c)
k = (pck, 0)
Sk = (f∗, c)
k(1, 0)(f∗, c)
−k = (p−ck, 0)
We then have TkSk = SkTk. For some j which we will fix later, we take
αk = SkTk(f∗, c)
−j
βk = TkSk(f∗, c)
j
If we take ℓ = ℓC(1, 0) and k > j, then αk and βk both lie in B(4k + 2ℓ − j) and within
distance 2j of each other.
Suppose that, contrary to hypothesis, G is almost convex. Then there is a constant
N = N(2j) so that αk and βk are joined by a path of length at most N lying entirely
within B(4k+ 2ℓ− j). The second coordinates of points along this path vary from −jc to
+jc changing by at most ±c along each edge. In particular, this path must pass through
a point P ′k of the form (gk, i) with |i| ≤ c/2. We take
ǫ = max {ℓC(0, i) | |i| ≤ c/2} .
It follows that the point
Pk = (gk, 0)
lies within B(4k + 2ℓ + ǫ − j) and within distance N/2 + ǫ + j of SkTk. Notice that the
distance from Pk to SkTk is bounded by a constant independent of k. It is this fact that
we will contradict, thus showing G is not almost convex in the given generating set.
From Lemma 1 above it follows that either
|Pk| ≤ M |p|
c(k+
2ℓ+ǫ
4
−
j
4
)
or
denom(Pk) ≤ M |p|
c(k+ 2ℓ+ǫ
4
−
j
4
).
Let us fix j so that
|p|
j
4 > M |p|
2ℓ+ǫ
4c
+1
and hence
M |p|c(k+
2ℓ+ǫ
4
−
j
4
) = |p|kc(M |p|
2ℓ+ǫ
4c |p|−
j
4 ) ≤ |p|kc−1.
It then follows that either
|Pk| ≤ |p|
kc−1
or
denom(Pk) ≤ |p|
kc−1.
Now |SkTk| = |p
kc + p−kc| and denom(SkTk) = |p|
kc. Hence either
|SkTk| − |Pk| ≥ |p
kc + p−kc| − |p|kc−1 = |p|kc−1(|p+ p−2kc+1| − 1) > |p|kc−1
or
denom(SkTk)− denom(Pk) ≥ |p|
kc − |p|kc−1 = |p|kc−1(|p| − 1) ≥ |p|kc−1.
In either case by Lemma 2, as k → ∞ the distance dC(Pk, SkTk) increases without bound.
But our assumption of almost convexity implied dC(Pk, SkTk) ≤ N/2 + ǫ + j which is a
constant. This is a contradiction. Hence G is not almost convex.
4
References
[C] J. Cannon, Almost convex groups, Geom. Dedicata 22 197–210 (1987).
[CFGT] J. Cannon, W. Floyd, M. Grayson and W. Thurston, Solvgroups are not almost
convex, Geom. Dedicata 31 no. 3 292–300 (1989).
[SS] M. Shapiro and M. Stein, Almost convexity and the eight geometries, Geom.
Dedicata, 55, 125–140, (1995).
[T] C. Theil, Zur fast-konvexität einiger nilpotenter gruppen, Doctoral dissertation,
Bonn, 1991.
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3052
Australia
5
| 0non-cybersec
|
arXiv
|
[Spoilers] Sousei no Onmyouji - Episode 46 discussion. *Sousei no Onmyouji*, episode 46: Yuto - Destiny
---
**Streams**
* [Crunchyroll](http://crunchyroll.com/twin-star-exorcists)
**Show information**
* [MyAnimeList](http://myanimelist.net/anime/32105/)
* [AniDB](http://anidb.net/perl-bin/animedb.pl?show=anime&aid=11785)
* [AniList](http://anilist.co/anime/21499)
---
**Previous discussions**
Episode|Link|Score
:--|:-:|:-:
1|http://redd.it/4dl96f|
2|http://redd.it/4el18w|
3|http://redd.it/4fmsin|
4|http://redd.it/4gny7m|
5|http://redd.it/4htylx|
6|http://redd.it/4iudez|
7|http://redd.it/4jw3qd|
8|http://redd.it/4kz2vb|
9|http://redd.it/4m0om4|
10|http://redd.it/4n4g46|
11|http://redd.it/4o6r5a|
12|http://redd.it/4pa307|
13|https://redd.it/4risj4|7.01
14|http://redd.it/4smkqs|7.01
15|http://redd.it/4tqlvg|7.01
16|http://redd.it/4uu1af|7.01
17|http://redd.it/4vxxnp|7.01
18|http://redd.it/4x1l87|7.01
19|http://redd.it/4y4xgh|7.03
20|http://redd.it/4zbzs9|7.05
21|http://redd.it/50glvc|7.07
22|http://redd.it/51kozv|7.08
23|http://redd.it/52pwqa|7.09
24|http://redd.it/53slan|7.1
25|http://redd.it/54vrx2|7.1
26|http://redd.it/55ywlh|7.1
27|http://redd.it/57dc8u|7.1
28|http://redd.it/589o96|7.1
30|http://redd.it/5ap8m9|7.1
31|http://redd.it/5c0oh9|7.11
32|http://redd.it/5d8tgk|7.11
33|http://redd.it/5egxgj|7.11
34|http://redd.it/5fp87d|7.11
35|http://redd.it/5gzi7n|7.11
36|http://redd.it/5ia77s|7.11
37|http://redd.it/5jjjyr|7.11
38|http://redd.it/5lyqfy|7.11
39|http://redd.it/5nbsjn|7.11
40|http://redd.it/5ooyim|7.1
41|http://redd.it/5q2sg2|7.1
42|http://redd.it/5rf2ez|7.1
43|http://redd.it/5ssans|7.1
44|http://redd.it/5u6y96|7.1
45|http://redd.it/5viafi|7.1
---
*Some episodes will be missing from the previous discussion list, and others may be incorrect. If you notice any other errors in the post, please message /u/TheEnigmaBlade.*
*You can also help by contributing on [GitHub](https://github.com/TheEnigmaBlade/holo).*
| 0non-cybersec
|
Reddit
|
Angular - Is there list of HostListener-Events?. <p>I am using a hostlistener in a directive to detect "blur"- and "keyup"-events.
Now I need to detect changes in the input-element the directive sits on. I tried </p>
<pre><code>@HostListener('change', ['$event'])
</code></pre>
<p>but it does not fire.</p>
<p>Is there a "change"-event? I have also read, that there should be an "input"-event, but that does not fire either.</p>
<p>So, my question is:
Is there a list of available events that I can use?</p>
<p>I have searched google:</p>
<p><a href="https://www.google.de/search?q=angular%202%20list%20of%20hostlistener%20events" rel="noreferrer">https://www.google.de/search?q=angular+2+list+of+hostlistener+events</a></p>
<p>and the angular-documentation:</p>
<p><a href="https://angular.io/api/core/HostListener" rel="noreferrer">https://angular.io/api/core/HostListener</a></p>
<p>but did not find anything.</p>
| 0non-cybersec
|
Stackexchange
|
The Battlefield 4 theme song is pretty sweet.
| 0non-cybersec
|
Reddit
|
This guy is such a smooth talker.
| 0non-cybersec
|
Reddit
|
Laser vision, sure. But can't hit a thing..
| 0non-cybersec
|
Reddit
|
bluetooth not detecting devices (firmware error. <p>my bluetooth is not able to detect any of the other bluetooth devices ... i was using windows before and the bluetooth was working fine ... </p>
<blockquote>
<p><code>dmesg | grep firmware</code></p>
</blockquote>
<p>results in "[ 15.275727] bluetooth hci0: Direct firmware load failed with error -2
"</p>
<pre><code>lsusb | grep Bluetooth
</code></pre>
<p>results in "Bus 001 Device 004: ID 0a5c:21d7 Broadcom Corp. BCM43142 Bluetooth 4.0"</p>
<p>which clearly states that there is bluetooth adapter but i am having firmware issues.</p>
| 0non-cybersec
|
Stackexchange
|
This Woman Made A Death Star Dress. All Other Dresses Are Inferior..
| 0non-cybersec
|
Reddit
|
Expressing Eisenstein series E_k in terms of E_4 and E_6. <p>Given an Eisenstein series $E_k$ (of level 1), it is a polynomial $P_k(E_4,E_6)$ in $E_4$ and $E_6$, and <a href="http://en.wikipedia.org/wiki/Eisenstein_series#Recurrence_relation" rel="nofollow">http://en.wikipedia.org/wiki/Eisenstein_series#Recurrence_relation</a> should give a finite algorithm for doing so.</p>
<p>Do we know any properties of these polynomials $P_k$ or are there any formulas? A quick internet search didn't turn up with anything, but maybe I just didn't know what to search.</p>
<p>(As before, if somebody knows enough about the subject to tell me if this is appropriate for overflow, e.g. not found in a common textbook, then I might want to post it there instead.)</p>
| 0non-cybersec
|
Stackexchange
|
What is this fractal pattern on a frozen pond?.
| 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
|
Grid data-structure and placement algorithm for my Battleships implementation?. <p>I am trying to make my own version of the game Battleships (in German: Schiffe versenken).</p>
<p>I have made the game board as a <code>dataframe</code> (10x10). The coordinates of the ships are created randomly. I have 4 different kinds of ships ( starting with the length of 5 to 2). Each of these ships is a list. The elements of the list are made of the randomly created starting coordinates(ship_row, ship_col) and depending if the ship is horizontal or vertical the other elements are either <code>ship_row+n</code> or <code>ship_col+n</code>.</p>
<p>Problem: that it can happen that the length of the ship exceeds the board <code>dataframe</code>. How can I set boundaries for those ship lists and how can I make a Loop, to create a new ship list if the first made one exceeds the boundaries?</p>
<p>Here my Code for the example ship Schlachtschiff:</p>
<pre><code>board=[]
for n in range (10):
board.append(['O']*10)
board = pd.DataFrame(board)
g= rd.randint(1,2)
random_row(board)
random_col(board)
ship_row = random_row(board)
ship_col = random_col(board)
for Schlachtschiff in board:
if g==1:
Schlachtschiff = [(ship_row, ship_col),(ship_row, ship_col+1),(ship_row, ship_col+2),(ship_row, ship_col+3),(ship_row, ship_col+4)]
else:
Schlachtschiff= [(ship_row, ship_col),(ship_row+1, ship_col),(ship_row+2, ship_col),(ship_row+3, ship_col),(ship_row+4, ship_col)]
</code></pre>
<p>I tried to solve it with a while loop, by looking at the last element of the created list, but that would not stop:</p>
<pre><code>while Schlachtschiff[-1] not in board:
if g==1:
Schlachtschiff = [(ship_row, ship_col),(ship_row, ship_col+1),(ship_row, ship_col+2),(ship_row, ship_col+3),(ship_row, ship_col+4)]
else:
Schlachtschiff= [(ship_row, ship_col),(ship_row+1, ship_col),(ship_row+2, ship_col),(ship_row+3, ship_col),(ship_row+4, ship_col)]
if Schlachtschiff[-1] in board:
break
</code></pre>
<p>To stop the ships from overlapping I wrote this code ( Note "Kreuzer is the second kind of ship, being created the same way as above):</p>
<pre><code>for i in Schlachtschiff:
for j in Kreuzer:
if i == j:
random_row(board)
random_col(board)
ship_row_1 = random_row(board)
ship_col_1 = random_col(board)
g= rd.randint(1,2)
if g==1:
Kreuzer = [(ship_row, ship_col),(ship_row, ship_col+1),(ship_row, ship_col+2)]
else:
Kreuzer = [(ship_row, ship_col),(ship_row+1, ship_col),(ship_row+2, ship_col)]
</code></pre>
<p>Now I dont have that Problem anymore thanks to help of @smci. My code looks like that now:</p>
<pre><code>board = []
board = pd.DataFrame(data='□', index=range(1,10+1), columns=list('ABCDEFGHIJ'))
print(board)
def random_row(board):
return rd.randint(0,len(board)-1)
def random_col(board):
return rd.randint(0,len(board)-1)
def Schiff_erstellen(Schiff,Start,Stop):
g= rd.randint(1,2)
random_row(board)
random_col(board)
ship_row = random_row(board)
ship_col = random_col(board)
Schiff=[(ship_row, ship_col)]
while Schiff[-1] > (ship_row_probe, ship_col_probe):
g= rd.randint(1,2)
random_row(board)
random_col(board)
ship_row = random_row(board)
ship_col = random_col(board)
Schiff=[(ship_row, ship_col)]
if g == 1:
for i in range(Start,Stop):
Schiff.append((ship_row, ship_col+i))
else:
for i in range(Start,Stop):
Schiff.append((ship_row+i, ship_col))
if Schiff[-1] <= (ship_row_probe, ship_col_probe):
break
return Schiff
</code></pre>
| 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
|
Wiener Sausages in Riemann Surfaces. <p>Let $M$ be a Riemann surface (or a higher dimensional manifold) and let's assume that it's geodesically complete. Let $W(t)$ be a Brownian motion on the surface accordingly to the manifold's Laplacian and let $r>0$. </p>
<p>Define the Wiener sausage as:</p>
<p>$$
W_{r}(t):=\{ x\in M: d(x,W(s))\leq r\quad\text{for}\quad 0\leq s\leq t \}.
$$</p>
<p>It is known that in $\mathbb{R}^{2}$ and for t sufficiently large and $r$ fixed</p>
<p>$$
\mathbb{E}[\mathrm{vol}(W_{r}(t))]=\frac{2\pi t}{\log(t)}(1+o(1)).
$$</p>
<p>Is there any analogue result for a general Riemann surface or at least the hyperbolic space?</p>
<p>Thanks!</p>
<p>--Gabriel</p>
| 0non-cybersec
|
Stackexchange
|
Ruby's digits method performance. <p>I'm solving some Project Euler problems using Ruby, and specifically here I'm talking about problem 25 (What is the index of the first term in the Fibonacci sequence to contain 1000 digits?).</p>
<p>At first, I was using Ruby <code>2.2.3</code> and I coded the problem as such:</p>
<pre><code>number = 3
a = 1
b = 2
while b.to_s.length < 1000
a, b = b, a + b
number += 1
end
puts number
</code></pre>
<p>But then I found out that version <code>2.4.2</code> has a method called <code>digits</code> which is exactly what I needed. I transformed to code to:</p>
<pre><code>while b.digits.length < 1000
</code></pre>
<p>And when I compared the two methods, <code>digits</code> was much slower.</p>
<p><strong>Time</strong></p>
<p><code>./025/problem025.rb 0.13s user 0.02s system 80% cpu 0.190 total</code></p>
<p><code>./025/problem025.rb 2.19s user 0.03s system 97% cpu 2.275 total</code></p>
<p>Does anyone have an idea why? </p>
| 0non-cybersec
|
Stackexchange
|
Bluetooth not working (Ubuntu 14.10, Acer E5-571, Atheros). <p>After following through several other Articles about seemingly the same problem I failed repeatedly to pair Bluetooth devices with my Laptop Acer E5-571. The GUI shows Bluetooth tools, but searching for devices, switched to visible, gives no results. Some config information: </p>
<p><code>lsusb</code> outputs: </p>
<pre><code>Bus 003 Device 002: ID 8087:8000 Intel Corp.
Bus 003 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub
Bus 002 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub
Bus 001 Device 003: ID 04f2:b469 Chicony Electronics Co., Ltd
Bus 001 Device 002: ID 0489:e078 Foxconn / Hon Hai
Bus 001 Device 004: ID 046d:c52e Logitech, Inc.
Bus 001 Device 005: ID 0781:5151 SanDisk Corp. Cruzer Micro Flash Drive
Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub
</code></pre>
<p><code>hciconfig</code> outputs: </p>
<pre><code>hci0: Type: BR/EDR Bus: USB
BD Address: 90:48:9A:DA:36:28 ACL MTU: 1022:8 SCO MTU: 183:5
UP RUNNING PSCAN ISCAN
RX bytes:1498 acl:0 sco:0 events:77 errors:0
TX bytes:2067 acl:0 sco:0 commands:76 errors:0
</code></pre>
<p><code>lsmod</code> outputs:</p>
<pre><code>Module Size Used by
uas 22673 0
usb_storage 67010 2 uas
hid_generic 12559 0
usbhid 53155 0
ctr 13193 1
ccm 17856 1
rfcomm 75066 12
bnep 23980 2
intel_rapl 19196 0
uvcvideo 86723 0
x86_pkg_temp_thermal 14312 0
intel_powerclamp 19099 0
videobuf2_vmalloc 13216 1 uvcvideo
nls_iso8859_1 12713 2
videobuf2_memops 13362 1 videobuf2_vmalloc
coretemp 13638 0
kvm_intel 149984 0
videobuf2_core 51547 1 uvcvideo
v4l2_common 15715 1 videobuf2_core
joydev 17587 0
kvm 475233 1 kvm_intel
videodev 163831 3 uvcvideo,v4l2_common,videobuf2_core
media 22008 2 uvcvideo,videodev
crct10dif_pclmul 14268 0
crc32_pclmul 13180 0
hid_multitouch 17657 0
ghash_clmulni_intel 13230 0
arc4 12573 2
acer_wmi 20027 0
ath9k 162133 0
ath9k_common 25638 1 ath9k
snd_hda_codec_realtek 76099 1
snd_hda_codec_generic 69995 1 snd_hda_codec_realtek
ath9k_hw 460416 2 ath9k_common,ath9k
snd_hda_codec_hdmi 52670 1
sparse_keymap 13890 1 acer_wmi
snd_hda_intel 30783 5
snd_soc_rt5640 93325 0
aesni_intel 169686 3
btusb 32691 0
aes_x86_64 17131 1 aesni_intel
lrw 13323 1 aesni_intel
snd_soc_rl6231 13037 1 snd_soc_rt5640
ath 29397 3 ath9k_common,ath9k,ath9k_hw
gf128mul 14951 1 lrw
snd_hda_controller 32234 1 snd_hda_intel
mac80211 697143 1 ath9k
bluetooth 486890 22 bnep,btusb,rfcomm
snd_soc_core 207596 1 snd_soc_rt5640
snd_hda_codec 144641 5 snd_hda_codec_realtek,snd_hda_codec_hdmi,snd_hda_codec_generic,snd_hda_intel,snd_hda_controller
cfg80211 520257 4 ath,ath9k_common,ath9k,mac80211
glue_helper 14095 1 aesni_intel
rtsx_pci_ms 18337 0
ablk_helper 13597 1 aesni_intel
memstick 16968 1 rtsx_pci_ms
serio_raw 13483 0
snd_compress 19395 1 snd_soc_core
snd_hwdep 17709 1 snd_hda_codec
cryptd 20531 3 ghash_clmulni_intel,aesni_intel,ablk_helper
snd_pcm_dmaengine 15229 1 snd_soc_core
i915 1031913 6
snd_pcm 106273 7 snd_soc_rt5640,snd_soc_core,snd_hda_codec_hdmi,snd_hda_codec,snd_hda_intel,snd_hda_controller,snd_pcm_dmaengine
snd_seq_midi 13564 0
snd_seq_midi_event 14899 1 snd_seq_midi
snd_rawmidi 31197 1 snd_seq_midi
snd_seq 63540 2 snd_seq_midi_event,snd_seq_midi
parport_pc 32909 0
snd_seq_device 14497 3 snd_seq,snd_rawmidi,snd_seq_midi
8250_dw 13474 0
ppdev 17711 0
lp 17799 0
snd_timer 30118 2 snd_pcm,snd_seq
i2c_hid 19065 0
mei_me 19565 0
snd 84025 23 snd_hda_codec_realtek,snd_soc_core,snd_hwdep,snd_timer,snd_hda_codec_hdmi,snd_pcm,snd_seq,snd_rawmidi,snd_hda_codec_generic,snd_hda_codec,snd_hda_intel,snd_seq_device,snd_compress
drm_kms_helper 99802 1 i915
drm 323675 5 i915,drm_kms_helper
soc_button_array 12771 0
hid 110572 4 i2c_hid,hid_multitouch,hid_generic,usbhid
mei 88473 1 mei_me
parport 42481 3 lp,ppdev,parport_pc
shpchp 37216 0
dw_dmac 12835 0
dw_dmac_core 28558 1 dw_dmac
snd_soc_sst_acpi 13007 0
mac_hid 13275 0
soundcore 15091 2 snd,snd_hda_codec
video 20649 2 i915,acer_wmi
i2c_designware_platform 13025 0
spi_pxa2xx_platform 23256 0
i2c_algo_bit 13564 1 i915
i2c_designware_core 14990 1 i2c_designware_platform
wmi 19379 1 acer_wmi
lpc_ich 21176 0
rtsx_pci_sdmmc 23718 0
ahci 34220 3
r8169 86907 0
libahci 32446 1 ahci
rtsx_pci 51162 2 rtsx_pci_ms,rtsx_pci_sdmmc
mii 13981 1 r8169
sdhci_acpi 13502 0
sdhci 43929 1 sdhci_acpi
</code></pre>
<p><code>uname -a</code> outputs: </p>
<pre><code>Linux Aspire-E5-571 3.18.0-031800rc3-generic #201411022335 SMP Sun Nov 2 23:36:52 UTC 2014 x86_64 x86_64 x86_64 GNU/Linux
</code></pre>
<p><code>dmesg|grep Bluetooth</code> outputs: </p>
<pre><code>[ 14.138559] Bluetooth: Core ver 2.19
[ 14.138573] Bluetooth: HCI device and connection manager initialized
[ 14.138578] Bluetooth: HCI socket layer initialized
[ 14.138579] Bluetooth: L2CAP socket layer initialized
[ 14.138583] Bluetooth: SCO socket layer initialized
[ 19.711600] Bluetooth: BNEP (Ethernet Emulation) ver 1.3
[ 19.711603] Bluetooth: BNEP filters: protocol multicast
[ 19.711611] Bluetooth: BNEP socket layer initialized
[ 19.809332] Bluetooth: RFCOMM TTY layer initialized
[ 19.809342] Bluetooth: RFCOMM socket layer initialized
[ 19.809346] Bluetooth: RFCOMM ver 1.11
</code></pre>
| 0non-cybersec
|
Stackexchange
|
Rick Ross - Stay Schemin Ft. Drake & French Montana.
| 0non-cybersec
|
Reddit
|
Finally I discover how all of my work clothes mysteriously have random cat hairs poking out.
| 0non-cybersec
|
Reddit
|
Anthem Early UK Sales Paint a Grim Picture, Around 10% of Destiny 1 Debut and Half of Andromeda.
| 0non-cybersec
|
Reddit
|
Sweet Dreams.
| 0non-cybersec
|
Reddit
|
Trust Issues Relative to Open Source. <p>Two separate discussions have very recently opened my eyes to an issue I had not considered – how to confirm the Open Source binary one uses is based on the published source code. </p>
<p>There is a large discussion <a href="http://thread.gmane.org/gmane.comp.security.cryptography.randombit/4952/focus=4959" rel="nofollow">thread</a> on cryptography-randombit based on Zooko Wilcox-O'Hearn's, founder and CEO of LeastAuthority.com, open letter to Phil Zimmermann and Jon Callas, two of the principals behind Silent Circle, the company that ran Silent Mail which touched on the subject. Additionally, a Dr. Dobbs article published today entitled <a href="http://www.drdobbs.com/tools/putting-absolutely-everything-in-version/240160762" rel="nofollow">Putting Absolutely Everything in Version Control</a> touched on it as well.</p>
<p>The issue of concern for this question is ability to recompile Open Source code and get the same results as the published binary. In other words, if you recreate the same binary and hash it from source code it is unlikely to be identical due to differences in tool chains and some randomizations in compilers themselves. </p>
<p>The Dr. Dobbs article suggests putting even the tool chain under version control for reasons of reproducibility. Jon Callas points out that in many cases it may be impossible to redistribute the tool chain for various reasons including licensing restrictions.
Unless you are compiling the code yourself you are adding a trust step to your assumption set as the binary cannot be even recreated by others with the same results.</p>
<p>I now understand that this is an understandably accepted risk. My question is are there other discussions or indicatives relative to making source code byte for byte reproducible when compiled thus eliminating the need to trust the provider of even Open Source binaries? As referenced in Jon Callas’ discussion Ken Thompson showed <a href="http://dl.acm.org/citation.cfm?id=358210" rel="nofollow">“You can't trust code that you did not totally create yourself.”</a> What are the security implications thoughts on this subject? </p>
| 0non-cybersec
|
Stackexchange
|
Window's native event forwarding directly to a syslog\sql server. <p>Right now I have events being forwarded to a collector on which I then run a script to pull them out of the collector's event logs as xml and then insert them in a DB.</p>
<p>Is there any utility that knows the native windows event forwarding protocol that can receive incoming forwarded events and insert them directly into a DB? I'm surprised I haven't seen any products that do this yet.</p>
<p>I was looking at <a href="http://msdn.microsoft.com/en-us/library/windows/desktop/bb513659%28v=vs.85%29.aspx" rel="nofollow noreferrer">the API</a>, but it doesn't look like it provides a way to change the data source to something like a sql DB instead of the windows eventlog.</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
|
2 brothers fighting over a toy..
| 0non-cybersec
|
Reddit
|
How can I slurp STDIN in Perl?. <p>I piping the output of several scripts. One of these scripts outputs an entire HTML page that gets processed by my perl script. I want to be able to pull the whole 58K of text into the perl script (which will contain newlines, of course).</p>
<p>I thought this might work:</p>
<pre><code>open(my $TTY, '<', '/dev/tty');
my $html_string= do { local( @ARGV, $/ ) = $TTY ; <> } ;
</code></pre>
<p>But it just isn't doing what I need. Any suggestions?</p>
| 0non-cybersec
|
Stackexchange
|
Planet Express in a bottle. Done by Jacqui Alberts, Iron Mountain Tattoo - Redding, CA.
| 0non-cybersec
|
Reddit
|
Difference between map[string]interface{} and interface{}. <p>I want to parse a JSON file to a <code>map[string]interface{}</code>:</p>
<pre><code>var migrations map[string]interface{}
json.Unmarshal(raw, &migrations)
fmt.Println(migrations["create_user"])
</code></pre>
<p>But I modified my code to point data to <code>interface{}</code>:</p>
<pre><code>var migrations interface{}
json.Unmarshal(raw, &migrations)
// compile wrong here
fmt.Println(migrations["create_user"])
</code></pre>
<p>I don't understand much about difference between <code>map[string]interface{}</code> and <code>interface{}</code> in above case.</p>
| 0non-cybersec
|
Stackexchange
|
Golden Globes will not stream online, NBC says.
| 0non-cybersec
|
Reddit
|
How to design global distributed transaction(none database)? Can JTA use for none db transaction?. <p>I think this is a fairly common question: how to put my business logic in a global transaction in distributed systems environment? Cite an example, I have a TaskA containing couples of sub tasks:</p>
<p>TaskA {subtask1, subtask2, subtask3 ... }</p>
<p>each of these subtasks may execute on local machine or a remote one, I hope TaskA executes in an atomic manner(success or fail) by means of transaction. Every subtask has a rollback function, once TaskA thinks the operation fails(because one of subtask fails), it calls each rollback function of subtasks. Otherwise TaskA commits the whole transaction.</p>
<p>To do this, I follow "Audit trial" transaction pattern to have a record for each subtask, so TaskA can know operation results of subtasks then decide rollback or commit. This sounds like simple, however, the hard part is how to associate each subtask to the global transaction?</p>
<p>When TaskA begins, it starts a global transaction about which subtask knows nothing. To make subtask aware of it, I have to pass the transaction context to every invocation of subtask. This is really dreadful! My subtask may either execute in a new thread or execute in remote by sending a message through AMQP broker, it's hard to consolidate the way of context propagation. </p>
<p>I did some research like "Transaction Patterns - A Collection of Four Transaction Related Patterns", "Checked Transactions in an Asynchronous Message Passing Environment", none of these solve my problem. They either don't have practical example or don't solve the context propagation issue. </p>
<p>I wonder how people solve this? as this sort of transaction must be common in enterprise software.</p>
<p>Is X/Open XA only the solution for this? Can JTA help here(I have't look into JTA as most stuff for it relate to database transaction, and I am using Spring, I don't want to involve another Java EE application server in my software).</p>
<p>Can some expert share some thoughts with me? thank you.</p>
<h2>Conclusion</h2>
<p><strong>Arjan and Martin gave out really good answers, thank you.
Finally I didn't go with this way.</strong> After more research, I chose another pattern "<strong>CheckPoint</strong>" <a href="http://ncomprod.nokia.com/library/files/docs/Design_Patterns_for_Checkpoint-Based_Rollback_Recovery.pdf" rel="noreferrer" title="Check Point">1</a>.</p>
<p>Looking into my requirement, I found my intention to "Audit Trial Transaction Pattern" is to know which level the operation has proceeded to, if it's failed, I can restart it at the failed spot after reloading some context. Actually this is not transaction, it didn't rollback other successful steps after failure. This is essence of CheckPoint pattern.
However, studying distributed transaction stuff makes me learned lot of interesting things. Apart from what Arjan and Martin have mentioned. I also suggest people digging into this area take a look at CORBA which is a well-known protocol for distributed system.</p>
| 0non-cybersec
|
Stackexchange
|
Due to the vanishing of humans, the horses are starting to claim territory.
| 0non-cybersec
|
Reddit
|
My Black and Blue Monster | 1080 SLI | 6700k | $3500+. This thing took forever to complete!
I've named it Black Ice.
Sleeves alone took 30+ hours but I'm proud to say I did them all myself.
[PCPartPicker part list](https://pcpartpicker.com/list/BqvZPs) / [Price breakdown by merchant](https://pcpartpicker.com/list/BqvZPs/by_merchant/)
Type|Item|Price
:----|:----|:----
**CPU** | [Intel Core i7-6700K 4.0GHz Quad-Core Processor](https://pcpartpicker.com/product/tdmxFT/intel-cpu-bx80662i76700k) | $308.98 @ Amazon
**CPU Cooler** | [NZXT Kraken X62 Liquid CPU Cooler](https://pcpartpicker.com/product/bqBrxr/nzxt-kraken-x62-liquid-cpu-cooler-rl-krx62-01) | $149.99 @ SuperBiiz
**Motherboard** | [Asus MAXIMUS IX CODE ATX LGA1151 Motherboard](https://pcpartpicker.com/product/X6PzK8/asus-maximus-ix-code-atx-lga1151-motherboard-maximus-ix-code) | $278.49 @ SuperBiiz
**Memory** | [G.Skill TridentZ RGB 16GB (2 x 8GB) DDR4-3000 Memory](https://pcpartpicker.com/product/sHQRsY/gskill-tridentz-rgb-16gb-2-x-8gb-ddr4-3000-memory-f4-3000c15d-16gtzr) | $154.99 @ Newegg
**Memory** | [G.Skill TridentZ RGB 16GB (2 x 8GB) DDR4-3000 Memory](https://pcpartpicker.com/product/sHQRsY/gskill-tridentz-rgb-16gb-2-x-8gb-ddr4-3000-memory-f4-3000c15d-16gtzr) | $154.99 @ Newegg
**Storage** | [Samsung 850 EVO-Series 500GB 2.5" Solid State Drive](https://pcpartpicker.com/product/FrH48d/samsung-internal-hard-drive-mz75e500bam) | $177.89 @ OutletPC
**Storage** | [Samsung 850 EVO-Series 500GB 2.5" Solid State Drive](https://pcpartpicker.com/product/FrH48d/samsung-internal-hard-drive-mz75e500bam) | $177.89 @ OutletPC
**Storage** | [Western Digital BLACK SERIES 1TB 3.5" 7200RPM Internal Hard Drive](https://pcpartpicker.com/product/Fz2kcf/western-digital-internal-hard-drive-wd1003fzex) | $73.88 @ OutletPC
**Video Card** | [EVGA GeForce GTX 1080 8GB FTW Gaming ACX 3.0 Video Card](https://pcpartpicker.com/product/bNcMnQ/evga-video-card-08gp46286) (2-Way SLI) | $539.99 @ Amazon
**Video Card** | [EVGA GeForce GTX 1080 8GB FTW Gaming ACX 3.0 Video Card](https://pcpartpicker.com/product/bNcMnQ/evga-video-card-08gp46286) (2-Way SLI) | $539.99 @ Amazon
**Case** | [Phanteks Enthoo Evolv ATX Glass ATX Mid Tower Case](https://pcpartpicker.com/product/NRvZxr/phanteks-case-phes515etgbk) | $189.99 @ Amazon
**Power Supply** | [EVGA SuperNOVA 1000 P2 1000W 80+ Platinum Certified Fully-Modular ATX Power Supply](https://pcpartpicker.com/product/dJ6BD3/evga-power-supply-220p21000xr) | $183.80 @ OutletPC
**Operating System** | [Microsoft Windows 10 Pro OEM 64-bit](https://pcpartpicker.com/product/MfH48d/microsoft-os-fqc08930) | $138.88 @ OutletPC
**Case Fan** | [Corsair Air Series AF140 Quiet Edition 67.8 CFM 140mm Fan](https://pcpartpicker.com/product/yYkD4D/corsair-case-fan-co9050009ww) | $17.99 @ Jet
**Case Fan** | [Corsair Air Series AF140 Quiet Edition 67.8 CFM 140mm Fan](https://pcpartpicker.com/product/yYkD4D/corsair-case-fan-co9050009ww) | $17.99 @ Jet
**Case Fan** | [Corsair Air Series AF140 Quiet Edition 67.8 CFM 140mm Fan](https://pcpartpicker.com/product/yYkD4D/corsair-case-fan-co9050009ww) | $17.99 @ Jet
**Case Fan** | [Corsair Air Series AF140 Quiet Edition 67.8 CFM 140mm Fan](https://pcpartpicker.com/product/yYkD4D/corsair-case-fan-co9050009ww) | $17.99 @ Jet
**Case Fan** | [Corsair Air Series AF140 Quiet Edition 67.8 CFM 140mm Fan](https://pcpartpicker.com/product/yYkD4D/corsair-case-fan-co9050009ww) | $17.99 @ Jet
**Case Fan** | [Corsair Air Series AF140 Quiet Edition 67.8 CFM 140mm Fan](https://pcpartpicker.com/product/yYkD4D/corsair-case-fan-co9050009ww) | $17.99 @ Jet
| *Prices include shipping, taxes, rebates, and discounts* |
| Total (before mail-in rebates) | $3207.69
| Mail-in rebates | -$30.00
| **Total** | **$3177.69**
| Generated by [PCPartPicker](http://pcpartpicker.com) 2017-03-28 00:19 EDT-0400 |
--------
>**Pics: https://imgur.com/gallery/eW1VQ**
| 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 is homestarrunner and why do people love it so much?. I first remember hearing about it on reddit when people were excited about its revival. I visited and seems to only contain basic web games. Is there something else I'm missing or is it nostalgia?
| 0non-cybersec
|
Reddit
|
python not accept keyword arguments. <p>I am trying to make my code NOT to accept keyword arguments just like some bulitins also do not accept keyword arguments, but, I am unable to do so. Here, is my thinking according to my limited understanding:-</p>
<pre><code>def somefunc(a,b):
print a,b
somefunc(10,20)
</code></pre>
<p><strong>Output:</strong></p>
<pre><code>10 20
</code></pre>
<hr>
<p>Now, When I run the following (I know this is not expected to be keyword argument in the function definition, but, <strong>looking at the function call, it seems to be the same syntax as that of when calling a function which accepts keyword arguments</strong>):</p>
<pre><code>somefunc(b=10,a=20)
</code></pre>
<p><strong>Output:</strong></p>
<pre><code>20 10
</code></pre>
<p><strong>I have 2 questions</strong>:-</p>
<ol>
<li>Looking at the function call <code>somefunc(b=10,a=20)</code> and not the function definition, this can seem to be either of a call to a function which accepts just normal arguments or a function which accepts keyword arguments. How does the interpreter differentiate between the two?</li>
<li>Is it possible to convert any of our function in a form so that it does not accept keyword arguments just like many of the builtins do?</li>
</ol>
<p><strong>Why I want to do this at all?</strong>
I am just checking if I can do this, so that I do not miss anything in understanding python in depth. I do knot know whether python allows that or not.</p>
| 0non-cybersec
|
Stackexchange
|
I need help finding two Old animes. I vividly remember watching two animes but can't seem to find them, the first one all I remember was it was in a world that was semi apocalyptic, people living Underground in deep holes that are open to the surface, and at some point a Guy fights a wolf, the second one is pretty normal anime stuff but then the main character has a vibrating banana forcefully put in his butt by an alien, and that's all I know about the two.
| 0non-cybersec
|
Reddit
|
[Ukraine] Tank can't drive off road.
| 0non-cybersec
|
Reddit
|
Meet 'Schmeat': Lab-grown meat hits the grill this month.
| 0non-cybersec
|
Reddit
|
My system is compromised, I quarantined it. What is the MOST secure way of completely wiping it to eliminate anything that can possibly have been installed onto my system?. I have been phished by TP-LINK's own website and my computer is compromised. A threat assesment by norton: [https://safeweb.norton.com/report/show?url=tplinkextender.net](https://safeweb.norton.com/report/show?url=tplinkextender.net) It says all the threats all coinminers, so my data should not be in immediate danger. Nevertheless, I have IMMIDIATELY quarantined it (shut-down and also disabled my home network) Now I have contacted symantec and they are telling me that I should turn my pc on and run norton power eraser (basically a much more aggresive pc scan) and that I do not need to worry about my data which is just bullshit.
I was thinking about something bootable from an usb, so that I do not le the malware manipulate with my files. Everything is backed up, so no worries about anything getting deleted, but rather sent to an attacker's server. Any reccomendations about software I can use for this? Any help highly appreciated.
| 1cybersec
|
Reddit
|
Mac Mini Interchange Logic Board?. I’ve got a 2011 Mac Mini with dead AMD graphics and I’m wondering if I can swap in a 2012 logic board. From what I can tell the power requirements are the same so I can use the same power supply and everything else looks like almost identical between the 2011 and 2012.
Has anyone tried this or think of a reason why it wouldn’t work?
| 0non-cybersec
|
Reddit
|
This is whats wrong with the new Dashboard..
| 0non-cybersec
|
Reddit
|
[Image] Hyped! Snagged an early copy.
| 0non-cybersec
|
Reddit
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.