Diabetes downregulates large-conductance Ca2+-activated potassium beta 1 channel subunit in retinal arteriolar smooth muscle

Retinal vasoconstriction and reduced retinal blood flow precede the onset of diabetic retinopathy. The pathophysiological mechanisms that underlie increased retinal arteriolar tone during diabetes remain unclear. Normally, local Ca(2+) release events (Ca(2+)-sparks), trigger the activation of large-conductance Ca(2+)-activated K(+)(BK)-channels which hyperpolarize and relax vascular smooth muscle cells, thereby causing vasodilatation. In the present study, we examined BK channel function in retinal vascular smooth muscle cells from streptozotocin-induced diabetic rats. The BK channel inhibitor, Penitrem A, constricted nondiabetic retinal arterioles (pressurized to 70mmHg) by 28%. The BK current evoked by caffeine was dramatically reduced in retinal arterioles from diabetic animals even though caffeine-evoked [Ca(2+)](i) release was unaffected. Spontaneous BK currents were smaller in diabetic cells, but the amplitude of Ca(2+)-sparks was larger. The amplitudes of BK currents elicited by depolarizing voltage steps were similar in control and diabetic arterioles and mRNA expression of the pore-forming BKalpha subunit was unchanged. The Ca(2+)-sensitivity of single BK channels from diabetic retinal vascular smooth muscle cells was markedly reduced. The BKbeta1 subunit confers Ca(2+)-sensitivity to BK channel complexes and both transcript and protein levels for BKbeta1 were appreciably lower in diabetic retinal arterioles. The mean open times and the sensitivity of BK channels to tamoxifen were decreased in diabetic cells, consistent with a downregulation of BKbeta1 subunits. The potency of blockade by Pen A was lower for BK channels from diabetic animals. Thus, changes in the molecular composition of BK channels could account for retinal hypoperfusion in early diabetes, an idea having wider implications for the pathogenesis of diabetic hypertension.

Studies in the use of magnetic microspheres for immunoaffinity extraction of paralytic shellfish poisoning toxins from shellfish

Paralytic shellfish poisoning (PSP) is a potentially fatal human health condition caused by the consumption of shellfish containing high levels of PSP toxins. Toxin extraction from shellfish and from algal cultures for use as standards and analysis by alternative analytical monitoring methods to the mouse bioassay is extensive and laborious. This study investigated whether a selected MAb antibody could be coupled to a novel form of magnetic microsphere (hollow glass magnetic microspheres, brand name Ferrospheres-N) and whether these coated microspheres could be utilized in the extraction of low concentrations of the PSP toxin, STX, from potential extraction buffers and spiked mussel extracts. The feasibility of utilizing a mass of 25 mg of Ferrospheres-N, as a simple extraction procedure for STX from spiked sodium acetate buffer, spiked PBS buffer and spiked mussel extracts was determined. The effects of a range of toxin concentrations (20-300 ng/mL), incubation times and temperature on the capability of the immuno-capture of the STX from the spiked mussel extracts were investigated. Finally, the coated microspheres were tested to determine their efficiency at extracting PSP toxins from naturally contaminated mussel samples. Toxin recovery after each experiment was determined by HPLC analysis. This study on using a highly novel immunoaffinity based extraction procedure, using STX as a model, has indicated that it could be a convenient alternative to conventional extraction procedures used in toxin purification prior to sample analysis.

Automated Methods for Virtual Maintainability & Aerospace Maintenance Planning

Abstract. Modern business practices in engineering are increasingly turning to post manufacture service provision in an attempt to generate additional revenue streams and ensure commercial sustainability. Maintainability has always been a consideration during the design process but in the past it has been generally considered to be of tertiary importance behind manufacturability and primary product function in terms of design priorities. The need to draw whole life considerations into concurrent engineering (CE) practice has encouraged companies to address issues such as maintenance, earlier in the design process giving equal importance to all aspects of the product lifecycle. The consideration of design for maintainability (DFM) early in the design process has the potential to significantly reduce maintenance costs, and improve overall running efficiencies as well as safety levels. However a lack of simulation tools still hinders the adaptation of CE to include practical elements of design and therefore further research is required to develop methods by which ‘hands on’ activities such as maintenance can be fully assessed and optimised as concepts develop. Virtual Reality (VR) has the potential to address this issue but the application of these traditionally high cost systems can require complex infrastructure and their use has typically focused on aesthetic aspects of mature designs. This paper examines the application of cost effective VR technology to the rapid assessment of aircraft interior inspection during conceptual design. It focuses on the integration of VR hardware with a typical desktop engineering system and examines the challenges with data transfer, graphics quality and the development of practical user functions within the VR environment. Conclusions drawn to date indicate that the system has the potential to improve maintenance planning through the provision of a usable environment for inspection which is available as soon as preliminary structural models are generated as part of the conceptual design process. Challenges still exist in the efficient transfer of data between the CAD and VR environments as well as the quantification of any benefits that result from the proposed approach. The result of this research will help to improve product maintainability, reduce product development cycle times and lower maintenance costs.

