a constraint solver and its application to path feasibility analysis

Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

Upgrading arc median shortest path problem for an urban transportation network

In this paper, we propose an algorithm for an upgrading arc median shortest path problem for a transportation network. The problem is to identify a set of nondominated paths that minimizes both upgrading cost and overall travel time of the entire network. These two objectives are realistic for transportation network problems, but of a conflicting and noncompensatory nature. In addition, unlike upgrading cost which is the sum of the arc costs on the path, overall travel time of the entire network cannot be expressed as a sum of arc travel times on the path. The proposed solution approach to the problem is based on heuristic labeling and exhaustive search techniques, in criteria space and solution space, respectively. The first approach labels each node in terms of upgrading cost, and deletes cyclic and infeasible paths in criteria space. The latter calculates the overall travel time of the entire network for each feasible path, deletes dominated paths on the basis of the objective vector and identifies a set of Pareto optimal paths in the solution space. The computational study, using two small-scale transportation networks, has demonstrated that the algorithm proposed herein is able to efficiently identify a set of nondominated median shortest paths, based on two conflicting and noncompensatory objectives.

An algorithm to median shortest path problem (MSPP) in the design of urban transportation networks

This paper proposes an efficient solution algorithm for realistic multi-objective median shortest path problems in the design of urban transportation networks. The proposed problem formulation and solution algorithm to median shortest path problem is based on three realistic objectives via route cost or investment cost, overall travel time of the entire network and total toll revenue. The proposed solution approach to the problem is based on the heuristic labeling and exhaustive search technique in criteria space and solution space of the algorithm respectively. The first labels each node in terms of route cost and deletes cyclic and infeasible paths in criteria space imposing cyclic break and route cost constraint respectively. The latter deletes dominated paths in terms of objectives vector in solution space in order to identify a set of Pareto optimal paths. The approach, thus, proposes a non-inferior solution set of Pareto optimal paths based on non-dominated objective vector and leaves the ultimate decision to decision-makers for purpose specific final decision during applications. A numerical experiment is conducted to test the proposed algorithm using artificial transportation network. Sensitivity analyses have shown that the proposed algorithm is advantageous and efficient over existing algorithms to find a set of Pareto optimal paths to median shortest paths problems.

Path Sensitive Cache Analysis Using Cache Miss Paths

Cache analysis plays a very important role in obtaining precise Worst Case Execution Time (WCET) estimates of programs for real-time systems. While Abstract Interpretation based approaches are almost universally used for cache analysis, they fail to take advantage of its unique requirement: it is not necessary to find the guaranteed cache behavior that holds across all executions of a program. We only need the cache behavior along one particular program path, which is the path with the maximum execution time. In this work, we introduce the concept of cache miss paths, which allows us to use the worst-case path information to improve the precision of AI-based cache analysis. We use Abstract Interpretation to determine the cache miss paths, and then integrate them in the IPET formulation. An added advantage is that this further allows us to use infeasible path information for cache analysis. Experimentally, our approach gives more precise WCETs as compared to AI-based cache analysis, and we also provide techniques to trade-off analysis time with precision to provide scalability.

Programs as paths: An approach to timing constraint analysis

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.

Planning most-likely paths from overhead imagery

This paper is about planning paths from overhead imagery, the novelty of which is taking explicit account of uncertainty in terrain classification and spatial variation in terrain cost. The image is first classified using a multi-class Gaussian Process Classifier which provides probabilities of class membership at each location in the image. The probability of class membership at a particular grid location is then combined with a terrain cost evaluated at that location using a spatial Gaussian process. The resulting cost function is, in turn, passed to a planner. This allows both the uncertainty in terrain classification and spatial variations in terrain costs to be incorporated into the planned path. Because the cost of traversing a grid cell is now a probability density rather than a single scalar value, we can produce not only the most-likely shortest path between points on the map, but also sample from the cost map to produce a distribution of paths between the points. Results are shown in the form of planned paths over aerial maps, these paths are shown to vary in response to local variations in terrain cost.

As trajetorias de carreiras tradicionais estao dando passegem as proteanas? Um estudo com gereentes no setor public Australiano com foco em diferencas quanto ao genero ( Have traditional career paths given way to protean ones?: Evidence from senior managers in the Australian public sector)

