937 resultados para terminological equivalence
Resumo:
From the angle of energy transformation an equation was obtained for the brittle transition in polymer blends. The effects of interparticle distance, temperature and strain rate on the brittle-tough transition in polymer blends were characterized by this equation. The calculations show that, for this transition: (1) increasing temperature and decreasing interparticle distance are equivalent and the shift factor increases with increasing temperature; (2) decreasing strain rate and decreasing interparticle distance have equivalent effects on the transition; (3) the strain rate must be optimum in order to find the brittle-tough transition phenomena for a given temperature region. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.
Resumo:
This report studies when and why two Hidden Markov Models (HMMs) may represent the same stochastic process. HMMs are characterized in terms of equivalence classes whose elements represent identical stochastic processes. This characterization yields polynomial time algorithms to detect equivalent HMMs. We also find fast algorithms to reduce HMMs to essentially unique and minimal canonical representations. The reduction to a canonical form leads to the definition of 'Generalized Markov Models' which are essentially HMMs without the positivity constraint on their parameters. We discuss how this generalization can yield more parsimonious representations of stochastic processes at the cost of the probabilistic interpretation of the model parameters.
Resumo:
R. Daly, Q. Shen and S. Aitken. Speeding up the learning of equivalence classes of Bayesian network structures. Proceedings of the 10th International Conference on Artificial Intelligence and Soft Computing, pages 34-39.
Resumo:
R. Daly, Q. Shen and S. Aitken. Using ant colony optimisation in learning Bayesian network equivalence classes. Proceedings of the 2006 UK Workshop on Computational Intelligence, pages 111-118.
Resumo:
R. Daly and Q. Shen. A Framework for the Scoring of Operators on the Search Space of Equivalence Classes of Bayesian Network Structures. Proceedings of the 2005 UK Workshop on Computational Intelligence, pages 67-74.
Resumo:
Salmon, Naomi, 'What's 'Novel' About It? Substantial Equivalence, Precaution and Consumer Protection 1997-2004', Environmental Law Review, (2005), 7(2) pp.138-149 RAE2008
Resumo:
A neural network is introduced which provides a solution of the classical motor equivalence problem, whereby many different joint configurations of a redundant manipulator can all be used to realize a desired trajectory in 3-D space. To do this, the network self-organizes a mapping from motion directions in 3-D space to velocity commands in joint space. Computer simulations demonstrate that, without any additional learning, the network can generate accurate movement commands that compensate for variable tool lengths, clamping of joints, distortions of visual input by a prism, and unexpected limb perturbations. Blind reaches have also been simulated.
Resumo:
Given a relation α (a binary sociogram) and an a priori equivalence relation π, both on the same set of individuals, it is interesting to look for the largest equivalence πo that is contained in and is regular with respect to α. The equivalence relation πo is called the regular interior of π with respect to α. The computation of πo involves the left and right residuals, a concept that generalized group inverses to the algebra of relations. A polynomial-time procedure is presented (Theorem 11) and illustrated with examples. In particular, the regular interior gives meet in the lattice of regular equivalences: the regular meet of regular equivalences is the regular interior of their intersection. Finally, the concept of relative regular equivalence is defined and compared with regular equivalence.
Resumo:
Social network analysts have tried to capture the idea of social role explicitly by proposing a framework that precisely gives conditions under which group actors are playing equivalent roles. They term these methods positional analysis techniques. The most general definition is regular equivalence which captures the idea that equivalent actors are related in a similar way to equivalent alters. Regular equivalence gives rise to a whole class of partitions on a network. Given a network we have two different computational problems. The first is how to find a particular regular equivalence. An algorithm exists to find the largest regular partition but there are not efficient algorithms to test whether there is a regular k-partition. That is a partition in k groups that is regular. In addition, when dealing with real data, it is unlikely that any regular partitions exist. To overcome this problem relaxations of regular equivalence have been proposed along with optimisation techniques to find nearly regular partitions. In this paper we review the algorithms that have developed to find particular regular equivalences and look at some of the recent theoretical results which give an insight into the complexity of finding regular partitions.
Resumo:
A practical CFD method is presented in this study to predict the generation of toxic gases in enclosure fires. The model makes use of local combustion conditions to determine the yield of carbon monoxide, carbon dioxide, hydrocarbon, soot and oxygen. The local conditions used in the determination of these species are the local equivalence ratio (LER) and the local temperature. The heat released from combustion is calculated using the volumetric heat source model or the eddy dissipation model (EDM). The model is then used to simulate a range of reduced-scale and full-scale fire experiments. The model predictions for most of the predicted species are then shown to be in good agreement with the test results