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.

Flow injection amperometric determination of procaine in pharmaceutical formulation using a screen-printed carbon electrode

A rapid and simple method for procaine determination was developed by flow injection analysis (FIA) using a screen-printed carbon electrode (SPCE) as amperometric detector. The present method is based on the amine/hydroxylamine oxidation from procaine monitored at 0.80 V on SPCE in sodium acetate solution pH 6.0. Using the best experimental conditions assigned as: pH 6.0, flow rate of 3.8 mL min(-1), sample volume of 100 mu L and analytical path of 30 cm it is possible to construct a linear calibration curve from 9.0 x 10(-6) to 1.0 x 10(-4) mol L-1. The relative standard deviation for 5.0 x 10(-5) mol L-1 procaine (15 repetitions using the same electrode) is 3.2% and detection limit calculated is 6.0 x 10(-6) mol L-1. Recoveries obtained for procaine gave a mean values from 94.8 to 102.3% and an analytical frequency of 36 injections per hour was achieved. The method was successfully applied for the determination of procaine in pharmaceutical formulation without any pre-treatment, which are in good accordance with the declared values of manufacturer and an official method based on spectrophotometric analysis. (c) 2006 Elsevier B.V. All rights reserved.

An implicit BEM formulation to model strong discontinuities in solids

A boundary element method (BEM) formulation to predict the behavior of solids exhibiting displacement (strong) discontinuity is presented. In this formulation, the effects of the displacement jump of a discontinuity interface embedded in an internal cell are reproduced by an equivalent strain field over the cell. To compute the stresses, this equivalent strain field is assumed as the inelastic part of the total strain. As a consequence, the non-linear BEM integral equations that result from the proposed approach are similar to those of the implicit BEM based on initial strains. Since discontinuity interfaces can be introduced inside the cell independently on the cell boundaries, the proposed BEM formulation, combined with a tracking scheme to trace the discontinuity path during the analysis, allows for arbitrary discontinuity propagation using a fixed mesh. A simple technique to track the crack path is outlined. This technique is based on the construction of a polygonal line formed by segments inside the cells, in which the assumed failure criterion is reached. Two experimental concrete fracture tests were analyzed to assess the performance of the proposed formulation.

A path- and label-cost propagation approach to speedup the training of the optimum-path forest classifier

In general, pattern recognition techniques require a high computational burden for learning the discriminating functions that are responsible to separate samples from distinct classes. As such, there are several studies that make effort to employ machine learning algorithms in the context of big data classification problems. The research on this area ranges from Graphics Processing Units-based implementations to mathematical optimizations, being the main drawback of the former approaches to be dependent on the graphic video card. Here, we propose an architecture-independent optimization approach for the optimum-path forest (OPF) classifier, that is designed using a theoretical formulation that relates the minimum spanning tree with the minimum spanning forest generated by the OPF over the training dataset. The experiments have shown that the approach proposed can be faster than the traditional one in five public datasets, being also as accurate as the original OPF. (C) 2014 Elsevier B. V. All rights reserved.

A local-global scheme for tracking crack path in three-dimensional solids

This paper aims to contribute to the three-dimensional generalization of numerical prediction of crack propagation through the formulation of finite elements with embedded discontinuities. The analysis of crack propagation in two-dimensional problems yields lines of discontinuity that can be tracked in a relatively simple way through the sequential construction of straight line segments oriented according to the direction of failure within each finite element in the solid. In three-dimensional analysis, the construction of the discontinuity path is more complex because it requires the creation of plane surfaces within each element, which must be continuous between the elements. In the method proposed by Chaves (2003) the crack is determined by solving a problem analogous to the heat conduction problem, established from local failure orientations, based on the stress state of the mechanical problem. To minimize the computational effort, in this paper a new strategy is proposed whereby the analysis for tracking the discontinuity path is restricted to the domain formed by some elements near the crack surface that develops along the loading process. The proposed methodology is validated by performing three-dimensional analyses of basic problems of experimental fractures and comparing their results with those reported in the literature.

