text
stringlengths 3
1.74M
| label
class label 2
classes | source
stringclasses 3
values |
|---|---|---|
Angry geese block path of Florida director of emergency management. | 0non-cybersec
| Reddit |
sed substitute one line into a part of the next line. <p>I have input like this:</p>
<pre><code>*123456789
This is a <secret>
Other stuff here.
*987654321
This is a <secret>
Other stuff here.
</code></pre>
<p>where "Other stuff here." could be one more lines, but the number prefixed by * is variable but will always take up the whole line, and will always appear on the line immediately before the "<secret>", which is a literal, fixed string that can be matched against.</p>
<p>I'd like to be able to pipe this into a one-line command in a shell script such that the "*123456789" string will substitute the <secret> that appears on the next line, so that the output would be:</p>
<pre><code>This is a *123456789
Other stuff here.
This is a *987654321
Other stuff here.
</code></pre>
<p>I'm struggling to understand multi-line processing in sed and am open to using another tool if it's cleaner.</p>
| 0non-cybersec
| Stackexchange |
Authorization required error when accessing bitcoin using json RPC. <p>I'm trying to make a simple request to bitcoind using perl I followed the example from the <a href="https://en.bitcoin.it/wiki/API_reference_%28JSON-RPC%29#Perl" rel="nofollow">API reference</a>, but it fails saying "401 Authorization Required"</p>
<pre>
#!/usr/bin/perl -w
use JSON::RPC::Client;
use Data::Dumper;
my $client = new JSON::RPC::Client;
$client->ua->credentials(
'localhost:8332', 'jsonrpc', 'bitcoinrpc' => 'mybitcoinrpcpassword' # REPLACE WITH YOUR bitcoin.conf rpcuser/rpcpassword
);
my $uri = 'http://localhost:8332/';
my $obj = {
method => 'getinfo',
params => [],
};
my $res = $client->call( $uri, $obj );
if ($res){
if ($res->is_error) { print "Error : ", $res->error_message; }
else { print Dumper($res->result); }
} else {
print $client->status_line;
}
</pre>
<p>Am I missing something obvious? Thanks for any help!</p>
| 0non-cybersec
| Stackexchange |
Ubuntu server has no internet connection after upgrade from 14.04 to 16.04. <p>I'm a bit new to linux and ubuntu specially command line stuff.
So I currently have a VPS which was running on a 14.04 ubuntu LTS, and as I needed a 16.04 version, I searched and found the way to upgrade it. I SSHed into the server and started upgrading, everything went well and it asked for a restart and I let it. After that I'm not able to to ssh into it. I had a KVM thingy with a VNC to connect and see what is going on. I don't know if an ubuntu server should boot on default (log in a user) or not, but it wasn't booting and there was a message :</p>
<p><code>/dev/vda1: clean, xxxx/xxxx files, xxxx/xxxx blocks</code> </p>
<p>so I went to manually login using ctrl + alt + f2 and it is upgraded to 16.04 and the SSH service is running with no problem, but I noticed I couldn't do <code>apt-get update</code> or anything similar because I have no internet connection and after 24 hours searching I've come here asking for help.</p>
<p>I don't if it may help but these are the results of the commands I've ran</p>
<p><code>sudo lshw -C network</code>
gives:
<a href="https://i.stack.imgur.com/7EtWE.png" rel="nofollow noreferrer">lshw -C network</a></p>
<p>and <code>systemctl status networking.service</code> gives :
<a href="https://i.stack.imgur.com/VLMVN.png" rel="nofollow noreferrer">systemctl status networking.service</a></p>
| 0non-cybersec
| Stackexchange |
How many compatible linear orders exist on the classical Laver tables?. <p>Let <span class="math-container">$A_{n}$</span> be the unique algebra <span class="math-container">$(\{1,\dots,2^{n}\},*_{n})$</span> such that
<span class="math-container">$x*_{n}1=x+1\mod 2^{n}$</span> and
<span class="math-container">$x*_{n}(y*_{n}z)=(x*_{n}y)*_{n}(x*_{n}z)$</span> for all <span class="math-container">$x,y,z$</span>. We say that a linear ordering <span class="math-container">$\preceq$</span> on <span class="math-container">$\{1,\dots,2^{n}\}$</span> is compatible with <span class="math-container">$A_{n}$</span> if <span class="math-container">$y\preceq z\Rightarrow x*_{n}y\preceq x*_{n}z$</span>.</p>
<p>What are some lower bounds and upper bounds of the value <span class="math-container">$t_{n}$</span>? I am more interested in lower bounds than in upper bounds. Since large cardinals may be used to produce compatible linear orderings on the classical Laver tables, it seems like large cardinals may be used to produce lower bounds on the number of linear orderings on the classical Laver tables.</p>
<p><strong>Unverified statement:</strong> <span class="math-container">$(t_{0},\dots,t_{5})=(1, 2, 4, 8, 64, 128)$</span>.</p>
<p>So from a compatible linear ordering <span class="math-container">$\preceq$</span> on <span class="math-container">$A_{n}$</span>, one obtains a compatible linear ordering <span class="math-container">$\preceq'$</span> on <span class="math-container">$A_{n-1}$</span> defined by
<span class="math-container">$x\preceq'y$</span> iff <span class="math-container">$x+2^{n-1}\preceq y+2^{n-1}$</span>. Furthermore, the mapping <span class="math-container">$\preceq\mapsto\preceq'$</span> seems to satisfy a sort of Lagrange's theorem (this observation is also unverified): if <span class="math-container">$\preceq_{1},\preceq_{2}$</span> are compatible linear orderings on <span class="math-container">$A_{n-1}$</span> then there seems to be an equal number of compatible linear orderings <span class="math-container">$\preceq$</span> on <span class="math-container">$A_{n}$</span> with <span class="math-container">$\preceq'=\preceq_{1}$</span> as there are linear orderings <span class="math-container">$\preceq$</span> with <span class="math-container">$\preceq'=\preceq_{2}.$</span> Furthermore, it seems like <span class="math-container">$t_{n}$</span> is always a power of <span class="math-container">$2$</span>. However, when studying Laver tables one should be cautious since many patterns that appear in the Laver tables are only temporary.</p>
<p><strong>Computation:</strong> Producing compatible linear orderings <span class="math-container">$\preceq$</span> on <span class="math-container">$A_{n}$</span> requires surprisingly little brute force search since to produce a linear ordering <span class="math-container">$\preceq$</span>, we start off with a compatible linear ordering <span class="math-container">$\preceq^{-}$</span> on <span class="math-container">$A_{n-1}$</span> and then use evolutionary computation to slowly produce a compatible linear ordering <span class="math-container">$\preceq$</span> on <span class="math-container">$A_{n}$</span> with <span class="math-container">$\preceq^{'}=\preceq^{-}$</span>.</p>
| 0non-cybersec
| Stackexchange |
Google Charts / visualisations column width. <p>I am using the Google Chart API, and converted a line chart (see below) into a column chart, however the column widths change depending on the quantity of data columns. If I hover over, it tells me the correct date, however because of the changing width of the column you cannot actually accurately see the date the column should represent. A point would work, so I could revert to a line chart however, a column does look better for the data set I am using. Any idea how to solve this issue? </p>
<p>Date is dynamic, so the X axis has to be variable.</p>
<p>Thanks</p>
<pre><code>// Create a line chart, passing some options
var LineChart = new google.visualization.ChartWrapper({
'chartType': 'ColumnChart',
'containerId': 'chart_div',
'options': {
'vAxis': {'title': 'Species Abundance', 'minValue': 0, 'maxValue': 32},
'width': 300,
'height': 300,
'legend': 'top',
'title': 'Selected Site and Species abundance over time'
},
'view': {'columns': [0, 1]},
});
</code></pre>
<p><img src="https://i.stack.imgur.com/TL9Ze.gif" alt="Example Graphs"></p>
| 0non-cybersec
| Stackexchange |
'My body has a mind of its own' - Daniel C. Dennett. | 0non-cybersec
| Reddit |
Urban nature canoe adventure trip. Travel alone 750 km in 50 days. Episode 7 "The storm" Enjoy the trip.. | 0non-cybersec
| Reddit |
LG built Nexus 5 coming soon to India. | 0non-cybersec
| Reddit |
jQuery - How do I bind events to hidden elements that will be shown later?. <p>I am trying to attach 'click' events to all elements of a particular class. The problem is some of the elements are on a tab that is hidden (display: none) at the time that the event is bound. (.bind()). It seems that when these elements are shown the events are no longer bound.</p>
<pre><code>$('a.someClass').bind('click', function(){
alert("test");
});
</code></pre>
<p>The hidden elements do not appear to have a click event bound. If I select the hidden elements:</p>
<pre><code>$('a.someClass:hidden').bind('click', function(){
alert("test");
});
</code></pre>
<p>It seems the click event is not bound when these elements are no longer hidden. Has anyone experienced this? Is there a way to bind and event to elements irregardless of their display property?</p>
<p>Thanks</p>
| 0non-cybersec
| Stackexchange |
How to find out which dependency caused a particular library to be downloaded?. <p>When runing my SBT project, there is a line in console output:</p>
<pre><code>[info] downloading http://repository/nexus/content/groups/public/org/jboss/netty/netty/3.2.3.Final/netty-3.2.3.Final.jar ...
[info] [SUCCESSFUL ] org.jboss.netty#netty;3.2.3.Final!netty.jar(bundle) (651ms)
</code></pre>
<p>How to find out which project dependency caused the netty.jar to be downloaded?</p>
| 0non-cybersec
| Stackexchange |
What friend or schoolmate from your childhood turned out exactly the way you thought & who did a complete 180?. | 0non-cybersec
| Reddit |
Another freezing question! Pasta dishes?. Made an American chop suey type thing yeaterday. Macaroni, hamburger, diced tomatoes, onions, spices and what not. Anyway I made way too much of it and now I keep looking at all the other food I have and not wanting to eat it, but I'm not gonna let it go waste either. Does stuff like this usually freeze well if I portion it out into Tupperware? What type of Tupperware works best for freezing? I'm not opposed to going out and buying some. | 0non-cybersec
| Reddit |
Jay Rock - Blood Walk. | 0non-cybersec
| Reddit |
The worst 1000 cryptokey unboxing in cod history.. | 0non-cybersec
| Reddit |
I want to go backpacking. Is it worth it?. As the title suggests I want to go backpacking. I don't have a lot of money and I'm just wondering if it worth it. It has been a dream of mine for a while now.
I want to travel around Europe, mostly around the Scandinavian countries whilst staying on a budget.
Could anyone give a rough estimate of how much money it costs to travel to and around Europe over the course of a couple months? | 0non-cybersec
| Reddit |
Question on the Mandelbrot set.. I was just watching a documentary on the Mandelbrot set narrated by Arthur C. Clark and in it he says that "...And no matter how much we magnified it, a million times, a billion times, until the original set was bigger than the entire universe. We would still see new patterns, new images emerging because the frontier of the inset is Infinately complex."
Here's my question: If the patterns and images are INFINITELY complex does that mean deep down somewhere there's parts that coincidentally look like random real world objects? I mean we're talking infinity. Somewhere in the infinite combinations there should be a glob that looks exactly like me riding a chariot fighting off other gladiators in ancient Rome right? (just an example of something random) | 0non-cybersec
| Reddit |
Angular mat-selection-list, How to make single checkbox select similar to radio button?. <p>How to make make single checkbox select from mat-selection-list. Similar to radio button which accepts one value from group of values.</p>
| 0non-cybersec
| Stackexchange |
Off we go. | 0non-cybersec
| Reddit |
Mike Pence's hometown to host its first gay pride festival. | 0non-cybersec
| Reddit |
YSK that if taking multiple medications, you can get them all refilled on the same cycle with just a little bit of effort.. The term is 'refill synchronization' and it is a tool to improve adherence and to simplify your life.
Step 1: consolidate to as few pharmacies as possible. One local store and one mail order should be the goal, but it will work with any number.
This will help you in other ways too, since one pharmacist can see and identify combinations of things that can be troublesome.
Step 2: Contact the pharmacy and request refill synchronization. If your 90 day mailorder scripts are far apart, you may have to ask for an early refill.
Step 3: Followup. If things are still off, call again and ask.
Step 4: Ask each time you submit a new script, and stick with it.
With a bit of effort and followup you could theoretically get any number of medications refilled/delivered together.
There are some special exceptions that make this difficult, but if you ask your pharmacist to advocate for you, it can be done with most everything. | 0non-cybersec
| Reddit |
My best friend and a feline leukemia survivor. | 0non-cybersec
| Reddit |
L-functions and algebraic geometry. <p>Robert Langlands commented in a letter to Deligne that perhaps some of the deepest problems of algebraic geometry lie in L-functions. I want to understand the general philosophy and the connection between L-functions and algebraic geometry beyond the well-know Weil conjectures. L-functions encode something about counting points on varieties in weil conjectures. What similiar things are done by the other kinds ie. a general motivic L-function</p>
| 0non-cybersec
| Stackexchange |
What are my options for sending email from my VPS with a Blacklisted IP. <p>I have postfix and dovecot running on debian 7, I can send mail fine, but it keeps going to my spam folder when sent to google accounts. Another user who doesn't use gmail said it was delivered to his inbox. When I send a test message to myself I get the following headers:</p>
<pre><code>Delivered-To: [email protected]
Received: by 10.170.37.203 with SMTP id 194csp288892ykf;
Fri, 29 Aug 2014 21:45:25 -0700 (PDT)
X-Received: by 10.236.70.105 with SMTP id o69mr20864964yhd.25.1409373925239;
Fri, 29 Aug 2014 21:45:25 -0700 (PDT)
Return-Path: <[email protected]>
Received: from fluidvector.com ([2605:f700:100:400::875a:4b61])
by mx.google.com with ESMTPS id s36si567167yhp.30.2014.08.29.21.45.24
for <[email protected]>
(version=TLSv1.2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128);
Fri, 29 Aug 2014 21:45:24 -0700 (PDT)
Received-SPF: softfail (google.com: domain of transitioning [email protected] does not designate 2605:f700:100:400::875a:4b61 as permitted sender) client-ip=2605:f700:100:400::875a:4b61;
Authentication-Results: mx.google.com;
spf=softfail (google.com: domain of transitioning [email protected] does not designate 2605:f700:100:400::875a:4b61 as permitted sender) [email protected]
Received: from localhost (localhost.localdomain [127.0.0.1])
by fluidvector.com (Postfix) with ESMTP id 725E7123A0C9F
for <[email protected]>; Sat, 30 Aug 2014 00:45:23 -0400 (EDT)
X-Virus-Scanned: Debian amavisd-new at fluidvector.com
Received: from fluidvector.com ([127.0.0.1])
by localhost (fluidvector.com [127.0.0.1]) (amavisd-new, port 10024)
with ESMTP id oI9bUVMx6Thv for <[email protected]>;
Sat, 30 Aug 2014 00:45:19 -0400 (EDT)
Received: by fluidvector.com (Postfix, from userid 33)
id 17DA0123A0CA1; Sat, 30 Aug 2014 00:45:19 -0400 (EDT)
To: =?UTF-8?B?dGVzdA==?= <[email protected]>
Subject: =?UTF-8?B?V2VsY29tZSB0byAiQmVhbnNXb3J0aHki?=
X-PHP-Originating-Script: 1000:messenger.php
From: <[email protected]>
Reply-To: [email protected]
</code></pre>
<p>I notice the lines </p>
<pre><code>Received-SPF: softfail (google.com: domain of transitioning [email protected] does not designate 2605:f700:100:400::875a:4b61 as permitted sender) client-ip=2605:f700:100:400::875a:4b61;
Authentication-Results: mx.google.com;
spf=softfail (google.com: domain of transitioning [email protected] does not designate 2605:f700:100:400::875a:4b61 as permitted sender) [email protected]
</code></pre>
<p>which I assume means there's an issue with my SPF TXT DNS record: <code>v=spf1 a:fluidvector.com ~all</code>, even though pySPF says it's good.</p>
<p>I've looked up on mxtoolbox.com and found that for some reason, my IP (which I obtained from my VPS provider) is apparently blacklisted on Barracuda and spamcannibal. I've contacted my VPS provider, but they didn't seem to be able to do anything for me. So, at this point I assume I'm limited to just contacting the black lists and pleading to have my IPs removed? What are my options here? Can I get gmail to let mail from my servers be delivered to inbox instead of the spam folder without the headache of trying to get unlisted?</p>
| 0non-cybersec
| Stackexchange |
[50/50] An inconvenient truth (SFW) || A blue whale shot by illegal hunters off the coast of Africa (NSFW). | 0non-cybersec
| Reddit |
tifu by biting my nails during class. I had a big test today, probably make or break in terms of whether or not I pass this class. Having arrived to class about 10 minutes early, I proceeded to twiddle my thumbs for a bit. I slightly regretted leaving my phone in my car, otherwise I would've been on reddit.
One particularly long fingernail caught my attention and I decided to bite it. I hate biting my fingernails, BTW.
Satisfied with my work, I went back to staring at the wall, but deep down I knew I would end up biting more nails during this test.
Sure enough, staring blankly at the test, I began to bite at more of them. My left thumbnail proved especially tough, so I bit harder. It abruptly gave way and my front teeth hit one of my bottom teeth (Lower right incisor) it was a little startling, but nothing too dramatic.
Fast forward a few hours. I notice that when I breathe I have a searing pain on one of my teeth, the kind you get when you're eating something cold. I proceed to check the mirror and find a tiny, almost completely imperceptible chip in the tooth, and a 3 or 4 mm hairline fracture (for lack of a better word) on the tooth in question.
I'll be setting up a dentist appointment first thing tomorrow, hopefully it won't be too big of a deal to fix. Aesthetically, it doesn't even matter, but it's surprisingly frustrating needing to consciously avoid breathing out of one side of your mouth.
TL;DR: bit a tough fingernail, chipped a tooth and now have frustrating sensitivity. Don't bite your nails kids, it kills. | 0non-cybersec
| Reddit |
Solving $|x-1|+|2-x|>3+x$. <p>So I've tried separating this problem into three cases</p>
<p><strong>First Case</strong></p>
<p><span class="math-container">$$\begin{cases}(x-1)+(2-x)>3+x...(a) \\x\geq2...(b) \end{cases}$$</span>
from (a)</p>
<p><span class="math-container">$\Rightarrow x<-2 $</span></p>
<p>From <span class="math-container">$(a)\cap(b)$</span></p>
<p><span class="math-container">$x\in \emptyset $</span></p>
<p><strong>Second case</strong></p>
<p><span class="math-container">$$\begin{cases}(x-1)-(2-x)>3+x...(c) \\ x \in [1,2)...(d) \end{cases}$$</span></p>
<p>From (c)</p>
<p><span class="math-container">$\Rightarrow x>6$</span></p>
<p>From <span class="math-container">$(c)\cap(d)$</span></p>
<p><span class="math-container">$x \in \emptyset$</span></p>
<p><strong>Third and final case</strong></p>
<p><span class="math-container">$$\begin{cases} -(x-1)-(2-x)>3+x...(e) \\ x<1...(f) \end{cases}$$</span></p>
<p>From (e)</p>
<p><span class="math-container">$\Rightarrow x<-4 $</span></p>
<p>From <span class="math-container">$(e)\cap(f)$</span></p>
<p><span class="math-container">$\Rightarrow x<-4$</span></p>
<p>So my final solution should be the union of all these cases</p>
<p><span class="math-container">$\Rightarrow x<-4$</span></p>
<p>But wolfram says solutions are <span class="math-container">$x<0 \cup x>6$</span></p>
<p>I can't seem to find where I made a mistake please help.</p>
| 0non-cybersec
| Stackexchange |
I forgot these exist. | 0non-cybersec
| Reddit |
If Pokémon was made for iPhones (x-post r/gaming).. | 0non-cybersec
| Reddit |
Can’t hit my protein levels. I’m struggling to hit the amount of protein that I need in a day. I’m on week 3 of Keto and I’ve lost 3kg ish but I’m scared I’ll lose my muscles while I’m on this journey. And to top it off the gyms are closed.
I’m 5’8 and currently 87kg hitting around 60 grams of protein.
Any advice | 0non-cybersec
| Reddit |
There really is no reason to get up after that humiliation. | 0non-cybersec
| Reddit |
Battlefield 3 "Thunder Run" tank gameplay trailer [1080P]. | 0non-cybersec
| Reddit |
Top 30 EDM Songs (List). Blog explaining what makes EDM captivating.. | 0non-cybersec
| Reddit |
Find all embeddings $\mathbb Q(\alpha)$ to $\mathbb C$. <p>Here <span class="math-container">$\alpha$</span> is a root of <span class="math-container">$x^6+x^3+1$</span>.</p>
<p>What I figured out:</p>
<p>let <span class="math-container">$\beta = e^{\frac{2\pi i}{9}}$</span>. <span class="math-container">$\mathbb Q(\alpha)$</span> is the splitting field of <span class="math-container">$x^6+x^3+1$</span>. Such an embedding must fix <span class="math-container">$\mathbb Q$</span>, and send a root of <span class="math-container">$x^6+x^3+1$</span> to another root. So there are in total <span class="math-container">$6$</span> of them. How should I write them down explicitly?</p>
| 0non-cybersec
| Stackexchange |
Error: The newtxmath and tensor packages with subscriptcorrection. <p>Compiling the following Minimal Broken Example</p>
<pre><code>\documentclass{article}
\usepackage{newtxtext}
\usepackage[subscriptcorrection]{newtxmath}
%\usepackage[lite,subscriptcorrection]{mtpro2}
\usepackage{tensor}
\begin{document}
Consider the following:
\[
A_f = R\indices{_\mu^{\sigma\nu}}
\]
\end{document}
</code></pre>
<p>leads to the following error messages:</p>
<pre><code>! Package tensor Error: Sub/Superscript items out of order on input line 9,
(tensor) some index tokens may now have been lost.
See the tensor package documentation for explanation.
Type H <return> for immediate help.
...
l.9 A_f = R\indices{_\mu^{\sigma\nu}}
?
</code></pre>
<p>However, the code compiles perfectly fine if</p>
<ul>
<li>one uses <code>\usepackage{newtxmath}</code>, i.e., without <code>subscriptcorrection</code>; OR</li>
<li>one uses <code>\usepackage[lite]{mtpro2}</code>; OR</li>
<li>one uses <code>\usepackage[lite,subscriptcorrection]{mtpro2}</code>.</li>
</ul>
<p>What is going on here? Is there a fix to this problem?</p>
<p><strong>Added</strong>: I have noticed that both <code>newtxmath</code> and <code>mtpro2</code> implement <code>subscriptcorrection</code> by making the underscore <code>_</code> active (although it is more likely that <code>newtxmath</code> is inspired by <code>mtpro2</code>).</p>
<hr>
<p>P.S. The working output if one uses <code>\usepackage[lite,subscriptcorrection]{mtpro2}</code>:</p>
<p><a href="https://i.stack.imgur.com/Hpcyd.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Hpcyd.png" alt="MWE with mtpro2"></a></p>
| 0non-cybersec
| Stackexchange |
How to generate TypeScript UML class diagrams in VS Code?. <p>Are there any tools that can generate a UML class diagram from a project in TypeScript or a similar language?</p>
| 0non-cybersec
| Stackexchange |
Disc image Windows 8. <p>I've tried to download a disc image via torrent and now I can't delete it.</p>
<p>Every time I click delete I can tell from my task manager that it opens the file which appears to be why I can not delete it.</p>
<p>How can I force delete this file? Since it is a disc image will I have to eject it somehow? Etc.</p>
<p>It worries me to have such a file on my computer.</p>
<p>(it's an ISO-file)</p>
| 0non-cybersec
| Stackexchange |
Steve Jobs: You have to trust in something — your gut, destiny, life, karma, whatever. This approach has never let me down, and it has made all the difference in my life.. | 0non-cybersec
| Reddit |
Warning message: in rbindlist(allargs) : NAs introduced by coercion: possible bug in data.table?. <p>While analysing some data, I came across the warning message, which I suspect to be a bug as it is a pretty straightforward command that I have worked with many times.</p>
<pre><code>Warning message:
In rbindlist(allargs) : NAs introduced by coercion
</code></pre>
<p>I was able to reproduce the error. Here's a code with which you should be able to reproduce the error.</p>
<pre><code># unique random names for column V1
set.seed(45)
n <- sapply(1:500, function(x) {
paste(sample(c(letters[1:26]), 10), collapse="")
})
# generate some values for V2 and V3
dt <- data.table(V1 = sample(n, 30*500, replace = TRUE),
V2 = sample(1:10, 30*500, replace = TRUE),
V3 = sample(50:100, 30*500, replace = TRUE))
setkey(dt, "V1")
# No warning when providing column names (and right results)
dt[, list(s = sum(V2), m = mean(V3)),by=V1]
# V1 s m
# 1: acgmqyuwpe 238 74.97778
# 2: adcltygwsq 204 79.94118
# 3: adftozibnh 165 75.51515
# 4: aeuowtlskr 164 75.70968
# 5: ahfoqclkpg 192 73.20000
# ---
# 496: zuqegoxkpi 93 77.95000
# 497: zwpserimgf 178 72.62963
# 498: zxkpdrlcsf 154 78.04167
# 499: zxvoaeflhq 121 75.34615
# 500: zyiwcsanlm 180 76.61290
# Warning message and results with NA
dt[, list(sum(V2), mean(V3)),by=V1]
# V1 V1 V2
# 1: acgmqyuwpe 238 74.97778
# 2: adcltygwsq 204 79.94118
# 3: adftozibnh 165 75.51515
# 4: aeuowtlskr 164 75.70968
# 5: ahfoqclkpg 192 73.20000
# ---
# 496: zuqegoxkpi NA 77.95000
# 497: zwpserimgf NA 72.62963
# 498: zxkpdrlcsf NA 78.04167
# 499: zxvoaeflhq NA 75.34615
# 500: zyiwcsanlm NA 76.61290
Warning message:
In rbindlist(allargs) : NAs introduced by coercion
</code></pre>
<ul>
<li><p>1) It seems that this happens if you don't provide the column names.</p></li>
<li><p>2) Even then, in particular, when <code>V1</code> (or the column you use in <code>by=</code>) has a lot of <code>unique</code> entries (500 here) and you don't specify column names, then this seems to happen. That is, this <strong>DOES NOT</strong> happen when the <code>by=</code> column <code>V1</code> has <em>fewer</em> unique entries. For example, try changing the code for <code>n</code> from <code>sapply(1:500, ...</code> to <code>sapply(1:50, ...</code> and you'll get no warning.</p></li>
</ul>
<p>What's going on here? Its R version 2.15 on Macbook pro with OS X 10.8.2 (although I tested it on another macbook pro with 2.15.2). Here's the <code>sessionInfo()</code>.</p>
<pre><code>> sessionInfo()
R version 2.15.0 (2012-03-30)
Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
locale:
[1] en_US.UTF-8/en_US.UTF-8/en_US.UTF-8/C/en_US.UTF-8/en_US.UTF-8
attached base packages:
[1] stats graphics grDevices utils datasets methods base
other attached packages:
[1] data.table_1.8.6 reshape2_1.2.2
loaded via a namespace (and not attached):
[1] plyr_1.8 stringr_0.6.2 tools_2.15.0
</code></pre>
<p>Just reproduced with <code>2.15.2</code>:</p>
<pre><code>> sessionInfo()
R version 2.15.2 (2012-10-26)
Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
locale:
[1] en_US.UTF-8/en_US.UTF-8/en_US.UTF-8/C/en_US.UTF-8/en_US.UTF-8
attached base packages:
[1] stats graphics grDevices utils datasets methods base
other attached packages:
[1] data.table_1.8.6
</code></pre>
| 0non-cybersec
| Stackexchange |
Flow along hyperbolas. <p>Let’s say there are some hyperbolas:</p>
<p><a href="https://i.stack.imgur.com/zWuHn.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/zWuHn.png" alt="enter image description here"></a></p>
<p>and points are told to flow along the hyperbolic curves. I’ve read about horocyclic flow on the space of unit lattices. </p>
<p>I think it would make sense to use matrices to apply a linear transformation acting on the space of unit lattices to achieve a flow of constant speed.</p>
<blockquote>
<p>Q: Is it possible to use matrices to describe the dynamics of points that flow at different speeds along the curves? Are matrices equipped to deal with such flows?</p>
</blockquote>
<p>Context: </p>
<p><a href="http://www.stevejtrettel.com/the-space-of-lattices.html" rel="nofollow noreferrer">The Space of Lattices</a></p>
<p><a href="http://www.josleys.com/articles/ams_article/Lorenz3.htm" rel="nofollow noreferrer">Lorenz and Modular Flows</a></p>
| 0non-cybersec
| Stackexchange |
Show that space is not metrizable. <p>Let <span class="math-container">$X=C([0,1], \mathbb{R})$</span>, <span class="math-container">$f \in X$</span>, <span class="math-container">$\epsilon >0$</span> and <span class="math-container">$x_1,...,x_n$</span> in [0,1]. Consider:</p>
<p><span class="math-container">$V_{f,x_1,...,x_n,\epsilon}= \{ g \in X : |f(x_i)-g(x_i)| < \epsilon, i=1,...,n \}$</span>
and
<span class="math-container">$\tau= \{ U \subset X: \forall f \in U, \exists \epsilon>0, \exists x_1, ..., x_n \in [0,1] \ such \ that \ V_{f,x_1,...,x_n,\epsilon} \subset U \}$</span></p>
<p>I have already shown that <span class="math-container">$\tau$</span> is topology and that any sequence in <span class="math-container">$X$</span> converges with respect to <span class="math-container">$\tau$</span> if and only if it converges pointwise.How do I show that <span class="math-container">$\tau$</span> is not metrizable?</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 |
Baseball fan drops foul ball and the remainder of his beer from the upper deck.. | 0non-cybersec
| Reddit |
I hate a person that no one can hate. Asking for advice.. I feel uncontrollably selfish, at times jealous, and full of rage whenever I hear the name of the one kid in my class that cannot be hated. He is the valedictorian, captain of every team we play on, head of every club and student board. He has received every possible award for academics. Every award possible for character. He always is respectful. And he never does wrong.
One of the staff even made the claim that the teacher must have made an error when this kid did not get a 100 on a test.
I know that I shouldn’t, that this kid doesn’t deserve the cold shoulder and what’s worse is that he is my friend.
We go to parties, together play on the same sports teams, we share our views on politics, and he has even opened up to me about certain events that have caused him concern.
Being in every class together and being around him often, I have always been put down as lesser, as second to him. I am always present when he is acknowledged as never being able to do wrong. And I have always been there to see him excel.
Coincidence has even shown we have some of the same hobbies. Ping pong, solving rubix cubes etc. and he has bested me in almost every discipline.
I was naturally a little jealous that he could better me this way. But I have mainly been humble and supporting. However, I think it has almost gone too far.
I mean to say that there seems to be some higher power that can read my thoughts. This is the extent of the craziness that has occurred.
A recent example has shown this to be true as a great injustice has befallen him. Because of his character, known throughout our community, everyone has been supporting him verbally and on social networks. A similar injustice was done to me, yet not a word by anyone was spoken about it. Unfortunately, due to the personal and true example I can not disclose the injustice.
I just don’t know how to deal with this. In a year we will be gone for college and I will likely not talk to him for a time. Yet there will still be those around me who do.
He comes from a very loving and supportive family, with money and time. I do not say this to pity myself, but I think that there could be correlation between environment and social perception. I am part of a broken (divorced) family. Mother dealing with Alcoholism and father rarely spending quality time anymore. With siblings with separate lives as they are older.
I am not hated by those around me. I am of good character and have great academic standing. But I am never credited as such. I feel like I am living in the shadow of this kid and cannot get away from him and the dialogue when his name is brought up.
I remain nice to him, we are friendly together.
Am I just selfish and full of self pity? Has anyone had a similar experience? How can I overcome these feelings of longing for his position and hatred of him?
Edit: This has been true since the 7th grade. | 0non-cybersec
| Reddit |
That awkward moment when your Tinder pic looks like a screengrab from a porno. | 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 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 |
Capcom's Deep Down will be playable at TGS for PS4. | 0non-cybersec
| Reddit |
How to access an element of a set using an equivalent object?. <p>If I have an object that compares equal to an element of a Python set, but is not the same object, is there a reasonable way to get a reference to the object in the set? The use case would be using the set to identify and share duplicated data.</p>
<p>Example (Python 2.7):</p>
<pre><code>>>> a = "This is a string"
>>> b = "This is a string"
>>> a is b
False
>>> a == b
True
>>> s = set((a,))
>>> b in s
True
</code></pre>
<p>How to get a reference to <code>a</code> using <code>b</code> and <code>s</code>? I can think of one way, but I'm not sure if it is not implementation-dependent whether you get <code>a</code> or <code>b</code>. <strong>EDIT:</strong> This does not work when s has more than one element; intersection is quite naturally implemented something like <code>[x for x in smaller_set if x in larger_set]</code></p>
<pre><code>>>> for x in set((b,)).intersection(s): c = x
...
>>> c is a
True
</code></pre>
<p>Perhaps a good workaround would be to use a dict that maps each key to itself, instead of the set.</p>
| 0non-cybersec
| Stackexchange |
How do I view the signature of an iOS application?. <p>OSX <a href="http://techcrunch.com/2015/11/12/all-mac-store-apps-stopped-working-due-to-expired-security-certificate" rel="nofollow noreferrer">had an issue where the certificate was expired</a> and several apps could not be opened after that date.</p>
<p><a href="https://i.stack.imgur.com/z2Dbi.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/z2Dbi.png" alt="enter image description here"></a></p>
<p>The command above illustrates how this could have been detected.</p>
<p>Does iOS have a similar expiration? How can I inspect or view it?</p>
| 1cybersec
| Stackexchange |
addition theorems for hypersine. <p>I learned from Wolfram MathWorld about <a href="http://mathworld.wolfram.com/Hypersine.html" rel="nofollow noreferrer">hypersine</a>, as being a dimensional analog trig function for hypersolid angles. There it is being defined by</p>
<blockquote>
<p>The hypersine (<span class="math-container">$n$</span>-dimensional sine function) is a function of a vertex angle of an <span class="math-container">$n$</span>-dimensional parallelotope or simplex. If the content of the parallelotope is <span class="math-container">$P$</span> and the contents of the <span class="math-container">$n$</span> facets of the parallelotope that meet at vertex <span class="math-container">$v_0$</span> are <span class="math-container">$P_k$</span>, then the value of the <span class="math-container">$n$</span>-dimensional sine of that vertex is <span class="math-container">$$\sin(v_0)=\frac {P^{n-1}}{\prod^n_{k=1}P_k}$$</span>
[…] The vertex simplex of a vertex of an <span class="math-container">$n$</span>-dimensional parallelotope is the simplex that has as its vertices that vertex and the <span class="math-container">$n$</span> adjacent vertices of the parallelotope. Its content (and the content of all the other vertex simplices) is the content of the parallelotope divided by <span class="math-container">$n!$</span>. If the content of an <span class="math-container">$n$</span>-dimensional simplex is <span class="math-container">$S$</span>, and the contents of the <span class="math-container">$n$</span> facets that meet at vertex <span class="math-container">$v_0$</span> are <span class="math-container">$S_1, S_2,..., S_n$</span>, the simplex can be considered a vertex simplex of a parallelotope, and the facets also vertex simplices of the facets of the parallelotope with respect to the same vertex. Substituting in [the above] equation gives <span class="math-container">$$\sin(v_0)=\frac {(n!\ S)^{n-1}}{\prod^n_{k=1}(n-1)!\ S_k}$$</span></p>
</blockquote>
<p>Confering the first defining equation to the area formula of a parallelogram, it becomes obvious that this definition is nothing but the usual sine function for <span class="math-container">$n=2$</span>.</p>
<p>This article moreover continues on how to calculate the latter formula when knowing the respective dihedral angles <span class="math-container">$\alpha_{jk}$</span> between <span class="math-container">$S_j$</span> and <span class="math-container">$S_k$</span>.</p>
<p>Applying this makes it easy to get the hypersine of the corner angle of any <em>hypercube</em> generally: <span class="math-container">$$\sin(v_0)=1$$</span></p>
<p>Even the hypersine of the corner angle of any <em>regular simplex</em> could be calculated to: <span class="math-container">$$\sin^2(v_0)=\frac{(n+1)^{n-1}}{n^n}=\frac1{n+1}\ \left(1+\frac1n\right)^n$$</span></p>
<p>But in order to calculate correspondingly the hypersine of the corner angle of the <em>orthoplex</em> one needs to extrapolate this function to non-simplicial corners as well. One clearly could easily subdivide the orthoplex corner symmetrically into <span class="math-container">$2^{n-1}$</span> equal (mostly right-angled) simplices, but then again one needs to know about addition theorems for this hypersine function.</p>
<p>Is there anything being known in this direction or could anything be derived for that purpose? - I would be very grateful to learn about it.</p>
<p>--- rk</p>
| 0non-cybersec
| Stackexchange |
Prove for all sets A, B and C, if (B ∩ C) ⊆ A, then (A-B) ∩ (A-C) ≠ ∅. <p>This question was previously asked here: <a href="https://math.stackexchange.com/questions/2860480/for-all-sets-a-b-and-c-if-b-%E2%88%A9-c-%E2%8A%86-a-then-a-b-%E2%88%A9-a-c-%E2%89%A0%E2%88%85">For all sets A,B, and C, If B ∩ C ⊆ A, then (A-B) ∩ (A-C) ≠∅</a></p>
<p>However, it didn't help me much so I wanted if someone could verify my working and correct me where I am wrong.</p>
<p><strong>My initial question is:</strong>
For all sets <span class="math-container">$A$</span>, <span class="math-container">$B$</span> and <span class="math-container">$C$</span>, if <span class="math-container">$(B ∩ C) ⊆ A$</span>, then <span class="math-container">$(A-B) ∩ (A-C) ≠ ∅$</span></p>
<p>I know this is true by drawing a Venn Diagram.</p>
<p><strong><em>Proof:</em></strong>
<span class="math-container">$(B ∩ C) ⊆ A$</span></p>
<p><span class="math-container">$x∈(B∩C)⇒x∈A$</span></p>
<p><span class="math-container">$x∈(B∩C)^c ∩ A$</span></p>
<p><span class="math-container">$x∈A∩(B^c∩C^c)$</span></p>
<p><span class="math-container">$x∈(A∩B^c)∩(A∩C^c)$</span></p>
<p>Which is <span class="math-container">$(A-B)∩(A−C)≠∅$</span></p>
<p>Thank you for any help.</p>
| 0non-cybersec
| Stackexchange |
How to detect values changed in Data class Kotlin?. <p>I want to detect any values changed of a property of my class so then I could do another operation after that. In other word, if one of a specific data of a property is changed, then a specific event will fire by then. Actually, if it is a normal class in another programming languages such as Java, then I think I could use setter to do this job after data have modified or use delegate in C#. But since Kotlin is very new, I could not find any solution out there at all.
I have tried to overload property but was not successful by any chance. I wanted to use interface to to this too, but again since it is data class, I got no idea how should it be done. </p>
<p>Below is the sample class. In such situation, how to detect when Age or name is changed?</p>
<pre><code>data class Person(var Name: String, var Age: Int)
</code></pre>
<p>So please if anyone have any ideas about this, please help.</p>
<p><em>Note: in my situation, data class must be used.</em></p>
| 0non-cybersec
| Stackexchange |
Dids YOU do it?. | 0non-cybersec
| Reddit |
What do we actually mean when we say Finite (Union/Intersection) or Arbitrary(Union/Intersection)?. <p>These two things - <strong>Finite(Union/Intersection)</strong> and <strong>Arbitrary(Union/Intersection)</strong>- we use so much in Topology - in fact the defining criteria are dependent upon these but after such long time spent with Topology I'm starting to feel I do not understand the difference at all. </p>
<p>$1.$ In a topology , <strong>open</strong> sets are closed under <strong>arbitrary union</strong> and <strong>finite intersection</strong>.</p>
<p>$2.$ <strong>Colsed</strong> sets are closed under <strong>finite union</strong> and <strong>arbitrary intersection.</strong></p>
<p>$3.$`<strong>Ideal</strong> of sets are closed under <strong>finite union.</strong></p>
<p>$4.$ Finite union of finite sets are finite.</p>
<p>Well when we say <em>finite union</em> of open sets , exactly at which point before $\infty$ do we stop intersecting$?$ For example,this set $\Omega =\left\{\left(0,{1\over n}\right)\right\}_{n=1}^{\infty}$ is a collection of open sets from $\mathbb R$ and I know intersection of a <strong>finite</strong> number of elements is again of the form $\{(0,{1\over m})\}$ and their <strong>arbitrary</strong> intersection is $\Phi$.</p>
<p>Now let us intersect only $k$ members of $\Omega.$ Now with that I intersect the $(k+1)$th element-again an open set ,intersect the $(k+2)$nd element and again get another,possibly smaller, open set. Now we continue this way , where do we stop to make sure we are not touching $\infty ?$</p>
<p>Same goes for the <strong>closed sets</strong>.</p>
<p>An <strong>admissible ideal</strong> $I$ contains all the singletons. Now take,say, $k$ of them ($k\lt \infty$) and get a $k$-ton member of $I$. Take union of $2$ such $k$-tons and get a $2k$-ton.Since the whole set in not contained in $I$,so the union cannot be <strong>arbitrary.</strong> It has to be finite.So,we have to stop somewhere.If we stop at the $p$th step,well that does not make sense 'cause the $(p+1)$th step is also valid.So, what's happening here? </p>
<p>I know my way of thinking must have some very stupid flaw in it.But I've been trying and failing to explain this to myself or say,put it into meaningful words. So please help me get this right and clear and understand the distinction clearly.</p>
<p>Thank you.</p>
| 0non-cybersec
| Stackexchange |
Conditional Expectation of dice rolls. <p>A 6-sided die is rolled for 10 times. The die rolls are mutually independent. Each die uniformly likely to result in a digit from 1,2, 3, 4, 5, and 6. Let X denote the sum of the first 6 rolls and Y denote the sum of the last six rolls.</p>
<p>Find E(X|Y).</p>
<p>I have found E(X), E(Y), Var(X), Var(Y), Cov(X,Y), and Corr(X,Y).</p>
<p>I wish I had input, but am relatively new to statistics and don't know where to start on this problem. Thanks in advance. </p>
| 0non-cybersec
| Stackexchange |
Is there any downside to commit messages containing the ticket number. <p>I was wondering if it would be good practice for commit messages to contain the ticket number they were apart of. It would be like </p>
<pre><code> 2568 Fix heating issue
Summary of the issue with a bunch of detailed comments
</code></pre>
<p>It would be a bit of a pain to get the ticket or isse # in each commit and I am wondering if people think it would be worth it in the long run. Also if my branch has the ticket number is this redundant? The main issue is that I use source tree and that in the log / history view it can get a little complicated to see what commit corresponds with what ticket. I just would like a better way to see how everything works.</p>
| 0non-cybersec
| Stackexchange |
How to share a folder on the network for a specific computer. <p>I have a computer and a laptop (both Windows 10) and I want to share one folder from my computer so I can access it from my laptop. I went to Advanced Sharing and shared the folder but now, anyone from my network can access that folder. Is there any way I can limit this share so only my laptop can access the folder?</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 |
Wrong address used. <p>What happens if the coins are sent to the wrong address? The address I used in error was wrong and when I contacted the site it said that they only used addresses once. Since the address was previously used for a transaction it would no longer be good. I accidentally copied their address when sending bitcoin because it was next to the one I meant to use. The transaction got 505 confirmations. So where does this money go? Can I get it back?</p>
| 0non-cybersec
| Stackexchange |
Deriving $\frac{\partial{v}}{\partial{z}}$ using chain rule. <p>A problem from one of past exams at my uni reads: </p>
<blockquote>
<p>Suppose <span class="math-container">$xy^2 + yz^2 = 2$</span> and <span class="math-container">$v = xy^3$</span> where <span class="math-container">$x, y, z$</span> and <span class="math-container">$v$</span> are all variables. Using a chain rule, express <span class="math-container">$\partial{v}/\partial{z}$</span> as a function of <span class="math-container">$x, y, z$</span>. </p>
</blockquote>
<p>I just don't think I really get multivariable calculus... I know (?) I can write <span class="math-container">$$\frac{\partial v}{\partial z}= \frac{\partial v}{\partial x}\frac{\partial x}{\partial z}+\frac{\partial v}{\partial y}\frac{\partial y}{\partial z}$$</span>, and clearly <span class="math-container">$\frac{\partial v}{\partial x}=y^3$</span> and <span class="math-container">$\frac{\partial v}{\partial y}=3xy^2$</span>, so that <span class="math-container">$$\frac{\partial v}{\partial z}= y^3\frac{\partial x}{\partial z}+3xy^2\frac{\partial y}{\partial z}.$$</span> Now, <span class="math-container">$xy^2+yz^2=2$</span>, so <span class="math-container">$x=\frac{2}{y^2}-\frac{z^2}{y}$</span>, and I probably can write <span class="math-container">$$\frac{\partial x}{\partial z} = -2\frac{z}{y}, $$</span> but how do I go about deriving <span class="math-container">$\frac{\partial y}{\partial z}$</span>? Or does all of it make no sense and I should proceed in a completely different way?</p>
| 0non-cybersec
| Stackexchange |
Why is DbContext per-request?. <p>There are other similar SO questions out there, but none that really answer my specific question:</p>
<p>If an MVC controller is created for every request then what is the advantage of DbContext being per-request (assuming I’m injecting it into the controller)? Wouldn’t transient achieve the same result?</p>
<p>For example, say I have a data entry/edit form - the controller would have a ‘get’ method to retrieve the entity to be edited from the db, and a ‘post’ method to save back to the db (this would involve retrieving the entity again, update the changed values, then SaveChanges). Get and Post are separate requests, so I don’t see how a per-request DbContext helps here.</p>
<p>What am I missing? In what scenarios is a per-request DbContext useful?</p>
| 0non-cybersec
| Stackexchange |
2 tips you can use to have better, more interesting, less awkward conversations, and 1 tip you can use to start conversations quickly. **Preface:** *I've been seeing a lot of questions lately about how to start and have more interesting conversations. This post was adapted from [this comment.](https://www.reddit.com/r/socialskills/comments/bkc5tr/26_year_old_virginincel_need_help/emfxudb/)*
*Here are 3 things you can start testing next week to have better, more interesting, less awkward conversations:*
**#1. The 30 Second Win: Starting Conversations Quickly**
When we’re entering into a social situation, it’s really important to get a quick win.
Let's say you're at a party.
What most people do: walk in, grab a drink, and then they check their phone and don't start conversations.
A better approach: The next time you're in a situation where you know you'll want to be social, as soon as you walk into a party, work, or wherever, start a 30 second timer in your head.
You have 30 seconds to start walking up to someone to introduce yourself and start a conversation.
The reason this is so crucial is because 30 seconds doesn’t give you enough time to overthink the situation, or start feeling nervous.
What should you say?
Here, it’s really useful to have a couple of word-for-word scripts to pull out in almost any situation.
No need to overcomplicate this. Simple beats complex every time.
Here are a few of my favorites scripts to get you started:
*“Hi, my name’s Jeff”*
*“I don’t think we’ve met before, I’m Jeff”*
*“Hey, I wanted to come over and introduce myself, my name’s Jeff”*
Notice how they aren’t fancy, but they get the job done.
**Action step: Think about the next event, party, or situation you might be able to test out the 30-second win.**
**#2 The Iceberg Effect: Develop A Wide Range Of Interests So That You Can Connect With People**
Icebergs have a tip that sits above the water, and much more that hides below the surface.
Iceberg tip: People who seem to seamlessly slide into any conversation and offer an opinion or comment?
Below the surface: They likely listen to a wide variety of audiobooks, podcasts, and read a few interesting articles per day.
Real talk.
If you spend 99% of your free time learning about Power Rangers, you won't be very balanced when it comes to interests. You'll be at a disadvantage during those pesky conversations outside of Comic-Con.
What we want is interest diversification. Off the top of my head, here are 5 interests that I could speak to right now:
-Swing Dancing
-Podcasting
-Video production
-Iceland geology
-Theodore Roosevelt's early years
Here's the deal...
You don't have to know a TON about any given topic, just have a well-rounded set of interests. This helps you relate to a wide variety of people.
(This is also the secret sauce that makes people seem "interesting")
**Action step: Learn about one new thing today. (Use podcasts, audiobooks, Youtube, Wikipedia, some graffiti under a bridge somewhere)**
Note: If you don't know much about the current topic, be curious! Let the other person teach you something new!
**#3 Think around the current topic so you'll have something to say**
Something I teach called "The Spokes Method" will help you connect with anyone on almost any topic.
Even if you don’t know a lot about the current topic.
Imagine a bike wheel.
In the middle, you have a hub, and radiating out from the hub are several spokes.
Now, imagine the hub as the conversational topic.
The spokes are different, related topics that can be introduced.
*Example: Your conversational partner brings up painting, something you don't know much about.*
Should you just stonewall them and say "I don't want to talk about painting." or just nod as say "Uh-huh. Coool."
NO!
Dale Carnegie, author of How To Win Friends And Influence People once spent an entire dinner party talking (and mostly listening) about botany.
His conversational partner told the host that Dale was the best conversationalist he'd ever met.
**Lesson: You don't have to carry the conversation.**
Do this instead: Use the Spokes Method to "think around the topic" and mention other things that are related to painting:
*-"How do you choose what to paint?"*
*-"What kind of painting do you do?*
*-"I'd love to see an example of your work."*
You can go deeper into who the person is by bringing up:
*-"You must be very creative."*
*-"As a kid, did you do anything else artistic?"*
*-"If you could paint anything in the world, what would it be?"*
You can play the role of the beginner with a question like:
*-"I don't know much about painting, what's your favorite thing about it?"*
(Note how Spokes can be used to form questions and observations, it's important to balance both so that you don't fall into interview mode)
**Wrap up:**
It's easy to overthink social situations. The more small, rapid actions you take (start a conversation, speak up in a group, etc) the faster shift you'll have from a mental self-image of "I can't do this" to a mental self-image of "I CAN do this".
As you have small win and successes, write them down!
That way you can more easily remember the good social experiences you have. (Over time these will crowd out the less positive experiences)
**Bonus: Group conversations.**
I get asked about having better group conversations a lot. How to approach groups, what to say, how to contribute, etc. [I created this audio guide to join & enjoy group conversations you might check out if you want to have smoother group conversations](https://www.becomemorecompelling.com/uggc-audio.html)
In the audio guide you'll learn:
-How to systematically destroy the fear of approaching people and starting conversations.
-The +10% energy rule: How to be accepted into a new group and never accidentally kill the vibe. (I got this one wrong for years)
-How to jump into a conversation that has no opening.
-And more (word-for-word scripts, body language while joining a group, etc)
[Enjoy!](https://www.becomemorecompelling.com/uggc-audio.html)
**Edit: Thanks for the silver! High-ho!** | 0non-cybersec
| Reddit |
Inside TickTock's Consumer Robot Product Explorations. | 0non-cybersec
| Reddit |
Public Service Announcement: tomorrow is Valentines Day. Also, as someone who hates the holiday, can I get up on my soap box and give all you young lovers some quick advice?
Valentines Day is a completely manufactured holiday. And I hate it. And I think most of us agree, that's a fair way to feel about it. But that does't mean you shouldn't do *something* for your significant-other. For many of your significant others... Valentines Day has been marked for years by being alone, single, dating someone who didn't care enough to do something special... just not a good day in general. Perhaps it's more about making the holiday a good experience for once?
Do you need to do the flowers and chocolates and dinner out thing? Hell no. But do *something*. Make a card. Cook dinner (/r/food and /r/fffffffuuuuuuuuuuuud are great resources). Bake a cake. Make a mix tape (or CD, or thumb drive I guess - is that what you kids do these days?). Go for a walk. Flowers aren't that expensive *if you go to the grocery store*, the day before, and don't get roses (don't get carnations either dumbass). Watch a movie in your dorm room - The Notebook is actually pretty good, and reliably on basic cable every Valentines Day.
I think you see where I'm going with this. It's a shit corporate holiday, but that doesn't mean that your significant other wouldn't really appreciate a simply gesture. | 0non-cybersec
| Reddit |
ELI5: How does buying and selling debt work?. I've seen multiple documentaries that try to explain this concept but it still confuses me. If I'm broke and can't pay my bills to the bank, then the bank sells my debt to a collector, what benefit does that have for the collector? I still can't pay them, so how are they going to make money? Is the idea just that they can convince enough people to pay that they make money in the end? | 0non-cybersec
| Reddit |
[WP] When someone’s heart breaks, so does a little piece of our world. This creates fissures, valleys, chasms, even cracks in the pavement. Tell me the story behind the Grand Canyon.. Edit: apparently this is a repost. I’m sorry I haven’t been part of this sub but for 2-3 days. This is my first post. Full credit to /u/james7919 and /u/fracati who have both posted this prompt before. Thanks for the wonderful responses. | 0non-cybersec
| Reddit |
Prove that f is differentiable at $0$. <p>Here I got a question, </p>
<p>if f satisfies $|f(x)| \le |x|^9$ for all $x$, prove that $f$ is differentiable at $0$.</p>
<p>Can anyone give me some hints, now I have no clue to do this one.</p>
| 0non-cybersec
| Stackexchange |
Problem from "Differential topology" by Guillemin. <p>I am strugling one of the problems of "Differential Topology" by Guillemin: <br/>
Suppose that $Z$ is an $l$-dimensional submanifold of $X$ and that $z\in Z$. Show that there exsists a local coordinate system $\left \{ x_{1},...,x_{k} \right \}$ defined in a neighbourhood $U$ of $z$ such that $Z \cap U$ is defined by the equations $x_{l+1}=0,...,x_{k}=0$. <br/>
I assume that the solution should be based on the Local Immersion theorem, which states that "If $f:X\rightarrow Y $ is an immersion at $x$, then there exist a local coordinates around $x$ and $y=f(x)$ such that $f(x_{1},...,x_{k})=(x_{1},...,x_{k},0,...,0)$".<br/>
I would really appreciate any pointers on how to attack this problem.</p>
| 0non-cybersec
| Stackexchange |
libc6 error, can't install anything. <p>I wanted to install <code>python-pip</code> so i ran <code>sudo apt install python-pip</code> and got this error</p>
<pre><code>Reading package lists... Done
Building dependency tree
Reading state information... Done
You might want to run 'apt --fix-broken install' to correct these.
The following packages have unmet dependencies:
libgcc1:i386 : Depends: libc6:i386 (>= 2.2.4) but it is not going to be installed
libgcrypt20:i386 : Depends: libc6:i386 (>= 2.28) but it is not going to be installed
libgpg-error0:i386 : Depends: libc6:i386 (>= 2.28) but it is not going to be installed
Recommends: libgpg-error-l10n:i386
libidn2-0:i386 : Depends: libc6:i386 (>= 2.4) but it is not going to be installed
liblz4-1:i386 : Depends: libc6:i386 (>= 2.4) but it is not going to be installed
liblzma5:i386 : Depends: libc6:i386 (>= 2.17) but it is not going to be installed
libunistring2:i386 : Depends: libc6:i386 (>= 2.7) but it is not going to be installed
python-pip : Depends: python-pip-whl (= 18.1-5) but it is not going to be installed
Recommends: python-all-dev (>= 2.6) but it is not going to be installed
Recommends: python-setuptools but it is not going to be installed
Recommends: python-wheel but it is not going to be installed
E: Unmet dependencies. Try 'apt --fix-broken install' with no packages (or specify a solution).
</code></pre>
<p>it says <code>Try "apt --fix-broken install"</code> so I did that and got this</p>
<pre><code>Reading package lists... Done
Building dependency tree
Reading state information... Done
Correcting dependencies... Done
The following additional packages will be installed:
libc6:i386
Suggested packages:
glibc-doc:i386 locales:i386
The following NEW packages will be installed:
libc6:i386
0 upgraded, 1 newly installed, 0 to remove and 42 not upgraded.
88 not fully installed or removed.
Need to get 0 B/2578 kB of archives.
After this operation, 12.7 MB of additional disk space will be used.
Do you want to continue? [Y/n] y
debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable
(Reading database ... 269716 files and directories currently installed.)
Preparing to unpack .../libc6_2.30-0ubuntu2.1_i386.deb ...
debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable
dpkg: error processing archive /var/cache/apt/archives/libc6_2.30-0ubuntu2.1_i386.deb (--unpack):
new libc6:i386 package pre-installation script subprocess returned error exit status 1
Errors were encountered while processing:
/var/cache/apt/archives/libc6_2.30-0ubuntu2.1_i386.deb
E: Sub-process /usr/bin/dpkg returned an error code (1)
</code></pre>
<p>I tryied also running <code>sudo apt-get install -f</code> didn't work</p>
<p>So what shall I do?
Ubuntu 19.10</p>
| 0non-cybersec
| Stackexchange |
Do you have to lay like that?. | 0non-cybersec
| Reddit |
My dog refuses to eat...please help!!. I have a yorkie that is about 3 years old. She's just a little thing, weighing no more than 6 pounds. I got a new puppy (German Shorthaired Pointer) about a week ago. Molly, the yorkie, has always had food available and ate whenever (probably shouldn't have done that....I realize that now). Since we have the new puppy, I'm trying to feed them both on a regular schedule. At first, she showed little interest in her food, but kept trying to eat the puppy's food. I gave her a few cans of wet food because that was the only way I could get her to eat. On Thursday morning, I awoke to find that she had vomited twice during the night. Since then, she won't go anywhere near her food, nor any other kind of food.
I should mention that a couple days after I got the puppy, I took him to the vet because he refused to eat and was sleeping all the time. Turns out, he had a parasite. He was treated (still receiving the medication) and he's back to his happy, boisterous self. I thought maybe Molly contracted the parasite from him, but she doesn't have anything like that (although, it does have an incubation period of 13ish days...). The vet said she's just not adapting right away to the changes in our household. If she doesn't start eating in the next day or two, I'm supposed to take her in and she will be force fed. I'm hoping to avoid that, because it sounds so unpleasant for her.
I'm so concerned about her and I'm feeling awful because I caused it. I've tried everything I can think of. Any suggestions? Or has anyone dealt with this sort of thing before? | 0non-cybersec
| Reddit |
Environment Variable is not going to container from docker-compose. <p>I was trying to pass <code>ENV_VAR</code> to a container, but it was not working.</p>
<pre><code>version: '3.7'
services:
ubuntu:
image: ubuntu:latest
environment:
- ENV_VAR=teste
command: "echo ${ENV_VAR}"
</code></pre>
<p>The problem was solved using <code>$$</code> instead of <code>$</code>:</p>
<pre><code>version: '3.7'
services:
ubuntu:
image: ubuntu:latest
environment:
- ENV_VAR=teste
command: '/bin/sh -c "echo $$ENV_VAR"'
</code></pre>
<p>But, I dont understand why I had to call <code>sh</code> and I dont belive that a running app inside my image will be able to read this value.</p>
| 0non-cybersec
| Stackexchange |
Ansible vs Jenkins. <p>Our team needs an automated deployment tool and I have concentrated on two major options: Ansible and Jenkins. </p>
<p>Could you please consult me about pros and cons of each and also, if you know a better deployment tool, please recommend them and state why.</p>
<p>Some information about our structure: Debian OS (some programmers use Windows 8 and Debian on VM). Our version/code management tools are SVN and GitHub (hopefully soon, only GitHub). Main programming language is PHP.</p>
| 0non-cybersec
| Stackexchange |
How to start ubuntu-touch on Nexus 7 3G Tilapia (nakasig)?. <p>I am trying run Ubuntu Touch on my Nexus 7 3G Tilapia, but I only see the "Google" splash screen. I have read many forums and found that the <code>/data</code> partition is different on Tilapia and Grouper (<code>mmcblk0p10</code> and <code>mmcblk0p9</code>).</p>
<p>How I can modify the cmdline and attach <code>datapart=/dev/mmcblk0p10</code> on it?</p>
<p>OK I solve it </p>
<pre><code> 1.erase all on nexus ( optionally. I do it but not sure in my memory :))
2.$abootimg -x saucy-preinstalled-system-armel+grouper.img
3. edit bootimg.cfg
cmdline = console=tty1 datapart=/dev/mmcblk0p10
4. $abootimg --create saucy-preinstalled-system-armel+grouper.img -f bootimg.cfg -k zImage -r initrd.img
5. do fastboot flash all by official manual
6. go to recovery mode and format data, cache and SDcard partitions
7. reboot into recovery mode
8. $adb push /path/to/your/downloaded/saucy-preinstalled-touch-armel+grouper.zip /sdcard/autodeploy.zip
9. reboot into recovery mode and wait when install is finish
10. reboot into recovery mode second time
11. $adb push /path/to/your/downloaded/saucy-preinstalled-touch-armhf.zip /sdcard/autodeploy.zip
12. reboot into recovery mode and wait when install is finish. After install you got system.
</code></pre>
<p>Screen responds on power button (lighter/darker). After some time it darkens.</p>
<p>I try install vncserver, but it say:
vncserver: The HOME environment variable is not set.</p>
| 0non-cybersec
| Stackexchange |
nginx configuring uwsgi and gzip buffers for different usage scenarios. <p>I'm trying to configure two URL path groups for relatively different usage scenarios and resource consumption in nginx. Both are served by same uwsgi application.</p>
<ul>
<li>Group 1: Regular HTML pages up to cca 128k in size, default</li>
<li>Group 2: Large XML "files" up to many MB in size (created by the app on the fly)</li>
</ul>
<p>The requirement is for both to be gzipped, and the XMLs should be cached 1hr as well.</p>
<p>What I don't quite understand is the meaning of the number of buffers and how to optimally set their number and sizes according to expected traffic and content size, both for uwsgi and gzip.</p>
<p>Also, for the below configuration I get error from nginx:</p>
<pre><code>"uwsgi_busy_buffers_size" must be less than the size of all "uwsgi_buffers" minus one buffer in /etc/nginx/nginx.conf:113
</code></pre>
<p>uwsgi_busy_buffers_size appears to be undocumented.</p>
<pre><code>location ~ /path/to/(.+)\.xml {
uwsgi_hide_header "Set-Cookie";
uwsgi_ignore_headers "Set-Cookie";
uwsgi_buffers 2 8M;
uwsgi_cache xmlfiles;
uwsgi_cache_key $request_uri;
uwsgi_cache_valid 200 1h;
uwsgi_cache_valid 04 5m;
uwsgi_cache_use_stale error;
expires +1h;
gzip on;
gzip_types application/xml;
gzip_buffers 2 8M;
try_files $uri @backend;
}
location / {
try_files $uri @backend;
gzip on;
gzip_buffers 8 256k;
uwsgi_buffers 8 256k;
try_files $uri @backend;
}
location @backend {
include uwsgi_params;
uwsgi_pass unix:///tmp/uwsgi-app.sock;
}
</code></pre>
<p>Please help. nginx 1.0.14</p>
| 0non-cybersec
| Stackexchange |
is there any way for me to restore parts of my 64gb iPhone 5 backup to my 16gb iPhone 6s?. Specifically the photos and contacts. Tried itunes but it says my 6s doesnt have enough space :( | 0non-cybersec
| Reddit |
Assign a value to character string. <p>I have responses to a survey in my <code>data.frame(Analysis)</code> that include:<br><br>
<code>Q1 <- c("Agree", "Strongly Agree", "Disagree", "Neither", "Agree", "Neither")</code><br><br>
I wish to assign a value to each response, based upon their level. For example, <code>"Strongly Agree"</code> receives a 2 whilst <code>"Agree"</code> receives a score of 1. My desired output would be:<br><br>
<code>Q1 <- c("Agree", "Strongly Agree", "Disagree", "Neither", "Agree", "Neither")</code><br>
<code>Q1_Score <- c(1, 2, -1, 0, 1, 0)</code><br><br>
This seems like an simple question but I am having difficulty in finding an answer!<br><br>
Thank you.</p>
| 0non-cybersec
| Stackexchange |
[Help] how can i get my dog to drink more water?. So my doggo is a rescue and his urine is super yellow and he doesnt drink much. I think he may have been deprived of water as a pup so he tries to make it last despite him having access to unlimited water (there is someone home 99% of the time to give him water as needed). I am usually not home (i work 7 days a week) so i rarely take him out. Ive been taking him out more lately and thats when i really noticed his urine and paid attention to his drinking habits when im home.
The old saying "you can lead a horse to water but you cant make it drink" really comes to mind. I want my boy to be healthy but he doesnt drink much. Any advice? | 0non-cybersec
| Reddit |
On the definition of the Hausdorff distance. <p>$\newcommand{\dist}{\mathrm{dist}\,}$
Let $M$ be a metric space and $\emptyset\neq A,B\subset M$ bounded closed subsets. The <a href="http://en.wikipedia.org/wiki/Hausdorff_distance">Hausdorff distance</a> is defined as $$h(A,B)=\max\{\dist(A,B),\dist(B,A)\},$$ where $$\dist(A,B)=\sup_{x\in A}\inf_{y\in B}d(x,y).$$</p>
<p>Why do we define $\dist(A,B)$ in this way? Is't it possible to replace the supremum by the infimum in the definition of $\dist\!$, that is, define $$\dist_{\mathrm{new}}(A,B)=\inf_{x\in A}\inf_{y\in B}d(x,y).$$</p>
<p>What is the impact of this 'new' definition on the 'Hausdorff distance' given by $$h_{\mathrm{new}}(A,B)=\max\{\dist_{\mathrm{new}}(A,B),\dist_{\mathrm{new}}(B,A)\}?$$</p>
| 0non-cybersec
| Stackexchange |
SQL Server 2005: Rename DB Server Instance Name?. <p>Can somebody tell me how to rename the DB server instance name and a DB name
in SQL Server 2005?</p>
<p>Right Now I Have </p>
<pre><code>SERVER/OLDNAME
-- oldnameDB
</code></pre>
<p>I want to change the server instance and also change the db name.</p>
<p>I have tried: </p>
<p>EXEC sp_renamedb 'oldName', 'newName' </p>
<p>and that has changed the dbname as it appers in the tree directory.
But, when I do "select @@servername" it is the old name. Also,
the MDF and LDF files are still the old name. </p>
<p>How do change instance and db names as a clean sweep across the server?</p>
<p>Thanks.</p>
| 0non-cybersec
| Stackexchange |
New “Rich Kids” Social Media App Costs $1,000 a Month. | 0non-cybersec
| Reddit |
Tried to make Rex’s helmet but with the two helmet sections switched. | 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 |
Reversing lists of numbers in python. <p>So I have been trying to do this for a while now and am constantly coming up with differing failures. I need to take numerical input from the user and put it into a list and output it in decreasing value:</p>
<pre><code>bids = []
bid = input('Bid: ')
while bid != '':
bids.append(bid)
bid = input('Bid: ')
print('The auction has finished! The bids were:')
for bid in bids:
bid = int(bid)
for bid in reversed(bids):
print(bid)
</code></pre>
<p>So this worked well most of the time, (I have been using the numbers 2,3,4 & 10 as input as I have been having problems where it shows the numbers in decreasing order for the first numeral) but when I type in 16, 30, 24 it displays the numbers as:</p>
<pre><code>The auction has finished! The bids were:
24
30
16
</code></pre>
<p>Here is another version I have attempted: </p>
<pre><code>bids = []
bid = input('Bid: ')
while bid != '':
bids.append(bid)
bid = input('Bid: ')
print('The auction has finished! The bids were:')
for bid in bids:
bid = int(bid)
bids.sort([::-1]) #Here is where the problem is at, I don't know
#what the correct syntax is for something like that
for bid in bids:
print(bid)
</code></pre>
<p>Any help will be much appreciated as I am fairly new to python and am struggling with my course.</p>
<p>-Callum</p>
| 0non-cybersec
| Stackexchange |
OS X 10.8 can't resize partitions on MBR disk. <p>I have an external HD with a mix of Mac, NTFS and Linux partitions.
I wanted to use it to backup some partitions from my MacBook HD, and partially succeeded, copying a 100MB partition into an empty 300MB partition.
Unfortunately Disk Utility won't let me resize partitions, or create any new partitions, giving the following message.</p>
<pre><code>You can't resize partitions on this disk because it uses the Master Boot Record partition scheme.
</code></pre>
<p>Is there any way around this?
None of my Windows partition programs can do anything with the Mac OS Extended partition.
Can I convert to GUID Partition Table and still use with Windows XP?</p>
<p>I don't want to lose the content of the NTFS partition, which contains years worth of backups.</p>
<p>PS Is this a new issue with Mountain Lion? I thought I had done these on Snow Leopard.</p>
| 0non-cybersec
| Stackexchange |
Could your brain trick your organs into shutting down?. In other words, can your brain work against you? Is there a mental illness where, i don’t know, your brain tricks itself and your body into thinking it is sick and the only reaction is to forcefully shut down all organs as a defense mechanism?
Side note question, could you try to commit suicide, fail because of second thoughts or the attempt doesn’t work, but your brain won’t accept the failure and continue tricking your body into feeling the pain or wanting to “finish the job” and just kill itself involuntarily? | 0non-cybersec
| Reddit |
If you owned reddit would you change anything?. I'd like to see an option to "double subscribe" to a subreddit to where you see twice as much content from it hit your front page (for example the top 3 links instead of just the top). | 0non-cybersec
| Reddit |
Questions on tomatoes. My tomato plant is flowering up a storm but they seem to get to a point and break off... the plant right next to it has lot of actual tomatos on it... http://i.imgur.com/J9yKO.jpg and http://i.imgur.com/ariZ5.jpg
I dont know why they are breaking off... like drying up and breaking off... when I open a broken flower off it's moist and has a little green thing inside like it would of been a tomato but it's breaking off at the stick it's attached to.... | 0non-cybersec
| Reddit |
Who doesn't love magic?. | 0non-cybersec
| Reddit |
Convergence of random variables in LP preserved under conditioning on sub sigma field. <p>Is anyone aware of a result which states that convergence of random variables in $\mathbb L^p$ are preserved under conditioning on sub-sigma fields? </p>
<p>I'm new to probability/measure theory, and trying to get a handle on the idea of combining $\mathbb L^p$ spaces with conditioning. I was trying to tackle this with martingales, but I fear that I may be way off the reservation. Any guidance would be appreciated. Thanks!</p>
| 0non-cybersec
| Stackexchange |
I was planning on using that box to ship a package but the bulldogs had other ideas.. | 0non-cybersec
| Reddit |
Seems like something reasonable to post!. | 0non-cybersec
| Reddit |
Immunity Debugger - !mona suggest. <p>Potentially simple question. I have been going through some tutorials for exploit development that use !pvefindaddr for help with creating unique patterns and discovering the offset.</p>
<p>I know that mona has replaced pvefindaddr - but from what I can see in the examples I am following the:</p>
<pre><code>!pvefindaddr suggest
</code></pre>
<p>Command gives you an exploit suggestion in perl, while:</p>
<pre><code>!mona suggest
</code></pre>
<p>Basically writes you a metasploit module. </p>
<p>I looked at the options with:</p>
<pre><code>!mona help suggest
</code></pre>
<p>And there don't seem to be many options available. Is it possible to get suggest to offer you exploits written in any format other than a metasploit module?
I couldn't seem to get pvefindaddr working in immunity - I'm assuming it doesn't really work anymore as mona has replaced it, so I wondered if mona had any flexibility?</p>
| 1cybersec
| Stackexchange |
Tomcat 7 GZIP compression not working. <p>I have added the following lines in tomcat's conf/server.xml file to enable gzip compression but its not working. Pages are still uncompressesd.</p>
<pre><code> <Connector port="8080"
compression="on"
compressionMinSize="2048"
noCompressionUserAgents="gozilla, traviata"
compressableMimeType="text/html,text/xml,text/plain,text/css,
text/javascript,text/json,application/x-javascript,
application/javascript,application/json"/>
</code></pre>
<p>Any idea?</p>
| 0non-cybersec
| Stackexchange |
piwheels: making "pip install" fast. | 0non-cybersec
| Reddit |
Koch Brothers-Linked Donors Pay $1 Million Campaign Fine. | 0non-cybersec
| Reddit |
Crock Pot Chipotle Ham And Bean. | 0non-cybersec
| Reddit |
Squid lunch.. | 0non-cybersec
| Reddit |
Adventures in Vanilla SMP (Comic). | 0non-cybersec
| Reddit |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.