Recently, the integration of wired and wireless networks has become an interesting issue. The introduction of extending Mobile IP to mobile ad hoc networks not only helps the mobile nodes connect to the Internet but also broadens the scope of the ad hoc networks and increases their application. However, these hybrid schemes faces several security problems from the inherent weakness of ad hoc routing. In this paper, we propose a hybrid authentication scheme of Mobile IP assistance for ad hoc routing security. The regular Mobile IP registration scheme has been refined to an ad hoc key-aided version and now incorporates a novel routing packet authentication mechanism in the ad hoc routing operation. A distinct character of this hybrid scheme is that a Mobile Agent can form a secure ad hoc network where the mobile hosts can be authorized and authenticated by the refined Mobile IP registration scheme. In these findings, we shall propose that the mobile hosts can follow a novel routing packet authentication mechanism to secure the routing packets by using the cryptography of the simple geometric properties of lines. Since the novel routing authentication mechanism does not need digital signatures for completing the routing packet integrity, in this hybrid authentication scheme, the cryptographic computation cost on the mobile hosts' side is relatively minimized.

A high-speed transconductance-C-opamp integrator using a current-feedback amplifier is proposed. The integrator has good frequency response compared with a conventional transconductance-C-opamp integrator using a voltage-feedback amplifier. The current-feedback amplifier shifts the second pole of the proposed integrator to the upper frequency. The frequency is proportional to the current gain of the current-feedback amplifier. The proposed integrator can eliminate effects of the parasitics at the output node of the transconductance since the voltage at the node is fixed. One of the circuit examples of the proposed integrator is shown. Its validity is confirmed through HSPICE simulations. The proposed integrator works as predicted up to 260 MHz.

The electrostatic discharge (ESD) effect in GMR heads in the deshunting process is studied in order to prevent the damage in this process. The simulation and experiment results are investigated and compared. It is found from these results that sequences of deshunting process, currently operating, can cause the damage of GMR heads due to the ESD effect, based on the charged device model, CDM. This also shows that the voltage across GMR head, as the tweezers is used, can be raised up to 3.7 V which is about harmful to damage the head. Examples of damage heads confirmed by the SEM are also shown.

In this paper, the channel segregation dynamic channel allocation (CS-DCA) scheme is applied to a multi-hop DS-CDMA virtual cellular network (VCN). After all multi-hop routes are constructed over distributed wireless ports in a virtual cell, the CS-DCA is carried out to allocate the channels to multi-hop up and down links. Each wireless port is equipped with a channel priority table. The transmit wireless port of each link initiates the CS-DCA procedure and selects a channel among available ones using its channel priority table to check. In this paper, the channel allocation failure rate is evaluated by computer simulation. It is shown that CS-DCA reduces remarkably the failure rate compared to FCA. The impact of propagation parameters on the failure rate is discussed.

A new technique called the Dual Parasitic Beam (DPB) technique is proposed to suppress grating lobes in a rectangular waveguide broad wall transverse slot array. This technique involves an extra layer of parasitic strip dipoles that generate the DPB to suppress the grating lobes without opposing the main beam of the original slot linear array. A full wave EM analysis in Method of Moments (MoM) is conducted to compute the coupling excitation coefficients as well as the far field patterns of the slot and dipole currents. Analysis shows that a suitable dimension and arrangement of dipoles are needed to get a desired level of dipole excitations to meet the grating suppression condition. It is found that the grating lobes can be suppressed as much as 15 dB in the presence of the parasitic dipoles. Experiments are conducted to confirm the computed results.

Mobile ad-hoc networks consist of mobile nodes interconnected by multihop path that has no fixed network infrastructure support. Due to the limited bandwidth and resource, and also the frequent changes in topologies, ad-hoc network should consider these features for the provision of security. We present a secure routing protocol based on identity-based signcryption scheme. Since the proposed protocol uses an identity-based cryptosystem, it does not need to maintain a public key directory and to exchange any certificate. In addition, the signcyption scheme simultaneously fulfills both the functions of digital signature and encryption. Therefore, our protocol can give savings in computation cost and have less amount of overhead than the other protocols based on RSA because it uses identity-based signcryption with pairing on elliptic curve. The effectiveness of our protocol is illustrated by simulations conducted using ns-2.

Screen pattern used in offset-printed documents has been one of great obstacles in developing document recognition systems that handle color documents. This paper proposes a selective smoothing method for filtering the screen patterns/noise in high-resolution color document images. Experimental results show that the method yields significant improvements in character pattern extraction.

In order to boost the translation quality of corpus-based MT systems for speech translation, the technique of splitting an input utterance appears promising. In previous research, many methods used word-sequence characteristics like N-gram clues among splitting positions. In this paper, to supplement splitting methods based on word-sequence characteristics, we introduce another clue using similarity based on edit-distance. In our splitting method, we generate candidates for utterance splitting based on N-grams, and select the best one by measuring the utterance similarity against a corpus. This selection is founded on the assumption that a corpus-based MT system can correctly translate an utterance that is similar to an utterance in its training corpus. We conducted experiments using three MT systems: two EBMT systems, one of which uses a phrase as a translation unit and the other of which uses an utterance, and an SMT system. The translation results under various conditions were evaluated by objective measures and a subjective measure. The experimental results demonstrate that the proposed method is valuable for the three systems. Using utterance similarity can improve the translation quality.

