regarding Function parameters with double brackets

#include <stdio.h>  void reverse(int i); main() {     reverse(1); } void reverse(int i) {     if(i>5)        return     printf("%d",i);     return reverse((i,i++)); }   This function prints integer numbers 1,2,3,4,5 as output.  My doubt is that even though we specifically mention to the compiler that this function reverse accepts only 1 parameter, how does this work ? Whats the significance of double brackets(()) inside reverse function ?


Filtering a list and getting first N elements

I am noobie in python but I needed to plot some images from the dataset and I wanted to use list comprehension for this but didn't know how. So I used a while loop, but there also was a problem of accessing tuple containing labels with size (1080, ) and I got error message like this:      IndexError: index 1 is out of bounds for axis 0 with size 1   So after I reshaped the tuple, everything was ok. My code:   i, j = 0, 0 y = np.reshape(Y_train_orig, (1080)) while (j < 5):     if y[i] == 0 :          plt.imshow(X_train_orig[i])         plt.show()         j += 1     i += 1   So I'm wondering if it really was nesessary to reshape it and if I could avoid using loops and use list comprehension instead. Would it be more effective than my while loop?


What is the value of x in $2 = x + \sqrt{x + \sqrt{x + \dots}} $?

If $x + \sqrt{x + \sqrt{x + \cdots}} = 2$, what is the value of $x$?


Haar measure from axis-angle representation of $SO(3)$

My aim is to study some special representations of $SO(3)$ using characters, and to do this I need an explicit expression of the Haar measure on $SO(3)$. I've found some "versions" of the Haar measure on $SO(3)$, and the most common one seem to be the acquired by parameterizing $SO(3)$ using Euler angles (can be found ).   Since the characters of $SO(3)$ only depend on the angle from the axis-angle representation, it seems as if it would be suitable to find a Haar measure based on this parameterization. However, I don't really know where to start, and I've searched the web like a maniac.  Could someone provide some help?  Thanks in advance!


Transparent Image different in viewport than render

Bit of an issue here, trying to render this glass scene    Looks fine in the viewport, but when I hit render    Does anyone know the cause of different view port and final render, and how to fix it?  Here's my


ntwdblib.dll : How to configure it to connect over tcpip ? (SQL Server, legacy)

We have an old app that uses ntwdblib.dll to connect to sql server.  It works, but it appears to connect over named pipes.  Due to moving the sql server to a data center, we need to change this so it connects over tcpip.  Currently, we connect by connecting to:  < server name>\< instance name>  We tried putting just the server name, and < server name>,1433  and that did not work.  How do we specify/configure for this lib to use tcpip?


A sequence converges if every subsequence has a sub-subsequence which converges to the same elt.

Actually, I found the same questions in this website and saw the proof.   What I'm looking for is somewhat intuitive understanding.  I know that, {$x_n$} converges to {$x$} if and only if every subsequence {$x_{n_k}$} converges to {$x$}.  So, if {$x_n$} converges to {$x$}, it looks trivial that every subsequence has a sub-subsequence that converges to {$x$}. Actually all the sub-subsequence converges to the same point, I think.  However, the opposite way is not easy for me. How can the existence of a convergent sub-subsequence in each subsequence guarantees the convergence of sequence?  For me, it looks like that in each subsequence, the existence of one sub-subsequence which converges guarantees the convergence of all sub-subsequence.  What am I missing?


"Low quality answer" Flag was declined, however post was ultimately deleted

I flagged  post as "Low Quality Answer" since it was lacking content as well as it had formatting issues. You could have a look at the  to verify.  Looking at the revision history, it is evident that neither the owner deleted the post, nor did any moderator. The reviewers decided to delete the post.  My question is, don't you guys think the following message:     declined - a moderator reviewed your flag, but found no evidence to support it   is not appropriate in such cases? Since, it was the moderator who declined, however, the reviewers voted to delete the post. There could be a mechanism such that the declined flag should not be actually considered as declined finally. Because, the post was ultimately deleted as it was flagged. Although, a moderator though otherwise, however, there was a conflict between the action of the moderator and the reviewers.  I hope what I understood from the revision history and what I tried to explain in my question is correct.   Edit   I don't think this is a duplicate question. The question picked as duplicate addresses "how the flag was declined" and not "why". I mean, the answers to that questions just tells whatever happened, but it doesn't answer "why" the flag was declined.


yes, why does a negative times a negative make a positive?

for a while I have been interested in the details of the construction  of the integers from the natural numbers. credit to the software, for as soon as I began writing this, for it drew my attention to a very apposite discussion from  on MSE about a year ago. i hope to revisit that discussion, as i am still not familiar with some of the references there, but perhaps this exercise will help me to make progress with more abstract ideas. so my question is - is the following method a reasonable way of deriving the integers from the natural numbers, explaining, by the way, a very good reason why a negative times a negative comes out positive. you can actually calculate it, with the $\star$operation introduced here.  the additive monoid $\mathbb{N}$ is also furnished with a multiplicative structure on $\mathbb{N}^+ = \mathbb{N} \setminus\{0\}$ which it pulls back (via the natural bijection) from its own multiplicative monoid of injective endomorphisms.  $\mathbb{N} \times \mathbb{N}$ is an additive monoid with the obvious addition performed elementwise. we define  $$(a,b) \star (c,d) = (ac+bd, ad+bc) $$ the $\star$-multiplication is commutative, associative, distributive over addition, and has an identity element $(1,0)$.  $\mathbb{N} \times \mathbb{N}$ is the union of three sets $\mathbb{M}^+,\mathbb{M}^0$ and $\mathbb{M}^-$ which intersect only in $\{0\}$. each is a submonoid. an element $(a,b)$ is in $\mathbb{M}^+,\mathbb{M}^0$ or $\mathbb{M}^-$ as $a \gt b, a=b$ or $a<b$.  with respect to the $\star$-multiplication $\mathbb{M}^+$ and $\mathbb{M}^0$ are closed under this operation. $\mathbb{M}^0$, however has an ideal-like property -it is absorbing. if $m_0 \in \mathbb{M}^0$ then for any other $m \in \mathbb{N} \times \mathbb{N}$ we have $m_0m \in \mathbb{M}^0$. the remaining relations may be summarized by  $\mathbb{M}^+\star\mathbb{M}^- \subset \mathbb{M}^-$ and $\mathbb{M}^-\star\mathbb{M}^- \subset \mathbb{M}^+$.  now take two copies of $\mathbb{N}^+$, the second of which we shall call $\mathbb{N}^-$, and define $\mathbb{N}^0=\{0\}$. we define the set  $$\mathbb{Z} = \mathbb{N}^+ \cup \mathbb{N}^0 \cup \mathbb{N}^- $$ define  $$\psi: \mathbb{N} \times \mathbb{N} \rightarrow (\mathbb{N},0) \cup (0,\mathbb{N}) $$in terms of three auxiliary functions, $\chi^+$ and $\chi^-$ the indicator functions for $\mathbb{M}^+$ and $\mathbb{M}^-$, and $\tau: \mathbb{N} \times \mathbb{N} \rightarrow \mathbb{N}$ defined by $\tau(a,b)=max(a,b)-min(a,b)$. then we may write $$\psi(m)=(\chi^+(m)\tau(m),\chi^-(m)\tau(m)) $$ although $\psi$ is not quite a morphism, its kernel is $\mathbb{M}^0$, and restricted to either $\mathbb{M}^+$ or $\mathbb{M}^-$ is a morphism of monoids. moreover it preserves the multiplicative structure, subject to the sign permutation already mentioned. so it gives the usual multiplicative structure on $\mathbb{Z}$.


Want to use ANT landscape generator, where is it?

I just downloaded Blender and am going to use it to generate landscapes.  I saw references to ANT landscape generator, but have no idea how to activate it or download it.  One video supposedly showed how to activate it, I found it but there was no activate check box shown.  Do I have to download it?  One site said it was included with Blender.  If so, where is it located because for the life of me I cannot find it anywhere and am getting frustrated.  I just want an easy way to generate landscapes(mountains, etc).  I searched the Blender file location (ProgramFiles\Blender Foundation\Blender\2.78\scripts\addons) with no success.  Any help is appreciated.  Thanks, Jim Lawrence


Is there a way to see the what percentage you are in a particular tag?

I know I can go  to see my rank in a particular tag. But is there a way to see at what percent I am in?


We have the set $A=\{1,2,3,4,5\}$. what is the number of functions from $A$ to $A$? I think the domain of the function should contain all the elements of $A$ but range of the function may have any elements of $A$ or not having them. so for each of the numbers from $1$ to $5$ we have two possibilities $(1)$ existing in the range of function. $(2)$ not existing in the range. so the number of functions from $A$ to $A$ is $2^5=32$. is my justification right?


How to overload << properly from a mapped enum?

I'm using a state machine to learn C++ and I want to provide an overloaded operator << to return the respective string instead of an int. Apologies for the length ...  #ifndef STATEMACHINE_H #define STATEMACHINE_H  #include <map> #include <string>  namespace statemachine{     using namespace std;      enum State { ON, RESTING, SLEEPING, LOCKED, OFF };      struct StateMap : map<unsigned int, string>     {         StateMap()         {             this->operator[]( ON ) = "ON";             this->operator[]( RESTING ) = "RESTING";             this->operator[]( SLEEPING ) = "SLEEPING";             this->operator[]( LOCKED ) = "LOCKED";             this->operator[]( OFF ) = "OFF";         };          ~StateMap(){};     };  struct Machine {      Machine(State state) : statemap() {         m_currentstate = state;     }      //  trying to overload the operator -- :(     //  Error   1   error C2676: binary '<<' : 'std::ostream' does not define this operator or a      //  conversion to a type acceptable to the predefined operator **file** 38 1 statemachine_01     ostream& operator << (ostream& stream){         stream << statemap[m_currentstate];         return stream;     }      State state() const {         return m_currentstate;     }      void set_state(State state){         m_currentstate = state;     }  private:     State m_currentstate;     StateMap statemap; };  }  #endif   What am I doing incorrectly?


If $0$ is the zero-object $ \Longrightarrow F(0) $ is the zero object when $F$ additive

Let $$ F : \text{A-Mod} \to \text{A-mod} $$ be an additive functor. Then if $0$ is the zero-object $F(0) $ is the zero object. Why this is true ?  The definition of additive functor that I know is      $\forall \ \ M , N \in $ A-Mod $$F : \hom_{A-Mod}(M,N ) \to \hom_{A-Mod}(FM,FN ) $$ is a morphism of abelian groups.


I want to find all Sylow 2-subgroups of $D_6 = \{ e, r, r^2, r^3, r^4, r^5, s, sr, sr^2, sr^3, sr^4, sr^5\}$.  $r$ is the rotation element, and $s$ is the reflection element.  $|D_6| = 12$, and the order of a Sylow 2-subgroup of $D_6$ must be the highest order of $2$ that divides $12$ which is $4$.  Also, the order of each element of the Sylow 2-subgroup must be a power of $2$.  Using this information I was able to come up with only this Sylow 2-subgroup $\{ e, s, r^3, sr^3 \}$.  However, I do not know if there are more Sylow 2-subgroups of $D_6$.  Lastly, I figured out, by Sylow's Third Theorem, that the number of Sylow 2-subgroups of $D_6$ must divide the order of $D_6$, and also be congruent to 1 mod 2.  The first part of this statement suggests that there can only be either $1,2,3,4,6$, or $12$ Sylow 2-subgorups of $D_6$, but I am unsure of what congruent to 1 mod 2 means.  I know that 1 mod 2 $= 1$, but what does congruent mean?


