Numerical tools for isogeometric analysis in the nonlinear regime

The present work deals with the development of robust numerical tools for Isogeometric Analysis suitable for problems of solid mechanics in the nonlinear regime. To that end, a new solid-shell element, based on the Assumed Natural Strain method, is proposed for the analysis of thin shell-like structures. The formulation is extensively validated using a set of well-known benchmark problems available in the literature, in both linear and nonlinear (geometric and material) regimes. It is also proposed an alternative formulation which is focused on the alleviation of the volumetric locking pathology in linear elastic problems. In addition, an introductory study in the field of contact mechanics, in the context of Isogeometric Analysis, is also presented, with special focus on the implementation of a the Point-to-Segment algorithm. All the methodologies presented in the current work were implemented in a in-house code, together with several pre- and post-processing tools. In addition, user subroutines for the commercial software Abaqus were also implemented.

Multiple DNA and protein sequence alignment based on segment-to-segment comparison.

In this paper, a new way to think about, and to construct, pairwise as well as multiple alignments of DNA and protein sequences is proposed. Rather than forcing alignments to either align single residues or to introduce gaps by defining an alignment as a path running right from the source up to the sink in the associated dot-matrix diagram, we propose to consider alignments as consistent equivalence relations defined on the set of all positions occurring in all sequences under consideration. We also propose constructing alignments from whole segments exhibiting highly significant overall similarity rather than by aligning individual residues. Consequently, we present an alignment algorithm that (i) is based on segment-to-segment comparison instead of the commonly used residue-to-residue comparison and which (ii) avoids the well-known difficulties concerning the choice of appropriate gap penalties: gaps are not treated explicity, but remain as those parts of the sequences that do not belong to any of the aligned segments. Finally, we discuss the application of our algorithm to two test examples and compare it with commonly used alignment methods. As a first example, we aligned a set of 11 DNA sequences coding for functional helix-loop-helix proteins. Though the sequences show only low overall similarity, our program correctly aligned all of the 11 functional sites, which was a unique result among the methods tested. As a by-product, the reading frames of the sequences were identified. Next, we aligned a set of ribonuclease H proteins and compared our results with alignments produced by other programs as reported by McClure et al. [McClure, M. A., Vasi, T. K. & Fitch, W. M. (1994) Mol. Biol. Evol. 11, 571-592]. Our program was one of the best scoring programs. However, in contrast to other methods, our protein alignments are independent of user-defined parameters.

Point-to-point speed enforcement

This report reviews the use of point-to-point speed enforcement internationally in order to provide principles for better practice for its use in Australia and New Zealand. Point-to-point enforcement is a relatively new technological approach to speed enforcement which involves measuring the average speed of vehicles passing a series of cameras, by using automatic number plate recognition (ANPR) and other technologies. The approach has been implemented or trialled in a number of countries including Australia, New Zealand, the United Kingdom, the Netherlands, Austria, Italy, Switzerland and France. The major research activities were undertaken for the preparation of this report included: (1) an extensive review of the international literature; (2) stakeholder consultation with international and domestic organisations. To date, there have been no formal evaluations of point-to- point speed enforcement in Australia or New Zealand.

Point-to-point speed enforcement : recommendations for better practice

Point-to-point speed cameras are a relatively new and innovative technological approach to speed enforcement that is increasingly been used in a number of highly motorised countries. Previous research has provided evidence of the positive impact of this approach on vehicle speeds and crash rates, as well as additional traffic related outcomes such as vehicle emissions and traffic flow. This paper reports on the conclusions and recommendations of a large-scale project involving extensive consultation with international and domestic (Australian) stakeholders to explore the technological, operational, and legislative characteristics associated with the technology. More specifically, this paper provides a number of recommendations for better practice regarding the implementation of point-to-point speed enforcement in the Australian and New Zealand context. The broader implications of the research, as well as directions for future research, are also discussed.

Average-Delay Optimal Policies for the Point-to-Point Channel

Average-delay optimal scheduflng of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.

Subquadratic quantum number dependence and other anomalies of vibrational dephasing in liquid nitrogen: Molecular dynamics simulation study from the triple point to the critical point and beyond

