What properties are available to own in Grand Theft Auto V?

What properties are available to own in Grand Theft Auto V (not GTA Online) and how long before they become profitable?


Is there software on Macintosh for adding GPS data to RAW files?

I want to add GPS location to RAW photos (from my EOS7D) using location data from my iPhone 5. Aperture doesn't save the data I added unless I export the RAW files as JPEGs.  I've searched the site using "  edit EXIF" to no avail.


The WIFI option disappeared on my Macbook Unibody + Ubuntu 20.04.1. When I run "nm-applet" I see the available WIFI connections in Advanced Network Configuration but I see no way to activate it. This is a bug going back many years from what I read. Disappointing it's not fixed yet.


transpose columns to rows in a spreadsheet

I have a spreadsheet has one column as the following:              column A     1                  a 2                  b 3                  c 4                  d 5                  e   I want to save this spreadsheet and transpose the column by row as the following:  ID   column A column B column C column D column E 1           a        b        c        d        e   How can I do that?


Why does \usepackage[british]{babel} hyphenate the word "alternate" incorrectly?

Now I know there are hyphenation differences between British and American English but in no dictionary, British or American, could I find the word "alternate" to be broken down to al·tern·ate instead of al·ter·nate (). And yet:  \documentclass[a5paper]{article} \usepackage[british]{babel} \begin{document} alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate alternate \end{document}     If you remove the babel line or change it to american, the hyphenation will be correct:    So how does the British hyphenation work? Is it a complete reimplementation that can be buggy? Or is it just a list of exceptions where British syllabification differs from American? If it is the latter, why would a wrong hyphenation of "alternate" be made part of that word list?


When moving a selected vertx the whole cube moves

I'm trying to model a dino, but when I try to move a selected vertex the whole cube moves.


I'm composing a rather important letter and I am stuck and struggling on how to pose this question: I thought women were necessary to the...  ~vs~ I thought that women were necessary to the....


Prove that $\;\displaystyle\int_{0}^{a} \frac{\ln(1+ax)}{1+x^2}dx = \tan^{-1}(a)\ln(\sqrt{1+a^2})$  For $a=1$, this is Serret's integral. So I thought the self similar substitution $x \rightarrow \frac{1+x}{1-x}$ would help but it didn't.  I also applied integration by parts twice but it didn't help.


An empty set is always a subset of another set, but can it also be an element of a set too?

I know an empty set ∅ is defined as a set that has no elements and is also a subset of every set, but can you say that it is an element of another set? I think not, but I'm not comepletly sure.  For example, consider the statements below:  $∅ ∈ P(Z)$  $∅ ⊆ Z$  $∅ ⊆ P(Z)$  $∅ ∈ Z$  I think only the second and third are correct since an empty set is always a subset of another set, but the first and last I'm not sure about. Would they be true statements or no? Also how do power sets affect this?


I've been asking a lot of questions on Stack Overflow and recently one of my questions was down voted 3 times, after which I voluntarily closed it. Since then though, my questions seem to be getting hardly any views and no answers (when normally they are answered within moments).  I'm not sure what seems to be causing this but I'm wondering if I'm in some sort of hell ban or sin bin. Does Stack implement such a thing?


What is the evidence for Inflation of the early universe?

The theory of Inflation explains the apparent consistency of the universe by proposing that  the early universe grew exponentially for a 1E-36 seconds. Isn't a simpler explanation that the universe is just older and so the homogeneousness comes from a slower more steady growth? Is there any evidence that rules out a slow growing universe and supports Inflation theory?


I looked at a previous question  and I am still having trouble performing the upload. I have downloaded a file to my computer and I am looking to upload this to my server.  The file name is bomb.tar.  I went with:  scp bomb.tar tim@example.com:.    I am getting an error there is no such file or directory, is there more that I would need to add on to the file name?


I have this issues with my ubuntu apt-get update    ubilli@ubilli-pc ~> sudo apt-get update [sudo] password for ubilli: Ign http://ppa.launchpad.net precise InRelease                                 Ign http://ppa.launchpad.net precise InRelease                                 Ign http://ppa.launchpad.net precise InRelease   .     . . Ign http://ppa.launchpad.net precise/main Translation-en                       Hit http://us.archive.ubuntu.com saucy-updates/universe Translation-en         Fetched 459 kB in 25s (17.7 kB/s)                                               Reading package lists... Done W: GPG error: http://ppa.launchpad.net precise Release: The following signatures couldn\'t be verified because the public key is not available: NO_PUBKEY D1106511179518B2 W: There is no public key available for the following key IDs: 3B4FE6ACC0B21F32 W: There is no public key available for the following key IDs: 3B4FE6ACC0B21F32


Nothing shows up in the terminal when I type my password

When I'm about to install a program in the terminal it wants the password:  [sudo] password for xxx:   But when I start to type my password nothing happens. What should I do?


What exactly are the spikes, or peaks and valleys, caused by in pictures such as these    Wikipedia states that "From the point of view of magnetic energy, peaks and valleys are energetically favorable", but I'm not exactly sure what that means, or how it works. Why isn't the fluid just happy being attracted to the magnet in a semi-sphere shape? Could it be that it gains a magnetic charge, so it attempts to repel itself at the same time? Just pulling at straws here.


In World of Warcraft you can change between two specializations, is there something like this in SWTOR? As an example, can I play as bounty hunter mercenary arsenal , then switch to bodyguard?


I run a simple SQL query command though I want to know if it is possible to retrieve, in C#, the duration (the amount of time it took SQL to run the query) without having to look at the command through SQL profiler.


An Application: The Stone-Cech Compactification

If $X$ is completely regular, show that $X$ is open in $βΧ$ if and only if $X$ is locally  compact.


I'm having a bit of trouble imagining the time evolution of non-gaussian wavepackets. For a free particle, I usually imagine a diffusing gaussian (in both $x$ and $p$ where $<p>(t)=p_0$) with it's peak having a velocity $p_0/m$. I want to see some more variety of initial wavefunctions and their time evolutions such as a finite sum of these Gaussians with different $<p>$ or infinite superposition of these wavepackets. We can talk similarly for the hydrogen atom. Time evolution for the CoM frame as Gaussian(s) along with non-CoM states. I can only imagine if the overall wavefunction is like (diffusing Gaussian in $R$)$\times$(Superposition of bound states) i.e. separable wavefunction. I haven't seen many books talk about proper time evolution of hydrogen atom as whole (including CoM). Does anyone of you know of any resources such as animations/applets which show time evolution of probability distribution assuming some normalizable initial states? I think this is important to get an intuition for quantum mechanical treatment of particles.


How can I get a spiral like    There seems to be a spiral-like unicode codepoint:   I tried  \documentclass[varwidth=true, border=2pt]{standalone} \usepackage[ngerman]{babel}  \usepackage[utf8]{inputenc} % Color \usepackage{color} \definecolor{lightgray}{gray}{0.95}  \DeclareUnicodeCharacter{43612}{\spiral}  %document \begin{document}{\textcolor{lightgray}{a}}\spiral{\textcolor{lightgray}{b}} \end{document}   but I got  ! Undefined control sequence. l.13 ...document}{\textcolor{lightgray}{a}}\spiral                                               {\textcolor{lightgray}{b}}   edit: I know . None of the answers gave me a spiral symbol.


Convert unix timestamp to javascript date Object

Am working with json api that represents dates like this   "date" : "/Date(1356081900000)/"   I want to turn this into regular javascript Date.  The only way I can think of solving this problem is to do a replace on everything leaving the timestamp which I can then "convert".  This works but it just looks wrong.  My question. Can I do this in better way?  UPDATE   unix_timestamp = jsonDate.replace('/Date(', '').replace(')/', '');   newDate = new Date(+unix_timestamp + 1000*3600);


A stronger version of discrete "Liouville's theorem"

If a function $f : \mathbb Z\times \mathbb Z \rightarrow \mathbb{R}^{+} $ satisfies the following condition  $$\forall x, y \in \mathbb{Z}, f(x,y) = \dfrac{f(x + 1, y)+f(x, y + 1) + f(x - 1, y) +f(x, y - 1)}{4}$$  then is $f$ constant function?


Php code formatter / beautifier and php beautification in general

Do you know any good tools for nicely formatting messy php code? Preferably a script for Aptana/Eclipse, but a standalone tool will do too.


I understand that the HTTP protocol, especially of the secured type, secured with some data encryption method such as TLS and certified with some SSL certification, is the main way to transfer data in the world wide web.  Well, if so, Why are post, get and put needed on top of HTTPS protocol?:   Why acting by the HTTP(S) protocol isn't enough for requesting and serving data and another layer is needed on top of that as I described? Why, when we or others (say, a program) interact with a webserver, the data is both requested and served (if at all) in different methods such as post, get and put (and maybe also delete?) on top of HTTPS protocol?   An answer will let me better maintain my websites in general.


Does the series $\sum_{1}^{\infty}\big[1 + n\ln\big(\frac{2n-1}{2n+1}\big) \big]$ converge?

As title says, does the following series converge? $$\sum_{1}^{\infty}\big[1 + n\ln\big(\frac{2n-1}{2n+1}\big) \big]$$ It is supposed to converge but I don't know how. My attempt: $$\sum_{1}^{\infty}\big[1 + n\ln\big(\frac{2n-1}{2n+1}\big) \big] = \sum_{1}^{\infty}a_n,$$ where \begin{align} a_n &= \big[1 + n\ln\big(\frac{2n-1}{2n+1}\big) \big] \\     &= 1 + n\big[\ln(2n-1) - \ln(2n+1)\big].  \end{align} I couldn't come up with any good convergence tests and started listing out a few terms: $a_1 = 1 + 1\ln(1) - 1\ln(3)$, $a_2 = 1 + 2\ln(3) - 2\ln(5)$, $a_3 = 1 + 3\ln(5) -3\ln(7)$, and so on. Since some terms cancel, I think for the $N$-th partial sum, we have: \begin{align} \sum_{1}^{N}a_n &= N + \ln(2N-1) - N\ln(2N+1) \\                 &= N + \ln\frac{2N-1}{(2N+1)^N} \end{align} At this point, I can only see divergence as $N \rightarrow \infty$. What am I doing wrong? How can I correctly test for convergence in this case?


This needs to be reprinted vs. this needs reprinted

What is the difference between using:    this needs to be fixed; and this needs fixed   Can they be used interchangeably? Is the second one grammatically correct?


Per-site "hot meta questions" are still hot after being deleted

I often click on the questions in the "Hot Meta Posts" section of the sidebar. Today when I clicked on one of the questions I noticed that it had already been deleted.     I view this as a bug, though you could also view it as a feature request I suppose. I do not think that a deleted Meta question should still be considered "hot".


I've just download and installed the latest version of CentOS inside a VirtualBox VM. Installation went OK, but when I start the VM and log in, if I try and ping anything I get an error due to lack of network interface.  if I try and issue the ifup eth0 command, I'm told      network is unreachable   . If I list the network interfaces using ip link show the interfaces that are listed are:  lo enp0s3   I know what the loopback interface is for, but what is the latter? I was expecting eth0 or wlan0.  Inside virtual box I've set my network adapter to NAT, Bridged and Host Only but it makes no difference to the resultant Linux machine  As you can guess, I'm a tad new to all this, so any help on getting networking working inside my VM is appreciated.  Many thanks  ****edit**: so now I know the new (rather confusing) naming convention, thats good. Been a while since i used Linux. I followed this guide:  but when I run service network restart it fails. Looking at the log it says:  Failed to start LSB: Bring up/down networking.   **


