When i use findparameterdistribution parameters are diffient from in reasearch why?
Chen weibull distribution
I get how a normal fork bomb works, but I don't really understand why the &amp; at the end of the common bash fork bomb is required and why these scripts behave differently:  :(){ (:) | (:) }; :   and   :(){ : | :&amp; }; :   The former causes a cpu usage spike before throwing me back to the login screen. The latter instead just causes my system to freeze up, forcing me to hard reboot. Why is that? Both continually create new processes, so why does the system behave differently?   Both of the scripts also behave differently from  :(){ : | : }; :   which doesn't cause any problems at all, even though I would have expected them to be alike. The bash manual page states that the commands in a pipeline are already executed in a subshell, so I'm led to believe that : | : should already suffice. I belive &amp; should just run the pipeline in a new subshell, but why does that change so much?  Edit: Using htop and limiting the amount of processes, I was able to see that the first variant creates an actual tree of processes, the second variant creates all the processes on the same level and the last variant doesn't seem to create any processes at all. This confuses me even more, but maybe it helps somehow? Increase close vote weight for gold tag badge holders In order to increase the efficiency with which poor quality questions are closed, it could make sense to have weighted close votes for a small subset of qualified users.   A very good way to measure the qualified users would be to leverage the tag badges. However, it needs to be rationally limited to a set of users that are knowledgeable with the subject. A very good way to measure the top users in a tag would be to look at those who have a gold badge in the tag.  If two users who have a gold tag badge pertinent to a question issue a close vote, the question should probably be closed (or probably will be very soon under the current system). I think it would make sense to allow users with a gold tag badge to have a 3x weight for close votes in those tags.  Please keep in mind, this isn't suggesting full moderator one click closure. It only adds weight to the vote. A single user could not do it on their own. These singular users cast close votes all the time, so that aspect would not change. Some will vote to close, some wont, but the ones who do should have a stronger weight to their vote. Even with 3x it will require 2 of said votes to accomplish, or still 2 other users (meaning 3 agreed it should be closed - which is the same amount of high rep users it takes to delete a question and that has a much greater impact than closure).  tldr;  Allow gold tag badge users to have a weighted close vote in their tag Keyboard shortcut/command for opening a new nautilus window and raise it What is the shortcut for opening a new window (opening folders). for that I have to go to folder options and right click and then need to click on open new window.  or I have to make focus on the folder icon or open a folder then press  Ctrl+N  for opening a new window is there any direct command spcific to open a new window in ubuntu. Why can only some child meta sites host chat rooms? Is there any way to bypass this restriction? When I try to create a new  room from , and type "meta" in the "select a site" box, I see only 8 child meta sites. Any specific reason for this?  Update:  I just noted  (pointed out by ). The conclusion of the experiment there was:        This experiment suggests that only the meta sites, for which at least   one room already exists, are offered.   ...the distinction between beta sites and graduated sites is not sufficient to explain this.      So, if I'm reading it correctly, it is currently impossible to create a room hosted on those child metas which do not already have an existing meta room (smells like a bug!)? Or is there a way to bypass this restriction somehow?  I can think of several legitimate reasons as to why a site may choose to keep their main chat rooms and meta chat rooms separate. Killing off that freedom of choice, and that too non-uniformly, isn't a good idea. If this really is a  rather than  (for a good cause), then it should be fixed! Conditional Expectation of Composite Function Preliminaries  Let $(\Omega, \mathcal{G}, \mathbb{P})$ be a complete probability space.  Let $D$ be a complete, separable, metrizable topological space with Borel $\sigma$-algebra $\mathcal{B}(D)$ (such as $D = \mathbb{R}^q$ with $\sigma$-algebra $\mathcal{B}(D) = \mathcal{B}(\mathbb{R}^d)$).  Let $\mathbb{R}$ be equipped with its canonical Borel $\sigma$-algebra $\mathcal{B}(\mathbb{R})$.  Let $g: \Omega \times D \rightarrow \mathbb{R}$ be a bounded $(\mathcal{G} \otimes \mathcal{B}(D) ) / \mathcal{B}(\mathbb{R})$-measurable function.  Let $\Pi: \Omega \rightarrow D$ be a $\mathcal{G}/\mathcal{B}(D)$-measurable random variable.  Let $H : \Omega \rightarrow \mathbb{R}$ be a $\mathcal{G}/\mathcal{B}(\mathbb{R})$-measurable random variable, defined by $$ H(\omega) := g(\omega, \Pi(\omega)).$$ Note, that, since $g$ is bounded, we have $H \in \mathcal{L}^2(\Omega, \mathcal{G}, \mathbb{P})$.  Let $j: D \rightarrow \mathcal{L}^2(\Omega, \mathcal{G}, \mathbb{P}) $ be defined by $$ j(\pi)(\omega) := g(\omega, \pi)  $$  For all $\pi \in D$, let $j(\pi)$ be independent of $\Pi$.  Question  I am interested in the conditional expectation $$\mathbb{E}[H \mid \Pi] :\Omega \rightarrow \mathbb{R}$$ of $H$ with respect to $\Pi$. More specifically, I suspect that (a $\mathbb{P}$-unique version of) this condititional expectation is given by  $$ \mathbb{E}[H \mid \Pi] (\omega) = \mathbb{E}[j(\Pi(\omega))], \quad (\dagger)  $$ whereby $\mathbb{E}[j(\Pi(\omega))]$ can of course also be written as $$\mathbb{E}[j(\Pi(\omega))] = \int_{\Omega} j(\Pi(\omega))(\tilde{\omega}) d\mathbb{P}(\tilde{\omega}) . $$  How can I prove, that $(\dagger)$ is the case? I have tried, tracking the definition of conditional expectation and using Fubini, but with little success so far.  Thanks for any advice! I have Opportunity-lookup field on Opportunity (self),  Scenario:   Opportunity A if select Opportunity B using lookup then Opportunity B's same lookup field automatically populate with Opportunity A.   I tried to achieve this using trigger - before insert/update but its failing as:  System.DmlException: Update failed. First exception on row 0 with id 006G000000DHaBlIAL; first error: SELF_REFERENCE_FROM_TRIGGER, Object (id = 006G000000DHaBl) is currently in trigger Oppy_before_INSUPD, therefore it cannot recursively update itself: [] I want to earn Unicoins for free but I can't seem to find the best way mine coins faster. There are also sometimes when I get 20-30 Unicoins at one time, and I think that there is some clue so that we can know which rocks contain lots of Unicoins.. So do you have any idea you can share? ecommerce item deleted by user, 301 redirect to HOME PAGE or 404 not found? I use bash on both my Mac and as my cygwin shell. Overall, I'm quite pleased with it.  My one complaint however is that its TAB completion isn't as good as Windows Command Line TAB completion.   For example, if there are two files with the same prefix, then bash just beeps at me when I try to TAB complete. If I keep nailing TAB, then it will eventually show me a list of potential files.  I definately prefer how Windows will cycle through potential files right on the command line.   Is there a way to get bash to operate similar to Windows Command Line in this regard?  If there isn't (I do not want to switch shells), am I missing something about TAB completion in bash? Is there a more efficient way to use it? How to sort an array of objects containing null elements? Redshift of merging black holes How did they found that the gravitational waves where emitted at redshift $z=0.09$?  I understand the measurement of redshift for an electromagnetic wave where we have measured in a lab various transitions and therefore we can make a comparison with the wavelength we receive.  But how can they manage to get the redshift for the emitter of gravitational waves, since we have no reference? I have my A* pathfinding algorithm right now working such that given a graph it can find the route from one starting node to one goal node.   This works well for many problems, but sometimes I find that multiple goal nodes are valid.  For example, in a game, an NPC might have to go to a switch to shut a door. If there are multiple switches that shut the door in question, it doesn't matter which switch it goes to - it just needs to go to one of them.  How can I augment my pathfinding algorithm to find the path to the best goal (the shortest path)? As in, the algorithm searches for multiple goals and when it finds just one, it returns the path to that one.  One solution would be to run the algorithm as many times as there are valid goals, but you can guess why that might be inefficient. How to get a UK visa refund I applied online for a visa application to the UK. I'm from Sri Lanka. Yesterday I cancelled the appointment, I changed my mind. I will not go to the visa appointment. Now my question is how I get my refund? How do I install Adobe Air using "Ubuntu Software Centre" I tried:   Launching Ubuntu Software Centre I typed in "air" and found "adobe air" It says "available from the 'maverick-partner' source. and has a button "use this source" I clicked "use this source", I saw a "in progress (1)" icon come up in the side bar, and disappear, but nothing happened/changed.   I'm stuck.  I have actually already added the maverick-partner source to apt so I could install sun-java6-jdk. Recently I created a website with hundreds of thousands of unique pages. A week ago, Google had indexed about 250,000 pages. It has now decreased to 90k URLs (using a site:domain.com query).   What should I do to have Google index all the pages again? Why did all these pages get de-indexed from Google?. Cannot access any files on Samsung Tab 4 7" Browsers redirect to level3.com if domain does not exist If I enter a URL incorrectly, my Firefox browser occasionally redirects me to    This occurs in Chrome too. I've restarted Firefox in safe mode, and it still happens I've restarted Windows 10 in safe mode, and it still happens I've installed Hitman Pro Alert. The scan found nothing, and could not prevent the redirect. My HOSTS file is clean. My ethernet settings IPv4 properties use Google's DNS: 8.8.8.8 and 8.8.4.4 The only other issue I have is when visiting  which produces numerous pop-up windows, unless I disable scripts. I have Comodo Internet Security (antivirus and firewall) installed, and it identifies nothing.   Any other suggestions? How does Python evaluate the expression 1+++2?  How many ever + I put in between, it is printing 3 as the answer. Please can anyone explain this behavior  And for 1--2 it is printing 3 and for 1---2 it is printing -1 Can I install Python 3.x and 2.x on the same Windows computer? Careers: create PDF is not handling properly the sections Writing and Reading Scenario #1: no items in the section Writing, a few items in Reading   click on create pdf in the PDF you get your readings under the title "Writing" (should be "Reading")   Scenario #2: one item in the section Writing, a few items in Reading   click on create pdf in the PDF you get:   your readings under the title "Writing" (should be "Reading"), as in scenario #1 there are no writings (there should be one)    Hope it to be clear. Let me know in case it isn't.  Thank you!