Slowly fading super-luminous supernovae that are not pair-instability explosions

Super-luminous supernovae that radiate more than 10 44 ergs per second at their peak luminosity have recently been discovered in faint galaxies at redshifts of 0.1-4. Some evolve slowly, resembling models of 'pair-instability' supernovae. Such models involve stars with original masses 140-260 times that of the Sun that now have carbon-oxygen cores of 65-130 solar masses. In these stars, the photons that prevent gravitational collapse are converted to electron-positron pairs, causing rapid contraction and thermonuclear explosions. Many solar masses of 56 Ni are synthesized; this isotope decays to 56 Fe via 56 Co, powering bright light curves. Such massive progenitors are expected to have formed from metal-poor gas in the early Universe. Recently, supernova 2007bi in a galaxy at redshift 0.127 (about 12 billion years after the Big Bang) with a metallicity one-third that of the Sun was observed to look like a fading pair-instability supernova. Here we report observations of two slow-to-fade super-luminous supernovae that show relatively fast rise times and blue colours, which are incompatible with pair-instability models. Their late-time light-curve and spectral similarities to supernova 2007bi call the nature of that event into question. Our early spectra closely resemble typical fast-declining super-luminous supernovae, which are not powered by radioactivity. Modelling our observations with 10-16 solar masses of magnetar-energized ejecta demonstrates the possibility of a common explosion mechanism. The lack of unambiguous nearby pair-instability events suggests that their local rate of occurrence is less than 6 × 10 -6 times that of the core-collapse rate. © 2013 Macmillan Publishers Limited. All rights reserved.

Correlation of Static Ageing Effects on Automotive Catalysts

This study identifies and analyzes the effect that aging time and temperature have on the CO light-off activity of three-way catalyst samples, aged in a static air (oxidizing) atmosphere. The bench aging time (BAT) equation proposed by the Environmental Protection Agency (EPA), which describes aging as dependent upon time at temperature, was used to calculate a range of oven aging times and temperatures based on a RAT-A engine bench aging cycle.

CO light-off tests carried out on cores aged between 800 and 900 °C have shown that it is the aging temperature that has the greatest effect on catalyst deterioration for static aging testing, with aging time having little effect. These results were in contradiction to the BAT equation, an industry norm for the aging of catalysts. This demonstrates that static aging, whilst showing how temperature affects aging, gives little or no time effects. The results have shown that static aging is not representative of actual aging on a vehicle.

Progressive aging conducted at a temperature of 1000 °C was shown to cause a decrease in catalyst activity as the aging time increased. However, even in these extreme conditions, static aging gave a slower rate of aging with time when compared to engine aging as defined by the BAT equation. Overall, static aging in air has been shown to produce a greater increase in aging due to temperature than predicted by the BAT equation, but less aging due to aging time.

Population Mobility Dynamics Estimated from Mobile Telephony Data

In the last decade, mobile phones and mobile devices using mobile cellular telecommunication network connections have become ubiquitous. In several developed countries, the penetration of such devices has surpassed 100 percent. They facilitate communication and access to large quantities of data without the requirement of a fixed location or connection. Assuming mobile phones usually are in close proximity with the user, their cellular activities and locations are indicative of the user's activities and movements. As such, those cellular devices may be considered as a large scale distributed human activity sensing platform. This paper uses mobile operator telephony data to visualize the regional flows of people across the Republic of Ireland. In addition, the use of modified Markov chains for the ranking of significant regions of interest to mobile subscribers is investigated. Methodology is then presented which demonstrates how the ranking of significant regions of interest may be used to estimate national population, results of which are found to have strong correlation with census data.

Biocompatibility of Calcium Phosphate Bone Cement with Optimised Mechanical Properties

The broad aim of this work was to investigate and optimise the properties of calcium phosphate bone cements (CPCs) for use in vertebroplasty to achieve effective primary fixation of spinal fractures. The incorporation of collagen, both bovine and from a marine sponge (Chondrosia reniformis), into a CPC was investigated. The biological properties of the CPC and collagen-CPC composites were assessed in vitro through the use of human bone marrow stromal cells. Cytotoxicity, proliferation and osteoblastic differentiation were evaluated using lactate dehydrogenase, PicoGreen and alkaline phosphatase activity assays respectively. The addition of both types of collagen resulted in an increase in cytotoxicity, albeit not to a clinically relevant level. Cellular proliferation after 1, 7 and 14 days was unchanged. The osteogenic potential of the CPC was reduced through the addition of bovine collagen but remained unchanged in the case of the marine collagen. These findings, coupled with previous work showing that incorporation of marine collagen in this way can improve the physical properties of CPCs, suggest that such a composite may offer an alternative to CPCs in applications where low setting times and higher mechanical stability are important.

