A multi-criteria approach for hospital capacity analysis

Hospitals are critical elements of health care systems and analysing their capacity to do work is a very important topic. To perform a system wide analysis of public hospital resources and capacity, a multi-objective optimization (MOO) approach has been proposed. This approach identifies the theoretical capacity of the entire hospital and facilitates a sensitivity analysis, for example of the patient case mix. It is necessary because the competition for hospital resources, for example between different entities, is highly influential on what work can be done. The MOO approach has been extensively tested on a real life case study and significant worth is shown. In this MOO approach, the epsilon constraint method has been utilized. However, for solving real life applications, with a large number of competing objectives, it was necessary to devise new and improved algorithms. In addition, to identify the best solution, a separable programming approach was developed. Multiple optimal solutions are also obtained via the iterative refinement and re-solution of the model.

Subspace intersection method of high-resolution bearing estimation in shallow ocean using acoustic vector sensors

The subspace intersection method (SIM) provides unbiased bearing estimates of multiple acoustic sources in a range-independent shallow ocean using a one-dimensional search without prior knowledge of source ranges and depths. The original formulation of this method is based on deployment of a horizontal linear array of hydrophones which measure acoustic pressure. In this paper, we extend SIM to an array of acoustic vector sensors which measure pressure as well as all components of particle velocity. Use of vector sensors reduces the minimum number of sensors required by a factor of 4, and also eliminates the constraint that the intersensor spacing should not exceed half wavelength. The additional information provided by the vector sensors leads to performance enhancement in the form of lower estimation error and higher resolution.

Stationary crack tip fields in elastic-plastic solids: an overview of recent numerical simulations

In this paper, an overview of some recent numerical simulations of stationary crack tip fields in elastic-plastic solids is presented. First, asymptotic analyses carried out within the framework of 2D plane strain or plane stress conditions in both pressure insensitive and pressure sensitive plastic solids are reviewed. This is followed by discussion of salient results obtained from recent computational studies. These pertain to 3D characteristics of elastic-plastic near-front fields under mixed mode loading, mechanics of fracture and simulation of near-tip shear banding process of amorphous alloys and influence of crack tip constraint on the structure of near-tip fields in ductile single crystals. These results serve to illustrate several important features associated with stress and strain distributions near the crack tip and provide the foundation for understanding the operative failure mechanisms. The paper concludes by highlighting some of the future prospects for this field of study.

Robust THP Transceiver Designs for Multiuser MIMO Downlink with Imperfect CSIT

We present robust joint nonlinear transceiver designs for multiuser multiple-input multiple-output (MIMO) downlink in the presence of imperfections in the channel state information at the transmitter (CSIT). The base station (BS) is equipped with multiple transmit antennas, and each user terminal is equipped with one or more receive antennas. The BS employs Tomlinson-Harashima precoding (THP) for interuser interference precancellation at the transmitter. We consider robust transceiver designs that jointly optimize the transmit THP filters and receive filter for two models of CSIT errors. The first model is a stochastic error (SE) model, where the CSIT error is Gaussian-distributed. This model is applicable when the CSIT error is dominated by channel estimation error. In this case, the proposed robust transceiver design seeks to minimize a stochastic function of the sum mean square error (SMSE) under a constraint on the total BS transmit power. We propose an iterative algorithm to solve this problem. The other model we consider is a norm-bounded error (NBE) model, where the CSIT error can be specified by an uncertainty set. This model is applicable when the CSIT error is dominated by quantization errors. In this case, we consider a worst-case design. For this model, we consider robust (i) minimum SMSE, (ii) MSE-constrained, and (iii) MSE-balancing transceiver designs. We propose iterative algorithms to solve these problems, wherein each iteration involves a pair of semidefinite programs (SDPs). Further, we consider an extension of the proposed algorithm to the case with per-antenna power constraints. We evaluate the robustness of the proposed algorithms to imperfections in CSIT through simulation, and show that the proposed robust designs outperform nonrobust designs as well as robust linear transceiver designs reported in the recent literature.

