Extrapolation of fuzzy values from incomplete data bases

This paper presents different approaches which enable a data base management system to obtain a plausible fuzzy estimate for an attribute value of an item for which the information is not explicitly stored in the data base. This can be made either by a kind of analogical reasoning from information about particular items or by means of expert rules which specify the (fuzzy) sets of possible values of the attribute under consideration, for various classes of items. Another kind of expert rules enables the system to compute an estimate from the attribute value of another item provided that, in other respects, this latter item sufficiently resembles the item, the value of which we are interested in; then these expert rules are used either for controlling the analogical reasoning process or for enlarging the scope of application of the first kind of expert rules. The different approaches are discussed in the framework of possibility theory.     

Chaos Synchronization between the Coupled Modified Chua's Circuits with Nonlinear Quadratic Function x|x|

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｏｄａｙ ,ｍｕｃｈａｔｔｅｎｔｉｏｎｈａｓｂｅｅｎｐａｉｄｔｏｃｈａｏｓｓｙｎｃｈｒｏｎｉｚａｔｉｏｎ[1 ,2 ] .Ｃｈａｏｓｓｙｎｃｈｒｏｎｉｚａｔｉｏｎｃａｎｍａｉｎｌｙｂｅｃｌａｓｓｉｆｉｅｄｉｎｔｏｔｗｏｔｙｐｅｓｃａｌｌｅｄｍｕｔｕａｌｓｙｎｃｈｒｏｎｉｚａｔｉｏｎａｎｄｍａｓｔｅｒ ｓｌａｖｅｓｙｎｃｈｒｏｎｉｚａｔｉｏｎａｃ ｃｏｒｄｉｎｇｔｏｔｈｅｃｏｕｐｌｉｎｇｃｏｎｆｉｇｕｒａｔｉｏｎ[3,8] .Ｔｈｅｆｏｒ ｍｅｒｉｓｗｉｔｈｂｉ ｄｉｒｅｃｔｉｏｎａｌｃｏ…     

Contextualizing is not nullifying: Reply to Mills (2005).

In omitting crucial words and sentencees, neglecting relevant citations, and overlooking important distinctions, Jon Mills' (see record 2005-04819-001) critique of relational psychoanalysis significantly misrepresents the authors' viewpoint. This viewpoint seeks to contextualize, but not to nullify, individual worlds of experience and their limiting horizons. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Knowledge representation for mathematical discovery: Three experiments in graph theory

This paper describes the nature of mathematical discovery (including concept definition and exploration, example generation, and theorem conjecture and proof), and considers how such an intelligent process can be simulated by a machine. Although the material is drawn primarily from graph theory, the results are immediately relevant to research in mathematical discovery and learning.The thought experiment, a protocol paradigm for the empirical study of mathematical discovery, highlights behavioral objectives for machine simulation. This thought experiment provides an insightful account of the discovery process, motivates a framework for describing mathematical knowledge in terms of object classes, and is a rich source of advice on the design of a system to perform discovery in graph theory. The evaluation criteria for a discovery system, it is argued, must include both a set of behavior to display (behavioral objectives) and a target set of facts to be discovered (factual knowledge).Cues from the thought experiment are used to formulate two hierarchies of representational languages for graphy theory. The first hierarchy is based on the superficial terminology and knowledge of the thought experiment. Generated by formal grammars with set-theoretic semantics, this eminently reasonable approach ultimately fails to meet the factual knowledge criteria. The second hierarchy uses declarative expressions, each of which has a semantic interpretation as a stylized, recursive algorithm that defines a class by generating it correctly and completely. A simple version of one such representation is validated by a successful, implemented system called Graph Theorist (GT) for mathematical research in graph theory. GT generates correct examples, defines and explores new graph theory properties, and conjectures and proves theorems.Several themes run through this paper. The first is the dual goals, behavioral objectives and factural knowledge to be discovered, and the multiplicity of their demands on a discovery system. The second theme is the central role of object classes to knowledge representation. The third is the increased power and flexibility of a constructive (generator) definition over the more traditional predicate (tester) definition. The final theme is the importance of examples and recursion in mathematical knowledge. The results provide important guidance for further research in the simulation of mathematical discovery.     

