The mechanism of dark bridge formed with very slow contact separating speed was empirically shown with some discussions from the experimental results which the authors have obtained by using the cantilever system for controlling contact gap. By analyzing the obtained results, we will assume some concept of formation mechanism of dark bridge. Since the thermal effect is inevitable in the bridge formation, this will be inferred from two points; one is the a-spot change at initial state of bridge forming, and another one is the thermal expansion due to bridge current that affects the shape of bridge. This paper will show from these two points the conceptual bridge formation mechanism in case of non-melting state of contact bridge which is called here dark bridge.

Breaking arcs occurring between silver electrical contacts are observed in DC42 V resistive circuit using a high-speed camera. The motion and current densities of the cathode and anode spot regions are investigated for different interrupt currents (I=7 A, 10 A and 14 A). Results indicate that the arc length at which the motion of arc spots becomes stable depends on the interrupt current, and the current densities of the cathode spot region are almost constant immediately before arc extinction for each interrupt current.

A state space compression method based on multivariate analysis was developed and applied to reinforcement learning for high-dimensional continuous state spaces. First, useful components in the state variables of an environment are extracted and meaningless ones are removed by using multiple regression analysis. Next, the state space of the environment is compressed by using principal component analysis so that only a few principal components can express the dynamics of the environment. Then, a basis of a feature space for function approximation is constructed based on orthonormal bases of the important principal components. A feature space is thus autonomously construct without preliminary knowledge of the environment, and the environment is effectively expressed in the feature space. An example synchronization problem for multiple logistic maps was solved using this method, demonstrating that it solves the curse of dimensionality and exhibits high performance without suffering from disturbance states.

Spatial despreading weight based on minimum mean square error (MMSE) criterion is derived for orthogonal space-time spreading transmit diversity (OSTSTD) in a fast fading channel, taking into account the inter-antenna interference (IAI) and the inter-code interference (ICI) caused by orthogonality distortion of time-domain spreading codes. Average bit error rate (BER) performance is theoretically analyzed and confirmed by computer simulation to show that the diversity gain can be obtained even in a fast fading.

In difficult classification problems of the z-dimensional points into two groups giving 0-1 responses due to the messy data structure, we try to find the denser regions for the favorable customers of response 1, instead of finding the boundaries to separate the two groups. Such regions are called the bumps, and finding the boundaries of the bumps is called the bump hunting. The main objective of this paper is to find the largest region of the bumps under a specified ratio of the number of the points of response 1 to the total. Then, we may obtain a trade-off curve between the number of points of response 1 and the specified ratio. The decision tree method with the Gini's index will provide the simple-shaped boundaries for the bumps if the marginal density for response 1 shows a rather simple or monotonic shape. Since the computing time searching for the optimal trees will cost much because of the NP-hardness of the problem, some random search methods, e.g., the genetic algorithm adapted to the tree, are useful. Due to the existence of many local maxima unlike the ordinary genetic algorithm search results, the extreme-value statistics will be useful to estimate the global optimum number of captured points; this also guarantees the accuracy of the semi-optimal solution with the simple descriptive rules. This combined method of genetic algorithm search and extreme-value statistics use is new. We apply this method to some artificial messy data case which mimics the real customer database, showing a successful result. The reliability of the solution is discussed.

Breaking arcs are generated between a pair of Cu electrical contacts in a DC 42 V/10.5 A circuit, and the arc voltage, the arc current and the time-resolved arc spectral intensities near contact surfaces are simultaneously measured. The arc temperature is calculated from some spectral intensities emitted from Cu neutral atoms using the Boltzmann plot method. The arc temperatures near the cathode and anode surfaces are measured, and the following experimental results were obtained. (1) Time evolutions of the spectral intensities and the calculated arc temperature have similar characteristics. (2) The arc temperature near the anode surface is higher than that near the cathode surface, and the temperature fluctuation near the anode surface is larger than that near the cathode. (3) Just before arc extinction, the arc temperature near the cathode surface is almost constant for many breaking operations but the arc temperature near the anode surface varies.

