Search results for " algorithms"
showing 10 items of 612 documents
"Table 17" of "Search for a Heavy Neutral Particle Decaying to $e\mu$, $e\tau$, or $\mu\tau$ in $pp$ Collisions at $\sqrt{s}=8$ TeV with the ATLAS De…
2015
Cut flow for signal $\tilde{\nu}_{\tau}$ and Z' at 1TeV mass point.
Classification of Plant Ecological Units in Heterogeneous Semi-Steppe Rangelands: Performance Assessment of Four Classification Algorithms.
2021
Plant Ecological Unit’s (PEUs) are the abstraction of vegetation communities that occur on a site which similarly respond to management actions and natural disturbances. Identification and monitoring of PEUs in a heterogeneous landscape is the most difficult task in medium resolution satellite images datasets. The main objective of this study is to compare pixel-based classification versus object-based classification for accurately classifying PEUs with four selected different algorithms across heterogeneous rangelands in Central Zagros, Iran. We used images of Landsat-8 OLI that were pan-sharpened to 15 m to classify four PEU classes based on a random dataset collected in the field (40%). …
Minimal Absent Words in Rooted and Unrooted Trees
2019
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.
The positioning system of the ANTARES Neutrino Telescope
2012
The ANTARES neutrino telescope, located 40km off the coast of Toulon in the Mediterranean Sea at a mooring depth of about 2475m, consists of twelve detection lines equipped typically with 25 storeys. Every storey carries three optical modules that detect Cherenkov light induced by charged secondary particles (typically muons) coming from neutrino interactions. As these lines are flexible structures fixed to the sea bed and held taut by a buoy, sea currents cause the lines to move and the storeys to rotate. The knowledge of the position of the optical modules with a precision better than 10cm is essential for a good reconstruction of particle tracks. In this paper the ANTARES positioning sys…
Next generation diagnostic algorithm in non-small cell lung cancer predictive molecular pathology: The KWAY Italian multicenter cost evaluation study
2022
Abstract Aims The KWAY project aims to investigate the economic sustainability of the up-front NGS technologies adoption in the analysis of clinically relevant molecular alterations in NSCLC patients. Methods The diagnostic workflow and the related sustained costs of five Italian referral centers were assessed in four different evolving scenarios were analyzed. For each scenario, two alternative testing strategies were evaluated: the Maximized Standard strategy and the Maximized NGS strategy. Results For each center, the robustness of obtained results was verified through a deterministic sensitivity analysis, observing the variation of total costs based on a variation of ±20 % of the input …
A probabilistic rainfall model to estimate the leading-edge lifetime of wind turbine blade coating system
2021
Rain-induced leading-edge erosion of wind turbine blades is associated with high repair and maintenance costs. For efficient operation and maintenance, erosion models are required that provide estimates of blade coating lifetime at a real scale. In this study, a statistical rainfall model is established that describes probabilistic distributions of rain parameters that are critical for site-specific leading-edge erosion assessment. A new droplet size distribution (DSD) is determined based on two years’ onshore rainfall data of an inland site in the Netherlands and the obtained DSD is compared with those from the literature. Joint probability distribution functions of rain intensities and dr…
The linear saturated decentralized strategy for constrained flow control is asymptotically optimal
2013
We present an algorithm for constrained network flow control in the presence of an unknown demand. Our algorithm is decentralized in the sense that it is implemented by a team of agents, each controlling just the flow on a single arc of the network based only on the buffer levels at the nodes at the extremes of the arc, while ignoring the actions of other agents and the network topology. We prove that our algorithm is also stabilizing and steady-state optimal. Specifically, we show that it asymptotically produces the minimum-norm flow. We finally generalize our algorithm to networks with a linear dynamics and we prove that certain least-square optimality properties still hold.
Quantized Dissensus in switching networks with nodes death and duplication* *Research supported by MURST-PRIN “Robust Techniques for uncertain system…
2009
Abstract In this paper we discuss agents exchanging quantized flows to diverge one from the others according to a dissensus protocol. A Quantized Gossip algorithm is considered. Evolutions of the states during switching intervals and at switching instants and their property are described and analyzed. The modeling of switching systems describing networks where death and duplication processes occur is described. Some properties of the topology reached by the network when different rules of duplication and inheritance are implemented.
On Using the Theory of Regular Functions to Prove the ε-Optimality of the Continuous Pursuit Learning Automaton
2013
Published version of a chapter in the book: Recent Trends in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-38577-3_27 There are various families of Learning Automata (LA) such as Fixed Structure, Variable Structure, Discretized etc. Informally, if the environment is stationary, their ε-optimality is defined as their ability to converge to the optimal action with an arbitrarily large probability, if the learning parameter is sufficiently small/large. Of these LA families, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. The…
A Constructive Arboricity Approximation Scheme
2020
The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.