Cannot run VM VirtualBox on Ubuntu 16.04

I am having issues trying to run Virtual Box; which are the "appropiate headers"??  WARNING: The character device /dev/vboxdrv does not exist.      Please install the virtualbox-dkms package and the appropriate      headers, most likely linux-headers-generic.       You will not be able to start VMs until this problem is fixed.   I have installed virtualbox-dkms package, but I have no idea about the headers.  Also when trying to run a VM     Kernel driver not installed (rc=-1908)      The VirtualBox Linux kernel driver (vboxdrv) is either not loaded or there is a permission problem with /dev/vboxdrv. Please install virtualbox-dkms package and load the kernel module by executing  'modprobe vboxdrv'       as root. If it is available in your distribution, you should install the DKMS package first. This package keeps track of Linux kernel changes and recompiles the vboxdrv kernel module if necessary.      where: suplibOsInit what: 3 VERR_VM_DRIVER_NOT_INSTALLED (-1908) - The support driver is not installed. On Linux, open returned ENOENT.    I cannot run modprobe vboxdrv (yes, I run it with sudo)  modprobe: ERROR: could not insert 'vboxdrv': Operation not permitted   I think this is a common question but cannot find answers for Ubuntu 16.04, just outdated ones.  UPDATE  linux-headers-generic is installed but it still doesn't work.


Removing Java completely from Ubuntu 14.04 LTS

When I run which java command in my Ubuntu, it tells /usr/bin/java.  I initially installed java using sudo apt-get install ... command. Using this command where does it install all java components?  In my system in /usr/lib/jvm i see the following listings:  java-1.5.0-gcj-4.8-amd64  java-1.7.0-openjdk-amd64  java-7-openjdk-amd64   I want to completely remove Java, I tried Googling, but the instructions used in didn't work. Can anyone help me do this?


Find the domain for which the function $f(z)=\int\limits_{-1}^{1}\frac{e^{tz}}{1+t^2}dt$ is defined and holomorphic?

We need to find out the domain for which the following function is defined and holomorphic:  $$f(z)=\int\limits_{-1}^{1}\frac{e^{tz}}{1+t^2}dt$$  How do we proceed to this kind of problem?  Any hints please?


Is there a colorspace atlas available in stock somewhere?

There are lots of pictures of an RGB colorspace atlas designed by Tauba Auerbach: . I wonder if there are such things in stock somewhere? I don't mean authors originals but probably there are some analogues? Maybe it's called something another than "colorspace atlas".


Help me please to choose proper path-finding algorithm

I am new to game development and just want to ask for advice. I need to know which path-finding algoritm will be suitable for my scenario:   Units - any shape. But in most cases rectangles of different sizes. I have random generated maze and destination point or area. Because of different maze borders not all unit can fit and move to the end.   How to find path from unit to destination area and check that shape can move to this area?


Is the ability to downvote questions necessary?

I'm wondering whether the ability to downvote questions in the currently implemented way is the best way to handle bad questions. I'm ignoring meta sites for this, as they're far more complicated and voting works differently there.  The benefit of downvoting answers is very obvious to me, if an answer is wrong or simply not a good answer, downvoting it pushes it to the bottom and lets better answers rise above it. For questions it is not as obvious to me, especially as it's far more nebulous what actually defines a bad answer. For questions there is also a parallel quality control mechanism in close votes. And downvoting questions doesn't let better questions rise to the top in the same way it works for answers, it doesn't do anything for question lists or specific tag views, only for the frontpage.  One important aspect of downvotes is that they feed certain automated mechanisms designed to reduce moderator burden and clean up the site, the automatic question bans/throttling and the automated deletion of questions after a certain time.   One drawback of the current way downvoting works is that it is often perceived as very hostile, probably to a largely irrational degree. Even as an experienced SE user I still get a bit frustrated when I receive downvotes that I don't consider justified. And this effect is certainly much worse for newer users. I don't want to open this specific discussion here, but the perceived hostility is a significant issue in my opinion because it likely reduces the number of new users starting to participate, and a steady stream of new active users is necessary to sustain an SE site.  In my subjective observation there is also plenty of spurious voting on posts that are not actually bad. There is no general agreement on several aspects that people consider to make a question a bad question. A single downvote doesn't mean anything, there is too much noise in downvotes to gain any information from it.  Another issue I have with the current downvote mechanism is that there's often an excessive amount of downvotes for really not that terrible questions. The amount of downvotes is driven by attention (just like upvotes), and it often feels like kicking a user again when they're already down when you drive their question far into the negative score.  To me, closing is the primary way of moderating questions. Downvoting questions feels like an inferior parallel moderation system to me. The advantage of closing is that it actually explains to the user what is wrong with their question and gives them a chance to fix it, even though few take it. Downvotes don't tell you what is wrong.  The negative reputation penalty of downvotes also doesn't serve any useful purpose in my opinion. It's too small to have a serious effect on people that ask crappy questions, and it's large enough to simply annoy people.   What would happen if we remove the ability to downvote questions entirely? The question ban and the automated deletion script would likely not work well anymore. I'm not sure the experience for answerers would substantially change. The frontpage would also show questions that would have been below -4 score previously, and the worst possible score would be 0 for any question, so you would not quickly distinguish questions with no feedback from questions with negative feedback (but still unclosed). The asker would receive less feedback that their question might be bad, but only in cases where people don't post that feedback as comments and also don't close the question.  If we assume that community moderation in terms of closing questions works well, I don't see many drawbacks in eliminating downvotes on questions. This is a rather big "if", but maybe more an argument for improving the close system than having a lesser, parallel moderation system in downvotes.  Do we actually need downvotes on questions, or are they a superfluous parallel moderation system alongside close votes?


What is the difference between a Clone Trooper and a Stormtrooper?

They wear different helmets and are the soldiers for different regimes, but are there other differences between clone troopers and Stormtroopers?  I'm referring to the Stormtroopers under the Empire rather than the First Order.


I am trying to insert a commutative diagram in my beamer with tikz-cd but this does not work. I think there is some conflict with other things in the beamer but I can't figure out what is happening. Even this very simple code does not compile. Here is a non minimal example: I show every package I use for you to see if there is something wrong. \documentclass[usenames,dvipsnames]{beamer} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage[italian]{babel} \usepackage{amsmath, mathabx, amssymb} \usepackage{caption, subfig} \usepackage{pifont, tikz, tikz-cd} \usetikzlibrary{matrix} \usetikzlibrary{shapes.geometric, calc} \usetikzlibrary{arrows}  \definecolor{my}{RGB}{0,51,38} \usetheme{boadilla} \usecolortheme[named=my]{structure} \useoutertheme{split} \usefonttheme{professionalfonts} \begin{document} \begin{frame}\[ \begin{tikzcd} A\arrow[r] & B\end{tikzcd}\] \end{frame} \end{document}  The returned error is the following: ! Undefined control sequence.  \pgf@matrix@last@nextcell@options l.434 \end{frame} Can someone help me?


A question about a primitive root mod $p=2^{2^k}+1$, where $p$ is prime.

Let $p=2^{2^k}+1$ be a prime where $k\ge1$. Prove that the set of quadratic non-residues mod $p$ is the same as the set of primitive roots mod $p$. Use this to show that $7$ is a primitive root mod $p$.  I've already shown the theorem to be true. The second part asks to use the first part to show the result which leads me to think that I have to show $7$ is a quadratic non-residue mod $p$ then use the first part to imply that it must be a primitive root.   To show $7$ to be a quadratic non-residue for $k\ge1$ is to show that the Legendre symbol $\left(\frac{7}{p}\right) = -1$. Now, $$\left(\frac{7}{p}\right)=\left(\frac{p}{7}\right)(-1)^{\left(\frac{7-1}{2}\right)\left(\frac{p-1}{2}\right)} = \left(\frac{p}{7}\right)(-1)^{3(2^{(2^k)-1})} = \left(\frac{p}{7}\right)$$ since $2^{2^k-1}$ is even (as $k\ge1$).  Then it suffices to know $p$ mod $7$ to determine the Legendre symbol. Since $\left(\frac{p}{7}\right) = -1$ when $p\equiv 3,5,6$ mod $7$, I suspect I somehow have to show that $p$ must be congruent to those values but I don't know how to do that. Although, trivially, $p\not\equiv 1$ mod $7$ otherwise, $7|2^{2^k}$ which is not possible.  Unfortunately, I don't know where to go from here.  Any guidance would be appreciated. However, assuming I’ve taken the right approach, I would prefer a constructive hint to a full blown solution, as I think I may be able to work it out on my own, given a nudge in the right direction.  Thank you for taking the time.


Are all congruence relations on $(\mathbb{Z},+)$ of the form mod n for some integer n?

Congruence mod n is a congruence relation for integer addition. Is the converse true? That is, is every congruence relation for integer addition of the form mod n for some integer n?


compilation error: cast from pointer to integer of different size

I'm using following code:    #define OFFSETOF(_s, _m) ((uint32_t)(uint32_t *)(&(((_s *)0)->_m)))  typedef struct test {     uint16_t param0;     uint8_t param1; } test;  uint32_t uStartAddr = OFFSETOF(test, param1);   But I get that error:    error: cast from pointer to integer of different size


How can I use dd to make a Windows 7 USB installer in Ubuntu?

Why didn't dd make a bootable Windows USB stick?  Has anyone tried to burn a Windows 7 USB installer in Ubuntu?  Usually I run dd to burn linux ISOs, and I thought it would work for Windows 7, but the stick I burned with dd doesn't boot up on my Thinkpad T42.  The dd command ran successfully, so why didn't it work? Do you think the boot information wasn't recorded into the USB stick correctly?  dd if=SW_DVD5_Win_Pro_7w_SP1_32BIT_ChnSimp_-2_MLF_X17-59520.ISO of=/dev/sdb bs=1M


How to fill columns automatically when a new row is added

