I don't want to call the whole Firefox/Chrome/Opera... to find out the meaning of a word with the Google translate, so I decided to write a shell script which uses wget to get the content of translate.google.hu and gets the translation from the downloaded file. But I get stuck at the first step.  E.g. if I want to find out the translation (from eng to hun) of word 'Enthusiast' I would try  $ wget https://translate.google.hu/?hl=hu&tab=wT#en/hu/Enthusiast   but wget doesn't download the page that I get if I type        into my browser's address bar. Instead of that I got the following:  solid@skynet:~> wget https://translate.google.hu/?hl=hu&tab=wT#en/hu/Enthusiast  [1] 2143  solid@skynet:~> --2016-05-02 08:23:24--  https://translate.google.hu/?hl=hu Resolving translate.google.hu (translate.google.hu)... 216.58.209.163, 2a00:1450:400d:806::2003 Connecting to translate.google.hu (translate.google.hu)|216.58.209.163|:443... connected. HTTP request sent, awaiting response... 403 Forbidden 2016-05-02 08:23:24 ERROR 403: Forbidden.   And I'm waiting, and waiting and waiting... finally I press ENTER:  [1]+  Exit 8                  wget https://translate.google.hu/?hl=hu   Could someone solve my problem?  (I'm using OpenSuse Linux 13.2)  UPDATE According to [Alexander Batischev] I have tried    $ wget 'https://translate.google.hu/?hl=hu&tab=wT#en/hu/Enthusiast'   It solved the problem of running in background, and passed to wget the proper address (instead of creating local variable 'tab') ^.^' But I get the same error until the Forbidden:  $ wget 'https://translate.google.hu/?hl=hu&tab=wT#en/hu/Enthusiast'  --2016-05-03 14:57:48--  https://translate.google.hu/?hl=hu&tab=wT  Resolving translate.google.hu (translate.google.hu)... 216.58.209.163,  2a00:1450:400d:806::2003 Connecting to translate.google.hu (translate.google.hu)|216.58.209.163|:443... connected. HTTP request sent, awaiting response... 403 Forbidden 2016-05-03 14:57:48 ERROR 403: Forbidden.


Proof that $-(-x) = x$ using just the field axioms

This is my attempt based on some stuff I have been seeing around:  Let $y = -x$, then $-y = -(-x)$.  Now, lets sum $y + x = (-x) + x = 0$, then we have $y + x = 0$. If we had the additive inverse of $x$, i.e $-x$, to both sides, we obtain:  $$y + x + (-x) = 0 + (-x) \\ y + 0 = 0 + (-x) \\ y = -x\\ -y = x \\ -(-x) = x$$.  Is this proof correct just using the field axioms? I think that the key point is finding that $y = -x$.


I was reading through a proof of the first isomorphism theorem on proofwiki and I didn't understand a line that said "by kernel is a normal subgroup of domain, $G_1/K$ exists", where $K = ker(\phi)$ and $\phi: G_1 \rightarrow G_2$ is a group homomorphism. I understand the proof of the kernel being a normal subgroup, but does that imply the quotient group $G_1/K$ exist? In general, if you have a normal subgroup, can you always construct a quotient group? I'm guessing that comes from the definition of a normal subgroup but I can't seem to make the connection.


How can I delete offensive emojis on my iPhone keyboard

I would like to be able to delete certain emojis on my keyboard. How do I do that?


LyX - undefined control sequence but package seems to be added

I am using LyX with MikTeX and I am trying to use the following command \oiiint but I am getting the following error:   \oiiint  The control sequence at the end of the top line of your error message was never \def'ed. If you have misspelled it (e.g., `\hobx'), type `I' and the correct spelling (e.g., `I\hbox'). Otherwise just continue, and I'll forget about whatever was undefined.   I have added \usepackage{mathdesign} to the preamble in:  Document -> Settings -> LaTeX Preamble  Why is this not working?


Does light exit a single mode fiber in the same angle it enters?

If I have a laser beam of width larger than the core of the single mode fiber, and I use a lens to focus the light such that the entrance of the fiber sits at the focal point of the lens, does the fiber emit light in a cone of light with equal incident and exit angles?  Lets say I've been careful to choose my lens such that the incoming cone of laser light has a narrower angle than the maximum angle of acceptance, then is the angular/spatial structure of my light field preserved?


In Java: How to zip file from byte[] array?

My application is receiving email through SMTP server. There are one or more attachments in the email and email attachment return as byte[] (using sun javamail api).  I am trying to zip the attachment files on the fly without writing them to disk first.  What is/are possible way to achieve this outcome?


Which of the following two sentences is correct?     I have had the pleasure of meeting him.      I had the pleasure of meeting him.   If both are correct, what are the exact scenarios to use them appropriately?


Show convexity of $f(\exp(t))$ from $f(\sqrt{xy}) \leq 1/2(f(x)+f(y))$

For a continuous function $f: \mathbb R^+ \rightarrow \mathbb R$ if: $$f\left(\sqrt{xy}\right) \leq 1/2(f(x)+f(y))$$ for all $x,y>0$ then $f(e^t)$ is convex for all $t \in \mathbb R$. What I've tried I am going after showing the inequality: $$f\left (\exp (\lambda t_1 + (1-\lambda) t_2)\right) \leq \lambda f(e^{t_1}) + (1-\lambda) f(e^{t_2})$$ for all $t_1,t_2 \in \mathbb R$ and $\lambda \in [0,1]$. My plan was to rewrite the first inequality as: $$f\left(\exp 1/2\log x + 1/2 \log y\right) \leq 1/2(f(\exp \log x)+f(\exp \log y))$$ and claim that since $\log$ is a bijection from $\mathbb R^+$ to $\mathbb R$ then inequality holds for $\lambda = 1/2$. I next tried to show using the continuity hypothesis on $f$ that this holds for any $\lambda \in [0,1]$ but I am struggling with that argument and think I might be missing a simpler way.


How to deploy wsp to single web application

I want to deploy my solution to a single web application. I used the following script:  Add-SPSolution -c:/mywebpart.wsp  Install-SPSolution mywebpart.wsp -WebApplication "SharePoint Debugging" -GacDeployment   But the solution is now available in the 'Site Collection Features' list of all web applications.  I know I can deactivate the feature on the web applications where I don't use it, but I don't want it to be deployed to those web applications. How can I deploy the solution so my web part is only available in a certain web application. The idea is that I want to be using the same web parts in the different web applications, but they have minor changes for each different web application. So I want to deploy version 1.1 to web application A and deploy version 1.2 to web application B


I was wondering, as I'd really want to get my hands on the Plan for the "Cosmic Strand" legendray item, is there any particular location/bosses where one can found the plan for a particular legendary item? Or are all the plan dropped anywhere at random?


embedded interrogative Clause when quoting

Today I heard someone saying "...people ask me how can I ...", I know it's wrong, but then again, what if she was quoting?  So the question is: Can you change an embedded interrogative clause to a quote when you speak?   E.g. "He asked me how he can get there?"        "He asked me "how can I get there?""  I personally don't do that cause it might get confusing, (it's okay when you are writing, right?) but if you have to, can you?  Thank you very much!


Probability cut-off value for Logistic Regression

I'm doing a project in predicting default risk for SBA loans using R. My data has 187,986 positives and only 17796 negatives (9.46%). Clearly this is an imbalanced dataset. That's why when I run accuracy rate checking for my model using probability cutoff value=0.5, the accuracy result is way too low as below,  > mytestset$LoanStatus_PIF<-ifelse(mytestset$LoanStatus_PIF=="PIF",1,0) > pred<-predict(final,newdata=mytestset,type="response") > y_pred_num<-ifelse(pred>0.5,1,0) > mean(y_pred_num==mytestset$LoanStatus_PIF)   Result: [1] 0.009682553  When I change the cutoff value to 0.998 and up, the result is way much impressive:  > y_pred_num<-ifelse(pred>0.5,1,0) > mean(y_pred_num==mytestset$LoanStatus_PIF) Result:  [1] 0.9997752   Question: 1. Will my model be rejected because I manually choose the cut-off value?   Does 0.999 make sense for a cutoff value? As common cut-off value is usually 0.5. Thanks !


Testing a UPS by unplugging it from the wall

At an Not For Profit/Charity I volunteer for occasionally we were very fortunate to be provided (donated) with a brand new 3Kva APC UPS. This is total overkill for our modest server rack (four mid-range servers and a switch!) but hey, I'll take what I can get!  Pressing the TEST button on the front indicates that yes, the UPS does work. Brilliant. But it only tests it for about 15 seconds.  My question is - will I degrade the UPS by unplugging it from the wall to see how long it will last? My plan is to unplug it, and wait until the battery meter reaches its last LED before plugging it back in, so that I know about how long I will have in the event of a power outage.  Do people do this on a regular basis? I'm guessing no (Lead Acid is very different to Li-Ion batteries)... but what kind of harm would it do if this were to happen (on purpose) every 6 months?


We have the same car vs we have the same cars

If me and someone have the same car.  It is correct to say: we have the same car or we have the same cars.


How to mount an exterior light that doesn't cover the junction box

I'm trying to mount this light on the exterior of a house, but it doesn't cover the hole like the existing lights do.  In some places there's an existing light that's mounted directly to a junction box, and in others, I'm installing a light for the first time.  How should a light like this be mounted in a way that's up to code and prevents water from entering the house?


Correct interpretation of coefficient estimates from GLM on binary outcome data

I'm currently analysing an experiment where animals were presented with a stimulus under two different treatments (Po & Br) using a GLM. RespYN is a binary response variable showing whether the animal responded to the stimulus.  glm(RespYN ~ Treatment + Gender + Length_Diff + Cockroach_ID, data = data, family = binomial(link = "logit"))   I haven't really dealt with log odds at all before, so I'm asking for some clarification in interpreting the coefficient estimates  Coefficients:          Estimate Std. Error z value Pr(>|z|)      (Intercept)   1.74016    0.53317   3.264   0.0011 ** TreatmentPo  -4.40331    0.54346  -8.102 5.39e-16 ***   My understanding is that this means that Treatment having the value of Po is associated with a decrease in the log odds of observing a positive response of -4.40331 comapred to treatment having a value of Br.   However I'm a) not certain I've understood this correctly and b) not sure how to translate this into something meaningful i.e. what is the decrease in odds (not log odds) or probability.  Any help is greatly appreciated!


I use scrreprt for my thesis. I set the margins using the geometry package. But those somehow don't aply to the titlepage. It shows much more space on the right side, which, I reckon, is due to the two page character of scrreprt. How do I get my titlepage to be centered?  I am thankful for any ides on how to achieve my goal.  \documentclass[12pt,a4paper]{scrreprt} \usepackage[left=2.5cm,right=2.5cm,top=2.5cm,bottom=2cm,includeheadfoot]{geometry}  \setlength{\headheight}{15pt}  \begin{document} %titlepage \thispagestyle{empty}     \begin{minipage}{0.75\linewidth}         \begin{center}             \centering             %University logo             %\includegraphics[width=\textwidth]{logo.pdf}             \rule{0.4\linewidth}{0.15\linewidth}\par             \vspace{2cm}             %Thesis title             {\uppercase{\Large This is a very long title going over three lines and it is still not completely done\par}}             \vspace{2cm}             %Author's name             {\normalsize submitted by}\\{\Large Name \par}             \vspace{2cm}             %Degree             {\normalsize xx xxxxxxx xxxxxxxxxx xx xxx xxxxxxxxxxxx xxx xxx xxxxxx xx}\\{\Large xxxxxxxx xx xxxxxxx \par}             \vspace{2cm}             \end{center}             %Date         \begin{flushleft}             \vspace{1cm}             \begin{tabular}{ll}                 {\Large xxxxxx, August 2017}&\\                 &\\                 {\Large Student Number:}&{\normalsize xxxxxxxxxxx} \\                  {\Large Supervisor:}&{\normalsize xxxxxxxxxxxxxxx.}\\                 {\Large Co-Supervisor:}&{\normalsize xxxxxxxxxxxxxxxxx}\\             \end{tabular}         \end{flushleft}     \end{minipage}     \clearpage \end{document}


