938 resultados para Distances between Predicates
Resumo:
The purpose is to develop expert systems where by-analogy reasoning is used. Knowledge “closeness” problems are known to frequently emerge in such systems if knowledge is represented by different production rules. To determine a degree of closeness for production rules a distance between predicates is introduced. Different types of distances between two predicate value distribution functions are considered when predicates are “true”. Asymptotic features and interrelations of distances are studied. Predicate value distribution functions are found by empirical distribution functions, and a procedure is proposed for this purpose. An adequacy of obtained distribution functions is tested on the basis of the statistical 2 χ –criterion and a testing mechanism is discussed. A theorem, by which a simple procedure of measurement of Euclidean distances between distribution function parameters is substituted for a predicate closeness determination one, is proved for parametric distribution function families. The proposed distance measurement apparatus may be applied in expert systems when reasoning is created by analogy.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
"This volume cancels the 1987 (7th) edition".
Resumo:
Shaw-Shoemaker #10462.
Resumo:
Issued without the Shipmaster's assistant which was published separately in 1822 under the title: The merchant's and shipmaster's assistant.
Resumo:
Bearing damage in modern inverter-fed AC drive systems is more common than in motors working with 50 or 60 Hz power supply. Fast switching transients and common mode voltage generated by a PWM inverter cause unwanted shaft voltage and resultant bearing currents. Parasitic capacitive coupling creates a path to discharge current in rotors and bearings. In order to analyze bearing current discharges and their effect on bearing damage under different conditions, calculation of the capacitive coupling between the outer and inner races is needed. During motor operation, the distances between the balls and races may change the capacitance values. Due to changing of the thickness and spatial distribution of the lubricating grease, this capacitance does not have a constant value and is known to change with speed and load. Thus, the resultant electric field between the races and balls varies with motor speed. The lubricating grease in the ball bearing cannot withstand high voltages and a short circuit through the lubricated grease can occur. At low speeds, because of gravity, balls and shaft voltage may shift down and the system (ball positions and shaft) will be asymmetric. In this study, two different asymmetric cases (asymmetric ball position, asymmetric shaft position) are analyzed and the results are compared with the symmetric case. The objective of this paper is to calculate the capacitive coupling and electric fields between the outer and inner races and the balls at different motor speeds in symmetrical and asymmetrical shaft and balls positions. The analysis is carried out using finite element simulations to determine the conditions which will increase the probability of high rates of bearing failure due to current discharges through the balls and races.
Resumo:
Spontaneous facial expressions differ from posed ones in appearance, timing and accompanying head movements. Still images cannot provide timing or head movement information directly. However, indirectly the distances between key points on a face extracted from a still image using active shape models can capture some movement and pose changes. This information is superposed on information about non-rigid facial movement that is also part of the expression. Does geometric information improve the discrimination between spontaneous and posed facial expressions arising from discrete emotions? We investigate the performance of a machine vision system for discrimination between posed and spontaneous versions of six basic emotions that uses SIFT appearance based features and FAP geometric features. Experimental results on the NVIE database demonstrate that fusion of geometric information leads only to marginal improvement over appearance features. Using fusion features, surprise is the easiest emotion (83.4% accuracy) to be distinguished, while disgust is the most difficult (76.1%). Our results find different important facial regions between discriminating posed versus spontaneous version of one emotion and classifying the same emotion versus other emotions. The distribution of the selected SIFT features shows that mouth is more important for sadness, while nose is more important for surprise, however, both the nose and mouth are important for disgust, fear, and happiness. Eyebrows, eyes, nose and mouth are important for anger.
Resumo:
The conformational dependence of interproton distances in model proline peptides has been investigated in order to facilitate interpretation of the results of Nuclear Overhauser Effect (NOE) studies on such peptides. For this purpose two model systems, namely, Ac-Pro-NHMe and Ac-Pro-X-NHMe have been chosen and used. In the former, short interproton distances detectable in NOE experiments permit a clear distinction between conformations with Pro ψ = -300 (helical region) and those in which ψ is around 1200 (polyproline region). For the latter, the variation of distances between the protons of methyl amide and the Pro ring have been studied by superimposing on the Ramachandran map in the (φ3, ψ3) plane. The results show that β-turns and non-β-turn conformations can be readily distinguished from NOE data and such long range NOEs should be detectable for specific non-β-turn conformations. NOEs involving Cβ and Cγ protons are particularly sensitive to the state of pyrrolidine ring puckering.
Resumo:
Abstract. Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [14] showed that for any fixed ε> 0, stretch 1 1 + ε distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in Õ(n ω) time, where ω < 2.376 is the exponent of matrix multiplication and n is the number of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that all-pairs stretch 3 distances can be computed in Õ(n 2) time and all-pairs stretch 7/3 distances can be computed in Õ(n 7/3) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2+ε) distances in G, for any 0 < ε < 1. We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4 logn). This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G. 1
Resumo:
Given a metric space with a Borel probability measure, for each integer N, we obtain a probability distribution on N x N distance matrices by considering the distances between pairs of points in a sample consisting of N points chosen independently from the metric space with respect to the given measure. We show that this gives an asymptotically bi-Lipschitz relation between metric measure spaces and the corresponding distance matrices. This is an effective version of a result of Vershik that metric measure spaces are determined by associated distributions on infinite random matrices.
Resumo:
We examined movement patterns of sportfish that were tagged in the northern Indian River Lagoon, Florida, between 1990 and 1999 to assess the degree of fish exchange between an estuarine no-take zone (NTZ) and surrounding waters. The tagged f ish were from seven species: red drum (Sciaenops ocellatus); black drum (Pogonias cromis); sheepshead (Archosargus probatocephalus); common snook (Centropomus undecimalis); spotted seatrout (Cynoscion nebulosus); bull shark (Carcharhinus leucas); and crevalle jack (Caranx hippos). A total of 403 tagged fish were recaptured during the study period, including 65 individuals that emigrated from the NTZ and 16 individuals that immigrated into the NTZ from surrounding waters of the lagoon. Migration distances between the original tagging location and the sites where emigrating fish were recaptured were from 0 to 150 km, and these migration distances appeared to be influenced by the proximity of the NTZ to spawning areas or other habitats that are important to specific life-history stages of individual species. Fish that immigrated into the NTZ moved distances ranging from approximately 10 to 75 km. Recapture rates for sportfish species that migrated across the NTZ boundary suggested that more individuals may move into the protected habitats than move out. These data demonstrated that although this estuarine no-take reserve can protect species from fishing, it may also serve to extract exploitable individuals from surrounding fisheries; therefore, if the no-take reserve does function to replenish surrounding fisheries, then increased egg production and larval export may be more important mechanisms of replenishment than the spillover of excess adults from the reserve into fishable areas.
Resumo:
Abstract. We explore the distances between home and work for employees at twenty-eight different employment sites across Northern Ireland. Substantively, this is important for better understanding the geography of labour catchments. Methodologically, with data on the distances between place of residence (566 wards) and place of work for some 15 000 workers, and the use of multilevel modelling (MLM), the analysis adds to the evidence derived from other census-based and survey-based studies. Descriptive analysis is supplemented with MLM that simultaneously explores individual, neighbourhood, and site variations in travel-to-work patterns using hierarchical and cross-classified model specifications, including individual and ecological predictor variables (and their cross-level interactions). In doing so we apportion variability to different levels and spatial contexts, and also outline the factors that shape spatial mobility. We find, as expected, that factors such as gender and occupation influence the distance between home and work, and also confirm the importance of neighbourhood characteristics (such as population density observed in ecological analyses at ward level) in shaping individual outcomes, with major differences found between urban and rural locations. Beyond this, the analysis of variability also points to the relative significance of residential location, with less individual variability in travel-to-work distance between workers within wards than within employment sites. We conclude by suggesting that, whilst some general ‘rules’ about the factors that shape labour catchments are possible (eg workers in rural areas and in higher occupations travel further than others), the complex variability between places highlighted by the MLM analysis illustrates the salience of place-specific uniqueness.
Resumo:
Most active-contour methods are based either on maximizing the image contrast under the contour or on minimizing the sum of squared distances between contour and image 'features'. The Marginalized Likelihood Ratio (MLR) contour model uses a contrast-based measure of goodness-of-fit for the contour and thus falls into the first class. The point of departure from previous models consists in marginalizing this contrast measure over unmodelled shape variations. The MLR model naturally leads to the EM Contour algorithm, in which pose optimization is carried out by iterated least-squares, as in feature-based contour methods. The difference with respect to other feature-based algorithms is that the EM Contour algorithm minimizes squared distances from Bayes least-squares (marginalized) estimates of contour locations, rather than from 'strongest features' in the neighborhood of the contour. Within the framework of the MLR model, alternatives to the EM algorithm can also be derived: one of these alternatives is the empirical-information method. Tracking experiments demonstrate the robustness of pose estimates given by the MLR model, and support the theoretical expectation that the EM Contour algorithm is more robust than either feature-based methods or the empirical-information method. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
Background: The purpose of this study was to compare and evaluate bone and soft tissue levels between immediately placed, immediately restored implants positioned in the esthetic anterior region with different interimplant distances (IID). Methods: Forty-nine patients requiring multiple implant restorations in the anterior regions received 152 implants, which were restored immediately. Periapical radiographs and digital images of 99 interimplant sites were taken at the regular follow-up examinations at 0, 6, 12, and 24 months after surgery. They were digitally recorded and analyzed. The presence of the interproximal papilla was assessed and compared to the distances between the bone crest and the contact point between the natural teeth and the restoration crowns. Results: Implants with an IID <2 mm seemed to lose less bone laterally. When the IID was <2 mm, vertical crestal bone loss was significantly greater than in the group with IID >4 mm. The percentage of the interproximal papilla presence decreased when the distance between the bone crest and the contact point between the two restoration crowns was >6 mm and when two implants were placed at a distance >= 4 mm. Conclusions: To guarantee a better esthetic result in immediately placed, immediately restored implants, the contact point between the two prosthetic crowns should be placed at 3 to 4 mm, and never >6 mm, from the bone peak. Two adjacent implants should be placed at a distance >2 and <4 mm.