Been trying this for a few hours, trying to fill down column F G H automatically when a new row is added (my data is on another sheet that's coming in from forms)    Any tips or hints how to get it to fill?


Let H be a subgroup of S4 where $H = \{e, B , C ,D \}$  $B(1)=2,B(2)=1,B(3)=4,B(4)=3$  $C(1)=3,C(2)=4,C(3)=1,C(4)=2$  $D(1)=4,D(2)=3,D(3)=2,D(4)=1$  Prove that H is a normal subgroup.  I've tried using the definition that $H$ is normal $\iff gH=Hg$, $\forall g$  As I can't take all the 24 elements of S4 and check it,I've tried with a general form: $g(1)=a,g(2)=b,g(3)=c,g(4)=d$. I managed to find $gH$,but $Hg$ isn't as easy.  What I've also noticed is that $BC=D,CD=B,DB=C, B=B^{-1} , C=C^{-1} , D=D^{-1}$ and $B^{2}=C^{2}=D^{2}=e$.   Can you give me a hand, please?


I decided to ask about this issue, because I found this problem is a common problem for many Drupal designers.   It seems to be a common problem for many drupal designers to face with the Server Error 500 after moving their site to the production server.  There are mainly two lines in the default .htaccess, which are:  # Don't show directory listings for URLs which map to a directory.  Options -Indexes  # Follow symbolic links in this directory.  Options +FollowSymLinks   So, for some hosts these lines should be removed.  What is your solution, after removing these lines from the .htaccess file? How should the directory listing be prevented?


Time coordinate inside black hole horizon

I am new to physics and was trying to learn more especially about general relativity. The Schwarzschild metric, changes the sign of the time and radial parts of the metric once we cross the event horizon. Someone on stack exchange had noted that as a result inside the horizon the decrease in radius is the direction of increasing time.  My question is if radius (i.e space) becomes timelike due to change in metric sign, then does time also become spacelike. I mean can then inside the horizon one move freely in time?  NOTE: As far as my understanding of the linked question goes, that question is about cosmology of interiro of ablack hole (it asks about a spacetime originating form blackhole horizon). My question i think is different, its really more on the lines of time-travel.Since the signature of the time corrdinate is spacelike, it should behave like space and we should be able to move in it in the backward direction as we can in space. Some say that it is a coordinate artifact, but I think the other coordinates dont tend to have the physical interpretation of time.(I may have understood it incorrectly)


Are there any free web hosts that allow adult content?

I'm looking for a free web hosting (PHP) provider, that permits adult content.  And by adult content, I don't mean videos. At most, photos. And I can keep it non-nude. I just want to display information about pr0n-stars.   If I keep it non-nude, but still contain information about pr0n-stars, do you think 000webhost will allow this?  Any advice would be appreciated. Thanks !


Programatically render a block in a twig template

I need to render a views block in my page.html.twig template. In D7 I would do this:  <?php   $block = module_invoke('module_name', 'block_view', 'block_delta');   print render($block['content']); ?>   In Drupal 8 module_invoke is deprecated and recommended to use this: (I've added the block's name as the second parameter)  Drupal::moduleHandler()->invoke($block, 'views_block__blog_block_1', $args = array());   I tried a few things. First tried to do it in a twig template but I don't know how to call php functions in a twig template, so that didn't turn out too well.  Then I called the function in the preprocess_page() function in the .theme file but before I could get it to work I tried something simpler just to try make a variable work inside the twig template which didn't work either, for example:  In the template_preprocess_page(&$vars) function in the .theme file:  $test = 'Hello World'; $vars['$my_var'] = $test;   I tried to call my_var inside the twig template but it didn't work and I got an error message saying "The site has an error, please contact the administrator"  So, to summarize, here are my questions:   How do I make variables available inside twig templates? How do I call functions inside twig templates? Do I render blocks inside the .theme file or twig template?


I'm trying to gain a more intuitive understand of the concept of an . When physicists speak of an infinitesimal quantity, if that basically the same as the first order term in a Taylor series expansion of a function they're analyzing?


Remove duplicate array value from array in javascript

I want to remove duplicate entry from my array and my array is           ArrayTotal All Banks,Total All Banks,Total Domestic Banks,Total Domestic Banks,B2B Bank,B2B Bank,Bank of Montreal,Bank of Montreal,The Bank of Nova Scotia,The Bank of Nova Scotia,   we want to remove duplicate entry for this I am trying in php unique_array and I also tried in javascript         var uniqueNames = [];       $.each(names, function(i, el){       if($.inArray(el, uniqueNames) === -1) uniqueNames.push(el);       });       console.log(uniqueNames) its gave error Unexpected token A


C Compile Errors - Learn C the Hard Way (Ex 32)

I am having a terrible time getting the code in  of Learning C the Hard Way to compile.  I have copied verbatim the code from the creator's  and even cloned on a fresh repository. I've looked through other repositories, tried on my MacOSX in addition to Ubuntu, etc. Nothing that I seem to do will compile.  I am using Ubuntu 12.04 (see below).  Here is my file structure (note -- this is the file structure when I only included the files directly from Exercise 32. Obviously, when I clone the git repository I get way more files. I used diff to make sure all my files, including my make file, in my pared down version exactly resemble the git repository):  $ pwd /usr/local/me/code/C/liblcthw   $ ls bin  LICENSE  Makefile  README.md  src  tests  $ ls tests/ list_tests.c  minunit.h  runtests.sh  $ ls src/lcthw/ dbg.h  list.c  list.h   Here is my make command.  $ make cc -g -O2 -Wall -Wextra -Isrc -rdynamic -DNDEBUG  -fPIC   -c -o src/lcthw/list.o src/lcthw/list.c ar rcs build/liblcthw.a src/lcthw/list.o ranlib build/liblcthw.a cc -g -O2 -Wall -Wextra -Isrc -rdynamic -DNDEBUG  build/liblcthw.a    tests/list_tests.c   -o tests/list_tests tests/list_tests.c: In function ‘main’: tests/list_tests.c:111:1: warning: parameter ‘argc’ set but not used [-Wunused-but-set-parameter] /tmp/ccXlNfMl.o: In function `test_create': /usr/local/me/code/C/liblcthw/tests/list_tests.c:13: undefined reference to `List_create' /tmp/ccXlNfMl.o: In function `test_destroy': /usr/local/me/code/C/liblcthw/tests/list_tests.c:22: undefined reference to `List_clear_destroy' /tmp/ccXlNfMl.o: In function `test_push_pop': /usr/local/me/code/C/liblcthw/tests/list_tests.c:31: undefined reference to `List_push' /usr/local/me/code/C/liblcthw/tests/list_tests.c:34: undefined reference to `List_push' /usr/local/me/code/C/liblcthw/tests/list_tests.c:37: undefined reference to `List_push' /usr/local/me/code/C/liblcthw/tests/list_tests.c:41: undefined reference to `List_pop' /usr/local/me/code/C/liblcthw/tests/list_tests.c:44: undefined reference to `List_pop' /usr/local/me/code/C/liblcthw/tests/list_tests.c:47: undefined reference to `List_pop' /tmp/ccXlNfMl.o: In function `test_shift': /usr/local/me/code/C/liblcthw/tests/list_tests.c:56: undefined reference to `List_shift' /usr/local/me/code/C/liblcthw/tests/list_tests.c:59: undefined reference to `List_shift' /usr/local/me/code/C/liblcthw/tests/list_tests.c:62: undefined reference to `List_shift' /tmp/ccXlNfMl.o: In function `test_remove': /usr/local/me/code/C/liblcthw/tests/list_tests.c:74: undefined reference to `List_remove' /tmp/ccXlNfMl.o: In function `test_unshift': /usr/local/me/code/C/liblcthw/tests/list_tests.c:86: undefined reference to `List_unshift' /usr/local/me/code/C/liblcthw/tests/list_tests.c:89: undefined reference to `List_unshift' collect2: ld returned 1 exit status make: *** [tests/list_tests] Error 1   I am using Ubuntu 12.04  $ lsb_release -a LSB Version:    core-2.0-amd64:core-2.0-noarch:core-3.0-amd64:core-3.0-noarch:core-3.1-amd64:core-3.1-noarch:core-3.2-amd64:core-3.2-noarch:core-4.0-amd64:core-4.0-noarch:cxx-3.0-amd64:cxx-3.0-noarch:cxx-3.1-amd64:cxx-3.1-noarch:cxx-3.2-amd64:cxx-3.2-noarch:cxx-4.0-amd64:cxx-4.0-noarch:desktop-3.1-amd64:desktop-3.1-noarch:desktop-3.2-amd64:desktop-3.2-noarch:desktop-4.0-amd64:desktop-4.0-noarch:graphics-2.0-amd64:graphics-2.0-noarch:graphics-3.0-amd64:graphics-3.0-noarch:graphics-3.1-amd64:graphics-3.1-noarch:graphics-3.2-amd64:graphics-3.2-noarch:graphics-4.0-amd64:graphics-4.0-noarch:printing-3.2-amd64:printing-3.2-noarch:printing-4.0-amd64:printing-4.0-noarch:qt4-3.1-amd64:qt4-3.1-noarch Distributor ID: Ubuntu Description:    Ubuntu 12.04.2 LTS Release:        12.04 Codename:       precise


Are there pre-paid SIM cards in Canada with big data offerings?

What is the best offer for a pre-paid SIM card with big data? I don't need to make a voice calls or send SMS. I'll need it for two weeks only.  I'm going to Toronto and then I want to visit PEI (via Quebec, Montreal).


How do I get object names to appear in the render?

In my scene I have multiple objects (30+). In the viewport I have the handy control of selecting (in the Properties Editor) Object> Display> Name and copying to selected.  This is beautiful for diagrams etc. as wherever my view is at whatever distance these labels have been placed instantly, always face me and are always the same size.  How can you get these to display in a rendered view?  Is the ONLY option to manually create a label for each object, get them to track to your camera (Probably have to track to an empty miles behind your camera rotation otherwise they offset if your camera isn't facing exactly front on to an object) and add some sort of scaling property to change depending on how far away you are?


Why is only Euclidean distance allowed to be used for Ward's method?

Using scipy, I noticed that I am allowed to use only Euclidean distance for Ward's method.  Is it because Ward's uses Error Sum of Squared?  What if I use Ward's method with cosine similarity?  Cosine similarity seems still work so, but maybe not perfectly.  What might be the difference?


Shell replace forward slashes with backslashes

I have a question: how to replace forward slashes with backslashes?  I have string:  App/Models   And I need  App\Models   Thank you very much


Site to ask any question that will be moved to appropriate network site by reviewers

The Problem - The Stack Exchange network has so many sites with more being added all the time, a user probably doesn't know that a Stack Exchange site exists to answer a question they might have. In addition, when asking a question, the user might not know the best place to put the question. Asking the question on the wrong site could be downvoted, and it might not be in the user's best interest to ask the question if he/she doesn't know exactly where it belongs.  The Idea - A Stack Exchange site where you can ask any question, and it's up to reviewers of the question to decide which site would be best suited to answer the question.   I don't know much about the process for migrating questions to other sites as they stand today, but I think a voting system would be good, to allow reviewers to vote where the question belongs best, or someone with enough rep is allowed to move it directly.   The conditions that determine when a question is migrated could vary. Some ideas:   After a certain period of inactivity When the vote gap between the #1 and #2 result is large enough   The voting system should also have some way to denote that this question doesn't (yet) have a Stack Exchange site suited to answer the question.   When asking the question, the page could provide a list of similar questions as it does now, and "suggested site" box. This way, if they're writing the question they could see some suggestions as to where the question might belong. They could then select one of those sites and have it submitted on that site. The primary data source for this would probably be the tags. For instance, if the user enters tags that have a lot of followers on StackOverflow, the page would suggest that the question might belong on StackOverflow.  This feature would allow users to ask questions without being as concerned about where it belongs among the vast Stack Exchange network. In addition, this could be a valuable resource in determining what Stack Exchange sites people would like to see. If there are a lot of questions that are filed as "Site Doesn't Yet Exist To Answer This Question™", that would be an indicator that there is a need that Stack Exchange isn't currently fulfilling.  Please comment with any suggestions or criticisms.   PS: I hope that this is the correct place to post this suggestion.  Edit  Maybe a dumbed-down version of this might be useful. Instead of having the review process, just have a page for a user to enter their question, get suggestions to where it might belong, and choose at the end where the question belongs. Right now, choosing where to ask the question is the first step. I think moving it to a later point in the conception of the question would allow the asker to better categorize the question.


Zero-inflated Poisson regression Vuong test: Raw, AIC- or BIC-corrected results

I'm analyzing count data for a set of ten species and found that for the five species with highest detection rate, the zero-inflated poisson (ZIP) regression fits the data significantly better than the regular poisson regression using glm in R. I found this using the vuong test to compare the two models, using the following code (ZP = zone/phase combination, as the data is separated into before/after phases, control/impact zones)  summary(m2 <- zeroinfl(Squirrel ~ ZP|ZP, data = bact)) summary(p2 <- glm(Squirrel ~ ZP, family = poisson, data = bact)) vuong(p2, m2)      However, for the next five species, the vuong test shows somewhat contradicting results for the fit of the ZIP regression and glm poisson regression. I'm wondering what the difference is between the raw, AIC-corrected BIC-corrected p-values is, and which I should be most concerned about (i.e. which p-value I should pay attention to). For example, the vuong results for sixth most common species is shown below:   Vuong Non-Nested Hypothesis Test-Statistic:  (test-statistic is asymptotically distributed N(0,1) under the null that the models are indistinguishible) -------------------------------------------------------------               Vuong z-statistic             H_A    p-value Raw                  -0.3378267 model2 > model1    0.36775 AIC-corrected         4.5566296 model1 > model2  2.599e-06 BIC-corrected        19.4932729 model1 > model2 < 2.22e-16   If I use the Raw results, I'd conclude that the ZIP model is not better than the glm poisson model. However, using the AIC- or BIC-corrected results, I'd conclude that the ZIP model is better than the glm poisson model.   What is the difference between these three values, and how should I decide which to use as the result? Thanks!


SSH session gave a false negative when adding user to wheel

Specifications  RHEL version: Red Hat Enterprise Linux release 8.2 (Ootpa) Kernel version: 4.18.0-193.14.3.el8_2.x86_64  The issue I was facing Yesterday I started a SSH session to a RHEL8 machine, added a user (including myself to test first) to the wheel group with the usermod -a -G wheel <username> command. This command, as expected, ran successfully. However when I wanted to test my new privileges with e.g sudo whoami, it failed and gave me the following error:  user is not in the sudoers file.  This incident will be reported.  This was obviously not true, because I did groups and verified that I, and the user was in fact added to the wheel group. There were no restrictions nor any modifications made to the sudo rights or the wheel in the sudoers file. What I tried I was overly confused of what the cause of this was, but later found out that a new login session with the command su -l <username> solved the issue without any additional commands or changes made. Therefore, concluded with that it's giving a false negative. What I don't understand is that the only difference from a real SSH login session and a similar login environment provided by su -l <username> is this according to the .  clears all the environment variables except TERM and variables specified by --whitelist-environment  initializes the environment variables HOME, SHELL, USER, LOGNAME, and PATH  changes to the target user's home directory  sets argv[0] of the shell to '-' in order to make the shell a login shell   Which leads me to believe that there must be something wrong with my session? Which I later got my colleague to test on another machine. The result of that was negative. It shouldn't be. My question and curiosities What I am wondering is how could this happen? This didn't just happen to me, it happened to my colleague as well from a different machine with a SSH session to the same RHEL8 machine. At a glance, I can only assume that there was an outdated session I was accessing, even though these sessions was just started. And as far as I've tested, the only solution was to kill the session in any way or open a new login session. What could be the exact cause of this? Because I am genuinely curious and is happy to provide with more information.


The Team Thanks The Following Sponsors or The Team Thank The Following Sponsors

As we are printing the words behind our t-shirt, my friend insisted that the correct word is thanks instead of thank. Please advise


I was just thinking about how electric field and magnetic field vectors oscillate in a Photon. but then I remember that a photon doesn't experience any time so how can these vectors oscillate if the time experienced by the photon is zero. According to Lorentz transformation formula, particles which are moving at the speed of light (in our case Photon) will experience infinite time dilation which basically means that time experienced by them is zero so if that happens to be the case then why the electric and magnetic vectors oscillate. If time experienced by the photon is zero then they should be anything happen at all but still the oscillations are happening?


Deleted most of the packages using apt-get purge package\*; How can I get them back?

I accidentally lost some of the system files by executing the following command in the terminal:   sudo apt-get purge wine\*   Most of the installed software (terminal, software center, libreoffice etc.) are now lost.  Does anybody have a solution for this issue?


Postfix/Dovecot Mail server with multiple domains and SSL

On my mail setup I'm currently using self signed certificate generated for server hostname.   And I'm curious is there some kind of SSL certificate that shared hosting providers use for multiple domains mail and how are they setting them up?


Google Drive occasionally pops up this error, randomly with no obvious cause:     --------------------------- Windows Script Host ---------------------------   There is no script engine for file extension ".vbs".   --------------------------- OK    ---------------------------   Is something misconfigured on my computer?


Numer of permutations that are product of exactly two disjoint cycles

Let $a_n$ denote the number of those permutations $\sigma$ on $\{1,2,3....,n\}$ such that $\sigma$ is a product of exactly two disjoint cycles. Then    $a_5 = 50$ $a_4 = 14$ $a_5 = 40$ $a_4  = 11$   I tried specifically for $a_5$  and $a_4$ with a little bit of calculations. But I want to know about a formula for $a_n$ with less calculations


Which is correct?  I am king of the world. I am the king of the world.  Additionally, which would be the better choice, if I wanted to use the expression "king" to signify dominance in a metaphorical way or in slang.  I am king of the backstreet. I am the king of the backstreet.  And is there a difference, if we are not king of a place but of a group of people?  I am king of (the) thieves. I am the king of (the) thieves.  Is there a general grammatical rule for that?


Is it possible to style the tooltip for the alt attribute?  I wish to style the background, font color etc for the html alt attribute.  Can anyone help me with this please?


iPhone Apps section not showing up in iTunes

I'm using the latest iTunes 12.7 and iPhone software (iOS 10.3.3). Any suggestions?


Real example of the differences between IQueryable and IEnumerable?

I know that IQueryable has the advantage of running filters on server rather loading all records in memory like IEnumerable, but how does exactly this look like in code, for example, if I have this code:  var data = context.Books.Where(x => x.Id > 930);   if I have 1000 records then it will only load 70 records, and to iterate over them, I convert data to List:  var list = data.ToList(); //has only 70 records   but what are the cases that IEnumerable load all records if it has to pass through IQueryable first i.e. to get the IEnumerable version of the example above:  var eData = context.Books.Where(x => x.Id > 930).ToList();   Aren't they the same? the last code is no more than combining the above two lines of code?


Why and how is the speed of light in vacuum constant, i.e., independent of reference frame?

I was told that the Galilean relative velocity rule does not apply to the speed of light. No matter how fast two objects are moving, the speed of light will remain same for both of them.   How and why is this possible?   Also, why can't anything travel faster than light?


Let us say I am supposed to solve the convex optimality problem in the following form. $$\min f(x)\\ \quad\quad\quad  g_{j}(x)\le 0,\forall j\in J\\ \quad\quad\quad h_{k}(x)=0,\forall k \in K. $$ I will solve it using lagrange function and I will obtain some KKT points. $1.$ If I get only one KKT point I can say that it is a global minimum because for a convex problem KKT conditions are not only necessary but also sufficient conditions not only for a local optimality but also for a global optimality. $2.$ If I get two or more KKT points I can say that all of them are global minimum, because the points are different, but they have the same optimal value. $3.$ What about if I get no KKT point? I guess I cannot say that the problem has no solution but I have to use some constraint qualification. However which one should I use? And if the constraint qualification is satisfied, what it means? How to find solution using the constraint qualification?


Available US State or National business (or employer) database lists?

This question dovetails with this post on .  I am familiar with some of larger, paid-for business registry's like  and .  While the detailed information their business listings database include (like # of employees, annual sales, industry code, etc) is fantastic, if you are on a limited budget, sometimes the cost of purchasing the data outweighs the value you can get from it.  If you have geocoding capabilities in house, one could potentially create a reasonable surrogate by spatially-enabling (geocoding) a publicly available business listing on your own.    If you were looking to take on this type of project, where would you start your research? Do you know of US agencies at a State or National level that maintain this type of information, AND are publicly available for download or minimal purchase?


Is it acceptable to ask for upvote/accept in an answer when submitting it?

I searched duplicates, and my impression was that requests may be acceptable, or at least tolerated, after questioner has indicated the answer solved his problem, and with the request for points via a comment.  For example, this discussion:   However, my question is slightly different.  Is it OK to include the request for points within the initial answer?  "Don't forget to tip your waiter by clicking on the checkmark next to my answer if this is useful. :o)"    In that example, the request wasn't demanding.  It was humorous.  Does that make a difference?  But since the request doesn't contribute to the usefulness of the answer, does it belong in the answer at all?  If it's not acceptable as part of the answer, would it be OK as a comment instead, and when submitted immediately after the answer?


get class element when using click function

I have a javascript function   <script>     $(document).ready(function(){         $('.paper_img').click(function(){              console.log("hello")              return false;         });     }); </script>   how can I access the element which triggered this function? thanks carl


Add Command to Menu Entry in 13.10 to convert images to JPG

It is possible to add a Menu Entry that when I click a picture it says "convert to JPG" and executes this command?  convert -format jpg {The right click file}  Because normally when I want to attach screenshots they are very heavy cause they are stored in PNG.  It will be very helpful.  Thanks!


I have an accepted conference paper with a major error in it, should I ask for it to be changed?

I have submitted a paper to a conference with a scientific error in it.  Essentially I have a concept and I have claimed it works in two conditions. Actually it only works in one of them. Technically, my experimental results are correct, but its only a small test and when extrapolated to full scale the error can be found and also actually predicted theoretically. The overall concept is still correct however for the other condition and I am still working on it in future research.  Should I ask for the paper to be changed? The conference isn't until 25th August but the submission deadline has passed.  I don't want a public document where people will repeat my experiments and find that some of what I have claimed is incorrect.


Disable autostart on boot and restrict background execution

Is there any way to disable autostart apps at boot time? I need to disable some of them (not all) like Facebook, etc to get quicker boot time. I'm asking how to do this on Android 9.0.


How does the ability to cast healing spells affect a monster's CR?

I've been making a few homebrew monsters for my current D&D 5e campaign, and I ran into a problem when I wanted to create a creature that used healing magic. There were general rules for offensive spells in the DMG, but none for healing or utility. I've looked around at several RPG forums and discussion boards, but all that I found just talked about offensive spellcasters or the monster didn't really act like a healer. The latter instance was actually on this forum () where the monster was a cleric, but that cleric didn't do any healing in the first three rounds of combat. All they did was cast buff spells, so that doesn't answer my question. I'm hoping someone can shed some light on this issue for me. Here's a stat block for the creature I'm wanting to make:  Medislime Medium ooze, chaotic neutral Armor Class: 15 (natural armor) Hit Points: 120 (16d8 + 48) Speed: 30 ft. STR 11 (+0) DEX 13 (+1) CON 16 (+3) INT 12 (+1) WIS 17 (+3) CHA 9 (-1) Skills: Medicine +5 Damage Resistances: Acid Senses: passive Perception 13 Languages: Common Challenge: 3 (700 XP) Traits Innate Spellcasting. The slime's innate spellcasting ability is Wisdom. The slime can innately cast the following spells, requiring no components: 4/day each: cure wounds, healing word 1/day each: aid, lesser restoration, mass healing word Actions Whap. Melee Weapon Attack: +3 to hit, reach 5 ft., one target. Hit: 3 (1d6) bludgeoning damage and 2 (1d4) acid damage.   My main question breaks down into two parts:  If the monster primarily uses their action to heal, how should I calculate their damage-per-round? I would assume that I would just use the most healing & damage possible across the first three rounds of combat, but I'm not sure if healing is treated different from damage when calculating damage-per-round.  How should I handle calculating the average amount of healing for the spell mass healing word for the CR calculations? Since it can target multiple creatures, I would assume I have to multiply the average value rolled, which is 5.5 (1d4 + Wisdom), by some number to account for multiple creatures being healed at once. Do I treat it like the spell fireball or a dragon's Breath Weapon and just multiply it by two, or should I multiply it by the max number of creatures that can be healed by this spell divided by two, which would be three?   I realize that sometimes it just has to come down to play-testing, but I feel like this is something that could more-or-less be calculated without any guesswork.


The below photo belongs to a PSU. I wonder what was the reason of placing air gaps on the 8 mm isolation. Is it to improve the isolation or provide a thermal relief (although there is no component below the red circled air gap)?


Configure Firefox to use non-default Java installation

I am using a 64-bit Java 7 installation on Windows 7 64-bit.  As per , I was having trouble enabling Java applets to run inside Firefox just to find out that the 32-bit Firefox does not like 64-bit java.  I would like to keep my 64-bit java as my default installation, as I need it for my development work and my IDE did not like 32-bit, and have a separate 32-bit installation just for Firefox.    How can I change which Java installation Firefox is using so that it does not automatically pick up the one from the path?


Dual Boot (Windows partition deleted) , but Still Appearing

In my MacBook Air "El Capitan", the Windows 10 was installed using Boot Camp, but the Windows 10 installation was corrupted (crashing).  Then I removed (adding space to MAC installation) the Windows 10 partition using Disk Utility.  Now when I turn On my MAC still message windows is appearing (showing MAC and Windows start options), and the default OS was Windows (appearing blue screen...).  I want to remove Windows 10 option, but I don't know how to do it.       sh-3.2# diskutil list  /dev/disk0 (internal, physical):     #:                       TYPE NAME                    SIZE       IDENTIFIER     0:      GUID_partition_scheme                        *121.3 GB   disk0     1:                        EFI EFI                     209.7 MB   disk0s1     2:          Apple_CoreStorage Macintosh HD            120.5 GB   disk0s2     3:                 Apple_Boot Recovery HD             650.0 MB   disk0s3  /dev/disk1 (internal, virtual):     #:                       TYPE NAME                    SIZE       IDENTIFIER     0:                  Apple_HFS Macintosh HD           +120.1 GB   disk1                                   Logical Volume on disk0s2                                   22ACF9AD-58C6-401F-87D6-41696160E1FD                                   Unencrypted  sh-3.2#  gpt -r show /dev/disk0        start       size  index  contents            0          1         PMBR            1          1         Pri GPT header            2         32         Pri GPT table           34          6                    40     409600      1  GPT part - C12A7328-F81F-11D2-BA4B-00A0C93EC93B       409640  235298960      2  GPT part - 53746F72-6167-11AA-AA11-00306543ECAC    235708600    1269536      3  GPT part - 426F6F74-0000-11AA-AA11-00306543ECAC    236978136          7             236978143         32         Sec GPT table    236978175          1         Sec GPT header  sh-3.2#


Is an 18-55 mm kit lens enough for a beginner?

I just bought a Canon EOS 200d or sl2 with single kit STM lens (18-55mm) . Is it enough for a beginner? Or should I also a buy 55-250mm lens now?  If yes, then shall I buy IS ii  lens or STM? I want to buy at cheap price.


Allowed error in baud rate between pic and Bluetooth module

I'm trying to connect a dsPIC33FJ128MC804 - 16 bit pic - with a Bluetooth module  the problem is i have few baud rates of Bluetooth to choose between them , searched the net but could not find the allowed baud rate error due to baud rate generator register takes only integer values as you know , so what is the maximum allowed error ?  Edit: i read the related section of data sheet and family reference to UART but i do not think i found any information regarding this point.


Should I use class or struct for wrapping up methods?

I want to be able to print out three types of messages to the console: warnings, errors and success. For that each time I'd have to change the ForegroundColor of the console to either yellow, red or green, print out the message and change the color back. To make this faster I've decided to create a class (let's say Printer), which has three methods: Warning(message), Error(message), Success(message). Now my question is: should Printer be a struct or a class? I dont't plan to have any more fields/methods in this class.


Combinatorial proof by demonstrating bijection

I need to prove that $n^2 = {n \choose 2} + {n+1 \choose2}$. I have already proved this using algebra, but I am required to use both algebra and a formal combinatorial proof which demonstrates a bijection between the right and left hand sides.   If someone could show me how to get started with this proof and the general steps to take and why, I would greatly appreciate it.


Dividing polygons into equal sub-regions based on population using QGIS?

I'm using demographic data in California by census tract, and I'd like to be able to group those census tracts into 4 regions with an equal population in each region. Any recommendations for how to do this in QGIS?   I'd like to be able to do something like the process FelixIP takes in the answer to this question but I don't completely understand all of the steps:    Any clarification to that answer as well?


Take a loot at the bottom in my for loop. It's probably a simple logical error but for some reason 'if' condition is never met. Sorry for asking basic stuff but I've searched and searched and can't seem to find the answer. Thanks for helping a noob.   Scanner scan = new Scanner(System.in);      System.out.println("How large would you like the array to be? (number)");     int arraySize = scan.nextInt();     scan.nextLine();     String [] myArray = new String [arraySize];     int i = 0;      if (arraySize <= 0 ) {         System.out.println("Please enter a positive integer for the array size. Rerun program when ready.");     } else {         while (i < myArray.length) {             System.out.println("Please type a string to be entered in the array");             myArray[i] = scan.nextLine();             i++;         }     System.out.println("Array contents: " + Arrays.toString(myArray));     }     System.out.println("What element would you like would you like to find in the array by performing a linear search?");     String search = scan.nextLine();      for (int j = 0; j < myArray.length; j++) {         if (myArray[j] == search){             int location = j + 1;             System.out.println("The element, " + search + " was found in the array, in which the linear search looped " + location + " times to find it." );             j = myArray.length;         }     }


So I was making a class the other day and used Eclipse's method to create the equals method when I realized that it generated the following working code:  class Test {   private int privateInt;   [...]   public boolean equals(Object obj) {     [...]     Test t = (Test) obj;     if ( t.privateInt == privateInt ) {     [...]   } }   t.privateInt..???? It's suppose to be private! So I guess there is one more field visibility other than private, protected, package protected and public.  So what is happening here? How is this called? Where would somebody use this? Doesn't this break encapsulation? What if the class didn't have a mutator and I changed this? Does this happen to C++ as well? Is this an OO idiom? If not, then why did Java do it?  Generally, where can I find information about this?  Thank you.


Disable popups on cancelled Sprint service on LG G2

I have an LG G2, and recently got a cell phone provided for by my place of work, so I cancelled my Sprint service.  I want to use the phone as a gaming device for my kids, but I keep getting error messages popping up regarding the fact that it cannot connect to the sprint network.      LTE : ESM-0 EMM-19   EHRPD : 5   MIP : 67   They pop up very frequently, and I cannot find a way to disable them.  TL;DR: Is there a way to disable the popup error messages related to no service on a Sprint LG G2?


Colouring tables - Option clash for package xcolor

I would like to colour some rows of my table. However when using \usepackage[table]{xcolor} I get the error "Option clash for package xcolor".   I am using quite a lot of packages, but I do not know with which one it clashes. Also, I would like to know what I can do to still use all my packages and highlight my table rows. Is there another option than xcolor?  Here is a list of all used packages:  \usepackage[b5paper]{geometry}  \usepackage[toc,page]{appendix}  \usepackage[utf8]{inputenc}   \usepackage[version=3]{mhchem}  \usepackage{amsmath}  \usepackage{siunitx}  \usepackage[superscript]{cite}  \usepackage[final]{pdfpages}  \includepdfset{offset=5mm 0mm}  \usepackage{longtable}  \usepackage{graphicx}  \graphicspath { {../figures/} }  \usepackage{caption} \captionsetup[figure]{font=small,labelfont=small,labelfont=bf} \captionsetup[table]{font=small,labelfont=small,labelfont=bf}  \usepackage{array}  \usepackage{arev}  \renewcommand{\thefootnote}{\fnsymbol{footnote}}  \usepackage{float}  \usepackage{etoolbox}  \apptocmd{\sloppy}{\hbadness 9000\relax}{}{}  \usepackage{fancyhdr}    THANK YOU


How to show terms in a Views in its hierarchical structure?

I have create a view to show the terms of the Products vocabulary.  I the view I set:  Format: Html list  Show: field  Fields: Taxonomy term: Name  It works fine but it the hierarchical structure is lost.  The Products vocabulary has this structure:  -Cars  --Ford  --Volvo  -Computers  --Desktop  --Laptop  But in the Views the terms lost the hierarchical structure and are listed like:  -Cars  -Ford  -Volvo  -Computers  -Desktop  -Laptop  What am I missing here??


Allowing players to create or upgrade their weapons

I'm DMing a Pathfinder game with all new characters and I'm not very experienced as well. We are all learning a lot each session and the players are happy to change things when we learn we've been breaking rules.  Anyway, I have one player (dwarf barbarian) that has been adding teeth, horns and other pointy animal-parts from their quarries to his greatclub. So far I've allowed him to treat his greatclub as bludgeon and piercing damage, and after adding so many, we are now treating his weapon as masterwork.  He's very attached to his club and I know as we progress, he'll prefer to continually upgrade it as opposed to replacing it. What are some ways he can continue to upgrade his weapon that won't end the weapon's progression? Our cleric is getting the Craft Magic Arms and Armor feat at his next level, and the party has been talking about enchanting things but from what I've read so far enchants seem more on the permanent end (I'm totally fine with being wrong).


I am having trouble with Laurent series expansions. I am supposed to find the Laurent Series Expansion for $\sin(\frac{1}{z})$ around $0<|z| < \infty$. I know the definitions of $a_n$ and $b_n$ for the Laurent expansion but that is all. Is there another way of arriving at the same, without using the definition?


So I know that it’s not from tears or sweat because they are composed of mainly water and sodium, it’s not from going poo or pee as poo and pee are made of the parts of food that supply your body with no nutrients and your body also doesn’t “burn body fat” because there is a theory that no matter is ever destroyed so it’s none of those but another thing is it’s not your hair, ear wax, finger nails or anything of that sort because people can lose over 17 pounds in 3 months but you can’t build up that amount of hair , ear wax or whatever else in three months so how does body fat leave your body


If $\sum_{n=2}^{\infty} a_n$ is convergent, is $\sum_{n=2}^{\infty}{\sqrt{a_n} \over \ln{n}}\left( n^{a_n}-1 \right)$ convergent as well?

Suppose $\sum_{n=2}^{\infty} a_n$ is a convergent series. Is the following series convergent as well? $$\sum_{n=2}^{\infty}{\sqrt{a_n} \over \ln{n}}\left( n^{a_n}-1 \right)$$ The part with $n^{a_n}-1 $ looks quite similar to $\sqrt[n]{n}-1$ which behaves like $\ln{n}$, however, I'm not able to tie this fact to the behavior of the whole expression. Any suggestions?


How did they light Magneto's plastic prison?

Both versions of the plastic prison, but especially the Pentagon prison, were well lit. How did they do this without using metal in the wiring and lightbulbs?


Understanding why the hint will prove that $A_{5}$ is generated by $3$-cycles.

The question I want to answer is: Show that $A_{5}$ is generated by $3$-cycles. And I got a hint that: it suffices to show that every product $(a b)(c d)$ of two transpositions is a product of $3$-cycles. But I do not understand how the hint will prove the required, could anyone explain that for me please? EDIT: I am not asking about the proof, I am asking about why proving the hint proves the required.


I am trying to do something I think is pretty easy but clearly making a pigs ears of it. Here is   I have a button and a label on display. I want to centre the label in the middle of the div, so horizontally and vertically centred.  I can centre it horizontally but not vertically. So I have tried a few things but nothing seems to centre the label vertically, even the vertical-align I use below. Not really sure why though?  .headerLbl {    text-align: center;    font-weight: bold;    color: white;    font-size: 14pt;     display: block;    vertical-align: central; }


How can I calculate the combinations of having exactly k distinct letters in a word of length n?

How can I calculate the combinations of words having exactly k distinct letters and of length n? For example, we have a set of letters {A, B, C}, the words of length 3 having exactly 2 letters are:  AAB,ABA,BAA,BBA,BAB,ABB, AAC,ACA,CAA,CCA,CAC,ACC, BBC,BCB,CBB,CCB,CBC,BCC  I tried to solve the problem by first stating at position 1 to k it must fulfill k exact letters, while the remaining can be any character. This results in m * (m - 1) *... (m - k + 1) combinations. The first k positions can actually be any place in the word, so I multiply the previous combinations by nCk. However, this approach is incorrect and the results contain some duplicated entries.


I have a problem understand this math problem:     Write a number on the board. This number is either multiplied by $2$ or raised to a square. If the number $"1"$ is written at the beginning, at least how many steps should be taken to reach $2^{2018}?$   A) $15$  B) $16$  C) $17$  D) $18$  E) $12$  I can't solve this problem. Because I don't understand the question. Now, I need to understand the question. Then maybe I can.  Is there a problem in the question? The question unclear for me...Can you explain me, what is the meaning of the question?


