Smectic A liquid crystal configurations with interface defects

We study planar energy minimizing configurations of smectic A liquid crystal materials and classify the corresponding defect structures. We investigate focal conic configurations in wedge, non‐parallel plates, funnel‐shaped domains, and non‐concentric annuli. The application of the stability condition for focal conics is relevant to the specification of the location of the interfacial defects. Self‐similar structures are discussed for a class of solutions with the same bulk energy. We propose surface energies terms to serve as selection mechanisms of particular self‐similar configurations. We also show how the modelling of chevron texture naturally arises in the present framework. Copyright © 2001 John Wiley & Sons, Ltd.     

Different choices of scaling in homogenization of diffusion and interfacial exchange in a porous medium

Several choices of scaling are investigated for a coupled system of parabolic partial differential equations in a two‐phase medium at the microscopic scale. This system may be regarded as modelling a reaction–diffusion problem, the Stokes problem of single‐phase flow of a slightly compressible fluid or as a heat conduction problem (with or without interfacial resistance), for example. It is shown that, starting with the same problem on the microscopic scale, different choices of scaling of the diffusion coefficients (resp. permeability or conductivity) and the interfacial‐exchange coefficient lead to different types of macroscopic systems of equations. The characterization of the limit problems in terms of the scaling parameters constitutes a modelling tool because it allows to determine the right type of limit problem. New macroscopic models, not previously dealt with, arise and, for some scalings, classical macroscopic models are recovered. Using the method of two‐scale convergence, a unified approach yielding rigorous proofs is given covering a very broad class of different scalings. Copyright © 2008 John Wiley & Sons, Ltd.     

Weak forms of elimination of imaginaries

We study the degree of elimination of imaginaries needed for the three main applications: to have canonical bases for types over models, to define strong types as types over algebraically closed sets and to have a Galois correspondence between definably closed sets B such that A ? B ? acl(A) and closed subgroups of the Galois group Aut(acl(A)/A). We also characterize when the topology of the Galois group is the quotient topology. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The E(NK) model: Extending the NK model to incorporate gene‐by‐environment interactions and epistasis for diploid genomes

The haploid NK model developed by Kauffman can be extended to diploid genomes and to incorporate gene‐by‐environment interaction effects in combination with epistasis. To provide the flexibility to include a wide range of forms of gene‐by‐environment interactions, a target population of environment types (TPE) is defined. The TPE consists of a set of E different environment types, each with their own frequency of occurrence. Each environment type conditions a different NK gene network structure or series of gene effects for a given network structure, providing the framework for defining gene‐by‐environment interactions. Thus, different NK models can be partially or completely nested within the E environment types of a TPE, giving rise to the E(NK) model for a biological system. With this model it is possible to examine how populations of genotypes evolve in context with properties of the environment that influence the contributions of genes to the fitness values of genotypes. We are using the E(NK) model to investigate how both epistasis and gene‐by‐environment interactions influence the genetic improvement of quantitative traits by plant breeding strategies applied to agricultural systems. © 2002 Wiley Periodicals, Inc.     

考虑多种类型缺陷的软件可靠性模型研究

本文提出一种考虑多种类型缺陷的软件可靠性模型,并构建了缺陷检测和剔除两个过程的模型。具体分类情况,可以根据模型的检验方法(拟合准则和预测有效性度量)和模型复杂度来具体决定,如果有测试人员的分类建议或者分类数据,可以结合模型共同决定。为了说明问题,本文给出四种类型缺陷的具体模型,并对实际数据集进行了拟合。通过模型比较,验证了多种类型缺陷模型的有效性。最后,通过构建软件最优发布时间策略对模型进行了应用。研究结果为软件开发和测试提供了理论参考。     

Mathematical analysis of some new Reynolds‐rod elastohydrodynamic models

In this paper, some new elastohydrodynamic Reynolds‐rod models are posed to obtain the existence of solution (the lubricant pressure and the elastic rod displacement). More precisely, a sign restriction on fluid pressure for cavitation modelling and different unilateral conditions on the rod displacement associated with a rigid structure coating are formulated in terms of coupled variational inequalities. The particular hinged or clamped boundary conditions on the rod displacement require different techniques to prove the existence of solution. Besides nearly linear coupled problems, two non‐linear rod problems including curvature effects are analysed. Mainly, regularity results and L^∞ estimates for the solution of variational inequalities and fixed‐point theorems lead to the existence results for the various coupled models. Copyright © 2001 John Wiley & Sons, Ltd.     

A new efficient approach to the characterization of D‐stable matrices

