I can't get cases subformula to work properly. My MWE, inspired from the wiki and the My Way "Using \startalign and friends" by Aditya Mahajan, is :  \starttext \placeformula \startformula     \startcases       \NC x = a \NR[+]       \NC y = b \NR[+]     \stopcases \stopformula \stoptext   This only prints (2) on the right of the whole cases system. If I use \placesubformula, the behavior remains exactly the same.  Has there been a change in the behavior since the documents were written ?    EDIT  Since the question was marked as a duplicate of , I must say the answer provided there works but does not seem satisfying. I first rewrite the code suggested by Henri Menke here :  \startformula     \rlap{\hskip6.5cm \Bigg\{}     \startalignment[n=1,location=middle]         \NC x = 1 \NR[+]         \NC y = 1 \NR[+]     \stopalignment \stopformula   When I use ConTeXt (or LaTeX or another typesetting system with the same philosphy) I think I should not have to manage by hand the placement of the braces (with the \hskip command) everytime I use the cases environment within columns, or very long equations, and so on. This is why I don't find the solution proposed by Henri Menke to be satisfying in a long-term usage.


Auto-correct from Texmaker when using \cite

I have a question about the TexMaker editor. In some cases the auto correct does not find typing errors in the script, and I don't know why, it seems strange to me, but seems to be linked to the use of citations. Here a screenshot of the problem.     Have you encoutered such a problem ?


Let $T:\mathbb{R}^n\to \mathbb{R}^n$ be a linear transformation...

Let $T:\mathbb{R}^n\to \mathbb{R}^n$ be a linear transformation, where $n\ge2$. For $k\le n$, let $E=\{v_1,v_2,\dots,v_k\}\subset \mathbb{R}^n$ and let $F=\{Tv_1,Tv_2,\dots,Tv_k\}$, then which of the following is true.  $A.$ If $E$ is linearly independent, then $F$ is linearly independent  $B.$ If $F$ is linearly independent, then $E$ is linearly independent.   $C.$ If $E$ is linearly independent, then $F$ is linearly dependent  $D.$ If $F$ is linearly independent, then $E$ is linearly dependent.   Please help me out with this problem. And if some theorem is responsible for it's solution please mention that.


How to edit a file from a script using a loop instead of find and replace with sed?

Here is an example of what I am trying to do:      #!/bin/bash Update=$1  if [$Update == Value]  then     NewValue= $Update     vi %s/Value/$NewValue/g > Updatedfile fi exit 0   Is there a way to utilize vi commands within a script? My thoughts are that some type of piping would do this?


I'm working on creating a online quiz program. I want to change questions every time new user logging in. Is there any way to get questions from database randomly?  I have tried rand() function but it generates same question again and again.


Fedora 25 is NOT using wayland by default!

For some reason my Fedora 25 FRESH install is not using wayland by default. I know this because of  $: loginctl show-session 3 -p Type Type=x11   If I was using Wayland by default that should say wayland or weston. I'm very confused why this fresh install of fedora 25 is not sporting wayland by default. I looked over the arch wiki briefly, and tried to test run wayland by issuing  $: weston   Also, I have rebooted fedora to multiuser.target, to get just a command line to manually launch a dbus-run-session for wayland, and this is the output:  $: dbus-run-session -- gnome-shell --display-server --wayland (gnome-shell:1372): mutter-WARNING **: Can't initialize KMS backend: could not find drm kms device   Then I tried:  $: startx   And my standard gnome desktop popped up no problem. I'm seriously wondering if fedora 25 live installer ever installed wayland to begin with?  After looking for the wayland config file weston.ini, I cannot find it in ~/.config/ where it's supposed to be.  System info:  $:uname -a Linux sark 4.8.10-300.fc25.x86_64 #1 SMP Mon Nov 21 18:49:16 UTC 2016 x86_64 x86_64 x86_64 GNU/Linux   I have done a full system update on first login with   $: sudo dnf update    Also went through the process of using the nvidia drivers for my graphics card; GTX 950 Not using the default pre-my-move-to-nvidia-driver driver :P   EDIT:  After investigating onto my laptop, my Laptop reports that it is using wayland:  $: loginctl show-session 2 -p Type Type=wayland   This laptop was a fedora24 upgrade to fedora25, not a fresh install of fedora 25  Laptop info:  $: uname -a Linux mcp 4.8.10-300.fc25.x86_64 #1 SMP Mon Nov 21 18:59:16 UTC 2016 x86_64 x86_64 x86_64 GNU/Linux


Sorry for my simple question, but I don't know how to explain it right so google won't help me. Therefore I try here to get a answer.   So.. i use the front-page.php in my theme as startpage. I know that the index.php is used for all pages which have not set a file.php.   My question is: Which code goes in the index.php? The same I used for the front-page.php? Is this useful?   My current theme structure:


Drivers for TP-LINK TL-WN725N Nano USB Wireless N adapter

Can you advise me on what drivers to install for the TP-LINK TL-WN725N USB wireless adapter on UBUNTU 12.04.  TP-LINK only provide Windows drivers.


Is the HP LaserJet PRO M130fw compatible with Linux?

I'm about to buy a Laserjet multifunction wireless printer, and I was thinking about the   I searched online for a while and all I could find is   And .  Anybody had luck using this printer on Linux? Or should I go for a similar model with better Linux support?


How can I make a web application to access local files?

I am creating a web application which needs to access the local audio and video files in the client's system.  The basic idea is, when the site is opened in the browser it must have access to the files of the client system and must display all the media files in a requested directory.  Can this be implemented using any concepts of JavaScript, Java, Perl, Ajax or any other client-side languages?  Some questions have solution to this but now it has become obsolete  so is there any new way


Why does Hermione claim to have never performed a Memory Charm?

Here she clearly states that she's never used Obliviate.     "You're the boss," said Ron, sounding profoundly relieved. "But I've never done a Memory Charm."   "Nor have I," said Hermione, "but I know the theory."   (Deathly Hallows, Chapter 9, A Place to Hide).   Yet in a previous chapter she seems to contadict that.     "I've also modified my parents' memories so that they're convinced they're really called Wendell and Monica Wilkins, and that their life's ambition is to move to Australia, which they have now done...Assuming I survive our hunt for the Horcruxes, I'll find Mum and Dad and lift the enchantment. If I don't - well, I think I've cast a good enough charm to keep them safe and happy."   (Deathly Hallows, Chapter 6, The Ghoul in Pyjamas).   If she had modified her parents' memories already then why did she claim to have never performed a Memory Charm?


Bootstrap sample with size greater than the original sample

I want to predict future returns over a 20 days horizon using an ARMA-GARCH model fitted to my data. The goal is to estimate different risk measures like VaR or CVar. In particular say I use AR(1) GARCH(1,1). The smaple I use for estimation has 500 observation of daily logreturns. That's what I usually do:   Estimate AR, ARCH and GARCH coefficients Calculate standardized residual by dividing residuals by estimated conditional variances The standardized residuals constitute my INVARIANTS that is the i.i.d. series from which I extract bootstrap samples to generate scenarios.   The bootstrap samples are extracted by simulating a uniform between 1 and the sample size (500 in this case) and then taking the value corresponding to that position in the vector of the standardized residuals.  The problem is that I have only 500 standardized residuals and I think 500 is the maximum size of bootstrap samples I can extract.   My colleague instead extracts 100000 observations out of the original sample of $N=500$ observations.  I feel that this is somehow incorrect conceptually. Simulating only one step forward would produce exactly the same scenario as the initial one, but with repeted values that add no information.  My colleague claims that if he wants to project over a longer period, e.g. 20 days horizon, the 100000 extractions from the original sample of N=500 obs. would produce many different scenarios at the final horizon, providing a CDF that is smooth.  Actually thit is true because, although the values are simply repeated in the first step, after that they can sum up in many different ways.  That being said I don't feel this is right. I proposed an alternative that is:   From the standardized residuals create a smoothed empirical CDF, say kernel Exctract uniforms between 0 and 1 and feed it to the empirical smoothed CDF, i.e. inverse transform.   This way I feel more confortable to say that I can generate a bootstrab sample of size greater than the original one, but still I am not sure.  I am studying bootstrap theory on a book from Efron      Efron, Tibshirani - An Introduction to the Bootstrap - Springer US (1993)   but there are many concepts that I  don't understand yet.  My question are:   Would you give your opinion on the problem I just showed below? Would you suggest any valid matherial for studying bootstrap other than the book I mentioned? I think that this application of bootstrap is somehow different to the one explained in Efron's bookm, that is evaluating confidence intervals for estimated paramenters. What do you think about it?   Any comment would be much appreciated  I apologize for the length of the post but I tried to be as much concise as I could. Thank you


Recovering windows after installing Ubuntu