We discuss a new design methodology of polynomial neural networks (PNN) in the framework of genetic algorithm (GA). The PNN is based on the ideas of group method of data handling (GMDH). Each node in the network is very flexible and can carry out polynomial type mapping between input and output variables. But the performances of PNN depend strongly on the number of input variables available to the model, the number of input variables, and the type (order) of the polynomials to each node. In this paper, GA is implemented to better use the optimal inputs and the order of polynomial in each node of PNN. The appropriate inputs and order are evolved accordingly and are tuned gradually throughout the GA iterations. We employ a binary coding for encoding key factors of the PNN into the chromosomes. The chromosomes are made of three sub-chromosomes which represent the order, number of inputs, and input candidates for modeling. To construct model by using significant approximation and generalization, we introduce the fitness function with a weighting factor. Comparisons with other modeling methods and conventional PNN show that the proposed design method offers encouraging advantages and better performance.

This letter proposes a fast k nearest neighbors search algorithm based on the wavelet transform. This technique exploits the important information of the approximation coefficients of the transform coefficient vector, from which we obtain two crucial inequalities that can be used to reject those vectors for which it is impossible to be k nearest neighbors. The computational complexity for searching for k nearest neighbors can be largely reduced. Experimental results on texture classification verify the effectiveness of our algorithm.

We have developed an optical connector assembly method that allows the rapid on-site installation of an optical connector. To simplify this on-site assembly process we fabricated built-in parts that enable us to install the optical connector using pre-assembled optical connector parts. Moreover, we have established an advanced method for applying a solidifying agent that adheres to the inner wall of a ferrule flange. With our assembly method, we can complete on-site optical connector installation, other than the polishing process, in two steps, namely bonding agent application and fiber insertion.

We have been investigating an orthogonal frequency division multiple access (OFDMA) based cellular system that is called "dynamic parameter controlled orthogonal frequency and time division multiple access (DPC-OF/TDMA)" for the development of beyond third generation (B3G) mobile communication systems. Moreover, we have already proposed a time alignment control (TAC) to compensate propagation delays that induce a multiple-access interference (MAI) in the uplink OFDMA. However, that TAC includes a large amount of computations. This means that it is quite difficult for the OFDMA systems to implement TAC into volume-limited hardware devices such as field programmable gate array (FPGA). Thus, we propose a new complexity-reduced TAC (CRTAC) in this paper. CRTAC can be implemented into such devices easily. In this paper, we show some computer simulation results, and then evaluate the error rate performances of DPC-OF/TDMA employing CRTAC. Moreover, we also show the benefit of the reasonable level of the implementation complexity made by CRTAC.

Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using this scheme.

The security vulnerabilities of a number of provable secure proxy signature schemes are examined with the assumption that users can register their public keys without having corresponding private keys. This assumption is different from that of a standard proxy signature in which the public keys of users are authentic. Under this assumption, both the Triple Schnorr scheme and Kang et al's scheme are shown to be vulnerable to a rogue public key registration attack. This attack gives an adversary the ability to generate a proxy signature without the valid agreement of the original signer. Moreover, it is shown that an adversary can manipulate the description of a delegated signing right at will. This work can be considered as an awakening to the importance of Proof of Possession (PoP) in the PKI environment, as in many cases certificate authorities do not require the PoP protocol, as has been stated [1].

Anode activity in vacuum arc plays a very important role in both characteristics of vacuum arc and the interruption capacity of vacuum interrupters. In this paper, the transient thermal processes of anode in vacuum arc in a half of arc current cycle with frequency of 50 Hz are simulated by finite element analysis software, ANSYS. Some important phenomena of anode, e.g., the melt and solidification, mass loss due to evaporation, are investigated.

Solving the error correcting code is an important goal with regard to communication theory. To reveal the error correcting code characteristics, several researchers have applied a statistical-mechanical approach to this problem. In our research, we have treated the error correcting code as a Bayes inference framework. Carrying out the inference in practice, we have applied the NMF (naive mean field) approximation to the MPM (maximizer of the posterior marginals) inference, which is a kind of Bayes inference. In the field of artificial neural networks, this approximation is used to reduce computational cost through the substitution of stochastic binary units with the deterministic continuous value units. However, few reports have quantitatively described the performance of this approximation. Therefore, we have analyzed the approximation performance from a theoretical viewpoint, and have compared our results with the computer simulation.

A model for the enhancement-mode operation of an AlGaN/GaN metal-insulator-semiconductor heterostructure field-effect transistor (MIS-HFET) under DC and AC conditions is proposed. In DC operation at positive gate voltages, the MIS-HFET can be divided into a transistor area and a resistor area due to the diode nature of the insulator/AlGaN interface. The transistor area shrinks with the increases in gate voltage. The intrinsic-transistor gate-length reduction causes a drain current increase. The I-V characteristics based on the gradual channel approximation are derived. The ID hysteresis of the MIS-HFET is investigated by a circuit simulation using SPICE. We have confirmed that the hysteresis was caused by the phase difference between the potential variation of the gate insulator/AlGaN interface and that of the gate electrode due to CR components in the gate structure.