Let a be a nonzero integer, $m>n>0, m,n\in \mathbb{Z}$.   (1)Prove that $\gcd(a^{2^m}+1, a^{2^n}+1)$ is either $1$ or $2$.  (2)Use this fact to prove that there are infinite number of primes.  My attempt on (1): the problem can be splitted into two cases.  If $a$ is an even number, then we only need to prove $\gcd(a^{2^m}+1,a^{2^n}+1)$ equals $1$ since odd numbers cannot have $2$ as divisor.  If $a$ is an odd number, then we only need to prove $\gcd(a^{2^m}+1, a^{2^n}+1)$ equals $2$ since $a^{2^m}+1$ and $a^{2^n}+1$ are both even.  Any hints would be appreciated!


Why can't two electrical field lines intersect each other?

I know the textbook answer that the tangent to field line give the direction of electric field and intersection of two field lines would mean two directions of electric field which is not possible, but why not!?. Electric field at a point tells the direction of 'force' at that point. Well force! When force on a object is applied in more than 1 directions we take the vector sum of the forces. Similarly if forces(electrical) with different directions were acting on a charge kept in an electric field we could take the vector sum of the forces and we would get the directon of resultant force(or resultant field)   P. S. : I know, i  sound totally stupid but this thought is not letting me live in peace. I totally agree that I could be horribly wrong. Even if i am please be generous enough to explain in detail.  Thank you


There is a  suitable for sourcing, which I am modifying for my own purposes.    Background  I have an odd mix of environments to work in, from a Mac OS terminal, to various Linux distributions, and even to a MobaXterm on my Windows work laptop.  I'd like to get the color codes to a maximum portability for these environments  In MobaXterm, tput setaf 2 (for example) doesn't work at all—it just says "Segmentation fault," though I see no ill effects.  Likewise, echo '\e[4;32m' doesn't work either; it just displays those literal characters.  (This is likely because it is BusyBox echo.)  printf '\e[4;32m' works, though.    The question:  Is there any reason not to use printf in place of tput in all cases?  Or put another way:  Is there any environment (or OS or shell) in which printf WON'T work to set terminal colors, but tput WILL?


Why do I need __init__.py at every level?

Given that I have the following directory structure with . being the current working directory  . \---foo     \---bar         \---__init__.py         \---baz.py   When I run python -c "import foo.bar.baz" I get  Traceback (most recent call last):   File "<string>", line 1 ImportError: No module named foo.bar.baz   If I echo "" > foo/__init__.py, the above command works.  Am I doing something wrong or do I  misunderstand the point of __init__.py?  I thought it was to stop modules existing where they shouldn't, e.g. a directory named string, but if you replace foo with string in my example, I'm seemingly forced to create the module that should never be used, just so I can reference a file deeper in the hierarchy.  Update  I'm working with a build system that's generating the __init__.py's for me and is enforcing the directory structure and while I could mess with the hierarchy, I'd prefer to just add the __init__.py myself. To change the question slightly, why do I need a python package at every level instead of just at the top? Is it just a rule that you can only import modules from the python path or from a chain of packages off of the python path?


Need mathematical equivalent of this excel formula PMT()

I need help with the math equivalent for excel formula PMT(). There is an answer @ below thread... BUT nothing is mentioned with regards to the option parameters of PMT() i.e. FV and Type. Can anyone please guide with math equivalent with FV?


Missing ProfileImageUrl for many profiles in StackOverflow data dump

I noticed that in the StackOverflow data dump many profiles miss the ProfileImageUrl column. What is the reason for this, because I could still get this data by scraping all profiles that I am interested in, but I guess that is not something StackExchange would want me to do (and it also takes a lot of time, which the data dump could have reduced drastically...)? EDIT: See this query of my profile on StackOverflow:  EDIT2: In case some troll edits that query: SELECT ProfileImageUrl FROM Users WHERE DisplayName = 'jabbink'  Result: empty


Java Program Complexity with loops, which is the better way to solve?

The following sequence has to be printed.    12345   2345   345   45   5     This can be done using one loops or two loops, but surprisingly when I use two loops, it takes a lot more time.  Here is what I have done. One loop way: //Prints are commented so that outputs are easily visible public void generateSequence1(int num){         long timeStarted = System.currentTimeMillis();         for(int j = 1, i= 1; i<=num && j<= num; ){             i++; //            System.out.print(i++);             if(i==num+1){                 i = ++j; //                System.out.println();             }          }         System.out.println("Using 1 loop, time taken: " + (System.currentTimeMillis() - timeStarted));     }  Here is the Two loop way public void generateSequencePlainWay(int num){         long timeStarted = System.currentTimeMillis();         for(int i = 1; i<= num; i++){             for(int j = i;j <= num; j++){ //                System.out.print(j);             } //            System.out.println();         }         System.out.println("Using 2 loop, time taken: " + (System.currentTimeMillis() - timeStarted));     }  Now when I call the methods TestConducts tc = new TestConducts();         tc.generateSequencePlainWay(50000);         tc.generateSequence1(50000);  The output is as follows.(I fluctuates a bit each time, but almost the same)  Using 2 loop, time taken: 668 Using 1 loop, time taken: 7  Both these methods have n*(n-1)/2 operations. Then why such a huge time difference? Am I doing something wrong? Or this is the way it should be?And which way is better?


How to find the date Ubuntu was installed?

I'd like to find out (ideally via terminal) how long my operating system (Ubuntu 12.04 LTS) has been installed - either that or the date on which the installation took place. Is this possible? If so, how can it be accomplished?


Homomorphisms from $\mathbb{Z} \rightarrow S_3$.

I recently had my second abstract algebra exam returned to me and I missed this particular question (unfortunately I left the problem blank, just a bad test day). I've been trying to figure out the problem though and could use some help.  a) Does there exist a surjective homomphism $\phi: \mathbb{Z} \rightarrow S_3$? Explain.  What I'm thinking: Let $\phi: \mathbb{Z} \rightarrow S_3$ be a homomorphism.$\mathbb{Z}$ is a cyclic group and thus $\phi(\mathbb{Z})$ is cyclic. However, $S_3$ is not cyclic. Thus $\phi(\mathbb{Z}) \neq S_3$ and $\phi$ cannot be surjective.  b) Assume that there exist homomorphisms $\phi: \mathbb{Z} \rightarrow S_3$ where Ker$(\phi) \neq \mathbb{Z}$. What are the possible kernels? Explain.  What I'm thinking: Since $1$ generates $\mathbb{Z}$, if $1\in$ Ker$(\phi)$, then $\mathbb{Z}=$Ker$(\phi)$. So could Ker$(\phi)$ = $n\mathbb{Z}$ for $n \in \mathbb{Z},  \; n\neq1$?  c)List at least two non-trivial homomorphisms $\phi: \mathbb{Z} \rightarrow S_3$ whose kernals are not $\mathbb{Z}$.  $\phi_1(n) = (1\; 2)^n$  $\phi_2(n) = (1\; 3)^n$  Any input is much appreciated!


Say you have the half-plane $\{z\in\mathbb{C}:\Re(z)>0\}$. Is there a rigorous explanation why the transformation $w=\dfrac{z-1}{z+1}$ maps the half plane onto $|w|<1$?


How do I opt out the Apple iOS beta program?

I am using the latest iOS (as of Nov 21, 2020), it's 14.2 (stable version). But the beta upgrade keeps poping out asking me to download it. It's really annoying. How do I opt this out on my iPhone? Thanks,


Ok, so the error message that is displayed on my cameras is "Err 01 Comunications between the camera and lens is faulty. Clean the lens contacts"   Gear:   Canon 7D Mark II (Brand new, have it for like 3 days now, latest firmware) Canon 700D (2 years old, latest firmware) Canon EF-S 17-55mm f2.8 IS USM (2 years old, no more warranty!)   When the problem/error happens Both of my cameras show this error only when I increase the aperture higher than f/2.8 and zoom the lens... if the aperture is at f/2.8 it works normally on any focal range. The lens also works if the aperture is set to a higher f-number but is at its widest focal length (17mm) but when I zoom in I get this error...  Note: I did try other lenses and they work just fine so it's not the cameras that are broken...   What I did to resolve the issue I went and googled the issue and didn't get any useful information on how to resolve this, there were some DIY videos but I'm not going to dissasemble my lens... I'll leave this task to the professionals... Yes, I did also clean the lens contacts...  So what I'm asking is: Has anyone had any simmilar issues or issue like this with this lens and does anyone know perhaps what's wrong with the lens and is it worth it to get it repaired and what would be the estimated price of the repair?


Very detailed Tellraw command that i need help with

Okay so im making an adventure map and i have a command block that will say when someone has found mining supplies and then you will have to click where it says here to receive some of it. The thing is it just says like error on line 323 unterminated character or something. Also i cant type the command cuz i broke to block so here is a picture of the text


Prove the set of all infinite binary sequences is uncountable by using Cantor's theorem.

This is different then the other versions of the questions here. I'm not supposed to use the diagonal argument. I'm looking to write a proof based on Cantor's theorem, and power sets.


