Evolution of networks and sequences in eukaryotic cell cycle control.

The molecular networks regulating the G1-S transition in budding yeast and mammals are strikingly similar in network structure. However, many of the individual proteins performing similar network roles appear to have unrelated amino acid sequences, suggesting either extremely rapid sequence evolution, or true polyphyly of proteins carrying out identical network roles. A yeast/mammal comparison suggests that network topology, and its associated dynamic properties, rather than regulatory proteins themselves may be the most important elements conserved through evolution. However, recent deep phylogenetic studies show that fungal and animal lineages are relatively closely related in the opisthokont branch of eukaryotes. The presence in plants of cell cycle regulators such as Rb, E2F and cyclins A and D, that appear lost in yeast, suggests cell cycle control in the last common ancestor of the eukaryotes was implemented with this set of regulatory proteins. Forward genetics in non-opisthokonts, such as plants or their green algal relatives, will provide direct information on cell cycle control in these organisms, and may elucidate the potentially more complex cell cycle control network of the last common eukaryotic ancestor.

Efficient computation algorithm for calculating load contributions to line flows and losses

In a deregulated power system, it is usually required to determine the shares of each load and generation in line flows, to permit fair allocation of transmission costs between the interested parties. The paper presents a new method of determining the contributions of each load to line flows and losses. The method is based on power-flow topology and has the advantage of being the least computationally demanding of similar methods.

An explanatory model for food-web structure and evolution

Food webs are networks describing who is eating whom in an ecological community. By now it is clear that many aspects of food-web structure are reproducible across diverse habitats, yet little is known about the driving force behind this structure. Evolutionary and population dynamical mechanisms have been considered. We propose a model for the evolutionary dynamics of food-web topology and show that it accurately reproduces observed food-web characteristics in the steady state. It is based on the observation that most consumers are larger than their resource species and the hypothesis that speciation and extinction rates decrease with increasing body mass. Results give strong support to the evolutionary hypothesis. (C) 2005 Elsevier B.V. All rights reserved.

Scaling of Food-Web Properties with Diversity and Complexity Across Ecosystems

Trophic scaling models describe how topological food-web properties such as the number of predator prey links scale with species richness of the community. Early models predicted that either the link density (i.e. the number of links per species) or the connectance (i.e. the linkage probability between any pair of species) is constant across communities. More recent analyses, however, suggest that both these scaling models have to be rejected, and we discuss several hypotheses that aim to explain the scale dependence of these complexity parameters. Based on a recent, highly resolved food-web compilation, we analysed the scaling behaviour of 16 topological parameters and found significant power law scaling relationships with diversity (i.e. species richness) and complexity (i.e. connectance) for most of them. These results illustrate the lack of universal constants in food-web ecology as a function of diversity or complexity. Nonetheless, our power law scaling relationships suggest that fundamental processes determine food-web topology, and subsequent analyses demonstrated that ecosystem-specific differences in these relationships were of minor importance. As such, these newly described scaling relationships provide robust and testable cornerstones for future structural food-web models.

Managing Equivalent Representations of Design and Analysis Models

There is a requirement for better integration between design and analysis tools, which is difficult due to their different objectives, separate data representations and workflows. Currently, substantial effort is required to produce a suitable analysis model from design geometry. Robust links are required between these different representations to enable analysis attributes to be transferred between different design and analysis packages for models at various levels of fidelity.

This paper describes a novel approach for integrating design and analysis models by identifying and managing the relationships between the different representations. Three key technologies, Cellular Modeling, Virtual Topology and Equivalencing, have been employed to achieve effective simulation model management. These technologies and their implementation are discussed in detail. Prototype automated tools are introduced demonstrating how multiple simulation models can be linked and maintained to facilitate seamless integration throughout the design cycle.

Conceptual Design and Workspace Analysis of an Exechon-inspired Parallel Kinematic Machine

Inspired by the commercial application of the Exechon machine, this paper proposed a novel parallel kinematic machine (PKM) named Exe-Variant. By exchanging the sequence of kinematic pairs in each limb of the Exechon machine, the Exe-Variant PKM claims an arrangement of 2UPR/1SPR topology and consists of two identical UPR limbs and one SPR limb. The inverse kinematics of the 2UPR/1SPR parallel mechanism was firstly analyzed based on which a conceptual design of the Exe-Variant was carried out. Then an algorithm of reachable workspace searching for the Exe-Variant and the Exchon was proposed. Finally, the workspaces of two example systems of the Exechon and the Exe-Variant with approximate dimensions were numerically simulated and compared. The comparison shows that the Exe-Variant possesses a competitive workspace with the Exechon machine, indicating it can be used as a promising reconfigurable module in a hybrid 5-DOF machine tool system.