Purpose – This mixed-method study aims to determine the extent to which the career paths of senior managers conform with the traditional versus protean elements described in the careers literature and whether these paths vary by gender. Design/methodology/approach – A total of 15 senior managers (seven women and eight men) in a large public sector agency in Australia were interviewed about their career trajectories to date. Data were coded according to four major areas which characterise and distinguish between traditional and protean careers: development, orientation of the employee, definition of success, and organisational environment. A total of 81 managers (34 women and 47 men) from the same organisation were also surveyed. Variables of interest were those that could be triangulated with qualitative data such as the availability of career opportunities. Findings – Results suggest that, contrary to much existing literature which proposes that all careers have been fundamentally altered, the traditional career which relies on length of service, geographic mobility and a steady climb up the corporate ladder, is still the dominant model in some organisations. However, the trend towards protean careers is evident and is more pronounced for women than for men. Research limitations/implications – The specific nature of the organisation (large, male-dominated, public sector) may limit the generalisability of results. Practical implications – The framework used to explore career paths according to traditional/ protean elements in this study may assist human resource practitioners to develop appropriate strategies which maximise the professional development of employees. Originality/value – The results of this research challenge the universality of change in the nature of careers, particularly in public sector environments.

Career paths in the third sector : implications for human resource management

My interest in career paths in the third sector came from three early observations. First, the majority of workers appear to be women, in fact 77% of community sector community services in NSW (O'Donnell, 1985). Second, when asked about their career, most workers express the opinion that they have none. Third, when I examined the individual career paths of community sector workers I was struck by the stop and start nature of their paid work. Even, or perhaps especially, well qualified workers would move out of a position after about two years often to a more difficult position in a new area, with little or no salary increase and little prospect of future promotion. Indeed, there appears to be little career path available. These observations raise a number of important questions, some of which will be explored in this paper. What is the structure of the third sector labour market? What is the staff structure of third sector organisations? Is it true that career paths are unavailable, either within organisations or within the sector? If none exists, why do workers stay in the field? What motivates them? If there is a high turnover of staff, is this the reason? What are the implications of all this? If some sort of career path does exist, why do workers deny having a career? What do we mean by `career' anyway?

Many paths lead to discovery : analogical retrieval of cancer therapies

This paper addresses the issue of analogical inference, and its potential role as the mediator of new therapeutic discoveries, by using disjunction operators based on quantum connectives to combine many potential reasoning pathways into a single search expression. In it, we extend our previous work in which we developed an approach to analogical retrieval using the Predication-based Semantic Indexing (PSI) model, which encodes both concepts and the relationships between them in high-dimensional vector space. As in our previous work, we leverage the ability of PSI to infer predicate pathways connecting two example concepts, in this case comprising of known therapeutic relationships. For example, given that drug x TREATS disease z, we might infer the predicate pathway drug x INTERACTS WITH gene y ASSOCIATED WITH disease z, and use this pathway to search for drugs related to another disease in similar ways. As biological systems tend to be characterized by networks of relationships, we evaluate the ability of quantum-inspired operators to mediate inference and retrieval across multiple relations, by testing the ability of different approaches to recover known therapeutic relationships. In addition, we introduce a novel complex vector based implementation of PSI, based on Plate’s Circular Holographic Reduced Representations, which we utilize for all experiments in addition to the binary vector based approach we have applied in our previous research.

From outpost to outback : project career paths in Australia

With the growth in project management as a form of work organisation in many sectors of the economy has come the significant rise in the number of project managers and project team members. This change in work organisation brings issues in forging career paths and determining career support in work situations that are often dynamic, short lived and intense. In the relatively small but substantially robust Australian economy, a unique labour market and the tyranny of distance bring their own difficulties. Innovative and collaborative project structures and increasing prevalence of contract work provide both challenges and opportunities for new career pathways in many industries. A growing percentage of Australia's workforce is employed in project-based or project-oriented organisations, leading to the claim that Australia is a project-based economy. This provided a context for our research into the career paths and the issues of career management for project managers working in a project based economy. Using in-depth interviews with project managers from three industry areas we found generational and gender differences in experiences of work, workplace support and mentoring for career development. For a continued strong performance in this economy,organisations that employ project personnel will need to consider how they will ensure the supply of high quality project professionals into the future.

Comments on the phase diagrams and crystallisation paths of Y-Ba-Cu-O materials

Our micro structural characterisation of Y-Ba-Cu-O quenched partial melts shows that the BaCuO2 (BC1) phase is crystalline at temperatures as high as 1100°C, and that the partial melt self-establishes a micro structural gradient from the surface towards the interior of the samples, which can be associated with a gradient in an equivalent partial pressure of O2 (pO2). The extension of the Y2BaCuO5-YBa2Cu3O7-x (Y211-Y123) tie-line intersects the primary crystallisation field of BC1 first. The actual peritectic reaction that takes place is Y2BaCuO5(s) + BaCuO2(s) + 2BaCu2O2(L) + 1/2O2 → 2YBa2Cu3O6(s). Two schematic representations which allow an analysis of the pO2 dependence are given. The gradient in micro structure self-established by the sample acts as a driving force for texturing. With this new perspective gained about the actual peritectic reaction and mechanisms of melt-texturing of Y123, it is possible to explain most of the aspects about partial melt-texturing. In addition, it seems possible to devise heat treatments that may allow for the production of well-oriented single domains with very large diameters. © 1999 Elsevier Science B.V.

New reaction paths for metal diborides at low temperature and pressure

Attention has recently focussed on MgB2 superconductors (Tc~39K) which can be formed into wires with high material density and viable critical current densities (Jc)1. However, broader utilisation of this diboride and many others is likely to occur when facile synthesis for bulk applications is developed. To date, common synthesis methods include high temperature sintering of mixed elemental powders2, combustion synthesis3, mechano-chemical mixing with high temperature sintering4 and high pressure (~GPa region) with high temperature. In this work, we report on a lower temperature, moderate (<4MPa) pressure method to synthesise metal diborides.

Pedestrian-cyclist interactions at bus stops along segregated bike paths : a case study of Montreal

Safety is one of the major world health issues, and is even more acute for “vulnerable” road users, pedestrians and cyclists. At the same time, public authorities are promoting the active modes of transportation that involve these very users for their health benefits. It is therefore important to understand the factors and designs that provide the best safety for vulnerable road users and encourage more people to use these modes. Qualitative and quantitative shortcomings of collisions make it necessary to use surrogate measures of safety in studying these modes. Some interactions without a collision such as conflicts can be good surrogates of collisions as they are more frequent and less costly. To overcome subjectivity and reliability challenges, automatic conflict analysis using video cameras and deriving users’ trajectories is a solution to overcome shortcomings of manual conflict analysis. The goal of this paper is to identify and characterize various interactions between cyclists and pedestrians at bus stops along bike paths using a fully automated process. Three conflict severity indicators are calculated and adapted to the situation of interest to capture those interactions. A microscopic analysis of users’ behavior is proposed to explain interactions more precisely. Eventually, the study aims to show the capability of automatically collecting and analyzing data for pedestrian-cyclist interactions at bus stops along segregated bike paths in order to better understand the actual and perceived risks of these facilities.

An observation about circular shortest paths: Dealing with additional constraints using branch and bound

Circular shortest paths represent a powerful methodology for image segmentation. The circularity condition ensures that the contour found by the algorithm is closed, a natural requirement for regular objects. Several implementations have been proposed in the past that either promise closure with high probability or ensure closure strictly, but with a mild computational efficiency handicap. Circularity can be viewed as a priori information that helps recover the correct object contour. Our "observation" is that circularity is only one among many possible constraints that can be imposed on shortest paths to guide them to a desirable solution. In this contribution, we illustrate this opportunity under a volume constraint but the concept is generally applicable. We also describe several adornments to the circular shortest path algorithm that proved useful in applications. © 2011 IEEE.

Method for planning and executing obstacle-free paths for rotating excavation machinery

This invention concerns the control of rotating excavation machinery, for instance to avoid collisions with obstacles. In a first aspect the invention is a control system for autonomous path planning in excavation machinery, comprising: A map generation subsystem to receive data from an array of disparate and complementary sensors to generate a 3-Dimensional digital terrain and obstacle map referenced to a coordinate frame related to the machine's geometry, during normal operation of the machine. An obstacle detection subsystem to find and identify obstacles in the digital terrain and obstacle map, and then to refine the map by identifying exclusion zones that are within reach of the machine during operation. A collision detection subsystem that uses knowledge of the machine's position and movements, as well as the digital terrain and obstacle map, to identify and predict possible collisions with itself or other obstacles, and then uses a forward motion planner to predict collisions in a planned path. And, a path planning subsystem that uses information from the other subsystems to vary planned paths to avoid obstacles and collisions. In other aspects the invention is excavation machinery including the control system; a method for control of excavation machinery; and firmware and software versions of the control system.