I'm trying to figure out how best to add scale bars to my images, such as in these wondeful snowflake images (the full size image is a bit large, but it's the best example of what I'm trying to do):    One possibility would be to insert the scale bars using a different program. However, I want to ensure the text is nice and crisp, rather than having it saved as part of a raster image. Also, if I insert the scale bars beforehand, then the text will get resized when LaTeX scales the images.  So far I haven't been able to find any existing commands or packages that make this easy to do. I would like to be able to specify the real world size of the image, and have the size of the scale bar be calculated.  If I have to write my own macro, I think I'll start with the   Am I headed in the right direction?  EDIT 2:  After familiarizing myself with TikZ, here is the macro I've come up with:  \usepackage{tikz} \usepackage{siunitx}  % Inserts a scale bar into an image % Optional argument 1: the colour of the bar and text % Argument 2: an \includegraphics command % Argument 3: the real world width of the image % Argument 4: the length of the scale bar % Argument 5: the units in which the scale bar is measured \newcommand{\scalebar}[5][white]{  \begin{tikzpicture}   \draw (0,0) node[anchor=south west,inner sep=0] (image) { #2 };   \begin{scope}[x={(image.south east)},y={(image.north west)}]    \fill [#1] (0.05,0.2cm) rectangle (#4/#3+0.05,0.4cm);    \draw [#1] (0.05,0.4cm) node[anchor=south west] { \SI{#4}{#5} };   \end{scope}  \end{tikzpicture} }   I'm using a combination of units here (cm and fractions of the image size). I feel like this aspect could be a bit more elegant, but what I have now is sufficent for my purposes.


Run a command before & after ubuntu apt upgrade & unattended-upgrades

On an Ubuntu 16.04.3 LTS server I run some process monitors, but I also run apt manually as well as unattended-upgrades for security updates.  This sometimes causes the monitors to report and act on programs that were stopped by apt during apt upgrade.  Is there a way to run a command when unattended-upgrades/apt starts the upgrades (to stop the monitors) and again when unattended-upgrades/apt finishes (to restart the monitors)?  I found APT::Update::Pre-Invoke and APT::Update::Post-Invoke hooks but the apt update step is not the problem, and apt itself does not seem to have any pre/post upgrade hooks.


\subtitle doesn't work in article document class

I'm relatively new to TeX but until now I used mostly the beamer class. There I did this:  \documentclass{beamer}   \title{title}   \subtitle{subtitle}   \author{name}   \date{\today} \begin{document}     %content \end{document}   And it worked as I would expect but when I use the article class the subtitle does not work.  So it seems that a) I got something wrong or b) it's not the right document class. So I ask you guys:  How do I use a subtitle in the article class?  or   Which document class should I use for my document? I'm attempting to write a document with 50 to 100 pages. It will be a documentation for a programming project so it will contain code snippets and diagrams.


How does the clean Installation of Windows 10 after the free upgrade work?

I have not found any information from MS - only speculations from people like me, so I hope someone here has had better findings.  When I upgrade a qualified version of Windows to Windows 10 and then want to do a clean install, I've heard that the installer won't ask for a key. But what if my HDD is formatted before I attempt the clean install? How does Windows 10 try to detect the valid "upgraded" status? It seems that it doesn't in such a case, at least as far as I've tested.  So my question is: In that (or a similar) scenario: How do you clean install Windows 10?  In my case it's actually even more complicated. I'm from Germany so I can re-use OEM-licenses due to law. I have two qualified Windows OEM licenses which I both installed in a VM on my Linux installation and upgraded both to Windows 10.  Now I want to install one of them onto my bare physical machine - how would that be possible? Is there an official way of doing this or do I need to wait for those unofficial "backup license"-tools being updated to work with Windows 10?


I had my websites load over insecure HTTP () and after going through all the experts' blabbering about how it's better to have sites load over HTTPS I set them all up to use SSL and redirected (301) everything from HTTP to HTTPS version as all experts claim having both HTTP and HTTPS versions basically equals to content duplication and is bad.  I also created a 2nd GWT property for each site since big daddy G. thinks changing the protocol is basically a change of website address (sic).  This all happened about 3 months ago.  Now lots of the links I had (visible in GWT) are gone, sites lost significant ranking, traffic plunged and so did sales.  Should I still hope/expect recovery, or should I switch back, or should I keep promoting the HTTPS version(s)?


Single Quotes Versus Double Quotes In Arrays

I do not have a problem, simply a question.  I am doing a Codecademy Tutorial using arrays and objects.   In the array, I have the various parts of an address including:  address: ["236 Apple Lane", "San Jose", "California", "95119"]   But if I change the code to a single quote like:  address: ['236 Apple Lane', 'San Jose', 'California', '95119']   It still works, AND, is actually part of the "Tip" in sorts that you should follow. I'm confused that both work. Are both correct? Or is one more preferred than the other in arrays?  Codecademy is flawed in sorts and I'd like to get a professionals opinion. I love this forum and it's inhabitants so I look forward to hearing your response. Thank you for taking the time to read this message and have a wonderful Tuesday!


RegEx to detect syntactically correct URL

I use Asp.net 4 and C# Web Forms.  In my Web Application Users can add URLS using a TextBox.  I need to make sure that every value inserted has a syntactically correct URL format (I do not need to check if the URL really exists).  So as first rule I would like check using a CustomValidator Control if the Input inserted by the User has the value string "http://" at the beginning.  My questions?   Are you able to provide me a RegEx to add to my CustomValidator Control that will let to pass only string beginning with "http://"? Do you have any other rule using RegEx to suggest me? What is you best practice to detect detect syntactically correct URL?   Thanks for your help


How to find cyclic subgroups of $S_4$ with certain numbers of elements

In the group $S_n$ consisting of the set of all bijections from $\{1,2,...,n\}$ to $\{1,2,...,n\}$ with a binary operation $◦$ denoting composition of functions. I am asked to find cyclic subgroups of $S_4$ with 2,3, and 4 elements. For a cyclic subgroup with 2 elements I have $\{(1,3),(2,4),(3,1),(4,2)\}$, but am looking for help in finding cyclic subgroups of larger sizes.


How to make authentic black Russian bread?

I'm trying to re-create the authentic black Russian bread that was first mass produced during soviet times. Nowadays you can find it in any Russian market and many international supermarkets in the US. The problem is most recipes I can find online either:  Use a lot of additives such as cacao powder and coffee to color the bread, which don't seem historically plausible  or  Don't achieve nearly the same dark shade as the pre-packaged store variants  Anecdotally, my dad claims that this bread was sold in the Soviet Union in his youth as the cheapest bread available, for those who couldn't afford bread made from finely milled wheat. At its initial inception it was mass produced by the state and supposedly didn't taste great (although it did have that dark black color). Considering it was the cheapest bread around, it seems highly unlikely it was created with cacao or espresso powder in soviet times. Eventually, people started prizing this bread more and recipes evolved until we got the modern variant which most people (at least in Russia) find appetizing. It's possible the modern variant uses the more expensive color impacting ingredients, but it seems more likely that some trick that was used to make the original "dirt cheap" black bread is still employed or borrowed from today. I’ve made a number of different variants following the recipes online and overall I’m happy with the results in terms of taste, but it’s driving me crazy that I can’t figure out how to make the loaf authentically black.


I got a really big logcat (since 2016) and I'm interested in printing everything (all the rows) after a point (let's say, September). The logcat is really big, so I can't really use tail.


I was trying out the stopwatch class in  . I'm using Eclipse, and here are the things I've done-  Here's the code -  public class HelloWorld {      public static void main(String[] args) {         // TODO Auto-generated method stub         int n = Integer.parseInt(args[0]);          // sum of square roots of integers from 1 to n using Math.sqrt(x).         Stopwatch timer1 = new Stopwatch();         double sum1 = 0.0;         for (int i = 1; i <= n; i++) {             sum1 += Math.sqrt(i);         }         double time1 = timer1.elapsedTime();         StdOut.printf("%e (%.2f seconds)\n", sum1, time1);          // sum of square roots of integers from 1 to n using Math.pow(x, 0.5).         Stopwatch timer2 = new Stopwatch();         double sum2 = 0.0;         for (int i = 1; i <= n; i++) {             sum2 += Math.pow(i, 0.5);         }         double time2 = timer2.elapsedTime();         StdOut.printf("%e (%.2f seconds)\n", sum2, time2);     }  }   I've added external JAR stdlib to the Java buildpath  However, when I run it, I still get the error-     Could someone please help me out and tell me what I'm doing wrong?


Recover 1TB disk erased with startup disk creator

Hello. I was trying to make a bootable flash drive from the startup disk creator, and when I went to erase the flash drive I accidentally erased the wrong drive, a 1TB removable drive. The operation took less than a second and gave no warning. I tried erasing the flash drive and it took about a minute, but it took but a second to erase the 1 TB drive, which is very surprising.  Please help, Gabriel


What is the homeomorphism between a disk and an ellipse?

A disk/circle is defined by   $$C = \{(x,y) \in \mathbb{R^2} : x^2 + y^2 \leq r^2\}$$  An ellipse is defined by  $$E = \{(x,y) \in \mathbb{R^2}: x^2/a^2 + y^2/b^2 \leq 1 \}$$  How can we define a function that takes $C$ to $E$?


What is the term for when you become more aware of something?

For example, when you buy a car, you start becoming more aware of cars with a similar make and model. The number of that type of car hasn't increased, but your awareness of it has.  Similarly, when you learn a new word, you start hearing the same word used in different places. You probably just filtered the word out previously, but now you've become aware of it.   How do you describe the phenomenon when you become more aware of something after an initial or significant exposure or experience with that thing? What term or word can you use?


Yearling badge awarded to the same user in two days

Today I've earned the "Yearling" badge. When I'm checking the other users who are all received the same badge in the , there I can see a strange behaviour.  For the user , the Yearling badge was awarderd two times in two days. The first one was awarded on 2019-12-19 16:50:12Z and the second one was awarded on 2019-12-20 10:20:09Z. When clicking on the both links, it is redirecting to the same user profile.  What is the reason behind that?  Screenshot for reference:


Why would you precede the main() function in C with a data type?

Many are familiar with the hello world program in C:  #include <stdio.h>  main () {     printf ("hello world");     return 0; }   Why do some precede the main() function with int as in:  int main()   Also, I've seen the word void entered inside the () as in:  int main(void)   It seems like extra typing for nothing, but maybe it's a best practice that pays dividends in other situations?  Also, why precede main() with an int if you're returning a character string? If anything, one would expect:  char main(void)   I'm also foggy about why we return 0 at the end of the function.


Error message: There's no line here to end

In a letter-class document that had no previous errors I am suddenly getting the error message:  "There's no line here to end" \opening{text}   I've used this file many times and today it starts giving this error. How do I troubleshoot this?


Why mutations in genes involved in general processes like DNA repair increase the risk of developing specific types of cancer?

For example, mutation in MHS2, which encodes a protein involved in the repair of mismatches that occur during DNA replication, dramatically increases the risk of developing colon cancer. (There are many other examples, like the RB gene which encodes a tumor supressor protein and is correlated to retinoblastoma, thus its name)  My question is: how a gene like MHS2 which participates in a general mechanism of DNA repair increases the risk of a specific type of cancer? Why doesn't it increase the risk of developing cancer in other tissues as well?


Prove that $\,C^1 \subset H_1 \subset H_\mu\,$ (Hölder Space)

I need to prove that continuously differentiable functions on $\,\left[a,b\right]\,$ are a subset of Hölder space of order $1$ and that the Hölder space of order $1$ is a subset of the Hölder space of order $\mu$, $\;0 < \mu < 1,\,$ i.e.  $\,C^1 \subset H_1 \subset H_\mu$.  Can anyone point me in the direction of a book or a theorem that proves this?


I have a SSD as a primary hard drive, and one HDD for storage. I want the recycling bin to be on the HDD. I want is so that even if I delete files from the SSD the end up on the HDD's recycling bin. What is the proper way of going about this?


I have the file:  key value  blah blah blah blah blahblah man1 boy1 blah blah man1 boy2 man1 boy1   I  do this to remove duplicate lines:  awk '/man1/ { print $1,$2} ' file | awk '!x[$0]++'   and the command take the first line and ignore other lines  man1 boy1  man1 boy2   but I want to ignore all lines except the last line:  man1 boy2  man1 boy1   as ramesh said I want something like:  cat filename blah blah blah blah blahblah man1 boy1 blah blah man1 boy2 man1 boy1 man1 boy2 man1 boy3 man1 boy4 man1 boy2   the desired output   man1 boy1 man1 boy3 man1 boy4 man1 boy2


My professor was lecturing today and he made this statement which I was unable to verify.  (I worded it nicer)  There is no map which is both smooth and onto from $S^1$ to $S^1$$\times$ $S^1$.  When he said this he included the original "one can clearly see" statement which is usually when the most people seem to be confused in his class.  Thus, I was hesitant to ask why.  So, please no one lecture me on the fact that I should have asked anyway.  If it is really that obvious, I would rather look stupid here than in class :)


