Burrknots as food source for larval development of Grapholita molesta (Lepidoptera: Tortricidae) on apple trees.

Grapholita molesta (Busck) is one of the main pests of apple trees, and lives on their shoots and fruits. In southern Brazil, the insect is also found on old branches and structures similar to aerial roots, so-called burrknots. This study evaluated the development and population growth potential of G. molesta fed on burrknots, compared with apple fruit cultivar. Fuji and a corn-based artiÞcial diet. The study was carried out in the laboratory under controlled temperature (25 1C), relative humidity (7010%), and photophase (16 h). The biological parameters of the immature and adult stages were determined, and a fertility life table was constructed. Insects fed on burrknots showed a longer duration and a lower survival for the egg-to-adult period (29.3 d and 22.5%) compared with those that fed on apples (25.1 d and 30.0%) and artiÞcial diet (23.9 d and 54.8%). Insects reared on aerial roots had a lower pupal weight (10.0 mg) compared with those reared on either artiÞcial diet (13.7 mg) or apple cultivar. Fuji (12.4 mg). The fecundity and longevity of males and females did not signiÞcantly differ for the three foods. Based on the fertility life table, insects reared on burrknots had the lowest net reproductive rate (Ro), intrinsic rate of population growth (rm) and finite rate of increase, compared with insects reared on artiÞcial diet and apple fruit. Burrknots support the development of the complete cycle of G. molesta, which allows populations of this pest to increase in orchards.

A sustainable PWR fuel cycle with complete TRU recycling using fertile-free fuel

The feasibility of a conventional PWR fuel cycle with complete recycling of TRU elements in the same reactor is investigated. A new Combined Non-fertile and Uranium (CONFU) fuel assembly where about 20% of the uranium fuel pins are replaced with fertile free fuel (FFF) hosting TRU generated in the previous cycle is proposed. In this sustainable fuel cycle based on the CONFU fuel assembly concept, the amount and radiotoxicity of the nuclear waste can be significantly reduced in comparison with the conventional once-through UO 2 fuel cycle. It is shown that under the constraints of acceptable power peaking limits, the CONFU assembly exhibits negative reactivity feedback coefficients comparable in values to those of the reference UO2 fuel. Moreover, the effective delayed neutron fraction is about the same as for UO2-fueled cores. Therefore, feasibility of the PWR core operation and control with complete TRU recycle has been shown in principle. However, gradual build up of small amounts of Cm and Cf challenges fuel reprocessing and fabrication due to the high spontaneous fissions rates of these nuclides and heat generation by some Pu, Am, and Cm isotopes. Feasibility of the processing steps becomes more attainable if the time between discharge and reprocessing is 20 years or longer. The implications for the entire fuel cycle will have to be addressed in future studies.

Analysis of Masticatory Cycle Efficiency in Complete Denture Wearers

Purpose: This study assessed masticatory efficiency and duration of the masticatory cycle in 14 asymptomatic patients with severe bone resorption. All patients had worn complete dentures for over 10 years. Recall visits were scheduled at 5 months and 1 year after receiving new dentures.Materials and Methods: Fourteen patients were evaluated in this study. The Research Diagnostic Criteria questionnaire and tests of the efficiency and duration of the masticatory cycle were performed with artificial food before, 5 months after, and 1 year after new dentures were delivered. Masticatory efficiency was assessed using a sieve system; artificial food was ground for 35 masticatory cycles and monitored by the operator.Results: Masticatory efficiency at 5 months was significantly improved for the 0.42-mm mesh. An improvement in masticatory efficiency and a reduction in mastication time were observed with the new dentures after 1 year.Conclusion: The results of this study indicated that 5 months did not allow enough time to demonstrate improved muscular capacity and ability after receiving new dentures. After 1 year, the duration of the masticatory cycle was reduced, and masticatory efficiency was significantly improved.

Genomic evidence for a complete sexual cycle in Candida albicans

Candida albicans is a diploid fungus that has become a medically important opportunistic pathogen in immunocompromised individuals. We have sequenced the C. albicans genome to 10.4-fold coverage and performed a comparative genomic analysis between C. albicans and Saccharomyces cerevisiae with the objective of assessing whether Candida possesses a genetic repertoire that could support a complete sexual cycle. Analyzing over 500 genes important for sexual differentiation in S. cerevisiae, we find many homologues of genes that are implicated in the initiation of meiosis, chromosome recombination, and the formation of synaptonemal complexes. However, others are striking in their absence. C. albicans seems to have homologues of all of the elements of a functional pheromone response pathway involved in mating in S. cerevisiae but lacks many homologues of S. cerevisiae genes for meiosis. Other meiotic gene homologues in organisms ranging from filamentous fungi to Drosophila melanogaster and Caenorhabditis elegans were also found in the C. albicans genome, suggesting potential alternative mechanisms of genetic exchange.

Common multiples of complete graphs and a 4-cycle

A graph G is a common multiple of two graphs H-1 and H-2 if there exists a decomposition of G into edge-disjoint copies of H-1 and also a decomposition of G into edge-disjoint copies of H-2. In this paper, we consider the case where H-1 is the 4-cycle C-4 and H-2 is the complete graph with n vertices K-n. We determine, for all positive integers n, the set of integers q for which there exists a common multiple of C-4 and K-n having precisely q edges. (C) 2003 Elsevier B.V. All rights reserved.

The extended metamorphosis of a complete bipartite design into a cycle system

