We have some accounts that start with "Business". And we already recorded their information in custom fields in the account object. Business first name, business last name, and email respectively. How can I build an automation to create a contact for that account? I followed steps in the picture. When I activate the process, the contact is created; however, I receive the email Error Occurred During Flow. DUPLICATES_DETECTED: You're creating a duplicate record.

I'm playing with a trigger exercise, that consists of creating a trigger to create 10 Opportunities whenever a account with more than 100 employees are created. I made the following: trigger AccountTrigger on Account (after insert) {     List<Contact> Contacts = new List<Contact>();     for (Account acct : Trigger.new){                for(integer i = 0; i < 2; i++){             Contact cont    = new Contact();             cont.LastName   = acct.Name+ i;             cont.AccountId  = acct.Id;             Contacts.add(cont);         }         insert Contacts;      if (acct.NumberOfEmployees > 99){         List<Opportunity> Opportunities = new List<Opportunity>();         for(integer i = 0; i < 10; i++){             Opportunity opp = new Opportunity();             opp.Name        = acct.Name + i;             opp.CloseDate   = system.today()+ 30;             opp.StageName   = 'Open';             opp.AccountId   = acct.Id;             Opportunities.add(opp);         }         insert Opportunities;     }                      }  }   And I'm getting the following error: execution of AfterInsert caused by: System.DmlException: Insert failed. First exception on row 0; first error: DUPLICATES_DETECTED, Use one of these records?:  I didn't created any, or changed the dupe rule of account neither Opportuinities. Can you help me understand what kind of error is this? And how can I change the trigger to workaround it? Thanks in advance!!


I would like to know how I can get back the 'Add ' menu which disappears after performing any action.  I tried F9 key, F6 key and T key which I knew after some Googling but they didn't dork.  I'm using Blender 2.80.

When you first add a cylinder, you have the option to change the number of vertices, etc, but once you do anything else in blender, it seems you no longer can edit those parameters.   Is there a setting anywhere or an add-on that allows these parameters to be edited later on? If not, how easy would such an addon/feature be to create for anyone reading this?


I have a string like like:  Hello +++this--- is a funny +++string--- with words inside   I need to look for words surrounded by +++ and --- and replace the +++ and --- signs with html tags like word.  So that the text above becomes:  Hello this is a funny string with words inside   I'm currently using the following regex with a sub instruction:  rgx = re.compile(r'(?:\+\+\+)(?P<word>.+)(?:\-\-\-)') output = rgx.sub('\\g<word>')   And the output I get is:  Hello this--- is a funny +++string with words inside   As you can see, only the first and last +++/--- are taken into account. The ones in the middle seems to be ignored. Obviously the big string between first and last +++/--- match my regex.  How can I get re to match all groups one by one, and not consider the big overlapping match?  Note: I've tried with ^\+ and ^\- in the capturing group, but it doesn't work because a + or - could be in any word and should be kept as is, as long as it's not +++ or ---.

I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?


I’m working on a video in which photographs inside picture frames come to life but I do not know how to control the playback of the video textures. I already have the video texture loaded in the picture frame. Right now it plays immediately when I start playback in Blender. Here’s what I want to do. I have the camera animated to approach the photo.  Until the camera reaches it, the video texture is “paused” on the first frame. When the camera focuses on the photo, I want the video texture to play. Finally, I want to pause the video on the last frame. The camera then moves over to another picture frame and the process repeats. What is the best way to do this in Blender. Thank you!

I'm trying to do some scenes which use a mixture of 3D backgrounds with 2D animated characters.The best way I've figured this out so far is to use a plane with an image sequence of pngs which hold the frames.  The problem with this method is Blender seams to only load image sequences based on image numbering. If I wanted to do a sequence which loops say, frames 0-5, then repeats 4-0 for the 'return' of the animation, I would have to load frames doubled up.  Is there a way, maybe with a script, to change the sequence order? I can see it as a useful plugin but my python skills are pretty much non existent.


I have built a binomial regression model using the equation: logit_1 <- glm(past_adl_binary~., family = binomial(link = "cloglog"),                 data = newdata)  The outcome of the model is as follows:  Can anyone help me interpret the outcome of this model? I understand that all of the coefficients are significant apart from sunangle. Can I use this equation (100*exp(parameter estimate)-1) to calculate the increase/ decrease in percent probability of my y-variable (1 or 0) changing based on my predictor variables?  For example, for habitat_categoryONDEEP: 100*(exp(-0.173)-1) = -15.886.  Would this suggest that a habitat category of ONDEEP decreases the probability of my y-variable being 1 by 15.9%, compared to the reference category?

I'm quite new on this with binomial data tests, but needed to do one and now I´m not sure how to interpret the outcome. The y-variable, the response variable, is binomial and the explanatory factors are continuous. This is what I got when summarizing the outcome:  glm(formula = leaves.presence ~ Area, family = binomial, data = n)  Deviance Residuals:  Min      1Q  Median      3Q     Max   -1.213  -1.044  -1.023   1.312   1.344    Coefficients:                         Estimate Std. Error z value Pr(>|z|)  (Intercept)           -0.3877697  0.0282178 -13.742  < 2e-16 *** leaves.presence        0.0008166  0.0002472   3.303 0.000956 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  (Dispersion parameter for binomial family taken to be 1)  Null deviance: 16662  on 12237  degrees of freedom Residual deviance: 16651  on 12236  degrees of freedom (314 observations deleted due to missingness) AIC: 16655 Number of Fisher Scoring iterations: 4   There's a number of things I don't get here, what does this really say:                          Estimate Std. Error z value Pr(>|z|)  (Intercept)           -0.3877697  0.0282178 -13.742  < 2e-16 *** leaves.presence        0.0008166  0.0002472   3.303 0.000956 ***   And what does AIC and Number of Fisher Scoring iterations mean?  > fit Call:  glm(formula = Lövförekomst ~ Areal, family = binomial, data = n)  Coefficients: (Intercept)        Areal   -0.3877697    0.0008166    Degrees of Freedom: 12237 Total (i.e. Null);  12236 Residual (314 observations deleted due to missingness) Null Deviance:      16660  Residual Deviance: 16650        AIC: 16650   And here what does this mean:  Coefficients: (Intercept)        Areal   -0.3877697    0.0008166