I have to set JAVA_HOME on /usr/lib/jvm/java-8-oracle or /usr/lib/jvm/java-8-oracle/bin/??


Blender not exporting one specific material, but all the other ones

When i export this model to an .fbx file, the brick wall texture isnt being exported, while all the other textures are(graffiti, vines, etc.


Using Vieta's theorem for cubic equations to derive the cubic discriminant

Background:  Vieta's Theorem for cubic equations says that if a cubic equation $x^3 + px^2 + qx + r = 0$ has three different roots $x_1, x_2, x_3$, then  $$\begin{eqnarray*} -p &=& x_1 + x_2 + x_3 \\ q &=& x_1x_2 + x_1x_3 + x_2x_3 \\ -r &=& x_1x_2x_3 \end{eqnarray*}$$  The exercise is:     A cubic equation $x^3 + px^2 + qx + r = 0$ has three different roots $x_1, x_2, x_3$. Find $(x_1 - x_2)^2 (x_2 - x_3)^2 (x_1 - x_3)^2$ as an expression containing $p, q, r$.   Spoiler alert: the answer is $-4p^3r - 4q^3 + p^2q - 27r^2 - 18pqr$.  My question is: how am I supposed to find that without using a computer?


field collection - taxonomy term can't display

I used taxonomy term with field collection and taxonomy term can't display  look this video


Why is "Where have you been yesterday?" wrong?

Where [have you been/were you] yesterday?   If I choose the option "Where have you been yesterday?" then my answer was marked wrong and were you is considered as correct one. But have you been does make sense because its the action of just recent past so using present perfect here sounds fine to me.   Suggestions please.


Is the electromagnetic spectrum bounded somehow?

Is there a maximum frequency that an electromagnetic wave can support?


I received an assigment to hack a given website using sql injection  $sel1 = mysql_query ("SELECT ID, name, locale, lastlogin, gender, FROM USERS_TABLE WHERE (name = ’$user’ OR email = ’$user’) AND pass = ’$pass’");  $chk = mysql_fetch_array($sel1);  if (found one record) then {allow the user to login}   The question is which values of $user and $password should I enter to hack the website?  I've tried putting a true value in user (eg: admin) and for the $password I tried using (" or ""=")-no brackets which didn't work. I also tried (' or ''=')-no brackets  This looks quite simple, am I missing something?


Prime ideal splitting in field extension and its normal closure

The question is:  Let L / K be a finite (not necessarily Galois) extension of algebraic number fields and N / K the normal closure of L / K. Show that a prime ideal p of K is totally split in L if and only if it is totally split in N. Hint: Use the double coset decomposition H\G/GP, where G = G(N/K), H = G(N/L) and GP , is the decomposition group of a prime ideal P over p.  My question is how to use this hint to solve this problem; please give me some advice.


How we can show every permutation is either even or odd,but not both......I can't arrive at a proof for this ..... Can anybody give me the proof...  Thanks in advance...


Does cooking one month expired canned goods render it edible?

Sometimes when preparing to eat canned goods, I realized that it has already expired. I am hesitant to throw it away because it may still be edible.  Question: Does cooking expired canned goods make them edible? Assume that it expired no more than one month ago. Some say yes, because it only affects the quality of the product. Some says no, because it is very dangerous and not worth risking.  I want to hear this from experts. :)


How do I make a draft post accessible to everyone?

I have several unpublished posts in my Wordpress website and I am trying to make it accessible for normal users (who are not logged in) using the normal post slugs (site.com/post-here). I understand it may not be the best practice but for my special purpose, this needs to be done.  I have tried adding the following code snippet into my functions.php file:  function enable_view_drafts() { $role = get_role( 'subscriber' );  $role->add_cap( 'read_private_posts' );  $role->add_cap( 'edit_posts' ); } add_action( 'after_setup_theme', 'enable_view_drafts');   I've also tried init hook instead of after_setup_theme. No luck.  My understanding is that changes to roles are saved to the database so only need to be done once. That is why I'm using after_setup_theme hook to call the function.  But when I try to access the page as a normal user, I'm being shown a 404 page instead of showing the post content. I've also tried loading the preview URL (site.com/?p=212&preview=true) but that didn't work either.  These are my guesses:   the normal user doesn't have enough caps to read the drafts post. testing and viewing draft posts on the front-end is not possible for any users (including administrators).   What changes do I have to make in order to accomplish what I'm trying to do? If it's not possible, what alternative solutions do you suggest?  Note: I'm not looking for plugin-based solutions.


Okay, so I'm making a sell shop in Minecraft using commands, but I need to know, how do I get different types of logs using the command?  /testfor @p {Inventory:[{id:"minecraft:log",Count:32b}]}  I've tried doing log:2 and all that, and I can't find anything online. Could someone please help?


Use quotation marks after "that which is called" and similar phrases?

The solution is to foo, producing what is called a bar.   or     The solution is to foo, producing what is called a "bar".   Should I use generally use one over the other; and if so, which one? If either is acceptable, then which style guides (if any) have an explicit preference?


Poor Query performance when scalar variables used in Query

Facing a strange issue that a query runs incredibly slow (worse) when scalar variables are used as parameter.  Actual Query (Faster) - 9 secs  select   sum(v.sale_value) as col_0_0_,   sum(v.vat_value)  as col_1_0_,   sum(v.sale_fcy)   as col_2_0_,   sum(v.vat_fcy)    as col_3_0_ from my_view v where v.company_id = 1 and v.filing_year = 2018 and v.filing_month = 1;   Parameterized Query (Worse) - 16 mins  DECLARE @P0 int, @P1 int, @P2 int; SET @P0 = 1; SET @P1 = 2018; SET @P2 = 1; select   sum(v.sale_value) as col_0_0_,   sum(v.vat_value)  as col_1_0_,   sum(v.sale_fcy)   as col_2_0_,   sum(v.vat_fcy)    as col_3_0_ from my_view v where v.company_id = @P0 and v.filing_year = @P1 and v.filing_month = @P2;   Execution times for both queries were calculated by executing in command line client (IntelliJ Database console).  Query with this scalar variable is generated by our Hibernate Application as we've used setParameter(String name, Object value) to set the param values.  First, we suspected issue in hibernate generated query, but narrowed down to SQL Server query execution after identifying it as parameterized query using sys.dm_exec_cached_plans. Does query optimiser get confused when scalar variables are used?  In java code, we're setting the values as query parameters. In sys.dm_exec_cached_plans, the actual query is:  (@P0 int,@P1 int,@P2 int)select <columns> from my_view v where v.company_id= @P0 and v.filing_year= @P1 and v.filing_month= @P2   Note: my_view is pretty complex (nested views, group by, joins, order by, where clause...). We tried to compare the execution plans, but they're incredibly huge We are looking into it but might take some time.  If I run the slow query with OPTION (RECOMPILE), it executes in 9 secs.  SQL Server Version  Microsoft SQL Server 2012 - 11.0.2100.60 (X64)      Feb 10 2012 19:39:15      Copyright (c) Microsoft Corporation     Express Edition (64-bit) on Windows NT 6.2 <X64> (Build 9200: ) (Hypervisor)


Proof for the limit of the following convergent sequence

I have a convergent sequence, {${a_n}$}$_{n\in\Bbb{N}}$. The sequence is of positive numbers and has a limit, $L$. I must prove that $\lim_{n\to\infty}s_n=L$, where $s_n=\frac{a_1+a_2+a_3+...+a_n}{n}$, using the definition of convergence. I thought it was noteworthy that $s_n=\frac{\sum{a_n}}{n}$, though I am unsure as to how this would help me. It would be great if anyone had any hints in regards to how to solve this as I would like to give it a good go, though I am just struggling with starting it. Thank you in advance!


How to solve the determinant matrix with words using python? there are how solve using the word x in python?

How do I solve the determinant of this matrix using python?  there are how solve using the word x in python?  p = np.array([[x, 1],               [1, x]])