Non-linear Transceiver Designs with Imperfect CSIT Using Convex Optimization

In this paper, we consider non-linear transceiver designs for multiuser multi-input multi-output (MIMO) down-link in the presence of imperfections in the channel state information at the transmitter (CSIT). The base station (BS) is equipped with multiple transmit antennas and each user terminal is equipped with multiple receive antennas. The BS employs Tomlinson-Harashima precoding (THP) for inter-user interference pre-cancellation at the transmitter. We investigate robust THP transceiver designs based on the minimization of BS transmit power with mean square error (MSE) constraints, and balancing of MSE among users with a constraint on the total BS transmit power. We show that these design problems can be solved by iterative algorithms, wherein each iteration involves a pair of convex optimization problems. The robustness of the proposed algorithms to imperfections in CSIT is illustrated through simulations.

The alpha method for solving differential algebraic inequality (DAI) systems

This paper describes an algorithm for ``direct numerical integration'' of the initial value Differential-Algebraic Inequalities (DAI) in a time stepping fashion using a sequential quadratic programming (SQP) method solver for detecting and satisfying active path constraints at each time step. The activation of a path constraint generally increases the condition number of the active discretized differential algebraic equation's (DAE) Jacobian and this difficulty is addressed by a regularization property of the alpha method. The algorithm is locally stable when index 1 and index 2 active path constraints and bounds are active. Subject to available regularization it is seen to be stable for active index 3 active path constraints in the numerical examples. For the high index active path constraints, the algorithm uses a user-selectable parameter to perturb the smaller singular values of the Jacobian with a view to reducing the condition number so that the simulation can proceed. The algorithm can be used as a relatively cheaper estimation tool for trajectory and control planning and in the context of model predictive control solutions. It can also be used to generate initial guess values of optimization variables used as input to inequality path constrained dynamic optimization problems. The method is illustrated with examples from space vehicle trajectory and robot path planning.

On the coalescence of twisted flux tubes

We study the problem of the coalescence of twisted flux tubes by assuming that the azimuthal field lines reconnect at a current sheet during the coalescence process and everywhere else the magnetic field is frozen in the fluid. We derive relations connecting the topology of the coalesced flux tube with the topologies of the initial flux tubes, and then obtain a structure equation for calculating the field configuration of the coalesced flux tube from the given topology. Some solutions for the two extreme cases of low-β plasma and high-β plasma are discussed. The coalesced flux tube has less twist than the initial flux tube. Magnetic helicity is found to be exactly conserved during the coalescence, but the assumptions in the model put a constraint on the energy dissipation so that we do not get a relaxation to the minimum-energy Taylor state in the low-β case. It is pointed out that the structure equation connecting the topology and the equilibrium configuration is quite general and can be of use in many two-dimensional flux tube problems.

RecA Protein of Mycobacterium tuberculosis Possesses pH-Dependent Homologous DNA Pairing and Strand Exchange Activities: Implications for Allele Exchange in Mycobacteria

To gain insights into inefficient allele exchange in mycobacteria, we compared homologous pairing and strand exchange reactions promoted by RecA protein of Mycobacterium tuberculosis to those of Escherichia coli RecA protein. The extent of single-stranded binding protein (SSB)-stimulated formation of joint molecules by MtRecA was similar to that of EcRecA over a wide range of pH values. In contrast, strand exchange promoted by MtRecA was inhibited around neutral pH due to the formation of DNA networks. At higher pH, MtRecA was able to overcome this constraint and, consequently, displayed optimal strand exchange activity. Order of addition experiments suggested that SSB, when added after MtRecA, was vital for strand exchange. Significantly, with shorter duplex DNA, MtRecA promoted efficient strand exchange without network formation in a pH-independent fashion. Increase in the length of duplex DNA led to incomplete strand exchange with concomitant rise in the formation of intermediates and networks in a pH-dependent manner. Treatment of purified networks with S1 nuclease liberated linear duplex DNA and products, consistent with a model in which the networks are formed by the invasion of hybrid DNA by the displaced linear single-stranded DNA. Titration of strand exchange reactions with ATP or salt distinguished a condition under which the formation of networks was blocked, but strand exchange was not significantly affected. We discuss how these results relate to inefficient allele exchange in mycobacteria.

