In this paper we study a security problem of protecting secrets with multiple protections and minimum costs. The target system is modeled as a discrete-event system (DES) in which a few states are secrets, and there are multiple subsets of protectabl...
Note: A team must have a minimum of 10 recorded game scores as of the last update (3/04) in order to appear in the rankings. Teams that do not yet meet the 10 minimum can be found under the …
An algorithm is presented that solves the Minimum Dominating Set problem exactly using polynomial space based on dynamic programming for a tree decomposition. A direct application of dynamic programming based on a tree decomposition would result in a...
We present and analyse the sunspot observations performed by Franz I. C. Hallaschka in 1814 and 1816. These solar observations were carried out during the so-called Dalton minimum, around the maximum phase of the Solar Cycle 6. These records are very...
As we are heading towards the next solar cycle, presumably with a relatively small amplitude, it is of significant interest to reconstruct and describe the past grand minima on the basis of actual observations of the time. The Dalton Minimum is often...
Note: A team must have a minimum of 10 recorded game scores as of the last update (3/04) in order to appear in the rankings. Teams that do not yet meet the 10 minimum can be found under the …
Note: A team must have a minimum of 10 recorded game scores as of the last update (3/04) in order to appear in the rankings. Teams that do not yet meet the 10 minimum can be found under the …
Note: A team must have a minimum of 10 recorded game scores as of the last update (3/04) in order to appear in the rankings. Teams that do not yet meet the 10 minimum can be found under the …
The global minimum-variance portfolio is a typical choice for investors because of its simplicity and broad applicability. Although it requires only one input, namely the covariance matrix of asset returns, estimating the optimal solution remains a c...
Points: 6 | Comments: 0 | Author: radmuzom
Note: A team must have a minimum of 10 recorded game scores as of the last update (3/04) in order to appear in the rankings. Teams that do not yet meet the 10 minimum can be found under the …
We establish an instructive experiment to investigate the minimum time curve traveled by a small billiard ball rolling in a grooved track under gravity. Our intention is to popularize the concept of \textit{minimum time curve} anew, and to propose it...
Note: A team must have a minimum of 10 recorded game scores as of the last update (3/04) in order to appear in the rankings. Teams that do not yet meet the 10 minimum can be found under the …
In computational geometry, the minimum bounding rectangle (MBR), also known as bounding box (BBOX) or envelope, is an expression of the maximum extents
In addition to regular Schwabe cycles (~ 11 years), solar activity also shows longer periods of enhanced or reduced activity. Of these, reconstructions of the Dalton Minimum provide controversial sunspot group numbers and limited sunspot positions, p...
Note: A team must have a minimum of 10 recorded game scores as of the last update (3/04) in order to appear in the rankings. Teams that do not yet meet the 10 minimum can be found under the …
A summary of some of the recent minimum bias and underlying event measurements by the ATLAS collaboration is given. The results of several analyses using low-luminosity proton-proton collision data from the LHC taken at center-of-mass energies of sqr...
An overview of minimum bias and underlying event studies at the LHC with the ATLAS and CMS detectors is presented. Current uncertainties in the modeling of soft pp inelastic interactions at the LHC energy scale are discussed. Triggers used to selec...
We provide a constructive proof of the Seymour Second Neighborhood Conjecture (SSNC) by reframing the problem as a set-packing optimization problem. The universal family of oriented graphs $\mathcal{O}$ is classified by their minimum out-degree $δ$....
Nov 25, 2013 · How can I prove that the minimum of two exponential random variables is another exponential random variable, i.e. Z = min(X,Y)