text
stringlengths 3
1.74M
| label
class label 2
classes | source
stringclasses 3
values |
|---|---|---|
If only you had a truck.... | 0non-cybersec
| Reddit |
Unexpected. | 0non-cybersec
| Reddit |
Opening up port 8080 in CentOS. <p>I'm new to opening up ports in CentOS. I need to open up tcp port 8080 and have installed/ran nmap to find it is not open already. I've been reading about the iptables command, I have v1.3.5 installed but I really don't know where to start with it regarding opening up this port. </p>
<p>I'd appreciate a code sample or at least a link to a guide to opening this port using iptables (or any other good method.)</p>
<p>Thank you.</p>
| 0non-cybersec
| Stackexchange |
This is one of my childhood freakouters.. | 0non-cybersec
| Reddit |
Are there any FOSS operating systems available that conform to NASA's JPL coding standards?. <p>I, <a href="https://softwareengineering.stackexchange.com/questions/159637/what-is-the-mars-curiosity-rovers-software-built-in">like many others</a>, have been completely enamored with the recent successful landing of Mar's Curiosity rover. After reading a couple of articles, and following a few links, I've found a couple C based coding standards that NASA JPL uses to formalize their code and protect it from error. (See <a href="http://lars-lab.jpl.nasa.gov/JPL_Coding_Standard_C.pdf" rel="nofollow noreferrer">here</a> and <a href="http://spinroot.com/gerard/pdf/P10.pdf" rel="nofollow noreferrer">here</a>.)</p>
<p>This has me curious. Are there any open-source operating systems available that adhere to these coding standards that are available for common architecture, such as x86, x64 or possibly ARM?</p>
| 0non-cybersec
| Stackexchange |
How many of you guys played this or remember it as a kid [picture]. | 0non-cybersec
| Reddit |
Starcraft: Remastered officially announced. | 0non-cybersec
| Reddit |
Move data from array of not aligned structs to array of aligned in c++. <p>What is the best way to move data from array of CameraSpacePoint to array of PointXYZ?</p>
<pre><code>struct CameraSpacePoint
{
float X;
float Y;
float Z;
};
__declspec(align(16))
struct PointXYZ
{
float x;
float y;
float z;
};
constexpr int BIG_VAL = 1920 * 1080;
CameraSpacePoint camera_space_points[BIG_VAL];
PointXYZ points_xyz[BIG_VAL];
</code></pre>
<p>My solution:</p>
<pre><code>CameraSpacePoint* camera_space_points_ptr = &camera_space_points[0];
PointXYZ* points_xyz_ptr = &points_xyz[0];
for (int i = 0; i < BIG_VAL; ++i)
{
memcpy(points_xyz_ptr++, camera_space_points_ptr++, sizeof(CameraSpacePoint));
}
</code></pre>
<p>Is this the most efficient way?</p>
| 0non-cybersec
| Stackexchange |
Has anyone used any custom decoders with OSSEC?. <p>I have the OSSEC HIDS software version 2.8.3 running on a RHEL 6 server. We have been testing this in the lab with a DNS server to track queries that come into our RPZ and Malware zones. The DNS server has the OSSEC agent installed. In order for this to work we had to use a custom written decoder. Has anyone else had any experience with OSSEC and custom decoders besides those that are installed "out of the box". I am mainly looking to get creative ideas on what other system administrators are doing with OSSEC that could also be useful in our production environment.</p>
<p>For instance, has anyone had success in writing/using a custom decoder to detect USB storage for Linux?</p>
<p>UPDATE: I have been working on a custom decoder and rule for detection of when a USB device is inserted into a server. Here is what the line of the log looks like that I want to match on:</p>
<pre><code>Feb 3 10:23:08 testsys kernel: usb 1-1.2: New USB device found, idVendor=0781, idProduct=5575
</code></pre>
<p>My decoder rules in OSSCE:</p>
<pre><code><decoder name="usb-storage">
<program_name>kernel</program_name>
</decoder>
<decoder name="usb-storage-attached">
<parent>usb-storage</parent>
<regex offset="after_parent">^USB \S+: New</regex>
<order>extra_data</order>
</decoder>
</code></pre>
<p>My rules in OSSEC:</p>
<pre><code><group name="syslog,">
<!-- USB Storage Detection Log Types -->
<!-- level=0 for not generating alerts by default -->
<rule id="310201" level="0">
<decoded_as>usb-storage</decoded_as>
<description>Looking for unknown USB attached storage</description>
</rule>
<!-- USB Storage Detection Event Chains -->
<!-- Fire an alert (level=8) if the log line contains "New USB device found" -->
<rule id="310202" level="8">
<if_sid>310201</if_sid>
<match>^New USB device found</match>
<description>Attached USB Storage</description>
</rule>
</group>
</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 |
type annotation for parameter with default value. <p>In the following function definition:</p>
<pre><code> function foo(a: number = 42): number {return a+1;}
</code></pre>
<p>… what are the semantics of the <code>a: number</code> annotation?</p>
<p>Is it saying that variable <i>a</i> will always have a value inside
the body of the function or is it saying that client programmers should always supply a value when they make the call?</p>
<p>I've noticed that both the below code snippets type-check with no errors (with flow-bin 0.57.3):</p>
<p><h2>snippet 1</h2></p>
<pre><code>function foo(a: number = 42): number {return a+1;}
type FooT= (a: number)=> number
(foo: FooT)
foo();
</code></pre>
<p>(try it <a href="https://flow.org/try/#0PQKgBAAgZgNg9gdzCYAoKBXAdgYwC4CWcWYUccAFAIYBcYWGAtgEYCmATmALxgAsATAEo6DFhzABvdqzwZ2JKgGoAjAG4AvqjwBPAA6swAMXIAVHtRFM27QVwB89Kx1SoKZOHWNwTgl+4qCqkA" rel="nofollow noreferrer">here</a>)</p>
<p><h2>snippet 2</h2></p>
<pre><code>function foo(a: ?number = 42): number {return a+1;}
type FooT = (a: ?number)=> number
(foo: FooT)
foo();
</code></pre>
<p>(try it <a href="https://flow.org/try/#0PQKgBAAgZgNg9gdzCYAoKBXAdgYwC4CWcWYUccAFAIYBcYA-FhgLYBGApgE5gC8YALACYAlHSZsuYAN6d2eDJxJUA1AEYA3AF9UeAJ4AHdmABi5ACq8w1OoxYdOwngD4w4+6lQUycOqbhnhD28KYXUgA" rel="nofollow noreferrer">here</a>)</p>
<p>What is the suggested way to annotate in such a case?</p>
<p>My preference is with way #2 as the client programmer only has to look at the definition of the <code>FooT</code> type to realize that the parameter is optional. This allows me to tell users of my
library: "simply look at the type of the function (<code>FooT</code>)".</p>
<p>Whereas with way #1 I have to tell them "the type of the function (<code>FooT</code>) seems to suggest that an argument is required, but in fact it isn't because, see, if you look at the implementation, a default value is supplied".</p>
<p>So, which snippet is more idiomatic?</p>
<p>Note that there is an <a href="https://stackoverflow.com/a/33097444/274677">answer</a> to a related question that seems to suggest that it is possible to annotate the type as mandatory in the implementation of a function and as optional in the declaration. But this doesn't seem to work in this case. E.g. the following doesn't type-check:</p>
<pre><code>function foo(a: number = 42): number {return a+1;}
type FooT = (a: ?number)=> number
(foo: FooT)
foo();
</code></pre>
<p>(try it <a href="https://flow.org/try/#0PQKgBAAgZgNg9gdzCYAoKBXAdgYwC4CWcWYUccAFAIYBcYWGAtgEYCmATmALxgAsATAEo6DFhzABvdqzwZ2JKgGoAjAG4AvqjwBPAA6swAMXIAVbmGp0A-KLbtBXAHz0md1Kgpk4dY3BOD3LwpBVSA" rel="nofollow noreferrer">here</a>)</p>
| 0non-cybersec
| Stackexchange |
Shredding the Eisenbach gnar in Munich, Germany.. | 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 |
Register performance counter without lodctr. <p>I am looking for an approach to register to XML-based performance counters without using <code>lodctr</code> executable. </p>
<p>While <a href="https://stackoverflow.com/questions/17880592/performance-counters-in-c-without-lodctr">this question</a> and <a href="https://stackoverflow.com/questions/7532767/programmatically-registering-a-performance-counter-in-the-registry">this question</a> has given some insight to the problem, none gives a proper resolution. </p>
<p>The function <strong><a href="https://msdn.microsoft.com/en-us/library/aa372187(v=VS.85).aspx" rel="noreferrer"><code>LoadPerfCounterTextStrings</code></a></strong> seems to do the trick, but doesn't seem to take XML as input (i.e. <code>/M</code> argument for <code>lodctr</code> command). The function would anyway call the <code>lodctr</code> command but will save the programmer from calling <code>lodctr.exe</code> programmatically.</p>
<p>Is there an approach to call this function (or any other) that would behave as if:</p>
<pre><code>lodctr.exe /M:xmlfile.xml
</code></pre>
<p>?</p>
<p>Just an additional information that <code>LoadPerfCounterTextStrings</code> is available in Windows XP, however, the new API (perflib <strong>2</strong>) is available only after Vista. I am using V2.</p>
| 0non-cybersec
| Stackexchange |
when is the region bounded by a Jordan curve "skinny"?. <p>How can I formalize and prove the following intuition?:</p>
<p>Picture a very skinny rectangle, one with base length 1 and sides length $\epsilon$. Or imagine a very flattened ellipse. The interiors of these objects are "skinny" (or we might say $\epsilon$-skinny) in the sense that each point in the interior is very close (or within $\epsilon$) to a point on the boundary. This notion seems easy to formalize.</p>
<p>Now think of the sides of the rectangle, or the boundary of the ellipse, as the image of a Jordan curve $f : S^1 \rightarrow \mathbb{R}^2$ . It's intuitively "obvious" (though not at all obvious) that what makes the bounded region skinny (in the sense of the above paragraph) is the fact that: For every $\theta \in S^1$ there exists $\theta ' \in S^1$ such that $f (\theta )$ is close to $f (\theta ' )$ but $\theta$ is not very close to $\theta '$. </p>
<p>I have been thinking about the right way to formalize these ideas and I'm a bit stuck. I'd like to formulate them in the $C^0$ setting, that is to say without assuming tangent vectors or any calculus-related things. Do you have any thoughts? Thanks!</p>
<p>Also: This is motivated by the completely well-defined question here:<a href="https://math.stackexchange.com/questions/401975/why-is-an-annulus-close-to-its-boundary-when-its-boundary-curves-are-close">why is an annulus close to it's boundary when it's boundary curves are close?</a> </p>
| 0non-cybersec
| Stackexchange |
Small perturbation of $f$ doesn't affect the topology of $f^{-1}(0)$. <p>This question arise from the proof of the degree-genus formula which asserts that a non-singular complex algebraic curve <span class="math-container">$C=\{x\in \mathbb{CP}^2| p(x) = 0\}$</span> is a (real) surface of genus <span class="math-container">$\frac 1 2(d-1)(d-2)$</span> where <span class="math-container">$d$</span> is the degree of the homogeneous polynomial <span class="math-container">$p$</span>.</p>
<p>In the proof, it is mentioned that if we perturb the coefficients of <span class="math-container">$p$</span> slightly then the topology of <span class="math-container">$p^{-1}(0)$</span> remains the same.</p>
<p>This suggests the following question:</p>
<blockquote>
<p>Given <span class="math-container">$f:M\to \mathbb{R}$</span> such that <span class="math-container">$M$</span> is a smooth closed n-manifold and <span class="math-container">$0$</span> is a regular value for <span class="math-container">$f$</span>, there is a neighborhood of <span class="math-container">$f$</span> (for example in the weak topology) such that for the generic <span class="math-container">$g:M\to \mathbb{R}$</span> in this neighborhood <span class="math-container">$g^{-1}(0)$</span> is diffeomorphic to <span class="math-container">$f^{-1}(0)$</span> ?
i.e. if we perturb slightly <span class="math-container">$f$</span> can we get a <span class="math-container">$g$</span> such that <span class="math-container">$g^{-1}(0) \simeq f^{-1}(0)$</span></p>
</blockquote>
<p>I know that the set of map transversal to <span class="math-container">$0$</span> is dense and we can also prove that exists <span class="math-container">$g$</span> homotopic to <span class="math-container">$f$</span> so that <span class="math-container">$f^{-1}(0)$</span> and <span class="math-container">$g^{-1}(0)$</span> are cobordant. But this doesn't imply that they are diffeomorphic.</p>
| 0non-cybersec
| Stackexchange |
unable to run 'pdflatex' on 'myFirstAlignment.tex' in rStudio. <p>Getting this Error Message:</p>
<pre><code>Error in texi2dvi(texfile, quiet = !verbose, pdf = identical(output, "pdf"), :
unable to run 'pdflatex' on 'myFirstAlignment.tex'
In addition: Warning message:
running command '"pdflatex" -interaction=nonstopmode "myFirstAlignment.tex"' had status 1
</code></pre>
<p>When running this series of commands in rStudio:</p>
<pre><code>library(msa)
mySequenceFile <- system.file("examples", "exampleAA.fasta", package="msa")
mySequences <- readAAStringSet(mySequenceFile)
mySequences
myFirstAlignment <- msa(mySequences)
msaPrettyPrint(myFirstAlignment)
</code></pre>
<p>This was after a fresh install of the msa package in rStudio and MikTex.</p>
<p>Any suggestions?</p>
| 0non-cybersec
| Stackexchange |
About the absolute value and the place on a number field. <p>Let $K$ be a number field. The place $\nu$ is an equivalence class of non-trivial absolute values. Moreover, the absolute value $| \quad | : K \to \mathbb{R}$ is called non-archimedean if $$|x+ y| \leq \max(|x|, |y|), \forall \ x, y \in K.$$ Then, one has</p>
<p>"there is only one archimedean place $\infty$ on $\mathbb{Q}$ given by the ordinary absolute value $| \quad |$." </p>
<p>I am reading this proposition, but I can't prove its. Can you help me to send a proof for that? Thank you so much.</p>
| 0non-cybersec
| Stackexchange |
Animate scrollTop not working in firefox. <p>This function works fine. It scrolls the body to a desired container's offset</p>
<pre><code>function scrolear(destino){
var stop = $(destino).offset().top;
var delay = 1000;
$('body').animate({scrollTop: stop}, delay);
return false;
}
</code></pre>
<p>But not in Firefox. Why?</p>
<p>-EDIT-</p>
<p>To handle de double trigger in the accepted answer, I suggest stoping the element before the animation:</p>
<pre><code>$('body,html').stop(true,true).animate({scrollTop: stop}, delay);
</code></pre>
| 0non-cybersec
| Stackexchange |
Enforce custom ordering on Sympy print. <p><code>SymPy</code> does a wonderful work keeping track of all the operations I do to my symbolic expressions. But a the moment of printing the result for latex output I would like to enforce a certain ordering of the term. This is just for convention, and unfortunately that convention is not alphabetical on the symbol name(as reasonably <code>sympy</code> does)</p>
<pre><code>import sympy as sp
sp.init_printing()
U,tp, z, d = sp.symbols('U t_\perp z d')
# do many operations with those symbols
# the final expression is:
z+tp**2+U+U/(z-3*tp)+d
</code></pre>
<p>My problem is that <code>SymPy</code> presents the expression ordered as </p>
<pre><code>U + U/(-3*t_\perp + z) + d + t_\perp**2 + z
</code></pre>
<p>But this ordering is not the convention in my field. For us <code>z</code> has to be the leftmost expression, then <code>tp</code>, then <code>U</code> even if it is capitalized, <code>d</code> is the most irrelevant and is put at the right. All this variables hold a particular meaning and that is the reason we write them in such order, and the reason in the code variables are named in such way.</p>
<p>I don't want to rename <code>z</code> to <code>a</code> and as suggested in <a href="https://stackoverflow.com/questions/14624511/prevent-sympy-from-rearranging-the-equation">Prevent Sympy from rearranging the equation</a> and then at the moment of printing transform that <code>a</code> into <code>z</code>. In <a href="https://stackoverflow.com/questions/36314035/python-sympy-force-sympy-to-keep-order?noredirect=1&lq=1">Force SymPy to keep the order of terms</a> there is a hint I can write a sorting function but I could not find documentation about it. </p>
| 0non-cybersec
| Stackexchange |
My friend made this floor flush double piston extender using observers. | 0non-cybersec
| Reddit |
A map of the main trafficking flows of cocaine to Europe.. | 0non-cybersec
| Reddit |
Routine stop. | 0non-cybersec
| Reddit |
Their wig fell off. | 0non-cybersec
| Reddit |
When you receive a BitCoin what do you actually get?. <p>Say someone sends me 0.5 of a BTC to my desktop wallet, is it a digital file or lines of code that they send me which has monetary value? I'm very confused on what you actually RECEIVE with cryptocurrency.</p>
| 0non-cybersec
| Stackexchange |
What's one thing about Android that keeps you coming back for more?. | 0non-cybersec
| Reddit |
How to install picasa on ubuntu using winetricks?. <p>I have installed wintricks & also followed the guidelines of this question's => <strong><a href="https://askubuntu.com/questions/86452/how-would-i-install-picasa-3-9">Answer</a></strong>.
But I'm getting this problem => (Check the print screen I have shared below)</p>
<p><a href="https://i.stack.imgur.com/6gO5X.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/6gO5X.png" alt="picasa_ubuntu printscreen"></a></p>
| 0non-cybersec
| Stackexchange |
TIL that during 10 cent beer night at a Major League Baseball game in 1974, Cleveland Indians' fans became so intoxicated and unruly that the game had to be forfeited to the visiting Texas Rangers.. | 0non-cybersec
| Reddit |
How can I install Cinnamon on Ubuntu 12.04 and eliminate the following errors:. <pre><code>$ sudo apt-get install cinnamon cinnamon-session cinnamon-settings
Reading package lists... Done
Building dependency tree
Reading state information... Done
Note, selecting 'cinnamon' instead of 'cinnamon-session'
Note, selecting 'cinnamon' instead of 'cinnamon-settings'
Some packages could not be installed. This may mean that you have
requested an impossible situation or if you are using the unstable
distribution that some required packages have not yet been created
or been moved out of Incoming.
The following information may help resolve the situation:
The following packages have unmet dependencies:
cinnamon : Depends: gir1.2-muffin-3.0 but it is not going to be installed
Depends: libcogl5 (>= 1.7.4) but it is not installable
Depends: libmuffin0 (>= 1.0.0-0ubuntu1~precise) but it is not going to be installed
Recommends: gnome-themes-standard but it is not going to be installed
Recommends: gnome-session-fallback but it is not going to be installed
E: Unable to correct problems, you have held broken packages.
</code></pre>
<p>I added this PPA: </p>
<p><code>sudo add-apt-repository ppa:merlwiz79/cinnamon-ppa</code></p>
<p>Then ran the following command: </p>
<p><code>sudo apt-get update && sudo apt-get install cinnamon cinnamon-session cinnamon-settings</code></p>
<p>How can I install the latest Cinnamon desktop? How can I fix this error?</p>
| 0non-cybersec
| Stackexchange |
Can it be argued that this question only has 1 answer ultimately?. <p>I came across this quiz question in a forum today. I would like to ask for your opinion of this notorious mathematics question, and also, to share. </p>
<p><img src="https://i.stack.imgur.com/axkWO.png" alt="PSLE 2005 Question"></p>
<p>This question came out in Singapore's PSLE examination 2005. Basically, PSLE is one of the most important exams of one's life in Singapore. It literally determines your future, to a huge degree. How did such a question slip past the examiners, we would never know. </p>
<blockquote>
<blockquote>
<p>As for my real question, is that, is there a valid answer to this question ultimately? I mean, there can be more then one answer, but can it be argued in such a way, that one answer can ultimately be proven to be true? </p>
</blockquote>
</blockquote>
| 0non-cybersec
| Stackexchange |
Does Astral Chain remind you of the anime called Psyco-Pass?. I couldn't help but notice but in the trailer when their guns are engaging it sounds similar to when the guns engage in the anime. Also at the end with the dog disguise, reminds me how they have their disguise kinda like that in the anime. Comment down if you know what I mean. | 0non-cybersec
| Reddit |
6 Food Safety Tips for Your Next Cookout. | 0non-cybersec
| Reddit |
Food Cost Vs. Nutrition. | 0non-cybersec
| Reddit |
embedding jquery.prettyPhoto causes script to show on page. <p>When I move:</p>
<pre><code><script src="js/jquery.prettyPhoto.js"></script>
</code></pre>
<p>To:</p>
<pre><code><script type="text/javascript">
...
</script>
</code></pre>
<p>Then the script starts showing on the page from the <strong>bold</strong> part onwards:</p>
<p>style="border:none; overflow:hidden; width:500px; height:23px;" allowTransparency="true"><strong>'},s);var o=this,u=false,a,f,l,c,h,p,d=e(window).height(),v=e...</strong></p>
<p>The script is attributed with this information:</p>
<pre><code>Class: prettyPhoto
Use: Lightbox clone for jQuery
Author: Stephane Caron (http://www.no-margin-for-errors.com)
Version: 3.1.5
</code></pre>
<p>How can I move the script from a <code>.js</code> file to the page <a href="https://jsfiddle.net/rL9h958e/">correctly</a>?</p>
| 0non-cybersec
| Stackexchange |
Memory size of a Java 32-bit system int[] array. <p>In Java, memory used for occupying the <code>int[]</code> array of size <code>n</code> equals to <code>(4 + n) * 4</code> bytes.</p>
<p>Practically can be proven by the code below:</p>
<pre><code>public class test {
public static void main(String[] args) {
long size = memoryUsed();
int[] array = new int[2000];
size = memoryUsed() - size;
if (size == 0)
throw new AssertionError("You need to run this with -XX:-UseTLAB for accurate accounting");
System.out.printf("int[2000] used %,d bytes%n", size);
}
public static long memoryUsed() {
return Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
}
}
</code></pre>
<p>so interesting is number <code>4</code> in parentheses. First portion of <code>4</code> bytes takes array reference, second - array length, then what takes 8 bytes left?</p>
| 0non-cybersec
| Stackexchange |
How to keep CRUD user stories from being trite and simplistic?. <p>I'm having trouble keeping my user stories for basic operations from sounding ... basic. For example, suppose I'm building a CRM to keep track of clients:</p>
<ul>
<li>C: As a user, I want to create a client, so I can ... keep track of my clients?</li>
<li>R: As a user, I want to view my clients and their properties, so I can ... know what's going on?</li>
<li>U: As a user, I want to change my clients' information, so I can ... not use outdated information?</li>
<li>D: As a user, I want to delete a client, so I can ... not have old clients lying around?</li>
</ul>
<p>It seems like there are lots of reasons to want to perform CRUD operations on your objects, the primary reason being a kind of obvious "just because" reason. I suppose I could just pick one reason. For example:</p>
<ul>
<li>As a user, I want view my clients and their properties, so I can sound knowledgeable when they call.</li>
</ul>
<p>But there are many, many more reasons why I want to view my clients. It would be tedious to enumerate out every reason why I would want to look up a client, and even if I tried, I probably still wouldn't be able to think of every reason.</p>
<p>How do you write user stories for basic operations?</p>
| 0non-cybersec
| Stackexchange |
Finding circle of a sphere through two points. <p>We have two points $P_1, P_2$ on a sphere $S$ of radius $R$. Suppose for $r \ll R$, the distance between $P_1$ and $P_2$ is less than $2r$. </p>
<p>Then, $P_1$ and $P_2$ both lie on exactly two radius-$r$ circles of the sphere. This is clear: of the set of planes that contain $P_1$ and $P_2$, there are two of those planes that intersect $S$ to form a circle with radius $r$. </p>
<p>Given $P_1$, $P_2$, $R$ and $r$, how can I calculate the centers of these two circles?</p>
<p>I would prefer to do as little messy spherical geometry as possible :).</p>
| 0non-cybersec
| Stackexchange |
Tricky differentials problem involving continuous functions. <p>Suppose $f$ is a continuous function on $[0, \infty )$, differentials on $(0, \infty)$, such that $f(0)=1$ and $f'(x)> \frac{1}{2\surd (x+1)} \forall x>0$. Show that $f(x)> \surd (x+1)$. </p>
<p>Rolle's theorem and the mean value theorem are my only leads . </p>
<p>Can an expert provide Hints, tips, suggestions, to a solution? </p>
| 0non-cybersec
| Stackexchange |
Does an ideal in $k[x_1, \dots, x_n]$, $k$ a field, contain only finitely many irreducible elements?. <p>Let $k$ be a field and consider a nonunital ideal $I$ in $k[x_1, \dots, x_n]$. Since $k$ is Noetherian, we may write $I = (f_1, \dots, f_k)$ where each $f_i$ is nonconstant irreducible. </p>
<p>Is it true that $I$ can contain only finitely many irreducible elements? If so, is there an elementary proof (not using too much commutative algebra)? What if $I$ is assumed to be a maximal ideal? </p>
<p>I don't know how to answer when a prime polynomial can be a linear combination of other primes.</p>
| 0non-cybersec
| Stackexchange |
Pan-seared chicken thighs with beer and mustard sauce. | 0non-cybersec
| Reddit |
Modern Treehouses: A Vertical Forest in Milan. | 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 |
Feedly And Evernote Go Down As Attackers Demand Ransom. | 1cybersec
| Reddit |
Recommended contract & document creation/management suite which support digital signatures?. Anyone have any ideas of products which can make contract creation easy (maybe even automated)?
I have a client whom is looking for something - they have ~5-10 different contracts each quarter, all are word documents. The legal may change every few weeks. The list of product/services on it might change too.
We're hoping for something that can be pre-populated from sales and can be digitally signed by the customer (Docusign or echosign). These two digital signature vendors don't really support tracking documents and/or managing revisions in any easy fashion...
Something template-able, is on-premises, and is not a billion dollars would be awesome. We'd rather not custom design something...
Ideas? | 0non-cybersec
| Reddit |
When did you realise teenage girls were as horny as you were.. Here's my story: my first girlfriend was at 17 back in 1971. We went out for a few weeks which involved little more than kissing. One nightas we were kissing on the couch she took my hand and placed it on her boobs. Like a rabbit in the headlights I froze and pulled my hand away. a few weeks after this she gave me the elbow for another boy. A couple of months later i went out with another girl (a right hottie, a double for Olivier Newton John), she too placed my hand on her chest and once again i recoiled in shock only to finnish with a week later. It was only when i met my now wife who took me in hand, literally, that i realised girls in their late teens are as horny as boys of that age and the reason the first two girls dumped me was that i didn't give them what they wanted, which was a good shagging. Mind you, i more than made up for those lost chances with the girl that i later married | 0non-cybersec
| Reddit |
Why are projective morphisms closed?. <p>It is a well-known fact that if $X$ is a projective curve and $p \in X$ a smooth point, then any rational map $X \to Y$, $Y$ a projective variety, extends to a rational map $X \to Y$ regular at $p$. This is proposition I.6.8 in Hartshorne (in the case of $X$ an abstract non-singular curve), for example. However, the two proofs I have seen both assume that it suffices to consider the case $Y = \mathbb{P}^n$. As I understand it, this is because morphisms of projective varieties are proper, and in particular the image is closed. Where I can find a proof of this, in the case of varieties only? I found a proof <a href="http://amathew.wordpress.com/2010/10/23/a-projective-morphism-is-proper/" rel="noreferrer">here</a> by Akhil Mathew, but I got lost when he started talking about base change.</p>
| 0non-cybersec
| Stackexchange |
Union of the graphs of derivatives of a function.. <p>For a function $ f: \mathbb{R} \to \mathbb{R} $, write Graph($f$) $:= \{(x,f(x)):x\in \mathbb{R}\} $. </p>
<p>For $ f \in C^{\infty}(\mathbb{R}) $, define $ A(f) := \bigcup\limits_{n=0}^{\infty} \textrm{Graph}(f^{(n)}) $. </p>
<p>It is clear that $ g = f^{(n)} $ implies $ A(g) \subset A(f) $. The question is, is the converse also true? That is, does $ A(g) \subset A(f) $ imply $ g = f^{(n)} $ for some $ n \geq 0 $?</p>
| 0non-cybersec
| Stackexchange |
I think my sister did a pretty good job on her trunk or treat. | 0non-cybersec
| Reddit |
Numpy split array based on condition without for loop. <p>So lets say i have a numpy array that holds points in 2d space, like the following</p>
<pre><code>np.array([[3, 2], [4, 4], [5, 4], [4, 2], [4, 6], [9, 5]])
</code></pre>
<p>I also have a numpy array that labels each point to a number, this array is a 1d array with the length as the number of points in the point array.</p>
<pre><code>np.array([0, 1, 1, 0, 2, 1])
</code></pre>
<p>Now i want to take the mean value of each point that have an index from the labels array. So for all points that have label 0, take the mean value of those points.
My current way of solving this is the following way</p>
<pre><code>return np.array([points[labels==k].mean(axis=0) for k in range(k)])
</code></pre>
<p>where k is the largest number in the labels array, or as it's called the number of ways to label the points. </p>
<p>I would like a way to do this without using a for loop, maybe some numpy functionality i haven't discovered yet?</p>
| 0non-cybersec
| Stackexchange |
Clarification about Firewall Forwarding. <p>If a firewall forwards packets between different networks (internal) and no NAT is used, is there something in the packet where I can see if it was forwarded by a firewall? </p>
| 0non-cybersec
| Stackexchange |
Why none of my mp3's purchased from Amazon play correctly on my Samsung Phone using the Google Play app? How to Fix?. <p>How do I get my Google play music app to play my mp3's purchased from Amazon correctly?<br>
There is a continued skip throughout all the songs. Very annoying.<br>
Music that I have not purchased from Amazon Music play without problems. Leery of purchasing a converter license only to find it will not fix the problem. </p>
<p>Any suggestions? Am I the only one who has this problem? </p>
| 0non-cybersec
| Stackexchange |
A smart attack on SMTP evading fail2ban. <p>I have an ongoing brute-force attack on my SMTP server in a way that evades typical fail2ban settings: </p>
<ul>
<li>attacks take place from several IPs in the same subnet</li>
<li>a single IP attacks in intervals longer than an hour, apparently to evade being blocked by fail2ban that typically uses <code>findtime</code> and <code>bantime</code> shorter than an hour</li>
</ul>
<p>This is the log:</p>
<pre><code>2017-09-05 01:11:19 LOGIN authenticator failed for (User) [91.200.12.165]:57519 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=soft)
2017-09-05 01:11:36 LOGIN authenticator failed for (User) [91.200.12.164]:51973 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=sandy)
2017-09-05 01:15:22 LOGIN authenticator failed for (User) [91.200.12.121]:51545 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=brown)
2017-09-05 01:28:57 LOGIN authenticator failed for (User) [91.200.12.105]:64938 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=family)
2017-09-05 01:48:32 LOGIN authenticator failed for (User) [91.200.12.165]:64730 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=soi)
2017-09-05 01:48:47 LOGIN authenticator failed for (User) [91.200.12.164]:59184 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=sanjeev)
2017-09-05 01:50:13 LOGIN authenticator failed for (User) [91.200.12.166]:64999 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=until)
2017-09-05 01:54:05 LOGIN authenticator failed for (User) [91.200.12.121]:58756 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=bryan)
2017-09-05 02:04:34 LOGIN authenticator failed for (User) [91.200.12.105]:55772 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=famous)
2017-09-05 02:25:36 LOGIN authenticator failed for (User) [91.200.12.165]:55563 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=soldiers)
2017-09-05 02:25:48 LOGIN authenticator failed for (User) [91.200.12.164]:50017 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=sanmiguel)
2017-09-05 02:30:33 LOGIN authenticator failed for (User) [91.200.12.166]:55835 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=update)
2017-09-05 02:32:56 LOGIN authenticator failed for (User) [91.200.12.121]:49589 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=bsd)
2017-09-05 02:40:11 LOGIN authenticator failed for (User) [91.200.12.105]:62983 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=far)
2017-09-05 03:02:29 LOGIN authenticator failed for (User) [91.200.12.165]:62775 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=solution)
2017-09-05 03:02:40 LOGIN authenticator failed for (User) [91.200.12.164]:57228 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=santamaria)
2017-09-05 03:10:50 LOGIN authenticator failed for (User) [91.200.12.166]:63046 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=upgrade)
2017-09-05 03:11:37 LOGIN authenticator failed for (User) [91.200.12.121]:56803 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=bubba)
2017-09-05 03:15:41 LOGIN authenticator failed for (User) [91.200.12.105]:53820 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=farias)
2017-09-05 03:39:36 LOGIN authenticator failed for (User) [91.200.12.165]:53612 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=solve)
2017-09-05 03:39:48 LOGIN authenticator failed for (User) [91.200.12.164]:64441 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=santos)
2017-09-05 03:50:50 LOGIN authenticator failed for (User) [91.200.12.121]:64015 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=buchhaltung)
2017-09-05 03:51:30 LOGIN authenticator failed for (User) [91.200.12.166]:53880 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=upload)
2017-09-05 03:51:34 LOGIN authenticator failed for (User) [91.200.12.105]:61032 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=farm)
2017-09-05 04:17:31 LOGIN authenticator failed for (User) [91.200.12.165]:60825 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=somebody)
2017-09-05 04:17:34 LOGIN authenticator failed for (User) [91.200.12.164]:55274 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=sara)
2017-09-05 04:27:43 LOGIN authenticator failed for (User) [91.200.12.105]:51865 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=farmer)
2017-09-05 04:30:06 LOGIN authenticator failed for (User) [91.200.12.121]:54848 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=buddy)
2017-09-05 04:32:02 LOGIN authenticator failed for (User) [91.200.12.166]:61091 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=upon)
2017-09-05 04:55:24 LOGIN authenticator failed for (User) [91.200.12.164]:62485 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=sarah)
2017-09-05 04:55:24 LOGIN authenticator failed for (User) [91.200.12.165]:51657 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=someone)
2017-09-05 05:03:42 LOGIN authenticator failed for (User) [91.200.12.105]:59078 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=farmers)
2017-09-05 05:09:10 LOGIN authenticator failed for (User) [91.200.12.121]:62060 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=build)
2017-09-05 05:12:27 LOGIN authenticator failed for (User) [91.200.12.166]:51923 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=ups)
2017-09-05 05:33:26 LOGIN authenticator failed for (User) [91.200.12.164]:53321 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=sat)
2017-09-05 05:33:26 LOGIN authenticator failed for (User) [91.200.12.165]:58869 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=somethin)
2017-09-05 05:40:00 LOGIN authenticator failed for (User) [91.200.12.105]:49912 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=fast)
2017-09-05 05:48:34 LOGIN authenticator failed for (User) [91.200.12.121]:52896 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=building)
2017-09-05 05:53:00 LOGIN authenticator failed for (User) [91.200.12.166]:59136 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=uranus)
2017-09-05 06:11:20 LOGIN authenticator failed for (User) [91.200.12.165]:49705 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=son)
2017-09-05 06:11:21 LOGIN authenticator failed for (User) [91.200.12.164]:60535 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=saturn)
2017-09-05 06:16:06 LOGIN authenticator failed for (User) [91.200.12.105]:57124 I=[192.168.1.224]:25: 535 Incorrect authentication data (set_id=father
</code></pre>
<p>Is there a way to make some sort of selective fail2ban setting that would catch such attacks in a way other than just increasing <code>findtime</code> and <code>bantime</code> to several hours?</p>
| 1cybersec
| Stackexchange |
Royal Pet Portrait. | 0non-cybersec
| Reddit |
Monitor visited websites of guest account through any browser. <p>I want to know which websites/URLs are visited by users of my home computer's guest account. </p>
<p>Is there a way to log this and save it as nicely formatted list to the disk? I only need date/time and visited URL. If possible, full URLs would be nice, but domain only is also good for a start.</p>
<p><strong>Update:</strong></p>
<p>After having read the linked answers and suggestions in the chat from <em>A.B.</em>, I ran the following command:</p>
<pre><code>$ sudo iptables -A OUTPUT -m owner --uid-owner 499 -j LOG --log-prefix='[GUEST INTERNET ACCESS] '
</code></pre>
<p>after having set the guest account UID to the fixed UID 499 following <a href="https://askubuntu.com/questions/699113/set-or-determine-the-uid-range-for-guest-accounts?lq=1">Set or determine the UID range for guest accounts</a>.</p>
<p>But the <code>/var/log/kern.log</code> still doesn't contain those logs but lots of messages by <code>apparmor</code> that tell it denied something:</p>
<pre><code>Nov 18 11:19:22 wolf-pack kernel: [ 1030.063374] audit: type=1400 audit(1447841962.731:164): apparmor="DENIED" operation="connect" profile="/usr/lib/lightdm/lightdm-guest-session" name="/run/systemd/journal/stdout" pid=4693 comm="dbus-daemon" requested_mask="w" denied_mask="w" fsuid=499 ouid=0
</code></pre>
<p>I have posted a separate question about the AppArmor problem here: <a href="https://askubuntu.com/q/699539/367990">AppArmor blocks logging set up through iptables for guest account - How to enable?</a></p>
| 0non-cybersec
| Stackexchange |
[OC][Fanart] I can't believe they let a stoner into Iron Frill. | 0non-cybersec
| Reddit |
I made my girlfriend cry from orgasm denial and I'm feeling bad about it.. After she stopped yelling at me and calmed down from her hornyness she forgave me. But I'd be lying if I said I didn't enjoy it. Knowing that I got her so close and so sexually frustrated that she literally started crying gives me a bit of a thrill.
Now, I will never do it again without her explicit permission, but I'm feeling like a bit of a sadist for enjoying her agony. In retrospect it makes me feel like a huge asshole.
Is it "normal" to enjoy such a thing? I'm questioning myself at this point. Maybe it's a red flag and I'm completely unaware? | 0non-cybersec
| Reddit |
Why did SafetyNet Attestation stop working?. <p>I have an app which has been using the <a href="https://developer.android.com/training/safetynet/attestation" rel="noreferrer">SafetyNet Attestation API</a> for some time.</p>
<p>All of a sudden, all calls to the API started failing. Did something happen to the SafetyNet Attestation API?</p>
| 0non-cybersec
| Stackexchange |
Why do I get "does not live long enough" in a return value?. <p>In examining <a href="https://stackoverflow.com/questions/53585774/how-do-i-box-arc-and-mutexed-variables-in-rust">How do I box Arc and Mutexed variables?</a>, I ran into an issue where code that looks OK is generating a "does not live long enough" error while constructing a return value from a <code>Mutex</code>. Simply pulling the <code>lock().unwrap()</code> access out of the return object removes the error - but I'd like to understand why Rust is complaining about a lifetime issue in this case.</p>
<p>I was able to cut the code down to a very simple reproducer: The first function compiles OK, the second generates the error message, and they're almost identical.</p>
<pre><code>use std::sync::Mutex;
pub struct Response {
resp: String,
}
pub fn get() -> Response {
let body = Mutex::new("a".to_string());
let x: std::sync::MutexGuard<_> = body.lock().unwrap();
Response { resp: x.clone() }
}
pub fn get2() -> Response {
let body = Mutex::new("a".to_string());
Response {
resp: body.lock().unwrap().clone(),
}
}
</code></pre>
<pre class="lang-none prettyprint-override"><code>error[E0597]: `body` does not live long enough
--> src/lib.rs:16:15
|
16 | resp: body.lock().unwrap().clone(),
| ^^^^ borrowed value does not live long enough
17 | }
18 | }
| - `body` dropped here while still borrowed
|
= note: values in a scope are dropped in the opposite order they are created
</code></pre>
| 0non-cybersec
| Stackexchange |
ELI5: Major League Baseball batting strategy. Are they simply trying to hit a home run every time? Is there more to it than that?. | 0non-cybersec
| Reddit |
THE BETRAYAL. | 0non-cybersec
| Reddit |
How to create RPM for generic Perl module. <p>I have a generic Perl module that will run on any release of Perl 5. I need to create an RPM for it that will install it into the vendor_perl subdirectory.</p>
<p>I don't want to create different RPMs for SUSE and Red Hat distros, their clones, and their different versions. I have successfully created similar, generic RPMs for non-Perl packages. </p>
<p>I can use %{perl_vendorlib} to map the correct directory, but only for the system where the RPM is created.</p>
<p>What is required in the RPM .spec so that the Perl module file is installed into %{perl_vendorlib} of the target system? Assume the target system could be CentOS 7, RHEL 8, SLES 12, or SLES 15.</p>
| 0non-cybersec
| Stackexchange |
Today is the one-year anniversary of /r/Games's creation - let's talk about the subreddit and how to keep it on track. One year ago today, Dacvak, tevoul and I [launched this subreddit](http://www.reddit.com/r/gaming/comments/metq6/announcement_rgaming_to_branch_into_two_separate/) as a place for people that wanted a general gaming subreddit focused on informative and interesting content and discussions. If you're curious, [here are the top posts that were made in the first few hours](http://stattit.com/r/Games/2011-11-16/), and [the top ones made over the next day](http://stattit.com/r/Games/2011-11-17).
Over the last year, the subreddit's grown extremely quickly. [Looking at the statistics](http://stattit.com/r/Games/), we're now the 46th largest subreddit on the site by number of subscribers, and are typically around the top 25 by number of users online and number of comments being posted. Considering most of the top 20 is made up of the default subscriptions, this makes us one of the very top non-default subreddits.
Overall, despite this massive growth, I still think the subreddit is mostly doing a good job of staying true to the initial vision. We've had to make some small tweaks to the rules here and there, but nothing very major. And on that note, there's a couple of things in particular that I want to discuss today.
### Game recommendations and other rules
Fairly early on in the subreddit's life, we banned "overly general" recommendation requests, posts like "I just got a PS3, what games are good?" Beyond that, we mostly allow anything, as long as there's at least something to guide the discussion. So asking for recommendations similar to other games or in particular genres is fine. However, there are still quite a few low-quality recommendation requests being posted, and I know that some people aren't happy about them. I should mention that I don't think they're really a huge issue since they're generally downvoted and aren't dominating the subreddit or anything, but they do clutter up the /new page a bit.
So I'd like to suggest an addition to the rules about recommendation posts, which is to also ban **overly personal or specific recommendations**. For example, "Should I buy Game A or Game B?" The answers to this are completely dependent on the poster's personal taste, so they naturally can't cause much of a discussion for others. Since we already ban other types of posts that are just looking for a specific answer ("Where can I buy Game X?", etc.), I think this also fits in well with that.
Any thoughts on this, or any other changes we should consider to the rules? Like I mentioned, I think the voting system does handle a lot of stuff, everything doesn't specifically need to be dealt with by moderation.
### An experiment in "community moderation"
But on that topic, the other main thing I want to discuss is an idea I had for a potential experiment. As anyone that spends much time on reddit eventually realizes, the voting system has a lot of weaknesses. Specifically, the biggest problem is that it doesn't rank things based on quality, it ranks by *popularity*, which is often very different. On reddit, whatever gets the most upvotes the fastest is the "best", which means a subreddit's content inevitably drifts towards things that are quick to view, easy to understand, and non-controversial. This drift can be managed with moderation, but never truly "solved" because it's inherent in the site's entire model.
The experiment I've been considering is one that basically adds another system to allow people that have been actively and positively involved in the community to take a more direct role in how it's moderated. It would be somewhat of a middle ground between being a regular user (where your downvote can be canceled out by anyone else's upvote) and a moderator (where your removal overrules all votes). Here's how it would work:
By scraping data from the subreddit, I would compile a number of statistics on the users here, including when they first participated in the subreddit, how often they post/comment, how well their posts/comments generally do, etc. From those statistics, derive a (large) list of users that are high-quality, regular participants in the community.
Then set up a bot that will perform moderation actions if the action receives enough "support" from these users. For example, perhaps each user begins with a weight of 1, and it takes a total weight of 5 to remove something. Then when 5 of the eligible users send a message to the bot requesting a particular post be removed, it takes the action. Other than removals, a few other actions could be supported through this as well, like adding the "[Misleading title]" tag that we use. Sending messages to a bot isn't very user-friendly, but unfortunately this is about the only way to add any functionality to reddit.
By using a weight system like this, users could also be adjusted over time (based on their participation statistics and correctness of past messages to the bot) to have more or less weight, so perhaps eventually someone's vote puts 4 weight towards performing an action instead of 1.
Overall, this system would allow users that are more involved in /r/Games to directly help keep the subreddit on track. It would also help deal with those edge-case posts that don't technically break the rules, but seem to be considered low-quality. With this system, if enough of the regular members of the subreddit agree that it doesn't belong, it could be removed.
What do you think? Is this an interesting idea that you'd be interested in at least trying out, or is it just overcomplicated and unnecessary?
And as always, any other feedback about the subreddit is welcome. | 0non-cybersec
| Reddit |
Can I use least square method to estimate a Box-Jenkins model?. <p>I have the known measurement: Noise $e(t)$, output $y(k)$, input $u(k)$.</p>
<p>I need to find the Box-Jenkins model:</p>
<p>$$y[k] = \frac{B(q)}{F(q)}u[k] + \frac{C(q)}{D(q)}e[k]$$</p>
<p>Where $B, F, C, D$ are polynomial expressions. Eg.:</p>
<p>$B(q) = 1 + b_1q^{-1} \dots b_nq^{-n}$</p>
<p>Often I have used least square $Ax=b$ to find the parameters inside the polynomial expressions. But in this case, it seems not to work for me.</p>
<p>Can I use least square(even if I fail to do that) or do I need to use another tool to find the parameters?</p>
<p>When I did least square on BJ-Model, I did in this way:</p>
<p>$$F(q)D(q)y[k] = B(q)D(q)u[k] + F(q)C(q)e[k]$$</p>
<p>Which didn't work because I cannot combine $F(q)D(q)$ or $B(q)D(q)$ for then solving each polynomial.</p>
<p><a href="https://i.stack.imgur.com/n9Ysw.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/n9Ysw.png" alt="enter image description here"></a></p>
| 0non-cybersec
| Stackexchange |
The New Utopians: Building a better future through science fiction.. | 0non-cybersec
| Reddit |
Delete multiple objects in django. <p>I need to select several objects to be deleted from my database in django using a webpage. There is no category to select from so I can't delete from all of them like that. Do I have to implement my own delete form and process it in django or does django have a way to already do this? As its implemented in the admin interface.</p>
| 0non-cybersec
| Stackexchange |
Air or water for SLI?. Currently I'm planning on buying another glorious gtx 1080.
So I look into my pcie slots and see a very little space, which means the two cards are gonna be very tight.
I'm wondering is that gap enough for air to get in so the fans could work or should I buy a hybrid card?
Currently I have a zotac amp extreme, I'm planning on moving the fat boy to the second x8 slot and have a EVGA ftw hybrid on the first x16 then OC it up to match the zotac amp extreme.
Also my PSU is a EVGA 850W GOLD, this should be enough for a core i7-6700k + x2 1080 right?
What is the better option, buying another zotac amp extreme or a evga ftw hybrid? | 0non-cybersec
| Reddit |
[Physics] How do frequency doubling crystals work?. I'm an undergraduate student working in a ultrafast laser research lab for the summer, and before I am allowed to use the frequency doubling crystal (it is a Beta-Barium Borate crystal and our laser has a gaussian beam with a 780nm fundamental center wavelength) I need to give a presentation on how it works.
I have been able to find quite a few papers on the math of how the higher harmonic frequencies are generated, but I am having trouble understanding what is physically happening inside the crystal.
Also, based on the math I have seen, why doesn't frequency doubling occur in all materials that light can travel through? Does the second order nonlinearity of the Polarization density vs. Electric field cancel out in most materials? I can not figure out the math of how that would work. Maybe a physical explanation would help me to understand this.
Thanks for your help | 0non-cybersec
| Reddit |
[USA]Left Lane Hog Gets Instant Justice. | 0non-cybersec
| Reddit |
Difference Between LDIFde.exe and CSVde.exe. <p>I'm having a hard time telling the functional difference between ldifde.exe and csvde.exe. The Microsoft curriculum feels unhelpful to me on distinguishing between situations where one should be used over the other. Does ldifde just supersede csvde? The TechNet pages imply that ldifde's functionality is a superset of csvde's. </p>
| 0non-cybersec
| Stackexchange |
How to show which column has the first amount and count columns to reach a sum amount. <p>I am working on a Google sheet that shows a sum that has been advanced to a customer and then shows the income per month the customer receives. We will retain 100% of the income until the amount that has been advanced is repaid.</p>
<p>I am trying to come up with two formulas for <a href="https://docs.google.com/spreadsheets/d/1JAf3ZduWliOjk2VaEV_vFTOGEsXOckyqml09ASZpmbQ/edit?usp=sharing" rel="nofollow noreferrer">this spreadsheet</a> which will work on each row:</p>
<ol>
<li>in column C that returns the first month that revenue is earned by the client and </li>
<li>in column D that returns the number of months over which the client revenues pay back the advance listed in column B.</li>
</ol>
<p>My research suggests that this is probably possible using an array function but I can't seem to find an example and don't understand the syntax enough to make it work.</p>
| 0non-cybersec
| Stackexchange |
Is multiple equation 0/1 linear integer programming with bounded integer weights NP-hard?. <p>Suppose we forget about optimizing and just want to find a feasible solution to a set of equations:</p>
<p>$$\sum_i w_{ij} x_i = W_j.$$</p>
<p>Here we are given $w_{ij}$ and $W_j$, and want to solve for $x_i$. Also $x_i$ are restricted to be 0/1 and we're promised that $w_{ij}$ and $W_j$ will be non-negative integer constants and we will have $w_{ij} \leq M$ for some universal constant $M$. The number of variables and equations can be arbitrary.</p>
<p>Is this an NP-complete problem? If we have just one or a universal bounded number of equations then the problem can be solved in polynomial time. Certainly if we can find a solution then we can verify it in polynomial time, so the problem is in NP. I was trying to find a reduction from something like 3-SAT in the general case but to no avail.</p>
| 0non-cybersec
| Stackexchange |
This copy of the Install OS X Yosemite application can’t be verified. It may have been corrupted or tampered with during downloading. <p>Sorry if my question is easy because I am new to Mac. </p>
<p>OS X Yosemite on my friend's Macbook Air was removed. Now when we start his Mac it has just Windows.</p>
<p>For installing Os x, I got the the installation file (13 Zip file) from third party web site and extracted that and it produced dmg file.</p>
<p>Now I have tried to made a bootable USB of OS X Yosemite with my Mac by using Disk Maker App. </p>
<p>Now when we turn on Mac of my friend while pressing <kbd>Alt</kbd> , I can see the icon to install Yosemite. So I click on that and continue first steps like language without error, but after 2 or 3 steps I received error</p>
<p>" This copy of the Install OS X Yosemite application can’t be verified. It may have been corrupted or tampered with during downloading."</p>
<p>Please help what is the problem and how i can solve that.</p>
| 0non-cybersec
| Stackexchange |
Le Sex Tank is nice, so is the struggle bus... But the pervertible is my vehicle of choice.. | 0non-cybersec
| Reddit |
I can not get ubuntu to completely down load, any suggestions. <p>I am new to the Ubuntu world and want to start learning, I paid the $15 and tried to download the 16.04.1 iso but i cant ever get a full download. Any suggestions?</p>
| 0non-cybersec
| Stackexchange |
SockPathMode - what is it?. <p>I have a plist installed on my system with the following in it:</p>
<pre><code><dict>
<key>SockPathMode</key>
<integer>438</integer>
</code></pre>
<p><code>man launchd.plist</code> tells me:</p>
<pre><code>SockPathMode <integer>
This optional key specifies the mode of the socket.
</code></pre>
<p>I haven't been able to find a list of modes and I haven't heard of 438 different modes either! If anyone can shed some light on what this key and value is really about I'd be very grateful.</p>
| 0non-cybersec
| Stackexchange |
Ethnographic analogy, the comparative method, and archaeological special pleading. [link](https://uncc.instructure.com/courses/84803/files/3947650/download?verifier=gq4TuIjseLitLHbNB36hn7WRwptzDnLuEG7G3gsb&wrap=1)
How comparable (no pun intended) do you feel are the comparative methodologies of biology and anthropology? Do you agree with Currie that Archeologists should not reject the practice of ethnographic analogy? | 0non-cybersec
| Reddit |
Can we solve this without cubic formula?. <p>I'm looking for an algebraic solution for $x$. </p>
<p>$$ \frac{x}{x+2} -3 = \frac{5x}{x^2-4}+x$$ <p></p>
<p>My first go at this involved converting this into an expression with a cubic numerator and $(x+2)(x-2)$ as the denominator. To find the roots, I then tried to divide each factor in the denominator into to cubic. No success. <P></p>
<p>I've converted this expression to:</p>
<p>$$ x(x-7)= (x+3)(x+2)(x-2)$$</p>
<p>which illustrates the futility of my first approach. There are no common factors. Can I solve this without invoking the cubic formula?</p>
<p><P></p>
<p>Edit: To clarify, the the Precalculus textbook calls for an algebraic and graphic solution. If you have an algebraic solution that would be accessible to a precalculus student, please provide it. </p>
| 0non-cybersec
| Stackexchange |
Android Implementations. | 0non-cybersec
| Reddit |
Windows 10 Lock Screen always puts monitor to sleep after 60 seconds. <p>I use Windows 10 at work, and for security reasons, I always lock my workstation when I leave the room for any reason. The problem is that my monitor is a Samsung 4K TV and the lock screen puts it to sleep after only 60 seconds, and after a few more minutes, it goes completely off, requiring me to use the remote control to turn it on again. I'm OK with using the remote to turn it on in the morning when I come in, but it's annoying to have to use it after a 10-15 minute conversation in another office.</p>
| 0non-cybersec
| Stackexchange |
Today i was at my friends birthday. The guest are awful people. I left. | 0non-cybersec
| Reddit |
PHP convert string to array. <p>How can I convert a string to an array? For instance, I have this string:</p>
<pre><code>$str = 'abcdef';
</code></pre>
<p>And I want to get:</p>
<pre><code>array(6) {
[0]=>
string(1) "a"
[1]=>
string(1) "b"
[2]=>
string(1) "c"
[3]=>
string(1) "d"
[4]=>
string(1) "e"
[5]=>
string(1) "f"
}
</code></pre>
| 0non-cybersec
| Stackexchange |
No running in the house!. | 0non-cybersec
| Reddit |
Best earmuff/safety glasses combo I've ever seen.. | 0non-cybersec
| Reddit |
Make reliable and fast server for Node.js chat based application. <p>Good day everyone.</p>
<p>We have a serious problem with server, Our dedicated server is not responding with high traffic, server response goes too slow whenever 2500 daily active users. Total users are more than 80000.</p>
<p>We have a chat based application for both iOS and Android and API's are written in Node.js and database used MongoDB.</p>
<p>Please suggest me how we can improve server speed? which server should I use? is single server is enough for this kind of daily active users? Our users are increasing day by day and we need to make it more reliable.</p>
<p>We are thinking to move to Amazon and should use load balancer but will it be a good idea?</p>
<p>Server Info:</p>
<hr>
<p>Commercial name
ADVANCE-LE - Intel Xeon W-2145 - 128GB DDR4 ECC 2666MHz - 2x SSD NVMe 960GB Datacenter Class Soft RAID</p>
<hr>
<p>System (OS):</p>
<hr>
<p>Cpanel 11.68 autoinstaller (CentOS 7 64bit)</p>
<hr>
| 0non-cybersec
| Stackexchange |
Delete a run in the experiment of mlflow from the UI so the run does not exist in backend store. <p>I found deleting a <code>run</code> only change the state from <code>active</code> to <code>deleted</code>, because the run is still visible in the UI if searching by <code>deleted</code>. </p>
<p>Is it possible to remove a <code>run</code> from the UI to save the space?
When removing a run, does the artifact correspond to the run is also removed?</p>
<p>If not, can the run be removed through rest call?</p>
| 0non-cybersec
| Stackexchange |
Just a small update on my mining area! Hope it will inspire some of you!. | 0non-cybersec
| Reddit |
Duplicate File Scanner. <p>I have a 15TB storage network, and I am down to about 2.5TB now (due to a large amount of duplicates). I have tried many scanners, but I have had little success, eventually they all crash due to the massive amounts of data. Is there any program that you know of that will be able to handle these large loads. I don't care about the platform that it runs on.</p>
<p>Thank you.</p>
| 0non-cybersec
| Stackexchange |
Reboots taking an hour due to fsck. <p>I'm running into an issue where reboots on two of my application servers are taking about an hour each time. I think that an fsck is happening each time but I cannot find much information in the logs to help debug.</p>
<p>In dmesg I'm seeing the following:</p>
<pre><code>[ 8.081130] IPv6: ADDRCONF(NETDEV_UP): eth1: link is not ready
[ 10.776403] tg3 0000:02:00.0 eth0: Link is up at 1000 Mbps, full duplex
[ 10.776409] tg3 0000:02:00.0 eth0: Flow control is off for TX and off for RX
[ 10.776413] tg3 0000:02:00.0 eth0: EEE is enabled
[ 10.776448] IPv6: ADDRCONF(NETDEV_CHANGE): eth0: link becomes ready
[ 11.771117] tg3 0000:02:00.1 eth1: Link is up at 1000 Mbps, full duplex
[ 11.771124] tg3 0000:02:00.1 eth1: Flow control is off for TX and off for RX
[ 11.771127] tg3 0000:02:00.1 eth1: EEE is enabled
[ 11.771173] IPv6: ADDRCONF(NETDEV_CHANGE): eth1: link becomes ready
[ 3171.529473] FS-Cache: Loaded
[ 3171.549333] RPC: Registered named UNIX socket transport module.
[ 3171.549334] RPC: Registered udp transport module.
[ 3171.549335] RPC: Registered tcp transport module.
[ 3171.549335] RPC: Registered tcp NFSv4.1 backchannel transport module.
[ 3171.566048] init: failsafe main process (1506) killed by TERM signal
[ 3171.576544] FS-Cache: Netfs 'nfs' registered for caching
[ 3171.685710] Installing knfsd (copyright (C) 1996 [email protected]).
[ 3171.871112] audit_printk_skb: 6 callbacks suppressed
</code></pre>
<p>which corresponds to the same amount of time by boot takes.</p>
<p>I'm wondering if anyone has ideas on where to start investigating?</p>
<p>The machines are:
Dell Poweredge R420
Ubuntu 14.04</p>
<p>lsblk:</p>
<pre><code>NAME MAJ:MIN RM SIZE RO TYPE MOUNTPOINT
sda 8:0 0 558.4G 0 disk
├─sda1 8:1 0 243M 0 part /boot
├─sda2 8:2 0 1K 0 part
└─sda5 8:5 0 558.1G 0 part
├─app2-root (dm-0) 252:0 0 542.2G 0 lvm /
└─app2-swap_1 (dm-1) 252:1 0 15.9G 0 lvm [SWAP]
sr0 11:0 1 1024M 0 rom
</code></pre>
<p>fstab:</p>
<pre><code>proc /proc proc nodev,noexec,nosuid 0 0
/dev/mapper/app2-root / ext4 errors=remount-ro 0 1
UUID=8a2c24e5-17ba-4992-82a1-68b9609b6983 /boot ext2 defaults 0 2
/dev/mapper/hd1app2-swap_1 none swap sw 0 0
</code></pre>
<h2>Edit</h2>
<p>This turned out to NOT be related to fsck at all. The issue was that there were Gigabytes of data in the /tmp which were cleared each time on boot. Note the gap between 11.771173 and 3171.529473 in the logs. Too bad dmesg doesn't display anything for useful for this particular scenario.</p>
| 0non-cybersec
| Stackexchange |
Best-Sellers Initial Rejections. | 0non-cybersec
| Reddit |
System read-only after upgrading Ubuntu Server 14.04 LTS to 16.04 LTS. <p>Today I upgraded my Ubuntu Server from 14.04 to 16.04 with <code>sudo do-release-upgrade</code>, which went smoothly until it rebooted and I logged in. Where I am met with the following message:</p>
<pre><code>Unable to setup logging. [Error 30] Read only file system:
'var/log/landspace/sysinfo.log'
run-parts: /etc/update-motd.d/50-landscape-sysinfo exited with return code 1
/usr/lib/ubuntu-release-upgrader/release-upgrade-motd: 39: /usr/lib/ubuntu-release-upgrader/release-upgrade-motd: cannot create /var/lib/ubuntu-release-upgrader/release-upgrader-available: Read-only file system
/usr/lib/update-notierfier/update-motd-fsck-at-reboot: 33: /usr/lib/update-notifier/update-motd-fsck-at-reboot: cannot create /usr/liv/update-notifier-fsck-at-reboot: Read-only file system
-bash: cannot create temp file for here-document: Read-only file system
</code></pre>
<p>So I have figured that the system is read-only and this a preventive measure if there is some sort of error/corruption of the file system or the disk?</p>
<p>So my questions is two folded:</p>
<ol>
<li>What did exactly happen?</li>
<li>How do I fix it?</li>
</ol>
<p>Don't know if this is relevant, but the OS is running of a USB-pen while there are 6 drives in Raid 5.</p>
<p>Thanks in advance!</p>
<p>Obviously I could just reinstall the OS and setup everything again, which would only take me a couple of hours, but I really want to learn and understand it instead :)</p>
<p><strong>Edit 1</strong></p>
<p>dmesg log added: <a href="http://pastebin.com/0bP8T4hH" rel="nofollow">http://pastebin.com/0bP8T4hH</a></p>
<p><strong>Edit 2</strong></p>
<p><code>/etc/fstab</code></p>
<pre><code># /etc/fstab: static file system information.
#
# Use 'blkid' to print the universally unique identifier for a
# device; this may be used with UUID= as a more robust way to name devices
# that works even if disks are added and removed. See fstab(5).
#
# <file system> <mount point> <type> <options> <dump> <pass>
# / was on /dev/sda1 during installation
/dev/md0 /mnt/rdisk ext4 user 0 0
</code></pre>
| 0non-cybersec
| Stackexchange |
What is the definition of Computer Science, and what is the Science within Computer Science?. <p>I am pursuing a BS in Computer Science, but I am at an early point of it, and I am pretty sure I will be happy with my choice given that it seems like an academically and career flexible education to pursue.</p>
<p>Having said that, there seems to be a variety of definitions about what Computer Science really is in respects to academia, the private-sector, and the actual "Science" in "Computer Science" I would love to have answers(Or shared pondering) as to the breadth of things an education in Computer Science can be applied to, and ultimately the variety of paths those within Computer Science have pursued.</p>
| 0non-cybersec
| Stackexchange |
Online compilers and repls - not one big security hole?. <p>There are plenty of compilers and REPL services on the web. For example: <a href="http://ide.fay-lang.org/" rel="noreferrer">Fay ide</a>.</p>
<p>I find that implementing some similar technology would be very interesting. But it seems like a major security hole. Am I wrong in thinking that exposing a compiler would be risky? An interpreter seems even worse.</p>
<p><strong>update:</strong> I can be a bit more specific. The kind service I'm thinking about hosting myself (a thought experiment at this stage) would be kind of close to the case of the Fay ide above. You take input from the user, process it and return it, potentially as runable javascript to the same or other users. Let's look at that example in particular.</p>
<p>The most obvious security concern that I see for this case, as I don't actually evaluate the code server side, would be for the users, as they would run code made by an 'unknown' author. The fact that they are allowed to read the code before running it should be a significant safeguard in this regard.</p>
<p>Although I also wonder if and when translation of code constitute a threat to the server? What kind of exploit vectors could be thought of in this context?</p>
<p><strong>Summary:</strong> </p>
<ol>
<li>Beyond what you can expect from any web server set up, and beyond the most obvious concerns (or perhaps some of those obvious concerns as well), how could one user compromise another?
-. How can the server application be hardened to ensure not being compromised?</li>
<li>What important questions have I neglected? ;)</li>
<li>I would like to try some experiments, and I have nearlyfreespeech in mind as a host. I could imagine that such use might be prohibited by their terms of use? Or perhaps I can trust them to be sure enough that they have sandboxed my account well enough. What should be my "minimum" safeguards, for trying stuff out and what safeguards would be possible with such limited hosting environment?</li>
</ol>
<p><strong>update2:</strong> I believe that compiling to javascript for client side evaluation or evaluating limited edsls would cover for most/all use cases I have in mind. I take it that this means that I really don't put the server side to a more prominent risk than <em>usual</em>. And I don't see how the user is being put into more risk than compared to going to a random link on jsFiddle.</p>
| 0non-cybersec
| Stackexchange |
LR-rule and Standard Young Tableau counting. <p>given that <span class="math-container">$s_\lambda s_\mu=\sum_{\nu} C_{\lambda \mu}^\nu s_\nu$</span> with <span class="math-container">$\vert \lambda\vert +\vert\mu \vert=\vert \nu\vert$</span>, why does apparently also hold that <span class="math-container">$$h(\lambda) h(\mu) {\vert \nu\vert \choose \vert \lambda \vert}=\sum_{\nu} C_{\lambda \mu}^\nu h(\nu)$$</span> where <span class="math-container">$h(\lambda)$</span> denotes the count of Standard Young Tableaux as given by the hooklength formula? A similar relation, but without the binomial factor, is well known for the semi-standard tableaux. This last one is easily understood by comparing monomials in the schur functions on both sides together with the relation between the weights of the monomials and semi-standard tableaux. For the relation above, I fail to grasp the link.<br>
Any hints?</p>
| 0non-cybersec
| Stackexchange |
Knocked into the derpzone. | 0non-cybersec
| Reddit |
Hunter or Hunted(Part Three). You can find part 2 [here](http://www.reddit.com/r/nosleep/comments/lwiao/hunter_or_huntedpart_deux/)
It had been a rough time for Thomas and the gang after the events of the last story. Thomas had some of the most horrible nightmares... most of them revolved around him being in the middle of the woods or some vast expanse of land, it would be night-time and he would be freezing cold. It was there he would encounter the *thing* and wake up terrified. The strange thing was the similarity between the dreams Thomas would have and the dreams the rest of the squad would talk about. Each person had a unique dream but the one factor shared amongst all these different dreams was the presence of the *thing*.
One night, roughly 3 weeks after the first "incident" was the second encounter with this entity. Thomas was on watch with another soldier. Which he didn't mind too much since he hadn't been sleeping well anyways. Thomas and the other soldier talked awhile about their dreams and how odd it was that they had never found any signs of the soldier that went missing. For the most of the night it was quiet and Thomas just sat there smoking a cig looking out into the darkness and listening for any signs of movement.
The night passed without a hitch until about 2am when Thomas heard the other soldier say "No way"(Thomas hadn't been paying attention and didn't notice that the other soldier had stopped scanning the horizon with the NV scope and instead was focused on one particular area). Thomas replied inquisitively "What?" to which the other soldier just said "Take a look". Thomas raised up his rifle to use his own scope and quickly was able to see what looked like a soldier on the side of the mountain across from where their base was located.
Unable to make anymore detail (because of the distance) Thomas went to get a sniper rifle that had a much better and much more powerful scope attached. He was making the return trip when he heard the other soldier start "whisper-yelling" his name, Thomas quickened his pace and made it back to the watch post. Thomas quickly set the rifle up on the sandbags and asked again "What is it?" but his question was soon answered. When he focused the rifle on the area where he had seen "the soldier" he saw it again, except this time the eyes that haunted his dreams were there peering back... red eyes seeming to seep out from underneath this shell of a soldier.
Thomas sat there watching this thing for what he said "seemed like an eternity" before it began to move. It did not travel up or down the mountain, but to the side. Thomas watched it all the way, but just before leaving eyesight and moving to the other side of the mountain the *thing* turned, stared right at him and waived... Thomas shuddered and took his eyes off his scope. When he peered back through, the thing was gone. The rest of the night passed without incident and Thomas was put at ease. That is until they found the body of the missing soldier on the other side of the mountain the next day. No eyes, no bones, no organs... just a shell... | 0non-cybersec
| Reddit |
Trying to install Eclipse or Codeblock. <p>I am new to using Ubuntu, and so in need of some help getting my development box up and running. I am trying to develop C++ code, but when I try to install CodeBlock IDE or Eclipse indigo, I run into some wall. </p>
<p>When I attempt to use Ubuntu Software to install Eclipse Indigo, I get an error about my internet connection "Failed to download Package File, Check your internet connection"(I use wireless and have no problems using the internet). When I try to install Codeblock, I get the same error. Is there some configuration issue I have not handled here? I am running Ubuntu on VMWare. Any help will be very much appreciated. </p>
| 0non-cybersec
| Stackexchange |
Regarding a current frontpage post that makes me sick.. There's a post on the front page about a dude and his girlfriend accidentally walking into a brothel "spa" in Bangkok. The comments are filled with jokes about the price and serious discussion about how awesome Thailand is for its affordable hookers.
Well no shit they're affordable. The bodies of women and children are pretty cheap among the poor in Thailand, you think they just waltzed into Bangkok from whatever province they came from to fulfill their lifelong dream of jacking off fat, middle-aged white and Japanese guys for an "affordable" price? Get a fucking clue, if you even care...
**Edit:** For those constantly bringing up those prostitutes who actually *are* living their dream as prostitutes, [this](http://www.prostitutionresearch.com/pdf/Prostitutionin9Countries.pdf) article paint a much bleaker picture for the vast majority of sex workers. | 0non-cybersec
| Reddit |
Which bibliography entry type should I use for a document defining a European norm?. <p>I'm currently doing a research internship in the Photovoltaics laboratory of a university. I am writing my report, and in my bibliography, I would like to cite a document that is an International Standard for defining how to make measurements on photovoltaic systems.</p>
<p>More specifically, it's the international standard IEC 61724:1998 : <em>Photovoltaic system performance monitoring - Guidelines for measurement, data exchange and analysis</em>. <a href="https://webstore.iec.ch/preview/info_iec61724%7Bed1.0%7Den.pdf" rel="nofollow">Here is an excerpt of the document</a>. (unfortunately the full-text document is not available without paying)</p>
<p>Now, my question is: <strong>Which BiblateX bibliography entry type should I use to cite this document? Article, Technical Report, Reference, Patent, ... ?</strong></p>
<p>Is there a bibliography entry type that is dedicated to this kind of documents (international standards)?</p>
| 0non-cybersec
| Stackexchange |
5 weeks of tracking my calories and exercise, and I've lost 21.4 pounds! (113.4 total!). I've been recording my diet and exercise for 5 weeks now, and I've dropped 21.4 pounds so far! From my heaviest weight, I've lost a total of 113.4 pounds!
The last couple weeks I've completely cut out carbs and have tried to do 30-60 minutes of cardio every day. I've had a little more free time after work than usual, so I was able to get more creative at dinner time. It really hasn't been too bad, although I still would love to binge on some pizza, but that will never change.
Here was my diet and exercise for the week: https://www.youtube.com/watch?v=sM5TeSgK-ek
This sub has been amazing over the last month, and I would love any questions or suggestions! | 0non-cybersec
| Reddit |
Stored procedure with default parameters. <p>I am trying to create a stored procedure based on a query I wrote with parameters that are predefined.</p>
<p>When restructuring to a create stored procedure and I execute the stored procedure it states that the parameters were not supplied. Can anyone tell me why? </p>
<p>I know I have missed something essential but after messing about with the code I have reached the point of needing some help from the experts.</p>
<p>This is my code (shortened):</p>
<pre><code>Alter Procedure [Test]
@StartDate AS varchar(6),
@EndDate AS varchar(6)
AS
Set @StartDate = '201620' --Define start YearWeek
Set @EndDate = (SELECT CAST(DATEPART(YEAR,getdate()) AS varchar(4)) + CAST(DATEPART(WEEK,getdate())-1 AS varchar(2)))
SELECT
*
FROM
(SELECT DISTINCT
[YEAR], [WeekOfYear]
FROM
[dbo].[DimDate]
WHERE
[Year] + [WeekOfYear] BETWEEN @StartDate AND @EndDate) dimd
LEFT JOIN
[Schema].[Table1] qad ON (qad.[Year] + qad.[Week of the Year]) = (dimd.[Year] + dimd.WeekOfYear)
</code></pre>
<p>When I run the procedure I get:</p>
<blockquote>
<p>Msg 201, Level 16, State 4, Procedure test, Line 0<br>
Procedure or function 'test' expects parameter '@StartDate', which was not
supplied.</p>
</blockquote>
<p>Thanks in advance.</p>
| 0non-cybersec
| Stackexchange |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.