Results for variables · 0.171s

arxiv.org/abs/cond-mat/0104215v1

Monte Carlo: Basics

An introduction to the basics of Monte Carlo is given. The topics covered include, sample space, events, probabilities, random variables, mean, variance, covariance, characteristic function, chebyshev inequality, law of large numbers, central limit...

github.com/symfony/routing

symfony/routing

Maps an HTTP request to a set of configuration variables (⭐ 7632)

Sponsored Partners
stats.stackexchange.com/questions/409503/anova-vs-t-test-for-two-groups

ANOVA vs. T-test for two groups - Cross Validated

May 23, 2019 · alternatively, you could inverse the relation and model the independent group variable as a function of the dependent variables. This is especially interesting with the multivariate type of …

stats.stackexchange.com/questions/636545/sample-notation-when-to-use-capital-n-vs-lowercase-n

Sample notation: When to use capital $N$ vs lowercase $n$?

Jan 10, 2024 · Use standard type for Greek letters, subscripts and superscripts that function as identifiers (i.e., are not variables, as in the subscript “girls” in the example that follows), and …

arxiv.org/abs/0809.3676v1

RCF1: Theories of PR Maps and Partial PR Maps

We give to the categorical theory PR of Primitive Recursion a logically simple, algebraic presentation, via equations between maps, plus one genuine Horner type schema, namely Freyd's uniqueness of the initialised iterated. Free Variables are intro...

arxiv.org/abs/2011.02683v2

Nonparametric Variable Screening with Optimal Decision Stumps

Decision trees and their ensembles are endowed with a rich set of diagnostic tools for ranking and screening variables in a predictive model. Despite the widespread use of tree based variable importance measures, pinning down their theoretical proper...

stackoverflow.com/questions/3518938/what-are-magic-numbers-in-computer-programming

What are "magic numbers" in computer programming?

Aug 19, 2010 · Magic numbers are special value of certain variables which causes the program to behave in an special manner. For example, a communication library might take a Timeout parameter …

arxiv.org/abs/0806.0797v1

ULTRACAM photometry of eclipsing cataclysmic variable stars

The accurate determination of the masses of cataclysmic variable stars is critical to our understanding of their origin, evolution and behaviour. Observations of cataclysmic variables also afford an excellent opportunity to constrain theoretical ph...

arxiv.org/abs/2402.01616v1

Functions of Several Variables

Apart from an account of classical preliminaries, this volume contains a systematic introduction to Sobolev spaces and functions of bounded variation with selected applications. This is installment III of a four part discussion of certain aspects of...

arxiv.org/abs/1205.4345v4

Involving copula functions in Conditional Tail Expectation

Our goal in this paper is to propose an alternative risk measure which takes into account the fluctuations of losses and possible correlations between random variables. This new notion of risk measures, that we call Copula Conditional Tail Expectatio...

arxiv.org/abs/math/9908131v1

Umbral presentations for polynomial sequences

Using random variables as motivation, this paper presents an exposition of the formalisms developed by Rota and Taylor for the classical umbral calculus. A variety of examples are presented, culminating in several descriptions of sequences of binom...

arxiv.org/abs/1903.06291v3

Resilience Analysis for Competing Populations

Ecological resilience refers to the ability of a system to retain its state when subject to state variables perturbations or parameter changes. While understanding and quantifying resilience is crucial to anticipate the possible regime shifts, charac...

arxiv.org/abs/2411.04599v1

Increasing stability for inverse acoustic source problems

In this paper, we show the increasing stability of the inverse source problems for the acoustic wave equation in the full space R3.The goal is to understand increasing stability for wave equation in the time domain. If the time and spatial variables...

arxiv.org/abs/2006.07357v2

Hindsight Logging for Model Training

In modern Machine Learning, model training is an iterative, experimental process that can consume enormous computation resources and developer time. To aid in that process, experienced model developers log and visualize program variables during train...

arxiv.org/abs/1002.3633v1

Convergence of Heston to SVI

In this short note, we prove by an appropriate change of variables that the SVI implied volatility parameterization presented in Gatheral's book and the large-time asymptotic of the Heston implied volatility agree algebraically, thus confirming a c...

stackoverflow.com/questions/7610491/how-to-pass-variable-as-a-parameter-in-execute-sql-task-ssis

How to pass variable as a parameter in Execute SQL Task SSIS?

Sep 30, 2011 · Click the parameter mapping in the left column and add each paramter from your stored proc and map it to your SSIS variable: Now when this task runs it will pass the SSIS variables to the …

arxiv.org/abs/1312.2143v1

A composition theorem for parity kill number

In this work, we study the parity complexity measures ${\mathsf{C}^{\oplus}_{\min}}[f]$ and ${\mathsf{DT^{\oplus}}}[f]$. ${\mathsf{C}^{\oplus}_{\min}}[f]$ is the \emph{parity kill number} of $f$, the fewest number of parities on the input variables o...

arxiv.org/abs/1906.05460v1

Factorized Mutual Information Maximization

We investigate the sets of joint probability distributions that maximize the average multi-information over a collection of margins. These functionals serve as proxies for maximizing the multi-information of a set of variables or the mutual informati...

arxiv.org/abs/astro-ph/0609482v1

SRVs in the Solar Neighbourhood

Period-luminosity sequences have been shown to exist among the Semi-Regular Variables (SRVs) of the Magellanic Clouds (Wood et al, 1999), the Bulge of the Milky Way galaxy (Glass & Schultheis, 2003) and elsewhere. It would clearly be useful to have...

arxiv.org/abs/2206.06354v4

Differentiable and Transportable Structure Learning

Directed acyclic graphs (DAGs) encode a lot of information about a particular distribution in their structure. However, compute required to infer these structures is typically super-exponential in the number of variables, as inference requires a swee...

arxiv.org/abs/1610.03029v1

Lower bounds for CSP refutation by SDP hierarchies

For a $k$-ary predicate $P$, a random instance of CSP$(P)$ with $n$ variables and $m$ constraints is unsatisfiable with high probability when $m \gg n$. The natural algorithmic task in this regime is \emph{refutation}: finding a proof that a given ra...

arxiv.org/abs/1505.04383v3

How to refute a random CSP

Let $P$ be a $k$-ary predicate over a finite alphabet. Consider a random CSP$(P)$ instance $I$ over $n$ variables with $m$ constraints. When $m \gg n$ the instance $I$ will be unsatisfiable with high probability, and we want to find a refutation - i....

arxiv.org/abs/2108.11709v2

Cancellation and skew cancellation for Poisson algebras

We study the Zariski cancellation problem for Poisson algebras in three variables. In particular, we prove those with Poisson bracket either being quadratic or derived from a Lie algebra are cancellative. We also use various Poisson algebra invariant...

arxiv.org/abs/2210.06258v1

Exploring Children's Use of Self-Made Tangibles in Programming

Defining abstract algorithmic structures like functions and variables using self-made tangibles can enhance the usability and affordability of the tangible programming experience by maintaining the input modality and physical interaction throughout t...

arxiv.org/abs/1203.5859v4

Sparse Hamburger Moment Sequences

Putinar and Vasilescu [6] have given an algebraic characterization of Hamburger moment sequences in several variables. In this paper we study some sparse moment subsequences of Hamburger moment sequences and consider the problem of completion of thes...