Nonsmooth identification of mechanical systems with backlash-like hysteresis

Backlash-like hysteresis is one of the nonsmooth and multi-valued nonlinearities usually existing in mechanical systems. The traditional identification method is quite difficult to be used to model the systems involved with such complex nonlinearities. In this paper, a nonsmooth recursive identification algorithm for the systems with backlash-like hysteresis is proposed. In this method, the concept of Clarke subgradient is introduced to approximate the gradients at nonsmooth points and the so-called bundle method is used to obtain the optimization search direction in nonsmooth cases. Then, a recursive algorithm based on the idea of bundle method is developed for parameter estimation. After that, the convergence analysis of the algorithm is investigated. Finally, simulation results to validate the proposed method on a simulated mechanical transmission system are presented.     

Linear Programming Formulation for Strategic Dynamic Traffic Assignment

This work introduces a novel formulation of system optimal dynamic traffic assignment that captures strategic route choice in users under demand uncertainty. We define strategic route choice to be that users choose a path prior to knowing the true travel demand which will be experienced (therefore users consider the full set of possible demand scenarios). The problem is formulated based on previous work by Ziliaskopoulos (Transp Sci 34(1):37–49, 2000). The resulting novel formulation requires substantial enhancement to account for path-based flows and scenario-based stochastic demands. Further, a numerical demonstration is presented on a network with different demand loading profiles. Finally, model complexity, implications on scalability and future research directions are discussed.     

Maximum-likelihood registration of range images with missing data

Missing data are common in range images, due to geometric occlusions, limitations in the sensor field of view, poor reflectivity, depth discontinuities, and cast shadows. Using registration to align these data often fails, because points without valid correspondences can be incorrectly matched. This paper presents a maximum likelihood method for registration of scenes with unmatched or missing data. Using ray casting, correspondences are formed between valid and missing points in each view. These correspondences are used to classify points by their visibility properties, including occlusions, field of view, and shadow regions. The likelihood of each point match is then determined using statistical properties of the sensor, such as noise and outlier distributions. Experiments demonstrate a high rates of convergence on complex scenes with varying degrees of overlap.     

A Local Semi-Implicit Level-Set Method for Interface Motion

This paper proposes and implements a novel hybrid level set method which combines the numerical efficiency of the local level set approach with the temporal stability afforded by a semi-implicit technique. By introducing an extraction/insertion algorithm into the local level set approach, we can accurately capture complicated behaviors such as interface separation and coalescence. This technique solves a well known problem when treating a semi-implicit system with spectral methods, where spurious interface movements emerge when two interfaces are close to each other. Numerical experiments show that the proposed method is stable, efficient and scales up well into three dimensional problems.     

Energy-Harvesting Microresonator Based on the Forces Generated by the Karman Street Around a Rectangular Prism

This paper explores the feasibility of using the unsteady forces generated by the Karman street around a microprism in the laminar flow regime as a means to generate mechanical work. In particular, the study has the objective of assessing whether this physical effect could be used for practical energy-harvesting purposes. The confined flow, either of a liquid or a gas, around a rectangular microprism, of which different aspect ratios have been studied, is considered at Reynolds 200 so as to make sure that the Karman street is developed and that the flow remains 2-D. The microprism is allowed to move freely in the direction perpendicular to the flow. The equation of motion of the prism includes a term that simulates its coupling with a vibration-driven micropower generator. Two different couplings have been considered: a velocity-damped resonant generator and a Coulomb-damped resonant generator. Different configurations have been studied, and comparisons have been carried out between them so as to draw a first set of design guidelines. Finally, it is shown that this type of energy-harvesting microdevice, which is basically 2-D, would yield a reasonable compromise between power output, manufacturing simplicity, and cost.     

Victorian values: Politicians and the public incorrectly see security and privacy as opposites

