Genome-wide association study identifies a variant in HDAC9 associated with large vessel ischemic stroke

Genetic factors have been implicated in stroke risk, but few replicated associations have been reported. We conducted a genome-wide association study (GWAS) for ischemic stroke and its subtypes in 3,548 affected individuals and 5,972 controls, all of European ancestry. Replication of potential signals was performed in 5,859 affected individuals and 6,281 controls. We replicated previous associations for cardioembolic stroke near PITX2 and ZFHX3 and for large vessel stroke at a 9p21 locus. We identified a new association for large vessel stroke within HDAC9 (encoding histone deacetylase 9) on chromosome 7p21.1 (including further replication in an additional 735 affected individuals and 28,583 controls) (rs11984041; combined P = 1.87 × 10 -11; odds ratio (OR) = 1.42, 95% confidence interval (CI) = 1.28-1.57). All four loci exhibited evidence for heterogeneity of effect across the stroke subtypes, with some and possibly all affecting risk for only one subtype. This suggests distinct genetic architectures for different stroke subtypes.

Melt electrospinning of poly(epsilon-caprolactone) scaffolds: Phenomenological observations associated with collection and direct writing

Melt electrospinning and its additive manufacturing analogue, melt electrospinning writing (MEW), are two processes which can produce porous materials for applications where solvent toxicity and accumulation in solution electrospinning are problematic. This study explores the melt electrospinning of poly(ε-caprolactone) (PCL) scaffolds, specifically for applications in tissue engineering. The research described here aims to inform researchers interested in melt electrospinning about technical aspects of the process. This includes rapid fiber characterization using glass microscope slides, allowing influential processing parameters on fiber morphology to be assessed, as well as observed fiber collection phenomena on different collector substrates. The distribution and alignment of melt electrospun PCL fibers can be controlled to a certain degree using patterned collectors to create large numbers of scaffolds with shaped macroporous architectures. However, the buildup of residual charge in the collected fibers limits the achievable thickness of the porous template through such scaffolds. One challenge identified for MEW is the ability to control charge buildup so that fibers can be placed accurately in close proximity, and in many centimeter heights. The scale and size of scaffolds produced using MEW, however, indicate that this emerging process will fill a technological niche in biofabrication.

A new load distribution strategy for linear network with communication delays

In this paper, we propose a new load distribution strategy called `send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of `digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.

ELISA: An Estimated Load Information Scheduling Algorithm for Distributed Computing Systems

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems.

Fault-tolerant characteristics and topological properties of a hierarchical network of hypercubes

We analyse the fault-tolerant parameters and topological properties of a hierarchical network of hypercubes. We take a close look at the Extended Hypercube (EH) and the Hyperweave (HW) architectures and also compare them with other popular architectures. These two architectures have low diameter and constant degree of connectivity making it possible to expand these networks without affecting the existing configuration. A scheme for incrementally expanding this network is also presented. We also look at the performance of the ASCEND/DESCEND class of algorithms on these architectures.

Site-controlled growth of Ge nanostructures on Si(100) via pulsed laser deposition nanostenciling

The authors combine nanostenciling and pulsed laser deposition to patterngermanium(Ge)nanostructures into desired architectures. They have analyzed the evolution of the Ge morphology with coverage. Following the formation of a wetting layer within each area defined by the stencil’s apertures, Gegrowth becomes three dimensional and the size and number of Ge nanocrystals evolve with coverage. Micro-Raman spectroscopy shows that the deposits are crystalline and epitaxial. This approach is promising for the parallel patterning of semiconductor nanostructures for optoelectronic applications.

Molecular self-assembly on graphene

