Can I put a preprint of a paper on arXiv without informing my co-authors?

I am the main author and have three co-authors on a paper that I have been working on for quite some time now. Two of them have given me constructive suggestions and do think that the paper is a publishable material.   However, the other one, who also happens to be my supervisor, has been nothing but pessimistic and rather critical in a negative way. Moreover, his suggestions are totally irrelevant to the paper. I am beginning to think that he is trying to deliberately block my paper. Believe me when I say that I am trying to give him the benefit of the doubt; I am trying as much as possible to fulfill his irrelevant and unreasonable demands.  On top of that, my contract with the university is about to end soon. I have found another position in the same field. If this paper was even submitted, which it should have been months ago, it would strengthen my CV a lot.   Can I put it on arXiv without informing my supervisor? If not, what is the best way to deal with the situation?


I'm trying to prove that $f(x) = x^n$ is continuous for all $n$. One option is the Binomial theorem, but it seems slightly messy, so I've opted for induction. Here is my attempt. Let $a \in \mathbb{R}$ be given and induct on $n$. If $n=1$, given $\epsilon = 0$, set $\delta = \epsilon$. Then $|x-a| < \delta$ implies $|f(x) - f(a)| = |x - a| < \delta = \epsilon$, so $f(x)$ is continuous at $a$ and thus on $\mathbb{R}$. If $n = 2$, we need to show that $f(x) = x^2$ is continuous at $a$. This is where I am having trouble, because the scratchwork falls apart. If $|x-a| < \delta$, then $$|f(x) - f(a)| = |x^2 - a^2| = |(x+a)(x-a)| = |x+a||x-a| < \delta |x+a|.$$ $\delta$ can depend on $a$, but not on $x$, so I don't know what kind of additional restrictions I can place on $\delta$. The induction is straightforward from here, but only if I don't use the definition, but rather the fact that $x^k$ is continuous by assumption, as is $x$, and the product of two continuous functions is continuous. I'd prefer to do this from the definition, however, as this seems to trivialize the result. I could have proved that $x^2$ is continuous just by using the $n=1$ case. Help would be appreciated.


I have git repos stored in different directories which have long paths /opt/too/long/path/to/type/every/time/git-repo and it's kind of difficult to remember plus to cd to the directory every time is a pain and tedious. (I know TAB helps but that gets tedious too.) So, my life would be much easier if I could store the pwd somewhere and later do something like cd thatgitrepo.


As a noob by mistake i ran "sudo chown $pranav.pranav -R /" to solve my Read Only Filesystem. If this is a bad thing, how should i undo this?

How should i do to undo this? I tried running fsck to solve my "Read only filesystem" before but it didn't help me much. It only solve the situation for a while and then it comes back again. So, i did this after reading a post.  Meanwhile, i am getting thousands of lines like this:  chown: changing group of '/usr/share/doc/distro-info-data': Read-only file system chown: changing group of '/usr/share/doc/software-properties-common/copyright': Read-only file system chown: changing group of '/usr/share/doc/software-properties-common/changelog.gz': Read-only file system chown: changing group of '/usr/share/doc/software-properties-common': Read-only file system chown: changing group of '/usr/share/doc/nmap/3rd-party-licenses.txt.gz': Read-only file system chown: changing group of '/usr/share/doc/nmap/leet-nmap-ascii-art.txt': Read-only file system chown: changing group of '/usr/share/doc/nmap/nmap.usage.txt.gz': Read-only file system chown: changing group of '/usr/share/doc/nmap/device-types.txt.gz': Read-only file system chown: changing group of '/usr/share/doc/nmap/committers.txt.gz': Read-only file system chown: changing group of '/usr/share/doc/nmap/nmap_gpgkeys.txt.gz': Read-only file system chown: changing group of '/usr/share/doc/nmap/style/lua-format.lua.gz': Read-only file system chown: changing group of '/usr/share/doc/nmap/style/README': Read-only file system


Array.from() strange behavior with parseInt()

So I am trying to convert an array of strings to an array of numbers using the following code.    let a = ["0", "0"]; let b = Array.from(a, parseInt); console.log(b);     and what I get is  b = [0, NaN];   I am familiar with a similar issue using Array.map() since it provides three arguments to parseInt() and the second argument (index) is interpreted as a radix by parseInt(). But it shouldn't be the case for Array.from().  Can someone give me an explanation please?


I'm running Ubuntu 12.04.4LTS and my left earphone is not working. It is a brand new pair with nothing wrong with it so I know it's not an issue with the earphones. I have been googling for a good half hour if not more and trying various things but I have had no luck so far.  I ran alsamixer and I verified that "master volume" is NOT muted.  I was trying to install the Realtek driver as detailed in  but I got the same error as detailed in that post linked to.   So what's going on here, there's no configure file in the stuff I downloaded from realtek? Why? :/  EDIT: Just stating for clarity, doing the sound test in System > Sound for the earphones does not give any sound out put when testing the left one, unsurprisingly.  EDIT #2: One of the courses of action I took in trying to resolve this was the original solution in , but it didn't fix it. As I mentioned above, running the install file fails with this error.  ./install: 19: ./install: ./configure: not found make: *** No targets specified and no makefile found. Stop. make: *** No rule to make target `install'. Stop. ./install: 23: ./install: ./snddevices: not found   So, taking a step back, let's forget about the possibility of something being broken in the PC for now. Now, does anyone know how I can resolve this error? Perhaps is there somewhere I can find the apparently missing makefile? My earlier google searches didn't give me anything.


Basically I have a string such as  String latex = "\\documentclass{article} \\usepackage[utf8]{inputenc}  \\title{First document} \\author{me}  \\begin{document}  \\maketitle  \\begin{abstract} XXX \\end{abstract}  YYY   \\end{document}"   How can I get java to render this for me?


Thousands of .log files in Exchange 2007 Server folder

I'm a bit of an Exchange admin noob so I don't know if this is normal, but on our Exchange 2007 server under C:\Program Files\Microsoft\Exchange Server\Mailbox\First Storage Group\ there are 30,000 1MB .log files.  I don't know if those should be there or not, but they keep multiplying like little jackrabbits.  I've so far resisted deleting them as I'm sure something would break, but it's come to the point now where our 80GB disk is completely full up and Exchange has stopped receiving messages.  My best guess is that these are transaction logs and would be useful in rebuilding the database should something go awry, but 30GB of transaction logging seems a bit excessive.  Is there a way to limit it or is that even a good idea?  And of course did I completely miss the point?


Why Walt Disney renamed "Zootopia" as "Zootropolis" in Uk?


This might be a stupid question, but why exactly is work a path function?  In school, my teacher said it’s because it depends on the path. She gave an example of walking up a mountain, and said the work you expend depends on the path you take (straight path up or circling up around the mountain). But isn’t the work expended just equal to $E= mgh?$


how to generate a PDF with real UTF characters

I'm using these settings:  \epstopdfsetup{outdir=./} \usepackage[italian]{babel} \usepackage[T1]{fontenc} \selectlanguage{italian} \usepackage[utf8]{inputenc} \usepackage{hyperref}   in order to write my documents in UTF-8 and get a PDF with all my italian accents in their right place. Everything works smoothly and the output is OK, except for the fact that what I get are not real accented characters, but those "accent workarounds" that latex usually does in place of using a UTF-8-font. The problem is not the document itself, but when I copy its content in another program. For instance, when I copy an "à" from my documents and I paste it into an editor, the result is an "a`". What I think is that it's not compiling with a font that supports UTF-8, am I right? I've also tried with luatex, but what I get is the same matter. So: how can I obtain real utf-8 characters in my PDFs?  Example  \documentclass[a4paper, 11pt, twocolumn, twoside]{report}  \usepackage[italian]{babel} \usepackage[T1]{fontenc} \selectlanguage{italian} \usepackage[utf8]{inputenc} \usepackage{hyperref} \usepackage{lmodern}  \begin{document}  Ciao this is a test: à  \end{document}


How to make field on account only editable by admin?

How can I make it so that a certain field on the user profile/account is only editable by an admin?  I added the "file" field to accounts, but I want admin's to be the only ones to be able to populate the field.  I dont think there are permissions for this.


1) "Today the number of referrals passed are 24"  2) "Today the number of  referrals passed is 24"  Please help. Using 'IS' or 'ARE' which is correct?


Detect if a file is ISO-8859-1/Unicode (or not ASCII)

I have an input file in my asp.net application. The user submit a CSV file to update the database.  This CSV file is created by exporting a .xlsx. This .xlsx file contains non-ascii chars, such as França, Rússia, etc. The user sometimes, incorrectly saves it via "CSV (MS-DOS)" (which writes ASCII format) instead of "CSV (comma separated file)" (which preserves .xlsx encoding).  So, to validate file encoding before write its content in the database....  How can I safely detect file encoding of a file submitted in .net?  ps.: BOM verification is not enough. A file can be UTF w/ BOM.


How to change the tab name in SharePoint

Problem:  I'm having trouble figuring out how to change the name of the web browser tab in SharePoint.  I'm trying to have the tab display    "CompanyName - Page Title"   Right now the site is displaying    "Pages - Page Title"   This is annoying because if you try to bookmark the page its default name is "Pages - Home" and is very confusing for my users.  I have tried to change this in the master page; however, every time I try to change it the site stops functioning because of problems with the master page.   How can I implement this change to the masterpage?   Your help is greatly appreciated.


Enabling admin connection on SQL Server Express to fix logon trigger

Well, luckily I got this error on my test environment. I'm so scared about this error that I disabled all logon triggers I was using on production environment.   I created the famous logon trigger, and I put a database in offline mode just to mess with something else. Then I discover that because the trigger can't find the table, I can't access the instance anymore. There are plenty of questions related to this, but even doing everything I could find, I still can't acces the instance, not even with SQLCMD.  I'm doing this:  sqlcmd -S server\instance -U sa -P <pass>  -A   If I don't use -A I receive the famous error:  logon failed for sa due trigger execution.   If I use -A:     Sqlcmd: Error: Microsoft ODBC Driver 11 for SQL Server : SQL Server   Network Interfaces: An error occurred while obtaining the dedicated   administrator connection (DAC) port. Make sure that SQL Browser is   running, or check the error log for the port number [xFFFFFFFF]. .   Sqlcmd: Error: Microsoft ODBC Driver 11 for SQL Server : Login timeout   expired. Sqlcmd: Error: Microsoft ODBC Driver 11 for SQL Server : A   network-related or instance-specific error has occurred while   establishing a connection to SQL Server. Server is not found or not   accessible. Check if instance name is correct and if SQL Server is   configured to allow remote connections. For more information see SQL   Server Books Online..   Why i'm not able to connect to the sql server    sql server express here.  I could enable SQL Browser, but I still can't access it.  I don't think this question is duplicated because is not about the trigger, is about Why I can't access the server with SQLCMD. I pretty much know how to fix this. I just don't know how can I acces sql server without triggering the trigger.


Why use @Asynchronous in EJB when we can use ExecutorService?

I am new to multithreading in Java and EJB too. I have a scenario where I have to hit a web service concurrently using threads. I have got two approaches for that.   Using ExecutorService with Callable to hit the service concurrently. Using @Asynchronous annotation of EJB.   What I have read is: EJB recommends to use @Asynchronous over writing our own threaded implementation. After reading this I am confused about why EJB says so. Because underneath EJB works on JVM and all threads will be created from JVM. So why EJB restricts us on using it's @Asynchronous rather than our implementation.  I searched on google but did not found any satisfactory answer. If anyone knows the details of thread creation and management in EJB please clear my doubts.


How do you generate a build script for all views