Strong Signal ads are making it tough for me to use Chrome

Few days ago I noticed a new phenomena in chrome  1) Whenever I visit a new website, the first click on the site results in a new tap with ads in it and directs me to a website called the theadsgateway.com.  2) When searching in Google, some weird results appear on the top of the page with label "Strong Signal ads"  3) When visiting some websites, three ads appear at the bottom of the page. Two squares and one is rectangular in the middle. Also with label "Strong Signal ads".  Following some instructions I found on the Internet, I uninstalled Strong Signal(which I don't remember installing) from Control Panel and removed the extension Strong Signal from Chrome Extensions. This didn't help and the three things I mentioned above still happen and whenever I restart my computer I find the extension Strong Signal in my Chrome extension like I never removed it before.  Please help.


I am writing a C++ code. here The goal of the program is to create single buffer from two or three different buffers. Here is the code I wrote.  #include <iostream> #include <cstdint> #include <cstring>  int main() {     uint8_t LLDP_STANDARD_DST_MAC_STRING [] = {0x01,0x80,0xc2,0x00,0x00,0x0e};     uint16_t LLDP_EtherType={ 0x88CC};`     uint8_t* buf=new uint8_t[14];`     uint8_t LLDP_STANDARD_SRC_MAC_STRING[] = {0x11,0x81,0xC3,0x01,0x01,0x1e};`     memcpy(buf,&LLDP_STANDARD_DST_MAC_STRING,6);     memcpy(buf+sizeof(LLDP_STANDARD_DST_MAC_STRING),&LLDP_STANDARD_SRC_MAC_STRING,6);      std::cout << "first data " << sizeof(buf) << std::endl;     std::cout << "firt data " << (uint8_t) buf[12] << std::endl; }   When I run the code, size of buf  the code is priting 8. It is wrong? The value is not clear text. some different charatcter.   Thanks for your help.  Best regards Sothy


How to evaluate $\lim_{n\to\infty}\frac{\ln n}{n}$ without the exponent?

I’d like to calculate  $$ \lim_{n\to\infty}\frac{\ln n}{n}$$ by using the squeeze theorem.   So I’m looking for a sequence with members that are bigger than $\frac{\ln n}{n}$, but which also converges to zero.  How is it possible to evaluate this sequence without the exponent?


Installation to internal HD failed (Input/Outut error during read on /dev/sda)

I received a PC that was running Windows with a boot problem, the automatic recovery program of Windows failed and I couldn't access the PC (I can't access Windows anymore).   I installed Ubuntu with an external hard disk and now I'm running Ubuntu from this external disk and seems to work. Now I would like to install Ubuntu on the internal HD but the installation program shows these messages and errors here:  typed YES   typed Install now    typed continue        Arrived at this point, I've to quit the installation. I'm new to Ubuntu, I'm not sure if the internal HD works or it's already dead. Trying to find some more information about the internal HD this is what the programs Disks and GParted shows.  Disks Information   GParted Information   GParted Warnings   Thanks already in advance for any advice. I hope that you understand my problem, and I'm sorry for the bad english :)


