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.

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.

An incipient 310 helix in Piv-Pro-Pro-Ala-NHMe as a model for peptide folding

The molecular mechanism of helix nucleation in peptides and proteins is not yet understood and the question of whether sharp turns in the polypeptide backbone serve as nuclei for protein folding has evoked controversy1,2. A recent study of the conformation of a tetrapeptide containing the stereochemically constrained residue alpha-aminoisobutyric acid, both in solution and the solid state, yielded a structure consisting of two consecutive beta-turns, leading to an incipient 310 helical conformation3,4. This led us to speculate that specific tri- and tetra-peptide sequences may indeed provide a helical twist to the amino-terminal segment of helical regions in proteins and provide a nucleation site for further propagation. The transformation from a 310 helical structure to an alpha-helix should be facile and requires only small changes in the phi and psi conformational angles and a rearrangement of the hydrogen bonding pattern5. If such a mechanism is involved then it should be possible to isolate an incipient 310 helical conformation in a tripeptide amide or tetrapeptide sequence, based purely on the driving force derived from short-range interactions. We have synthesised and studied the model peptide pivaloyl-Pro-Pro-Ala-NHMe (compound I) and provide here spectroscopic evidence for a 310 helical conformation in compound I.

Benchmark scenarios for the NMSSM

We discuss constrained and semi--constrained versions of the next--to--minimal supersymmetric extension of the Standard Model (NMSSM) in which a singlet Higgs superfield is added to the two doublet superfields that are present in the minimal extension (MSSM). This leads to a richer Higgs and neutralino spectrum and allows for many interesting phenomena that are not present in the MSSM. In particular, light Higgs particles are still allowed by current constraints and could appear as decay products of the heavier Higgs states, rendering their search rather difficult at the LHC. We propose benchmark scenarios which address the new phenomenological features, consistent with present constraints from colliders and with the dark matter relic density, and with (semi--)universal soft terms at the GUT scale. We present the corresponding spectra for the Higgs particles, their couplings to gauge bosons and fermions and their most important decay branching ratios. A brief survey of the search strategies for these states at the LHC is given.

Expanding the Peptide beta-Turn in alpha gamma Hybrid Sequences: 12 Atom Hydrogen Bonded Helical and Hairpin Turns

Hybrid peptide segments containing contiguous alpha and gamma amino acid residues can form C-12 hydrogen bonded turns which may be considered as backbone expanded analogues of C-10 beta-turns) found in alpha alpha segments. Exploration of the regular hydrogen bonded conformations accessible for hybrid alpha gamma sequences is facilitated by the use of a stereochemically constrained gamma amino acid residue gabapentin (1-aminomethylcyclohexaneacetic acid, Gpn), in which the two torsion angles about C-gamma-C-beta (theta(1)) and C-beta-C-alpha (theta(2)) are predominantly restricted to gauche conformations. The crystal structures of the octapeptides Boc-Gpn-Aib-Gpn-Aib-Gpn-Aib-Gpn-Aib-OMe (1) and Boc-Leu-Phe-Val-Aib-Gpn-Leu-Phe-Val-OMe (2) reveal two distinct conformations for the Aib-Gpn segment. Peptide 1 forms a continuous helix over the Aib(2)-Aib(6) segment, while the peptide 2 forms beta-hairpin structure stabilized by four cross-strand hydrogen bonds with the Aib-Gpn segment forming a nonhelical C-12 turn. The robustness of the helix in peptide 1 in solution is demonstrated by NMR methods. Peptide 2 is conformationally fragile in solution with evidence of beta-hairpin conformations being obtained in methanol. Theoretical calculations permit delineation of the various C-12 hydrogen bonded structures which are energetically feasible in alpha gamma and gamma alpha sequences.

A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

Energy–aware forwarding strategies for delay tolerant networking (DTN) routing protocols

This research addresses efficient use of the available energy in resource constrained mobile sensor nodes to prevent early depletion of the battery and maximize the packet delivery rate. This research contributes two energy-aware enhancement strategies to improve the network lifetime and delivery probability for energy constrained applications in the delay-tolerant networking environment.

Physical activity and health in mid age and older Australian women