The concept of D‐stability is relevant for stable square matrices of any order, especially when they appear in ordinary differential systems modeling physical problems. Indeed, D‐stability was treated from different points of view in the last 50 years, but the problem of characterization of a general D‐stable matrix was solved for low‐order matrices only (ie, up to order 4). Here, a new approach is proposed within the context of numerical linear algebra. Starting from a known necessary and sufficient condition, other simpler equivalent necessary and sufficient conditions for D‐stability are proved. Such conditions turn out to be computationally more appealing for symbolic software, as discussed in the reported examples. Therefore, a new symbolic method is proposed to characterize matrices of order greater than 4, and then it is used in some numerical examples, given in details.     

Global dynamics of delay‐distributed HIV infection models with differential drug efficacy in cocirculating target cells

In this paper, we investigate the dynamical behaviors of three human immunodeficiency virus infection models with two types of cocirculating target cells and distributed intracellular delay. The models take into account both short‐lived infected cells and long‐lived chronically infected cells. In the two types of target cells, the drug efficacy is assumed to be different. The incidence rate of infection is given by bilinear and saturation functional responses in the first and second models, respectively, while it is given by a general function in the third model. Lyapunov functionals are constructed and LaSalle invariance principle is applied to prove the global asymptotic stability of all equilibria of the models. We have derived the basic reproduction number R₀ for the three models. For the first two models, we have proven that the disease‐free equilibrium is globally asymptotically stable (GAS) when R₀≤1, and the endemic equilibrium is GAS when R₀>1. For the third model, we have established a set of sufficient conditions for global stability of both equilibria of the model. We have checked our theoretical results with numerical simulations. Copyright © 2015 John Wiley & Sons, Ltd.     

Evaluating the performance of Brazilian university hospitals

In order to demonstrate how DEA modeling can be helpful to aid decision making relative to the Brazilian Teaching Hospital Policy by means of hospital performance assessment, we develop a case study with 30 general hospitals linked to Brazilian Federal Universities. We consider data on medical care (Medical Model—MM), teaching and research (Teaching-Research Model—TRM) and use the software IDEAL (Interactive Data Envelopment Analysis Laboratory) as a tool for the units’ efficiency evaluation. IDEAL, developed in Brazil, is unique in providing a 3-D frontiers visualization, assisting in exploratory analysis and allowing a better understanding of the DEA modeling (envelopment and multiplier). Both models are input-oriented and each hospital is categorized according to its relative efficiency in the MM and TRM. In this phase, it is very important to discuss with the decision-makers the results and patterns of the DEA models. Finally, the modelling indicates the necessary changes for the inefficient units and generates recommendations for teaching ratios and public financing.     

Four correlates of complex behavioral networks: Differentiation,behavior, connectivity,and compartmentalization: Carving networks at their joints

Some of the most complex networks are those that (i) have been engineered under selective pressure (either economic or evolutionary), and (ii) are capable of eliciting network‐level behaviors. Some examples are nervous systems, ant colonies, electronic circuits and computer software. Here we provide evidence that many such selected, behavioral networks are similar in at least four respects. (1) Differentiation: Nodes of different types are used in a combinatorial fashion to build network structures through local connections, and networks accommodate more structure types via increasing the number of node types in the network (i.e., increasing differentiation), not via increasing the length of structures. (2) Behavior: Structures are themselves combined globally to implement behaviors, and networks accommodate a greater behavioral repertoire via increasing the number of lower‐level behavior types (including structures), not via increasing the length of behaviors. (3) Connectivity: In order for structures in behavioral networks to combine with other structures within a fixed behavior length, the network must maintain an invariant network diameter, and this is accomplished via increasing network connectivity in larger networks. (4) Compartmentalization: Finally, for reasons of economical wiring, behavioral networks become increasingly parcellated. Special attention is given to nervous systems and computer software, but data from a variety of other behavioral selected networks are also provided, including ant colonies, electronic circuits, web sites and businesses. A general framework is introduced illuminating why behavioral selected networks share these four correlates. Because the four above features appear to apply to computer software as well as to biological networks, computer software provides a useful framework for comprehending the large‐scale function and organization of biological networks. © 2005 Wiley Periodicals, Inc. Complexity 10: 13–40, 2005     

Towards integrated design and analysis

A systems analysis technique is used to investigate and better understand the processes involved in finite element modelling. Two different starting points are considered: engineering drawings and solid models. The breakdown of activities involved in finite element analysis from a solid model is used as a requirements definition and functional specification for software tools to facilitate automation of finite modelling and eventual integration of design and analysis.     

Estimation of integrated volatility in stochastic volatility models

In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd.     

Sets and indices in linear programming modelling and their integration with relational data models

LP models are usually constructed using index sets and data tables which are closely related to the attributes and relations of relational database (RDB) systems. We extend the syntax of MPL, an existing LP modelling language, in order to connect it to a given RDB system. This approach reuses existing modelling and database software, provides a rich modelling environment and achieves model and data independence. This integrated software enables Mathematical Programming to be widely used as a decision support tool by unlocking the data residing in corporate databases.     