How to Remove Extensions From, and Force the Trailing Slash at the End of URLs?

Example of current file structure:  example.com/foo.php   example.com/bar.html   example.com/directory/   example.com/directory/foo.php   example.com/directory/bar.html   example.com/cgi-bin/directory/foo.cgi*     I would like to remove HTML, PHP, and CGI extensions from, and then force the trailing slash at the end of URLs. So, it could look like this:  example.com/foo/   example.com/bar/   example.com/directory/   example.com/directory/foo/   example.com/directory/bar/   example.com/cgi-bin/directory/foo/   I am very frustrated because I've searched for 17 hours straight for solution and visited more than a few hundred pages on various blogs and forums. I'm not joking. So I think I've done my research.  Here is the code that sits in my .htaccess file right now:  RewriteCond %{REQUEST_FILENAME} !-d RewriteCond %{REQUEST_FILENAME}\.html -f RewriteRule ^(([^/]+/)*[^./]+)/$ $1.html RewriteCond %{REQUEST_FILENAME} !-f RewriteCond %{REQUEST_FILENAME} !-d RewriteCond %{REQUEST_URI} !(\.[a-zA-Z0-9]|/)$ RewriteRule (.*)$ /$1/ [R=301,L]   As you can see, this code only removes .html (and I'm not very happy with it because I think it could be done a lot simpler). I can remove the extension from PHP files when I rename them to .html through .htaccess, but that's not what I want. I want to remove it straight. This is the first thing I don't know how to do.  The second thing is actually very annoying. My .htaccess file with code above, adds .html/ to every string entered after example.com/directory/foo/. So if I enter example.com/directory/foo/bar (obviously /bar doesn't exist since foo is a file), instead of just displaying message that page is not found, it converts it to example.com/directory/foo/bar.html/, then searches for a file for a few seconds and then displays the not found message. This, of course, is bad behavior.  So, once again, I need the code in .htaccess to do the following things:   Remove .html extension Remove .php extension Remove .cgi extension Force the trailing slash at the end of URLs Requests should behave correctly (no adding trailing slashes or extensions to strings if file or directory doesn't exist on server) Code should be as simple as possible     @Kronbernkzion excellent. The only issue I'm having now is 404's don't seem to work right and leads me to a real funky place, I can't even use an absolute 404 redirect.  ErrorDocument 404 http://www.google.com   Did you come across this? How did you get past it?  Aside from the 404 rewrite, the full code I've used was:  <IfModule mod_rewrite.c> RewriteEngine On RewriteCond %{REQUEST_URI} (.*)/$ RewriteCond %{REQUEST_FILENAME}\.html -f RewriteRule (.*)/$ $1.html [L]  RewriteCond %{REQUEST_URI} (.*)/$ RewriteCond %{REQUEST_FILENAME}\.php -f RewriteRule (.*)/$ $1.php [L]  RewriteCond %{REQUEST_URI} (.*)/$ RewriteCond %{REQUEST_FILENAME}\.cgi -f RewriteRule (.*)/$ $1.cgi [L]  RewriteCond %{REQUEST_FILENAME} !-d RewriteCond %{REQUEST_FILENAME}\.html -f [OR] RewriteCond %{REQUEST_FILENAME}\.php -f [OR] RewriteCond %{REQUEST_FILENAME}\.cgi -f RewriteRule .* %{REQUEST_FILENAME}/ [R=301,L] </IfModule>


