Hyunseuk YOO Chang Hui CHOE Moon Ho LEE
The key weakness of Low-Density Parity Check codes is the complexity of the encoding scheme. The generator matrices can be made by Gaussian elimination of parity check matrices for normal block codes. Richardson succeeded in making parity bits from parity check matrices by the low density computation. In this letter, we focus on the execution of numerical experiments which show that even if the matrix D, which is the part of the Richardson's LDPC matrix, is restricted, proposed LDPC codes is lower complexity than Richardson's LDPC codes. The constraint of D results in reducing complexity from O(n + g2) to O(n) due to the omission of computing inverse matrices of φ and T in Richardson's encoding scheme. All the sub-matrices in parity check matrix are composed of Circulant Permutation Matrices based on Galois Fields.
Nimit BOONPIROM Yothin PREMPRANEERACH Kitti PAITHOONWATANAKIJ Kraison AUNCHALEEVARAPAN Shuichi NITTA
This paper reduces system imbalance by replacing the single-switch converter with a synchronized double-switch converter based on two active switches technique and hybrid balance technique, including active balance and passive balance for common mode noise reduction. The system balance is experimentally evaluated by the common mode rejection ratio (CMRR). Finally, examples show that the CMRR of the single-switch converter is improved from 1.67 dB to 32.04 dB when the double-converter with two active switches technique is applied and to 41.5 dB when the double-switch converter with hybrid balance technique is applied.
To achieve scalability and security, large networks are often structured hierarchically as a collection of domains. In hierarchical networks, the topology and QoS parameters of a domain have to be first aggregated before being propagated to other domains. However, topology aggregation may distort useful information. Although spanning tree aggregation can perfectly encode attribute information of symmetric networks, it can not be applied to asymmetric networks directly. In this paper, we propose a spanning tree based attribute aggregation method for asymmetric networks. The time complexity of the proposed method and the space complexity of its resulted aggregated topology are the same with that of the spanning tree aggregation method in symmetric networks. This method can guarantee that the attributes of more than half of the links in the networks are unaltered after aggregation. Simulation results show that the proposed method achieves the best tradeoff between information accuracy and space complexity among the existing asymmetric attribute aggregation methods.
Wataru IMAJUKU Takuya OHARA Yoshiaki SONE Ippei SHAKE Yasunori SAMESHIMA Masahiko JINNO
The objective of this paper is to survey the Generalized Multi-Protocol Label Switching (GMPLS) based recovery technology for optical transport networks. This paper introduces standardization activities of the GMPLS based recovery technology in the Internet Engineering Task Force (IETF), and recent progress of related experiments. In addition, this paper extracts requirements for the GMPLS based recovery technology through the evaluation of existing network elements, which can be client nodes of the optical transport networks. The results of field evaluations on the GMPLS based recovery technology are also introduced in this paper. Then, this paper addresses the issues for future deployment of the GMPLS based recovery technology for the optical transport networks.
Dong Il KIM Chang-Mook CHOI Rui LI Dae Hee LEE
In this paper, we use Permalloy and CPE (Permalloy: CPE=70:30 wt.%) to fabricate the electromagnetic (EM) wave absorber for W-band radars. The EM wave absorption abilities at different thicknesses were simulated using material properties of the EM wave absotber, and an EM wave absorber was manufactured based on the simulated design. The comparisons of simulated and measured results show good agreement. Measurements show that a 1.15 mm thick EM wave absorber has absorption ability higher than 18 dB at 94 GHz for missile guidance radars, and a 1.4 mm EM wave absorber has absorption ability higher than 20 dB at 76 GHz for collision-avoidance radars.
Atsushi MATSUI Simon CLIPPINGDALE Takashi MATSUMOTO
This paper proposes probabilistic pruning techniques for a Bayesian video face recognition system. The system selects the most probable face model using model posterior distributions, which can be calculated using a Sequential Monte Carlo (SMC) method. A combination of two new pruning schemes at the resampling stage significantly boosts computational efficiency by comparison with the original online learning algorithm. Experimental results demonstrate that this approach achieves better performance in terms of both processing time and ID error rate than a contrasting approach with a temporal decay scheme.
Xin FAN Hisashi MIYAMORI Katsumi TANAKA Mingjing LI
As the amount of recorded TV content is increasing rapidly, people need active and interactive browsing methods. In this paper, we use both text information from closed captions and visual information from video frames to generate links to enable users to easily explore not only the original video content but also augmented information from the Web. This solution especially shows its superiority when the video content cannot be fully represented by closed captions. A prototype system was implemented and some experiments were carried out to prove its effectiveness and efficiency.
Tomohiro YOSHIHARA Dai KOBAYASHI Haruo YOKOTA
In this paper, we propose a new concurrency control protocol for parallel B-tree structures capable reducing the cost of structure-modification-operation (SMO) compared to the conventional protocols such as ARIES/IM and INC-OPT. We call this protocol the MARK-OPT protocol, since it marks the lowest SMO occurrence point during optimistic latch-coupling operations. The marking reduces middle phases for spreading an X latch and removes needless X latches. In addition, we propose three variations of the MARK-OPT, which focus on tree structure changes from other transactions. Moreover, the proposed protocols are deadlock-free and satisfy the physical consistency requirement for B-trees. These indicate that the proposed protocols are suitable as concurrency control protocols for B-tree structures. To compare the performance of the proposed protocols, the INC-OPT, and the ARIES/IM, we implement these protocols on an autonomous disk system adopting the Fat-Btree structure, a form of parallel B-tree structure. Experimental results in various environments indicate that the proposed protocols always improve system throughput, and 2P-REP-MARK-OPT is the most useful protocol in high update environment. Additionally, to mitigate access skew, data should be migrated between PEs. We also demonstrate that MARK-OPT improves the system throughput under the data migration and reduces the time for data migration to balance load distribution.
Ruben FUENTES-FERNANDEZ Jorge J. GOMEZ-SANZ Juan PAVON
The specification of a Multi-Agent System (MAS) involves the identification of a large number of entities and their relationships. This is a non-trivial task that requires managing different views of the system. Many problems concerning this issue originate in the presence of contradictory goals and tasks, inconsistencies, and unexpected behaviours. Such troublesome configurations should be detected and prevented during the development process in order to study alternative ways to cope with them. In this paper, we present methods and tools that support the management of contradictions during the analysis and design of MAS. Contradiction management in MAS has to consider both individual (i.e. agent) and social (i.e. organization) aspects, and their dynamics. Such issues have already been considered in social sciences, and more concretely in the Activity Theory, a social framework for the study of interactions in activity systems. Our approach applies knowledge from Activity Theory in MAS, especially its base of contradiction patterns. That requires a formalization of this social theory in order to be applicable in a software engineering context and its adaptation to agent-oriented methodologies. Then, it will be possible to check the occurrence of contradiction patterns in a MAS specification and provide solutions to those situations. This technique has been validated by implementing an assistant for the INGENIAS Development Kit and has been tested with several case studies. This paper shows part of one of these experiments for a web application.
Takeshi KUMAKI Masakatsu ISHIZAKI Tetsushi KOIDE Hans Jurgen MATTAUSCH Yasuto KURODA Hideyuki NODA Katsumi DOSAKA Kazutami ARIMOTO Kazunori SAITO
This paper reports an efficient Discrete Cosine Transform (DCT) processing method for images using a massive-parallel memory-embedded SIMD matrix processor. The matrix-processing engine has 2,048 2-bit processing elements, which are connected by a flexible switching network, and supports 2-bit 2,048-way bit-serial and word-parallel operations with a single command. For compatibility with this matrix-processing architecture, the conventional DCT algorithm has been improved in arithmetic order and the vertical/horizontal-space 1 Dimensional (1D)-DCT processing has been further developed. Evaluation results of the matrix-engine-based DCT processing show that the necessary clock cycles per image block can be reduced by 87% in comprison to a conventional DSP architecture. The determined performances in MOPS and MOPS/mm2 are factors 8 and 5.6 better than with a conventional DSP, respectively.
Kritsada SRIPHAEW Thanaruk THEERAMUNKONG
Assessment of discovered patterns is an important issue in the field of knowledge discovery. This paper presents an evaluation method that utilizes citation (reference) information to assess the quality of discovered document relations. With the concept of transitivity as direct/indirect citations, a series of evaluation criteria is introduced to define the validity of discovered relations. Two kinds of validity, called soft validity and hard validity, are proposed to express the quality of the discovered relations. For the purpose of impartial comparison, the expected validity is statistically estimated based on the generative probability of each relation pattern. The proposed evaluation is investigated using more than 10,000 documents obtained from a research publication database. With frequent itemset mining as a process to discover document relations, the proposed method was shown to be a powerful way to evaluate the relations in four aspects: soft/hard scoring, direct/indirect citation, relative quality over the expected value, and comparison to human judgment.
An entire dual-mode transceiver capable of both the conventional GFSK-modulated Bluetooth and the Medium-Rate π/4-DQPSK-modulated Bluetooth has been investigated and reported. The transmitter introduces a novel two-point-modulated polar-loop technique without the global feedback to realize reduced power consumption, small chip area and also high modulation accuracy. The receiver shares all the circuits for both operating modes except the demodulators and also features a newly-proposed cancellation technique of the carrier-frequency offset. The transceiver has been confirmed by system or circuit simulations to meet all the dual-mode Bluetooth specifications. The simulation results show that the transmitting power can be larger than 10 dBm while achieving the total power efficiency above 30% and also RMS DEVM of 0.050. It was also confirmed by simulation that the receiver is expected to attain the sensitivity of -85 dBm in both modes while satisfying the image-rejection and the blocker-suppression specifications. The proposed transceiver will provide a low-cost, low-power single-chip RF-IC solution for the next-generation Bluetooth communication.
Maduranga LIYANAGE Iwao SASASE
We propose an effective subcarrier allocation scheme for multiuser orthogonal frequency division multiple access (OFDMA) system in the downlink transmission with low computational complexity. In the proposed scheme, by taking multiple attributes of a user's channel, such as carrier gain decrease rate and variation from the mean channel gain of the system, to determine a rank for the user, subcarriers are then allocated depending on the individual user's rank. Different channel characteristics are used to better understand a user's need for subcarriers and hence determine a priority for the user. We also adopt an attribute weighing scheme to enhance the performance of the proposed scheme. The scheme is computationally efficient, since it avoids using iterations for the algorithm convergence and also common water-filling calculations that become more complex with increasing system parameters. Low complexity is achieved by allocating subcarriers to users depending on their determined rank. Our proposed scheme is simulated in comparison with other mathematically efficient subcarrier allocation schemes as well as with a conventional greedy allocation scheme. It is shown that the proposed method demonstrates competitive results with the simulated schemes.
Nguyen Hoang HAI Yoshinori NAMIHIRA Feroza BEGUM Shubi KAIJAGE S.M. Abdur RAZZAK Tatsuya KINJO Nianyu ZOU
This paper reports a novel design in Photonic Crystal Fibers (PCFs) with nearly zero ultra-flattened dispersion characteristics. We describe the chromatic dispersion controllability taking non-uniform air hole structures into consideration. Through optimizing non-uniform air hole structures, the ultra-flattened zero dispersion PCFs can be efficiently designed. We show numerically that the proposed non-uniform air cladding structures successfully archive flat dispersion characteristics as well as extremely low confinement losses. As an example, the proposed PCF with flattened dispersion of 0.27 ps/(nmkm) from 1.5 µm to 1.8 µm wavelength with confinement losses of less than 10-11 dB/m. Finally, we point out that full controllability of the chromatic dispersion and confinement losses, along with the fabrication technique, are the main advantages of the proposed PCF structure.
This letter presents delayed perturbation bounds (DPBs) for receding horizon controls (RHCs) of continuous-time systems. The proposed DPBs are obtained easily by solving convex problems represented by linear matrix inequalities (LMIs). We show, by numerical examples, that the RHCs have larger DPBs than conventional linear quadratic regulators (LQRs).
Peter SZEGEDI Tomasz GAJEWSKI Wataru IMAJUKU Satoru OKAMOTO
In this paper the current trends in the optical networking including the physical components, technologies and control architectures are discussed. The possible interaction schemes and implementation models of the automatic communication between applications and network as well as between ASON/GMPLS based network domains are proposed. Finally, the related research activities based on simulation results of control plane dimensioning are illustrated and real test bed experiments on OIF worldwide interoperability demonstration and the ongoing European IST project MUPBED are disseminated.
Bijan JABBARI Shujia GONG Eiji OKI
This paper considers optical transport and packet networks and discusses the constraints and solutions in computation of traffic engineering paths. We categorize the constraints into prunable or non-prunable classes. The former involves a simple metric which can be applied for filtering to determine the path. The latter requires a methodic consideration of more complicated network element attributes. An example of this type of constraints is path loss in which the metric can be evaluated only on a path basis, as opposed to simply applying the metric to the link. Another form of non-prunable constraint requires adaptation and common vector operation. Examples are the switching type adaptation and wavelength continuity, respectively. We provide possible solutions to cases with different classes of constraints and address the problem of path computation in support of traffic engineering in multi-layer networks where a set of constrains are concurrently present. The solutions include the application of channel graph and common vector to support switching type adaptation and label continuity, respectively.
Eun Jung KO Hyung Jik LEE Jeun Woo LEE
In order to prepare the health care industry for an increasingly aging society, a ubiquitous health care infrastructure is certainly needed. In a ubiquitous computing environment, it is important that all applications and middleware should be executed on an embedded system. To provide personalized health care services to users anywhere and anytime, a context-aware framework should convert low-level context to high-level context. Therefore, ontology and rules were used in this research to convert low-level context to high-level context. In this paper, we propose context modeling and context reasoning in a context-aware framework which is executed on an embedded wearable system in a ubiquitous computing environment for U-HealthCare. The objective of this research is the development of the standard ontology foundation for health care services and context modeling. A system for knowledge inference technology and intelligent service deduction is also developed in order to recognize a situation and provide customized health care service. Additionally, the context-aware framework was tested experimentally.
Nobuhiko SHINOHARA Keiko TAKEUCHI Hisashi OSAWA Yoshihiro OKAMOTO Yasuaki NAKAMURA Atsushi NAKAMOTO Kenji MIURA Hiroaki MURAOKA Yoshihisa NAKAMURA
The long-term bit error rate (BER) performance of partial response maximum likelihood (PRML) system using an adaptive equalizer in a perpendicular magnetic recording (PMR) channel with thermal decay is studied. A thermal decay model based on the experimental data giving the amplitude change of reproducing waveforms with the elapsed time for CoPtCr-SiO2 PMR medium is obtained. The BER performance of PR1ML channel for the 16/17(0,6/6) run-length-limited (RLL) code is evaluated by computer simulation using the model. The relationship between the ratio RJ of the jitter-like media noise power to the total noise power at the reading point and the required SNR to achieve a BER of 10-4 is also obtained and the performance is compared with that of the conventional equalization. The results show that the significant improvement in SNR by utilizing the adaptive equalization is recognized over all RJ compared with the conventional equalization.
The article describes recent adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit the spatial dimension, while it also evolves locally to account for the time dimension. Algorithms of the least-mean-squares and least-squares types are described. Both incremental and diffusion strategies are considered.