Real-time object detection or recognition technology becomes more important for various intelligent vision systems. Processing models for object detection or recognition from natural images should tolerate pattern deformations and pattern position shifts. The hierarchical convolutional neural networks are considered as a promising model for robust object detection/recognition. This model requires huge computational power for a large number of multiply-and-accumulation operations. In order to apply this model to robot vision or various intelligent real-time vision systems, its LSI implementation is essential. This paper proposes a new algorithm for reducing multiply-and-accumulation operation by sorting neuron outputs by magnitude. We also propose an LSI architecture based on this algorithm. As a proof of concept for our LSI architecture, we have designed, fabricated and tested two test LSIs: a sorting LSI and an image-filtering LSI. The sorting LSI is designed based on the content addressable memory (CAM) circuit technology. The image-filtering LSI is designed for parallel processing by analog circuit array based on the merged/mixed analog-digital approach. We have verified the validity of our LSI architecture by measuring the LSIs.

In this paper, the pressure monitoring telemetry system has been designed and implemented for an accurate pressure measure-ment inside the gastrointestinal tract with minimizing pain and inconvenience. The system is composed of a miniaturized pres-sure measurement capsule and an external receiver. The per-formance of the telemetry capsule for monitoring pressure in the gastrointestinal tract is demonstrated by the results of animal in-vivo experiments.

This paper presents a hybrid decimal division algorithm to improve division speed. The proposed hybrid algorithm employs either non-restoring or restoring algorithm on each digit to reduce iterative computations. The selection of the algorithm is based on the relative remainder values with respect to the half of its divisor. The proposed algorithm requires maximum 7n+4 add/subtract operations for an n-digit quotient, whereas other restoring or non-restoring schemes comprise more than 10n+1 operations.

A new simply implemented collusion-attack free identity-based non-interactive key sharing scheme (ID-NIKS) has been proposed. A common-key can be shared by executing only once a modular exponentiation which is equivalent to RSA deciphering, and the security depends on the difficulty of factoring and the discrete logarithm problem. Each user's secret information can be generated by solving two simple discrete logarithm problems and synthsizing their solutions by linear combination. The detail comparison with the Maurer-Yacobi's scheme including its modified versions shows that the computational complexity to generate each user's secret information is much smaller and the freedom to select system parameters is much greater than that of the Maurer-Yacobi's scheme. Then our proposed scheme can be implemented very easily and hence it is suitable for practical use.

In this paper, the voice signal processing module has been designed using the micro processor for the use of fully implantable middle ear devices (F-IMEHD). The voice signal processing module for F-IMEHD should be designed to compensate for the hearing loss of hearing impaired person and have the flexibility for compensating various hearing threshold level. So, the voice signal processing module has been designed and implemented to present the various frequency characteristics using the low-power micro processor, MSP430F169. The different voice signal path to the inner ear entrance was considered so that two voice signal would be combined in-phase using an all pass filter with a constant time-delay to improve the vibration of the ossicles.

In this paper, for the fully-implantable middle ear hearing devices (F-IMEHD), a transcutaneous recharging system that has the function of the bi-directional signal transmission with the implant module in a body as well as recharging battery has been designed and implemented. The electromagnetic coupling method using two coils has been adopted for the transfer of electrical power to recharge internal battery of the implant module. To increase the efficiency of power transfer, the switching frequency of recharging system is determined by the consideration of the resonance of LC tank circuits. The bidirectional signal transmission between the recharging system and the implant module has been designed through the on-off keying modulation of switching signal in the recharging system and the impedance variation of LC tank circuit in the implant module. Through the demonstration of the implemented system, it has been verified that the proposed system has the performance of bidirectional signal transmission with the implant module of F-IMEHDs as well as the battery recharging.

An unsupervised adaptive signal processing method of principal components analysis (PCA) neural networks (NN) based on signal eigen-analysis is proposed to permit the eigenstructure analysis of lower signal to noise ratios (SNR) direct sequence spread spectrum (DS) signals. The objective of eigenstructure analysis is to estimate the pseudo noise (PN) of DS signals blindly. The received signal is firstly sampled and divided into non-overlapping signal vectors according to a temporal window, which duration is two periods of PN sequence. Then an autocorrelation matrix is computed and accumulated by these signal vectors one by one. Lastly, the PN sequence can be estimated by the principal eigenvector of autocorrelation matrix. Since the duration of temporal window is two periods of PN sequence, the PN sequence can be reconstructed by the first principal eigenvector only. Additionally, the eigen-analysis method becomes inefficient when the estimated PN sequence is long. We can use an unsupervised adaptive method of PCA NN to realize the PN sequence estimation from lower SNR input DS-SS signals effectively.

