Topological methods for some boundary value problems

We establish existence of solutions for a finite difference approximation to y = f(x, y, y ') on [0, 1], subject to nonlinear two-point Sturm-Liouville boundary conditions of the form g(i)(y(i),y ' (i)) = 0, i = 0, 1, assuming S satisfies one-sided growth bounds with respect to y '. (C) 2001 Elsevier Science Ltd. All rights reserved.

Lattice-dome design using a knowledge-based system approach

In the design of lattice domes, design engineers need expertise in areas such as configuration processing, nonlinear analysis, and optimization. These are extensive numerical, iterative, and lime-consuming processes that are prone to error without an integrated design tool. This article presents the application of a knowledge-based system in solving lattice-dome design problems. An operational prototype knowledge-based system, LADOME, has been developed by employing the combined knowledge representation approach, which uses rules, procedural methods, and an object-oriented blackboard concept. The system's objective is to assist engineers in lattice-dome design by integrating all design tasks into a single computer-aided environment with implementation of the knowledge-based system approach. For system verification, results from design examples are presented.

Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Stiffly accurate Runge-Kutta methods for stiff stochastic differential equations

In this paper we discuss implicit methods based on stiffly accurate Runge-Kutta methods and splitting techniques for solving Stratonovich stochastic differential equations (SDEs). Two splitting techniques: the balanced splitting technique and the deterministic splitting technique, are used in this paper. We construct a two-stage implicit Runge-Kutta method with strong order 1.0 which is corrected twice and no update is needed. The stability properties and numerical results show that this approach is suitable for solving stiff SDEs. (C) 2001 Elsevier Science B.V. All rights reserved.

A formal representation of assumptions in process modelling

In this work, we present a systematic approach to the representation of modelling assumptions. Modelling assumptions form the fundamental basis for the mathematical description of a process system. These assumptions can be translated into either additional mathematical relationships or constraints between model variables, equations, balance volumes or parameters. In order to analyse the effect of modelling assumptions in a formal, rigorous way, a syntax of modelling assumptions has been defined. The smallest indivisible syntactical element, the so called assumption atom has been identified as a triplet. With this syntax a modelling assumption can be described as an elementary assumption, i.e. an assumption consisting of only an assumption atom or a composite assumption consisting of a conjunction of elementary assumptions. The above syntax of modelling assumptions enables us to represent modelling assumptions as transformations acting on the set of model equations. The notion of syntactical correctness and semantical consistency of sets of modelling assumptions is defined and necessary conditions for checking them are given. These transformations can be used in several ways and their implications can be analysed by formal methods. The modelling assumptions define model hierarchies. That is, a series of model families each belonging to a particular equivalence class. These model equivalence classes can be related to primal assumptions regarding the definition of mass, energy and momentum balance volumes and to secondary and tiertinary assumptions regarding the presence or absence and the form of mechanisms within the system. Within equivalence classes, there are many model members, these being related to algebraic model transformations for the particular model. We show how these model hierarchies are driven by the underlying assumption structure and indicate some implications on system dynamics and complexity issues. (C) 2001 Elsevier Science Ltd. All rights reserved.

On the relation between the conditional moment closure and unsteady flamelets

We consider the relation between the conditional moment closure (CMC) and the unsteady flamelet model (FM). The CMC equations were originally constructed as global equations, while FM was derived asymptotically for a thin reaction zone. The recent tendency is to use FM-type equations as global equations. We investigate the possible consequences and suggest a new version of FM: coordinate-invariant FM (CIFM). Unlike FM, CIFM complies with conditional properties of the exact transport equations which are used effectively in CMC. We analyse the assumptions needed to obtain another global version of FM: representative interactive flamelets (RIF), from original FM and demonstrate that, in homogeneous turbulence, one of these assumptions is equivalent to the main CMC hypothesis.

Design, modelling and analysis of a six component force balance for hypervelocity wind tunnel testing

A combination of modelling and analysis techniques was used to design a six component force balance. The balance was designed specifically for the measurement of impulsive aerodynamic forces and moments characteristic of hypervelocity shock tunnel testing using the stress wave force measurement technique. Aerodynamic modelling was used to estimate the magnitude and distribution of forces and finite element modelling to determine the mechanical response of proposed balance designs. Simulation of balance performance was based on aerodynamic loads and mechanical responses using convolution techniques. Deconvolution was then used to assess balance performance and to guide further design modifications leading to the final balance design. (C) 2001 Elsevier Science Ltd. All rights reserved.

Analysis of flexural waves excited by rectangular contact type transducers

