Electromagnetic-actuated robotic systems have been studied recently for special purposes. Because these systems use external magnetic fields to control their robots, the robots can have simple structures and move with much freedom. In particular, these electromagnetic actuation (EMA) systems are being widely adopted for the actuation of biomedical mini-robots and microrobots for minimally invas...

Derivations in the minimalist programm (MP) frequently encounter competition between elementary operations. A way in MP to resolve such competitions is to assume preference principles, the most prominent being “Merge before Move” (Chomsky 2000). Assmann, Georgi et al. (2013) discuss competition between Agree and Move. ere, either Agree must be procrastinated in favor of Move or the other way ro...

Meltran V, a new biped robot with telescopic legs, is introduced. For 3D walking control of the robot we analyze the dynamics of a three-dimensional inverted pendulum in which motion is constrained to move along an arbitrarily de ned plane. From this analysis we obtain simple linear dynamics, the ThreeDimensional Linear Inverted Pendulum Mode (3DLIPM). Using a real-time control method based on ...

Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers statistics on moves, and it prunes moves statistically inferior to the best one [5]. This papers yields two new pruning techniques: Miai Pruning (MP) and Set Pruning (SP). In MP the second move of the random games is selected at ran...

In this paper, we propose the necessity to expand the concept of semiformal systems in collaborative environments. We have through extensive empirical work identified a number of salient dimensions that points towards need of broaden the space of possible actions for the users. The complexity of collaborative processes and the trend of increased use of mobile technologies have been concretized ...

An exact formula for the move-to-front rule for self-organizing lists.

Consider a list of n files whose popularities are random. These files are updated according to the move-tofront rule and we consider the induced Markov chain at equilibrium. We give the exact limiting distribution of the search-cost per item as n tends to infinity. Some examples are supplied.

A method for sharpening of 3D volume images has been developed. The idea of the proposed algorithm is to transform the 3D neighborhood of the edge so that the neighboring pixels move closer to the edge, and then resample the image from the warped grid to the original pixel grid. The proposed technique preserves image textures while making the edges sharper. The effectiveness of the proposed met...

We present an experience-based pushmanipulation method, where the mobile robot learns through experimentation how the pushable real world objects with complex 3D structures move in response to various pushing actions. These experimentally acquired models are then used as building blocks for constructing achievable push plans via a Rapidly-exploring Random Trees variant planning algorithm we con...