Wheel/rail contact dynamics in turnout negotiations with combined nodal and non-conformal contact approach

In railroad turnouts, geometries of tongue and crossing rails are very complex and their shapes are changing along the track. Therefore, wheels are subjected to not only tread and flange contacts, but also the back-of-flange and top-of-flange contacts in the case of spring switches of tram vehicles. For this reason, one needs to deal with significant jumps in contact points for solving wheel/rail contact problems in turnout, and an accurate prediction of jumps in contact points is one of the most important issues that need to be carefully handled in the dynamic simulation of vehicle/turnout interactions. In this investigation, a numerical procedure that can be used for solving such a complex wheel/rail contact problem in turnout is proposed. In particular, a combined nodal and non-conformal contact approach is developed such that significant jumps in contact points are detected using the nodal search, while the exact location of contact point is then determined with continuous surface parameterizations using non-conformal contact equations. With this combined nodal and non-conformal contact approach for the contact geometry analysis of vehicle/turnout interactions, multiple look-up contact tables can be generated in an efficient way without losing accuracy. Since detailed contact search is performed off-line to obtain look-up contact tables, significant changes in contact points in turnout can be efficiently predicted on-line with tabular data to be interpolated in a standard way. Several numerical examples are presented in order to demonstrate the use of the numerical procedure developed in this investigation.     

Socializing artifacts as a half mirror of the mind

In the near future, our life will normally be surrounded with fairly complicated artifacts, enabled by the autonomous robot and brain–machine interface technologies. In this paper, we argue that what we call the responsibility flaw problem and the inappropriate use problem need to be overcome in order for us to benefit from complicated artifacts. In order to solve these problems, we propose an approach to endowing artifacts with an ability of socially communicating with other agents based on the artifact-as-a-half-mirror metaphor. The idea is to have future artifacts behave according to the hybrid intention composed of the owner’s intention and the social rules. We outline the approach and discuss its feasibility together with preliminary work.

---

Finding division points for a time series corpus based on structural change point detection

This paper describes a method of finding the proper points for dividing a corpus with time series information to extract local and frequent keywords. Previous works have proposed the corpus separating method for extracting keywords from a corpus. However, this method divides a corpus at equal intervals so that it cannot consider the topic changes. The present paper utilizes the idea of the topic model and the topic extracted through latent Dirichlet allocation to consider the topic change. This paper identifies the points at which large topic changes occur to divide the corpus using structural change detection method. An experiment involving newspaper articles with 5-year topics confirm that the points at which the topics of each document change are detected to find the division points based on the idea of structural change point detection and our method is better than previous methods based on recall measure.     

Integrated protocol for optimized link state routing and localization: OLSR-L

Localization protocol is important for estimating node positions in a wireless multi-hop network. Routing protocol is also important for controlling paths. In previous research, localization and routing protocols have been discussed and evaluated separately. In this paper, we propose an integrated protocol for optimized link state routing (OLSR) and OLSR based localization (ROULA). Our protocol enables simultaneous localization and routing. ROULA’s localization is performed using OLSR overhead such as hello packets and routing tables. The routing overheads and the processing procedures can be efficiently integrated. We demonstrate that the integrated protocol for ROULA and OLSR enables simultaneous localization and routing.     

Efficient distributed detection of conjunctions of local predicates

Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs. This paper presents an efficient distributed algorithm to detect conjunctive-form global predicates in distributed systems. The algorithm detects the first consistent global state that satisfies the predicate even if the predicate is unstable. Unlike previously proposed run-time predicate detection algorithms, our algorithm does not require the exchange of control messages during the normal computation. All the necessary information to detect predicates is piggybacked on computation messages of application programs. The algorithm is distributed because the predicate detection efforts as well as the necessary information are equally distributed among the processes. We prove the correctness of the algorithm and compare its performance with respect to message, storage and computational complexities with that of the previously proposed run-time predicate detection algorithms     

Enhanced path smoothing based on conjugate gradient descent for firefighting robots in petrochemical complexes*