Problem Let $f(x)$ be twice-differentiable over $[-2,2]$, $|f(x)|\leq 1$ and $f^2(0)+[f'(0)]^2=4.$ Prove that $\exists \xi \in (-2,2):f(\xi)+f''(\xi)=0.$ My Proof First，by Lagrange' Mean Value Theorem，we have $$\exists \xi_1 \in (-2,0),\xi_2 \in (0,2):f'(\xi_1)=\frac{f(0)-f(-2)}{2},f'(\xi_2)=\frac{f(2)-f(0)}{2}.$$ Thus $$|f'(\xi)|\leq \frac{|f(0)|+|f(-2)|}{2}\leq \frac{1+1}{2}=1,$$ and likewise $$|f'(\xi_2)|\leq 1.$$ Denote$$F(x):=f^2(x)+[f'(x)]^2.$$ It's easy to verify that $F(x)$ is continuous and differentiable over $[\xi_1,\xi_2]$. Therefore, $F(x)$ can reach its maximum value over the interval above. But $$F(\xi_1)\leq 1+f'^2(\xi_1)\leq 2<F(0),$$ and similarily $$F(\xi_2)\leq 2<F(0),$$ the maximum value can not come out at the end points of the interval.Hence, it must be taken over $(\xi_1,\xi_2)$. Let the point be $x=\xi\in(\xi_1,\xi_2)\subset (-2,2)$. Then $$F'(\xi)=0,$$ which implies that $$2f'(\xi)[f(\xi)+f''(\xi)]=0.$$ Now, Notice that $$4\leq F(\xi)=f^2(\xi)+f'^2(\xi)\leq 1+f'^2(\xi),$$ which implies $f'(\xi)\geq 3$，and hence$f'(\xi) \neq 0$. It follows that $$f(\xi)+f''(\xi)=0,$$ which is desired. Please correct if I'm wrong. Hope to see other solutions. THX.


Continuous mapping on a compact metric space is uniformly continuous

I am struggling with this question:     Prove or give a counterexample: If $f : X \to Y$ is a continuous mapping from a compact metric space $X$, then $f$ is uniformly continuous on $X$.    Thanks for your help in advance.


Stack Exchange network with overlapping questions

This is a big feature request, so I'm not suggesting an immediate implementation or conversion. For the future of SE however, I believe it solves some existing issues which might only grow bigger as the network keeps expanding. I wrote this originally as an answer to , but since it's more a request than an answer, I decided to post it as such. The bottomline:  Questions should be able to show up on multiple SE sites, instead of just one.  Relating to the problems:  "Which questions go on which SE site?" "Would a certain new community steal users from another?" "All these SE sites are becoming a mess, there should only be one."  The solution I believe, is to focus on users, and not the categorization. If enough C# developers feel it is useful to have a Q&A site for all C# questions, there is a reason for its existence and it could become a thriving/working community. If it has overlapping questions with other sites, that's what those questions literally should do, they should overlap, and appear on both sites. The advantage is you create a highly specialized group of experts, without interrupting any other SE sites. Additionally this could have the following advantages:  Resolve redundancy of tags. Tags could be filtered out on certain communities. Resolving ambiguity of tags and questions. Easier to determine whether something is on topic. (For users and moderators.) Specialized moderators. More moderators. (Overlapping questions can be moderated by moderators of multiple communities.) Separated (and shared) reputation. When proving your worth in one community it can also count towards reputation in another where the question is relevant. More accurate answers by reaching a more specific audience. Sub sites could start off with subsets of questions of other SE sites. You can compare it with the main  site at the moment. A favorite tagset is a candidate for a SE sub site.  A concrete example:  Stack Overflow: specific programming problems : working code samples to be reviewed (fictional) C#  An expert only interested in C# questions can be active on C#.SE, while generalists can still stick around on Stack Overflow. A user with a specific programming problem could either end up at Stack Overflow, or C#.SE. The question would be visible on both. A user who wants a code review on C# code, either ends up at Code Review or C#.SE. The question would be visible on both. Of course there are still plenty of details that would need to be filled in. "How to know what sites a question belongs to?"  Some tags become 'site' tags. E.g. C# for C#.SE. Only cross site moderators can make questions overlapping?  ... That's how I would like to see the SE network. Implementing it is a different story. :)  Some related discussion such a design would solve:  The 'party problem' where people have nothing in common on a site as described in . This is one of the reasons why HowThingsWork didn't succeed. For people wanting to ask such a question it's a great place, but the community can't have knowledge about all those questions.  General meta questions could show up on the main meta and all child metas, while specific meta questions are only visible on the matching child meta.  and rep migration when merging questions. Reputation could  as a level of expertise, which when looking at meta is something  of people .  I might update this list if I encounter others.


For cosmic jets produced in gamma ray bursts or quasars, I've read that you have to assume a "Force-free magnetosphere" in order to explain these phenomena through electromagnetism. From my understanding, force-free means that the particles from the accretion disk have velocity along the lines of the magnetic field, but my question is how did the particles get velocity in that direction in the first place?


Find number of polynomials in $P_n(F)$ where $F$ is a finite field with cardinality $m$.

Firstly, I should mention that the above question hits my mind when I am solving a problem in Abstract Algebra which is- Find the number of elements in $\frac{\Bbb{Z}_3[x]}{<x^3+2x+1>}$. I have solved the problem in a following manner. I know that $K[x]$ be a polynomial ring over field $K$. Let, $f(x)$ be a non-zero polynomial in $K[x]$ with deg$(f)=n>0$. Then the quotient ring $\frac{K[x]}{<f(x)>}$ contains polynomials of form $g(x)+<f(x)>$ where $g(x)$ is a polynomial in $K[x]$ with degree at most $n-1$. So, cardinality of $\frac{\Bbb{Z}_3[x]}{<x^3+2x+1>}$ is same as of $P_2[\Bbb{Z}_3]$, set of all polynomials with degree less or equal to 2 and having coefficients from $\Bbb{Z}_3$. Again $P_2[\Bbb{Z}_3]$ has same cardinality as of the set of all 3-tuples(since the polynomials should have degree at most 2) with entries from $\Bbb{Z}_3$. I have listed all 3-tuples with entries from $\Bbb{Z}_3$- $(0,0,0), (1,0,0), (2,0,0), (0,1,0),(0,2,0), (0,0,1), (0,0,2), (1,1,0), (0,1,1), (1,0,1), (2,2,0), (0,2,2), (2,0,2), (1,2,0), (0,1,2), (1,0,2), (2,1,0), (0,2,1), (2,0,1), (1,1,2), (1,2,1), (2,1,1), (2,2,1), (2,1,2), (1,2,2), (1,1,1), (2,2,2).$ So, number of elements in $\frac{\Bbb{Z}_3[x]}{<x^3+2x+1>}$ is $27$. But still the method is too laborious if the degree of polynomials increases of cardinality of field increases. So, I need to establish a easy way out or a formula. Now, I try to find a general formula to find number of polynomials in $P_n(F)$ (set of all polynomials with degree at most n and having coefficients from F) where F is a finite field with cardinality $m$.($n,m\in \Bbb{N}$) To do that I just need to find cardinality of the set $\{(a_0, a_1,...,a_n):a_i\in F\quad\forall i=\{0, 1,...,n\}\}$. How can I find that? Can anybody help me do this? Thanks for your help advance.


What is the difference between slim and regular polarizer filters?

I have recently purchased Nikon D7200 with an 18-140mm f/3.5-5.6 lens. But I am confused whether to buy a slim or regular filter — which will be appropriate for my lens?


Switching window manager/desktop environments?

In general what is the approach to switch the desktop environment or window manager on Ubuntu? The main difference between stock Ubuntu, Kubuntu and Lubuntu is supposedly the use of Unity vs. KDE vs. LXDE.  However, in order to try various desktop environments and window managers I don't want to have to reinstall the respective flavor from scratch just to get a particular desktop environments or window manager. There probably is an easier method than that.  The question: How can I easily test different desktop environments and respective compatible window managers (say KDE, LXDE, Unity, GNOME, XFCE and StumpWM)?


Existence of $f(x)=-x$ for null homotopic maps on $S^n$.

If $h:S^n\rightarrow S^n$ is null-homotopic prove that $h$ maps some point $x$ to its antipode $-x$.  I'm not sure how to proceed with this problem. I understand that null-homotopic means that $h$ is homotopic to a constant map $g:S^n\rightarrow S^n$. Unfortunately I haven't found a way to get a handle on the antipodal points. Any insights would help greatly.


Disabling RAID feature on HP Smart Array P400

I'm planning to use ZFS on my system (HP ML370 G5, Smart Array P400, 8 SAS disk). I want ZFS to manage all disks individually, so it can utilize better scheduling (i.e. I want to use software RAID feature in ZFS).  The problem is, I can't find a way to disable RAID feature on the RAID controller. Right now, the controller aggregates all of the disks into one big RAID-5 volume. So ZFS can't see individual disk.  Is there any way to acomplish this setup?


Let $f(x)$ be a function which is differentiable on $[0,1]$ with $f(0)=0$ and $f(1)=1$. Show that for every $n\in \Bbb N$ there exists numbers $x_1,x_2,\ldots,x_n\in [0,1]$ such as $$  \sum_{k = 1}^n \frac{1}{f' (x_k)} = n $$ I think the mean value theorem should be applied. So there exists $x_1$ in $[0,1]$  such that $f ' (x_1) = \frac{f(1) - f(0)}{1-0} =1$  and there exists $x_2$ in $[0,x_1]$ such that $f ' (x_2) = \frac{f(x1) - f(0)}{x1-0} = \frac{f(x1)}{x1}$, so on and so forth for $x_3 ,x_4, \ldots,x_n$ and we have the sum $$1+\frac{x_1}{f(x1)} + \frac{x_2}{f(x2)} +\cdots+\frac{x_{n-1}}{f(x_{n-1})}$$  and from here I have no idea what to do . I was wondering if anyone could be so kind to help ?


Show that $f$ has an essential singularity at o

Let $f$ be a holomorphic, non-constant function on $D=\{0<|z|<10\}$. It is given that for every $n \in \mathbb{N}$, $|f(\frac{1}{n})| \le \frac{1}{n!}$.  Show that $f$ has an essential singularity at 0.  I have no idea how to even approach this. Why is it not possible for $f$ to have a pole at 0?  Note. In the original question it was written $n \in \mathbb{C}$ but I considered this a typo.  Thanks in advance!


Using the precise definition of a limit to show that the limit of $\exp(x)$ as $x$ goes to $0$ is $1$

Use the precise definition of a limit to show that $$\lim_{x\to 0} e^x=1.$$ By definition, I understand I need to show that: for every $\epsilon>0$, there exists a $\delta>0$ such that $0<|x-0|<\delta \implies |e^x-1|<\epsilon$ for all $x$. I am able to show this, by finding such $\delta$, if I assume $(e^x-1)>0$ but otherwise not. Any idea on how to proceed with the general case with the absolute value is appreciated.


How can I convert empty images so that they would show in the render?

I've made a noob mistake and set up a whole scene with empty image objects.  Is it possible to convert them so they would show in the render? I know I can delete everything and start importing everything from scratch as planes, but that would take too much time to start all over again.


how to add cdrom in ubuntu16.0.4 server error comes "fail to fetch cdrom"

error related image is uploaded we want to install ATutor on Linux server Ubuntu 16.0.4  but we encountered errors as :some files not found or "sudo apt-get update" gives errors seen in attached image most important ERROR FAIL TO FETCH CDROM. How to resolve


404 error from APT for ffmulticonverter PPA

I'm getting this error when am trying to update using command  sudo apt-get update && sudo apt-get upgrade:  Fetched 1,338 kB in 38s (34.9 kB/s) W: http://ppa.launchpad.net/ffmulticonverter/stable/ubuntu/dists/trusty/main/binary-amd64/Packages  404  Not Found  W: Failed to fetch http://ppa.launchpad.net/ffmulticonverter/stable/ubuntu/dists/trusty/main/binary-i386/Packages  404  Not Found


I have a question with 1508 views, but in the personal page list it gets reported as 2k.  Bug or aggressive approximation?


Does a person know who is on the other end of a sending stone?

At the end of the last session my players took out an enemy NPC who was using a sending stone while on the lookout for the rest of the gang they are sneaking up on. I am fully expecting them to try and use the stone to pretend all is well, my gut feeling is to allow it, it is a clever use of a simple magical item to throw the enemy off track. However I just wanted to make sure that mechanically this makes sense, I am pretty sure a sending stone is not like a radio, you don't hear the other persons voice. But would a wielder know someone different is on the other end or is this a DM decision thing?


Number of hours before the departure, that is safe be at an airport for an international flight

Generally airlines suggest that you be at the airport around 3 hours from the time of departure. Flying from the US, I've often found this to be unnecessary and I generally end up waiting and getting bored at the airport.  I've also found airports outside the US, where they would not let you in before 2 hours from the actual departure time of an international flight. Often this happens to be a pain, waiting outside the airport.  Is there a reliable way to find out the right time to be at the airport depending on the country and the specific airport anywhere in the world?


Where should the comma be placed in the salutation of a letter?

Sometimes I see a comma after the proper name:     Hello Mr. Black,      In order to give you....   But my native language is not English and I think that the comma in this phrase should be placed before the proper name:      Hello, Mr. Black.      In order to give you....   What is the correct punctuation in English?


Query a list of objects that contains any string

I'm this expression to search inside a list of objects by a specific property:  var result = myObject.Where(o => o.SearchString.Contains(searchValue));   It works good for a single value. The searchValue is a string passed by the user. The user can pass a single word or many words separeted by spaces. Is there any way to filter the objects that contains any of the passed words?  I could do this with a loop, searching a new word in previous results, but it doesn't seem very elegant.


If $a_n\to0$, there exists $\pm$ such that $\sum\limits_n\pm a_n$ converges

Our Analysis I lecturer in his last lecture for the course gave us a problem to think about. I've been thinking about it for a while and has been bothering me for some time. It looks like a generalisation of a theorem( or lemma) in the real 1D case.   The problem is as follow:     Let $(a_n)$ be a complex sequence tending towards $0$. Show that there exists a sequence $\delta_n\in\{-1,1\}$ for all $n$ such that $\sum\limits_n\delta_na_n$ converges.   This is true in the case for real sequence.  My only vaguely hopeful line of attacking the problem is to reduce it down to a finite case problem as follows. Suppose we have $A=\{a_i:n\le i\le m\}$ such that $a_i\le\epsilon$ for some $\epsilon$.  Then I wish to show that I can choose $\delta_n$ such that the partial sum is always bounded by some multiple of $\epsilon$ (say $\sqrt2$ or possibly $2$). I suspect this is true but I'm not entirely sure how one goes about doing this since the size of our set A is arbitrary.


Can I look up the text of my foreign cards on my phone in MTG tournaments?

Hey guys I have a question. I play commander and most of my cards are in foreign language. I use google drive to have a picture of the actual card in English. If I go to a tournament am I allowed to use my phone to check the actual meaning of my cards or no?


changing a ntfs disk to fat32 without farmating and removing the disk

I have a external hard drive that is full of data and i need all of it . I need to change it from ntfs to fat32.     Is there any application that lets me change it without formatting and even removing the disk and change it with all of its data to fat32 disk?  Thank for your help.


Will this procedure generate random points uniformly distributed within a given circle? Proof?

Consider the task of generating random points uniformly distributed within a circle of a given radius $r$ that is centered at the origin. Assume that we are given a random number generator $R$ that generates a floating point number uniformly distributed in the range $[0, 1)$.  Consider the following procedure:   Generate a random point $p = (x, y)$ within a square of side $2r$ centered at the origin. This can be easily achieved by:  a. Using the random number generator $R$ to generate two random numbers $x$ and $y$, where $x, y \in [0, 1)$, and then transforming $x$ and $y$ to the range $[0, r)$ (by multiplying each by $r$).  b. Flipping a fair coin to decide whether to reflect $p$ around the $x$-axis.  c. Flipping another fair coin to decide whether to reflect $p$ around the $y$-axis. Now, if $p$ happens to fall outside the given circle, discard $p$ and generate another point. Repeat the procedure until $p$ falls within the circle.   Is the previous procedure correct? That is, are the random points generated by it uniformly distributed within the given circle? How can one formally [dis]prove it?    Background Info  The task was actually given in . If you're interested, you can  in which I've implemented the procedure described above. I would like to know whether the procedure is mathematically correct or not, but I couldn't figure out how to formally [dis]prove it.  Note that the actual task was to generate random points uniformly distributed within a circle of a given radius and position, but I intentionally left that out in the question because the generated points can be easily translated to their correct positions relative to the given center.


I am working with c# winfroms and what I need is to immediately get returned value of what I have inserted. So I have statement like this:  INSERT INTO MESSAGES (MESSAGEID, SENDER, RECEIVER, TITLE, MESSAGE, STATUS)  VALUES (     ((SELECT MAX(MESSAGEID) FROM MESSAGES) + 1),      @Sender,      @Receiver,      @Title,      @Message,      0)   and after this i need messageid i just inserted for my code.  Here is full function and where it needs to appear:  private void send_btn_Click(object sender, EventArgs e) {     using (FbConnection con = new FbConnection(Properties.Resources.connectionString_EB))     {         con.Open();         using (FbCommand cmd = new FbCommand("INSERT INTO MESSAGES (MESSAGEID, SENDER, RECEIVER, TITLE, MESSAGE, STATUS) VALUES (((SELECT MAX(MESSAGEID) FROM MESSAGES) + 1), @Sender, @Receiver, @Title, @Message, 0)", con))         {             cmd.Parameters.AddWithValue("@Sender", EB.CurrentUser.userId);             cmd.Parameters.Add("@Receiver", FbDbType.Integer);             cmd.Parameters.AddWithValue("@Title", title_txt.Text);             cmd.Parameters.AddWithValue("@Message", message_rtxt.Text);              foreach(Int_String c in receiver_clb.CheckedItems)             {                 cmd.Parameters["@Receiver"].Value = c._int;                 cmd.ExecuteNonQuery();                  if(EB.Users.Logged(c._int))                 {                     //Get sent message id                 }             }              MessageBox.Show("Message successfully sent!");         }         con.Close();     } }


While   empirical means deriving from experiment and observation rather than theory.  What is would be the word for deriving from experience or past performance.


I am trying to install git-all using the following commands:  sudo apt update sudo apt install git-all   and I get the following results:  jonathan@Aristotle:~$ sudo apt install git-all Reading package lists... Done Building dependency tree        Reading state information... Done git-all is already the newest version (1:2.7.4-0ubuntu1). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 2 not fully installed or removed. After this operation, 0 B of additional disk space will be used. Do you want to continue? [Y/n] y Setting up runit (2.1.2-3ubuntu1) ... start: Unable to connect to Upstart: Failed to connect to socket /com/ubuntu/upstart: Connection refused dpkg: error processing package runit (--configure):  subprocess installed post-installation script returned error exit status 1 dpkg: dependency problems prevent configuration of git-daemon-run:  git-daemon-run depends on runit; however:   Package runit is not configured yet.  dpkg: error processing package git-daemon-run (--configure):  dependency problems - leaving unconfigured No apport report written because the error message indicates its a followup error from a previous failure.                                                                                Errors were encountered while processing:  runit  git-daemon-run E: Sub-process /usr/bin/dpkg returned an error code (1)   I found this response to a similar question:  but none of the solutions mentioned in it worked for me. Any ideas on how I can proceed from here?


Why the extra line in my tabular, using beamer

Below is a minimal example that displays my problem. In the top row I have an \onslide<+-> command that seems to introduce an extra vertical space in the table, which is not there (as desired) in the second row, when this command is not present. Why is this happening, and how can I remove the extra vertical space?  \documentclass{beamer} \usepackage{tabularx}  \begin{document}  \begin{frame}{Minimal Example}  \begin{tabularx}{0.9\textwidth}{p{0.18\textwidth}|p{0.32\textwidth}|X}\hline left & middle & \onslide<+-|handout:0>{right}\\\hline left & middle & right\\\hline \end{tabularx}  \end{frame}  \end{document}


Redhat 6.6 root partition is showing 100% full after power failure

I'm running Redhat 6.6 and experienced a power failure over the holiday weekend.  The / partition is showing 100% full. How do I check to see which files are actually causing the overusage?  [root@sms1 ~]# df -H Filesystem            Size  Used Avail Use% Mounted on /dev/mapper/vg_sms1-lv_root                        53G   51G     0 100% / tmpfs                  34G     0   34G   0% /dev/shm


Outlier Detection on skewed Distributions

Under a classical definition of an outlier as a data point outide the 1.5* IQR from the upper or lower quartile, there is an assumption of a non-skewed distribution. For skewed distributions (Exponential, Poisson, Geometric, etc) is the best way to detect an outlier by analyzing a transform of the original function?  For example, distributions loosely governed by an exponential distribution, could be transformed with a log function - at which point is it acceptable to look for outliers based on the same IQR definition?


Focal Fossa 20.04; Problem with GNOME Shell application picker after upgrade

I had upgraded to 20.04 from 18.04 without noticeable problems, but after that I found out that GNOME Shell don't display any application, viz. screenshot  If I type any name of installed application in the Search Bar, it will search that indefinitely. PC parameters: Dell Latitude E7450, Intel® Core™ i5-5300U CPU @ 2.30GHz × 4; Mesa Intel® HD Graphics 5500 (BDW GT2)


I just can't understand how to make this model a perfect real world scale. I can't figure out how Blender units work.  This is how the model opens when I imported to blender and that is how the scale is set.    I want the model to measure just 9 and 9.7 cm, how can I set the actual measurements to these?


Suggested operatonal definition for a tensor

The two tensor definitions I'm (newly) familiar with, by transformation rules, and as a map from a tensor product space to the reals, don't tell me what a tensor does, and to the best of my knowledge they don't make it apparent. So, I'm looking for an operational definition, and suggesting the following one -  This question was marked as a duplicate and here I try to explain why I don't think it is.  See paragraph 1. Moreover -  this definition is different because it defines tensors of rank 2 and above as a means of defining maps from tensor to tensor, and defines the operation of one tensor mapping another as an extension of the angle bracket operator for covectors and vectors (which I denote by >cv, v< as typing them correctly causes them not to print).  So, this definition tells you explicitly what a tensor does and how it does it.  I think it is much easier to understand if you're starting with no knowledge of tensors.  Scalars are rank 0 tensors.  For tensors of higher rank we start with a n-dimensional vector space V with basis e1, e2,... en and dual covector space V* with basis e1*, e2*,... en*. Vectors and covectors are rank 1 tensors.  A tensor of rank r>1 is a means of defining a linear map from tensors of rank m to tensors of rank n, where m and n are generally < r, but not necessarily, that is, the definition doesn't require it.  A tensor of rank r>1 is a linear combination of dyadic basis tensors of rank r, where a dyadic basis tensor product of rank 1 basis tensors a1 x a2 x a3 x....x ar where each ai is either a basis vector ej of V or a basis covector ej* of V*.  The result of applying one dyadic basis tensor a1 x a2 x a3 x....x ar to another b1 x b2 x b3 x....x bs is computed by evaluating >ar,b1< and if that is not 0, evaluating >ar-1,b2<, and if that is not 0 continuing till one of the dyadic basis tensors (normally b1 x b2 x b3 x....x bs.) is used up, if no 0 was produced the dyadic basis tensor that remains is the result, it's either a 1 or a dyadic basis tensor. Note when evaluating >ar-(k-1),bk< one must be a vector and one a covector, else it's an error.  Note: I'm using non-standard brackets >cv,v< to indicate applying a covector to a vector, the normal angle brackets don't print correctly.  The a dyadic basis tensor eats the b dyadic basis tensor till one of the nibbles is a 0 and the result is 0, or till one is used up and the result is 1 or the part of the a dyadic basis tensor that didn't get a bite (or the b dyadic basis tensor that didn't get bitten).  A tensor A maps tensor B by applying each term (coefficient times dyadic basis tensor) in A to each term in B and multiplying their coefficients when the result is not 0, and summing the resulting terms to get the result of A applied to B.  I think this is how tensors work, and I think this definition does explicitly spell it out and make it clear. But I'd like to have it verified or corrected if necessary.


Is there a easy way to test ubuntu on new notebooks before buying it?

Is there an easy way to check a notebook's hardware compatibility with ubuntu before you buy it?  I really don't want to buy a notebook home and find several bugs caused by the hardware.  I know that DELL has some notebooks which are pre-installed ubuntu12.04LTS, i.e. the new xps. But what about other notebooks? isn't there a way to quickly check a notebook's compatibility with ubuntu?  A way I can see is using a LiveCD/ubuntu stick and boot in ubuntu first, then run some tests. But the problem is: how to make these tests in a short time automatically??? and how can I check the hardware compatibility? I know that I can use lshw or hardinfo to get informations, but only having the information is not enough, there are still some possibilities that your hardware has a bug. For instance, Lenovo T410i's wireless driver has a bug which causes extremely low speed internet connection, I googled a lot and recompiled the driver to fix that bug. So this is the kind of situation I'm trying to avoid.  Any help is appreciated.


Why does a light beam in a moving light clock follows a V shaped path?

If I am standing on a platform moving along the X-axis and I throw a basketball vertically upward along the z-axis, the ball also travels along the x-axis. Does the same apply to a photon? According to a special relativity postulate  speed of light is not affected by the velocity of the inertial frame or the velocity of the emitter. If this postulate is true, shouldn't a photon fired vertically as above should travel only along the z-axis but not along the x-axis?


How fast is information transferred between the two entangled particles?

In the process of 'teleporting' a photon with a pair of entangled electrons, how is the information transferred between the two entangled particles? Could it be that the information is travelling at the speed of light, if not, faster?   My question lies in the fact of whether or not the information passed between two entangled particles is instantaneous. I would assume that the speed of light cannot be trumped, but I'm curious to know if the particle separation contributes the information to consider a set speed.


How can I show that $\lim_{|h|\to 0}\| f(x+h)-f(x)\|_p = 0$?

The following Exercise came from the lecture notes "Modern Real Analysis" by Ziemer, W. (Problem 6.34, pp. 213):     If $f\in L^p(\mathbb{R}^n), 1\leq p < \infty$, then prove $$\lim_{|h|\to 0}\| f(x+h)-f(x)\|_p = 0.$$ Also show that this result fails when $p=\infty$.   I don't know if the measure considered in the Lebesgue measure or this statement is valid in general measures for $\mathbb{R}^n$. I couldn't even start. Any hint will be really appreciated.


How to search the whole manual pages on Linux?

Sometimes I need to look up certain words through all the manual pages. I am aware of apropos, but if I understand its manual right, it restricts search to the descriptions only.     Each manual page has a short description available within it. apropos searches the descriptions for instances of keyword.   For example, if I look up a word like 'viminfo', I get no results at all...  $ apropos viminfo viminfo: nothing appropriate.   ... although this word exists in a later section of the manual of Vim (which is installed on my system).      -i {viminfo}                When  using  the  viminfo file is enabled, this option sets the filename to use, instead of the default "~/.vim‐                info".  This can also be used to skip the use of the .viminfo file, by giving the name "NONE".    So how can I look up a word through every section of every manual?


I am using Windows 7 (32-bit), is it better for me to start with Ubuntu (32-bit) too?     I am new to ubuntu.  If I want to download ubuntu (32-bit).     Thank you.


How to drag a folder to the launcher from Nautilus

How can I add a folder to the launcher for quick access to it. In this particular case I wish to drag it to the launcher.


How do I conduct a performance test of my internet connection?

Right now I'm in the process of possibly switching from a Cable provider to a DSL provider.  I  have both connections live, and before I cancel one or the other, I'm wanting to do some exhaustive testing of the internet connection.  I have three major questions:   What are some approaches that I can quantitatively test the speeds (both up and down) and quality of my internet connections (ping, time connection is down, etc,.)?   Are there other consideration that should be taken when testing an internet connection?   Are there any tools that can do this automatically and capture results?   Note: if you decide to suggest a piece of software, please  in doing so.  Also I'm looking to be able to save any data from the software for detailed analysis and comparison  Overall, I'm looking to compare the two connections over multiple periods of time such as peak hours (1600 - 2100 in my area), and with different loads such as streaming movies, uploading files, etc,.         This question was Featured in the blog!    Read the  for more details or  yourself


Removing blocks from configuration files?

Does anyone know an easy practical way to remove configuration blocks. I have a file in the format:  lease {   interface "eth0";   ... } lease {   interface "wlan3";   fixed-address 192.168.0.108;   option subnet-mask 255.255.255.0;   ... }   I want to remove the configuration block for interface "wlan3";.   I started trying to write a custom grep function but it was getting complex quickly.  This seems like something that might be a common problem. Does anyone have a convenient solution for dealing with configuration files of this format?


how to check if a variable contains a value in bash shell

Am having difficulty checking if the contents of a variable contains a certain value or not e.g "Device_info"  The main code  if [ "${NUMBERRESULTS}" -eq 10 ]  then     echo "Success" else     echo "Failed" fi   The above query/script in addition to the variable initialisation produced 14 results when i run it (devices.sh) which was accurate but in this case I want to verify if the $NUMBERRESULTS variable or the result contains the device_info value or not. see below  Here is the code I am writing  if [[ $NUMBERRESULTS =~ .*device_info.* ]] - i tried using the =~ operator then     echo "Success a device is present"; else     echo "Failed no device is present" fi   See the values/fields i need to verify if they are present or not in the $NUMBERRESULTS variable results/contents.  "device_info": {      i need to check if this field/value is present or not.     "connected_count": 36,     "current_config_id": 1618,     "default_config_id": 1618,     "first_connected": 1454576905,     "last_connected": 1454931872,     "registered": 1454576905,     "ip_address": "90.152.29.158",     "model_number": "GT-I9505",     "serial_number": "restful_api_device",     "mac_address": "00:00:00:00:00:00",     "smartcard": "unknown",     "hardware_version": "0",     "software_version": "83886336",     "manufacturer": "SAMSUNG"   thanks very much


Can the Stack Exchange websites work with a small cookie notification?

The massive cookie acceptance notification is a major annoyance. Even more annoying, is that even if I've logged into Stack Overflow, when I visit another Stack Exchange website, I'm shown the annoying notification again and I don't even get automatically logged in. Incognito tabs.  Earlier when it was a thin notification at the bottom of the page which could be dismissed by one click, it wasn't all that annoying. But now it's thrown in our face and we have to click twice if we don't want cookies tracking us. Please make that notification smaller. By default, nobody wants cookies tracking them. That's a given. If someone is ok with the tracking, you can give them one button that says "I consent".


Let's say we have a function  f (x) = x and define its domain D to be the integers. Then according to calculus the image K of f is the set of all integers. However, I cannot quite understand the need to define codomain because isn't the codomain A of f just a set of numbers such that K is a subset of A?   Because if that were the case, couldn't we chose any of Q, R, C or even the extended complex plane as the codomain of f? What have I gotten wrong, and what is the motivation for Codomain? :)


Proof that $N/1*(N-2)/2*(N-3)/3...$ is always integral? (Algorithm for Combinations)

I am trying to understand the algorithm for calculating combination N Choose R. It basically relies on the fact that $(N)/1 * (N-1)/2 * (N-2)/3 * ... * (N-R+1)/R$ is always an integer for any $R$. It is obvious that the numerator is divisible by any number in the denominator, but I don't understand how the numerator is divisible by all numbers in the denominator. For two co-prime numbers, it makes sense, but what about numbers that aren't coprime to each other? For example, consider this: $(N)/1 * (N-1)/2 * (N-2)/3 * (N-3)/4 * (N-4)/5 * (N-5)/6$. What if 4 needs $N-3=12$ and 6 needs $N-3=12$. Individually, $N-3$ is divisble by 4 or 6, but $N-3$ is not divisible by 24.


How did Walter White poison that character?

I've seen Breaking Bad complete series 2-3 times, but I never found out how Walter White was able to poison Brock.  I mean did he himself directly feed the Valley of the Lilly berries to Brock or did he let Saul do the work? I can't figure it out.


Proving $1-\exp(-4x^2/ \pi) \ge \text{erf}(x)^2$

This is a follow-up to  question. I came across a tighter potential bound and checked it numerically for $0\le x\le 5$. I think it holds for all positive $x$, can anyone see a proof?  $$1-\exp(-4x^2/ \pi) \ge \text{erf}(x)^2$$  Note: using analysis for previous  you can show that $1-\exp(-k x^2)$ is an upper bound on $\text{erf}(x)^2$ for $k=2$ and a lower bound when $k=1$. The factor $k=4/\pi$ comes out when numerically searching for tightest upper bound. Not only does it seem to give an upper bound, but it also tracks $\text{erf}(x)^2$ very closely.  Dashed graph below is $\text{erf}(x)^2$, red is $1-\exp(-k x^2)$ for $k=4/\pi$, other two graphs are for $k=1$ and $k=2$


Security of GCM if Implemented with Stream Cipher instead of Block Cipher

Can GCM be implemented with a stream cipher instead of a block cipher? If no, then what security flaw does it have?     If yes, then which possibility from below two is better in terms of security? In terms of speed, option ONE seems better as Stream cipher will be initialized only once in it (assume the input data consists of n blocks{0,1,2...n-1} where each block is of 128 bits).   Generate an output stream of length $n+1$ blocks $\{0,1,2,3....n\}$ from stream cipher using single key and single IV. Then  XOR the $n$ blocks $\{1,2,3...n\}$ of this output stream with $n$ blocks of plaintext to create ciphertext. Multiply ciphertext blocks together(as in GCM, shown as $\operatorname{mult}_H$ in figure below) and XOR the result with $1^{st}$ block  (0) of output stream to make AUTH_TAG. Generate an output stream of length $n+1$ blocks $\{0,1,2,3....n\}$ from stream cipher, where each block is generated with incremental IV (like Counter) but same key. Then XOR the $n$ blocks $\{1,2,3...n\}$ of this output stream with $n$ blocks of plaintext to create ciphertext. Multiply ciphertext blocks together(as in GCM, shown as $\operatorname{mult}_H$ in figure below) and XOR the result with $1^{st}$ block (0) of output stream to make AUTH_TAG.


Increase my Ubuntu performance without swap partition

I ever install Ubuntu without swap partition or file. Is that OK or must I create one?


Are there fingerprints taking processes at Polish airports for Schengen visa holders upon arrival and entry in the country?  Earlier, I got a visa from the French Embassy and my fingerprints had been taken in the embassy but not upon entering France. Now I am travelling to Poland and the Embassy didn't take fingerprints for the Schengen visa so I am wondering whether they would be taking them at the airport.


How can Valyrian steel kill White Walkers?

As shown in the last season of Game of Thrones, one of the leaders of the White Walkers was killed by Jon Snow's Valyrian steel sword.  As we know, White Walkers can be killed by Fire and Dragon Glass only.


This regexp finds the four groups as expected:    Since sometimes the second group is missing, I added the ? to make it optional, but it never finds the second group:    Why is the second group never captured, even when it does exist?  Here are the two patterns and the test text:  ^(.).* - (?:(\d+)mm - ).*\(([\d\.]+)\" x ([\d\.]+)\"\) ^(.).* - (?:(\d+)mm - )?.*\(([\d\.]+)\" x ([\d\.]+)\"\) N251 - 8mm - 4' x 10' (49.21" x 122.05")


I have a class for an object, and if a user attempts to supply a negative number to it's constructor I want to output a warning telling them that they have provided an invalid number in the form of  System.out.println("ERROR ON LINE " + Thread.currentThread().getStackTrace()[2].getLineNumber() + ": You have provided an invalid number.\nSetting to default.");   EDIT: I set the values to a default values in the system, I don't want the program to terminate.  What I really want to know is how I do automagically find the [2].


"Environmentally-friendly" sounds completely normal to me. So does "Environment-friendly". But I'm pretty sure I favour the former (despite the fact that I normally prefer the shorter of any two equivalent terms).  According to Google, I'm in good company. At least, the 'allies' massively outnumber those who say "Environment-friendly".  Why is this? Environment seems like a straightforward noun. All the other -friendly constructions I can think of just bolt on to the uninflected noun...  User-friendly software, Gay-friendly bar, Dolphin-friendly tuna, etc.  I hesitate to ask "What's so special about the environment?", but there it is being asked.  Later... Note that my focus is on why the inflected form apparently 'just happens' to be used with environment, but not with other nouns.


Why aren't users sometimes allowed to suggest edits to (or edit) questions?

I got the error message Users cannot suggest edits when trying to suggest an edit to .  Why do I get this message? And, more importantly: How can I make sure I can suggest edits again?


Python - What is the difference of two way of declaring 2D list

I can't understand why these two 2D list is different: list1 = [[' ' for i in range(n)] for j in range(n)] and list2 = [[' '] * n] * n. n = 3 list1 = [[' ' for i in range(n)] for j in range(n)] list1[1][1] = ' ' for i in range(n):     for j in range(n):         print(list1[i][j], end='')     print('')  This code let me get result like this: *** * * *** This is the result as I expected. But in list2, n = 3 list2 = [[' '] * n] * n list2[1][1] = ' ' for i in range(n):     for j in range(n):         print(list2[i][j], end='')     print('')  Result of this code is like this: * * * * * * I think this is so strange. Why this happens?


How many subsets of $\mathbb{N}$ have the same cardinality as $\mathbb{N}$?   I realize that any of the class of functions $f:x\to (n\cdot x)$ gives a bijection between $\mathbb{N}$ and the subset of $\mathbb{N}$ whose members equal multiples of n.  So, we have at least a countable infinity of sets which have the same cardinality of $\mathbb{N}$.  But, we could remove a single element from any countably infinity subset of the natural numbers and we still will end up with a countably infinite subset of $\mathbb{N}$.  So (the reasoning here doesn't seem quite right to me), do there exist uncountably many infinite subsets of $\mathbb{N}$ with the same cardinality of $\mathbb{N}$?    Also, is the class of all bijections $f: \mathbb{N} \to \mathbb{N}$ and a given countably infinite subset uncountably infinite or countably infinite?


Help understanding a concept in multiple integrals

I am learning multiple integrals (Double and Triple Integral) and need help understanding a solution given in the book.  In first question, it is asked to find the area lying inside the circle $r=a\sin\theta$ and outside the cardioid $r=a(1-\cos\theta)$. using double integrals. In this question how do i find the range for $r$ for integration ?


I have seen this used with other words besides "large" and "small".  What other words can be used? Can this structure be used more generally with other adjectives?


do you use a comma when telling/asking people/things? For example(s)  Do you want to go eat tomorrow, Nathan? Check me out, Nathan. Commas, people, commas! Just sent you a message, Nathan. Just sent you a text message, man!   I have been taking some journalism courses at my respective college, and I have become addicted to correct grammar, punctuation, and AP-style methods. I cannot stop analyzing correct, as well as, incorrect texts/writings in my daily life. I aim to live a correct-grammar life in everything I write. I also just discovered this site, and I love it. Thank you for reading!


Is passing parameters with dictionary OK?

Context  There is class 'A' which needs a lot of parameters. And there are classes B,C,D which depends D->C->B->A way. I have to set parameters for A while initializing D which would be passed on to C then to B, A. Now the problem is that the list of parameters is so big that it would be pain to pass each of it as argument in constructor. So instead I created a dictionary to pass it on by.  Question  In this case, is passing parameters with dictionary OK? If not, are there other way to solve this?


i have a 5 bit binary number and now i want to display the 5 bit number on seven segment display i have 20 digital inputs and i have added them using full adder the output result is a five bit bonary number and now i want to display them on two digit seven segment display guide me in the most easiest way i have tried using logic gates but the connections take very long time and also there is complexity


I accidentally turned off FileVault on my MacBook when trying to allow downloaded Canon driver software to be opened. FileVault is currently decrypting and I want to stop it as soon as possible. How do I stop FileVault decryption?


How do i move a list object at the end of the list while shifting back the others?

First of all i must say i have spent all my day searching my answer before i posted this question here. The closest answer i get is  but some of the answers didn't work for me while others are too complicated for me to understand. Let me explain clearly what i want to achieve: For simplicity lets think i have a list that consists of "6" objects. I randomly select an index in the list, lets say, myList[index=2]. Then i want this object to go at the end of the list meaning its index value is now 5. Also i want to re-arrange the untouched objects to get the same size of list without empty index value. After all these steps it should like this:    At the moment my code is this:   public static void Move<T>(this List<T> list, int oldIndex, int newIndex)  {      if ((oldIndex == newIndex) || (0 > oldIndex) || (oldIndex >= list.Count) || (0 > newIndex) ||          (newIndex >= list.Count)) return;      // local variables      var i = 0;      T tmp = list[oldIndex];      for (i = oldIndex+1; i < newIndex; i++)      {          list[i] = list[i - 1];      }              list[newIndex] = tmp;  }     However, as you can predict it doesn't work. Debug.DrawLine to gameobjects in this list shows me when i move the items through the list with my code leave me two objects one myList[0] and one myList[5] which i added. The other lines disappears after.


I rooted my android device.  After rooting, is it possible to block or stop advertisements coming on apps?  If yes, please guide me for resolving this issue.  Regards  GNS


i have a laptop with Windows Vista but Grub detects as Windows 8 no matter what distro i use, Grub always detects my Windows Vista as Windows 8, how can i fix this?


I can't seem to find a nice clean example of using AES 128 bit encryption.  Does anyone have some sample code?


Do I need a Direct Airside Transit Visa when I have a Standard Visitor visa for UK?

I'm a Pakistani national residing in Saudi Arabia due to visit Finland. I have a valid Schengen visa and a multiple-entry visitor visa for United Kingdom. I'm flying with British Airways both ways and have layovers at Heathrow Airport for 2 - 3 hours.  Do I need a Direct Airside Transit Visa?


Send Document PDF/Word with attached file - merged fields

Is there a way, out of the box Salesforce functionality, Lightning Experience, to send somehow an e-mail with an attachment (word or pdf) and merged fields? More specifically, my requirement is:  I am at case record and has relationship with a custom Objcet (Subscription) I need from case record (i have already selected the lookup record from Subscription entity) to send an e-mail with an attached document with filled in the Subscription Number (custom field on subscription) and account's data (name, VAT number etc).  Any suggestions?


minus reputation not shown in reputation tab

I got reputation as -1. When I try to check that, I am not able to find where I got -1.  Please see below screenshot.


How can I prove this differentiability question?

Let $f:\mathbb R\to\mathbb R$ be continuous, and differentiable at every point $x\in\mathbb R - \lbrace c\rbrace$ for some $c\in\mathbb R$. If $\,\,\lim_{x\to c}f'(x)\,\,$ exists, then $f$ is differentiable at $x = c$ with $f'(c) = \lim_{x\to c}f'(x)$.   I want to know how to prove that the sentence above is true.


The picture explains it better than I can. I have edited the config to make window_type override instead of the default as I wanted it on the desktop not as a window, but window_type desktop was disappearing whenever I clicked on the desktop. Is there any way to fix this without reverting the previous problems?   I have used the default seamod that comes with conky I have used conky-manager


what exactly do UX Designer mean in the web design field?

What I mean by this question is how can a person be an UX designer just by making a STATIC high fidelity mockup on a piece of software like "Photoshop" or "Sketch" or whatever.  Does not the words "User experience" mean by itself "movement", "motion" , "flow" and so on?  Does not being an UX Designer requires to actually make something real, palpable, usable in order to create an experience? I'm talking about knowing how to create what you've made in "Photoshop".  Am I totally wrong about this?


I would like the limits to be vertically above and below the summation sign. I also need a larger summation sign... This is currently what I have:   $x^2sin(x) = \sum_{n=-\infty\atop n\ne \pm 1}^\infty \dfrac {4i(-1)^{n}n}{(n^2 - 1)^2} $   Any help appreciated!


relation between first kind Chebyshev poly and second kind Chebyshev poly

How do you prove following relation between Chebyshev poly of first kind and Chebyshev poly of second kind: $$dT_n(x)/dx=nU_{n-1}(x)$$


Which one should be chosen: "will - are going to"?

Liverpool's players are skilled, so they .... the match easily.    will win are going to win   I had hard time answering this question in my final exam in the High School, my answer was the second. Some of my classmates said: "will win".


Have the tag counters stopped working again?

Have the tag counters stopped working?   I know this happened a while back but wondered if it has occurred again.   I have had a few upvotes on SQL recently and believe the counter should be on 600+, however it remains at 597 for the last few days.  I have received no down votes.


Horizontally and vertically flexbox css not working

I'm trying to center the below HTML vertically and horizontally but it's not working vertically, only horizontally. Please could someone help explain why it's not working?                         Learn

             <input type="text" id="userGuess">             <button class="answer-button" id="checkAnswer">Answer</button>
    My CSS using flexbox trying to center the quiz horizontally and vertically  .quiz-container {     display: flex;     flex-direction: column;     justify-content: center;     align-items: center; }  .word-to-conjugate {     font-size: 2rem;     font-family: 'Source Sans Pro', sans-serif;     text-align: center; }  input {     font-family: 'Roboto', sans-serif;     font-weight: bold;     padding: 10px;     font-size: 1.5rem;     border: 1px solid #333;     border-radius: 5px;     margin-bottom: 20px; }  .answer-button {     background-color: #505FDF;     font-size: 1.5rem;     text-align: center;     color: #FFFFFF;     padding: 10px;     border-radius: 5px;     border: none;     font-family: 'Roboto', sans-serif;     margin-bottom: 3%; }


How to find Apple ID used to set up my iPad

How can I find out which Apple ID has been used to set up my ipad - it has been hacked and is now some years old and I am in the process of restoring this device.  This iPad is not listed on the Apple ID I have established.


I want to combine two ffmpeg commands to a single command. I am using ready made ffmpeg binary in my Android application. I want to concat .ts files and overlay an image.  I am using following commands:   To concat .ts files:  String[] ffmpegcommand = {"ffmpeg", "-i","concat:"+input_file_path+"|"+input_file_path1, "-c", "copy", "-bsf:a", "aac_adtstoasc", output_file_path};  Apply image overlay effect:  String[] ffmpegcommand = {"ffmpeg","-y" ,"-i", input_file_path,"-strict","experimental", "-vf","movie="+AppStaticData.BASE_FOLDER_PATH + File.separator + "watermarklogo.png"+" [watermark]; [in][watermark] overlay=main_w-overlay_w-10:10 [out]", AppStaticData.BASE_FOLDER_PATH+"/" + output_file_path};


Procedure of checking Completeness for a specific Uniform Distribution

Let $X_1,X_2,...,X_n$ follows Uniform distribution on the interval $(-\theta, \theta)$. I have to find the minimal sufficient statistic $T$ and to show whether $T$ is complete or not. Hint: Use indicator function appropriately so that the problem reduces to the common pdf's of the random variables $|X_i|$, i=1,2,...,n. I have found that the minimal sufficient statistic is $T=max\{-X_{(1)}, X_{(n)}\}$. How can I show that if this statistic is complete or not? Can I express this $T$ as $T^*=max|X_i|$, i=1,2,...,n? And also please show me the procedure of the proof of showing this new $T^*$ as complete if it is. Please derive the pdf of $T$ and $T^*$ briefly. I think then I will be able to find out whether $T$ and $T^*$ are the complete statistics or not.