An all-substrings common subsequence algorithm

Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a subsequence of both A and B. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n(a)n(b)) time and O(n(a) + n(b)) space. After this preparation, it is possible to build that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and a matrix of size O(n(b)(2)) the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem. (C) 2007 Elsevier B.V. All rights reserved.

Common And Endangered Species: How Does Society Allocate Support For Their Conservation

Examines how society allocates support for species’ conservation when numbers involved are large and resources are limited. Rational behaviour suggests that species in urgent need of conservation will receive more support than those species that are common. However, we demonstrate that in the absence of balanced knowledge common species will receive support more than they would otherwise receive despite society placing high existence values on all species. Twenty four species, both common and endangered and some with a restricted distribution, are examined. We demonstrate that balanced information is vital in order to direct more support for species that are endangered than those that are not. Implications for conservation stemming from the findings are discussed.

Improved cryptanalysis of the Common Scrambling Algorithm Stream Cipher

This paper provides a fresh analysis of the widely-used Common Scrambling Algorithm Stream Cipher (CSA-SC). Firstly, a new representation of CSA-SC with a state size of only 89 bits is given, a significant reduction from the 103 bit state of a previous CSA-SC representation. Analysis of this 89-bit representation demonstrates that the basis of a previous guess-and-determine attack is flawed. Correcting this flaw increases the complexity of that attack so that it is worse than exhaustive key search. Although that attack is not feasible, the reduced state size of our representation makes it obvious that CSA-SC is vulnerable to several generic attacks, for which feasible parameters are given.

Anti-metabolic effects of Galanthus nivalis agglutinin and wheat germ agglutinin on nymphal stages of the common brown leafhopper using a novel artificial diet system

The common brown leafhopper, Orosius orientalis (Matsumura) (Homoptera: Cicadellidae), previously described as Orosius argentatus (Evans), is an important vector of several viruses and phytoplasmas worldwide. In Australia, phytoplasmas vectored by O. orientalis cause a range of economically important diseases, including legume little leaf (Hutton & Grylls, 1956), tomato big bud (Osmelak, 1986), lucerne witches broom (Helson, 1951), potato purple top wilt (Harding & Teakle, 1985), and Australian lucerne yellows (Pilkington et al., 2004). Orosius orientalis also transmits Tobacco yellow dwarf virus (TYDV; genus Mastrevirus, family Geminiviridae) to beans, causing bean summer death disease (Ballantyne, 1968), and to tobacco, causing tobacco yellow dwarf disease (Hill, 1937, 1941). TYDV has only been recorded in Australia to date. Both diseases result in significant production and quality losses (Ballantyne, 1968; Thomas, 1979; Moran & Rodoni, 1999). Although direct damage caused by leafhopper feeding has been observed, it is relatively minor compared to the losses resulting from disease (P Tr E bicki, unpubl.).

Synthesis of a heparan sulfate mimetic disaccharide with a conformationally locked residue from a common intermediate

A simple mimetic of a heparan sulfate disaccharide sequence that binds to the growth factors FGF-1 and FGF-2 was synthesized by coupling a 2-azido-2-deoxy-D-glucosyl trichloroacetimidate donor with a 1,6-anhydro-2-azido-2-deoxy--D-glucose acceptor. Both the donor and acceptor were obtained from a common intermediate readily obtained from D-glucal. Molecular docking calculations showed that the predicted locations of the disaccharide sulfo groups in the binding site of FGF-1 and FGF-2 are similar to the positions observed for co-crystallized heparin-derived oligosaccharides obtained from published crystal structures.

Why common factors in international bond returns are not so common

This paper analyzes the common factor structure of US, German, and Japanese Government bond returns. Unlike previous studies, we formally take into account the presence of country-specific factors when estimating common factors. We show that the classical approach of running a principal component analysis on a multi-country dataset of bond returns captures both local and common influences and therefore tends to pick too many factors. We conclude that US bond returns share only one common factor with German and Japanese bond returns. This single common factor is associated most notably with changes in the level of domestic term structures. We show that accounting for country-specific factors improves the performance of domestic and international hedging strategies.

Adventures in pedagogy : the trials and tribulations of teaching common law in China

China is now seen as arguably, the next economic giant of the 21st century. From a country closed in the past to the external world, the Chinese market now presents as one of the most lucrative in the world economy. One area that has drawn increasing international interest is education - it has been estimated that by 2020 there will be 25 million excess demands for higher education places that the Chinese tertiary educational system cannot meet. Many overseas institutions have developed programs to cater for this immense potential market. In 2000 the Law Faculty of the University of Technology, Sydney (UTS)introduced a new postgraduate program specifically targeting the Chinese market. This paper is a brief assessment of the program - it examines general issues in the pedagogical delivery of programs in LOTE (Language Other Than English) and the use of 'proxies' in the delivery of LOTE programs. The paper concludes that while the UTS program demonstrates that it is feasible to use proxy lecturers or interpreters in the delivery of programs in LOTE, the exercise entails significant problems that can undermine the integrity of such programs.