The formation of ordered arrays of molecules via self-assembly is a rapid, scalable route towards the realization of nanoscale architectures with tailored properties. In recent years, graphene has emerged as an appealing substrate for molecular self-assembly in two dimensions. Here, the first five years of progress in supramolecular organization on graphene are reviewed. The self-assembly process can vary depending on the type of graphene employed: epitaxial graphene, grown in situ on a metal surface, and non-epitaxial graphene, transferred onto an arbitrary substrate, can have different effects on the final structure. On epitaxial graphene, the process is sensitive to the interaction between the graphene and the substrate on which it is grown. In the case of graphene that strongly interacts with its substrate, such as graphene/Ru(0001), the inhomogeneous adsorption landscape of the graphene moiré superlattice provides a unique opportunity for guiding molecular organization, since molecules experience spatially constrained diffusion and adsorption. On weaker-interacting epitaxial graphene films, and on non-epitaxial graphene transferred onto a host substrate, self-assembly leads to films similar to those obtained on graphite surfaces. The efficacy of a graphene layer for facilitating planar adsorption of aromatic molecules has been repeatedly demonstrated, indicating that it can be used to direct molecular adsorption, and therefore carrier transport, in a certain orientation, and suggesting that the use of transferred graphene may allow for predictible molecular self-assembly on a wide range of surfaces.

PocketMatch: A new algorithm to compare binding sites in protein structures

Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. Results: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. A comparison with other site matching algorithms is also presented. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless combined with chemical nature of amino acids. Conclusion: A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along with the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250(th) second for one comparison on a single processor. A parallel version on BlueGene has also been implemented.

Comparative kinomics of human and chimpanzee reveal unique kinship and functional diversity generated by new domain combinations

Background: Phosphorylation by protein kinases is a common event in many cellular processes. Further, many kinases perform specialized roles and are regulated by non-kinase domains tethered to kinase domain. Perturbation in the regulation of kinases leads to malignancy. We have identified and analysed putative protein kinases encoded in the genome of chimpanzee which is a close evolutionary relative of human. Result: The shared core biology between chimpanzee and human is characterized by many orthologous protein kinases which are involved in conserved pathways. Domain architectures specific to chimp/human kinases have been observed. Chimp kinases with unique domain architectures are characterized by deletion of one or more non-kinase domains in the human kinases. Interestingly, counterparts of some of the multi-domain human kinases in chimp are characterized by identical domain architectures but with kinase-like non-kinase domain. Remarkably, out of 587 chimpanzee kinases no human orthologue with greater than 95% sequence identity could be identified for 160 kinases. Variations in chimpanzee kinases compared to human kinases are brought about also by differences in functions of domains tethered to the catalytic kinase domain. For example, the heterodimer forming PB1 domain related to the fold of ubiquitin/Ras-binding domain is seen uniquely tethered to PKC-like chimpanzee kinase. Conclusion: Though the chimpanzee and human are evolutionary very close, there are chimpanzee kinases with no close counterpart in the human suggesting differences in their functions. This analysis provides a direction for experimental analysis of human and chimpanzee protein kinases in order to enhance our understanding on their specific biological roles.

Artificial Neural Network Based Automatic Emergency Landing Site Selection for UAVs and Highly Automated Aircraft

In this report an artificial neural network (ANN) based automated emergency landing site selection system for unmanned aerial vehicle (UAV) and general aviation (GA) is described. The system aims increase safety of UAV operation by emulating pilot decision making in emergency landing scenarios using an ANN to select a safe landing site from available candidates. The strength of an ANN to model complex input relationships makes it a perfect system to handle the multicriteria decision making (MCDM) process of emergency landing site selection. The ANN operates by identifying the more favorable of two landing sites when provided with an input vector derived from both landing site's parameters, the aircraft's current state and wind measurements. The system consists of a feed forward ANN, a pre-processor class which produces ANN input vectors and a class in charge of creating a ranking of landing site candidates using the ANN. The system was successfully implemented in C++ using the FANN C++ library and ROS. Results obtained from ANN training and simulations using randomly generated landing sites by a site detection simulator data verify the feasibility of an ANN based automated emergency landing site selection system.