The US Surgeon General's report was a landmark publication in the field of physical activity and health, but was constrained by a lack of evidence relating to women. This report examines the links between physical activity and health in mid-age and older women. It includes four parts (i)recent evidence relating physical activity to the national public health priorities and reproductive health (ii)consideration of the amount of physical activity required to obtain health benefits (iii)new data from the Australian Longitudinal Study on Women's Health on activity patterns, including relationships between changes in physical activity and life events, sociodemographic characteristics and health behaviours in mid-age and older Australian women (iv)new data from the Australian Longitudinal Study on Women's Health on the relationships between physical activity and menopausal symptoms, stiff or painful joints and arthritis, anxiety and depression, memory problems, falls and fractures, general physical and psychological well-being, and healthcare costs in mid-age and older Australian women

Joint decoding of multiple speech patterns for robust speech recognition

We are addressing a new problem of improving automatic speech recognition performance, given multiple utterances of patterns from the same class. We have formulated the problem of jointly decoding K multiple patterns given a single Hidden Markov Model. It is shown that such a solution is possible by aligning the K patterns using the proposed Multi Pattern Dynamic Time Warping algorithm followed by the Constrained Multi Pattern Viterbi Algorithm The new formulation is tested in the context of speaker independent isolated word recognition for both clean and noisy patterns. When 10 percent of speech is affected by a burst noise at -5 dB Signal to Noise Ratio (local), it is shown that joint decoding using only two noisy patterns reduces the noisy speech recognition error rate to about 51 percent, when compared to the single pattern decoding using the Viterbi Algorithm. In contrast a simple maximization of individual pattern likelihoods, provides only about 7 percent reduction in error rate.

Decentralized sequential change detection using physical layer fusion

We study the problem of decentralized sequential change detection with conditionally independent observations. The sensors form a star topology with a central node called fusion center as the hub. The sensors transmit a simple function of their observations in an analog fashion over a wireless Gaussian multiple access channel and operate under either a power constraint or an energy constraint. Simulations demonstrate that the proposed techniques have lower detection delays when compared with existing schemes. Moreover we demonstrate that the energy-constrained formulation enables better use of the total available energy than a power-constrained formulation.

Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems

Solving large-scale all-to-all comparison problems using distributed computing is increasingly significant for various applications. Previous efforts to implement distributed all-to-all comparison frameworks have treated the two phases of data distribution and comparison task scheduling separately. This leads to high storage demands as well as poor data locality for the comparison tasks, thus creating a need to redistribute the data at runtime. Furthermore, most previous methods have been developed for homogeneous computing environments, so their overall performance is degraded even further when they are used in heterogeneous distributed systems. To tackle these challenges, this paper presents a data-aware task scheduling approach for solving all-to-all comparison problems in heterogeneous distributed systems. The approach formulates the requirements for data distribution and comparison task scheduling simultaneously as a constrained optimization problem. Then, metaheuristic data pre-scheduling and dynamic task scheduling strategies are developed along with an algorithmic implementation to solve the problem. The approach provides perfect data locality for all comparison tasks, avoiding rearrangement of data at runtime. It achieves load balancing among heterogeneous computing nodes, thus enhancing the overall computation time. It also reduces data storage requirements across the network. The effectiveness of the approach is demonstrated through experimental studies.

Analysis of cool roof coatings for residential demand side management in tropical Australia

Cool roof coatings have a beneficial impact on reducing the heat load of a range of building types, resulting in reduced cooling energy loads. This study seeks to understand the extent to which cool roof coatings could be used as a residential demand side management (DSM) strategy for retrofitting existing housing in a constrained network area in tropical Australia where peak electrical demand is heavily influenced by residential cooling loads. In particular this study seeks to determine whether simulation software used for building regulation purposes can provide networks with the ‘impact certainty’ required by their DSM principles. The building simulation method is supported by a field experiment. Both numerical and experimental data confirm reductions in total consumption (kWh) and energy demand (kW). The nature of the regulated simulation software, combined with the diverse nature of residential buildings and their patterns of occupancy, however, mean that simulated results cannot be extrapolated to quantify benefits to a broader distribution network. The study suggests that building data gained from regulatory simulations could be a useful guide for potential impacts of widespread application of cool roof coatings in this region. The practical realization of these positive impacts, however, would require changes to the current business model for the evaluation of DSM strategies. The study provides seven key recommendations that encourage distribution networks to think beyond their infrastructure boundaries, recognising that the broader energy system also includes buildings, appliances and people.

