Random forest “certainty / likelihood score” - how to score records in RF mode in R?
Do the predictions of a Random Forest model have a prediction interval?
Why is causality preserved in special relativity? PART 1: I was reading the article  Wikipedia. I couldn't understand this line:       "if the two events are causally connected ("event A causes event B"), the causal order is preserved (i.e., "event A precedes event B") in all frames of reference."     Is this an assumption or a consequence of STR? Please explain.       Note: My question consists of 2 parts this is the 2nd part. Below is a genral version of my previous question question:.   PART 2: Let there be three events $A$,$B$ and $C$ s.t: $C$ is the result of Simultaneous occurrence of $A$ and $B$. In other words $C$ occurs iff $A$ and $B$ are simultaneous. Now as we know in STR any two events separated in space are not simultaneous in different frames. So In some frames $C$ will occur and in some $C$ will not occur which will cause paradox. I tried many thought experiments to make such a paradox but i failed. In all the experiments that i thought i could not break the causality even by breaking the simultaneity because everytime the fact: "all signals move slower than light" preserved the causality.    So why causlity remains preserved always? Is it due to the fact that nothing can move faster than light? problem with surfaces on tkz-fct i am using this wonderful tool that tkz-fct is for creating nice documents but I have a weird result from recently. This is my document :  \documentclass[10pt,a4paper]{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{calc} \usepackage{color} \usepackage{pifont}                     %pour utiliser la police Ding \usepackage[left=1.5cm,right=1.5cm,top=2cm,bottom=2cm]{geometry} %marges du document \usepackage[french]{babel} \usepackage[usenames,dvipsnames]{xcolor} \usepackage[L]{thmbox} \usepackage{eurosym} \usepackage{enumitem}               %pour modifer itemize et enumerate \usepackage{amsmath,amsfonts,amssymb} \usepackage{mathrsfs}               %pour utiliser mathscr \usepackage{array,multirow,makecell} \usepackage{fancyhdr}               %package pour modifier les en-têtes \usepackage{fancybox}               %pour boîtes spéciales \usepackage{tikz,tkz-tab,tkz-fct} \usepackage{tikz-dependency}        %permet de créer des schemas \usepackage{sectsty}                %permet de modifier les styles des sections (voir \sectionfont l.21) \usepackage{fourier-orns} \usepackage{shadethm}               %pour theoremes en gris \setcellgapes{1pt} \makegapedcells \newcolumntype{R}[1]{&gt;{\raggedleft\arraybackslash }b{#1}}   %pour redéfinir les colonnes dans tabular \newcolumntype{L}[1]{&gt;{\raggedright\arraybackslash }b{#1}} \newcolumntype{C}[1]{&gt;{\centering\arraybackslash }b{#1}} \renewcommand{\thesection}{\Roman{section}} %permet de changer la numérotation en chiffres romains des sections \newshadetheorem{defi}{Définition}  %crée un nouveau type de théorème \newshadetheorem{thm}{Théorème} \newshadetheorem{ppte}{Propriété} \sectionfont{\sectionrule{3ex}{3pt}{-1.5ex}{1pt}} %mettre un trait de séparation dans les sections (package sectsty) \pagestyle{fancy} %style en-têtes \lhead{} %en-tête gauche \chead{Lois à densité} %en-tête centrale \rhead{T\up{ale}} %en-tête droite \begin{document} \begin{tikzpicture}      \tkzInit[xmin=-4,xmax=4,ymax=1]      \tkzDrawX[label={},noticks]      %\tkzDrawY      \tkzFct[domain=-2:2]{exp(-x**2)}      \tkzDrawArea[color=blue, domain = -0.5:1]      \tkzText(-1,0.75){$\mathscr{C}_{f}$} \end{tikzpicture} \end{document}   But from now, it doesn't produce the result I would like as the surface start from the point (-0.5,f(-0.5)) and not as an integral from -0.5 to 1. This is a picture of the result :   Which is obviously not what I would like and this extends now to all my "old" docs which were "normal" before. I don't think I have done anything special except updating my Tex distribution ... If someone has an idea ?? Calculating MEAN and STANDARD DEVIATION confussed ERROR: cuvid requested, but not all dependencies are satisfied: cuda/ffnvcodec I am trying to compile FFMPEG with Nvidia Cuda support, on Debian 9.3. Parameters, what I am using:  --enable-cuda --enable-cuvid --enable-nvenc --extra-cflags=-I/usr/local/cuda/include --extra-ldflags=-L/usr/local/cuda/lib64 --enable-gpl --enable-libx264 --disable-x86asm --enable-libx265 --enable-libfdk-aac --enable-nonfree   Nvidia Cuda with drivers are installed. When I try to configure ffmpeg, it says:  ERROR: cuvid requested, but not all dependencies are satisfied: cuda   Newer ffmpeg will show a similar, re-worded message:  ERROR: cuda requested, but not all dependencies are satisfied: ffnvcodec   I absolutely don't know why I'm having this issue, because I am compiling ffmpeg on all of our trans-coding servers. After a table of addresses is geocoded, ArGIS provides information about each geocoded address, among those the "match score" of the candidate to which the address was matched, which ranges from 0 to 100. According to their documentation "The match score is based on how well the locations found in the reference data match with the address data being searched."  It seems intuitive that 100 means an address with the exact name was found in the Address locator and 0 means no such address was found. However, I could not find any information about how exactly this score is calculated, particularly if values are somewhere between the extremes. I this known?  I found the pointer to  in the answer to , but I could not find any information in that paper that would answer the question. If an elephant can apply 250N force and a rabbit can apply 25N force , and if they are pulling each other , then elephant will pull with 250N force and according to newtons third law the rabbit should also pull the elephant with 250N force.then from where do the rabbit got the extra 225N i.e.(250-25=225) force??? can anyone please explain. I have a simular issue to the question asked in :  I have tried the solution provided by Jake. This makes that my picture fails to resize (scale) as i intend.  Whether i give Set scale=0.4 or Set scale=0.8 The size of the  picture remains the same  This is the code i use:  \begin{figure}[ht!] \centering \begin{tikzpicture}[Set scale=0.4, every node/.append style={transform shape},] % STYLES \tikzstyle{every node}=[rectangle,rounded corners, minimum width=100pt,     align=center,node distance=3cm,fill=black!10,inner sep=5pt,text width=3cm,minimum height=1.75cm,&gt;=stealth,text badly centered] % Draw forces \node [force, above of=rivalry] (top) {Firm strategy, structure and rivalry}; \node [force, left=1cm of rivalry] (left) {Factor conditions}; \node [force, right=1cm of rivalry] (right) {Demand Conditions}; \node [force, below of=rivalry] (bottom) {Related and Supporting industries}; %%%%%%%%%%%%%%%% % Draw the links between forces \path[&lt;-&gt;,thick]  (left) edge (right) (left) edge (top) (left) edge (bottom) (top) edge (right) (bottom) edge (right); \path[&lt;-&gt;,thick]  (bottom) edge (top); \end{tikzpicture} \caption{Porter's Diamond source:~\cite{Porter:1980}}% \label{fig:diamond}  \end{figure} Properties vs Methods Quick question: When do you decide to use properties (in C#) and when do you decide to use methods?  We are busy having this debate and have found some areas where it is debatable whether we should use a property or a method. One example is this:  public void SetLabel(string text) {     Label.Text = text; }   In the example, Label is a control on a ASPX page. Is there a principle that can govern the decision (in this case) whether to make this a method or a property.  I'll accept the answer that is most general and comprehensive, but that also touches on the example that I have given. If $m,n\in N$ Prove that there is such a positive integer k, such that $(\sqrt{m}+\sqrt{m+1})^n=\sqrt{k}+\sqrt{k+1}$ If $m,n\in N$ Prove that there is such a positive integer k, such that $(\sqrt{m}+\sqrt{m+1})^n=\sqrt{k}+\sqrt{k+1}$ I attempted to solve this question using binomial coefficients, saying: $(\sqrt{m}+\sqrt{m+1})^n=\sqrt{k}+\sqrt{k+1}=\sum\limits_{a=0}^n {n\choose a}*\sqrt{m}^{n-a}*\sqrt{m+1}^a$ and from here I was thinking that I had to do something with $\sqrt{m}^{n-a}$ with $\sqrt{k}$ and do something else with $\sqrt{k+1}$ and $\sqrt{m+1}^a$. Unfortunately I couldn't think of what to do with this circumstance. I then thought of maybe taking $(\sqrt{k}+\sqrt{k+1})^2=(\sum\limits_{a=0}^n {n\choose a}*\sqrt{m}^{n-a}*\sqrt{m+1}^a)^2$, but this immediately over-complicated the question. Could you please explain to me how to solve this question and how to solve similar questions in the future? The question is to calculate the radius of convergence of $\sum\limits_{n=0}^\infty n!x^{n^2}$.  I dont know how to calculate R.O.C for such type of questions involving $n^2$ as power of x. How do we do this? Any help appreciated. How to Solve this Arithmetic Progression Question? Please help-  Four different integers form an increasing AP.One of these numbers is equal to the sum of the squares of the other three numbers.Then- find all the four numbers.  I assumed the numbers to be $a,a+d,a+2d,a+3d$ and wlog let $a+3d$ this number and according to question-  $a^2+(a+d)^2+(a+2d)^2=a+3d$  but I could not solve the above equation. Suppose I have a field that contain the following data:   ========================== |  Email Address         | ========================== | Jack@wonderland.com    | | Peter@nobodyland.com   | | Jill@wonderland.com    | ==========================   Is there a calculated formula in SharePoint that will give me the following result? (It will help me to retrieve the sub-string from the Email Address column and give me the answer as shown in the UserName and Domain column):   =========================================================== |  Email Address         |  UserName  |      Domain       | =========================================================== | Jack@wonderland.com    |   Jack     |   wonderland.com  | | Peter@nobodyland.com   |   Peter    |   nobodyland.com  | | Jill@wonderland.com    |   Jill     |   wonderland.com  | =========================================================== Boosts are non-unitary! Unlike rotations, the boost transformations are non-unitary. Therefore, the boost generators are not Hermitian. When boosts induce transformations in the Hilbert space, will those transformation be unitary? I think no. If that is the case, what is the physical significance of such non-unitary transformations corresponding to boosts in the Hilbert space? Should I delete my own questions with answers? I don't know much about this,  But I've some of the questions on which some user has answered (not helpful answer) also but I want to delete those questions, but whenever I go to delete that question. It is prompting with     What does it mean? Can someone tell me what would be the action taken by Stack Exchange if I delete more questions? Unit testing code which has logic around the CreatedDate I have two Date values. I need to find number of weeks between them. I want to do it Apex Class. Not looking for formula fields.  So far I tried:  Integer numberofweeks = (projectStartDate - opp.Project_Start_Date__c)/7;    I receive this error:     Date arithmetic expressions must use Integer or Long arguments Here is a question as phrased in Advanced Linear Algebra (Steven Roman):     Show that a linear operator $\tau$ on a finite-dimensional complex inner product space $V$ is normal if and only if whenever $S$ is an invariant subspace under $\tau$, so is $S^\perp$.   I'm only interested in the $\Rightarrow$ direction. Wikipedia (and ProofWiki)  that uses some kind of computation with the trace. Linear Algebra Done Right chooses an orthonormal basis and then uses the fact that $\Vert \tau v \Vert = \Vert \tau^* v \Vert$.  However, the above  proofs seem a bit too computational to me. Can the following argument work?  (Use $\odot$ for orthogonal direct sum.) Suppose that $\tau$ is normal and write $$V=E_{\lambda_1} \odot \cdots \odot E_{\lambda_k}$$ where the $E_{\lambda_i}$ are the eigenspaces of $\tau$. If $S$ is a $\tau$-invariant subspace then $\tau|_S$ is diagonalizable, so $$S=\widetilde{E}_{\lambda_1} \odot\cdots\odot \widetilde{E}_{\lambda_k}$$ where the $\widetilde{E}_{\lambda_i} \le E_{\lambda_i}$ are the eigenspaces of $\tau|_S$ (which could be trivial). Then choose orthogonal complements $D_i$ such that $E_{\lambda_i} = \widetilde{E}_{\lambda_i} \odot D_i$, and then $$S^\perp = D_1 \odot\cdots\odot D_k.$$ Since each $D_i$ is a subspace of an eigenspace, they are all $\tau$-invariant. I have the Xiaomi Mi A3 and I'm currently on both phone and PC latest stock update. I am using Windows 10 20H2 and I have tried everything – but still don't get it. I tried another Mi A3 and it got attached normally. I've tried installing all kind of drivers and different ports, nothing. When suddenly it worked and I installed the stock ROM – but because the stock ROM is kinda laggy and ugly I want to change it. But I can't because I am also on stock recovery and I can't install another recovery because my device isn't recognized in fastboot mode. My device is recognized in adb mode and in edl mode as well, only not in fastboot. How to compute the size of the allocated memory for a general type The Megahertz Myth became a promotional tactic due to differences between the PC's INTEL 8086 processor and Apple's Rockwell 6502 processor.  The 8086 ran at 4.77MHz while the 6502 ran at 1MHz.  However, instructions on the 6502 needed fewer cycles; so many fewer, in fact, that it ran faster than the 8086.  Why do some instructions need fewer cycles?  And why can't the instructions of the 6502, needing fewer cycles, be combined with a fast cycling processor of the 8086?  Wikipedia's article for instructions per cycle (IPC) says     Factors governing IPC   A given level of instructions per second can be achieved with a high IPC and a low clock speed...or from a low IPC and high clock speed.   Why can't you have both high instructions per cycle and high clock speed?  Maybe this has to do with what a clock cycle is?  Wikipedia mentions synchronization of circuits?  Not sure what that means.  Or maybe this has to do with how a pipeline works?  I'm not sure why instructions in a short pipeline are different from instructions in a long pipeline.  Any insight would be great!  Just trying to understand the architecture behind the myth.  Thanks!  References: