Turtle ghrelin

In a recent paper, Wang and colleagues described the genomes of two turtles, the Chinese soft-shell turtle (Pelodiscus sinensis) and the green sea turtle (Chelonia mydas)1. A salient finding was an apparent absence of GHRL, the gene encoding the only known circulating orexigen, the peptide hormone ghrelin. The highly conserved GHRL encodes at least two bioactive peptide hormones, ghrelin2 and obestatin3, which are recognized to have a diverse range of functions in a number of cell types and physiological systems4, 5. Wang and colleagues hypothesized that the absence of ghrelin was associated with the low metabolic rate observed in these turtle species1.

Design of a robust grid interface system for PMSG-based wind turbine generators

A robust and reliable grid power interface system for wind turbines using a permanent-magnet synchronous generator (PMSG) is proposed in this paper, where an integration of a generator-side three-switch buck-type rectifier and a grid-side Z-source inverter is employed as a bridge between the generator and the grid. The modulation strategy for the proposed topology is developed from space-vector modulation and Z-source network operation principles. Two PMSG control methods, namely, unity-power-factor control and rotor-flux-orientation control (Id = 0), are studied to establish an optimized control scheme for the generator-side three-switch buck-type rectifier. The system control scheme decouples active- and reactive-power control through voltage-oriented control and optimizes PMSG control for the grid- and generator-side converters independently. Maximum power point tracking is implemented by adjusting the shoot-through duty cycles of the Z-source network. The design considerations of the passive components are also provided. The performances and practicalities of the designed architecture have been verified by simulations and experiments.

Towards increased road safety : real-time decision making for driverless city vehicles

This work elaborates on the topic of decision making for driverless city vehicles, particularly focusing on the aspects on how to develop a reliable approach which meets the requirements of safe city traffic. Decision making in this context refers to the problem of identifying the most appropriate driving maneuver to be performed in a given traffic situation. The overall decision making problem is decomposed into two consecutive stages. The first stage is safety-crucial, representing the decision regarding the set of feasible driving maneuvers. The second stage represents the decision regarding the most appropriate driving maneuver from the set of feasible ones. The developed decision making approach has been implemented in C++ and initially tested in a 3D simulation environment and, thereafter, in real-world experiments. The real-world experiments also included the integration of wireless communication between vehicles.

Ambiguity Acceptance Testing : A Comparison of the Ratio Test and Difference Test

Integer ambiguity resolution is an indispensable procedure for all high precision GNSS applications. The correctness of the estimated integer ambiguities is the key to achieving highly reliable positioning, but the solution cannot be validated with classical hypothesis testing methods. The integer aperture estimation theory unifies all existing ambiguity validation tests and provides a new prospective to review existing methods, which enables us to have a better understanding on the ambiguity validation problem. This contribution analyses two simple but efficient ambiguity validation test methods, ratio test and difference test, from three aspects: acceptance region, probability basis and numerical results. The major contribution of this paper can be summarized as: (1) The ratio test acceptance region is overlap of ellipsoids while the difference test acceptance region is overlap of half-spaces. (2) The probability basis of these two popular tests is firstly analyzed. The difference test is an approximation to optimal integer aperture, while the ratio test follows an exponential relationship in probability. (3) The limitations of the two tests are firstly identified. The two tests may under-evaluate the failure risk if the model is not strong enough or the float ambiguities fall in particular region. (4) Extensive numerical results are used to compare the performance of these two tests. The simulation results show the ratio test outperforms the difference test in some models while difference test performs better in other models. Particularly in the medium baseline kinematic model, the difference tests outperforms the ratio test, the superiority is independent on frequency number, observation noise, satellite geometry, while it depends on success rate and failure rate tolerance. Smaller failure rate leads to larger performance discrepancy.

Water Quality Indices from Unbalanced Spatio-Temporal Monitoring Designs

This chapter investigates a variety of water quality assessment tools for reservoirs with balanced/unbalanced monitoring designs and focuses on providing informative water quality assessments to ensure decision-makers are able to make risk-informed management decisions about reservoir health. In particular, two water quality assessment methods are described: non-compliance (probability of the number of times the indicator exceeds the recommended guideline) and amplitude (degree of departure from the guideline). Strengths and weaknesses of current and alternative water quality methods will be discussed. The proposed methodology is particularly applicable to unbalanced designs with/without missing values and reflects the general conditions and is not swayed too heavily by the occasional extreme value (very high or very low quality). To investigate the issues in greater detail, we use as a case study, a reservoir within South-East Queensland (SEQ), Australia. The purpose here is to obtain an annual score that reflected the overall water quality, temporally, spatially and across water quality indicators for each reservoir.

Numerical investigation into the buckling behavior of advanced grid stiffened composite cylindrical shell

Advanced grid stiffened composite cylindrical shell is widely adopted in advanced structures due to its exceptional mechanical properties. Buckling is a main failure mode of advanced grid stiffened structures in engineering, which calls for increasing attention. In this paper, the buckling response of advanced grid stiffened structure is investigated by three different means including equivalent stiffness model, finite element model and a hybrid model (H-model) that combines equivalent stiffness model with finite element model. Buckling experiment is carried out on an advanced grid stiffened structure to validate the efficiency of different modeling methods. Based on the comparison, the characteristics of different methods are independently evaluated. It is arguable that, by considering the defects of material, finite element model is a suitable numerical tool for the buckling analysis of advanced grid stiffened structures.

Removal of methyl orange from aqueous solutions through adsorption by calcium aluminate hydrates

Methyl orange (MO) is a kind of anionic dye and widely used in industry. In this study, tricalcium aluminate hydrates (Ca-Al-LDHs) are used as an adsorbent to remove methyl orange (MO) from aqueous solutions. The resulting products were studied by X-ray diffraction (XRD), infrared spectroscopy (MIR), thermal analysis (TG-DTA) and scanning electron microscope (SEM). The XRD results indicated that the MO molecules were successfully intercalated into the tricalcium aluminate hydrates, with the basal spacing of Ca-Al-LDH expanding to 2.48 nm. The MIR spectrum for CaAl-MO-LDH shows obvious bands assigned to the N@N, N@H stretching vibrations and S@O, SO_ 3 group respectively, which are considered as marks to assess MO_ ion intercalation into the interlayers of LDH. The overall morphology of CaAl-MOLDH displayed a ‘‘honey-comb’’ like structure, with the adjacent layers expanded.

Overexpression of the kiwifruit SVP3 gene affects reproductive development and suppresses anthocyanin biosynthesis in petals, but has no effect on vegetative growth, dormancy, or flowering time

SVP-like MADS domain transcription factors have been shown to regulate flowering time and both inflorescence and flower development in annual plants, while having effects on growth cessation and terminal bud formation in perennial species. Previously, four SVP genes were described in woody perennial vine kiwifruit (Actinidia spp.), with possible distinct roles in bud dormancy and flowering. Kiwifruit SVP3 transcript was confined to vegetative tissues and acted as a repressor of flowering as it was able to rescue the Arabidopsis svp41 mutant. To characterize kiwifruit SVP3 further, ectopic expression in kiwifruit species was performed. Ectopic expression of SVP3 in A. deliciosa did not affect general plant growth or the duration of endodormancy. Ectopic expression of SVP3 in A. eriantha also resulted in plants with normal vegetative growth, bud break, and flowering time. However, significantly prolonged and abnormal flower, fruit, and seed development were observed, arising from SVP3 interactions with kiwifruit floral homeotic MADS-domain proteins. Petal pigmentation was reduced as a result of SVP3-mediated interference with transcription of the kiwifruit flower tissue-specific R2R3 MYB regulator, MYB110a, and the gene encoding the key anthocyanin biosynthetic step, F3GT1. Constitutive expression of SVP3 had a similar impact on reproductive development in transgenic tobacco. The flowering time was not affected in day-neutral and photoperiod-responsive Nicotiana tabacum cultivars, but anthesis and seed germination were significantly delayed. The accumulation of anthocyanin in petals was reduced and the same underlying mechanism of R2R3 MYB NtAN2 transcript reduction was demonstrated.

How to sequence and annotate insect mitochondrial genomes for systematic and comparative genomics research

Over the past decade the mitochondrial (mt) genome has become the most widely used genomic resource available for systematic entomology. While the availability of other types of ‘–omics’ data – in particular transcriptomes – is increasing rapidly, mt genomes are still vastly cheaper to sequence and are far less demanding of high quality templates. Furthermore, almost all other ‘–omics’ approaches also sequence the mt genome, and so it can form a bridge between legacy and contemporary datasets. Mitochondrial genomes have now been sequenced for all insect orders, and in many instances representatives of each major lineage within orders (suborders, series or superfamilies depending on the group). They have also been applied to systematic questions at all taxonomic scales from resolving interordinal relationships (e.g. Cameron et al., 2009; Wan et al., 2012; Wang et al., 2012), through many intraordinal (e.g. Dowton et al., 2009; Timmermans et al., 2010; Zhao et al. 2013a) and family-level studies (e.g. Nelson et al., 2012; Zhao et al., 2013b) to population/biogeographic studies (e.g. Ma et al., 2012). Methodological issues around the use of mt genomes in insect phylogenetic analyses and the empirical results found to date have recently been reviewed by Cameron (2014), yet the technical aspects of sequencing and annotating mt genomes were not covered. Most papers which generate new mt genome report their methods in a simplified form which can be difficult to replicate without specific knowledge of the field. Published studies utilize a sufficiently wide range of approaches, usually without justification for the one chosen, that confusion about commonly used jargon such as ‘long PCR’ and ‘primer walking’ could be a serious barrier to entry. Furthermore, sequenced mt genomes have been annotated (gene locations defined) to wildly varying standards and improving data quality through consistent annotation procedures will benefit all downstream users of these datasets. The aims of this review are therefore to: 1. Describe in detail the various sequencing methods used on insect mt genomes; 2. Explore the strengths/weakness of different approaches; 3. Outline the procedures and software used for insect mt genome annotation, and; 4. Highlight quality control steps used for new annotations, and to improve the re-annotation of previously sequenced mt genomes used in systematic or comparative research.

A variant of the breast cancer type 2 susceptibility protein (BRC) repeat is essential for the RECQL5 Helicase to interact with RAD51 Recombinase for genome stabilization

The BRC repeat is a structural motif in the tumor suppressor BRCA2 (breast cancer type 2 susceptibility protein), which promotes homologous recombination (HR) by regulating RAD51 recombinase activity. To date, the BRC repeat has not been observed in other proteins, so that its role in HR is inferred only in the context of BRCA2. Here, we identified a BRC repeat variant, named BRCv, in the RECQL5 helicase, which possesses anti-recombinase activity in vitro and suppresses HR and promotes cellular resistance to camptothecin-induced replication stress in vivo. RECQL5-BRCv interacted with RAD51 through two conserved motifs similar to those in the BRCA2-BRC repeat. Mutations of either motif compromised functions of RECQL5, including association with RAD51, inhibition of RAD51-mediated D-loop formation, suppression of sister chromatid exchange, and resistance to camptothecin-induced replication stress. Potential BRCvs were also found in other HR regulatory proteins, including Srs2 and Sgs1, which possess anti-recombinase activities similar to that of RECQL5. A point mutation in the predicted Srs2-BRCv disrupted the ability of the protein to bind RAD51 and to inhibit D-loop formation. Thus, BRC is a common RAD51 interaction module that can be utilized by different proteins to either promote HR, as in the case of BRCA2, or to suppress HR, as in RECQL5.

Broadcast anti-jamming systems

In a traditional anti-jamming system a transmitter who wants to send a signal to a single receiver spreads the signal power over a wide frequency spectrum with the aim of stopping a jammer from blocking the transmission. In this paper, we consider the case that there are multiple receivers and the transmitter wants to broadcast a message to all receivers such that colluding groups of receivers cannot jam the reception of any other receiver. We propose efficient coding methods that achieve this goal and link this problem to well-known problems in combinatorics. We also link a generalisation of this problem to the Key Distribution Pattern problem studied in combinatorial cryptography.

An attack-localizing watermarking scheme for natural language documents

We present a text watermarking scheme that embeds a bitstream watermark Wi in a text document P preserving the meaning, context, and flow of the document. The document is viewed as a set of paragraphs, each paragraph being a set of sentences. The sequence of paragraphs and sentences used to embed watermark bits is permuted using a secret key. Then, English language sentence transformations are used to modify sentence lengths, thus embedding watermarking bits in the Least Significant Bits (LSB) of the sentences’ cardinalities. The embedding and extracting algorithms are public, while the secrecy and security of the watermark depends on a secret key K. The probability of False Positives is extremely small, hence avoiding incidental occurrences of our watermark in random text documents. Majority voting provides security against text addition, deletion, and swapping attacks, further reducing the probability of False Positives. The scheme is secure against the general attacks on text watermarks such as reproduction (photocopying, FAX), reformatting, synonym substitution, text addition, text deletion, text swapping, paragraph shuffling and collusion attacks.

A combinatorial approach to anonymous membership broadcast

A set system (X, F ) with X= {x 1,...,x m}) and F = {B1...,B n }, where B i ⊆ X, is called an (n, m) cover-free set system (or CF set system) if for any 1 ≤ i, j, k ≤ n and j ≠ k, |B i >2 |B j ∩ B k | +1. In this paper, we show that CF set systems can be used to construct anonymous membership broadcast schemes (or AMB schemes), allowing a center to broadcast a secret identity among a set of users in a such way that the users can verify whether or not the broadcast message contains their valid identity. Our goal is to construct (n, m) CF set systems in which for given m the value n is as large as possible. We give two constructions for CF set systems, the first one from error-correcting codes and the other from combinatorial designs. We link CF set systems to the concept of cover-free family studied by Erdös et al in early 80’s to derive bounds on parameters of CF set systems. We also discuss some possible extensions of the current work, motivated by different application.

Common secure index for conjunctive keyword-based retrieval over encrypted data

We consider the following problem: users in a dynamic group store their encrypted documents on an untrusted server, and wish to retrieve documents containing some keywords without any loss of data confidentiality. In this paper, we investigate common secure indices which can make multi-users in a dynamic group to obtain securely the encrypted documents shared among the group members without re-encrypting them. We give a formal definition of common secure index for conjunctive keyword-based retrieval over encrypted data (CSI-CKR), define the security requirement for CSI-CKR, and construct a CSI-CKR based on dynamic accumulators, Paillier’s cryptosystem and blind signatures. The security of proposed scheme is proved under strong RSA and co-DDH assumptions.

Converse results to the Wiener attack on RSA

A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-exponent d from the public key (N,e) as long as d < N 1/4. Interestingly, Wiener stated that his attack may sometimes also work when d is slightly larger than N 1/4. This raises the question of how much larger d can be: could the attack work with non-negligible probability for d=N 1/4 + ρ for some constant ρ > 0? We answer this question in the negative by proving a converse to Wiener’s result. Our result shows that, for any fixed ε > 0 and all sufficiently large modulus lengths, Wiener’s attack succeeds with negligible probability over a random choice of d < N δ (in an interval of size Ω(N δ )) as soon as δ > 1/4 + ε. Thus Wiener’s success bound d 1/4. The known attacks in this class (by Verheul and Van Tilborg and Dujella) run in exponential time, so it is natural to ask whether there exists an attack in this class with subexponential run-time. Our second converse result answers this question also in the negative.