Architecture Optimization of Aerospace Computing Systems

Simultaneous consideration of both performance and reliability issues is important in the choice of computer architectures for real-time aerospace applications. One of the requirements for such a fault-tolerant computer system is the characteristic of graceful degradation. A shared and replicated resources computing system represents such an architecture. In this paper, a combinatorial model is used for the evaluation of the instruction execution rate of a degradable, replicated resources computing system such as a modular multiprocessor system. Next, a method is presented to evaluate the computation reliability of such a system utilizing a reliability graph model and the instruction execution rate. Finally, this computation reliability measure, which simultaneously describes both performance and reliability, is applied as a constraint in an architecture optimization model for such computing systems. Index Terms-Architecture optimization, computation

Fault tolerance in multiprocessor systems

Multiprocessor systems which afford a high degree of parallelism are used in a variety of applications. The extremely stringent reliability requirement has made the provision of fault-tolerance an important aspect in the design of such systems. This paper presents a review of the various approaches towards tolerating hardware faults in multiprocessor systems. It. emphasizes the basic concepts of fault tolerant design and the various problems to be taken care of by the designer. An indepth survey of the various models, techniques and methods for fault diagnosis is given. Further, we consider the strategies for fault-tolerance in specialized multiprocessor architectures which have the ability of dynamic reconfiguration and are suited to VLSI implementation. An analysis of the state-óf-the-art is given which points out the major aspects of fault-tolerance in such architectures.

Practical Algorithms For Mean Velocity Estimation In Pulse Doppler Weather Radars Using A Small Number Of Samples

Doppler weather radars with fast scanning rates must estimate spectral moments based on a small number of echo samples. This paper concerns the estimation of mean Doppler velocity in a coherent radar using a short complex time series. Specific results are presented based on 16 samples. A wide range of signal-to-noise ratios are considered, and attention is given to ease of implementation. It is shown that FFT estimators fare poorly in low SNR and/or high spectrum-width situations. Several variants of a vector pulse-pair processor are postulated and an algorithm is developed for the resolution of phase angle ambiguity. This processor is found to be better than conventional processors at very low SNR values. A feasible approximation to the maximum entropy estimator is derived as well as a technique utilizing the maximization of the periodogram. It is found that a vector pulse-pair processor operating with four lags for clear air observation and a single lag (pulse-pair mode) for storm observation may be a good way to estimate Doppler velocities over the entire gamut of weather phenomena.

The poly dA helix: a new structural motif for high performance DNA-based molecular switches

We report a pH-dependent conformational transition in short, defined homopolymeric deoxyadenosines (dA(15)) from a single helical structure with stacked nucleobases at neutral pH to a double-helical, parallel-stranded duplex held together by AH-HA base pairs at acidic pH. Using native PAGE, 2D NMR, circular dichroism (CD) and fluorescence spectroscopy, we have characterized the two different pH dependent forms of dA(15). The pH-triggered transition between the two defined helical forms of dA(15) is characterized by CD and fluorescence. The kinetics of this conformational switch is found to occur on a millisecond time scale. This robust, highly reversible, pH-induced transition between the two well-defined structured states of dA(15)represents a new molecular building block for the construction of quick-response, pH-switchable architectures in structural DNA nanotechnology.

Icosahedral DNA Nanocapsules by Modular Assembly

The construction of well-defined 3D architectures is one of the greatest challenges of self-assembly. Nanofabrication through molecular self-assembly has resulted in the formation of DNA polyhedra with the connectivities of cubes,[1] tetrahedra,[2,3] octahedra,[4, 5] dodecahedra,[3] and buckminsterfullerene.[ 3] DNA polyhedra could also function as nanocapsules and thereby enable the targeted delivery of entities encapsulated from solution. Key to realizing this envisaged function is the construction of complex polyhedra that maximize encapsulation volumes while preserving small. pore size.