The measurement results of clear sky attenuation on an earth-satellite path at frequency Ku band in Laos are described. The measurement results show that diurnal clear sky noise vary with respect to humidity characteristics, which is a significant value in the early morning while low at daytime. The mean difference in variation is about 0.7 dB.

According to the proliferation of ubiquitous computing, various products which contain large-size embedded software have been developed. One of most typical features of embedded software is concurrency of software and hardware factors. That is, software has connected deeply into hardware devices. The existence of various hardware make quality assurance of embedded software more difficult. In order to assure quality of embedded software more effectively, this paper discusses features of embedded software and an effective method for quality assurance for embedded software. In this paper, we first analyze a failure distribution of embedded software and discuss the effects of hardware devices on quality of embedded software. Currently, in order to reduce hardware related faults, huge effort for testing with large number of test items is required. Thus, one of the most important issues for quality assurance of embedded software is how to reduce the cost and effort of software testing. Next, focusing on hardware constraints as well as software specifications in embedded software, we propose an evaluation metrics for determinating important functions for quality of embedded software. Furthermore, by referring to the metrics, undesirable behaviors of important functions are identified as root nodes of fault tree analysis. From the result of case study applying the proposed method to actual project data, we confirmed that test items considering the property of embedded software are constructed. We also confirmed that the constructed test items are appropriate to detect hardware related faults in embedded systems.

An essential issue in designing, operating and managing a modern network is to assure end-to-end QoS from users perspective, and in the meantime to optimize a certain average performance objective from the systems perspective. So in the first part of this paper, we address the above issue by using the rerouting approach, where the objective is to minimize the average cross-network packet delay in virtual circuit networks with the consideration of an end-to-end delay constraint (DCR) for each O-D pair. The problem is formulated as a multicommodity network flow problem with integer routing decision variables, where additional end-to-end delay constraints are considered. As the traffic demands increases over time, the rerouting approach may not be applicable, which results in the necessity of capacity augmentation. Henceforth, the second part of this paper is to jointly consider the link capacity assignment and the routing problem (JCR) at the same time where the objective is to minimize the total link installation cost with considering the average and end-to-end delay constraints. Unlike previous research tackling this problem with a two-phase approach, we propose an integrated approach to considering the routing and capacity assignment at the same time. The difficulties of DCR and JCR result from the integrality nature and particularly the nonconvexity property associated with the end-to-end delay constraints. We propose novel Lagrangean relaxation based algorithms to solve the DCR and the JCR problems. Through computational experiments, we show that the proposed algorithms calculate near-optimal solutions for the DCR problem and outperform previous two-phase approach for the JCR problem under all tested cases.

Press-induced long-period fiber gratings exhibiting strong core-to-cladding mode coupling were formed in photonic crystal fiber. Only one resonance peak was observed over a 600 nm spectral range and the resonant wavelength was tuned over the whole range by tilting a groove plate before pressing the fiber. The resonant wavelength decreased with increasing periodicity of the grating, which was opposite to the trend of the step-index conventional optical fiber. Meanwhile, the resonant wavelength increased with increasing the ambient refractive index, which was also opposite to that of the conventional optical fiber.

In this paper, the previously introduced periodic Fourier transform concept is extended to a two-dimensional case. The relations between the periodic Fourier transform, harmonic series representation and Fourier integral representation are also discussed. As a simple application of the periodic Fourier transform, the scattering of a scalar wave from a finite periodic surface with weight is studied. It is shown that the scattered wave may have an extended Floquet form, which is physically considered as the sum of diffraction beams. By the small perturbation method, the first order solution is given explicitly and the scattering cross section is calculated.

A new interacting multiple model (IMM) algorithm using intelligent input estimation (IIE) is proposed for maneuvering target tracking. In the proposed method, the acceleration level for each sub-model is determined by IIE-the estimation of the unknown target acceleration by a fuzzy system using the relation between the residuals of the maneuvering filter and the non-maneuvering filter. The genetic algorithm (GA) is utilized to optimize a fuzzy system for a sub-model within a fixed range of target acceleration. Then, multiple models are represented as the acceleration levels estimated by these fuzzy systems, which are optimized for different ranges of target acceleration. In computer simulation for an incoming anti-ship missile, it is shown that the proposed method has better tracking performance compared with the adaptive interacting multiple model (AIMM) algorithm.