In this paper, an attempt was made to investigate a fundamental problem related to the flexural waves excited by rectangular transducers. Due to the disadvantages of the Green's function approach for solving this problem, a direct and effective method is proposed using a multiple integral transform method and contour integration technique. The explicit frequency domain solutions obtained from this newly developed method are convenient for understanding transducer behavior and theoretical optimization and experimental calibration of rectangular transducers. The time domain solutions can then be easily obtained by using the fast Fourier transform technique. (C) 2001 Elsevier Science B.V. All rights reserved.

Dendritic branching patterns of pyramidal cells in the visual cortex of the new world marmoset monkey, with comparative notes on the old world macaque monkey

The basal dendritic arbors of 442 supragranular pyramidal cells in visual cortex of the marmoset monkey were compared by fractal analyses. As detailed in a previous study,(1) individual cells were injected with Lucifer Yellow and processed for a DAB reaction product. The basal dendritic arbors were drawn, in the tangential plane, and the fractal dimension (D) determined by the dilation method. The fractal dimensions were compared between cells in ten cortical areas containing cells involved in visual processing, including the primary visual area (Vi), the second visual area (V2), the dorsoanterior area (DA), the dorsomedial area (DM), the dorsolateral. area (DL), the middle temporal area (MT), the posterior parietal area (PP), the fundus of the superior temporal area (FST) and the caudal and rostral subdivisions of inferotemporal cortex (ITc and ITr, respectively). Of 45 pairwise interareal comparisons of the fractal dimension of neurones, 20 were significantly different. Moreover, comparison of data according to previously published visual processing pathways revealed a trend for cells with greater fractal dimensions in higher cortical areas. Comparison of the present results with those in homologous cortical areas in the macaque monkey(2) revealed some similarities between the two species. The similarity in the trends of D values of cells in both species may reflect developmental features which, result in different functional attributes.

Pyramidal neurones in macaque visual cortex: Interareal phenotypic variation of dendritic branching patterns

The basal dendritic arbors of over 500-layer III pyramidal neurones of the macaque cortex were compared by fractal analyses, which provides a measure of the space filling (or branching pattern) of dendritic arbors. Fractal values (D) of individual cells were compared between the cytochrome oxidase (CO)-rich blobs and CO-poor interblobs, of middle and upper layer III, and between sublaminae, in the primary visual area (Vi). These data were compared with those in the CO compartments in the second visual area (V2), and seven other extrastriate cortical areas. (V4, MT, LIP, 7a, TEO, TE and STP). There were significant differences in the fractal dimensions, and therefore the dendritic branching patterns, of cells in striate and extrastriate areas. Of the 55 possible pairwise comparisons of fractal dimension of neurones in different cortical areas (or CO compartments), 39 proved to be significantly different. The markedly different morphologies of pyramidal cells in the different cortical areas may be one of the features that determine the functional signatures of these cells by influencing the number of inputs received by, and propagation of potentials through, their dendritic arbors.

Stochastic gauges in quantum dynamics for many-body simulations

Quantum dynamics simulations can be improved using novel quasiprobability distributions based on non-orthogonal Hermitian kernel operators. This introduces arbitrary functions (gauges) into the stochastic equations. which can be used to tailor them for improved calculations. A possible application to full quantum dynamic simulations of BEC's is presented. (C) 2001 Elsevier Science B.V. All rights reserved.

Fitting a mixture model to three-mode three-way data with missing information

When the data consist of certain attributes measured on the same set of items in different situations, they would be described as a three-mode three-way array. A mixture likelihood approach can be implemented to cluster the items (i.e., one of the modes) on the basis of both of the other modes simultaneously (i.e,, the attributes measured in different situations). In this paper, it is shown that this approach can be extended to handle three-mode three-way arrays where some of the data values are missing at random in the sense of Little and Rubin (1987). The methodology is illustrated by clustering the genotypes in a three-way soybean data set where various attributes were measured on genotypes grown in several environments.

Time evolution in the unimolecular master equation at low temperatures: full spectral solution with scalable iterative methods and high precision

A new method is presented to determine an accurate eigendecomposition of difficult low temperature unimolecular master equation problems. Based on a generalisation of the Nesbet method, the new method is capable of achieving complete spectral resolution of the master equation matrix with relative accuracy in the eigenvectors. The method is applied to a test case of the decomposition of ethane at 300 K from a microcanonical initial population with energy transfer modelled by both Ergodic Collision Theory and the exponential-down model. The fact that quadruple precision (16-byte) arithmetic is required irrespective of the eigensolution method used is demonstrated. (C) 2001 Elsevier Science B.V. All rights reserved.

Using clusters of computers for large QU-GENE simulation experiments

The QU-GENE Computing Cluster (QCC) is a hardware and software solution to the automation and speedup of large QU-GENE (QUantitative GENEtics) simulation experiments that are designed to examine the properties of genetic models, particularly those that involve factorial combinations of treatment levels. QCC automates the management of the distribution of components of the simulation experiments among the networked single-processor computers to achieve the speedup.