text
stringlengths 3
1.74M
| label
class label 2
classes | source
stringclasses 3
values |
|---|---|---|
Substitute Toolbar with Collapsing Toolbar in different Fragment. <p>I might be missing something very simple here, but I could definitely use some help.</p>
<p>I have an activity inside which I want to load different fragments with different content and different toolbar style (i.e. Toolbars with custom View and CollapsingToolbarLayout(that too having custom layout inside in it)). At the same time, I want to have one instance of the drawer, accessible through the single activity(i.e. MainActivity).</p>
<p>I have gone through the examples to find something similar, but all of them use new activities in order to populate their content or they just hide/show toolbar content that is not appropriate in my case as I've custom Toolbar views for each Fragment, therefore I cannot find out what should be the order of the layout views. Some of the solution that I've gone through are like :</p>
<ol>
<li><p><a href="https://stackoverflow.com/questions/44721554/collapsing-toolbar-only-for-one-fragment-in-navigation-view">Collapsing Toolbar only for one Fragment in Navigation View</a></p></li>
<li><p><a href="https://stackoverflow.com/questions/30739806/coordinator-layout-with-toolbar-in-fragments-or-activity">Coordinator Layout with Toolbar in Fragments or Activity</a></p></li>
<li><p><a href="https://stackoverflow.com/questions/38501079/collapsing-toolbar-and-drawerlayout">Collapsing Toolbar and DrawerLayout</a></p></li>
</ol>
<p><strong>TL;DR</strong></p>
<p>For one Fragment I want Toolbar as below</p>
<p><a href="https://i.stack.imgur.com/lEk43.gif" rel="noreferrer"><img src="https://i.stack.imgur.com/lEk43.gif" alt="enter image description here"></a></p>
<p>And for other Fragment </p>
<p><a href="https://i.stack.imgur.com/Iumwb.jpg" rel="noreferrer"><img src="https://i.stack.imgur.com/Iumwb.jpg" alt="enter image description here"></a></p>
| 0non-cybersec
| Stackexchange |
"Food and Drug Administration announced a research partnership with IBM Watson to find ways to safely share data from EHRs, clinical trials, genetic sequencing, and even mobile wearables using the blockchain approach.". | 0non-cybersec
| Reddit |
Wall plank difficulty. So i can do a plank for more than a minute and just wanted to progress to a wall plank. The problem is i cant hold my feet against the wall my feet just slip. Is this due to my grip or strength. | 0non-cybersec
| Reddit |
My friends beer seems to be bubbling in a odd way.. | 0non-cybersec
| Reddit |
OS boots but black screen, not even BIOS menu is shown. <p>I have 5 years old Acer Aspire 7741g. I was playing video games and suddenly I got artifacts on screen and screen freezing so I had to reboot. This happened several times in couple of days only during video games playing.</p>
<p>Now suddenly when I start up the screen remains black, not even BIOS option is shown, but I can hear OS stars correctly. If I press F2 I can hear entering BIOS but screen is black.</p>
<p>Is graphics card broken (wouldn't I be able to see and enter BIOS if so)?</p>
<p>Or is monitor backlight broken?</p>
<p>What are other options?</p>
<p>It was on service recently and they said hard disk has some errors, but if it is hard disk I could enter bios.</p>
| 0non-cybersec
| Stackexchange |
EditText saved the value after device rotation automatically. <p>I created a sample application in Android Studio to learn about the life cycle of an Android application. I know that orientation change completely restarts the activity (i.e. OnCreate method is called again).
As far as I know, orientation change should have destroyed the context and shown a blank text after device rotation. But somehow without overriding onSaveInstanceState and onRestoreInstanceState methods it is saving the context.</p>
<p>I don't have any fragments. It just the basic template that is provided by Android studio, with few overridden life cycle methods.
Here is my MainActivity class:</p>
<pre><code>package com.example.android.a2_screen_orientation_change;
import android.os.Bundle;
import android.support.v7.app.AppCompatActivity;
import android.util.Log;
public class MainActivity extends AppCompatActivity {
private static final String TAG = MainActivity.class.getSimpleName();
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_main);
}
@Override
protected void onStart() {
super.onStart();
Log.i(TAG, "in method onStart");
}
@Override
protected void onResume() {
super.onResume();
Log.i(TAG, "in method onResume");
}
@Override
protected void onRestart() {
super.onRestart();
Log.i(TAG, "in method onRestart");
}
@Override
protected void onPause() {
super.onPause();
Log.i(TAG, "in method onPause");
}
@Override
protected void onStop() {
super.onStop();
Log.i(TAG, "in method onStop");
}
@Override
protected void onDestroy() {
super.onDestroy();
Log.i(TAG, "in method onDestroy");
}
}
</code></pre>
<p>Layout:</p>
<pre><code><?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
xmlns:tools="http://schemas.android.com/tools"
android:layout_width="match_parent"
android:layout_height="match_parent"
tools:context="com.example.android.a2_screen_orientation_change.MainActivity">
<EditText
android:id="@+id/editText"
android:layout_width="match_parent"
android:layout_height="wrap_content" />
</LinearLayout>
</code></pre>
<p>AbdroidManifest:</p>
<pre><code><?xml version="1.0" encoding="utf-8"?>
<manifest xmlns:android="http://schemas.android.com/apk/res/android"
package="com.example.android.a2_screen_orientation_change">
<application
android:allowBackup="true"
android:icon="@mipmap/ic_launcher"
android:label="@string/app_name"
android:roundIcon="@mipmap/ic_launcher_round"
android:supportsRtl="true"
android:theme="@style/AppTheme">
<activity android:name=".MainActivity">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.LAUNCHER" />
</intent-filter>
</activity>
</application>
</manifest>
</code></pre>
<p>Image:
<a href="https://i.stack.imgur.com/s8763.jpg" rel="noreferrer"><img src="https://i.stack.imgur.com/s8763.jpg" alt="Text got saved even after device orientation change"></a></p>
| 0non-cybersec
| Stackexchange |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
[UK] Hope those 5 seconds saved were worth it!. | 0non-cybersec
| Reddit |
I shovel snow in Buffalo. I just made a new friend who was looking out his window!. | 0non-cybersec
| Reddit |
TIL that child actor Bobby Driscoll (Peter Pan and other Disney classics) is buried as an unknown vagrant in a mass grave on Hart island (NYC), and was only identified after his mother, who thought he was still alive, matched his fingerprints to a burial record.. | 0non-cybersec
| Reddit |
Series approximation to $\int_0^1\sqrt{\frac{2x+3}{2u^3-(2x+3)u^2+2x+1}}du$. <p>I have figured out by graphing that, for small $x$:
$$
\int_0^1\sqrt{\frac{2x+3}{2u^3-(2x+3)u^2+2x+1}}du\approx\log(1/x)+\pi/2+O(x)
$$
However, I am unable to prove that this is the case.</p>
<p>As $x\to 0$ the integral diverges at $u=1$. We can check this by factoring the limit of the integrand:
$$
\sqrt{\frac{3}{1+2u}}\frac{1}{1-u}
$$</p>
<p>This looks promising, since the integral of $1/u$ is $\log u$. However, normally the integral converges: taking a series around $u=1$ we get:
$$
\sqrt{\frac{2x+3}{4x}\frac{1}{1-u}}+O(\sqrt{1-x})
$$</p>
<p>This means that when I take the series approximation of $x$ inside the integral, the resulting integral goes like $x^{-1/2}$, which is incorrect. What step am I missing?</p>
| 0non-cybersec
| Stackexchange |
Given the announcement of Fallout 76, and recent news of Benedict Cumberbatch fending off 4 men attacking a cyclist... here's my Cumberbatch in Fallout 4!. | 0non-cybersec
| Reddit |
RobertXLee - Calculated?. | 0non-cybersec
| Reddit |
using metismenu in angular 8 the second level nav does not open in mobile size screen. <p>I am a novice at angular and trying to convert a website (admin theme) into angular using Jquery and metismenu (I understand many people do not want to use Jquery but as I am trying to migrate the website I do not wish to modify lots of things)
Scenario: In the website when opening through a small device the page looks like below
<a href="https://i.stack.imgur.com/0y6YY.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/0y6YY.png" alt=" "></a></p>
<p>the steps are:
1. the user clicks on the fa-bars icon
2. the vertical menu appears and when the user clicks on any of the menus icons,
3. the links appear to the right</p>
<p>The challenge is to get the same behaviour using Angular 8.
At this point my header component.html (the one that gets the fa-bar working reads)</p>
<pre><code><div class="row border-bottom">
<nav class="navbar navbar-static-top " role="navigation" style="margin-bottom: 0">
<div class="navbar-header">
<a class="minimalize-styl-2 btn btn-primary " (click)="toggleNavigation()"><i class="fa
fa-bars"></i> </a>
</div>
<ul class="nav navbar-top-links navbar-right">
<li>
<span class="m-r-sm text-muted welcome-message">XXXX</span>
</li>
<li>
<a (click)="removeValue()">
<i class="fa fa-sign-out"></i> Log out
</a>
</li>
</ul>
</nav>
</div>
</code></pre>
<p>and my header component.ts reads:</p>
<pre><code>toggleNavigation(): void {
jQuery("body").toggleClass("mini-navbar");
smoothlyMenu();
}
</code></pre>
<p>My sidebar menu reads:</p>
<pre><code> <nav class="navbar-default navbar-static-side" role="navigation">
<div class="sidebar-collapse">
<ul class="nav metismenu" id="side-menu">
<li class="nav-header">
<div class="dropdown profile-element" dropdown>
<div class="circle">
<span class="initials" id="myFunction(twoinitials)">
{{currentUser.firstnameletter}}{{currentUser.lastnameletter}}</span>
</div>
<a data-toggle="dropdown" class="dropdown-toggle" href="#">
<span style="width: 100%;text-align: center" class="block m-t-xs font-bold">
{{currentUser.firstname}} {{currentUser.lastname}}</span>
<span style="width: 100%;text-align: center" class="block m-t-xs font-bold">
{{currentUser.role_id}}</span>
</a>
</div>
<div class="logo-element">
</div>
</li>
<li>
<a href="#"><i class="fa fa-th-large"></i> <span class="nav-label" >Accounts</span> <span
class="fa arrow"></span></a>
**<ul class="nav nav-second-level collapse">
<li><a routerLink="/paymentreq/newrequest" routerLinkActive="active- link"
[routerLinkActiveOptions]="{exact:true}" *ngIf="show_paymentrequest">Payment
Request</a></li>
<li><a routerLink="/paymentreq/payment-approval"
routerLinkActive="active-link" [routerLinkActiveOptions]="
{exact:true}" *ngIf="show_paymentapproval">Payment Approval</a> </li>
<li><a routerLink="/paymentreq/payment-pay" routerLinkActive="active-
link" [routerLinkActiveOptions]="{exact:true}"
*ngIf="show_paymentpay">Process Payment </a></li>
<li><a routerLink="/paymentreq/payment-reports" routerLinkActive="active-
link" [routerLinkActiveOptions]="{exact:true}"
*ngIf="show_paymentreport">Payment Reports</a></li>
</ul>**
</li>
.......................
</code></pre>
<p>My sidebard component ts reads:</p>
<pre><code> jQuery('#side-menu').metisMenu();
if (jQuery("body").hasClass('fixed-sidebar')) {
jQuery('.sidebar-collapse').slimscroll({
height: '100%'
})
}
}
</code></pre>
<p>Now, with that setup everything "works" fine in a normal screen (the menu is normal to the side, the fa-bars button is there and I can follow the links etc)
BUT when I go into mobile mode, the fa-bars button works and the slim scroll appears, HOWEVER, the second level navigation links DO NOT appear even if I can see that something happens (the green bar to the left is active) after clicking any of the menus buttons.
I have been going on with this for a day or so and read tons and try tons of different setups but to no avail, If a kind soul could help me or point me in the right direction I will appreciate greatly.</p>
| 0non-cybersec
| Stackexchange |
dd command oflag direct and sync flags. <p>I have the below shell script and I wonder whether <strong>oflag</strong>'s <strong>direct</strong> does the <strong>sync</strong>ing automatically or if it is explicitly required:</p>
<pre><code>dd bs=10M oflag=direct,sync of=ofile.bin
</code></pre>
<p>Also what is the difference in saying <strong>oflag=sync</strong> and <strong>conv=sync</strong> and <strong>conv=fsync</strong>?</p>
<p>What impact does it have if I change the code to the line below?</p>
<pre><code>dd bs=10M conv=fsync oflag=direct of=ofile.bin
</code></pre>
| 0non-cybersec
| Stackexchange |
[Science] Have to share - aqua aerobics teacher told me her sister just used keto to treat her brain tumor. Looked it up online..... http://healthimpactnews.com/2013/using-the-ketogenic-diet-to-heal-brain-tumors/
She said her sister only had four weeks to do keto from the time of diagnosis until the time of surgery and during that time her tumor shrunk by 3/4. This just happened last month. I just happened to mention that I was on keto and she told me her story. I continue to be amazed by the things I learn every day about this way of life. | 0non-cybersec
| Reddit |
Partial sums of the logarithmic function. <p>Consider the following </p>
<p>$$\int^a_0 \frac{1-x^k}{1-x }\, dx \text{ on the disk } |a|\leq 1.$$</p>
<p>This can simplified to </p>
<p>$$\sum_{n\geq 0}\int^a_0 x^n (1-x^k) \, dx $$</p>
<p>$$\sum_{n\geq 1}\frac{a^n}{n}-\frac{a^{n+k}}{n+k} $$</p>
<p>$$\sum_{n\geq 1}\frac{a^n}{n}-\sum_{n\geq k+1 }\frac{a^{n}}{n} = \sum_{n=1}^k \frac{a^n}{n}$$</p>
<p>This can also be thought of as partial sums of the logarithm function $\log(1-a)$.</p>
<p>So I defined the following </p>
<p>$$H_k^{(p)}(a)=\sum_{n=1}^k \frac{a^n}{n^p},$$</p>
<p>or the alternating partial sum </p>
<p>$$H_k^{(p)}(-a)=\sum_{n=1}^k \frac{(-1)^n}{n^p}a^n,$$</p>
<p>where $H^{(1)}_k(1)$ defines the harmonic numbers.</p>
<p>Some related functions are the following:</p>
<p>$$H_{\infty}^{(1)}(-a) = \log(1+a)$$</p>
<p>$$H_{\infty}^{(1)}(a) = -\log(1-a)$$</p>
<p>$$H_{\infty}^{(p)}(a) = \operatorname{Li}_p(a)$$</p>
<p>$$H_{\infty}^{(p)}(-1) = \eta(p)$$</p>
<p>$$H_{\infty}^{(p)}(1) = \zeta(p)$$</p>
<p>My question is whether this is already established in the mathematics community; that is, please refer me to an article where these partial sums are discussed in detail. Of course I know that $H_k^{(p)}(1)$ is already there , but I mean something with a parameter $a$. What made think of this is how often I encountered these partial sums.</p>
| 0non-cybersec
| Stackexchange |
In John Wick, John had just gone out to get some toys for his new dog Daisy. We know how things ended up later that same day.... | 0non-cybersec
| Reddit |
I suffered from postpartum psychosis.. I hate the way society glamourizes pregnancy and childbirth. It is not a beautiful experience. There is no glowing. It hurts, it's exhausting, and you cry... A lot.
I had warning signs my entire pregnancy that my mental health was going to be awful postpartum. My Dr literally walked me to mental health ( in some military hospitals, there is an outpatient mental health clinic inside ) and made sure I was seen and evaluated. Unfortunately my family had to relocate at 33 weeks, and I had all new doctors who were nowhere near as concerned. My health deteriorated quickly, and they focused on that. They saved my life but I was left alone to process it all postpartum, and that can be dangerous in cases like mine.
I snapped. There's no better way to put it. I wasn't sleeping. Wasn't eating. Wasn't motivated to cook or clean or do self care. I took care of my daughter, but at some point my poor traumatized brain became convinced she was a hallucination. I woke up one night so convinced that I had dropped her. I woke my mom screaming that I had hurt my baby. She was totally fine, and is now a very healthy and happy one year old because I had the strength to realize real or not she should be cared for. Physical pain was very dulled down. Even my c section incision, which I knew hurt, was a very detached sort of pain. Like an echo almost.... It's hard to explain.
I was very suicidal, and told myself that when I woke up from the delusion of having a baby I would end my life. I would hit myself in the head repeatedly , drag sharp things against my skin to draw blood, throw things at my husband. The last straw was when I had a meltdown and threw my phone on the floor, completely shattering the screen. I realized then that I was probably very very sick, and booked an appointment with my OB.
I was given 50 mg of Zoloft and sent on my way. No referral to mental health care...nothing. The pills helped me come back to reality. I now know that my baby is real and I was dealing with psychosis. But mentally, I'm still not okay. My brain clings to the traumatic things that I experienced. It's like my identity rebuilt itself around it.. I used to be so full of life. It shakes me to my core when I realize how serious my situation was, and how it could have gone way worse. I'm lucky I saw the signs, because nobody not even my family was picking up on them.
If you're pregnant, a new mom , or know somebody that is, please take care of yourself / them and be careful. Your life matters. I love you.
Edit!!!: thank you so much for the responses, both positive and negative. I am so sad to hear how common it is to be brushed aside when asking for help. Im also so glad my story has helped some of you realize you may need help.. Im going to attach a link for a website I found. I don't know much about it but it seems to have resources for both mom's and dad's ( because men suffer too... That's not talked about either ) . please be kind to yourselves and know you're not alone.
https://www.postpartum.net/ | 0non-cybersec
| Reddit |
My favorite thing about Keto is not food related :). 51yo/m/5'11/180lbs
I like that I feel better. I like having more energy and less inflamation. What i really like and enjoy is the community. For the most part Keto'ers (spelling???) are so encouraging and generous. Everyone wants to share positives and inspiration. Its such a breath of fresh air nowadays. Before and after pic's, no judging. You get to see the good side of people. Their are the occasional people who get nasty or opinionated but they are few and far between. People trying to help people by answering questions or making suggestions. I just appreciate it. | 0non-cybersec
| Reddit |
how to create 100% vertical line in css. <p>I want to create a vertical line that cover whole page like this</p>
<p><img src="https://i.stack.imgur.com/R8EJh.jpg" alt="enter image description here"></p>
<p>here is my code</p>
<pre><code>#menu
{
border-left: 1px solid black;
height: 100%;
}
</code></pre>
<p>result show like this
<img src="https://i.stack.imgur.com/QQyDo.jpg" alt="enter image description here"></p>
| 0non-cybersec
| Stackexchange |
How to install grphics card driver installation on dell inspiron N5010. <p>I am not able to install graphic card drivers on my Dell Inspiron N5010 model laptop. When I am trying to install fglrx from terminal </p>
<pre><code>vijay@ubuntu:~$ sudo apt-get install fglrx
Reading package lists... Done
Building dependency tree
Reading state information... Done
Some packages could not be installed. This may mean that you have
requested an impossible situation or if you are using the unstable
distribution that some required packages have not yet been created
or been moved out of Incoming.
The following information may help to resolve the situation:
The following packages have unmet dependencies:
fglrx : Conflicts: xorg-driver-binary
nvidia-304-updates : Conflicts: xorg-driver-binary
E: Error, pkgProblemResolver::Resolve generated breaks, this may be caused by held packages.
</code></pre>
| 0non-cybersec
| Stackexchange |
Oprah Winfrey donates $2 million to Puerto Rico arts and recovery groups. | 0non-cybersec
| Reddit |
How to use FOR XML PATH('') in a query without escaping special characters?. <p>I have this query:</p>
<pre><code>SELECT DISTINCT
f.CourseEventKey,
(
SELECT f.Title + '; ' AS [text()]
FROM @Facilities
WHERE CourseEventKey = f.CourseEventKey
ORDER BY f.Title
FOR XML PATH('')
) Facilities
FROM @Facilities f
</code></pre>
<p>It produces this result set:</p>
<pre><code>CourseEventKey Facilities
-------------- -----------------------------------
29 Test Facility 1;
30 Memphis Training Room;
32 Drury Inn &amp; Suites Creve Coeur;
</code></pre>
<p>The data is fine, but the <code>&amp;</code> is actually an encoded <code>&</code>, which is not suitable for my purposes.</p>
<p>How can I modify this query to return the original values of the special characters in my data?</p>
| 0non-cybersec
| Stackexchange |
Windows Server 2012 MSMQ - Some Clients don't connect. <p>We have some strange things happening with a new installation of MSMQ on a Windows Server 2012 R2 Cluster: </p>
<ul>
<li>the clients reach the server without problems</li>
<li>the server tries to send a message to the client and gets the error message "Failed to connect to winsock socket"</li>
<li>the server is able to ping the client and vice versa</li>
<li>restarting the MSMQ-Client on the clients (Windows 7 domain-members, same domain as the server) seems to fix the problem teporarily</li>
<li>it only affects a few clients, and not always the same. We might have identified one of the reasons being that the network is not fully operational at the time the MQ-client starts. Starting the client without network connection always results in the error. </li>
<li>the strangest thing: it only affect communication to the new 2012-server. The same clients have no problems communicating with MSMQ on 2008-servers, even when they can't communicate with the 2012 MQ at the same time. </li>
</ul>
<p>One articel we found described opening the firewallports for RPC-EPMAP, which we did, unfortunatelly without helping. The log of the firewall shows no dropped packets.</p>
<p>At the moment we are clueless, especially since the Clients just work flawlessly with the Windows 2008 MSMQ-Servers. </p>
| 0non-cybersec
| Stackexchange |
Installed new MB, CPU and RAM, and yet my free copy of Windows 10 still works! How is this possible?. Hey there!
So as the title states; despite me changing my motherboard, my processor and my RAM, I was still able to run my computer as I always had when I booted it up after having installed the new components. Everything is there. That is to be expected, of course, since I didn't change any of my storage units, but what surprises me is that I can still use my free copy of Windows 10. I have a new sopy of Windows 10 laying beside me, but it seems I have no need for it?
Before you ask: I have no idea what version of Windows 7 I had prior to the upgrade to windows 10. How is this possible, you ask? Well, I actually got my old version of Windows 7 from my older brother a couple of years ago. He, in turn, had received the copy completely for free from the education faculty he went to. He had no use for it, and so he burnt the copy of Windows 7 he was given to an empty DVD and handed it over to me, along with the key. I didn't ask him back then what version it was, because I was wildly clueless about most things computer related (still am, but slightly less so). So I do not know if I recieved an OEM-version of retail-version, or what kind of Windows 7 I got.
What I do know is this: the free version of Windows 10 that I recieved when I upgraded from my old Windows 7 was Windows 10 Pro. So that's what I'm using now.
But perhaps all is not well? Perhaps I can still run the Windows 10 OS, but am otherwise unable to receive any safety upgrades from Microsoft, or something like that? Is there any way for me to check is my copy of Windows 10 is still legit?
Please help a brother out here! :)
Cheers! | 0non-cybersec
| Reddit |
In Scheme the purpose of (let ((cdr cdr)) . <p>I've been studying Scheme recently and come across a function that is defined in the following way:</p>
<pre><code>(define remove!
(let ((null? null?)
(cdr cdr)
(eq? eq?))
(lambda ... function that uses null?, cdr, eq? ...)
</code></pre>
<p>What is the purpose of binding null? to null? or cdr to cdr, when these are built in functions that are available in a function definition without a let block?</p>
| 0non-cybersec
| Stackexchange |
ANSI escape sequence ^[[K processed by less -R but not most. <p>I'm writing a wrapper around <code>ack</code> to search for code locally with some additional lines of context piped to a pager.</p>
<p>Here's the wrapper script <code>ackc</code>. Between the different examples, I'll be varying what gets passed to <code>ack</code> as the <code>--pager</code>.</p>
<pre><code>#!/bin/sh
ack -C 20 -i \
--pager=most \
--heading \
--break \
--color \
--show-types \
"$@"
</code></pre>
<p>With <code>less</code> (without the -R) as the pager, almost all of the escape sequences are rendered using the caret notation (don't know what that's called. <code>^[</code> is the exception. It is rendered as <code>ESC</code> with inverted background colors (colors not reproduced here).</p>
<p>Here's a sample of the output (produced by <code>ackc</code> with <code>--pager=less</code> and environment variables such as <code>LESS</code>, <code>LESSPIPE</code> etc cleared)</p>
<pre><code>ESC[1;32m.local/lib/python2.7/site-packages/markupsafe/_speedups.cESC[0m
...
ESC[1;33m19ESC[0m:#define PY_SSIZE_T_MAX ESC[30;43mINTESC[0m_MAXESC[0mESC[K
ESC[1;33m20ESC[0m:#define PY_SSIZE_T_MIN ESC[30;43mINTESC[0m_MINESC[0mESC[K
</code></pre>
<p>The important escape sequence here is the <code>^[[K</code> sequence at the end of each line containing a highlighted item. It is handled appropriately by <code>less -R</code>.</p>
<pre><code>.local/lib/python2.7/site-packages/markupsafe/_speedups.c
...
19:#define PY_SSIZE_T_MAX INT_MAX
20:#define PY_SSIZE_T_MIN INT_MIN
</code></pre>
<p><code>most</code>, however, does not seem to handle it very well.</p>
<pre><code>.local/lib/python2.7/site-packages/markupsafe/_speedups.c
1-/**
...
19:#define PY_SSIZE_T_MAX INT_MAX^[[K
20:#define PY_SSIZE_T_MIN INT_MIN^[[K
</code></pre>
<p>It passes through the <code>^[[K</code> sequence as-is.</p>
<p>This sequence is <code>CSI (n) K -- EL -- Erase in Line</code>. When given no argument, it erases to the end of the line. Presumably this is needed to clear stray bits of background color if the matched term appears at the end of the line.</p>
<p>Is there a reason why <code>most</code> doesn't understand this sequence? Can I configure it to process it correctly?</p>
| 0non-cybersec
| Stackexchange |
Independence of Axioms in an axiomatic system. <p>How do we show that we are using independent axioms in an axiomatic systems i.e</p>
<ol>
<li><p>$A\rightarrow (B \rightarrow A)$</p></li>
<li><p>$(A\rightarrow (B\rightarrow C)) \rightarrow ((A\rightarrow B)\rightarrow (A\rightarrow C))$</p></li>
<li><p>$(\lnot A\rightarrow \lnot B)\rightarrow (B\rightarrow A)$</p></li>
</ol>
<p>I think I know how to show that the third is independent of the first two, we can take $\lnot \phi = \phi$ and then the first two are still valid but the third is not, but I'm not sure how to go about doing this for the other axioms.</p>
<p>Thanks for any help.</p>
| 0non-cybersec
| Stackexchange |
I fucking hate these assholes. | 0non-cybersec
| Reddit |
postfix regex conditions. <p>I have a postfix body_checks that blocks all mails containing "daily_repport" :</p>
<pre><code>/daily_report/ REJECT
</code></pre>
<p>The thing is that I want to allow mails containing that pattern "daily_repport" if it is to be delivered to [email protected] (for example)</p>
<p>Since I do not know if header_checks (for [email protected]) and body_checks can be mixed, is there a way to break regex processing and deliver the mail when a certain pattern is met?</p>
<p>thx!</p>
| 0non-cybersec
| Stackexchange |
JWT is issuing the same token. <p>I am making a rest API with <code>Jersey</code>. I am using <code>java-jwt</code>(<a href="https://github.com/auth0/java-jwt" rel="noreferrer">https://github.com/auth0/java-jwt</a>) for my token generation work. Please check the below code.</p>
<p><strong>UserJSONInfo</strong> - REST methods class</p>
<pre><code>@Path ("/user_info")
public class UserInfoJSONService
{
@POST
@Path("/authenticateUser")
@Produces(MediaType.APPLICATION_JSON)
public Response authenticateUser(Credentials credentials)
{
UserInfoService service = new UserInfoService();
try{
UserInfo authenticateUser = service.authenticateUser(credentials.getUserName(), credentials.getPassword());
String generateToken = service.generateToken(AuthKey.authorizationSecret);
Authentication auth = new Authentication();
auth.setIdUser(authenticateUser.getIduser());
auth.setToken(generateToken);
return Response.status(Response.Status.OK).entity(auth).build();
//return authenticateUser;
}
catch(IndexOutOfBoundsException e)
{
throw new WebApplicationException(Response.Status.BAD_REQUEST);
} catch (JWTCreationException ex) {
throw new WebApplicationException(Response.Status.UNAUTHORIZED);
} catch (UnsupportedEncodingException ex) {
throw new WebApplicationException(Response.Status.INTERNAL_SERVER_ERROR);
}
}
}
</code></pre>
<p><strong>UserInfoService</strong> - Service Layer</p>
<pre><code>public class UserInfoService {
private static UserInfoDAOInterface userDAOInterface;
public UserInfoService() {
userDAOInterface = new UserInfoDAOImpl();
}
public Session getSession() {
Session session = userDAOInterface.openCurrentSession();
return session;
}
public Transaction getTransaction(Session session) {
Transaction transaction = userDAOInterface.openTransaction(session);
return transaction;
}
public UserInfo authenticateUser(String userName, String password)
{
return authenticate(userName, password);
}
private UserInfo authenticate(String userName, String password) throws IndexOutOfBoundsException
{
Session session = userDAOInterface.openCurrentSession();
Transaction transaction = null;
UserInfo user = new UserInfo();
try {
transaction = userDAOInterface.openTransaction(session);
user = userDAOInterface.authenticate(userName, password, session);
transaction.commit();
// } catch (Exception ex) {
// //ex.printStackTrace();
// System.out.println("OK");
//
} finally {
session.close();
}
return user;
}
public String generateToken(String secret) throws JWTCreationException, UnsupportedEncodingException
{
Token token = new Token();
return token.issueTokenHMAC256(secret);
}
}
</code></pre>
<p><strong>AuthKey</strong> - Simply contains the <code>secret</code></p>
<pre><code>public interface AuthKey {
public static String authorizationSecret = "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx";
}
</code></pre>
<p><strong>web.xml</strong></p>
<pre><code><?xml version="1.0" encoding="UTF-8"?>
<web-app version="3.0" xmlns="http://java.sun.com/xml/ns/javaee" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://java.sun.com/xml/ns/javaee http://java.sun.com/xml/ns/javaee/web-app_3_0.xsd">
<servlet>
<servlet-name>ExampleServlet</servlet-name>
<servlet-class>test.ExampleServlet</servlet-class>
</servlet>
<servlet>
<servlet-name>Jersey RESTful Application</servlet-name>
<servlet-class>org.glassfish.jersey.servlet.ServletContainer</servlet-class>
<init-param>
<param-name>jersey.config.server.provider.packages</param-name>
<param-value>rest</param-value>
</init-param>
<init-param>
<param-name>com.sun.jersey.api.json.POJOMappingFeature</param-name>
<param-value>true</param-value>
</init-param>
</servlet>
<servlet-mapping>
<servlet-name>ExampleServlet</servlet-name>
<url-pattern>/ExampleServlet</url-pattern>
</servlet-mapping>
<servlet-mapping>
<servlet-name>Jersey RESTful Application</servlet-name>
<url-pattern>/rest/*</url-pattern>
</servlet-mapping>
<session-config>
<session-timeout>
30
</session-timeout>
</session-config>
<welcome-file-list>
<welcome-file>index.jsp</welcome-file>
</welcome-file-list>
</web-app>
</code></pre>
<p>I have maintained my token generation classes as another java project and imported it here as a library (I am using Netbeans). Below is the code</p>
<pre><code>package com.xyz.security;
import com.auth0.jwt.JWT;
import com.auth0.jwt.JWTVerifier;
import com.auth0.jwt.algorithms.Algorithm;
import com.auth0.jwt.exceptions.JWTCreationException;
import com.auth0.jwt.exceptions.JWTVerificationException;
import com.auth0.jwt.interfaces.DecodedJWT;
import java.io.UnsupportedEncodingException;
/**
*
* @author Yohan
*/
public class Token {
/**
* Generate the HMAC256 Token
* @param secret
* Secret to generate the token
* @return
* Token as a String
* @throws UnsupportedEncodingException
* UTF-8 encoding not supported
* @throws JWTVerificationException
* Invalid Signing configuration / Couldn't convert Claims.
*/
public String issueTokenHMAC256(String secret) throws UnsupportedEncodingException, JWTCreationException
{
String token="";
try {
Algorithm algorithm = Algorithm.HMAC256(secret);
token = JWT.create()
.withIssuer("auth0")
.sign(algorithm);
} catch (UnsupportedEncodingException exception) {
//UTF-8 encoding not supported
exception.printStackTrace();
} catch (JWTCreationException exception) {
//Invalid Signing configuration / Couldn't convert Claims.
exception.printStackTrace();
}
return token;
}
/**
* Validate a HMAC256 Token
* @param token
* Token you need to validate
* @param secret
* Secret used to generate the token
* @return
* Returns `true` if token is valid.
* @throws UnsupportedEncodingException
* UTF-8 encoding not supported
* @throws JWTVerificationException
* Invalid Signing configuration / Couldn't convert Claims.
*/
public boolean validateTokenHMAC256(String token, String secret) throws UnsupportedEncodingException, JWTVerificationException
{
Algorithm algorithm = Algorithm.HMAC256(secret);
JWTVerifier verifier = JWT.require(algorithm)
.withIssuer("auth0")
.build(); //Reusable verifier instance
DecodedJWT jwt = verifier.verify(token);
return true;
}
}
</code></pre>
<p>Now the problem is, everytime I generate the <code>token</code> when a user login, I am getting the same <code>token</code>. I am using <code>POSTMAN</code> to check REST methods, I opened 3 tabs and made a login attempt for 3 different users. The issue is I am getting the same token! Is this is correct or something wrong? In that case how can I fix it? </p>
| 0non-cybersec
| Stackexchange |
AFS stopped working. <p>This is a followup to <a href="https://unix.stackexchange.com/questions/404247/openafs-suddenly-fails-a-pioctl-failed-while-obtaining-tokens?newreg=69e111d1a6c443f9bbed6a0a3180c2ed">this</a> question. My AFS stopped working on when I tried to run <code>sudo dpkg-reconfigure openafs-modules-dkms</code> I get the following error:</p>
<pre><code>------------------------------
Deleting module version: 1.8.2
completely from the DKMS tree.
------------------------------
Done.
Loading new openafs-1.8.2 DKMS files...
Building for 5.3.0-22-generic
Building initial module for 5.3.0-22-generic
ERROR (dkms apport): kernel package linux-headers-5.3.0-22-generic is not supported
Error! Bad return status for module build on kernel: 5.3.0-22-generic (x86_64)
</code></pre>
<p>This is the log:</p>
<pre><code>> DKMS make.log for openafs-1.8.2 for kernel 5.3.0-22-generic (x86_64)
> Wed 27 Nov 2019 01:10:32 AM CST checking for a BSD-compatible
> install... /bin/install -c checking whether build environment is
> sane... yes /bin/bash:
> /var/lib/dkms/openafs/1.8.2/build/build-tools/missing: No such file or
> directory configure: WARNING: 'missing' script is too old or missing
> checking for a thread-safe mkdir -p... /bin/mkdir -p checking for
> gawk... no checking for mawk... mawk checking whether make sets
> $(MAKE)... yes checking whether make supports nested variables... yes
> checking for gcc... gcc checking whether the C compiler works... yes
> checking for C compiler default output file name... a.out checking for
> suffix of executables... checking whether we are cross compiling...
> no checking for suffix of object files... o checking whether we are
> using the GNU C compiler... yes checking whether gcc accepts -g... yes
> checking for gcc option to accept ISO C89... none needed checking
> whether gcc understands -c and -o together... yes checking whether
> make supports the include directive... yes (GNU style) checking
> dependency style of gcc... none checking build system type...
> x86_64-pc-linux-gnu checking host system type... x86_64-pc-linux-gnu
> checking how to run the C preprocessor... gcc -E checking for grep
> that handles long lines and -e... /bin/grep checking for egrep...
> /bin/grep -E checking for ANSI C header files... yes checking for
> sys/types.h... yes checking for sys/stat.h... yes checking for
> stdlib.h... yes checking for string.h... yes checking for memory.h...
> for sys/ipc.h... yes checking sys/lockf.h usability... no checking
> sys/lockf.h presence... no checking for sys/lockf.h... no checking
> sys/map.h usability... no checking sys/map.h presence... no checking
> for sys/map.h... no checking sys/mount.h usability... yes checking
> sys/mount.h presence... yes checking for sys/mount.h... yes checking
> sys/mntent.h usability... no checking sys/mntent.h presence... no
> checking for sys/mntent.h... no checking sys/mnttab.h usability... no
> checking sys/mnttab.h presence... no checking for sys/mnttab.h... no
> checking sys/pag.h usability... no checking sys/pag.h presence... no
> checking for sys/pag.h... no checking sys/param.h usability... yes
> checking sys/param.h presence... yes checking for sys/param.h... yes
> checking sys/resource.h usability... yes checking sys/resource.h
> presence... yes checking for sys/resource.h... yes checking
> sys/select.h usability... yes checking sys/select.h presence... yes
> checking for sys/select.h... yes checking sys/statfs.h usability...
> yes checking sys/statfs.h presence... yes checking for sys/statfs.h...
> yes checking sys/statvfs.h usability... yes checking sys/statvfs.h
> presence... yes checking for sys/statvfs.h... yes checking
> sys/socket.h usability... yes checking sys/socket.h presence... yes
> checking for sys/socket.h... yes checking sys/sysctl.h usability...
> yes checking sys/sysctl.h presence... yes checking for sys/sysctl.h...
> yes checking sys/time.h usability... yes checking sys/time.h
> presence... yes checking for sys/time.h... yes checking for
> sys/types.h... (cached) yes checking sys/uio.h usability... yes
> checking sys/uio.h presence... yes checking for sys/uio.h... yes
> checking sys/un.h usability... yes checking sys/un.h presence... yes
> checking for sys/un.h... yes checking sys/vfs.h usability... yes
> checking sys/vfs.h presence... yes checking for sys/vfs.h... yes
> checking syslog.h usability... yes checking syslog.h presence... yes
> checking for syslog.h... yes checking termios.h usability... yes
> checking termios.h presence... yes checking for termios.h... yes
> checking time.h usability... yes checking time.h presence... yes
> checking for time.h... yes checking ucontext.h usability... yes
> checking ucontext.h presence... yes checking for ucontext.h... yes
> checking for unistd.h... (cached) yes checking windows.h usability...
> no checking windows.h presence... no checking for windows.h... no
> checking for resolv.h... yes checking for net/if.h... yes checking for
> netinet/if_ether.h... yes checking for security/pam_modules.h... no
> checking for linux/errqueue.h... no checking for fsblkcnt_t... yes
> checking for struct stat.st_ctimespec... no checking for struct
> stat.st_ctimensec... no checking for libintl... no checking for
> arc4random... no checking for closelog... yes checking for fcntl...
> yes checking for fseeko64... yes checking for ftello64... yes checking
> for getcwd... yes checking for getegid... yes checking for geteuid...
> yes checking for getgid... yes checking for getuid... yes checking for
> getrlimit... yes checking for issetugid... no checking for mkstemp...
> yes checking for openlog... yes checking for poll... yes checking for
> pread... yes checking for preadv... yes checking for preadv64... yes
> checking for pwrite... yes checking for pwritev... yes checking for
> pwritev64... yes checking for regcomp... yes checking for regerror...
> yes checking for regexec... yes checking for setitimer... yes checking
> for setvbuf... yes checking for sigaction... yes checking for
> strcasestr... yes checking for strerror... yes checking for sysconf...
> yes checking for sysctl... yes checking for syslog... yes checking for
> tdestroy... yes checking for timegm... yes checking for usable system
> libroken... no checking for usable system libhcrypto... no checking
> for initscr in -lncurses... yes checking for LINES in -lncurses... yes
> configure: checking for curses library... -lncurses (cached)
> configure: checking for curses library... -lncurses checking getmaxyx
> macro... yes checking for __attribute__... yes checking for _Pragma...
> yes checking for _Pragma recognition of
> -Wtautological-pointer-compare... yes checking for chown... yes checking for fchown... yes checking for gethostname... yes checking
> for lstat... yes checking for inet_aton... yes checking for putenv...
> yes checking for readv... yes checking for setenv... yes checking for
> strdup... yes checking for strftime... yes checking for strndup... yes
> checking for strsep... yes checking for unsetenv... yes checking for
> asprintf... yes checking for asnprintf... no checking for vasprintf...
> yes checking for vasnprintf... no checking for vsnprintf... yes
> checking for snprintf... yes checking for daemon... yes checking for
> ecalloc... no checking for emalloc... no checking for erealloc... no
> checking for err... yes checking for errx... yes checking for flock...
> yes checking for freeaddrinfo... yes checking for gai_strerror... yes
> checking for getaddrinfo... yes checking for getdtablesize... yes
> checking for getnameinfo... yes checking for getopt... yes checking
> for getprogname... no checking for gettimeofday... yes checking for
> inet_ntop... yes checking for inet_pton... yes checking for
> localtime_r... yes checking for mkstemp... (cached) yes checking for
> setenv... (cached) yes checking for setprogname... no checking for
> strcasecmp... yes checking for strlcat... no checking for strnlen...
> yes checking for strlcpy... no checking for strsep... (cached) yes
> checking for tdelete... yes checking for tfind... yes checking for
> tsearch... yes checking for twalk... yes checking for unsetenv...
> (cached) yes checking for verr... yes checking for verrx... yes
> checking for vsyslog... yes checking for vwarn... yes checking for
> vwarnx... yes checking for warn... yes checking for warnx... yes
> checking err.h usability... yes checking err.h presence... yes
> checking for err.h... yes checking search.h usability... yes checking
> search.h presence... yes checking for search.h... yes checking whether
> h_errno is declared... yes checking whether time.h and sys/time.h may
> both be included... yes checking for bswap16... no checking for
> bswap32... no checking for positional I/O... yes checking for vectored
> positional I/O... yes checking for POSIX regex library... yes checking
> for pthread_set_name_np... no checking for pthread_setname_np... yes
> checking for signature of pthread_setname_np... three arguments
> checking return type of signal handlers... void checking return type
> of signal handlers... (cached) void checking size of void *... 8
> checking size of unsigned long long... 8 checking size of unsigned
> long... 8 checking size of unsigned int... 4 checking for intptr_t...
> yes checking for uintptr_t... yes checking for ssize_t... yes checking
> for sig_atomic_t... yes checking for socklen_t... yes checking for
> off64_t... no checking for ssize_t... (cached) yes checking for struct
> winsize... yes checking for sa_family_t... yes checking for
> socklen_t... (cached) yes checking for struct sockaddr... yes checking
> for struct sockaddr_storage... yes checking for sa_family_t...
> (cached) yes checking for struct addrinfo... yes checking for long
> long... yes checking size of long... 8 checking whether PAM prefers
> const... no checking for swig... no checking for crypt in -lcrypt...
> yes checking for label support in structs... yes checking checking for
> dirfd... yes checking for dd_fd in DIR... no checking for ru_idrss in
> struct rusage... yes checking uuid/uuid.h usability... no checking
> uuid/uuid.h presence... no checking for uuid/uuid.h... no checking for
> uuid_generate in -luuid... no checking for uuid_generate... no
> checking for ctfconvert... no checking for ctfmerge... no checking
> that generated files are newer than configure... done configure:
> creating ./config.status config.status: creating Makefile
> config.status: creating src/config/Makefile config.status: creating
> src/config/Makefile.config config.status: creating
> src/config/Makefile.lwp config.status: creating
> src/config/Makefile.version-CML config.status: creating
> src/config/Makefile.version-NOCML config.status: creating
> src/libafs/Makefile.common config.status: creating
> src/libafs/MakefileProto config.status: creating
> src/config/afsconfig.h config.status: executing depfiles commands cd
> src && cd config && make make[1]: Entering directory
> '/var/lib/dkms/openafs/1.8.2/build/src/config' rm -f Makefile.version
> if [ -r /var/lib/dkms/openafs/1.8.2/build/src/CML/state ] ; \ then cp
> Makefile.version-CML Makefile.version ; \ else cp
> Makefile.version-NOCML Makefile.version ; \ fi make -f
> Makefile.version AFS_component_version_number.c make[2]: Entering
> directory '/var/lib/dkms/openafs/1.8.2/build/src/config' (
> VERSION=`/var/lib/dkms/openafs/1.8.2/build/build-tools/git-version
> /var/lib/dkms/openafs/1.8.2/build "1.8.2-1ubuntu0.1-debian"` && \ if [
> "$SOURCE_DATE_EPOCH" ]; then \
> echo 'char cml_version_number[]="@(#)OpenAFS '$VERSION `date -u -d "@$SOURCE_DATE_EPOCH" +"%Y-%m-%d" 2>/dev/null || date -u -r "$SOURCE_DATE_EPOCH" +"%Y-%m-%d"`'";'; \ else \
> echo 'char cml_version_number[]="@(#)OpenAFS '$VERSION `date +"%Y-%m-%d"` $USER@`hostname`'";'; \ fi >AFS_component_version_number.c.NEW && \ echo 'char* AFSVersion = "openafs '$VERSION'";' >>AFS_component_version_number.c.NEW && \ if
> cmp AFS_component_version_number.c.NEW AFS_component_version_number.c
> > /dev/null 2>&1 ; then : ; else \ mv AFS_component_version_number.c.NEW AFS_component_version_number.c ; fi
> ) rm -f AFS_component_version_number.c.NEW make[2]: Leaving directory
> '/var/lib/dkms/openafs/1.8.2/build/src/config' gcc -fPIC -O
> -I/var/lib/dkms/openafs/1.8.2/build/src/config -I/var/lib/dkms/openafs/1.8.2/build/include -I. -I. -o config.o -c config.c gcc -fPIC -O -I/var/lib/dkms/openafs/1.8.2/build/src/config -I/var/lib/dkms/openafs/1.8.2/build/include -I. -I. -o mc.o -c mc.c gcc -L/var/lib/dkms/openafs/1.8.2/build/lib
> -L/var/lib/dkms/openafs/1.8.2/build/lib -O -O -I/var/lib/dkms/openafs/1.8.2/build/src/config -I/var/lib/dkms/openafs/1.8.2/build/include -I. -I. -o config config.o mc.o gcc -O
> -I/var/lib/dkms/openafs/1.8.2/build/src/config -I/var/lib/dkms/openafs/1.8.2/build/include -I. -I. -L/var/lib/dkms/openafs/1.8.2/build/lib -L/var/lib/dkms/openafs/1.8.2/build/lib -O \ -o mkvers ./mkvers.c if [ "Xparam.linux26.h" != "X" ] ; then \ cat ./param.linux26.h
> ./param.amd64_linux26.h > param.h.new ; \ else \ cat
> ./param.amd64_linux26.h > param.h.new ; \ fi /bin/install -c -m 644
> param.h.new /var/lib/dkms/openafs/1.8.2/build/include/afs/param.h
> make[1]: Leaving directory
> '/var/lib/dkms/openafs/1.8.2/build/src/config' src/config/config
> src/libafs/MakefileProto \ src/libafs/Makefile amd64_linux26 Wrote
> new makefile 'src/libafs/Makefile'. cd src && cd libafs && make
> make[1]: Entering directory
> '/var/lib/dkms/openafs/1.8.2/build/src/libafs' rm -f h net netinet sys
> rpc ln -fs rx rpc for m in SP ; do \
> KDIR=MODLOAD-5.3.0-22-generic-$m; \ mkdir -p ${KDIR}; \ ln -fs
> ../Makefile ${KDIR}/Makefile.afs ; \ ln -fs ../Makefile.common
> ${KDIR}/Makefile.common; \ ln -fs ../config ${KDIR}/config; \ done
> rm -f h rm -f sys rm -f netinet if [ -d
> /lib/modules/5.3.0-22-generic/build/include2 ] ; then
> \
> ln -fs /lib/modules/5.3.0-22-generic/build/include2/asm/../linux h ; \
> ln -fs /lib/modules/5.3.0-22-generic/build/include2/asm/../linux sys ; \
> ln -fs /lib/modules/5.3.0-22-generic/build/include2/asm/../linux netinet ; \ else
> \
> ln -fs /lib/modules/5.3.0-22-generic/build/include/linux h ; \
> ln -fs /lib/modules/5.3.0-22-generic/build/include/linux sys ; \
> ln -fs /lib/modules/5.3.0-22-generic/build/include/linux netinet ; \ fi rm -f linux ln -fs
> /lib/modules/5.3.0-22-generic/build/include/linux linux rm -f net ln
> -fs /lib/modules/5.3.0-22-generic/build/include/net net rm -f asm-generic ln -fs
> /lib/modules/5.3.0-22-generic/build/include/asm-generic asm-generic rm
> -f asm ln -fs /lib/modules/5.3.0-22-generic/build/include/asm-x86_64 asm if [ "yes" ] ; then \
> TARGPREFIX="pack_"; \ fi ; \ for m in SP ; do \ KDIR=MODLOAD-5.3.0-22-generic-$m ; \ echo Building in directory:
> ${KDIR} ; \ if [ "$m" = "MP" ] ; then \ SMP_DEF="-DAFS_SMP " ; \
> TARG="libafs.mp" ; \ elif [ "$m" = "EP" ] ; then \
> SMP_DEF="-DAFS_SMP " ; \ TARG="libafs.ep" ; \ elif [ "$m" = "BM"
> ] ; then \ SMP_DEF="-DAFS_SMP " ; \ TARG="libafs.bm" ; \ else \
> SMP_DEF=" " ; \ TARG=libafs ; \ fi ; \ cd ${KDIR} ; \ make -f
> Makefile.afs SMP_DEF="${SMP_DEF}" linux_compdirs_${TARGPREFIX}${TARG}
> CLIENT=5.3.0-22-generic KDIR=${KDIR} || exit $?; \ cd ../ ; \ done
> Building in directory: MODLOAD-5.3.0-22-generic-SP make[2]: Entering
> directory
> '/var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP'
> env EXTRA_CFLAGS=""
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/make_kbuild_makefile.pl
> MODLOAD-5.3.0-22-generic-SP openafs.ko
> /var/lib/dkms/openafs/1.8.2/build/src/config/Makefile.config
> Makefile.afs Makefile.common ( env EXTRA_CFLAGS="" \ make -C
> /lib/modules/5.3.0-22-generic/build
> M=/var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP
> modules 2>&1 \ || echo "FAILURE: make exit code $?" ) | tee .makelog
> make[3]: Entering directory '/usr/src/linux-headers-5.3.0-22-generic'
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/sha256-kernel.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rand-fortuna-kernel.o /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rand-fortuna-kernel.c:
> In function ‘fortuna_reseed’:
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rand-fortuna-kernel.c:549:1:
> warning: the frame size of 1032 bytes is larger than 1024 bytes
> [-Wframe-larger-than=] } ^ CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rand-timer-kernel.o CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_atomlist.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_lhash.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_analyze.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_axscache.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_buffer.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_bypasscache.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_callback.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_cbqueue.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_cell.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_chunk.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_conn.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_daemons.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_dcache.o
> In file included from
> /var/lib/dkms/openafs/1.8.2/build/src/afs/afs.h:24,
> from /var/lib/dkms/openafs/1.8.2/build/src/afs/afsincludes.h:48,
> from /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_dcache.c:18:
> /var/lib/dkms/openafs/1.8.2/build/include/opr/jhash.h: In function
> ‘opr_jhash’:
> /var/lib/dkms/openafs/1.8.2/build/include/opr/jhash.h:82:17: warning:
> this statement may fall through [-Wimplicit-fallthrough=]
> case 3 : c+=k[2];
> ~^~~~~~ /var/lib/dkms/openafs/1.8.2/build/include/opr/jhash.h:83:7: note: here
> case 2 : b+=k[1];
> ^~~~ /var/lib/dkms/openafs/1.8.2/build/include/opr/jhash.h:83:17: warning:
> this statement may fall through [-Wimplicit-fallthrough=]
> case 2 : b+=k[1];
> ~^~~~~~ /var/lib/dkms/openafs/1.8.2/build/include/opr/jhash.h:84:7: note: here
> case 1 : a+=k[0];
> ^~~~ CC [M] /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_dir.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_disconnected.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_dynroot.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_error.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_icl.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_init.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_lock.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_mariner.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_memcache.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_fetchstore.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_osi.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_osidnlc.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_osi_alloc.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_osi_pag.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_osi_uio.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_osi_vget.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_osi_vm.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_segments.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_server.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_stat.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_syscall.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_tokens.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_user.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_util.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vcache.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_access.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_attrs.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_create.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_dirops.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_fid.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_flock.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_link.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_lookup.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_open.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_read.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_readdir.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_remove.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_rename.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_strategy.o CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_symlink.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_vnop_write.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_volume.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afs_warn.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/afsaux.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/xdr_update.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/xdr_refernce.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/Kvice.xdr.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/xdr_arrayn.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/xdr_array.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/xdr_int32.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/xdr_int64.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/Kvice.cs.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/fcrypt.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_call.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_conn.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_peer.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_rdwr.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_clock.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_event.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_globals.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_identity.o
> CC [M]
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_kmutex.o
> In file included from
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_kmutex.c:24:
> /var/lib/dkms/openafs/1.8.2/build/src/afs/LINUX/osi_compat.h: In
> function ‘afs_linux_search_keyring’:
> /var/lib/dkms/openafs/1.8.2/build/src/afs/LINUX/osi_compat.h:225:12:
> error: too few arguments to function ‘keyring_search’ key_ref =
> keyring_search(
> ^~~~~~~~~~~~~~ In file included from ./include/linux/cred.h:13,
> from ./include/linux/seq_file.h:12,
> from ./include/linux/seq_file_net.h:5,
> from ./include/net/net_namespace.h:177,
> from ./include/linux/netdevice.h:38,
> from ./include/net/inet_sock.h:19,
> from /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/./netinet/udp.h:16,
> from /var/lib/dkms/openafs/1.8.2/build/src/rx/rx_kcommon.h:110,
> from /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_kmutex.c:20:
> ./include/linux/key.h:387:18: note: declared here extern key_ref_t
> keyring_search(key_ref_t keyring,
> ^~~~~~~~~~~~~~ make[4]: *** [scripts/Makefile.build:290:
> /var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP/rx_kmutex.o]
> Error 1 make[3]: *** [Makefile:1655:
> _module_/var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP]
> Error 2 make[3]: Leaving directory
> '/usr/src/linux-headers-5.3.0-22-generic' FAILURE: make exit code 2
> make[2]: *** [Makefile.afs:280: openafs.ko] Error 1 make[2]: Leaving
> directory
> '/var/lib/dkms/openafs/1.8.2/build/src/libafs/MODLOAD-5.3.0-22-generic-SP'
> make[1]: *** [Makefile:187: linux_compdirs] Error 2 make[1]: Leaving
> directory '/var/lib/dkms/openafs/1.8.2/build/src/libafs' make: ***
> [Makefile:15: all] Error 2
</code></pre>
| 0non-cybersec
| Stackexchange |
Brownian motion and stopping times - Check that two events are the same. <blockquote>
<p>Let <span class="math-container">$(B_t)_{t \geq 0}$</span> be a standard brownian motion and set <span class="math-container">$$M(t) = \max_{s \in [0,t]} B_s$$</span>
and <span class="math-container">$$\tau = \inf \{t \geq 0:B(t)= a \}$$</span></p>
</blockquote>
<p>In the proof of the reflection principle I used the fact <span class="math-container">$$\{ M(t) \geq a \} = \{ \tau \leq t \}$$</span>. Intuitively it's clear: "if the maximum in <span class="math-container">$[0,t]$</span> is greater or equal than <span class="math-container">$a$</span>, then I've reached <span class="math-container">$a$</span> in a time between <span class="math-container">$0$</span> and <span class="math-container">$t$</span>"</p>
<p>But I want to check this in the formal way by double inclusion, I'd like to be sure it's right.</p>
<hr>
<ul>
<li><p>If <span class="math-container">$\omega$</span> belongs to the set on the left, then <span class="math-container">$\exists \bar{t} \in [0,t]: B_{\bar{t}}(\omega) \geq a$</span>. In particular <span class="math-container">$\bar{t} \leq t$</span>. Hence <span class="math-container">$\tau(\omega) \leq t$</span>.</p></li>
<li><p>Conversely, is <span class="math-container">$\omega \in \{ \omega \in \Omega: \tau(\omega) \leq t\}$</span>, then I have <span class="math-container">$\tau(\omega) = \bar{t} $</span>, for some <span class="math-container">$\bar{t} \leq t$</span>. In particular <span class="math-container">$B_{\bar{t}} (\omega)=a$</span>.
From this follows that <span class="math-container">$\max_{s \in [0,t]} B_s \geq a$</span></p></li>
</ul>
| 0non-cybersec
| Stackexchange |
Russian soldiers encounter a tiger on the road. | 0non-cybersec
| Reddit |
Different eigenvalues of the same linear transformation according different bases. <p>I have a question about linear transformation and eigenvalues.</p>
<p><strong>My question:</strong></p>
<p>Given a linear transformation $T:R^3 \to R^3$, And: $E$ is the standard basis of $R^3$, $B$ is another basis of $R^3$.</p>
<p>Let's denote: $A=[T]^B_B$ .</p>
<p>Let's assume that after gaussian elimination process on $A$ we get a matrix $M$ with one row of $0$'s, and now we calculate the eigenvalues of $M$.</p>
<ul>
<li>Are the eigenvalues of $M$ also the eigenvalues of the transformation $T?$</li>
</ul>
<p>I think <strong>yes</strong>, because the eigenvalues don't change when you change basis, but the correct answer is <strong>no</strong>, can someone explain to me why?</p>
<p>By the way, Is it correct to say that we always must to work <strong>only</strong> with the standard basis of $R^3$ to find the eigenvalues of $T?$ (i.e the eigenvalues of $T$ are the roots of the caracteristic polynomial $P_A = Det(A- \lambda \cdot I)$ where $A=[T]^E_E$ , and $E$ is the <strong>standard</strong> basis)?</p>
<p>Thanks for help!</p>
| 0non-cybersec
| Stackexchange |
Is there a way to start a script on the publisher when synchronization starts?. <p>I am using merge replication with pull subscriptions and Web Sync.</p>
<p>What is the easiest way to start a SQL script on the publication database when a subscriber starts the synchronization process?</p>
<p>There is this, <a href="http://msdn.microsoft.com/en-us/library/ms174360.aspx" rel="nofollow"><code>sp_addscriptexec</code></a>, but that specifies a script to run at the subscription database which isn't what I am after.</p>
| 0non-cybersec
| Stackexchange |
Win Screening Passes to Final Destination 5. | 0non-cybersec
| Reddit |
Whats the value of &y[0] == &x.a?. <p>Got this piece of code from an homework assignment. I should figure out, what the value of <code>&y[0] == &x.a</code>. Btw sorry for not formatting properly, I tried my best.</p>
<p>So my approach was; <code>y[0] = 1</code>, and <code>&y[0]</code> means the address of <code>1</code>, which is <code>0</code> in the array?</p>
<p><code>x.a</code> confused me the most. Does it mean element a of the struct x? So <code>x.a == 1</code> ? And its address would also be <code>0</code>? So the boolean would come out as <code>true(1)</code>, because <code>0 == 0</code>. But the solution says it's false, but why?</p>
<pre><code>struct my_struct {
int a;
double b;
int c;
};
my_struct x = { 1, 2, 3 };
int y[] = { 1, 2, 3 };
</code></pre>
<p>I expected the output <code>1</code> but apparently it's <code>0</code>, but why?</p>
| 0non-cybersec
| Stackexchange |
Show $\bigcap_{p \in (1, \infty)} (\frac{1}{p}, 3p) \subseteq [1,3]$. <blockquote>
<p><span class="math-container">$\bigcap_{p \in (1, \infty)} (\frac{1}{p}, 3p) \subseteq [1,3]$</span></p>
</blockquote>
<p>My first intuition is to prove the contrapositive instead. That being: </p>
<p><span class="math-container">$x \notin [1,3] \Rightarrow x \notin \bigcap_{p \in (1, \infty)} (\frac{1}{p}, 3p)$</span></p>
<p>Meaning if we can find at least one <span class="math-container">$p$</span> where <span class="math-container">$x$</span> isn't a member of <span class="math-container">$(\frac{1}{p}, 3p)$</span>, then the proof is complete.</p>
<p>Am I on the right track here?</p>
| 0non-cybersec
| Stackexchange |
Editing the grub.cfg file in Ubuntu on VirtualBox. <p>I'm new to Linux but I'm following this tutorial to build my own operating system:
<a href="https://www.youtube.com/watch?v=1rnA6wpF0o4&list=PLHh55M_Kq4OApWScZyPl5HhgsTJS9MZ6M&index=1" rel="nofollow noreferrer">Write your own Operating System in 1 hour</a></p>
<p>at the end of the first video, I need to edit the grub.cfg file by adding the follwoing:</p>
<pre><code>### BEGIN MY KERNEL ###
menuentry 'My Operating System'
{
multiboot /boot/mykernel.bin
boot
}
### END MY KERNEL ###
</code></pre>
<p>It looks like it's <a href="https://i.stack.imgur.com/igfa7.png" rel="nofollow noreferrer">only for reading</a> on my virtual machine!</p>
<p><a href="https://i.stack.imgur.com/igfa7.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/igfa7.png" alt="readonly warning" /></a></p>
<p>I want to complete the process, and see the output, how can I edit this file?</p>
| 0non-cybersec
| Stackexchange |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
How heart works. | 0non-cybersec
| Reddit |
We are Number one but it's day 69's Magnemite but it's actually a remake of the original picture (Magnemite #111). | 0non-cybersec
| Reddit |
Russel Wilson on being the 75th draft pick this year. | 0non-cybersec
| Reddit |
Good old days bhopping. | 0non-cybersec
| Reddit |
Small caps in footnote in title (amsart). <p>I am trying to add a footnote to a title in <a href="https://www.ctan.org/pkg/amsart" rel="nofollow"><code>amsart</code></a> in small caps, but constantly end up with upper case characters (even in math mode).</p>
<pre><code>\documentclass{amsart}
\title{ text \footnote{ text }}
\begin{document}
\maketitle
\end{document}
</code></pre>
<p>How can I get small caps in the footnote?</p>
| 0non-cybersec
| Stackexchange |
VMware Player warns me of no swap whenever I launch a VM. <p>I just installed 14.04 Desktop, using "automatic partition setting" by the installer, with the "encrypt entire hard disk" option. I installed the latest VMWare (version date Apr 17th). Now whenever I launch one of my old VMs (haven't tried making a new one yet), I get a warning dialog box with the following text:</p>
<blockquote>
<p>VMware Player recommends 512 MB of system swap space for the set of currently running virtual machines. 0 bytes of system swap space is available. For optimum performance increase the amount of system swap space, or configure all virtual machine memory to use reserved host RAM under Preferences.</p>
</blockquote>
<p>...with an OK button underneath. I'm getting it a few seconds after I ask it to launch the VM, but I <strong>think</strong> it's before it starts booting (but not sure). This message didn't appear in 13.10 with the older VMware Player.</p>
<p>I'm worried I might be doing something seriously wrong. Is it telling me I don't have swap on my host machine? (If so, how can I check that? GParted only shows the top-level partitions, maybe my swap area is inside the encrypted partition.) Do I really need the swap on my host? (I have 8GB of RAM, and I'm running 2 VMs at a time, each with 1 GB of RAM). Should I turn this warning off? (there's a checkbox for that) Or is it telling me my VM doesn't have a swap area? Here's what I get when I type <code>df -h</code> in my VM:</p>
<pre class="lang-none prettyprint-override"><code>Filesystem Size Used Avail Use% Mounted on
/dev/sda1 19G 4.1G 14G 23% /
none 497M 164K 497M 1% /dev
none 501M 0 501M 0% /dev/shm
none 501M 80K 501M 1% /var/run
none 501M 0 501M 0% /var/lock
none 501M 0 501M 0% /lib/init/rw
</code></pre>
<p>And here's what I get when I type it in my host machine:</p>
<pre class="lang-none prettyprint-override"><code>Filesystem Size Used Avail Use% Mounted on
/dev/mapper/ubuntu--vg-root 680G 78G 567G 13% /
none 4.0K 0 4.0K 0% /sys/fs/cgroup
udev 3.9G 8.0K 3.9G 1% /dev
tmpfs 789M 1.2M 787M 1% /run
none 5.0M 0 5.0M 0% /run/lock
none 3.9G 276K 3.9G 1% /run/shm
none 100M 84K 100M 1% /run/user
/dev/sda2 237M 54M 171M 24% /boot
/dev/sda1 511M 3.4M 508M 1% /boot/efi
/home/karjala/.Private 680G 78G 567G 13% /home/karjala
</code></pre>
| 0non-cybersec
| Stackexchange |
Florida man's vehicle catches fire after charging Galaxy Note 7 explodes | Fox News. | 0non-cybersec
| Reddit |
HBO releases 18 Character Posters for Game of Thrones Season 4. | 0non-cybersec
| Reddit |
How to comply with the Java ASM License?. <p>I am designing an open source Java library that I will likely release with an MIT license, and its sole dependency is the <a href="http://asm.ow2.org/" rel="nofollow">ASM dynamic bytecode injection library</a>.</p>
<p>According to their <a href="http://asm.ow2.org/asmdex-license.html" rel="nofollow">license</a>:</p>
<blockquote>
<p>Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.</p>
</blockquote>
<p>What does this mean, <em>exactly</em>? Does it mean that in all my <strong>Developer Guide</strong> (which will be a PDF that will be distributed in the same ZIP file as my JAR)? Or does it mean something else?</p>
<p>I guess I'm asking for an example of a <em>correct</em> way of honoring this stipulation in the license. Thanks in advance!</p>
| 0non-cybersec
| Stackexchange |
Word Processors: How to keep previous style when moving cursor position?. <p>This is a general question about word processors, and I need an answer of some word processor, especially the tagged editors.</p>
<p>How to keep the previous style when moving the cursor position?</p>
<p>For example, in case that some bold text is written, and after it not bold text had written.</p>
<p>Like this: <strong>hello</strong> world.</p>
<p>After the not bold word "world" was written, the current style is not bold. After setting the cursor location in the middle of the bold word "hello", now the style changes to bold, and if a character is typed, it will be typed bold.</p>
<p>My question is, how to prevent the style from changing, so that after setting the cursor in the middle of the bold word, when a character is typed, it will not be bold.</p>
| 0non-cybersec
| Stackexchange |
A Couple is Walking in East Berlin on Christmas Eve.... A couple is walking in East Berlin on Christmas Eve. They feel a slight precipitation.
"I think it's raining," says the man.
"No, it's snowing," replies the woman.
"How about we ask this Communist officer here? He is always right!" exclaims the main. "Officer Rudolph, is it raining or snowing?
"Definitely raining," Officer Rudolph replies before walking off.
The man turns to his wife with a smile. "See? Rudolph the Red knows rain, dear."
EDIT: Wow thank you everyone! My first post that got more THEN 1 UPVOTE! :D | 0non-cybersec
| Reddit |
I was also considering a joke about the holy land.. | 0non-cybersec
| Reddit |
[Picture] This infuriates me to no end.. | 0non-cybersec
| Reddit |
In the world of ZFC + Grothendieck universes, is there a standard model for ZFC?. <p>Consider the set of ZFC axioms extended with the following <a href="https://ncatlab.org/nlab/show/Grothendieck+universe#axiom_of_universes" rel="nofollow noreferrer">axiom of universes</a>:</p>
<blockquote>
<p>For every set <span class="math-container">$s$</span>, there exists a <a href="https://ncatlab.org/nlab/show/Grothendieck+universe#definition" rel="nofollow noreferrer">Grothendieck universe</a> <span class="math-container">$U$</span> that contains <span class="math-container">$s$</span>, i.e. <span class="math-container">$s \in U$</span>.</p>
</blockquote>
<ol>
<li><p>Is it possible to prove that, for every set <span class="math-container">$s$</span> there is a minimal universe <span class="math-container">$U_m$</span> containing <span class="math-container">$s$</span>, such that <span class="math-container">$U_m$</span> is contained in every other universe <span class="math-container">$U$</span> that contains <span class="math-container">$s$</span>?</p></li>
<li><p>If the answer to the previous question is, in general, "no", can it at least be shown for the particular case that <span class="math-container">$s$</span> is the set of natural numbers?</p></li>
<li><p>If the answer to the previous question is "no", is there a set in the world of ZFC + the axiom of universes that can be considered standard by any other reason, in other words, can we identify, on intrinsic grounds rather than arbitrarily, a particular set <span class="math-container">$V$</span> which merits being called "THE class of ZFC sets"?</p></li>
</ol>
<p>* If feasible, please try not to involve category theory in your answer.</p>
| 0non-cybersec
| Stackexchange |
First of this years presents complete: Stick Chairs, Austin Style. | 0non-cybersec
| Reddit |
ITAP of a hummingbird at my feeder. | 0non-cybersec
| Reddit |
Elegant access to edge attributes in networkx. <p>Is it indeed the case that to access edge attributes in networkx the awkward third form below is necessary and no variation of the more svelte first two forms will do?</p>
<pre><code>import networkx as nx
G = nx.Graph()
G.add_edge(1, 2, weight=4.7 )
G.add_edge(3, 4, weight=5.8 )
# for edge in G.edges():
# print edge['weight']
#
# for edge in G.edges():
# print G[edge]['weight']
for edge in G.edges():
print G.edge[edge[0]][edge[1]]['weight']
</code></pre>
| 0non-cybersec
| Stackexchange |
I'm so sorry everybody.. | 0non-cybersec
| Reddit |
Facts about internal and external path lengths of binary tree. <p>While learning binary tree's properties, I came across <a href="http://mathworld.wolfram.com/InternalPathLength.html" rel="nofollow">internal path length</a> and <a href="http://mathworld.wolfram.com/ExternalPathLength.html" rel="nofollow">external path length</a>, number of comparisons required for successful and unsuccessful search. </p>
<p>My book specifies some facts about these as follows:</p>
<ol>
<li><p>$S_n=1+\frac{U_0+U_1+...+U_{n-1}}{n}$</p></li>
<li><p>For large $n$, $S_n=2 \log_en$</p></li>
<li><p>Internal path length $I_n$ of binary tree with $n$ internal nodes is at least $n \times \lg(n/4)$ and at most $\frac{n(n-1)}{2}$</p></li>
</ol>
<p>Where</p>
<ul>
<li>$n \rightarrow$ number of (internal) nodes in binary search tree</li>
<li>$S_n \rightarrow$ average number of comparisons required for successful search in a random binary search tree with $n$ internal nodes</li>
<li>$U_n \rightarrow$ average number of comparisons required for unsuccessful search in a random binary search tree with $n$ internal nodes</li>
<li>$I_n \rightarrow$ Internal path length of binary tree with $n$ internal nodes</li>
<li>$E_n \rightarrow$ External path length of binary tree with $n$ internal nodes (not used above)</li>
</ul>
<p>Out of these I can complete reason out only the maximum internal path length statded in point 3 as follows: It occurs in <a href="https://secweb.cs.odu.edu/~zeil/cs361/web/website/Lectures/bst/page/bst.html" rel="nofollow">degenerate binary tree (point 3.6 on this page)</a>. In this case, internal path length is $0+1+2+...+(n-1)=\frac{n(n-1)}{2}$.</p>
<p>About the minimum internal path length, the book says following:</p>
<blockquote>
<p>The minimum internal path length occurs in case of the best case binary tree i.e. almost complete binary tree (maximum possible number of nodes having both children). Such tree has $(n+1)$ external nodes at height no more than $\lg {n}$. Multiplying these and applying the below property:
$$E_n=I_n+2n$$
we get the bound:
$$(n+1)\lg n-2n<n \lg (N/4)$$</p>
</blockquote>
<p><strong>Q1.</strong> However I am still not clear how the above bound is obtained</p>
<p><strong>Q2.</strong> Also I did not understood how first two facts out of above 3 are derived and especially what the first fact is meant to imply.</p>
| 0non-cybersec
| Stackexchange |
A Glimpse into Glimpse: Analysis of APT34 DNS Tunneling Malware (x-post from /r/ReverseEngineering). | 1cybersec
| Reddit |
China Uses Android Malware To Spy On Ethnic Minorities Worldwide, New Research Says. | 1cybersec
| Reddit |
Something the developers of Battlefield 3 need to know.. The trailers look amazing but the reload animation is wholly inaccurate. Every time a reload happens the animation pulls the charging handle back. There's only two reasons to operate your charging handle.
1) You're chambering your first round.
2) Malfunction.
If your magazine is depleted the bolt will lock back and after a fresh magazine is seated you can depress the bolt release with either your left thumb or the heel of your left hand. If it's a tactical reload then there's already a chambered round and the hammer is cocked. The weapon is ready to fire and you have 30+1 rounds of ammo.
I felt compelled to share this since the game looks realistic and it would be a shame to have such an obvious flaw. This is the best way I knew how to get the word out. | 0non-cybersec
| Reddit |
shell sript to read source file and use the key in the script. <pre class="lang-bsh prettyprint-override"><code>#!/bin/bash
source /data/output/QAScripts/conf.ini
var=$($1path)
echo $var
</code></pre>
<hr>
<p><code>conf.ini</code> is the config file which has <code>LSTpath=/data/bb/loader</code></p>
<p>I get below below error. Where am I going wrong.</p>
<pre><code>./file LST
line 8: LSTpath: command not found
</code></pre>
| 0non-cybersec
| Stackexchange |
Triangle and rational numbers. <p>A triangle has rational side lengths and rational angles measured as degrees. Is such a triangle necessary equilateral?</p>
| 0non-cybersec
| Stackexchange |
Prove that $V$ is a subspace of $\Bbb R^n$. <p>Let $V = \left\{x \in\Bbb R^n | Ax= \lambda x\right\}$ where $A$ is an $n \times n$ matrix and $\lambda\in\Bbb R$, together with the usual operations for vector addition and scalar multiplication from $\Bbb R^n$. Prove that $V$ is a subspace of $\Bbb R^n$.</p>
<p>I'm sure this isn't that difficult, I just have a hard time understanding subspaces and the notation is slightly confusing as well.</p>
| 0non-cybersec
| Stackexchange |
What size ASOS Chelsea Boots should I get? I'm a size 7.5 in Vans and Size 8 in Nike Pegasus. | 0non-cybersec
| Reddit |
Is it really worth risking my safety to pin "Disturbing the Peace" on a known drug dealer?. My neighbor's boyfriend domestically abused her. I heard everything. The first time, I didn't call fast enough and it ended before the police could get there. The second time was the last time. My girlfriend and I heard him slam her against the wall. We heard her scream, "OH GOD NO." I heard him choke her and the gargling noises she made, so I called 911. Police were here in record time and caught him trying to sneak out the back, but she denied everything. They both ended up being arrested for "Disturbing the Peace".
After all this, I found out from the officer that the colored light over her door and the security camera he installed were not unusual for a known weed and meth dealer (whose car was "shot up" last year).
Last Friday I received a subpoena in the mail. This Tuesday I'm supposed to appear in court as a witness against him. His charge? "Disturbing the Peace". He knows my face and where I live. Am I supposed to be okay with risking my safety so that they can put the most vague charge on him?
Before you ask, yes. They broke up and she has some sort of restraining order on him. Unfortunately, that only happened after he broke the door to her apartment (the same door I have). For the first time in my life, I'm scared for my life. | 0non-cybersec
| Reddit |
Tim Burton's "Hansel and Gretel" aired on the Disney Channel only once 10/31/83-- execs immediately pulled it for its frightening subject matter.. | 0non-cybersec
| Reddit |
I knew they were both filmed in LA - but I just found out that Parks and Rec shot a scene outside "Paddy's Pub". | 0non-cybersec
| Reddit |
[Build Help] $800 Gaming PC. Hi, I've recently decided to build a new PC for gaming. I'm hoping this build is good enough to run games such as titanfall, GW2, BF4, and other games. I'm still pretty new to all of this, and would love some feedback/recommendations. Parts that are shown as purchased are from my old PC. Thank you in advance for the help!
[PCPartPicker part list](http://pcpartpicker.com/p/3k3ZW) / [Price breakdown by merchant](http://pcpartpicker.com/p/3k3ZW/by_merchant/) / [Benchmarks](http://pcpartpicker.com/p/3k3ZW/benchmarks/)
Type|Item|Price
:----|:----|:----
**CPU** | [Intel Core i5-4570 3.2GHz Quad-Core Processor](http://pcpartpicker.com/part/intel-cpu-bx80646i54570) | $189.98 @ SuperBiiz
**Motherboard** | [Asus H87-PLUS ATX LGA1150 Motherboard](http://pcpartpicker.com/part/asus-motherboard-h87plus) | $100.00 @ NCIX US
**Memory** | [Team Elite 8GB (1 x 8GB) DDR3-1600 Memory](http://pcpartpicker.com/part/team-memory-ted38g1600hc1101) | $59.99 @ Newegg
**Storage** | [Intel 530 Series 240GB 2.5" Solid State Disk](http://pcpartpicker.com/part/intel-internal-hard-drive-ssdsc2bw240a4k5) | Purchased For $0.00
**Storage** | [Hitachi Deskstar 1TB 3.5" 7200RPM Internal Hard Drive](http://pcpartpicker.com/part/hitachi-internal-hard-drive-hds721010cla332) | Purchased For $0.00
**Video Card** | [Asus GeForce GTX 770 2GB Video Card](http://pcpartpicker.com/part/asus-video-card-gtx770dc2oc2gd5) | $309.99 @ NCIX US
**Case** | [Fractal Design Define R4 w/Window (Black Pearl) ATX Mid Tower Case](http://pcpartpicker.com/part/fractal-design-case-fdcadefr4blw) | $99.99 @ NCIX US
**Power Supply** | [Corsair Enthusiast 750W 80+ Certified ATX Power Supply](http://pcpartpicker.com/part/corsair-power-supply-cmpsu750tx) | Purchased For $0.00
| | **Total**
| Prices include shipping, taxes, and discounts when available. | $759.95
| Generated by PCPartPicker 2014-04-01 02:23 EDT-0400 |
| 0non-cybersec
| Reddit |
Another day in Russia: traffic officer have been carried on the hood for 1.3 miles. | 0non-cybersec
| Reddit |
Experience with Scalearc sharding?. <p>Does anyone have experience with Scalearc sharding and it's ability to scale ? Does Scalearc needs to have the whole data in memory or does it behave well with disk storage ? I'm thinking to big database application like 10TB and above.</p>
| 0non-cybersec
| Stackexchange |
Alternative to generic chaining bounds for a particular family of stochastic processes. <p><em>Generic chaining</em> provides a general but rather abstract framework to bound suprema of stochastic processes. In many applications, however, we know more about the expression of the stochastic process. In particular, I would like to study $$\mathbb{E}_\omega \sup_{X\in\mathcal{X}}F_\omega(X),$$ where $\mathcal{X}$ is a compact set (say in $\mathbb{R}^d)$ and $F_\omega(\cdot):\mathcal{X}\to\mathbb{R}$ is a differentiable function that depends on the random variable $\omega$. Of course, we need some regularity condition on the probability measure associated with $\omega$. We can also further restrict the family of considered functions $F_\omega(\cdot)$.</p>
<p>My question is if there are alternatives to generic chaining that apply to the scenarios I described above.</p>
<p>For example, my idea was to construct a sequence of points $X_1,X_2,\dotsc,X_N$ in $\mathcal{X}$ with $N=N(\epsilon)$ as small as possible such that the balls $\mathcal{B}_n=B_{\lVert\cdot\rVert}(X_n,\frac{\epsilon}{\mathbb{E}_\omega \lVert\nabla F_\omega(X_n)\rVert})$ cover $\mathcal{X}$ and for $X\in\mathcal{B}_n$ we can bound $F_\omega(X)$ using its linearization around $X_n$. If such constructions are studied in the literature I would appreciate it if you provide citations.</p>
| 0non-cybersec
| Stackexchange |
GoPro Might Be Throwing in the Towel on more than just the drone business. | 0non-cybersec
| Reddit |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
Bringing your D&D stuff to random places. I play in a weekly D&D game that meets every Thursday around 6. As luck would have it, I have a deposition today at work. I am also meeting the woman I'm dating for a quick early dinner before the game.
So as a consequence of my congested schedule, today I had to bring my dice and D&D paraphernalia to a deposition; and later I will be bringing everything along with me on a date.
This seemed pretty notable to me when I was thinking about it last night, but I'm sure you guys can beat me. Where is the weirdest place you have brought your gaming stuff? Did anyone notice or say anything? Any funny stories? I'd love to read other people's experiences. | 0non-cybersec
| Reddit |
Restoration - 1940s Blow Torch, Turner Brass Works Model 30AT. | 0non-cybersec
| Reddit |
Simple question about polynomials. <p>Starting from a problem in combinatorics, I ended up with a very simple problem about polynomials, which, unfortunately, I am not able to solve. </p>
<p>Say we work over $\mathbb C$. Fix $d>1$.
Is it possible to find 3 homogenous polynomials $F_0,F_1$ and $F_2$ of degree $d$ in $\mathbb C[x,y,z]$ without any non-trivial zeroes in common and such that
$$F_1\cdot F_2=F_0^2- x^{d+1}\cdot G$$
for some homogeneous polynomial $G$ of degree $d-1$?</p>
<p>My guess is that the answer is no, but I couldn't rephrase it to a more classical algebraic geometry problem.
It is easy to show that the answer is negative if we take $G=0$ or $G=x^{d-1}$ or if $d=2$. </p>
| 0non-cybersec
| Stackexchange |
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application.
I need to scale my app adding some spot instances that EB do not support.</p>
<p>So I create a second autoscaling from a launch configuration with spot instances.
The autoscaling use the same load balancer created by beanstalk.</p>
<p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p>
<p>This work fine, but:</p>
<ol>
<li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p>
</li>
<li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p>
</li>
</ol>
<p><strong>UPDATE</strong></p>
<p>Elastic Beanstalk add support to spot instance since 2019... see:
<a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
| 0non-cybersec
| Stackexchange |
Distrustful U.S. allies force spy agency to back down in encryption fight. | 1cybersec
| Reddit |
Is there a java library which could extract the first seen date and the last seen date of an address over a bitcoin network?. <p>Apparently the bitcoinj does not provide such feature.</p>
| 0non-cybersec
| Stackexchange |
How to prove $\sum_{i=0}^n\sum_{j=0}^n{n\choose i}{n\choose j}{i+j\choose n}=2^n{2n\choose n}$?. <p>Numerical calculation suggests the following two combinatorial identities:
$$
\sum_{i=0}^n\sum_{j=0}^n{n\choose i}{n\choose j}{i+j\choose n}=2^n{2n\choose n},\\
\sum_{i=0}^n\sum_{j=0}^n{n\choose i}{n\choose j}{n\choose i+j}={3n\choose n}.
$$
Proofs or references are all welcome.</p>
| 0non-cybersec
| Stackexchange |
Oh the mchorror. | 0non-cybersec
| Reddit |
I built a cypress patio set. | 0non-cybersec
| Reddit |
How are each of the iOS background fetch UIBackgroundFetchResult types handled after the completion handler is called?. <p>After your application completes its actions during a background fetch you must call the completionHandler block with one of the three <code>UIBackgroundFetchResult</code> states: <code>UIBackgroundFetchResultNoData</code>, <code>UIBackgroundFetchResultNewData</code>, or <code>UIBackgroundFetchResultFailed</code>. </p>
<p>How are each of these three results handled by the OS once the completion handler is called?</p>
| 0non-cybersec
| Stackexchange |
How attractive do you think you are (on a scale from 1-10)?. | 0non-cybersec
| Reddit |
Response Headers Empty. <p>I'm making a chatting app. I have the following problem: when I send a request to the server's response doesn't contain any headers. I want to check the token some header but that header is empty.</p>
<p>When I used to postman, I saw the token in header. However when I use fetch api in javascript, I see header but header inside is empty. Also I see header in google developer tools.</p>
<p>I think, It's dont about CORS.</p>
<pre><code>static async userLogin(username,password){
const url = `http://localhost:9090/api/authenticate?username=${username}&password=${password}`;
await fetch(url,{
method: "GET",
}).then(response => console.log(response));
}
</code></pre>
<p><a href="https://i.stack.imgur.com/8Hwsc.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/8Hwsc.png" alt="developer tools "></a> </p>
<p><a href="https://i.stack.imgur.com/T5jbt.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/T5jbt.png" alt="postman"></a></p>
| 0non-cybersec
| Stackexchange |
Reddit, you confuse me.. | 0non-cybersec
| Reddit |
Determine if the sequence converges. <p>For a sequence $\{x_n\}$ given by $x_1=3$, $x_n= \frac{x_{n-1}+2}{x_{n-1}}$ how would I determine if this sequence converges since it is not monotonic?</p>
| 0non-cybersec
| Stackexchange |
Ubuntu ZFS or other file system layout question. <p>I have a system currently setup as a plex server running Ubuntu 16.04 LTS. I am in the process of upgrading the server and was wondering about the best way to layout file systems. I was looking at moving to ZFS pools but I wasn't sure that was ideal. </p>
<p>The current machine has media spread across a number of discs. 4x8TB Seagate 5400rpm archive drives and 4x4TB drives (a few different types).</p>
<p>Currently they are all mounted as separate file systems and half are used for backing up to the other half via an rsync script I cobbled together. </p>
<p>One draw back of the current setup is that I need to do a series of mount points for the media, a movies drives, music drive, and Running TV Series and Finished TV series. In particular I would like to consolidate all the TV together but there is more than 8TB of that currently. </p>
<p>The current setup is functional but some sort of more consolidated setup that arranged all of it as one giant "media" drive seems an attractive alternative. </p>
<p>The current mirroring arrangement is desirable to keep in some form and ability to survive a drive failure matters far more than performance. </p>
<p>I would also really like the ability to add new drives to the set up without needing to copy everything off and copy everything back onto a setup. </p>
<p>The new system will be built around an i5 processor and 16GB of RAM. </p>
<p>ZFS looked like it might do the job well. The idea being to build two pools in a mirror setup (RAID-Z if I follow the terminology correctly). The difficulty of any setup here is that I have the mirrors currently but can't repurpose all the drives at once as the data needs to be moved to the new pool in stages. One of the other RAID settings would would if I can extend the pool 1 disc at a time as I copy the data from outside the pool into it and then add the copied disc as a new drive into the pool. </p>
<p>Is there something related to ZFS that makes it wildly unsuitable for the task?</p>
<p>Do people have any suggestions how they would approach such a set up? </p>
<p>Am I better off sticking with the current setup? </p>
| 0non-cybersec
| Stackexchange |
I think those belongs here. | 0non-cybersec
| Reddit |
Adding a subview and position it with constraints programmatically. <p>I have added a <code>UIView</code> using the IB on to the view controller. Let's call it the <code>redView</code>. </p>
<p><img src="https://i.stack.imgur.com/yJQkgm.png" alt="enter image description here"></p>
<p>Then I have pinned its all four sides using auto layout constraints in code and when I run it, it looks like this as expected.</p>
<p><img src="https://i.stack.imgur.com/C1A6rm.png" alt="enter image description here"></p>
<p>Now I want to add a <code>UILabel</code> to this view programmatically and position it in the center using auto layout constraints.</p>
<p>Below is the code I have so far.</p>
<pre><code>import UIKit
class ViewController: UIViewController {
@IBOutlet private var redView: UIView!
override func viewDidLoad() {
super.viewDidLoad()
redView.setTranslatesAutoresizingMaskIntoConstraints(false)
let leadingConstraint = NSLayoutConstraint(item: redView, attribute: .Leading, relatedBy: .Equal, toItem: view, attribute: .Leading, multiplier: 1, constant: 0)
let trailingConstraint = NSLayoutConstraint(item: redView, attribute: .Trailing, relatedBy: .Equal, toItem: view, attribute: .Trailing, multiplier: 1, constant: 0)
let topConstraint = NSLayoutConstraint(item: redView, attribute: .Top, relatedBy: .Equal, toItem: view, attribute: .Top, multiplier: 1, constant: 0)
let bottomConstraint = NSLayoutConstraint(item: redView, attribute: .Bottom, relatedBy: .Equal, toItem: view, attribute: .Bottom, multiplier: 1, constant: 0)
view.addConstraints([leadingConstraint, trailingConstraint, topConstraint, bottomConstraint])
let label = UILabel()
label.text = "Auto Layout Exercise"
redView.addSubview(label)
let xCenterConstraint = NSLayoutConstraint(item: label, attribute: .CenterX, relatedBy: .Equal, toItem: redView, attribute: .CenterX, multiplier: 1, constant: 0)
let yCenterConstraint = NSLayoutConstraint(item: label, attribute: .CenterY, relatedBy: .Equal, toItem: redView, attribute: .CenterY, multiplier: 1, constant: 0)
let leadingConstraint1 = NSLayoutConstraint(item: label, attribute: .Leading, relatedBy: .Equal, toItem: redView, attribute: .Leading, multiplier: 1, constant: 20)
let trailingConstraint1 = NSLayoutConstraint(item: label, attribute: .Trailing, relatedBy: .Equal, toItem: redView, attribute: .Trailing, multiplier: 1, constant: -20)
redView.addConstraints([xCenterConstraint, yCenterConstraint, leadingConstraint1, trailingConstraint1])
}
}
</code></pre>
<p>The problem is the label doesn't appear on the <code>redView</code>. Can anyone please tell me what I'm missing here?</p>
<p>Thank you.</p>
| 0non-cybersec
| Stackexchange |
Pentest Log Management. I have been slowly entering the field of security, intrusion analysis, pentesting, etc and was wondering how I could go about keeping logs particularly from pentesting events. As of right now the majority of my logs have been hand written time dated events such as when I SSH into a system, if that SSH attempted failed, etc. This method works atm since this is only for small event such as class room lab exercises and mock events. It recently dawned on me to include a time date stamp in my bash history however this only tells me when I executed a command not the end result. Any suggestions would be nice.
Thx | 1cybersec
| Reddit |
Given a bilinear map, how do I produce a cross-product on cohomology?. <p>If <span class="math-container">$M$</span>, <span class="math-container">$N$</span>, and <span class="math-container">$P$</span> are <span class="math-container">$R$</span>-modules, and there exists a bilinear map between <span class="math-container">$M\times N$</span> and <span class="math-container">$P$</span>, how do I construct a cross product <span class="math-container">$$\times: H^p(X;M)\times H^q(Y;N)\to H^{p+q}(X\times Y;P)?$$</span></p>
<p>I say let <span class="math-container">$S^*(X;M)$</span> be the singular cochain complex of <span class="math-container">$X$</span> with coefficients in the <span class="math-container">$R$</span>-module <span class="math-container">$M$</span>, <span class="math-container">$S^*(Y;N)$</span> be the singular cochain complex of <span class="math-container">$Y$</span> with coefficients in the <span class="math-container">$R$</span>-module <span class="math-container">$N$</span>, and <span class="math-container">$S^*(X\times Y;P)$</span> be the singular cochain complex of <span class="math-container">$X\times Y$</span> with coefficients in the <span class="math-container">$R$</span>-module <span class="math-container">$P$</span>. I thought about defining a map <span class="math-container">$\times:S^p(X;M)\times S^q(Y;N)\to S^{p+q}(X\times Y;P)$</span> that commutes with the differential maps but I cannot think of how it should be defined?</p>
| 0non-cybersec
| Stackexchange |
Travelling circuses to be banned from using wild animals in England. | 0non-cybersec
| Reddit |
UTF-8 pages appear as garbage. <p>On many occasions, when my browser (either Explorer or Chrome) on my Windows 7 Pro machine hit a UTF-8 page, what I get is garbage that looks like this one: <a href="http://24.media.tumblr.com/7865bc12fc4430c4e3678473761717cf/tumblr_mnrhvhGM5O1qfjuqlo1_500.jpg" rel="nofollow noreferrer">http://24.media.tumblr.com/7865bc12fc4430c4e3678473761717cf/tumblr_mnrhvhGM5O1qfjuqlo1_500.jpg</a></p>
<p>(One may see the REAL thing here: <a href="http://www.hexagon.com/en/index.htm" rel="nofollow noreferrer">http://www.hexagon.com/en/index.htm</a>).</p>
<p>OK...What's wrong here?!</p>
<p>And mind you—this annoying issue affects also MS Outlook messages, so it seems I'm having a system-deep issue rather than browser or specific site fault...</p>
<p>Any help will be very much appreciated!</p>
| 0non-cybersec
| Stackexchange |
Distribution of population in Brazil [OC]. | 0non-cybersec
| Reddit |
The Savage Nation- Michael Savage- September 1st, 2016 (Full Show). | 0non-cybersec
| Reddit |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.