How long can food last if reheated periodically?

Say I fixed some stew that's been in the refrigerator for around three days. Will putting that stew in a pot, heating it up to around 170F (77C), and letting it simmer for a while make it last longer in the refrigerator? And if so, then can this be done (nearly) indefinitely?  I think the answer is yes, because whatever microbes have had an opportunity to take root in the food will have been killed by the high temperatures, but I am not sure about whatever biproducts that might remain (e.g. toxic chemicals exuded by the microbes as part of their metabolism or something).


linkledin learning file download location in bluestacks 4

i recently downloaded linkedin learning app on bluestacks.  i cant find the the courses i downloaded in that app. where is the save file location of linkedlearning app. There is nothing on shared folder


Does StackExchange have 1 multi-tenant environment, or many single-tenant environments?

With so many StackExchange.com sites, in addition to StackOverflow.com, I was curious which approach is taken for the multiple sites:   One deployment environment (data/site/etc.) that is multi-tenant and serving a differently styled site depending on the URL used to get to the site, or A separate deployment environment for each site.   What were the most important decision factors for making the choice?


I am trying to prove that the product of $T_1$ spaces is also $T_1$. Here is a proof, is it correct?     $\{ X_i \}_{i \in I}$ are T1 $\Rightarrow$ $\prod_{i \in I} X_i$ is T1      Proof: Let $\bar{x} = ( x_i ) \neq \bar{y} = (y_i) \in \prod_{i \in I} X_i$        There is an $i_0 \in I$ such that $x_{i_0} \neq y_{i_0} \in X_{i_0}$      $X_{i_0}$ is T1, so there exists open sets $U_0,V_0 \subseteq X_{i_0}$ such that $x_{i_0} \in U_0 \setminus V_0$, $y_{i_0} \in V_0 \setminus U_0$.      Define $U,V \subseteq \prod_{i \in I} X_i$:   $$U_j = \begin{cases} X_j, &j \neq i_0 \\ U_0, &j = i_0 \end{cases} \qquad V_j = \begin{cases} X_j, &j \neq i_0 \\ V_0, &j = i_0\end{cases}$$      $U,V$ are open in $\prod_{i \in I}X_i$ by definition, and $\bar{x} \in U \setminus V$, $\bar{y} \in V \setminus U$.   ()


Has anyone confirmed the spawn rate for golden bees? I found several threads at various forums, but they all boil down to "just buy one".  I know I can buy them, and did in my file. However, my 6 year old son wants to catch one. He just caught his first shiny Pokemon, so he knows what patience means. I'd just like to be able to give him a number if possible.    Regarding duplicate status:  I don't believe this is a duplicate at all. I asked a specific question not covered by either the question or answer in the linked one. "It appears randomly" is not a spawn rate, and I thought that was clear from my original question.


python one line return value if availab if not return None

Lets say I have a variable name = "Jack". I can check it like this  if name:     return name else:     name = None     return name   Is there any way to handle it in one line like:  new_name = name if not return none  Which simply return the variable value if available and if not then it should return None


Cannot install snap because it won't accept my Ubuntu One password

I'm trying to install Lite IDE from the Ubuntu Software Center but I cannot get past logging into Ubuntu One.  I have an Ubuntu One account. I have used it to log into one.ubuntu.com, Launchpad and this Stack Exchange. However, I cannot use it to install this snap.  I've generated and installed SSH keys.  I'm running 16.04 LTS    Am I missing something?  Or should I report a bug?


Is $\Bbb Q$ intersect $[0,1]$ in $\Bbb R$ compact?

A subset is compact iff it is closed and bounded.   I know $[0,1]$ is closed in $\Bbb R$, and the intersection of two closed sets is closed. I don’t know if $\Bbb Q$ is open or closed in $\Bbb R$ and have seen proofs for both.


paragraph ended before align was complete

I got the above named error after changing an eqnarray envrmt to align envrmt. I was wondering if align does not work with doc class scrartcl, but the mwe of other users also seem to work like that. Also the error can't be in the formula, as in a sample formula like below the same problem occurs.  Any ideas?  \documentclass[a4paper,12pt]{scrartcl}  \usepackage[ngerman]{babel} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{amsmath, amssymb, graphicx} \usepackage{color}  \newcommand{\eq}{\begin{equation}} %Shortcuts für num. Einzelformel \newcommand{\eeq}{\end{equation}} \newcommand{\eqs}{\begin{align}} %Shortcuts für ausgerichtete num. Formelsysteme \newcommand{\eeqs}{\end{align}}  \begin{document}      \eqs a&=b+c\\ de&=fg+hi \eeqs  \end{document}