Object to decimal casting can't be implemented

I try to cast from Object type to decimal:   Object obj = new Object();  obj = 10;  decimal dec = (decimal)obj;   but in this row  decimal dec = (decimal)obj , I get this Exception:  Specified cast is not valid.  Any idea why this unboxing can't be implemented?  Thank you in advance.


I've got 4 specific files that seem to keep disappearing from a user's home directory. As far as we know, there are no cronjobs or other automated tasks that would be removing them.  I've setup auditd on them but the logs aren't really showing anything of interest.  I can see our backup utility accessing them every night until the point they aren't there anymore, but nothing else.  Is there anything that would be causing those files to be removed that would get around auditd?  The files in question are these:  /home/username/.bashrc /home/username/.bash_profile   as well as a couple of files in that user's .ssh directory.  Copies of these files placed into a subfolder called "keepers" get deleted at the same time as well.  Changing the permissions on them to 000 and having them owned by root hasn't helped.   I've currently got inotifywait setup to log create,delete,move on that subfolder, so hopefully that will turn up something, although it doesn't log much aside from when it happened, not what caused it.


Prove that $a^n-b^n \geq (a-b)nb^{n-1}$ where $a \geq b \geq 0$

I am having trouble with this proof. I believe the way to do it is through induction. This is what I have so far.  Proof:  We begin by induction on n. For the case that n = 1, we have $a^1-b^1= (a-b) \geq (a-b)(1)(b^0) = (a-b) $.  $(a-b) \geq (a-b)$   Now we assume that this is true for some natural number k. $a^k-b^k \geq (a-b)kb^{k-1}$  Now we must show it is true for k + 1. So $a^{k+1} - b^{k+1} = a^ka-b^kb.$  I am not really sure how to proceed from this point. Where can I use the inductive hypothesis?


