The development of a small and multiband antenna plays an important role in the rapidly growing mobile communication market. This paper presents the design of a novel small and wideband planar inverted F-antenna which simultaneously covers GSM850/GSM900/DCS1900/IMT2000/WLAN/DMB services. The proposed antenna consists of a main patch with a pair of slits and L-shaped patch, occupying a total volume of 15366 mm3. A very wide impedance bandwidth characteristic was achieved by optimizing both the gap distance between the feed line and L-shaped patch, and also the lengths and widths of a pair of slits on the main patch, which is excited by the modified CPW-fed line. The average gains at the frequencies of 850, 2000 and 2600 MHz were -2.51, -1.42 and -1.68 dBi, respectively. The overall shape of the radiation patterns is suitable for mobile communications.

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 consider the problem of triangulating an x-monotone polygon with a small number of different edge lengths using Steiner points. Given a parameter α, where 0<α<1, we shall present an algorithm for finding an almost uniform triangular mesh with 3π/8α2+o(1/α2) different edge lengths such that every edge length is between l and (2+α)l. Experiments demonstrate the effectiveness of this algorithm.

DC motors are indispensable to improve the automotive functions. Recently, 70-100 motors are installed on luxury cars and this number is increasing year by year. With the recent demand for improved fuel economy and better equipment layout, the improvement of the motor's efficiency and the minimization of the motor size are the key to enhancing the competitive edge of the products. Adopting the high-density coil is an effective method for that, but it is accompanied by the commutation inductance rise which causes the commutation arc increase. The increase of commutation arc decreases motor life, because it causes the rise of brush/commutator wear. This report describes an arc-reducing effect obtained when capacitors are built into a commutation circuit for the purpose of reducing arcing under high commutation inductance conditions. The results of an evaluation using a equivalent commutation circuit and carbon brush/carbon flat-commutator showed that although a commutation circuit with built-in capacitor generated the same arc energy as a commutation circuit without a capacitor above a certain value of residual current, it displayed an excellent arc-reducing effect below that value of residual current.

Numerous studies have shown that scaling exponents of internet traffic change over time or scaling ranges. In order to analyze long-range dependent traffic with changing scaling exponents over time scales, we propose a multi-scale traffic model that incorporates the notion of a piecewise self-similar process, a process with spectral changes on its scaling behavior. We can obtain a performance curve smoothened over the range of queue length corresponding to time scales with different scaling exponents by adopting multiple self-similar processes piecewise into different spectra of time scale. The analytical method for the multiscale fractional Brownian motion is discussed as a model for this approach. A comparison of the analytical and simulation results, using traffic data obtained from backbone networks, shows that our model provides a good approximation for Gaussian traffic.

Efficient real-time contents distribution services on the Internet are only possible by suppressing the influence of packet losses. One solution for UDP transmission is the use of Forward Error Correction (FEC) based on Reed-Solomon codes. However, a more efficient method is required since this causes the increase of network traffic and includes the weakness to burst packet losses. In this paper, we propose a data recovery method that generates redundant data with the combination of Reed-Solomon codes and convolution of neighboring blocks. We realize the small amount of redundancy and the high reliability in data transmission compared with using only Reed-Solomon codes in the environment that burst packet losses are occurred frequently. We implement proposal method into the network bridge and confirm its efficiency from the viewpoint of data reconstruction from burst packet losses.

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.

This investigation proposes a modified equivalent circuit of single complementary split-ring resonator (CSRR) in planar transmission media and a dual-mode ring bandpass filter (BPF) that uses periodic CSRRs to suppress the spurious response. The proposed modified equivalent circuit consists of lumped elements that can be easily extracted from the measured S parameters. The proposed dual-mode ring BPF has exhibits a wide stopband characteristic owing to the bandgap resonant characteristic of CSRRs in the harmonic frequency of the dual-mode ring BPF. Good agreement with EM simulation and measurement is demonstrated.

Field assembly of optical connectors is demanded because of the wide use of optical fiber in telecommunications systems. We propose a new assembling techniques that enable us to assemble connectors anywhere quickly and cost effectively. The key points are an adhesive technique and a polishing technique. In this report, we focus mainly on our a new polishing machine, which is suitable for optical connector ends machining on-site. The machine which is small and light weight can finish optical connector ends easily in a short time with enough low cost.

A method which uses the moving time and the over travel time of contact to discover the characteristics of contact and the reliability of aerospace relay is proposed. The Gauss-Newton method and its improved form (Macalto method) are used to identify the nonlinear mathematical model of the parameter during armature initial moving period, which is from the coil is energized at a rated voltage to the moment the armature begins to move. The validity of the method is verified by results of actual experiments and analysis.

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.

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.

In wireless adaptive modulation and coding (AMC) systems, modulation type of a user's connection can change and the ongoing connection might fail due to the change of modulation. In this paper, we approach the AMC-induced call admission control (CAC) problem by focusing on the guaranteed connection. Three classes of calls, new, handoff, and modulation-changed, are considered. We modify the guard-channel CAC scheme such that the modulation-changed calls, in addition to the handoff calls, are allowed to use the guard channel. Then we analyze a Markov model for the CAC scheme designed with long-term AMC in mind. The proposed approach will be an essential tool to determine the guard-channel thresholds in the wireless AMC networks.

We consider the problem of dynamically apportioning resources among a set of options in a worst-case online framework. The model we investigate is a generalization of the well studied online learning model. In particular, we allow the learner to see as additional information how high the risk of each option is. This assumption is natural in many applications like horse-race betting, where gamblers know odds for all options before placing bets. We apply Vovk's Aggregating Algorithm to this problem and give a tight performance bound. The results support our intuition that it is safe to bet more on low-risk options. Surprisingly, the loss bound of the algorithm does not depend on the values of relatively small risks.

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].

We proposed a method for suppressing arc ignition in mechanical contact devices using a transient current switch and a capacitor. We applied the method to conventional reed switches. For the electric circuit analysis, we clarified the momentary voltage-current characteristics at breaking operation of reed switches by FEM analysis. We could also estimate the capacitance of the contact electrodes at the metal bridge rupture by FEM analysis, and would derive the non-arcing condition using SPICE simulation. The suitable capacitor value in the transient current circuit for arc ignition suppression would be depend on the load impedance, the power supply, the time depending contact resistance R(t)s, the contact capacitance, and the minimum arc voltage and current.

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.

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.

To clarify the transmission characteristics and near magnetic field on the angle pattern for the parallel transmission lines, the authors investigate how influence the angled pattern on the transmission lines by experiment and calculation. The angled patterns on the transmission lines are straight, right angle and curve. It shows that the suppression of EMI radiation at the angled pattern on the parallel transmission lines of the magnetic head is essential. In addition, it is suggested that angle pattern might be one of cause for the signal distortion and specific EMI radiation at high frequency.

In this paper an analysis of component and system reliability for lattice systems is proposed when component failures are not statistically independent. We deal the case that the failure rate of a component depends on the number of the adjacent failed components. And we discuss the maintainability of the system when a failed component is replaced by a spare component. At first we discuss the approximated reliability of each component. Then we estimate the mean number of failed components. Furthermore, the system reliability is approximated by using the component reliability.