Supersymmetric quantum mechanics on the lattice: I. Loop formulation

Simulations of supersymmetric field theories on the lattice with (spontaneously) broken supersymmetry suffer from a fermion sign problem related to the vanishing of the Witten index. We propose a novel approach which solves this problem in low dimensions by formulating the path integral on the lattice in terms of fermion loops. For N=2 supersymmetric quantum mechanics the loop formulation becomes particularly simple and in this paper – the first in a series of three – we discuss in detail the reformulation of this model in terms of fermionic and bosonic bonds for various lattice discretisations including one which is Q-exact.

Race and equity in higher education : A harder path for Indigenous academics

Our experiences as Indigenous academics within universities often reflects the experiences we have as Indigenous people in broader society, yet I am still surprised and angered when it is others working in higher education who espouse notions of justice and equity with whom we experience tension and conflict in asserting our rights, values and cultural values. At times it is a constant struggle even when universities have Reconciliation Statements as most of them do now, Indigenous recruitment or employment strategies and university wide anti-racism and anti-discrimination policies and procedures.

Simultaneous kinetic spectrophotometric determination of norfloxacin and rifampicin in pharmaceutical formulation and human urine samples by use of chemometrics approaches

A kinetic spectrophotometric method with aid of chemometrics is proposed for the simultaneous determination of norfloxacin and rifampicin in mixtures. The proposed method was applied for the simultaneous determination of these two compounds in pharmaceutical formulation and human urine samples, and the results obtained are similar to those obtained by high performance liquid chromatography.

Robot path planning in dynamic environments using a simulated annealing based approach

Mobile robots are widely used in many industrial fields. Research on path planning for mobile robots is one of the most important aspects in mobile robots research. Path planning for a mobile robot is to find a collision-free route, through the robot’s environment with obstacles, from a specified start location to a desired goal destination while satisfying certain optimization criteria. Most of the existing path planning methods, such as the visibility graph, the cell decomposition, and the potential field are designed with the focus on static environments, in which there are only stationary obstacles. However, in practical systems such as Marine Science Research, Robots in Mining Industry, and RoboCup games, robots usually face dynamic environments, in which both moving and stationary obstacles exist. Because of the complexity of the dynamic environments, research on path planning in the environments with dynamic obstacles is limited. Limited numbers of papers have been published in this area in comparison with hundreds of reports on path planning in stationary environments in the open literature. Recently, a genetic algorithm based approach has been introduced to plan the optimal path for a mobile robot in a dynamic environment with moving obstacles. However, with the increase of the number of the obstacles in the environment, and the changes of the moving speed and direction of the robot and obstacles, the size of the problem to be solved increases sharply. Consequently, the performance of the genetic algorithm based approach deteriorates significantly. This motivates the research of this work. This research develops and implements a simulated annealing algorithm based approach to find the optimal path for a mobile robot in a dynamic environment with moving obstacles. The simulated annealing algorithm is an optimization algorithm similar to the genetic algorithm in principle. However, our investigation and simulations have indicated that the simulated annealing algorithm based approach is simpler and easier to implement. Its performance is also shown to be superior to that of the genetic algorithm based approach in both online and offline processing times as well as in obtaining the optimal solution for path planning of the robot in the dynamic environment. The first step of many path planning methods is to search an initial feasible path for the robot. A commonly used method for searching the initial path is to randomly pick up some vertices of the obstacles in the search space. This is time consuming in both static and dynamic path planning, and has an important impact on the efficiency of the dynamic path planning. This research proposes a heuristic method to search the feasible initial path efficiently. Then, the heuristic method is incorporated into the proposed simulated annealing algorithm based approach for dynamic robot path planning. Simulation experiments have shown that with the incorporation of the heuristic method, the developed simulated annealing algorithm based approach requires much shorter processing time to get the optimal solutions in the dynamic path planning problem. Furthermore, the quality of the solution, as characterized by the length of the planned path, is also improved with the incorporated heuristic method in the simulated annealing based approach for both online and offline path planning.