Inducible resistance to maize streak virus

Maize streak virus (MSV), which causes maize streak disease (MSD), is the major viral pathogenic constraint on maize production in Africa. Type member of the Mastrevirus genus in the family Geminiviridae, MSV has a 2.7 kb, single-stranded circular DNA genome encoding a coat protein, movement protein, and the two replication-associated proteins Rep and RepA. While we have previously developed MSV-resistant transgenic maize lines constitutively expressing ‘‘dominant negative mutant’’ versions of the MSV Rep, the only transgenes we could use were those that caused no developmental defects during the regeneration of plants in tissue culture. A better transgene expression system would be an inducible one, where resistance-conferring transgenes are expressed only in MSV-infected cells. However, most known inducible transgene expression systems are hampered by background or ‘‘leaky’’ expression in the absence of the inducer. Here we describe an adaptation of the recently developed INPACT system to express MSV-derived resistance genes in cell culture. Split gene cassette constructs (SGCs) were developed containing three different transgenes in combination with three different promoter sequences. In each SGC, the transgene was split such that it would be translatable only in the presence of an infecting MSV’s replication associated protein. We used a quantitative real-time PCR assay to show that one of these SGCs (pSPLITrepIII-Rb-Ubi) inducibly inhibits MSV replication as efficiently as does a constitutively expressed transgene that has previously proven effective in protecting transgenic maize from MSV. In addition, in our cell-culture based assay pSPLITrepIII-Rb-Ubi inhibited replication of diverse MSV strains, and even, albeit to a lesser extent, of a different mastrevirus species. The application of this new technology to MSV resistance in maize could allow a better, more acceptable product.

Innovate triple constraints model for better construction projects results

The continuous changing impacts appeared in all solution understanding approaches in the projects management field (especially in the construction field of work) by adopting dynamic solution paths. The paper will define what argue to be a better relational model for project management constraints (time, cost, and scope). This new model will increase the success factors of any complex program / project. This is a qualitative research adopting a new avenue of investigation by following different approach of attributing project activities with social phenomena, and supporting phenomenon with field of observations rather than mathematical method by emerging solution from human, and ants' colonies successful practices. The results will show the correct approach of relation between the triple constraints considering the relation as multi agents system having specified communication channels based on agents locations. Information will be transferred between agents, and action would be taken based on constraint agents locations in the project structure allowing immediate changes abilities in order to overcome issues of over budget, behind schedule, and additional scope impact. This is complex adaptive system having self organizes technique, and cybernetic control. Resulted model can be used for improving existing project management methodologies.

Sensorineural hearing loss after treatment for head and neck cancer : a review of the literature

Background Definitive cisplatin-based is increasingly delivered as the treatment of choice for patients with head and neck cancer. Sensorineural hearing loss is a significant long term side effect of cisplatin-based chemoradiation and is associated with potential major quality of life issues for patients. Purpose The purpose of this manuscript was to review the mechanism behind sensorineural hearing loss in patients treated with cisplatin-based chemoradiation, including incidence, the contributions of radiotherapy and cisplatin to sensorineural hearing loss and the impact of the toxicity on patient quality of life. Methods Database searches were conducted through PubMed (National Centre for Biotechnology Information) and OvidSP Medline via the Queensland University of Technology Library website. General article searches were conducted through the online search engine Google Scholar. Articles were excluded if the full-text was unavailable, they were not in English or if they were published prior to 1990. Keywords included hearing loss, ototoxicity, cancer, quality of life, cisplatin and radiotherapy. Results/Discussion The total number of journal articles accessed was 290. Due to exclusion criteria, 129 articles were deemed appropriated for review. Findings indicated that sensorineural hearing loss is a significant, long term complication for patients treated with cisplatin-based chemoradiation. Current literature recognises the ototoxic effects of cisplatin and cranial irradiation as separate entities, however the impact of combined modality therapy on sensorineural hearing loss is seldom reported. Multiple risk factors for hearing loss are described, however there are contradictory opinions on incidence and severity and the exact radiation dose threshold responsible for inducing hearing loss in patients receiving combined modality therapy. Sensorineural hearing loss creates a subset of complexities for patients with head and neck cancer and that these patients face significant quality of life impairment. Conclusion The literature review identified that sensorineural hearing loss is a major quality of life issue for patients treated with cisplatin-based chemoradiation for head and neck cancer. Further investigation evaluating the contribution of cisplatin-based chemoradiation to sensorineural hearing loss and the subsequent effect on patient quality of life is warranted.