EDIT: Thank you, PakkuDon  instead of using "==" I must use ".Equals()"!    I'm trying to implement a chat-command system though I've encountered troubles in differentiating between standard chat and command chat..  Focusing on just one command for now, `highlight  the output whenever I type in `highlight is:   highlight `highlight   Here's my code:      String cmd =  InMessage.message.substring(0, 10);     System.out.println(cmd);     System.out.println("`highlight");     if( cmd == "`highlight" )     {        ... cancel chat packet and proces command     }   and yet the if statement returns false.  What's going on here? Anything I've done is wrong?


StrManagers = string.Empty;  foreach (Manager manager in Managers) {  StrManagers = manager.Name + "</br>"; }   How can I achieve this using Linq?


Please, help me understand this statement. The outer product notation for matrices also gives an intuitive input-output relation for them. For instance, the matrix |0⟩ ⟨1| + |1⟩ ⟨0| can be read as "output 0 when given a 1 and output 1 when given a 0".


Why do $\exists x\in S: p(x)$ and $\forall x\in S: p(x)$ have different logical structures?

Consider the following two statements:  Statement 1.  There exists a $x\in S$ such that $p(x)$ holds, which can be written by notation as $\exists x\in S: p(x).$ Statement 2.  For any $x\in S$, $p(x)$ holds, which can be written by notation as $\forall x\in S: p(x).$  But Zorich , in his book, interpretes the first one as $$\exists x\in S: p(x)=\exists x( x\in S \color{red}{\wedge} p(x)),$$ and the second one as $$\forall x\in S: p(x)=\forall x( x\in S \color{red}{\to} p(x)).$$ Why one is "AND" and another is "IMPLY"? The cited webpage has not answer my question，because it just tell that all things are arranged like this， but do not give the reason why to make such arrangment.


How to send the password to an SSH login prompt without typing it all the time

Every time I try to connect my Linux server via SSH, it asks me for my password. I’m using Ubuntu server 18.04 How do I do something to get the system to remember the password or just be in line of an Bash script to connect to the server server? example of what happens to me: ssh root@$ip root@xxx.xxx.xxx.xxx's password:   I did everything to don’t ask me again for password, but I failed. I’m already using a Bash script like this: echo PASSWORD ssh root@xxx.xxx.xxx.xxx  Then I copy and paste password into password field. But this doesn’t work.


How can I determine file type without an extension on Windows?

I sometimes get files from my clients that have the wrong file extension. For example, the name is image.jpg but the file is actually a TIFF image. In many cases I can clarify it by opening the file in a text editor, looking at the first few bytes, then deducing which file type it is.  This works for me with JPEG, TIFF, GIF and PDF files. However there are many more file types out there.  Is it possible to automate identification of the correct file type by analyzing the containing data?


Upgraded to 20.04 but I still have Unity desktop environment

After updating Ubuntu to 20.04 but is showing Unity. Before 20.04, I had 18.04 upgraded from 16.04 but that also had same desktop environment.  How can I switch to Ubuntu's default GNOME based desktop environment?


How to change the line spacing within an equation environment?

Example;   \begin{equation*}   \begin{aligned}     1 + 2 = 3 \\[3mm]     3 + 1 = 4 \\[3mm]     4 + 1 = 5   \end{aligned} \end{equation*}   I find that I'm often adding the [3mm] to the ends of equation lines so that the spacing isn't so tight between lines, but is there a way to set this for    a particular equation instance  globally for equations   I can't seem to find this out.   edit  this worked   \begin{equation*}   \addtolength{\jot}{12pt}   \begin{aligned}     1 + 2 = 3 \\     3 + 1 = 4 \\     4 + 1 = 5   \end{aligned} \end{equation*}


Better formatting for description of tag badges

The site is all clean and beautiful, the formatting is great, the layout is organized... and we have this blue speech box like those on top of YouTube videos as the description box when you hover the mouse cursor over a tag badge with default font and a style that simply doesn't match the site.  Can this box be improved?


Let $n = 2, 3, 4, ...$ be an integer. Show that $n^3 +6n^2-7n$ is divisible by $6$.   How should one approach this? Using modular arithmetic or some other approach?


Where should I ask for recommendation on (possibly) existing programming plugins?

I'm looking into developing an ordering app for a potential client. The main part that I'm concerned about in this question is the payment mechanism. I would assume that there are already multiple plugins or similar programs out there, but I'm not sure where (or if) I should be asking for recommendations.


I need to checkout single folder from a Bitbucket Git repo

I have a repo that contains about 20 folders, created when I converted from SVN to Git.  Is it possible to checkout a single folder from a Git repository (on Bitbucket)?  Or do I have to make each of those folders a separate repo?


I have a netherlands visa, can my port of entry be Madrid?

I have a Netherlands visa. My plans have changed drastically. I would be staying most number of days in Spain. Can i have my POE in Madrid? Will it be a problem if neither my POE not my maximum number of days are not in the country from where i got my Schengen visa?


How does the "biased-$k$ attack" on (EC)DSA work?

I recently stumbled across  about deterministic (EC)DSA again. There he states the following:     Note that $k$ must be generated uniformly in the $[1, q-1]$ range   (where $q$ is the subgroup order). Any information on $k$, even   partial (such as: values between $1$ and $2^{160}-q$ are twice as   probable than values between $2^{160}-q$ and $q$), can be exploited by   the attacker.   When asked for clarification on this,  with  which mentions that Bleichenbacher discovered the attack and mentioned it in private communication with the author.  Now the paper has a short paragraph (section 2.2), which basically states an approximate equation for the bias and says that     Bleichenbacher actually used it in order to approximate the secret key more   and more precisely with signatures.   Now my question: How does this attack work in a more detailed description? or formulated differently: How does one exploit this tiny bias to recover the secret key and how many signatures (ie oracle queries) are required for this along with what approximate computational effort (if it is non-negligible)?    The relevant section from the paper is (for your convenience):     The initial standard pseudorandom generator in DSA for $k$ was simply   a 160-bit pseudorandom number reduced modulo $q$. Bleichenbacher   observed that the probability of $k$ in the $[0, 2^{160} − q]$ range   have probability which is twice of the others. This leads to a bias      $$E\left(e^{\frac{2i\pi k}q}\right)\approx \frac{q  e^{i\pi\frac{N-1}q}}{\pi N} \times \sin\left(\frac{\pi N}q\right)$$      where $N=2^{160}$. Since $q \approx N$, this may be large depending on   the $\frac{\pi N}q$ angle. Bleichenbacher actually used it in order to   approximate the secret key moreand more precisely with signatures.


Controller won't connect to PS4 after pairing it to Chromebook

I have a PlayStation 4 controller and I paired it to my Chromebook but now it won't connect to my PlayStation 4. I have reset it but it still doesn't work.  What should I do?


It’s not easy to discern which to choose among ‘be going to’ and ‘will’ to express a near future plan or intention. I’m going to bring up two cases.  [A] In a situation that when one says “Oh, I’m hot,” while two are in the room, what can the other one say?: [A-1] I’m going to open the window. [A-2] I’ll open the window.  For ‘be going’ is concerned with ‘present intention’(CGEL,p.211-2), [A-1] seems to be possible; yet it’s also concerned with ‘present arrangement,’ it doesn’t seem to. How could I have arranged the opening window before his saying 'hot'?  However, [A-2] seems to be quite wilful to say in the situation. When it’s not a big deal to open the window, do I have to use my will? It could be said that 'will' is used in a implication that 'if you want, I will open the window'- as a conditional consequence.  How about this?: [B] In a situation that I’ve planned that I would learn to play the guitar after deeply impressed by a guitarist, what can I say?: [B-1] I’m going to learn to play the guitar. [B-2] I will learn to play the guitar.


I am using Ubuntu 12.04 with gnome-classic (no effects) instead of Unity. But I admit that the Dash launcher is useful sometimes. Is there an equivalent launcher that we could use with gnome-classic?


Does a photon experience any time. Since a photon is massless and hence travels at (c) then it should suffer infinite time dilation, and hence shouldn't experience no time?


Is a function that has Holder order bigger than one constant?

I see from the Wikipedia that if a function $f$ over $[a,b]$ is Holder continuous with order strictly bigger than one, i.e. $$|f(x) - f(y)| < K |x-y|^\alpha$$ for some constant $K$ and $\alpha>1$ over $[a,b]$, then $f$ is a constant over this interval.  My question is how should we prove this? Thanks!


Does Hexblade Warlock need Dual Wield Feat?

My DM says I need a skill or feat to use my pact weapon and conjure weapon at the same time. Is this true? Because I want to dual wield warlock hexweapon but warlocks don't have anything that grants bonus actions?  Edit: This is different from other dual wielding because my weapon changes to a CHA modifier. Also the post linked still gives me two answers that arent specific to Hexblade class.


Four groups of order 20 that are not isomorphic

Give four groups of order 20 that are not isomorphic.    I know the integers under addition mod 20 is one group of order 20, but what would three other groups of order 20 that are not isomorphic to it?


i am making a game and it uses a gird i can implement it by extending arraylist for example:  public class Grid extends ArrayList<ArrayList<obj>>  {      public void addObj(Obj obj ,int x, int y)      {            get(x).set(y,obj);      } }   or should i do it by storing it  public class Grid {       private ArrayList<ArrayList<obj>> objs = new ArrayList<...>();         public void addObj( Obj obj, int x, int y)        {           objs.get(x).set(y,obj);        } }   help plz


jQuery Validate Plugin - Run When Specific Button Pressed

I am using  and have the following working fine  <button type="submit" name="submit" value="complete" class="btn green"> Complete Section</button> <button type="submit" name="submit" value="save" class="btn green"> Save</button>   and  var form1 = $('#form_sample_1'); var error1 = $('.alert-danger', form1); var success1 = $('.alert-success', form1);  form1.validate({   errorElement: 'span', //default input error message container   errorClass: 'help-block help-block-error', // default input error message class   focusInvalid: false, // do not focus the last invalid input   ignore: "",  // validate all fields including form hidden input   invalidHandler: function (event, validator) { //display error alert on form submit                                   success1.hide();                     error1.show();                     Metronic.scrollTo(error1, -200);                 },     highlight: function (element) { // hightlight error inputs    $(element)    .closest('.form-group').addClass('has-error'); // set error class to the control group                 },                  unhighlight: function (element) { // revert the change done by hightlight                     $(element)                         .closest('.form-group').removeClass('has-error'); // set error class to the control group                 },                  success: function (label) {                     label                         .closest('.form-group').removeClass('has-error'); // set success class to the control group                 },                  submitHandler: function (form) {                     form.submit();                 }             });   However, what I would ideally like is if the "SAVE" button is pressed, for the form to be submitted and not validated i.e. only validated when the "COMPLETE" button is pressed.


Is it possible to iterate over a map in Lightning

Is it possible to iterate over a Map in an aura:iteration. It doesn't give me a compile or runtime error but it doesn't appear to work.   My thought is that it works similarly to $.each in jquery.  <aura:attribute type="Map" name="myMap"  default="{key1: 'item1', key2: 'item2'}" />        <aura:iteration items="{!myMap}" indexVar="key" var="item">       {!key} : {!item}  </aura:iteration>


Resizing/Processing only images in folder larger than specified height?

I have a folder with JPG images, some of which have a height dimension larger than 1900 pixels. I need a command that will ignore the images with a height dimension lower than 1900 pixels, while resizing only images with a greater height.  This command does the resizing job, but in the process it still opens and re-saves the images it doesn't resize, which eats up HD and CPU bandwidth:  mogrify -resize 'x1900>' *.jpg  Is there a better command, that will ignore the images that fall below the pixel threshold?  The question is different from the question here:   I want the command to determine which JPGs are larger than a certain height, taking the width out of the equation.


In which folder should I copy the image (JPEG) so that it could be found?

I used the following code to insert a JPEG image in my document but I don't know where exactly should I copy the image so that it'll be found. I know it must be somewhere in the TeX folder, but I still get an error.  \usepackage[pdftex]{graphicx} \frame{\titlepage \vspace{-0.5cm} \begin{center} \includegraphics[height=0.25\textheight]{Koala.jpg} \end{center}


Proof by Induction: Number of bit strings of length $n$ starting with a 1 or ending with a 0

We showed that the number of bitstrings of length $n$ that begin with a 1 or end with a 0 (or both) is $3 \cdot 2^{n−2}$. Sketch a proof by induction for this.   Would we prove this by manipulation? I'm totally lost.


Number of relations that are both symmetric and reflexive

Consider a non-empty set A containing n objects. How many relations on A are both symmetric and reflexive?  The answer to this is $2^p$ where $p=$ $n \choose 2$. However, I dont understand why this is so. Can anyone explain this?


Widest tyre you can safely fit on 700c wheel (17mm rim width)

I am riding a no-suspension hybrid with rigid reinforced fork and 700c wheels. I go on touring trips with very flexible itinerary. I stay on gravel/tarmac/trail 80% of the time but occasionally I like to link parts of the tour by going off-road or on rough trails.  I currently run 700x35C touring tires and I am very pleased with their performance on good surface. However I would like to get some oversized (preferably foldable) tires that I can pack when touring and put on for a day or two during the tour when necessary. Here are some cases from my recent trips when my 35c's felt "not enough" and I wish I had wider tire:     Here are few details:   Rims are WTB 700C Rim inner width measures just under 17mm I currently run 700x35C Disc brakes, so brake assembly will not be a limiting factor Frame and fork will not be an issue as well (both look like they could accommodate 55+ size and still have plenty of clearance)   Rim inner width:    Ample tire clearance (pictures taken with Schwalbe Marathon Plus 35c tire in place):    says I should not go above 37mm... Yet I know that this bike came from the manufacturer with 47c continentals fitted...  Any advice is appreciated. I would like to hear not only what is OK for this particular case but also what are general considerations. How does one decide when tire is too wide and unsafe.  UPDATE:  Additional problem that I am facing is that it is hard to find wider 700c tires. For gravel / hybrid tires advertised as 700c sizes go from 25mm up to 37mm.  For mountain bikes (29 inch wheel) sizes begin at 2.25 inches which is approx 57mm.  There appears to be a gap between 37mm and 57mm and it is very rear that one come across a tire that falls in that gap category. Or am I not looking for a right thing?


I am getting an error : System.NullPointerException: Attempt to de-reference a null object

trigger DuplicatUsingMap on Account (before insert, before update)  {     Map<Id,Account> acMap = new Map<Id,Account>([select id, name from account]);        for(Account a : trigger.new)     {         if(a.name != null && a.name == acMap.get(a.Id).name)              a.addError('Account already exist');     } }


How to create "not less than or greater than" symbol?

I recently came across this meme:  (Source:  on Twitter) How can you create that second symbol in LaTeX? Apparently, several packages do include \nlessgtr, but they have a diagonal slash rather than a vertical strikethrough. (\not\lessgtr produces the same thing.) How can you create a vertical strikethrough through a lessgtr sign?


I want to apply an XSLT Stylesheet to an XML Document using C# and write the output to a File.


fprint_demo and fprintd_enroll not found Ubuntu 17.10

My computer is a lenovo thinkpad T510 .I followed the instructions given in  but after installation, For Ubuntu 16.04 or greater:  sudo apt install libpam-fprintd   I tried to run it, but:  $ fprint_demo The program 'fprint_demo' is currently not installed. You can install it by typing: sudo apt install fprint-demo $ fprint_enroll fprint_enroll: command not found   What am I missing to make my fingerprint work?


I want to use boost converter to to supply higher voltage to LED .I have confusion about which smps power supply to use on input side. From specs. I am unable to understand why input current limitation is given?? and what happens if higher input current supply used?? Some websites blogs saying that in electonics devices donts consume power more than that they requires. and What about linear voltage regulators??In datasheet of regulators they also mention input current limitations.  Below is of details of my project and spec: 1)SMPS spec.=12V 20 amps 2)led spec =35v 4 amps I am using this boost converter   boost converter spec:   Input voltage : DC8.5V-48V []Input current : 10A (MAX) exceeds 8A please enhance heat dissipation []Output voltage : 10-50V continuously adjustable 12-80V fixed output [Output current] : 10A MAX exceed 6A please enhance heat dissipation     PLZ SEE BELOW IMAGE:


What installed "DU quick charge" on my phone?

I started seeing something new on my lock screen, before even swiping the lock screen. It was a large battery charging-status display with advertisements below that. At the upper left corner was a gear for setup. Touching that displayed "DU Quick Charge" with a little slider to turn it off. I turned it off and the display has never appeared again. But I want to know where this came from. A Google search gave me one article describing my issue exactly, except it involves different software than I have. The image provided is the same. Obviously "DU quick charge" is a library someone is selling. How do I find what software did this on my phone? It seems to have already disappeared from the recently updated list at the play store.


15 month old waking in the night, screaming and hysterical

My 15 month old has suddenly started waking at night crying. We go into her room to try to comfort her, and sometimes bring her into bed with us, but our presence seems to make things worse. Sometimes she screams and becomes so hysterical that nothing will calm her down for 30 to 40 minutes. In between these episodes, and during the day, she is otherwise totally normal and her daytime behaviour has not changed.  Are we dealing with separation anxiety or is this closer to night terrors? She always seems awake and aware when she has a screaming jag. We haven't had trouble waking her, so I am thinking it could be separation anxiety. We recently took a 3 week vacation overseas and it was hard for her to adjust to the time change and jet-lag...could that be the reason for these outbursts?  Whatever it is, these tantrums are very scary...I am not sure now whether I should pick her up at night or not. I can't stand the thought of letting her scream alone...and when I go to her and try to comfort her while leaving her in the crib she becomes even more angry.


Can't empty trash after deleting Time Machine backups

I have a 4 GB drive with Time Machine backups on it that I've not used in a couple of years.  It's nearly full.  I wanted to start using it again, but first I wanted to remove ~2/3 of the backups, to free up space, while keeping a good sampling. Thus I removed 50 of the 70 backups (cmd-delete in Finder), alternating removing two and keeping one while going through the entire list chronologically; as a consequence, what remains goes back just as far, just with less frequency.   But, after doing this, the drive is still nearly full.   I figured that's because I needed to empty the trash, but when I tried to do that it removed items slowly, and then stopped. So I stopped the emptying and checked trash, and saw nearly nothing had been removed.  I then ejected the drive, after which the trash was empty.  But when I re-mounted the drive, the items in trash all reappeared.   There is a procedure given in this thread, but the behavior the OP describes doesn't exactly correspond to what I'm seeing:    So: Should I try the terminal command in the above thread?  Or do the problems I'm having indicate my Time Machine partition may be corrupted?  If the latter is the case, it would make the most sense to just reformat the disk and start clean.  Granted, it would be nice to have some of the old backups, but I don't have a critical need for them (not critical enough to buy a new disk and put this one in storage).  UPDATE: Never mind. I tried adapting the instructions given in the post Allan linked, and couldn't get them to work.  So I just erased & reformatted the entire disk and started over.  In retrospect, my mistake was following an answer I found elsewhere on apple.stackexchange.com, which said one could delete individual backups in Finder by dragging them to the Trash.  I should have instead used tmutil in Terminal.


I get this message after trying the update manger:  W:Ignoring file 'Untitled Document 1' in directory '/etc/apt/sources.list.d/' as it has no filename extension, E:Type 'eb' is not known on line 2 in source list /etc/apt/sources.list.d/ehoover-compholio-precise.list   I am new to Ubuntu. What should I do?


Idea is to make an equipment like torch, which should emit darkness.. Is it possible?

Can we have any equipment as such? If light can emit form a hand held device, why not darkness


Problem converting RGB to CMYK for print

Below you find the design for our business cards. The triangles are yellow, as you can see outside of the canvas. However, inside the canvas, only when I set the Color Mode to CMYK, they appear pink. When I switch the Color Mode back to RGB, they appear yellow as expected. However, when I print them, in both cases they turn out pink...   I would just like to know what is going on here and how I can change them back to the right colors?  CMYK Colors:


Principal Component Analysis (PCA) for binary data

First of all, I would like to note that I have read similar topics in CrossValidated but I am not fully satisfied.   I have a dataset which consists of an $N\times M$ binary matrix. 1 means that an action is performed and 0 that it is not.   I apply PCA to the dataset and surprisingly get very good results, especially when I reduce it to only two dimensions. I am looking for the intuition behind performing PCA on such a dataset (i.e. where each attribute contains categorical data; you can give whatever example you think is more understandable) and whether a more appropriate technique can be applied. I am working with MATLAB and I need the data in a clustering friendly form.


Is the speed of light constant even for an object which is accelerating?

Is the speed of light constant even for an object which is accelerating in free space?


When are correlated Normal random variables multivariate Normal?

I know that there are many example of correlated normal random variables which are not jointly (multivariate) normal. However, are there conditions which state when correlated normal random variables are jointly normal?  Say I observe n univariate random variables $X_1, \dots, X_n$ that are each $N(\mu, \sigma^2)$ with common correlation $\rho$.  Is it possible that these are jointly normal? If so, what are the conditions and how would I know if they are jointly normal.


Difference in outputs while printing value stored in a variable and printing value directly using printf()

I am trying to write a simple C program that takes the input from user in metres and prints the output in kilometres, yards and miles rounded to 4 decimal places. I have used this 1 meter = 0.001 kilometers = 1.094 yards = 0.0006215 miles When I write this, I get the output as intended: #include <stdio.h> int main() {    int m;    float km, y, mi;    scanf("%d",&m);    km=(m*0.001);    y=(m*1.094);    mi=(m*0.0006215);    printf("%.4f\n%.4f\n%.4f",km,y,mi);    return 0; }  Output: 0.1000 109.4000 0.0622 But, when I write this I get the third output wrong: #include <stdio.h> int main() {    int m;    scanf("%d",&m);    printf("%.4f\n%.4f\n%.4f",(m*0.001),(m*1.094),(m*0.0006215));    return 0; }  Output: 0.1000 109.4000 0.0621 Can you please help me find the reason for this difference?  Edit-1 here I gave input 100. float y=100*0.0006215; printf("%f",y);  gave output 0.062150 and this printf("%f",100*0.0006215);  also gave output 0.062150  Edit-2 float y=100*0.0006215; printf("%.4f",y);  gave output 0.0622 while: printf("%.4f",100*0.0006215);  gave output 0.0621 whereas in Edit-1 both displayed the same output.


Finding an asymptotic for the sum $\sum_{p\leq x}p^m$

Possible Duplicate:          What could I use to prove the following conjecture?  $ \sum_{p \le x} p^{m} \sim \operatorname{Li}(x^{m+1}) $  For $ m=0 $ this is just the prime number theorem, but would it be true for other numbers 'm' ? Or even for negative m?  Also if the function can be expanded in power series $ f(x)= \sum_{n=0}^{\infty} a(n)x^{n} $,  I also think that $ \sum _{p \le x}f(x) \sim \sum_{n=0}^{\infty}a(n)\operatorname{Li}(x^{n+1}) $.  Of course $ \operatorname{Li}(x)= \int_{2}^{x}\frac{du}{\ln(u)} $.


Exporting raster as .tif with "use renderer" and "force RGB" produces inaccurate colors?

In ArcMap 10.2 I have a DEM and my aim is to change its color ramp using ArcMap, then export this colored raster as a geotiff (8 bit).  I checked "use renderer" and "force RGB" options but the results are not good (EDIT: when viewed in ArcMap). With some color ramps, the results are really off, and with others, they are slightly off.  For example:      Is this a bug, or is this an artifact stemming from the the original image being simplified into an 8 bit image? (Does ArcMap stores its color ramps with more than 8 bits?)     it seems that results only look strange in ArcGIS - if viewed in other applications, colors look right.   So why is ArcMap displaying the exported rasters inaccuractly?   Do I need to change some settings somewhere to have them display correctly?


Allocating mem using new instead of malloc

I am trying to work out the precise equivalent of this code using new instead of malloc. Pointer to pointer to float array[4]:   float (**f)[4] = (float(**)[4])malloc(2 * sizeof(float(*)[4])); for (int p = 0; p < 2; p++) {     f[p] = (float(*)[4])malloc(3 * sizeof(float[4])); }   I have tried a bunch of combinations, but cannot find the correct syntax.  float (**f)[4] = new ...


how to prove that this positive sequence converges to 1

I have a positive infinite sequence $a_n$ and I know that $a_n$$a_{n+1}$ converges to 1 and also $a_n$$a_{n+2}$ converges to 1.  Why does it mean that $a_n$ also converges to 1? How can I prove it?  Thanks.


Trying to overwrite '/usr/bin/tor', which is also in package tor-browser 3.5.4

Whenever I try to open Ubuntu Software Center it says my files are corrupted, when I click repair, it says,  Package operation failed       The installation or removal of a software package failed Details installArchives() failed: (Reading database ...  (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 255659 files and directories currently installed.) Preparing to unpack .../tor_0.2.4.20-1_i386.deb ... Unpacking tor (0.2.4.20-1) ... dpkg: error processing archive /var/cache/apt/archives/tor_0.2.4.20-1_i386.deb (--unpack):  trying to overwrite '/usr/bin/tor', which is also in package tor-browser 3.5.4 dpkg-deb: error: subprocess paste was killed by signal (Broken pipe) Processing triggers for ureadahead (0.100.0-16) ... Processing triggers for man-db (2.6.7.1-1) ... Errors were encountered while processing:  /var/cache/apt/archives/tor_0.2.4.20-1_i386.deb Error in function:  dpkg: dependency problems prevent configuration of vidalia:  vidalia depends on tor (>= 0.2.2.29-beta-1); however:   Package tor is not installed.  dpkg: error processing package vidalia (--configure):  dependency problems - leaving unconfigured dpkg: dependency problems prevent configuration of tor-geoipdb:  tor-geoipdb depends on tor (>= 0.2.4.20-1); however:   Package tor is not installed.  dpkg: error processing package tor-geoipdb (--configure):  dependency problems - leaving unconfigured


Does an Eldritch Knight fighter's War Magic feature benefit from the Extra Attack feature?

I am wondering about the wording here. On PHB p. 75, the description of the Eldritch Knight fighter's War Magic feature says:  When you use your action to cast a cantrip, you can make one weapon attack as a bonus action.  Does the Eldritch Knight's War Magic feature benefit from the Extra Attack feature, allowing them to make multiple attacks? I feel like the wording would have to be "you can take an Attack action as a bonus action" to have access to multiple attacks. But the current wording doesn't so I read this as not allowing multiple attacks. Am I right, or does War Magic allow the Eldritch Knight to benefit from the "Extra Attack" feature too?


I've declared a footer, yet it still wont stick to the bottom? Here is an image of the footer and explains why it wont stick to the bottom.    Here is the code  <!DOCTYPE html> getLocale() }}">      <title>{{ config('app.name') }}: @yield('title')</title>     <link rel="shortcut icon" href="favicon.ico" type="image/vnd.microsoft.icon" />     <link href="/assets/hhh/frontend/css/bulma.css" rel="stylesheet" type="text/css">     <link href="/assets/hhh/frontend/css/override.css?v={{time()}}" rel="stylesheet" type="text/css">     <link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/font-awesome/4.7.0/css/font-awesome.min.css" type="text/css">     <link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Ubuntu:regular,bold|Ubuntu+Condensed:regular">

 &nbsp; {{ config('app.name') }} Hotel...

 &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;The users at mind

                              &nbsp; {{ $onlineCount }}
&nbsp;                                                       &nbsp; Join Game

Server Status: &nbsp;

                 @yield('nav_parent')

     @yield('nav_child')

         @yield('content')         @include('frontend.partials.scripts')

Some text to go on your footer.


I am trying to recursively search for a filename ending in .png My find command works fine for *.js, but not for *.png.  ~ >find dev -name *.png ~ >find dev -name bluerightarrow.png dev/sandbox/ScheduleEditorTS/ScheduleEditorTS/img/bluerightarrow.png ~ >find dev -name *.js dev/backup/ScheduleEditorTS/packages/jQuery.2.1.3/Content/Scripts/jquery-2.1.3-vsdoc.js dev/backup/ScheduleEditorTS/packages/jQuery.2.1.3/Content/Scripts/jquery-2.1.3.js ... etc


Sorting HashMap objects on their properties rather values

This is not my real code I have just simulated in order to understand what to do next.  I have class Person with properties age, height weight. Now In my class Group  I create two four objects   Person programmer, student, clerk, tech;   I have HashMap rollCall  Map<Person, Integer> rollCall = new HashMap<Person, Integer>();   to add all these using Person and number of Persons as type Integer  rollCall.put(programmer, 1); rollCall.put(clerk, 2); rollCall.put(student, 1); rollCall.put(tech, 3);   I have seen alot of people sorting HashMap using TreeMap on value I want to sort on a property of Person rather on value. I want to sort all these people on their age (i.e. programmer.getAge();). I am not sure if I will use comprator which works only on collection not map.  . Please help ... .


Should Dalvik Cache be wiped in the case of switching Lollipop ROMs

I know what dalvik and ART is.  But my question is, when switching custom ROMs (All anything above 5.0), is it necessary to wipe the dalvik cache? Wiping the Cache is necessary but wiping dalvik (which doesnt exist in Lollipop) should be necessary or not. What impact will it cause if we wipe dalvik (something not present).  In lollipop, What does the dalvik cache contain(is it an empty folder?)


Prove the existence of an analytic function

Let $\Delta=\{z\in \mathbb C: |z| < 1\}$. Let $f: \Delta \rightarrow \mathbb C$ be a one-to-one analytic function fixing the origin. Prove that there is a one-to-one analytic function $g: \Delta \rightarrow \mathbb C$ such that $[g(z)]^2=f(z^2)$. Further, show that such a function is odd.  The only idea which comes to my mind is the following (not sure whether it is the right direction though). Let $h: \Delta \rightarrow \Delta \rightarrow \mathbb C,\ z\mapsto z^2\mapsto f(z^2)$. Note that $h'(0)=0,\ h''(z)=2f'(z^2)+4z^3f''(z^2)$; since $f$ is one-to-one and analytic, its derivative never vanishes, so $h''(0)\ne 0$. So $h$ is an analytic function of $\Delta$ with a zero of order two at the origin. Then there is an analytic function $g$ defined in an open disc about the origin with a simple zero at the origin such that $[g(z)]^2=f(z^2)$.   This is the only thing I came up with, but it seems to be a little bit irrelevant since I don't see any way of extending this $g$ to the whole $\Delta$, and also the injectivity and oddness of such a $g$ are unclear.


Is there a reason to not assign a variable in the while block declaration?

Whenever I do something like this...  var obj;  while (obj = doSomething()) {   // something with obj }   JSHint tells me warning  84| Expected a conditional expression and instead saw an assignment.. However, doing obj = doSomething() returns the value that doSomething() returns during assignment, so it makes sense to write a while loop in this fashion.  Is there a specific reason that JSHint warns me, and more importantly, are there reasons to not do this? Or can I tell JSHint to ignore those lines for that specific warning?


I often used \boxed{...} from the AMS math package to place a box around important equations.  However, this approach often produces somewhat awkward looking output.  Consider  \documentclass{article} \pagestyle{empty} \usepackage{amsmath} \begin{document}  \[  \boxed{c_i = \sum_jA_{ij}}  \]  \[  \boxed{c_i = \langle\psi|\phi\rangle}  \] \end{document}     Observe that in the first case the  box looks unbalanced while in the second case could do with more padding on both the top and bottom.  What is the best way to go about this?  I know that I could use a \phantom but am wondering if more elegant solutions exist.


I am trying to get a query from a database, however, the value I have for bindParam (:name) is not being bound, when I echo $sql and print_r($stmtTwo) the WHERE clause states WHERE :name instead of the string from $wherefinal.  The code I have is:  $sql= "SELECT Species.Species_ID      FROM Species      JOIN (          SELECT Species.Species_ID, COUNT(*) AS mynum          FROM Species_Opt LEFT JOIN Species ON (Species.Species_ID = Species_Opt.SO_Species_ID)          WHERE :name         GROUP BY SO_Species_ID HAVING mynum = 6          ) AS mytable ON Species.Species_ID = mytable.Species_ID"; $stmtTwo = $pdo->prepare($sql); $stmtTwo->bindParam(':name', $wherefinal); $stmtTwo->execute();   with $wherefinal being defined before the sql statement and being defined as:  $where = ""; foreach ($_POST as $k => $v){     $where .= "(Species_Opt.SO_Option_ID = $v) OR ";  }; $wherefinal = substr($where, 0, strrpos($where, " OR "));   And when echoed, $wherefinal displays:  (Species_Opt.SO_Option_ID = 4) OR (Species_Opt.SO_Option_ID = 12) OR (Species_Opt.SO_Option_ID = 17) OR (Species_Opt.SO_Option_ID = 20) OR (Species_Opt.SO_Option_ID = 21) OR (Species_Opt.SO_Option_ID = 32)   $v is from the value of a radio button from a form that is generated via a different SQL statement and smarty.


First axiom of sheaves: in noetherian topological spaces the direct limit presheaf is a sheaf.

Consider a topological space $X$ and a direct limit of sheaves and morphisms $\{ \cal{F}_i, f_{ij}\}$. Define the direct limit presheaf by $U \to \varinjlim \cal{F}_i $. In general this is just a presheaf. If $X$ is noetherian it is a sheaf, and this is the result I want to prove.  My attemp:  I tried to prove the first axiom of sheaves (I suspect that the second will need similar arguments). Let be an open set $U$ and an open cover $\{ V_i \}_i$ of $U$. Since $X$ is noetherian it can be can supposed that the cover is finite. Let $s \in \varinjlim \cal{F_i(U)}$ such that $s|_{V_i}=0 \quad \forall i$. The goal is to show that then $s=0$. Being $s \in \varinjlim \cal{F_i(U)}$, we know that there exists some $j / \quad s=f_j(U)(t_j)$ for some $t_j \in \cal{F}_j(U)$ ($f_i(U)$ are the morphisms of the direct limit of the abealian groups $\cal{F}_i(U)$ ). I can consider the germs ${t_j}_{V_i}$. If I could show that $s|_{V_i}=0 \Rightarrow {t_j}_{V_i}=0$ then the problem would be done, because the $\cal{F}_i$ are sheaves, in particular they verify the first axiom of sheaves, so $t_j=0$ and then $s=f_j(t_j)=0$.


Lightning web Component : Modify the Particular property in the incoming array in child component

Hi i am trying to modify the particular component  in the child array but getting the particular error   try is the incoming array from parent.  1 @track sethg; 2 this.sethg = this.try.findIndex(item => item.ter === event.detail.ter);  3 this.try[this.sethg].booleanvariable = false;   on line 3 i am trying to make the incoming value as false , getting below error can anyone find out the possible way to set the value.  ['set' on proxy: trap returned falsish for property 'booleanvariable ']


How can I move a PoseBone to a specific world space position?

I have written some code that calculates the world space coordinate I want to move the bone to but i am having trouble figuring out how to get that back into the bones coordinates.  from bpy import context, data from mathutils import Vector  def test_empty(matrix, name):     # view matrix by applying it to an object     obj_empty = data.objects.new(name, None)     context.scene.objects.link(obj_empty)     obj_empty.matrix_world = matrix   armature = data.objects["Armature"] pbones = armature.pose.bones root = pbones["root"] hips = pbones["hips"] test = pbones["test"]  # calculate root root_matrix = armature.matrix_world * root.matrix test_empty(root_matrix, "Root")  # calculate hips hips_matrix = armature.matrix_world * hips.matrix test_empty(hips_matrix, "Hips")  # calculate bone test_matrix = armature.matrix_world * test.matrix test_empty(test_matrix, "Test")  # get offset of hips from root bone offset = root_matrix.translation - hips_matrix.translation print(offset)  # calculate new location in local space new_position = test_matrix.translation + Vector((0,offset.y,0))  obj_empty = data.objects.new("TEST", None) context.scene.objects.link(obj_empty) obj_empty.location = new_position  # obviously something wrong here new_position = armature.matrix_world.inverted() * new_position  # move bone to new location test.location = new_position


I am using the following research statement template.  In my statement, I have to use the environment of the theorem, lemma, definition. It is giving me error when I am compiling my LaTeX file. I could not find the error. Any help appreciated.   %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % "ModernCV" CV and Cover Letter % LaTeX Template % Version 1.1 (9/12/12) % % This template has been downloaded from: % http://www.LaTeXTemplates.com % % Original author: % Xavier Danaux (xdanaux@gmail.com) % % License: % CC BY-NC-SA 3.0 (http://creativecommons.org/licenses/by-nc-sa/3.0/) % % Important note: % This template requires the moderncv.cls and .sty files to be in the same % directory as this .tex file. These files provide the resume style and themes % used for structuring the document. % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  %---------------------------------------------------------------------------------------- %   PACKAGES AND OTHER DOCUMENT CONFIGURATIONS %----------------------------------------------------------------------------------------  \documentclass[11pt,a4paper,sans]{moderncv} % Font sizes: 10, 11, or 12; paper sizes: a4paper, letterpaper, a5paper, legalpaper, executivepaper or landscape; font families: sans or roman  \moderncvstyle{casual} % CV theme - options include: 'casual' (default), 'classic', 'oldstyle' and 'banking' \moderncvcolor{blue} % CV color - options include: 'blue' (default), 'orange', 'green', 'red', 'purple', 'grey' and 'black'  \usepackage{lipsum} % Used for inserting dummy 'Lorem ipsum' text into the template  \usepackage[scale=0.75]{geometry} % Reduce document margins %\setlength{\hintscolumnwidth}{3cm} % Uncomment to change the width of the dates column %\setlength{\makecvtitlenamewidth}{10cm} % For the 'classic' style, uncomment to adjust the width of the space allocated to your name  \usepackage{amsfonts, amsthm} \usepackage{amsmath} \usepackage{amssymb} \usepackage{booktabs} \usepackage{color} \usepackage{colortbl} \usepackage{enumitem} \usepackage[utf8]{inputenc} \usepackage[english]{babel} %\usepackage[hang,flushmargin]{footmisc} %\usepackage[margin=25mm]{geometry} %\usepackage{mathtools}  \newtheorem{theorem}{Theorem}[section] \newtheorem{corollary}{Corollary}[theorem] \newtheorem{lemma}[theorem]{Lemma}   %\newtheorem{theorem}{Theorem} %\newtheorem{specialthm}{specialthm} %\renewcommand*{\thespecialthm}{\arabic{specialthm}}   %---------------------------------------------------------------------------------------- %   NAME AND CONTACT INFORMATION SECTION %----------------------------------------------------------------------------------------  \firstname{} % Your first name \familyname{} % Your last name  % All information in this block is optional, comment out any lines you don't need %\title{Research Statement} %\address{}{} %\mobile{()} %\phone{(000) 111 1112} %\fax{(000) 111 1113} %\email{} %\homepage{staff.org.edu/~jsmith}{staff.org.edu/$\sim$jsmith} % The first argument is the url for the clickable link, the second argument is the url displayed in the template - this allows special characters to be displayed such as the tilde in this example %\extrainfo{additional information} %\photo[70pt][0.4pt]{pictures/picture} % The first bracket is the picture height, the second is the thickness of the frame around the picture (0pt for no frame) %\quote{"A witty and playful quotation" - John Smith}  %----------------------------------------------------------------------------------------  \begin{document} \makecvtitle % Print the CV title %---------------------------------------------------------------------------------------- %   EDUCATION SECTION %----------------------------------------------------------------------------------------  \section{Previous Research Experience} \begin{theorem} Hello new \end{theorem}  \begin{lemma} \end{lemma}  {\hskip 2em}     %---------------------------------------------------------------------------------------- \section{Research Goals}      \end{document}


rsync over ssh without typing the password each time

I got a bash script to synchronize data between two computers. It works fine but I have to type my password every time the rsync command is called.   #!/bin/bash  sourceIP="192.168.178.128" sourceUser="user1" destinationUser="user2"  function sync() {      rsync --archive --progress -v -e "ssh -l $sourceUser " $sourceIP:/home/$sourceUser/$1/ /home/$destinationUser/$1 }  sync Pictures sync Music sync Videos sync Documents   How to store the password (via prompt) in a variable and pass it to rsync/ssh?


How can I describe a low temperature that doesn't actually feel cold?

Last night, I walked home from my bus stop (in Belgium). Since it was around 11 PM, it was quite cold, probably only about 4-5 °C. However, it didn't actually feel cold at all, and I didn't feel like I had to rush to get home for the cold. In fact, I didn't have headwear on, but I didn't get cold ears. It was about the same temperature as this morning, but the difference is that this morning felt a lot colder, probably due to the wind and drizzle.  I tried to describe it in English on Twitter, but I couldn't actually find a proper word to decribe it. I considered "a warm cold" or "a cozy cold", but I thought these were too poetic, more like something you'd use in a fairy tale than in a tweet to a handful of followers.  How can you describe that temperature without it becoming confusing or poetic?


I would like to know why they make rockets so big

Why are rockets so big? I mean wouldn’t it be easier to make them smaller for flying to the moon? So, why large?


Prove that $\gcd(a^{2^m}+1,a^{2^n}+1)=\begin{cases} 1,& \text{ if } a\ \text{is even;} \\ 2 & \text{ if } a\ \text{is odd.} \end{cases}$.

Show that if m> n, then $a^{2^n} + 1$ is a divisor of $a^{2^m} -1$. Show that if $ a, m, n \in \mathbb Z ^ + $ with $ m \neq n $, then $$\gcd(a^{2^m}+1,a^{2^n}+1)=\begin{cases} 1,& \text{ if } a\  \text{is even;} \\  2 & \text{ if } a\ \text{is odd.}  \end{cases}$$  Proof: Suppose without loss of generality that $ m> n $, and observe the following $$a^{2^m}-1=(a^{2^{m-1}}+1)(a^{2^{m-2}}+1)\cdots (a^{2^{n}}+1)(a^{2^{n}}-1).$$ Then, we have to $a^{2^m}+1=(a^{2^n}+1)q+2$, with $q\in\mathbb Z$. So, $$\gcd(a^{2^m}+1,a^{2^n}+1)=(a^{2^n}+1,2).$$ So, if $ a $ is even, then $ a ^ {2 ^ n} + 1 $ is odd, so the gcd is $ 1 $, and $ 2 $ otherwise. There is a part that I do not understand, and it is the part where it says that $\gcd(a^{2^m}+1,a^{2^n}+1)=(a^{2^n}+1,2).$. Why the right side of the gcd becomes $2$, can someone explain that part to me?


Assessing potential multicollinearity for various model types meant for causal inference

I was wondering if, in the case where I use the same set of predictors for different kind of models (e.g. ANOVA, Poisson GLM, logistic regression...), VIF values for each predictor would be similar across models or if they would vary depending on response variables and model types (e.g. logistic vs. Poisson GLM)? EDIT: the helpful comments below confirmed my idea that, since correlations among predictors are independent of response variables, VIF values should be similar across model types. However, if I understand explanations from EdM correctly (in the comments as well as  and ), the actual effects of predictors multicollinearity on coefficients will vary between models fitted with ordinary least squares and those using Maximum Likelihood. Consequently, the use of generalized VIF (GVIF; see also ) or  for each model is recommended.  Still, I am unsure about the two following things:  Does that mean that VIF/GVIF values would be indifferent to model misspecification/overfitting? I'd figure that it is perhaps not a good idea to compute correlations with an inappropriate sample size. To illustrate my questioning with a ridiculous example, would it be okay to compute GVIF for 30 predictors in a model with only 50 observations?  Does that make any sense to preventively drop redundant predictors before actually assessing the effects of this multicollinearity on coefficient estimates?


So I took a calculus course and my first homework has this one. I am stuck on this one for 2 days straight. Please help me; I will appreciate some hints.   So far we learned the axioms of a field and the axioms for inequality (trichotomy, transitivity, etc.) Do I actually need to divide it into cases where both $x,y$ are with the same sign and another case where they are with different signs?  Is there an elegant and short way for this?


Have created one folder say 'cat' in bundle which contains images. Now I need to load all that images in an array. how to do that programmatically ?


Why is the Array Modifier offsetting this object by 1 in the Z axis when the Z field says 0?

The screenshot below says it all, really. The object is offset in both the X and the Z axes, though only the X axis says 1. No other modifiers are on it, no constraints, no locked axes, and I can't think of anything else that would affect this. How can I make it stop doing this?


Does there always exists an injective homomorphism from $G$ into $S_m$ for $m<n$

Does there always exists an injective homomorphism from $G$ into $S_m$ for some $m<n$ where $|G|=n$   I know that for $|G|=n$ there is always an injective homomorphism from $G$ into $S_n$


How can I keep a process alive after closing the putty session?

I am using putty to interact with Linux server. I have started a process using putty. The process is running and will take 5-6 hours. I want that process to keep running after I close the putty session. How can I keep that process alive after closing the putty session? I do not want to keep the computer ON all the time. Is there any way to do this?.


Prove that $\mathbb{Z}$ is not isomorphic to additive group of any vector space over any field.  Proof.  Surpose that: $\phi : (A, +) \rightarrow  \mathbb{Z} $ is an isomorphism. Then there is some $r∈A $ such that $ϕ(r)=1_\mathbb{Z}$. We have $$ 1_\mathbb{Z}=ϕ(r)=ϕ(2(r/2))=2ϕ(r/2)$$  or equivalently that $ϕ(r/2)=\frac{1}{2}$. But this is not in $ \mathbb{Z}$, so there can be no such morphism.  Is my proof above correct? Thanks


In  (section 2.3), it is stated that:     A point $x^*$ is a minimizer of a function $f$ (not necessarily convex) if and only if $f$ is subdifferentiable at $x^*$ and $0 \in\partial f(x^*).$   Could anybody provide me with references for a proof of the above statement?   Is there a reference where we can learn more about subgradients of non-convex functions?  In Section 3. Calculus of subgradients of the above notes,many properties of subgradients are presented for convex functions. I would like to know which ones among these properties still hold for non-convex functions.  Thank you in advance!


Prove if f(z) is entire function s.t $|f(z)|\leq M|z|$ then $f(z)$ Is polynomial of degree $1$

Let $f(z)$ be an entire function s.t $|f(z)|\leq M|z|$ ; $M>0$ is a constant then $f(z)$ Is polynomial of degree 1   My try $f(z)$ is entire so it can be written as a $\sum a_n z^n$  $$|\sum a_n z^n|\leq \sum |a_n||z|^n\leq M|z|$$  So $n=1$  Seems that the move $\sum |a_n||z|^n\leq M|z|$ is problematic


How does a reputation event become a "private" reputation event?

The answer to  mentions private reputation.        Month reputation is the amount by which your reputation changed that month, excluding "private" reputation events. Certain reputation events are excluded from your public user profile, such as deleted posts or downvotes, so those are excluded from the leagues as well.      Can someone please explain this in more detail and maybe give examples of how a deleted post or down vote becomes a "private" reputation event?


Did Padme's death have something to do with Anakin's force choke?

They said that she lost the will to live, but was there other complications when she gave birth and she just didn't have the will to fight it? And if so, is it possible that Anikan's force choke caused it (physically, obviously it hurt her mentally)? Or did she just decide two children are not reason enough to live and just died of grief?


A map can be open, closed and continuous indepently.

Introduction to Topological Manifolds - 2e (J.M. Lee), pg-46 ,Q-25.   For each of the following properties, give an example consisting of two subsets $X,Y \in \mathbb{R^2}$, both considered as a topological space with their Euclidian topologies, together with a map $f:X \to Y$ that has the indicated property.   (a) $f$ is open but neither closed nor continuous.   (b) $f$ is closed but neither open nor continuous.   (c) $f$ is continuous but neither open nor closed.   (d) $f$ is continuous and open but not closed.   (e) $f$ is continuous and closed but not open.   (f) $f$ is open and closed but not continuous.       During my attempt, I have come up with the following maps and spaces.   f) I define a map that divide an open disk $X \equiv B_r(0)$ in $\mathbb{R^2}$ into two parts for some $r'<r$ where all points that lies inside open ball of radius $r'$ are mapped to a one single point and rest to another single point. Then I define $Y$ to the space formed with those two points. It is clear $f$ is open and closed. Also, the inverse image of second point is obviously not open in $X$. (I don't know how fair is merely considering two points in $\mathbb{R^2}$ pertaining to the spirit of this question)  e) I take the closed annulus between $1\leq r \leq 2$ and define the map in polar coordinates: $f(r)=r-1$. This is a quotient map that collapses the inner ring to a point and maps to $\bar{B}_1(0)$. Since Quotient maps are continuous, it is continuous. I think this map should be closed using the closed map lemma. A map from Compact space to a hausdorff spaces is closed. And I think it's not open because if we consider the sector of an annulus between two angles. The ring that collapses to a point doesn't allow the set to remain open in $\bar{B}_1(0)$.  d) I think a topological embedding would do in this case of any open ball into some bigger open ball.     But from this point onwards, I am getting worried that I am missing the big picture of this question. I think I am merely brute forcing the examples. Is there any general conception I am missing to generate such examples. Something thats's bit more intuititve to comprehend?


What processing is done on RAW files in the camera?

Recently I came across a debate about whether it's fair to call RAW 'unprocessed' or 'unaltered' sensor data of a DSLR. As far as I know, the analog sensor data is processed into a digital RAW file using the ISO setting, a process during which the Bayer-sensor data is demosaiced as well. However, those are just the necessary steps for saving a digital file while maintaining maximum quality.  Are those assumptions correct? If so, are there any additional steps that need to be performed between the sensor receiving light and the saving of the RAW file? And can those be reasonably be described as an 'alteration' of the sensor data, or is it fair to say that a RAW file holds the unaltered sensor data?


Exeeding the speed of light by adding velocities

Well you know how it's said that things can't travel at or past the speed of light? However, can't they move at speeds greater than the speed of light relative to another object?   For example: What if two rocket ships that are travelling at 60% the speed of light fly past each other? Won't people on both ships perceive the other ship as travelling at a speed greater than the speed of light? If yes, does this have any significance?


How to split a large file into two parts, at a pattern?  Given an example file.txt:  ABC EFG XYZ HIJ KNL   I want to split this file at XYZ such that file1 contains lines up-to XYZ and rest of the lines in file2.


Dividends are paid to share holders based on ownership of shares before the “ex-dividends” date.  Example: Stock A has an ex-date of July 1st Stock B has an ex-date of July 15th Stock C has an ex-date of August 1st  Is it legal to buys Stock A on June 30th, sells it on July 2nd, then buy Stock B on July 14th,   sells it on July 16th, then buys Stock C on July 30th, sells it on August 2nd... and continues this process to “mine” dividend payouts? Is this a strategy that is used by investors? Why or why not?


What is the income limit for a qualifying relative dependent?

My younger sister is 28 years old. She lives in my house and I pay for more than 50% of her expenses (food, clothing... everything). Her income in  2018 was $7,000 for the year. She is a waitress.   Can I indicate her as my dependent or not?


Show that $[0, 1)\times[0, 1)$ is homeomorphic to $[0, 1]\times[0, 1)$ but not to $[0, 1]\times[0, 1]$. When I sketch these spaces it this statement makes sense intuitively because $[0, 1]\times[0, 1]$ is closed and $[0, 1)\times[0, 1)$ and $[0, 1]\times[0, 1)$ are each "missing" part of their boundary which would make them closed. I also know, $[0, 1]\times[0, 1]$ is compact and compact spaces are not homeomorphic to non-compact spaces.   I am having trouble saying this explicitly, as is pretty obvious in the clumsiness of the wording above.


I'm a complete beginner so I really don't know what is happening.


How to prove that if $\forall x \in (a,b)$ Lebesgue integral $\int_{(a,x)}fd\lambda=0$, then $f(x)=0$ $\lambda$-almost everywhere?

Let $f:(a,b)\rightarrow\mathbb{R}$.  The statement to prove is that if $\forall x \in (a,b)$ Lebesgue integral $\int_{(a,x)}fd\lambda=0$, then $f(x)=0$ $\lambda$-almost everywhere.  So if it wouldn't be true then we would have $\forall x \in (a,b):\int_{(a,x)}f_+d\lambda=\int_{(a,x)}f_-d\lambda\neq0$, so every interval contains positive and negative values of the function. It is  such an $f$ so my guess would be that this function is not Lebesgue measurable and we can't take this integral.  Thanks in advance!


$f_n(x) = \cos \left( \sqrt{x^2 + \frac{1}{n} }\right)$ is uniformly convergent

I need to prove that this sequence of functions:  $$f_n(x) = \cos \left( \sqrt{x^2 + \frac{1}{n} }\right)$$   converges uniformly on $[0,1]$.  This is a question regarding  one. There's an answer that suggests these hints:  $$\cos\alpha-\cos\beta=-2\sin\frac{\alpha+\beta}{2}\sin\frac{\alpha-\beta}{2}$$  $$\sqrt{x^2+\frac{1}{n}}-x=\frac{\frac{1}{n}}{\sqrt{x^2+\frac{1}{n}}+x}\leq\frac{1}{\sqrt{n}}\tag{1}$$  in order to prove that, $\forall \epsilon>0, \exists n_0$ such that, for all $n\in \mathbb{N}$ we have:  $$n>n_0 \implies \sup\left|\cos\left(\sqrt{x^2+\frac{1}{n}}\right)-\cos(x)\right|<\epsilon$$ I did the following:  If I prove that such $n_0$ always exists, I can prove that this sequence converges uniformly (or not). By the hints he gave, we have:  $$\left|\cos\left(\sqrt{x^2+\frac{1}{n}}\right)-\cos(x)\right| = \left|2\sin\frac{\frac{\frac{1}{n}}{\sqrt{x^2+\frac{1}{n}}-x}}{2}\sin\frac{\frac{\frac{1}{n}}{\sqrt{x^2+\frac{1}{n}}+x}}{2}\right|\le 2\sin\frac{1}{2\sqrt{n}}\sin\frac{1}{2\sqrt{n}}\to 0$$  *the last $\le$ symbol holds because $\sin$ is crescent from $0$ to $\frac{\pi}{2}$, but how $x\in [0,1]$ guarantee that the following will happen? Also, what if $x>1$ or $x<0$? Don't inequality $(1)$ holds for all $x$?  So since $\left|\cos\left(\sqrt{x^2+\frac{1}{n}}\right)-\cos(x)\right|$ is always greater than $0$ but we proved here it's $\le 0$, we have that $\sup$ of this sequence of absolute values is $0$. We haven't touched $n_0$ so far, neither $\epsilon$. Is it because the inequalities used hold for large $n$ and we always have $0<\epsilon$?. Therefore, I proved that this sequence converges uniformly.  Extra: also, does $\frac{\frac{1}{n}}{\sqrt{x^2+\frac{1}{n}}+x}\le \frac{1}{\sqrt{n}}$ holds because:  $$n\left(\sqrt{x^2+\frac{1}{n}}+x\right)\ge \sqrt{n}\implies LHS^{-1}\le RHS^{-1}$$  ?  I think that since $n>\sqrt{n}$ for $n>1$ (we're intersted in large values of $n$), we have that $n\cdot \mbox{something}>\sqrt{n}$.


NETBEANS: “java.lang.OutOfMemoryError: Java heap space”

I encountered an error in Netbeans:     java.lang.OutOfMemoryError: Java heap space   This is the first time I encountered this and I don't know how to deal with it.   Can somebody explain this error message to me?   And how can I increase the heap memory? Thank you!


Find command that excludes paths listed in a file

I need to exclude a bunch of paths from a find command. For example:  find "$(pwd)" -not \( \  -path "*/.git"\  -o -path "*/.git/*"\  -o -path "*/.vscode"\  -o -path "*/.vscode/*"\  -o -path "*/node_modules"\  -o -path "*/node_modules/*"\  -o -path "*/Image"\  -o -path "*/Image/*"\  -o -path "*/Rendered"\  -o -path "*/Rendered/*"\  -o -path "*/iNotebook"\  -o -path "*/iNotebook/*"\  -o -path "*/GeneratedTest"\  -o -path "*/GeneratedTest/*"\  -o -path "*/GeneratedOutput"\  -o -path "*/GeneratedOutput/*"\  -o -path "*/*_files" \) -type d   However, I want to read these paths from a text file instead of listing them all on the command-line. How can I do that?


How can I calculate the number of work days between two dates in SQL Server?   Monday to Friday and it must be T-SQL.


After upgrading to nvidia 375, glitchy borders around windows

I recently upgraded from nvidia-370 to nvidia-375 as part of my efforts to install CUDA/Tensorflow, but I'm now getting a weird bug. Upon resuming from sleep,  appear around all windows and menu elements.  I've had bugs like this before, but the " pressctrl + alt + f1 and then ctrl + alt + f7" method, which worked with other sleep bugs, doesn't fix this problem. Does anyone know of a solution to this, or is my only option to downgrade to the 370 driver? I'm running 16.04 on kernel 4.4.0-62-generic


Why does Stack Exchange ask for a reload on successful automatic login?

I'm looking for an answer considering both technical limitations and user experience.   Does it need a reload from a technical standpoint?


How to make a procedural texture a flat image? (Reverse UV Mapping)

Truthfully, I have generated a bricks texture to simulate lights on my spaceship... But now I want to export the whole project to marmoset for the actual render... but I can't export the lights. Is there a way I can tell Blender to take the texture map and turn it into a flat image based on the UV map? Thanks guys!


We are staying at a resort in Basye this summer and want to know the easiest way to take a couple of day trips into DC.  I'm thinking that we would drive most of the way in, then use a park and ride and take the metro to the National Mall.  I'm assuming that traffic and parking in DC would be difficult.


"It is not possible to check out a single file. The finest level of checkouts you can do is at the directory level."  How do I get around this issue when using Subversion?  We have this folder in Subversion where we keep all our images. I just want to check out one file (image) from that. This folder is really big and has ton of other stuff which I don't need now.


Using ArcGIS 10.1.  I have a large polygon feature class (130,000 records).  I need to do an inside/outside buffer (+5 then -5 to fill in some gaps)... the process takes so long, I'm looking for a way to speed it up.  Dissolving?  Splitting into smaller chunks. Any tips are appreciated.


How to copy Chrome's flags from a different Google account?

After adjusting chrome://flags/ Chrome is crashing completely.  I can't revert anything because of the "aw snap" and crashing. I wish to reset all flags from a different Google account, like a mirror. Is this possible? and how?


Let $X$ be uncountable. Then the set of injective functions $f\colon X \to \mathbb{R}$ has empty interior in $\mathscr{C}(X;\mathbb{R})$

Here I'm working with the metric: $$d(f,g)=\sup_{x \in X}|f(x)-g(x)|.$$  Let's take $h$ in the set and let $\epsilon>0$ be given. I need to prove that there exists another bounded, not injective function $j$ such that $d(j,h)<\epsilon$.   I would be done if there where two images of $h$ to a distance less than $2\epsilon$. Cause in such case, let them be $h(x_0)$, $h(y_0)$ and suppose that $h(x_0)>h(y_0)$. Then setting $j(x_0)=h(x_0)-\dfrac{h(x_0)-h(y_0)}{2}$ , $j(y_0)=h(y_0) + \dfrac{h(x_0)-h(y_0)}{2}$ and $j(x)=h(x)$ otherwise, we would have the required.   Suppose, by way of contradiction, that no two images are that near, i.e., in each open interval of lenght $2\epsilon$, there is at most one image of $h$. Since $h$ is bounded, its image can be covered by a finite number of intervals of lenght $2\epsilon$, which implies that there are only finite images of $h$. Finally, like $h$ was injective on an infinite set $X$, this cannot be.   I have my doubts because I didn't use that $X$ was uncountable, just infinite. Is this proof ok?


In comments - how do I highlight with back-ticks when the last character is a backslash

In comments there's strange behaviour with ending code markup in backslashes. This works just fine here, but not in comments:       First-highlight\-xyzNext-highlight   Instead it overruns as:       First-highlight\-xyzAnother-highlight`   For example:        This should come out as: testing testing\123testing and works just fine here, but in comments it appears as:        Likewise, testing\ works just fine here, but the backslash is ignored in comments and it comes out as just testing.  How do I do this? Or is this a bug?