Evolutionary Origin and Maintenance of Sociality in the Small Carpenter Bees

Many arthropods exhibit behaviours precursory to social life, including adult longevity, parental care, nest loyalty and mutual tolerance, yet there are few examples of social behaviour in this phylum. The small carpenter bees, genus Ceratina, provide important insights into the early stages of sociality. I described the biology and social behaviour of five facultatively social species which exhibit all of the preadaptations for successful group living, yet present ecological and behavioural characteristics that seemingly disfavour frequent colony formation. These species are socially polymorphic with both / solitary and social nests collected in sympatry. Social colonies consist of two adult females, one contributing both foraging and reproductive effort and the second which remains at the nest as a passive guard. Cooperative nesting provides no overt reproductive benefits over solitary nesting, although brood survival tends to be greater in social colonies. Three main theories explain cooperation among conspecifics: mutual benefit, kin selection and manipulation. Lifetime reproductive success calculations revealed that mutual benefit does not explain social behaviour in this group as social colonies have lower per capita life time reproductive success than solitary nests. Genetic pedigrees constructed from allozyme data indicate that kin selection might contribute to the maintenance of social nesting -, as social colonies consist of full sisters and thus some indirect fitness benefits are inherently bestowed on subordinate females as a result of remaining to help their dominant sister. These data suggest that the origin of sociality in ceratinines has principal costs and the great ecological success of highly eusociallineages occurred well after social origins. Ecological constraints such as resource limitation, unfavourable weather conditions and parasite pressure have long been considered some of the most important selective pressures for the evolution of sociality. I assessed the fitness consequences of these three ecological factors for reproductive success of solitary and social colonies and found that nest sites were not limiting, and the frequency of social nesting was consistent across brood rearing seasons. Local weather varied between seasons but was not correlated with reproductive success. Severe parasitism resulted in low reproductive success and total nest failure in solitary nests. Social colonies had higher reproductive success and were never extirpated by parasites. I suggest that social nesting represents a form of bet-hedging. The high frequency of solitary nests suggests that this is the optimal strategy when parasite pressure is low. However, social colonies have a selective advantage over solitary nesting females during periods of extreme parasite pressure. Finally, the small carpenter bees are recorded from all continents except Antarctica. I constructed the first molecular phylogeny of ceratinine bees based on four gene regions of selected species covering representatives from all continents and ecological regions. Maximum parsimony and Bayesian Inference tree topology and fossil dating support an African origin followed by an Old World invasion and New World radiation. All known Old World ceratinines form social colonies while New World species are largely solitary; thus geography and phylogenetic inertia are likely predictors of social evolution in this genus. This integrative approach not only describes the behaviour of several previously unknown or little-known Ceratina species, bu~ highlights the fact that this is an important, though previously unrecognized, model for studying evolutionary transitions from solitary to social behaviour.

Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other approaches. Any relationships between regions that we encounter in our daily life situations are normally formulated in natural language. For example, one can outline one's room plan to an expert by indicating which rooms should be connected to each other. Mereotopology as an area of QSR combines mereology, topology and algebraic methods. As mereotopology plays an important role in region based theories of space, our focus is on one of the most widely referenced formalisms for QSR, the region connection calculus (RCC). RCC is a first order theory based on a primitive connectedness relation, which is a binary symmetric relation satisfying some additional properties. By using this relation we can define a set of basic binary relations which have the property of being jointly exhaustive and pairwise disjoint (JEPD), which means that between any two spatial entities exactly one of the basic relations hold. Basic reasoning can now be done by using the composition operation on relations whose results are stored in a composition table. Relation algebras (RAs) have become a main entity for spatial reasoning in the area of QSR. These algebras are based on equational reasoning which can be used to derive further relations between regions in a certain situation. Any of those algebras describe the relation between regions up to a certain degree of detail. In this thesis we will use the method of splitting atoms in a RA in order to reproduce known algebras such as RCC15 and RCC25 systematically and to generate new algebras, and hence a more detailed description of regions, beyond RCC25.

A Study of Closure and Fuzzy Closure Spaces with Reference to H-Closedness and Convexity