Getting away with murder: An examination of detected homicides staged as suicides

Staged crime scenes involve an offender deliberately altering evidence to simulate events to mislead investigators. Despite likely occurring more often than reported in the literature due to success in offender deception, the exact frequency of staged crime scenes is unknown. In an attempt to bridge this gap, a legal database was searched for detected staged scenes. A total of 115 cases were examined, and this study reports on 16 staged suicides that were examined through descriptive analysis. Findings indicate the frequent involvement of firearms, hanging, or asphyxia; and that offenders are usually known to victims, although not necessarily intimately.

Literacy and Digital Culture in the Early Years

In this chapter we present data drawn from observations of kindergarten children using iPads and talk with the children, their parents/guardians and teachers. We identify a continuum of practices that extends from ‘educational apps’ teaching handwriting, sight words and so forth to uses of the iPad as a device for multimodal literacy development and substantive conversation around children’s creative work. At the current time high stakes testing and the implementation of the Australian Curriculum are prompting new public and professional conversations about literacy and digital technology. The iPad is construed as both cause of and solution to problems of traditional literacy education. In this context we describe the literacies enabled by educational software available on iPads. We higlight the time constraints which bore on teachers' capacity to enact their visions of literacy education through the iPad platform and suggest ways of reflecting on responses to this constraint.

Multi-objective models and techniques for analysing the absolute capacity of railway networks

Railway capacity determination and expansion are very important topics. In prior research, the competition between different entities such as train services and train types, on different network corridors however have been ignored, poorly modelled, or else assumed to be static. In response, a comprehensive set of multi-objective models have been formulated in this article to perform a trade-off analysis. These models determine the total absolute capacity of railway networks as the most equitable solution according to a clearly defined set of competing objectives. The models also perform a sensitivity analysis of capacity with respect to those competing objectives. The models have been extensively tested on a case study and their significant worth is shown. The models were solved using a variety of techniques however an adaptive E constraint method was shown to be most superior. In order to identify only the best solution, a Simulated Annealing meta-heuristic was implemented and tested. However a linearization technique based upon separable programming was also developed and shown to be superior in terms of solution quality but far less in terms of computational time.

Optimal allocation of conservation effort among subpopulations of a threatened species: How important is patch quality?

Money is often a limiting factor in conservation, and attempting to conserve endangered species can be costly. Consequently, a framework for optimizing fiscally constrained conservation decisions for a single species is needed. In this paper we find the optimal budget allocation among isolated subpopulations of a threatened species to minimize local extinction probability. We solve the problem using stochastic dynamic programming, derive a useful and simple alternative guideline for allocating funds, and test its performance using forward simulation. The model considers subpopulations that persist in habitat patches of differing quality, which in our model is reflected in different relationships between money invested and extinction risk. We discover that, in most cases, subpopulations that are less efficient to manage should receive more money than those that are more efficient to manage, due to higher investment needed to reduce extinction risk. Our simple investment guideline performs almost as well as the exact optimal strategy. We illustrate our approach with a case study of the management of the Sumatran tiger, Panthera tigris sumatrae, in Kerinci Seblat National Park (KSNP), Indonesia. We find that different budgets should be allocated to the separate tiger subpopulations in KSNP. The subpopulation that is not at risk of extinction does not require any management investment. Based on the combination of risks of extinction and habitat quality, the optimal allocation for these particular tiger subpopulations is an unusual case: subpopulations that occur in higher-quality habitat (more efficient to manage) should receive more funds than the remaining subpopulation that is in lower-quality habitat. Because the yearly budget allocated to the KSNP for tiger conservation is small, to guarantee the persistence of all the subpopulations that are currently under threat we need to prioritize those that are easier to save. When allocating resources among subpopulations of a threatened species, the combined effects of differences in habitat quality, cost of action, and current subpopulation probability of extinction need to be integrated. We provide a useful guideline for allocating resources among isolated subpopulations of any threatened species. © 2010 by the Ecological Society of America.

