Some applications of logic to feasibility in higher types

While it is commonly accepted that computability on a Turing machine in polynomial time represents a correct formalization of the notion of a feasibly computable function, there is no similar agreement on how to extend this notion on functionals, that is, what functionals should be considered feasible. One possible paradigm was introduced by Mehlhorn, who extended Cobham's definition of feasible functions to type 2 functionals. Subsequently, this class of functionals (with inessential changes of the definition) was studied by Townsend who calls this class POLY, and by Kapron and Cook who call the same class basic feasible functionals. Kapron and Cook gave an oracle Turing machine model characterisation of this class. In this article, we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalise the corresponding properties of the class of feasible functions, thus giving further evidence that the notion of feasibility of functionals mentioned above is correctly chosen. We also improve the Kapron and Cook result on machine representation.Our proofs are based on essential applications of logic. We introduce a weak fragment of second order arithmetic with second order variables ranging over functions from NN which suitably characterises basic feasible functionals, and show that it is a useful tool for investigating the properties of basic feasible functionals. In particular, we provide an example how one can extract feasible programs from mathematical proofs that use nonfeasible functions.

Mind change complexity of learning logic programs

The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds for learnability of these classes both from positive facts and from positive and negative facts. Building on Angluin’s notion of finite thickness and Wright’s work on finite elasticity, Shinohara defined the property of bounded finite thickness to give a sufficient condition for learnability of indexed families of computable languages from positive data. This paper shows that an effective version of Shinohara’s notion of bounded finite thickness gives sufficient conditions for learnability with ordinal mind change bound, both in the context of learnability from positive data and for learnability from complete (both positive and negative) data. Let Omega be a notation for the first limit ordinal. Then, it is shown that if a language defining framework yields a uniformly decidable family of languages and has effective bounded finite thickness, then for each natural number m >0, the class of languages defined by formal systems of length <= m: • is identifiable in the limit from positive data with a mind change bound of Omega (power)m; • is identifiable in the limit from both positive and negative data with an ordinal mind change bound of Omega × m. The above sufficient conditions are employed to give an ordinal mind change bound for learnability of minimal models of various classes of length-bounded Prolog programs, including Shapiro’s linear programs, Arimura and Shinohara’s depth-bounded linearly covering programs, and Krishna Rao’s depth-bounded linearly moded programs. It is also noted that the bound for learning from positive data is tight for the example classes considered.

Multiple camera management using wide baseline matching

Camera calibration information is required in order for multiple camera networks to deliver more than the sum of many single camera systems. Methods exist for manually calibrating cameras with high accuracy. Manually calibrating networks with many cameras is, however, time consuming, expensive and impractical for networks that undergo frequent change. For this reason, automatic calibration techniques have been vigorously researched in recent years. Fully automatic calibration methods depend on the ability to automatically find point correspondences between overlapping views. In typical camera networks, cameras are placed far apart to maximise coverage. This is referred to as a wide base-line scenario. Finding sufficient correspondences for camera calibration in wide base-line scenarios presents a significant challenge. This thesis focuses on developing more effective and efficient techniques for finding correspondences in uncalibrated, wide baseline, multiple-camera scenarios. The project consists of two major areas of work. The first is the development of more effective and efficient view covariant local feature extractors. The second area involves finding methods to extract scene information using the information contained in a limited set of matched affine features. Several novel affine adaptation techniques for salient features have been developed. A method is presented for efficiently computing the discrete scale space primal sketch of local image features. A scale selection method was implemented that makes use of the primal sketch. The primal sketch-based scale selection method has several advantages over the existing methods. It allows greater freedom in how the scale space is sampled, enables more accurate scale selection, is more effective at combining different functions for spatial position and scale selection, and leads to greater computational efficiency. Existing affine adaptation methods make use of the second moment matrix to estimate the local affine shape of local image features. In this thesis, it is shown that the Hessian matrix can be used in a similar way to estimate local feature shape. The Hessian matrix is effective for estimating the shape of blob-like structures, but is less effective for corner structures. It is simpler to compute than the second moment matrix, leading to a significant reduction in computational cost. A wide baseline dense correspondence extraction system, called WiDense, is presented in this thesis. It allows the extraction of large numbers of additional accurate correspondences, given only a few initial putative correspondences. It consists of the following algorithms: An affine region alignment algorithm that ensures accurate alignment between matched features; A method for extracting more matches in the vicinity of a matched pair of affine features, using the alignment information contained in the match; An algorithm for extracting large numbers of highly accurate point correspondences from an aligned pair of feature regions. Experiments show that the correspondences generated by the WiDense system improves the success rate of computing the epipolar geometry of very widely separated views. This new method is successful in many cases where the features produced by the best wide baseline matching algorithms are insufficient for computing the scene geometry.

Fuzzy logic power system stabilizer in multimachine stability studies

Power system stabilizers (PSS) work well at the particular network configuration and steady state conditions for which they were designed. Once conditions change, their performance degrades. This can be overcome by an intelligent nonlinear PSS based on fuzzy logic. Such a fuzzy logic power system stabilizer (FLPSS) is developed, using speed and power deviation as inputs, and provides an auxiliary signal for the excitation system of a synchronous motor in a multimachine power system environment. The FLPSS's effect on the system damping is then compared with a conventional power system stabilizer's (CPSS) effect on the system. The results demonstrate an improved system performance with the FLPSS and also that the FLPSS is robust

Fuzzy logic traffic control at a road junction with time-varying flow rates