The path coloring problem is to assign the minimum number of colors to a given set P of directed paths on a given symmetric digraph D so that no two paths sharing an arc have the same color. The problem has applications to efficient assignment of wavelengths to communications on WDM optical networks. In this paper, we show that the path coloring problem is NP-hard even if the underlying graph of D is restricted to a binary caterpillar. Moreover, we give a polynomial time algorithm which constructs, given a binary caterpillar G and a set P of directed paths on the symmetric digraph associated with G, a path coloring of P with at most colors, where L is the maximum number of paths sharing an edge. Furthermore, we show that no local greedy path coloring algorithm on caterpillars in general uses less than colors.

This paper describes a two-dimensional clustering scheme-based analysis of audible noises induced at telephone terminals. To analyze EMI sources that cause telephone-audible noise, we use a self-organizing map, which provides a way to map high-dimensional data onto a two-dimensional domain. Also, in order to discriminate EMI sources without using particular resonance frequencies that have peaks in the frequency domain, we use the energy spectra of telephone-audible noises as input for training the self-organizing map. In applying this method in actual environments, we measured ten kinds of telephone-audible noises (due to Radio waves and cross-talk noises, etc.) and then derived their energy spectra for eight frequency bands: 1-250 Hz, 250-500 Hz, 500-1 kHz, 1 k-1.5 kHz, 1.5 k-2 kHz, 2 k-3 kHz, 3 k-4 kHz, and over 4 kHz. We visually confirmed that the measured telephone-audible noise data could be projected onto the map in accordance with their properties, resulting in a combined depiction of the composition of derived energy spectra in the frequency bands. The proposed method can deal with multi-dimensional parameters, projecting its results onto a two-dimensional space in which the projected data positions give us an effective depiction of EMI sources that cause disturbances at telephone terminals.

This paper compares selected Optical Packet Switching architectures that use the wavelength conversion technique to solve the packet contention problem. The architectures in question share wavelength converters, which are needed to wavelength translate arriving packets. This paper focuses on two architectures: the Shared Per Output Line (SPOL) and the Shared Per Input Line (SPIL) architectures, in which the wavelength converters are shared per output and input fiber respectively. The performance of the proposed architectures is evaluated for all the balance/unbalance combinations of input/output traffic. Packet loss probability is expressed as a function of the number of wavelength converters used, by means of analytical models validated by simulations. The results obtained show that the SPIL architecture, when compared to the SPOL architecture, allows for greater economies in terms of number of wavelength converters needed. While the performance of the two architectures tends to have similar values in a scenario with unbalanced input traffic and balanced output traffic, in unbalanced output traffic scenarios the SPIL architecture requires about 50% less wavelength converters than the SPOL architecture does, for a given packet loss probability.

The aim of this research is the efficient cryptanalysis of the Shrinking Generator through its characterization by means of Linear Hybrid Cellular Automata. This paper describes a new known-plaintext attack based on the computation of the characteristic polynomials of sub-automata and on the generation of the Galois field associated to one of the Linear Feedback Shift Registers components of the generator. The proposed algorithm allows predicting with absolute certainty, many unseen bits of the keystream sequence, thanks to the knowledge of both registers lengths, the characteristic polynomial of one of the registers, and the interception of a variable number of keystream bits.

Metro networks are based on SONET/SDH which uses the circuit switching technology. Circuit switching is inappropriate for the Internet traffic which is very bursty nature. Therefore, metro networks can become a bottleneck. In order to resolve this problem, the IEEE 802.17 working group has proposed the Resilient Packet Ring (RPR) technology. In order to provide fairness among stations in the RPR network, two types of RPR fairness mechanisms have been defined. However, the IEEE 802.17 RPR fairness mechanisms have the problem of inefficient use of the available bandwidth after the congestion at a node has been resolved. In this paper, we propose an improved bandwidth allocation in which, after the congestion resolution at a node, the node estimates the number of effective nodes transmitting traffic, measures the remaining bandwidth and fairly allocates the available bandwidth to effective nodes. To show the performance of our proposed mechanism, we have performed simulation and show that the proposed mechanism gives higher bandwidth utilization than the existing RPR fairness mechanisms.