Optimal eradication: When to stop looking for an invasive plant

The notion of being sure that you have completely eradicated an invasive species is fanciful because of imperfect detection and persistent seed banks. Eradication is commonly declared either on an ad hoc basis, on notions of seed bank longevity, or on setting arbitrary thresholds of 1% or 5% confidence that the species is not present. Rather than declaring eradication at some arbitrary level of confidence, we take an economic approach in which we stop looking when the expected costs outweigh the expected benefits. We develop theory that determines the number of years of absent surveys required to minimize the net expected cost. Given detection of a species is imperfect, the optimal stopping time is a trade-off between the cost of continued surveying and the cost of escape and damage if eradication is declared too soon. A simple rule of thumb compares well to the exact optimal solution using stochastic dynamic programming. Application of the approach to the eradication programme of Helenium amarum reveals that the actual stopping time was a precautionary one given the ranges for each parameter. © 2006 Blackwell Publishing Ltd/CNRS.

Subpopulation triage: How to allocate conservation effort among populations

Threatened species often exist in a small number of isolated subpopulations. Given limitations on conservation spending, managers must choose from strategies that range from managing just one subpopulation and risking all other subpopulations to managing all subpopulations equally and poorly, thereby risking the loss of all subpopulations. We took an economic approach to this problem in an effort to discover a simple rule of thumb for optimally allocating conservation effort among subpopulations. This rule was derived by maximizing the expected number of extant subpopulations remaining given n subpopulations are actually managed. We also derived a spatiotemporally optimized strategy through stochastic dynamic programming. The rule of thumb suggested that more subpopulations should be managed if the budget increases or if the cost of reducing local extinction probabilities decreases. The rule performed well against the exact optimal strategy that was the result of the stochastic dynamic program and much better than other simple strategies (e.g., always manage one extant subpopulation or half of the remaining subpopulation). We applied our approach to the allocation of funds in 2 contrasting case studies: reduction of poaching of Sumatran tigers (Panthera tigris sumatrae) and habitat acquisition for San Joaquin kit foxes (Vulpes macrotis mutica). For our estimated annual budget for Sumatran tiger management, the mean time to extinction was about 32 years. For our estimated annual management budget for kit foxes in the San Joaquin Valley, the mean time to extinction was approximately 24 years. Our framework allows managers to deal with the important question of how to allocate scarce conservation resources among subpopulations of any threatened species. © 2008 Society for Conservation Biology.

Dual compressible hybrid quantum secret sharing schemes based on extended unitary operations

A crucial issue with hybrid quantum secret sharing schemes is the amount of data that is allocated to the participants. The smaller the amount of allocated data, the better the performance of a scheme. Moreover, quantum data is very hard and expensive to deal with, therefore, it is desirable to use as little quantum data as possible. To achieve this goal, we first construct extended unitary operations by the tensor product of n, n ≥ 2, basic unitary operations, and then by using those extended operations, we design two quantum secret sharing schemes. The resulting dual compressible hybrid quantum secret sharing schemes, in which classical data play a complementary role to quantum data, range from threshold to access structure. Compared with the existing hybrid quantum secret sharing schemes, our proposed schemes not only reduce the number of quantum participants, but also the number of particles and the size of classical shares. To be exact, the number of particles that are used to carry quantum data is reduced to 1 while the size of classical secret shares also is also reduced to l−2 m−1 based on ((m+1, n′)) threshold and to l−2 r2 (where r2 is the number of maximal unqualified sets) based on adversary structure. Consequently, our proposed schemes can greatly reduce the cost and difficulty of generating and storing EPR pairs and lower the risk of transmitting encoded particles.

