A perspective on the control of FES-supported standing

This special section is about the control of electrical stimulators to restore standing functions to paraplegics. It addresses several important topics regarding the interactions of the intact central nervous systems (CNS) with the artificial control system. The topics are as follows: how paraplegics use their arms to help themselves stand up with functional electrical stimulation (FES); the user-driven artificial control of FESsupported standing up; a controller which is promising for the control of sitting down; the application of reinforcement machine learning for the controllers of standing up; arms-free\ud standing with voluntary upper body balancing and artificially controlled ankle stiffness; and cognitive feedback in balancing. This Commentary introduces the papers in this section and relates them to earlier research

Payoff levels, loss avoidance, and equilibrium selection in the Stag Hunt: an experimental study

Game theorists typically assume that changing a game’s payoff levels—by adding the same constant to, or subtracting it from, all payoffs—should not affect behavior. While this invariance is an implication of the theory when payoffs mirror expected utilities, it is an empirical question when the “payoffs” are actually money amounts. In particular, if individuals treat monetary gains and losses differently, then payoff–level changes may matter when they result in positive payoffs becoming negative, or vice versa. We report the results of a human–subjects experiment designed to test for two types of loss avoidance: certain–loss avoidance (avoiding a strategy leading to a sure loss, in favor of an alternative that might lead to a gain) and possible–loss avoidance (avoiding a strategy leading to a possible loss, in favor of an alternative that leads to a sure gain). Subjects in the experiment play three versions of Stag Hunt, which are identical up to the level of payoffs, under a variety of treatments. We find differences in behavior across the three versions of Stag Hunt; these differences are hard to detect in the first round of play, but grow over time. When significant, the differences we find are in the direction predicted by certain– and possible–loss avoidance. Our results carry implications for games with multiple equilibria, and for theories that attempt to select among equilibria in such games

Capturing Regular Human Activity through a Learning Context Memory

A learning context memory consisting of two main parts is presented. The first part performs lossy data compression, keeping the amount of stored data at a minimum by combining similar context attributes — the compression rate for the presented GPS data is 150:1 on average. The resulting data is stored in an appropriate data structure highlighting the level of compression. Elements with a high level of compression are used in the second part to form the start and end points of episodes capturing common activity consisting of consecutive events. The context memory is used to investigate how little context data can be stored containing still enough information to capture regular human activity

An active interferometric method for extreme impedance on-wafer device measurements

Nano-scale devices and high-power transistors present extreme impedances, which are far removed from the 50-Ω reference impedance of conventional test equipment, resulting in a reduction in the measurement sensitivity as compared with impedances close to the reference impedance. This letter describes a novel method based on active interferometry to increase the measurement sensitivity of a vector network analyzer for measuring such extreme impedances, using only a single coupler. The theory of the method is explained with supporting simulation. An interferometry-based method is demonstrated for the first time with on-wafer measurements, resulting in an improved measurement sensitivity for extreme impedance device characterization of up to 9%

A Formal Semantic Model of the Semantic Web Service Ontology (WSMO)

Semantic Web Services, one of the most significant research areas within the Semantic Web vision, has attracted increasing attention from both the research community and industry. The Web Service Modelling Ontology (WSMO) has recently been proposed as an enabling framework for the total/partial automation of the tasks (e.g., discovery, selection, composition, mediation, execution, monitoring, etc.) involved in both intra- and inter-enterprise integration of Web Services. To support the standardization and tool support of WSMO, a formal semantics of the language is highly desirable. As there are a few variants of WSMO and it is still under development, the semantics of WSMO needs to be formally defined to facilitate easy reuse and future development. In this paper, we present a formal Object-Z semantics of WSMO. Different aspects of the language have been precisely defined within one unified framework. This model not only provides a formal unambiguous model which can be used to develop tools and facilitate future development, but as demonstrated in this paper, can be used to identify and eliminate errors presented in existing documentation

Transitioning Applications to Semantic Web Services: An Automated Formal Approach

Semantic Web Services have been recognized as a promising technology that exhibits huge commercial potential, and attract significant attention from both industry and the research community. Despite expectations being high, the industrial take-up of Semantic Web Service technologies has been slower than expected. One of the main reasons is that many systems have been developed without considering the potential of the web in integrating services and sharing resources. Without a systematic methodology and proper tool support, the migration from legacy systems to Semantic Web Service-based systems can be a very tedious and expensive process, which carries a definite risk of failure. There is an urgent need to provide strategies which allow the migration of legacy systems to Semantic Web Services platforms, and also tools to support such a strategy. In this paper we propose a methodology for transitioning these applications to Semantic Web Services by taking the advantage of rigorous mathematical methods. Our methodology allows users to migrate their applications to Semantic Web Services platform automatically or semi-automatically