It is impossible to make any progress on the security vs. privacy debate, or move towards a political settlement around identity for the coming years, unless we develop a more modern notion of what identity is and how it should be addressed online. So long as we maintain an essentially “Victorian” view of the balance between security and privacy, founded on the central concept of identity as a card in a filing cabinet, then society cannot properly take advantage of technological developments. If it does, then security and privacy are no longer competing concerns that need to be balanced but simultaneous deliverables of an infrastructure founded in utility.     

Children and careers in IT

David Evans, BCS government relations, looks at what it couldtake to convince kids that the hard stuff is worth doing.     

Sequential Monte Carlo in reachability heuristics for probabilistic planning

Some of the current best conformant probabilistic planners focus on finding a fixed length plan with maximal probability. While these approaches can find optimal solutions, they often do not scale for large problems or plan lengths. As has been shown in classical planning, heuristic search outperforms bounded length search (especially when an appropriate plan length is not given a priori). The problem with applying heuristic search in probabilistic planning is that effective heuristics are as yet lacking.In this work, we apply heuristic search to conformant probabilistic planning by adapting planning graph heuristics developed for non-deterministic planning. We evaluate a straight-forward application of these planning graph techniques, which amounts to exactly computing a distribution over many relaxed planning graphs (one planning graph for each joint outcome of uncertain actions at each time step). Computing this distribution is costly, so we apply Sequential Monte Carlo (SMC) to approximate it. One important issue that we explore in this work is how to automatically determine the number of samples required for effective heuristic computation. We empirically demonstrate on several domains how our efficient, but sometimes suboptimal, approach enables our planner to solve much larger problems than an existing optimal bounded length probabilistic planner and still find reasonable quality solutions.     

Attraction ofCarpophilus spp. (Coleoptera: Nitidulidae) to synthetic aggregation pheromones and host-related coattractants in Australian stone fruit orchards: Beetle phenology and pheromone dose studies

Synthetic aggregation pheromones ofCarpophilus hemipterus (L.) andCarpophilus mutilatus Erichson were field tested during a 10-month period in southern New South Wales stone fruit orchards to determineCarpophilus spp. phenology and the effect of two pheromone doses on attraction. Aggregation pheromones synergize the attraction of host volatiles toCarpophilus spp. Four major species,C. hemipterus, C. mutilatus, C. davidsoni Dobson andC. (Urophorus) humeralis (F.), were trapped, with greater numbers of each species inC. hemipterus pheromone/fermenting whole-wheat breaddough-baited traps, than in dough-only-traps. InC. mutilatus pheromone/ fermenting-dough-baited traps, onlyC. mutilatus andC. davidsoni responded in greater numbers than to dough-only traps. Beetles first appeared in traps in late September (early spring) when daily maximum temperatures averaged 17.5C. Trappings reached a peak during October and declined to very low levels in November–December (late spring-early summer). Numbers trapped of all species increased during February–March (late summer–early autumn), presumably due to the presence of abundant host resources (ripening and fallen fruit), and continued at high levels until May (late autumn). An 18-week study demonstrated significantly greater responses byCarpophilus spp. to 5000-g than to 500-g doses of C.hemipterus andC. mutilatus pheromones. Greatest responses to 5000g were recorded forC. hemipterus andC. mutilatus responding to their own pheromones (increased attraction over dough alone of 259x and 21.2x respectively). Implications of the study and the potential for using synthetic aggregation pheromones for managingCarpophilus spp. populations in Australian stone fruit are discussed.     

Comparison of virtual path bandwidth assignment and routing methods

The virtual path (VP) can simplifyAtm network management by minimizing connection routing and admission costs, and by facilitating the layered control of resources. However, fully exploiting these advantages may lead to a large number of relatively low capacity virtual paths travelling on each physical link. If each VP is treated as a separate unit, as is commonly assumed, low path capacities will lead to low network utilisation. This paper carefully examines the trade-off between simplification through traffic separation and improved efficiency due to traffic consolidation. We review existing vp bandwidth assignment and control techniques, and propose a new vp tagging control method. A comparison shows that by permitting resource sharing between paths it is possible to influence significantly the trade-off between simplified network management and multiplexing gain from traffic consolidation.