We have developed an experimental approach that allows us to estimate the performance of a large-scale enterprise network to update routing information. This approach was applied to the integration of the UFJ Bank network system on January 15, 2002. The main characteristic of this approach is the application of a formula that represents the delays in updating routing information that accompany reductions in CPU resources. This procedure consists of two steps: one is to estimate the reduction in the availability of CPU resources caused by forwarding of data packets at a router, and the other is to estimate the levels of CPU resources required for replying to a query about a new route and subsequently updating the routing information. These steps were applied to estimate the performance of the network in terms of routing information convergence. The results of our experiments on the network showed that updating the routing information was possible as long as the average level of CPU utilization during any five-minute period at the routers was less than 40%. We were able to apply this guideline and thus confirm the stability of the UFJ Bank network.

Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate a self-stabilizing distributed approximation for the minimum k-dominating set (KDS) problem in general networks. The minimum KDS problem is a generalization of the well-known dominating set problem in graph theory. For a graph G = (V,E), a set Dk V is a KDS of G if and only if each vertex not in Dk is adjacent to at least k vertices in Dk. The approximation ratio of our algorithm is , where Δ is the maximum degree of G, in the networks of which the minimum degree is more than or equal to k.

Recently, the research on all-optical analog-to-digital conversion (ADC) has been extensively attempted to break through inherently limited operating speed of electronic devices. In this paper, we describe a novel quantization scheme by slicing supercontinuum (SC) spectrum for all-optical ADC and then propose a 2-bit all-optical ADC scheme consisting of the quantization by slicing SC spectrum and the coding by switching pulses with a nonlinear optical loop mirror (NOLM). The feasibility of the proposed quantization scheme was confirmed by numerical simulation. We conducted proof-of-principle experiments of optical quantization by slicing SC spectrum with an arrayed waveguide grating and optical coding by switching pulses with NOLM. We successfully demonstrated optical quantization and coding, which allows us to confirm the feasibility of the proposed 2-bit ADC scheme.

In this paper, we propose a global routing method for 2-layer BGA packages. In our routing model, the global routing for each net is uniquely determined by a via assignment of each net. Our global routing method starts from an initial monotonic via assignment and incrementally improves the via assignment to optimize the total wire length and the wire congestion. Experimental results show that our proposed method generates a better global routing efficiently.

We propose guidelines for LSI-chip design, taking the within-die variations into consideration, and for process quality improvement to suppress the variations. The auto-correlation length, λ, of device variation is shown to be a useful measure to treat the systematic variations in a chip. We may neglect the systematic variation in chips within the range of λ, while σ2 of the systematic variation must be added to σ2 of the random variation outside the λ. The random variations, on the other hand, exhibit complete randomness even in the closest pair transistors. The mismatch variations in transistor pairs were enhanced by 1.41(=) compared with the random variations in single transistors. This requires careful choice of gate size in designing a transistor pair with a minimum size, such as transfer gates in an SRAM cell. Poly-Si gate formation is estimated to be the most important process to ensure the spatial uniformity in transistor current and to enhance circuit performance. Large relative variations are observed for the contact to p+ diffusion, via1 (M1-M2), and via2 (M2-M3) among parameter variations in passive elements. The standard deviations for random variations in via1 and via2 are noticeably widespread, indicating the importance of the via resistance control in BEOL. The spatial frequency power spectrum for within-die random variations is confirmed experimentally, as uniform ('white') with respect to the spatial frequency. To treat the large 'white random noise,' the least-square method with a 4th-order polynomial exhibits a best efficiency as a fitting function for decomposing the raw variation data into systematic part and random part.

We implemented all-fiber delay line using linearly chirped fiber Bragg gratings (CFBG), which can be applicable for reflectometry or optical coherence tomography (OCT). Compared with the previously reported delay lines, the proposed fiber-based optical delay line has in principle novel advantages such as automatic dispersion cancellations without additional treatment and a gain in optical delay that is dependent on parameters of used CFBGs. Dispersion compensation in optical delay line (ODL), which is the indispensable problem in bulk optics based ODL, is demonstrated in fiber by using two identical but reversely ordered CFBGs. Amplified variable optical delay of around 2.5 mm can be obtained by applying small physical stretching of one of CFBGs in the proposed scheme. The operational principles of the all-fiber variable optical delay line, which are based on the distributed reflection characteristic of a CFBG employed, are described. Especially properties such as in-line automatic dispersion cancellation and amplified optical delay under strain are dealt. To demonstrate the properties of the proposed scheme, which is theoretical consequences under assumptions, an all-fiber optical delay line have been implemented using fiber optic components such as fiber couplers and fiber circulators. With the implanted ODL, the group delay and amplified optical delay length was measured with/without strain. The wavelength independent group delay measured within reflection bandwidth of the CFBG has proved the property of automatic dispersion cancellations in the proposed fiber delay line. Optical delay length of 2.5 mm was obtained when we apply small physical stretching to the CFBG by 100 µm and this is expressed by the amplification factor of 25. Amplification factor 25, which is less than theoretical value of 34 due to slipping of fiber in the fiber holder, shows that the proposed scheme can provide large optical delay with applying small physical stretching to the CFBG. We measure slide glass thickness to check the performance of the fiber delay line and the good agreement in measured and physical thickness of slide glass (1 mm thick) validates the potential of proposed delay line in the applications of optical reflectometry and OCT. We also discuss the problem and the solution to improve the performance.