Department of Mathematics, Cochin University of Science and Technology.

On infinite graphs and related matrices

This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory has captured wide attraction as a Mathematical model for any system involving a binary relation. The theory is intimately related to many other branches of Mathematics including Matrix Theory Group theory. Probability. Topology and Combinatorics . and has applications in many other disciplines..Any sort of study on infinite graphs naturally involves an attempt to extend the well known results on the much familiar finite graphs. A graph is completely determined by either its adjacencies or its incidences. A matrix can convey this information completely. This makes a proper labelling of the vertices. edges and any other elements considered, an inevitable process. Many types of labelling of finite graphs as Cordial labelling, Egyptian labelling, Arithmetic labeling and Magical labelling are available in the literature. The number of matrices associated with a finite graph are too many For a study ofthis type to be exhaustive. A large number of theorems have been established by various authors for finite matrices. The extension of these results to infinite matrices associated with infinite graphs is neither obvious nor always possible due to convergence problems. In this thesis our attempt is to obtain theorems of a similar nature on infinite graphs and infinite matrices. We consider the three most commonly used matrices or operators, namely, the adjacency matrix

Everything and nothing project

An EPRSC ‘Partnerships for Public Engagement’ scheme 2010. FEC 122,545.56/UoR 10K everything and nothing is a performance and workshop which engages the public creatively with mathematical concepts: the Poincare conjecture, the shape of the universe, topology, and the nature of infinity are explored through an original, thought provoking piece of music theatre. Jorge Luis Borges' short story 'The Library of Babel' and the aviator Amelia Earhart’s attempt to circumnavigate the globe combine to communicate to audience key mathematical concepts of Poincare’s conjecture. The project builds on a 2008 EPSRC early development project (EP/G001650/1) and is led by an interdisciplinary team the19thstep consisting of composer Dorothy Ker, sculptor Kate Allen and mathematician Marcus du Sautoy. everything and nothing has been devised by Dorothy Ker and Kate Allen, is performed by percussionist Chris Brannick, mezzo soprano Lucy Stevens and sound designer Kelcey Swain. The UK tour targets arts-going audiences, from the Green Man Festival to the British Science Festival. Each performance is accompanied with a workshop led by Topologist Katie Steckles. Alongside the performances and workshops is a website, http://www.everythingandnothingproject.com/ The Public engagement evaluation and monitoring for the project are carried out by evaluator Bea Jefferson. The project is significant in its timely relation to contemporary mathematics and arts-science themes delivering an extensive programme of public engagement.

On the variations of the Betti numbers of regular levels of Morse flows

We generalize results in Cruz and de Rezende (1999) [7] by completely describing how the Beth numbers of the boundary of an orientable manifold vary after attaching a handle, when the homology coefficients are in Z, Q, R or Z/pZ with p prime. First we apply this result to the Conley index theory of Lyapunov graphs. Next we consider the Ogasa invariant associated with handle decompositions of manifolds. We make use of the above results in order to obtain upper bounds for the Ogasa invariant of product manifolds. (C) 2011 Elsevier B.V. All rights reserved.

Complex networks analysis of manual and machine translations

Complex networks have been increasingly used in text analysis, including in connection with natural language processing tools, as important text features appear to be captured by the topology and dynamics of the networks. Following previous works that apply complex networks concepts to text quality measurement, summary evaluation, and author characterization, we now focus on machine translation (MT). In this paper we assess the possible representation of texts as complex networks to evaluate cross-linguistic issues inherent in manual and machine translation. We show that different quality translations generated by NIT tools can be distinguished from their manual counterparts by means of metrics such as in-(ID) and out-degrees (OD), clustering coefficient (CC), and shortest paths (SP). For instance, we demonstrate that the average OD in networks of automatic translations consistently exceeds the values obtained for manual ones, and that the CC values of source texts are not preserved for manual translations, but are for good automatic translations. This probably reflects the text rearrangements humans perform during manual translation. We envisage that such findings could lead to better NIT tools and automatic evaluation metrics.

On cohomologies and extensions of cyclic groups

Cohomology groups H(s)(Z(n), Z(m)) are studied to describe all groups up to isomorphism which are (central) extensions of the cyclic group Z(n) by the Z(n)-module Z(m). Further, for each such a group the number of non-equivalent extensions is determined. (C) 2011 Elsevier B.V. All rights reserved.