A K-t,K-t-design of order n is an edge-disjoint decomposition of K-n into copies of K-t,K-t. When t is odd, an extended metamorphosis of a K-t,K-t-design of order n into a 2t-cycle system of order n is obtained by taking (t - 1)/2 edge-disjoint cycles of length 2t from each K-t,K-t block, and rearranging all the remaining 1-factors in each K-t,K-t block into further 2t-cycles. The 'extended' refers to the fact that as many subgraphs isomorphic to a 2t-cycle as possible are removed from each K-t,K-t block, rather than merely one subgraph. In this paper an extended metamorphosis of a K-t,K-t-design of order congruent to 1 (mod 4t(2)) into a 2t-cycle system of the same order is given for all odd t > 3. A metamorphosis of a 2-fold K-t,K-t-design of any order congruent to 1 (mod 4t(2)) into a 2t-cycle system of the same order is also given, for all odd t > 3. (The case t = 3 appeared in Ars Combin. 64 (2002) 65-80.) When t is even, the graph K-t,K-t is easily seen to contain t/2 edge-disjoint cycles of length 2t, and so the metamorphosis in that case is straightforward. (C) 2004 Elsevier B.V. All rights reserved.

Some equitably 3-colourable cycle decompositions of complete equipartite graphs

Let G be a graph in which each vertex has been coloured using one of k colours, say c(1), c(2),.. , c(k). If an m-cycle C in G has n(i) vertices coloured c(i), i = 1, 2,..., k, and vertical bar n(i) - n(j)vertical bar <= 1 for any i, j is an element of {1, 2,..., k}, then C is said to be equitably k-coloured. An m-cycle decomposition C of a graph G is equitably k-colourable if the vertices of G can be coloured so that every m-cycle in W is equitably k-coloured. For m = 3, 4 and 5 we completely settle the existence question for equitably 3-colourable m-cycle decompositions of complete equipartite graphs. (c) 2005 Elsevier B.V. All rights reserved.

Cumulative live birth rates after one or more complete cycles of IVF : a population-based study of linked cycle data from 178 898 women

© The Author 2016. Published by Oxford University Press on behalf of the European Society of Human Reproduction and Embryology. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Spectrum sensing using two-stage detection to compensate for reduced primary user duty cycle

Spectrum sensing is considered to be one of the most important tasks in cognitive radio. One of the common assumption among current spectrum sensing detectors is the full presence or complete absence of the primary user within the sensing period. In reality, there are many situations where the primary user signal only occupies a portion of the observed signal and the assumption of primary user duty cycle not necessarily fulfilled. In this paper we show that the true detection performance can degrade from the assumed achievable values when the observed primary user exhibits a certain duty cycle. Therefore, a two-stage detection method incorporating primary user duty cycle that enhances the detection performance is proposed. The proposed detector can improve the probability of detection under low duty cycle at the expense of a small decrease in performance at high duty cycle.

Sustainability in road transport : an integrated life cycle analysis for estimating emissions

Despite of a significant contribution of transport sector in the global economy and society, it is one of the largest sources of global energy consumption, green house gas emissions and environmental pollutions. A complete look onto the whole life cycle environmental inventory of this sector will be helpful to generate a holistic understanding of contributory factors causing emissions. Previous studies were mainly based on segmental views which mostly compare environmental impacts of different modes of transport, but very few consider impacts other than the operational phase. Ignoring the impacts of non-operational phases, e.g., manufacture, construction, maintenance, may not accurately reflect total contributions on emissions. Moreover an integrated study for all motorized modes of road transport is also needed to achieve a holistic estimation. The objective of this study is to develop a component based life cycle inventory model which considers impacts of both operational and non-operational phases of the whole life as well as different transport modes. In particular, the whole life cycle of road transport has been segmented into vehicle, infrastructure, fuel and operational components and inventories have been conducted on each component. The inventory model has been demonstrated using the road transport of Singapore. Results show that total life cycle green house gas emissions from the road transport sector of Singapore is 7.8 million tons per year, among which operational phase and non-operational phases contribute about 55% and about 45%, respectively. Total amount of criteria air pollutants are 46, 8.5, 33.6, 13.6 and 2.6 thousand tons per year for CO, SO2, NOx, VOC and PM10, respectively. From the findings, it can be deduced that stringent government policies on emission control measures have a significant impact on reducing environmental pollutions. In combating global warming and environmental pollutions the promotion of public transport over private modes is an effective sustainable policy.

Environmental sustainability of urban road transport : an integrated analysis for life cycle emission impact

Despite of significant contributions of urban road transport to global economy and society, it is one of the largest sources of local and global emission impact. In order to address the environmental concerns of urban road transport it is imperative to achieve a holistic understanding of contributory factors causing emissions which requires a complete look onto its whole life cycle. Previous studies were mainly based on segmental views which mostly studied environmental impacts of individual transport modes and very few considered impacts other than operational phase. This study develops an integrated life cycle inventory model for urban road transport emissions from a holistic modal perspective. Singapore case was used to demonstrate the model. Results show that total life cycle greenhouse gas emission from Singapore’s road transport sector is 7.8 million tons per year. The total amount of criteria air pollutants are also estimated in this study.

Growth of Mycobacterium smegmatis in minimal and complete media

The growth patterns of Mycobacterium smegmatis SN2 in a minimal medium and in nutrient broth have been compared. The growth was monitored by absorbancy (Klett readings), colony forming units, wet weight and content of DNA, RNA and protein. During the early part of the growth cycle, the bacteria had higher wet weight and macromolecular content in nutrient broth than in minimal media. During the latter half of the growth cycle however, biosynthesis stopped much earlier in nutrient broth and the bacteria had a much lower content of macromolecules than in the minimal medium. In both the media, a general pattern of completing biosynthesis rapidly in the initial phase and a certain amount of cell division at a later time involving the distribution of preformed macromolecules was seen. The possible adaptive significance of this observation has been discussed.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.