The recent sight system requires high stabilization functions for the longer range of observation and the higher kill probability. To this end, it is necessary to compensate rotational disturbances which are not stabilized with the conventional 2-axes stabilization system. This paper proposes a simple method on the rotational motion estimation for the stabilization of the sight system.

This paper presents a technique for designing a dielectric Electronically Steerable Parasitic Array Radiator (Espar) antenna to achieve miniaturization of the conventional Espar antenna. The antenna's size is reduced by immersing the central active element in a dielectric cylinder, mounting the surrounding planar parasitic elements at the circumference of the cylinder, and decreasing the radius of the ground skirt to that of the parasitic elements. An example of a polycarbonate (εr = 2.9 + j0.006) Espar antenna operating at 2.484 GHz is optimised by using a genetic algorithm in conjunction with an FEM-based cost function. The designed antenna generates a half-power beam width of 78and a main lobe that elevates at an angle of only 5from the horizontal plane. The designed antenna is also fabricated and measured. Good agreement between the measurement and simulation results is obtained. We reduce the size of the designed Espar antenna to 1/8 the size of its conventional counterpart while achieving a 12improvement in half-power beam width.

This paper presents analysis results on finite-impulse response (FIR) channel estimation used for the equalization in Advanced Television Systems Committee digital television receivers. While channel estimation results have been effectively used for the equalization, the conditions of sufficient order and high signal-to-noise ratio (SNR) were assumed in most cases. To compensate for these unrealistic assumptions, we consider diverse probable conditions for channel estimation, such as reduced order and low SNRs, and then theoretically analyze each estimation case. The analysis shows that the adaptive FIR channel estimator provides an unbiased estimation and matches well its corresponding channel coefficients irrespective of the number of taps of the estimator and the non-causality of the unknown channel. Simulation results verify our analysis on the estimation of terrestrial DTV channels.

This paper proposes an enhanced RBF network that enhances learning algorithms between input layer and middle layer and between middle layer and output layer individually for improving the efficiency of learning. The proposed network applies ART2 network as the learning structure between input layer and middle layer. And the auto-tuning method of learning rate and momentum is proposed and applied to learning between middle layer and output layer, which arbitrates learning rate and momentum dynamically by using the fuzzy control system for the arbitration of the connected weight between middle layer and output layer. The experiment for the classification of number patterns extracted from the citizen registration card shows that compared with conventional networks such as delta-bar-delta algorithm and the ART2-based RBF network, the proposed method achieves the improvement of performance in terms of learning speed and convergence.

This letter presents a method to extract vascular structures from magnetic resonance angiography (MRA) volumes based on the geometric variational principle. A minimal function is coupled with flux maximizing geometric flows and the geodesic active surface model while the geometrical description of vessel structure is added. Furthermore, the level set method represents the surface evolution as it is intrinsic and topologically flexible.

An electromagnetic (EM) inverse scattering problem that involves the reconstruction of microwave images for dielectric objects is considered in this paper. This ill-posed and nonlinear problem is treated as a global optimization problem, and is solved by the application of micro-genetic algorithm (m-GA). The reconstructed results obtained by m-GA have shown that it is an effective technique for microwave imaging and satisfactory performance is achieved when compared with the conventional genetic algorithms.

This paper presents an analysis of the cavity length modulation of a Z-cut quartz etalon equipped with a weight for Laser Diode (LD) wavelength lockers. The electro-optic effect, piezoelectric effect and photo-elastic effect are considered, and the mechanical movement of the etalon with a weight is analyzed by using a mechanical circuit. Approximate equations that clearly explain the mechanical force, mechanical resonance frequency, and Q factor of the mechanical resonance are obtained. The mechanism for improving the modulation efficiency by placing a weight is clarified. We also compare the analysis with experimental results, and show that most of the experimental values are in accord with the calculated values.

When a fixed free-running crystal is used for sampling time generation at a DMT receiver, Inter-Symbol Interference (ISI) and Inter-Carrier Interference (ICI) are introduced by sampling time error. The ICI becomes more serious as the DMT symbol length increases. In this letter, the effects of sampling clock offset are investigated in the time domain using a new notion of Inter-sample Interference (IsI) instead of ISI and ICI. Based on the IsI analysis, we propose a new frequency domain timing error correction scheme.

We investigate the impact of electrical band-limitation on the transmission performance of both carrier suppressed return-to-zero (CSRZ) and CSRZ differential phase shift keying (CSRZ-DPSK) format for high spectral efficiency DWDM systems. Results show that electrical band-limitation improves signal spectral compactness, leading to reduced linear crosstalk and improved tolerance against chromatic dispersion in optical fiber link without causing any degradation to fiber nonlinearity tolerance. In addition, it is shown that the electrical band-limitation is more efficient to CSRZ-DPSK signal than CSRZ signal in reducing signal degradation caused by linear crosstalk and fiber chromatic dispersion.

