I have noticed that some users are getting a bluish Gravatar which looks like the following:              Is this intentional or just a bug?

The profile picture is missing on . The relevant part looks like    Since this profile picture appears almost everywhere when I am referenced, quite a few other pages looks buggy. For example,  , , , .  The url to my picture, which can be found by searching the source page is, . When I check that url directly, it does return "404. That’s an error."  As I would like to believe, http 404 should never be returned to a request for a profile picture, since the picture is either automatically generated or replaced by one selected or uploaded by the user.  I know there is simple workaround, I can edit my profile by changing my picture to an image I uploaded. However, I would like to raise this as a bug before doing that.   (Incidentally, I love my missing profile picture that was generated automatically, which looks like the following.)    This bug has been active for more than a week. I did not report it initially since it might be just a temporary glitch.  Apparently, the missing of profile picture happens to some other users, too. For example, .    Update:  Thanks to Discrete lizard's comment, now I see what is happening. When I registered my account on Computer Science Stack Exchange (CSSE) with my Gmail address, CSSE (or its mother engine at StackExchange) asked Gmail/Google for my avatar. Since I had never specified one for my Gmail/Google account, google had generated one for me, whose url was returned to and used by CSSE. However, I had only seen that avatar on CSSE, which caused me to believe that avatar was generated by CSSE. When Google updated the url for my avatar, which is the same as before a while ago to this new googleusercontent url, , the previous url saved by CSSE became invalid, causing the problem.   In light of above explanation, this broken profile picture can be considered a feature by design instead of bug of CSSE (or just StackExchange). Of course, some action could be taken by StackExchange to improve the situation as discussed by .  Depending on the situation, I might change the above update to an accepted answer so as to finish this question.


I was searching for some answer on an issue I'm facing and I fell over this site:    It has the exact same layout as SP.SE and the exact same content.

of Stack Overflow, all content posted on Stack Exchange sites by their users (i.e. you wonderful people) has been provided to the whole universe under . For my fellow non-lawyers, that license basically means:   Anyone can use any Stack Exchange posts at any time without having to ask for permission Making money off of the copied content is permitted You don't even have to copy stuff from here verbatim; you can just use it as a starting point and make whatever edits you want There are just two rules you have to follow:   You have to provide . Simple links to the original post and author info are just fine. You have to  and allow other people to use your content, as long as they follow these very same rules. How meta!    (If you ever forget any of that, and want to refresh your memory, the license info is linked to in the footer of every page.)  There are, in fact, a lot of people who republish varying amounts of our content for assorted reasons. Unfortunately, there are some Stack Content Republishers Attributing Poorly and/or Excelling at Ranking (SCRAPERs, for short).  In this context, "attributing poorly" means any use that doesn't follow our attribution rules or make any other reasonable attempt at give credit. This can get pretty egregious; I've seen SCRAPERs that not only don't link back to SE originals, but also use fake author info and post dates to make it harder to find originals. By "excelling at ranking," I'm referring to copycat sites that end up higher in Google results than the original SE sites do for the same content. That's not necessarily wrong, but in some cases, it indicates inappropriate SEO hackery.  So, the question is: what can you do if you spot a SCRAPER?


This is basically a follow up question from Tom Church's answer to this question: .  What can a undergraduate do say in his 2nd or 3rd year to get the strongest recommendation letter possible?  There are the usual answers like talk to your professors etc, but Tom's answer seem to imply there are skills to be learnt in this case.

I have been asked to write many letters of recommendation over many years.  In some cases, the requesters have made this task easy and enjoyable, and others, less so. I'd like to offer some guidelines that work for me, and solicit others.


Some context first. Revit is a software used by architects which has an API you can use to automate some tasks, one of the things you can do is create a dialog which will look like a normal Revit pop up. This dialog has a  property that adds default buttons like Yes, No, Cancel and Ok, but I never saw this character | used in this way. What does it mean or do? How is it actually called? td.CommonButtons = TaskDialogCommonButtons.No | TaskDialogCommonButtons.Yes | TaskDialogCommonButtons.Cancel;  td being your TaskDialog object This will add Yes, No and Cancel buttons to your dialog. I already searched for this with no luck, I can only find the "or" logic gate for if statements and doesn't seem to apply to this. Neither did I see it anywhere else than in this Revit context (not that I'm a full time programmer anyway). Thanks

From time to time I see an enum like the following:  [Flags] public enum Options  {     None    = 0,     Option1 = 1,     Option2 = 2,     Option3 = 4,     Option4 = 8 }   I don't understand what exactly the [Flags] attribute does.  Anyone have a good explanation or example they could post?