Phase-Field Simulation of Fusion Interface Events during Solidification of Dissimilar Welds: Effect of Composition Inhomogeneity

We investigate the events near the fusion interfaces of dissimilar welds using a phase-field model developed for single-phase solidification of binary alloys. The parameters used here correspond to the dissimilar welding of a Ni/Cu couple. The events at the Ni and the Cu interface are very different, which illustrate the importance of the phase diagram through the slope of the liquidus curves. In the Ni side, where the liquidus temperature decreases with increasing alloying, solutal melting of the base metal takes place; the resolidification, with continuously increasing solid composition, is very sluggish until the interface encounters a homogeneous melt composition. The growth difficulty of the base metal increases with increasing initial melt composition, which is equivalent to a steeper slope of the liquidus curve. In the Cu side, the initial conditions result in a deeply undercooled melt and contributions from both constrained and unconstrained modes of growth are observed. The simulations bring out the possibility of nucleation of a concentrated solid phase from the melt, and a secondary melting of the substrate due to the associated recalescence event. The results for the Ni and Cu interfaces can be used to understand more complex dissimilar weld interfaces involving multiphase solidification.

Parametrized actor-critic algorithms for finite-horizon MDPs

Due to their non-stationarity, finite-horizon Markov decision processes (FH-MDPs) have one probability transition matrix per stage. Thus the curse of dimensionality affects FH-MDPs more severely than infinite-horizon MDPs. We propose two parametrized 'actor-critic' algorithms to compute optimal policies for FH-MDPs. Both algorithms use the two-timescale stochastic approximation technique, thus simultaneously performing gradient search in the parametrized policy space (the 'actor') on a slower timescale and learning the policy gradient (the 'critic') via a faster recursion. This is in contrast to methods where critic recursions learn the cost-to-go proper. We show w.p 1 convergence to a set with the necessary condition for constrained optima. The proposed parameterization is for FHMDPs with compact action sets, although certain exceptions can be handled. Further, a third algorithm for stochastic control of stopping time processes is presented. We explain why current policy evaluation methods do not work as critic to the proposed actor recursion. Simulation results from flow-control in communication networks attest to the performance advantages of all three algorithms.

Lightcurve inversion for asteroid spins and shapes

Knowledge of the physical properties of asteroids is crucial in many branches of solar-system research. Knowledge of the spin states and shapes is needed, e.g., for accurate orbit determination and to study the history and evolution of the asteroids. In my thesis, I present new methods for using photometric lightcurves of asteroids in the determination of their spin states and shapes. The convex inversion method makes use of a general polyhedron shape model and provides us at best with an unambiguous spin solution and a convex shape solution that reproduces the main features of the original shape. Deriving information about the non-convex shape features is, in principle, also possible, but usually requires a priori information about the object. Alternatively, a distribution of non-convex solutions, describing the scale of the non-convexities, is also possible to be obtained. Due to insufficient number of absolute observations and inaccurately defined asteroid phase curves, the $c/b$-ratio, i.e., the flatness of the shape model is often somewhat ill-defined. However, especially in the case of elongated objects, the flatness seems to be quite well constrained, even in the case when only relative lightcurves are available. The results prove that it is, contrary to the earlier misbelief, possible to derive shape information from the lightcurve data if a sufficiently wide range of observing geometries is covered by the observations. Along with the more accurate shape models, also the rotational states, i.e., spin vectors and rotation periods, are defined with improved accuracy. The shape solutions obtained so far reveal a population of irregular objects whose most descriptive shape characteristics, however, can be expressed with only a few parameters. Preliminary statistical analyses for the shapes suggests that there are correlations between shape and other physical properties, such as the size, rotation period and taxonomic type of the asteroids. More shape data of, especially, the smallest and largest asteroids, as well as the fast and slow rotators is called for in order to be able to study the statistics more thoroughly.