I have a failing external hard drive (WD Passport).  It has an ExFAT formatted partition from which I would like to recover as much data as possible.  There are one or two thousand files with sizes around 20-40 MB ().  I made an Ubuntu 16.04 live USB.  What tools does it have available that can help me recover data from the drive?    Ubuntu has already been helpful because a simple cp command does not hang on files which it cannot read.  After a few seconds of trying it simply says "Input/output error" and moves on to the next file.  In comparison, OS X would not mount the volume at all and Windows 10 would get stuck indefinitely on files that couldn't be read.  With Ubuntu I got maybe 2/3 of the files using a single run of cp.  Is there anything I can do using Ubuntu beyond having run cp once on the directory I am interested in?  Are there tools that can attempt a more aggressive recovery (and would skip the files which were already copied)?  Note: I only have a live USB stick (2 GB). At this moment I don't have access to a computer with Linux installed permanently.  Note: I cannot cd into all directories on the broken volume, but the directories containing the files of interest seem to be fine. I am not looking for tools which are designed to look for files that seem to be lost from the file system.


Ubuntu desktop hangs occasionally during regular use

Ubuntu 16.04 has been hanging on me ~1x per day.  This happens when I am in the middle of web browsing or using a desktop application, not when booting.  When it does, the mouse pointer will still move freely, but clicking or keystrokes have no effect on my system until I do a hard reboot.  What is the best way for me to debug this?  Here is some information:  selah@selah-Precision-Tower-5810:~$ uname -a Linux selah-Precision-Tower-5810 4.4.0-59-generic #80-Ubuntu SMP Fri Jan 6 17:47:47 UTC 2017 x86_64 x86_64 x86_64 GNU/Linux   Also, in case it is relevant, I have a "very big" monitor, a Dell 42" at 3840x2160 resolution.  selah@selah-Precision-Tower-5810:~$ lspci | grep VGA 03:00.0 VGA compatible controller: NVIDIA Corporation GM107GL [Quadro K2200] (rev a2)     UPDATE:  Following Artyom's advice I found the following message in my error logs:   Apr 27 09:47:25 selah-Precision-Tower-5810 kernel: nouveau 0000:03:00.0: fifo: SCHED_ERROR 0a [CTXSW_TIMEOUT] Apr 27 09:47:29 selah-Precision-Tower-5810 kernel: nouveau 0000:03:00.0: fifo: SCHED_ERROR 0a [CTXSW_TIMEOUT] Apr 27 09:47:33 selah-Precision-Tower-5810 kernel: nouveau 0000:03:00.0: fifo: SCHED_ERROR 0a [CTXSW_TIMEOUT]   Which has let me to this bug which describes similar behavior:


I understand the difference between the PASSID number and the Global Entry number, what I'm not sure about is which one I'm supposed to give the airline for international travel?   Do they only need the PASSID number or do I need to give them the Global ID number instead?


what is the difference between - I make it to go and I make it go?

What is the difference between sentences like these:     I make it to go.   I make it go.   or     You make me to cry.   You make me cry.


Got only half of bounty, even after accepting?

My answer though got accepted has got only half of the initially offered bounty    The asker didnt accept the answer before the bounty ended so I got only half of the bounty. But it was told that I would get the other half after the user has accepted the bounty but in this case Its just half of the bounty.. Can anyone tell why?  related links:       saw this section: *What happens if I feel my question is still unanswered?  What is automatic awarding?*


I wrote and ran this code to practice the basic algorithm. but this program operation is stopped. What is the problem?  #include <stdio.h> #include <stdlib.h>  int bans(const void *a, const void *b) {     return (*(int *)a - *(int *)b); }  int main()  {      int m, i;     int* arr;     scanf("%d", &m);     arr = (int*)malloc(sizeof(int) * m);     for (i = 0; i < m; i++) {         scanf("%d", arr[i]);     }     int n = sizeof(arr)/sizeof(arr[0]);     for (i = 0; i < n; i++) printf("%d ", arr[i]);     qsort(arr, n, sizeof(arr[0]), bans);     for (i = 0; i < n; i++) printf("%d ", arr[i]);     free(arr);     return 0; }


Keyboard layout changes to English after each reboot

Recently I upgraded my Ubuntu to 14.04 and now my keyboard layout changes to "English (US)" each time I reboot, even though in the top right of my screen "German (Swiss)" is selected as the active keyboard. My list of selected keyboards shows "German (Swiss)", "Russian", "Greek" and "English (US)", in this order, where "German (Swiss)" should be the default setting.  Does anyone know how this problem can be fixed?


I am trying to list all the ffmpeg processes that are currently running on Debian machine (Ubuntu 15).  I use the following command:  ps aux | grep 'ffmpeg'   If only one ffmpeg process is running, I still get two results. One for the actual process, and one for grep that is looking for ffmpeg in the process list.  max      21599 13.2  3.0 503848 92288 ?        Rl   01:39   1:18 ffmpeg -f video4linux2 -i /dev/video0 -f mpeg1video -b:v 800k -r 30 http://127.0.0.1:8082/oops/1024/640/ -nostdin -nostats -loglevel fatal max      23789  0.0  0.0  13688  2172 pts/3    S+   01:49   0:00 grep --color=auto ffmpeg   How can I modify my request so that the grep result which is actually my request is omitted from the output?


Exam class: Indent each question, part and subpart to that of the upper-level indent

I've been working with the class exam, and I have been grappling with how I can set the indents for questions and their subparts, and have so far tried every combination of \setlength{\labelsep}{}, \setlength{\labelwidth}{}, \setlength{\leftmargin}{} (\settowidth{}, too). I cannot for the life of me figure out something as straightforward as:   The question numbers (or labels, in this case) have the same indent as the top-level margin; the question content itself (or 'hanging indent') is indented some specified length away from the question. If the question content's paragraph extends over multiple lines, these lines, too, follow the indent of the first line, and not the number. If the question has any parts/subparts, the part label indent follows the hanging indent of the question above, and the part content's hanging indent is some specified distance away from the label indent, which in turn is the hanging indent of the question above.  Repeat ad-infinitum for any more subparts, subsubparts, etc.    A picture speaks a thousand words, and hence, an example using monospace:  This is top-level text.   1.   This is a question.  2.   This is another, multi-line, multi-paragraph question.        Lorem ipsum dolor sit amet,       consectetur adipiscing elit, sed do eiusmod tempor incididunt ut       labore et dolore magna aliqua. Ut enim ad minim veniam, quis nost      rud exercitation ullamco laboris nisi ut aliquip ex ea commodo co      nsequat.        Duis aute irure dolor in reprehenderit in voluptate veli      t esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occ      aecat cupidatat non proident, sunt in culpa qui officia deserunt       mollit anim id est laborum.      (a)   This is a part.       (b)   This is another part.             (i)    This is a subpart.             (ii)   This is another subpart.  ...   I know this is borderline heresy at TeX.sx, but I found this positively easy to work out in Word, but completely un-achieveable in \LaTeX.


I have a Samsung Galaxy Player 4.0 and I haven't used it in ages. With that being said, I forgot my password. When I tried to unlock it, it told me to put in my email, but I forgot my password to that as well.  I want to know if there is a way to reset it, or just figure out the password to my email. Now my device doesn't let me try to put my password in because I tried too many times and failed. Is there a way that I can reset it?


#include <stdio.h>  int main(){     int x[5]={1,2,3,4,5};     for (int i=0;i<5;i++){         printf("%d\n",i[x]);     } }   I have written this small c code.i created array named x and returning all elements of array with the help of for loop but in for loop i assigned i[x] in printf() function to get array all values but the name of array is x and it perfectly running.Does i[x] and x[i] are same meaning in C.


how to remove sub-surf modifier which has already been applied

I was making a hammer in Blender, after I applied a texture to it, it froze and I soon realised that I hadn't only applied the modifier but had also saved the Blender file. Now, is there a way to remove the modifier?  Thanks in advance to all those who can answer this.


How to use punctuation marks in LuaLaTeX with unicode-math?

