Search results for "complexity"
showing 10 items of 1094 documents
Solution to nonlinear MHDS arising from optimal growth problems
2011
Abstract In this paper we propose a method for solving in closed form a general class of nonlinear modified Hamiltonian dynamic systems (MHDS). This method is used to analyze the intertemporal optimization problem from endogenous growth theory, especially the cases with two controls and one state variable. We use the exact solutions to study both uniqueness and indeterminacy of the optimal path when the dynamic system has not a well-defined isolated steady state. With this approach we avoid the linearization process, as well as the reduction of dimension technique usually applied when the dynamic system offers a continuum of steady states or no steady state at all.
The Reconstruction of Polyominoes from Approximately Orthogonal Projections
2001
The reconstruction of discrete two-dimensional pictures from their projection is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression. In this note, we determine the computational complexity of the problem of reconstruction of polyominoes from their approximately orthogonal projections. We will prove that it is NP-complete if we reconstruct polyominoes, horizontal convex polyominoes and vertical convex polyominoes. Moreover we will give the polynomial algorithm for the reconstruction of hv-convex polyominoes that has time complexity O(m3n3).
Mappings of finite distortion: The sharp modulus of continuity
2003
We establish an essentially sharp modulus of continuity for mappings of subexponentially integrable distortion.
Matrix-based complexity functions and recognizable picture languages
2008
Molecular shape analysis based upon the morse-smale complex and the connolly function
2003
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical considerations. In the mid-eighties, Connolly proposed a docking algorithm matching surface knobs with surface depressions. Knobs and depressions refer to the extrema of the Connolly function, which is defined as follows. Given a surface M bounding a three-dimensional domain X, and a sphere S centered at a point p of M, the Connolly function is equal to the solid angle of the portion of S containing within X.We recast the notions of knobs and depressions in the framework of Morse theory for functions defined over two-dimensiona…
A methodology for the reduction of imprecision in the engineering process
1997
Abstract Engineering design is characterized by a high level of imprecision, vague parameters, and ill-defined relationships. In design, imprecision reduction must occur to arrive at a final product specification. Few design systems exist for adequately representing design imprecision, and formally reducing it to precise values. Fuzzy set theory has considerable potential for addressing the imprecision in design. However, it lacks a formal methodology for system development and operation. One repercussion of this is that imprecision reduction is, at present, implemented in a relatively ad-hoc manner. The main contribution of this paper is to introduce a methodology called precision converge…
Research on complement: old issues revisited and a novel sphere of influence
2003
Immunology in recent years has taken a somewhat surprising turn, expressed by a renewed interest in innate immunity. Especially intriguing is the regulatory role exerted by the innate components on the adaptive response, with Toll receptors and complement components being the most investigated. This function has been firmly established for complement protein CR2 (CD21) as part of the BCR co-receptor CD19/CD21/CD81. New findings are now providing a broader picture of complement and its tuning of the immune response; for example, complement proteins have been implicated in the control of T-cell-mediated responses. We will review some of these data here and summarize new discoveries in areas o…
A fuzzy approach to the evaluation of image complexity
2009
The inherently multidimensional problem of evaluating the complexity of an image is of a certain relevance in both computer science and cognitive psychology. Computer scientists usually analyze spatial dimensions in order to deal with automatic vision problems, such as feature extraction. Psychologists seem more interested in the temporal dimension of complexity, as a means to explore attentional models. Is it possible to define, by merging both approaches, a more general index of visual complexity? The aim of this paper is the definition of objective measures of image complexity that fits with the so named perceived time. Towards the end we have defined a fuzzy mathematical model of visual…
Aquapentachlororhenate(iv): a singular and promising building block for metal assembly
2015
The novel ReIV compound of formula PPh4[ReIVCl5(H2O)] (1) is the first example of a ReIV compound containing a coordinated water molecule which has been magnetostructurally studied.
ChemInform Abstract: Hf27Si6P10, a Novel Metal-Rich Compound with P2 Groups.
2010
The new ternary metal rich compound Hf27Si6P10 has been synthesized by reduction of HfP with Hf and Si; Hf27Si6P10 crystallizes in a new structure type, a characteristic and unexpected feature of which is the presence of P2 groups; the structural results are interpreted with the aid of high-level band structure calculations.