Free-volume dependent pressure sensitivity of Zr-based bulk metallic glass

Instrumented indentation experiments on a Zr-based bulk metallic glass (BMG) in as-cast, shot-peened and structurally relaxed conditions were conducted to examine the dependence of plastic deformation on its structural state. Results show significant differences in hardness, H, with structural relaxation increasing it and shot peening markedly reducing it, and slightly changed morphology of shear bands around the indents. This is in contrast to uniaxial compressive yield strength, sigma(y), which remains invariant with the change in the structural state of the alloys investigated. The plastic constraint factor, C = H/sigma(y), of the relaxed BMG increases compared with that of the as-cast glass, indicating enhanced pressure sensitivity upon annealing. In contrast, C of the shot-peened layer was found to be similar to that observed in crystalline metals, indicating that severe plastic deformation could eliminate pressure sensitivity. Microscopic origins for this result, in terms of shear transformation zones and free volume, are discussed.

Correlation, Coding, and Cooperation in Wireless Sensor Networks

We consider a single-hop data-gathering sensor network, consisting of a set of sensor nodes that transmit data periodically to a base-station. We are interested in maximizing the lifetime of this network. With our definition of network lifetime and the assumption that the radio transmission energy consumption forms the most significant portion of the total energy consumption at a sensor node, we attempt to enhance the network lifetime by reducing the transmission energy budget of sensor nodes by exploiting three system-level opportunities. We pose the problem of maximizing lifetime as a max-min optimization problem subject to the constraint of successful data collection and limited energy supply at each node. This turns out to be an extremely difficult optimization to solve. To reduce the complexity of this problem, we allow the sensor nodes and the base-station to interactively communicate with each other and employ instantaneous decoding at the base-station. The chief contribution of the paper is to show that the computational complexity of our problem is determined by the complex interplay of various system-level opportunities and challenges.

Crack Tip Fields in a Single Edge Notched Aluminum Single Crystal Specimen

We report a combined experimental and computational study of a low constraint aluminum single crystal fracture geometry and investigate the near-tip stress and strain fields. To this end, a single edge notched tensile (SENT) specimen is considered. A notch, with a radius of 50 µm, is taken to lie in the (010) plane and its front is aligned along the [101] direction. Experiments are conducted by subjecting the specimen to tensile loading using a special fixture inside a scanning electron microscope chamber. Both SEM micrographs and electron back-scattered diffraction (EBSD) maps are obtained from the near-tip region. The experiments are complemented by performing 3D and 2D plane strain finite element simulations within a continuum crystal plasticity framework assuming an isotropic hardening response characterized by the Pierce–Asaro–Needleman model. The simulations show a distinct slip band forming at about 55 deg with respect to the notch line corresponding to slip on (11-bar 1)[011] system, which corroborates well with experimental data. Furthermore, two kink bands occur at about 45 deg and 90 deg with respect to the notch line within which large rotations in the crystal orientation take place. These predictions are in good agreement with the EBSD observations. Finally, the near-tip angular variations of the 3D stress and plastic strain fields in the low constraint SENT fracture geometry are examined in detail.

Block-based feature detection and matching for mosaicing of camera-captured document images

In this paper, we present a new feature-based approach for mosaicing of camera-captured document images. A novel block-based scheme is employed to ensure that corners can be reliably detected over a wide range of images. 2-D discrete cosine transform is computed for image blocks defined around each of the detected corners and a small subset of the coefficients is used as a feature vector A 2-pass feature matching is performed to establish point correspondences from which the homography relating the input images could be computed. The algorithm is tested on a number of complex document images casually taken from a hand-held camera yielding convincing results.

DMT of Multi-hop Cooperative Networks-Part II: Layered and Multi-Antenna Networks

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.