this is my summarized code :  var searchCount = 0; function requestResults() {       $.get("http://www.example.com/example.ashx",   { i: "test" },   function (data) {     if (data) {        $(data).find("xmlTestNode").each(function (index, item) {        // do someting (1) ...        });     } else {        // dont try to search more than 20 seconds        searchCount += 1;        if (searchCount <= 4) {          setTimeout(function () {            requestResults();          }, 5000);        } else {          searchCount = 0;          // there is no result for 20 seconds searching        };     };   }, "text"); };   this code gets some data from .ashx handler. as the handler needs to search and answering may take some times, this function sends it @.get request each 5 seconds. if handler have found results, it will be OK and the line "do something (1)" will be run.  if handler didn't answer for 20 seconds, the function will stop repeating its request.  sometimes user may want to stop searching within 20 seconds, so he hit Stop button.  I can stop showing data if Stop button is clicked, but is there any way to stop $.get request from getting data? something like BREAK in functions.  the problem is when user try to search different queries quickly (multiple search in less than 5 seconds), many $.get requested were sent to server. what is the best solution to handle this problem?

Is it possible that using jQuery, I cancel/abort an Ajax request that I have not yet received the response from?


I've with me 50 MB data from a machine consisting of event logs such as device status, warning and error. I wish to perform text mining on the same to find correlation between errors i.e. one error could trigger another in future and take a prescriptive action on it. I've used hierarchical clustering in R to generate a dendrogram but the result couldn't yeild expected insight. Hence, I've planned to perform Apriori Algorithm on the same. My queries are:  Is Hierarchical Clustering suggested to find such correlations? Is Apriori an apt algorithm in such situation and why? Or, is there any other approach to solve this problem?  Any help would be appreciated.  Thanks

I've with me 50 MB data from a machine consisting of event logs such as device status, warning and error. I wish to perform text mining on the same to find correlation between errors i.e. one error could trigger another in future and take a prescriptive action on it. I've used hierarchical clustering in R to generate a dendrogram but the result couldn't yeild expected insight. Hence, I've planned to perform Apriori Algorithm on the same.  My queries are:   Is Hierarchical Clustering suggested to find such correlations? Is Apriori an apt algorithm in such situation and why? Or, is there any other approach to solve this problem?   The logs that I've looks like this :


How to calculate   $$ \lim_{n \to \infty}\left(1 + \frac{1}{n^2}\right)^n $$  using only the very basic limit features (I cannot use the fact that it equals to $e^0 = 1$)?

Now this exercise looks like I need to use $$\lim_{n\to\infty} \left(1+\frac{1}{n}\right)^n=e$$ somehow, but I'm unsure of how. Bernoulli would give me $$\left(1+\frac{1}{n^2}\right)^n > 1+n\cdot\frac{1}{n^2}=1+\frac{1}{n}$$ for which the limit is $1$, but I'm not sure how that helps. Can anybody give me a tip on how to solve this elegantly?


ab&2e;1652769179"/> i did correlction using rerular expression ab&2e;(.*?)"/>  but during execution some times extra text (cd&3d;) adding to the data like  ab&2e;cd&3d;1652769179"/>  So need to ignore data "cd&3d;"  Please let me know any idea to ignore text cd&3d; Thanks  Thanks Raghav

ab&2e;1652769179"/>   i did correlction using rerular expression ab&2e;(.*?)"/>  but during execution some times extra text (cd&3d;) adding to the data like  ab&2e;cd&3d;1652769179"/>  So need to ignore data "cd&3d;"  Please let me know any idea to ignore text cd&3d; and capture 1652769179 only using expresiion ab&2e;(.*?)"/>  Thanks Raghav


let $f : [a,b] \to \Bbb R$ a continuous function and $x_1,x_2,x_3,\cdots,x_n\in[a,b]$    I need to prove/show that there is a $y \in [a,b]$ that:  $$f(y) = \frac{f(x_1)+f(x_2)+ .... + f(x_n)}{n}$$  Any ideas about how to do it?

Suppose that the function $f:[a,b]\rightarrow \mathbb{R}$ is continuous. For a natural number $k$, let $x_1,\cdots,x_k$ be points in $[a,b]$. Prove there is a point $z\in[a,b]$ at which $f(z)=\frac{f(x_1)+f(x_2)+\cdots+f(x_k)}{k}$.    This can be proved by showing   $\hspace{130pt}f(a)<\frac{f(x_1)+f(x_2)+\cdots+f(x_k)}{k}<f(b)$  and using the intermediate value theorem to say there exists a point $z\in [a,b]$ such that the statement is true.  I'm not sure how to show this though. Any suggestions?


Both strings appear to be the same when printed to the console, but not when compared using "=="     What am i doing wrong here?    String message = "Rejected | Ref ID: CaptureMe | Name:";    Pattern pattern = Pattern.compile("\\bRef ID:\\s+(\\S+)");       Matcher matcher = pattern.matcher(message);  String matchedRef = matcher.group(1);  System.out.print(matchedRef);       Prints: CaptureMe     String myRef = "CaptureMe";  if(matchedRef == myRef){ System.out.print(true); } else{ System.out.print(false); }   Prints: FALSE

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


When there is some food (like cheese or ham) that has roughly a week "use by" date, I assume that it's safe to eat it a day after it's "use by" date.   For other food that has approx. half year "use by" date (like olives in glass or pesto) I think it's safe to eat it for anything up to a month or so.   And for canned foods having years it should be safe to eat few months after "use by" date.   My thinking is that it's harder to pinpoint the exact date the further the date is in the future. I would even expect that "use by" dates are something around the half time the food is still actually edible.   Am I correct in this line of thinking? Do you know of any reliable resources on this? I couldn't find anything.

How long will foods that have "Best by: XX-XX-XX" on the product last past that date?  I have tried looking online, and all I can find is anecdotal evidence, which isn't very assuring for me since there seems to be no specific "x food will expire y weeks after its best by date".  Is there a rule of thumb or some guide out there that can tell me how long a "best by" food will last? Or is it safe to assume that they never expire, since it's not actually labelled on the product?


I used a network logistic regression to regress five predictors against a dependent. They are all significant, instead the R is not significant and it's even very low. I can understand that it may be low because I need to add predictors but I cannot explain why it's not significant. Do you have any idea about?

I'm fitting a multiple linear regression model between 4 categorical variables (with 4 levels each) and a numerical output. My dataset has 43 observations.  Regression gives me the following $p$-values from the $t$-test for every slope coefficient: $.15, .67, .27, .02$. Thus, the coefficient for the 4th predictor is significant at $\alpha = .05$ confidence level.  On the other hand, the regression gives me a $p$-value from an overall $F$-test of the null hypothesis that all my slope coefficients are equal to zero. For my dataset, this $p$-value is $.11$.  My question: how should I interpret these results? Which $p$-value should I use and why? Is the coefficient for the 4th variable significantly different from $0$ at the $\alpha = .05$ confidence level?  I've seen a related question, , but there was an opposite situation: high $t$-test $p$-values and low $F$-test $p$-value. Honestly, I don't quite understand why we would need an $F$-test in addition to a $t$-test to see if linear regression coefficients are significantly different from zero.


I know this has been asked a few times, I'm just trying to confirm that my understanding is correct. According to , she should be able to travel to Germany for a short holiday on her multiple entry, type-D Schengen visa, even though the visa states:  Valid for: FRANCE (+1 TRANSIT SCHENGEN)  Edit: If I wasn't clear, I'm asking about the fact that the visa specifically states that it is valid for France, and if that somehow trumps the general type-D travel allowance. I didn't find a clear answer to that part. Possibly just because I don't understand the EU rules.

I have read a few posts specifying that you are allowed to travel for a 90-day period of a 180-day visa.  I have a type D Schengen visa for 365 days. I have been in Italy for 5 months but have not travelled to another Schengen territory yet.  Would I still be able to travel to other countries or has my window of opportunity disappeared?


Whenever I get a close votereview  audit for which the good answer is to close the question there are no reasons listed, it simply shows:     Should this question be closed as: ? (more)

I've just seen that the reason of closing is missing in the reviewing page of closing votes.    Is it a temporary error or it's a bug?  EDIT: Seems that only when there are audits the reason is missing.  If I cannot upload image I will make an ASCII art:  Should this question be closed as: ? (less)  ┌────────────┐ ┌─────┐ ┌────┐ ┌────┐                                              │ Leave Open │ │Close│ │Edit│ │Skip│                                              └────────────┘ └─────┘ └────┘ └────┘ Leave Open if this question should not be closed  Close if this question should be closed for any reason; consider leaving an  explanatory comment before voting  Edit if this question could be improved so that it does not need to be closed  Skip if you are not sure and want to go to the next question


How can I prove that in a circle $\frac{circumference}{radius}$ is constant ? I know that $\pi$ is defined like that (because it's indeed constant). But how to prove that it's indeed constant ?

We know that the ratio between the circumference's length and diameter is equal to $\pi$, but can this be proved for every circle? Or is this an axiom?


I'm looking for a book that in detail covers the mathematical basis for different learning algorithms in order to better guide my intuition on what is difficult. My background is a Math Ph.D., but I'm fairly new to the NN area having mostly done some small-scale networks for simple problems as well as done some courses on Coursera/Udacity.  I'd like to understand in detail why it's difficult to do learning for certain types of NNs and what the mathematical basis of that is in order to better guide my intuition when designing networks. I know about Bishop's Neural Network for Pattern Recognition as well as Hassoun's Fundamentals of Artificial Neural Networks. However, these are fairly old, so they seems to not mention things like RNNs as there's been a whole lot of development in the field since.  Does anyone have any recommendations? If no books cover this, I wouldn't mind digging into papers covering the most important advances in the area. I'm trying to work myself up to the level of a grad student in the area. I started going to a seminar series organized by one of the top departments, which is almost next door, but there's a whole lot of fundamentals to figure out before I can better follow what's being discussed.

I am looking for a book that goes through the mathematical aspects of neural networks, from simple forward passage of multilayer perceptron in matrix form or differentiation of activation functions, to back propagation in CNN or RNN (to mention some of the topics).  Do you know any book that goes in depth into this theory? I've had a look at a couple (such as Pattern Recognition and Machine Learning by Bishop or Deep Learning by Goodfellow, Bengio and Courville) but still have not found a rigorous one (with exercises would be a plus). Do you have any suggestions?


I summoned six . They each have the ability Aura of Menace with a save DC of 13:     Aura of Menace (Su) A righteous aura surrounds archons that fight or get angry. Any hostile creature within a 20-foot radius of an archon must succeed on a Will save to resist its effects. The save DC varies with the type of archon, is Charisma-based, and includes a +2 racial bonus. Those who fail take a –2 penalty on attacks, AC, and saves for 24 hours or until they successfully hit the archon that generated the aura. A creature that has resisted or broken the effect cannot be affected again by the same archon’s aura for 24 hours.   The debuff seems to be untyped. If the enemy fails his save vs all six auras, does he suffer -12 to attacks, AC, and saves?

Aura of Menace (Su): Any hostile creature within a 20-foot radius of   an archon must succeed on a Will save (DC 13) to resist its effects.   The save DC is Charisma-based, and includes a +2 racial bonus. Those   who fail take a –2 penalty on attacks, AC, and saves for 24 hours or   until they successfully hit the archon that generated the aura. A   creature that has resisted or broken the effect cannot be affected   again by the same archon's aura for 24 hours.   The penalty from the 's aura of Menace appears to be typeless, if you summoned multiple lantern Archons and a creature failed the save from all of them would they suffer only a -2 or the cumulative penalty from all of them?


I use an old HP MINI Netbook with 2GB RAM 667 MHz , 1.6 GHz Intel Atom N270/N450 processor with built-in Intel graphics. I want to install Ubuntu on my netbook so please suggest me a very light version of Ubuntu OS which has atleast Internet Sharing feature enabled.  Regards, Vivek

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


Should it be "every single one of us is" or "every single one of us are"? seeing as 'us' is a plural term, should the word 'are' come afterwards?

I'm aware of (multitudinous)  concerning this, but I still feel tentative for the following example. I also referenced . Predicated on these, I'd guess that        "there are happiness and joy" is correct,   and "there is happiness and joy" is wrong.      Here, there is (I know why it's NOT there are here) a compound subject containing two nouns, thus the verb must be conjugated for a plural subject.  Yet  contradicts this significantly? Why? I fear that I  misconstrued something?


I get the idea of how to do this proof, essentially I would choose a pathological partition $P$ such that it includes a point $ c \in P $ where $ f(c) \Delta_c - l \geq \epsilon$. However I'm stuck on how to make this work in a $ \delta,\epsilon $ proof. Suppose the contrary that $ f $ is Riemann Integrable but $ f $ is not bounded. It suffices I show $$ \exists \epsilon > 0, \forall \delta > 0\ \text{s.t}\ \exists P, m(P) < \delta\  \mathrm{but}\ |R(f,P) - l| \geq \epsilon $$  $ m(P) $ is the mesh of the partition $P$  Since $ f $ is not bounded, choose $ c $ such that $ f(c) > \frac{l + \epsilon}{\delta} $ and let $ c \in P $ Then I initially I had this: $$ |R(f,P) - l| = \left|\sum_{{s_j} \in P} f(s_j) \Delta_j - l\right| $$ $$ \geq \left|\sum_{{s_j} \in P} f(s_j) \delta - l\right|$$ $$ \geq \left|f(c) \delta - l\right|$$ $$ \geq \left|\frac{l + \epsilon}{\delta} \delta - l\right|$$ $$ = \epsilon $$ However, clearly the inequality here is nowhere near correct, since the difference is an absolute value. How would I go about this proof? (I'm following the Stephen Krantz, Real Analysis and Foundations Textbook)

Hi i was wondering if  anyone could help me with my revision This is a question of a past paper i'm stuck on.  Let $$f:[a,b]\to \Re$$ be Riemann intergrable. Part (a) is to prove that f is bounded and part (b) is to Give an example of a bounded function f that is not Riemann integrable  my attempt for part (a) is since f is Riemann intergrable then it is continuous on [a,b] which means that it must also be bounded? or is this incorrect i find this topic rather difficult  For part (b) i dont really have a clue i cant recall any function like the one they ask for


What I have done so far:  Since $f$ is holomorphic on $U$ and   $\overline{D}(0,1)$, we have by   cauchy's integral formula we have   \begin{align*}     f'(0)=\frac{1}{2\pi i}\int_{\partial D(0,1)}\frac{f(w)}{w^2}dw   \end{align*}   So we have   \begin{align*}     |f'(0)|&=|\frac{1}{2\pi i}\int_{\partial D(0,1)}\frac{f(w)}{w^2}dw|\\     &\leq \frac{1}{2\pi}\int_{\partial D(0,1)}|\frac{f(w)}{w^2}dw|, \;     \text{by the triangle and the modulus of $i$ being 1}\\     &\leq \frac{1}{2\pi}\max_{z,w\in \overline{D}(0,1)}\frac{f(w)-f(z)}{(w-z)^2}     ||\partial D(0,1)||=\frac{1}{2\pi}     \max_{z,w\in \overline{D}(0,1)}\frac{f(w)-f(z)}{(w-z)^2}     2\pi\\     &=\max_{z,w\in \overline{D}(0,1)}\frac{f(w)-f(z)}{(w-z)^2}   \end{align*}  Of course by continuity the difference quotient can't blow up, but I am concerned this isn't the best way to approach the problem. I also have not used compactness of the closed disc, although that may be just to justify taking the max rather than the sup of f in the statement.

Let $D \subset \mathbb{C}$ be the open unit disk, $f:D \to \mathbb{C}$ a holomorphic function and $d=\sup \{|f(z)-f(w)|:z,w\in D \}$. How can I show that $|f'(0)|\leq \frac{d}{2}$?  I tried using Schwarz's lemma on the function $g:D \to \mathbb{C}$ defined by $g(z)=\frac{f(z)-f(0)}{d}$, but I am only getting $|f'(0)|\leq d$.


In general, the indefinite integral of $x^n$  has power $n+1$.  This is the standard power rule.  Why does it "break" for $n=-1$?  In other words, the derivative rule $$\frac{d}{dx} x^{n} = nx^{n-1}$$ fails to hold for $n=0$. Is there some deep reason for this discontinuity?

I've learned in my analysis class, that     $$ \int \frac{1}{x} \mathrm dx = \ln(x). $$   I can live with that, and it's what I use when solving equations like that. But how can I solve this, without knowing that beforehand.  Assuming the standard rule for integration is     $$ \int x^a \, \mathrm dx = \frac{1}{a+1} \cdot x^{a+1} + C .$$   If I use that and apply this to $\int \frac{1}{x} \,\mathrm dx$:  $$ \begin{align*}   \int \frac{1}{x}\mathrm  dx &= \int x^{-1} \,\mathrm dx \\                       &= \frac{1}{-1+1} \cdot x^{-1+1} \\                       &= \frac{x^0}{0} \end{align*} $$  Obviously, this doesn't work, as I get a division by $0$. I don't really see, how I can end up with $\ln(x)$. There seems to be something very fundamental that I'm missing.  I study computer sciences, so, we usually omit things like in-depth math theory like that. We just learned that $\int \frac{1}{x} dx = \ln(x)$ and that's what we use.


Some  links are not  properly clickable.  Example: <118::aid-ptr493>3.3.co;2-g

With this URL:  .  It is broken unless I add a \ to the end in front of a period:   And it works. However in the comments, I can't get this to work: (See the comments)


I have a old macbook running Manjaro and a PC running windows 10. Is there any way to use the laptop as a second screen for my main computer?  EDIT: Please do not mark as duplicate or link the other thread because the solution to that thread requires installing an unsigned driver and does not solve my problem.

Is it possible to make my laptop's screen act as a second monitor for my desktop computer?


I am trying to compile a template which uses the "todonotes" package, which I have found here:   When I run latex on the template I get the following message printed to terminal:  ! LaTeX Error: File `todonotes.sty' not found.   I realize that I need to include the .sty file in the directory from which I compile. However the .sty is not available for download from anywhere that I can find. The files todonotes.dtx and todonotes.ins are available for download on the quoted CTAN page.  How do I get the todonotes.sty file? Do I need to somehow generate it from the .dtx and .ins files?

When I run:  tex algorithms.dtx   for example, I get this message.    ! Undefined control sequence. l.34 \documentclass                    {ltxdoc} ?   Help?


I have a document and I am happy with the spacing everywhere except where there are two sequential paragraphs. In this case I would like a line between them, but I do not know how to make this happen other than manually placing line breaks (\\).  I am aware of \parskip, but this adds space before the paragraph, not after it, which affects the entire document (e.g. space is added between paragraphs and headings, between single lines of text, between list items, etc etc)  How can I specify a line should be added between two successive paragraphs, and only between two successive paragraphs?

I am using KOMA-script scrreprt class.  I know I can use \usepackage{parskip} or \setlength{\parskip}{12pt}, but both of these also affect headings.  Adding \vspace{12pt} manually between all two sequential paragraphs seems to work, but that's anything but convenient. Is there a way to automate it?


I am using the following formula to count the unique values in a range:  =SUMPRODUCT(('Sheet 1'!$E$5:$E$900<>"")/COUNTIF('Sheet 1'!$E$5:$E$900,'Sheet 1'!$E$5:$E$900&""))  This formula is on Sheet 2 and works fine. But now I am trying to add a condition to this which I cannot get to work. Instead of counting all values in Column E, I want to include only the values which have a value in Column M on the same row. If Column M is blank, I do not want to count what is in Column E. Can someone please tell me how I would do that?

I read and tested quite a lot, but I still not able to come up with a solution for my problem.  The close solution I found is the second one proposed in article below:   I'm essentially after finding out how many values are unique in Column A while Column B correspond to a certain value.  Let's imagine the following spreadsheet  COL A      COL B abc        TRUE abc        TRUE bef        TRUE bef        FALSE hgf        TRUE swd        FALSE rth        FALSE kjh        TRUE   I'd like to come up with a formula to calculate (not showing) the # of unique values in A which contains TRUE in COL B. So given the example above, I should get 4.  Now, I was expecting the formula below to be in some way helpful  =SUMPRODUCT((A2:A100<>"")/COUNTIF(A2:A100,A2:A100))   once amended with a COUNTIFS, but it clearly doesn't work, and I don't understand why. Also I don't really understand the reason of the initial bit: A2:A100<>""


The code is working when adding a new block of element group as form-group class. However the dynamic elements button click function do not respond to $().click(). I can add more dynamic elements but only through the first group.
     Course:
         <input type="text"  class=" txSelCourse"   placeholder="Select course" autocomplete="off">

aa

        <button  class="add_btn">Add div row</button>

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


The page above has work am trying to reproduce but the Greek numeration with marks in parentheses(bold) and the tree diagram have given me trouble. I don't seem to be getting it right. Am new to latex, so kindly help me.

how do you change the numbering of a question so that the subparts are numbered with greek symbols like alpha and beta instead of the usual roman numerals?


I came up with this question   If A is a subset of B , then A intersection B = A     If $A \subseteq B$ , then $A \cap B = A$   Can anyone please explain me how to do it?  Thank you so much!

Hi I'm new to set theory. I need to prove that if $A \subseteq B$, then $A \cap B = A$. I would like to do this the formal way, without a Venn diagram. How should I proceed?


How is this below possible:  $ \sum_{i=1}^\infty 1/i = \infty $

Can someone give a simple explanation as to why the       $$\sum_{n=1}^\infty\frac1n=\frac 1 1 + \frac 12 + \frac 13 + \cdots $$   doesn't converge, on the other hand it grows very slowly?   I'd prefer an easily comprehensible explanation rather than a rigorous proof regularly found in undergraduate textbooks.


I was given the assignment to find a way to explain why the product of two negative numbers is positive. If a middle school or high school student were to ask why is it true, I must show some logic explanation as to how we can get a positive number.     $$(-a)\times(-b)=(a)\times(b)$$   I wanted to talk about a video of a guy running backwards but the video itself playing backwards. When I hit play, it actually shows the guy running forward. But I can not find a logic way to explain it.   Any ideas or a way to explain this to a middle school student? I have to convince the student that this is a fact.

Someone recently asked me why a negative $\times$ a negative is positive, and why a negative $\times$ a positive is negative, etc.  I went ahead and gave them a proof by contradiction like so:  Assume $(-x) \cdot (-y) = -xy$  Then divide both sides by $(-x)$ and you get $(-y) = y$  Since we have a contradiction, then our first assumption must be incorrect.  I'm guessing I did something wrong here. Since the conclusion of $(-x) \cdot (-y) = (xy)$ is hard to derive from what I wrote.  Is there a better way to explain this?  Is my proof incorrect?  Also, what would be an intuitive way to explain the negation concept, if there is one?


My Canadian study permit request was approved and I have a visa in my passport for it.  My transit are in Frankfurt and Zurich.  Will I need a transit visa to transit through these countries.  Transit time is 2  hours and 3 hours.

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


I would like to install Google input tools in Ubuntu. How can I do that?

I need Google Input Tools for writing scripts in Telugu language in Celtx in Ubuntu 13.10. I tried various methods, but none is as simple as Google Input Tools. Is there a way?


On 12.04, I have the latest version of Ocaml (4.01) installed with all the dependencies. I'm trying to install Coq, which depends on an older version (3.12) of the ocaml-base-nox runtime (via a virtual dependency). Running apt-cache policy ocaml-base-nox gives the following output:  ocaml-base-nox:   Installed: 4.01.0-1ppa4~precise   Candidate: 4.01.0-1ppa4~precise   Version table:  *** 4.01.0-1ppa4~precise 0         500 http://ppa.launchpad.net/avsm/ppa/ubuntu/ precise/main amd64 Packages         100 /var/lib/dpkg/status      3.12.1-2ubuntu2 0         500 http://us.archive.ubuntu.com/ubuntu/ precise/main amd64 Packages   Ok, shouldn't be a problem, right? I just need to switch my version to 3.12 to install/use coq, then I can switch back to 4.01 when I need the newer version. It's not clear to me how to do this. After a little googling I tried the following:  $ sudo apt-get install ocaml-base-nox=3.12.1-2ubuntu2 Reading package lists... Done Building dependency tree        Reading state information... Done The following packages will be REMOVED:   camlp4 camlp4-extra ocaml ocaml-base ocaml-compiler-libs ocaml-interp ocaml-native-compilers   ocaml-nox The following packages will be DOWNGRADED:   ocaml-base-nox 0 upgraded, 0 newly installed, 1 downgraded, 8 to remove and 0 not upgraded. Need to get 596 kB of archives. After this operation, 205 MB disk space will be freed. Do you want to continue [Y/n]?   It seems like it's going to remove my entire Ocaml stack, which I'll probably have to reinstall from scratch to use again. Furthermore, most of what I use Ocaml for (the mirage unikernal project) requires 4.0 or higher.  So, what, if any, is the correct way to switch between package versions? Is there a way I can force apt-get to install something without uninstalling anything?

I want to setup a new virtual machine with some specified packages (name and version), that are provided.  For example apache2 in version 2.2.20-1ubuntu1 with all dependencies. Even if there is a new version of this package on the servers this one should be installed.  The solution has to work/scale with multiple (n) "setups". Another virtual machine might need an older version of apache2.  I currently know of some possibilities that install the exact packages, but do not scale that good:   Copy all required *.deb to every virtual machine manually and enter: dpkg -i ... -> Could work, but it is very error prone. (Manual scripts etc.) Create and use a new Ubuntu repository for each setup. -> Does not work because I would need n repositories. Setup the machine once and copy the VM / create a snapshot. -> Does not work because I would need to store n VMs.   My problem could be labeled as patch management, but I do not want to update my packages to the current version. My goal is to install old packages.


I can do this and it works (but would like something more simple):  Declare @PropIDs        varchar(50) Set @PropIDs = '1, 2'  IF OBJECT_ID('dbo.TempProp') IS NOT NULL DROP TABLE dbo.TempProp  CREATE TABLE [dbo].[TempProp](     [PropCode] [VarChar](3) NULL)  Set @Sql = 'Insert Into TempProp Select PropertyCode From Property where PropertyID In (' + @PropIDs + ')'  Execute (@Sql)   But I wish I could do just this:  Declare @PropIDs Set @PropIDs = '1, 2' Select PropertyCode  Into #TempProp From Property where PropertyID IN (@PropIDs)   It is the "...Property IN (@PropIDs)" that is giving me trouble. Any suggestions?

How do I parameterize a query containing an IN clause with a variable number of arguments, like this one?  SELECT * FROM Tags  WHERE Name IN ('ruby','rails','scruffy','rubyonrails') ORDER BY Count DESC   In this query, the number of arguments could be anywhere from 1 to 5.  I would prefer not to use a dedicated stored procedure for this (or XML), but if there is some elegant way specific to , I am open to that.


I'm trying to generate cover letters starting from a single document. Since I'm sending the same letter to different persons with different address I thought it would be great to use this document as template and change only the information pulling data from another file, much in the way dynamic HTML documents works.   Now I have two documents, the main one that will contain all the letters and pull the information, and the other with the content. Here are my documents:  This document is called "Infection-Label_letters:"  \documentclass[11pt,a4paper,sans]{moderncv}    \moderncvstyle{classic}      \usepackage{datetime} \usepackage[ngerman,english]{babel}  \usepackage[english,ngerman]{babel}      \usepackage{etoolbox}% http://ctan.org/pkg/etoolbox  \makeatletter  \patchcmd{\makelettertitle}% <cmd>  {\raggedright \@opening}% <search>  {\@opening}% <replace>  {}{}% <success><failure>  \patchcmd{\makelettertitle}%   {\end{minipage}\\[1em]}%   {\end{minipage}\\[2em]}%   {}{}   \renewcommand*{\makeletterclosing}{    \@closing\\[6em]%    {\bfseries \@firstname~\@familyname}%    \ifthenelse{\isundefined{\@jobtitle}}{}{\\\@jobtitle}% <-- added to orig. def   \ifthenelse{\isundefined{\@enclosure}}{}{%     \\%      \vfill%      {\color{color2}\itshape\enclname: \@enclosure}}}  \def\jobtitle#1{\def\@jobtitle{#1}}  \makeatother  \moderncvcolor{green}     \usepackage[utf8]{inputenc}   \usepackage[scale=0.75]{geometry} \name{Name}{Surname} \address{Address}{City}{Country} \phone[mobile]{+00~(000)~0000~0000}  \email{name@domain.com}      \homepage{www.domain.com}   \begin{document}  % Label #001 \begin{} \newcommand{\labelName}{Name} \newcommand{\addressFirstLine}{Address 1} \newcommand{\addressSecondLine}{Address 2} \newcommand{\addressThirdLine}{Address 3} \newcommand{\theName}{Sir} \newcommand{\theSurname}{ or Madam} \newcommand{\recipientJob}{News Editor} \newcommand{\enclosedItems}{one-sheet, demo CD, ''Title'' reviews.} \include{Infection-Label_letter_template} \end{}  % Label #002 \begin{} \newcommand{\labelName}{Name} \newcommand{\addressFirstLine}{Address 1} \newcommand{\addressSecondLine}{Address 2} \newcommand{\addressThirdLine}{Address 3} \newcommand{\theName}{Sir} \newcommand{\theSurname}{ or Madam} \newcommand{\recipientJob}{News Editor} \newcommand{\enclosedItems}{one-sheet, demo CD, ''Title'' reviews.} \include{Infection-Label_letter_template} \end{}   \jobtitle{Band Leader} \makeletterclosing  \end{document}   This one is called "Infection-Label_letter_template:"  \begin{document}  \recipient{\labelName}{\addressFirstLine\\\addressSecondLine\\\addressThirdLine} \date{\today} \opening{Dear \theName\theSurname,} \closing{Sincerely,} \enclosure[Attached]{\enclosedItems}     \makelettertitle \parskip 11pt  I'm writing to introduce Band, a death metal band in the vein of Death, Cannibal Corpse, and Monstrosity. During the time the band has been active, we have independently-released our first album, "Title,'' which received positive reviews from magazines and international press. We are now willing to take one step ahead and reach a broader audience with our music.  Infection have finished recording a new album entitled "Title.'' Therefore, our band is currently seeking a recording contract with a quality label like \labelName.   I have enclosed a CD and full press kit. I hope you can give Band's music a listen and consider us for a position on your roster. If you have questions, you can contact me by email at nameo@domain.com or at the address and phone above. Thanks for your time.  \end{document}   I acknowledge that my code is not working, but that's I have at this very moment. I tried to adapt the idea from this link:   Any help will be appreciated!

I use the term database loosely here -- it can be an actual database, or a spreadsheet (in any format including CSV) or can be package-dependent.   Is there a way to create mail-merged documents similar to what can be done in word processing packages? I found the  which sort of works but it puts all the mail-merged data into one document.   Is there a package or way to generate new, individual documents for each part of the database? In other words, if I have a firstName value in whatever storage system, can I get LaTeX to generate a file called <firstName>.dvi for each of the names in the database? Or do I need to resort to a scripting language driver to pull that off?  EDIT  So to further explain what I am trying to do (and will now set it up based on the answer to  ) :  I'm trying to create a "welcome to the company" sort of document that has a cover page, table of contents, welcome letter, then various sections of information. I've never tried this in anything other than a word processor where it's easy to set "master pages" or "template pages" for individual pages in the document. So I could use a letterhead template page for the welcome letter part and a standard article-type template for the rest and still have the letter numbered/referenced in the ToC.   If I use the approach on the answer there, how can I tell \pdfpages which page to include? Ultimately I would like to have many files like Bob.pdf, Sue.pdf, John.pdf etc. where each file is the same document with a custom letter embedded within.


I'm on a brand new Dell XPS 15 and the new Technical Preview build 9926 is completely unusable. It's not compatible with my intel and Nvdia drivers and most of the time I get stuck on a black screen at boot. The only thing I can so is rollback to 9879 which works fine but that gives me about a half day before 9926 forces itself to install again. I have it set to slow now but it doesnt help. How can I stop it from installing after rollback?

I've found  that essentially stops my computer from working. This bug is only present in the 9926 build so far. When I use Windows Rollback to go back to the previous 9879 build, there is no bug. However, after a couple of days, I get thrown back to 9926  So, is there a way of staying on the older 9879 build, without being automatically upgraded to 9926?


I noticed that (on my slow laptop) when I first open a newly imported RAW file in Lightroom the first view of the photo (non-thumb view, while the loading spinner is still there) is noticeably different with more vibrant colours and brightness than when Lightroom finishes processing it and the loading spinner disappears. Loading the RAW subsequently results in the latter being displayed.   It's a bit difficult to explain so here are some screenshots. This is what I see when I first open a newly imported RAW while Lightroom is "loading":    This is what I see after Lightroom has finished loading the file less a few seconds later:    What exactly is happening here? Also, it seems to me that Lightroom must be applying some default settings when opening RAWs, can those be changed/viewed etc?

Everybody who is using Lightroom probably has seen this. After importing RAW files, Lightroom shows a preview, but contrast and color of the preview change after a few short seconds to a slightly different view.  For some users the change is small, for others the change is huge. Colors are different (read: wrong), contrast is off.  Rumor says this is happening only (more?) for Nikon users.  What is Lightroom doing here?  I'd guess that for the first preview, LR is showing the JPG preview file, which is embedded in the RAW file. Then after a moment, LR renders the RAW file itself to show it's own interpretation.  But why is this interpretation so different from the embedded JPG?


I am reviewing the method of variation of parameters for solving non-homogeneous second-order differential equations that look like \begin{align} a\frac{d^2 y}{dt^2}+b\frac{dy}{dt}+cy=f\left(t\right),\;\;a\neq 0.\tag{1} \end{align} But I have a question. One of the reasons this method didn't quite stick the first time around is because I did not fully understand why we might assume that \begin{align} v'_1\left(t\right)y_1\left(t\right)+v_2'\left(t\right)y_2\left(t\right)=0.\tag{2} \end{align} All I could find on this site is , but that doesn't quite ask what I am asking. For instance, I see why it is done, i.e. to make sure we don't end up with higher-order derivatives of our parameters, but then what if we did not make this assumption? In what case would we necessarily make that assumption?

I never fully understood the derivation of the method of variation of parameters. Consider the simple case $$y'' + p(x)y' + q(x)y = f(x)\,.$$  The homogeneous solution is $y_h=c_1y_1+c_2y_2$ and the particular solution that we guess is $y_p =u_1y_1+u_2y_2$ for some function $u_1(t)$ and $u_2(t)$. Next we take derivatives of the particular solution and substitute those back into the original ODE.   The part done next is the part I don't quite see the justification for. We assume that our functions $u_1$ and $u_2$ will satisfy the constraint $$u_1'y_1 + u_2'y_2=0\,,$$  and this particular constraint will yield a cleaner result when looking at $y'_p$: $$u_1'y_1'+u_2'y_2'=f(x)\,.$$  At least in the textbook I'm looking at, the justification for assuming that $u_1$ and $u_2$ satisfy $u_1'y_1 + u_2'y_2=0$ is simply omitted. How do we know that the solutions we're after satisfy that constraint? All other sources I look at just say something like, "okay we are going to impose this constraint. Now moving on ..."  Could someone give me a proper explanation as to why we can make this assumption?


I built a town in Minecraft, and I want to add a currency system. I know you can test for exactly a certain number with /execute; however, it's very annoying to have to sort out  EXACTLY the amount needed to buy something.  So my question: Is there a way to test for 3 or more of an item? Like, if you're holding 64 currency and the item you're buying costs 3?

I am using the AmazingKit plugin on my Minecraft server to make inventory kits for players. In a command block I have the following command:  /tellraw @p ["",{"text":"Iron","clickEvent":{"action":"run_command","value":"_____"}},{"text":" / "},{"text":"Gold","clickEvent":{"action":"run_command","value":"_____"}}]   Which prints the following result: Iron / Gold.  When a player clicks on Iron, what command should I write where the empty space is _____ in order to check if the player has at least (>=) 20 iron ingots in his inventory and if he/she does, remove 20 iron ingots and execute /kit Basic. If the player has less than 20 iron ingots in inventory, the command won't be executed. Instead, Insufficient amount of iron ingots will be printed out.   Same applies when a player clicks on "Gold".  I'm on 1.14 version


I have this code  \documentclass[11pt]{article} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage[margin=2.5cm]{geometry} % showframe \usepackage{multirow} \usepackage{multicol} \usepackage{tabularx} \usepackage{caption} \usepackage{booktabs} \usepackage{amsmath} \usepackage{mathtools} \usepackage{siunitx} \usepackage[skip=0.33\baselineskip]{caption}  \captionsetup[table]{     font=bf,     size=normalsize,     justification=centerlast,     labelsep=newline     } \renewcommand\thetable{\Roman{table}}  \begin{document} \def\arraystretch{1.5} \begin{table}[h] \centering \setlength\tabcolsep{0pt} \sisetup{table-format=2.2, group-separator={,}, group-minimum-digits=4} \caption{\large{Header}} \label{table:fundsummary} \parbox{\linewidth}{\small{This table presents some very interesting and very fancy data, which I expect will provide me with at least two Nobel prizes.}\vspace{2ex}} \medskip\small\begin{tabular*}{\linewidth}{@{\extracolsep{\fill}}                 l                 S[table-format=-2.2]            *{7}{S}                 } \toprule \multicolumn{1}{c}{\multirow{2}{*}{Description}}& \multicolumn{1}{c}{\multirow{2}{*}{Variable}}& \multicolumn{5}{c}{Averages}\\\cmidrule{3-7} \multicolumn{2}{c}{}&{p-value}&{Factor 1}&{Factor 2}&{Factor 3}&{Factor 4}\\\midrule Section 1.1     &11.11 &22.22{***} &33.33   &44.44   &55.55  &66.66\\\midrule Section 1.2     &11.11 &(22.22){***} &33.33   &44.44   &55.55  &66.66\\ Section 1.3     &11.11 &22.22{***} &33.33   &44.44   &55.55  &66.66\\ Section 1.4     &11.11 &(22.22){***} &33.33   &44.44   &55.55  &66.66\\ \bottomrule \end{tabular*} \end{table} \end{document}   which produces this output    I have a table, where I have placed t-statistics in parentheses along with a set of stars to denote significance levels. It works perfectly fine when the t-statistic is not in parentheses, but it returns an error otherwise. Is it possible to have both the parentheses and the stars for the same value with the siunitx package? Thanks in advance!

I would like to format the following table with siunitx package:  \documentclass{article} \usepackage{booktabs} \usepackage{siunitx}  \begin{document}  \begin{table} \centering \begin{tabular}{S[table-format=3.0]ccc} \\ \toprule $n$ & A & $\alpha_0$ & $\beta_0$ \\ \midrule 100 & ML & 3.1525(0.3580) & 0.4773(0.1209) \\ 200 & YW & 3.1866(0.3272) & 0.4593(0.1075) \\ 300 & ML & 3.1540(0.2660) & 0.4834(0.0858) \\ \bottomrule \end{tabular} \end{table}  \end{document}   The critical are 3rd and 4th column which are in the format X.XXXX(Y.YYYY). Any suggestion how to properly format the columns?


I have this code but i would like the numbers to be printed next to one another but it doesn't do that it just prints down the screen instead of filling up the screen.  import random count=2 while count>0:    print(random.randint(0,1))

I'd like to do it in Python. What I'd like to do in this example in C: #include <stdio.h>  int main() {     int i;     for (i=0; i<10; i++) printf(".");     return 0; }  Output: ..........  In Python: >>> for i in range(10): print('.') . . . . . . . . . . >>> print('.', '.', '.', '.', '.', '.', '.', '.', '.', '.') . . . . . . . . . .  In Python print will add a \n or space, how can I avoid that? Now, it's just an example, don't tell me I can first build a string then print it. I'd like to know how to "append" strings to stdout.


I recently switched to C++ after using Java for a good amount of time. However, I have some difficulty grasping the entire concepts of using header files along with class files.  Firstly, aren't headers just like interfaces in the OOP context?  Secondly if I have the following piece of code why do I get an error:      //CExample.h     //--START OF HEADER--               #ifndef CEXAMPLE_H     #define CEXAMPLE_H     #include <string>      class CExample{     private:        string name;     public:        CExample();       ~CExample();        string getName();     };     #endif     //--End of Header--      //CExample.cpp    //--Start of class file--     #include "CExample.h"    string CExample::getName()    {        return name;    }    //--End of class file--   I get the error: 'string' does not name a type.  So as a summary of my confusion I have the following questions:  1) What's the best and healthy way of using includes in the headers.  2) What's the concrete difference between using "" and <> for includes. (Yes I have read plenty of c++ tutorials but the explanations are somewhat vague -- they say it depends on the directory location etc -- I would like some c++ veteran to make a clear statement if possible)  3)Are there are naming conventions enforced in C++? For example in Java, you need to have the class name match the file name in which is is defined.

Why does C++ have header files and .cpp files?


I currently have 928 bad sectors and it's been increasing by the minute, but aside from the bad sectors count increasing at an incredible amount, there is no other sign that my hdd is failing, no weird sounds, no freezing, no slowing down, any help? EDIT: Here's a smart log.

How can I check the SMART status of a drive under 14.04 and beyond? I've seen  but it doesn't seem to apply under 14.04 and later.


Recently I made a deck to have fun with when I play with family/friends. So I played  on target player, and he simply didn't understand the card, saying "Why did you cast this on me? when I don't have any curses in my deck? You're supposed to cast it on yourself so that you can use it." So I told him why would I want to curse myself? and add more curses to myself? So he then asks "I don't understand this card. Henceforth I won't be getting any curses from this card unless you can prove it" I tried to explain it by telling him that I get to pull curses from my deck and give it to him. And that there is a difference between this curse and other curses, because the other curses say Enchanted player gets this and that. While Curse of misfortune doesn't say any of that so it means that I get the ability of that card to place curses on him. So he simply said the same thing and didn't understand it. So I questioned myself too, therefore me asking this to you guys.  Another question, If I play curses on players, are those enchanted cards still considered mine? Ex. I play a curse on target players, and I have  out, and a player attacks me. Do they have to tap as many mana to as many curses I've given?

Here is the situation that came up:  Player 1 controls a creature enchanted with  and two +1/+1 counters. On Player 2's turn, they cast  to take control of the creature, and then attack with it. The attack triggers the Ordeal, putting another +1/+1 counter on it. Now that it has three counters, it is sacrificed and a player gains 10 life.  Which player sacrifices the enchantment and gains 10 life? The controller of the creature (Player 2) or the player who cast the enchantment (Player 1)?


My mother-in-law is the type of person that compulsively OFFERS. It’s past good manners and etiquette and bordering on harassment. And it’s thoughtless but not really. Offering a diabetic pie and ice cream and knowing full well they shouldn’t have it and their issues with self-discipline. Relentlessly offering someone on a diet food after being asked not to repeatedly. She sees your legs are bare and offers you the very blanket she’s using, yet you said nothing about feeling chilled, and you’re an adult, fifty years old, not a child. Is there a word for someone who does this type of thing? No, she doesn’t have dementia or OCD. It’s like she sees herself as the solver, or the person that will make it better, but there is nothing wrong, nothing to make better, and eventually you just want to get away from her because it’s so RELENTLESS. She makes things up to “make better.” You can be asleep and she’ll wake you up to see if you need anything or if you needed to be woken up. (I’ve put so much detail because there was a similar question that didn’t get the right word provided, and I’d really like a word, so I can stop using all the other nasty words that are crowding my head!)

People love to tell other people what to do. It may not be control, so much as trying to help, especially when you've asked for help directly. However, there's a difference between answering someone's question and answering while piling on recommendations the person didn't ask about, and this is what I'm seeking a term for. Advertising and marketing feel similar to me in this vein. In the worst cases this can be overzealous religious followers professing your damnation if you don't follow with them (I think in Christianity they call it "witnessing"). Any which way, it comes across to me as a form of unsolicited advice: I didn't ask for it, so I don't want it; I want to stay focused.  Is there a better term for this than "unsolicited advice"? Also, is there a term for a person who exhibits this kind of behavior frequently?


Is there a way to tell maven to pick the latest version of a jar as long as major version remains the same? For example, instead of the following:      <dependency>         <groupId>com.example</groupId>         <artifactId>example-java-sdk</artifactId>         <version>1.0.1</version>     </dependency>   I'd like to use the following:      <dependency>         <groupId>com.example</groupId>         <artifactId>example-java-sdk</artifactId>         <version>1.*</version>     </dependency>   Or:      <dependency>         <groupId>com.example</groupId>         <artifactId>example-java-sdk</artifactId>         <version>1</version>     </dependency>   That way, I can update the minor version or revision without having to ask everyone to change their dependencies. The latest jar (with the same major version) will be picked up the next time they rebuild their application.

In Maven, dependencies are usually set up like this:  <dependency>   <groupId>wonderful-inc</groupId>   <artifactId>dream-library</artifactId>   <version>1.2.3</version> </dependency>   Now, if you are working with libraries that have frequent releases, constantly updating the <version> tag can be somewhat annoying. Is there any way to tell Maven to always use the latest available version (from the repository)?


I'm struggling with my model (below), since despite some hyperparameters tuning i always end with a sudden rise of the loss function and then a 'infinite" plateau. My hypothesis were: -learning rate and local minima issue? i tried several (1e-3,1e-4) -Optimizer issue? i tried SGD for example -Too complex model? i removed some layers or neurons -Metric issue? i tried MAE Among theses hypothesis and perhaps others, which one seems the most likely ? I looked for differents curve patterns but didn't find this one.  timeseries = Input(shape=(1536,2), name='timeseries') #1536 time steps, and 2 features features = Input(shape=(22,), name='features')  #22 features  y=LSTM(256)(timeseries) #256 y=Dropout(0.20)(y) y=Flatten()(y)  x=Dense(28, activation='relu')(features) #14 x=Dense(14, activation='relu')(x) #14 x=Dense(14, activation='relu')(x) #7  #z = concatenate([x, y]) z=Concatenate(axis=1)([x,y]) z=Dense(64, activation='relu')(z) #64 z=Dense(64, activation='relu')(z) #64 x=Dense(32, activation='relu')(x) #32 x=Dense(16, activation='relu')(x) #16 z=Dropout(0.40)(z)  outputP = Dense(1, activation='softplus')(z) outputR = Dense(1, activation='softplus')(z) outputC = Dense(1, activation='softplus')(z)  modelLSTM256NN = Model(inputs=[timeseries,features], outputs= [outputP,outputR,outputC]) opt = Adam(lr=1e-3) #1e-3  modelLSTM256NN.compile(optimizer=opt, loss='mse')  Thanks!!

I'm training a neural network but the training loss doesn't decrease. How can I fix this?  I'm not asking about overfitting or regularization. I'm asking about how to solve the problem where my network's performance doesn't improve on the training set.    This question is intentionally general so that other questions about how to train a neural network can be closed as a duplicate of this one, with the attitude that "if you give a man a fish you feed him for a day, but if you teach a man to fish, you can feed him for the rest of his life." See this Meta thread for a discussion:   If your neural network does not generalize well, see:


I suddenly became curious that why the sun doesn't burn out at once?  What makes the sun burn gradually?

The temperature and pressure everywhere inside the Sun reach the critical point to start nuclear reactions - there is no reason for it to take such a long time to complete the reaction process.  Just like a nuclear bomb will complete all the reaction within $10^{-6}$seconds.  Why does most of the hydrogen of the Sun still not react even though it reaches the critical point, and why take stars billions of years to run out of fuel?


So I've been looking at some stuff and found this thread  And this is the answer to the question #include <math.h>  struct Point {     double x;     double y;     double z; };  double dist(struct Point *p1, struct Point *p2) {     constexpr double Point::* coords[3] = {&Point::x, &Point::y, &Point::z};      double d2 = 0;     for (int i=0; i<3; i++) {         double d = p1->*coords[i] - p2->*coords[i];         d2 += d * d;     }     return sqrt(d2); }  Now my problem is that I have no idea what constexpr double Point::* coords[3] = {&Point::x, &Point::y, &Point::z};  is supposed to do... I understand that constexpr makes it a constant that is defined at compile time and double is obviously used because the struct contains doubles but the Point::* and the {&Point::x, &Point::y, &Point::z}; confuse me. First of all what is Point::*? I guess the * means it is a some kind of pointer but to what? And what are these addresses {&Point::x, &Point::y, &Point::z} ? What exactly does this entire expression define?

I came across this strange code snippet which compiles fine:  class Car {     public:     int speed; };  int main() {     int Car::*pSpeed = &Car::speed;     return 0; }   Why does C++ have this pointer to a non-static data member of a class? What is the use of this strange pointer in real code?


How can you tell when a participle is being used as an adjective?  I feel completely lost trying to guess. Just as a completely arbitrary example   For every dedicated scientist patiently recording atmospheric pressure and wind speed while shivering at high altitudes, there is a carnival barker with a bevy of pretty girls willing to dangle from a basket or parachute down to earth.

He is loved.   This is something that I've always kind of wondered.  In a sentence like this, is loved a verb or an adjective? Can it be considered either?


In the final fight between Neo and Smith, Smith absorbs Neo and then blows up. Why did this happen?  I've heard some theories suggest that it was because Smith fulfilled his purpose and the system deleted him. But I have 2 problems with this:   Smith normally didn't play by the rules and didn't listen to the Matrix, for example he came back from death once before. This makes for a poor story because that means at any time if Neo lost to Smith, the same results would happen and the Matrix would get rebooted. For example, if Neo had died in the first movie after he was shot then wouldn't the ending be the same?   Whatever the reason was that Smith blew up, was it necessary for him to absorb Neo or could he have just killed him?

When Agent Smith is destroyed by Neo, how can he survive, how can he still exist? Do some or all machines have a physical body? Smith gives a rough explanation, but that simply explains that it was both unexpected by him to be destroyed and to survive this:      Something that I knew was impossible, but it happened anyway. You destroyed me, Mr. Anderson. Afterward, I knew the rules, I understood what I was supposed to do, but I didn't. I couldn't. I was compelled to stay. Compelled to disobey. And now here I stand because of you, Mr Anderson. Because of you, I'm no longer an agent of this system. Because of you, I'm changed, unplugged, a new man, so to speak, like you, apparently free.   So, what happened?


I have created a 25 GB unallocated free space for installing Ubuntu 18.04 LTS. I also have Windows 10 installed. But in the Ubuntu installer, it is not showing me the free space. Please help me in this regard. Thanks.

I'd like to see the full How-To on how to use manual partitioning during Ubuntu installation. The existing guides (at least those I found here) cover only automatic part and leave untouched the manual part (or extremely short and contain no pictures).  I'd like to cover such situations:     If your disk contains other systems:


I am running 14.04 LTS on a Dell XPS 13 9343.  Today I did a routine update through Software Updater and restarted when it prompted me.  When I logged back in I had no internet connection and no icon in the menu bar to edit connections.  When I open "Network" within the main Settings menu, I get the message:  The system network services are not compatible with this version   When I open the "Network Connections" dialog, all options are greyed out. I have attempted to connect to Ethernet as well as WiFi to no avail.  Please help, I am freaking out. This is the machine I use for my job and doing a fresh install of Ubuntu would be a massive hassle as I have all kinds of specialized software packages installed.  I should also mention that I tried reinstalling network-manager. I even removed and purged it, then reinstalled from the package provided on the Ubuntu website. That didn't change anything. I also purged and reinstalled the network-manager-gnome package to see if I could fix the GUI issues (nm-applet not working) but that didn't do anything either.

While upgrading today, something caused my wireless network manager to disappear. Not even connecting via wired connection.  This error is being shown by files:  **(nm-applet:2716): WARNING **: Could not initialize NMClient /org/freedesktop/NetworkManager: The name org.freedesktop.NetworkManager was not provided by any .service files   (nm-applet:2716): nm-applet-WARNING **: Error connecting to ModemManager: Error calling StartServiceByName for org.freedesktop.ModemManager1: GDBus.Error:org.freedesktop.DBus.Error.Spawn.ExecFailed: Cannot launch daemon, file not found or permissions invalid   (nm-applet:2716): nm-applet-WARNING **: Could not find ShellVersion property on org.gnome.Shell after 5 tries   (nm-applet:2716): nm-applet-WARNING **: Failed to register as an agent: (2) The name org.freedesktop.NetworkManager was not provided by any .service files    Is there a patch I can download through windows and send through to my ubuntu, or is it a case of having to reload everything? I tried running two versions back but still no internet access.


Show if $R$ is Noetherian, then $R_S$ is Noetherian.  here is what I have read from somewhere else. Suppose $R$ is Noetherian and $J$ is an ideal $R_S$. Then $J=IR_S$ for some ideal $I$ of $R$. Since $R$ is Noetherian, $I$ is finitely generated, say $I=(r_1,r_2,…r_n)$  Thus $J=(r_1/1,r_2/1,…r_n/1)$. Hence every ideal in $R_S$ is finitely generated and so $R_S$ is Noetherian.  My confusion is how to get $J=(r_1/1,r_2/1,…r_n/1)$ from $I=(r_1,r_2,…r_n)$. And I also confuse about the notation of $r_1/1$, what are they, are they suppose just be like $r_1/1=r_1$ ? Thank you.

This is an unproven proposition I've come across in multiple places.   Suppose $A$ is a commutative Noetherian ring, and $S$ a multiplicative subset of $A$. Then $S^{-1}A$ is Noetherian.  Why is this? I thought about taking some chain of submodules $$ S^{-1}M_1\subset S^{-1}M_2\subset\cdots $$ and pulling back to a chain  $$ M_1\subset M_2\subset\cdots $$ of submodules of $A$ which must eventually stablize. Is there more to it than this? I kind of wary of assuming all submodules of $S^{-1}A$ have form $S^{-1}M$ for $M\leq A$.


Is there a formula for the spring constant $k$ which satisfies the equation $$F=k\Delta \ell~?$$  A similar question was asked but was answered by transposition of this equation... I'm hoping for an answer addressing the physical meaning of a spring constant.  Unlike the question which is marked as a duplicate, I was hoping for a fixed equation which encompasses all factors, rather than just a list.

For certain springs we have been taught that Hookes law, $F=-kx$ works. For such springs, what factors determine k. For instance, k is proportional to length. Can k be expressed in terms of dimensions, mass and other fundemental quantities, or is k a fundemental property of the spring itself?


I am using g_strsplit to split the msg with \n delimiter and created a function to break the string. The function breaks the msg and return to calling function thus I am not able to free the splitted string pointer in the called function. Thus tried to pass by reference the gchar. However I am getting segmentation fault.  #include <stdio.h> #include <string.h> #include <glib.h>  int split_message_syslog_forwarder(char **msg_full,gchar **splitted_strings) {     int msg_length = -1;     *splitted_strings = g_strsplit(*msg_full, "\n", 2);     if (*splitted_strings != NULL)     {         sscanf(*splitted_strings[0], "%d", &msg_length);         if(msg_length<0)         {             *msg_full =  *splitted_strings[1];         }     }       return msg_length; }  int main() {     int msg_length = -1;     char *msg_full = "12\nwhat is this";     gchar **splitted_strings;     int ret = split_message_syslog_forwarder(&msg_full,&splitted_strings);     printf("spilitted msg = %d",ret);     printf("spilitted msg 2= %s",msg_full);     return 0; }   How can I pass the reference of gchar **splitted_string in glib?

The following code receives seg fault on line 2:  char *str = "string"; str[0] = 'z';  // could be also written as *str = 'z' printf("%s\n", str);   While this works perfectly well:  char str[] = "string"; str[0] = 'z'; printf("%s\n", str);   Tested with MSVC and GCC.


I have a large file (say reads.fasta) which has around 5,000,000 lines and have another file reads_of_interest which contains a list of the line numbers of reads.fasta that I want to extract.   Is there an easy command line method to do this?  In other words, there is a file large_file.txt. There is another file line_numbers.txt which is of the form  12  134 1456   And I want to extract lines 12, 134, 1456 from large_file.txt. The number of lines I want to extract is of the order of 500,000.  Thanks!

Given a file L with one non-negative integer per line and text file F, what would be a fast way to keep only those lines in F, whose line number appears in file L?  Example:  $ cat L.txt 1 3  $ cat F.txt Hello World Hallo Welt Hola mundo  $ command-in-question -x L.txt F.txt Hello World Hola mundo   I'm looking for a command that can handle a file L with 500 million or more entries; file L is sorted numerically.  Note: I'm halfway through an implementation for a command-in-question but I just wondered, whether one might be able to use some Unix tools here as well.    Update: Thank for all the answers, I learned a lot today! I would like to accept more one answer, but that's not possible.


OK.. let us consider a rocket initially at rest in outer space. Space is considered as vacuum so there is hardly something that rocket can insert a force on. So if the rocket fires up its engines will it gain an acceleration or will it be at rest as always.

I know Newton's third law of motion might be the answer for this but still I am wondering how the rockets could thrust in the empty space and move in the opposite direction. I guess an astronaut wouldn't be able to push in the empty space with his hands or legs to move himself, but with a rocket engine it's possible. How? What might be the explanation for this in General Relativity?


What is the difference between the following sentences? When can I use either?     I have worked here   and     I have been working here

Could you correct the comments in parentheses, please? Are they right?        I have lived in Los Angeles. (A completed action; the person does not live there anymore).   I have lived in Los Angeles my whole life. (The person is still living there, or spent her whole life in Los Angeles, but is currently   living in another location).    I have been living in Los Angeles. (She doesn't live there anymore, but was living there recently, or is still living there).   I have been living in Los Angeles my whole life. (The person is still living there or spent her whole life in Los Angeles, but is   currently living in another location).      Thanks


when i open my terminal it shows:  bash: alias: osmall: not found bash: alias: =: not found bash: alias: cd: not found bash: alias: /var/www/html/OpenSupermall/: not found bash: alias: /var/www/html/OpenSupermall/: not found alias osmall='cd' bash: alias: /var/www/html/OpenSupermall/: not found bash: alias: /var/www/html/OpenSupermall/: not found   It's so annoying to me. How can I get rid of this message ? Thanks

When I log in, I see the error:     bash: alias: alias: not found   If I source my .bashrc file, the message appears again.  What is causing this?


I downloaded an AppImage and set it's permissions to execute. When I start typing it's name in Dash and click on it, the containing folder is opened rather than the AppImage is run.  How can I make it behave the same way it works for applications installed with snap? PS: I am not sure it is called Dash in the latest Ubuntu releases, what I mean is the global search menu which opens when pressing the Win key. Feel free to correct me and I will edit the question.

I just installed the lastest version of . I works fine but in order to use it, I have to enter the following in the terminal: cd ugene-1.11.5/ then execute ./ugene -ui to launch UGENE GUI.   This takes too long. I would like to build a .desktop file for UGENE to be used in Ubuntu 12.04 so that I can simply open it from the unity launcher.  Not sure if this is helpful but the website says: By default ugene script launches the command-line version of UGENE.  Here's what I have (not sure if it's right):  [Desktop Entry] Version=1.0 Name=my Unipro UGENE GenericName=Integrated Bioinformatics Suite Comment=Unipro UGENE is a cross-platform visual environment for DNA and protein sequence analysis. MimeType=text/english;text/plain;text/x-makefile;text/x-c++hdr;text/x-c++src;text/x-chdr;text/x-csrc;text/x-java;text/x-moc;text/x-pascal;text/x-tcl;text/x-tex;application/x-shellscript;text/x-c;text/x-c++; Exec=/home/samuel/ugene-1.11.5 ./ugene -ui -c %F Icon=/usr/share/icons/hicolor/scalable/apps/ugene.svg Type=Application Terminal=true Categories=Utility;Development; StartupWMClass=UGENE   I added the launcher named my Unipro UGENE to my unity bar and tried opening it but it doesn't appear. I must be missing something. I don't know what the StartWMCClass field is suppose to be nor do I know whether I entered the correct MimeType.


I wanted to install python 3.4.2 through the terminal and it asks for my password. I started to type but nothing appears. how do I give my password?

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


In order to avoid misalignment issues with tikz nodes I have decided to set the options text height and text depth so that all nodes have the same height and depth as a normal line of text.  According to Wikipedia, the standard height of a line of text is .7\baselineskip and the standard depth .3\baselineskip. Therefore I do  \documentclass{article} \usepackage{tikz} \begin{document}  \begin{tikzpicture}   \node[draw,text height=.7\baselineskip,text depth=.3\baselineskip] at (0,0) {x};  \end{tikzpicture} \end{document}   But this means I have to remember these values.  Is there a command that would compute the height and depth of box that I can use in these circumstances? E.g. text depth=\depthof\strut.  Note:  This question is very similar to .  However the solution given there involving the calc package no longer seems to work.

I can use \widthof{text} to fix a minimum width of a TikZ's node. I would like to use \heightof{text} to fix its minimum height but it doesn't work.  I just want to fill my nodes with one word but I want to draw some empty nodes with same height as filled ones. But I would like not to use a trial and error system to fix it's size.  Next code shows what I want to do. I've tried uncommenting \usepackage{calc} but nothing changed. .log file doesn't show any error about knowing or not command \heightof.  A possible solution would be to use \vphantom{text} inside empty nodes, but I would like to know what's wrong with this one.  \documentclass[tikz,border=1mm]{standalone} %\usepackage{calc} \usetikzlibrary{positioning}  \tikzset{ box/.style={draw,%     minimum width=5mm,%     minimum height=\heightof{Cap},%     align=center}, }  \begin{document} \begin{tikzpicture}[font=\small\sffamily]  \node[box] (h0) {Cap}; \foreach \i [remember=\i as \lastx (initially 0)] in {1,...,6}      \node[box,right= 0mm of h\lastx] (h\i) {}; \node[box,right=0mm of h\lastx] {cua};  \end{tikzpicture} \end{document}   This is the result. You can see that minimum height is not fixed with \heightof. Why?


I am using the exam class to create exams, but in my country grades usually go from 0 to 10, then sometimes I need point like 0.2, 0.25, 0.75 ... How I do that? Thank you in advance.

exam package enables the possibility to use and define \half as to for instance consider .5. However I have not seen any way of implementing .75 and .25 in case I want a part or question to have that value.  Is it possible? In case yes can you give me an example and how I can have the correct sum of points per question?  Edit: MWE included  \documentclass[11pt, addpoints, twoside, a4paper]{exam}  \begin{document}  \begin{questions}  \renewcommand*\half{.5} \question[0\half] This question is 0.5 points  \renewcommand*\half{.25} \question[1\half] This question is 1.25 points  \renewcommand*\half{.5} \question[1\half] This question is 1.5 points  \end{questions}  Total points with addpoints: \numpoints~(3.5)  Total points real count: 3.25  I don't know how to define quarters, etc. so I can easily define the points in my questions without having to renew \texttt{half} command, and also having the final sum properly done.  \end{document}


Let $$A=\bigg\{\sum_{i=1}^{\infty} \frac{a_i}{5^{i}}\ :\  a_i\in\{0,1,2,3,4\} \bigg\} \subset \mathbb{R}.$$ Then which of the following are true:   a. $A$ is a finite set.  b. $A$ is countably infinite.  c. $A$ is uncountable but does not contain an open interval.  d. $A$ contains an open interval.  Each such series is convergent. I could also prove that $A$ is uncountable. I am not able to prove or disprove d.   Thanks for the help!!


Hey there I'm using libGDX and I have following problem, just can't see what I'm doing wrong:  I have   float generatingTime = 0;  if (generatingTime < 1.0f){    generatingTime =+ 0.01f)    }  if (generatingTime == 1.0f){    objectState.state = objectState.GENERATED;    }   Somehow my float generatingTime never is exactly "1.0f". What am I doing wrong?  Thank you for helping guys!

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I'm currently working on a project which requires me to test the functionality of TTL logic gates by making use of diodes and resistors. To do so I must first place them on the breadboard and then calculate their voltage with an electronic tester.  However I lack the skills and knowledge required to accomplish the task, since I don't know how to set up a breadboard, therefore I'm not only asking for a scheme but also, possibly, for some pointers related to the subject, in order to gain some knowledge about it.   doesn't cover how breadboards are built from circuits since it lacks any sort of examples, and it doesn't address the main issue, which would be coming up with a scheme for the circuits.  The following are the circuits I must build on the breadboard:

I am a software developer trying to understand how computers work at a lower level.  I have managed to create a few simple circuits, one which lights up an LED.  I have noticed that all the instructions advise you to connect the components in a certain way.  Please have a look at the circuit .  The LED is connected to column E and column F.  Why can't you just connect the LED to G7 and H7 and the black cable to F7? Why does the LED plug in across the gap?  I seem to remember something about this from school.  I have checked my GCSE textbook and also two textbooks which I am working through.  I have also Googled it but I cannot find an answer and hence the reason for this very basic question.


I come from Java and C++, and now I'm learning Python with  tutorial.  To the best of my knowledge, in Java arguments are passed by value. It seems that they are passed by reference, because when the argument is an object, we pass the reference of the object. So, if inside the called function we change the object state, the object will result modified even after the function call. But, if inside the function we reassign the function parameter we are changing the referenced object, which means that from that point the function's argument will not be affected anymore.  A simple example:  void foo(List<Integer> l){   l.append(1);  //affecting list_argument   l = new ArrayList<int>();   l.append(2);  //not affecting list_argument }  public static void main(String[] args){   List<Integer> list_argument = new ArrayList<Integer>();   foo(list_argument); //passing list_argument's reference by value   //list_argument contains 1 only }   Now, I'm reading  article about passing arguments in Python. In the article, it refers to a fancy name strategy called "passing by object", but to me it seems exactly the mechanism that I described above.  So, my question is: is there any difference the passing argument strategy between Python and Java?

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


So I have a function which shall return the variable "ergebnis" but only if the operator is "/" it shall also return the rest called "rest". How do I accomplish that?  unsigned int (unsigned int zahl1, unsigned int zahl2, char operat) {     unsigned int ergebnis;     unsigned int rest;     switch (operat)     {     case '+':         ergebnis = zahl1 + zahl2;         return ergebnis;     case '-':         ergebnis = zahl1 - zahl2;         return ergebnis;     case '*':         ergebnis = zahl1 * zahl2;         return ergebnis;     case '/':         ergebnis = zahl1 / zahl2;         rest = (zahl1 % zahl2);         return ergebnis, rest;     } }

Is there a preferred way to return multiple values from a C++ function?  For example, imagine a function that divides two integers and returns both the quotient and the remainder.  One way I commonly see is to use reference parameters:  void divide(int dividend, int divisor, int& quotient, int& remainder);   A variation is to return one value and pass the other through a reference parameter:  int divide(int dividend, int divisor, int& remainder);   Another way would be to declare a struct to contain all of the results and return that:  struct divide_result {     int quotient;     int remainder; };  divide_result divide(int dividend, int divisor);   Is one of these ways generally preferred, or are there other suggestions?  Edit: In the real-world code, there may be more than two results.  They may also be of different types.


I have an interesting problem.  I need to have one computer that drives around 30 (Thirty) monitors.  I have a very large room, and need each monitor to have the same thing on them.  I'm open to the idea of wireless since latency isn't a big issue.  Graphics quality doesn't have to be amazing either.  This will mostly be used for powerpoint, excel, word, Maybe some youtube videos at some point.  No sound is needed either.   The basic end goal is to have one computer on a projector that I am driving, and people who are sitting all around the room have monitors they can look at, and they all have the same thing on them.  Any advice on hardware is appreciated.

I need to connect 24 monitors to one PC. The requirement is to run different web browsers windows on each monitor for exhibition purposes.  Is there any way to accomplish this mission?   Does anybody know about some kind of splitter that makes this?


I have a CMD file from which I have to run a Powershell script passing in username and password: i.e: PowerShell -File "%1" -Computer "%2" -Username "%3" -Password "%4". Is there anyway to send a SecureString password from the CMD to the powershell script?  Let me add a few more points to make my predicament clearer: So whenever I execute this CMD file containing the above said Powershell command, I am passing in the values for all the parameters(%1% to %4%) on the command line. Now when I pass these arguments, they are passed in as clear text and everything is logged into the Events Monitor with ID 4688 with Advanced Auditing enabled. What I want is the password to not be visible in this case.

I have a Param block in my script   Param (     [Parameter(Mandatory=$True)]     [string]$FileLocation,      [Parameter(Mandatory=$True)]     [string]$password = Read-Host "Type the password you would like to set all the users to" -assecurestring )   Can I use the Read-Host CmdLet in a required Parameter field? if not what can I do to make sure I take in the correct type of variable type so I can pass it to a user creation process?


Is a continuous function differentiable at $x=c$ if the limit of its derivative has a value at that point? That is, if $$\lim_{x \rightarrow c} f'(x) = L = \lim_{x \rightarrow c^+} f'(x) =\lim_{x \rightarrow c^-} f'(x)$$ Intuitively, the slopes of the tangents approach the same value and since the function is continuous a jump-discontinuity isn't possible so it appears the slope at the point should be $L$ too. However, I cannot seem to locate such a theorem, so I suspect my intuition is wrong. Is it?

Let $f$ be a real-valued function continuous on $[a,b]$ and differentiable on $(a,b)$. Suppose that $\lim_{x\rightarrow a}f'(x)$ exists. Then, prove that $f$ is differentiable at $a$ and $f'(a)=\lim_{x\rightarrow a}f'(x)$.    It seems like an easy example, but a little bit tricky. I'm not sure which theorems should be used in here.    ==============================================================  Using @David Mitra's advice and @Pete L. Clark's notes I tried to solve this proof. I want to know my proof is correct or not.  By MVT, for $h>0$ and $c_h \in (a,a+h)$ $$\frac{f(a+h)-f(a)}{h}=f'(c_h)$$ and $\lim_{h \rightarrow 0^+}c_h=a$.    Then $$\lim_{h \rightarrow 0^+}\frac{f(a+h)-f(a)}{h}=\lim_{h \rightarrow 0^+}f'(c_h)=\lim_{h \rightarrow 0^+}f'(a)$$   But that's enough? I think I should show something more, but don't know what it is.


I tried searching for Macy's e-receipt by typing in Macy receipt on my Mac using Gmail, and the result came back in 1 second. (some of those emails were 1 month old, and another one 2 months old).  But when I tried that using the email app on iPhone with iOS 6.1.4, nothing came back, and I click "Subject", and I changed the keyword to Macy's e-receipt and clicked "Continue Search on Server..." and it just kept on turning the spinning wheel for 2 minutes and nothing came back.  And then I searched for and installed the Gmail app on the iPhone, and type in Macy receipt and the result came back in 1 second.  So how do I make the email app standard on iOS work like Gmail's search?

The search in iPhone's Mail.app doesn't find anything. The same problem exists on OS X.  When I search a word I usually get no results. It only works if the word is included in a recent email, let's say 1 or 2 weeks old.  Also, there is an option called "Search on the server". It never worked in the last 2 years.  Why is my search broken when using an Apple client to search Gmail?


The below code is changing the value of the list K automatically, please help me know why  1 4 1 2 4 3   I gave the above input  The output is this  [1, 2, 3, 4] [1, 2, 3, 4] 1 [1, 2, 3, 4] 2 1 1 [1, 2, 3, 4] 2 2 2 [1, 2, 3, 4] 2 3 4 [1, 2, 3, 4] 2 4 3 [1, 2, 4, 3] [1, 2, 4, 3] 1 [1, 2, 4, 3] 2 1 1 [1, 2, 4, 3] 2 2 2 [1, 2, 4, 3] 2 4 4 [1, 2, 4, 4] 2 4 3 [1, 2, 4, 4] [1, 2, 4, 4]   In the last steps the value of list k changed automatically.  This was done on PyPy 3 and python 3.7  t=int(input()) while t!=0:     t-=1     n=int(input())     h=[0]*n     lt=[0]*n     c=0     l=[int(i) for i in input().split()]     k=[i for i in range(1,n+1)]     print(k)     while c!=7:         print(k, end=" ")         print("1")         c+=1         for i in range(n):             print(k, end=" ")             print("2")             lt[l[i]-1]=k[i]             print(k[i],end =" ")             print(l[i])         k=lt         print(k)         for i in range(n):             if k[i]==l[i] and h[k[i]-1]==0:                 h[k[i]-1]=c     print(*h,sep=" ")

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


I've been having this problem where either me or my sister's NAT type is strict. We can't join in a party together because of it and I have no idea how to fix this. My router model is 3801HGV and it does not have any UPNP settings for it. So how would I make it so both of us can have open NAT type?

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


Evaluate $$\frac{1}{1}+\frac{1}{2}-\frac{2}{3}+\frac{1}{4}+\frac{1}{5}-\frac{2}{6}+\frac{1}{7}+\frac{1}{8}-\frac{2}{9}+\cdots+\frac{1}{3n+1}+\frac{1}{3n+2}-\frac{2}{3n+3}+\cdots$$  answer choices:  a) $\ln 2$  b) $\ln 3$  c) $e^2$  d) $\dfrac 9 {25}$  Looking at the answer choices, I am almost certain that we need to rearrange the sum into a Riemann sum, but I am stuck on how to do so. Also are there any general techniques to recognize/rearrange summations such as these into Riemann sums? This problem is from a competition, so I would need to solve these problems quickly. Thanks!

Was given the following infinite sum in class as a question, while we were talking about Taylor series expansions of $\ln(1+x)$ and $\arctan(x)$: $$1+\frac12-\frac23+\frac14+\frac15-\frac26+\cdots$$  The question isn't homework or anything, just a thought tease. I tried for a long while but couldn't find anything remotely close. Thanks in advance for the help.


How can I show that $$\lim_{n\rightarrow \infty} ((-n^x)/e^n)) = 0$$ , where n is a natural number and $x>0$? I wanted to use l'hôspital, but it doesn't work or rather not defined, if n is a natural number.

Find $\lim\limits_{n\rightarrow \infty} \frac{n^t}{e^n}$ where $t$ is a positive real number.   My answer is that the expression is indeterminate ($\frac{\infty}{\infty}$) but it will tend to $0$ because as $n$ gets large, the exponential term will dominate the polynonial term in the expression, so the expression will tend to $0$ as $n$ gets large. This answer is also the same as the solution provided in my text.  But I am wondering what is the actual workings to solve this? I'd know to because I want to be familiar with all the tricks to solve limits where the expression is indeterminate.


Question is to Evaluate $$\sum_{n=1}^{\infty}\arctan (\frac{2}{n^2})$$  What I have done so far is i tried taking sequence of patial sums.  $S_1=\arctan (\frac{2}{1})$  $S_2=\arctan (\frac{2}{1})+\arctan (\frac{2}{2^2})=\arctan 2+\arctan (\frac{1}{2})$  $\tan S_2=\tan(\arctan 2+\arctan (\frac{1}{2}))=\frac{***}{1-2.\frac{1}{2}}=\frac{***}{0}\Rightarrow S_2 =\frac{\pi}{2}$  Now there is a problem for $S_3$  $S_3=\arctan (\frac{2}{1})+\arctan (\frac{2}{2^2})+\arctan (\frac{2}{2^3})=\frac{\pi}{2}++\arctan (\frac{2}{2^3})$  I can not apply $\tan$ function on both sides as this would again give me :  $\tan S_3=\tan(\frac{\pi}{2}+\arctan (\frac{2}{2^3}))=\frac{\infty+**}{1-\infty**}$ which does not makes much sense.  I would be thankful if some one can help me with this.  Thank you.  P.S : I would be thankful if some one can suggest me another way to solve this than that of the originally posted solution in quoted duplicate...

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


Say I have the following:  template <typename... A> class MyClass { public:      void func(A... args)     {         // do stuff     } };   What I really want is for func() to take l-value references, so something like this:  template <typename... A> class MyClass { public:      void func(std::remove_reference<A>::type&... args)     {         // do stuff     } };   This doesn't compile; is this sort of thing possible? Thanks.

In templates, where and why do I have to put typename and template on dependent names? What exactly are dependent names anyway?    I have the following code:  template <typename T, typename Tail> // Tail will be a UnionNode too. struct UnionNode : public Tail {     // ...     template<typename U> struct inUnion {         // Q: where to add typename/template here?         typedef Tail::inUnion<U> dummy;      };     template< > struct inUnion<T> {     }; }; template <typename T> // For the last node Tn. struct UnionNode<T, void> {     // ...     template<typename U> struct inUnion {         char fail[ -2 + (sizeof(U)%2) ]; // Cannot be instantiated for any U     };     template< > struct inUnion<T> {     }; };   The problem I have is in the typedef Tail::inUnion<U> dummy line. I'm fairly certain that inUnion is a dependent name, and VC++ is quite right in choking on it. I also know that I should be able to add template somewhere to tell the compiler that inUnion is a template-id. But where exactly? And should it then assume that inUnion is a class template, i.e. inUnion<U> names a type and not a function?


I'm putting a diamond symbol at the of a remark by use of  \usepackage{amsthm} ... \newenvironment{rem}{\begin{remark}}{\hfill$\diamond$\end{remark}}  However when the rem environment is finished with a math display mode, the diamond will be placed at the end of a new line. I would prefer that it is placed on the line of the equation. How is this possible?

What is the etiquette to denote the end of an example or remark? For proofs, it's the QED symbol (white box). I know it's not necessary for everyone, but I would like to use it to break up the text a little. What should I use? A circle or filled box or what?


I know that euler's identity state that $e^{ix} = \cos x + i\sin x$  But e is a real number. What does it even mean to raise a real number to an imaginary power. I mean multiplying it with itself underoot $-1$ times? What does that mean?

Could you provide a proof of Euler's formula: $e^{i\varphi}=\cos(\varphi) +i\sin(\varphi)$?


Im looking to dual boot my computer with Windows 10. Im currently running Ubuntu 16.04 LTS. How would I go about doing this? Thanks.

I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only!


I am a new GM playing Pathfinder. I am curious about perception. How can I have the players roll for perception without making them really suspicious? For example, if a trap is in the middle of a room and they fail to perceive it, then they know something is up and probably would be super careful, even though they really didn't notice the trap. Thanks in advance!

This applies to all d20 systems, but with an example from the from the Pathfinder  (emphasis mine):  Stonecunning: Dwarves receive a +2 bonus on Perception checks to potentially notice unusual stonework, such as traps and hidden doors located in stone walls or floors. They receive a check to notice such features whenever they pass within 10 feet of them, whether or not they are actively looking.  In this case, does the GM roll the check in secret or ask the player roll the check? If the GM asks the player to roll for the check, what stops situations like:  GM: (interrupting) "Gimli, Roll a perception check." Dwarf player: "Oh, it's a natural one, I guess I don't see anything." Human player: "Okay, I'll roll a perception check for anything unusual in this room. Nice! 19. How about 19, does 19 work for you?" GM: "Gimli, everything looks kosher to you. Aragon, you notice a rock coloured tarp on the ground here, covering what looks like a pit trap."  In this case, by telling the dwarf to roll his "free" perception check, he's telegraphed to the players that there is something to notice. How can this be fixed, without bluffing checks for nothing in particular to throw off the signal to noise ratio of similar checks?


The explanations about Shannon's theorem speed up all of a sudden when they should tell us why he introduced the log term. They usually range from 'it's useful' to 'it's because there are two choices, then log2 is suitable'. Am I right in thinking that what the log does is 'give a context' to the probability you are measuring the entropy of? If 0.125 was one of two outcomes it's different than if it was one out of ten. Hence, choosing different logs puts this specific option (0.125) in the right ballpark. Am I correct? And is there a more formal proof for this (maybe for the use of log in probability in general). thanks!

I have bumped many times into entropy, but it has never been clear for me why we use this formula:  If $X$ is random variable then its entropy is:  $$H(X) = -\displaystyle\sum_{x} p(x)\log p(x).$$  Why are we using this formula? Where did this formula come from? I'm looking for the intuition. Is it because this function just happens to have some good analytical and practical properties? Is it just because it works? Where did Shannon get this from? Did he sit under a tree and entropy fell to his head like the apple did for Newton? How do you interpret this quantity in the real physical world?