I would like to create a build script that can run through and recreate all views (and stored procedures too, but one step at a time).  I am trying to create a baseline of all of our user databases (around 50 of them) for our developers to run on their local machines, basically recreate all of the databases from the ground up. I have gotten past all the preliminary steps of recreating all dbs, schemas, roles, tables, indexes, constraints,...yada yada. I have relied heavily on the sp_foreachdb function and it works like a charm. Now I am stuck on stored scripts, like views and procs mostly due to the length of some of the scripts.  Reason I need to recreate the entire database setup is because people are dumb and left cross database joins and dependencies in legacy products for us. (yay!) So how can we expect our developers to pull the database down to their local machines for development and testing if first they need stuff from 3-4 other databases. And it doesn't end there, those databases depend on other things to exist. Ugh, circular dependencies.  If I only had one database I would hook up my handy dandy RedGate tool SQLCompare and pull the stuff into a script that they could run. Problem is the number of user databases we have and the desire to automate it.  If anyone can offer some advice that could help me recreate ALL script objects on ALL Databases, I would gladly accept it. The thought of manually scripting out a single database's scripts 50+ times is daunting to say the least. What am I not thinking of?  Thanks Friends!


What is the correct name of the GMail status box?

GMail shows a very useful UI elements which is the yellow status box that appears when an image is deleted, for example.  The features of that elements are that it shows a short text, it can have different styles, and present links for actions. The messages would disappear with time, but can be dismissed by the user with a small close button usually.  So this element is what says: "Item has been deleted" or "Dramatic server error" in the following mock.    Usually those items pile up and they may collapse when a message is repeated, with a counter, like it happens for chrome console messages.  These elements are really powerful for web applications for example, because they can inform the user about general communication with the server side, and they are very versatile.  What is the correct term to describe this UI element? I have heard it being called "butter box".


I  am trying to run the following latex document, my biber has been set up well in Texmaker    but get an error when I compile:    Here is the error I am getting from Texmaker:     ERROR - Cannot find control file 'Chapter 2.bcf'! - Did latex run successfully on your .tex file before you ran biber? INFO - ERRORS: 1   \documentclass[12pt]{report} \usepackage[utf8]{inputenc} \usepackage[backend=biber, citestyle=numeric,  natbib=true, sorting=nyt]{biblatex} \usepackage{csquotes} \usepackage{amsmath} \usepackage[nottoc,numbib]{tocbibind} \usepackage[T1,T2A]{fontenc} %\usepackage[titletoc,toc]{appendix} \usepackage{float} \usepackage{tabulary} %\bibliography{thesis} % or \addbibresource{thesis.bib} \usepackage{array} \newenvironment{conditions}   {\par\vspace{\abovedisplayskip}\noindent\begin{tabular}{>{$}l<{$} @{${}={}$} l}}   {\end{tabular}\par\vspace{\belowdisplayskip}} \makeatletter \def\blx@maxline{77} \makeatother  \newrobustcmd*{\parentexttrack}[1]{%   \begingroup   \blx@blxinit   \blx@setsfcodes   \blx@bibopenparen#1\blx@bibcloseparen   \endgroup}  \AtEveryCite{%   \let\parentext=\parentexttrack%   \let\bibopenparen=\bibopenbracket%   \let\bibcloseparen=\bibclosebracket}  \makeatother \usepackage[usenames,dvipsnames]{color} \usepackage[hyperfootnotes=false]{hyperref} \usepackage{float} \hypersetup{  colorlinks=true,  citecolor=Blue,  linkcolor=Blue,  urlcolor=Red } \hypersetup{  citebordercolor=.1 1 .1,  linkbordercolor=1 0 0,   urlbordercolor=1 0 0, } \renewcommand\nameyeardelim{, } \renewcommand{\baselinestretch}{1.5} \usepackage[margin=1in]{geometry} \usepackage[margin=1in]{geometry}  % set the margins to 1in on all sides \usepackage{graphicx}              % to include figures \usepackage{caption} \usepackage{amsmath}               % great math stuff \usepackage{amsfonts}              % for blackboard bold, etc \usepackage{amsthm}                % better theorem \usepackage[utf8]{inputenc} \usepackage[UKenglish]{babel} \usepackage{comment}  \usepackage[toc,page]{appendix} \usepackage[numbered,framed]{mcode} %\usepackage[titletoc]{appendix} % various theorems, numbered by section \newtheorem{thm}{Theorem}[section] \newtheorem{lem}[thm]{Lemma} \newtheorem{prop}[thm]{Proposition} \newtheorem{cor}[thm]{Corollary} \newtheorem{conj}[thm]{Conjecture} \newtheorem{definition}{Definition}[section] % numbers \newtheorem{exmp}[thm]{Example} % same for example numbers  \DeclareMathOperator{\id}{id}  \newcommand{\bd}[1]{\mathbf{#1}}  % for bolding symbols \newcommand{\RR}{\mathbb{R}}      % for Real numbers \newcommand{\ZZ}{\mathbb{Z}}      % for Integers \newcommand{\col}[1]{\left[\begin{matrix} #1 \end{matrix} \right]} \newcommand{\comb}[2]{\binom{#1^2 + #2^2}{#1+#2}} \renewcommand\appendix{\par   \setcounter{section}{0}   \setcounter{subsection}{0}   \setcounter{figure}{0}   \setcounter{table}{0}   \renewcommand\thesection{Appendix \Alph{section}}   \renewcommand\thefigure{\Alph{section}\arabic{figure}}   \renewcommand\thetable{\Alph{section}\arabic{table}} } \begin{document} \end{document}


discusses the recent invention of a "quantum radar" that works by bouncing one photon off of something, storing a photon that's entangled with it, and watching for interference on the stored photon that indicates the radar photon has bounced off an object.  Most of that makes sense, (about as much as anything in quantum physics makes sense, at least,) but... how exactly do you "store" a photon?  To my mind at least, the concept of storage involves putting something in a location and keeping it there, unmoving, but photons are not capable of not moving at the speed of light.  So what's going on in this scenario?


How to install CUDA on Debian 9 (Stretch) without breakint the system?

There are some answers considering the installation of the cuda drivers on debian 9 (stretch) here, however as far as I can judge, they mix Ubuntu with Debian sources, and this probably crashed my system when I followed their instructions.     There is a tutorial on the official Debian site how to install it without creating a "FrankenDebian" (this is how they call it), but it is for Debian 8 (Jessy).    I do not know enough, to understand how I should adjust this tutorial to the needs of Debian 9 (stretch)


How to make Illustrator default to CMYK. My color box says CMYK, but my swatches still default to RGB please help.


How does delete[] know the array length in C++?

Imagine I have a pointer to an array of integers and then I want to delete it like I do below:  int * numbers = new int[10]; delete[] numbers;   How does the delete operator knows where the array numbers ends to free that memory (since C++ does not keep track of the length of the array as far as I know)?  Thanks!


r survival::survreg parameter estimation by formula

I have some difficulties understanding the use of the formula in survival::survreg. I am trying to estimate weibull parameters for different groups of data. For convenience I want to use the formula to group the data. Please consider the following code:  library(survival)  a <- rweibull(500, scale = 4, shape = 2) a.ind <- rep('a', length(a)) b <- rweibull(700, scale = 6, shape = 3) b.ind <- rep('b', length(b))  A <- data.frame(ttf = c(a,b), group = c(a.ind, b.ind))  fit <- survreg(Surv(ttf)~group, data = A, dist = "weibull")  fit.a <- survreg(Surv(a)~1, dist = "weibull") fit.b <- survreg(Surv(b)~1, dist = "weibull")   My question is, why are the estimated parameters from fit different to the parameters estimated in fit.a and fit.b (e.g. coef(fit)[1] != coef(fit.a))?


My Ubuntu is booting to a black screen. What can I do?

My LUKS-encrypted Ubuntu 17.10 install normally would boot to a display that requests a passcode to decrypt the drive and then would boot to the Ubuntu login display. Instead it is now booting just to a black display. I have tried booting it to GRUB by pressing Right Shift but it then just displays GRUB loading. and freezes. I have tried the Alt+←, Alt+→ trick mentioned , which is listed under the heading "LUKS encryption", to try to get a terminal LUKS dialog for the decryption passcode but this doesn't do anything, and the black display remains, so the solution presented there doesn't work. I can boot to a live USB Ubuntu distribution but I don't know what to do from that.  How can I approach this problem further?    EDIT: After a number of attempts at rebooting (which changing nothing manually) they system eventually booted successfully. I have no idea why increasing the number of boot attempts or letting time pass should be able to fix a problem like this, and I'd like to understand this. However, following this, I encountered the problem again (after Ubuntu froze) and again am seeing the black screen on boot.  While the booting was working this time, I followed the suggestion of  and managed to record a Boot-Info log from when the boot was succeeding and then subsequently managed to record a Boot-Info log from when the boot was just going to the black screen.       I have compared these logs and nothing jumps out at me but perhaps a more trained eye will see something that I don't.


How to turn a JAR file to an EXE file manually?

Well I have made a few games and programs in java, and I was wondering, HOW DO YOU MAKE THIS EXE?  I have been looking around google for the answer and I couldn't find any program or website that helped. So I want to make it EXE myself, manually. I have already tried JSmooth, and that didn't work.


How to prove that if $A$ is infinite and $B$ is finite, then $|A\cup B|=|A|$?

I'm studying logic and unfortunately, I'm a newbie at this, so I don't see the stuff everyone sees at the moment. I want to solve following exercise, but get nowhere:      Let $A$ be an infinite set and let $B$ be a finite set. Use the AC to   prove that $|A| +|B| = |A|$.   I've proved this one though:      If $X$ is an infinite set, there is an injective function $\mathbb{N}  \rightarrow X$, hence $\omega \leq |X|$.   But I don't see how I could use this. What's the logic here?


At first it was found by mistake but I like this feature of C very interesting. a simple program like this :  #include <stdio.h> #include <string.h>  main() {    int array[5];    array[0] = 1;    printf("%d",0[array]); }   will work with no compile error in C and it was not something that I expect. And it will print 1 in the out put. I found this amazing so I just wondering around and found this code will work fine in C too and this will print 10 in the output:  #include <stdio.h> #include <string.h>  main() {    int array[5];    array[0] = 1;    array[1] = 10;    printf("%d",0[array+1]); }   I want to know why these two have no compilation error and also I want to know how the second one work at all. Also any interesting usage of this feature will be appreciated.


How to stop Visual Studio 2010 on compilation error

At work we have a solution with over 90 projects. I want to know if there is a way to stop visual studio from compiling as soon as it encounters an error. Normally it will compile as far as it can and show a list of errors in the error window.   Any ideas?


Adding transparency to grayscale image using GDAL?

I have some binary mask image with 255 and 0 values and I want 0 values become transparent.  How can I do this?    Seems it work, but I'm not sure if it the best method:   gdal_translate -a_nodata 0 -of PNG src.png dst.png


I have a backup of my iPhone 5 on my computer and I had a security code that I know I used but as I just got a new iPhone 6S, the backup is not working as it is stating the security number I am putting in is wrong so is there a way around this or a way to reset the code of the backup that I no longer have the phone? I need this backup and I can't get into it....help! Thanks.


Is there a way I can remove spaces from an unpacked list?

I created a list with random and string methods, and what is it does it just create 1 uppercase letter and then print 6 lowercase letters.  Now, it is always creating a space between the characters, how can I remove the spaces ?  Example:  mport random import string  randomProfile = [random.choice(string.ascii_uppercase)] + random.choices(string.ascii_lowercase, k=6)  print(*randomProfile) # unpack the list   Example of output:  W t o v s q j


php keeps returning Black Diamond Question Mark

I'm sending a XMLHttpRequest from a js file to a php file. The php file gets results from a MySql Database stored on a Ubuntu Remote Server. In the Database, I have stored a movie title 7 Años. The php code keeps echo ing 7 A�os. How to fix this issue? Where is this issue happening exactly?  I have included the lines header("Content-Type: UTF-8"); and mysqli_set_charset($connection, "UTF8"); in the beginning of the php file.  The Column Collation:


I have a question which I hope somebody can answer for me.  My situation: I have an Ubuntu Server running Apache2 on a EC2 Amazon instance, which is serving an OwnCloud instance.  My goal: I want to deploy HTTPS on this instance. I already configured the security group to allow HTTPS traffic from anywhere (as the server should be accessible from anywhere on the internet). We already have a domain name bar.com registered at another domain hosting company. But we want to point foo.bar.com to this owncloud installation.  My questions:   Which IP-address do I use to configure the DNS at this domain hosting company. Because the public ip-address and public DNS of the EC2 instance is renewed every time the instance restarts. How do I generate the SSL certificate for HTTPS configuration of Apache2? More specifically, which common name (CN) do I need to put in the certificate. Because the public dns of the EC2 instance is changing on every restart. I think if I put the foo.bar.com CN in the certificate that the browser will throw a certificate error once the user gets redirected from foo.bar.com -> .compute.amazonaws.com, am I right?   In short: how do I deploy https on a EC2 instance at Amazon AWS with a dns at a third party domain name service?


AC iff $P(\delta)$ can be well-ordered for all $\delta\in{\bf On}$

I'm trying to do the following exercise:     Exercise. Assume ZF. Then AC is equivalent to the statement that $P(\delta)$ can be well-ordered for all $\delta\in{\bf On}$.   I'm struggling with the limit case in the induction proof of the "$\Leftarrow$" direction; i.e. Foundation implies ${\bf V}={\bf WF}$, so I'm showing that $R(\alpha)$ (also sometimes called $V_\alpha$) is well-ordered for all $\alpha\in{\bf On}$. The hint tells me to fix some limit ordinal $\gamma$, find an ordinal $\kappa\npreceq R(\gamma)$ by Hartogs' lemma and fix a well-order $\sqsubset$ on $P(\kappa)$, which is possible by assumption. Now I have to find a way to recursively define a well-order $\vartriangleleft_\alpha$ on each $R(\alpha)$, from $\sqsubset$.  What I've tried and accomplished so far:   If $x\in R(\alpha)$ then $\forall\gamma\geq\alpha: x\in R(\gamma)$. Since the ordinal $\kappa$ is found via Hartog's lemma, it satisfies being $(R(\gamma))^+$, and thus a cardinal. Since $\kappa$ is a cardinal, it is true that $\forall \alpha\leq\gamma: R(\alpha)\preceq\kappa$, but since $\kappa\npreceq R(\gamma)$, we have instead that $\forall\alpha\leq\gamma: R(\alpha)\prec\kappa$. Since $\forall\alpha\leq\gamma: R(\alpha)\prec\kappa$, we know there exist a surjection $f_\alpha:\kappa\to R(\alpha)$ for each $\alpha\leq\gamma$, but not a corresponding injection (since that requires AC). We cannot do anything with the mostowski collapse $\pi:R(\alpha)\cong\beta$ ($\beta\in{\bf On}$) of the $R(\alpha)$'s, since that requires a fixed well-ordering on the $R(\alpha)$'s, which requires AC (to choose the well-orderings). $\forall\alpha\in{\bf On}: \alpha\in R(\alpha+1)$. We can't define $x\vartriangleleft_\alpha y$ iff $x\vartriangleleft_{\alpha+1}y$, since this requires the $\sqsubset$ ordering as the "last" $\vartriangleleft$, but to be able to do this, I'd suppose we need an injection, which is not possible (requires AC, as mentioned above as well).   Am I heading in the right direction? Because it seems like I've hit one dead end after each other. I'd love to find $\vartriangleleft_\alpha$'s that "coincide" with $\sqsubset$ somehow, but this seems near impossible, when we're not allowed to use injections. Is there just something blatantly obvious that I'm missing completely?


Return multiple values from a SQL Server function

How would I return multiple values (say, a number and a string) from a user-defined function in SQL Server?


When an object is squeezed to its Schwarzschild radius it becomes a black hole (made by density) and its mass does not change (its gravity doesn’t change), but if its mass doesn’t change (its gravity doesn’t change) how does light not escape the black hole? The question is not why a black hole is black, or why light does not escape black holes in general. The question is why light does not escape a Schwarzschild black hole with a small mass (which, presumably, means the gravitational pull does not change either).


Reset default ACLs for C:\Program Files\WindowsApps

I had to take ownership of the special folder C:\Program Files\WindowsApps to fix . The issue is now resolved, so I'd like to reset the permissions to the way they were before I took ownership of the folder.  I reverted NT SERVICE\TrustedInstaller to the owner and removed my account's permission entries:     But I still have full control of the folder and can browse the folder in Explorer without getting the usual warning that I would have to take ownership:     Is it possible to restore the default permissions of this folder?


Can a sentence have two ing-verbs in a row?

Perhaps I've got the wrong idea, but I've been taught that two verbs ending in -ing shouldn't go together. However, I come across such cases occasionally.  *I'm considering buying a new car. I'm practicing playing the piano. He is finishing saying his prayers at the moment.*  So, is it grammatically correct to put one -ing after another?


How to put figures in the margin beside text?

For my thesis, I would like to be able to put some illustrative pictures in the (exterior) margin, beside text as it is the case in following example (, p. 16)    However, I cannot find the keywords that would lead me to an answer (I am stuck in threads about side-by-side figures or text-wrapping).  Thanks for any help!


Does Apple Pay require an internet connection?

Do I need an internet connection on my iPhone 6 to use Apple Pay?


Is there a null sequence that is in not in $\ell_p$ for any $p<\infty$?

Is  $$\bigcup_{p<\infty}\ell_p=c_0 ?$$  At least one inclusion obvious: every $p$-summable sequence converges to zero.


Calculating drift velocity/number of charge carriers

You know current and voltage of a circuit. how would you calculate number of charge carriers or drift velocity of electron? through experiments/theoretically


SVG from illustrator doesnt fill correctly

Blender is not filling correctly the SVG file imported from illustrator even after trying all the options for SVG exporting on illustrator. On the attached photo, you can see the area referred with the blue arrow doesn't fill until I delete the red areas.  The filling before deleting the red areas:    The filling after deleting the red areas:    Would you please help me sort this out?


Lets suppose there are two bodies very close to each other. A book on table. Since they are not perfectly smooth there is air inside between them. How can the air exert 1 atm pressure between the book and table interface. If two objects are very close to each other why is the atm pressure still same.


Launch a .exe when a specific USB device is connected

I would like to launch a .exe when a specific USB device is connected (for instance a Akai LPK25 USB MIDI keyboard).  Is there a simple way to do this with Windows?


Citation inside comments of Theorem leads to `! Argument of \@citex has an extra }.`

I am trying to obtain an output such as      Theorem 4 (see [1, Theorem 12]). Statement of the theorem.   Separately, the commands \begin{Theorem}[comments]... and \cite[comments]{refname} work fine, assuming the comments of the Theorem contain nothing crazy, and assuming that \cite is outside the comment environment of the Theorem. But together, such as in the following minimal code  \documentclass{article} \usepackage{amsmath, amssymb, amsthm} \newtheorem{Theorem}{Theorem}  \begin{document} \begin{Theorem}[see \cite[Theorem 12]{refname1}] \end{Theorem}  \bibliographystyle{plain} \bibliography{b} \end{document}   I get the error      ! Argument of \@citex has an extra }.   Note that it happens already before Bibtex is run, that is when the compiler hasn't read what refname1 refers to. And running Bibtex doesn't change anything.  Any idea where this could come from or how to fix it?