Corner flow in free liquid films

A lubrication-flow model for a free film in a corner is presented. The model, written in the hyperbolic coordinate system ξ = x ² −y ², η = 2xy, applies to films that are thin in the η-direction. The lubrication approximation yields two coupled evolution equations for the film thickness and the velocity field which, to lowest order, describes plug flow in the hyperbolic coordinates. A free film in a corner evolving under surface tension and gravity is investigated. The rate of thinning of a free film is compared to that of a film evolving over a solid substrate. Viscous shear and normal stresses are both captured in the model and are computed for the entire flow domain. It is shown that normal stress dominates over shear stress in the far field, while shear stress dominates close to the corner. This revised version was published online in October 2005 with corrected page numbers.     

缺省理论的简化

缺省理论△=(D,W)中的缺省规则集D,是该理论的不确定因素.如果能去掉一些缺省规则而又不影响该理论的延伸,则就在一定程度上简化了该理论.本文证明了关于规范缺省理论的延伸的若干性质,利用这些性质,我们可以把某些规范缺省理论在一定条件下得以化简,有的甚至可以把它们化为一阶逻辑理论.     

Disorder effects on the strain response of model polymer networks

Molecular dynamics simulations are used to investigate polymer networks made by either end-linking or randomly crosslinking a melt of linear precursor chains. The resulting network structures are very different, since end-linking leads to nearly ideal monodisperse networks, while random crosslinking leads to polydisperse networks, characterized by an exponential strand length distribution. Networks with average strand length 20 and 100 were generated. These networks were used to study the effects of disorder in the network connectivity on observables averaged either over the entire network or selected sub-structures. Heterogeneities in the randomly crosslinked networks cause significant differences in the localization of monomers, however, neither the localization of crosslinks nor the microscopic strain response are significantly affected. Compared to end-linked networks, randomly crosslinked networks have a slightly increased tube diameter, and as a result a slightly decreased shear modulus, but otherwise identical stress-strain behavior. For the investigated systems, we conclude that the microscopic strain response, tube diameter, and stress-strain relation are all insensitive to the heterogeneities due to the linking process by which the network were made.     

Evaluating part designs for automatic feeding in robotic assembly systems: A geometric analysis of the nesting of polyhedral objects

One of the problems encountered by automatic feeding devices, such as vibratory bowl feeders, in robotic assembly systems is nesting which leads to inseparability of parts and jamming. In this paper, we describe a design evaluation procedure to determine whether a part is prone to nesting and to quantify the degree of nesting. The proposed methodology reduces the 3-D protrusion-hole polyhedral containment problem of nesting to a 2-D polygon containment problem by employing a loop-based feature recognition scheme. Subsequently, the 3-D containment configuration is reconstructed from that of the 2-D by using a strategy calleddrop, pull and push. In this context, we introduce the notion of axis as a characteristic direction of a feature that facilitates the analysis of generalized 3-D polyhedral containment. The algorithms are applicable to generic B-Rep CAD data, and their time and space complexities are polynomial.     

The stress intensity factors for a short crack partially penetrating an inclusion of arbitrary shape

Some approximate solutions for predicting the stress intensity factor of a short crack penetrating an inclusion of arbitrary shape have been developed under mode I and mode II loading conditions. The derivation of the fundamental formula is based on the transformation toughening theory. The transformation strains in the inclusion are induced by the crack-tip field and remotely applied stresses, and approximately evaluated by the Eshelby equivalent inclusion theory. As validated by detailed finite element (FE) analyses, the developed solutions have good accuracy for different inclusion shape and for a wide range of modulus ratio between inclusion and matrix material.     

Measuring consistency in TTL-based caches

We propose a general modeling framework to evaluate the performance of cache consistency algorithms. In addition to the usual hit rate, we introduce the hit^* rate as a consistency measure, which captures the fraction of non-stale downloads from the cache. We apply these ideas to the analysis of the fixed TTL consistency algorithm in the presence of network delays. The hit and hit^* rates are evaluated when requests and updates are modeled by renewal processes. Classical results on the renewal function lead to various bounds.