Fuzzy logic has been applied to control traffic at road junctions. A simple controller with one fixed rule-set is inadequate to minimise delays when traffic flow rate is time-varying and likely to span a wide range. To achieve better control, fuzzy rules adapted to the current traffic conditions are used.

Good results for early treatment of clinically isolated syndrome prior to multiple sclerosis with interferon beta-1b and glatiramer

Background: The first sign of developing multiple sclerosis is a clinically isolated syndrome that resembles a multiple sclerosis relapse. Objective/methods: The objective was to review the clinical trials of two medicines in clinically isolated syndromes (interferon β and glatiramer acetate) to determine whether they prevent progression to definite multiple sclerosis. Results: In the BENEFIT trial, after 2 years, 45% of subjects in the placebo group developed clinically definite multiple sclerosis, and the rate was lower in the interferon β-1b group. Then all subjects were offered interferon β-1b, and the original interferon β-1b group became the early treatment group, and the placebo group became the delayed treatment group. After 5 years, the number of subjects with clinical definite multiple sclerosis remained lower in the early treatment than late treatment group. In the PreCISe trial, after 2 years, the time for 25% of the subjects to convert to definite multiple sclerosis was prolonged in the glatiramer group. Conclusions: Interferon β-1b and glatiramer acetate slow the progression of clinically isolated syndromes to definite multiple sclerosis. However, it is not known whether this early treatment slows the progression to the physical disabilities experienced in multiple sclerosis.

Oral fingolimod for relapsing-remitting multiple sclerosis

Background: Most people with multiple sclerosis have the relapsing-remitting type. Objective/methods: The objective was to evaluate two clinical trials of fingolimod in relapsing multiple sclerosis. Results: FREEDOMS (FTY720 Research Evaluation Effects of Daily Oral therapy in Multiple Sclerosis), a Phase III placebo-controlled trial, showed that fingolimod (0.5 or 1.25 mg) reduced the relapse rate and disability in multiple sclerosis, compared to placebo. Fingolimod (0.5 or 1.25 mg) has been compared to interferon β-1a in a Phase III clinical trial (TRANSFORMS; Trial Assessing Injectable Interferon versus FTY720 Oral in Relapsing-Remitting Multiple Sclerosis) and shown to be more efficacious than interferon β-1a in reducing relapse rates. However, fingolimod did increase the risk of infections and skin cancers. Conclusions: Only the lower dose of fingolimod (0.5 mg), which possibly has less toxicity, should be considered for prevention of relapses in relapsing-remitting multiple sclerosis.

BLAST Atlas : a function based multiple genome browser

BLAST Atlas is a visual analysis system for comparative genomics that supports genome-wide gene characterisation, functional assignment and function-based browsing of one or more chromosomes. Inspired by applications such as the WorldWide Telescope, Bing Maps 3D and Google Earth, BLAST Atlas uses novel three-dimensional gene and function views that provide a highly interactive and intuitive way for scientists to navigate, query and compare gene annotations. The system can be used for gene identification and functional assignment or as a function-based multiple genome comparison tool which complements existing position based comparison and alignment viewers.

Hierarchical fuzzy logic traffic control at a road junction

Traffic control at road junctions is one of the major concerns in most metropolitan cities. Controllers of various approaches are available and the required control action is the effective green-time assigned to each traffic stream within a traffic-light cycle. The application of fuzzy logic provides the controller with the capability to handle uncertain natures of the system, such as drivers’ behaviour and random arrivals of vehicles. When turning traffic is allowed at the junction, the number of phases in the traffic-light cycle increases. The additional input variables inevitably complicate the controller and hence slow down the decision-making process, which is critical in this real-time control problem. In this paper, a hierarchical fuzzy logic controller is proposed to tackle this traffic control problem at a 2-way road junction with turning traffic. The two levels of fuzzy logic controllers devise the minimum effective green-time and fine-tune it respectively at each phase of a traffic-light cycle. The complexity of the controller at each level is reduced with smaller rule-set. The performance of this hierarchical controller is examined by comparison with a fixed-time controller under various traffic conditions. Substantial delay reduction has been achieved as a result and the performance and limitation of the controller will be discussed.

Client recommendations for financial incentives on construction projects

Purpose: To provide recommendations for construction clients who design and implement financial incentive mechanisms (FIMs) on projects. ---------- Methodology: Four large Australian building projects commissioned by government clients under managing contractor contracts and completed between 2001 and 2005 were examined to explore the ‘drivers’ that promoted motivation toward financial incentive goals. The results were triangulated across data sources, projects and stakeholder types. ---------- Findings: FIM design should incorporate: 1. flexibility to modify goals and measurement procedures over time, 2. multiple goals covering different project areas, 3. distribution of rewards across all the key organizations contributing to team performance (e.g. potentially not just the contractor, but the subcontractors and consultants) and a reward amount sufficient to be valued by potential recipients. FIM benefits are maximized through the following complementary procurement initiatives: 4. equitable contract risk allocation, 5. early contractor involvement in design, 6. value-driven tender selection, 7. relationship workshops, and 8. future work opportunities.---------- Research Limitations: This paper provides practical recommendations to industry and hence does not emphasize theoretical aspects.---------- Practical Implications: The uptake of these recommendations is likely to increase the impact of FIMs on motivation and improve project and industry outcomes. Although the study focuses on government clients of building projects, all the recommendations would seem to apply equally to private-sector clients and to non-building projects.---------- Originality: In order to improve motivation and reward high performance, clients are increasingly using FIM in their construction contracts. Despite the rising use of financial incentives, there is a lack of comprehensive construction-specific knowledge available to help clients maximize outcomes. The study addresses this gap in the literature.