Vibrational phase relaxation near gas-liquid and liquid-solid phase coexistence has been studied by molecular dynamics simulations of N-N stretch in N-2. Experimentally observed pronounced insensitivity of phase relaxation from the triple point to beyond the boiling point is found to originate from a competition between density relaxation and resonant-energy transfer terms. The sharp rise in relaxation rate near the critical point (CP) can be attributed at least partly to the sharp, rise in vibration-rotation coupling contribution. Substantial subquadratic quantum number dependence of overtone dephasing rate is found near the CP and in supercritical fluids. [S0031-9007 (99)09318-7].

Analysis of link-layer backoff schemes on point-to-point Markov fading links

Backoff algorithms are typically employed in multiple-access networks (e.g., Ethernet) to recover from packet collisions. In this letter, we propose and carry out the analysis for three types of link-layer backoff schemes, namely, linear backoff, exponential backoff, and geometric backoff, on point-to-point wireless fading links where packet errors occur nonindependently. In such a scenario, the backoff schemes are shown to achieve better energy efficiency without compromising much on the link layer throughput performance.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

Tradeoff of average power and average delay for a point-to-point link with fading

We consider a discrete time system with packets arriving randomly at rate lambda per slot to a fading point-to-point link, for which the transmitter can control the number of packets served in a slot by varying the transmit power. We provide an asymptotic characterization of the minimum average delay of the packets, when average transmitter power is a small positive quantity V more than the minimum average power required for queue stability. We show that the minimum average delay will grow either as log (1/V) or 1/V when V down arrow 0, for certain sets of values of lambda. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the assumed transmit power function, as a function of the fading gain and the number of packets transmitted. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered model, in which the random queue length process is assumed to evolve on the non-negative real line.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

EESM-Based Link Adaptation in Point-to-Point and Multi-Cell OFDM Systems: Modeling and Analysis

In contemporary wideband orthogonal frequency division multiplexing (OFDM) systems, such as Long Term Evolution (LTE) and WiMAX, different subcarriers over which a codeword is transmitted may experience different signal-to-noise-ratios (SNRs). Thus, adaptive modulation and coding (AMC) in these systems is driven by a vector of subcarrier SNRs experienced by the codeword, and is more involved. Exponential effective SNR mapping (EESM) simplifies the problem by mapping this vector into a single equivalent fiat-fading SNR. Analysis of AMC using EESM is challenging owing to its non-linear nature and its dependence on the modulation and coding scheme. We first propose a novel statistical model for the EESM, which is based on the Beta distribution. It is motivated by the central limit approximation for random variables with a finite support. It is simpler and as accurate as the more involved ad hoc models proposed earlier. Using it, we develop novel expressions for the throughput of a point-to-point OFDM link with multi-antenna diversity that uses EESM for AMC. We then analyze a general, multi-cell OFDM deployment with co-channel interference for various frequency-domain schedulers. Extensive results based on LTE and WiMAX are presented to verify the model and analysis, and gain new insights.

Substituent effect on fluorescence signaling of the cell permeable HSO4- receptors through single point to ratiometric response in green solvent

Two new 2-(2-aminophenyl)benzimidazole-based HSO4- ion selective receptors, 6-(4-nitrophenyl)-5,6-dihydrobenzo4,5]imidazo1,2-c]quinazoline (L1H) and 6-(4-methoxyphenyl)-5,6-dihydrobenzo4,5]imidazo1,2-c] quinazoline (L2H), and their 1 : 1 molecular complexes with HSO4- were prepared in a facile synthetic method and characterized by physicochemical and spectroscopic techniques along with the detailed structural analysis of L1H by single crystal X-ray crystallography. Both receptors (L1H and L2H) behave as highly selective chemosensor for HSO4- ions at biological pH in ethanol-water HEPES buffer (1/5) (v/v) medium over other anions such as F-, Cl-, Br-, I-, AcO-, H2PO4-, N-3(-) and ClO4-. Theoretical and experimental studies showed that the emission efficiency of the receptors (L1H and L2H) was tuned successfully through single point to ratiometric detection by employing the substituent effects. Using 3 sigma method the LOD for HSO4- ions were found to be 18.08 nM and 14.11 nM for L1H and L2H, respectively, within a very short responsive time (15-20 s) in 100 mM HEPES buffer (ethanol-water: 1/5, v/v). Comparison of the utility of the probes (L1H and L2H) as biomarkers for the detection of intracellular HSO4- ions concentrations under a fluorescence microscope has also been included and both probes showed no cytotoxic effect.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.