I am trying to detect whether the 'a' was entered as the first string argument.


Why does python append to all lists instead one when using one line list declaration(this: a = b = c = [])?

Python appends to all lists(like they are different pointer for the same memory address) when decalred with one line syntax(this: a = b = c []) but no such case with non-iterables or seperate declaration.  Same thing was causing a bug in my program when I used append() and after some(a lot) debugging I found that this was causing the bug.  Example code with output:  a = b = c = [] a.append(1) b.append(2)  print("1st", a, b, c) # Output: 1st [1, 2] [1, 2] [1, 2]  # But not with some other types or when reassigned # Reassigning list a = b = c = [] a = [1, 2, 3]  print("2nd", a, b, c) # Output:2nd [1, 2, 3] [] []  # Multi-line for control a = [] b = [] c = [] a.append(1) b.apend(2)  print("3rd", a, b, c) # Output:3rd [1] [2] []   Seperate output of program     Output:   1st [1, 2] [1, 2] [1, 2]   2nd [1, 2, 3] [] []   3rd [1] [2] []   Are the lists something like different references but to the same memory address when assigned with one line syntax.


I want to remove some vertical spacing in my page. Actually, the page is formatted automatically through this command: \documentclass[12pt,twoside]{report} \begin{document}  \chapter{Conclusions} \input{tex/08_conclusion.tex}  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%              APPENDIX             %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%             REFERENCES            %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \pagebreak \addtotoc{Bibliography} \printbibliography  \end{document}  Top of the page:  The output is shown in this way:


How can I up my confidence level in my technical skills?

Let me paint a picture of my background in brief. I did my undergraduate degree in mechanical engineering. I was a good student (almost all A's) till my high school. However, I struggled a lot in my first two years of engineering. I failed 3 subjects and had to retake them. I did fairly well in my last two years and managed a GPA of 3.7. But, my early failure played a heavy toll on my self confidence. I always felt and still feel like I am not worthy for my grades or getting a job.  I was interested in research, so went to a better school for master's degree. Again, though I had very good grades there, I struggled a lot during my job interviews. I always felt inadequate and unconfident about my ability to sustain in that job. As a result I did not get selected in those companies. I got offer in a small company which hired me only looking at my grades. My professors also said that I deserve better workplace but I didn't get it only because of my lack of self confidence and technical speaking skills.  I figured that, since I loved doing research, I should go for a PhD. I worked hard during the last five years. I tried coming out of my comfort zone, try different things, work on challenging projects. I started feeling confident midway through my PhD. However, now I am in my last year and towards the end of writing my thesis. And I am feeling the same anxiety of technical inadequacy and unworthiness.  I am again getting the feeling that I am upto no good and I can't get a decent job or postdoc position with my skillset. Only issue is that I am 29 years old and I will have to get a proper job soon to support my family. I don't know if I am capable of doing that.   My question is, assuming that I suffer from severe case of imposter syndrome, what's my remedy? How can I improve my confidence levels during an interview? I want to feel alive during job search and interviews. I don't want to feel all hopeless and inadequate during any future opportunities.   Are there any suggestions?


Is the multiplication operator on $\ell^p$ compact?

Let $p\in[1,\infty]$, $a\in\ell^\infty$ and $$T:\ell^p\to\ell^p\;,\;\;\;x\mapsto ax.$$ Note that $\left\|T\right\|=\left\|a\right\|_{\ell^\infty}$. It's easy to see that if $a\in\ell^1$, then $T$ is nuclear and hence compact.  Can we more generally conclude that $T$ is compact?  Assume $p<\infty$. The intuitive approach would be to define $$T_n:\ell^p\to\ell^p\;,\;\;\;x\mapsto(a_1x_1,\ldots,a_nx_n,0,\ldots)$$ for $n\in\mathbb N$ and to show that $\left\|T_n-T\right\|\to0$. Now, $$\left\|(T_n-T)x\right\|^p=\sum_{i=n+1}^\infty|a_ix_i|^p\tag1$$ for all $x\in\ell^p$ and $n\in\mathbb N$. The right-hand side of $(1)$ clearly converges to $0$ as $n\to\infty$, but this only yields convergence in the strong operator topology. On the other hand, if $(a_n)_{n\in\mathbb N}$ would be nonincreasing and $a_n\to0$ (e.g. $a_n=\frac1n$), then $$\left\|(T_n-T)x\right\|^p\le|a_{n+1}|^p\left\|x\right\|_{\ell^p}^p\tag2$$ for all $x\in\ell^p$ and $n\in\mathbb N$ and we could immediately conclude $\left\|T_n-T\right\|\to0$. EDIT: Maybe the general result can be obtained from the convergence in strong operator topology (which holds by $(1)$) by noting that $\ell^p$ has the approximation property; but I'm not sure whether this is true.


Is the acronym pluralized in the first parenthetical use?

When introducing an acronym, is the acronym pluralized in the first parenthetical use?  For instance request for forces is RFF, the first time I use it I spell out "request for forces" followed by (RFF) for use in the rest of the document.  Since "forces" denotes plural, do I include the "s" in the initial parenthetical i.e. (RFFs)?


How do I know how many enemies I need for the Genocide Route?

So, I have just completed the True Pacifist run in the game Undertale, and am now attempting a Genocide run. I understand that I need to kill everything, but I'm not sure if I've activated Genocide mode yet. How long does it take for the save points to start telling me how many enemies I have left to kill in the Ruins? And for that matter, how many enemies are in the Ruins?


I'm setting up a basic socket server following this guide:   So, I know that when you use the keyword struct it's to define a data structure, but as you can see in the example, it creates an instance of sockaddr_in using the structure keyword, but it's not for creating/defining the structure, it's to create an instance.  So I'm wondering why in this guide to define a sockaddr_in structure he puts the 'structure' keyword before, I tried it without and it compiles all correctly.  Is there any reason behind?


Can you show the way how to add the .tif to latex?

I can convert the .tif to .eps or .png, but the requirement of my documents needs me to supply .tif images. To make sure the images keep the same, I would like to put the .tif images. Does anyone know how to add the these images to the document?  Please show me the code, not the explanation of how latex works. Thank you.


I am using Lubuntu 16.04 and notice that there is no Language support for Urdu - A language spoken by more than 300 million people in the world. As a result, Urdu fonts are not displayed correctly. Is there any walk around to handle this problem?


Impossible to use virtual keyword on destructor

Is there any valid and usable case, that will force you not to use the virtual keyword before the destructor.  class Base { public:   virtual ~Base() { ... } // `virtual` causes error (not compile time or syntax) or wrong behaviour   // could contain other fields  };  // some example


How do I remove objects from a JavaScript associative array?

Suppose I have this code: var myArray = new Object(); myArray["firstname"] = "Bob"; myArray["lastname"] = "Smith"; myArray["age"] = 25;  Now if I wanted to remove "lastname"?....is there some equivalent of myArray["lastname"].remove()? (I need the element gone because the number of elements is important and I want to keep things clean.)


I want to make a batch-script that counts the times that the word "parent" appear in the file,    http://api.github.com/repos/godzillamesel/disclovestory/commits   I'm currenly downloading this file with:  cd "$env:programfiles\DiscLovestory\sys\update"  Remove-Item "git_commit.log"  [Net.ServicePointManager]::SecurityProtocol =  tls12, tls11, tls"  wget -O git_commit.log http://api.github.com/repos/godzillamesel/disclovestory/commits  pause   Having this is file is also gonna be needed as a "update-note" to the user. This script went straight to powershell, since i don't know how bitsadmin works, but if you also know how that should work, be my guest to help me out! As my script is based to be a batch-only script.  I want the output to go to: "%programfiles%\DiscLovestory\sys\update\version.log" and also in registry:    REG ADD "HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\DiscLovestory" /v DisplayVersion /t REG_SZ /d   In both output places it should be enough to just put version as follow: "x.xx" without quotations.  And if you wanna follow up on the script, or use it, be my guest. It is open-source at: https://github.com/godzillamesel/disclovestory


Does anyone know how to make (nice looking) double bracket multiset notation in LaTeX. i.e something like (\binom{n}{k}) where there are two outer brackets instead of 1 as in binomial? You can see an example of what I mean in  under the heading "Multiset coefficients" with the double brackets.  In wikpedia they typset it as: \left(\!\!{n\choose k}\!\!\right) but although this works well for LaTeX in maths mode, with inline equations the outer bracket becomes much larger than the inner bracket.  I have also tried using \genfrac{((}{))}{0pt}{}{n}{k} but it has an error with the double brackets.  I am using \binom as well in my document, so I would like the bracket sizes to be similar for \binom and \multiset.  Thanks for any help. I'm surprised I can't find a solution on google.


In some of my tikz pictures I use symbols from the fontawesome package.  Screenshot    Question  How can I rotate symbols in tikz?  MWE  \documentclass[border=2mm]{standalone} \usepackage{tikz} \usepackage{fontawesome}  \begin{document}  \begin{tikzpicture}      % Rocket     \draw (0,0) node {\faRocket};     % Rectangle     \node [draw, thick, shape=rectangle, minimum width=3cm, minimum height=2cm, anchor=center] at (0,0) {};  \end{tikzpicture}  \end{document}   What I tried so far  \draw[rotate=45] (0,0) node {\faRocket}; doesn't do the trick.


Notation of iterated composition of functions

Let $f$ be a function from $A$ to $B$ such that the image $f(A)\subset A$. Is there a widely accepted notation for the expression $$f\circ\left(f\circ\cdots(f\circ f)\right),$$ where $f$ composite with itself $n$ times? I failed to find a natural way to include the information $n$ in the notation.


On the sum of Double Power Series $\sum\limits_{-\infty}^{+\infty}\space\frac{2^n}{{x}^{2^n}+1}$

Let $\,{x\in\mathbb{C}}\,$, show that:    $$ S_{\small-}=\sum_{n=1}^{\infty}\space\frac{2^{-n}}{{x}^{2^{-n}}+1}\,=\frac{1}{\log{x}}-\frac{1}{x-1}\qquad\qquad\qquad\tag{1} $$    $$ S_{\small+}=\sum_{n=0}^{\infty}\space\frac{2^{+n}}{{x}^{2^{+n}}+1}\,=\frac{1}{x-1}\qquad\qquad\qquad\qquad\qquad\tag{2} $$    $$ S\,\,=\sum_{-\infty}^{+\infty}\space\frac{2^n}{\,{x}^{2^n}\,\,\,+1}\,=S_{\small-}+S_{\small+}=\frac{1}{\log{x}}\qquad\qquad\qquad\tag{3} $$    And find the convergence range of each sum.    In a , the OP start by introducing $\,{(2)}\,$ as a known identity, and gives a turly remarkable proof in the comment:  $$ \sum_{n=0}^m\log{(x^{2^n}+y^{2^n})} =\log{\prod_{n=0}^m(x^{2^n}+y^{2^n})} =\log{\frac{(x-y)}{x-y}\prod_{n=0}^m(x^{2^n}+y^{2^n})} =\log{\frac{x^{2^{m+1}}-y^{2^{m+1}}}{x-y}} $$  Then differentiate with respect to ${y}$, substitute ${y=1}$, and limit $\,{m\to\infty}\,$ give the result.     Could this approach work to proof $\,{(1)}\,$? notice for ${x=1}$:  $$ S_{\small-}=\sum_{n=1}^{\infty}\frac{1}{2^{n+1}}\,=\frac{1}{2} \qquad=\qquad \lim_{\small x\to1}\left[\frac{1}{\log{x}}-\frac{1}{x-1}\right]=\frac{1}{2} $$  New alternative methods are highly welcomed. Thanks.


When looking at my photos in the Google+ app, at the bottom is a footer that says "Backup failed" with a retry button. The backup still fails when I click Retry.  Is there a way to find out why Auto Backup is failing so I can correct the problem?


I am about to learn Emacs, have been through the tutorial and borrowed the O'Reilly book on Emacs. But the question still is - how do you learn good Emacs workflow? I guess, you don't use Emacs as you'd use, for example, .  This question seems revelant to mine:  -


Showing that $ \sum_{n=1}^{\infty} \arctan \left( \frac{2}{n^2} \right) =\frac{3\pi}{4}$

I would like to show that:  $$ \sum_{n=1}^{\infty} \arctan \left( \frac{2}{n^2} \right) =\frac{3\pi}{4}$$  We have:  $$ \sum_{n=1}^N \arctan \left( \frac{2}{n^2} \right) =\sum_{n=1}^N \arctan (n+1)-\arctan(n-1) =-\frac{\pi}{4}+\arctan N+\arctan(N+1)\rightarrow \frac{3\pi}{4}$$  Do you agree with my proof?


Is it possible to configure Windows 7 to use YYYY-MM-DD instead of DD/MM/YYYY as the date format? How? Where?


How to remove HTML tags from string - Objective C

How to remove HTML tags from string, So string is as follows:  myString = @"Lewis Hamilton's social media posts have long been a talking point in Formula One but the absence of any from the four times world champion so far this year is also attracting attention.";   After modification my string should be as follows:  newString = @"Lewis Hamilton's social media posts have long been a talking point in Formula One but the absence of any from the four times world champion so far this year is also attracting attention.";   What should I use to get above newString from myString?


Schengen Visa: Is presenting at an academic conference classified as business?

I intend to apply for a Schengen Visa to present at a railway conference. I will be presenting on behalf of my current employer.   I wish to know if this would be classified as business/work and would I need to submit a different application as compared to the standard Schengen application.   Thanks, Kamil


I'm using blackfin533, and I would like to write a software for flash memory testing. How would I test the flash memory ? I know how to test an eeprom but how would I test the flash memory of the blackfin533?


Cannot define my own listing environment

I am trying to define a wrapper for my own listings:  \newenvironment{mycode} { \begin{lstlisting}[language=C] } { \end{lstlisting} }   So I can use it:  \begin{mycode} void main(); \end{mycode}   When compiling, I get this:     *** (job aborted, no legal \end found)     The full code is here:  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage{listings}  \newenvironment{mycode} { \begin{lstlisting}[language=C] } { \end{lstlisting} }  \title{example} \author{andry.tino } \date{September 2019}  \begin{document} \maketitle \section{Introduction} Hello  \begin{mycode} void \end{mycode}  \end{document}


I've been set homework to create a calculator on python that uses currency rather than just normal numbers. This is what i have so far:   `#python calculator  import math  def add(x, y):     return x+y  def subtract(x, y):     return x-y  def multiply(x, y):     return x*y  def divide(x, y):     return x/y  print('select option') print('1.add') print('2.subtract') print('3.multiply') print('4.divide')  choice = input('enter choice (1/2/3/4): ')  if choice > '4':     print('invalid choice, try again')  num1=float(input('enter first number: ')) num2=float(input('enter second number: '))  if choice == '1':     print(num1, '+',num2, '=', add(num1,num2)) elif choice == '2':     print(num1, '-',num2, '=', subtract(num1,num2)) elif choice == '3':     print(num1, '*', num2, '=', multiply(num1,num2)) elif choice == '4':     print(num1, '/', num2, '=', divide(num1,num2))`   Can you help me to change the input into currency form and then my output too please?  P.S i'm quite new to python to please keep it as simple as possible