In this paper we review our recent work developing the growth of AlGaN/GaN high-electron mobility transistors (HEMTs) grown on SiC (0001) by plasma-assisted molecular beam epitaxy (PA-MBE). State-of-the-art AlGaN/GaN HEMTs have been achieved using MBE-grown material. Buffer leakage was an important limiting factor for early devices. We have shown that by appropriately controlling the Al/N flux ratio during growth of the nucleation layer on SiC(0001), low-leakage GaN buffers can be subsequently grown. In addition, a "modulated growth" technique was developed to achieve large area uniformity and surface morphology control. High-performance HEMTs were fabricated utilizing these two techniques. On 200 nm gate-length devices, at 4 GHz an output power density of 8.4 W/mm was obtained with a power-added efficiency (PAE) of 67% at a drain bias of 30 V. At a higher drain bias (42 V), 13.7 W/mm with a PAE of 55% was achieved.

The H.264 standard allows each macroblock to have up to sixteen motion vectors, four reference frames, and a macroblock mode. Exploiting this feature, we present an efficient temporal error concealment algorithm for H.264-coded video. The proposed method turns out to show good performance compared with conventional approaches.

One of the challenging issues in affective computing is to give a machine the ability to recognize the affective states with intensity of a person. Few studies are directed toward this goal by categorizing affective behavior of the person into a set of discrete categories. But still two problems exist: gesture is not yet a concern as a channel of affective communication in interactive technology, and existing systems only model discrete categories but not affective dimensions, e.g., intensity. Modeling the intensity of emotion has been well addressed in synthetic autonomous agent and virtual environment literature, but there is an evident lack of attention in other important research areas such as affective computing, machine vision, and robotic. In this work, we propose an affective gesture recognition system that can recognize the emotion of a child and the intensity of the emotion states in a scenario of game playing. We used levels of cognitive and non-cognitive appraisal factors to estimate intensity of emotion. System has an intelligent agent (called Mix) that takes these factors into consideration and adapt the game state to create a more positive interactive environment for the child.

A novel resonant tunneling diode (RTD) oscillator is proposed, which overcomes the problems of the conventional RTD oscillators, such as the low-frequency spurious oscillation and the bias instability. Our proposal consists of two RTDs connected serially, and the resonator connected to the node between two RTDs. This circuit separates the oscillation node from the bias nodes, and suppresses the above mentioned problems. This relaxes the severe restriction on the RTD area, and makes it possible to supply higher power to a load. Circuit simulation shows that with this circuit more than 2 mW power can be supplied to the 50 Ω resistive load at 100 GHz using RTDs having 105 A/cm2-peak current density and 20 µm2-area. It also shows that the dc-to-RF conversion efficiency is as good as that of conventional ones. Furthermore, we have studied the extension of this oscillator having 4 RTDs connected serially. Circuit simulations revealed that using this circuit the power can be doubled with a good conversion efficiency.

The EDD connection admission control scheme has been proposed for supporting real-time communication in packet-switched networks. In the scheme, when a connection establishment request occurs, the worst-case link delay in each link along the connection is calculated to determine whether the request can be accepted or not. In order to calculate the worst-case link delay, we must perform a check called the point schedulability check for each of some discrete time instants (checkpoints). Therefore when there are many checkpoints, the worst-case link delay calculation is time-consuming. We have proposed a high-speed calculation method. The method finds some checkpoints for which the point schedulability check need not be performed and removes such unnecessary checkpoints in advance before a connection establishment request occurs, and the check is performed for each of the remaining checkpoints after the request occurs. However, the method is not so effective under the situation that the maximum packet length in networks is large, because the method can find few unnecessary checkpoints under the situation. This paper proposes a new high-speed calculation method. We relax the condition which determines whether or not the point schedulability check need not be performed for each checkpoint in our previous method and derive a new condition for finding unnecessary checkpoints. Using the proposed method based on the new condition, we can increase the number of unnecessary checkpoints compared to our previous method. Numerical examples which are obtained by extensive simulation show that the proposed method can attain as much as about 50 times speedup.