text
stringlengths 3
1.74M
| label
class label 2
classes | source
stringclasses 3
values |
|---|---|---|
If $N\lhd G$ then $n_p(G/N) \leq n_p(G)$.. <p>I want to prove the above statement where $N$ is a normal subgroup of $G$, and $n_p(G) = \vert Syl_p(G)\vert$, i.e. the number of Sylow $p$-subgroups of $G$.</p>
<p>I am quite stuck on this problem. My initial thought was to define a map from the Sylow $p$-subgroups of $G$ to those of $G/N$ and then show that the map is surjective, but this turns into a gargantuan mess with a ton of Lagrange cardinality and divisibility arguments and such, and does not quite get me what I want to show anyway even with a substantial amount of hand-waving.</p>
<p>Any suggestions? I also naturally thought about trying to prove it indirectly by way of contradiction, though I really am not certain how to even begin to go about it that way.</p>
| 0non-cybersec
| Stackexchange |
> Find the range of $f(x)=\frac{\sin^2x+\sin x-1}{\sin^2x-\sin x+2}$. <blockquote>
<p>Find the range of the function $$f(x)=\frac{\sin^2x+\sin x-1}{\sin^2x-\sin x+2}$$</p>
</blockquote>
<p>I know how to find ranges of rational expressions when variable has its domain $\mathbb{R}$..but I can't solve the following problem where $\sin x$ has range .. </p>
| 0non-cybersec
| Stackexchange |
MRW I see my SO naked after a long week on the road.. | 0non-cybersec
| Reddit |
Explain this paradox. <p>Can someone help me explain this paradox please.<br>
A simple harmonic oscillator $ma=-kx$ is a system that oscillates in one dimension. But the text book says one-dimensional system can't oscillate. Why is that?? Thank you in advance.</p>
| 0non-cybersec
| Stackexchange |
A Darth Maul series/movie would definitely have potential. What would your hopes be?. | 0non-cybersec
| Reddit |
Phase Transitions in NP Hard Problems. <p>SAT Problems have a <a href="http://arxiv.org/pdf/cs/0005024" title="Paper Reference"> phase transition </a> that depends on the ratio $r$ of variables to clauses. Below $r$, SAT problems are solvable quickly; above, they become difficult. The same is true of NP Complete problems in general, AFAIK.</p>
<p>Suppose I have a hard instance of an NP Hard problem, say HAM CYCLE and I reduce the problem down to SAT. <i> Can you say anything about the hardness of the SAT instance? Will it be easy or hard? </i></p>
<p>Intuitively, it seems the SAT Problem reduced to should be hard, but is there a proof? </p>
| 0non-cybersec
| Stackexchange |
Secrets of The Viking Sword (2012). | 0non-cybersec
| Reddit |
Can I use an enum as a property in Objective C. <p>I saw it is customed to use a boolean property as a flag. something like that:</p>
<pre><code>@property (nonatomic) BOOL commaAlreadyIntroduced;
</code></pre>
<p>I need something like that but with at least 3 or 4 states.</p>
<p>Can I use an enum?</p>
<p>The standalone enum should look like:</p>
<pre><code>typedef enum stackState{
empty, oneOperand, operandAndOperator, fullStack
}stackState;
</code></pre>
| 0non-cybersec
| Stackexchange |
Is $(0,0)$ a solution to $x^y-y^x=0$?. <p>I am trying to determine if $(0,0)$ a solution to $x^y-y^x=0$. My hunch is that it is undefined since $0^0$ is an indeterminate form. To attempt to prove this, I have tried the usual "different paths give different limits" trick with</p>
<p>$(x,ax^n)\rightarrow(0,0)$</p>
<p>$(x,\sin(x))\rightarrow(0,0)$</p>
<p>$(x,e^x-1)\rightarrow(0,0)$</p>
<p>None of the above accomplished my goal. </p>
<p>I did find this older post (<a href="https://math.stackexchange.com/questions/9505/xy-yx-for-integers-x-and-y">$x^y = y^x$ for integers $x$ and $y$</a>) which included an answer by "Yuval Filmus" which states $y=x=0$ is $\it{trivially}$ a solution. He accomplished this by defining $0^0$ to some value and moves on. I would like to see something more rigorous, if it exists.</p>
<p>Any hints on how to proceed?</p>
<p>Edited for wording.</p>
<p>Edit: Stefan Smith confirms my suspicion that the comment of Yuval Filmus cannot be made rigorous. </p>
| 0non-cybersec
| Stackexchange |
A question about the Count of Monte Cristo. SPOILERS. I am about half way through the book, I remember the chapter on the story about Bertuccio and how he was wrongly accused of being the murder of the jeweler. And eventually he was saved because Abbe Busoni (disguised as the Count himself, who gave the diamond to Caderousse after he escaped and found the treasure) showed up and cleared his name. Abbe Busoni then recommended Bertuccio to the Count (basically recommended himself). And when Bertuccio finally met the Count, how did he not recognize him and be like "wait, werent you Abbe Busoni?!"
The only logical answer I could think of was that the Count sent somebody else disguised as Abbe Busoni to meet Bertuccio, but that explanation was never mentioned in the book.
Can somebody explain or is this another minor plot hole of the book? | 0non-cybersec
| Reddit |
Computer starts but not the monitor. <p>My friend's computer powers up but monitor does not. The Monitor power button just blinks green light.
I replaced the graphics card, RAM and Hard disk but same happens. What could be wrong here?</p>
| 0non-cybersec
| Stackexchange |
At 27 years old I’ve summed the courage to put my self out there. Hit me with your best shot. | 0non-cybersec
| Reddit |
M'lady. | 0non-cybersec
| Reddit |
Boolean logic with BITs and Booleans in SQL Server. <p>How can I mix boolean logic with bitwise and/or operators in SQL Server, specifically SQL Azure Database and/or SQL Server 2016?</p>
<p>To demonstrate what I'm trying to do, consider the following script:</p>
<pre><code>DECLARE @String varchar(2000) = 'asdf'
DECLARE @Flag1 bit = 1
DECLARE @Flag2 bit = 0
DECLARE @Data Table
(
Value bit
)
INSERT INTO @Data VALUES (@Flag1 | @Flag2)
--INSERT INTO @Data VALUES ((@Flag1 | @String LIKE '%qwerty%') & @Flag2)
SELECT * FROM @Data
</code></pre>
<p>The script works fine as-is but the moment you uncomment out that second <code>INSERT</code>, all hell breaks loose. I understand this is invalid syntax because I'm mixing boolean logic with bitwise operators. But what is the right way to get this logic in there? Without going crazy with <code>CASE WHEN</code> statements, is there some way to do this?</p>
| 0non-cybersec
| Stackexchange |
What the hell is a front end framework?. I am seeing posts about [clearwater](https://github.com/clearwater-rb/clearwater) for ruby. I have no idea how this communicates with the browser. Is there some sort of javascript client / server (JSON) mediated communication to update the pages DOM directly? I presume just describing this as a front end framework is enough explanation as to what it is. /r/ruby is just too harsh with simple questions like that. | 0non-cybersec
| Reddit |
When my first ever post got downvoted. | 0non-cybersec
| Reddit |
I just finished watching the Texas Chainsaw Massacre series. Thought I'd do a piece around it, and I thought you guys might appreciate it.. | 0non-cybersec
| Reddit |
How in the fuck are college textbooks not easily and widely available in ebook format?. It seems as though most books aren't even published in ebook form. Does anyone else find this insane? It's almost 2013, we're supposed to have hover boards by now, and we can't even get books for a lightweight portable device rather than carry massive stacks of text around school. It involves almost zero work. Publishers obviously poses full digital copies of anything published, all they need to do is convert to epub or whatever and distribute it digitally.
Thank god for this ~~unbelievably shitty scam~~ college education system. | 0non-cybersec
| Reddit |
Cursed_sign language. | 0non-cybersec
| Reddit |
Do all modern NICs support ethernet frames with VLAN tags?. <p>I read from this site <a href="http://www.javvin.com/protocolVLAN.html" rel="nofollow noreferrer">http://www.javvin.com/protocolVLAN.html</a>:</p>
<blockquote>
<p>Many NICs for PCs and printers are not 802.1Q-compliant. If they receive a tagged frame, they will not understand the VLAN tag and will drop the frame. Also, the maximum legal Ethernet frame size for tagged frames was increased in 802.1Q (and its companion, 802.3ac) from 1,518 to 1,522 bytes. This could cause network interface cards and older switches to drop tagged frames as "oversized."</p>
</blockquote>
<p>My question is if this type of problem pertains to antiquated NICs or if computers/printers bought within the past few years would certainly support "oversized" VLAN frames? I am planning to segregate our office network into VLANs (to optimize VoIP traffic) but I don't know if that means certain legacy devices will suddenly lose connectivity due to increased frame size.</p>
<p>Also, is there a way to test that a given device will support 802.1Q other than simply plugging it in and trying? (Note: I am familiar with Wireshark and could read ethernet frames off the wire if necessary.)</p>
| 0non-cybersec
| Stackexchange |
Topic models: cross validation with loglikelihood or perplexity. <p>I'm clustering documents using topic modeling. I need to come up with the optimal topic numbers. So, I decided to do ten fold cross validation with topics 10, 20, ...60.</p>
<p>I have divided my corpus into ten batches and set aside one batch for a holdout set. I have ran latent dirichlet allocation (LDA) using nine batches (total 180 documents) with topics 10 to 60. Now, I have to calculate perplexity or log likelihood for the holdout set. </p>
<p>I found <a href="https://stats.stackexchange.com/questions/25113/the-input-parameters-for-using-latent-dirichlet-allocation">this code</a> from one of CV's discussion sessions. I really don't understand several lines of codes below. I have dtm matrix using the holdout set (20 documents). But I don't know how to calculate the perplexity or log likelihood of this holdout set. </p>
<hr>
<p>Questions: </p>
<ol>
<li><p>Can anybody explain to me what seq(2, 100, by =1) mean here? Also, what AssociatedPress[21:30] mean? What function(k) is doing here? </p>
<pre><code>best.model <- lapply(seq(2, 100, by=1), function(k){ LDA(AssociatedPress[21:30,], k) })
</code></pre></li>
<li><p>If I want to calculate perplexity or log likelihood of the holdout set called dtm, is there better code? I know there are <code>perplexity()</code> and <code>logLik()</code> functions but since I'm new I can not figure out how to implement it with my holdout matrix, called dtm. </p></li>
<li><p>How can I do ten fold cross validation with my corpus, containing 200 documents? Is there existing code that I can invoke? I found <code>caret</code> for this purpose, but again cannot figure that out either.</p></li>
</ol>
| 0non-cybersec
| Stackexchange |
India v Pakistan - 15th February, 3:30 GMT. | 0non-cybersec
| Reddit |
How does usage of natural psyhodelics during pregnancy affect the child? Were there any conducted studies that you know of?. | 0non-cybersec
| Reddit |
Is The Marine (2006) starring John Cena considered a "so bad it's good" cult classic? Because it should be.. For years I avoided and dismissed it as likely some boring lifeless waste of time. But I watched it tonight and I loved every second of it. The acting and dialogue are obviously terrible but I had no idea how batshit insane and over the top this flick was. Am I nuts for appreciating this as an underrated gloriously stupid good time movie? | 0non-cybersec
| Reddit |
There are currently only 4 QB/WR combos that have played together for more than 4 years.. * Matt Ryan/Julio Jones
* Aaron Rodgers/Davante Adams
* Russell Wilson/Tyler Lockett
* Andy Dalton/AJ Green
If you make it 4 or more years, you add:
* Drew Brees/Michael Thomas
* Matthew Stafford/Marvin Jones Jr. | 0non-cybersec
| Reddit |
Homogeneous linear DE with constant coefficients. <p>Here are some question from book, I have to answer with "yes" or "no":</p>
<p>a) $\phi(x)=x^{2}+3$ is solution of some homogeneous linear DE with constant coefficiens,</p>
<p>b) $\phi(x)=\frac{1}{2+x^{2}}$ is solution of some homogeneous linear DE with constant coefficiens.</p>
<p>Answer on a) should be "yes" (I found DE y'''=0) and "no" on b). Is it ok?</p>
| 0non-cybersec
| Stackexchange |
Solve this logarithmic equation: $2^{2-\ln x}+2^{2+\ln x}=8$. <p>Solve this logarithmic equation: $2^{2-\ln x}+2^{2+\ln x}=8$. I thought to write
$$\dfrac{2^2}{2^{\ln(x)}} + 2^2 \cdot 2^{\ln(x)} = 2^3 \implies \dfrac{2^2 + 2^2 \cdot \left(2^{\ln(x)}\right)^2}{2^{\ln(x)}} = 2^3$$
What should I do else?</p>
| 0non-cybersec
| Stackexchange |
Any of you guys ever thought about going back for a CS PhD focusing in telecommunications/networking after many years in the field?. I know this is a field where a large portion of technologies have been driven by vendors and standards bodies, but it's also important to note there are A LOT of important research and university scholars which have allowed us to get to this point.
Modern packet switching theory, which ultimately led to the modern internet was first thought up by a MIT student. Past that, the early internet (before it became a market-driven technology) was pretty much solely funded by college/government researchers. Even past that, a lot of the big and long-lasting protocols of our day were invented by great researchers, not necessarily by vendors.
Sometimes I'm configuring a switch or troubleshooting a link and I think to myself "I'm nothing special.... millions of people do this. I'm just a mechanic. I don't want be a mechanic, I want to be the guy who creates the next generation of combustion engines"
Of course, that may be a drastic comparison, but you get the point.
It's not really about career advancement. In most cases I'm sure this would be a lateral move at best, and possibly a pay cut. It's more about purpose than career advancement.
This is not something I've ever seriously considered, but I would just be sort of interested to hear the community's thoughts on the subject. Have any of you folks ever given it a second thought?
EDIT: Sorry about saying "guys" in the title... In the event one of the 4 female net engineers in the world see this post, I apologize for my unintentional sexism. | 1cybersec
| Reddit |
Isomorphic Affine Schemes. <p>If $f:A\to B$ is a homomorphism of rings such that $f':\text{spec} B \to \text{spec} A$ is a homeomorphism does it follows that the spectra are isomorphic as schemes? </p>
<p>I was able to reduce this problem to trying to show that given a prime $\mathfrak{q}$ in $B$ and setting $\mathfrak{p} = f^{-1} \mathfrak{q}$, that the map $A_{\mathfrak{p}} \to B_{\mathfrak{q}}$ is an isomorphism of rings. But I do not see why this has to be true, even in the special case when $B = A$ modulo its nilradical. </p>
| 0non-cybersec
| Stackexchange |
Turns out 19th century New York City was a pretty vile place to live, with a sanitation-related death rate to rival medieval London.. | 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 |
John Stamos Arrested for DUI, Hospitalized in Beverly Hills. | 0non-cybersec
| Reddit |
I recently found out that my uncle abused my mum. My granddad passed away a couple of months ago. As a family, it was something we were expecting, he had been very ill for a long time and my mum, who was a doctor, now retired, had been spending a lot of her time traveling to be with him and help my grandmother take care of him.
My mother was obviously under a lot of stress and spending more time with her family than she had been in years and I think that's why she finally chose to tell me that my uncle, her brother, had sexually abused her. I initially thought she meant when they were children but then later found out that it continued throughout her teenage years as well.
I just don't really know what to do about this, or if there's anything I can do or should be doing. I don't want to ask my mum loads of questions about it because it's obviously a very traumatic thing for her to discuss. I did ask her if she wanted to go to the police about it but she can't bring herself to do that because she thinks it would devastate my grandmother. I'm really worried though, I don't know what the statistics are on abusers but if he has done it to her is it not likley that he will do it to someone else? He has a daughter and I'm really worried about her but we live really far away so I feel like there's nothing I can do.
Also, I want to be supportive of my mum but I don't know how to talk to her about this or if there's anything I can do or say. Could anyone maybe point me in the direction of some resources?
And finally, I am filled with rage and anger and disgust at my uncle, I don't even consider him my uncle anymore. Having to see him at my granddad's funeral and act like nothing was wrong crushed me. I don't know how to handle it because I never want to see his face again but I don't want my mum to get upset, she will blame herself for breaking up the family if I say I never want to see him again.
Thank you for reading this, I would really welcome any suggestions or advice. I'm just not sure where else I can discuss this because obviously I don't want betray my mum's trust by talking to people I know about this without her consent.
| 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 |
After California got rid of the personal belief exemption for vaccinations, medical exemptions for vaccinations went up, suggesting that the Senate bill isn’t as strong as hoped, since anti-vaxxers were still able to find doctors willing to provide a medical exemption instead, as reported in JAMA.. | 0non-cybersec
| Reddit |
A comprehensive overview of patching security vulnerabilities & mitigating DDoS risk in today’s increasingly-complex IoT world. | 1cybersec
| Reddit |
Cache.getOrElse on Futures in Playframework. <p>What is the correct way to cache the result of future in playframework. E.g.:</p>
<pre><code>val userGravatar: Future[JsValue] = RemoteGravatarService.get(user.id, user.email)
object RemoveGravatarService {
def get(userId: String, email: String): Future[JsValue] = {
Cache.getOrElse("gravatar-for-$userId", 1.hour) {
WS.url("gravatar.com/email=$email").get().asJson
}
}
}
</code></pre>
<p>We don't want to ask (this fictional) "Gravatar" every time, because it doesn't change <em>that</em> often. But we need som userGravatar info quite often locally.</p>
<p>Here we cache the future itself, but actually we only want to cache the result of the future. Is there a convenient/correct way to do this in play?</p>
| 0non-cybersec
| Stackexchange |
Rename a tile in the Start screen. <p>How can I rename a tile on the Start screen?</p>
<p><img src="https://i.stack.imgur.com/Y2QPu.jpg" alt="enter image description here"></p>
<p>For example, how can I change "eclipse" to "Eclipse Juno"?</p>
| 0non-cybersec
| Stackexchange |
"Permission Denied" using cygwin in Windows. <p><em><strong>Background:</em></strong>
I am trying to write a [.bat] file so I can double click it and a bash script will get invoked. The bash script will start up a few windows GUI apps to monitor GPU/CPU temperatures. I just did a fresh install of cygwin v1.7.7-1 (downloaded today) and windows 7.</p>
<p><em><strong>Code:</em></strong>
monitor-temps.bat:</p>
<pre><code>C:\cygwin\bin\bash.exe ~/bin/monitor-temps.bash
pause
</code></pre>
<p><em><strong>Code:</em></strong>
monitor-temps.bash:</p>
<pre><code>#!/usr/bin/bash
"/cygdrive/c/Users/michael/Desktop/apps_and_drivers/GPU-Z.0.4.8.exe" &
</code></pre>
<p><em><strong>Output:</em></strong>
After I double click the [.bat] file, I get a:</p>
<pre><code>C:\Users\michael\Desktop>C:\cygwin\bin\bash.exe ~/bin/monitor-temps.bash
C:\Users\michael\Desktop>pause
Press any key to continue . . . /home/michael/bin/monitor-temps.bash: line 2: /cygdrive/c/Users/michael/Desktop/apps_and_drivers/GPU-Z.0.4.8.exe: Permission denied
</code></pre>
<p>I still get the same permissions error when I cd to the directory and manually execute the application.</p>
<p><em><strong>Permissions:</em></strong>
From my experience with permission problems in Linux, everything looks good because I am the user I think I am, and the file has the expected permissions:</p>
<pre><code>$ whoami
michael
$ ls -l GPU*
-rwx------+ 1 michael None 890720 2010-12-01 19:23 GPU-Z.0.4.8.exe
</code></pre>
<p><em><strong>Question:</em></strong>
Does anyone know how to fix this? Am I missing something?</p>
| 0non-cybersec
| Stackexchange |
Can we efficiently factor $n$ given that $n=pq$ where $p,q$ are primes satisfying $p=a^2+b^2, q=2ab+1$ for some $a,b$. <p>Suppose we're given a particular number $n \in \mathbb{N}$. </p>
<p>We're also given that $n=pq$ where $p,q$ are unknown primes satisfying
$$
p=a^2+b^2
$$ and
$$
q=2ab+1
$$
for some $a,b$.</p>
<p>Is there an efficient way to factor $n$ given this extra information?</p>
<p>(This is motivated by <a href="https://crypto.stackexchange.com/questions/59921/rsa-factorization-for-special-primes-p-and-q/59962">a question from the cryptography stack</a>.)</p>
| 0non-cybersec
| Stackexchange |
I had completely given up hope! Finally got one on the last day!. | 0non-cybersec
| Reddit |
Router Issue: Multiple wi-fi connections crashes the router. <p>Occasionally my Linksys router will drop all Wi-Fi connections if there are multiple wi-fi connections on the router. Sometimes the whole router will even crash when there are multiple wi-fi connections going to the same router.</p>
<p>For example, if i have my laptop using the wi-fi connection from my router, and my friend starts up his laptop to connect to the router via wi-fi, both our wi-fi connections will drop, and occasionally the whole router crashes.</p>
<p>I was wondering if this is a known issue and/or if there are any router settings I should take a look at. I had originally thought i just had a bad router, but after talking to one of my friends, he is having the same issue.</p>
<p>I can provide specific router info if need be (I am away from Home and do not have the the info right now).</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 |
Microsoft about to offer users something that current cable and satellite boxes simply can’t: sports delivered at 60 frames per second!. | 0non-cybersec
| Reddit |
How do I turn off the "Reader" button in Mobile Safari?. <p>I never use the "Reader" feature in iOS 5's Mobile Safari, and the button for it sits there in the address bar just being a nuisance when I want to see or edit the URL in the address box. How do I turn it off?</p>
| 0non-cybersec
| Stackexchange |
Ok which one of you is this (spotted at pax au). | 0non-cybersec
| Reddit |
TIL that the smell of the air after a storm is caused by Geosmin: A chemical released by dead soil bacteria. Humans are hyper sensitive to it, capable of detecting at a concentration of 5 parts per trillion. It's theorised in our evolutionary past this helped us seek out water.. | 0non-cybersec
| Reddit |
'One Day at a Time' Saved From Cancellation by Pop TV. | 0non-cybersec
| Reddit |
The Poverty of Sense-data. I feel like it'd be lots of fun to get a good ol' empiricism v. rationalism debate going so I'm going to put down a bunch of problems with empiricism because I don't see enough challenges to it on this sub. Some rough definitions (which are super primitive and someone more learned than me can elaborate on them hopefully.)
**Empiricism**: All knowledge is derived from sensory experience. The only justification is a posteriori justification.
**Rationalism**: There is knowledge which is not sensory; it is justified a priori.
1. How do we justify mathematical propositions? "The set of all sequences of finite length is the same size as the set of natural numbers" - what sense-data justifies the truth of this proposition?
2. How do we know logic?
3. How do we account for the apparent necessity/empirical independence of mathematics and logic? Could we wake up in a world where 1+1 is not 2 or where contradictions are true? (the notion of conceivability probably plays a role here)
4. The problem of induction of course: is there a possible a posteriori justification for the proposition "the future will be similar to the past"? Reminder that appeal to the past success of induction begs the question, namely that you assume that since past futures resembled past pasts then the future now will resemble the past now.
Personally I think that 1 is a knock-down argument against empiricism. I have no idea how you could justify propositions about infinity for example by appealing to a universe which we can only ever have a finite understanding of (and is arguably a finite thing). Even if you deny the infinite you still have to contend with numbers which dwarf the magnitude of subatomic particulars in the universe (and this is just dealing with arithmetic.)
Moving away from the infinite there are still part of mathematics with *no* empirical interpretation - set theory, topology, fractals, etc. The argument that I've seen that "math is just a tool to understand the empirical world" just betrays a lack of ability to discern between the application of mathematics in physics and the study of mathematics qua mathematics.
We can try formalism but we would become dependent on logic, not to mention answering questions of why these ultimately arbitrary axiom schemes made up by mathematicians are applicable to the physical world. Conceptualism and Platonism give us a priori knowledge and I don't know how you'd avoid that conclusion.
I'm aware that there is the huge problem with rationalism about what we're to make of a priori knowledge, but I don't really have any ideas here - again, hopefully someone will be capable of presenting a way to make sense of it.
| 0non-cybersec
| Reddit |
Remove array item by index (not numeric index but string). <p>I have the following JavaScript array :</p>
<pre><code>[#ad: Array[0]]
#ad: Array[0]
#image_upload: Array[0]
13b7afb8b11644e17569bd2efb571b10: "This is an error"
69553926a7783c27f7c18eff55cbd429: "Yet another error"
d3042d83b81e01d5c2b8bbe507f0d709: "Another error"
Array[0]
#image_url: Array[0]
2b4a9847e26368312704b8849de9247a: "URL error"
</code></pre>
<p>This is the array representation in my browser console.</p>
<p>Unfortunatelly I cannot find a way to remove the elements of the <code>$errors['#ad']['#image_upload']</code> based on the <code>md5</code> keys.</p>
<p>In example, let's say I like to remove the message <code>"Yet another error"</code> by using the corresponding md5 key <code>69553926a7783c27f7c18eff55cbd429</code>.</p>
<p>I have try the method <code>indexOf</code> but this is not the correct one, as return the index of the value in the array. What I need is the opposite, I need to remove the value directly by using the index of the value.</p>
<p>How can I perform this task ? Any idea ?</p>
| 0non-cybersec
| Stackexchange |
How to get console output in Visual Studio 2012 Unit Tests. <p>I have a managed C++ unit test in VS 2012. The test runs fine and I can
verify that a loop with multiple <code>cout</code> calls is executed.</p>
<p>However when I look at the test explorer the test is marked as passed
but there is no hyper link for the output as I am used to for c#
projects.</p>
<p>The code at the end of my test is</p>
<pre><code>for (int i = 0; i < 4; i++)
{
cout << parameters[i];
cout << endl;
}
</code></pre>
<p>which I can verify runs as I step through
it in the debugger. I have also tried with
<code>cerr</code> but no difference.</p>
| 0non-cybersec
| Stackexchange |
Display Adobe pdf inside a div. <p>I have a pdf file that the user has to see and click on the "I agree" button.
How do you display a pdf inside a div?</p>
| 0non-cybersec
| Stackexchange |
Updating the state via eventHandler. <p>The piece of code below is a two-way binding in <strong>ReactJS</strong>, whereas one types, the text and input values update simultaneously. </p>
<p>Here's the Component loop: </p>
<pre><code>if (this.state.personState){
persons = (
<div>
{this.state.person.map( (person, index) =>{
return
<Person
click = {()=>this.deletePerson(index)}
name = {person.name}
age = {person.age}
key = {person.id}
changed = { (event)=>this.changeNameHandler(event, person.id)} >
</Person>
})}
</div>
)
</code></pre>
<p>The function that handles the event</p>
<pre><code>changeNameHandler = (event, id) => {
const personIndex = this.state.person.findIndex(person => person === id)
// making a copy and not manipulating the original reference
const personcpy = { ...this.state.person[personIndex] }
// assign the value of the event target
personcpy.name = event.target.value;
// making a copy of the state to update the dom
const persons = [...this.state.person]
// updating...
persons[personIndex] = personcpy
// state update
this.setState({ persons : persons })
}
</code></pre>
<p>The Javascript Object itself</p>
<pre><code>state = {
person : [
{id:'12121', name:"Jimmy", age:12},
{id:'121s', name:"Jack", age:15},
{id:'23232a', name:"pouya", age:27}
]
}
</code></pre>
<p>The component codes</p>
<pre><code>const Person = (props) => {
return (
<div className="Person" >
<p onClick={props.click}>I'm {props.name} and I'm {props.age} years old</p>
<input onChange={props.changed} value={props.name} />
<h1 >{props.name}</h1>
</div>
)
}
</code></pre>
<p>I'm aware that <strong>findIndex()</strong> returns the index of the first element in the array that satisfies the given test. </p>
<p>And I'm testing if the index of the event on change is the same as the object one! </p>
<p>However, this does not work, and when I try to type it just freezes</p>
<p>I've checked Chrom's developer tools and tried to debug there, it seems like there is a reference error! but I don't understand! how could that be?</p>
<p><a href="https://i.stack.imgur.com/BOyPX.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/BOyPX.png" alt="enter image description here"></a></p>
<p>Please help me see from different point of view.</p>
| 0non-cybersec
| Stackexchange |
Oracle Data Provider for .NET: Connection request timed out. <p>We have a C# WCF web service hosted on Windows 2008 SP2/IIS 7 accessing an Oracle database. Usually data access works fine but during load testing, it often times out and logs and exception saying:</p>
<pre><code>Error occurred when processing XXXXXXXX Web Service
Oracle.DataAccess.Client.OracleException Connection request timed out at Oracle.DataAccess.Client.OracleException.HandleErrorHelper(Int32 errCode, OracleConnection conn, IntPtr opsErrCtx, OpoSqlValCtx* pOpoSqlValCtx, Object src, String procedure, Boolean bCheck)
at Oracle.DataAccess.Client.OracleException.HandleError(Int32 errCode, OracleConnection conn, IntPtr opsErrCtx, Object src)
at Oracle.DataAccess.Client.OracleConnection.Open()
at MyWorkspace.WorkForceDataAccess.CheckStaffIdInRSW()
at MyWorkspace.MyClass.MyFunction(MyDataType MyData)
</code></pre>
<p>To query the database, we use something like this:</p>
<pre><code>OracleConnection orConn = new OracleConnection();
orConn.ConnectionString = "user id=xxx; password=xxx; Connection Timeout=600; Max Pool Size=150; data source= (DESCRIPTION =(ADDRESS = (PROTOCOL = TCP)(HOST = MYHOST.MYDOMAIN.com)(PORT = 1771)) (CONNECT_DATA =(SERVER = DEDICATED)(SERVICE_NAME = MYSERVICE.MYDOMAIN.com)))";
orConn.Open();
using (var cmd = new OracleCommand("MY_UTIL.check_StaffIdInRSW", orConn) { CommandType = CommandType.StoredProcedure })
{
cmd.Parameters.Add("P_Staff_Id", OracleDbType.Int32);
cmd.Parameters["P_Staff_Id"].Direction = ParameterDirection.Input;
cmd.Parameters["P_Staff_Id"].Value = Convert.ToInt32(MyDataObject.StaffId);
cmd.Parameters.Add("P_retvalue", OracleDbType.Int32);
cmd.Parameters["P_retvalue"].Direction = ParameterDirection.Output;
cmd.ExecuteNonQuery(); // Execute the function
//obtain result
returnVal = int.Parse(cmd.Parameters["P_retvalue"].Value.ToString());
}
</code></pre>
<p>I am pretty confident that the stored procedure that is being invoked is not taking all the time. It is a pretty simple procedure that quickly checks if the P_Staff_Id exists in the table and returns the result.</p>
<p>Additionally, this occurs only during load testing. During normal operations things are fine but during heavy loads with 1 message per second, this occurs after running smooth for some time.</p>
<p>As a workaround, I have added "Connection Timeout=600; Max Pool Size=150“ to the connection string, but that did not fix the issue.</p>
<p>We have the same application running on a development server and it works fine. We never encountered this problem there.</p>
<p>Any suggestions as to what to try would be appreciated. It looks like I am running out of options.</p>
| 0non-cybersec
| Stackexchange |
PC (Intel x86) server install CD. <p>Does PC (Intel x86) server install CD version supports 64-bit?</p>
<p>It's little bit confusing - the AMD version explicitly mentioned 64-bit support.</p>
<p>fgeld</p>
| 0non-cybersec
| Stackexchange |
Which one are you. | 0non-cybersec
| Reddit |
Sucker Punching People In A Crowd. | 0non-cybersec
| Reddit |
I painted 7 nebulas, a galaxy and a supernova remnant this morning.. | 0non-cybersec
| Reddit |
Extracting energy from the waste water and salt water. | 0non-cybersec
| Reddit |
Warmbier's parents blame NKorea 'evil regime' in son's death. | 0non-cybersec
| Reddit |
Good tests, bad tests. | 0non-cybersec
| Reddit |
Perform calculation from count of values for a distinct value. <p>My Goal is to show the top hosts with successful access attempts (Total, %)</p>
<ul>
<li>200 = successful attempt </li>
<li>404 = unsuccessful attempt</li>
</ul>
<h2>logs table</h2>
<p><code>host | status
10.1.1.1 | 200
10.1.1.1 | 200
10.1.1.1 | 404
10.10.10.1 | 200
10.10.10.1 | 200
10.10.10.1 | 404</code></p>
<pre><code>SELECT DISTINCT(host) AS Host, count(host) as Attempts
FROM logs
GROUP BY host
ORDER BY count(status) DESC;
</code></pre>
<p>Results in</p>
<pre><code>Host | Attempts
10.1.1.1 | 3
10.10.10.1 | 3
</code></pre>
<p>Query</p>
<pre><code>SELECT DISTINCT(host) as Host, count(status) as Failed
FROM logs
WHERE status = '404'
GROUP BY host
ORDER BY count(host) DESC;
</code></pre>
<p>Returns</p>
<pre><code>Host | Failed
10.1.1.1 | 1
10.10.10.1 | 1
</code></pre>
<p>so far so good for getting started, now however when I try this query</p>
<pre><code>SELECT DISTINCT(host) as Host,
(SELECT count(status)
FROM logs
WHERE status = '404') AS Failed,
(SELECT count(status)
FROM logs
WHERE status = '200') AS Successful
FROM logs
GROUP BY host
ORDER BY count(host) DESC;
</code></pre>
<p>it returns</p>
<pre><code>Host | Failed |Successful
10.1.1.1 | 2 | 4
10.10.10.1 | 2 | 4
</code></pre>
<p>I'm trying to get it to return 1 failure and 2 successful. I can see what it's doing (returning the total for all hosts). Eventually I'm trying to get to where I divide the total of the successful attempts (2) by total count(status) (3) and return a percentage. I have searched for hours on this one problem with no success, any help would be really appreciated.</p>
| 0non-cybersec
| Stackexchange |
Drawing a cut cylinder with Tikz. <p>I'm trying to use tikz to create the attached image, but I'm not sure this is possible. I know I can use the package to draw cylinders, as shown <a href="https://tex.stackexchange.com/questions/63370/drawing-3d-cylinder">here</a> and <a href="https://tex.stackexchange.com/questions/267266/how-to-draw-multi-position-cylinder-with-tikz">here</a>. But I don't think I can use the <code>\usetikzlibrary{shapes}</code> to provide the cut shown in the attachment. Is this at all feasible with tikz?</p>
<p><a href="https://i.stack.imgur.com/nrtFa.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/nrtFa.png" alt="enter image description here"></a></p>
| 0non-cybersec
| Stackexchange |
My Windows 10 Computer Seems to Wake up And Run Slower. <p>I've got a beefy Windows 10 desktop computer (specs below) that has a NVidia 970 card, two 4K monitors and bunch of bluetooth devices (k/b, mice, etc.). I've noticed that once it has gone to sleep and woken up, everything seems like it is dragging. Things like gmail take longer to load, typing feels a little like typing in sludge (not horrible but noticeable).</p>
<p>When I look in task manager, my CPU is showing 1% usage, memory is also barely used. </p>
<p>Any hints where to look?</p>
<p><a href="https://i.stack.imgur.com/K82AZ.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/K82AZ.jpg" alt="PC specs"></a></p>
| 0non-cybersec
| Stackexchange |
Grep unix for a data to find out result. <p>i have a file, contains huge data.
for example there is written "COST-> 1.00" line. and i would like to grep for example between 1.00 and 100. it includes both integer and string characters. how should i make grep for this data?</p>
<p>thank you.</p>
| 0non-cybersec
| Stackexchange |
Mother renames son after tattooist makes spelling error. | 0non-cybersec
| Reddit |
Metallica's Master Of Puppets the first heavy metal album to be to be preserved in the US Historical Registry. | 0non-cybersec
| Reddit |
How to verify if video drivers (already exist in the kernel) for a particular card on Linux?. <p>Is there a way to verify if video drivers exist in the kernel for a particular card on Linux from the command line?</p>
<p>Is there any way to search for the device drivers (that are already included) directly inside the kernel from the command line?</p>
| 0non-cybersec
| Stackexchange |
YSK A Couple Interesting theories of Why Humans got Smart. | 0non-cybersec
| Reddit |
What are the limits of the bitcoin protocol for making thousands of transactions, and what are the alternatives?. <p>What are the limits of the bitcoin protocol for microtransactions, and what are the alternatives?</p>
<p>I am contemplating an application that would require each user to spend fractions of bitcoins multiple times every second. I understand that there are limitations in the protocol to prevent such a thing from happening. How can I proceed thousands of microtransaction using bitcoins without having a central server?</p>
| 0non-cybersec
| Stackexchange |
Beginner problems administering users on mysql. <p>Very new MySQL user here. Two questions for the community.</p>
<ol>
<li>I seem to have created an account that I can't delete/drop.</li>
<li>I can't seem to get MySQL to actually require newly created accounts to require passwords even when I specify them during creation.</li>
</ol>
<p>I ran <code>myisamchk</code> and corrupton doesn't seem to be an issue. Logs below.</p>
<pre><code>mysql -u root -p
use mysql
select * from db\G;
*************************** 3. row ***************************
Host: localhost
Db: projectdb
User: project
Select_priv: Y
Insert_priv: Y
Update_priv: Y
Delete_priv: Y
Create_priv: Y
Drop_priv: Y
Grant_priv: Y
References_priv: Y
Index_priv: Y
Alter_priv: Y
Create_tmp_table_priv: Y
Lock_tables_priv: Y
Create_view_priv: Y
Show_view_priv: Y
Create_routine_priv: Y
Alter_routine_priv: Y
Execute_priv: Y
Event_priv: Y
Trigger_priv: Y
mysql> drop user project;
ERROR 1396 (HY000): Operation DROP USER failed for 'project'@'%'
</code></pre>
<p>~~~~~</p>
<pre><code>CREATE USER project123 IDENTIFIED BY 'project123';
Query OK, 0 rows affected (0.00 sec)
GRANT ALL ON projectdb.* TO project123 IDENTIFIED BY 'project123';
Query OK, 0 rows affected (0.00 sec)
quit;
</code></pre>
<p>MySQL then proceeds to let me log in without a password. </p>
<pre><code>macbook-pro-8: $ /usr/local/mysql/bin/mysql -u project123
Welcome to the MySQL monitor. Commands end with ; or \g.
</code></pre>
<p>What am I doing wrong?</p>
| 0non-cybersec
| Stackexchange |
Not receiving Firebase Cloud Messaging delivery receipts. <p>I am sending the following message through fcm xmpp client. But I am not getting delivery receipt for the delivered messages.</p>
<p>I am using <code>node-xcs</code> node package for sending XMPP message.</p>
<pre><code>var Sender = require('node-xcs').Sender;
var Message = require('node-xcs').Message;
var Notification = require('node-xcs').Notification;
var Result = require('node-xcs').Result;
var xcs = new Sender('123', 'xxxx', 1);
const uuidv4 = require('uuid/v4');
xcs.on('message', function(messageId, from, data, category) {
console.log('received message', arguments);
});
xcs.on('receipt', function(messageId, from, data, category){
console.log(messageId,'dsafdsafdsaf')
});
xcs.on('connected', function(){console.log('connected')});
xcs.on('disconnected', function(){console.log('disconnected')});
xcs.on('online', function(){console.log('online')});
xcs.on('error', console.error);
xcs.on('message-error', function(){console.log('message-error')});
var notification = new Notification("./logo.png")
.title("Hello buddy!")
.clickAction("https://github.com/guness/node-xcs/blob/master/google/Notification.js")
.body("test_body")
.build();
var message = new Message(uuidv4())
.priority("high")
.dryRun(false)
.deliveryReceiptRequested(true)
.notification(notification)
.build();
xcs.sendNoRetry(message, 'token', function(result) {
if (result.getError()) {
console.error(result.getErrorDescription());
} else {
console.log("message sent: #" + result.getMessageId());
}
});
</code></pre>
<p>Below is the XMPP message sent from the package</p>
<pre><code><gcm xmlns="google:mobile:data">{
"to": "token",
"message_id": "59171fc6-42ad-4f22-812f-d0c4f7fa63d0",
"priority": "high",
"delivery_receipt_requested": true,
"notification": {
"body": "test_body",
"click_action": "https://github.com/guness/node-xcs/blob/master/google/Notification.js",
"icon": "./logo.png",
"title": "Hello buddy!"
}
}</gcm>
</code></pre>
<p>I am getting <code>ack</code>, but I am not getting Delivery receipt, Why is the delivery receipt not coming even if the message is delivered?</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 |
Reason why I love Android #78. | 0non-cybersec
| Reddit |
ar
X
iv
:m
at
h/
05
06
61
9v
1
[
m
at
h.
O
C
]
3
0
Ju
n
20
05
PIIPTI, or the
Principle of Increasing Irrelevance of
Preference Type Information
Elemér E Rosinger
Department of Mathematics
University of Pretoria
Pretoria, 0002 South Africa
e-mail : [email protected]
Abstract
It is shown that in the case of a single decision maker who optimizes
several possibly conflicting objectives, the amount of information avail-
able in preference relations among pairs of possible decisions, when
compared with all other possible information, is tending to zero expo-
nentially with the number of those different objectives. Consequently,
in the case of a larger number of conflicting objectives, the only way
to obtain a satisfactory amount of information is by the use of non-
preference type relations among possible decisions.
1. Introduction
There are three wider areas of decision making, each known to be sub-
ject to certain deep structural limitations.
In games, two or more players make decisions, each pursuing his or
her own best interest. As is known, Binmore [1-3], the complexities
involved are not seldom such as to lead to algorithmically unsolvable
situations. In this regard it is worth mentioning that, during the late
1940s and early 1950s, when game theory had known a massive interest
and development, there was not much awareness about the possibility
1
http://arxiv.org/abs/math/0506619v1
of the presence of the type of deep difficulties which would more than
three decades later be pointed out by Binmore.
In social choice the deeper structural difficulties came to attention
relatively early with Arrow’s celebrated impossibility. Here, the issue
is the appropriate aggregation of a number of individual preferences.
And as it turns out, this in general is not possible, unless there is a
”dictator”.
Social choice can be seen as a partial version of the situation of a sin-
gle decision maker. Indeed, the aggregation of the set of individual
choices amounts to a single decision. On the other hand, even if such a
decision is made by a single decision maker, he or she is not supposed
to be partial in any way with respect to any of the individual prefer-
ences which are aggregated. And yet, Arrow’s impossibility rules the
realms of social choice.
The case of a single decision maker facing several conflicting objectives
cannot - according to one line of argument - be but more difficult, since
he or she is not barred from having specific preferences and expressing
them in his or her decision. Consequently, the possible limitations to
be faced by a single decision maker may quite likely be more severe
than those which lead to Arrow’s impossibility in social choice.
According to another line of argument, however, in the case of one
single decision maker, the fact that he or she faces all alone his or
her own conflicting objectives gives an easy and natural opportunity
for certain cooperative type approaches. After all, cooperation can
involve bargaining, and in the case of one single decision maker with
several conflicting objectives, he himself, or she herself may end up as
if bargaining with himself or herself.
In fact, certain forms of cooperation find a most appropriate context
precisely within the thinking of a single decision maker who exhibits
a rational behaviour.
As it happens nevertheless, there seems to be little awareness in the
literature about the above mentioned issues relating to single decision
makers who simultaneously face several conflicting objectives.
2
Here we present, as one of the two main difficulties facing a single
decision maker, what has been named the Principle of Increasing Ir-
relevance of Preference Type Information, or in short, PIIPTI, see
Rosinger [4,5].
The other difficulty, mentioned in short in Conclusions, is presented
in some detail in Rosinger [1-5].
2. A Single Decision Maker with Multiple Conflicting
Objectives
In order to illustrate in detail what is involved, let us consider the
following large and practically important class of decision making sit-
uations, when the single decision maker SDM has to deal with n ≥ 2
typically conflicting objectives given by the utility functions, see von
Neumann & Morgenstern, Luce & Raiffa,
(2.1) f1, . . . , fn : A −→ R
and his or her aim is to maximize all of them, taking into account
that most often such a thing is not possible simultaneously, due to the
conflicts involved.
The main difficulty of this situation is that the SDM is not supposed
to have available under any form whatsoever an overall utility function
(2.1∗) f : A −→ R
which would hopefully synthesize his or her position with respect to
those n ≥ 2 conflicting objectives in (2.1) taken simultaneously in
their totality.
Here, as before, the set A describes the available choices, namely, those
which the SDM has, and this set A may as well be an infinite set, for
instance, some open or closed bounded domain in a finite dimensional
Euclidean space.
Clearly, the functions fi in (2.1) can be seen as utility functions, and
as such, they generate preference relations on the set of choices A.
3
Namely, the preference relation ≤i corresponding to the utility func-
tion fi is defined for a, b ∈ A, by
(2.2) a ≤i b ⇔ fi(a) ≤ fi(b)
In this way, the problem in (2.1) can be reduced to a choice, according
to the natural partial order (2.4) below, of a point in the set of all
possible decision outcomes
(2.3) B = { (f1(a), . . . , fn(a)) | a ∈ A } ⊆ R
n
that is, the set of n-tuples of outcomes (f1(a), . . . , fn(a)) ∈ R
n which
correspond to various choices a ∈ A which the SDM can make.
Needless to say, the situation described by (2.1) is not the most gen-
eral one, since it is possible to encounter cases when the objectives
are not given by utility functions, or simply, are not even quantifiable.
However, the model in (2.1) can nevertheless offer an edifying enough
situation, in order to be able to obtain relevant insights into the na-
ture and extent of the complexities and difficulties which a SDM can
face. Furthermore, it can also lead to general enough solution meth-
ods, including ways to choose solution concepts, see Rosinger [1-5].
Next we give three different arguments supporting PIIPTI. The first
and the third ones are of a geometrical nature related to finite di-
mensional Euclidean spaces. The second argument is of a simple
probabilistic-combinatorial kind. Here we should mention that, while
the first geometric argument is rather simple and obvious, the other
geometric argument, although quite elementary, appears however to be
less well known, although it has important connections with Physics.
A First Argument. We start with a very simple geometric fact
about finite dimensional Euclidean spaces which can give a good in-
sight into the more involved result in (2.8). On the n-dimensional
Euclidean space Rn, with n ≥ 1, we consider the natural partial order
relation ≤ defined for elements x = (x1, . . . , xn), y = (y1, . . . , yn) ∈
R
n, according to
(2.4) x ≤ y ⇔ xi ≤ yi, with 1 ≤ i ≤ n
Let us denote by
4
(2.5) Pn = { x ∈ R
n | x ≥ 0 }
the set of nonnegative elements in Rn, corresponding to the partial
order ≤.
Then we can note that, for n = 1, the set P1 is half of the space
R
1 = R. Further, for n = 2, the set P2 is a quarter of the space R
2.
And in general, for n ≥ 1, the set Pn is 1 / 2
n of the space Rn.
It follows that in an n-dimensional Euclidean space Rn, if one is given
an arbitrary element x ∈ Rn, then the probability for this element x
to be nonnegative is 1 / 2n, thus it tends exponentially to zero with n.
Consequently, the same happens with the probability that two arbi-
trary elements x, y ∈ Rn are in the relationship x ≤ y. Indeed, the
relationship x ≤ y is obviously equivalent with 0 ≤ y − x.
This means that one can expect a similar phenomenon to happen when
trying to compare points in the set of outcomes in (2.3), which corre-
spond to the n conflicting objectives in (2.1).
That very simple geometric fact is, actually, at the root of PIIPTI.
A Second Argument. Let us now assume for the sake of technical
simplicity that in (2.1) we have a finite set of choices, namely
(2.6) A = { a1, . . . , am }, m ≥ 2
A natural single preference relation on A corresponding to (2.1), and
which may try to synthesize the respective n conflicting objectives,
should of course be given by a subset
(2.7) S ⊆ A×A
Here, for any a, a′ ∈ A, the SDM will prefer a′ to a, in which case we
write a ≤ a′, or equivalently, (a, a′) ∈ S, if and only if one has for each
objective function fi, with 1 ≤ i ≤ n, either that fi(a
′) − fi(a) > 0
and it is not negligible, or |fi(a
′)− fi(a)| is negligible.
Let us therefore see more precisely how much information one single
preference relation S can carry, when the number n of conflicting
5
objectives in (2.1) becomes large, and even if only moderately so.
This can be done quite easily by noting that in typical situations, we
can have the relation
(2.8) car S / car (A× A) = O(1 / 2n)
where for a finite set E we denoted by ”car E” the number of its ele-
ments.
The proof of (2.8) goes as follows, by using a combinatorial-probabilistic
type argument. Let us take any injective function g : A −→ R, and
denote by
(2.9) Sg = { (a, a
′) ∈ A× A | g(a) ≤ g(a′) }
which is its corresponding preference relation on A. Then obviously
(2.10) car Sg = m(m+ 1) / 2
Now given any subset S ⊆ A×A, let us denote by P (S) the probability
that for an arbitrary pair (a, a′) ∈ A × A, we have (a, a′) ∈ S. Then
clearly
(2.11) P (Sg) = (1 + 1 / m) / 2
Let us assume about the objective functions in (2.1) the following
(2.12) f1, . . . , fn are injective
and furthermore, that their corresponding sets of preferences
(2.13) Sf1 , . . . , Sfn are probabilisitically independent
Then we obtain, see (2.11)
(2.14) P (Sf1
⋂
. . .
⋂
Sfn) = P (Sf1) . . . P (Sfn) = (1+1 / m)
n / 2n
And now (2.8) follows, provided that n in (2.1) and m in (2.6) are
such that
(2.15) (1 + 1 / m)n = O(1)
which happens in many practical situations.
6
As for the independence condition (2.13), let us note the following. Let
us assume that the objectives f1 and f2 are such that for a, a
′ ∈ A
we have
(2.16) f1(a) < f1(a
′) ⇔ f2(a) < f2(a
′)
then obviously Sf1 = Sf2, hence (2.14) may fail. But clearly, (2.16)
means that Sf1 and Sf2 are not independent. In the opposite case,
when
(2.17) f1(a) < f1(a
′) ⇔ f2(a
′) < f2(a)
then obviously
(2.18) Sf1
⋂
Sf2 = { (a, a) | a ∈ A }
and (2.14) may again fail. However (2.18) once more means that Sf1
and Sf2 are not independent, since they are in total conflict with one
another.
A Third Argument. For the sake of simplicity, let us assume that
the set B of outcomes in (2.3) is of the form
(2.19) B =
{
b = (b1, . . . , bn) ∈ R
n
∣
∣
∣
b1, . . . , bn ≥ 0
b1 + . . . + bn ≤ L
}
for a certain L > 0. Then clearly the Pareto maximal, or in other
words, the non-dominated subset of B is
(2.20) BP = { b = (b1, . . . , bn) ∈ R
n | b1 + . . . + bn = L }
when considered with the natural partial order (2.4) on Rn.
Now for 0 < ǫ < L, the ǫ-thin shell in B corresponding to BP is given
by
(2.21) BP (ǫ) =
{
b = (b1, . . . , bn) ∈ R
n
∣
∣
∣
L− ǫ ≤ b1 + . . . + bn ≤
≤ L
}
And a standard multivariate Calculus argument gives for the volume
of B in (2.19) the relation
(2.22) vol B = Kn L
n
7
where the constant Kn > 0, involving the Gamma function, does only
depend on n, but not on L as well. In this way it is easy to see that
(2.23) vol BP (ǫ) / vol B = 1− (1− ǫ / L)n
This leads to a rather counter-intuitive and somewhat paradoxical
property of higher dimensional Euclidean spaces.
For instance, in the 20-dimensional case, a shell with a thickness of
only 5% of the radius L of a sphere will nevertheless contain at least
63% of the total volume of that sphere.
In more simple and direct geometric terms the relation (2.23) means
that :
( VOL ) ”The volume of a multidimensional solid is mostly concen-
trated next to its surface.”
The relevance of this property ( VOL ) to PIIPTI is as follows. The
set (2.3), or equivalently (2.19), of outcomes B in the multiple ob-
jective decision problem (2.1) is the one which determines the choice
of the appropriate decision taken in A, and it does so through the
relations (2.2). And obviously, in this respect, only the Pareto maxi-
mal, or the non-dominated subset BP of B, see (2.20), is of relevance.
However, within this subset BP no two different points u 6= v can
be in a relation u ≤ v, see (2.4), this being the very definition of a
Pareto maximal, or non-dominated set. In this way all pairs of differ-
ent elements u 6= v in BP are incomparable, thus are outside of being
included in a preference relationship.
And as seen in (2.23), the volume of no matter how thin a shell next
to BP , when compared to that of B, tends to 1 exponentially with
n becoming large. Thus, the amount of pairs of different elements
u 6= v in no matter how small a neighbourhood of BP tends to 1
with n becoming large, when compared with all the possible pairs of
outcomes in B. And obviously, any two different elements u 6= v in
a neighbourhood of BP are comparable, that is, satisfy the relation
u ≤ v, see (2.4), only if the are very near to one another, thus they
cannot express any kind of a more relevant preference. Otherwise, if
two different elements u 6= v in a neighbourhood of BP are not near
to one another, then they must be incomparable, given the fact that
8
BP is a Pareto maximal, or non-dominated set.
It may be instructive to note that relation (2.23) also has a physi-
cal interpretation, as it explains the phenomenon of temperature, see
Manin. Indeed, let us assume that a certain simple gas has n atoms
of unit mass. Then their kinetic energy is given by
(2.24) E = Σ1≤i≤n v
2
i / 2
where vi, with 1 ≤ i ≤ n, are the velocities of the respective atoms.
Therefore, for a given value of the kinetic energy E, the state of the
gas is described by the vector of n velocities, namely
(2.25) v = (v1, . . . , vn) ∈ Sn(
√
(2E))
where for L > 0, we denoted by
(2.26) Sn(L) = { x = (x1, . . . , xn) ∈ R
n | x2
1
+ . . . +x2n = L
2 }
the ( n - 1 )-dimensional surface of the n-dimensional ball with radius
L in Rn.
Now we can recall that in view of the Avogadro number, under normal
conditions for a usual macroscopic volume of gas, one can have
(2.27) n > 1020
Therefore, the above property ( VOL ) which follows from (2.23) is
very much manifest. Let us then assume that a small thermometer
with a thermal energy e negligible compared to E is placed in the gas.
Then the state (2.25) of the gas will change to a new state
(2.28) v = (v1, . . . , vn) ∈ Sn(
√
(2E ′))
However, in view of property ( VOL ), it will follow with a high
probability that
(2.29) E ′ ≈ E
And it is precisely this stability or rigidity property (2.29) which leads
to the phenomenon of temperature as a macroscopically observable
quantity.
9
3. Conclusions
Situations involving the actions of conscious rational agents are ap-
proached in three mathematical theories, namely, the theory of games,
the theory of social choice, and decision theory. In games, there are
two or more such conscious and rational agents, called players, who
are interacting according to the given rules. And except for that, they
are free and independent, and there is no overall authority who could
influence in any way the players. In social choice, again, there are
two or more conscious and rational agents with their given individual
preferences. Here however, the issue is to find a mutually acceptable
aggregation of those preferences. And such an aggregation is seen as
being done by an outsider. Finally, decision theory can be seen as a
two person game, in which one of the players is a conscious rational
agent, while the other is Nature.
In the case of one single decision maker, who in decision theory is seen
as a conscious rational player, playing alone against Nature, one may
seem at first two have a situation which enjoys all the advantages that
are missing both in games, and in social choice. Indeed, it may at first
appear that such a single decision maker does not have to put up with
one or more other autonomous players. And also, as the single player,
he or she can automatically be seen as a dictator as well, since there
is no other conscious agent out there to protest, least of all what is
called Nature in such a context.
It would, therefore, appear that in decision theory one has it rather
easy.
And yet, in the typical practical situations when the single decision
maker is facing multiple and conflicting objectives, all the mentioned
seeming advantages are instantly cancelled. Instead, the single deci-
sion maker can easily end up feeling as if two or more autonomous
agents have moved inside of him or her, and now he or she has to turn
into a dictator who, in fact, ends up fighting himself or herself.
10
In this regard, two facts come to the fore from the beginning in typi-
cal situations with a single decision maker facing multiple conflicting
objectives, see Rosinger [1-5] :
Fact 1. There is no, and there cannot be a unique natural canonical
candidate for the very concept of solution. And in fact, the very issue
of choosing a solution concept leads to a meta-decision problem which
itself has multiple conflicting objectives.
Fact 2. The information contained in the preference structures
involved - relative to all other possible, such as for instance, non-
preference type information present in the situation - tends exponen-
tially to zero, as the number of conflicting objectives increases. This
phenomenon, which in fact is of a very simple higher dimensional ge-
ometric nature, can be called the Principle of Increasing Irrelevance
of Preference Type Information, or in short PIIPTI.
References
[1] Arrow, Kenneth J [1] : A difficulty in the concept of social welfare.
Journal of Political Economy, 58, 4 (1950)
[2] Arrow, Kenneth J [2] : Social Choice and Individual Values, 2nd
ed. Wiley, New York, 1963
[3] Binmore, Kenneth [1] : Modelling rational players. Part I. Eco-
nomics and Philosophy, 3 (1987) 179-214
[4] Binmore, Kenneth [2] : Modelling rational players. Part II. Eco-
nomics and Philosophy, 4 (1988) 9-55
[5] Binmore, Kenneth [3] : Game theory and the social contract :
Mark II (manuscript 1988) London School of Economics
[6] Luce, R Duncan & Raiffa, Howard : Games and Decisions, Intro-
duction and Critical Survey. Wiley, New York, 1957, or Dover,
New York, 1989
11
[7] Manin, Yu I : Mathematics and Physics. Birkhauser, Boston, 1981
[8] von Neuman, John & Morgenstern, Oskar : Theory of Games and
Economic Behavior. Princeton, 1944
[9] Rosinger, Elemer E [1] : Interactive algorithm for multiobjective
optimization. JOTA, 35, 3 (1981) 339-365
[10] Rosinger, Elemer E [2] : Errata Corrige : Interactive algorithm
for multiobjective optimization. JOTA, 38, 1 (1982) 147-148
[11] Rosinger, Elemer E [3] : Aids for decision making with conflicting
objectives. In Serafini, P (Ed.), Mathematics of Multiobjective
Optimization. Springer, New York, 1985, 275-315
[12] Rosinger, Elemer E [4] : Beyond preference information based
multiple criteria decision making. European Journal of Opera-
tional Research, 53 (1991) 217-227
[13] Rosinger, Elemer E [5] : Reconsidering conflict and cooperation.
arXiv:math.OC/0405065
12
http://arxiv.org/abs/math/0405065
| 0non-cybersec
| arXiv |
Climate change occurring 10 times faster than at any time in past 65 million years. | 0non-cybersec
| Reddit |
Powerpoint align equation at equal sign. <p>How do i align equations at the equal sign in powerpoint ? In microsoft word there is an option to align at the equal sign but I've spent 10 minutes and can't find a similar option for powerpoint.</p>
| 0non-cybersec
| Stackexchange |
How do I extract data by filtering on a list of criteria?. <p>I have an Excel problem that I don't know how to approach. Let me explain the scenario. </p>
<p>Column A is populated with Name, which has both First & Second Name. I need to filter records based on multiple criteria, skipping those Names that contain an apostrophe [ ' ] symbol or a number, and copying those that contain neither to column B.</p>
<p>For example: </p>
<pre><code> Col A Col B
Henry 'James' (Contains apostrophe)
Henry Peter Henry Peter (No apostrophe or number)
Henry PP123 (Contains number)
</code></pre>
<p>According to this example, only Henry Peter should be copied.</p>
<p>There are many obvious ways to do this if it requires testing for a single condition. In this case, there can potentially be any combination of numbers and/or apostrophe, contained anywhere in the column A value. So there is a substantial list of conditions to test for in each cell.</p>
<p>Is there a way to do this that does not require an insanely complicated approach?</p>
| 0non-cybersec
| Stackexchange |
What's the best decision that you made in 2016?. | 0non-cybersec
| Reddit |
A suitable integration path for $\cos z/(2 + \cos z)$. <p>I was solving the exercises and got stuck when trying to solve this with tools of residual calculus
$$
\int_{0}^{2 \pi} \frac{\cos (z)}{2 + \cos (z)} \, dz = \int_{0}^{2 \pi} f(z) \, dz.
$$</p>
<p>Isolated singularities are at $z = \pi (2k+1) - i \log(2 \pm \sqrt{3}),\ k \in \mathbb{Z}$. Also I noticed that constructing a rectangular path (let's say a positively oriented square of length $2 \pi$) has a nice property that vertical parts cancel each other out which leaves me with
$$
\int_{0}^{2 \pi} f(z) \, dz + \int_{2 \pi}^{0} f(z+2 \pi i) \, dz = 2 \pi i \cdot \operatorname{Res} \left[ f(z), z = \pi- i \log(2 - \sqrt{3}) \right]; \\
\int_{0}^{2 \pi} \frac{\cos (z)}{2 + \cos (z)} \, dz = \frac{-4 \pi}{\sqrt{3}} + \int_{0}^{2 \pi} \frac{\cos (z+2 \pi i)}{2 + \cos (z+2 \pi i)} \, dz.
$$</p>
<p>Numerical calculation reveals that the last integral is just $2 \pi$... Am I missing something obvious? Or maybe there is a smarter way to obtain this result?</p>
| 0non-cybersec
| Stackexchange |
ssh-copy-id - permission denied (publickey). <p>I want to set up ssh tunnel to the mysql server which is in computer which has virtual machine. Also the tunnel has to work if the machine is restarted.</p>
<p>So lets say
A is computer with linux software.
B - virtual machine in computer A.</p>
<p>MySQL is in B.</p>
<p>C - is a virtual machine in computer A which wants to connect to MySQL in B.</p>
<p>Now by this article:
<a href="http://www.thegeekstuff.com/2008/11/3-steps-to-perform-ssh-login-without-password-using-ssh-keygen-ssh-copy-id/" rel="noreferrer">http://www.thegeekstuff.com/2008/11/3-steps-to-perform-ssh-login-without-password-using-ssh-keygen-ssh-copy-id/</a></p>
<p>I try to copy the public key to remote server. I guess I need to copy it to computer A. </p>
<pre><code>ssh-copy-id -i id_rsa.pub.bak [user]@[IP of A] -p [port of A]
Enter passphrase for key '/home/[user]/.ssh/id_rsa':
Permission denied (publickey).
</code></pre>
<p>Now I tried entering passphrase of the file id_rsa.pub.bak. It denied.</p>
<p>Then I see that it uses key in /home/[user]/.ssh/id_rsa which is different from the public key I am trying to copy, I mean of course private key is different, but I mean I copy public key of another private key. So I tried using passphrase of it. Also denied.</p>
<p>How could I debug why is passphrase denied?</p>
<p><strong>Update</strong></p>
<p>Based on comments I created new public file called id_rsa.pub where everything is in one line now</p>
<p>and run and still get error.</p>
<pre><code>ssh-copy-id -i id_rsa.pub [host and port] -vvv
Enter passphrase for key '/home/[user]/.ssh/id_rsa':
Permission denied (publickey).
</code></pre>
<p><strong>Update</strong></p>
<p>Checked the permissions on .ssh folder and authorized_keys file in the A computer - they are 700 and 600 so as the comment say they are good.</p>
<p><strong>Update</strong></p>
<p>Tried setting password authentication yes on A computer and to restart the service.
Restarting as by the answer did not work, it wrote sshd not recognized, so I restarted using:</p>
<pre><code>sudo /etc/init.d/ssh restart
</code></pre>
<p>Then tried again on C machine to copy to A machine.</p>
<pre><code>ssh-copy-id -i id_rsa.pub [user@host] -p [port] -v
</code></pre>
<p>and still the same:</p>
<pre><code>Enter passphrase for key '/home/[user]/.ssh/id_rsa':
Permission denied (publickey).
</code></pre>
<p>If I go to copy the key manually to authorized_keys, I see that the public key is already existing, the same which I want to copy. I asked my coworker, he said he did not copy it. So I do not even understand how it can be there. </p>
<p>Ok, if it is there it would be good, but by staying there it does not let me connect with ssh without entering passphrase. But I was able to connect with entering passphrase. So something is clearly still wrong here.
And the key which I am trying to copy is with empty passphrase. When I connected with ssh - I entered passphrase which was not empty. </p>
<p>The same public key cannot accept empty passphrase and and non empty passprhase, that makes sense. But then why public key which I am trying to upload is the same with the one in authorized_keys file if passphrases are different?
I did not check every single character, but its unlikely that keys would be so similar that beggining and ending would be the same even when passphrase different I think.</p>
| 0non-cybersec
| Stackexchange |
I’m the monster who lives in your closet. And I’m the top suspect to the mystery I am trying to solve (Part 4). [Part 1](https://www.reddit.com/r/nosleep/comments/clpfw2/im_the_monster_who_lives_in_your_closet_but_i/?utm_source=share&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;utm_medium=ios_app)
[Part 2](https://www.reddit.com/r/nosleep/comments/cm3k1y/im_the_monster_who_lives_in_your_closet_people/?utm_source=share&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;utm_medium=ios_app)
[Part 3](https://www.reddit.com/r/nosleep/comments/cncc6o/im_the_monster_who_lives_in_your_closet_and_i/?utm_source=share&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;utm_medium=ios_app)
[Part 5](https://www.reddit.com/r/nosleep/comments/cr96y5/im_the_monster_who_lives_in_your_closet_and_i/?utm_source=share&utm_medium=ios_app)
[Part 6](https://www.reddit.com/r/nosleep/comments/clpfw2/im_the_monster_who_lives_in_your_closet_but_i/?utm_source=share&utm_medium=ios_app)
[Part 7](https://www.reddit.com/r/nosleep/comments/d9tbct/im_the_monster_who_lives_in_your_closet_and_i/?utm_source=share&utm_medium=ios_app&utm_name=iossmf)
I sat under a tree, in the forest, holding a pen, and a piece of paper that I got from the house. On the paper was the word “Suspects” written at the top, underlined.
I stared at the paper, mind completely blank. Then I started to think about the comments the people left in my last few posts. A ton of them said that I was a suspect. Some of them came up with a few theories.
Was I the c̷̤̳̗̫̲̠̏̈́̈́̄̍̕a̴̡̧̢̖̫̼̰͇̤͑̃̒̒͗͡͝ṵ̷̢̗̰̤̝̘͕̒̉̌̓̄̑͘͟͡s̶̥̜̣̩̻̜̬͙̟̀̎͐̄̅͢͞ȩ͎͉͇̳͒̆͐̈́̈́ o̶̻̥̠̞͛̌͟͝͞͠f̴̰͙͎̯̱͇̟̀͒̇̔̽̉̈́̕͟ a̬̜̩̖̳̳͋́̂̂͘͘͞l̵̢̧̘̘̼̙͉͙̈̈́̂̔̅̏́͟͝ļ̸̢̛̼̻̗̼͉͕̰̿̅̐͗͑̾͞ t̴̨̧̧̛̗̜̱̩͓̥̃̽̽͝ḩ̬͚̙̣̥͎̱̐̆͗͑͝į̷̥̯̝̥̿͊́͗͆̓̂̄̕͠ͅs̶̢̠͍̟͓̖̫̩̰̋̋͆̈͂̀͋̌͠͡?̡͙̱̼͕̬̦̺̇̈̀̎̕̕͟͡
I didn’t want to believe that I was doing all of this. I have always been afraid of hurting people. So I tried not to think about it all that much. Like a stupid coward.
That is a horrible example to set for the twins.
If I wanted to solve this mystery, I had to list all suspects. So I wrote my name as the top suspect on that list, even though I hated the thought of me hurting someone.
I thought about how distant and strange the uncle was acting. There was something off about the uncle. So I wrote “Twin’s uncle” under my name.
I flipped the paper over and wrote “What we know” at the top of the page, underlining it.
I wrote “There is always blood at the scene” as the first thing. Below that, I wrote “It always happens after I go to sleep and they are near me”.
For the next hour or so, I listed down everything I knew. Like the victims’ names, dates of their disappearances, estimates of the times they went missing, even the aftermaths of the disappearances.
When I was finished, I folded the papers and tried figuring out where to put them. (I can’t carry things in my shadow form). I walked back to the house, and put the papers under a rock, where I knew they would be safe. The twins were at school, and that uncle was still at the house.
I snuck back in the closet and waited for the twins to come back. I decided to see if I was possibly the one doing it, like the people in the comments are saying. I read and reread the notes I made for about an hour until I had all of the notes I made memorized.
After about an hour later, I heard the uncle going outside and starting the car. He must be going to pick the twins up from school. I decided to look around the uncle’s room. The uncle had been acting extremely distant and strange these past few days.
I snuck into the uncle’s room and started looking. I opened a junk drawer in the closet and found nothing in there. Just a bunch of wrappers in there.
I looked on the bedside table, and found the picture of the exact same woman I found in the guest room. The woman was wearing an orange striped dress and a bunch of jewelry. She had a huge, genuine smile on her face.
Who was this woman that I kept seeing so much in pictures? What happened to her? Where is she? I put the picture down, thinking that I was asking too many questions about the woman. Maybe it was a family member or something? If she was, how come I have never seen or heard about her at the old house?
About half an hour later, I heard the front door opening and closing, and the sound of footsteps walking in the house. The twins must be home. I wondered if they had a good school day.
I slipped out of the room in my shadow form and went downstairs, to see Andrew asking the uncle if he can go to the park. The uncle nodded, without even looking at him. Does the uncle even care about them?
I watched as Andrew threw open the front door and walked outside. Addison started doing her homework after Andrew left. The uncle was still making dinner, so I decided to look around the house some more.
I snuck through the kitchen and went to the dining room. A wooden table was right in the middle of the room, and wooden chairs were around the table. The tablecloth had a flower pattern on it, with a few stains from food.
One of the plans I came up with was to stay up all night to see if anyone went missing the next morning. That plan was to see if I was a possible suspect, since it seems to only happen when I’m asleep. I’ll do that plan when I get mad at someone.
I didn’t find anything that would help in the case in the dining room. I snuck outside the dining room and found a strange door that I have never seen before. I guessed it led to the basement.
I snuck under the door, and what I saw will forever haunt my nightmares.
It was the woman from the picture’s dead body. It looked like she was stabbed multiple times. Her stomach was cut open, and I noticed that a few of her organs were missing. Her eyes were gouged out, and all of her fingers and toes were removed. Her fingers and toes were in a pile nearby.It looked like she had been tortured before her death. And that she had been dead for a while. The room had a putrid and horrible smell, causing me to vomit in a trash can.
I was frozen in fear. Who knew humans can be so awful? Who murdered her? Why did they murder her? I never seen her enter the house, so that means that she was already dead before the twins’ arrival. I tried to look away. I wanted to look away. But I couldn’t, no matter how hard I tried.
Then I felt the familiar feeling of rage. What kind of horrible monster would do this to someone? Who would torture an innocent woman like that? Who did this to her?
I guess I’m not sleeping tonight.
I quickly slid from below the door, and passed the uncle in the kitchen. I slid under the back door, and ran.
Ran as far away from the house as possible.
Ran as far away from *him* as possible.
How could someone do that to another human? Why would those people let the twins near that horrible person? If I could even call the uncle a *person.*
I sat down near a tree, and let it all out. I sobbed for what felt like hours, but I was out there for only a few minutes. When I ran out of tears, I thought of a story I used to hear the twins’ mother tell them all the time. I think it was called Hansel and Gretel? Anything to distract myself from the horror I saw in the basement.
I remember that I used be happy when I heard that Hansel and Gretel got a happy ending the first time I heard the story. I remember the twins being happy too. Even when they heard that exact same story millions of times, they always found themselves smiling at the end of it. I always thought that everyone deserved a happy and joyful ending.
But now... I find myself questioning if happy endings do even exist. | 0non-cybersec
| Reddit |
How to make bootstrap column height to 100% row height?. <p>I haven't found a suitable solution to this and it seems so trivial.</p>
<p>I have two columns inside a row:</p>
<pre><code><div class="row">
<div class="col-xs-9">
<div class="left-side">
<p>sdfsdf</p>
<p>sdfsdf</p>
<p>sdfsdf</p>
</div>
</div>
<div class="col-xs-3">
<div class="something">asdfdf</div>
</div>
</div>
</code></pre>
<p>The row height is set by the larger row, <code>left-side</code>. However, I want the right side's height to be the same.</p>
<p>This seems intuitive, but it doesn't work</p>
<pre><code>.left-side {
background-color: blue;
}
.something {
height: 100%;
background-color: red;
}
.row {
background-color: green;
}
</code></pre>
<p><a href="http://jsfiddle.net/ccorcos/jz8j247x/" rel="noreferrer">http://jsfiddle.net/ccorcos/jz8j247x/</a></p>
| 0non-cybersec
| Stackexchange |
Fuck Society. . I'm getting annoyed with 'corrections' to my body.
Oh you don't have perfect teeth? Braces.
Don't have perfect skin? Dermatologist.
Don't have perfect hair? Here, extensions.
Don't have the eye colour you want? Contacts.
Have to wear glasses? You look nerdy, try contacts.
A little overweight? You're fat, depressed, and obviously lazy.
Don't like your hair? Here, dye it.
Oh, you wear THAT brand? No, try this brand you'll fit in better.
I realize I might be going a little overboard. I just don't understand why everything about everyone has to be perfect. Why can't someone with crooked teeth have a nice smile? Why can't someone with acne be attractive? Why can't I wear a shirt from Walmart without being 'white trash'?!
Fuck you, society, and all your bullshit ideas.
People should be able to be happy with themselves without judgement or having to correct something.
EDIT: To clarify... I am happy with myself. If I'm happy with myself, other people should be too. I just don't want to keep hearing "fix this" when I am healthy and happy the way I am. When people say that, it makes me think I shouldn't be happy. | 0non-cybersec
| Reddit |
You People Are Terrible. I am lucky enough to study abroad as are the other students from my uni; yet, it seems most of them don't realize that or that we are, in fact, guests in another country.
I hate that you try rationalize disregarding quiet hours as "well why don't they just put on headphones or something" and getting incredibly loud in the small hours of the night after several warnings.
I hate how you decided to travel some thousand miles to regularly go to a McDonalds when you could've gone less than mile to the one back home. You don't really try anything new or different and then complain that they don't have peanut butter or ketchup like we have back at home. WHAT DID YOU THINK? YOU WENT TO A DIFFERENT COUNTRY
And I absolutely loathe that some of you would even consider cheating on your significant other just because you are in a another country. You could do that anyway, you didn't need to go somewhere else too far to do that.
The amount of arrogance, self-importance, and self-centeredness is astounding. You just see it as a glorified vacation where you can get drunk, loud, and obnoxious, even trying (and failing) to imitate the accents. You are the reasons why people dislike American tourists. You have been compared to dogs let off the leash; and, quite frankly, that is too mild. You act like you are uneducated. You are a bunch of spoiled children on daddy's credit card and are some of the worst people I have ever been near, let alone had to deal with. | 0non-cybersec
| Reddit |
mass increment field by 1. <p>I have a query <code>update deals set count = count + 1</code>. In Rails, when I do this using ActiveRecord, I can think of </p>
<pre><code>Deal.all.each { |deal| deal.update_attribute(:count => (deal.count + 1))}
</code></pre>
<p>and this take a lot more SQL queries instead of one query. Is there a better way to do this in Rails (not using the SQL query directly in the Rails app).</p>
| 0non-cybersec
| Stackexchange |
Receiving Installation Error: ApplicationVerificationFailed in Flash Builder for iOS. <p>This is the error I'm getting when I try to install my app on my iPhone. </p>
<p><img src="https://i.stack.imgur.com/fYSib.png" alt="enter image description here"></p>
<p><strong>More details</strong>:<br>
It did work at one point. I used a different computer recently, working on a different project and had to create a new certificate. This invalidated my other projects (profiles). I went back to working on the first computer and uploaded the certificate from that one. I recreated the app profiles and downloaded the provisioning files based on that previous certificate. None of that worked. In the end I had to start over from scratch as shown in the answer below. </p>
| 0non-cybersec
| Stackexchange |
I don't understand Raids. Hi everyone,
I'm no Pro in this Game so maybe I'm missing something. And you probably had this topic multiple times already. I'm on lvl 25, living in Hamburg, Germany. You would think in a City like that it should be possible to have at least 1-2 successful Raids per Week. Well I had no successful Raid in a Month.
The Map is filled with Raids. At the Central Station we got two Arenas directly next to each other. I've never seen a group raiding there.
The highest number of Players queuing over the last month was 1.
I really don't get that System. I don't know to which Arenas I should go because I can't see if I will meet Players there. Recommended Group Sizes of 10 are utopic.
Imo they need to at least connect Arenas during Raids, or show at far distance how many Players are queuing. I don't get how Niantic think of their Raid System. Currently its worthless to me.
​
Just something I wanted to get out... | 0non-cybersec
| Reddit |
What happens if you mix molten glass and metal?. As I've found out iron (for example) and glass would be both liquid at about 1600° C. I'd guess it would form some inhomogeneous mass. How would it look like if you stir it very well and let it cool down? | 0non-cybersec
| Reddit |
How to show a loading graphic/animation when wpf data binding is taking place. <p>I have a WPF user control that contains a <code>DataGrid</code>. I'm binding an <code>ObservableCollection</code> of view models to it. Each view model has another collection of view models that I'm using to bind another <code>DataGrid</code> to. So the effect is a <code>DataGrid</code> with a nested <code>DataGrid</code> contained in the row details template.</p>
<p>Normally the binding is quite quick, but sometimes when there's a lot of data it can hang the UI while the binding/drawing is taking place. </p>
<p>Is there a way where I can either show a loading animation or progress bar while the binding/drawing is in progress?</p>
| 0non-cybersec
| Stackexchange |
__doPostBack is undefined in IE11. <p>Using a readymade asp HyperLink control, IE 11 is giving the error SCRIPT5009: __doPostBack is undefined with a link to here:
<a href="http://msdn.microsoft.com/en-us/library/ie/xyf5fs0y(v=vs.94).aspx">http://msdn.microsoft.com/en-us/library/ie/xyf5fs0y(v=vs.94).aspx</a></p>
<p>This is seen in the F12 devtools console window. </p>
<p>Has anybody encountered this yet and is there a fix? This is a production environment.</p>
<p><strong>EDIT</strong>:
Applying hotfix <a href="http://support.microsoft.com/kb/2600088">http://support.microsoft.com/kb/2600088</a> didn't work for me, and IE 10 on Windows 8 works fine. </p>
<p>There is more recent article from Scott Hanselman with updated information. <a href="http://www.hanselman.com/blog/IE10AndIE11AndWindows81AndDoPostBack.aspx">http://www.hanselman.com/blog/IE10AndIE11AndWindows81AndDoPostBack.aspx</a> I will attempt these fixes and update this question but this appears to be isolated to windows 8.1 and IE11.</p>
| 0non-cybersec
| Stackexchange |
questions on polynomial Lagrange Interpolation of order $n$?. <p>I ran in One Ex in my book when I prepare for final exam on numerical method. how can help me how we solve such a problem?</p>
<p>if $P(x)$ and $Q(x)$ be two polynomial Lagrange Interpolation of order $n$ in Nodal points {$ (x_i, y_i):i=0,...,n \}$ and { $(x_i, y_i):i=1,...,n+1 \}$. what is the polynomial Lagrange Interpolation of at most order $n+1$ for nodal point { $(x_i, y_i):i=0,...,n+1 \}$</p>
| 0non-cybersec
| Stackexchange |
Community Thread: 03/04/2019. What are you up to? Share with your e-friends! What's that shiny new piece of equipment?
Show off cool stuff you've created. We want to see and discuss your pictures, videos, website...or anything, really!
If you've got interesting links to stuff created by someone else we'd love to discuss that too!
| 0non-cybersec
| Reddit |
In C, is it possible do free only an array first or last position?. <p>I've an array, but I don't need its first (or last) position. So I point a new variable to the rest of the array, but I should free the array first/last position. For instance:</p>
<pre><code>p = read_csv_file();
q = p + 1; // I don't need the first CSV file field
// Here I'd like to free only the first position of p
return q;
</code></pre>
<p>Otherwise I've to memcpy the array to other variable, excluding the first position, and then free the original array. Like this:</p>
<pre><code>p = read_csv_file();
q = (int*) malloc(sizeof(int) * (SOME_SIZE - 1));
memcpy(q, p+1, sizeof(int) * (SOME_SIZE - 1));
free(p);
return q;
</code></pre>
<p>But then I'll have the overhead of copying all the array.</p>
<p>Is this possible to only free a single position of an array?</p>
| 0non-cybersec
| Stackexchange |
ClickOnce application does not update or launch. <p>I have a <a href="http://en.wikipedia.org/wiki/Windows_Forms" rel="nofollow noreferrer">Windows Forms</a> application that I have deployed using ClickOnce, but the users navigate to a network drive and double click on setup.msi instead of using a webpage to install it.</p>
<p>I have two users that have it installed and it's worked in the past. I did an uppate last week and now when the users try to launch the application the window that says "Verifying Application Requirements" pops up, and then when it disappears nothing happens. The dialog that is asking if it's OK to update never pops up.</p>
<p>The network people have verified that they have permissions on the network drive (though, I would expect an error message if this were the issue).</p>
<p>What could cause this to happen?</p>
| 0non-cybersec
| Stackexchange |
Coworker says every morning "good morning fam.". | 0non-cybersec
| Reddit |
From a hike in Bodø, Norway last summer. | 0non-cybersec
| Reddit |
Primitive element theorem for division rings extension. <p>Assume that <span class="math-container">$A \subseteq B$</span> are division <span class="math-container">$k$</span>-algebras, where <span class="math-container">$k$</span> is a field of characteristic zero.
Further assume that <span class="math-container">$A$</span> has the IBN property (does a division ring 'automatically' have the invariant basis number property?).</p>
<p>One version of the <a href="https://en.wikipedia.org/wiki/Primitive_element_theorem" rel="nofollow noreferrer">primitive element theorem</a> says that a finite separable field extension <span class="math-container">$F \subseteq E$</span> has a primitive element, namely, there exists an element <span class="math-container">$e_0 \in E$</span> such that <span class="math-container">$E=F(e_0)$</span>.</p>
<p>Now, according to the comments in <a href="https://math.stackexchange.com/questions/2424025/dimension-of-division-rings-extension#comment5010707_2424025">this question</a>, the rank of <span class="math-container">$B$</span> as an <span class="math-container">$A$</span>-module is well-defined.</p>
<blockquote>
<p>Is there an analogue theorem to the primitive element theorem for such division algebras?</p>
</blockquote>
<p>Namely, if <span class="math-container">$A \subseteq B$</span> has finite rank and if it is 'separable',
then there exists <span class="math-container">$b \in B$</span> such that <span class="math-container">$B=A[b]$</span> (the finiteness of rank implies that <span class="math-container">$b$</span> is 'left' algebraic over <span class="math-container">$A$</span>).</p>
<p>I am not sure if I know what 'separable' should mean. There is the notion of a separable algebra over a commutative algebra. It is easy to see that a division algebra <span class="math-container">$D$</span> over a field <span class="math-container">$k$</span> is separable, since the kernel of the canonical map <span class="math-container">$D \otimes_k D \to D$</span>, <span class="math-container">$d_1 \otimes_k d_2 \mapsto d_1d_2$</span>,
is zero. Therefore, each of <span class="math-container">$A$</span> and <span class="math-container">$B$</span> is separable over <span class="math-container">$k$</span>. What should be the meaning for <span class="math-container">$B$</span> separable over <span class="math-container">$A$</span>?</p>
<p>Any comments are welcome!</p>
| 0non-cybersec
| Stackexchange |
ITAP of taco shop in Tulum Mexico. | 0non-cybersec
| Reddit |
NSV that's admittedly a bit strange.. Today I finally realized that I am dairy intolerant. I've always kind of known what it did to me(it, uh, throws a wrench in my gears in ya know what I mean), but I never thought that it was something that my body could just naturally be reacting to. Since I've started on a, mostly, dairy free diet I have felt much better in the gastrointestinal department.
This made me realize how much easier it will be to resist dairy products! I am actually pretty excited. Before I started this, dairy products like cheese and ice cream where a MAJOR source of excess calories. This helps me finally have a definite aversion to dairy allowing me to avoid it easily. I don't crave it nearly as much as I did before. I know I will occasionally miss cheese and ice cream, and I know I'll eat it every once in a while, but my days of regularly consuming it are most likely over!
I just really needed to share that, because you gotta take all the motivation you can get, where ever you can get it! | 0non-cybersec
| Reddit |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.