Transit timing variations in WASP-10b induced by stellar activity

The hot-JupiterWASP-10bwas reported by Maciejewski et al. to showtransit timing variations (TTVs) with an amplitude of ~3.5 min. These authors proposed that the observed TTVs were caused by a 0.1M_Jup perturbing companion with an orbital period of ~5.23 d, and hence, close to the outer 5:3 mean-motion resonance with WASP-10b. To test this scenario, we present eight new transit light curves of WASP-10b obtained with the Faulkes Telescope North and the Liverpool Telescope. The new light curves, together with 22 previously published ones, were modelled with a Markov Chain Monte Carlo transit fitting code. Transit depth differences reported forWASP-10b are thought to be due to starspot-induced brightness modulation of the host star. Assuming the star is brighter at the activity minimum, we favour a small planetary radius. We find Rp = 1.039^+0.043 _-0.049R_Jup in agreement with Johnson et al. and Maciejewski et al. Recent studies find no evidence for a significant eccentricity in this system. We present consistent system parameters for a circular orbit and refine the orbital ephemeris ofWASP-10b. Our homogeneously derived transit times do not support the previous claimed TTV signal, which was strongly dependent on two previously published transits that have been incorrectly normalized. Nevertheless, a linear ephemeris is not a statistically good fit to the transit times of WASP-10b. We show that the observed transit time variations are due to spot occultation features or systematics. We discuss and exemplify the effects of occultation spot features in the measured transit times and show that despite spot occultation during egress and ingress being difficult to distinguish in the transit light curves, they have a significant effect in the measured transit times. We conclude that if we account for spot features, the transit times of WASP-10b are consistent with a linear ephemeris with the exception of one transit (epoch 143) which is a partial transit. Therefore, there is currently no evidence for the existence of a companion to WASP-10b. Our results support the lack of TTVs of hot-Jupiters reported for the Kepler sample. 

An efficient genetic algorithm for the design optimization of cold-formed steel portal frame buildings

The design optimization of a cold-formed steel portal frame building is considered in this paper. The proposed genetic algorithm (GA) optimizer considers both topology (i.e., frame spacing and pitch) and cross-sectional sizes of the main structural members as the decision variables. Previous GAs in the literature were characterized by poor convergence, including slow progress, that usually results in excessive computation times and/or frequent failure to achieve an optimal or near-optimal solution. This is the main issue addressed in this paper. In an effort to improve the performance of the conventional GA, a niching strategy is presented that is shown to be an effective means of enhancing the dissimilarity of the solutions in each generation of the GA. Thus, population diversity is maintained and premature convergence is reduced significantly. Through benchmark examples, it is shown that the efficient GA proposed generates optimal solutions more consistently. A parametric study was carried out, and the results included. They show significant variation in the optimal topology in terms of pitch and frame spacing for a range of typical column heights. They also show that the optimized design achieved large savings based on the cost of the main structural elements; the inclusion of knee braces at the eaves yield further savings in cost, that are significant.

Patterns of hematopoietic chimerism following bone marrow transplantation for childhood acute lymphoblastic leukemia from volunteer unrelated donors

Hematopoietic chimerism was analyzed in serial bone marrow samples taken from 28 children following T-cell depleted unrelated donor bone marrow transplants (UD BMT) for acute lymphoblastic leukemia (ALL). Chimeric status was determined by polymerase chain reaction (PCR) of simple tandem repeat (STR) sequences (maximal sensitivity, 0.1%). At least two serial samples were examined in 23 patients. Of these, two had evidence of complete donor engraftment at all times and eight showed stable low level mixed chimerism (MC) (<1% recipient hematopoiesis). All 10 of these patients remain in remission with a minimum follow-up of 24 months. By contrast, 13 patients demonstrated a progressive return of recipient hematopoiesis. Five of these relapsed (4 to 9 months post BMT), one died of cytomegalovirus pneumonitis and seven remain in remission with a minimum follow-up of 24 months. Five children were excluded from serial analysis as two serial samples were not collected before either relapse (3) or graft rejection (2). We conclude that as with sibling transplants, ex vivo T depleted UD BMT in children with ALL is associated with a high incidence of MC. Stable donor engraftment and low level MC always correlated with continued remission. However, detection of a progressive return of recipient cells did not universally correlate with relapse, but highlighted those patients at greatest risk. Serial chimerism analysis by PCR of STRs provides a rapid and simple screening technique for the detection of relapse and the identification of patients with progressive MC who might benefit from detailed molecular analysis for minimal residual disease following matched volunteer UD BMT for childhood ALL.