Here is my story... I had a dual booted PC with Ubuntu and Windows 7. It worked fine. But I forgot my admin password of Ubuntu. So I decided to uninstall my older version and reinstall a newer version of Ubuntu. But what I got what was a   grub rescue error    Then I installed Ubuntu with my USB without trying get Windows back. Now my PC automatically boots Ubuntu. So I downloaded a Windows 7 ISO and used my USB to repair it. But when I load my USB in boot option menu, instead of asking me to install Windows, it shows the  0xc0000225 error   and asks me to insert a disk(which I've done using my USB). What should I do to get Windows 7 back (or course, without losing Ubuntu)?


Please help me upgrade my Ubuntu cause it's hard for me to update firefox and can't install Flash player. I tried the terminal but it didn't work.


Proof $ e^{x-1} \geq{x} $ by writting $e^x$ as a infinite series

By writing $e^x$ as a infinite series proof that for every $x\geq{0}$ is true: $$ e^{x-1} \geq{x} $$ Also when is true $e^{x-1} = x$?


Reverse 4 finger swipe direction on Windows 10, HP

I recently installed Windows 10 Education, Version 1709, Build 16299.192. Coming from a Linux background, I like everything about the Desktop.  So my HP has four-finger touchpad support. A tap brings up the Action Center. A four-finger swipe kinda works but with issues.  A swipe to the right, for people used to Natural Scrolling, is supposed to push the current desktop away to the swipe direction. And I guess that's how it works on certain devices. But on my HP it just goes to the next desktop in the swipe direction.   Also, note that my Natural Scrolling works just fine. Thank you!


The usage of bare infinitive in an article

I came across this article. The first sentence is  One Direction plan on celebrating their 10th anniversary on July 23rd with a trove of new content for their passionate fans.  and the whole article can be seen in this  My question is, Why the verb should've taken a bare infinitive form instead of normal forms like "plans" or "planed"?


Notation of rules of a calculus in "Mathematical Logic" by Ebbinghaus

I have a basic question on the notation used in "Mathematical Logic":  Ebbinghaus writes rules of a calculus as $$\frac{\zeta_1,...,\zeta_n}{\zeta}$$ and by that he means that if the strings $\zeta_1,...,\zeta_n$ belong to some subset $Z \subset A_S^*$ then $\zeta$ also belongs to $Z$. Now on page $23$, in exercise $4.6$, Ebbinghaus writes $$\frac{}{\text{ }x\text{  }x\text{ }}$$ or $$\frac{y\text{   }t_i}{y\text{   }ft_1...t_n}$$. What does he mean by that? ($x \text{ }x$ is clearly not a string)


Aggregating rates represented by points within X radius using QGIS

the point represents rates like 10%, etc. (this was also pretty clear from 2 years ago) -- been trying to do this for 2 yrs...  the points dont represent numbers of events since they are rates ()    but the points have geo ids so they are attached to location, not distance (whatever distance is to imply) -- update: it represents z-value but we're just dealing with rates


Can an adiabatic, isentropic transformation be irreversible?

My question is very similar to , but I decided to ask another question because I felt that the problem deserved to be addressed in a more specific and formal way and I also wanted to discuss a specific example.  Let's start from Clausius' inequality.  For a reversible transformation between the points $A$ and $B$ we have  $$\Delta S_{AB} = \int_A^B \frac{\delta Q}{T}$$  While for an irreversible transformation we have  $$\Delta S_{AB} > \int_A^B \frac{\delta Q}{T}$$  For an adiabatic process, $\delta Q =0$.   Is thus easy to see that  $$\text{adiabatic}+\text{reversible} \Rightarrow \text{isentropic} \ (\Delta S =0)$$  and  $$\text{adiabatic}+\text{irreversible} \Rightarrow \Delta S >0$$  My question is:   Is   $$\text{adiabatic}+\text{isentropic} \Rightarrow \text{reversible}$$  also true?  I think that this is not true in general because for a general process we have  $$\Delta S_{AB} \geq \int_A^B \frac{\delta Q}{T}$$  If the process is adiabatic and isentropic, we obtain  $$0 \geq 0$$  which is trivially verified and tells us nothing about reversibility or irreversibility.   I would also like to bring a possible example of an adiabatic, isentropic transformation which is also irreversible.  I'll start by remarking two facts upon which I hope we agree:   A non quasi-static transformation cannot be reversible. Quasi-staticity is a necessary condition for reversibility. Since entropy is a state function, every cyclical transformation is isentropic.   Let's take an ideal gas enclosed in an adiabatic vessel with an adiabatic movable piston. From the initial state $(P,V,T)$, where $P$ is the ambient pressure (we suppose that the weight of the piston is negligible), we irreversibly (i.e. non quasi-statically) push the piston downwards, taking the system to the state $(P',V',T')$. Now we irreversibly (non quasi-statically) pull the piston back to its original position so that the final volume is $V''=V$. Since $P''=P$ also (because the pressure must be equal to ambient pressure in order to have mechanical equilibrium), from the ideal gas law $T''=T$, so we have performed a cyclical, adiabatic, irreversible transformation.  PS: In case of positive answer (adiabatic+isentropic implies reversible), it would be best if the answer pointed out the flaw in my example but provided also a formal proof of the above-mentioned implication.


Dividing a deck in four stacks, aces must be in different piles (Conditional Prob.)

I'm really stuck in this fairly simple example of conditional probability, I don't understand the book reasoning:     An ordinary deck of 52 playing cards is randomly divided into 4 piles of 13 cards each.   Compute the probability that each pile has exactly 1 ace.       Solution. Define events $E_i, i = 1, 2, 3, 4$, as follows:      $E_1$ = {the ace of spades is in any one of the piles}      $E_2$ = {the ace of spades and the ace of hearts are in different piles}      $E_3$ = {the aces of spades, hearts, and diamonds are all in different piles}      $E_4$ = {all 4 aces are in different piles}      The desired probability is $P(E_1E_2E_3E_4)$, and by the multiplication rule,       $P(E_1E_2E_3E_4) = P(E_1)P(E_2|E_1)P(E_3|E_1E_2)P(E_4|E_1E_2E_3)$      Now, $P(E_1) = 1$ since $E_1$ is the sample space S. Also, $P(E_2|E_1) = \frac{39}{51}$ since the pile containing the ace of spades will receive 12 of the remaining 51 cards (...)   I was lost with $P(E_2|E_1)$, I don't understand why it's $\frac{39}{51}$. I tried to think like this:   by definition, $P(E_2|E_1) = P(E_1E_2)/P(E_1)$ and, since $P(E_1) = 1$, $P(E_2|E_1) = P(E_1E_2)$. But it's obvious that $E_2 \subset E_1 \Rightarrow E_1 \cap E_2 = E_2 \Rightarrow (E_2|E_1) = P(E_2)$.   So I tried to calculate $P(E_2)$ to see if it matched the answer of the book. By definition, $E_2$ is the event where the ace of spades and the ace of hearts are in different piles. So the sample space is $52\choose13,13,13,13$. Now, suppose you take out the ace of hearts and the ace of spades of your deck, now you have 50 cards and there are $50\choose12,12,13,13$ ways of dividing the deck and $4\choose2$ ways of deciding which piles receive 12 cards and which receives 13. After making this division, there are $2!$ ways, for each result, to put back the 2 aces you took off (each one in one of the piles with 12 cards). So  $P(E_2) =$ ${50}\choose{12,12,13,13}$$ {4}\choose{2}$$2!$$/$${52}\choose{13,13,13,13}$$= \frac{39}{51}$  In the end, I found the right answer for $P(E_2)$, but I went through a whole line of reasoning that was not trivial. In the other hand, the book apparently deduces it in a trivial way:     since the pile containing the ace of spades will receive 12 of the remaining 51 cards   What I'm not getting?


Possible to rewrite \$a'b'c'd'\$ using NOT and NAND gates?

Is it possible to rewrite  \$a'b'c'd'\$ using only NAND gates and NOT gates?  I tried rewriting it using DeMorgan's laws but got AND and OR gates which I cannot use. All help/input is appreciated.  I have 1 XOR gate available too in my project but I don't think that would be possible either.


How to print a small bill receipt jquery php

when I tried to print a small receipt I ran into the problem with print. all document display for print.when I click the print button.and after printed the document print button also printed on the page.i need to print receipt only on the page .i used window.print(); for print.

Pepsi Cola

                         Order #  &nbsp; &nbsp; 11111

                         Invoice   22344

                                     No	                                     Pname	                                     Qty	                                     Price	                                     Total

                                                                              1                                     	                                          Cake                                     	                                          2                                     	                                         120	                                         240

                         Sub Total &nbsp;&nbsp;240

                         Pay  &nbsp;&nbsp; 220

                         Due &nbsp;&nbsp;   20
                     <input style="padding:5px;" value="Print Document" type="button" onclick="myFunction()"></input>

   javascript


What does it mean that a "clustered index does not store pointers to the data"?

I am a beginner in SQL and Database Administration and I am trying to undestand the difference between clustered and non-clustered indexes. More or less I understood what the different tasks are but I have some issues when it comes to the question of "pointers". I don´t come from CS so I have some issue to imagine what happens at the "leaf level" with the pointers and in which way they connect the index to the data. So, what does it mean that a clustered index does not store pointers to the data, while, the non-clustered one, does it? Sorry in advance if these questions sound stupid but at this point I am pretty confused!


Looking for story in which it is possible to see history through the eyes of your DNA ancestry

In this story, the reach of this technique (being able to see the past through the eyes of your ancestors, eventually including pre-human ones) is extended further and further into prehistory. This is a novel, not a short story.


Reference request: Clean proof of Fermat's last theorem for $n=3$.

I have seen a proof for FLT, $n=3$ using factorisation in the ring of Eisenstein integers, but it's quite long and convoluted; I am wondering if there is a more 'advanced' proof which avoids infinite descent/messy repeated calculations.   What's your favorite proof of Fermat's last theorem for $n=3$, and where can it be found written down?


When I try to install Wine, PlayonLinux, and some other programs, I get the following message:  At the terminal:  The following packages have unmet dependencies:  wine : Depends: wine1.5 but it is not going to be installed E: Unable to correct problems, you have held broken packages.   At the software center:  Package dependencies cannot be resolved This error could be caused by required additional software packages which are missing or not installable. Furthermore there could be a conflict between software packages which are not allowed to be installed at the same time.   I already tried installing them with "aptitude" and failed.  I am running Ubuntu 12.10  Please help! I've had this problem for a while now and don't know what to do!


How to send emails and avoid them being classified as spam?

This is a  about how to handle email sent from your server being misclassified as spam.  For additional information you may find these similar questions helpful:                    Sometimes I want to send newsletters to my customers. The problem is, that some of the emails get caught as spam messages. Mostly by Outlook at the client (even in my own Outlook 2007).  Now I want to know what should be done to create "good" emails. I know about reverse lookup etc., but (for example), what about a unsubscribe link with an unique ID?  Does that increase a spam rating?


What's the limit of GM forcing things for the players' enjoyment?

We all know the dice's outcomes may be unpleasant, expecially in the case of story events, when players may feel that they had no control on something except rolling the dice higher.   Should the master force things a bit in these situations, or should the dice, even the ones he rolls behind the screen, have an undebatable verdict?


Time and date and appearance settings missing

I am a Linux user since 2010. I used Debian, elementary OS (which is also Ubuntu) and now I'm using a fresh install of Ubuntu itself.  But I'm already having some problems that I can't find how to solve. The first of them is that there are some missing settings on my configurations. See:    I can't see the wallpaper settings, screensaver or date and time settings. I can set wallpaper by right-clicking an image and then clicking on "Set as wallpaper". No way to set screensaver. I can set the date from the terminal, but I can't show to my personal friends how amazing Linux is and encourage them to change to it, if even to set the clock they must see me going to terminal. If I click the date and then click 'Date and time settings', it just shows up the configurations panel (from image above). Also, I work with different timezones, and I want to see many timezones when I click the date in topbar, which is not being possible.  I couldn't find another topic with exactly the same problem...


What commands can git pull be separated to?

When pulling, i noticed git fetch behavior also occurs.  I assume a pull is actually  pull = fetch + x  I was wondering if this is the case, and if so, what is x?


Well, it looks like it's that time of the year again!     appears in HNQ. It probably shouldn't, for reasons discussed previously.  Related: ,


Foliate book reader, snap package, can't open ebooks from NTFS partitions

I have just installed the  via snap sudo snap install foliate on Ubuntu 20.04.  I can successfully open epub book that are in my home folder, but when I try opening books that are in mounted NTFS partitions, it returns an error. See screenshot below:    The file permissions are:  -rwxr-xr-x 1 subroot subroot   875977 Dec 17 22:50 Chosen_but_Free__A_Balanced_View_5976470859.epub*   This then logs these details in the syslog:  May  5 10:48:52 subroot kernel: [ 7738.695746] audit: type=1400 audit(1588664932.924:3252): apparmor="DENIED" operation="open" profile="snap.foliate.foliate" name="/proc/21158/mounts" pid=21158 comm="com.github.john" requested_mask="r" denied_mask="r" fsuid=1000 ouid=1000 May  5 10:48:52 subroot com.github.john[21158]: JS WARNING: [resource:///com/github/johnfactotum/Foliate/js/window.js 1119]: reference to undefined property "_loading" May  5 10:48:53 subroot com.github.john[21158]: JS WARNING: [resource:///com/github/johnfactotum/Foliate/js/tts.js 33]: reference to undefined property "_epub" May  5 10:48:53 subroot kernel: [ 7738.855762] audit: type=1107 audit(1588664933.084:3253): pid=824 uid=103 auid=4294967295 ses=4294967295 msg='apparmor="DENIED" operation="dbus_method_call"  bus="system" path="/org/freedesktop/NetworkManager" interface="org.freedesktop.DBus.Properties" member="GetAll" mask="send" name=":1.11" pid=21256 label="snap.foliate.foliate" peer_pid=825 peer_label="unconfined" May  5 10:48:53 subroot kernel: [ 7738.855762]  exe="/usr/bin/dbus-daemon" sauid=103 hostname=? addr=? terminal=?' May  5 10:48:53 subroot kernel: [ 7739.078823] audit: type=1107 audit(1588664933.308:3254): pid=824 uid=103 auid=4294967295 ses=4294967295 msg='apparmor="DENIED" operation="dbus_method_call"  bus="system" path="/org/freedesktop/UPower/devices/DisplayDevice" interface="org.freedesktop.DBus.Properties" member="GetAll" mask="send" name=":1.48" pid=21256 label="snap.foliate.foliate" peer_pid=1277 peer_label="unconfined" May  5 10:48:53 subroot kernel: [ 7739.078823]  exe="/usr/bin/dbus-daemon" sauid=103 hostname=? addr=? terminal=?' May  5 10:48:53 subroot kernel: [ 7739.241415] audit: type=1107 audit(1588664933.468:3255): pid=824 uid=103 auid=4294967295 ses=4294967295 msg='apparmor="DENIED" operation="dbus_method_call"  bus="system" path="/org/freedesktop/UPower/devices/DisplayDevice" interface="org.freedesktop.DBus.Properties" member="GetAll" mask="send" name=":1.48" pid=21255 label="snap.foliate.foliate" peer_pid=1277 peer_label="unconfined" May  5 10:48:53 subroot kernel: [ 7739.241415]  exe="/usr/bin/dbus-daemon" sauid=103 hostname=? addr=? terminal=?' May  5 10:48:53 subroot kernel: [ 7739.359433] audit: type=1400 audit(1588664933.588:3256): apparmor="DENIED" operation="open" profile="snap.foliate.foliate" name=2F6D656469612F737562726F6F742F46696C65732F43687269737469616E2065626F6F6B732F43686F73656E5F6275745F467265655F5F415F42616C616E6365645F566965775F353937363437303835392E65707562 pid=21256 comm="pool" requested_mask="r" denied_mask="r" fsuid=1000 ouid=1000


How can I expand a partition into non adjacent free space using GParted?

My dual-boot machine has partitions as follows:   sda1 50 GB NTFS sda2 15 GB unallocated sda3 20 GB ext3 sda4 20 GB ext4   I would like to allocate the unused space on sda2 to my Ubuntu partition on sda4, hopefully leaving the other two partitions untouched, leaving this configuration:    sda1 50 GB NTFS sda3 20 GB ext3 sda4 35 GB ext4   Is this possible? If so, how can it be done, preferably using GParted?


Buying alcohol duty free under 21 when departing the US?

Is it legal/possible to purchase alcohol as duty free upon departure from the US, having attained the drinking age in the destination country but not in the US?  It seems like even though you are buying it in the US, since it's for exclusive use in another country it should be allowed.....but I can see it being illegal to buy anyway.


In the context of free or faithful group actions, what is the stabilizer subgroup when the set is empty?

My book is Connections, Curvature, and Characteristic Classes by Loring W. Tu (I'll call this Volume 3), a sequel to both Differential Forms in Algebraic Topology by Loring W. Tu and Raoul Bott (Volume 2) and An Introduction to Manifolds by Loring W. Tu (Volume 1).  I refer to .  Let $M$ be a set, possibly empty. Let $G$ be a group, possibly a singleton. Let $G$ act right on $M$ by the action $\mu: M \times G \to M$. For each $x \in M$, let $\text{Stab}(x):=\{g \in G | \mu(x,g) = x\}$ denote a stabilizer subgroup of $G$. Let $1_G$ be the identity of $G$.  I understand definitions of $\mu$ to be free as follows:   : $\mu$ is free if for all $g \in G$, if there exists $x \in M$ such that $\mu(x,g)=x$, then we have that $g=1_G$.  in : (same as 's, given above) : $\mu$ is free if for all $x \in M$, $\text{Stab}(x) = \{1_G\}$   Question 1: For Wikipedia's and jgon's definitions, there is no explicit reference to stabilizers. For Tu's definition, how do I understand $\text{Stab}(x)$ for $M$ empty and $G$ not a singleton?  Question 2: Similarly, for the definition of faithful as     $$\bigcap_{x \in M} \text{Stab}(x) = \{1_G\} \tag{2a}$$   How do I understand $\mu$ as never faithful for $M$ empty and $G$ not a singleton?  My attempt to understand:   For Question 2, I think I can apply , by $M$ empty assumption to say $\bigcap_{x \in M} \text{Stab}(x) = G$. Then I apply $G$ not a singleton assumption to get $\bigcap_{x \in M} \text{Stab}(x) \ne \{1_G\}$. For Question 1, I think we somehow say $\text{Stab}(x) = G$ for all $x \in M = \emptyset$ by some vacuousness argument. I'm not really sure.


Is it possible to check out subdirectories of a repository in Git?  Imagine I am setting up a new WordPress installation. I will create two new directories for my plugin and theme customization:   wordpress/wp-content/plugins/myplugins/  wordpress/wp-content/themes/mytheme/   I want to maintain these directories via Git. In Subversion, I would accomplish this by having trunk/myplugins/ and trunk/mytheme/ directories and checking out subdirectories. Does Git have a way to accomplish the same task using a single repository?  I could just be missing the boat on some Git paradigm, as a long time SVN user with little exposure to Git.  Edit:  storing different content is an interesting way to handle this.


Can a US expat have and use an HSA for the tax benefits while living abroad?

I am a US expat living abroad. As some of you may know, I still have to pay US taxes on my foreign income, even though I've been abroad for more than 5 years.  That said, I obviously want to minimize my taxable income. I'm looking into an HSA as one option to do this. It seems I only need a US address to open an HSA account, but can I deduct the contributions to this HSA from my taxable income and use this money to pay my medical expenses. I do have a high deductible health plan (HDHP), but based in the country I currently reside.  My question: Does anyone see any problems with doing this? Obviously I'd need an account that allows ATM withdrawals, since the healthcare providers here won't likely accept a check or debit payment.


I would like to know where gravity gets its energy to attract physical bodies?  I know that the law of conservation states that total energy of an isolated system cannot change. So gravity has to be getting its energy from somewhere, or else things like hydropower plants wouldn't be able to turn the power of the falling water into a spinning rotor.  Just to be clear, Lets create an example:  Lets say we have two objects with equal mass close to each other. So gravity does its job and it pulls each other closer, this gets turned into kinetic energy. This is where I'm lost. According to the law of conservation energy can't be created or destroyed and the kinetic energy comes from the gravitational pull so where does the gravitational pull gets its energy.  If that energy isn't being recycled from some where else then that means you have just created energy, therefore breaking the law of conservation.


Adding letters in hyphenation of Swedish words

Swedish writing conventions states that in compound words, when three successive identical consonants occur, one of them should be omitted. An example of this is glass (ice cream) and strut (cone), which form the compound word glasstrut (ice cream cone), not glassstrut.  Another example is ägg and gula, which forms äggula (egg yolk), not ägggula.  It might seem like a strange rule, and sometimes it creates strange results. As an example, it is impossible to distinguish between the written words glass-strut (ice cream cone) glass-trut (a gull made of ice cream) and glas-strut (a cone made of glass), but most words don't have this ambiguity (äggula can't mean anything else besides egg yolk regardless how it's pronounced).  However, if a hyphenation occur between the two consonants, the third one should be added. This means that äggula should be hyphenated as ägg-gula. Other examples would be till-låta, till-lämpa, topp-position.  Is it possible to achive this kind of hyphenation with Latex? Ideally, I am searching for a solution both for the whole document (like \hyphenation works, for i.e. äggula) and in the text, for cases like glasstrut which could be hyphenated differently depending on the meaning (glass-strut, glass-trut).  Testing shows that none of the above words gets correct hyphenation (using Polyglossia and Xelatex). If I add an entry manually with \hyphenation, I get the hyphenation at the correct place, but I don't know how I could add the "missing" letter.   \documentclass{article} \usepackage{polyglossia} \setmainlanguage{swedish} \begin{document} \hyphenation{glass-trut} Oh Norrmalmsregleringen, ho samt Västerbron och Tranebergsbron. glasstrut krigsåren var Larsson även en ledande nordisk  \end{document}   (Hyphenation should occur in the word "glasstrut", the other words are just there for filling)


GParted shows 6 partitions, how did that happen while the maximum partitions allowed is 4?

While installing Linux Mint on my laptop (pre-installed with windows), I erased the main partition for windows and created a swap partition and root partition. Considering there was already an EFI, a recovery and 2 random ntfs partitions already in place, my partition table shows a grand total of 6 partitions (and some free space thrown in the middle), none of which are extended partitions. See picture below for details    However, I just learned that hard disks don't allow for more than 4 primary partitions. Not only is my HDD functioning fine as is, it started with FIVE partitions before I started fooling around with it. How did this happen and did I just corrupt my hard drive? If not, where can I find out how many partitions are allowed on my hard drive? or Are they not primary partitions at all?


Was Harry a very powerful wizard when he casts the patronus charm at the dementors?

I was just watching Harry Potter "Prisoner of Azkaban". Just before the scene where Harry casts the patronus spell to get rid of the Dementors, Hermione says:     Only a really powerful wizard could have conjured it.   I know the scene is a little bit different from the book where Hermione isn't with Harry at that point, but either way the question is the same.   At that point was Harry a really powerful wizard?   What does "really powerful wizard" mean?  Could the part of Voldemort inside of Harry have enhanced Harry's powers to help him cast the patronus charm even though Voldemort himself doesn't cast that particular spell?


How to interpret regression coefficients when outcome variable was transformed to $1 / \sqrt{Y}$?

In OLS regression, what does a one unit change in X represent in terms of a beta-related change in Y when the outcome variable has been transformed to $1/\sqrt(Y)$?   (Transformation was done to ensure linearity in the model. My predictor variables are 0-1 dummies.)  I've consulted the following useful posts, but I still don't know what is the answer:


evaluation of limit $\lim_{n\rightarrow \infty}\left(\frac{n!}{n^n}\right)^{\frac{1}{n}}$

Calculate the value of the limit      $$ \lim_{n\rightarrow \infty}\left(\frac{n!}{n^n}\right)^{1/n} $$   Can we solve this without using a Riemann sum method? If so, how?


I had a program looking for MSVCR100.dll, which after some looking realized it is a part of Microsoft Visual C++ 2010. I found a download here:    However I was wondering: does Microsoft have a page with links to each version of Visual C++, or some official way to browse the different versions? The page I linked has no category tree, so I cannot use it to navigate "up", and if I do a search:    it gives over 10 pages of results.


CMD.EXE limits windows size to screen size

Is there any way to get a command window larger than the monitor (screen) size. I have multiple monitor, so the desktop size is wider that the monitor, but even after using MODE CON COLS=300, CMD.EXE won't let the window size be dragged larger than the monitor size. It adds scroll bars instead!  I suspect the answer is NO!


I'm currently using the latest version on Ubuntu. It's great but I would like to use windows 10 as there are many more games and aplications running on that operating system. Is there any way i can dual boot or get windows without loosing all of my data.  I'm new to computer stuff as i have only just built mine. Thanks in advance.


What is the history of adding the a- prefix to form words?

I have always found the a- prefix to words (as in anew, ajar, aside, awake, afoot, a-hunting, etc.) fascinating. The NOAD says on this topic:     a- 2.  prefix      •to; toward : aside | ashore.      • in a specified state or   manner : asleep | aloud.      • in the   process of (an activity) : a-hunting.      • on : afoot.      • in : nowadays.      ORIGIN   Old English , unstressed form of on.      a- 4. prefix      1 of: anew.      [ORIGIN: unstressed form of of ]      2 utterly: abash. [ORIGIN: from Anglo-Norman   French (corresponding to Old French   e-, es-), from Latin ex.]   While this gives quite a few examples, it leaves some areas of doubt to me:   At what time did this phenomenon happen? It seem quite restricted to words of Saxon origin, as I don't see it used with words of Romance languages. Is that a consequence of point 1, or is it because usage wouldn't aggregate an Old English prefix with, e.g., a word of French origin? Were there others words formed which haven't endured?  Arguably subjective: I wonder how it came to pass that the same prefix is used with so many different meanings.


I have started blender and can't see my menus. Any suggestions on how to fix?  As can be seen from the attached image I cant get the top and bottom menu's.  Uninstalled and re-installed and did not fix.


Generate JWT token for external app - SSO

We are setting up a Salesforce Community and our community members should be able to automatically login using the credentials from an extenal platform when clicking on a link from this platform. I'm trying to generate a JWT token (Please find below the class I've made to generate the JWT) and I've created a connected app to get a consumer key. public inherited sharing class JWTAuthFlow {  public static string createJWT(String iss, String sub, String aud, String endpoint){     // Static Resource to get the Key that will be used for Crypto-Sign     StaticResource jwtPrivate = [SELECT Id, Body FROM StaticResource WHERE Name = 'JWT_Private_key' LIMIT 1];     String privateKey = jwtPrivate.Body.toString();          //Create Body of the Json that contains enpoint URL, Consumer Key, Type, ect     JSONGenerator jsonHeader = JSON.createGenerator(false);     jsonHeader.writeStartObject();     jsonHeader.writeStringField('alg', 'RS256');     jsonHeader.writeStringField('typ', 'JWT');     jsonHeader.writeEndObject();     String encodedHeader = EncodingUtil.base64Encode(Blob.valueOf(jsonHeader.getAsString()));          JSONGenerator jsonBody = JSON.createGenerator(false);     jsonBody.writeStartObject();     jsonBody.writeStringField('iss', iss);     jsonBody.writeStringField('sub', sub);     jsonBody.writeStringField('aud', aud);     jsonBody.writeNumberField('exp', Datetime.now().addMinutes(3).getTime());     jsonBody.writeEndObject();     String encodedBody = EncodingUtil.base64Encode(Blob.valueOf(jsonBody.getAsString()));     String jwtRequest = encodedHeader + '.' + encodedBody;          // Sign JWT Request     Blob key = EncodingUtil.base64Decode(privateKey);     Blob rs256sig = Crypto.sign('RSA-SHA256', Blob.valueOf(jwtRequest), key);     String signature = EncodingUtil.base64Encode(rs256sig);     signature = signature.replace('+', '-');     signature = signature.replace('/', '_');     String signedJwtRequest = jwtRequest + '.' + signature;          // Create the payload     String payload = 'grant_type=urn:ietf:params:oauth:grant-type:jwt-bearer';     payload += '&assertion=' + signedJwtRequest;        // Create a HttpRequest and send it to server     Http httpObj = new Http();     HttpRequest req = new HttpRequest();     HttpResponse res;     req.setEndpoint(endpoint);     req.setMethod('POST');     req.setHeader('Content-Type', 'application/x-www-form-urlencoded');     req.setBody(payload);     res = httpObj.send(req);          if(res.getStatusCode() == 200){         Map<String, Object> mapTokenResponse = (Map<String, Object>)JSON.deserializeUntyped(res.getBody());         return (String)mapTokenResponse.get('access_token');     }          return res.getBody(); }  } I have the following error when I try to generate a JWT: 'Unrecognized base64 character:-' (I can see from system.debug that it generates the header and the body, but not the signature). I don't know what I'm doing wrong ? It's the first time I'm working with JWT so I don't know if I've missed something. The developer from the external app is waiting for the token, and the returnURL (the path). Is there something else I need to give him ?


Webforms and jQuery, how to match the ID's?

I want to use jQuery with asp.net webfoms.  Do I need to get a special toolkit so the .net controls spit out friendly Control ID's?  Reason being, I don't want to write javascript referencing my html ID's like control_123_asdfcontrol_234.  Has this been addressed in version 3.5?  (I remember reading you have to get some special dll that makes ID's friendly).


I have now played the A Night To Remember questions twice. My follower (I also married him for the convenience factor) Marcurio. I am playing on PS4. First time through, Marcurio followed me into the Grove and when I was teleported back, he was gone. I picked him up at The Bee and Barb, so naturally I checked to see if he was there. Nope. Then went to Solitude where our house is with our two kids. Nope, not there either. I waited 3 days in each location. Nothing. So I went back, reloaded, and the second time around, I told him to wait in my house in Riften. I flew through the quest a second time, came back to Honeyside. Nope. He's gone. Checked The Bee and Barb (again), nope. Went to Solitude again, kids were there, dad no where to be found. How can I complete this quest without looking my follower/hubs?


Establish convergence of the series: $1-\frac{1}{2}-\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}-...$ The number of signs increases by one in each "block".  I have an idea. Group the series like this: $1-(\frac{1}{2}+\frac{1}{3})+(\frac{1}{4}+\frac{1}{5}+\frac{1}{6})-...$  We can show that $1, \frac{1}{2}+\frac{1}{3},\frac{1}{4}+\frac{1}{5}+\frac{1}{6},...$ converges to 0. I'm trying to use Dirichlet's Test. However, I'm not sure wether this sequence is decreasing.  Any idea? Or any other method to establish the convergence?