This paper investigates the accepting powers of two-way alternating Turing machines (2ATM's) with only existential (universal) states which have inkdots and sublogarithmic space. It is shown that for sublogarithmic space-bounded computations, (i) multi-inkdot 2ATM's with only existential states and the ones with only universal states are incomparable, (ii) k-inkdot 2ATM's are better than k-inkdot 2ATM's with only existential (universal) states, k ≥ 0, and (iii) the class of sets accepted by multi-inkdot 2ATM's with only existential (universal) states is not closed under complementation.

In this paper, a method is proposed to construct a visual secret sharing (VSS) scheme for multiple secret images in which each share can be rotated with 180 degrees in decryption. The proposed VSS scheme can encrypt more number of secret images compared with the normal VSS schemes. Furthermore, the proposed technique can be applied to the VSS scheme that allows to turn over some shares in decryption. From the theoretical point of view, it is interesting to note that such VSS schemes cannot be obtained from so-called basis matrices straightforwardly.

This paper deals with graph colouring games, an example of pseudo-telepathy, in which two players can convince a verifier that a graph G is c-colourable where c is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of the Hadamard graph GN with N=c=16. Their protocol applies only to Hadamard graphs where N is a power of 2. We propose a protocol that applies to all Hadamard graphs. Combined with a result of Frankl, this shows that the players can win on any induced subgraph of G12 having 1609 vertices, with c=12. Moreover combined with a result of Godsil and Newman, our result shows that all Hadamard graphs GN (N ≥ 12) and c=N yield pseudo-telepathy games.

The authors have proposed a 1 m2 single-layer slotted waveguide array consisting of conducting baffles and quartz glass strips positioned in front of the slot aperture, which is referred to as a vacuum window, for microwave plasma excitation. The effect of the complicated outer vacuum window hinders the realization of uniform distribution. In this paper, a unit-cell of the alternating-phase fed single-layer slotted waveguide array with the vacuum window is analyzed by generalized scattering matrix method (GSM)-method of moments (MoM) hybridization analysis, and the array is designed to realize uniform aperture electromagnetic field distribution, where the plasma and the chamber is neglected. The GSM-MoM analysis gives reliable numerical results while the MoM has numerical errors due to singularities of Green's function for a long cavity. Uniform aperture EM field distribution outside of the vacuum window is observed in near field measurements using a 1/5 scale model antenna, and the validity of the analysis and design is verified.

HfOxNy thin films formed by the electron cyclotron resonance (ECR) Ar/N2 plasma nitridation of HfO2 films were investigated for high-k gate insulator applications. HfOxNy thin films formed by the ECR Ar/N2 plasma nitridation (60 s) of 1.5-nm-thick HfO2 films, which were deposited on chemically oxidized Si(100) substrates, were found to be effective for suppressing interfacial layer growth or crystallization during postdeposition annealing (PDA) in N2 ambient. After 900 PDA of for 5 min in N2 ambient, it was found that HfSiON film with a relatively high dielectric constant was formed on the HfOxNy/Si interface by Si diffusion. An equivalent oxide thickness (EOT) of 2.0 nm and a leakage current density of 1.010-3 A/cm2 (at VFB-1 V) were obtained. The effective mobility of the fabricated p-channel metal-insulator-semiconductor field-effect transistor (MISFET) with the HfOxNy gate insulator was 50 cm2/Vs, and the gate leakage current of the MISFET with the HfOxNy gate insulator was found to be well suppressed compared with the MISFET with the HfO2 gate insulator after 900 PDA because of the nitridation of HfO2.

Affine projection algorithms perform well for acoustic echo cancellation and adaptive equalization. Although these algorithms typically provide fast convergence, they are unduly complex when updating the weights of the associated adaptive filter. In this paper, we propose a new subband affine projection (SAP) algorithm and a facile method for its implementation. The SAP algorithm is derived by combining the affine projection algorithm and the subband adaptive structure with the maximal decimation. In the proposed SAP algorithm, the derived weight-updating formula for the subband adaptive filter has a simple form as compared with the normalized least mean square (NLMS) algorithm. The algorithm gives improved convergence and reduced computational complexity. The efficiency of the proposed algorithm for a colored input signal is evaluated experimentally.

Recently, researches and developments for measuring and modeling of the human body have been receiving much attention. Our aim is to reconstruct an accurate shape of a human foot from multiple camera images, which can capture dynamic behavior of the object. In this paper, a foot-shape database is used for accurate reconstruction of human foot. By using Principal Component Analysis, the foot shape can be represented with new meaningful variables. The dimensionality of the data is also reduced. Thus, the shape of object can be recovered efficiently, even though the object is partially occluded in some input views. To demonstrate the proposed method, two kinds of experiments are presented: reconstruction of human foot in a virtual reality environment with CG multi-camera images, and in real world with eight CCD cameras. In the experiments, the reconstructed shape error with our method is around 2 mm in average, while the error is more than 4 mm with conventional volume intersection method.

Refactoring is one of the promising techniques for improving program design by means of program transformation with preserving behavior, and is widely applied in practice. However, it is difficult for engineers to identify how and where to refactor programs, because proper knowledge and skills of a high order are required of them. In this paper, we propose the technique to instruct how and where to refactor a program by using a sequence of its modifications. We consider that the histories of program modifications reflect developers' intentions, and focusing on them allows us to provide suitable refactoring guides. Our technique can be automated by storing the correspondence of modification patterns to suitable refactoring operations. By implementing an automated supporting tool, we show its feasibility. The tool is implemented as a plug-in for Eclipse IDE. It selects refactoring operations by matching between a sequence of program modifications and modification patterns.