The firefighting robot system (FFRS) comprises several autonomous robots that can be deployed to fire disasters in petrochemical complexes. For autonomous navigation, the path planner should consider the robot constraints and characteristics. Specifically, three requirements should be satisfied for a path to be suitable for the FFRS. First, the path must satisfy the maximum curvature constraint. Second, it must be smooth for robots to easily execute the trajectory. Third, it must allow reaching the target location in a specific heading. We propose a path planner that provides smooth paths, satisfy the maximum curvature constraint, and allows a suitable robot heading. The path smoother is based on the conjugate gradient descent, and three approaches are proposed for this path planner to meet all the FFRS requirements. The effectiveness of these approaches is qualitatively and quantitatively evaluated by examining the generated paths. Finally, the path planner is applied to an actual robot to verify the suitability of the generated paths for the FFRS, and planning is applied to another type of robot to demonstrate the wide applicability of the proposed planner.     

Development of insertion-type peristalsis pump using pneumatic artificial muscles

This study aims to develop a new type of peristaltic pump that transports high-viscosity and solid–liquid mixture fluids. Pumps capable of transporting such fluids are essential in various situations such as factory transportation, outdoors, and emergencies. These fluids are conventionally transported by positive-displacement and rotodynamic pumps. However, solid–liquid fluids could collide with the impeller of the rotodynamic pump and thereby damage the pump, whereas the positive-displacement pump must be sufficiently large to apply high pressure to the transported fluid. A small pump that can transport these fluids would save factory space and enable outdoor applications such as dredging operations. Thus, we adopted earthworm peristalsis as a model mechanism of fluid transport within a standard plumbing infrastructure. The insertion-type peristaltic pump developed in this study uses an artificial rubber muscle to achieve an earthworm-like mechanism. The capability and energy efficiency of the mechanism is evaluated in water transportation experiments.     

Tracking topic evolution via salient keyword matching with consideration of semantic broadness for Web video discovery

A method to track topic evolution via salient keyword matching with consideration of semantic broadness for Web video discovery is presented in this paper. The proposed method enables users to understand the evolution of topics over time for discovering Web videos in which they are interested. A framework that enables extraction and tracking of the hierarchical structure, which contains Web video groups with various degrees of semantic broadness, is newly derived as follows: Based on network analysis using multimodal features, i.e., features of video contents and metadata, our method extracts the hierarchical structure and salient keywords that represent contents of each Web video group. Moreover, salient keyword matching, which is newly developed by considering salient keyword distribution, semantic broadness of each Web video group and initial topic relevance, is applied to each hierarchical structure obtained in different time stamps. Unlike methods in previous works, by considering the semantic broadness as well as the salient keyword distribution, our method can overcome the problem of the desired semantic broadness of topics being different depending on each user. Also, the initial topic relevance enables correction of the gap from an initial topic at the start of tracking. Consequently, it becomes feasible to track the evolution of topics over time for finding Web videos in which the users are interested. Experimental results for real-world datasets containing YouTube videos verify the effectiveness of the proposed method.     

Selection of manipulator system for multiple-goal task by evaluating task completion time and cost with computational time constraints

The focus of this study is on the problem of manipulator system selection for a multiple-goal task by evaluating task completion time and cost with computational time constraints. An approach integrating system selection, structural configuration design, layout design, motion planning, and relative cost calculation is proposed to solve this problem within a reasonable computational time. In the proposed approach, multiple-objective particle swarm optimization (MOPSO) is utilized to search for the appropriate manipulator system with appropriate structural configuration from a set of candidate systems. Particle swarm optimization (PSO) and the nearest neighborhood algorithm are employed in layout design and motion planning due to their high convergence speed. Three methods involving a random search algorithm are compared to the proposed approach through a simulation. The simulation is done with a set of tasks and the result shows the effectiveness of the proposed approach.     

Compatibility problems in frontal, side, single car collisions and car-to-pedestrian accidents in Japan.

Compatibility problems in car-to-car frontal, side, single car and car-to-pedestrian collisions in Japan are discussed using traffic accident data. The number of serious and fatal injuries is investigated for the subject car and other cars, which are categorized by their class and mass. The aggressivity of the cars is calculated by the number of fatalities, fatality rates and by the number of car registrations. The results show that in car-to-car frontal collisions, cars with a mass of 1150 kg are the most compatible among the current car population. In both car-to-car frontal and side collisions, the sports utility vehicle and mini car are found to be the most incompatible car types with high and low aggressivity, respectively. On the other hand, the accident data show that the wagon and midsize sedan are the most compatible car types. The compatibility of fixed objects in the road environment with cars and cars with pedestrians is also discussed. In a single car collision with a fixed object, the guardrail is the most compatible object and can reduce the fatality rate on prefecture roads by about 60%. The front geometry of the car has large effect on compatibility with a pedestrian.