In this paper, we propose a proof scheme of shuffle, which is an honest verifier zero-knowledge proof of knowledge such as the protocols by Groth and Furukawa. Unlike the previous schemes proposed by Furukawa-Sako, Groth, and Furukawa, our scheme can be used as the shuffle of the elements encrypted by Paillier's encryption scheme, which has an additive homomorphic property in the message part. The ElGamal encryption scheme used in the previous schemes does not have this property.

Cyberworlds are being formed in cyberspaces as computational spaces. Now cyberspaces are rapidly expanding on the Web either intentionally or spontaneously, with or without design. Widespread and intensive local activities are melting each other on the web globally to create cyberworlds. The major key players of cyberworlds include e-finance that trades a GDP-equivalent a day and e-manufacturing that is transforming industrial production into Web shopping of product components and assembly factories. Lacking proper theory and design, cyberworlds have continued to grow chaotic and are now out of human understanding and control. This research first presents a generic theoretical framework and design based on algebraic topology, and also provides an axiomatic approach to theorize the potentials of cyberworlds.

A new edge-coloring algorithm for bipartite graphs is presented. This algorithm, based on the framework of the O(m log d + (m/d) log (m/d) log d) algorithm by Makino-Takabatake-Fujishige and the O(m log m) one by Alon, finds an optimal edge-coloring of a bipartite graph with m edges and maximum degree d in O(m log d + (m/d) log (m/d)) time. This algorithm does not require elaborate data structures, which the best known O(m log d) algorithm due to Cole-Ost-Schirra depends on.

L-convex functions are nonlinear discrete functions on integer points that are computationally tractable in optimization. In this paper, a discrete Hessian matrix and a local quadratic expansion are defined for L-convex functions. We characterize L-convex functions in terms of the discrete Hessian matrix and the local quadratic expansion.

This paper reviews the approximation principle of Physical Optics in view of diffraction theory. Two key error factors are identified for PO, that is, 1) errors in edge diffraction coefficients and 2) fictitious penetrating rays. Improved methods named PO-AF and PTD-AF are proposed as the methods which suppress the fictitious penetrating rays from PO and PTD respectively. In deep shadow regions of the reflector antennas, PO-AF and PDT-AF approach to PO-EEC and UTD respectively, while the continuity is assured. The effectiveness is numerically demonstrated for two dimensional scatterers.

This paper reports our study of how to gain consistency of states in a ball-game typed Distributed Virtual Environment (DVE) with lag, in peer-to-peer (P2P) architecture. That is, we are studying how to reduce in real-time the difference of states between the participating terminals in a virtual ball game caused by transmission lag or update interval. We are also studying how to control shared objects in real-time in a server-less network architecture. Specifically, a priority field called Allocated Topographical Zone (AtoZ) is used in P2P for DVE. By implementing this function, each terminal can compute which avatar holds the ownership of a shared object by calculating mutually the state of the local avatar predicted by the remote terminals. The region for ownership determined by AtoZ allows an avatar to access and control an object dominantly, so that a geometrical property is dynamically changed depending upon the relative arrangement between the object and avatars. Moreover considering the critical case, defined as inconsistent phenomena between the peers, caused by the network latency, a stricter ownership determination algorithm, called dead zone is introduced. By using these protocols in combination, a robust and effective scheme is achieved for a virtual ball game. As an example of the application, a real-time networked doubles air-hockey is implemented for evaluation of the influence of these protocols on interactivity and on consistency.

The XTR public key cryptosystem was introduced in 2000. XTR is suitable for a variety of environments including low-end smart cards, and is regarded as an excellent alternative to RSA and ECC. Moreover, it is remarked that XTR single exponentiation (XTR-SE) is less susceptible than usual exponentiation routines to environmental attacks such as the timing attack and the differential power analysis (DPA). This paper investigates the security of side channel attack (SCA) on XTR. In this paper, we show the immunity of XTR-SE against the simple power analysis if the order of the computation of XTR-SE is carefully considered. In addition, we show that XTR-SE is vulnerable to the data-bit DPA, the address-bit DPA, the doubling attack, the modified refined power analysis, and the modified zero-value attack. Moreover, we propose some countermeasures against these attacks. We also show experimental results of the efficiency of the countermeasures. From our implementation results, if we compare XTR with ECC with countermeasures against "SCAs," we think XTR is as suitable to smart cards as ECC.

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.

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.

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.

Due to the pruning and joining of members, multicast groups are dynamic. Both the topology and the total number of links change during multicast sessions, and the multicast performance, measured in terms of the bandwidth consumption, will change accordingly. In this paper, we investigate the dynamic performance of multicast communication with homogeneous packet loss probability; indeed, we evaluate the effects of the pruning of receivers and of subnets, after which we find the optimal placements of repair servers. A new 3-phase algorithm for adapting the optimal repair server placements to the dynamic changes of network topologies is presented and analyzed.