I also posts this here: . The problem is that I want to have the \period symbol (also range="002E does not work) from the mainfont, but when I run this:  %!TEX TS-program = lualatex \documentclass{standalone} % \usepackage[math-style=ISO]{unicode-math} % \setmainfont{MinionPro-Regular} % \setmathfont{LatinModernMath-Regular} \setmathfont[range=\period]{MinionPro-Regular} \setmathfont[range=\mathup/{num,latin,Latin,greek,Greek}]{MinionPro-Regular} \setmathfont[range=\mathbfup/{num,latin,Latin,greek,Greek}]{MinionPro-Bold} \setmathfont[range=\mathit/{num,latin,Latin,greek,Greek}]{MinionPro-It} \setmathfont[range=\mathbfit/{num,latin,Latin,greek,Greek}]{MinionPro-BoldIt}  \begin{document}     $\bigl(x^2+5\bigr).$ \end{document}   I get the following result:    Are there any ideas to solve this problem? Thanks for help.  I may think the problem lies in the \right.- and \left.-delimiters, because you won't get the incorrect result if you use \left and \right instead of \bigl( and \bigr). It seems as if range=\period makes them visible.  Is there a possibility to fix this?


Daniel runs into Nancy's, his sister's, bedroom.  Daniel runs into Nancy's, his sister, bedroom.  Daniel runs into Nancy, his sister's, bedroom.    Out of the three statements above, which one is accurate? How does one use an apostrophe when introducing a person and their belonging?


Is the function $f(x) = e^x \cos (1/x)$ is uniformly continuous on $A = (0,1)$.

The question and its answer is given below:  Determine whether t the function $f(x) = e^x \cos (1/x)$ is uniformly continuous on $A = (0,1)$.        but I am wondering why the $n$ is chosen like this, and if it should be $N$? and why $1/n\pi$ is $\leq \delta?$ could anyone explain this for me please?


Prove that for all languages $M,N \subseteq \Sigma^*$ applies:   $(M+N)^* = (M^*N^*)^*$   Hi!  I do'nt really understand why this applies: The first term uses the Kleene star on the union of M and N and therefore contains the empty word $\lambda$ and all possible string concatenations of the union. The second term contains all possible concatenations of M plus the empty word concatenated to the possible concatenations of N plus the empty word. Let $m \in M, n \in N, n \not\in M$. The word $nm$ can be expressed by the first, but not the second term $(M^*N^*)^*$. Where is my mistake?  How can I write the proof the correct way?  Thanks in advance


I bought chuck roast beef from the store but when I cooked it for my beef noodle soup, it was a little hard.  My mom told me sometimes adding salt will suck out the water amd make it hard. I'm not sure if this was the reason why though.   Are there any key things to keep in mind when cooking beef to keep it soft?


How can I remove the stolen tag from items without using pickpocketing, killing people, or using fences?

I have a ton of stolen jewelry, and no way to sell it. What should I do?


Form square matrix out of a non square matrix to calculate determinant

I have a 4x3 matrix and want to determine if the columns of my matrix are linearly independent. Is there a way to form a square matrix (4x4) in order get the ability to calculate the determinant and see if they are linearly independent?


How do i check if a variable containing a string is equivalent to a specific keyword?

im trying to check if a row in my csv file has a usage that says "Training", "PublicTest", or "PrivateTest" (Each row is classified as one of these three, except even though usage is the word "Training", the program recognizes it as not the same word, anything I can do to fix this?  training_data = [] test_data = []  train_images = [] train_labels = []  test_images = [] test_labels = []  def format_data(path):     for row in open(path):         idx = 0         with open(path) as d:             emotion, image, usage = d.readlines()[idx + 1].split(",")              if usage is "Training":                 train_labels.append(int(emotion))                 imageArr = []                 imageArr.append(image)                 train_images.append(imageArr)                 print(train_images)              elif usage is "PublicTest" or usage is "PrivateTest":                 test_labels.append(int(emotion))                 imageArr = []                 imageArr.append(image)                 test_images.append(imageArr)                 print(test_images)              idx += 1               print("This row has been iterated over!")         # print(row)               # add any more formatting      # train_images/255.0     # test_images/255.0   def load_data():     return train_images, train_labels, test_images, test_labels   format_data(path)```


What is the meaning of $\lor$ and $\land$ in the following function:$$\phi(x):= (x\land1)\lor(-1)$$ To give a little context, this should be a bounded transformation to bound a correlation estimator to $-1$ and $1$. I know of their use in logic but I've never seen them used like this.


Can anyone please explain what is the difference between PUT and POST request.Also I want to know about PATCH request.


How to enumerate latex used bibliography list?

I'm having problems enumerating my bibliography list. I'm using these lines to define my bibliography style:  \usepackage[sort,authoryear]{natbib} \bibliographystyle{apalike}   I know I could use:  \usepackage[sort,numbers]{natbib} \bibliographystyle{ieeetr}   And it would result in numbered citations list, like:  [1] Author. 2015. Paper. [2] Second Author. 2011. Paper. ...   But the problem is that references change (\citep and \cite). In text instead of reference (Author, 2015) it becomes numbers like [1]. I want to keep my apalike style references, and add numbers to each item in my bibliography list. How do I do that? I tried adding \begin{enumerare} and \item near each \bibitem  and \end{enumerare}. It didn't work.


What direction should laminate flooring be placed in?

I'm thinking of installing laminate flooring and have a question: If I'm installing laminate throughout the house, should ALL of it be going in the same direction?   Say for example, let's say I have a hallway that is perpendicular to a large living room.    --------------- |             | |             | |             | |             |-------------------- | | |             |--------------------  |             | |             | ---------------   In the layout above, would all of the laminate be installed "left to right" for both the living room and hallway? Or could it be installed in one direction for one room and installed in a different direction for the other room?


'Does registration remain' or 'does registration remains'

I'm confused between these two sentences:  Till what time of the day does the registration remain open?  Till what time of the day does the registration remains open?   I understand that 'does' is always used with a singular noun. But my confusion is with the form of verb for 'remain'. Please also explain your answer to prevent future conflict of the same sort.


Finding all possible distributions of a continuous random variable

Question Suppose that a random variable $X$ has the property that, for any $a > 1$, the conditional distribution of $\frac 1 a X$ given that $X > a$ is the same as the distribution of $X$. Specify all possible distributions of $X$. My thoughts I do know that $f_{X\mid Y}(x\mid y) = \frac {f_{X, Y}(x,\ y)} {f_Y(y)}$ and I suppose I have to make use of this relationship, but I have no idea how to even begin - When I find conditional distributions, I am usually given a specific value, not something like $X > a$. Any proposed solutions with intuitive explanations will be greatly appreciated :)


I can not insert an image into a 8371 template in .odt format.  I have tried inserting png and bmps.  All it does is show Image 1.  I even tried editing an older business card template but it will not show the image.  I never had this problem when I created the original document.  How can I get Office Writer to show the image in my business cards?


Why do I get IBUS-Warning on running the sudo gedit command?

Whenever I try to run a sudo gedit command , my terminal puts out:     (gedit:7549): IBUS-WARNING **: The owner of /home/jared/.config/ibus/bus is not root!   How do I get out of this situation?


Before asking questions, I'd like to clarify that I will be talking about Ubuntu 16.04.1.  I often find myself trying to paste (or create) files in folders which require that I have superuser privileges to do so, leading to a disabled "New folder/document" or "Paste" option. Is there any way that I can bypass that other than running sudo nautilus or sudo cp? The truth is I find the pop-up window that Windows provide too nice to part with.   I was able to find similar questions, but none of the answers mentioned anything like what I am looking for (plus most of them are about 3 years old).  I was also able to find  (I guess I could use it to launch Files as root), but:   There are three .desktop's in my /usr/share/applications/ (all with the same properties except for the size - the first one being 465 bytes, the second one 647 and the last one 704) so I don't know which one I should edit. I would still not be entirely satisfied as by using the root launcher I could end up accidentally "breaking things".


I am using a plain JavaScript object. I have to create an exact copy of the object to make changes:  var gRoll = {a:"pankaj",b: { a:"A",b:"c" }}   var copy = gRoll; copy.a = "Karma";   This is making change in the parent object. Please give me solution to create copy of the object without referring to the old one. Same like prototype design pattern in OOPS.


What are the areas where graph theory can be applied?  Cause I wonder what applications this have on the real world.  Does it solve certain problems and stuff?  Areas such as communication networks and coding in IT, genomics, computation, and scheduling in operations research


prove the difference between mean and median is less than the variance

Suppose $X$ is a random variable with finite variance. Let $m$ denote the median of $X$ and $\mu$ the mean of $X$, i.e. $\mu=\mathbb{E}(X)$. Show $$(m-\mu)^2\leq\text{var}(X)$$  Intuitively this is definitely correct, i.e. the median and mean can not be too far. How to show it? I was thinking of using Jensen's inequality on $\text{var}(X)=\mathbb{E}(X-\mu)^2$, but it does not work.


How to make Transmission download torrents behind a proxy?

Can anyone help me configure Transmission to download torrent files behind a proxy?  I have http_proxy set in my .bashrc.


How do I find the groups D10/N where N is the normal subgroups to D10?  I know that the definition is aN for all a $\in$ D10. But I am unsure what the group, for example, D10/ D10 looks like? Any help would be much appreciated.


What I mean by notifications are reputation changes, I don't get that at all, as for notifications of new comments and the like, I get them in my inbox but no notification about that, I mean I have to open the inbox and if there is a notification from area51 then I see it there? is this a bug or status-by-design?


On page 5 of the titlesec manual (released on June 14, 2000), it is written that full skip values, including the plus and minus parameters can be abbreviated as * n.   The example on page 24-25 (the code I am referring to is actually on page 25) input the following as a full skip value:  1.5ex plus .1ex minus .2ex  Could you please explain what that means and where it is applicable?


63  git clone https://github.com/LionSec/katoolin.git    64  cp katoolin/katoolin.py /usr/bin/katoolin    65  chmod +x /usr/bin/katoolin    66  sudo katoolin sudo: katoolin: command not found   This about sums it up I hope. I am running a relatively fresh install of Ubuntu 18.04 Xfce Desktop Enviroment.  Architecture:        x86_64 CPU op-mode(s):      32-bit, 64-bit Byte Order:          Little Endian CPU(s):              4 Model name:          Intel(R) Core(TM) i5-2320 CPU @ 3.00GHz


I am planning a self-travel itinerary in Cuba. I read a lot already but there are still confusing aspects. As I understand the best intercity transport is Viazul but is has few disadvantages (or maybe I misunderstand how it works):   There are not so many stops (where you can get on or off) along the way, for example, I would like to visit Soroa (in the west) that seems to be along the route  but I don't see it is the list of stops on the official website. Routes are not clear, for example, I want to get to Playa Largo and I don't understand which line is it (Havana - Playa Largo shows nothing). Not so many departure times.   So I read that there is an alternative: taxi colectivo. My question is it a good alternative? Is it more flexible than Viazul? Are there better alternatives?


Characterisation of the squares of the symmetric group

I found out that for $n\le 4$ we have $S_n^2=A_n$ with $G^2$ defined by $$G^2:=\{g^2 \mid g\in G\}$$ for any group $G$. Surely we have $S_n^2\subseteq A_n$ for all $n\in\mathbb N$. Is there a characterisation of the squares of the symmetric group? When is $S_n^2$ a group and what does it look like in general?  Edit: So far we found out, that $S_n^2$ generates $A_n$ because each 3-cycle is a square (since we have $g=g^{-2}$) and $A_n$ is generated by the 3-cycles. So we simplified the original question to the question for which $n$ we have $S_n^2=A_n$ and how to characterise the elements which a missing in case we don't have the equality.


Check if an element is present in an array

The function I am using now to check this is the following:  function inArray(needle,haystack) {     var count=haystack.length;     for(var i=0;i<count;i++)     {         if(haystack[i]===needle){return true;}     }     return false; }   It works. What I'm looking for is whether there is a better way of doing this.


Aperture, Canon Eos 1200D, Am a beginner

If we change aperture..does it affect on lighting conditions? Or only shutter speed affects light..?


Google Chrome error: Error initializing NSS without a persistent database

It was working properly before, suddenly it stopped working. When I tried to open by clicking on its icon, but nothing happens.  As already here are many questions related to this, but none of them are working for me. I already checked  and .  I uninstalled Chrome by following the instructions from .  sudo apt-get purge google-chrome-stable rm ~/.config/google-chrome/ -rf   Again I installed Chrome by:  sudo apt-get install google-chrome-stable   But the problem is still thesame.  When I enter google-chrome in terminal I get following error.  [12289:12323:0723/014456:ERROR:nss_util.cc(744)] Error initializing NSS with a persistent database (sql:/home/maddy/.pki/nssdb): libsoftokn3.so: cannot open shared object file: No such file or directory [12289:12323:0723/014456:ERROR:nss_util.cc(212)] Error initializing NSS without a persistent database: NSS error code: -5925 [12289:12323:0723/014456:FATAL:nss_util.cc(214)] nss_error=-5925, os_error=0


How to suppress overfull hbox warnings up to some maximum?

I want LaTeX not to give warnings for overfull hboxes up to some maximum of say 2 pts. How to achieve this?


Adding dynamic text to layout from attribute table with Data Driven Pages

I was trying to figure out how to use dynamic text from an attribute table in a collection of Data Driven Pages in ArcGIS 10.   I've looked in the help files, but can't find anything on dynamic text from attribute tables.