Since you can't modify player nbt data with /data modify, I had to think of a workaround.  I thought to use /data modify to copy a player's helmet into a chest, modify the item there, and replace it back on the player.  So, while wearing a helmet, I tried:  /data modify block 31 241 16 Items[] set from entity @p Inventory   Unfortunately, this doesn't copy over the players armor items, offhand, or 3rd inventory row. It only copies their hotbar and first 2 inventory rows.  Then, I tried:  /data modify block 31 241 16 Items set from entity @p Inventory[{Slot:103b}]   This didn't work. (By the way, slot 103 is the player's head slot) And to be sure:  /data modify block 31 241 16 Items[{Slot:0b}] set from entity @p Inventory[{Slot:103b}]   But no items appeared in the chest, even though I was wearing a helmet. However, this command works fine with item in my first hotbar slot:  /data modify block 31 241 16 Items[] set from entity @p Inventory[{Slot:0b}]   So I assume that /data modify just can't copy anything from a player's armor slots.  If that's the case, is there any way to modify a player's armor data?

I'm wondering about whether it is possible to change part of an NBT or add NBT to an item that a player is holding. My goal is to make custom enchants. For example when a player uses an item to enchant a sword they get the score "EnchantMight" 5, which would cause the next weapon they hold to get "Might V". This, in reality, would just be +5 additive damage in the NBT. I know /replaceitem would be an option, but that only works if the new item is predetermined. I hoped /data modify entity @p {SelectedItem:[{AttributeModifiers:[{AttributeName:"generic.attack_damage",Amount:5,Operation:0,UUID:[I;-120919,1237,151734,-2474],Name:"generic.attack_damage"}]}]} insert/append/merge  would work, but obviously it didn't. If anyone even just has an idea I can try out, it'd be of help. If you give a datapack related answer, please explain clearly as I don't know a lot about it.


Let $\left \{ X_r \right \}^\infty _{r=1} $ be a sequence of independent and identically distributed uniform on $[0,1]$ random variables. Let $0<x<1$ and define $$N(x) = \min \left \{ n \ge 1: X_1 + \cdots + X_n>x\right \}$$ (a) Show that: $$\mathbb{P}(N(x)>n)=\frac{x^n}{n!}$$ Recall that the moment generating function of a random variable $Y$ on the non-negative integers $\left\{0,1,2,...\right\}$ is defined by:$$\mathbb{E}[t^Y] = \sum ^\infty _{n=0} t^n \mathbb{P}(Y=n)$$ (b) Show that: $$\mathbb{E}[t^{N(x)}]=(t-1)e^{tx}+1$$ I am quite lost as to where to start. The only intuition I have would be that for part (a), that $$P(X_1>x)=1-x \\ P(X_1+X_2>x)=1-\frac{x}{2}\\ \vdots\\P(X_1+\cdots+X_n>x)=1-\frac{x}{n}$$and we can notice that $$\frac{x^n}{n!}=x \cdot \frac{x}{2}\cdot \cdots \cdot\frac{x}n$$ so I think that might be related but other than that I'm stuck

Show that: $$P(N(x)>n)= \frac{x^n}{n!}$$ I was thinking that we can take $X_1+...+X_n$ to be a single random random variable $S_n$ and that the $n$ in the $P(N(x)>n)$ is not the same as the $n$ in the definition of $N(x$). But unsure how to actually start proceeding to prove this. Any help appreciated, thank you.


I have noticed that sometimes when you submit an article to a journal it will ask if there is someone in particular who you do not want to referee the paper.  I was wondering what the reason for this option was.  Is it simply to avoid a conflict of interest or if you really do not get on with the person to the point where you do not wish them to review something you have written?  If you put someone down as someone you do not want to be a referee, will the journal think you are scared of that person's critical appraisal of the document and actually send it to that person or will they genuinely avoid sending it to that person for review?

I am about to submit a paper, and I'm asked whether I want anybody to be excluded from consideration as a reviewer. I also need to state a reason. I briefly considered listing someone who - I have reasons to believe - once reviewed a paper of mine by listing criticisms that were unspecific enough that I spent a very large amount of time just trying to figure out what they meant. Of course my guess could be wrong, and it seems unfair to label someone as a suboptimal reviewer based on a hunch. Which led me to wonder - what are some good reasons for asking for exclusion of a reviewer? And additionally, what would polite wordings be for each of these reasons?


Recently I logged myself as a different user (testUser) but now that user seems to be persisted in the drop-down menu of connection dialogue box and I couldn't find a way of getting rid of it. Even worse, it seems to be the default login as whenever I change my connection I have to go to the drop-down menu and choose my usual user otherwise the connection will be made in testUser's context. How can I get rid of testUser from connection dialogue box? Thank you.

How can I force SSMS to forget the recently used logins?  Of course I use "SQL Server Authentication" with Login/Password fields.  (It get's annoying, as everytime I open SSMS it shows the "Connect to Server"-Dialog, with a login preselected that is not valid anymore.)  Didn't find any option, and no info here.  Thank you.


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

The elements of $A_n$ is either of the form $(a,b,c,...)...$ or of the form $(a,b)(c,d)...$  In both cases, the element is a product of an even number of transpositions, not pairwise disjoint in the first case. I thought I would just show that any product of two transpositions is a product of two 3-cycles.  Consider the first case and let $\sigma = (v_1,v_2)(v_2,v_4)$ be one of the several products of two transpositions. Since $\sigma = (v_1,v_2,v_4) = (v_1,v_4,v_2)(v_1,v_4,v_2)$ showing that the product of two $\textit{not}$ disjoint transpositions is a product of two 3-cycles. Since the elements from the first case are all odd cycles, they can be expressed as a product of an even number of transpositions $\textit{not}$ pairwise disjoint. Thus the argument presented above could be done with all pairs of transpositions for the entire cycle.  Consider the second case and let $\sigma = (v_1,v_2)(v_3,v_4)$ again be one of the several products of two transpositions, this time disjoint. Clearly $\sigma = (v_1,v_3,v_2)(v_1,v_3,v_4)$, so I have shown that the product of two disjoint transpositions is a product of two 3-cycles. The elements from the second case are products of an even number of disjoint transpositions, so this second argument could be done for all those pairs.  This should cover all possible cases of elements in $A_n$ and thus it's generated by 3-cycles.  EDIT#1: Changed the argument to account for products of transpositions which are not disjoint.


I want the do the following code on linux kernel (32 bit processor):  #define UQ64 long long int #define UI32 long int  UQ64 qTimeStamp; UQ64 qSeconds; UI32 uTimeStampRes;  qTimeStamp = num1; uTimeStampRes = num2;  // 64 division ! qSeconds = qTimeStamp / uTimeStampRes;   There is an algorithm to calculate the 64 division ? Thanks.

Some code that rounds up the division to demonstrate (C-syntax):  #define SINT64 long long int #define SINT32 long int  SINT64 divRound(SINT64 dividend, SINT64 divisor) {   SINT32 quotient1 = dividend / divisor;    SINT32 modResult = dividend % divisor;   SINT32 multResult = modResult * 2;   SINT32 quotient2 = multResult / divisor;    SINT64 result = quotient1 + quotient2;    return ( result ); }   Now, if this were User-space we probably wouldn't even notice that our compiler is generating code for those operators (e.g. divdi3() for division). Chances are we link with libgcc without even knowing it. The problem is that Kernel-space is different (e.g. no libgcc). What to do?  Crawl Google for a while, notice that pretty much everyone addresses the unsigned variant:  #define UINT64 long long int #define UINT32 long int  UINT64 divRound(UINT64 dividend, UINT64 divisor) {   UINT32 quotient1 = dividend / divisor;    UINT32 modResult = dividend % divisor;   UINT32 multResult = modResult * 2;   UINT32 quotient2 = multResult / divisor;    UINT64 result = quotient1 + quotient2;    return ( result ); }   I know how to fix this one: Override udivdi3() and umoddi3() with do_div() from asm/div64.h. Done right? Wrong. Signed is not the same as unsigned, sdivdi3() does not simply call udivdi3(), they are separate functions for a reason.  Have you solved this problem? Do you know of a library that will help me do this? I'm really stuck so whatever you might see here that I just don't right now would be really helpful.  Thanks, Chad


I'm not sure trig identity to use. Would we use $1+\cot^2(x) = \csc^2(x)$? I know that we break down into $\csc^2(x)$ and $\csc(x)$. Could I get hints?

I found these step which explain how to integrate $\csc^3{x} \ dx$. I understand everything, except the step I highlighted below.  How did we go from: $$\int\frac{\csc^2 x - \csc x \cot x}{\csc x - \cot x}\,dx%$$ to  $$\int \frac{d(-\cot x + \csc x)}{-\cot x + \csc x} \quad?$$  Thank you for your time! $$ \int \csc^3 x\,dx = \int\csc^2x \csc x\,dx$$ To integrate by parts, let $dv = \csc^2x$ and $u=\csc x$. Then $v=-\cot x$ and $du = -\cot x \csc x \,dx$. Integrating by parts, we have: $$\begin{align*} \int\csc^2 x \csc x \,dx &= -\cot x \csc x - \int(-\cot x)(-\cot x\csc x\,dx)\\ &= -\cot x \csc x - \int \cot^2 x \csc x\,dx\\ &= -\cot x\csc x - \int(\csc^2x - 1)\csc x\,dx &\text{(since }\cot^2 x = \csc^2-1\text{)}\\ &= -\cot x \csc x - \int(\csc^3 x - \csc x)\,dx\\ &= -\cot x\csc x - \int\csc^3 x\,dx + \int \csc x\,dx \end{align*}$$ From $$\int \csc^3 x\,dx = -\cot x\csc x - \int\csc^3 x\,dx + \int \csc x\,dx$$ we obtain $$\begin{align*} \int\csc^3x\,dx + \int\csc^3 x\,dx &= -\cot x \csc x + \int\csc x\,dx\\ 2\int\csc^3 x\,dx &= -\cot x\csc x + \int\csc x\,dx\\ \int\csc^3x\,dx &= -\frac{1}{2}\cot x\csc x + \frac{1}{2}\int\csc x\,dx\\ &=-\frac{1}{2}\cot x\csc x + \frac{1}{2}\int\frac{\csc x(\csc x - \cot x)}{\csc x - \cot x}\,dx\\ &= -\frac{1}{2}\cot x \csc x + \frac{1}{2}\int\frac{\csc^2 x - \csc x\cot x}{\csc x - \cot x}\,dx\\ &= -\frac{1}{2}\cot x \csc x + \frac{1}{2}\int\frac{d(-\cot x+\csc x)}{-\cot x +\csc x}\\ &= -\frac{1}{2}\cot x\csc x + \frac{1}{2}\ln|\csc x - \cot x|+ C \end{align*}$$


I'm creating a server for me and my friends at school so we can link and have fun together. I already created the server and everything, but they can't link if my server doesn't have a name!    How do I name it!?

I'm setting up a minecraft server for just myself and friends. I'm using the official server (on windows) from minecraft.net I got it all up and working but I'm curious how to change the Server Name. It looks like before 1.8.1 you could just add server-name=my server to the server.properties file, but now that doesn't seem to work. Googling didn't seem to return any helpful results, is it possible to change the server name and not just the MoTD?


I'm facing a scenario, where if the input is 10, I want a sequence of numbers (1,2,3,...10).  In oracle the level function provides that function, and I wish to know how to perform the same task in MySQL.   Thanks...

Is there a way to generate an arbitrary number of rows that can be used in a JOIN similar to the Oracle syntax:  SELECT LEVEL FROM DUAL CONNECT BY LEVEL<=10


A manifold $M$ is said to admit a field of tangent $k$-planes if its tangent bundle admits a subbundle of dimension $k$. How do I see that $\mathbb{RP}^4$ and $\mathbb{RP}^6$ do not admit fields of tangent $2$-planes?

See the related question . This is the second part of question 4-C in Milnor and Stasheff's book on characteristic classes. In the solution to the first part, we rely on the fact that having a field of tangent $1$-planes allows us to split the tangent bundle into a direct sum. It doesn't seem like this should be true for a field of tangent $2$-planes (otherwise the question wouldn't just be asking about $P^4$ and $P^6$), so I'm not sure exactly where to start.  edit: actually, since $P^n$ can be given a Riemannian metric, any subbundle should be a Whitney summand; this doesn't answer the question as to why they only ask for $P^4$ and $P^6$ though, so I'm still confused.


I make bulk pinto beans as follows: Soak beans overnight in salty water Cook until tender, adding chopped onion and Serrano pepper Drain completely, place onto baking sheet to cool (~100F, this takes about 15 min) Place baking sheet in freezer until cold, then place into ziploc bag Okay, pretty normal. I can't really do anything more with the temperature aspect. However, within 3 days the beans have a noticeable, but somewhat faint, farty odor when I open the bag. I usually just mix them cold with freshly cooked rice, which immediately brings them up to temp. I'm only on the fourth day now and I can smell fart just from the beans in my stomach! Is this normal? What can I change to make them last a bit longer. I suppose I could just freeze them but I'd like to hear from those more knowledgeable about the fermentation process.

How do I know if a given food or ingredient I have is still good, or if I should discard it?  How can I best preserve a food or ingredient?     This broad question is intended as a "general reference" question to quickly answer many how long will food keep for? questions. Please feel free to edit this question to expand and clarify as needed.


What is baking used for? How does it help me?   It's a simple question and I don't understand why this site gives me such a hard time trying to ask anything.

I want to make some cool items for Dota 2 and I'm reading a guide. There are some tips about baking  etc. but I can't use them, because I don't even know what baking means. Can somebody explain this, please?  Thanks for all answers.


I would like to network a farm building which is 500' from my house. There are lots of trees between the two, so I doubt that wifi would work. 300' is the max length for Cat 5 ethernet cable.  What are my options? I could have a small solar panel and battery at the other end for power, but I don't have mains power there.  If there is a cabled solution I can trench to there and run cable through conduit.

As the title suggests, I have some kit which is 200m from our current infrastructure (outdoors).  What is the cheapest way to establish a reliable connection across a 200m stretch (Cat 5e ethernet only works up to about 100m from our tests)?


If you roll 5 standard 6 sided dies, what's the probability that you will get at least three 2s?  I imagine it would be 1 - P(0 twos) - P(1 two) - P(2 twos), but I don't know how to calculate the probability of these.

I want to calculate the probability distribution for the total of a combination of dice.   I remember that the probability of is the number of combinations that total that number over the total number of combinations (assuming the dice have a uniform distribution).   What are the formulas for   The number of combinations total The number of combinations that total a certain number


I used following code to insert some buttons inside different table rows:  $('#' + data.Symbol).append('<button id="deletestock' + data.Symbol + '" type="submit" class="btn btn-default"></button>	');   And then when I tried to set an onclick listener to these button, they didn't work, my code of listener is as follow:  $(function(){ $('button').on('click', function(event){      alert(this.id); }); });   Could you please help me with this? Thank you so much!

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.


Let $V$ be a finite dimensional vector space over $k$ and $A = \text{End}_k V$. How do I see that $V$ is a simple $A$-module?

Let $V$ be a finite-dimensional vector space over $k$ and $A = \text{End}_k V$. Is $V$ a simple $A$-module?


I'm using Windows 8.1 64-bit, have 16gb of physical memory, and I understand why Windows wants to do this, but my specific case is really odd and annoying.  For some reason, on occasion, when I open a several GB file once - even if it's only once in the lifetime of the file and only for a few minutes, even if it's just a video file - it puts that file into "Standby (Physical) memory", putting my physical memory usage over 80% - sometimes over 90%. The worst part is, is that the file never gets removed automatically - I have to either restart, or use RAMMap to clear it out.  I understand why Windows manages memory the way it does, and that memory is meant to be used - however this is a bit of a problem for me since it never seems to clear these files out of standby on its own - and my performance suffers a significant amount as a result. I have an adequate page file on my SSD, my ram doesn't have any errors - my issue is just that Windows is predicting the wrong files I need to keep in physical memory, and not removing them after I close the file.  Edit / Update:   Superfetch is disabled and has been for months. The pagefile is on an SSD. Process Explorer, RamMap, and HWiNFO all point towards these one time short use meaningless files being in StandBy, not in active memory (As shown in RamMap). When these files are removed from Standby - the physical memory usage goes down according to the tools listed above. My system doesn't 'think' it needs ram, and that's the exact issue at hand - it does need ram, and it's not clearing out the files using Standby memory unless I do it manually. As I said above, my memory usage can get to over 90% and sluggish, and not remove files Windows only needed once in the entire life of the file - instead preferring to remove files still needed in memory.   In summary: Windows is keeping files it doesn't need in memory, and removing files it does need when it asks for more ram. Why is this happening, and how do I fix it?  I'm not sure who marked this as a duplicate question, but the linked "duplicate" has nothing to do with my issue.

The "Resource Monitor" tool of Windows 7 shows me a typical memory map like in the screen shot above. What are the orange colored modifed and blue colored standby regions in this graphic? What exactly are their functions?


Number of permutations of AAABBBCCC such that no two A's or B's or C's together

Make sequence of $9$ balls from 3 red, 3 blue, 3 green, in such a way that no two balls of the same colour are next to each other. In how many different ways can you do this? (symmetric arrangements must be counted only once).  To start with, all possible arrangements are $9! = 362880$.


Recently, I played a warlock in a 5e one-shot. We were playing at level 7 and I was a Pact of the Blade warlock with the Fiend patron. As a Fiend Warlock, I have a feature called "Dark One's Blessing", :  Starting at 1st level, when you reduce a hostile creature to 0 hit points, you gain temporary hit points equal to your Charisma modifier + your warlock level (minimum of 1).  The description of the Armor of Agathys spell reads:  A protective magical force surrounds you, manifesting as a spectral frost that covers you and your gear. You gain 5 temporary hit points for the duration. If a creature hits you with a melee attack while you have these hit points, the creature takes 5 cold damage. At Higher Levels. When you cast this spell using a spell slot o f 2nd level or higher, both the temporary hit points and the cold damage increase by 5 for each slot level above 1st.  The situation was that there was a pack of 'minions' (4th-edition term, I know... but they were low-AC 5 hp monsters that died in 1 hit most of the time) attacking my group. The dragonborn wizard knew Fly, and grabbed the halfling and flew out of reach of the group of minions; I was left there with Armor of Agathys cast on me at level 4, so I had 20 temp hp and did 20 damage to each minion. The question comes from the functionality of Temp HP (THP)... It does not stack. Instead, you must choose which set to acquire, either keeping the THP you currently have or using the new number provided by whatever is trying to give you more THP. Once I was below 20 THP from the attacks made on me by this swarm of minions, I started taking the 10 (warlock level + CHA mod= 7+3) THP provided by Dark One's Blessing. After rereading Armor of Agathys today, I noted it says 'while you have these hit points'... leading me to believe that choosing to take the 10THP from Dark One's Blessing would remove the Armor of Agathys and its damaging capability. TL;DR Does Armor of Agathys only work if you have THP from the spell specifically, or does it still work if you gain more THP from another source (like from Dark One's Blessing) while the spell is still active?

The spell Armor of Agathys states:      You gain 5 temporary hit points for the duration. If a creature hits you with a melee attack while you have these hit points, the creature takes 5 cold damage.   Now, assume my buddy uses Inspiring Leader to give me 10 temporary hit points — does the effect end?


I'm having a problem understanding the relationship between TikZ line width and its relation to tikzpagenodes.sty. (MacTeX2017, updated in the last week.) When I use tikzpagenodes.sty as shown below, the resulting line is drawn indented by the line width, which in turn causes an overfull \hbox by the amount of the line width. The problem goes away if I use remember picture,overlay but that puts the line immovably where I don't want it.  I'm sure I've missed something basic.  \documentclass{article}  \usepackage{tikzpagenodes}  \begin{document}  \parindent0pt  \noindent \begin{tikzpicture}[remember picture,overlay] \draw[line width=18pt] (current page text area.north west) -- (current page text area.north east); \end{tikzpicture}  \vspace{0.15in}  $\uparrow$ With \verb+\draw[remember picture,overlay]+   \vspace{0.5in}  $\leftarrow$ Left margin. With \verb+\draw[]+ $\downarrow$  \noindent \begin{tikzpicture}[] \draw[line width=18pt] (current page text area.north west) -- (current page text area.north east); \end{tikzpicture}   \end{document}

In the following example the double line is shifted a bit to the right:  \documentclass[12pt]{article} \usepackage{tikz} \begin{document} \begin{tabular}{ll} \tikz[baseline=-0.5ex]\draw[thick](0,0)--(3ex,0);&test\\    \tikz[baseline=-0.5ex]\draw[thick,double](0,0)--(3ex,0);&test\\  \end{tabular} \end{document}     Looks like a bug to me, but how can I correct it?   Addition  The shift gets larger with larger double distance values.


I pre-ordered the physical game but it won't arrive until April 1, 2014...  The CSR said a code is bundled with the game.  I don't know if this is true or they're just misinformed.  Elsewhere I read that any copy of Reaper of Souls activated before March 31, 2014 will receive the wings.  So if I go to the store and buy it, activate it, is it all just the same?

Procrastination caused me to only reserve my copy of Diablo 3: Reaper of Souls this morning at Best Buy. I'm not sure this will count as a preorder by which I can earn preorder loot. How does Blizzard determine what constitutes a Diablo 3: Reaper of Souls preorder?


I want to create a shortcut of a folder on my desktop and I want to do it with the option of "make link" which is not there when I right-click on the folder. I don't want to use billion of commands on the terminal to do it. In another threat someone said that "make link" option is not visible by default and I have to set it in some options. How can I do that?

I just upgraded to Ubuntu 17.10 but all my desktop shortcuts are gone.  There is no longer a Create Shortcut option when I right-click either.   How do I add these now?


I used dual boot Windows 7 and Ubuntu 12.04. And I want to remove Ubuntu from my PC. I tried   And I have two problems:   After I deleted my Linux partition, I tried to expand other spaces. When I clicked on them, the "extend volume" option was passive. I don't have the Windows installer disc, so I tried to create a Windows repair disc. But when I clicked "create disc" button, I got an error message. It said that "there is no media in the device."

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


I have the following script that I run on Console mode in Chrome to automatically click on some buttons on the webpage. But I want to add a delay after each click so that it won't click all buttons at once. Please let me know how to proceed.     [].slice.call(document.querySelectorAll('.button')).forEach(function(button) {button.click();});

Is there any JavaScript method similar to the jQuery delay() or wait() (to delay the execution of a script for a specific amount of time)?


I am learning regular expressions and as aa practice I tried grep'ing an ip address but it fails to get any results. I tried it out on VSCode and it works. Anyone can enligheten me where did I go wrong? echo 192.168.1.1 | grep -e '\d+\.\d+\.\d+\.\d+'

Given a file, "test.log" with the following contents:  line1 Patient 123 45566 line2 Patient 432 line3 Patient 234 456 line4 Patient 321 line5   I am trying to select line 2 and line 4 with this pattern:  grep "Patient\s\d+\s" test.log # but this works testing at https://rubular.com/   Doesn't work nor does this:  grep "Patient\s\d+\n" test.log # but this works testing at https://regexr.com/47qd5   What am I doing wrong?


I'm changing a field in my lightning component and handle the change with a default lightning change handler. I can not make use of  since I'm in a loop,  (already created )  <aura:iteration items="{!v.values}" var="value">     <ui:inputNumber change="{!c.numberChanged}" value="{!value}" /> </aura:iteration>   In my controller I'm now trying to handle that change. But to do so, I need the the old field value. Is there anything in the retrieved event object, that contains this information? I digged deeper into the event methods and tried to output whatever I found, but there was nothing useful. Is the event technology documented somewhere in detail?  numberChanged: function(cmp, evt, helper) {     console.log(evt.getEventType());     console.log(evt.getType());     console.log(evt.getName());     console.log(evt.getPhase());      console.log(evt.getSource());     console.log(evt.getSource().getEvent());     console.log(evt.getSource().toString()); },   Output:        COMPONENT   ui:change   change   bubble   -   [Object with a few methods]   null   SecureComponentRef: markup://ui:inputSmartNumber {3765:949;a}{ key:    {"namespace":"MY_NAMESPACE"} }      3765:949 seems to be an internal identifier, it's not the numbers I changed.    EDIT1: since I found , it feels like there is more information behind the getSource(), but where is it documented?    EDIT2: Added more information to make clear why <aura:handler name="change" ...> won'work

Is there a way to catch the change event of a particular field/component? I saw on the AuraDocs that there is a valueChange event but trying to handle it makes the app throw an error on load. I was wondering if I could build some automatic field validation / search suggestions without relying on other js libraries.


I know that apt-get ( as in sudo apt-get install vim) stores downloaded packages in /var/cache/apt/archives. However, when using apt (as in sudo apt install vim) instead, there are no packages stored in /var/cache/apt/archives.  Where does apt store packages?

I know that packages installed with apt-get are stored in /var/cache/apt/archives.  I just installed mariadb server in Ubuntu 16.04 with following command:  sudo apt install mariadb-server   When I tried to find packages in /var/cache/apt/archives, there are no packages. Where are they stored if it's not in this directory?


I have to create a global variable.  this variable is initialized in the main after an input parameter is passed and then I want to make it available everywhere in the code without passing it in the init of the different objects.  global pulse def main(shot_no,...):     pulse = shot_no       #create object     signal = Data(constants)     print('here')     print(pulse)       success = signal.read_data(shot_no,...)   within the class Data pulse is defined in the init as global.  Data is a class inherited from another and also in this one I define in the init pulse as global  I get an error "NameError: name 'pulse' is not defined"  any help?  the answer   doens't answer my question (as a matter of fact there is no actually an answer in that post)

The following code works as expected in both Python 2.5 and 3.0:  a, b, c = (1, 2, 3)  print(a, b, c)  def test():     print(a)     print(b)     print(c)    # (A)     #c+=1       # (B) test()   However, when I uncomment line (B), I get an UnboundLocalError: 'c' not assigned at line (A). The values of a and b are printed correctly. This has me completely baffled for two reasons:   Why is there a runtime error thrown at line (A) because of a later statement on line (B)? Why are variables a and b printed as expected, while c raises an error?   The only explanation I can come up with is that a local variable c is created by the assignment c+=1, which takes precedent over the "global" variable c even before the local variable is created. Of course, it doesn't make sense for a variable to "steal" scope before it exists.  Could someone please explain this behavior?


I've installed Ubuntu using the Microsoft Windows Installer, and it's running pretty slow. I've got 3.8 GB ram on my computer, and by running free -m I'm getting the following results :               total       used       free     shared    buffers     cached Mem:          3920       3440        479          0       1174       1457 -/+ buffers/cache:        809       3110 Swap:          255          0        255   Only 479 out of 3440 MB is free, while to only process running at the moment if Firefox. I've changed the swappiness to 10, but still no change is seen. I'd like to know  why so much memory is used and how could I fix it and possibly make my computer run faster. Any solution would be grateful , thanks in advance !

I have just turned on my PC and have two applications running; Thunderbird and Firefox. Whatever else is running is part of Ubuntu's feature set (as well as a few indicators).  This has been ongoing for weeks, so I'm not sure if it's normal behaviour or not.  Right now, my memory usage indicator says that Ubuntu is using 41% of my 6GB of RAM. I haven't even opened Gimp or my other day-to-day things. I'll be buying another 6GB of RAM, this week, so that I don't run out when using Gimp or Openshot, for example.  An overview of my running applications shows that Nautilus is using the most, yet it isn't even open. This seems a little excessive, or am I missing something?


I'm writing some notes and I get the following error when I add the figure caption:  Illegal parameter number in definition of reservad@a <to be read again> \crcr   This is the code:  \documentclass[12pt]{article} \usepackage{amsmath, amssymb, graphicx, tikz}  \begin{document} \begin{figure} \centering \includegraphics[width=.7\textwidth]{pic.png} \caption{\overrightarrow{\mathbf{AB}}}\label{some-label} \end{figure} \end{document}

I'm trying to put a mathematics symbols in the caption of my figure with this:   \begin{figure}[!ht]     \centering     \includegraphics[scale=0.2]{vect_CM.png}     \caption{Vecteur $\overrightarrow{CM}$ à un moment donné}     \label{vect_CM} \end{figure}   And LaTeX show an error:  Illegal parameter number in definition of \reserved@a. <to be read again>                     \crcr  l.76 ...$\overrightarrow{CM}$ à un moment donné}   Do I have to use any package to do this?


When opening the achievements view in the android app, it's showing the spinner as if loading, but never finish the loading.  I've waited for this one to go away but it's survived the app being killed as well as a reboot of my phone. I'm posting this question from the Android app now, so the app itself works.  App version 1.0.77

So... I know that a couple of months ago I complained about the ... and that's getting fixed...  But now they're not showing up at all. All I'm seeing under "Achievements" in the iOS app is badges awarded.     Now, to compare, here's my achievements pane on FF:    I did check... I haven't installed a new version of the iOS app... though I do know that some updates can be pushed without a new version.  The same thing is occurring on my iPad and iPhone.


Suppose we have n random variables dstributed iid by a N(mu, sigma) where sigma is known. What would be the MLE for mu if we only counted the number of observations above 0?

such as find  MLE of $P(X>12)$ when $X_i$ ~ $N(\mu,\sigma^2) $


I've got a Dell Inspiron 3558 and it's running Ubuntu 14.04. I want to install Windows 10 on it. I have never installed any OS, so that would be a first for me. I couldn't really find any videos or I don't know how to search for it. I have another PC which Windows, so I could make a bootable USB from it. I don't want to have dual-boot.

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


Donald Rumsfeldt had a way of speaking in public, where to make his point more forcibly he would pose questions and answer them. Has Saddam Hussain bombed his own people? Yes. Has he begun the manufacture of weapons of mass destruction? Yes Are we prepared to see him terrorise his neighbours? No (This is not necessarily an accurate quotation, but just an example of the sorts of things he said).  But what interests me is this form of rhetoric which involves posing loaded questions and providing answers that make your point. Another exponent of this was Josef Stalin. In his case it has been seen by some historians as a technique he learned during his childhood education in a religious seminary. It was a form of catechism.  So what is the rhetoric called? Is it catechismic?  The word does not exist (at least not in the OED) as an adjective.   Edit. I have briefly looked at .It is not entirely a parallel example - the OP complains that his wife does it in the course of everyday conversation. I am primarily interested in the development of an argument through this process. But the former question did bring out some interesting words - e.g. sermocinatio,- @Sven Yargs - which unfortunately does not have an OED entry. But I am also fascinated by the link to catechism, which I believe may be the provenance of this in some politicians. Someone has now come up with a suitable adjective - below.    Answer. I think the closest answer has been supplied by @Old English Lapdog. It seems to be the case that there are two distinct elements to this. One is that it follows the religious practice of teaching by question and supplied answer.  In that sense it relates to catechism. But in building an argument it is rhetorical. The word catechetical in its OED (sense 3) includes a reference to Socrates. 1711   J. Addison Spectator No. 239. ¶3   Socrates introduced a Catechetical Method of Arguing. He would ask his Adversary Question upon Question, till he had convinced him out of his own Mouth that his Opinions were wrong. So I am prepared to accept catechetical as the answer.

I have been wondering if this particular speaking device had a specific name.  My wife uses a speaking technique where, instead of just making a statement, she presents it in the form of a question, and then immediately answers her own question.  For example, instead of saying     I think you are wrong.   she would say,     Do I think you are wrong? Yes.   Or, similarly, instead of     I hate when he does that.   she would say     Do I hate when he does that? Yes.   Does this particular technique have a name?  I have been trying to Google this, but have been stumped as to exactly what to search for.


Nobody's ever posted a bounty on any of my questions, so I have no idea. *  I did try searching for a dupe, didn't find anything.  I just started a bounty on someone else's question. Were they notified about it?  * = Plot twist: What if they have, and I just didn't notice? Depends on the answer to this question.

Can there be a notification for those people that participated in the question in the past (either who asked or answered it) once a bounty is started on it?


Let's say that a Medium-size creature is targeted with the reduce part of the  spell, and therefore reduced to a Small size, before being locked inside a container only just about large enough to fit them. What happens to them & the container when the spell ends?  The rules are pretty clear on what happens if you Enlarge into an area that is too small, but not on what happens when a Reduce wears off. If it was adjudicated the same way it effectively gives Reduce an infinite duration, which doesn't seem right.

A player tried to use the spell  on his PC while in the mouth of the Tarrasque to shrink himself, then go deeper into its airway and to try to collapse its lung by enlarging himself inside of it. I imagine there's no real rule for this but I felt silly just denying it, because it seemed like a cool idea that you could only probably do with a creature as large as the Tarrasque.  Can you crawl into a gargantuan creature’s mouth or into its airway via reduce/enlarge and attack its brain or internal organs?


$$\text{Please read the whole question before answering}$$  Before I ask my question, I would like to say that "Yes, I do know a photon has no mass."  I was helping someone here on P.SE with the subject of how photons are produced. For some reason I was also thinking of Einstein at the time I helped said person, and as it often does for me, and I started thinking about $E=MC^2$ and the energy of a photon.  I looked it up later (, , and ) and the respective energies of the wavelengths Blue(0.445 microns), Green(0.525 microns), and Red(0.644 microns) are $4.46*10^{-19} J$, $3.78*10^{-19} J$, and $3.08*10^{-19} J$.  Now I don't know calculus or higher level physics, but it occurred to me that if something has energy, by Einstein's $E=MC^2$, it must have mass (Because the speed of light is constant). I did a quick thought experiment, and sure enough, something with no mass would have no energy $$E=MC^2$$ $$E=0⋅C^2$$ $$E = 0$$  Using SI units, since the units used are arbitrary, I did another thought experiment:  Using $E=MC^2$, what is the mass of a photon at the wavelength 0.445μm (Blue)? $$E=MC^2$$ $$4.46⋅10^{-19} \text{J} = M⋅C^2$$ $$4.46⋅10^{-19} \text{J} = M⋅(299,792,458 \text{ m/s})^2$$ $$4.46⋅10^{-19} \text{J} = M⋅(8.98755⋅10^{16} \text{ m}^2/\text{s}^2)$$ $$\text{And since we can rearrange to get } E/C^2 = M,$$ $$\frac{4.46⋅10^{-19} \text{J}}{8.98755⋅10^{16} \text{ m}^2/\text{s}^2} = M$$ $$\frac{4.46⋅10^{-19} \text{Kg⋅m}^2/\text{s}^2}{8.98755⋅10^{16} \text{ m}^2/\text{s}^2} = M$$ $$\frac{4.46⋅10^{-19} \text{Kg}}{8.98755⋅10^{16}} = M$$ $$4.96242⋅10^{-36} \text{Kg} = M$$  I don't know about you, but that does not look like a mass of 0.  Lets do another: What is the mass of a photon at frequency 0.525μm (Green)? $$E=MC^2$$ $$3.78⋅10^{-19} \text{J} = M⋅C^2$$ $$3.78⋅10^{-19} \text{J} = M⋅(299,792,458 \text{ m/s})^2$$ $$3.78⋅10^{-19} \text{J} = M⋅(8.98755⋅10^{16} \text{ m}^2/\text{s}^2)$$ $$\frac{3.78⋅10^{-19} \text{J}}{8.98755⋅10^{16} \text{ m}^2/\text{s}^2} = M$$ $$\frac{3.78⋅10^{-19} \text{Kg⋅m}^2/\text{s}^2}{8.98755⋅10^{16} \text{ m}^2/\text{s}^2} = M$$ $$\frac{3.78⋅10^{-19} \text{Kg}}{8.98755⋅10^{16}} = M$$ $$4.20581⋅10^{-36} \text{Kg} = M$$  Again, something doesn't smell right.  Honestly, I'm not sure what to make of this. Obviously, if photons had any mass at all, Earth would probably not be here (What with the sun sending hundreds of trillions of photons a year, for 4.5 billion years. We'd have been sandblasted away long ago)  So clearly something is very wrong. In order of most, to least likely:   I messed up with something in my calculations. I assumed something, that shouldn't have been assumed. I made some, other, unknown mistake somewhere. Photons have special rules, when it comes to this equation. The equation I used is an oversimplification. There's something in calculus/higher level physics that explains this, and I am just oblivious to it. There is a debate going on over this somewhere. Its a conspiracy. Whales can fly. Einstein was wrong.   I got my information/double checked my information at these websites:    The speed of light ()()  Energy of photon ()()()    Someone please shed light on this, it's been driving me crazy since 8/26/14.  TIA P.SE

Photons are massless, but if $m = 0$ and , then $E = 0c^2 = 0$. This would say that photons have no energy, which is not true.  However, given the formula $E = ℎf$, a photon does have energy as $ℎ$ is a non-zero constant and photons with a zero frequency do not exist.  What am I missing here, or does the famous formula not apply to photons?


In category theory we say a functor is continuous if it preserves limits.   At first glance this seems like a totally obvious analogue of the notion of a continuous mapping in topology. However, at second glance it looks like a play on words, because the category-theoretic notion of "limit of a diagram" doesn't have a lot to do with the topological notion of "limit of a sequence".   Can one regard continuity of maps as a special case of continuity of functors? That is, if I have topological spaces $X, Y$ and an arbitrary mapping $f: X \to Y$, is there a natural way to cook up a functor $F_f$ between some categories such that $F_f$ is a continuous functor iff $f$ is a continuous map?

Is there any connection between category-theoretic term 'limit' (=universal cone) over diagram, and topological term 'limit point' of a sequence, function, net...?  To be more precise, is there a category-theoretic setting of some non-trivial topological space such that these different concepts of term 'limit' somehow relate?  This question came to me after I saw (  ) a surprising fact that generalised metric spaces can be seen as categories enriched over preorder $([0,\infty],\leq)$.


Prove that $$\sum_{k=0}^{n} \frac{{m \choose k}}{{n \choose k}}= \frac{n+1}{n-m+1}, m \le n$$ I have carried out enough numerics to find that this identity is true. So, here, I  raise the question of its  reference and a proof.

In an , I stated $$\sum\limits_{j=0}^M \frac{M \choose j}{N+M \choose j} = \frac{N+M+1}{N+1}.$$  It is clearly true when $N=0$ since you add up $M+1$ copies of $1$, and when $M=0$ since you add up one copy of $1$.  And, for example, with $M=4$ and $N=9$ you get $\frac{1}{1}+\frac{4}{13}+\frac{6}{78}+\frac{4}{286}+\frac{1}{715} = \frac{14}{10}$ as expected.  But how might you approach a general proof?


My title is:  <title>School Management Software, College & University Management Software, Cloud ERP Software</title>   However it's showing up like this in Google:   Is there something I'm doing wrong here? Any insight would be really helpful.

Before we launched our website, we had set up a "coming soon" page and google picked up the title and description from its contents. So the description in the search results said:     Coming soon! Visit example.org for updates.   It's been a few weeks since we launched our website. We've even created a sitemap and submitted it to Google. In Google Search Console, the pages have been crawled and all the pages are appearing as expected on Google, EXCEPT the homepage which is still not updated! The title and description of the homepage in google search results still says "coming soon.".***  I checked on bing too, but it appears to be fine there.  All other pages seem to be indexed fine on Google. I don't even have any crawl errors in my reports. So what seems to be the problem? I've already waited for 2 weeks.


I found system of equations on internet, I want to practice math and to solve it.   All $x$,$y$ and $z$ are integers.  $$\begin{cases} x+y+z=3 \\ x^3+y^3+z^3=3 \end{cases} $$  Should I start by watching all combinations that sum up to 3, please give me some hint to start.

Suppose that $x^3+y^3+z^3=3$ and $x+y+z=3$.   What are all integral solutions of this equation?   I can only find $x=y=z=1$.


So I've just edited a question and noticed that if I enter a code block after a numeric list:        in Addbill form the User insert items to the the DB(NewBill Table).   in Bill form is a reportview show the data from NewBill table, but it doesn't show. my Query in the dataset is;       SELECT CID, IID, Con, Title, Price, TPrice, Qun, Date FROM dbo.NewBill WHERE CID = @CID   And CON = @CON      It isn't displayed as code, just tabbed out:     in Addbill form the User insert items to the the DB(NewBill Table). in Bill form is a reportview show the data from NewBill table, but it doesn't show. my Query in the dataset is;   SELECT CID, IID, Con, Title, Price, TPrice, Qun, Date FROM dbo.NewBill WHERE CID = @CID And CON = @CON     example

Consider the following piece of Markdown code:  This is some regular text.      >>> def factorial(n):     ...     return 1 if n < 2 else n * factorial(n - 1)     ...   * This is a list item.      >>> def factorial(n):     ...     return 1 if n < 2 else n * factorial(n - 1)     ...    Notice that the second code block is preceded by a list item.   Why is the factorial code not properly formatted under these circumstances? To demonstrate the problem, I'll insert the Markdown code show above:    This is some regular text.  >>> def factorial(n): ...     return 1 if n < 2 else n * factorial(n - 1) ...     This is a list item                 def factorial(n):       ...     return 1 if n < 2 else n * factorial(n - 1)       ...               This applies to numbered as well as unnumbered lists.


Find all units in the ring $ Z[i] $= { $a+bi$ : $a,b$  ϵ $Z$ }.  I faced a similar problem to find all the invertible matrices in $Z$. I concluded the solution must be all matrices of det ($\pm1$). I don't know whether this solution is correct or accurate but I'm clueless for above problem.  Edit: The chapter was on matrices so I assumed the author was asking for such matrices, but author just said "Find all units" (He may have meant elements, idk).

How can we show that $\pm 1, \pm i$ are the only units in the ring of Gaussian integers, $\mathbb Z[i]$?  Thank you.


I recently upgraded to ubuntu 19.10 from 18.04 using  do-release-upgrade. But now I realize that the new version consumes a lot of system resources and doesn't work properly on my machine. I want to go back to my previus version. How can I do that.

I just installed a new version of Ubuntu and I want to roll it back to the previous version.  How can I do that? Is that even possible?


Every time i try to update or install package, i get the following error:  dpkg: unrecoverable fatal error, aborting:  reading files list for package 'libjson-glib-1.0-0:amd64': Input/output error E: Sub-process /usr/bin/dpkg returned an error code (2)     i've already tried:    sudo apt-get check   sudo apt-get install -f sudo dpkg --configure -a     What went wrong and how to fix this issue?

I have been running Ubuntu 12.04 for the past few weeks. I recently tried to download and install some files through the Update Manager. It located a few files, downloaded them, but then failed to install them. It gave the error:  installArchives() failed: (Reading database ...  (Reading database ... 80% dpkg: unrecoverable fatal error, aborting:  reading files list for package 'libasn1-8-heimdal': Input/output error   I tried using apt-get upgrade but a similar error was produced:  Reading package lists... Done Building dependency tree        Reading state information... Done The following packages will be upgraded:   icedtea-6-jre-cacao icedtea-6-jre-jamvm openjdk-6-jre openjdk-6-jre-headless   openjdk-6-jre-lib 5 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. Need to get 0 B/34.6 MB of archives. After this operation, 1,024 B of additional disk space will be used. Do you want to continue [Y/n]? y (Reading database ... 80% dpkg: unrecoverable fatal error, aborting:  reading files list for package 'libasn1-8-heimdal': Input/output error E: Sub-process /usr/bin/dpkg returned an error code (2)   Any help would be greatly appreciated. Thanks in advance.  Edit: Here's some extra information that may be useful. My original problem was that the Ubuntu Software Centre would not open. I found that the Update Manager and Synaptic Package Manager also failed to open. They all gave an error along the lines of:   "installArchives() failed: dpkg: error: reading package info file '/var/lib/dpkg/available': Input/output errorError in function:"   After much googling I seemed to fix that problem as the package managers would open again. When I then tried to download and install any updates from the Update Manager I got the error at the beginning of this post.


I have 100 collections and they form a complex tree structure. I would like to enable the Holdout and Indirect Only options for the 50 specified collections from the entire collection. In order to properly handle the tree of collections, I can predict the maximum depth and write for loops in layers, but I found a hint that the recursive function is excellent at solving this type of problem. However, recursion was difficult for me, so I failed to write my own code. How can I write a recursion that digs through a collection of tree structures to the end and then returns back?

I'd like to get all collections in the current scene and can't find a way to do that. I found bpy.data.collections to get all collections stored in the blend and C.scene.collection.children to return the first level of sub-collections. However, I can't find out which collection is linked to each scene. I wonder if there is a simple way like iterating through the objects in context C.scene.objects?  Q: How to get all collections of the current scene?


My main Ubuntu 18 partition is getting crowded.  I wanted to take some of the extra space from the FAT partition.  I opened both KDE partition manager and the DISK utility because the partition manager doesn't really tell me what's what.  ON the disk utility it had sd8 as the Ubuntu system.  So, I shrunk a different partition and removed a partition that said it was free space but I couldn't see how to enlarge my Linux partition.  But then, I look at the Disk utility and it no longer has a linux system partition.  Instead of that Ubuntu system it has Partition 1 as 58 Gig of NTFS, then 25 Gig Free Space, Partition 2 as unknown and 0.0 Kb and then another 77 Gig free space. Here are the shots   So, I don't really know what to make of it.  On one it looks like I have a lot of free space and the Disk it looks like my OS is gone. I just want to know how to add the free space to my Linux partition.

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


Some Ph.D. programs . Others are . Does a  have the same gravity as a Ph.D. done on stipend when it comes to an academic career? When does it really make any sense to pursue a Ph.D. by paying tuition fees?

What should I opt for?   Option A) very well paid PhD, around €3000 per month at a respectable university or;  Option B) a non-paid PhD, where I have to pay €2000 per year at one of the top 10 universities of the world?  EDIT: Actually they are both UK universities, Option B  is ranked between the top 10 in the world in engineering and tech, and I do get a scholarship that pays 18000 pounds which covers the difference between international student tuition and EU tuition. In Option A, I will be doing research in a good university and will be working alongside giants in the industry.


I would like to know where the photo of the Outlook.com sign in page was taken. Any ideas?

Does anyone know the location of this login hotmail background ?


I was in Minecraft creative mode and built a whole city. Then I decided to explore the world for a bit in survival mode. After a while, I died but it didn't take me back home. It said my bed was not found or obstructed. Please help me, I worked so hard with that world. I don't remember the coordinates.

In my creative world, I had slept in a bed to set my spawn point. Then I broke the bed. I then accidentally fell out of the world (into the void) and died. It said "Your home bed was missing or obstructed" and it respawned me somewhere random. Now I can't find my way back! Help!


I had a user on chat go  O_O SO's topbar is all funky now @JourneymanGeek would've been nice if, y'know, they asked for opinions on SE meta  Bob's one of my core users. Unlike me, Bob codes. Bob vaguely got caught by surprise by these changes. Bob even uses SO, and didn't know about it. I'm tempted to call it a bug. I hardly knew about it and as a mod, I ought to. This feels like a breakdown in communication between the folks who run the site and the wider communities. Mods are one element but we need to keep in mind that we also have a little more than a hundred other sites, including a few reasonably large communities outside SO. While SO in most cases is the site that gets the most attention, and love, some of the changes that are being tested on SO - such as the top bar will filter down elsewhere. I know of these changes primarily through complaining and complaints about complaints on the tavern on the meta and , rather than directly, and other sites have no input on the changes. This isn't just about the site bar though, but any change to the 'core' of site functionality. While the current 'crop' of changes to the top bar are finally acknowledged on MSE - quite a bit of it purely happened and is happening on MSO. In a sense, the rest of the network's kinda in the dark about it. I'm not saying we're getting treated like mushrooms, but it would be very nice if changes that affect the entire site at least got an announcement or discussion meta post. As a moderator - chances are I'm the first point of contact for the user who wakes up one morning, and finds that someone moved his cheese, and that his workflow has been disrupted. Could we have better visibility and communication about changes that eventually affect the whole network (Since there's plans to roll out the new ? It might mean one extra meta post (or better yet, that and a moderator newsletter or other notification!) but it would help us help get the word out.

With the ever-growing network of Stack Exchange sites as well as the increased traffic and therefore larger number of moderators, the way policy updates and feature changes are currently announced makes it almost impossible for moderators to catch up. Currently, if you as a moderator want to be up to date on what's happening, you have to:  Hang around on Teacher's Lounge all day and be sure to check the starred or pinned messages Visit Meta Stack Overflow and look at the recent feature changes as well as the top questions for the last week or months Wait a few weeks until you receive a newsletter, which only covers the major issues  What you could be missing… This is a process that needs moderators to actively check for any new info. For example, two things I completely missed as a moderator unless some others had informed me:   – I've always been strict about quality flags but it took me a while to see this topic. I just had a talk with @ChrisF yesterday who apparently hadn't seen the topic until now. No offense, but if you want moderators to act consistently, you have to get this information out more reliably. There are new ways for moderators to check review statistics. Those are buried somewhere in a list of links. Unless you check out that page (which I don't do that often), you just won't find these links. The rationale can't be that "you'll find this out when you see it, and then play around with it" – why make these tools in the first place if they shouldn't be used right away?  Now, I can imagine that – even on the larger sites – there are moderators who simply cannot afford to spend the entire day in chat, or even on Meta. Moderating is something most of us to "just for fun", and often while working. … and why that's bad? But yet, we moderators are the first port of call for support on our sites. You wouldn't want the site mods to respond "Umm, no idea, they must've changed that recently." And you want them to act consistently (e.g., with regard to the low quality flags). I dare say that if an otherwise very active moderator isn't there for two weeks, they'd miss out on important (policy/feature) changes. A new information feed What I propose is that Stack Exchange actively pushes out small bits of information to all moderators of all sites. Unlike the newsletter, which is only sent every few months, these messages could be kept really short and to the point. In the mod page, you could make a counter for updates:  And there, list all the new stuff, for moderators to read:  You could then just write a small message:  Be more strict on very low quality flags If a very low quality flag doesn't exactly apply, consider declining it with an appropriate message. This is to ensure that validated flags are accurate. See more:   And done. Now you get the information out to every moderator, in a feed that now pushes out the important bits instead of waiting for moderators to find them. This would ensure that moderators who can't check in every day still get news of the critical feature and policy changes, which results in a more consistent moderation experience for the users, and in the end it might also save the team from repeated questions about new features or policies.


When I run sudo apt-get update, the following results occur :  Reading package lists... Done W: Duplicate sources.list entry google'sIP/linux/chrome/deb/ stable/main amd64 Packages (/var/lib/apt/lists/dl.google.com_linux_chrome_deb_dists_stable_main_binary-amd64_Packages) W: Duplicate sources.list entry google'sIP/linux/chrome/deb/ stable/main amd64 Packages (/var/lib/apt/lists/dl.google.com_linux_chrome_deb_dists_stable_main_binary-amd64_Packages) W: Duplicate sources.list entry http://dl.google.com/linux/chrome/deb/ stable/main i386 Packages (/var/lib/apt/lists/dl.google.com_linux_chrome_deb_dists_stable_main_binary-i386_Packages) W: Duplicate sources.list entry http://dl.google.com/linux/chrome/deb/ stable/main i386 Packages (/var/lib/apt/lists/dl.google.com_linux_chrome_deb_dists_stable_main_binary-i386_Packages) W: You may want to run apt-get update to correct these problems   The solution Ubuntu provides is " run apt-get update to correct these problems" , but that only produces the duplicate error.

I keep getting this warning whenever I try to run sudo apt-get update.  W: Duplicate sources.list entry http://archive.ubuntu.com/ubuntu/ precise-updates/main i386 Packages (/var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_precise-updates_main_binary-i386_Packages) W: You may want to run apt-get update to correct these problems   Below is the output from /etc/apt/sources.list file:  deb http://archive.ubuntu.com/ubuntu precise main restricted deb-src http://archive.ubuntu.com/ubuntu precise main restricted  deb http://archive.ubuntu.com/ubuntu precise-updates main restricted deb-src http://archive.ubuntu.com/ubuntu precise-updates main restricted  deb http://archive.ubuntu.com/ubuntu precise universe deb-src http://archive.ubuntu.com/ubuntu precise universe deb http://archive.ubuntu.com/ubuntu precise-updates universe deb-src http://archive.ubuntu.com/ubuntu precise-updates universe  deb http://archive.ubuntu.com/ubuntu precise multiverse deb-src http://archive.ubuntu.com/ubuntu precise multiverse deb http://archive.ubuntu.com/ubuntu precise-updates multiverse deb-src http://archive.ubuntu.com/ubuntu precise-updates multiverse  deb http://archive.ubuntu.com/ubuntu precise-security main restricted deb-src http://archive.ubuntu.com/ubuntu precise-security main restricted deb http://archive.ubuntu.com/ubuntu precise-security universe deb-src http://archive.ubuntu.com/ubuntu precise-security universe deb http://archive.ubuntu.com/ubuntu precise-security multiverse deb-src http://archive.ubuntu.com/ubuntu precise-security multiverse   How do I fix it?


I'm making a prime generator with 3 file (two of them are .cpp and one is .h). However when i try to build the whole project it in onlinegdb gives this error /tmp/ccI5GCGK.o: In function `main': main.cpp:(.text+0x11f): undefined reference to `int primegen(int&, long*, long*)' collect2: error: ld returned 1 exit status  main.cpp #include <iostream> #include "primegen.h"  int main(void) {     //taking input for number of test cases     int test_case{2};      long int lower_lim[MAX] = {5, 15}, upper_lim[MAX] = {15, 25};      //function present in primefunc.cpp     primegen(test_case,lower_lim,upper_lim);   }  primefunc.cpp // to make SUCCESS known to this file extern int SUCCESS;  //main function to prime generator between limits int primegen(int &test, auto *low, auto *up) {     static int cases=0;          if(cases == test)         return SUCCESS;          int diff=up[cases]-low[cases];          for(int i=0;i<diff;i++)     {         //some code to be added     } }  primegen.h // for making arrays of lower and upper limit constexpr int MAX = 10; constexpr int SUCCESS = 2;  // for printing out prime number int primegen(int &, auto *, auto *);  EDIT :- I tried moving the function from the 2nd cpp to the main.cpp and it worked and also individual builds also gives success.

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


One definition of can in Merriam-Webster Online is:     c —used to indicate possibility < do you think he can still be alive> < those things can happen> ; sometimes used interchangeably with may   But in The Elements of Style written by William Strunk, Jr., it says:     Can. Means am (is, are) able. Not to be used as a substitute for may.   This contradiction makes me confused. So in what situation can can be used "interchangeably" with may, and in what situation it cannot?  EDIT: The two sentences in The Elements of Style make me feel that the author permits only one use of can (be able) in the first sentence and proscribes the other use (may; to indicate possibility) in the second sentence. Did I misinterpret the author's meaning? Or the text is ambiguous?

Which is correct if I want to request for a pen?        Can I have your pen please?   May I have your pen please?


I am writing a dissertation. The images I have are varying between charts and regular images. I want them to be listed under :   Table des figures and Tables des graphiques.  I can only make one using figure, how can I generate the second?

I am writing my PhD thesis. In my manuscript I have Figures in the text and Photographic plates (a figure of figures) in the annexes. The two elements are different and I would like create a new environment of Plate that follows the same structure of the Figure environment. Where can I find the Figure environment to modify it?  The new environment table should have exactly the same structure than the figure environment but replacing the word figure by the word Planche (in French).


I recently obtained a Motion Computing LE1600 that I replaced Windows XP with Ubuntu 14.04 on today, and I can not seem to get the touchscreen functions to work properly. Is there anything that can be done to rectify this issue?

I am trying to ask a question about getting my hardware to work but I don't know what information to add to my question to get help, what do I need to do?  Related if you don't have access to a GUI:


... Fiction writers (eye roll)  To be burned at the stake  If we can't come up with a verb, perhaps a corresponding noun or adjective would suffice.  15th century historical fiction, so modern terms such as marshmallowed wouldn't really help.  Here is my sample:  You, the accused, have been found guilty of practicing Judaism as a Christian. This heresy against our Lord Savior carries the penalty of ____(noun).  Or  [C]onvicted of heresy, you are to be ____(verb).

Is there any single word substitute for 'Burning Alive'? We've Behead for 'Cut off the head'. Similar  way, What is the Single word equivalent for 'Burning Alive' If any?


I would like to create a Wordpress page, for example "Foods"  Then I want every single one of the following URLs to land on the "Foods" page. There could be unlimited number of URLs that lead to the "Foods" page:                  How could I achieve this? Many thanks in advance.  Regards

I want to serve a specific Wordpress page for multiple urls. Basically I want to point all the urls in a specific format to a known page:  /some-prefix-* => /target-page   And accessing /some-prefix-and-here-something it should load /target-page.  How to do this?  Note I do not want to redirect the user but to be able to serve an existing page to multiple urls.  The .htaccess looks like this:  # BEGIN s2Member GZIP exclusions RewriteEngine On RewriteRule ^prefix-*$ some/path/to/directory-$1 [NC,L] <IfModule rewrite_module>     RewriteEngine On     RewriteBase /     RewriteCond %{QUERY_STRING} (^|\?|&)s2member_file_download\=.+ [OR]     RewriteCond %{QUERY_STRING} (^|\?|&)no-gzip\=1     RewriteRule .* - [E=no-gzip:1] </IfModule> # END s2Member GZIP exclusions  # BEGIN WordPress <IfModule mod_rewrite.c> RewriteEngine On RewriteBase / RewriteRule ^index\.php$ - [L] RewriteCond %{REQUEST_FILENAME} !-f RewriteCond %{REQUEST_FILENAME} !-d RewriteRule . /index.php [L] </IfModule>  # END WordPress  DirectoryIndex index.php index.html   I thought by adding RewriteEngine On RewriteRule ^prefix-*$ some/path/to/directory-$1 [NC,L] will serve /prefix-* from some/path/to/directory-$1. For example: when accessing example.com/prefix-foo should be the same with example.com/some/path/to/directory-foo (which resolves to example.com/some/path/to/directory-foo/index.html).  Also, if there is already a Wordpress page with the name prefix-bar, /prefix-bar should not load example.com/some/path/to/directory-bar/index.html.


Let $R$ be a commutative ring with unit, I'm trying to prove why in this ring  $$(x_1,\ldots x_n)=(1)\implies (x_1^{k_1},\ldots, x^{k_n})=(1)$$  It seems an easy question, but I couldn't prove it, I need a hint or something.  Thanks

Let $A$ be a commutative ring with $1$. Let $f_1,\dots,f_r$ be elements of $A$. Suppose $A = (f_1,\dots,f_r)$. Let $n > 1$ be an integer. Can we prove that $A = (f_1^n,\dots,f_r^n)$ without using axiom of choice?  EDIT It is easy to prove $A = (f_1^n,\dots,f_r^n)$ if we use axiom of choice. Suppose $A≠(f_1^n,…,f_r^n)$. By Zorn's lemma(which is equivalent to axiom of choice), there exists a prime ideal $P$ such that $(f_1^n,…,f_r^n) \subset P$. Since $f_i^n \in P$, $f_i \in P$ for all $i$. Hence $A = (f_1, \dots,f_n) \subset P$. This is a contradiction.


I have a vector layer (line features) which consists of different pipes. In the attribute data I have fields that indicate the upstream elevation and downstream elevation values.   I am trying to visually depict the flow direction in these pipes using arrows based on the upstream and downstream elevation values. I cannot seem to work out a method in QGIS. Is anyone here able to assist?

I am trying to display arrows on pipes of a sewer network so their direction is from upstream to downstream edges of the pipes.   I have managed to display those arrows on a polyline layer (which is the pipes) from the properties menu, but their direction seems to always be from Northeast to Southwest, regardless of the upstream and downstream edges.   How do i connect the arrow direction to those edges?  For example in the picture, the pipe between Nodes D11122 and D115 should have the arrow directed the opposite way.   Each pipe has an upstream and a downstream edge. Each edge is connected with a node and their properties are shown in the attribute table.


trying to parametrize my queries, heres a supposedly simple one          $query = $this->handle->prepare('USE :db_name');         $query->bindParam(':db_name', $db_name, PDO::PARAM_STR);         $query->execute();   however, it throws an invalid syntax error. I checked the query log, it comes out as  USE 'test'   which doesn't work, however, if I manually write  USE test   then that does work. This leaves me with 2 questions   Shouldn't the one with single quotes work? AFAIK, quotes just mark the beginning and ending of a string in SQL, why is it breaking it? How can I get the prepared query to not automatically put quotation marks around the parameters?

Why can't I pass the table name to a prepared PDO statement?  $stmt = $dbh->prepare('SELECT * FROM :table WHERE 1'); if ($stmt->execute(array(':table' => 'users'))) {     var_dump($stmt->fetchAll()); }   Is there another safe way to insert a table name into a SQL query? With safe, I mean that I don't want to do  $sql = "SELECT * FROM $table WHERE 1"


I am searching text files that contain:  -any word in this list (build|tune|scrap) -and one more specific word (engine)  The text files have CRLF as line endings.  I've cobbled together the following regex, which matches when engine is on the same line as one of the first three: (?=.*\b(build|tune|scrap)\b).*(?=.*\b(engine)\b)  edit:  I've tried the suggested duplicate post.  The files I am searching have CRLF line endings, so I believe my regex should have \r\n someplace, but I have been unable to get it to find engine in the rest of the text (i.e. on other lines)  when there's a build, tune or scrap anywhere else. (?=.*\b(build|tune|scrap)\b)((.|\n|\r)*)(?=.*\b(engine)\b) (?=.*\b(build|tune|scrap)\b)((|\n|\r))(?=.*\b(engine)\b)  Thanks.

For example, this regex  (.*)<FooBar>   will match:  abcde<FooBar>   But how do I get it to match across multiple lines?  abcde fghij<FooBar>


I am a non-European applying from outside of the UK. I need to come up with realistic external funding ideas for the next three years. I have a good idea of what kind of research I would like to do but there is no definite plan. Any resources to consider for funding are greatly appreciated.

I am preparing an application for a full-time lecturer position. They asked me for a teaching statement (done), a research statement (done) and a plan for generating funding for the next three years (trying now). I am a bit confused about this and I am not sure what they actually want with this funding plan. I could, of course, name all the different grant applications that I could potentially submit, but I am convinced that they are expecting more than that.    Any help?  Thanks!


I tried to find an answer on this forum, but the solutions I found didn't work for me. I need to change three things in the Appendices:    the title shown at the beginning (between the end of the main matter of my thesis and the first appendix), from "Appendices" to "Appendici" the header in the appendix section, which now is - for example, for the Appendix A - "Chapter A: AppendixName", to "Appendice A: AppendixName" (I'm interested in this problem above all) the title in the Table of Contents, from "Appendices" to "Appendici"   Can you help me?  I'm using the book document class and \usepackage[toc,page]{appendix}.  Edit: I don't know if it is a useful information, but after \begin{appendices} I have  \titleformat{\chapter}[block]{\centering\Large\scshape}{Appendice \thechapter \\ \textcolor{gray75}{ \rule[2pt]{1.5cm}{2pt}\vspace{0.5mm} \\}}{0pt}{\Huge\bfseries\scshape}   (the same used to set the title format for chapters) and I'm using also  \renewcommand{\chaptermark}[1]{% \ifnum\value{chapter}>0 \markboth{Capitolo \thechapter{}: #1}{}% \else \markboth{#1}{}% \fi}

I would like to change the name of the "Appendices" to "Appendix" in the Table of Contents. So far, I was only able to change the name of the Appendices in the text, by using the following commands in the preamble:  \renewcommand\appendixname{Appendix} \renewcommand\appendixpagename{Appendix}   Also, I was able to add "Appendix" to the Table of Contents by using the command:  \addcontentsline{toc}{chapter}{Appendix}   However, using this I have both the default "Appendices" and the added "Appendix" in the Table of Contents. Does anyone know how to remove or rename "Appendices" in the Table of Contents?


from my knowledge, there are two approaches to evaluating whether the model fits the data in logistic regression. First is the predictive power. Second is from using goodness-of-fit tests.  My question is that if the results from Pearson's chi-square and Hosmer-Lemeshow test are in conflict (one significant, the other insignificant), what should I do next? Try to fit in interactions & non-linearities?   I know these two tests have their limitations. Pearson requires sufficient expected number of events/non-events for each profile or covariate pattern. Conclusion from HL test depend on the number of groups chosen, and there is no established theory to guide the choice of that number. I think the other alternative tests are not implemented in Stata yet.   On a side note, I noticed that many papers actually do not report any tests to assess their models. Why is that so?

I am referring to the question and its answers:  by @Clark Chong and answers/comments by @Frank Harrell. and to the question  and the comments.    I have read the paper D.W. Hosmer, T. Hosmer, S. Le Cessie, S. Lemeshow, "A comparison of goodness-of-fit tests for the Logistic regression model",  Statistics in Medicine, Vol. 16, 965-980 (1997).    After reading I was confused because the question I referred to asks explicitly for "(probability) predictive ability", which is in my opinion not the same as what the goodness-of-fit-tests in the paper supra aim at:  As most of us know, the logistic regression assumes an S-shaped link between the explanatory variables and the probability of success, the functional form for the S-shape is   $P(y=1|_{x_i})=\frac{1}{1+e^{-(\beta_0+\sum_i \beta_i x_i)}}$  Without pretending that there are no shortcomings with the Hosmer–Lemeshow test, I think that we have to distinguish between tests for the (a) '(probability) predictive ability' and (b) 'goodness-of-fit'.    The former's goal is to test whether the probabilities are well predicted, while the goodness-of-fit tests test whether the S-shaped function above is the 'right' function.  More formally:    tests for 'probability predictive ability tests' have a $H_0$ stating that the success probabilities are well predicted by the model; while for goodness-of-fit tests $H_0$ is (see Hosmer et. al. ) that the S-shaped functional form supra is the correct one.  Hosmer et al. perform simulations where they find the power to detect two types of deviations from the null namely that the link function is wrong or that the exponent in the denominator is not linear.    Obviously, if the above function has the 'right' functional form (so if the tests concludes that we can accept $H_0$ for the goodness-of-fit test), then the predicted probabilities will be fine, ...  First remark  ...however, accepting the $H_0$ is a weak conclusion as explained in .   First question  The most important question/remark that I have is that if the goodness-of-fit $H_0$ is rejected, then the conclusion of the test is that the functional form was not the 'right' one, however, does this imply that the probabilities are not well predicted ?  Second question  Furthermore, I want to point to the conclusions of Hosmer et. al; (I cite from the abstract):   ''An examination of the performance of the tests when the correct model has a quadratic term but a model containing only the linear term has been fit shows that the Pearson chi-square, the unweighted sum-of-squares,the Hosmer-Lemeshow decile of risk, the smoothed residual sum-of-squares and Stukel’s score test,have power exceeding 50 per cent to detect moderate departures from linearity when the sample size is 100 and have power over 90 per cent for these same alternatives for samples of size 500. All tests had no power when the correct model had an interaction between a dichotomous and continuous covariate but only the continuous covariate model was fit. Power to detect an incorrectly specifed link was poor for samples of size 100. For samples of size 500 Stukel's score test had the best power but it only exceeded 50 per cent to detect an asymmetric link function. The power of the unweighted sum-of-squares test to detect an incorrectly specifed link function was slightly less than Stukel’s score test ''  Can I conclude from this which test has more power or that Hosmer–Lemeshow has less power (to detect these specific anomalies) ?  Second remark  The paper by Hosmer et. al. that I referred to supra, compute (simulate) the power to detect specific anomalies (the power can only be computed if an $H_1$ is specified).  This does at my opinion not imply that these results can be generalised to ''all possible alternatives $H_1$'' ?


I need to prove that given a space $X$ that is normal and not compact, there exists an infinite closed set $S \subseteq X$ that is discrete. (where singletons are open in the subspace topology)

Why does a Hausdorff but not countably compact space have an infinite closed discrete subset?  In the proof of Theorem 2.1.5 in   E. K. van Douwen, G. M. Reed, A. W. Roscoe, and I. J. Tree, MR 1103993 , Topology Appl. 39 (1991), no. 1, 71--103.   the authors prove that a star compact Hausdorff space is countably compact. At the start of the proof they write     Suppose that $X$ is a Hausdorff space that is not countably compact. Then there exists $D = \{ x_n : n \in \mathbb N \} \subseteq X$, an infinite closed discrete subset.   I do not understand why if $X$ is Hausdorff but not countably compact, then there is an infinite closed discrete $D$.


I know that with the Playstation plus membership, they will away free games every month and giving away different games every month. So, I were to get a free game, then a month later, that same game isn't considered a "free" ps+ game, will I still have it?  Scenario:  --June 2013-- Uncharted 3 is free for ps+ members  2 months later  --August 2013-- (Hypothetically) Uncharted 3 ISN'T offered as free for ps+ members anymore  So, if I downloaded, installed, played, etc. Uncharted 3 while it was free, will I have still owned Uncharted 3 even AFTER August 2013 when they stop offering it to ps+ members?  Also note, that during this time, my ps+ membership has NOT expired.

I bought a three months membership for PlayStation Plus some time ago. This membership has already expired. While it was active, I got the classic PSOne Resident Evil titles for free. Will I be able to re-download them now without having to purchase a new PSPlus membership?


Why do things(it may include positive charges or just water kept at height etc) move from Higher potential level to lower potential level Is that a law or there is some special reason behind it...or probably it is just  the behaviour of nature

This is a sort of a generalized question and not just referring to the flow of current. This includes fluids and many other such entities.  But why does this flow occur. For example if I consider current, then the definition of potential at any point is the work done by external agent in bringing a unit positive charge from infinity to that point. How can we deduce from this definition that the current will flow from higher to lower potential. In fluids, the fluid flows from higher point to lower point. Why so (referring, again to potential)?  Please avoid any analogies in answering the question.


$$I=\int_{0}^{1}\frac{x^4(1-x)^4}{1+x^2}dx$$ I was recently in a small, friendly integration competition and this problem came up. Eventually, I found a solution using messy long division (shown below). I was wondering of other methods (preferably real-method solutions, but complex methods such as residues (if applicable) would also be nice to see) that could be used here.   I spent a lot of time trying to find a nice trigonometric substitution that would work (if you use $x=\tan(u)$, it can be brought to integrating $\int_{0}^{\frac{\pi}{4}}\tan^4(u)(1-\tan(u))^4dx$ which doesn't seem fun/faster and other substitutions I tried ended up similarly). So, that's what I'm hoping to see. There may also be a clever change of variables that that I didn't see (e.g. somehow using $\int_{a}^{b} f(x)dx=\int_{a}^{b}f(a+b-x)dx$ or similar)  Long Division Method:  Multiply the numerator out to prepare for long division: $$(1-x)^4=((1-x)^2)^2=(1-2x+x^2)^2=1-4x+6x^2-4x^3+x^4$$ hence $$x^4(1-x)^4=x^4-4x^5+6x^6-4x^7+x^8$$ Then long division shows that $$\dfrac{x^4(1-x)^4}{1+x^2}=x^6-4x^5+5x^4-4x^2+4-4\cdot\dfrac{1}{1+x^2}$$ Finally, we get that  $$I=\int_{0}^{1}\left[x^6-4x^5+5x^4-4x^2+4-4\cdot\frac{1}{1+x^2}\right]dx$$ $$I=\frac{1}{7}x^7-\frac{2}{3}x^6+x^5-\frac{4}{3}x^3+4x-4\arctan(x)\bigg\vert_{0}^{1}$$ $$I=\frac{1}{7}-\frac{2}{3}+1-\frac{4}{3}+4-4\cdot\frac{\pi}{4}-0=\frac{1}{7}+3-\pi=\boxed{\frac{22}{7}-\pi}$$ (Yes, I do see the cleverness of $\frac{22}{7}$, an approximation of $\pi$.)

I don't want to solve by expanding it and all, I tried corollary but denominator becomes messy, also in the options there is $\pi$ so tried several trigonometric substitutions too


It is implied in HP books that Hermione Granger is reasonably affluent, compared to eg. Ron Weasley.  At the start of Prisoner of Azkhaban, she had 10 galleons left to spend after purchasing what was needed for school.  Is it indicated anywhere in books, how she got any wizarding money at all, her parents being muggles? Were they made aware of money needs by the school  and were given enough information to arrange exchange with Gringot's?

‘But you’re Muggles!’ said Mr Weasley delightedly. ‘We must have a drink! What’s that you’ve got there? Oh, you’re changing Muggle money. Molly, look!’ He pointed excitedly at the ten-pound notes in Mr Granger’s hand.   Chamber of Secrets - page 47 - UK Hardcover - chapter 4, Flourish and Blotts   So Gringotts exchanges Muggle money for Wizarding money. What do the Goblins do with the Muggle money after the exchange has been made? Is it possible they keep a stash of Muggle money on hand for reverse exchange purposes, or do they surreptitiously feed the money back into the Muggle economy?  What do Goblins do with Muggle money?


What is the difference between supervenience and grounding?  Both amount to the claim that there is nothing over and above them in the sense that the grounded adds nothing to being but the grounding and that the supervening does not add anything to being but that which it supervenes upon. There are some conditions like reflexivity that grounding does not satisfy, but other than that, what is the difference between them?   Thanks in advance!

So, I am wondering if anyone could help me with the notions of grounding (supervenience?) and  emergence in the modern discussions in philosophy of science. What are they and what is the relation between them? Any papers or simply thoughts?


I want to add a definition in my LaTeX file. However, I have a dot after the word definition. How can I remove it? I want:     Definition Here is the definition   NOT     Definition. Here is the definition   \newtheorem*{definition*}{Definition}                       \begin{definition*}                 Here is the definition                \end{definition*}

Instead of 1 Theorem. I want to write 1 Theorem in front of the first theorem and analogously in front of succeeding theorems. How can I get rid of the dot?  Here is a MWE:  \documentclass{article} \usepackage{amsthm} \swapnumbers \newtheorem{theorem}{Theorem} \begin{document} \begin{theorem} \end{theorem} \end{document}


Python Theoretical Question  I'd like to learn theory behind why "print(i.extend(j))" DOESN'T work. It's OUTPUT is: "None".  print(j) DOES work (It's OUTPUT is:  "[4, 5, 6, 7, 8, 9]")  i = [1, 2, 3] j = [4, 5, 6] k = [7, 8, 9] # I'd like to learn theory as to why following doesn't work # OUTPUT is: "None"   print(i.extend(j)) # Following does work (OUTPUT is:  "[1, 2, 3, 4, 5]") j.extend(k) print(j)

Why does python 2.5.2 have the following behavior  >>>[2].extend([]) == [2] False  >>> [2].extend([]) == None True  $ python --version Python 2.5.2   I assume I'm not understanding something here, but intuitively I'd think that [2].extend([]) should yield [2]


I mostly use my mobile device to go on Stack Overflow as it uses less internet data, but when I want to review something it's not easy as it's only available in full site view. Can there please also be a feature for mobile reviewing?

The other day I was looking at Stack Overflow on my Android phone. All is made very nice and all, but I could not find the Review button/link. Is it being implemented, did I miss it, or it is not available?


We have to prove that  $$ \tan  20°\cdot  \tan  40° \cdot  \tan  60° \cdot  \tan  80° = 3$$  I tried to use the formula   $$\displaystyle\frac {\tan a+\tan b}{1-\tan a\cdot \tan b}$$  But in that I got stuck .

How can I find the following product using elementary trigonometry?  $$ \tan 20^\circ \cdot \tan 40^\circ \cdot \tan 80^\circ.$$  I have tried using a substitution, but nothing has worked.


When I run autoremove I get the following. I am in root and have tried running sudo apt install -f without luck. This issue occurred because I ran sudo apt install mongodb and realized that the command installs v 3.6 and I needed the latest version, so I used mongodb documentation to install mongodb 4.4. Any suggestions would be much appreciated! mandi@mandi:~$ sudo apt autoremove Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt --fix-broken install' to correct these. The following packages have unmet dependencies:  mongodb-org-tools : Depends: mongodb-database-tools but it is not installed E: Unmet dependencies. Try 'apt --fix-broken install' with no packages (or specify a solution). mandi@mandi:~$ apt --fix-broken install E: Could not open lock file /var/lib/dpkg/lock-frontend - open (13: Permission denied) E: Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend), are you root?

I get this error whenever I try to install programs using the terminal:  home@ubuntu:~$ apt-get install myunity E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied) E: Unable to lock the administration directory (/var/lib/dpkg/), are you root?   Also I'm unable to install updates using the terminal.


I was trying to add missions to my museum in Minecraft, and i tried adding an extra text part to my /tellraw message. The command is below, copy/pasted from a command block:     tellraw @p {"text":"(Mission #1)","color":"blue","extra":[{"text":"There are FungusKing_III heads hidden around the museum. See if you can find them all!","color":"dark_blue""}}   Why isn't this working, and how can I fix it?

I've been at this for almost two hours and no one seems to have the same problem as I and I doubt this will be solved but I'll try anyway.  this is the code  /tellraw @p ["Would you like to teleport?",{"text":"Yes","color":"green","bold":"true","clickEvent":{"action":"run_command","value":"/tp @p ~ ~4 ~ "},"hoverEvent":{"action":"show_text","value":{"text":"Confirm"}},{"text":"No","color":"red","bold":"true","clickEvent":{"action":"run_command","value":"/tellraw @p{"text":"Come back when you want to teleport"}"}}}]   this part is fine  /tellraw @p ["Would you like to teleport?",{"text":"Yes","color":"green","bold":"true","clickEvent":{"action":"run_command","value":"/tp @p ~ ~4 ~ "},"hoverEvent":{"action":"show_text","value":{"text":"Confirm"}}   it's just when I add this  ,{"text":"No","color":"red","bold":"true","clickEvent":{"action":"run_command","value":"/tellraw @p{"text":"Come back when you want to teleport"}"}}}]   Minecraft gives me the error:     Invalid JSON at line 1 column 203   I've tried to space it out and figure out what column 203 is but I can't, I don't know what I did. Anyone got any ideas?


Sorry if this is a basic question, but I just want to be sure about this because I am doing some research. I have never been sure what the number in brackets means in scientific values like this.  $$1.672\,621\,637(83) \times 10^{-27}\:\mathrm{kg}$$  In this example, would this mean that the maximum is $1.672\,621\,720 \times 10^{-27}\:\mathrm{kg}$ and the minimum is $1.672\,621\,554 \times 10^{-27}\:\mathrm{kg}$ ?  Could this also be written $1.672\,621\,637\times 10^{-27} \pm 0.000\,000\,083 \times 10^{-27}\:\mathrm{kg}$?

In a physics text book I read the following:     $$e/m=1.758820150(44) ×10^{11} \mathrm{C/kg} $$    In this expression, $(44)$ indicates the likely uncertainty in the last two digits, $50$.   How should I understand this uncertainty? Does it mean $\pm 44$ on the last two digits?