Non‐parametric modelling of time‐varying customer service times at a bank call centre

Call centres are becoming increasingly important in our modern commerce. We are interested in modelling the time‐varying pattern of average customer service times at a bank call centre. Understanding such a pattern is essential for efficient operation of a call centre. The call service times are shown to be lognormally distributed. Motivated by this observation and the important application, we propose a new method for inference about non‐parametric regression curves when the errors are lognormally distributed. Estimates and pointwise confidence bands are developed. The method builds upon the special relationship between the lognormal distribution and the normal distribution, and improves upon a naive estimation procedure that ignores this distributional structure. Our approach includes local non‐parametric estimation for both the mean function and the heteroscedastic variance function of the logged data, and uses local polynomial regression as a fitting tool. A simulation study is performed to illustrate the method. We then apply the method to model the time‐varying patterns of mean service times for different types of customer calls. Several operationally interesting findings are obtained and discussed. Copyright © 2006 John Wiley & Sons, Ltd.     

Model theory of a Hilbert space expanded with an unbounded closed selfadjoint operator

We study a closed unbounded self‐adjoint operator Q acting on a Hilbert space H in the framework of Metric Abstract Elementary Classes (MAECs). We build a suitable MAEC for such a structure, prove it is ?₀‐categorical and ?₀‐stable up to a system of perturbations. We give an explicit continuous axiomatization for the class. We also characterize non‐splitting and show it has the same properties as non‐forking in superstable first order theories. Finally, we characterize equality, orthogonality and domination of (Galois) types in that MAEC.     

Singularity of Lotka‐Volterra models under unfoldings

In this paper, we classify the singularity of a Lotka‐Volterra competitive model with a Gaussian competition function and non‐Gaussian carrying capacity functions. These functions need not be completely different to affect adaptive dynamics of the model. For instance, it will be seen how ostensibly similar models can actually give rise to quite different behaviors due to their properties under unfolding. The use of Gaussian‐like carrying capacity functions can also show the sensitivity of the model to assumptions on the carrying capacity function's shapes. The classification is achieved using singularity theory of fitness functions under dimorphism equivalence. We also investigate the effect of the presence of unfolding and bifurcation parameters on the evolution of the system near its singular points. Particularly, we study the adaptive dynamics of the system near the singularity by focusing on ESS and CvSS types, and dimorphisms. Mutual invasibility plots are used to show regions of coexistence.     

Model‐based quantification of the volatility of options at transaction level with extended count regression models

In this paper, we elaborate how Poisson regression models of different complexity can be used in order to model absolute transaction price changes of an exchange‐traded security. When combined with an adequate autoregressive conditional duration model, our modelling approach can be used to construct a complete modelling framework for a security's absolute returns at transaction level, and thus for a model‐based quantification of intraday volatility and risk. We apply our approach to absolute price changes of an option on the XETRA DAX index based on quote‐by‐quote data from the EUREX exchange and find that within our Bayesian framework a Poisson generalized linear model (GLM) with a latent AR(1) process in the mean is the best model for our data according to the deviance information criterion (DIC). While, according to our modelling results, the price development of the underlying, the intrinsic value of the option at the time of the trade, the number of new quotations between two price changes, the time between two price changes and the Bid–Ask spread have significant effects on the size of the price changes, this is not the case for the remaining time to maturity of the option. Copyright © 2006 John Wiley & Sons, Ltd.     

M-gap conjecture and m-normal theories

We find a small weakly minimal theory with an isolated weakly minimal type ofM-rank ∞ and an isolated weakly minimal type of arbitrarily large finiteM-rank. These examples lead to the notion of an m-normal theory. We prove theM-gap conjecture for m-normalT. In superstable theories with few countable models we characterize traces of complete types as traces of some formulas. We prove that a 1-based theory with few countable models is m-normal. We investigate generic subgroups of small superstable groups. We compare the notions of independence induced by measure (μ-independence) and category (m-independence). Research supported by KBN grant 2 P03A 006 09.     

I‐graphs and the corresponding configurations

We consider the class of I‐graphs I(n,j,k), which is a generalization over the class of the generalized Petersen graphs. We study different properties of I‐graphs, such as connectedness, girth, and whether they are bipartite or vertex‐transitive. We give an efficient test for isomorphism of I‐graphs and characterize the automorphism groups of I‐graphs. Regular bipartite graphs with girth at least 6 can be considered as Levi graphs of some symmetric combinatorial configurations. We consider configurations that arise from bipartite I‐graphs. Some of them can be realized in the plane as cyclic astral configurations, i.e., as geometric configurations with maximal isometric symmetry. © 2005 Wiley Periodicals, Inc.