Is it possible to run application by clicking on its desktop-file from /usr/share/applications opened in Nautilus?

Just installed Nautilus on the Ubuntu MATE 19.10. Navigated to /usr/share/applications to launch some application by clicking on its icon. When I click on the icon of the desktop-file for application this file is opened in text editor. Moreover the icons are not shown:    How one can open application by clicking on its desktop-file in modern Nautilus? I remember it was working as expected in Ubuntu 18.04 LTS.


How can I import Opera bookmarks into Chrome?

Not the same thing:    While I know that I can use a service like Xmarks to synchronize them between the two browsers, and while I know that a method exists to export the bookmarks as HTML, then reimport them, are there any other methods?  Will Chrome look on install to see if there are any Opera bookmarks?


Finding the minimum number of selections .

Lets assume I have three boxes that contains only apples, only  oranges and a mix of apples and oranges respectively and all of them are mislabelled . What is the minimum number of selections that I need to make so that I can be certain which box contains what fruits assuming I can pick one fruit at a time from any of the boxes ?  P.S: It is not a homework task . So don't put that tag in here . I was asked this in an interview. I was looking for  a interview tag but couldn't find one .


I have a string, I want to split it into a list so that every element of the list has N words. If the last element does not have enough words, leave it as it is.  for example:  >>> Split_by_N_words(string="I grow a turtle. It's a very slow but cute animal.", N=4) ["I grow a turtle.", "It's a very slow", "but cute animal."]   I tried to do this:  def Split_by_N_words(string, N):     word_list = [""]     for a in string.split()[:N]:         word_list[0] += a + " "     .....   But I have no idea how to proceed with the other elements


Given 3 line equations, find incenter(center of the inscribed circle) of the triangle formed

Let $4x -y+2=0, x-4y-8=0, x+4y-8=0$ make a triangle. Find the $(x,y)$ coordinates of the triangle's incenter(center of the inscribed circle).  I know that the intersection of the bisectors make the triangle's incenter. I have also tried to calculate each of the triangle's vertices, but I can't make it any further.


Let $f:\mathbb{R}^n\rightarrow \mathbb{R}^n$ be such that $\left\| f(x)-f(y)\right\| =\left\| x-y\right\|$.  Is $f$ necessarily surjective?  If this is so, you can prove (Mazur-Ulam Theorem) that $f$ is affine, and hence you could classify all isometries of $\mathbb{R}^n$.  However, at the moment, I can't think of any good ideas to prove that $f$ is surjective.  For that matter, is it even the case that $f$ must be surjective?  Any ideas would be most welcomed.  Thanks much!


Please make the "last seen" entry optional

Possible Duplicate:          Some people don't like being spied on by bosses or others, or revealing the frequency and intensity of their participation on SE sites.  Is an option to hide "seen" and similar fields on the summary page viable? Or, could the field be changed to day-level granularity?


qt.qpa.plugin: Could not load the Qt platform plugin "xcb" in "" even though it was found. in ubuntu 20.04

