Completeness Results for Parameterized Space Classes

The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy. Several natural parameterized problems have, however, resisted such a classification. At least in some cases, the reason is that upper and lower bounds for their parameterized space complexity have recently been obtained that rule out completeness results for parameterized time classes. In this paper, we make progress in this direction by proving that the associative generability problem and the longest common subsequence problem are complete for parameterized space classes. These classes are defined in terms of different forms of bounded nondeterminism and in terms of simultaneous time--space bounds. As a technical tool we introduce a "union operation" that translates between problems complete for classical complexity classes and for W-classes.Comment: IPEC 201

Specializing Interpreters using Offline Partial Deduction

We present the latest version of the Logen partial evaluation system for logic programs. In particular we present new binding-types, and show how they can be used to effectively specialise a wide variety of interpreters.We show how to achieve Jones-optimality in a systematic way for several interpreters. Finally, we present and specialise a non-trivial interpreter for a small functional programming language. Experimental results are also presented, highlighting that the Logen system can be a good basis for generating compilers for high-level languages

Verification of Java Bytecode using Analysis and Transformation of Logic Programs

State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verification of Java bytecode (JVML). In order to achieve our goal, we rely on well-known techniques for meta-programming and program specialization. More precisely, we propose to partially evaluate a JVML interpreter implemented in LP together with (an LP representation of) a JVML program and then analyze the residual program. Interestingly, at least for the examples we have studied, our approach produces very simple LP representations of the original JVML programs. This can be seen as a decompilation from JVML to high-level LP source. By reasoning about such residual programs, we can automatically prove in the CiaoPP system some non-trivial properties of JVML programs such as termination, run-time error freeness and infer bounds on its resource consumption. We are not aware of any other system which is able to verify such advanced properties of Java bytecode

Weak Singular Hybrid Automata

The framework of Hybrid automata, introduced by Alur, Courcourbetis, Henzinger, and Ho, provides a formal modeling and analysis environment to analyze the interaction between the discrete and the continuous parts of cyber-physical systems. Hybrid automata can be considered as generalizations of finite state automata augmented with a finite set of real-valued variables whose dynamics in each state is governed by a system of ordinary differential equations. Moreover, the discrete transitions of hybrid automata are guarded by constraints over the values of these real-valued variables, and enable discontinuous jumps in the evolution of these variables. Singular hybrid automata are a subclass of hybrid automata where dynamics is specified by state-dependent constant vectors. Henzinger, Kopke, Puri, and Varaiya showed that for even very restricted subclasses of singular hybrid automata, the fundamental verification questions, like reachability and schedulability, are undecidable. In this paper we present \emph{weak singular hybrid automata} (WSHA), a previously unexplored subclass of singular hybrid automata, and show the decidability (and the exact complexity) of various verification questions for this class including reachability (NP-Complete) and LTL model-checking (PSPACE-Complete). We further show that extending WSHA with a single unrestricted clock or extending WSHA with unrestricted variable updates lead to undecidability of reachability problem

Detecting anomalous energy consumption in android applications

The use of powerful mobile devices, like smartphones, tablets and laptops, are changing the way programmers develop software. While in the past the primary goal to optimize software was the run time optimization, nowadays there is a growing awareness of the need to reduce energy consumption. This paper presents a technique and a tool to detect anomalous energy consumption in Android applications, and to relate it directly with the source code of the application. We propose a dynamically calibrated model for energy consumption for the Android ecosystem, and that supports different devices. The model is then used as an API to monitor the application execution: first, we instrument the application source code so that we can relate energy consumption to the application source code; second, we use a statistical approach, based on fault-localization techniques, to localize abnormal energy consumption in the source code

Effect of the Output of the System in Signal Detection

We analyze the consequences that the choice of the output of the system has in the efficiency of signal detection. It is shown that the signal and the signal-to-noise ratio (SNR), used to characterize the phenomenon of stochastic resonance, strongly depend on the form of the output. In particular, the SNR may be enhanced for an adequate output.Comment: 4 pages, RevTex, 6 PostScript figure

Directed assembly of defined oligomeric photosynthetic reaction centres through adaptation with programmable extra-membrane coiled-coil interfaces

