A Network of Analog Metal Oxide Semiconductor Circuits for Motion Detection with Local Adaptation to a Background Image

Inspired by a mechanism of biological vision systems, a model and a network of analog metal oxide semiconductor (MOS) circuits are proposed which display an optical flow with local adaptation to the relative velocity of a background image. A function of displaying an optical flow successfully worked as a result of simulations using the simulation program with integrated circuit emphasis (SPICE). A function of varying an optical flow at a certain instant by local adaptation was also demonstrated. The proposed network is suitable for the realization of a large-scale integrated circuit (LSI), which displays an optical flow with local adaptation to the local velocity of a background.     

Organizational implications of systems thinking: Multidimensional modular design

Despite a well recognized systemic principle that parts of an organization are interdependent and the nature of their interaction defines the behavior of the whole, we have stubbornly held to the illusion that each function is more or less self-contained and can be treated independently. For a majority of managers the unidimensional mode of organization based on structurally defined tasks, segmentation and hierarchical coordination of functions seems to be the only acceptable way of organizing the work. A predominant management culture continues to value narrow specialization very dearly and considers any forms of redundancy in the organizational structure as wasteful and inefficient. However, the ability to adapt requires some forms of flexibility and responsiveness, which in turn demands that some degree of redundancy be built into the system.The required level of interaction and flexibility in an organization can be achieved by creating a modular structure embedded in a multidimensional scheme. The resulting mode of organization is capable of redesigning its structure and redefining its functions, so that it can exhibit different behaviors and produce different outcomes in the same or different environments.     

Symmetry adaptation of configuration basis in MCSCF method

Summary A novel approach of space symmetry adaptation is developed for multiconfigurational (MC) functions in fully optimized reaction space and complete active space SCF calculations. The bonded tableau and two box symmetric tableau are basic representations (rep) of configuration functions; the group symmetric localized orbitals are used as one-electron orbitals. The method is proposed for generating a complete and orthonormal set of MC single excited functions. The redundant variable in MCSCF can be eliminated by symmetry adaptation.     

Towards the Development and Applications of Manifestly Spin-free Multi-reference Coupled Electron-pair Approximation-like Methods: A State Specific Approach

As a practical tool of being applicable to bigger molecules, a full-blown state-specific multi-reference coupled cluster formalism developed by us (Mahapatra et al. in J Chem Phys 110:6171, 1999) would be rather demanding computationally, and it is worthwhile to look for physically motivated approximation schemes which capture a substantial portion of the correlation of the full-blown theory. In this spirit, we have recently proposed coupled electron-pair approximation (CEPA)-like various approximants to the parent spin-adapted state-specific multi-reference coupled cluster (SS-MRCC) theory which depend on the inclusion of EPV terms to various degree. Here, the space of excitations is confined to the first order interactive virtual space generated by the cluster operator, but the EPV terms are included exactly. We call them spin-free state specific multi-reference CERA (SS-MRCEPA) theories. They work within the complete active space (CAS) and have been found to be very effective in bypassing the intruders, similar in performance to that of the parent SS-MRCC theory. The spin-adaptation of the working equations of both the SS-MRCC and the CEPA-like approximants is a non-trivial exercise. In this paper, we delineate briefly the essentials of a spin-free formulation of the SS-MRCC and SS-MRCEPA theories. This allows us to include open-shell configuration state functions (CSF) in the CAS. We consider three variants of SS-MRCEPA method. Two are explicitly orbital invariant: (1) SS-MRCEPA(0), a purely lineralized version of the SS-MRCC theory, (2) SS-MRCEPA(I), which includes all the EPV terms explicitly and exactly in an orbital invariant manner and (3) the SS-MRCEPA(D), which emerges when we keep only the diagonal terms of a set of dressed operators in the working equations. Unlike the first two, the third version is not invariant under the orbital transformation within the set of doubly occupied core, valence and virtual orbitals. The SS-MRCEPA methods produce very encouraging results as was evidenced in the applications on the computation of potential energy surfaces for the ground states of LiH and HF molecules.     

Barrier variational generation of quasi‐isometric grids

A grid generation method based on the minimization of the discrete barrier functional with feasible set consisting of quasi‐isometric grids is suggested. The deviation from isometry for given grid connectivity and prescribed boundary conditions is minimized via the contraction of the feasible set into a small vicinity of the optimal grid. Formulation of functional with given metrics in both physical and logical spaces allows to consider the adaptive grid generation in terms of quasi‐isometric grids and cover many practical applications. A fast and reliable grid untangling procedure based on the penalty‐like reformulation of barrier functional and the continuation technique is described. Numerical experiments demonstrate that the suggested functional produces high‐quality grids with small global condition numbers. Copyright © 2001 John Wiley & Sons, Ltd.     

How neutral networks influence evolvability

Evolutionary algorithms apply the process of variation, reproduction, and selection to look for an individual capable of solving the task at hand. In order to improve the evolvability of a population we propose to copy important characteristics of nature's search space. Desired characteristics for a genotype–phenotype mapping are described and several highly redundant genotype–phenotype mappings are analyzed in the context of a population‐based search. We show that evolvability, defined as the ability of random variations to sometimes produce improvement, is influenced by the existence of neutral networks in genotype space. Redundant mappings allow the population to spread along the network of neutral mutations and the population is quickly able to recover after a change has occurred. The extent of the neutral networks affects the interconnectivity of the search space and thereby affects evolvability. © 2002 Wiley Periodicals, Inc.     

A fully adaptive approximation for quenching‐type reaction‐diffusion equations over circular domains

This article studies a fully adaptive finite difference method for solving quenching‐type nonlinear reaction‐diffusion equations over circular domains. Although an auxiliary condition at the origin and radial symmetry are imposed, adaptations are accomplished via arc‐length‐based monitoring functions in space and time, respectively. The monotonicity and positivity of the numerical solution are proved following a suitable grid constraint, and the numerical stability is ensured in the von Neumann sense. Theoretical bounds of the critical quenching radius are obtained and then refined through the computation. Computational examples are provided to illustrate the effectiveness and plausibility of the new adaptive computational procedure developed. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 472–489, 2014     

群体智能对产业集群自适应行为描述的研究

侧重研究了产业集群的自适应行为的描述,借鉴群集智能的理论算法来描述集群中的典型自适应行为,具体包括改进蚁群分工模型用于描述集群核心能力的自适应形成行为、改进蚁群合作搬运模型用于描述集群中自适应合作行为和借鉴蚁群算法中信息素思想描述集群中的自适应竞争行为,这些自适应行为模型将为进一步形成产业集群的建模仿真提供了基础．     

Mesh regularization for an ALE code based on the limitation of the Lagrangian mesh velocity

The Lagrangian approach is usually used for the simulation of flow with strong shock waves. Moreover, this approach is particularly well suited to treatment of material interfaces in the case of multimaterial flows.Unfortunately, this formulation leads to very large deformations in the mesh. The arbitrary Lagrangian‐Eulerian method overcomes this drawback by using a mesh regularization that is based on an analysis of cell geometry. The regularization step may be considered as a method used to correct the nonconvex and potentially tangled cells that constitute the mesh. In this paper, we present a new approach to mesh regularization. Instead of using a purely geometric criterion, we propose that the mesh evolution is computed on the basis of the flow vorticity. This approach is called the large Eddy limitation method, and it is aimed here to be used in finite volume direct arbitrary Lagrangian‐Eulerian methods. The large Eddy limitation method is general, which means that it is not restricted to applications in the finite volume framework dedicated to fluid flow simulation; for instance, it could also be naturally applied to the finite element framework.