Buy low, sell high

We consider online trading in a single security with the objective of getting rich when its price ever exhibits a large upcrossing, without risking bankruptcy. We investigate payoff guarantees that are expressed in terms of the extremity of the upcrossings. We obtain an exact and elegant characterisation of the guarantees that can be achieved. Moreover, we derive a simple canonical strategy for each attainable guarantee.

Energy efficient home with price sensitive stochastically programmable TCAs

Introduction of dynamic pricing in present retail market, considerably affects customers with an increased cost of energy consumption. Therefore, customers are enforced to control their loads according to price variation. This paper proposes a new technique of Home Energy Management, which helps customers to minimize their cost of energy consumption by appropriately controlling their loads. Thermostatically Controllable Appliances (TCAs) such as air conditioner and water heater are focused in this study, as they consume more than 50% of the total household energy consumption. The control process includes stochastic dynamic programming, which incorporated uncertainties in price and demand variation. It leads to an accurate selection of appliance settings. It is followed by a real time control of selected appliances with its optimal settings. Temperature set points of TCAs are adjusted based on price droop which is a reflection of actual cost of energy consumption. Customer satisfaction is maintained within limits using constraint optimization. It is showed that considerable energy savings is achieved.

High order unconditionally stable difference schemes for the Riesz space-fractional telegraph equation

In this paper, a class of unconditionally stable difference schemes based on the Pad´e approximation is presented for the Riesz space-fractional telegraph equation. Firstly, we introduce a new variable to transform the original dfferential equation to an equivalent differential equation system. Then, we apply a second order fractional central difference scheme to discretise the Riesz space-fractional operator. Finally, we use (1, 1), (2, 2) and (3, 3) Pad´e approximations to give a fully discrete difference scheme for the resulting linear system of ordinary differential equations. Matrix analysis is used to show the unconditional stability of the proposed algorithms. Two examples with known exact solutions are chosen to assess the proposed difference schemes. Numerical results demonstrate that these schemes provide accurate and efficient methods for solving a space-fractional hyperbolic equation.

Impact of mobility constraints on epidemic broadcast mechanisms in delay-tolerant networks

In this paper, we investigate the effect of mobility constraints on epidemic broadcast mechanisms in DTNs (Delay-Tolerant Networks). Major factors affecting epidemic broadcast performances are its forwarding algorithm and node mobility. The impact of forwarding algorithm and node mobility on epidemic broadcast mechanisms has been actively studied in the literature, but those studies generally use unconstrained mobility models. The objective of this paper is therefore to quantitatively investigate the effect of mobility constraints on epidemic broadcast mechanisms. We evaluate the performances of three classes of epidemic broadcast mechanisms - P-BCAST (PUSH-based BroadCast), SA-BCAST (Self-Adaptive BroadCast), and HP-BCAST (History-based P-BCAST) - with a random waypoint mobility model with mobility constraints. Our finding includes that the existence of mobility constraints significantly improves the reach ability and dissemination speed of epidemic broadcast mechanisms while degrading their efficiency.

Efficiency of parallelisation of genetic algorithms in the data analysis context

Most real-life data analysis problems are difficult to solve using exact methods, due to the size of the datasets and the nature of the underlying mechanisms of the system under investigation. As datasets grow even larger, finding the balance between the quality of the approximation and the computing time of the heuristic becomes non-trivial. One solution is to consider parallel methods, and to use the increased computational power to perform a deeper exploration of the solution space in a similar time. It is, however, difficult to estimate a priori whether parallelisation will provide the expected improvement. In this paper we consider a well-known method, genetic algorithms, and evaluate on two distinct problem types the behaviour of the classic and parallel implementations.