Fast Byzantine Leader Election in Dynamic Networks

We study the fundamental Byzantine leader election problem in dynamic networks where the topology can change from round to round and nodes can also experience heavy {\em churn} (i.e., nodes can join and leave the network continuously over time). We assume the full information model where the Byzantine nodes have complete knowledge about the entire state of the network at every round (including random choices made by all the nodes), have unbounded computational power and can deviate arbitrarily from the protocol. The churn is controlled by an adversary that has complete knowledge and control over which nodes join and leave and at what times and also may rewire the topology in every round and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is an $O(\log^3 n)$ round algorithm that achieves Byzantine leader election under the presence of up to $O({n}^{1/2 - \epsilon})$ Byzantine nodes (for a small constant $\epsilon > 0$) and a churn of up to \\$O(\sqrt{n}/\poly\log(n))$ nodes per round (where $n$ is the stable network size).The algorithm elects a leader with probability at least $1-n^{-\Omega(1)}$ and guarantees that it is an honest node with probability at least $1-n^{-\Omega(1)}$; assuming the algorithm succeeds, the leader's identity will be known to a $1-o(1)$ fraction of the honest nodes. Our algorithm is fully-distributed, lightweight, and is simple to implement. It is also scalable, as it runs in polylogarithmic (in $n$) time and requires nodes to send and receive messages of only polylogarithmic size per round.To the best of our knowledge, our algorithm is the first scalable solution for Byzantine leader election in a dynamic network with a high rate of churn; our protocol can also be used to solve Byzantine agreement in a straightforward way.We also show how to implement an (almost-everywhere) public coin with constant bias in a dynamic network with Byzantine nodes and provide a mechanism for enabling honest nodes to store information reliably in the network, which might be of independent interest.

Methods for Optimal Work Instruction Delivery: Pictograms v Images

This paper focuses on quantifying the benefits of pictogram based instructions relative to static images for work instruction delivery. The assembly of a stiffened aircraft panel has been used as an exemplar for the work which seeks to address the challenge of identifying an instructional mode that can be location or language neutral while at the same time optimising assembly build times and maintaining build quality. Key performance parameters measured using a series of panel build experiments conducted by two separate groups were: overall build time, the number of subject references to instructional media, the number of build errors and the time taken to correct any mistakes. Overall build time for five builds for a group using pictogram instructions was about 20% lower than for the group using image based instructions. Also, the pictogram group made fewer errors. Although previous work identified that animated instructions result in optimal build times, the language neutrality of pictograms as well as the fact that they can be used without visualisation hardware mean that, on balance, they have broader applicability in terms of transferring assembly knowledge to the manufacturing environment.

Generation of cluster states in optomechanical quantum systems

We consider an optomechanical quantum system composed of a single cavity mode interacting with N mechanical resonators. We propose a scheme for generating continuous-variable graph states of arbitrary size and shape, including the so-called cluster states for universal quantum computation. The main feature of this scheme is that, differently from previous approaches, the graph states are hosted in the mechanical degrees of freedom rather than in the radiative ones. Specifically, via a 2N-tone drive, we engineer a linear Hamiltonian which is instrumental to dissipatively drive the system to the desired target state. The robustness of this scheme is assessed against finite interaction times and mechanical noise, confirming it as a valuable approach towards quantum state engineering for continuous-variable computation in a solid-state platform.

Fast Mining of Interesting Phrases from Subsets of Text Corpora

We address the problem of mining interesting phrases from subsets of a text corpus where the subset is specified using a set of features such as keywords that form a query. Previous algorithms for the problem have proposed solutions that involve sifting through a phrase dictionary based index or a document-based index where the solution is linear in either the phrase dictionary size or the size of the document subset. We propose the usage of an independence assumption between query keywords given the top correlated phrases, wherein the pre-processing could be reduced to discovering phrases from among the top phrases per each feature in the query. We then outline an indexing mechanism where per-keyword phrase lists are stored either in disk or memory, so that popular aggregation algorithms such as No Random Access and Sort-merge Join may be adapted to do the scoring at real-time to identify the top interesting phrases. Though such an approach is expected to be approximate, we empirically illustrate that very high accuracies (of over 90%) are achieved against the results of exact algorithms. Due to the simplified list-aggregation, we are also able to provide response times that are orders of magnitude better than state-of-the-art algorithms. Interestingly, our disk-based approach outperforms the in-memory baselines by up to hundred times and sometimes more, confirming the superiority of the proposed method.