How should I solve this problem in Ubuntu 20.04? Invalid MIT-MAGIC-COOKIE-1 keyqt.qpa.xcb: could not connect to display :0 qt.qpa.plugin: Could not load the Qt platform plugin "xcb" in "" even though it was found. This application failed to start because no Qt platform plugin could be initialized. Reinstalling the application may fix this problem.     Available platform plugins are: eglfs, linuxfb, minimal, minimalegl, offscreen, vnc, wayland-egl, wayland, wayland-xcomposite-egl, wayland-xcomposite-glx, webgl, xcb.     Aborted (core dumped) Invalid MIT-MAGIC-COOKIE-1 keyqt.qpa.xcb: could not connect to display :0 qt.qpa.plugin: Could not load the Qt platform plugin "xcb" in "" even though it was found. This application failed to start because no Qt platform plugin could be initialized. Reinstalling the application may fix this problem.     Available platform plugins are: eglfs, linuxfb, minimal, minimalegl, offscreen, vnc, wayland-egl, wayland, wayland-xcomposite-egl, wayland-xcomposite-glx, webgl, xcb.     Aborted (core dumped) 2224/31772MB(vision)   and $ echo $DISPLAY :0  and $ python Python 3.8.5 (default, Jul 28 2020, 12:59:40) [GCC 9.3.0] on linux Type "help", "copyright", "credits" or "license" for more information. >>> import inspect >>> from PyQt5 import Qt >>> vers = ['%s = %s' % (k,v) for k,v in vars(Qt).items() if k.lower().find('version') >= 0 and not inspect.isbuiltin(v)] >>> print('\n'.join(sorted(vers))) PYQT_VERSION = 331522 PYQT_VERSION_STR = 5.15.2 QOpenGLVersionProfile = <class 'PyQt5.QtGui.QOpenGLVersionProfile'> QOperatingSystemVersion = <class 'PyQt5.QtCore.QOperatingSystemVersion'> QT_VERSION = 331522 QT_VERSION_STR = 5.15.2 QVersionNumber = <class 'PyQt5.QtCore.QVersionNumber'>  As a minimal code to reproduce this error, you can run this: $ cat test_qt.py  ''' ==================== 3D plots as subplots ====================  Demonstrate including 3D plots as subplots. '''  import matplotlib.pyplot as plt from mpl_toolkits.mplot3d.axes3d import Axes3D, get_test_data from matplotlib import cm import numpy as np   # set up a figure twice as wide as it is tall fig = plt.figure(figsize=plt.figaspect(0.5))  #=============== #  First subplot #=============== # set up the axes for the first plot ax = fig.add_subplot(1, 2, 1, projection='3d')  # plot a 3D surface like in the example mplot3d/surface3d_demo X = np.arange(-5, 5, 0.25) Y = np.arange(-5, 5, 0.25) X, Y = np.meshgrid(X, Y) R = np.sqrt(X**2 + Y**2) Z = np.sin(R) surf = ax.plot_surface(X, Y, Z, rstride=1, cstride=1, cmap=cm.coolwarm,                        linewidth=0, antialiased=False) ax.set_zlim(-1.01, 1.01) fig.colorbar(surf, shrink=0.5, aspect=10)  #=============== # Second subplot #=============== # set up the axes for the second plot ax = fig.add_subplot(1, 2, 2, projection='3d')  # plot a 3D wireframe like in the example mplot3d/wire3d_demo X, Y, Z = get_test_data(0.05) ax.plot_wireframe(X, Y, Z, rstride=10, cstride=10)  plt.show()  $ python test_qt.py  Invalid MIT-MAGIC-COOKIE-1 keyqt.qpa.xcb: could not connect to display :0 qt.qpa.plugin: Could not load the Qt platform plugin "xcb" in "" even though it was found. This application failed to start because no Qt platform plugin could be initialized. Reinstalling the application may fix this problem.  Available platform plugins are: eglfs, linuxfb, minimal, minimalegl, offscreen, vnc, wayland-egl, wayland, wayland-xcomposite-egl, wayland-xcomposite-glx, webgl, xcb.  Aborted (core dumped)  Also, $ python Python 3.8.5 (default, Jul 28 2020, 12:59:40)  [GCC 9.3.0] on linux Type "help", "copyright", "credits" or "license" for more information. >>> from PyQt5 import QtCore, QtGui, QtWidgets >>>


Class of referenced Library cannot be resolved to a type

I know this question has been asked so many times, but I think I followed all the steps (add class folder to build path), yet Eclipse keeps complaining.   .  I am really out of ideas. I guess it might be necessary to add an import statement, but I have no clue what it should be. Whatever I tried  e.g. import /picture.zip_expanded with or without dash, with or without * or .Circle in the end would not be accepted. Thanks a lot! Thomas


How to filter the success message when using nc port scan

I used following command for port scanning of my machine  nc -zv 192.168.1.1 1-100  but I want to filter only succeeded message from  following output.Hence i used the following command   nc -zv 192.168.1.1 1-100|grep succeeded   But no use, still it shows full output   nc: connect to 192.168.1.1 port 1 (tcp) failed: Connection refused nc: connect to 192.168.1.1 port 2 (tcp) failed: Connection refused nc: connect to 192.168.1.1 port 3 (tcp) failed: Connection refused nc: connect to 192.168.1.1 port 4 (tcp) failed: Connection refused nc: connect to 192.168.1.1 port 5 (tcp) failed: Connection refused nc: connect to 192.168.1.1 port 6 (tcp) failed: Connection refused nc: connect to 192.168.1.1 port 7 (tcp) failed: Connection refused nc: connect to 192.168.1.1 port 8 (tcp) failed: Connection refused nc: connect to 192.168.1.1 port 9 (tcp) failed: Connection refused


today, we were taught the polynomial remainder theorem and to prove it, the following identity was written in the board by our teacher. $$f(x) = g(x)(x-A) + R ----------->(1)$$ Here, f(x) and g(x) are polynomials with f(x) being the dividend and (x-A) being the divisor. R is a constant with real value. (Please excuse my English for I have studied mathematics in my native language) However, since I have knowledge in simplifying fractions, I thought that the same could be written as below, $$f(x) / (x-A)  = g(x) + R / (x-A) -------->(2)$$ In this case, we can not define the identity at x=A. (Or divide the polynomial at x=A for that matter). However we get the correct results from the connection I have marked as (1) above. How is this possible? To further elaborate my question with a count example, we can do the following, $$(x^3 + 6x^2 + 11x + 6) / (x+4) = x^2+2x+3-6/(x+4) ------->(3)$$ We know that we can not divide the polynomial at x = -4 in the connection I have marked as (3). However, we can write it as, $$(x^3 + 6x^2 + 11x + 6) = (x^2+2x+3-6)(x+4) - 6 -------->(4)$$ and then find the remainder by substituting x = -4 Can someone kindly explain to me how come this is possible?


Non-linear ODE of degree one (Riccati looking)

What is the solution to the one dimensional ODE $$ f'(x)= 1- f^2(x)? $$  Is there a simple classical technique to use?  This looks like a 1-dimensional differential Riccati equation to me, but this isn't my field...


states that: $$ \int_0^1x^{-x}dx=\sum_{n=1}^\infty n^{-n} $$ and $$ \int_0^1x^{x}dx=-\sum_{n=1}^\infty(-n)^{-n} $$ A friend of mine noticed that numerically: $$ \int_0^1\int_0^1(xy)^{xy}dxdy\approx  0.7834... \approx \int_0^1x^{x}dx $$ Are these two integrals really equal?


Should I put number combinations like 1111111 onto my lottery ticket?

Suppose the winning combination consists of $7$ digits, each digit randomly ranging from $0$ to $9$. So the probability of $1111111$, $3141592$ and $8174249$ are the same. But $1111111$ seems (to me) far less likely to be the lucky number than $8174249$. Is my intuition simply wrong or is it correct in some sense?


Maximizing healing and damage for a Cleric

I am planning this character out for levels 1-20. We're starting at level one and we are continuing until we're done or dead.  I'm having some trouble deciding on my feats, and spells to maximize damage and healing output.  I understand that warpriest clerics are given armor proficiency to help make creating a 2nd edition battle medic super easy, but I'm trying to balance my character perfectly between doing damage with my deity's weapon and healing my allies. I'm having a lot of trouble judging which trade-offs to take so that I can hit harder while still being a viable healer.  As a character, I've chosen Cleric, Warpriest, Dwarf, Medium Armror, Shelyn, and Glaive.  Right now, my plans for feats are leaning toward Domain initiate with Zeal, communal healing, divine weapon, but the details are starting to get fuzzy. It's all the different numbers floating around that are confusing. I really just want to increase the amount of healing from my spells and the amount of damage from my glaive. What is the best way to balance these two paths?


Has it been considered to leverage the Stack Exchange network more directly as a learning platform?

There is so much great information on Stack Exchange. A lot of it one discovers only on a need to know basis when running into a similar situation. I was thinking about a new feature to leverage this.  I think that Stack Exchange holds great value in turning its old questions (which already have answers) into a more direct learning experience. Let us say I'm a user that wants to learn more about a specific topic. SE has some knowledge of my skill level on that topic. If not it can try to estimate it by presenting me with questions which already have answers. If I feel comfortable with answering the questions I receive, and the answers are familiar terrain, I can give feedback on how confident I am in resolving the question and also how entertaining the question is as a learning experience. This way SE can update my skill level and update the difficulty and meta information of the question. With this closed feedback loop it can then continue providing me with questions which are relevant to my skill level. Once I'm at a high skill level it could then occasionally present me with questions which don't have an answer as well.  Do you think this makes sense? Would you use it or do you think it would help attract new users to the site and teach them how to write higher quality answers?


Floor function properties: $[2x] = [x] + [ x + \frac12 ]$ and $[nx] = \sum_{k = 0}^{n - 1} [ x + \frac{k}{n} ] $

I'm doing some exercises on Apostol's calculus, on the floor function. Now, he doesn't give an explicit definition of $[x]$, so I'm going with this one:     DEFINITION Given  $x\in \Bbb R$, the integer part of $x$ is the unique $z\in \Bbb Z$ such that $$z\leq x < z+1$$ and we denote it by $[x]$.   Now he asks to prove some basic things about it, such as: if $n\in \Bbb Z$, then $[x+n]=[x]+n$  So I proved it like this: Let $z=[x+n]$ and $z'=[x]$. Then we have that  $$z\leq x+n<z+1$$  $$z'\leq x<z'+1$$  Then $$z'+n\leq x+n<z'+n+1$$  But since $z'$ is an integer, so is $z'+n$. Since $z$ is unique, it must be that $z'+n=z$.  However, this doesn't seem to get me anywhere to prove that  $$\left[ {2x} \right] = \left[ x \right] + \left[ {x + \frac{1}{2}} \right]$$  in and in general that   $$\left[ {nx} \right] = \sum\limits_{k = 0}^{n - 1} {\left[ {x + \frac{k}{n}} \right]} $$  Obviously one could do an informal proof thinking about "the carries", but that's not the idea, let alone how tedious it would be. Maybe there is some easier or clearer characterization of $[x]$ in terms of $x$ to work this out.  Another property is $$[-x]=\begin{cases}-[x]\text{ ; if }x\in \Bbb Z \cr-[x]-1 \text{ ; otherwise}\end{cases}$$  I argue: if $x\in\Bbb Z$, it is clear $[x]=x$. Then $-[x]=-x$, and $-[x]\in \Bbb Z$ so $[-[x]]=-[x]=[-x]$. For the other, I guess one could say:  $$n \leqslant x < n + 1 \Rightarrow  - n - 1 < x \leqslant -n$$  and since $x$ is not an integer, this should be the same as $$ - n - 1 \leqslant -x < -n$$  $$ - n - 1 \leqslant -x < (-n-1)+1$$  So $[-x]=-[x]-1$


Meaning of "She wheedled her mother into buying John a mink coat"?

What does "She wheedled her mother into buying John a mink coat" mean?  Does it mean "She wheedled her mother and her mother bought a mink coat and her mother gave John a mink coat" or "She wheedled her mother and her mother bought a mink coat from John"?


How to create a formula for a recursive sequence?

Let $\left (a_n  \right )_{n=1}^{\infty}$ be an infinite sequence.  $\left (a_n  \right )_{n=1}^{\infty}$ is defined by:   $a_1 = 0$   $\; \; \; a_{n+1} = \frac{1}{1+ a_n}\; \; \forall n \in \mathbb{N}$  I need to show that $\left (a_n  \right )_{n=1}^{\infty}$ converges and find it's limit. I want to do it by finding a formula for both $a_{2k}$ and $a_{2k-1}$ and then use some basic limit arithmetics rules, however I didn't manage to find a formula for both sub-sequences.  I would love to get some recommendations on how to find such formula and how to approach these kind of questions.   Thanks!


How to configure multiple workers for laravel queue with systemd

