Parameter estimation for a morphochemical reaction-diffusion model of electrochemical pattern formation

The process of electrodeposition can be described in terms of a reaction-diffusion partial differential equation (PDE) system that models the dynamics of the morphology profile and the chemical composition. Here we fit such a model to the different patterns present in a range of electrodeposited and electrochemically modified alloys using PDE constrained optimization. Experiments with simulated data show how the parameter space of the model can be divided into zones corresponding to the different physical patterns by examining the structure of an appropriate cost function. We then use real data to demonstrate how numerical optimization of the cost function can allow the model to fit the rich variety of patterns arising in experiments. The computational technique developed provides a potential tool for tuning experimental parameters to produce desired patterns.     

Control of volatile organic compounds by an AC energizedferroelectric pellet reactor and a pulsed corona reactor

Two laboratory-scale plasma reactors, an alternating current (AC) energized ferroelectric (high dielectric ceramic) packed bed reactor and a nanosecond pulsed corona reactor, were constructed. This study was done to develop baseline engineering data to demonstrate the feasibility of the application of plasma reactors to the destruction of various volatile organic compounds (VOCs) at PPM levels. Complete destruction was obtained for toluene. Conversions of methylene chloride at 95% and trichlorotrifluoroethane (known as CFC-113) at 67% were achieved for the plasma reactors used. The conversion was dependent on the mean electron energy in the reactor and was also related to how strongly halogen species were bonded with carbon     

Neural correlates of sexual arousal in homosexual and heterosexual men.

Men exhibit much higher levels of genital and subjective arousal to sexual stimuli containing their preferred sex than they do to stimuli containing only the nonpreferred sex. This study used event-related functional magnetic resonance imaging to investigate how this category-specific pattern would be reflected in the brains of homosexual (n = 11) and heterosexual (n = 11) men. Comparisons of activation to preferred sexual stimuli, nonpreferred sexual stimuli, and sports stimuli revealed large networks correlated with sexual arousal, spanning multiple cortical and subcortical areas. Both homosexual and heterosexual men exhibited category-specific arousal in brain activity. Within the amygdala, greater preference-related activity was observed in homosexual men, but it is unclear whether this is a cause or a consequence of their sexuality. In a subsequent analysis of regions hypothesized to support arousal, both participant groups demonstrated widespread increases in evoked activity for preferred stimuli. Aggregate data from these regions produced significant differences between stimulus types in 16 out of 22 participants. Significant activational differences matched reported sexual orientation in 15 of these 16 participants, representing an advance in psychophysiological measures of arousal. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Automating the identification and analysis of protein {beta}-barrels

ßBarrels are widespread and well-studied featuresof a great many protein structures. In this paper an unsuper-visedmethod for the detection of P-barrels is developed based ontechniques from graph theory. The hydrogen bonded connectivityof ß-sheets is derived using standard pattern recognitiontechniques and expressed as a graph. Barrels correspond to topologicalrings in these connectivity graphs and can thus be identifiedusing ring perception algorithms. Following from this, the characteristictopological structure of a barrel can be expressed using a novelform of reduced nomenclature that counts sequence separationsbetween successive members of the ring set These techniquesare tested by applying them to the detection of barrels in anon-redundant subset of the Brookhaven database. Results indicatethat topological rings do seem to correspond uniquely to ß-barrelsand that the technique, as implemented, finds the majority ofbarrels present in the dataset.     

External-Memory Algorithms for Processing Line Segments in Geographic Information Systems

In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing I/O communication. Geographical information systems (GIS) are good examples of such large-scale applications as they frequently handle huge amounts of spatial data. In this paper we develop efficient external-memory algorithms for a number of important problems involving line segments in the plane, including trapezoid decomposition, batched planar point location, triangulation, red--blue line segment intersection reporting, and general line segment intersection reporting. In GIS systems the first three problems are useful for rendering and modeling, and the latter two are frequently used for overlaying maps and extracting information from them.     

Prediction of fatigue behaviour in stress-concentrators of arbitrary geometry

A new method is outlined which aims to predict high-cycle fatigue behavior of components which fail from stress-concentrators. This involves examination of the stress field in the vicinity of the stress-concentrator, and comparison with stress fields for cracks at known stress intensities. Methods which are currently used for simple notch geometries can thus be generalised, making the approach applicable to stress concentrators of any geometry. The method of prediction is shown to be stable, providing a solution of good accuracy when compared to analytical methods for standard specimen geometries. Favourable comparisons with experimental data have been achieved both for standard notches and for a corner geometry which represents a typical component case.     

Using Survey Data and Mathematical Modeling to Prioritize Water Interventions in Developing Countries

Water Resources Management - A traditional cost-benefit analysis of potential water interventions in a given locality is a laborious and time-intensive process. To help decision makers identify...     

Human DDX3X Unwinds Japanese Encephalitis and Zika Viral 5′ Terminal Regions

Flavivirus genus includes many deadly viruses such as the Japanese encephalitis virus (JEV) and Zika virus (ZIKV). The 5′ terminal regions (TR) of flaviviruses interact with human proteins and such interactions are critical for viral replication. One of the human proteins identified to interact with the 5′ TR of JEV is the DEAD-box helicase, DDX3X. In this study, we in vitro transcribed the 5′ TR of JEV and demonstrated its direct interaction with recombinant DDX3X (K_d of 1.66 ± 0.21 µM) using microscale thermophoresis (MST). Due to the proposed structural similarities of 5′ and 3′ TRs of flaviviruses, we investigated if the ZIKV 5′ TR could also interact with human DDX3X. Our MST studies suggested that DDX3X recognizes ZIKV 5′ TR with a K_d of 7.05 ± 0.75 µM. Next, we performed helicase assays that suggested that the binding of DDX3X leads to the unwinding of JEV and ZIKV 5′ TRs. Overall, our data indicate, for the first time, that DDX3X can directly bind and unwind in vitro transcribed flaviviral TRs. In summary, our work indicates that DDX3X could be further explored as a therapeutic target to inhibit Flaviviral replication     

Improving the performance of GPU-based genetic programming through exploitation of on-chip memory

Genetic Programming (GP) (Koza, Genetic programming, MIT Press, Cambridge, 1992) is well-known as a computationally intensive technique. Subsequently, faster parallel versions have been implemented that harness the highly parallel hardware provided by graphics cards enabling significant gains in the performance of GP to be achieved. However, extracting the maximum performance from a graphics card for the purposes of GP is difficult. A key reason for this is that in addition to the processor resources, the fast on-chip memory of graphics cards needs to be fully exploited. Techniques will be presented that will improve the performance of a graphics card implementation of tree-based GP by better exploiting this faster memory. It will be demonstrated that both L1 cache and shared memory need to be considered for extracting the maximum performance. Better GP program representation and use of the register file is also explored to further boost performance. Using an NVidia Kepler 670GTX GPU, a maximum performance of 36 billion Genetic Programming Operations per Second is demonstrated.