Experimental verification of drop/impact simulation for a cellular phone

Conducting drop tests to investigate impact behavior and identify failure mechanisms of small-size electronic products is generally expensive and time-consuming. Nevertheless, strict drop/impact performance criteria for hand-held electronic products such as cellular phones play a decisive role in the design because they must withstand unexpected shocks. The design of product durability on impact has heavily relied on the designer's intuition and experience. In this study, a reliable drop/impact simulation for a cellular phone is carried out using the explicit code LS-DYNA. Subsequently globallocal experimental verification is accomplished by means of high-speed photography and impact response measurement. Using this methodology, we predict potential damage locations in a cellular phone and compare them with real statistical data. It is envisaged that development of a reliable methodology of drop/impact simulation will provide us with a powerful and efficient vehicle for improvement of the design quality and reduction of the product development cycle.     

Stability criteria for controlled queueing systems

We give an almost complete classification of ergodicity and transience conditions for a general multi-queue system with the following features: arrivals form Poisson streams and there are various routing schemes for allocating arrivals to queues; the servers can be configured in a variety of ways; completed jobs can feed back into the system; the exponential service times and feedback probabilities depend upon the configuration of the servers (this model includes some types of multi-class queueing system); switching between service regimes is instantaneous. Several different levels of control of the service regimes are considered. Our results for the N-queue system require randomisation of service configurations but we have studied the two queue system in situations where there is less control. We use the semi-martingale methods described in Fayolle, Malyshev and Menshikov [3] and our results generalise Kurkova [8] and complement Foley and McDonald [4] and [5]. AMS 2000 subject classification: Primary: 90B22; Secondary: 60J10 90B15     

Locally minimal uniformly oriented shortest networks

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222].     

Electro-optical performance of polymer stabilized cholesteric texture cell: The influence of chiral dopant and monomer concentration

Reverse-mode polymer stabilized cholesteric texture (PSCT) cells with various chiral dopant and monomer concentrations were fabricated. Experimental results indicate that the chiral dopant concentration and the monomer concentration significantly influence the threshold voltage and hysteresis of the cells. The chiral dopant and monomer deform the hysteresis loop. Increasing the monomer concentration reduces the width of the hysteresis loop of the reverse-mode PSCT cell.     

Algebraic Dirichlet-to-Neumann mapping for linear elasticity problems with extreme contrasts in the coefficients

The convergence of iterative based domain decomposition methods is linked with the absorbing boundary conditions defined on the interface between the sub-domains. For linear elasticity problems, the optimal absorbing boundary conditions are associated with non-local Dirichlet-to-Neumann maps. Most of the methods to approximate these non-local maps are based on a continuous analysis. In this paper, an original algebraic technique based on the computation of local Dirichlet-to-Neumann maps is investigated. Numerical experiments are presented for linear elasticity problems with extreme contrasts in the coefficients.     

Structural properties of charged diblock copolymer solutions

Aqueous micellar solutions of ionic/neutral block copolymers have been studied by light scattering, small angle neutron scattering and small angle X-ray scattering. We made use of a polymer comprised of a short hydrophobic block (polyethylene-propylene) PEP and of a long polyelectrolytic block (polystyrene-sulfonate) PSSNa which has been shown previously to micellize in water. The apparent polydispersity of these micelles is studied in detail, showing the existence of a few large aggregates coexisting with the population of micelles. Solutions of micelles are found to order above some threshold in polymer concentration. The order is liquid-like, as demonstrated by the evolution with concentration of the peak observed in the structure factor (), and the degree of order is found to be identical over a large range of concentrations (up to 20 wt%). Consistent values of the aggregation number of the micelles are found by independent methods. The effect of salt addition on the order is found to be weak. Received: 19 June 1997 / Received in final form: 4 September 1997 / Accepted: 9 October 1997     

Statistical mechanics of probabilistic cellular automata

We investigate the behavior of discrete-time probabilistic cellular automata (PCA), which are Markov processes on spin configurations on ad-dimensional lattice, from a rigorous statistical mechanics point of view. In particular, we exploit, whenever possible, the correspondence between stationary measures on the space-time histories of PCAs on ^d and translation-invariant Gibbs states for a related Hamiltonian on ( ^d+1). This leads to a simple large-deviation formula for the space-time histories of the PCA and a proof that in a high-temperature regime the stationary states of the PCA are Gibbsian. We also obtain results about entropy, fluctuations, and correlation inequalities, and demonstrate uniqueness of the invariant state and exponential decay of correlations in a high-noise regime. We discuss phase transitions in the low-noise (or low-temperature) regime and review Toom's proof of nonergodicity of a certain class of PCAs.     

Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.     

Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

Minimum concave cost production system: A further generalization of multi-echelon model

We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n ⁴ m) algorithm for this class of problems.