I am running queue for my laravel app using systemd. Here's my service file [Unit] Description=Mosharaf isdp queue  [Service] User=nginx Group=nginx Type=simple Restart=always Nice=10 WorkingDirectory=/var/www/html/mosharaf_isdp/ ExecStart=/usr/bin/php artisan queue:work  --sleep=10 --timeout=1800 --tries=1 TimeoutStartSec=30 [Install] RequiredBy=multi-user.target  Using this service file all of my jobs are being processed one by one. I have followed steps given in  and . Both of them says To run multiple workers you have to list them in "queue" parameter  by this i am guessing they mean to add it in below line like that. ExecStart=/usr/bin/php artisan queue:work --queue=default --sleep=10 --timeout=1800 --tries=1  But my question is isn't it specifying which queue to run ? All of my jobs are stored as default and i want multiple workers to process them. How can i do that ? N.b., While i was using supervisor there was a key in it's config file as numprocs which specified number of workers. Is there something like this here or i have to put my jobs in different queue say q1,q2,q3 and add them like below to activate 3 workers ? ExecStart=/usr/bin/php artisan queue:work --queue=q1,q2,q3 --sleep=10 --timeout=1800 --tries=1


Instantaneous axis of rotation and rolling cone motion

Suppose a cone is purely rolling (no slipping) around a fixed axis. Elaborately, it is revolving around a fixed axis perpendicular to the ground and passing through its vertex and also rotating, and the vertex is stationary.  Now the instantaneous axis of rotation (IAR) of the cone is the 'line' that is touching the ground right? So how do you find the velocity of any other point using that? I mean, in the rolling wheel, you multiply the angular velocity by the distance from the IAR to get the velocity. Is it the same here? If it is, then consider the center of base of the cone. If the height of cone is $h$ then its distance from the IAR is clearly $h\sin x$ where $x$ is the cone's half apex angle. So its velocity should be $ah\sin x$, where $a$ is the angular velocity with which the cone is rotating. Is this right? Now we can also analyse the cone's motion by considering it in two parts: rotation + revolution, right? So again considering the center of base of the cone, it has no velocity by virtue of rotation (since the cone is rotating about an axis through the center), right? And by virtue of it rotating in a circle (of radius $h\cos x$) around the axis passing through its vertex, it has velocity $bh\cos x$ , where $b$ is the angular velocity with which the cone is revolving. Now these two must be same, so we get $b=a \tan x$. But Wikipedia states  that the ratio is $\sin x$. And at the same time,  video (which I found in the external links section of the Wikipedia page) states that $a=b\cot x$ which is same as what I got. I'm really confused. Is everything that I did right? If not please correct me. Thank you. How to find velocity of any point on the  cone? There ought to be two approaches , one using IAR and another by considering motion as rotation + revolution but I'm not able to do it.


Why can't a $C^1$-class mapping with nonzero derivative fill a square?

Let $f: [0,1] \rightarrow \mathbb R^2$ be of class $C^1$ with $f'(t)\neq (0,0)$. Why can't $f$ be a Peano-type curve, i.e. $f(I) \neq I\times I$?


Solving Wave Equation with Initial Values

I am trying to solve the wave equation:  $u_{tt}$  = $u_{xx}$   With initial values:  $u(x,0) =\begin{cases} x^3 - x, &\text{for }|x|\le 1,\ \\0, &\text{for }|x|\ge1\end{cases}$  $u_t(x,0) =\begin{cases} 1 - x^2, \text{for } |x|\le 1, \\ 0, \text{for } |x|\ge1    \end{cases}$  In the domain $D= \{(x,t) | - \infty < x<\infty, \space\space t>0\}  $  I am using D'Alembert's Formula and after inputting the values in I have:  $u(x,t) = \frac{1}{2}[\frac{2}{3}(x+t)^3 + \frac{4}{3}(x-t)^3  - 2(x-t)] $  I am not sure where to go from here.  I think because the initial conditions are not differentiable at some points  then there will be points in the solution that are not differentiable   So I'd need to consider the different cases of $|x+t|\le 1$?  I could be going down the complete wrong path so any help is appreciated.  Thanks


Show that every subgroup of $ ( \Bbb{R} ,+)$ is cyclic or dense.  (Note that we say $A \subset  \Bbb{R} $ is dense if $\overline{A} =\Bbb{R}$.)  For example $\Bbb{Q}$ is a subgroup that is dense but not cyclic and $\Bbb{Z}$ is cyclic but not dense.  I think no subgroup of the real numbers can be both cyclic and dense.


How do I list all processes owned by my user?

List all process names for my user.   I could do it with   ps aux | grep username   But the output would be like:  maythux  18343  0.0  0.1 1070868 34504 ?       Sl   Jun03   0:07 empathy maythux  21562  0.0  0.1 703716 32104 ?        Sl   Jun10   0:00 /usr/bin/python /usr/bin/blueman-applet maythux  21574  0.0  0.0  53532  2408 ?        S    Jun10   0:00 /usr/bin/obex-data-server --no-daemon  maythux  25197  0.0  1.0 2199840 258576 ?      Sl   May27   0:24 remmina   But I just want the output look like:  empathy blueman-applet obex-data-serve remmina   So what is the easiest way to do that?


Is there something like a "standard dress code" for a Ph.D thesis discussion? And, if there is - how important is it? Obviously, one should not (I think) dress too casually, but I do not know what is deemed appropriate.  I don't know how much this varies around the world; if it helps, I am from Europe.


Windows Disk Management Not Allow 'Delete Volume' and 'Extend Volume'

