Search results for " computing"
showing 10 items of 2075 documents
The comparison of reliabilities in dental imaging methods.
2003
Objectives: Common practice in the statistical comparison of imaging instruments with limited reproducibility consists in the separate estimation of the instrument's reliabilities. However, as soon as one of the imaging methods is subject to item-specific bias (which has to be expected in many dentomaxillofacial imaging procedures), this approach will end in severe errors in reliability computation and in corresponding erroneous clinical conclusions. This paper seeks to point out these effects and to illustrate a more appropriate model for the comparison of instrumental reliabilities. Methods: A standard reliability model was adjusted for item-specific bias and illustrated by the comparison…
Pattern formation in clouds via Turing instabilities
2020
Pattern formation in clouds is a well-known feature, which can be observed almost every day. However, the guiding processes for structure formation are mostly unknown, and also theoretical investigations of cloud patterns are quite rare. From many scientific disciplines the occurrence of patterns in non-equilibrium systems due to Turing instabilities is known, i.e. unstable modes grow and form spatial structures. In this study we investigate a generic cloud model for the possibility of Turing instabilities. For this purpose, the model is extended by diffusion terms. We can show that for some cloud models, i.e special cases of the generic model, no Turing instabilities are possible. However,…
Co-simulated Digital Twin on the Network Edge: the case of platooning
2022
This paper presents an approach to create high fidelity Digital-Twin models for distributed multi-agent cyber-physical systems based on the combination of simulating components, generated from different modeling languages, each tailored for the specific domain of the subsystem. The approach specifically addresses the wireless communication domain, exploiting a Python module as a simulating component to evaluate the impact of network delay among the distributed elements of the system under analysis. A case study with a platoon of four vehicles following a leading car, all modeled in Simulink, is used to show the applicability of the approach, allowing the comparison between a Vehicle-to-Vehi…
"Table 19" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
2-jet rate for the Durham Algorithm.
"Table 27" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Differential 2-jet rate for the Durham Algorithm. Corrected to final state particles. YCUT is the jet finding cutt-off parameter.
The Challenges for Regulation and Control in an Environment of Rapid Technological Innovations
2019
Currently, amplified use of the ITC-technologies and digitalization in almost all industries has changed the value and significance of the information. The use of these new technologies offer tremendous opportunities for innovation and development, but at the same time ask for regulation and control policies to ensure appropriate storage and use of information and avoid illicit utilization of data. Moreover, use of innovative technologies such as blockchain-based technology, artificial intelligence, cloud technology, and others has complicated and disrupted the landscape of the financial services providers and their ancillary service providers such as auditors, underwriters, advisors, actua…
Hierarchies of probabilistic and team FIN-learning
2001
AbstractA FIN-learning machine M receives successive values of the function f it is learning and at some moment outputs a conjecture which should be a correct index of f. FIN learning has two extensions: (1) If M flips fair coins and learns a function with certain probability p, we have FIN〈p〉-learning. (2) When n machines simultaneously try to learn the same function f and at least k of these machines output correct indices of f, we have learning by a [k,n]FIN team. Sometimes a team or a probabilistic learner can simulate another one, if their probabilities p1,p2 (or team success ratios k1/n1,k2/n2) are close enough (Daley et al., in: Valiant, Waranth (Eds.), Proc. 5th Annual Workshop on C…
On the regularity of circular splicing languages : A survey and new developments
2009
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focus on the relationship between regular circular languages and languages generated by finite circular splicing systems. We survey the known results towards a characterization of the intersection between these two classes and provide new contributions on the open problem of finding this characterization. First, we exhibit a non-regular circular language generated by a circular simple system thus disproving a known result in this area. Then we give new results related to a restrictive class of circular splicing systems…
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
2007
The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…
Balls into non-uniform bins
2014
Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…