A fluid system with coupled input and output,and its application to bottlenecks in ad hoc networks

This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue, (ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding tail probabilities decay exponentially, as is shown by a large-deviations analysis. F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless.     

Some conformally flat spin manifolds, Dirac operators and automorphic forms

In this paper we study Clifford and harmonic analysis on some examples of conformal flat manifolds that have a spinor structure, or more generally, at least a pin structure. The examples treated here are manifolds that can be parametrized by U/Γ where U is a subdomain of either Sn or Rn and Γ is a Kleinian group acting discontinuously on U. The examples studied here include RPn and the Hopf manifolds S¹×Sn−1. Also some hyperbolic manifolds will be treated. Special kinds of Clifford-analytic automorphic forms associated to the different choices of Γ are used to construct explicit Cauchy kernels, Cauchy integral formulas, Green's kernels and formulas together with Hardy spaces and Plemelj projection operators for Lp spaces of hypersurfaces lying in these manifolds.     

活动标形及其在点啮合齿轮传动误差分析中的应用

活动标形法的论述首推苏步青译，佐佐木重夫著《微分几何学》，还有的著作从外微分形式引入活动标形,本文论证取曲面的正交曲率网为参数网时，曲面论的基本公式就是活动标形的微分形式，并用其分析了点啮合齿轮传动误差．     

Computational Complexity in Algebraic Systems

Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems.     

Canonical correlation analysis based on information theory

In this article, we propose a new canonical correlation method based on information theory. This method examines potential nonlinear relationships between p×1 vector Y-set and q×1 vector X-set. It finds canonical coefficient vectors a and b by maximizing a more general measure, the mutual information, between a^TX and b^TY. We use a permutation test to determine the pairs of the new canonical correlation variates, which requires no specific distributions for X and Y as long as one can estimate the densities of a^TX and b^TY nonparametrically. Examples illustrating the new method are presented.     

Global Solution of Optimization Problems with Parameter-Embedded Linear Dynamic Systems

This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly     

Dynamic mechanical thermal analysis transitions of partially and fully substituted cellulose fatty esters

The main transitions of cellulose fatty esters with different degrees of substitution (DSs) were investigated with dynamic mechanical thermal analysis. Two distinct main relaxations were observed in partially substituted cellulose esters (PSCEs). They were attributed to the glass‐transition temperature and to the chain local motion of the aliphatic substituents. The temperatures of both transitions decreased when DS or the number of carbon atoms (n) of the acyl substituent increased. Conversely, all the transitions of fully substituted cellulose esters occurred within a narrow temperature range, and they did not vary significantly with n. This phenomenon was explained by the formation of a crystalline phase of the fatty substituents. The presence of few residual OH groups in PSCEs was responsible for a large increase in the storage bending modulus, and it eliminated the effect of n on damping. © 2002 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 281–288, 2003     

Mathematical topographical correction of XPS images using multivariate statistical methods

For rough heterogeneous samples, the contrast observed in XPS images may result from both changes in elemental or chemical composition and sample topography. Background image acquisition and subtraction are frequently utilized to minimize topographical effects so that images represent concentration variations in the sample. This procedure may significantly increase the data acquisition time. Multivariate statistical methods can assist in resolving topographical and chemical information from multispectral XPS images. Principal component analysis (PCA) is one method for identification of the highest correlation/variation between the images. Topography, which is common to all of the images, will be resolved in the first most significant component. The score of this component contains spatial information about the topography of the surface, whereas the loading is a quantitative representation of the topography contribution to each elemental/chemical image. The simple‐to‐use self‐modelling mixture analysis (Simplisma) method is a pure variable method that searches for the source of most differences in the data and therefore has the potential to distinguish between chemical and topographical phases in images. The mathematical background correction scheme is developed and validated by comparing results to the experimental background correction for samples with differing degrees of topography. Copyright © 2004 John Wiley & Sons, Ltd.     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.