3He Melting Pressure Measurements in High Magnetic Fields

Experimental methods and preliminary results of high-precision measurements of the ³ He melting curve in high magnetic fields have been described. The purpose of this work is twofold. One is to establish a reliable millikelvin temperature scale in high fields (T 10 mK, B 15 T), The other is to investigate a high field region of the magnetic phase diagram of solid ³ He by measuring the melting pressure down to temperatures below 1 mK. Besides the two superfluid transitions, the phase transition temperatures between the spin ordered solid and the paramagnetic solid, T _HFP , were determined at B = 12 and 10 T with good accuracy, which is an extension of previous measurements up to 8 T. The present T _HFP (B) line can not be scaled to that at a higher density with a single Grüneisen parameter, indicating a variation of density dependencies of the multiple-spin exchange interactions.     

Single-crystal growth and characterization of Cu2O and CuO

We have prepared a large number of crystals of cuprous oxide (Cu2O) by various procedures. Photoluminescence spectra of these crystals were studied to examine the concentration of defects, especially copper vacancy VCu to seek favourable conditions for growing Cu2O crystal. High-quality single crystals of Cu2O were prepared by the floating-zone melting method in air. Several synthetic crystals (specimens FA, FZ and GZ) and also a natural crystal were studied by X-ray analysis, inductively coupled plasma spectroscopy analysis, optical absorption, photoluminescence, photoconductivity and cyclotron resonance absorption, photoluminescence, photoconductivity and cyclotron resonance absorption to characterize their optical and electrical qualities. The best values of mobility and scattering time of photocarriers at T = 4.2 K are estimated to be h1.8 × 105 cm2 V–1 s–1 and h60 ps for positive holes, and 1.3 × 105 cm2 V–1 s–1 and 70 ps for electrons in Cu2O. Further, we report preliminary experimental results on transport property of crystals also of cupric oxide (CuO) purified by the floating-zone melting method.     

Effect of temperature on humido-sensitive conducting polymer actuators

Temperature dependence of water vapor sorption and electro-active polymer actuating behavior of free-standing films made of poly(3,4-ethylenedioxythiophene) doped with poly(4-styrenesulfonate) (PEDOT/PSS) was investigated by means of sorption isotherm and electromechanical analyses. The non-porous PEDOT/PSS film, having a specific surface area of 0.13 m² g^?1, sorbed water vapor of 1080 cm³(STP) g^?1, corresponding to 87 wt%, at relative water vapor pressure of 0.95. A temperature rise from 25 °C to 40 °C lowered sorption degree, indicative of an exothermic process, where isosteric heat of sorption decreased with increasing water vapor sorption and the value reached 43.9 kJ mol^?1, being consistent with the heat of water condensation (44 kJ mol^?1). Upon application of 10 V, the film underwent contraction of 2.46% at 5 °C caused by desorption of water vapor due to Joule heating, which slightly decreased to 2.10% at 45 °C. The speed of contraction was one order of magnitude faster than that of expansion and less dependent on the temperature since water vapor sorbed in the film were forced to desorb by Joule heating. In contrast, the higher the temperature the faster the film expansion because diffusion coefficient increased as the temperature became higher.     

A biped static balance control and torque pattern learning under unknown periodic external forces

This paper addresses a biped balancing task in which an unknown external force is exerted, using the so-called ‘ankle strategy’ model. When an external force is periodic, a human adaptively maintains the balance, next learns how much force should be produced at the ankle joint from its repeatability, and finally memorized it as a motion pattern. To acquire motion patterns with balancing, we propose a control and learning method: as the control method, we adopt ground reaction force feedback to cope with an uncertain external force, while, as the learning method, we introduce a motion pattern generator that memorizes the torque pattern of the ankle joint by use of Fourier series expansion. In this learning process, the period estimation of the external force is crucial; this estimation is achieved based on local autocorrelation of joint trajectories. Computer simulations and robot experiments show effective control and learning results with respect to unknown periodic external forces.     

The effect of lutein supplementation on visual fatigue: A psychophysiological analysis

We used psychophysiological technology to examine the effect of an oral supplement, a combination of lutein, zeaxanthin and blackcurrant extract (LUT), on visual fatigue, within the context of a randomized, double-blind, placebo-controlled cross-over trial. The LUT supplement and placebo samples were randomly assigned to thirteen participants, who took the samples for two LUT (and vice versa) for another 2 week. Each participant completed visual proof reading tasks for 2 h during each of four testing sessions. Saccade tests were administered before and after the proof reading task, during which the participants moved their eyes back and forth between two targets positioned in the center of two checkerboards. We recorded EEG, EOG, heart rate, and facial muscle potential/performance during the saccade tests. Blood pressure was measured and subjective fatigue and stress scores were collected before and after the proof reading task. We averaged EEG starting at saccade offset in order to analyze eye fixation related potentials (EFRP). Our results suggested that the proof reading task induced visual fatigue. An analysis of EFRP and other psychophysiological data revealed significant differences between the LUT and placebo conditions. These results suggest that supplementation with LUT could help to reduce symptoms of visual fatigue.     

