Takehito SUZUKI Jiro HIROKAWA Makoto ANDO
This paper presents the analysis and design of a reflection-cancelling transverse slot-pair array antenna with baffles by using the Spectrum of Two-Dimensional Solutions (S2DS) method. For the transverse slot array, the slot spacings with more than one free-space wavelength cause the grating-lobes. The baffles suppress the grating-lobes effectively. A one-dimensional slot array is extracted from the 2D array with in-phase excitation by assuming periodicity in the transversal direction. The uniform excitation over the finite array is synthesized iteratively to demonstrate the fast and accurate results by S2DS. A unit design model with the baffles is introduced to determine the initial parameters of the slot-pairs, which greatly accelerate the iterations process. Experiments at 25.3 GHz demonstrate the suppression of the grating lobes to the level less than -20.0 dB and also the good uniformity of the aperture field distribution.
Riichi KUDO Yasushi TAKATORI Kentaro NISHIMORI Atsushi OHTA Shuji KUBOTA Masato MIZOGUCHI
Multiuser -- Multiple Input Multiple Output (MU-MIMO) techniques were proposed to increase spectrum efficiency; a key assumption was that the Mobile Terminals (MTs) were simple with only a few antennas. This paper focuses on the Block Diagonalization algorithm (BD) based on the equal power allocation strategy as a practical MU-MIMO technique. When there are many MTs inside the service area of the access point (AP), the AP must determine, at each time slot, the subset of the MTs to be spatially multiplexed. Since the transmission performance depends on the subsets of MTs, the user selection method needs to use the Channel State Information (CSI) obtained in the physical layer to maximize the Achievable Transmission Rate (ATR). In this paper, we clarify the relationship between ATR with SU-MIMO and that with MU-MIMO in a high eigenvalue channel. Based on the derived relationship, we propose a new measure for user selection. The new measure, the eigenvalue decay factor, represents the degradation of the eigenvalues in null space compared to those in SU-MIMO; it is obtained from the signal space vectors of the MTs. A user selection method based on the proposed measure identifies the combination of MTs that yields the highest ATR; our approach also reduces the computational load of user selection. We evaluate the effectiveness of user selection with the new measure using numerical formulations and computer simulations.
Yoshitaka HARA Yasuhiro YANO Hiroshi KUBO
This paper proposes a new antenna array calibration technique which uses frequency selection in orthogonal frequency division multiple access (OFDMA)/time division duplexing (TDD) systems. In the proposed method, subbands or frequencies of good channel conditions are initially selected for channel measurements. The relative calibration is performed at the selected subbands, which compensates for mismatch of analogue gains in multiple antennas using the measured uplink and downlink channel parameters. Furthermore, the calibration parameters are interpolated in the frequency domain for the whole bandwidth. The proposed calibration maintains accurate channel reciprocity for the whole bandwidth compared to the conventional calibration which does not use the frequency selection. The proposed calibration technique is effective in exploiting channel reciprocity at both base station and terminals with feasible amount of feedback and low-cost operation.
Seong-Ho JEONG Sung-Hyuck LEE Jongho BANG
Mobility-aware quality of service (QoS) signaling is crucial to provide seamless multimedia services in the ambient environment where mobile nodes may move frequently between different wireless access networks. The mobility of an IP-based node in ambient networks affects routing paths, and as a result, can have a significant impact on the operation and state management of QoS signaling protocols. In this paper, we first analyze the impact of mobility on QoS signaling protocols and how the protocols operate in mobility scenarios. We then propose an efficient mobility-aware QoS signaling protocol which can operate adaptively in ambient networks. The key features of the protocol include the fast discovery of a crossover node where the old and new paths converge or diverge due to handover and the localized state management for seamless services. Our analytical and simulation/experimental results show that the proposed/implemented protocol works better than existing protocols in the IP-based mobile environment.
Hisashi KURASAWA Atsuhiro TAKASU Jun ADACHI
Although a distributed index on a distributed hash table (DHT) enables efficient document query processing in Peer-to-Peer information retrieval (P2P IR), the index costs a lot to construct and it tends to be an unfair management because of the unbalanced term frequency distribution. We devised a new distributed index, named Huffman-DHT, for P2P IR. The new index uses an algorithm similar to Huffman coding with a modification to the DHT structure based on the term distribution. In a Huffman-DHT, a frequent term is assigned to a short ID and allocated a large space in the node ID space in DHT. Throuth ID management, the Huffman-DHT balances the index registration accesses among peers and reduces load concentrations. Huffman-DHT is the first approach to adapt concepts of coding theory and term frequency distribution to load balancing. We evaluated this approach in experiments using a document collection and assessed its load balancing capabilities in P2P IR. The experimental results indicated that it is most effective when the P2P system consists of about 30,000 nodes and contains many documents. Moreover, we proved that we can construct a Huffman-DHT easily by estimating the probability distribution of the term occurrence from a small number of sample documents.
Miki HASEYAMA Makoto TAKIZAWA Takashi YAMAMOTO
In this paper, a new video frame interpolation method based on image morphing for frame rate up-conversion is proposed. In this method, image features are extracted by Scale-Invariant Feature Transform in each frame, and their correspondence in two contiguous frames is then computed separately in foreground and background regions. By using the above two functions, the proposed method accurately generates interpolation frames and thus achieves frame rate up-conversion.
Lilin DAN Yue XIAO Wei NI Shaoqian LI
In this letter, a low complexity transmitter is proposed for the downlinks of orthogonal frequency code division multiplexing (OFCDM) systems. The principle is based on a joint time-frequency spreading and inverse fast Fourier transform (TFS-IFFT), which combines the frequency spreading with partial stages of IFFT, so as to simplify the real-time processing. Compared with the conventional one, the proposed OFCDM transmitter is of lower real-time computational complexity, especially for those with large spreading factor or low modulation level. Furthermore, the proposed TFS-IFFT can also be applied to other frequency spreading systems, such as MC-CDMA, for complexity reduction.
Packet classification categorizes incoming packets into multiple forwarding classes based on pre-defined filters. This categorization makes information accessible for quality of service or security handling in the network. In this paper, we propose a scheme which combines the Aggregate Bit Vector algorithm and the Pruned Tuple Space Search algorithm to improve the performance of packet classification in terms of speed and storage. We also present the procedures of incremental update. Our scheme is evaluated with filter databases of varying sizes and characteristics. The experimental results demonstrate that our scheme is feasible and scalable.
Seungwu HAN Masaaki FUJIYOSHI Hitoshi KIYA
This paper proposes a novel reversible image authentication method that does not memorize the parameters for extracting embedded authentication data from an image. The proposed method once distorts an image to hide data for authentication into the image, it recovers the original image from the distorted image unless tamper is applied to the image, i.e., reversible. By comparing extracted data and data generated from the restored image, this method detects image tampering and further localizes tampered regions by the unit of block. The proposed method extracts hidden data without memorization of parameters used in its algorithm. This feature makes the proposed method practical. Whereas any method memorizing parameters faces severe problems with storage and management of parameters, according to the increase in the number of memorized parameters that is caused by serving accurate tamper localization and/or by applying itself to a huge number of image collection, e.g., video sequences. Simulation results show the effectiveness of the proposed method.
Let us introduce n ( ≥ 2) mappings fi (i=1,,n ≡ 0) defined on reflexive real Banach spaces Xi-1 and let fi:Xi-1 → Yi be completely continuous on bounded convex closed subsets Xi-1(0) ⊂ Xi-1. Moreover, let us introduce n set-valued mappings Fi : Xi-1 Yi → Fc(Xi) (the family of all non-empty compact subsets of Xi), (i=1,,n ≡ 0). Here, we have a fixed point theorem in weak topology on the successively recurrent system of set-valued mapping equations:xi ∈ Fi(xi-1, fi(xi-1)), (i=1,,n ≡ 0). This theorem can be applied immediately to analysis of the availability of system of circular networks of channels undergone by uncertain fluctuations and to evaluation of the tolerability of behaviors of those systems.
Yasuhito ASANO Yuya MIYAWAKI Takao NISHIZEKI
Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.
Ki-Woong SEONG Eui-Sung JUNG Hyung-Gyu LIM Jang-Woo LEE Min-Woo KIM Sang-Hyo WOO Jung-Hyun LEE Il-Yong PARK Jin-Ho CHO
In this paper, the vibration characteristics of stapes, driven by the implanted differential floating mass transducer (DFMT) in the human middle ear, are analyzed by using an electrical model. The electrical model has been simulated by using the PSpice, in which the simulated results are compared with the experimental results by using the fabricated DFMT and the human temporal bones.
Ryota KAWASHIMA Yusheng JI Katsumi MARUYAMA
Networking technologies have recently been evolving and network applications are now expected to support flexible composition of upper-layer network services, such as security, QoS, or personal firewall. We propose a multi-platform framework called FreeNA* that extends existing applications by incorporating the services based on user definitions. This extension does not require users to modify their systems at all. Therefore, FreeNA is valuable for experimental system usage. We implemented FreeNA on both Linux and Microsoft Windows operating systems, and evaluated their functionality and performance. In this paper, we describe the design and implementation of FreeNA including details on how to insert network services into existing applications and how to create services in a multi-platform environment. We also give an example implementation of a service with SSL, a functionality comparison with relevant systems, and our performance evaluation results. The results show that FreeNA offers finer configurability, composability, and usability than other similar systems. We also show that the throughput degradation of transparent service insertion is 2% at most compared with a method of directly inserting such services into applications.
Makoto YAMADA Masashi SUGIYAMA
The ratio of two probability densities is called the importance and its estimation has gathered a great deal of attention these days since the importance can be used for various data processing purposes. In this paper, we propose a new importance estimation method using Gaussian mixture models (GMMs). Our method is an extention of the Kullback-Leibler importance estimation procedure (KLIEP), an importance estimation method using linear or kernel models. An advantage of GMMs is that covariance matrices can also be learned through an expectation-maximization procedure, so the proposed method--which we call the Gaussian mixture KLIEP (GM-KLIEP)--is expected to work well when the true importance function has high correlation. Through experiments, we show the validity of the proposed approach.
In conjunction with a first-order Taylor series approximation of the spatial scanning vector, this letter presents an iterative multiple signal classification (MUSIC) direction-of-arrival (DOA) estimation for code-division multiple access signals. This approach leads to a simple one-dimensional optimization problem to find each iterative optimal search grid. It can not only accurately estimate DOA, but also speed up the estimating process. Computer results demonstrate the effectiveness of the proposed algorithm.
Ukrit WATCHAREERUETAI Tetsuya MATSUMOTO Noboru OHNISHI Hiroaki KUDO Yoshinori TAKEUCHI
We propose a learning strategy for acceleration in learning speed of genetic programming (GP), named hierarchical structure GP (HSGP). The HSGP exploits multiple learning nodes (LNs) which are connected in a hierarchical structure, e.g., a binary tree. Each LN runs conventional evolutionary process to evolve its own population, and sends the evolved population into the connected higher-level LN. The lower-level LN evolves the population with a smaller subset of training data. The higher-level LN then integrates the evolved population from the connected lower-level LNs together, and evolves the integrated population further by using a larger subset of training data. In HSGP, evolutionary processes are sequentially executed from the bottom-level LNs to the top-level LN which evolves with the entire training data. In the experiments, we adopt conventional GPs and the HSGPs to evolve image recognition programs for given training images. The results show that the use of hierarchical structure learning can significantly improve learning speed of GPs. To achieve the same performance, the HSGPs need only 30-40% of the computation cost needed by conventional GPs.
We propose a novel adaptive segment repair mechanism to improve traditional MPLS (Multi-Protocol Label Switching) failure recovery. The proposed mechanism protects one or more contiguous high failure probability links by dynamic setup of segment protection. Simulations demonstrate that the proposed mechanism reduces failure recovery time while also increasing network resource utilization.
Nariman MAHDAVI MAZDEH Mohammad Bagher MENHAJ Heidar Ali TALEBI
This paper presents a novel approach for robust impulsive synchronization of uncertain complex dynamical networks, each node of which possesses chaotic dynamics with different parameters perturbation and external disturbances as well as unknown but bounded network coupling effects. A new sufficient condition is proposed that guarantees the global robust synchronizing of such a network. Finally, the effectiveness of the proposed approach is evaluated by performing simulations on two illustrative examples.
Boundary-based corner detection has been widely applied in spline curve fitting, automated optical inspection, image segmentation, object recognition, etc. In order to obtain good results, users usually need to adjust the length of region of support to resist zigzags due to quantization and random noise on digital boundaries. To automatically determine the length of region of support for corner detection, Teh-Chin and Guru-Dinesh presented adaptive approaches based on some local properties of boundary points. However, these local-property based approaches are sensitive to noise. In this paper, we propose a new approach to find the optimum length of region of support for corner detection based on a statistic discriminant criterion. Since our approach is based on the global perspective of all boundary points, rather than the local properties of some points, the experiments show that the determined length of region of support increases as the noise intensity strengthens. In addition, the detected corners based on the optimum length of region of support are consistent with human experts' judgment, even for noisy boundaries.
To enable fine-grained delegations for proxy re-encryption systems, in AsiaCCS'09, Weng et al.'s introduced the concept of conditional proxy re-encryption (C-PRE), in which the proxy can convert a ciphertext only if a specified condition is satisfied. Weng et al. also proposed a C-PRE scheme, and claimed that their scheme is secure against chosen-ciphertext attack (CCA). In this paper, we show that their scheme is not CCA-secure under their defined security model.