text
stringlengths 36
35k
| label
class label 2
classes | source
stringclasses 3
values | tokens_length
int64 128
4.1k
| text_length
int64 36
35k
|
|---|---|---|---|---|
Let $\mathcal M_n (\mathbb R)$ be the set of all square matrices of order $n$. Show that $\|AB\| \le \|A\| \|B\|$. <p>Good night, I'm trying to solve this exercise:</p>
<blockquote>
<p>Let <span class="math-container">$\mathcal M_n (\mathbb R)$</span> be the set of all square matrices of order <span class="math-container">$n$</span>. Show that <span class="math-container">$\langle A,B \rangle := \operatorname {tr} (A^T B)$</span> is an inner product on <span class="math-container">$\mathcal M_n (\mathbb R)$</span> such that <span class="math-container">$\|AB\| \le \|A\| \|B\|$</span>.</p>
</blockquote>
<p>Could you please verify if my proof of <span class="math-container">$\|AB\| \le \|A\| \|B\|$</span> looks fine or contains logical gaps/errors? Thank you so much for your help!</p>
<hr>
<p><strong>My attempt:</strong></p>
<p>We have <span class="math-container">$$\|A\|^2 = \operatorname {tr} (A^T A) =\sum_{i=1}^{n} \sum_{j=1}^{n} a_{ij}^2$$</span></p>
<p>As such,</p>
<p><span class="math-container">$$\begin{align}
\|AB\|^2 &=\sum_{i=1}^{n} \sum_{j=1}^{n}\left(\sum_{k=1}^n a_{ik} b_{kj} \right)^2
&&\le \sum_{i=1}^{n} \sum_{j=1}^{n} \left [ \left(\sum_{k=1}^n a_{ik}^2 \right ) \left (\sum_{k=1}^n b_{kj}^2 \right) \right ]
\\
&=\sum_{i=1}^{n} \left[ \left ( \sum_{k=1}^n a_{ik}^2 \right ) \cdot \left (\sum_{j=1}^{n} \sum_{k=1}^n b_{kj}^2 \right ) \right ]
&&= \left (\sum_{j=1}^{n} \sum_{k=1}^n b_{kj}^2 \right ) \cdot \left( \sum\limits_{i=1}^{n} \sum_{k=1}^n a_{ik}^2 \right )
\\
&=\|B\|^2 \|A\|^2 &&=\|A\|^2 \|B\|^2
\end{align}$$</span></p>
| 0non-cybersec
| Stackexchange | 659 | 1,612 |
Last doubts (1st PC Build). ###Build Help/Ready:
Hey everybody.
(1st off all, sorry for any English mistake, it's not my native language)
I'm buildind my first PC ever and after many research days, this is what i ended up with. I'm still doubtful in some components, especially the GRAPHIC CARD and the MONITOR.
Pcpartpicker could not find the case that i choose, i'm probably going for a "ATX Nox Hummer MC black 7" (please tell me if there's a better option to fit all these components).
**What is your intended use for this build? The more details the better.**
|70% Gaming |20% TV Shows, movies, ect| 10% Browsing|
**If gaming, what kind of performance are you looking for? (Screen resolution, FPS, game settings)**
I only play League of Legends (because i'm kinda restricted
with this laptop). When i finish my PC i'l probably would like to play GTA, FIFA, CS GO, COD, FALLOUT, ect. So FPS is the priority here ( i suppose).
**What is your budget (ballpark is okay)?**
I'm planning to spend around 1400€ (~1570$), PC + Monitor only.
**In what country are you purchasing your parts?**
Portugal
**Post a draft of your potential build here (specific parts please). [Consider formatting your parts list.](http://www.reddit.com/r/buildapc/wiki/pcpp) Don't ask to be spoonfed a build (read the rules!)**.
[PCPartPicker part list](http://pcpartpicker.com/list/b9FLcc) / [Price breakdown by merchant](http://pcpartpicker.com/list/b9FLcc/by_merchant/)
Type|Item|Price
:----|:----|:----
**CPU** | [Intel Core i5-6600K 3.5GHz Quad-Core Processor](http://pcpartpicker.com/product/gx648d/intel-cpu-bx80662i56600k) | $227.99 @ SuperBiiz
**CPU Cooler** | [CRYORIG H7 49.0 CFM CPU Cooler](http://pcpartpicker.com/product/93Crxr/cryorig-cpu-cooler-h7) | $34.99 @ Newegg
**Motherboard** | [MSI Z170A GAMING PRO ATX LGA1151 Motherboard](http://pcpartpicker.com/product/Qn7CmG/msi-motherboard-z170agamingpro) | $170.00
**Memory** | [G.Skill Ripjaws V Series 16GB (2 x 8GB) DDR4-3000 Memory](http://pcpartpicker.com/product/3CdFf7/gskill-ripjaws-v-series-16gb-2-x-8gb-ddr4-3000-memory-f4-3000c15d-16gvkb) | $78.99 @ Newegg
**Storage** | [Crucial MX300 525GB 2.5" Solid State Drive](http://pcpartpicker.com/product/2VWrxr/crucial-mx300-525gb-25-solid-state-drive-ct525mx300ssd1) | $119.99 @ Newegg
**Storage** | [Western Digital Caviar Blue 1TB 3.5" 7200RPM Internal Hard Drive](http://pcpartpicker.com/product/MwW9TW/western-digital-internal-hard-drive-wd10ezex) | $48.71 @ OutletPC
**Video Card** | [MSI GeForce GTX 1060 6GB 6GB GAMING X Video Card](http://pcpartpicker.com/product/JVWrxr/msi-geforce-gtx-1060-6gb-gaming-x-video-card-geforce-gtx-1060-gaming-x-6g) | $289.99 @ SuperBiiz
**Power Supply** | [Corsair RMx 650W 80+ Gold Certified Fully-Modular ATX Power Supply](http://pcpartpicker.com/product/Rp8H99/corsair-power-supply-cp9020091na) | $89.99 @ Newegg
**Operating System** | [Microsoft Windows 10 Home OEM 64-bit](http://pcpartpicker.com/product/wtgPxr/microsoft-os-kw900140) | $84.88 @ OutletPC
**Case Fan** | [Corsair Air Series AF140 Red 66.4 CFM 140mm Fan](http://pcpartpicker.com/product/YLtCmG/corsair-case-fan-co9050017rled) | $12.89 @ OutletPC
**Monitor** | [Asus VG248QE 24.0" 144Hz Monitor](http://pcpartpicker.com/product/rkphP6/asus-monitor-vg248qe) | $219.99 @ Best Buy
| *Prices include shipping, taxes, rebates, and discounts* |
| Total (before mail-in rebates) | $1408.41
| Mail-in rebates | -$30.00
| **Total** | **$1378.41**
| Generated by [PCPartPicker](http://pcpartpicker.com) 2016-09-30 20:37 EDT-0400 |
**Provide any additional details you wish below.**
Please let me know if you would change anything (and why) because i stll feel like a newbie here.
I think i checked the
compatibility between all the components but tell me if i'm wrong (given that i choose the NOX Hummer MC 7 case)
Thank you all and please help me with anything you think i'm failing here! | 0non-cybersec
| Reddit | 1,372 | 3,918 |
Reasons for irregular—sporadically slow to fast—USB flash drive transfer speeds. <p>One of my USB flash drive (Sandisk 256 GB USB 3.0) is showing quite irregular transfer speeds for larger files (~4GB per file), on my Surface Pro 6. There are no other resource-intensive processes running, and the machine is plugged in. Both the USB flash drive and the Surface's SSD are NTFS formatted.</p>
<p>I am wondering, what could be potential reasons for this behaviour, and are there ways to fix this? Defrag? Driver Update? Shorter File Names? Other performance settings?</p>
<p>These are graphs for one individual 4GB file each:</p>
<p><a href="https://i.stack.imgur.com/Plfau.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Plfau.png" alt="88% complete."></a></p>
<p><a href="https://i.stack.imgur.com/Osmb5.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Osmb5.png" alt="77% complete."></a></p>
| 0non-cybersec
| Stackexchange | 287 | 934 |
Is there a way to improve sharpness in your hearing?. I've realized in social situations where there is a lot of loud noises, a lot of people talking all at once it, or if the person talking to me tries to whisper something at me I can hear him talking but I can't tell exactly what the person said. I would have to ask the person to repeat it again once or twice until my brain fully registers what the person said and sometimes it irritates the person having to repeat it again that they just tell me to forget about it. Are there any books that you know of that could help with understanding how to improve sharpness in hearing? | 0non-cybersec
| Reddit | 135 | 632 |
URL shortening algorithm. <p>Now, this is not strictly about URL shortening, but my purpose is such anyway, so let's view it like that. Of course the steps to URL shortening are:</p>
<ol>
<li>Take the full URL</li>
<li>Generate a unique short string to be the key for the URL</li>
<li>Store the URL and the key in a database (a key-value store would be a perfect match here)</li>
</ol>
<p>Now, about the second point. Here's what I've come up with:</p>
<pre><code>ByteArrayOutputStream baos = new ByteArrayOutputStream();
DataOutputStream dos = new DataOutputStream(baos);
UUID uuid = UUID.randomUUID();
dos.writeLong(uuid.getMostSignificantBits());
String encoded = new String(Base64.encodeBase64(baos.toByteArray()), "ISO-8859-1");
String shortUrlKey = StringUtils.left(encoded, 6); // returns the leftmost 6 characters
// check if exists in database, repeat until it does not
</code></pre>
<p>Is this good enough?</p>
| 0non-cybersec
| Stackexchange | 275 | 925 |
Limit of time derivative in linear parabolic equation. <p>$M^n$ , $n\ge 1$ , is a compact n-dimensional manifold without boundary. $F_0: M^n\rightarrow \mathbb R^{n+1}$ is smoothly immersion with nonnegative mean curvature. Deform $F(x,t)$ by
$$
\partial_t F(x,t) = \Delta_g F+ F \\
F(\cdot , 0)=F_0~~~~~~~~
$$<br>
$\Delta_g$ is Laplace-Beltrami operator. If the solution exist for all $t\ge0$. Then, how to show
$
\partial_t F \rightarrow 0
$
as $t\rightarrow \infty$ ?</p>
<p>This question is origin from Huisken's <a href="http://dx.doi.org/10.4310/jdg/1214444099" rel="nofollow noreferrer"><strong>Asymptotic behavior for singularities of the mean curvature flow</strong></a>. In fact, Huisken want to prove the limit of $F$ is a sphere. First , he proves the limit manifold $F_\infty(M^n)$ satisfies
$$
H=\langle F, \nu\rangle
$$
$H$ is the mean curvature , $\nu$ is normal vector, $\langle \cdot,\cdot \rangle$ is Euclid inner. For proving this, he needs a monotonicity formula. In my view , the monotonicity formula is not easy to think. And obviously, there is a intuitional way. If we have $\partial _t F \rightarrow 0$, because $\Delta_g F=-H\nu$, we can easily get $H=\langle F, \nu\rangle$ in the limit manifold. Maybe, this is too strong, just $\langle \partial _t F ,\nu \rangle \rightarrow 0$ is enough.</p>
| 0non-cybersec
| Stackexchange | 431 | 1,332 |
Bring up the baby question, or let it go?. ETA tl;dr: In LTR that is going to end in marriage, could go either way on whether to have or not have babies, bring it up with my boyfriend or leave the subject alone since it isn't a dealbreaker for me?
I am a 32 y.o. childless female, he is a 38 y.o. male with a 10 y.o. son from his first marriage. For all intents and purposes, we have been together for a bit over 2 years. We are 19 months into a 3 year LDR, I had to leave for school, with plans to live together while I intern in his city this summer and then full-time after I graduate in 2012. We are not officially engaged, but our eventual marriage is a foregone conclusion.
I have spent most of my adult life vacillating on my position on children. As a child myself, I knew I wanted to be a wife and mommy when I grew up. I married young, and during the 16 months that that marriage lasted my then-husband and I unsuccessfully tried to start a family. I then got into a 7 1/2 year relationship with a man with grown children and a vasectomy. I did a lot of soul searching and eventually decided I would rather have the relationship with my then-boyfriend than the possibility of children. I even went through a phase of very vehemently not wanting children, as I enjoyed the freedom of my child-free lifestyle. At about 28 the biological clock started ticking though, and I told my then-boyfriend that if we were still together when I was 35 I was going to order some sperm popsicles and a turkey baster, and he could help raise the baby with me or not. Within a year or two though, the clock seemed to have broken.
So for the couple years since then (and for the entire time I have been with my boyfriend) I have been just without a desire one way or the other on the matter. I have known that if a pregnancy were to transpire I would be happy about it, though the timing right now would be quick frankly atrocious, but I have not actively wanted a baby enough to try for one or for it to be a deal-breaker in my relationship. I should note that as far as I am concerned, at this point I have a 10 y.o. son, and I love him dearly. But I did miss out on the first 8 years of his life.
My boyfriend has mentioned a vasectomy, so I infer from that that he is done, but we have never actually discussed having any more children. I've never brought it up because it's never really been an issue for me, I've figured if he decides he wants more children I'll be happy to go there, and if he decides he is done I'm okay with that too. Today though, I was on a forum where suddenly a LOT of women are announcing their pregnancies, and the idea of never having that myself did make me a little sad. I think I do want at least one more child more than I an admitting to myself. At the same time though, more children would only be icing on the cake, I am wholly happy and content with the little family that I have now. There is nothing in the world I would choose over them.
So all that being said, do I even bother discussing this with my boyfriend? And if I do bring this up, how do I make it clear that whatever decision we make is together? Because he always wants my happiness about all else, and I am concerned that if he knows that I would like to try for a baby he will say of course just to see the smile on my face. I am sure that he would love that child, but I don't want him to go there just for me. | 0non-cybersec
| Reddit | 814 | 3,418 |
Permissions problem with BULK INSERT. <p>We are getting the following error when trying to use <code>BULK INSERT</code>.</p>
<blockquote>
<p>Msg 4861, Level 16, State 1, Line 10 Cannot bulk load because the file
"\filer\share\loadfile.txt" could not be opened. Operating system
error code 5(Access is denied.).</p>
</blockquote>
<p>When we check the security on the directory <code>everyone</code> is listed as having full access and in fact we have confirmed this by trying to open the file manually as myself, another DBA, one of the devs, and the service account running the instance. We also get the error when attempting to run the BULK INSERT myself, the other DBA, the dev and a sysadmin SQL login I created to run the test.</p>
<p>The instance is SQL Server 2008 R2</p>
<p>The code is: </p>
<pre><code> CREATE TABLE #Temp1 (CodeNum VarChar(10), Cost Money)
BULK INSERT #Temp1
FROM '\\filer\share\loadfile.txt'
WITH (
FIELDTERMINATOR = ',',
ROWTERMINATOR = ';\n'
);
GO
</code></pre>
<p>Can anyone give me some direction on where my security issue is?</p>
| 0non-cybersec
| Stackexchange | 339 | 1,124 |
Endomorphism Rings in Ring vs R-Mod. <p>Let $M$ be an $R$-module. </p>
<p>Considering $M$ as an abelian group, forgetting the $R$-action on $M$, we can unambiguously write $\mathsf{End}(M)$ to denote the endomorphism ring with addition defined as in $M$ and composition as the multiplication operation. </p>
<p>Next, considering $M$ as an $R$-module, we can write $\mathsf{End}_R(M)$ for the endomorphism ring of $R$-maps, that is, $\mathsf{End}_R(M) := \mathsf{Hom}_R(M,M)$.</p>
<p>Finally, we can consider the abelian group $M$ as a $\mathbb{Z}$-module and in this case we can write $\mathsf{End}_{\mathbb{Z}}(M)$ to denote the corresponding endomorphism rings.</p>
<p>So, we have three different endomorphism ring structures and I'm trying to understand precisely how they are related. Rotman, in Advanced Modern Algebra states that $\mathsf{End}_R(M)$ is in fact a subring of $\mathsf{End}_{\mathbb{Z}}(M)$ but I don't really see this. What's a good way to think about these three endomorphism rings and how they are related?</p>
| 0non-cybersec
| Stackexchange | 303 | 1,038 |
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 | 349 | 1,234 |
Wanted, dead or alive: Have you seen this curve? (circular variant of cardioid). <p>Let me start with the context. This is definitely <em>not</em> a "research level" question, but I'm hoping that the research community will be able to settle for me whether or not a particular construction has been done before or not. I'm also hoping that the wider context will mean that this question doesn't get closed instantaneously.</p>
<p>I do an extension class with 10/11 year olds, not selected for their interest in mathematics (ie it's just a regular class). One of the activities I get them to do is to draw a cardioid by joining points on a circle with straight lines. One pair decided that instead of using straight lines, they would use curves instead. The resulting picture is similar to a cardioid, but is not the same.</p>
<p>My goal is to be able to say to them one of two things:</p>
<p>Either:</p>
<blockquote>
<p>"Well done! You took the construction and <em>played</em> with it, seeing what else you could make. That's exactly what mathematicians do. What you've discovered is called the <em>hyperlogical antiometric cardiobloid</em> and it was first made in 1832 by de Grundie. It's linked to <em>hyperlogical geometry</em> which is a really key area of mathematics."</p>
</blockquote>
<p>Or:</p>
<blockquote>
<p>"Well done! You took the construction and <em>played</em> with it, seeing what else you could make. That's exactly what mathematicians do. What you've discovered is quite probably completely new! No-one I've asked has heard of it. That's brilliant! What would you like to call it?"</p>
</blockquote>
<p>But to say either one, I need to know if this has been seen before. Note that it doesn't matter what the answer is, and also please note that I'm not claiming that the curve itself has any intrinsic value. Its value is purely extrinsic in that I can use it to show the students what being a real mathematician is like.</p>
<p>Without further waffle, here's a more precise construction.</p>
<p>On a circle, draw an arc between $\theta$ and $2 \theta$ so that the arc meets the circle at right-angles (in the manner of the Poincaré disc model of hyperbolic geometry - indeed, if this has been seen before then "curve stitching in hyperbolic space" seems a likely candidate). This draws out an envelope, just as the straight-line version draws a cardioid. In actual fact, one can draw the full circles - not just the arcs - and get another part of the curve outside the original circle.</p>
<p>Using the theory of envelopes, and sticking stuff into Sagemath, I found an equation of the curve:</p>
<p>$$
\begin{align}
x^8 + y^8 &+ 16x^7 + 4(x^2 + 4x + 19)y^6 + 76x^6 + 48x^5 \\
&+ 6(x^4 + 8x^3 + 38x^2 + 8x - 47)y^4 - 282x^4 + 48x^3\\
&+ 4(x^6 + 12x^5 + 57x^4 + 24x^3 - 141x^2 + 12x + 19)y^2 + 76x^2 + 16x + 1 = 0
\end{align}
$$</p>
<p>Using Geogebra, I drew a diagram showing the curve and its construction:</p>
<p><a href="https://i.stack.imgur.com/UolsG.png"><img src="https://i.stack.imgur.com/UolsG.png" alt="Hyper cardioid"></a></p>
<p>Any pointers will be gratefully received, (but please note that I no longer have access to paywalled articles (nor to MathSciNet) so if you supply references please try to find accessible ones).</p>
| 0non-cybersec
| Stackexchange | 972 | 3,311 |
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 | 349 | 1,234 |
Cant redeem game case PS+ codes....?. I have about 14 disc based games, most came with a 7 day free trial of PS+, and 3 of them have a 1 month (Destiny, LBP3, and TLOU i think it was)
Now I never used these, left them in the game case, seeing as how PS+ stacks with whatever and my 1 year just ran out a few days ago, I figured I could use these to gain some free PS+ for the time being...
There's just one thing... NONE of these codes work...
None of the 3 7 day codes, and neither do the 30 day codes, now ive NEVER touched these at all, and they all have an expiration of 12/31/2015.... It says invalid code or redeemed already ... wth?
Why are invalid codes in here? ;___; | 0non-cybersec
| Reddit | 183 | 677 |
Why are so few things @specialized in Scala's standard library?. <p>I've searched for the use of <code>@specialized</code> in the source code of the standard library of Scala 2.8.1. It looks like only a handful of traits and classes use this annotation: <code>Function0</code>, <code>Function1</code>, <code>Function2</code>, <code>Tuple1</code>, <code>Tuple2</code>, <code>Product1</code>, <code>Product2</code>, <code>AbstractFunction0</code>, <code>AbstractFunction1</code>, <code>AbstractFunction2</code>.</p>
<p>None of the collection classes are <code>@specialized</code>. Why not? Would this generate too many classes?</p>
<p>This means that using collection classes with primitive types is very inefficient, because there will be a lot of unnecessary boxing and unboxing going on.</p>
<p>What's the most efficient way to have an immutable list or sequence (with <code>IndexedSeq</code> characteristics) of <code>Int</code>s, avoiding boxing and unboxing?</p>
| 0non-cybersec
| Stackexchange | 278 | 974 |
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 | 349 | 1,234 |
Replacing a 3 Way Switch with unlabeled wires. I have 2 3 way switches hooked up to a light in my hallway. Currently, they do not work the way 3 way switches should.
The wires are not color coded, they are all black. I know how to install a 3 way switch when i know what ground, neutral and hot are, however there is no way to tell by looking at them.
Since they dont work as they should, they obviously arent wired the right way, so i cant just replace the switches with new ones and wire them identical. What is the best way to test these wires to see which is which? | 0non-cybersec
| Reddit | 139 | 574 |
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 | 349 | 1,234 |
Switching from version 4.3.11.Final to 5.0.1.Final causes compilation error. <p>I am trying to upgrade my Hibernate version from</p>
<pre><code><dependency>
<groupId>org.hibernate</groupId>
<artifactId>hibernate-core</artifactId>
<version>4.3.11.Final</version>
</dependency>
</code></pre>
<p>to</p>
<pre><code><dependency>
<groupId>org.hibernate</groupId>
<artifactId>hibernate-core</artifactId>
<version>5.0.1.Final</version>
</dependency>
</code></pre>
<p>Unfortunately by compiling I get the following error.</p>
<blockquote>
<p>TestDao.java:[5,25] cannot find symbol</p>
<p>[ERROR] symbol: class Transactional</p>
<p>[ERROR] location: package javax.transaction</p>
</blockquote>
<p>I have been struggling with it for over an hour now.</p>
<p>I have tried adding package <code>spring-tx</code> but it did not help.</p>
<pre><code><dependency>
<groupId>org.springframework</groupId>
<artifactId>spring-tx</artifactId>
<version>4.2.1.RELEASE</version>
</dependency>
</code></pre>
<p>Did anyone face a similar issue?</p>
| 0non-cybersec
| Stackexchange | 444 | 1,204 |
Alignment of multiple elements with indentation. <p>I'm trying to typeset an optimization problem that uses variable conditioned constraints (vif) in combination with normal constraints. My current syntax (of a part of the problem) is </p>
<pre><code>\begin{align*}
\max \sum_{i \in I} z_i \\
\text{subject to} \\
x_i^0 &= x_i^{\text{start}} &&\forall i \in I, \\
l_i^t + r_i^t + c_i^t &= 1 &&\forall t = 0,...,N-1, i \in I, \\
\text{vif } v_i^t = 1 \text{ then} \\
x_j^t - x_i^t &\leq \epsilon \\
\text{else} \\
x_j^t - x_i^t &\geq \epsilon + \hat{\epsilon}\\
\text{end} &&&\forall t=0,...,N-1, i,j \in I: i < j, \\
k_i^t &= \sum_{j \in I \setminus \{i\}} v_{\min(i,j),max(i,j)}+1+c_i^t &&\forall t=0,...,N-1, i \in I, \\
\end{align*}
</code></pre>
<p>which displays
<a href="https://i.stack.imgur.com/qo5Dj.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/qo5Dj.png" alt="misplaced end and else"></a></p>
<p>I would like to have the <code>else</code> and the <code>end</code> aligned to the left (like the <code>vif</code> is already) while maintaining the slight indent for the line underneath the <code>vif</code>. If I try to put an ampersand in front of the <code>else</code> or <code>end</code> however, I cannot manage to align the other equations around the <code>=</code> or <code>\geq</code> signs properly. A satisfactory result would look roughly like this (I edited the picture) <a href="https://i.stack.imgur.com/XCJA3.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/XCJA3.png" alt="edited picture"></a> </p>
<p>How can such indentation be achieved while keeping the constraints aligned in this way?</p>
| 0non-cybersec
| Stackexchange | 637 | 1,728 |
cd to a directory and execute many commands. <p>I have following script. </p>
<pre><code>#!/bin/bash
mount /dev/sda6 /mnt/gentoo
set +e
cd /mnt/gentoo && mount -t proc none /mnt/gentoo/proc \
&& mount --rbind /dev /mnt/gentoo/dev \
&& mount --rbind /sys /mnt/gentoo/sys \
&& chroot /mnt/gentoo /bin/bash \
&& source /etc/profile \
&& export PS1="(chroot)$PS1"
</code></pre>
<p>What I am trying to accomplish here is to change to a directory <code>/mnt/gentoo</code> and execute few commands. This works ok first time when none of the path were mounted. But if I run it after mounting has been successfully performed on some paths, it does not continue and stops on first failure. I want all commands to be executed even if mount is failing due to 'already mounted' error. How can I do this? </p>
<p>Also is there a better way than combining all these commands together in one line? </p>
| 0non-cybersec
| Stackexchange | 304 | 946 |
Bending arrows in Tikz. <p>In <code>Tikz</code>, I would like to bend an arrow like the one between <code>$H_2O$</code> and <code>$O_2$</code> in this figure:</p>
<p><img src="https://i.stack.imgur.com/1D1So.gif" alt="enter image description here"></p>
<p>I'm able to have a bended line between <code>$H_2O$</code> and <code>$O_2$</code>, but it's not touching the photophosphorylation node…</p>
<p>How can I do that?</p>
| 0non-cybersec
| Stackexchange | 163 | 425 |
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 | 349 | 1,234 |
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 | 349 | 1,234 |
Randomize number on click but never the same number. <p>I want to random a number on clicking <code>button</code> but I don't want same numbers to be randomized any solutions?</p>
<pre><code> $('button').click(function(){
var nomeri = Math.floor(Math.random() * 100);
}
</code></pre>
<pre class="lang-html prettyprint-override"><code><button>დამაკლიკე</button>
</code></pre>
| 0non-cybersec
| Stackexchange | 135 | 394 |
JPA/EclipseLink: Does EntityManager.getTransaction() create a new transaction or return the active one?. <p>I am using EclipseLink 2.3.0. I have a method that I am calling from a unit test (hence outside of a container, no JTA) that looks like this:</p>
<pre><code>EntityManager em = /* get an entity manager */;
em.getTransaction().begin();
// make some changes
em.getTransaction().commit();
</code></pre>
<p>The changes were NOT being persisted to the database, and looked at this for a long time and finally realized that EntityManager.getTransaction() is actually returning a NEW EntityTransaction, rather than the same one in both calls. The effect is that the first call creates a new transaction and begins it, and the second call creates ANOTHER transaction and commits it. Because the first transaction was never committed, the changes are not saved. We verified this like this:</p>
<pre><code>log.info(em.getTransaction().toString());
log.info(em.getTransaction().toString());
</code></pre>
<p>Which resulted in these log messages:</p>
<pre><code>INFO: org.eclipse.persistence.internal.jpa.transaction.EntityTransactionImpl@1e34f445
INFO: org.eclipse.persistence.internal.jpa.transaction.EntityTransactionImpl@706a4d1a
</code></pre>
<p>The two different object ID's verifying that there are two different instances. Changing the code to this:</p>
<pre><code>EntityManager em = /* get an entity manager */;
EntityTransaction tx = em.getTransaction();
tx.begin();
// make some changes
tx.commit();
</code></pre>
<p>... remedied the problem. Now when I run the code, I see the SQL statements generated to do the database work, and looking in the database, the data has been changed.</p>
<p>I were a bit surprised by this outcome, since I have seen numerous code examples online (for JPA generally and for EclipseLink specifically) that recommend the code we used for managing transactions. I searched far and wide for information specifically about this but have not found anything. So what's going on?</p>
<p>I looked in the JPA spec for something that specifies exactly what getTransaction() does and it was not specific if the transaction is new or the same. Is there a setting in persistence.xml that controls this? Is the behavior specific to each implementation of the JPA spec?</p>
<p>Thanks so much for any information or guidance.</p>
| 0non-cybersec
| Stackexchange | 609 | 2,372 |
Re-position windows when going from two screens to one. <p>So long story short, at work I use my MacBook Pro and I connect it to another, bigger monitor. I use a shared screen setup so I can drag windows back and forth between the two monitors, but when I get home I use the Mac by itself, with no external display. </p>
<p>When I leave work, I never really turn off my MacBook Pro. I just disconnect the cable that connects the laptop to the monitor, close the Mac, and leave.</p>
<p>The problem is that when I get home and open the Mac, the windows that were on the external monitor while at work now are off-screen. (I can for example see a tiny bit of the side of the window, so it is hard to grab said window to move it into the middle of my laptop's internal display.)</p>
<p>Is there a way/setting/method so that when I disconnect the second screen, everything that was on the external screen moves fully to the MacBook Pro screen?</p>
<p>For example on my home workstation, I run a 3 monitor Windows setup and as soon as any of those are disconnected, all that monitor's assets are shifted to the main screen. I'm wondering if apple has anything similar.</p>
<p><strong>EDIT</strong>: another thing that's a bit annoying is that if I enlarged a window on the bigger monitor and drag it from the side to the center when going from 2 screens to 1, I sometimes have to resize with the resize handle on the bottom-right. When that's off-screen, I have to close the window and reopen it.</p>
| 0non-cybersec
| Stackexchange | 371 | 1,500 |
Rejoin words breaked by hyphen and double newline characters. <p>I have converted some PDF files to text by Calibre. Sample text as below:</p>
<pre><code>The booming population, coupled with a development strategy pre-
mised on high levels of investment, meant that an increasingly large pop-
ulation would be condemned indefinitely to living standards barely above
subsistence level.
</code></pre>
<p>I just want to combine words "premised" and "population", the pattern should be "-\n\n". But I can't replace the words by <code>perl -p -e 's/-\n\n//</code> or <code>tr -d '\-\n\n'</code> in the case where two newline characters follow the hyphen character. Any ideas?</p>
| 0non-cybersec
| Stackexchange | 194 | 681 |
A question on linear transformation. <p>Let $T$ be a linear transformation on $\mathbb{R}^{4}$ whose standard
matrix is
$$\left(\begin{array}{rrrr}
1 & -1 & -1 & -1\\
1 & 1 & 1 & -1\\
1 & 1 & -1 & 1\\
0 & 0 & 0 & 0
\end{array}\right).$$
Does there exist a $3$-dimensional subspace of $\mathbb{R}^{4}$,
$V$, and a linear transformation $S$ on $\mathbb{R}^{4}$ such that
$S(\mathbf{v})=T(\mathbf{v})$ for all $\mathbf{v}\in V$ and $\left\Vert S(\mathbf{x})\right\Vert _{1}\le2$
for all $\mathbf{x}\in\mathbb{R}^{4}$ with $\left\Vert \mathbf{x}\right\Vert _{1}=1$?</p>
<p>Thanks in advance for any helpful answers.</p>
| 0non-cybersec
| Stackexchange | 259 | 672 |
Installing JDK on 16.04 problem. <p>I am trying to install JDK 8 or 9, can't get either to work, so that I can use my laptop for my Java class. When I try to install it I get an error to install. This is what I have done so far: </p>
<pre><code>sudo add-apt-repository -y ppa:webupd8team/java
sudo apt-get update
sudo apt-get install oracle-java9-installer
</code></pre>
<p>and I get an error:</p>
<pre class="lang-none prettyprint-override"><code>download failed
Oracle JDK 9 is NOT installed.
dpkg: error processing package oracle-java9-installer (--configure):
subprocess installed post-installation script returned error exit status 1
Errors were encountered while processing:
oracle-java9-installer
E: Sub-process /usr/bin/dpkg returned an error code (1)
</code></pre>
<p>I've tried everything that I could find to remedy this but it all looked to be the same. This happens with version 8 or 9. Once I get this going I plan to install jGrasp since that is what I am familiar with and don't plan on any major programming.</p>
| 0non-cybersec
| Stackexchange | 299 | 1,034 |
Excel - Name Comparison. <p>I read an answer from a post submitted five years ago. In that post the individual was trying to compare the names in one spreadsheet with those in another spreadsheet and flag the differences. In that case the first and last names were in two separate columns. The poster identified the spreadsheets as F1 and F2. The formula looked pretty straight forward, but my confusion was with the name of the spreadsheets. Were they named that way for ease in setting up the formula? I have my lists in two spreadsheets in one workbook—I can change the names on the spreadsheets if necessary. Thanks for any help you can give me.</p>
| 0non-cybersec
| Stackexchange | 153 | 661 |
Startup Repair-"Windows cannot repair this computer automatically". <p>My windows would not start, so I put in my windows disk and started windows repair.
But then I got this error message...
Sorry for bad English please help me, I am using Windows 7 proffessional 64 bit by the way.
This is what I found in the problem detais:</p>
<pre><code>Problem signature:
Problem Event Name: StartupRepairOffline
</code></pre>
<p>PS.
I already did <code>chkdsk</code> and <code>sfc /scannow</code> in the command line, did not work.</p>
| 0non-cybersec
| Stackexchange | 162 | 543 |
Given AB=BA then A is diagonizable iff B is diagonalizable.(True/False). <p>Let <span class="math-container">$A$</span> and <span class="math-container">$B$</span> be two <span class="math-container">$n\times n $</span> matrices in <span class="math-container">$\mathbb{M_n}($$\mathbb{R}$</span>) such that <span class="math-container">$AB=BA$</span> ,then prove or disprove </p>
<blockquote>
<p><span class="math-container">$A$</span> is diagonizable over <span class="math-container">$\mathbb{R}$</span> if and only if <span class="math-container">$B$</span> is diagonalizable over <span class="math-container">$\mathbb{R}$</span></p>
</blockquote>
<p>Solution Ii tried - Given that <span class="math-container">$A$</span> is diagonalizable then it implies <span class="math-container">$$A=PDP^{-1},$$</span>where <span class="math-container">$P$</span> is an invertible matrix.Now by using this we have to prove that <span class="math-container">$B$</span> is also diagonalizable (don't know whether this is true or false )</p>
<p>I am stuck here how to use this information to prove or disprove this statement.</p>
<p>Please Help</p>
<p>Thankyou.</p>
| 0non-cybersec
| Stackexchange | 373 | 1,162 |
Recyclerview(Getting item on Recyclerview). <p>I've implemented SearchView + Recyclerview using this on github. <a href="https://github.com/Wrdlbrnft/Searchable-RecyclerView-Demo" rel="noreferrer">GITHUB</a><br>
My next step is to get the item on selected part on the recyclerview.<br>
Then I saw some code getting the child on recyclerview.<br>
The code is working when the getChildAt(index) =0.<br>
But when i put on index=12 or greater than that.<br>
The program crashed. </p>
<pre><code>mRecyclerView.setAdapter(mAdapter);
mRecyclerView.addOnItemTouchListener(
new RecyclerItemClickListener(getContext(), new RecyclerItemClickListener.OnItemClickListener() {
@Override
public void onItemClick(View view, int position) {
final int valueThisIteration = position;
mRecyclerView.getViewTreeObserver().addOnGlobalLayoutListener(new ViewTreeObserver.OnGlobalLayoutListener() {
@Override
public void onGlobalLayout() {
TextView textViewDrawerTitle = (TextView) mRecyclerView.getChildAt(valueThisIteration).findViewById(R.id.tvText);
textViewDrawerTitle.setText("Checked");
mRecyclerView.getViewTreeObserver().removeGlobalOnLayoutListener(this);
}
});
}
})
);
</code></pre>
<p>And im getting this error.</p>
<pre><code>11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: FATAL EXCEPTION: main
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: Process: com.thesis.juandirection.juandirectionfinale, PID: 1629
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: java.lang.NullPointerException: Attempt to invoke virtual method 'android.view.View android.view.View.findViewById(int)' on a null object reference
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at com.thesis.juandirection.juandirectionfinale.fragments.FragmentSearch$1$1.onGlobalLayout(FragmentSearch.java:94)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.view.ViewTreeObserver.dispatchOnGlobalLayout(ViewTreeObserver.java:815)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.view.ViewRootImpl.performTraversals(ViewRootImpl.java:1867)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.view.ViewRootImpl.doTraversal(ViewRootImpl.java:1054)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.view.ViewRootImpl$TraversalRunnable.run(ViewRootImpl.java:5779)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.view.Choreographer$CallbackRecord.run(Choreographer.java:767)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.view.Choreographer.doCallbacks(Choreographer.java:580)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.view.Choreographer.doFrame(Choreographer.java:550)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.view.Choreographer$FrameDisplayEventReceiver.run(Choreographer.java:753)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.os.Handler.handleCallback(Handler.java:739)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.os.Handler.dispatchMessage(Handler.java:95)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.os.Looper.loop(Looper.java:135)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at android.app.ActivityThread.main(ActivityThread.java:5221)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at java.lang.reflect.Method.invoke(Native Method)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at java.lang.reflect.Method.invoke(Method.java:372)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:899)
11-04 09:36:02.818 1629-1629/? E/AndroidRuntime: at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:694)
</code></pre>
| 0non-cybersec
| Stackexchange | 1,268 | 4,036 |
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 | 349 | 1,234 |
Where does jest localStorage implementation come from?. <p>I've created a small node app:</p>
<pre><code># package.json
{
"name": "testapp",
"version": "1.0.0",
"main": "index.js",
"scripts": {
"test": "jest"
},
"devDependencies": {
"jest": "^24.9.0"
}
}
# index.test.js
test('localStorage', () => {
localStorage.setItem('foo', 'bar');
expect(localStorage.getItem('foo')).toBe('bar');
});
</code></pre>
<p><code>npm test</code> runs without errors.</p>
<p>Searching on StackOverflow for "localStorage jest" leads to questions that deal with mocking <code>localStorage</code>; and I was under impression that Storage is a browser API that is not available in node. </p>
<p>So how come this works?</p>
| 0non-cybersec
| Stackexchange | 254 | 741 |
I am a VIP at GameStop expo, who has played bf4, TITANFALL, zoo tycoon, forza 5, kinect sports rivals, and had a LOT of hands on time with the controller. AMA. Title says all, AMA.
Edit: http://i.imgur.com/FOn0ViR.jpg
http://i.imgur.com/sZzcl9k.jpg
http://i.imgur.com/sUqazYA.jpg
More coming.
Edit 2: http://youtu.be/_jWwcrPQAGo | 0non-cybersec
| Reddit | 140 | 333 |
DVD not found error while kickstart installation on RHEL 6.5/6.4. <p>I want <code>ks.cfg</code> on dvd itself to keep everything at same place.</p>
<p>Content of <code>isolinux/isolinux.cfg</code></p>
<pre><code>label ks
menu label ^Kickstart
kernel vmlinuz
append initrd=initrd.img ks=cdrom:/ks.cfg
</code></pre>
<p>And <code>ks.cfg</code> is on top <code>/</code> of cdrom.
but when actual installation starts it says disk not found in any of cdrom.
I am creating iso with following command, </p>
<pre><code>mkisofs -o $ISO_NAME -b isolinux/isolinux.bin -c isolinux/boot.cat -no-emul-boot -boot-load-size 4 -boot-info-table -J -l -r -T -v .
</code></pre>
<p>I tried with creating new dir <code>/ks/ks.cfg</code> but it is also not working</p>
| 0non-cybersec
| Stackexchange | 279 | 756 |
Excel 2016: How to remove single axis label or gridline from chart?. <p>I have a line chart in Excel where the vertical axis is below 0 as some values of my graphs are negative. I have a label at -2.0%. The problem is the associated horizontal line at -2.0% intersects with the horizontal axis labels. </p>
<p>Is it possible to remove this line while letting all others remain? Or can I remove a single axis label (including its line)? </p>
<p>My workaround right now is to change the scale because the only other alternative I see is to have the labels above the chart, which is not what I want. </p>
| 0non-cybersec
| Stackexchange | 152 | 604 |
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 | 349 | 1,234 |
How to create dual mode usb liux, bootable and startable directly from a Windows OS as virtual machine. <p>I have found many tutorials about create a bootable live Linux image, but I whant to create a very particular USB-linux pendrive that allows me </p>
<ol>
<li><p>-to boot Linux image using the native harware if started at boot time (so not virtualized)</p></li>
<li><p>-to use the remaining space for storage purpose on Windows (so not formatted with ext filesystem)</p></li>
<li><p>-to start as virtualized OS if I try to start it from another already started OS eg Windows</p></li>
</ol>
<p>The distro that I have choosen for the installation on the pendrive is Kali, but I don't know how to do all this.</p>
<p>Someone could help me? Thanks</p>
| 0non-cybersec
| Stackexchange | 211 | 757 |
BibTeX: Putting a \href around a title leads to unwanted use of "title style" (instead of the desired "sentence style"). <p>I'm trying to have titles link to articles in bibliography entries by putting a <code>\href</code> around them that with the link. However, when I do this, it results in words in the title not getting properly put in lower case. An obvious solution would be to just put the titles in the bib file with the capitalization called for by the bibliography style, but I was wondering if there's a simple way to make BibTeX format the titles as it does normally without having to fix the titles by hand.</p>
<p>MWE:</p>
<pre><code>\documentclass{article}
\usepackage{natbib}
\usepackage{hyperref}
\begin{filecontents}{my.bib}
@unpublished{Sample,
Author = {Sample},
Title = {\href{}{A Title in Title Case}},
Year = {0000},
Note = {Note}
}
\end{filecontents}
\begin{document}
\bibliographystyle{plain}
\nocite{Sample}
\bibliography{my}
\end{document}
</code></pre>
<p>This produces undesired capitalization:</p>
<p>[1] Sample. A Title in Title Case. Note, 0000.</p>
<p>Leaving out the \href in the title produces the desired capitalization: </p>
<p>[1] Sample. A title in title case. Note, 0000.</p>
| 0non-cybersec
| Stackexchange | 375 | 1,297 |
[advice] I [23F] have recently started seeing a guy who said he has HPV. I just started seeing this guy that I really like, we've been friends for a long time and have recently hit it off. I was driving him to the airport when we finally had the chance to have a good talk and he amitted that he has HPV. He seemed very nervous and anxious to tell me, however I didn't know how to respond. I am a 23 year old female with no STI history, and he has recently got out of a long term relationship. He said he hasn't told anyone except for his ex-girlfriend, and he told me because he felt as though this could be a deal breaker in our relationship since we have not slept together yet. I admitted that I really didn't know how this could be that big of an issue, and he said we could talk more about it at a different time. Can anyone offer any advice in this situation? Is this something that should be considered a deal breaker?
| 0non-cybersec
| Reddit | 216 | 928 |
Luis Nani's wife leaves Istanbul.. Original article below, I will translate.
http://www.fotomac.com.tr/fenerbahce/2016/02/02/danielaya-ragmen-fenerde-kaldi
Nani's wife Daniela saw the offer from China as a oppurtinity and said "Let's go". But Nani, despite the 10 million Euro a year offer and pleads from his wife, said, I will not leave until I make Fenerbahce Champions, and stayed in Istanbul. Daniela got mad and left Istanbul
This was not Nani's first sacrifice to play for Fenerbahce. During the transfer peroid, Daniela tried to stop Nani and said "I dont want to live in Istanbul", while Nani tried his best, he could not convince her. At which point the teams sporting director Giuliano Terraneo stepped in and went to visit the couple during their vacation in Spain. He was able to convince Daniela, and the transfer was finalized. But Daniela kept on complaining after moving to Istanbul. She would keep bothering him about leaving Istanbul. Nani told her "I have a promise to the president of the club, I told him I will not leave until I make this club Champions."
Nani did exactly what he said he would, and stayed at Fenerbahce. Daniela with her sons, left Istanbul Friday night and headed to Portugal. Nani is now living alone in Istanbul.
While Nani chose to stay at the club despite getting into a fight with his wife, he has earned the respect and hearts of the Fenerbahce supporters one more time. Nani said "I will not leave Fenerbahce down on its face. Let's be champions, we can talk about the future later. If the club wants me to leave, than I will think about it"
I personally think his wife is being a ass. Istanbul is a beautiful city. I hope this does not affect him on the pitch considering he is our best player at the moment. I give him kudos for being a man and not giving into his wife. Most players would leave in a heart beat if some club offered them 10 Million euros a year. | 0non-cybersec
| Reddit | 482 | 1,923 |
Cisco 12.4 ACL with DHCP-obtained address. <p>I figured this would be an easy one, but I've had a good amount of trouble finding this answer myself. I have a Cisco router that I'm setting up to have my Internet connection on one interface (external) that obtains an IP via DHCP, and my LAN on another interface (internal) that has an internal static IP. I also have port 80 forwarded to an internal address (using "ip nat inside source static...interface fa0/0...). </p>
<p>Everything works properly, but I have a question about the ACL I am applying inbound to the external interface. I currently have this: "permit tcp any any eq www". This works, but I am wondering if this is secure. Typically I would specify the external IP to match more specifically, but I don't necessarily have the IP since it's learned via DHCP. Is there a way to accurately specify this, or is this permit line appropriate.</p>
| 0non-cybersec
| Stackexchange | 224 | 914 |
Vertically aligning divs around a floated left div. <p><a href="https://i.stack.imgur.com/oTer0.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/oTer0.png" alt="3 divs" /></a></p>
<p>Is there a way in css to align 3 divs (as shown), where the first is floated left and the container height = that div height (+ padding), and the second and third combined are vertically aligned in the container?</p>
<p>I tried <a href="https://jsfiddle.net/c2f1q65a/1/" rel="nofollow noreferrer">this</a> but couldn't quite get there.</p>
<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-css lang-css prettyprint-override"><code>.x {
width: 100%;
height: 56px;
display: flex;
flex-wrap: wrap;
align-items: center;
}
.x> :nth-child(1) {
display: block;
float: left;
width: 48px;
height: 48px;
border-radius: 50%;
border: solid 1px #333333;
margin: 4px 16px 4px 4px;
}
.x> :nth-child(2) {
font-size: 12pt;
}
.x::after {
content: '';
width: 100%;
}
.x> :nth-child(3) {
font-size: 10pt;
font-weight: 600;
order: 1;
}</code></pre>
<pre class="snippet-code-html lang-html prettyprint-override"><code><div class="x">
<div></div>
<div>Line 1</div>
<div>Line 2</div>
</div></code></pre>
</div>
</div>
</p>
<p>I'd prefer to drop the sizing from the first div and allow that to happen automatically if possible</p>
| 0non-cybersec
| Stackexchange | 589 | 1,515 |
Should I delete my Yahoo! account?. <p>NBC News is running this story: "<a href="http://www.nbcnews.com/nightly-news/video/experts-don-t-delete-your-yahoo-account-despite-1b-being-compromised-834294339939" rel="noreferrer">Experts: Don't Delete Your Yahoo! Account</a>". According to the story, if your account's email is linked to your online banking account, deleting your account will allow a hacker to recreate it; so instead, you should change the password and security questions.</p>
<p>They didn't say what experts they consulted or quote any famous security gurus. Has this vulnerability ever been exploited in the wild? Is this sound advice?</p>
| 1cybersec
| Stackexchange | 183 | 660 |
In his prime, nobody could ever touch John Carpenter.. The only one who comes close is Dario Argento.
But in his prime, John Carpenter delivered NO bad movie, and that is something not many directors accomplished.
His movie streak from 76 to 88 is stellar. Also including non horror but oh well, he's a horror director mainly.
I mean look at it. Look at THIS.
1976 Assault On Precinct 13, 1978 Halloween, 1980 The Fog, 1981 Escape From New York, 1982 The Thing, 1983 Christine, 1984 Starman, 1986 Big Trouble In Little China, 1987 Prince Of Darkness, 1988 They Live
Bonus 1994 In The Mouth Of Madness
This list of movies ranges from masterpieces (Halloween, The Fog, The Thing, In The Mouth Of Madness) over great films (Big Trouble, Escape From New York) to good films (Assault, Christine, Starman, Prince Of Darkness, They Live) at worst.
Tell me anyone who can rival that or even top it. TELL ME.
I'm binging Carpenter atm, so it really made me realize how fantastic this man is. Fuck I'm hyped. I appreciate his work so much. | 0non-cybersec
| Reddit | 269 | 1,035 |
How is tamper-proofing of software evaluated for effectiveness?. <blockquote>
<p>How is tamper-proofing of software evaluated for effectiveness?</p>
</blockquote>
<p>I've been implementing a few algorithms listed within <em>Surreptitious Software: Obfuscation, Watermarking, and Tamperproofing for Software Protection</em>. The algorithms include tamper-proofing of software by means of introspection (or computing a hash at runtime over some region of code).</p>
<p>However, nothing is said about the evaluation of such tamper-proofing algorithms: How are they compared to each other and how are their effectiveness measured?</p>
<p>Searching Google, I've come across few articles discussing the subject. One of the articles made an emperical evaluation, where they asked "hackers" to break their implementation and then measured the time taken.</p>
<p>Does anyone know how to evaluate tamper-proofing at a theoretical level?</p>
| 0non-cybersec
| Stackexchange | 235 | 937 |
Proving if $A \subseteq B$ and $A \nsubseteq C$ then $B \nsubseteq C$. <p>This is one of the problem I have been solving in Velleman's How to prove book:</p>
<blockquote>
<p>Prove that if $A \subseteq B$ and $A \nsubseteq C$ then $B \nsubseteq C$</p>
</blockquote>
<p>This is my solution:</p>
<blockquote>
<p>Suppose $A \subseteq B \cap A \nsubseteq C$. Let x be an arbitrary
element in A. From $x \in A$ and $A \subseteq B$, it follows that $x
\in B$. From $x \in A$ and $A \nsubseteq C$, it follows that $x \notin
C$. Therefore, $x \in B$ and $x \notin C$. Since x is arbitrary, $B\nsubseteq C$.</p>
</blockquote>
<p>This is the solution given in the book:</p>
<blockquote>
<p>Suppose that $A \subseteq B$ and $A \nsubseteq C$. Since $A \nsubseteq C$, we
can choose some $a \in A$ such that $a \notin C$. Since $a\in A$ and $A \subseteq B$,
$a \in B$. Since $a \in B$ and $a \notin C$, $B \nsubseteq C$.</p>
</blockquote>
<p>The book uses existential quantification to prove it but I assume x as arbitrary and prove that. Is there some flaw in my way of thinking ?</p>
| 0non-cybersec
| Stackexchange | 408 | 1,092 |
NAT and ACL order - Cisco ASA, Palo Alto, Checkpoint. <p>I've recently begun working with firewalls (Different brands) and what really confuses me is the order the different firewalls check the ACL and NAT rules.</p>
<p>For instance, allow HTTP traffic from the internet to a webserver on a LAN:</p>
<ul>
<li>Public IP: 1.1.2.2</li>
<li>Privat IP: 192.168.1.2</li>
<li>Destination port: 80</li>
<li>NAT the public IP-address 1.1.2.2 to 192.168.1.2</li>
</ul>
<p>On some firewalls the ACL allows traffic from the internet to the webserver defining the LAN IP-address as the destination:</p>
<ul>
<li>ACL: outside-in</li>
<li>Allow</li>
<li>Interface: Outside</li>
<li>Source: any</li>
<li>Destination: 192.168.1.2</li>
<li>Port: 80</li>
</ul>
<p>But I sometimes see the public IP-address instead:</p>
<ul>
<li>ACL: outside-in</li>
<li>Allow</li>
<li>Interface: Outside</li>
<li>Source: any</li>
<li>Destination: 1.1.2.2</li>
<li>Port: 80</li>
</ul>
<p>In what order does the different brands of firewalls check NAT rules and the ACL's? Is there a difference between versions on the same type of firewall?</p>
| 0non-cybersec
| Stackexchange | 407 | 1,115 |
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 | 349 | 1,234 |
A modular equation of 19th degree of Dedekind’s $\eta$ function.. <p>Regarding the Post <a href="https://math.stackexchange.com/questions/3101157/additional-values-of-dedekinds-eta-function-in-radical-form">Additional values of Dedekind's $\eta$ function in radical form</a>
I wrote the equation that has as root the value <span class="math-container">$\frac{\eta(19i)}{\eta(i)}$</span> that is missing.</p>
<p>Can someone help me solve (in radical form) the following equation, whose solution is the value of Dedekind’s modular <span class="math-container">$\frac{\eta(19i)}{\eta(i)}$</span> function?</p>
<p><span class="math-container">$x^{40}-\frac{4}{19}x^{36}+\frac{138}{ 19^{3}}x^{32}-\frac{154}{19^{4}}x^{28}+\frac{41035}{19^{7}}x^{24}-\frac{359820}{19^{9}}x^{20}+\frac{1743935}{19^{11}}x^{16}-\frac{4798430}{19^{13}}x^{12}+\frac{16921266}{19^{15}}x^{8}+\frac{422140}{19^{17}}x^{4}-\frac{1}{19^{19}}=0$</span></p>
<p>where</p>
<p><span class="math-container">$$x=\frac{\eta(19i)}{\eta(i)}.$$</span></p>
<p>This equation comes from the work of L. Kiepert and specializes for the value reported in the title of the application. My intent is to find the solution in closed form. </p>
| 0non-cybersec
| Stackexchange | 424 | 1,199 |
Not Able to FTP for Wget. <p>I am trying to do wget <a href="ftp://gcc.gnu.org/pub/gcc/infrastructure/gmp-4.3.2.tar.bz2" rel="nofollow noreferrer">ftp://gcc.gnu.org/pub/gcc/infrastructure/gmp-4.3.2.tar.bz2</a></p>
<p>I am running Ubuntu Server 14.04.5 on a VM at work... I'm ssh'd into the server via PuTTY.</p>
<p>When I try wget it keeps getting stuck on:</p>
<pre><code>sudo wget ftp://gcc.gnu.org/pub/gcc/infrastructure/gmp-4.3.2.tar.bz2
--2017-03-27 14:36:22-- ftp://gcc.gnu.org/pub/gcc/infrastructure/gmp-4.3.2.tar.bz2
=> ‘gmp-4.3.2.tar.bz2’
Resolving gcc.gnu.org (gcc.gnu.org)... 209.132.180.131
Connecting to gcc.gnu.org (gcc.gnu.org)|209.132.180.131|:21... connected.
Logging in as anonymous ... Logged in!
==> SYST ... done. ==> PWD ... done.
==> TYPE I ... done. ==> CWD (1) /pub/gcc/infrastructure ... done.
==> SIZE gmp-4.3.2.tar.bz2 ... 1897483
==> PASV ... couldn't connect to 209.132.180.131 port 10190: Connection timed out
Retrying.
</code></pre>
<p>I have ufw enabled; however, I have tried to toggle on and off the ftp port to no avail.</p>
<p>Right now my ufw status is allowing 22 from my company's subnet . . . thought adding a rule that allowed 209.132.180.131 would help; however, it doesn't.</p>
<p>Any recommendations of what else to check?</p>
<p>Thanks!</p>
| 0non-cybersec
| Stackexchange | 528 | 1,331 |
Elliptic Curve Group and Multiplicative Inverse of an element.. <p>Suppose $E$ be an Elliptic Curve over a field $F_q$ and $q=p^n$ where $p=$ prime. We know that the Elliptic Curve group $E(F_q)$ under addition is an Abelian/Commutative Group of order, $\#E(F_q)=q+1-t$ where $|t|\leq2\sqrt{q}$, and the structure of this group is either cyclic or almost cyclic.</p>
<p>Since the point addition and doubling formulas need multiplicative inverse to be computed so how can it be proven that all the elements in $E(F_q)$ have multiplicative inverse?</p>
| 0non-cybersec
| Stackexchange | 169 | 552 |
I want to log everything with iptables. How can I do so?. <p>I want to log everything with <code>iptables</code>.</p>
<p>I have tried-</p>
<pre><code>iptables -I INPUT 1 -j LOG
iptables -I FORWARD 1 -j LOG
iptables -I OUTPUT 1 -j LOG
iptables -t nat -I PREROUTING 1 -j LOG
iptables -t nat -I POSTROUTING 1 -j LOG
iptables -t nat -I OUTPUT 1 -j LOG
service iptables save
</code></pre>
<p>Also, I was wondering what all the above will log?</p>
| 0non-cybersec
| Stackexchange | 168 | 445 |
typical way of running clojure programs. <p>I'm new to Clojure and really confused about how I should run Clojure programs. </p>
<p>My first question is whether every Clojure program is a Leiningen package? If I want to write do I start by creating a new Leiningen project? Is there a to run Clojure programs similar to Python(ie <code>python pyfile.py</code>)</p>
<p>I realize this might be a stupid question, but I've been confused about this for a while and the few books/tutorials I've gone through don't seem to answer this question properly. Upto now, I've been running Clojure code just in the REPL.</p>
| 0non-cybersec
| Stackexchange | 171 | 613 |
Start with a topological group, take the meet of the two uniformities, and take the topology. Is the result again a topological group?. <p>And what else can be said, if so?</p>
<p>In more detail: Say $(G,\mathscr{T})$ is a topological group. It has a left uniformity $\mathscr{L}$ and a right uniformity $\mathscr{R}$. (It also has a two-sided uniformity $\mathscr{U}$, which is the join of the two.)</p>
<p>Now, uniformities on a given set form a complete lattice, so we can also consider the meet of the two, $\mathscr{V}$. However, the meet of two uniformities that yield the same topology does not necessarily again yield the same topology, so it's possible that $\mathscr{T}'$, the topology coming from $\mathscr{V}$, is coarser than our original topology $\mathscr{T}$.</p>
<p>(Obviously, this does not happen if the group is balanced, i.e. $\mathscr{L}=\mathscr{R}$; it also does not happen if $\mathscr{T}$ is locally compact, since the meet of two uniformities yielding the same locally compact topology does again yield the same topology. <strike>I think it also can't happen if $G$ embeds in a locally compact group, but I didn't work out all the details there</strike>. Actually, I don't know an actual case where this does happen, so I guess a first question I can ask is, are there any actual examples of this?)</p>
<p>So my question is, is $(G,\mathscr{T}')$ again a topological group? Obviously inversion is continuous, since $\mathscr{V}$ makes inversion uniformly continuous, but it's not clear what would happen with multiplication.</p>
<p>If it is a topological group, then we can ask things like, how does $\mathscr{V}$ compare to $\mathscr{L}'$, $\mathscr{R}'$, $\mathscr{U}'$, and $\mathscr{V'}$? (Well, obviously it's coarser than the last of these.) And considering $\mathscr{T} \mapsto \mathscr{T}'$ as an operation on group topologies on $G$, what happens when we iterate it? When we iterate it transfinitely?</p>
| 0non-cybersec
| Stackexchange | 513 | 1,954 |
Redirect HTTP to HTTPS with WWW in Nginx. <p>I am using letsencrypt ssl. When i access site with domain.com, it gets redirected to <a href="https://domain.com" rel="nofollow noreferrer">https://domain.com</a> but i want <a href="https://www.domain.com" rel="nofollow noreferrer">https://www.domain.com</a> !</p>
<p>I have added www as alias for domain.com in dns panel for accessing site with www. but Now i am getting double redirection. </p>
<p>First redirection : domain.com to https:// domain.com,
Second redirection : https:// domain.com to https:// www.domain.com </p>
<p>I want to achieve this in single 301 redirection.
already tried multiple solutions given in SF. but it didn't work.
Anyone got idea ?</p>
| 0non-cybersec
| Stackexchange | 225 | 720 |
A general form of a matrix $A$ raised to a natural power, $A^k$.. <p>Suppose I have the $2\times 2$ matrix:</p>
<p>$$A = \left( \begin{array}{cc}
a & b \\
c & d \end{array} \right)$$ </p>
<p>I want to find the general matrix $A^k$ where $k\in \mathbb{N}$.</p>
<p>I.e I want to find:
$$A^k = \left( \begin{array}{cc}
A(a,b,c,d) & B(a,b,c,d) \\
C(a,b,c,d) & D(a,b,c,d) \\
\end{array} \right) $$</p>
<p>I want to find $A,B,C,D$ as explicit functions of $a,b,c,d$.</p>
<p>Same question for the general $n\times n$ matrices.</p>
| 0non-cybersec
| Stackexchange | 260 | 546 |
Should I use a root namespace?. <p>I'm currently working on a couple projects in Flash ActionScript, and I've been building up a small library of classes. I've been using a naming convention similar to:</p>
<p><code>foo.events.Bar</code> and <code>foo.controls.Baz</code>, but I've noticed that many people have released their libraries in the <code>com</code> and <code>org</code> package/namespace (i.e. <code>com.foo.events.Bar</code> and <code>com.foo.controls.Baz</code>). I assume the meaning of <code>com</code> is <code>common</code> or <code>community</code>, and that <code>org</code> is <code>organization</code>.</p>
<p>Is there a particular reason to adding an <em>additional</em> namespace?</p>
<p>Is this common for namespaced languages (Java, C#, AS3,...)?</p>
| 0non-cybersec
| Stackexchange | 239 | 780 |
I am booting Ubuntu 15.10 from a Transcend Jetflash USB drive. getting kernal vesamenu.c32 not found. <p>I am booting Ubuntu 15.10 from my flash drive, and I am getting the error for kernel image vesamenu.c32 (i cant recall the exact error message. The original OS on the C:/ drive is Windows XP.</p>
<p>Can I find the vesamenu.c32 on the internet, download it, and copy it to the correct directory? If so, how many places is it used? Also, if its possible, can you write me a batch (.bat) file for windows to copy it to all the right places? (Or tell me how to write one?)</p>
<p>Thx</p>
<p>Addition to question:</p>
<p>What I am saying is 'is it possible to find the vesamenu.c32 on the internet, download it, and copy it to the appropriate directories? If so, pls tell me where</p>
| 0non-cybersec
| Stackexchange | 236 | 789 |
VSCode - close big red stack trace error box (python). <p>Using VSCode to write/test python, problem happens when in debug mode.</p>
<p>Several updates ago, VSCode began showing the current stack trace error report in a big red box that inserts into the active code window. I was fine with it being down in the terminal, but here it is - and I cannot seem to close it.</p>
<p>The problem is that I am in debug mode, so the current variable values are all still present and visible when hovered, and I wish to hover different variables -- but the big red box is taking most of the screen space.</p>
<p>(1) Is there a way to close the box, while remaining in debug mode? <em>(It closes automatically when click the reddish square to stop debug)</em></p>
<p>(2) Is there a way to turn off this new feature, perhaps in user settings? (That is, just leave the error messages down in the terminal window?)</p>
<p>(3) IF NOT - does anyone know if a github issue has been opened for this? (Yes, I searched, did not see one, but perhaps this thing is not properly called a <code>big red box</code> - is there something else I should search for?</p>
<p><a href="https://i.stack.imgur.com/8mPh8.jpg" rel="noreferrer"><img src="https://i.stack.imgur.com/8mPh8.jpg" alt="Big Red Box stack trace error report"></a></p>
| 0non-cybersec
| Stackexchange | 364 | 1,311 |
How do I prove that $X^{p^n}-X$ is the product of all monic irreducible polynomials of degree dividing $n$?. <blockquote>
<p>How do I prove that $X^{p^n}-X$ is the product of all monic irreducible polynomials in $\mathbb Z_p[X]$ of degree dividing $n$?</p>
</blockquote>
<p>Let $\bar Z_p$ be an algebraic closure of $Z_p$.</p>
<p>Define $F=\{x\in \bar Z_p|x^{p^n}-x=0\}$.</p>
<p>Then $X^{p^n}-X=\prod_{\alpha\in F} X-\alpha$.</p>
<p>Now $S$ be the set of monic prime polynomials of $Z_p[X]$ of which degree divides $n$.</p>
<p>Then, I know that $F=\bigcup_{f\in S} \{x\in \bar Z_p| f(x)=0\}$.</p>
<p>With this information, how do I prove that $X^{p^n}-X$ is actually the product of all elements of $S$?</p>
<p>To assure the equality, I think it must be shown that $\{x\in \bar Z_p|f(x)=0\}$ are mutually disjoint, but I don't know how to show this</p>
| 0non-cybersec
| Stackexchange | 335 | 861 |
404 error for WebResource.axd with fastcgi-mono-server4. <p>I have a simple ASP.NET WebForms app that I created in Windows and copied over to a Linux server (Ubuntu 14.04) that is running fastcgi-mono-server4 and nginx. The app runs fine on windows, but when running on mono it fails to get the <code>WebResource.axd?d=...</code> script because of a 404 error. As such, all postbacks fail because <code>WebForm_OnSubmit()</code> is undefined.</p>
<p>If I remove my <code>ScriptManager</code> and all validators from the page, it runs fine on mono because <code>WebResource.axd</code> is no longer required. However, I don't want to do that because I want to use AJAX.</p>
<p>I tried the solution in <a href="https://serverfault.com/questions/118184/webresource-axd-and-scriptresource-axd-404-not-found">this post</a>, but it had no effect. I also tried adding that tag to the <code>system.webServer/handlers</code> section, but that did not work either.</p>
<p>I also tried following <a href="http://encosia.com/using-jquery-to-directly-call-aspnet-ajax-page-methods/" rel="nofollow noreferrer">this article</a> to use AJAX without a ScriptManager. It worked fine on windows, but failed in mono by giving me a 404 error for all of my web service requests.</p>
<p>So my question is: why do I get a 404 error when trying to download <code>WebResource.axd</code>, and how do I fix it? Is there some mono or nginx configuration that I need to fix?</p>
<p>EDIT: here is my nginx configuration:</p>
<pre><code>server {
listen 80;
server_name www.example.com;
access_log /var/log/nginx/example.access.log main;
location / {
root /var/www/www.example.com;
index Default.aspx;
try_files $uri $uri/ /Default.aspx;
fastcgi_index Default.aspx;
fastcgi_pass 127.0.0.1:9000;
include /etc/nginx/fastcgi_params;
fastcgi_param PATH_INFO "";
fastcgi_param SCRIPT_FILENAME $document_root$fastcgi_script_name;
}
}
</code></pre>
| 0non-cybersec
| Stackexchange | 626 | 2,024 |
It's a Small Intestine.. It's a road of wonder,
a trail of food.
It's a pathway to break up
the bad and good.
It's a tube that digests
and then sends (?) out the rest.
It's a small, small intestine.
It's a small intestine, isn't it?
It's a small intestine, isn't it?
It's a small intestine, isn't it?
It's a small, small intestine
It's a small, small intestine
It's a small intestine, isn't it?
Oh, science! This song is so gross, yet hypnotic. I think this can replace Futurama for me.
EDIT: fixed per relder17 | 0non-cybersec
| Reddit | 173 | 567 |
Bluetooth Device Shows Up In Menu But Not In Preferences. <p>I have an issue where an old iPhone I no longer own shows up in the Bluetooth menu but not in the bluetooth preferences. Screenshots below. Anyone else experiencing this? How to go about removing the item "iPhone-FFFV" below?</p>
<p><img src="https://i.stack.imgur.com/aYw0k.png" alt="iPhone-FFFV in menu.">
<img src="https://i.stack.imgur.com/DiP3Y.png" alt="No option to remove iPhone-FFFV in preferences."></p>
| 0non-cybersec
| Stackexchange | 148 | 476 |
Law of Cosines and Heron's Formula in inequalities. <p>I had the following question:</p>
<blockquote>
<p>Suppose <span class="math-container">$a$</span>, <span class="math-container">$b$</span>, and <span class="math-container">$c$</span> are non-zero real numbers, and <span class="math-container">$x$</span>, <span class="math-container">$y$</span>, and <span class="math-container">$z$</span> satisfy the equations
<span class="math-container">$$
bx + ay = c, cx + az = b, cy + bz = a.
$$</span>
Prove that <span class="math-container">$-1 < x, y, z < 1$</span> if and only if <span class="math-container">$a^4 + b^4 + c^4 < 2 (a^2b^2 + b^2c^2 + c^2a^2)$</span>.</p>
</blockquote>
<p>After some thoughts, I factorized the inequality to <span class="math-container">$(a+b+c)(-a+b+c)(a-b+c)(a+b-c)>0$</span>, which I believe is related to Heron's Formula of area.</p>
<p>I also rewrote the three equations into <span class="math-container">$a^2=b^2+c^2-2bcx$</span>, <span class="math-container">$b^2=a^2+c^2-2acy$</span> and <span class="math-container">$c^2=a^2+b^2-2abz$</span>, which I believe is related to the Law of Cosine.</p>
<p>I am guessing that <span class="math-container">$a$</span>, <span class="math-container">$b$</span> and <span class="math-container">$c$</span> are sides of triangles and <span class="math-container">$x$</span>, <span class="math-container">$y$</span>, <span class="math-container">$z$</span> are the cosine value to the angle opposite the sides. However, I wasn't able to do this without assuming the side lengths are positive. </p>
| 0non-cybersec
| Stackexchange | 579 | 1,599 |
How to claim bitcoin cash for Bitcoin Wallet backup created before 1st August2017?. <p>I use this bitcoin wallet for android for my bitcoins..
<a href="https://i.stack.imgur.com/KC5mu.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/KC5mu.jpg" alt="enter image description here"></a></p>
<p>I had created backup well before 1st August 2017 from Safety>>Backup My Wallet..
The backup is encrypted with name
bitcoin-wallet-backup-2017-xx-xx</p>
<p>How can I claim Bitcoin Cash for these bitcoins?</p>
<p>I have read about decrypting wallet using openssl but output is random symbols since the wallet is in protobuf format..</p>
<p>Can you explain to me the procedure for claiming bitcoin cash in detailed steps?</p>
<p>I use Ubuntu 14.04 as my OS on laptop if it is needed for decryption process..</p>
<p>Also now If I move these bitcoins to another wallet, say Electruk them Can I use the other simplified process? Or I have to use that baclup Bitcoin Wallet for android?</p>
| 0non-cybersec
| Stackexchange | 296 | 1,000 |
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 | 349 | 1,234 |
if __name__ == '__main__' in IPython. <p>I have Python scripts that use the <code>if __name__ == '__main__'</code> trick to have some code only run when the script is called as a script and not when it is loaded into the interactive interpreter. However, when I edit these scripts from IPython using the <code>%edit</code> command, IPython apparently sets <code>__name__</code> to <code>'__main__'</code> and so the code gets run every time I exit the editing session. Is there a good way to make this code not run when the module is edited from IPython?</p>
| 0non-cybersec
| Stackexchange | 160 | 567 |
Export Visual Studio's 'Code Style settings' as .editorconfig. <p>Our team works with Visual Studio 2017 Professional. </p>
<p>I've been trying to unify the Code Style across the team and apparently the industry standard right now is to use .editorconfig files. Even Visual Studio in it's settings windows suggests to use that configuration file and links to a <a href="https://docs.microsoft.com/it-it/visualstudio/ide/editorconfig-code-style-settings-reference" rel="noreferrer">useful page</a> on how to write an editorconfig file. </p>
<p>but I don't want to write all the settings that I already have configured in VS by hand. I would like a tool that exports those settings as a .editorconfig file to distribute them. </p>
<p>I haven't been able to find any tool to do just that so I thought on righting it myself and share it with other people like me. But apparently if go to "Tools -> Import and Export Settings..." you can't download your current Code Style settings. </p>
<p>Is there a way around this?</p>
<p>do you know any tool to convert my settings to an editorconfig file or a way to export my current Code Style settings?</p>
<h1>Edit</h1>
<p>I have created my own version of the <strong>.editorconfig</strong> file based on the information found in <a href="https://docs.microsoft.com/it-it/visualstudio/ide/editorconfig-code-style-settings-reference" rel="noreferrer">here</a></p>
<p>You can find it in my <a href="https://github.com/danielepo/visualstudio-editorconfig" rel="noreferrer">github repo</a></p>
| 0non-cybersec
| Stackexchange | 432 | 1,548 |
Compare dataframe columns to series. <p>I have a dataframe and a series, and want to compare the DF column-wise to series.</p>
<p>Dataframe (df) looks like:</p>
<pre><code>1 1 4 7
2 2 3 1
3 2 3 9
</code></pre>
<p>Series (s) looks like:</p>
<pre><code>1 3
2 4
3 2
</code></pre>
<p>Want to conduct a boolean comparison (where columns values less than series values):</p>
<pre><code>1 T F F
2 T T T
3 F F F
</code></pre>
<p>Of course I could do a loop, but there should be simpler ways to do that?</p>
| 0non-cybersec
| Stackexchange | 199 | 525 |
how to show that $\int_0^\infty \sin(x^2) dx$ converges. <blockquote>
<p><strong>Possible Duplicate:</strong><br>
<a href="https://math.stackexchange.com/questions/105107/prove-int-0-infty-sin-x2-dx-converges">Prove: $\int_{0}^{\infty} \sin (x^2) dx$ converges.</a> </p>
</blockquote>
<p>What test do I use to show that the following integral converges?
$$ \int_0^\infty \sin (x^2) \; dx$$</p>
| 0non-cybersec
| Stackexchange | 157 | 402 |
Renaming burned CDs. <p>I'm stuck with a problem that would require a skill set a little farther than mine, I currently
installed Ubuntu for the first time on a piece of hardware, but I didn't take in account that the computer that I had installed it on only had a ethernet port, and I had to use a external USB Plug and play device to get it working, after searching for a while, I noticed that I can use ndiswrapper so I can use the windows drivers. Then I came into another problem, when trying to install the drivers from the application store, it told me to stick in the original boot CD that I installed ubuntu with, but from what it seems, the CD has to be specifically named in order for the application store to use it.</p>
<p>I was wondering if there is way of changing a name of a already burned CD?</p>
| 0non-cybersec
| Stackexchange | 191 | 816 |
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 | 349 | 1,234 |
Type mismatch when writing a Functor instance for Either. <p>Following the exercises in the Typeclassopedia, I tried to implement an instance of Functor for Either. My first attempt was the following:</p>
<pre><code>instance Functor (Either a) where
fmap f (Right a) = Right (f a)
fmap _ left = left
</code></pre>
<p>This raises the following compile-time error:</p>
<pre><code>functor.hs:7:17:
Couldn't match type ‘a1’ with ‘b’
‘a1’ is a rigid type variable bound by
the type signature for
fmap :: (a1 -> b) -> Either a a1 -> Either a b
at functor.hs:6:3
‘b’ is a rigid type variable bound by
the type signature for
fmap :: (a1 -> b) -> Either a a1 -> Either a b
at functor.hs:6:3
Expected type: Either a b
Actual type: Either a a1
Relevant bindings include
left :: Either a a1 (bound at functor.hs:7:10)
fmap :: (a1 -> b) -> Either a a1 -> Either a b
(bound at functor.hs:6:3)
In the expression: left
In an equation for ‘fmap’: fmap _ left = left
</code></pre>
<p>The easiest way to solve this is to replace the second definition of <code>fmap</code> like the following:</p>
<pre><code>instance Functor (Either a) where
fmap f (Right a) = Right (f a)
fmap _ (Left a) = Left a
</code></pre>
<p>Can someone explain me why the error is solved by explicitly pattern-matching in the second definition of <code>fmap</code>?</p>
| 0non-cybersec
| Stackexchange | 480 | 1,422 |
Unresolved reference to symbol 'WixComponentGroup:MyWebWebComponents' in section. <p>I was following the below code which is product.wxs files.But I am facing an error as below:</p>
<p><strong>Error 5 Unresolved reference to symbol 'WixComponentGroup:MyWebWebComponents' in section 'Product:{}'</strong></p>
<pre><code><?xml version="1.0" encoding="UTF-8"?>
<Wix xmlns="http://schemas.microsoft.com/wix/2006/wi"
xmlns:util="http://schemas.microsoft.com/wix/UtilExtension"
xmlns:iis="http://schemas.microsoft.com/wix/IIsExtension">
<Product Id="702881b5-9a64-4ab8-ab47-f3babcd950a2"
Name="WixApplication" Language="1033"
Version="1.0.0.0"
Manufacturer="HexWireless"
UpgradeCode="42b7872b-78c8-4a0b-abcd-28a30c9804ab">
<Package InstallerVersion="200" Compressed="yes" Platform="x64" InstallScope="perMachine"/>
<!--<Media Id="1" Cabinet="media1.cab" EmbedCab="yes" />-->
<!--Find the Path to the sqlcmd.exe by performing a registry search. This is hardcoded for SQL 2012.
Change 110 to 100 for 2008. Might need to change the script too.-->
<Property Id="SQLBINDIR">
<RegistrySearch Id="SqlBinDir"
Root="HKLM" Key="SOFTWARE\Microsoft\Microsoft SQL Server\110\Tools\ClientSetup"
Name="Path"
Type="raw"
Win64="yes"/>
</Property>
<Condition Message="Microsoft SQL Server 2012 needs to be installed before this installer can run">
<![CDATA[SQLBINDIR]]>
</Condition>
<Directory Id="TARGETDIR" Name="SourceDir">
<Directory Id="INSTALLLOCATION" Name="Database">
<Component Id="Database" Guid="a8dc2Fcd-087d-e393-b059-c67877e51b8a">
<File Id="DatabaseScript" Source="SQLScripts\HexWireless.sql"/>
<RemoveFile Id ="RemoveInstall.log" Name="Install.log" On="uninstall" />
</Component>
</Directory>
<Directory Id="INSTALLDIR" Name="PFiles">
<Directory Id="WixService" Name="Service">
<Component Id="WixWindowsServiceComponent" DiskId="1" Guid="6f51c0f3-776c-4aec-a200-1f199352c6c3" Win64="yes">
<File Id="WixService.exe" Name="WixService.exe" Source="$(var.WixService.TargetDir)\WixService.exe"/>
<ServiceInstall Id="InstallWixService" DisplayName="WixService" Name="WixService.exe" Description="WixService" Account="NT Authority\Network Service" ErrorControl="normal" Start="demand" Type="ownProcess" Vital="yes" />
<ServiceControl Id="ControlWixService" Name="WixService.exe" Stop="uninstall" Remove="uninstall" />
</Component>
</Directory>
</Directory>
<Directory Id="INSTALLFOLDER" Name="Publish">
</Directory>
</Directory>
<Feature Id="ProductFeature" Title="WebApplication" Level="1">
<Feature Id="Database" Title="Database" Description="DatabaseScript" Level="1" Display="expand"
AllowAdvertise="no" ConfigurableDirectory="INSTALLLOCATION" Absent="allow">
<Feature Id="WixWindowsServiceComponent" Title="Service" Description="WixService" Level="1" Display="expand"
AllowAdvertise="no" ConfigurableDirectory="INSTALLDIR" Absent="allow">
<ComponentGroupRef Id="WixWebsiteIssConfiguration" />
<ComponentRef Id="Database"/>
<ComponentRef Id="WixWindowsServiceComponent"/>
<ComponentGroupRef Id="MyWebWebComponents"/>
</Feature>
</Feature>
</Feature>
<Property Id="INSTALLDIR" Value="D:" />
<Media Id="1" Cabinet="WixWindowsServiceComponent.cab" EmbedCab="yes" />
<InstallExecuteSequence>
<!--If the database feature is selected these actions will run to install the DB-->
<Custom Action="Database.cmd" After="InstallFiles" >
<![CDATA[NOT Installed]]>
</Custom>
<!--Ensure this runs after the custom action to set up the properties for its cmd line-->
<Custom Action="Database" After="Database.cmd">
<![CDATA[NOT Installed]]>
</Custom>
</InstallExecuteSequence>
<UI>
<UIRef Id="GUI"/>
<UIRef Id="WixUI_ErrorProgressText" />
</UI>
<!--This is the sequence script. Best way to understand this is by running sqlcmd -?
Use "property" Custom action to get variable substitution working-->
<CustomAction Id="Database.cmd" Property="Database"
Value="&quot;[SQLBINDIR]sqlcmd.exe&quot; -E -S &quot;[SQLSERVER]&quot; -i &quot;[#DatabaseScript]&quot; -o &quot;[INSTALLLOCATION]HexWireless.log&quot;"/>
<!-- Note that the cmd line and args will come from a property with the same name as the custom action, this has been set by the custom action above -->
<CustomAction Id="Database" BinaryKey="WixCA" DllEntry="CAQuietExec" Return="check" Execute="deferred" Impersonate="yes" />
</Product>
</Wix>
</code></pre>
<p>Thanks In Advance.</p>
| 0non-cybersec
| Stackexchange | 1,771 | 5,291 |
Probability of first success.. <p>A soccer player makes one out of every five shots on average. If we look at independent events, (1) how many shots should we expect him to take before he makes his first goal of a new season. (2) Build a 95% confidence interval.</p>
<p>(1) So far I got the geometric of $(.2)(.8)^{n-1}$, but I'm not sure how to manipulate this.</p>
<p>(2) I could just plug and play for an answer, but I was hoping for a more theoretically sound solution. For example I took $\Pr(X=2,3,..12) = .957$, is there a more efficient way?</p>
| 0non-cybersec
| Stackexchange | 162 | 556 |
Is direct limit created by the forgetful functor from an Eilenberg-Moore algebra. <blockquote>
<p><strong>Proposition.</strong> Let <span class="math-container">$T$</span> be a monad on <span class="math-container">$C$</span> and consider the
forgetful functor
<span class="math-container">$$
R^T \colon C^T \to C
$$</span>
from the category of Eilenberg-Moore algebras to <span class="math-container">$C$</span>. This functor</p>
<ul>
<li>creates limits;</li>
<li>creates colimits which are preserved by <span class="math-container">$T$</span> and <span class="math-container">$T^2$</span>.</li>
</ul>
</blockquote>
<p>I have an example in mind of a functor which is created: direct limits
(aka. colimits under directed diagrams) by the forgetful functor
<span class="math-container">$$
U \colon \operatorname{Ring} \to \operatorname{Set}.
$$</span></p>
<p><strong>Question:</strong> are direct limits in Set preserved by</p>
<ol>
<li>the monad associated to the adjunction with Rings and its square,</li>
<li>every monad and its square?</li>
</ol>
<p>More generally, can I expect to prove that any direct limit
(aka. colimit under directed diagam)
is created by the forgetful functor from any Eilenberg-Moore algebra
via the above proposition?</p>
| 0non-cybersec
| Stackexchange | 391 | 1,254 |
How to adjust custom colormap for 3D shades based on degradation of a color tone. <p>I have this figure:</p>
<pre><code>\begin{tikzpicture}[scale=1]
\begin{axis}[xmin=0,xmax=1,ymin=0,ymax=1,enlargelimits=false,xlabel=$a_1$,ylabel=$a_2$]
\addplot [blue!80!black,fill=blue,fill opacity=0.4]
coordinates
{(0., 0.) (0., 0.2629952) (0., 0.43830780032) (0.1096032496,
0.43830780032) (0.6572250048, 0.26310039808) (0.657488, 0.)}
|- (axis cs:0,0) -- cycle;
\end{axis}
\end{tikzpicture}
</code></pre>
<p>I would like to use different grades (a custom colormap) for this 3 D figure:</p>
<pre><code>\begin{tikzpicture}
\begin{axis}[view/v=25,view/h=110,xlabel=$a_1$,ylabel=$a_2$,zlabel=$a_3$,
colormap/greenyellow,
xmin=0,xmax=1,ymin=0,ymax=1,zmin=0,zmax=1, grid=major]
\addplot3[%xmin=0,xmax=1,
opacity=0,
fill opacity=0.6,
table/row sep=\\,
patch,
patch type=polygon,
vertex count=3,
patch table with point meta={%
% pt1 pt2 pt3 pt4 pt5 cdata
0 1 2 1. \\
2 3 0 3. \\
0 3 4 2. \\
3 2 4 2.12132 \\
2 1 4 3.53553 \\
1 0 4 2. \\
}
]
table {
x y z\\
0 0 0 \\
0 0 0.657488 \\
0 0.657488 0 \\
0.657488 0 0 \\
0.657488 0 0.657488 \\
};
\end{axis}
\end{tikzpicture}
</code></pre>
<p>based on grades of the first plot color: <code>blue!80!black</code>.
For example, how I can create colormap ranging from <code>blue!20!black</code> to <code>blue!80!black</code>, in for example 8 or 9 levels?</p>
<p>Regards</p>
| 0non-cybersec
| Stackexchange | 667 | 1,565 |
Drawing every 5e Item! (Part 1). [Imgur](http://i.imgur.com/kpGujUh.jpg)
[Imgur](http://i.imgur.com/zPCf4k4.jpg)
Looking for advice. My goal is to draw every item, magic item, etc. from 5th edition. I'm a couple sketches in as you can see from the picture.
My plan, after this goal is complete, is to scale each drawing to fit on a 3" x 4" card.
For each treasure chest that is opened by the PCs I'll allow the player that opens it to draw cards at random, the amount cards that they draw will vary depending on the treasure. I will also make several decks based on rarity to allow for variety if they find common treasures, uncommon treasures, rare treasures, or legendary treasures.
I think this will make opening treasure chests more exciting for the players.
What do you think?
P.S. First time posting on reddit!
Edit: Added some more sketches! Thank you all for the support!! :) | 0non-cybersec
| Reddit | 248 | 899 |
What is the opposite of a derangement?. <p>A <a href="https://en.wikipedia.org/wiki/Derangement" rel="nofollow">derangement</a> is a bijection $f : A \rightarrow A$ such that $f(x) \ne x$ for all $x \in A$.</p>
<p>Is there a name for a bijection $f : A \rightarrow A$ that is <em>not</em> a derangement? That is, is there a name for a bijection $f : A \rightarrow A$ where $f(x) = x$ for at least on $x \in A$?</p>
<p>Thanks!</p>
| 0non-cybersec
| Stackexchange | 165 | 432 |
How do we solve $a \le b^{r}-r$ for $r$?. <p>Given two values $a$ and $b$, how should one go about solving the following inequality for $r$:</p>
<p>$$a \le b^r -r .$$</p>
<p>Applying $\log_b$ on both sides of the inequality doesn't help me much since that yields the following:</p>
<p>$$\log_b a \le \log_b (b^r-r) .$$</p>
<p>I know that </p>
<p>$$\log_z x - \log_z y = \frac{\log_z x}{\log_z y} .$$</p>
<p>But that doesn't help me to eliminate the exponentiation and solve for $r$. </p>
<p>It's been ages that I've done algebra, and now I'm back in grad school, and I'm finding this equation in a homework. Can't remember ever seeing a rule of logarithms involving such expressions. </p>
<p>The actual homework (after simplification) involves $9 \le 2^r - r$ which is trivially solvable by just eyeballing it. </p>
<p>But is there a methodical way to solve $a \le b^r-r$ for $r$ given any arbitrary numbers $a$ and $b$?</p>
| 0non-cybersec
| Stackexchange | 332 | 935 |
Understanding how does certificate validation work. <p>I'm using Wireshark for better understanding how is a SSL connection established. I captured the traffic of visiting three pages: reddit, facebook and this one. All HTTPS of course.</p>
<p>Reddit: after the server sends the <code>Certificate</code>, it sends a <code>Certificate Status</code> with the response of the OCSP server. Why is the server sending this information? Shouldn't be the client the one who queries the OCSP for knowing the status of the server's certificate?</p>
<p>Security SE: I see there is no validation at all. After the client receives the certificate, they exchange the symmetric key and the encrypted channel is established. Why there is no validation?</p>
<p>Facebook: after the SSL connection is established, i.e. after the encrypted channel is created, the client queries the OCSP server. Why doesn't it query the OCSP before establishing the connection?</p>
<p>PS: if someone is interested in the captures, just run Wireshark, visit those sites and use <code>ssl.handshake</code> filter.</p>
| 0non-cybersec
| Stackexchange | 265 | 1,084 |
TIFU by having sex with my girlfriend at my grandparents. So first post ever, I thought i would share this with you guys, here it goes.
This didn't happen today but i figured that would be okay. I'm in a branch of military service and it had been some time since i'd been home and for those of you who don't know on government holidays most of us get the day off so we get an extended weekend. So I traveled all the way home and didn't arrive until around 5:00 AM so I immediately went to sleep. My girlfriend and I had planned out that she would come wake me early in the morning and well... as a 19 year old guy who hasn't gotten laid in a while was pretty horny.
She texted me as soon as she left and it woke me up and i couldn't sleep anymore from the excitement. I wont go into too much detail because i'm not sure if i should or not but anyways she came straight into my room and we start going at for a while and things are going smooth and i'm doing all my favorite positions. I decide to be the big spoon and keep going, all of a sudden a hear a knock on the door and pull the blanket over us and i'm still inside.
From my grandmothers perspective it would have seemed like i just wasn't wearing a shirt (being fully naked) and my girlfriend was fully dressed (with her pants off). Anyways my grandmother walks in and doesn't expect a thing we just both smile and say hi innocently like we weren't in the middle of having sex. My grandmother pulls out her new camera and snaps a picture of us laying in bed... I was absolutely mortified. I can imagine looking in photo albums years from now and seeing our shame and sweat...
And that's that. Now it seems pretty funny my girlfriend is still super embarrassed.
TL;DR Went home to visit girlfriend, grandma unknowingly took picture of me and my girl friend having sex
Edit: So for everyone asking did i finish? Of course I did. Also a big thank you i'm glad a lot of you liked my story and I really appreciate the advice i'll try to incorporate all of your tips into any, if at all, future stories.
Oh, also its not like my grandmother let us do what ever we wanted, we've just been together for 3 years now and me being gone so frequently doesn't permit us to be together much, so my grandmother doesn't mind when we lay down together.
p.s. I'll think about rewording the title next time... gross but hilarious you dyslexic folk. | 0non-cybersec
| Reddit | 555 | 2,399 |
arXiv:math/0502022v1 [math.GN] 1 Feb 2005
ar
X
iv
:m
at
h/
05
02
02
2v
1
[
m
at
h.
G
N
]
1
F
eb
2
00
5
NONMETRIZABLE ANR’S ADMITTING A GROUP
STRUCTURE ARE MANIFOLDS
ALEX CHIGOGIDZE
Abstract. It is shown that a nonmetrizable ANR-space of weight τ > ω,
admitting a group structure, is (topologically) an Rτ -manifold.
It is well known [4, Corollary 1] that if a separable complete ANR carries a
topological group structure then either this is a Lie group or the ANR is an
l2-manifold. We show that in the non-metrizable case the situation, is certain
sense, is simpler. Namely we prove the following result.
Theorem 0.1. Let τ > ω and G be an ANR-space of weight τ admitting a
group structure. Then G is an Rτ -manifold.
We refer the reader to [1] for comprehensive discussion of the general (non-
metrizable) theory of absolute retracts, soft maps and spectral techniques.
Here all we need to emphasize is that ANR-spaces are defined as retracts of
functionally open subspaces of powers of the real line and that a map p : X →
Y is soft iff there is a retraction r : Y ×P → X , where P is an AR-space, such
that pr = πY . Two main properties of soft maps used below are: (a) soft maps
are retractions (and hence admit sections); (b) inverse images of singletons are
AR’s.
We begin with the following two statements needed in the proof of our result.
Lemma 0.2. Let p : X → Y be a continuous surjective homomorphism of
topological groups. If there exists a continuous map q : Y → X such that
pq = idY , then p is a trivial fibration with fiber ker(p). More precisely there
exists a homeomorphism h : X → Y × ker(p) such that πY h = p.
Proof. The required homeomorphism h and its inverse t : Y × ker(p) → X are
defined as follows:
h(x) =
(
p(x), x · q(p(x))−1
)
, x ∈ X ; t(y, a) = a · q(y), (y, a) ∈ Y × ker(p).
First, note that h is well defined. Indeed, for x ∈ X we have
p
(
x · q(p(x))−1
)
= p(x) · p
(
q(p(x))−1
)
= p(x) · (p(q(p(x)))
−1
=
p(x) · (p(x))
−1
= eY ,
1991 Mathematics Subject Classification. Primary: 22A05; Secondary: 54C55.
Key words and phrases. ANR-space, topological group, Rτ -manifold, inverse spectrum.
1
http://arxiv.org/abs/math/0502022v1
2 A. Chigogidze
which shows that h(x) ∈ Y × ker(p).
For each (y, a) ∈ Y × ker(p) we have
h(a · q(y)) = (p(a · q(y)), (a · q(y)) · (q(p(a · q(y)))−1) =
(p(a) · p(q(y)), a · q(y) · (q(p(a) · p(q(y)))−1) =
(
eY · y, a · q(y) · (q(eY · y))
−1
)
=
(y, a).
Also for each x ∈ X we have
t(h(x)) = t
(
p(x), x · (q(p(x))−1
)
= x · (q(p(x))−1 · q(p(x)) = x · eX = x.
In other words ht = idY×ker(p) and th = idX . Thus h is a homeomorphism.
�
Lemma 0.3. Let τ ≥ ω. Every ANR-group of weight τ ≥ ω is topologically
and algebraically isomorphic to a closed and C-embedded subgroup of the prod-
uct
∏
{Gt : t ∈ T}, where |T | = τ and each Gt, t ∈ T , is a Polish AR-group
homeomorphic to Rω.
Proof. This follows from [1, Propositions 6.1.4, 6.5] and [3, Proposition 4.1].
�
Now we prove our main result.
Proof of Theorem 0.1. First we construct a well-ordered inverse spectrum
SG = {Gα, p
α+1
α , τ} satisfying the following properties:
(1) G is topologically and algebraically isomorphic to limSG.
(2) for each α < τ , Gα is a ANR-group and p
α+1
α : Gα+1 → Gα is a soft
homomorphism such that ker (pα+1α ) is a non-compact Polish AR-group.
(3) If β < τ is a limit ordinal, then the diagonal product
△{pβα : α < β} : Gβ → lim{Gα, p
α+1
α , α < β}
is a topological and algebraic isomorphism.
(4) G0 is a Polish ANR-group.
By Lemma 0.3, we may assume that G is a closed and C-embedded subgroup
of the product X =
∏
{Xa : a ∈ A}, |A| = τ , of Polish AR-groups Xa, a ∈ A.
Since G is an ANR-space, there exist a functionally open subspace L of the
product X and a retraction r : L → G. Choose a countable subset AL ⊆ A and
an open subset LG ⊆
∏
{Xa : a ∈ AL} such that L = LG×
∏
{Xa : a ∈ A\AL}.
Next let us denote by
πB :
∏
{Xa : a ∈ A} →
∏
{Xa : a ∈ B}
Nonmetrizable ANR’s admitting a group structure are manifolds 3
and
πBC :
∏
{Xa : a ∈ B} →
∏
{Xa : a ∈ C}
the natural projections onto the corresponding subproducts (C ⊆ B ⊆ A).
Let also GB denote the subspace πB(G) of the product XB =
∏
{Xa : a ∈ B}
and LB = LG ×
∏
{Xa : a ∈ B \ AL} for each B ⊆ A with AL ⊆ B.
We call a subset B ⊆ A admissible if AL ⊆ B and the following equality
πB(r(x)) = πB(x)
is true for each point x ∈ π−1B (GB). We need the following properties of
admissible sets.
Claim 1. The union of arbitrary collection of admissible sets is admissible.
Indeed let {Bt : t ∈ T} be a collection of admissible sets and B = ∪{Bt : t ∈
T}. Let x ∈ π−1B (GB). Clearly x ∈ π
−1
Bt
(GBt) and we have
πBt(r(x)) = πBt(x) for each t ∈ T.
Since B = ∪{Bt : t ∈ T} it follows that πB(x) = πB(r(x)).
Claim 2. If B is an admissible subset of A, then the restriction πB|G : G →
GB is a soft map (in the sense of [1, Definition 6.1.12 ]). If C and B are
admissible subsets with C ⊆ B, then πBC |GB : GB → GC is also soft.
Since the restriction of the projection πB onto π
−1
B (GB) is a trivial fibration
(with the fiber
∏
{Xa : a ∈ A\B}) whose fiber is an AR-space (recall that each
Xa is an absolute retract and consequently so are their products), it follows
that πB|π
−1
B (GB) is soft. The admissibility of B implies that πBr|π
−1
B (GB) =
πB|π
−1(GB). Since r is a retraction it follows that πB|G is also soft (as a
retract of πB|π
−1
B (GB)). The second part of the claim follows from [1, Lemma
6.1.15].
Claim 3. Each countable subset of A is contained in a countable admissible
subset of A.
The inverse spectrum S(G) = {clLB (GB) , π
B
C | clLB (GB) , C, B ∈ expω(A,AL)}
is a factorizing (since G is C-embedded in X) ω-spectrum in the sense of
[1, Section 1.3.2] and limS(G) = G. Similarly S(L) = {LB, π
B
C |LB, C, B ∈
expω(A,AL)} is also a factorizing ω-spectrum and limS(L) = L. Apply-
ing [1, Theorem 1.3.6] to the map r : L → G we conclude that the col-
lection expω(A,AL) contains a cofinal (and even ω-closed) subcollection Ar
such that for each B ∈ Ar there exists a map rB : LB → clLB(GB) such
that πBr = rBπB|L. Note that for every such B, GB is closed in LB and
rB : LB → GB is a retraction. If x ∈ π
−1
B (GB) and B ∈ Ar, then
πB(x) = rB(πB(x)) = πB(r(x))
which shows that every B ∈ Ar is admissible.
Since |A| = τ and |AL| = ω we can write A \ AL = {aα : α < τ}. By
Claim 3, each aα ∈ A is contained in a countable admissible subset Bα ⊆ A.
4 A. Chigogidze
Let Aα = ∪{Bβ : β ≤ α}. We use these sets to define a transfinite inverse
spectrum S = {Gα, p
α+1
α , τ} as follows.
Let A0 be a countable admissible subset of A containing AL ∪ {a0} and
G0 = GA0 .
Assume that the admissible subsets Aβ ⊆ A have already been constructed
for each β < α, α < τ , so that aβ ∈ Aβ for β < α, Aγ ⊆ Aβ for γ < β and the
spaces Gβ = GAβ and the homomorphisms p
β
γ = π
Aβ
Aγ
|Gβ : Gβ → Gγ satisfy the
required properties (2) and (3).
If α is a limit ordinal, then let Aα = ∪{Aβ : β < α} and Gα = GAα.
If α = β + 1 then proceed as follows. Consider the fiber ker (πβ|G) of the
homomorphism πβ|G : G → Gβ . This fiber is an AR-space (as an inverse image
of a point under a soft map; see Claim 2). Since it is also a topological group we
conclude that ker (πβ|G) is non-compact (much more general statement is true
– every compact AE(4)-group is trivial [2]) – otherwise it must be a singleton in
which case the homomorphism πβ : G → Gβ must be a homeomorphism. But
this is impossible since w(G) > w(Gβ). Consequently there exists a countable
subset C ⊆ A such that πC (ker (πβ|G)) is also non-compact. By claim 3, there
exists a countable admissible subset B such that C ∪ {aα} ⊂ B. We now let
Aα = Aβ ∪ B, Gα = GAα and p
β+1
β = π
Aα
Aβ
|GAα. Note that ker
(
p
β+1
β
)
is a
non-compact Polish AR-group.
This completes the inductive step and the construction of the spectrum SG.
Conditions (2) and (3) are satisfied by construction. Condition (1) can be
insured by choosing the sets Aα so that A = ∪{Aα : α < τ} which in turn
is possible since the collection of all countable admissible sets in cofinal in
expω(A,AL) (see the inductive step above).
The straightforward transfinite induction coupled with Lemma 0.2 shows
that G is homeomorphic to the product G0 ×
∏
{ker (pα+1α ) : α < τ}. Since
pα+1α is a non-compact Polish AR-space for each α < τ , it follows (by [5,
Theorem 5.1]) that all countable (but infinite) subproducts of the product
∏
{ker (pα+1α ) : α < τ} are homeomorphic to R
ω. Thus,
∏
{ker (pα+1α ) : α <
τ} ≈ Rτ and G ≈ G0 × R
τ . Since G0 is a Polish ANR-space, it follows from
[1, Corollary 7.3.4] that G is an Rτ -manifold.
References
[1] A. Chigogidze, Inverse Spectra, North Holland, Amsterdam, 1996.
[2] , Compact groups and absolute extensors, Topology Proceedings 22 (1997), 63–
70.
[3] , Topological AE(0)-groups, Fundam. Math. 167 (2001), 79–96.
[4] T. Dobrowolski, H. Toruńczyk, Separable complete ANR’s admitting a group structure
are Hilbert manifolds, Topology Appl. 12 (1981), 229–235.
[5] H. Toruńczyk, Characterizing Hilbert space topology, Fundam. Math. 111 (1981), 247–
262
Nonmetrizable ANR’s admitting a group structure are manifolds 5
Department of Mathematical Sciences University of North Carolina at
Greensboro, 383 Bryan Building, Greensboro, NC, 27402, USA
E-mail address : [email protected]
| 0non-cybersec
| arXiv | 3,546 | 9,440 |
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 | 349 | 1,234 |
How to evaluate $S(a)=\sum_{n=1}^\infty \frac{a(a-1)\ldots(a-n+1)}{n!} $ with $a=1/2$?. <blockquote>
<p>I would like to compute
$$
S(a):=\sum_{n=1}^\infty \frac{a(a-1)\ldots(a-n+1)}{n!}
$$
where $a=1/2$.</p>
</blockquote>
<hr>
<p>At some point, I arrive at</p>
<p>$$
S(1/2) = \sum_{n=1}^\infty \frac{(-1)^n}{2^nn!}(1)(3)\ldots(2n-1)
$$</p>
<p>Can this expression (if correct) be simplified further?</p>
| 0non-cybersec
| Stackexchange | 206 | 414 |
How to join unrelated entities with the JPA Criteria API. <p>Two database tables have a foreign key relationship.</p>
<p>They are mapped to two entities <strong>A</strong> and <strong>B</strong> by JPA, but the join columns are manually removed from the entities, so in JPA world classes <strong>A</strong> and <strong>B</strong> are not related and you cannot navigate from one to the other through a field/property.</p>
<p>Using the JPA Criteria API, is it possible to create a query which joins the two tables?</p>
<p>All examples I found on internet uses the join column to achieve the goal, but, as stated above, it was removed from the code because most time I'm not interested in the relationship between <strong>A</strong> and <strong>B</strong> and I'm afraid about possible overhead.</p>
| 0non-cybersec
| Stackexchange | 208 | 802 |
Going to the South Pacific for a year.... I recently graduated with my Bachelor's in December. My boyfriend will be graduating this May. We have both decided to take a year off of school (Sept. 2010 - Sept. 2011ish) to travel before returning for our professional degrees. We are slowly beginning to make arrangements for our adventure but would *love* any other input.
We have narrowed our destination to the South Pacific and would ultimately like to visit (and stay in, if we enjoy the area) several places. Our ultimate goal is to not dig too deep in the red so we would be looking at working while we are there - where ever 'there' is.
We have ruled out any 'Teach English' program as we plan to travel instead of staying grounded in one location. One of the options we have been exploring extensively is enrolling in a Dive Master Internship in SE Asia - somewhere - and ultimately working as a Dive Master - somewhere. We have also considered the Harvest Trail in New Zealand.
Our schedules are open and the options endless. If anyone has any comments or suggestions, they would be greatly appreciated!
Thanks! | 0non-cybersec
| Reddit | 250 | 1,131 |
Prove that $\frac{[ABC]}{[XYZ]}=\frac{2R}{r}$, where $X$, $Y$, $Z$ are the points where the incircle of $\triangle ABC$ meets the sides. <blockquote>
<p>Prove that <span class="math-container">$$\frac{[ABC]}{[XYZ]}=\frac{2R}{r}$$</span>
where <span class="math-container">$[\,\_\,]$</span> represents area of triangle, <span class="math-container">$X,Y,Z$</span> are the points of contact of incircle with sides of triangle <span class="math-container">$ABC$</span>, <span class="math-container">$R$</span> is circumradius, and <span class="math-container">$r$</span> is inradius.</p>
</blockquote>
<p>The textbook proof is shown below, along with the referenced Theorem 36.</p>
<blockquote>
<p>The theorem requires triangles to have equal angle, but in the question I could not find equal angles. Maybe I am wrong?</p>
</blockquote>
<hr>
<p>Here is my textbook proof:</p>
<p><a href="https://i.stack.imgur.com/C72Xw.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/C72Xw.jpg" alt="enter image description here"></a></p>
<p>Incase you are wondering what Theorem 36 is.</p>
<blockquote>
<p>Theorem 36: In two triangles <span class="math-container">$A_1B_1C_1$</span> and <span class="math-container">$A_2B_2C_2$</span> we have <span class="math-container">$\angle A_1=\angle A_2$</span>. Then their areas are proportional to rectangles contained by the sides containing <span class="math-container">$\angle A_1$</span> and <span class="math-container">$\angle A_2$</span></p>
</blockquote>
| 0non-cybersec
| Stackexchange | 513 | 1,522 |
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 | 349 | 1,234 |
Updating tlmgr 2011 to 2012. <p>When I run </p>
<pre><code># tlmgr update --self
</code></pre>
<p>This is the reply I get:</p>
<pre><code>tlmgr: package repository ftp://ftp.riken.go.jp/pub/tex-archive/systems/texlive/tlnet
/usr/local/texlive/2011/bin/x86_64-linux/tlmgr: The TeX Live versions supported by the repository
(2012--2012)
do not include the version of the local installation
(2011). Goodbye.
</code></pre>
<p>Could anyone guide me on how to update tlmgr to 2012? Do I have to uninstall and install TeX Live all over again?</p>
<p>Thanks in advance</p>
<p>Update: I use Scientific Linux</p>
| 0non-cybersec
| Stackexchange | 218 | 610 |
How would a 'dll missing' error be thrown when a specific web page is loaded?. <p>I'm building a website and am working with a conversion plugin. The conversion works perfectly for me as I've tested the dependencies on my localhost, but when I moved it to my server and installed it and visit the page from a separate computer without those dependencies, I get this error:</p>
<pre><code>The program can't start because MSVCP120.dll is missing from your computer.
Try reinstalling the program to fix this problem.
</code></pre>
<p>I know how to fix the issue, but I'm curious as to how a conversion plugin installed on a Linux server was able to throw this error as a System Error popup on my Windows machine, rather than just fail in the sandboxed browser.</p>
<p>To reiterate, I go to www.example.com/page and upon loading this exception is thrown on my Windows system.</p>
| 0non-cybersec
| Stackexchange | 219 | 887 |
Differentiation of logarithmic functions. <p>I'm going over my homework from calc, and am having some trouble with a few questions. It seems as if I'm just not understanding how to solve the problem:</p>
<ol>
<li><p>$$f(x) = \sqrt[5]{\ln x}$$</p></li>
<li><p>$$f(x) = \sqrt{x}\ln x$$</p></li>
<li><p>$$f(x)= \ln \dfrac{({2x+1})^3}{({3x-1})^4}$$</p></li>
</ol>
<p>For the first one, I'm not even sure what to do.</p>
<p>As for the second question I ended up with:</p>
<p>$$f'(x) = \frac{1}{2x} \ln x + \frac{1}{x}\sqrt{x}$$</p>
<p>And for the last question I ended up with:</p>
<p>$${(2x+1)^3\over(3x-1)^4} 3 \ln 2 - 4 \ln 3$$</p>
<p>(Sorry for my poor formatting, I wasn't able to use \frac and put the numerator and denominator to the power of x.)</p>
| 0non-cybersec
| Stackexchange | 307 | 760 |
How to interpret data given from statistical software question?. <p>Hello I am trying to answer the following question. (Apologies for the image but it is perhaps clearer than me doing a table here).</p>
<p><a href="https://i.stack.imgur.com/Jhnuc.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Jhnuc.png" alt="enter image description here"></a></p>
<p>I am quite stuck on a few points and wanted some help.</p>
<p>I think the distribution is a $t$ distribution with $6$ degrees of freedom. As we have $9$ countries recorded and $2$ things recorded so we get $9-(2+1)=6$.</p>
<p>For b) I know the formula that $\text{Estimate} ~\div~\text{Standard Error}=\text{t-value}$ so for the second column we can figure out the standard error is $1.415$.</p>
<p>Now for the top row I want to find the $t$ value corresponding to the $p$ value of $0.05$. So we want the number such that $95%$ of the distribution is less than the absolute value of that number.</p>
<p>So I think this gives $P(>|t|)=0.05$ so we look in the tables to find the value of $t$ that gives $0.025$ in the upper tail (since by symmetry the lower tail will contribute the other $0.025$).</p>
<p>This gives the value as $2.447$ and so the corresponding standard error is $6.0073$.</p>
<p>This is the main thing I am not too sure about so if anyone could help me out and explain if I am wrong what I should be doing differently that would be great.</p>
<p>Oh and for c) I said yes I would agree since $0.0003<0.01$. </p>
| 0non-cybersec
| Stackexchange | 466 | 1,516 |
Two-dimensional unital complex Banach algebras. <p>Let $A_1$ be the matrix algebra consisting of matrices of the form $$ \pmatrix{ \alpha & 0 \\ 0 & \beta\\ }$$ and let $A_2$ be the matrix algebra consisting of matrices of the form $$ \pmatrix{ \alpha & \beta \\ 0 & \alpha\\ }.$$ I want to prove that</p>
<blockquote>
<p>these algebras are not isomorphic and that every two-dimensional unital complex Banach algebra is isomorphic to one of them.</p>
</blockquote>
<p>I have proved the first part:</p>
<p>If such isomorphism exists, it would have to be multiplicative and bijective. Hence, a idempotent matrix in $A_1$ would be transformed to idempotent matrix in $A_2$. But those algebras have different numbers of idempotent algebras; a contradiction.</p>
<p>Sadly, I have been defeated by the second part. Anyone can help?</p>
| 0non-cybersec
| Stackexchange | 240 | 852 |
Defining a new operation (From the International Mathematical Tournament of the Towns). <p>An operation denoted by * defines, for each pair of numbers (x, y), a number x * y such that for all x, y and z the following identities hold:</p>
<p>x * x = 0;
x * (y * z) = (x * y) + z</p>
<p>Where + denotes ordinary addition of numbers. Find 1993 * 1932</p>
<p>My plan of action was to first see if I can get some identities involving 1 and 0 going. Try to see if I can isolate some kind of definition of x * y in terms of normal operations. I am unable to move beyond this point. Hint Please!</p>
| 0non-cybersec
| Stackexchange | 172 | 595 |
Bluestacks on Linux Fedora. <p>I am trying to use Bluestacks for running Android application on my Linux Fedora using Wine.</p>
<p>I tried <code>wine BlueStacks-SplitInstaller_native.exe</code> from terminal. It gave me <code>Install Mono for Windows to run .NET 2.0 ...</code> error, so i downloaded Mono For Windows from <a href="http://www.go-mono.com/mono-downloads/download.html" rel="nofollow noreferrer">here</a>.</p>
<p>I installed the complete package [checked all boxes including GTK etc] it using </p>
<p><code>wine mono-2.10.9-gtksharp-2.12.11-win32-0.exe</code> After the installation is done. After a while it just seemed to stop executing commands. However it did not return the prompt on terminal even after waiting for a long time,so i did Ctrl-C to get back the prompt. This showed some fixeme for the console. </p>
<p>Following this by,</p>
<p><code>wine BlueStacks-SplitInstaller_native.exe</code> The bluestacks installer comes up and immediately gives the error dialog stating </p>
<pre><code>Unhandled exception: page fault on read access to 0x7de321a8 in 32-bit code (0x100035cf).
Register dump:
CS:0073 SS:007b DS:007b ES:007b FS:0033 GS:003b
EIP:100035cf ESP:0033f57c EBP:0033f5a0 EFLAGS:00010246( R- -- I Z- -P- )
EAX:0012bd98 EBX:0033fa54 ECX:7de32160 EDX:0033f594
ESI:00000643 EDI:0033f84c
Stack dump:
0x0033f57c: 0012bd98 0033f594 0033f84c 00000643
0x0033f58c: 0033fa54 00000136 00000000 00000000
0x0033f59c: 84ac8254 0033f64c 10005604 00000002
0x0033f5ac: 0012bd98 1001854a 0033f84c 0033fa54
0x0033f5bc: 0033f5d0 002206ec 00000000 00220706
0x0033f5cc: 00220706 7bc3d409 00000643 0012bd98
</code></pre>
<p>and lot other details.</p>
<p>The installer meanwhile continues upto 98% installation and hangs.</p>
<p>What step did i do wrong?</p>
<p><strong>Note:</strong> I don't want a VM for this purpose (I am not going to do anything on Windows except use Whatsapp). Any other alternatives are welcome. I have tried with <a href="https://superuser.com/questions/580320/youwave-on-wine-fedora">Youwave</a> too, but with little success.</p>
| 0non-cybersec
| Stackexchange | 728 | 2,091 |
Python: sorting string non lexicographically. <p>Say I have list called sort_me and want to sort with a non lexicographically ordered alphabet called special_alphabet</p>
<pre><code>sort_me = ['appa', 'apple', 'orange', 'carrot']
special_alphabet = "dklmnoabctuvwxyzfghipqrsej"
result = sorted(sort_me, key=?)
print (result)
</code></pre>
<p>expected result: ['orange', 'apple', 'appa', 'carrot']</p>
| 0non-cybersec
| Stackexchange | 137 | 404 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.