I am trying to delete my existing windows partition using disk management, when I am right clicked on the selected partition the 'Delete Volume' and 'Extend Volume' options are grayed out ( doesn't allow deletion and extension), and I can not also change or remove the drive letter of the disk which has above problem. And Another partition that I don't want to change anything it allows all the options. Why does this happen?


Get the name of a value from an array PHP

here is a sample the array I have  Array ( [57] => 0 [58] => 0 [59] => 0 [60] => 0 [61] => 0 [62] => 0 [63] => 0   The value names are randomly generated I want to get the name of each pair out of the array and the value I can get the value using   foreach ($_POST as $songvalue) { print $songvalue;   }  But how do I get the name of the value


Steps to upgrade from Ubuntu 14.04.6 to 16.04.6 LTS or to latest 20.04 LTS (if possible)

I've been on 14.04 LTS for a while now and really keen to upgrade to the latest LTS version (if possible) or do I need to incrementally upgrade?  I will obviously backup my main directories and files as I'm not sure if my whole system will get wiped (hoping not) during upgrade.  Could people pls point me or guide me through the steps to carry out the upgrade as I am keen to upgrade but obviously want to make sure that is all successful and that I don't lose any of my existing data.  I also have a LAMP stack installed and hoping that this is also updated along with OS.


Is It Possible Start and Stop MariaDB service using NET command without Administration?

I have installed MariaDB 10.4 Series in Window 7. But there's no option for start/stop and restart in installation folder. So i had to stopped through services.msc tool. Hence I have created batch script but when I run the script then I am getting "Access is denied" error message because i run the script direct from desktop. I don't want to run cmd as administrator. I want to run the script direct by clicking.    Following the batch script:  @eacho off net stop mariadb if ERRORLEVEL 1 goto error exit :error echo There was a problem to stop the service pause   Please help me that How can I start and stop the service of MariaDB using batch script without run cmd under administration ?


i was recently doing this problem---  problem statement  You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What maximum number t of tables can be decorated if we know number of balloons of each color?  Your task is to write a program that for given values r, g and b will find the maximum number t of tables, that can be decorated in the required manner.  Input  The single line contains three integers r, g and b (0 ≤ r, g, b ≤ 2·109) — the number of red, green and blue baloons respectively. The numbers are separated by exactly one space.  Output  Print a single integer t — the maximum number of tables that can be decorated in the required manner.  test case:  5 4 3  answer:  4  the problem is pure mathematical but after trying it for hours i am not able to figure correct solution,please help!  this approach fails*(i am following a greedy approach and taking 2 ballons from the element with greater value)*   ll pro;      while(1)     {         pro=a[2]/2;          a[2]=a[2]-pro*2;          if(pro>a[1])             {sum+=a[1];a[1]=0;break;}         else         {             sum+=pro;a[1]=a[1]-pro;             if(a[1]>a[2])                 swap(a[1],a[2]);             if(a[1]==0||a[2]==0)                 break;             if(a[1]==1&&a[2]==1)                  break;         }     }     cout<<sum<<endl;


In NotePad++, I generally run with a few files open. These are log files that are continually updating. I get annoyed when NotePad++ resumes focus and I get a stack of Reload popups informing me that some of my open files have been updated 'by another program,' and would I like to reload them.    I would like to turn this alert off and manually reload the files when it is convenient. I've looked but I cant seem to see the option. Is there a way to do this?


Convert text-based subtitles to individual bitmaps with ffmpeg

We have a text-based subtitle stream, and we need to convert each distinct subtitle in that subtitle stream to an individual .bmp file, with 24 Bits per pixel.  How can we do that with ffmpeg?


I've had a problem with Software Center for a few weeks, where it has just refused to delete a removed PPA from its "All Software" and "Installed Software" drop-down menus. I've tried many suggested solutions, none have worked, so I've finally decided to re-install Software Center if its possible. How do you do this and is it risky to your computer (i.e. will re-installing it cause all sorts of issues)?


Why isn't apt full-upgrade getting an updated software key signature for skype

After a recent apt update && apt full-upgrade I started getting the following error when running apt full-upgrade subsequently: Get:4 https://repo.skype.com/deb stable InRelease [4,502 B]                                         Err:4 https://repo.skype.com/deb stable InRelease   The following signatures were invalid: EXPKEYSIG 1F3045A5DF7587C3 Skype Linux Client Repository <se-um@microsoft.com> W: An error occurred during the signature verification. The repository is not updated and the previous index files will be used. GPG error: https://repo.skype.com/deb stable InRelease: The following signatures were invalid: EXPKEYSIG 1F3045A5DF7587C3 Skype Linux Client Repository <se-um@microsoft.com> W: Failed to fetch https://repo.skype.com/deb/dists/stable/InRelease  The following signatures were invalid: EXPKEYSIG 1F3045A5DF7587C3 Skype Linux Client Repository <se-um@microsoft.com> W: Some index files failed to download. They have been ignored, or old ones used instead.  Is there a way to correct this, or is it down to Microsoft/Canonical to produce/update the necessary key signatures?


What is the difference between /opt and /usr/local?

According to the , /opt is for "the installation of add-on application software packages".  /usr/local is "for use by the system administrator when installing software locally".  These use cases seem pretty similar.  Software not included with distributions usually is configured by default to install in either /usr/local or /opt with no particular rhyme or reason as to which they chose.  Is there some difference I'm missing, or do both do the same thing, but exist for historical reasons?


Why is quaternion algebra 4d and not 3d?

Why is  quaternion algebra 4D and not 3D?  Complex algebra is 2D and what is known as quaternion algebra jumps to 4D.    $ i^2 = j^2 = k^2 = ijk = -1 $  Using $1, i, j,$ and $k$ as the base (where complex uses $1$ and $i$ (or $j$ if you are an EE)) which results in a 4-axis space.  Why is there no 3D algebra?


Schauder basis in the space of convergent sequences

Could someone help me to prove that {$e_k$ : $k\geq{0}$ } (where $e_k$ (if $k>0$) is the sequence with $1$ in the place $k$ and $0$ in the rest of sequence  and $e_0 $ is the constant sequence equal to $1$) is  a Schauder basis of sequences which converge?.  Thanks.


I'm currently in first year math and got given this question, but I have absolutely no idea how to go about it.   After asking me to write the permutations given by $f$ as a product of disjoint cycles, it asked me to find the least number $m\in\mathbb{N}$ such that $f^m=\mathrm{id}$, where id denotes the identity function.  I tried composing it again and again so I saw what was obtained for $m=2,m=3,...$, but it seems like it's going nowhere: I cannot spot any patterns in the lengths of the cycles corresponding to the value of $m$. I was wondering if I could get a hint that could take me in the correct direction?  Thank you!


I could install with an error message "unknown media /ALL". It could not run WPS Office.


Figure width and height stored to a new file

I am trying to store the figure height and width into a separate file, for this I write the code (please excuse me, if these are not in a standard method) as below:  \documentclass{book}   \RequirePackage{color,graphicx}% \RequirePackage{printlen}%  \uselengthunit{cm}  \newlength\imageheight \newlength\imagewidth  \newwrite\imgdetail% \immediate\openout\imgdetail\jobname.imd%  \let\LTXincludegraphics\includegraphics%  \newbox\fightbox% \newdimen\fightdimen%  \newcount\fightcounter%  \def\fightvalue{}%  \renewcommand\includegraphics[2][]{% \settoheight\imageheight{\hbox{\LTXincludegraphics[#1]{#2}}}% \fightdimen=\ht\fightbox% \gdef\fightvalue{\strip@pt\fightdimen}%   \write\imgdetail{\figurename\space\thefigure, Page \thepage, #2}%   \write\imgdetail{height=\printlength{\imageheight}}%   \LTXincludegraphics[#1]{#2}% }%  \begin{document}  \begin{figure} \includegraphics[draft]{gr1.eps} \end{figure}  \end{document}   Everything works fine, but the figure height doesn't come correct, the output was:  Figure 0, Page 1, gr1.eps height=\def cm{pt}0.0pt   Can you advise what I did wrong in this?


Tool for recovering deleted data from a flash drive

What is the best tool for recovering deleted data from a flash drive (pen drive)?


I have a Windows 8.1 machine.   I made a SteamOS Virtual Machine on HyperV, using the   I know it's possible to dual boot from VHD, however Windows bootloader does not support non windows / Linux VHD boot, and SteamOS is a Debian. I wonder if it's possible to dual boot this SteamOS VHD and if it is, how will I do it?


Typesetting equivalence class with latex

I was wondering, I haven't been able to find the symbol for doing a "hollow" square bracket, its basically how you would expect a square bracket to look if you used \mathbb on it. Does anybody know how to do this?


Exception thrown : Access violation reading location 0xCCCCCCCC

I'm a beginner in C++. I should make program that outputs shape's area.  For example,   Input 1. Square   Input 2. Rectangle   Input 3. Circle   Input 4. Print all the areas  User input: 1  Please give me the side.  The side is: 3  User input: 4  Square area: 9  //////////////////////////////////////////////////////   But there is problem about exception thrown.  I don't know why compiler indicates this. Can someone explain this?   source.cpp:  using namespace std;  int main() {             const int n = 10;     Shape * arr[n];      int input, index = 0;      do     {         cout << "What shape that you want to create?" << endl;         cout << "Input 1. Square \n";         cout << "Input 2. Rectangle \n";         cout << "Input 3. Circle \n";         cout << "Input 4. Print all the areas \n";         cout << "Input -1. Exit \n";          cout << "User input: ";         cin >> input;          //Use switch statement to check user's input         switch (input)         {         case -1:             cout << "You inputted number : -1 \n" << "The program will be ended. " << endl;             break;         case 1:             double side;             cout << "Please give me the side: ";             cin >> side;              arr[index] = new Square(side);             index++;             break;         case 2:             double width, length;             cout << "Please give me the width and length \n";             cout << "Width is: ";             cin >> width;             cout << "Length is: ";             cin >> length;              arr[index] = new Rectangle(width, length);             index++;             break;         case 3:             double radius;             cout << "Please give me the radius: ";             cin >> radius;              arr[index] = new Circle(radius);             index++;             break;         case 4:             for (int i = 0; i < 10; i++)             {                 cout << arr[i]->getName();                 cout << " area: ";                  cout << fixed << showpoint <<                     setprecision(2);                  cout << arr[i]->area() << endl;             }             break;         default:             cout << "You entered different number mentioned above!" << endl;         }     } while (input != -1);      delete[] arr;      system("pause");     return 0; }   The compiler shows that Exception thrown at 0x0130C213 in Project.exe: 0xC0000005: Access violation reading location 0xCCCCCCCC.  I don't understand why the compiler shows this.  Please give me any advice!


Where to draw the line between size_t and unsigned int?

I'm currently in the process of converting some uses of unsigned int to size_t in my a code base that I have been developing over the years. I understand the difference between the two and that for example unsigned int could be 32-bit while pointers and size_t could be 64-bit. My question is more about where I should use either one and what kind of convention people use for picking between the two.  It's quite clear that memory allocation should take size_t instead of unsigned int as an argument, or that container classes should use size_t for size and indexing like in STL. These are the common cases referred when reading about the benefits of size_t vs unsigned int. However, while working on the code base conversion I stumbled upon quite a few cases in gray areas where I'm not sure which one to use. For example if 4x4 matrix row/column index should be size_t for consistency regardless the index being in range [0, 3], or if screen/texture resolution should use size_t despite of being in range of few thousand, or in general if the reasonable number of objects is expected to be in the range of tens I should still use size_t for consistency.  What kind of coding conventions you use for picking between unsigned int and size_t? Should everything that's representing size (in bytes or objects), or index be always size_t regardless of the reasonably expected range? Is there some widely accepted size_t convention used in well-established libraries that I could follow?


Helping others is a good habit.   Which part of speech is "Helping" & "others" here? I think helping here is noun & others is pronuoun.


I am trying to install a gcc-arm version but run into trouble while trying to run the setup shell script.  Following step 2 in the prerequisites I downloaded GNU ARM embedded toolchain v4.9-2015q3.   I have now tried to run the setup_sdk.sh file with sh setup_sdk.sh. I get the following message.  robban@:Nordic-Thingy52-FW-master$ sh setup_sdk.sh  /bin/sh: 1: /usr/local/gcc-arm-none-eabi-4_9-2015q3/bin/arm-none-eabi-gcc: not found Cannot find: "/usr/local/gcc-arm-none-eabi-4_9-2015q3/bin/arm-none-eabi-gcc". Please set values in: "/home/robban/sommarjobb/Examensarbete/Nordic-Thingy52-FW-master/external/sdk13/components/toolchain/gcc/Makefile.posix" according to the actual configuration of your system. ../../../../components/toolchain/gcc/Makefile.common:25: *** Cannot continue.  Stop. /bin/sh: 1: /usr/local/gcc-arm-none-eabi-4_9-2015q3/bin/arm-none-eabi-gcc: not found Cannot find: "/usr/local/gcc-arm-none-eabi-4_9-2015q3/bin/arm-none-eabi-gcc". Please set values in: "/home/robban/sommarjobb/Examensarbete/Nordic-Thingy52-FW-master/external/sdk13/components/toolchain/gcc/Makefile.posix" according to the actual configuration of your system. ../../../../components/toolchain/gcc/Makefile.common:25: *** Cannot continue.  Stop.   Now looking at the path /usr/local/gcc-arm-none-eabi-4_9-2015q3/bin.  robban@:bin$ ls arm-none-eabi-addr2line  arm-none-eabi-gcc-4.9.3   arm-none-eabi-ld.bfd arm-none-eabi-ar         arm-none-eabi-gcc-ar      arm-none-eabi-nm arm-none-eabi-as         arm-none-eabi-gcc-nm      arm-none-eabi-objcopy arm-none-eabi-c++        arm-none-eabi-gcc-ranlib  arm-none-eabi-objdump arm-none-eabi-c++filt    arm-none-eabi-gcov        arm-none-eabi-ranlib arm-none-eabi-cpp        arm-none-eabi-gdb         arm-none-eabi-readelf arm-none-eabi-elfedit    arm-none-eabi-gdb-py      arm-none-eabi-size arm-none-eabi-g++        arm-none-eabi-gprof       arm-none-eabi-strings arm-none-eabi-gcc        arm-none-eabi-ld          arm-none-eabi-strip   The file is clearly there, and I can even do less arm-none-eabi-gcc to read the binary. But I can't do ./arm-none-eabi-gcc, because it tells me that the file is not found.  I also did add the bin directory to my path.  robban@:~$ echo $PATH /home/robban/bin:/home/robban/.local/bin:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/usr/local/gcc-arm-none-eabi-4_9-2015q3/bin     robban@:bin$ uname -a Linux robban-K56CB 4.15.0-51-generic #55-Ubuntu SMP Wed May 15 14:27:21 UTC 2019 x86_64 x86_64 x86_64 GNU/Linux robban@:bin$ file arm-none-eabi-gcc arm-none-eabi-gcc: ELF 32-bit LSB executable, Intel 80386, version 1 (SYSV), dynamically linked, interpreter /lib/ld-, for GNU/Linux 2.6.8, stripped


Installing Ubuntu on a USB drive from ISO image

I have windows 10 and have downloaded the Ubuntu Desktop version to use on a separate older system. Is there a special program I need to install the iso on my USB drive and make it installs on start up?


Fixing virtual machine and descriptor file - rewriting vmx

This is output of the grep -E "scsi0:" *.vmx | grep -E "fileName" command in one of my directory:  scsi0:0.fileName = "vmname.vmdk" scsi0:1.fileName = "vmname_1.vmdk" scsi0:2.fileName = "vmname_2.vmdk" scsi0:3.fileName = "P120_vmname_2.vmdk" scsi0:4.fileName = "P120_vmname_3.vmdk"   I need to rewrite above output inside that vmx file so it looks like following   scsi0:0.fileName = "vmname.vmdk" scsi0:1.fileName = "vmname_1.vmdk" scsi0:2.fileName = "vmname_2.vmdk" scsi0:3.fileName = "vmname_3.vmdk" scsi0:4.fileName = "vmname_4.vmdk"   So in essence the script needs to the following:   look for the line which contains scsi0 and filename and remove everything after double quote before vmname check what is the number in that line after "scsi0:" and add/replace that number after the underscore, so P120_vmname_2 becomes vmname_3   The thing is that there can by any number of characters before vmname which need to be removed and lines which need to be fixed can be anywhere in the source file.  Do I need to assign individual line output to separate variable or it is possible to manipulate them with just one?  Thanks


I was just reading my friend's shell script file and I happen to run within this command  ssh yote@user << EOF   cd tests   tar -xf $TARGET_TEST.tar   rm $TARGET_TEST.tar   cd $TARGET_TEST   *more stuff goes here* EOF   I was just wondering what does the EOF mean in the use case. I only know that it is an initialism for "End-of-file" but there were more lines after the second EOF.


Android - java.lang.NullPointerException - Google Maps

I try to display the user's latitude but I get an error      java.lang.NullPointerException: Attempt to invoke virtual method 'double android.location.Location.getLatitude()' on a null object reference.    GPS is well activated and is the "bestprovider".  public void getUserPosition() {     /**************Vérification des droits localisation******************/     Context mainContext = getActivity().getApplicationContext();      int permissionCheck = ContextCompat.checkSelfPermission(mainContext,             Manifest.permission.ACCESS_FINE_LOCATION);      Log.e("Droits Position : ", String.valueOf(permissionCheck));      if (ContextCompat.checkSelfPermission(mainContext,             Manifest.permission.ACCESS_FINE_LOCATION)             != PackageManager.PERMISSION_GRANTED)     {          if (ActivityCompat.shouldShowRequestPermissionRationale(this.getActivity(),                 Manifest.permission.ACCESS_FINE_LOCATION))         {             Log.e("LOCATION : ", "Localisation acceptée !");         }         else         {             Log.e("LOCATION : ", "Localisation refusée !");              ActivityCompat.requestPermissions(this.getActivity(),                     new String[]{Manifest.permission.ACCESS_FINE_LOCATION},                     REQUEST_LOCATION);         }     }      permissionCheck = ContextCompat.checkSelfPermission(mainContext,             Manifest.permission.WRITE_CALENDAR);     Log.e("DROITS :", String.valueOf(permissionCheck));     /*****************FIN vérification droits localisation************/      LocationManager locationManager = (LocationManager) mainContext.getSystemService(Context.LOCATION_SERVICE);      //On ajoute des critère pour trouver le meilleur provider (indicateur de position)     Criteria critere = new Criteria();     critere.setAccuracy(Criteria.ACCURACY_FINE);//On demande une position précise     critere.setAltitudeRequired(false);         // Est-ce que le fournisseur doit être capable de donner une altitude ?     critere.setBearingRequired(false);           // Est-ce que le fournisseur doit être capable de donner une direction ?     critere.setCostAllowed(true);              // Est-ce que le fournisseur peut être payant ?     critere.setPowerRequirement(Criteria.POWER_HIGH); //On accepte d'utiliser un provider a haute consommation électrique(GPS)     critere.setSpeedRequired(false); // Est-ce que le fournisseur doit être capable de donner une vitesse ?       List<String> providers = locationManager.getAllProviders(); //Liste des fournisseurs qui correspondent     String bestProvider = locationManager.getBestProvider(critere, true); //Le provider qui répond le mieux aux critères      if(bestProvider == null) //On affiche le nom du provider choisis     {         Log.e("Best Provider : ","NULL !");     }     else{         Log.e("Best Provider : ", bestProvider);     }      Location positionNow = locationManager.getLastKnownLocation(bestProvider); //Objet location qui contient la position de l'utilisateur     Log.e("Position user now", "Lat:"+String.valueOf(positionNow.getLatitude()));  }


Cannot cast java.util.date to java.sql.date

I have the following code snippet where i get continous error for casting java.util.date to java.sql.date.          SimpleDateFormat sdf = new SimpleDateFormat("dd/MM/yyyy");          storedProcedureCall.setLong(1, 12345);         storedProcedureCall.setDate(2, (java.sql.Date) sdf.parse("09/02/2017"));         storedProcedureCall.setDate(3, (java.sql.Date) sdf.parse("10/02/2017"));   What am i doing wrong here. I have imported the java.util.Date package as well.


How can I get two Xbox 360's to be in "open nat" mode behind the same router?

I have two Xbox 360's, one WiFi and the other wired through the same Linksys E3000 router with DD-WRT (v24-sp2 (04/13/11) std-usb-nas firmware).   Mine (the wired one, though hers has been wired in the past and it didn't appear to help) always seems to be open (green), and hers is either moderate or closed (oj/red)  Even with the original router firmware I've never been able to get both consoles into "open nat" mode, and it makes playing certain games together almost impossible for me and my wife  because we can't seem to get into the same game.   I have uPnP enabled and the DMZ disabled, and some minor port forwarding to allow for a Minecraft server (Ports 25565 and 25566 for a testing copy of the server), but other than that the settings are mainly at their default, on the xbox's and the router.   Are there any settings I can configure to allow this to work properly?


Let $A, B$ be sets and $f : A \rightarrow B$ be a function. If $f$ is injective, show that the function $g : A \rightarrow f(A)$ is bijective where $g(a) = f(a)$ for each $a \in A$.  I can barely make sense of this question, I'm beginning to lose all hope that I will ever be able to understand mathematics at this level.


If α and β are 2 roots of $a \tan θ+b \sec θ=c$ then how the roots of $(a^2-b^2)\tan^2θ-2ac \tanθ+(c^2-b^2)=0$ are $\tan α$ and $\tan β$?

given that $a \tanθ+b \secθ=c$ I am told to prove that $\tan(α+β)=\frac{2ac}{a^2-c^2}$.Now, $$a \tanθ+b \secθ=c...(1)$$$$(b \sec θ)^2=(c-a \tan θ)^2$$$$(a^2-b^2)\tan^2θ-2ac \tan θ+(c^2-b^2)=0...(2)$$ Now solution book says that if the initial equation(1) has the roots α and β then the final equation (2) will have the roots $\tan α$ and $\tan β$. I don't get this assumption. Just because we have squared the expression, why will the roots turn into tangent of the previous ones and not anything else?


Is $1$ and $-1$ the Supremum and Infimum of the set $A=\left\{\sin(n), n \in \mathbb{N}\right\}$ I actually assumed, let $M=Sup(A)$ and $M <1$, now if we could find a $k \in \mathbb{N}$ such that $\sin k>M$, then we can say that $1$ is the supremum of the set.But how to go about finding $k$?


Prove $X$ is uncountable if $X$ is the set of all functions $f: \mathbb{Z}_+ \rightarrow \mathbb{Z}_+$

I'm not sure how to approach this. I've seen a proof how to prove that $[0,1]$ is uncountable. I thought of doing this by contradiction, and assuming that $X$ was countable, but I can't really go anywhere with it.  How would I approach this?


both my iMacs turn off/reboot while in sleep

This issue is driving me crazy.  I have a late 2014 retina iMac and a mid 2017 retina iMac. I updated both to 10.13.4 at the same time and now both of them reboot or turn off while in sleep exactly 3 hours after in sleep mode. If they reboot, they freeze on the login screen and the screen stays on forever  Here is what I tried so far:  1.  Shut down  Disconnect all external devices  Reset the System Management Controller (SMC)  Reset the nonvolatile random-access memory (NVRAM)  Then use safeboot (SHIFT at Startup)  Then reboot normally with devices disconnected.  2.  Erased Macintosh HD completely and reinstalled fresh macOS (without restoring Time Machine backup or any other stuff, so basically untouched system).  Nothing helped so far. Seriously, Apple.... I'm confident this is a software related issue, since both my machines produce exactly the same symptom.


Is Einstein's formula $E=mc^2$ the same as the kinetic energy formula $\dfrac{1}{2} mv^2$?

If the kinetic energy formula is the same as Einstein's formula then $E=mc^2=\dfrac{1}{2} mv^2$. Or, $\dfrac{1}{2}v^2=c^2$. What does this prove? Does it prove that $\dfrac{1}{2}$ of the velocity squared of a moving object is always equal to speed of light squared?


When I create an anaconda virtualenv and install things with pip inside of it, it seems to run into errors which might indicate that its using python 2?   conda create -n tensorflow-3.5 python=3.5 ipykernel source activate tensorflow-3.5 pip install matplotlib (tensorflow-3.5) devs-MacBook-Pro:Documents conduce-laptop$ python Python 3.5.3 |Continuum Analytics, Inc.| (default, Mar  6 2017, 12:15:08)  [GCC 4.2.1 Compatible Apple LLVM 6.0 (clang-600.0.57)] on darwin Type "help", "copyright", "credits" or "license" for more information. >>> import matplotlib Traceback (most recent call last):   File "<stdin>", line 1, in <module>   File "/Users/conduce-laptop/anaconda2/envs/tensorflow-3.5/lib/python3.5/site-packages/matplotlib/__init__.py", line 115, in <module>     import tempfile   File "/Users/conduce-laptop/anaconda2/envs/tensorflow-3.5/lib/python3.5/tempfile.py", line 45, in <module>     from random import Random as _Random ImportError: bad magic number in 'random': b'\x03\xf3\r\n'   Why is this happening? How should I install modules instead? Do I need to use pip3 instead?


TeXstudio keyboard shortcut to auto indent latex code

I would like to know of a quick way to auto align LaTeX code where appropriate, similar to the ctrl + i keyboard shortcut used in MATLAB after highlighting a bunch of code that isn't aligned correctly.


How i can import a external database sqlite in android app

I wanna use a external database sqlite in my android app.   I have copied a database in assets folder in my java android project (database.db.zip) but i can't use this database with normal guides on web.  i have create this class  public class MyDatabase extends SQLiteAssetHelper {  private static final String DATABASE_NAME = "parole.db"; private static final int DATABASE_VERSION = 1;  public MyDatabase(Context context) {     super(context, DATABASE_NAME, null, DATABASE_VERSION); }   }  i how i can use this for reading my database ?


is inline still necessary since compilers will do inline automatically

here is the code a1.cpp #include <stdio.h>  void func(void) {         printf("hello world\n"); }  int main() {          func();         return 0; }  here is the code a2.cpp #include <stdio.h>  inline void func(void) {         printf("hello world\n"); }  int main() {          func();         return 0; }  they are only different with the key word 'inline' then I compile them into assemble g++ -S a1.cpp g++ -S a2.cpp  the result is: inline does not work. function call remained in main. then I compile them with optimizer g++ -O2 -S a1.cpp g++ -O2 -S a2.cpp  the result is : inline works in a2.s, but a1.s also replace the function call. it seems inline was added automatically. so when inline is necessary when coding.


Irreducibility of polynomial $x^n+x+3$ for $n>1$

As a bonus question on a Galois Theory worksheet, there is the question: "Prove that $f(x)=x^n+x+3$ is irreducible in $\mathbb{Q}[x]$ for $n>1$ "   I know that I can prove this by simply showing that it is irreducible in $\mathbb{Z}[x]$ and using Gauss's Lemma, but I cannot simply prove this irreducibility by applying Eisenstein's Criterion. Also, I cannot see how you can prove this statement by induction.  What are the best strategies to solve this problem?


How to compare predicted accuracy and actual accuracy?

Consider a classifier that, given an input vector ${\bf x}$ outputs both a prediction $y'$ whose accuracy ($a \in \{0, 1\}$) can be measured, as well as a predicted accuracy that corresponds to the predicted probability ($p \in [0, 1]$) that the prediction is correct. The accuracy is computed w.r.t. to the known target value $y$, i.e., $a = 1$ if $y = y'$ and $0$ otherwise.  Ideally, the predicted accuracy represents $p(y = y' | {\bf x})$ with $y' = f({\bf x})$ and $f$ the function computed by the classifier.  My question is the following: Given $n$ predictions of the form $(a_i, p_i)$, how can i measure how well the classifier predicted its accuracy?  I can think of two ways to tackle this issue, but I wonder if these approaches are correct and if there are other established approaches out there.   Binning: By sorting predictions based on their $p_i$ value and splitting them into bins $B_j$, the true accuracy can be estimated as: $a_j = \sum_{(a_i, p_i) \in B_j} \frac{a_i}{|B_j|}$ and for every bin the accuracy $a_j$ can be compared to $\sum_{(a_i, p_i) \in B_j} \frac{p_i}{|B_j|}$, the average predicted accuracy. However, quite some information would be lost if not many predictions are available. Squared distance: $\sum_{i = 1}^n \frac{(a_i - p_i)^2}{n}$. By measuring the average squared distance between the accuracy per prediction to the predicted accuracy, a relative measure can be computed that is minimal if the true accuracy per prediction matches the predicted accuracy. It is nice that this method forgoes binning and works by considering predictions standalone but the result is a bit hard to interpret.


Minimal possible energy to make calculation

Are there any restrictions to energy that must be consumed to make calculations? Can calculations theoretically be done without consuming it?


Evaluate $\int_0^{\pi} e^{a\cos(t)}\cos(a\sin t)dt$

What is the value of $$\int_0^{\pi} e^{a\cos(t)}\cos(a\sin t)dt?$$


I have a table in which I use \numrange of the siunitx package.  I would like to center align that column at the range-phrase. If I align it left, it sort of works, but if I align it center, it is not good enough. How can I solve this?    \documentclass{book} \usepackage[T1]{fontenc} \usepackage{siunitx}    \begin{document} \begin{table} \caption{All measured and their estimated outcome variables during 30 minutes of chair exercises} \label{table:outcomes} \sisetup{ range-phrase = -- }  \begin{tabular}{                 l                 c                 c                 c                 %S[parse-numbers = false,input-decimal-markers={-},output-decimal-marker = \text{--}]                 S[table-format=3.1, table-text-alignment=center]                 }  \multicolumn{1}{l}{}& \multicolumn{1}{c}{Mean}& \multicolumn{1}{c}{SD}& \multicolumn{1}{c}{Median}& \multicolumn{1}{c}{Range}\ \hline   \%vo2max (mL/min) & 66.0 & 16.5 & 66.9 & \numrange{30.3}{115.8}\\    &&& 54.6 & \numrange{30.3}{77.7}\\   &&& 69.9 & \numrange{43.8}{115.8} \   \hline     \end{tabular} \end{table}  \end{document}


Python - Insert list of tuples into one column in SQLite

I've researched similar links, but still can't figure this out. Most of the other links are trying to insert into multiple rows or columns, but I need this list of tuples in one column.  word_in_python = cat listOfTuples = [('word1', 12), ('word2', 14), ('word3', 4), ('word5', 23)]   Here is my code:  conn = sqlite3.connect('mydb.db') c = conn.cursor() c.execute("INSERT OR IGNORE INTO saved_words (word, data) VALUES (?, ?)", (word_in_python, [listOfTuples])) conn.commit() conn.close()   I need the INSERT OR IGNORE because the word column is a unique column so duplicate words should not be entered into the db.   I've tried changing to:  c.execute("INSERT OR IGNORE INTO saved_words (word, data) VALUES (?, ?)", (word_in_python, (listOfTuples, )))  c.executemany("INSERT OR IGNORE INTO saved_words (word, data) VALUES (?, ?)", (word_in_python, [listOfTuples]))  for each in listOfTuples:   c.executemany("INSERT OR IGNORE INTO saved_words (word, data) VALUES (?, ?)", (word_in_python, (each[0], each[1]) ))   None of these work.   The error I am typically getting is:  Incorrect number of bindings supplied. The current statement uses 2, and there are 5 supplied.   I'm also confused by this error. I understand that (?, ?) in my execute line means I am trying to input 2 bindings. My list of tuples has 10 tuples in it, so I am not sure where the 5 supplied bindings are coming from.  Also, my saved_words table had the data column as type BLOB. I thought this would be best for inserting a list.  EDIT  What I want is word_in_python (cat) in one column and in the next column listOfTuples, this is all in one row.


I bought a book called Programming game AI by example and I am trying to implement the arrive steering behavior. The problem I am having is that my objects oscillate around the target position; after oscillating less and less for awhile they finally come to a stop at the target position. Does anyone have any idea why this oscillating behavior occur? Since the examples accompanying the book are written in C++ I had to rewrite the code into C#. Below is the relevant parts of the steering behavior:  private enum Deceleration {     Fast = 1,     Normal = 2,     Slow = 3 }  public MovingEntity Entity { get; private set; }  public Vector2 SteeringForce { get; private set; }  public Vector2 Target { get; set; }  public Vector2 Calculate() {     SteeringForce.Zero();      SteeringForce = SumForces();      SteeringForce.Truncate(Entity.MaxForce);      return SteeringForce; }  private Vector2 SumForces() {     Vector2 force = new Vector2();      if (Activated(BehaviorTypes.Arrive))     {         force += Arrive(Target, Deceleration.Slow);          if (!AccumulateForce(force))             return SteeringForce;     }      return SteeringForce; }  private Vector2 Arrive(Vector2 target, Deceleration deceleration) {     Vector2 toTarget = target - Entity.Position;      double distance = toTarget.Length();      if (distance > 0)     {         //because Deceleration is enumerated as an int, this value is required         //to provide fine tweaking of the deceleration..         double decelerationTweaker = 0.3;          double speed = distance / ((double)deceleration * decelerationTweaker);          speed = Math.Min(speed, Entity.MaxSpeed);          Vector2 desiredVelocity = toTarget * speed / distance;          return desiredVelocity - Entity.Velocity;     }      return new Vector2(); }  private bool AccumulateForce(Vector2 forceToAdd) {     double magnitudeRemaining = Entity.MaxForce - SteeringForce.Length();      if (magnitudeRemaining <= 0)         return false;      double magnitudeToAdd = forceToAdd.Length();      if (magnitudeToAdd > magnitudeRemaining)         magnitudeToAdd = magnitudeRemaining;      SteeringForce += Vector2.NormalizeRet(forceToAdd) * magnitudeToAdd;      return true; }   This is the update method of my objects:  public void Update(double deltaTime) {     Vector2 steeringForce = Steering.Calculate();      Vector2 acceleration = steeringForce / Mass;      Velocity = Velocity + acceleration * deltaTime;      Velocity.Truncate(MaxSpeed);      Position = Position + Velocity * deltaTime; }   If you want to see the problem with your own eyes you can download a minimal example .  Thanks in advance.


What does a Beholder see if they behold a Drunk Seer who gets drunk?

Mechanically, the Beholder takes a copy of their target's role (with some small exceptions, e.g. Bloodhound -> Seer) and then uses that copy to visit their target's target.  On any given night, the Drunk Seer has a certain chance to get drunk and forget their check. So... Does the beholder copy the Drunk Seer role? If so, do they get drunk if (and only if) the Drunk Seer gets drunk, or is the drunkenness independent?


What is butterfly lighting, and when do I use it?

I often hear the term 'Butterfly Lighting' used when discussing high-fashion and glamor photography. How do I set up Butterfly Lighting, and when do I use it?


I downloaded MikTeX and got TeXworks. I try to follow the manual and create an example document. But I get an error message in the "Console output" window: "Latexmk.exe: The Perl intetpreter could not be found."  Is this Perl interpreter something that I have to download separately? I thought everything would be included in the package. I have Windows.


Prove that sgn$(\sigma \tau) = $sgn$(\sigma)$sgn$(\tau)$

Prove that sign$(\sigma \tau)$ = sign$(\sigma)$sign$(\tau)$ for any permutations $\sigma, \tau \in S_n$.   I think the two thing's I'm trying to show are:   If sign$(\sigma)$ = sign$(\tau) = \pm 1 \implies$ sign$(\sigma \tau)$ = $1$ Wlog, if sign$(\sigma) = 1$, sign$(\tau) = - 1 \implies$ sign$(\sigma \tau)$ = $-1$   but I'm not sure how to start this. Can someone give me a hint?


I am trying to prove the following identity:  $$\sum_{k=0}^N\left({2 \, N - 2 \, k \choose N - k}{2 \, k \choose k}\right)=4^N$$  I have tried writing $4^N=2^{2N}=(1+1)^{2N}=(1+1)^N(1+1)^N$, and expanding each of these as a binomial expansion, but I have found nothing but dead ends so far. Any ideas?  I am currently working through a Ch. 3 "Generating Functions" from  Analysis of Algorithms by Sedgewick/Flajolet. This is problem #30.  Thanks.


As someone who has used C in the past and knows it fairly well, what is a good guide to the C++ Standard Library? I feel like I am aware of the new language features of C++ in comparison to C well enough, but as I understand it C++ is almost defined by the standard library (containers and the like).   I am not interested as much in template metaprogramming.  Online resource preferred.  Emphasis on container types.  What is a guide to using std:: objects?


Java Modulus Operator Not Working Correctly

I am writing a small program to give me the max amount of each coin category (quarters, dimes, etc) when I enter an amount. The modulus operator is not returning a correct value. For example, when I enter the amount "1.64", it should return: Quarters: 6, Dimes: 1, Nickels: 0, Pennies: 4.  But my problem is at pennies. It keeps returning 3 pennies only. Any input would be appreciated!  import java.util.Scanner;  public class Main{     public static void main(String args[]) {         Scanner in = new Scanner(System.in);         System.out.println("Enter amount: ");         double amount = in.nextDouble();          int quarters = (int)(amount / 0.25);         System.out.println("Quarters: " + quarters);          amount = (amount % 0.25);          int dimes = (int)(amount / 0.1);         System.out.println("Dimes: " + dimes);          amount = (amount % 0.1);          int nickels = (int)(amount / 0.05);         System.out.println("Nickels: " + nickels);          amount = (amount % 0.05);          int pennies = (int)(amount / 0.01);         System.out.println("Pennies: " + pennies);     } }   Enter amount:  1.64 Quarters: 6 Dimes: 1 Nickels: 0 Pennies: 3


N balls having M different colors in a box, how many times do I need to pick to get one particular color?

There are $N$ balls of $M$ different colors in a box i.e $c_1$ balls of color $1$ and so on. $c_1 + c_2 + \dots + c_M=N$, $c_1, c_2, \dots, c_M$ are known. We are looking for a ball of a particular color, say, $j$.The balls are picked from the box randomly, and if the color of the ball picked up say $i$ is such that, $i \ne j$, all the balls of color $i$ disappear. How many times do I need to pick to get a ball of color $j$ on average?


As linguistics student, I have to put more than one thing on a character every now and then. For example, I need to type ā̆. I thought I could simply do that by typing \={\u{a}}, but then the macron is placed above an empty space in front of the character.  How can I solve this? Thanks  P.S. I'm using MiKTeX 2.9, running on Windows 8; in case it might be of use.


Poem that Belle reads in Beauty and the Beast

After Belle reads the  in the 2017 Beauty and the Beast, she goes on to read a second poem with something along the lines of      For in that solemn silence is heard the whisper of every sleeping thing. Look, look at me, come wake me up for still here I'll be   or something like this at the end.  Was that also an existing poem or was that made specifically for the movie? In the former case, what poem was that and why was it chosen for this scene?


Prove the set $K = \{\frac{1}{n} \mid n\in \mathbb{N}\}\cup \{0\}$ is compact.  I have tried to write a proof for this fact. Please critique it.   Proof.  Let $\mathcal{G} = \{G_\alpha \mid \alpha \in A\}$ be any open cover for $K$. Since $\mathcal{G}$ is an open cover, we have $K\subseteq \bigcup_{\alpha\in A}{G_\alpha}$. Hence, $0\in K$ implies that there exists some $G_0 \in \mathcal{G}$ such that $0\in G_0$. Since $G_0$ is open, there exists $r>0$ such that $B_r(0) \subseteq G_0$. We know from previous results that $\frac{1}{n} \to 0$. Hence, $B_r(0)$ contains all but finitely many terms of $\frac{1}{n}$ and consequently, $G_0$ contains all but finitely many of these points. Let $N$ be such that $\frac{1}{n} \in G_0$ for all $n\geq N$. Then for each point $1,\frac{1}{2},\dots,\frac{1}{N-1}$ we can choose a corresponding open set $G_1,G_2,\dots,G_{N-1} \in \mathcal{G}$ that contains each point. Hence, $\{G_0,G_1,G_2,\dots\,G_{N-1}\}$ is a finite subcover for $K$.


In my toolbox doesn't exist any grass function, what act I should do?


Can I ignore the warning: "tests made without re-estimating 'theta'" from an analysis of deviance test of a negative binomial model?

I'm new to R and don't know how to deal with this warning I get while doing negative binomial log regression:  Warning in anova.negbin(nb.MouthOpen) : tests made without re-estimating 'theta'  Can I ignore this or does it have an effect on the results I get? The data are behavioral observations made by a 1-0 sample method and is then compared against a noseband tightness score. summary(nb.MouthOpen <- with(Noseband, glm.nb(cbind(MouthOpen, Totalscans-MouthOpen) ~                                                  TightnessNoseband)) anova(nb.MouthOpen) (est <- cbind(Estimate = coef(nb.MouthOpen), confint(nb.MouthOpen))) exp(est) deviance(nb.MouthOpen)