A challenge associated with the utilisation of bioenergetic proteins in new, synthetic energy transducing systems is achieving efficient and predictable self-assembly of individual components, both natural and man-made, into a functioning macromolecular system. Despite progress with water-soluble proteins, the challenge of programming self-assembly of integral membrane proteins into non-native macromolecular architectures remains largely unexplored. In this work it is shown that the assembly of dimers, trimers or tetramers of the naturally monomeric purple bacterial reaction centre can be directed by augmentation with an α-helical peptide that self-associates into extra-membrane coiled-coil bundle. Despite this induced oligomerisation the assembled reaction centres displayed normal spectroscopic properties, implying preserved structural and functional integrity. Mixing of two reaction centres modified with mutually complementary α-helical peptides enabled the assembly of heterodimers in vitro, pointing to a generic strategy for assembling hetero-oligomeric complexes from diverse modified or synthetic components. Addition of two coiled-coil peptides per reaction centre monomer was also tolerated despite the challenge presented to the pigment-protein assembly machinery of introducing multiple self-associating sequences. These findings point to a generalised approach where oligomers or longer range assemblies of multiple light harvesting and/or redox proteins can be constructed in a manner that can be genetically-encoded, enabling the construction of new, designed bioenergetic systems in vivo or in vitro

Higher-Order Termination: from Kruskal to Computability

Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination). In computer science, termination has always been an important issue for showing programs correct. In the early days of logic, strong normalization was usually shown by assigning ordinals to expressions in such a way that eliminating a cut would yield an expression with a smaller ordinal. In the early days of verification, computer scientists used similar ideas, interpreting the arguments of a program call by a natural number, such as their size. Showing the size of the arguments to decrease for each recursive call gives a termination proof of the program, which is however rather weak since it can only yield quite small ordinals. In the sixties, Tait invented a new method for showing cut elimination of natural deduction, based on a predicate over the set of terms, such that the membership of an expression to the predicate implied the strong normalization property for that expression. The predicate being defined by induction on types, or even as a fixpoint, this method could yield much larger ordinals. Later generalized by Girard under the name of reducibility or computability candidates, it showed very effective in proving the strong normalization property of typed lambda-calculi..

Single nucleotide polymorphisms in the bovine leptin gene and their association with carcass and efficiency traits, and endocrine profiles, in female Angus cows

One hundred and fifty female Angus cattle were genotyped for the bovine leptin gene SNPs UASMS1, UASMS2, E2FB and E2JW. Net Feed Intake (NFI) Estimated Breeding Values (EBVs) and E2JW SNP data was also acquired from 169 Angus cattle that originated from Trangie Research Station, NSW, and were selected for a divergence in feed efficiency. The E2JW SNP was associated with NFI, NFI EBV and P8 fatness. The UASMS1 and UASMS2 SNPs were associated with circulating leptin concentrations. These particular associations have not been reported previously but similar associations have reported in North American studies. The inconsistent associations suggest that these SNPs are not good candidates for marker-assisted selection for NFI. Also, the investigation of associations with endocrine profiles that reflect body composition such as leptin, requires genotyping of a larger number of Australian cattle than was possible in this experiment

Interpreting complex fluvial channel and barform architecture: Carboniferous Central Pennine Province, northern England

The Bashkirian Lower Brimham Grit of North Yorkshire, England, is a fluvio-deltaic sandstone succession that crops out as a complex series of pinnacles, the three-dimensional arrangement of which allows high-resolution architectural analysis of genetically-related lithofacies assemblages. Combined analysis of sedimentary graphic log profiles, architectural panels and palaeocurrent data have enabled three-dimensional geometrical relationships to be established for a suite of architectural elements so as to develop a comprehensive depositional model. Small-scale observations of facies have been related to larger-scale architectural elements to facilitate interpretation of the palaeoenvironment of deposition to a level of detail that has rarely been attempted previously, thereby allowing interpretation of formative processes. Detailed architectural panels form the basis of a semi-quantitative technique for recording the variety and complexity of the sedimentary lithofacies present, their association within recognizable architectural elements and, thus, the inferred spatio-temporal relationship of neighbouring elements. Fluvial channel-fill elements bounded by erosional surfaces are characterized internally by a hierarchy of sets and cosets with subtly varying compositions, textures and structures. Simple, cross-bedded sets represent in-channel migration of isolated mesoforms (dunes); cosets of both trough and planar-tabular cross-bedded facies represent lateral-accreting and downstream-accreting macroforms (bars) characterized by highly variable, yet predictable, patterns of palaeocurrent indicators. Relationships between sandstone-dominated strata bounded by third-order and fifth-order surfaces, which represent in-channel bar deposits and incised channel bases respectively, chronicle the origin of the preserved succession in response to autocyclic barform development and abandonment, major episodes of incision probably influenced by episodic tectonic subsidence, differential tilting and fluvial incision associated with slip on the nearby North Craven Fault system. Overall, the succession represents the preserved product of an upper-delta plain system that was traversed by a migratory fluvial braid-belt system comprising a poorly-confined network of fluvial channels developed between major sandy barforms that evolved via combined lateral-accretion and downstream-accretion