Semi-autonomous serially connected multi-crawler robot for search and rescue

In this paper, we develop a semi-autonomous serially connected multi-crawler robot for search and rescue. In large-scale disasters, such as earthquakes and tornadoes, the application of rescue robots to search for survivors under rubble would be beneficial. Snake-like robots (robots composed of serially connected units) are an effective candidate for such robots. Their long body enables them to overcome obstacles, and they can move into narrow spaces because of their thin shape. However, conventional snake-like robots have significant problems with operability. The numerous degrees of freedom of their bodies require complex operation to overcome obstacles, and training is required for the operators. Thus, survivors or community members cannot operate conventional robots to search for victims, despite the availability of such rescue robots. Here, we address this problem and develop a semi-autonomous serially connected multi-crawler robot designed for non-trained operators, such as community members or rescued survivors. It can be controlled easily by a conventional two-channel user interface with levers for turning and straight line motion. To demonstrate the effectiveness of our proposed mechanism, a prototype robot was developed and experiments were conducted. The results confirm that the proposed robot had both higher operability and higher mobility than conventional robots.     

Performance of SOR methods on modern vector and scalar processors

The building-cube method (BCM) is a new generation algorithm for CFD simulations. The basic idea of BCM is to simplify the algorithm in all stages of flow computation to achieve large-scale simulations. Calculation of a pressure field using the Successive Over Relaxation (SOR) method consumes most of the total execution time required for BCM. In this paper, effective implementations on modern vector and scalar processors are investigated. NEC SX-9 and Intel Nehalem-EX are the latest vector and scalar processors. Those processors have much higher peak performances than their previous-generation processors. However, their memory bandwidth improvement cannot catch up with the performance improvement of processors. This is the so-called memory wall problem. In our paper, we discuss optimization techniques for implementation of the SOR method based on architectural characteristics of these modern processors, and evaluate their effects on the sustained performances of these processors for BCM.     

P2P soft security: On evolutionary dynamics of P2P incentive mechanism

This paper thoroughly investigates the evolutionary dynamics of soft security mechanism, namely, reciprocity-based incentive mechanism, in P2P systems based on Evolutionary Game Theory (EGT). By soft security mechanism, it means social control mechanisms to overcome peers’ selfish (rational) behaviors, and encourage cooperation in P2P systems. Specifically, there exist three strategies in P2P systems: always cooperative (ALLC), always defect (ALLD) and reciprocator (R). Instead of existing work which take it for granted that, like ALLC users, R users did not bear any information-seeking cost, we assume small reciprocation cost, and study generalized mutation-selection dynamics. Our contributions are threefold: firstly, we prove and illustrate that, in a well-mixed P2P structure, ALLD is the only strict Nash equilibrium; secondly, we infer the specific condition under which evolution dynamics exhibits rock-scissors-paper oscillation in a structured P2P population. That is, the population cycles from ALLD to R to ALLC and back to ALLD; finally, we theoretically illustrate that the intensity of selection plays an important role in the evolutionary dynamics of P2P incentive mechanism. That is, when the intensity of selection is relatively weak and reciprocation cost limits to zero, the time average can be mostly concentrated on reciprocator. In brief, considering the existence of reciprocation cost and the small mutation in P2P incentive mechanisms, unlike existing work, it is impossible to simply achieve the “absolute cooperative” in P2P incentive mechanisms. On the other hand, stochastic evolution in P2P incentive mechanism with finite population and network structure still favor reciprocation.     

Parameterizing cut sets in a graph by the number of their components

For a connected graph G=(V,E), a subset U⊆V is a disconnected cut if U disconnects G and the subgraph G[U] induced by U is disconnected as well. A cut U is a k-cut if G[U] contains exactly k(≥1) components. More specifically, a k-cut U is a (k,?)-cut if V?U induces a subgraph with exactly ?(≥2) components. The Disconnected Cut problem is to test whether a graph has a disconnected cut and is known to be NP-complete. The problems k-Cut and (k,?)-Cut are to test whether a graph has a k-cut or (k,?)-cut, respectively. By pinpointing a close relationship to graph contractibility problems we show that (k,?)-Cut is in P for k=1 and any fixed constant ?≥2, while it is NP-complete for any fixed pair k,?≥2. We then prove that k-Cut is in P for k=1 and NP-complete for any fixed k≥2. On the other hand, for every fixed integer g≥0, we present an FPT algorithm that solves (k,?)-Cut on graphs of Euler genus at most g when parameterized by k+?. By modifying this algorithm we can also show that k-Cut is in FPT for this graph class when parameterized by k. Finally, we show that Disconnected Cut is solvable in polynomial time for minor-closed classes of graphs excluding some apex graph.