I was wondering if someone can assist me if it is worth re applying and if I can do it on my own or if I need an advisor? was anyone successful when re applying?     reasons for refusal      you have applied for a visa to visit the UK   in deciding whether you meet the requirements of appendix of the immigration rules for visitors I have considered.   your application and any additional relevant information you have provided with it         your immigration history   an interview with you   an interview with your sponsor         the Decision      i have refused your application for a visit visa because i am not satisfied that you meet the requirement of paragraphs v4.2 of the appendix rules for visitors because:      you have applied for entry clearance to the UK for a period of 13 days, Under UK immigration rules, you must show that you qualify for a visa by explaining your own circumstances and the plans you have for the visit.      you state that you are employed by burnard international and earn $3760NZD (Euro 1965.53 Oanda exchange rate 10/01/2019 and in support of your application you have provided a bank statement account number ending 371 whilst i am able to reconcile some payments i am unable to reconcile to total amount that you have declared in your application form. you state that during your 13 day trip you will personally spend $4000.00 Euro 2112.27, however your balance as of the 20 decemver 2018 was $3897.70 Euro 2058.25, but based on the information you have provided i am not satisfied that you have the funds available to cover the cost of your trip. In addition to this i note that you will be spending all of the funds in your account on a 13 day trip to the UK, which i do not find to proportionate to your economic circumstances.      You have also stated that the main purpose of your trip to the UK is to attend the memorial service of your close friend however i am not satisfied that you have been able to demonstrate that a service is due to take place. in light of the information provided in support of your application.I am not satisfied that your circumstances in New Zealand coupled with your reasons for wishing to travel to the United Kingdom are such that you intend a genuine visit or that you would seek to leave the UK at the end of the limited period stated by you. furthermore i am not satisfied that the documents provided represent a true reflection of your financial. Your application is therefore refused under paragraph V4.2 (a) (c) and (e)


I got refused twice for B1 Visa, is it okay to apply once again?

I am from India. I am planning to attend the conference. We are a team of 4 members.   1st Attempt     VO: How was your day?      Me: Great and how about you?      VO: Perfect? What's the purpose of your visit to the USA?      Me: I am going to attend the Conference ABCD ...   (After a pause) Do you want to look at the invitation letter?      VO: No and where you are going to stay?      Me: I was going to stay at ABCD place.      VO: What you are going to do in the meetup?      Me: I am going to do ABCD.......      VO: Ok. Who is sponsoring for you?      Me: My college secretary is sponsoring for my team. (Do you want a   look at the sponsorship letter)      VO: No. Have you married?      Me: I have not completed the under graduation and I am single.      VO: Sorry for this time. Given the form 214(B)   I didn't understand why I got refused. I wanted to give it a try once again, so I applied a second time. Second time my interviewer is very serious and she did not even smile.  2nd Attempt     VO: How was your day?      Me: Great and how about you?      VO: Good and whats the purpose of your visit?      Me: I was asked to attend the ABCD.      VO: What mother and father do?      Me: My father was ABCD and my mother   is a housewife.      VO: What is your financial income?      Me: It was ABCD details.      Vo: Sorry for this time, you got rejected.   For the second time, I'm thinking she has looked into our financial status and my family members occupation and that's why I got refused.  I have many doubts about whether can I apply once again. After talking with one of my relatives he mentioned its not a wise idea to apply once again and mentioned the chances of getting accepted is 0% for the next time.  But I want to try once again.  Questions I have:   Is it a wise idea to apply once again after refused two times form B1 Visa?


How did the Jedi learn of the Rule of Two in canon?

Referring to  which is focused on the Legends answer, how did the Jedi come to learn of Darth Bane's Rule of Two if they are believed to be extinct? Is the answer and sources in canon the same as in Legends?  Edit: I don't know why I have to explain why this is not a duplicate, because   You would think if I mentioned that question in mine, then that means there is something more that I am looking for that that question doesn't answer. That question's description clearly asked - and I explicitly mention it here too - for answers from Legends. I am looking for verification if the answers given are also true for canon or if the canon answer is different - neither of which were addressed there. The accepted answer, dated to 2013 and lasted edited 2014, is one I've seen long before the EU became Legends. There's no indication if it's still valid in canon, since that question accepts Legends answers. The remaining answers date to 2012, including the one mentioning there's none in canon. It's been almost 4 years since then, and a month since Ep VII came out, a lot has happened since then.   I'm seeking a canon-specific verification, that question accepts Legends and the answers do not provide nor seek distinction between either.


Violation of the IID assumption in Gradient Boosting

Generally, machine learning methods make little to no statistical assumptions. However, a key assumption they do make is that the data are IID.  What are the implications of a violation of the independence of the labels assumption for sequential gradient boosting? To be concrete, a Gradient Boosted Decision Tree.  In ensembles that exclusively use bagging (e.g., random forest), it is very easy to see what happens: the variance reduction from bagging results from the fact that the errors of the base learners are uncorrelated (say a white noise); the expected value of noise is zero and the noise diversifies away. If the independence assumption is violated in random forest, then you will see that the out-of-bag (OOB) error is unreasonably low (because the samples are correlated) and inconsistent with the validation error.  Is there a similar thought experiment one can do to make conclusions about what happens in GBDTs when the data have non-independent labels?


Why does it not notify you when question is put on hold?

I find it impossible to track all the questions that I ever asked. If at some point my question is put on hold, why am I not notified to make changes to it unless I go that question directly on each site? Sometimes questions gets flagged without anyone leaving comments thus there is never notification in inbox.


We have a weird issue on one of our sites.  The site in question forces https for all traffic but it throws a security error for some users. Different browsers, settings and network environments make it almost impossible to determine the cause of why the user is getting the error.  But, and here comes the question: when I try the same site on my machine, I get the security error in Firefox (v22) and not in Chrome or Safari, or in a VM running Windows 7 and IE9.  www.domain.com uses an invalid security certificate.  The certificate is not trusted because no issuer chain was provided.  (Error code: sec_error_unknown_issuer)  Is this an issue on the back-end and is Firefox the only browser failing because of it, or is it a problem in Firefox, thus making it a local browser problem?  Any feedback would be highly appreciated!


How to design to avoid two-way reference between two tables

I am having a problem with foreign keys between two tables. I am trying to model a relationship between members of a club and their relatives. This is a straightforward many-to-one relationship, with many relatives related to one member. However, one and just one of this relatives must be the main contact. Also, many members can have the same relative as main contact (siblings to their father as an example).  EDIT: Members are kids, and relatives must be adults, so relatives can't be members, and members can't be main contact of another member.  A FK on member table refering the PK of relatives would work, but this will leave me with a circular reference and a "chicken-or-egg" problem.  What is the right approach to this kind of problems? Maybe I am just thinking it too much.  Schema is more or less like this:   +--------------+    +-------------+ | member       |    | relatives   | +--------------+    +-------------+ |id            |<-+ |id           |<-+ |name          |  +-|*member_id   |  | |address       |    |name         |  | |phone         |    |relationship |  | |...           |    |phone        |  | |*main_contact |-+  |...          |  | +--------------+ |  +-------------+  |                  +-------------------+


Lightning component : Get the id of a record

In a lightning component I display a list of articles (Article__c custom object) so I ca see, for example, the name of the article, the price, and a button that I'd like redirect to another component which display the details of the article selected.   For now I'm just trying to get the id of the article, in a basic alert in javascript, but I doesn't work : it says the id is null.   Here is a part of the component :  <aura:handler name="init" value="{!this}" action="{!c.doInit}" /> <aura:attribute name="wrappers" type="ListeArticlesWrapper" /> <aura:attribute name="articles" type="Article__c" />  <aura:attribute name="Detail" type="String"/> <aura:registerEvent name="navigate" type="c:NavigateToDetail"/>

Liste des articles

                     	                     Nom	                     Type	                     Prix

                 <aura:iteration items="{!v.wrappers}" var="wrap">
                                                      <ui:inputCheckbox value="{!wrap.selected}" />                         	                                                     <ui:outputText value="{!wrap.art.Name}" />                         	                                                      <ui:outputText value="{!wrap.art.Type__c}" />                         	                                                      <ui:outputText value="{!wrap.art.Prix__c}" />                         	                                                      <button class="slds-button slds-button--neutral slds-not-selected"                                      onclick="{!c.getDetail}" data="{!wrap.art.Id}">Details</button>
                 </aura:iteration>

   The associated controller js (with the function getDetail)  ({ doInit : function(component, event, helper) {     helper.init(component, event); },  getArticles : function(component, event, helper) {     helper.getArticles(component, event); },  getDetail : function(component, event, helper){     var id = event.target.getAttribute("data-data") || event.target.parentNode.getAttribute("data-data")     alert('detail article : id = ' + id); //it gives me null } })   Thanks !  EDIT  And the wrapper class in case you wonder what is the "art" :  public with sharing class ListeArticlesWrapper { //wrapper pour récupérer les articles selectionnés @AuraEnabled public Article__c art {get; set;}  @AuraEnabled public Boolean selected {get; set;} }


Is this a compound adjective, and if so, what parts of it should be capitalized in a title?

I am currently proofreading some documents which go by the title "Pre and Post Visit Materials". For the life of me, I can't decide whether "post visit" counts as a compound adjective in this instance and therefore needs a hyphen. If it is a compound adjective, then in the title would "Post-Visit" or "Post-visit" be correct? If it isn't a compound adjective, would anyone mind explaining to me why? Also, is it acceptable to leave "pre" as a stand-alone word without any additional punctuation? Thanks so much for your help!


Where can I see the original message from an approved LinkedIn invitation to connect?

I have accepted a few invites from the top navbar button, but then I realised some had possibly useful or interesting messages attached.  How can I retrieve LinkedIn invitation messages in the 2015 redesigned messaging system?


Setting up new mail server and avoiding spam filters

So I'm attempting to setup a mail server on my web server using this guide:    I've since completed it but after trying to go through the steps I am still getting caught in spam filters. Using mail-helper it shows that I'm still missing some errors which rates my emails at a 6.5/10 on their site.   Delivered-To: phlexplexico@gmail.com Received: by 10.31.184.13 with SMTP id i13csp1858421vkf;         Tue, 31 May 2016 00:47:50 -0700 (PDT) X-Received: by 10.140.96.67 with SMTP id j61mr28418706qge.74.1464680869983;         Tue, 31 May 2016 00:47:49 -0700 (PDT) Return-Path: <me@website.me> Received: from website.me (website.me. [0.0.0.0])         by mx.google.com with ESMTP id b129si30231541qkf.106.2016.05.31.00.47.49         for <phlexplexico@gmail.com>;         Tue, 31 May 2016 00:47:49 -0700 (PDT) Received-SPF: pass (google.com: domain of x@x.me designates 0.0.0.0 as permitted sender) client-ip=0.0.0.0; Authentication-Results: mx.google.com;        dkim=pass header.i=@x.me;        dkim=pass header.i=@x.me;        spf=pass (google.com: domain of me@website.me designates 0.0.0.0 as permitted sender) smtp.mailfrom=me@website.me;        dmarc=pass (p=NONE dis=NONE) header.from=website.me Received: by website.me (Postfix, from userid 1000)     id 5ACCC144672; Tue, 31 May 2016 03:47:49 -0400 (EDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=x.me;     s=mail; t=1464680869;     bh=LAjdjLF5TLqUzQ9W6ajSnTWHw30oLlaB2WJ/DtN87Ns=;     h=Date:Subject:From:To:From;     b=SszwsO83h0XKdkD5JxPv43f4Tvt40L6tyu450u9LgRyl1RfHwiozl1kdtmtRENnqY      Zrsvs8FcY+ZKks3rla8pdJ/b1bbvsR8dca30wXMpXbnFrmVw4gzC0FKpP+Xf8nut9X      zUlBgx0nESOk1i8aScE+Xt9OGw4QwSfiWg8317rk= X-Spam-Checker-Version: SpamAssassin 3.4.0 (2014-02-07) on website.me X-Spam-Level: ** X-Spam-Status: No, score=2.7 required=5.0 tests=ALL_TRUSTED,HTML_MESSAGE,     HTML_MIME_NO_HTML_TAG,MIME_HTML_ONLY,MISSING_MID,MISSING_MIMEOLE,     T_DKIM_INVALID autolearn=no autolearn_force=no version=3.4.0 Received: from [192.168.0.141] ()     by website.me (Postfix) with ESMTPSA id EB7A5144670     for <phlexplexico@gmail.com>; Tue, 31 May 2016 03:47:48 -0400 (EDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=x.me;     s=mail; t=1464680869;     bh=LAjdjLF5TLqUzQ9W6ajSnTWHw30oLlaB2WJ/DtN87Ns=;     h=Date:Subject:From:To:From;     b=SszwsO83h0XKdkD5JxPv43f4Tvt40L6tyu450u9LgRyl1RfHwiozl1kdtmtRENnqY      Zrsvs8FcY+ZKks3rla8pdJ/b1bbvsR8dca30wXMpXbnFrmVw4gzC0FKpP+Xf8nut9X      zUlBgx0nESOk1i8aScE+Xt9OGw4QwSfiWg8317rk= Date: Tue, 31 May 2016 01:47:46 -0600 Subject: Tester From: Me <me@website.me> To: phlexplexico@gmail.com Importance: Normal X-Priority: 3 X-MSMail-Priority: Normal MIME-Version: 1.0 Content-Type: text/html; charset=utf-8 Content-Transfer-Encoding: base64 Message-Id: <20160531074749.5ACCC144672@website.me>  PHAgZGlyPSJsdHIiPkhleSB0aGVyZSEgTGV0J3Mgc2VlIGlmIHRoaXMgaXMgbm90IGJsb2NrZWQu PC9wPgo=   I removed some info about my website as it is personal, but I know the DNS checks are correct and they all work. However, what mail-tester gives me an error about is certain headers, such as missing MIME-OLE and           Message only has text/html MIME parts You should also include a text version of your message (text/plain)   So what am asking mainly is where can I edit my headers to include or remove X-MSMail-Priority from the headers, and how can I send a text version of the email via postfix/dovecot? I'm also just using the gmail app to send these emails through my account. Thanks in advance for the help!


How can I set Perl's inclusion path for modules for a CGI script?

I’ve got several Perl modules installed on my hosting machine in ~/perl, how do I add them to Perl module path? Setting PERL5LIB or unshifting the paths to @INC surely works, but the environment variable does not help when running as a CGI script and the @INC way is not very portable. Is there a better way? This has to be a common problem, am I missing something?


Looks to be an obscure page rendering problem

This  looks to be written correctly, however the link that should read "this page" is extended to include all text in the question up to the next link. I can't see any error in the question, am I missing something?


Since we homo sapiens (and all other species) are continuously evolving, are humans undergoing speciation based on our environment? OR has there been any difference across people that could say speciation has already happened?  PS: I am asking this question because I have recently seen a documentary in which some Chinese anthropologists claim that Chinese people are a different species altogether. Ref:  (Section )


What options exist when the vendor does not supply an ADB driver for an Android device?

I bought an Android phone and the vendor does not offer any drivers whatsoever. The Android SDK and the drivers that come with it don't seem to work with the device, but the device itself reports as Android 2.2.1.   Other users have reported that the drivers of the Nook Color worked for them, but I cannot confirm this, after trying.  What options do I have to connect to the device (and ultimately to root it)?  Is it truly just the .inf file that I need to manipulate in order to make the device ID known to Windows? After all there are tools to figure out those strings while the device is connected (although "unknown") ...  The model in question is a Simvalley SP-60 GPS.  Note: The OS I need drivers for is either Windows 7 x64 or, if anyone has successfully done that, Windows XP 32bit (under VMware with the USB device connected to it).


I have a file $ocsp_resp_file with the following content:  1432599306989.cer.tmp: good     This Update: May 23 12:54:14 2015 GMT     Next Update: May 30 12:54:14 2015 GMT   I am only interested in the lines starting with "This Update:" and "Next Update:". I would like to retrieve those lines and strip out the spaces and text before the timestamp.  It should end up looking like this:  May 23 12:54:14 2015 GMT May 30 12:54:14 2015 GMT   I am using the following code to return each one but not quite how i want it.  $search = 'This Update';         $lines = file($ocsp_resp_file);         foreach($lines as $line)         {         $line = ltrim($line);           if(strpos($line, $search) !== false)           //$line = str_replace('This Update: ', '', $line);             echo $line;         }   The above code returns this:  This Update: May 23 12:54:14 2015 GMT   I then tried to remove "This Update: " using the following code (now commented out) but it breaks the logic of the code and each line is returned  $line = str_replace('This Update: ', '', $line);


I'm not sure I recall enough of this story for a good identification, and the below is definitely out of story order, but...  The POV character goes to his home town and finds it different. He later finds that he's trapped in the town; there are two young people who turn out later on to be ... avatars ... of Ormazd and Ahriman, and the town is a battleground; what he is seeing of the town is Ahriman's effect on the town, and he turns out to have some limited ability to see the original town, which is more-or-less Ormazd's version of reality. In the end, Ahriman's avatar is destroyed, and the town restored.  I read this in the '80s or earlier; it was part of my father's collection, and the book was showing its age; I think it more likely to be the '60s rather than the '50s, and was probably by a prominent name in SF, but not one of the Masters.


How to make the rendering process less resource consuming

I am new to blender and I really love it. I have completed some tutorials from tutor4u on youtube. I have a HP Probook 4530s with a core i5 2430M CPU and the problem is that when rendering files the CPU temps reach about 99C or about 210F which It think is not good.I have tried limiting the threads to 1 but then one of the core heats up to 200F or 95C. P.S. I am not sure if my computer has a graphics card. It does have Intel Integrated Graphics.


TikZ: remove margin, padding, border around nodes containing images

I want to create a simple figure where images are connected with arrows. Here is what I did:  \begin{tikzpicture} \node[](A) {\includegraphics[width=0.2\textwidth]{a}}; \node[right=1mm of A](B) {\includegraphics[width=0.2\textwidth]{b}}; \draw[->] (A) to (B); \end{tikzpicture}     But I want the arrow to start and end right at the images with no space between. How can I do that?


Find all the positive natural solutions of $x^2+y^2=3z^2$. I guess it has something to do with Pythagorean triples, but I don't know how to relate it properly. Suggestions, hints, or any sort of assisting is welcome.


What overwrites /etc/resolv.conf on every boot?

I was given the files for a mini linux, that boots directly into firefox. It works for all it should be doing, only that I do not get an internet connection.  We have 3 DNS servers in the network, which all work. I can ping them, too. But when trying to ping google.de or wget google.de I get a bad address error.  nslookup google.de works for some reason.  I tracked the issue down to my resolv.conf on the booted system not having the same contents as the resolv.conf that I put into the .iso file.  I tried understanding all the factors that go into creating and modifying resolv.conf. I'm not quite sure I got it all, but I definitely didn't find my solution there.  So as a last ditch effort, I tried making the resolv.conf file immutable using   :~# chattr +i /etc/resolv.conf   When rebuilding and booting again to my surprise my file was renamed to resolv.conf~ and in its place was the same standard file that has been haunting me.   The file contents make me believe it gets the information from the network itself. When starting the .iso in Virtualbox without internet access, my file is being kept as it is.  I tried changing /etc/dhcp/dhclient.conf to not get the information from the net, by deleting domain-name-server and domain-name-search from the request part of the file.  Didn't work unfortunately.  I don't have the NetworkManager installed. The iso is based on Ubuntu 14.04.  There is probably vital information missing. I'm happy to provide it.  UPDATE:  I think I found the file that clears resolv.conf.  It seems to be /usr/share/udhcpc/default.script  #!/bin/sh  # udhcpc script edited by Tim Riker <Tim@Rikers.org>  [ -z "$1" ] && echo "Error: should be called from udhcpc" && exit 1  RESOLV_CONF="/etc/resolv.conf" [ - n "$broadcast" ] && BROADCAST="broadcast $broadcast" [ -n "$subnet" ] && NETMASK="netmask $subnet"  case "$1" in     deconfig)         /bin/ifconfig $interface 0.0.0.0         for i in /etc/ipdown.d/*; do             [ -e $i ] && . $i $interface         done         ;;      renew|bound)         /bin/ifconfig $interface $ip $BROADCAST $NETMASK          if [ -n "$router" ] ; then             echo "deleting routers"             while route del default gw 0.0.0.0 dev $interface ; do                 :             done              metric=0             for i in $router ; do                 route add default gw $i dev $interface metric $((metric++))             done         fi          echo -n > $RESOLV_CONF # Start ----------------           [ -n "$domain" ] && echo search $domain >> $RESOLV_CONF         for i in $dns ; do             echo adding dns $i             echo nameserver $i >> $RESOLV_CONF         done         for i in /etc/ipup.d/*; do             [ -e $i ] && . $i $interface $ip $dns          done # End ------------------         ;; esac  exit 0   It's part of the udhcpc program. A tiny dhcp client, that is part of busybox  Will investigate further.    UPDATE2 AND SOLUTION:  I commented the part out (#Start to #End), that seemingly overwrites the /etc/resolv.conf file and sure enough. That was the culprit. So an obscure script caused all this trouble.  I changed the question to reflect, what actually needed to be known to solve my problem, so it would be easier to find for people with the same problem and so I could accept an answer.  Thanks for the help here in figuring things out.


What is the minimum wavelength of electromagnetic radiation?

As a first approximation, I don't see how a wavelength of less than 2  could exist. The question is: Are there any other limits that would come into play before that?   For example:   Would the energy density cause the photon to turn into a black hole or something like that? Would the energy of the photon exceed the total mass+energy of the universe?


Determine if a String is an Integer in Java

I'm trying to determine if a particular item in an Array of strings is an integer or not.  I am .split(" ")'ing an infix expression in String form, and then trying to split the resultant array into two arrays; one for integers, one for operators, whilst discarding parentheses, and other miscellaneous items. What would be the best way to accomplish this?   I thought I might be able to find a Integer.isInteger(String arg) method or something, but no such luck.


This is the error message(below) i get when i try to update through update manager. Can anyone help me with this one?  W: Failed to fetch gzip:/var/lib/apt/lists/partial/security.ubuntu.com_ubuntu_dists_precise-security_universe_binary-i386_Packages  Hash Sum mismatch E: Some index files failed to download. They have been ignored, or old ones used instead.


For how long my blue card is valid once I resign from my current job?

I'm an Indian National staying in Germany on a Blue card. Now I'm about to resign from my current job and move to the US for a new one.   My question is, for how long will my blue card be valid? Can I use it for visiting the EU as a tourist at an later point?


Samsung laptop, Stop charging at 80% and says Plugged in but not charging

After I upgraded Windows 7 to Windows 10 in my Samsung laptop, the AC charging stop at 80% and show "plugged in, not charging".   Then I downgraded back to Windows 7, problem still exists.  I have tried :   Shut down  Remove battery  Boot up on AC power  Uninstall the ACPI-Compliant Control Method Battery driver  Shut down  Reinsert battery  Reboot   Still cannot fix the problem. I am wondering whether it is a configuration problem?


Upgrade to 17.10 breaks phpmyadmin configuration

I was asked to rephrase this posting as it was mistakenly confused with another question. So here is the rewrite:  I upgraded my server to 17.10. I had to run a2enmod to fix the php7.1 problem as mentioned elsewhere, and then everything worked fine - which I knew because the website was written in PHP and it worked as before. The only thing that was broken was phpmyadmin. When I ran it, all I got is a bunch of text. I tried purging it from the system and then reinstalling it, but no no avail.


MacBook Pro screen is strange, but not with external screen

My sons MacBook Pro 13" Retina (Early 2015) has a problem with the built-in screen. It will very shortly look OK, followed by what to me looks like a HW  issue, with strange patterns and lines.  But the odd thing is that whenever I plug in the HDMI, to an external screen - both the built-in, and the external screens look fine.  Sometimes I can also run the machine without the problem happening. I have tried to work the hinge on the screen, but there is no flicker or any reaction.  Is this still a HW issue, or could it be something else?


I'm asked if $\mathrm Z_9$or $\mathrm Z_{17}$ under multiplication is cyclic or not, proof needed. I understand the rules with addition, but under multiplication i can't make sens of the rules. I tried to manually calculate it with but did not find a generator thus i assumed that it is not cyclic but with $\mathrm Z_{17}$ it's a little bit more excruciating, what is the best way to prove if a group like this is cyclic or not? thanks in advance.


Making overview with linked detailed maps in QGIS?

i want to create 4-5 detailed maps, and then an overview map that has rectangles that markes the locations of the detailed maps. Best case would be if the rectangles were links to the detailed map.   I have managed to make the overview and the rectangles, and think I know how to make the detailed maps one by one. The rectangles are drawn manually on the overview map. All layers that I plan on using are in the same QGIS project.  The final product that I hope to create would be the overview map on the first page, followed by the detailed maps. The overview would have links to the detailed maps, click on the rectangles to open the right detailed map.  Is there a way to link the detailed maps to the overview in QGIS 2.8 print composer?  I'm still not sure if I'm doing something wrong, when I try to create the overview. I want it to show the extents of all of my detailed maps.   Is this possible?


Prove that polynomial of degree $4$ with real roots cannot have $\pm 1$ as coefficients (IITJEE)

So I was going through  my 11th class package on Quadratic equations and I saw a question to prove that a polynomial of $4$th degree with all real roots cannot have $\pm 1$ as all its coefficients.   I tried proving it using calculus, by showing that at least one consecutive maxima  and minima will lie either above or below the x axis, but couldn't solve it using that.  I also tried using Descartes Rule of Signs but couldn't solve it with that too. Any help?


I know there's a wealth of Apache documentation, but I can't seem to find the answer.  With the default documentroot - /var/www/html - all is fine. Permissions are - drwxr-xr-x  2 root root 4096 Feb 21 19:06 html/. Permissions for the file within this are: -rw-r--r-- 1 root root 10918 Feb 21 19:06 index.html  When I change the documentroot to /mnt/mounty/testing it no longer works ("Forbidden..."). Permissions for the directory look identical  drwxr-xr-x 2 root  root  4096 Jan 24 18:53 testing/   The html file within this has same owner / group and even more liberal permissions (yes I know not to 777 but this is a local test).  -rwxrwxrwx 1 root  root 39806 Jan 24 18:38 index.html*   What am I doing wrong? I've restarted Apache at every change. The parent folders of the original doc root and the new one are different - but surely this can't matter?


I have just booted my clean Ubuntu 18.04 LTS VM and tried to install some application with sudo apt install.  But got error message:     E: Could not get lock /var/lib/dpkg/lock-frontend - open (11: Resource temporarily unavailable)       E: Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend), is another process using it?   What process created the /var/lib/dpkg/lock-frontend file in Ubuntu? How to gently stop it and take manual control on APT?


How to verify $H\otimes K \cong \bigoplus\limits_{i\in I}H$

Let $H,~K$ be the Hilbert space. if $\{v_{j}\}_{j\in J}\subset H$ and $\{w_{i}\}_{i\in I}\subset K$ are the orthonormal bases, then how to construct the isomorphic mapping: $H\otimes K \rightarrow \bigoplus\limits_{i\in I}H$. Here, the $H \otimes K$ is the tensor product of two Hilbert space.


Difference between gerund and present participle

What is the difference between a gerund and present participle? When should we   use a gerund and when should we use a present participle ?


Problem:     Let $D = \{ n\in\mathbb{N} | 128000 \vdots n\}$. Calculate $\sum_{n\in D} n$.   We can see that $n = 128000k$, and $n$ needs to be even. But I don't know what to do. Any ideas?


I can't understand starred expression in python

I don't understand this code  print(*map(input().find,map(chr,range(97,123))))   This code is written by someone to find the position of each character's (a - z) first appearance when the user type in words. And if the character is not consisted in the word the position will be -1.  so for example if the input is  baekjoon   the output will be  1 0 -1 -1 2 -1 -1 -1 -1 4 3 -1 -1 7 5 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1   `I've written code for this but it is really long compared to the one at the top  a = [i for i in input()] result = 0  for i in range(ord('a'), ord('z')+1):   for j in range(len(a)):     if i == ord(a[j]):       result = j       break     else:       result = -1   print(result, end=" ")   With this code i get the same output but i think it's not well written code. So i really want to understand this code to improve my coding skill   print(*map(input().find,map(chr,range(97,123))))   what does that star do in front of map function and i just don't know what how that code works.


What is the "Ooh Shiny!" hat supposed to be?

Ooh, Shiny!       Flag a question for closing, cast a close, delete or reopen vote on a question. You don't have to be the last vote, and hammers work.   (taken from )  And this is the Ethereum (Bitcoin's rival) logo:    Every time I see that hat, it remembers me of the Ethereum logo. Is this supposed to be an advertisement for the Ethereum Stack Exchange? If not, what is it supposed to be?


Prove that $\exists a,g,h\in G\colon h=aga^{-1}, g\neq h ,gh=hg$ in a finite non-abelian group $G$.

Let $G$ be a finite and non-abelian group.  How do I prove the following statement? $$\exists a,g,h\in G \colon\quad h=aga^{-1},\ g\neq h ,\ gh=hg.$$  Thanks in advance.


How to show that $\sum\limits_{k=0}^n (-1)^k\tfrac{{ {n}\choose{k}}}{{ {x+k}\choose{k}}} = \frac{x}{x+n}$

I'm trying to show that      $$\sum_{k=0}^n (-1)^k\frac{{ {n}\choose{k}}}{{ {x+k}\choose{k}}} = \frac{x}{x+n}$$   I've tried expanding this using definition of binomial coefficient, then binomial expansion, now I'm using induction to simplify $\sum_{k=0}^m (-1)^k\frac{{ {n}\choose{k}}}{{ {x+k}\choose{k}}}$, but it looks very inelegant, is there a better way?


I am trying to add two different sections to my document, a reference and a bibliography. The difference is basically this:  A reference list, generally, contains only sources you have cited in-text in your assignment A bibliography, generally, is a list of all the sources you have used. This means, in addition to listing the sources you cited in-text, you also list resources that you read or referred to generate your ideas about the topic.  My question is, how to automatically move references that are not cited in-text to a new section called "Bibliography" and leave the cited in-text in one called "References"? The code I am using to create the references: \bibliographystyle{agsm} \bibliography{references}  I am currently using BibTex and have a file .bib, which has these references: @article{einstein,     author =       "Albert Einstein",     title =        "{Zur Elektrodynamik bewegter K{\"o}rper}. ({German})         [{On} the electrodynamics of moving bodies]",     journal =      "Annalen der Physik",     volume =       "322",     number =       "10",     pages =        "891--921",     year =         "1905",     DOI =          "http://dx.doi.org/10.1002/andp.19053221004" }   @book{latexcompanion,     author    = "Michel Goossens and Frank Mittelbach and Alexander Samarin",     title     = "The \LaTeX\ Companion",     year      = "1993",     publisher = "Addison-Wesley",     address   = "Reading, Massachusetts" }   @misc{knuthwebsite,     author    = "Donald Knuth",     title     = "Knuth: Computers and Typesetting",     url       = "http://www-cs-faculty.stanford.edu/\~{}uno/abcde.html" }  The latexcompanion is not being cited in-text, so the end goal would be this:


My dad has an old Sears KS-2 + 50mm f/1.7, which from a bit of research seems to use a Pentax K-mount.  I've looked around a bit and found a , which says it supports af-confirmation, and costs ~$30 US.  Has anyone tried using an adapter ring like this, and if so, would you recommend doing so?  I am perfectly happy with shooting manual, but I'm curious about the quality of older lenses.  I'm assuming that if I use older primes the optical quality will be fine, and it looks like the build quality of the older lenses is much better that similarly priced new lenses.


How to compile reference list not directly used in the latex file

I just figured that the reference list are not compiled unless I directly cite them on latex file. Is this the norms?


How does Spell Sniper affect spells that allow ranged spell attacks on subsequent rounds?

The spells , , and  all allow you to make ranged attacks on subsequent rounds.  Wall of Light Until the spell ends, you can use an action to launch a beam of radiance from the wall at one creature you can see within 60 feet of it. Make a ranged spell attack. On a hit, the target takes 4d8 radiant damage.   Storm Sphere Until the spell ends, you can use a bonus action on each of your turns to cause a bolt of lightning to leap from the center of the sphere toward one creature you choose within 60 feet of the center. Make a ranged spell attack. You have advantage on the attack roll if the target is in the sphere. On a hit, the target takes 4d6 lightning damage.   Crown of Stars You can use a bonus action to send one of the motes streaking toward one creature or object within 120 feet of you. When you do so, make a ranged spell attack. On a hit, the target takes 4d12 radiant damage.  The spell sniper feat says:  When you cast a spell that requires you to make an attack roll, the spell’s range is doubled.  To use all of the spells effects, you are required to make an attack roll. That is, they have functions that don't work without a attack roll. Is that reading correct, and if so which of the ranges in each spell are effected?


Is this interference and if it is how is it being caused in these pictures

I link 3  figures below  .      The white bulbs were on my backside on the ceiling as is visible in their reflection in the television. I was sitting almost between (length wise) the bulbs and the television. I took the photographs of their reflection in the LCD.   What are these crosses of rainbow coloured fringes?   Is it interference or diffraction?   And whatever of the 2 it is, how is it happening?   Why only 2 crosses of coloured fringes in the reflection of every bulb , when the angle of each bulb is different?   The bulbs were on my backside so Lloyd's mirror like explanation isn't possible.   Why only 2  crosses of coloured fringes are appearing in the reflection of all the bulbs when they are at different angles?   How is this being caused?   I don't know whether stack exchange is the right place to ask this question by uploading the pictures related to the question , but I couldn't find anyone who could give a reasoning and so I posted it here.   Ever more interesting is that the reflection of the CFL visible in 1st and 2nd pictures is not showing any such pattern.


It's only a hypothetical example.- What will be the time dilatation effect in the following cases. Suppose the video length is 1 hour(with earth) then how long is the duration of these videos on saturn- Playing a youtube video on saturn that was made on earth Playing a youtube that was made and played on saturn Live video calling a person from saturn to earth.


I want to install ubuntu alongside windows 10 but my laptop specifications are: 2G RAM, 300G HHD, 2.16 GHz dual processor. Could that work!? Because my computer is somewhat limited on resources! I winder if that couldn't affect the performance.


Using Google Earth imagery data for portable solution?

I wish to clarify with users who are using Google Earth portable solution. As per portable solution link , we can create part of globe and create offline map to use it.   However FAQ section in :  mentioned as below: Does the Google Earth Portable solution allow you to use Google's imagery? No, the Google Earth Enterprise portable solution is intended to be used in situations where your employees need to access your internal imagery and mapping data. Google does not provide customers with Google licensed data for portable use. Google has many partners that provide custom Google Earth Enterprise portable solutions with high resolution imagery.   Then i am not sure how to use portable solution in offline without Google's imagery data. Any experiences or details on this solution are welcome.


What is wrong with my proof that the set of rationals has greater cardinality than the set of naturals?

1) A and B are sets of natural numbers. They are the same, so they have the same cardinality.  2) Set B is transformed into set of rationals. This can be done only by adding new numbers e.g. 1/2, 1/4, 5/6, ... to this set.  3) Set B now contains the same amount of numbers as set A, with extra numbers from step 2. Therefore, set of rationals has greater cardinality than set of naturals.


Real Analysis, Problem 1.4.17 Outer Measures

If $\mu^*$ is an outer measure on $X$ and $\{A_j\}_{1}^{\infty}$ is a sequence of disjoint $\mu^*$-measurable sets, then $\mu^*\left(E\cap\left(\bigcup_{1}^{\infty}A_j\right)\right) = \sum_{1}^{\infty}\mu^*(E\cap A_j)$ for any $E\subset X$.   Attempted proof - From countable subadditivity, $$\mu^*\left(E\cap\left(\bigcup_{1}^{\infty}A_j\right)\right) = \mu^*\left(\bigcup_{1}^{\infty}E\cap A_j\right) \leq \sum_{1}^{\infty}\mu^*(E\cap A_j)$$ Let $B_n = \bigcup_{1}^{n}A_j$. For each $n\geq 2$ since $A_n$ is $\mu^*$-measurable we have \begin{align*} \mu^*(E\cap B_n) &= \mu^*((E\cap B_n)\cap A_n) + \mu^*((E\cap B_n)\cap A_n^c)\\ &= \mu^*(E \cap A_n) + \mu^*(E\cap B_{n-1})\\ \end{align*} (These 2 lines above me came from part of the proof in Carthedory's Theorem and I don't really understand it at all if someone would be so kind to explain that part to me.)  By induction, $\mu^*(E\cap B_n) = \sum_{1}^{n}\mu^*(E\cap A_j)$ for all $n\geq 1$. So then by monotonocity, $$\mu^*\left(E\cap\left(\bigcup_{1}^{\infty}A_j\right)\right) \geq \mu(E\cap B_n) = \sum_{1}^{n}\mu^*(E\cap A_j)$$ for all $n\geq 1$. Thus as $n\rightarrow \infty$ we have the result.


Describing anxiety, another word for foreboding or dread

Is there a single word that describes that deep seated sense of dread and doom, the feeling that something in your personal world is not right, or is about to be absolutely ruined (other than foreboding)?


When there are many more failures than successes should I let classes be equal in SVM?

I have about 5544 runs where I am trying to classify it as failure or success. Here the number of runs that lead to failure is only 64 and rest is sucess. In that case when I try to use SVM should I make the number of classes equal? Will this affect the results?


Let $f$ and $g$ be entire functions which satisfy $f(0)=g(0)\neq0$ and $|f(z)|\leq|g(z)|$ for all $z\in\mathbb{C}$.  Show that $f=g$.    My approach:  Since $f$ and $g$ are both entire, we know that $f(z)=e^{g(z)}\neq0$.  Let us suppose that $f'(z)/f(z)=g(z)$.  Then, $f(z)=e^{g(z)}\implies f(z)=e^{\frac{f'(z)}{f(z)}}$.  Taking the log of both sides gives $log(f(z))=\frac{f'(z)}{f(z)}$ and so $f(z)\log(f(z))=f'(z)$..... and now I feel like I'm going down a rabbit hole that does not lead into Wonderland.  Any thoughts?


Some applications do not have the functionality like Task Manager's "Always on top" feature.  Is there a way around this?


Just moved my websites to my first vps (centos 7). So i'm very new to linux. Now I have a problem: php cant write anything. Can't make dirs, files, edit them. Php runs as "apache" Things I tried:    Chmod all dirs and files to 777 Chown all dirs and files to "apache" Chown all dirs and files to "nobody"   Its simply wants to edit with file_put_contents(req.log, $content).  How can I fix it?  Edit: Ls -l:  root@vps314463 data]# ls -l total 120 drwxrwxrwx. 2 apache apache  4096 Sep  8 11:12 EMAIL -rwxrwxrwx. 1 apache apache 30357 Sep  8 10:49 login.log -rwxrwxrwx. 1 apache apache   510 Sep  8 10:49 loginfail.log -rwxrwxrwx. 1 apache apache 73268 Sep  8 10:49 req.log -rwxrwxrwx. 1 apache apache   837 Sep  8 10:49 users copy 3.db -rwxrwxrwx. 1 apache apache   994 Sep  8 10:49 users.db   Edit:  Tried the answer of Kostas I chmoded and chowned public_html/data. Then opened test.php in public_html in webbrowser with the following code:  <?php mkdir("data/testdir") ?>   Nothing happened and this error occurred:  [Thu Sep 08 22:39:20.138500 2016] [:error] [pid 24286] [client xx.xx.xxx.xxx:47632] PHP Warning: mkdir(): Permission denied in /var/www/example.com/public_html/usertest.php on line 3


Possible Duplicate:          Which Stack Exchange site is best for code review?  Suppose I have a question like:     Is the following code a proper solution to <my problem>?   <Code>  On which (if any) Stack Exchange site would this question be most appropriately asked? Is it wrong to ask code-review type questions like this?


Getting two pictures to appear on the same page

I have two images that I would like to appear on the same page. Each figure should appear as a separate figure with its own caption.  My problem is that LaTeX sometimes places the figures on separate pages.  I currently have achieved this by putting two \psfragfig commands consecutively within the same figure environment. This seems a simple and succesful approach, but I wonder if I am not using the figure environment correctly by doing this. Should I use the subcaption package instead?


Error 2019 when declaring a template class constructor in Visual C++

My method constructor accepts a template parameter value and I know templates can be used in the implementation file (.cpp) by preceding each method with  template<class T>; classname<T>::memberfunction(){ }   When i put the definition of my constructor together with the class definition, the error doesn't show. For learning purposes, i want to put the implementation on a seperate file .cpp   I'm getting this error:     Severity  Code    Description Project File    Line    Suppression State   Error LNK2019 unresolved external symbol "public: __cdecl   myclass::myclass(int)" (??0?$myclass@H@@QEAA@H@Z) referenced   in function   main  ConsoleTestProject  C:\Users\Winux\Desktop\MINE\Project\Lab1\ConsoleTestSolution\ConsoleTestProject\ConsoleTestProject.obj  1   How do you properly put the implementation in the cpp file?  I saw suggested similar questions but not specific to my error and problem. Here's a simple code on how to recreate the bug. For simplicity, i did not include the getter and setter of the field.  myclass.h  #pragma once  #ifndef myclass_h #define myclass_h  template <class Type> class myclass { private:     Type value;  public:     myclass(Type value); }; #endif    myclass.cpp  #include "myclass.h"  template <class Type> tree<Type>::myclass(Type value) {     this->value = value; }   mysample.cpp  #include <iostream> #include "myclass.h"  int main() {     myclass <int> aclass(10);      return 0; }


What's the best books to understand the basic laws of thermodynamics and other things such as enthalpy, Carnot's cycle, entropy, Maxwell equations etc?


when calling method from another class - Java null pointer exception in Selenium java is thrown

When I try to call a method from another java class within same package, I get the below error: PASSED: validateLogin FAILED: test java.lang.NullPointerException at assembly.SlackInviteFlowValidation.selectManageSideNavbar(SlackInviteFlowValidation.java:130) at assembly.SlackUpgradeEditViewFlow.test(SlackUpgradeEditViewFlow.java:28) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(Unknown Source) at sun.reflect.DelegatingMethodAccessorImpl.invoke(Unknown Source) at java.lang.reflect.Method.invoke(Unknown Source) at org.testng.internal.MethodInvocationHelper.invokeMethod(MethodInvocationHelper.java:124) at org.testng.internal.Invoker.invokeMethod(Invoker.java:583) at org.testng.internal.Invoker.invokeTestMethod(Invoker.java:719) at org.testng.internal.Invoker.invokeTestMethods(Invoker.java:989) at org.testng.internal.TestMethodWorker.invokeTestMethods(TestMethodWorker.java:125) at org.testng.internal.TestMethodWorker.run(TestMethodWorker.java:109) at org.testng.TestRunner.privateRun(TestRunner.java:648) at org.testng.TestRunner.run(TestRunner.java:505) at org.testng.SuiteRunner.runTest(SuiteRunner.java:455) at org.testng.SuiteRunner.runSequentially(SuiteRunner.java:450) at org.testng.SuiteRunner.privateRun(SuiteRunner.java:415) at org.testng.SuiteRunner.run(SuiteRunner.java:364) at org.testng.SuiteRunnerWorker.runSuite(SuiteRunnerWorker.java:52) at org.testng.SuiteRunnerWorker.run(SuiteRunnerWorker.java:84) at org.testng.TestNG.runSuitesSequentially(TestNG.java:1208) at org.testng.TestNG.runSuitesLocally(TestNG.java:1137) at org.testng.TestNG.runSuites(TestNG.java:1049) at org.testng.TestNG.run(TestNG.java:1017) at org.testng.remote.AbstractRemoteTestNG.run(AbstractRemoteTestNG.java:115) at org.testng.remote.RemoteTestNG.initAndRun(RemoteTestNG.java:251) at org.testng.remote.RemoteTestNG.main(RemoteTestNG.java:77) I am using selenium Webdriver and TestNG framework. Here is my code where SlackInviteFlowValidation & SlackUpgradeEditViewFlow are from same package and extends Base class where in Base class has Chrome driver initailzation and login Functionality only. // Class SlackInviteFlowValidation // Function to validate landing page of Manage public void selectManageSideNavbar() throws InterruptedException {     slackobject.avatarIcon().click();     slackobject.AdminText().click();     slackobject.UsersText().click();     slackobject.ManageText().click(); }  //Class SlackUpgradeEditViewFlow // Creating object for class SlackInviteFlowValidation SlackInviteFlowValidation slackinvite = new SlackInviteFlowValidation(); public class SlackUpgradeEditViewFlow extends Base{ public static Logger log = LogManager.getLogger(SlackInviteFlowValidation.class.getName());  public SlackIdentityObjects slackobject;  SlackInviteFlowValidation slackinvite = new SlackInviteFlowValidation();  @BeforeTest public void init() throws FileNotFoundException, IOException {     driver = initializeDriver();     slackobject = new SlackIdentityObjects(driver); }  @Test public void test() {     try {         slackinvite.selectManageSideNavbar();     } catch (InterruptedException e) {         e.printStackTrace();     } }


Do an action and its Euler-Lagrange equations have the same symmetries?

Assume a certain action $S$ with certain symmetries, from which according to the Lagrangian formalism, the equations of motion (EOM) of the system are the corresponding Euler-Lagrange equations.  Can it happen that the equations of motion derived by this procedure have different kinds and/or numbers of symmetries than the action one has started with? And if yes, are there underlying principles that state why which kind of symmetries the action does not have can emerge in corresponding EOMs or which kind of symmetries of the action can potentially disappear in the EOMs derived from the Euler-Lagrange equations?


Prove that $|f''(x)| \geq 4$ for some $x \in [0, 1]$

Problem: Prove that if $f$ is a twice differentiable function with $f(0)=0$, $f(1)=1$ and $f'(0)=f'(1)=0$, then $|f''(x)| \geq 4|$ for some $x \in [0, 1]$.  I tried to get a contradiction from $-4 < f''(x) < 4$ by integrating the inequality from $0$ to $1$, but got nothing useful. Please help.


Effective zoom of Sony 55-210 lens (e-mount for NEX series camera)

According to Sony's website this lens has a zoom factor of 3.8. I currently have an 18-55 lens that came with my NEX-3F that has a zoom factor of ~3.1. Since the 55-210 pics up where the 18-55 leaves off, does that mean you can add or multiply those zoom factors? Is the 55-210 minimum zoom equal to the max zoom of the 18-55 or is there really no correlation between the two lenses?


Populate SelectList in ASP.NET MVC with enum

I have an enumeration in my Data layer and I want to use its drop down list in my website project. My enum in Data layer is:  namespace SME.DAL.Entities.Enums {     public enum EntityState     {         Open,         Freezed,         Canceled,         Completed,         Terminated,         ReadOnly     } }   How can I make its select list and use it in my website's page? I'm using ASP.NET MVC 4.


Export .ai logo for InDesign? Type rendering pixelated

I have a logo in Illustrator that I inherited, I'm just trying to put it into an InDesign file but for some foresaken reason the text always comes out pixelated. (See attached screenshot)  I've tried "create outlines" for the text, saving and importing in .pdf, .tiff, .svg, .eps, .ai - you name it but cannot for the life of me get the text to render smoothly.   The artboard is about 1000px x 1000px and it only needs to be about 2 inches big in the InDesign document.   Raster effect settings are 300dpi.  Any suggestions appreciated!


I'm processing the following xml file:  <?xml version="1.0" encoding="UTF-8" standalone="no"?> <tag>…</tag>   Just like python documentation says:  import xml.etree.cElementTree as ET  tree = ET.parse('file.xml') print(tree.getroot().text)   But unfortunately I've got such an error:  Traceback (most recent call last):   File "main.py", line 48, in <module>     print(tree.getroot().text)   File "C:\Python33\lib\encodings\cp852.py", line 19, in encode     return codecs.charmap_encode(input,self.errors,encoding_map)[0] UnicodeEncodeError: 'charmap' codec can't encode character '\u2026' in position 0: character maps to <undefined>   What am I doing so wrong?


Prove using natural deduction $((P \land Q) \rightarrow R) \vdash (P \rightarrow R) \lor (Q\rightarrow R)$

How do I prove the following using Natural Deduction?  $$((P \land Q) \rightarrow R) \vdash (P \rightarrow R) \lor (Q\rightarrow R)$$   My current approach:  So instead of proving $(P \rightarrow R) \lor (Q\rightarrow R)$, I figure I just need to prove $(P \rightarrow R)$ and use disjunction introduction.  The problem is my hypothesis requires $P$ and $Q$. How do I "create" this Q? I tried using the Law of the Excluded middle, but it does not seem to work.  Any help or insights is deeply appreciated.


Do any of zero coefficients become non-zero by increasing $\lambda$ in lasso regression?

In lasso regression many coefficients become zero as discussed  $$ \min_{\beta\in\mathbb{R}^p}\frac{1}{N}||y-\beta X||_2^2+||\lambda\beta||_1 $$ Columns of $X$ are $\{x_j \}_{j=1}^p$ corresponding to $p$ variables and $y$ is answer variable. During any iteration, we increase $\lambda$. So some coefficients become zero. When it goes on, is it possible that some zero coefficients that were zero in iteration $i$ become non-zero in iteration $i+1$? If so, why? and if not, dose it have proof? The only thing I know is when we set $\lambda = \lambda_{max}=\max_{j}|\frac{1}{N}\langle x_j,y\rangle|$ or greater all coefficients become zero and the number of zero coefficients is increasing when $\lambda$ increases.


No matter what I do, I still have these errors. I don't know what to do to fix this. Please help!!


Scrabble - Parallel Words joined at one letter

Parallel words joined at a single letter forming a second word. I cannot seem to find a clear answer to this scrabble question. Say player one plays, "scrabble" as their first word. Is it valid for player two to then play, "hello," parallel to "scrabble" but starting with the "h" in "hello" next to the "e" in "scrabble" to make the second word, "he." Here is an example:        HELLO SCRABBLE