In adaptive motion estimation, spatial-temporal correlation based motion type inference has been recognized as an effective way to guide the motion estimation strategy adjustment according to video contents. However, the complexity and the reliability of those methods remain two crucial problems. In this paper, a motion vector field model is introduced as the basis for a new spatial-temporal correlation based motion type inference method. For each block, Full Search with Adaptive Search Window (ASW) and Three Step Search (TSS), as two search strategy candidates, can be employed alternatively. Simulation results show that the proposed method can constantly reduce the dynamic computational cost to as low as 3% to 4% of that of Full Search (FS), while remaining a closer approximation to FS in terms of visual quality than other fast algorithms for various video sequences. Due to its efficiency and reliability, this method is expected to be a favorable contribution to the mobile video communication where low power real-time video coding is necessary.

This paper addresses the variation of the attenuation characteristics of the Specific Absorption Rate (SAR) in a lossy medium as a function of the distance between an antenna and the medium with different EM-source sizes. Analysis and measurements were performed using a dipole antenna at 900 MHz and a COST244 cubic phantom. From this, an empirical equation has been derived, representing the attenuation characteristics of the SAR. The equation takes into consideration an energy loss due to the spatial spread of electromagnetic waves. In the case where an antenna is placed more than λ/2π away from the medium, the attenuation characteristics of the SAR are those obtained from plane waves in the lossy medium. In the case where a half-wavelength dipole antenna is located close to the medium, at a distance of less than λ/2π, the attenuation characteristics of the SAR are calculated from an equation that includes a loss caused by the spread of energy as a cylindrical wave. Moreover, when the length of antenna is short, it is found that a spatial attenuation factor appropriate to a spherical wave should be taken into account.

In a direct conversion receiver for mobile communication, it is important to reduce power dissipation. Because a low pass filter in a direct conversion receiver must suppress adjacent channel signals, a high order and high power dissipation is often required in the low pass filter. We propose a new phase compensation technique suitable for a low power transconductor used in a GmC filter as a low pass filter. The new phase compensation technique reduces 10% of power dissipation.

This paper describes a method of extending the signal frequency bandwidth while increasing the stability of a CMOS transimpedance amplifier (TIA). The TIA consists of three inverting amplifiers in a series, and a high-pass filter plus a non-inverting amplifier that are connected to the last two inverting amplifiers stated above in parallel. The TIA is fabricated using a 0.35 µm CMOS process and realizes stable conversion of 60-dBΩ from the photodiode current to the output voltage with more than 500 MHz of signal frequency bandwidth and 60 mW of power consumption from a 3.3 V supply voltage.

It is not always possible to find a global parse for an input sentence owing to problems such as errors of a sentence, incompleteness of lexicon and grammar. Partial parsing is an alternative approach to respond to these problems. Partial parsing techniques try to recover syntactic information efficiently and reliably by sacrificing completeness and depth of analysis. One of the difficulties in partial parsing is how the grammar might be automatically extracted. In this paper we present a method of automatically extracting partial parsing rules from a tree-annotated corpus using the decision tree method. Our goal is deterministic global parsing using partial parsing rules, in other words, to extract partial parsing rules with higher accuracy and broader expansion. First, we define a rule template that enables to learn a subtree for a given substring, so that the resultant rules can be more specific and stricter to apply. Second, rule candidates extracted from a training corpus are enriched with contextual and lexical information using the decision tree method and verified through cross-validation. Last, we underspecify non-deterministic rules by merging substructures with ambiguity in those rules. The learned grammar is similar to phrase structure grammar with contextual and lexical information, but allows building structures of depth one or more. Thanks to automatic learning, the partial parsing rules can be consistent and domain-independent. Partial parsing with this grammar processes an input sentence deterministically using longest-match heuristics, and recursively applies rules to an input sentence. The experiments showed that the partial parser using automatically extracted rules is not only accurate and efficient but also achieves reasonable coverage for Korean.

We have developed a model for circuit-simulation which describes the MOSFET region from pinch-off to drain contact based on the surface potential. The model relates the surface-potential increase beyond the pinch-off point to the channel/drain junction profile by applying the Gauss law with the assumption that the lateral field is greater than the vertical one. Explicit equations for the lateral field and the pinch-off length are obtained, which take the potential increase in the drain overlap region into account. The model, as implemented into a circuit simulator, correctly reproduces measured channel conductance and overlap capacitance for 100 nm pocket-implant technologies as a function of bias condition and gate length.

In this paper, we propose a new reinforcement learning scheme called CHQ that could efficiently acquire appropriate policies under partially observable Markov decision processes (POMDP) involving probabilistic state transitions, that frequently occurs in multi-agent systems in which each agent independently takes a probabilistic action based on a partial observation of the underlying environment. A key idea of CHQ is to extend the HQ-learning proposed by Wiering et al. in such a way that it could learn the activation order of the MDP subtasks as well as an appropriate policy under each MDP subtask. The goodness of the proposed scheme is experimentally evaluated. The result of experiments implies that it can acquire a deterministic policy with a sufficiently high success rate, even if the given task is POMDP with probabilistic state transitions.

SOBER-128 is a stream cipher designed by Rose and Hawkes in 2003. It can be also used for generating Message Authentication Codes (MACs) and an authenticated encryption. The developers claimed that it is difficult to forge MACs generated by both functions of SOBER-128, though, the security assumption in the proposal paper is not realistic in some instances. In this paper, we examine the security of these message authentication mechanisms of SOBER-128 under security channel model. As a result, we show that both a MAC generation and an authenticated encryption are vulnerable against differential cryptanalysis. The success probabilities of the MAC forgery attack are estimated at 2-6 and 2-27 respectively. In addition, we show that some secret bits are revealed if a key is used many times.

Among recent trends in Quality of Service (QoS) provisioning in the Internet is the Differentiated Services Architecture, termed DiffServ. The successful deployment of Diffserv to provide a premium QoS guarantees to network traffic requires an effective admission control mechanism, which needs to be scalable and relatively simple to implement. In this paper we present a QoS network framework with novel and effective measurement-based resource management and admission control mechanisms. The mechanism is based on the characteristics of measured arrival and departure traffic. Those characteristics are captured via a passive monitoring. We implement the mechanism at the edge routers of a DiffServ Domain. The admission control mechanism is only executed at the edge routers and doesn't require any signaling between inner routers. The mechanism does not depend on the underlying network topology or any specifications of the cross traffic present in the domain. Therefore the mechanism is scalable. In addition, the proposed approach does not require any traffic policing mechanism at the entrance of the network. This approach can provide the statistical QoS guarantees to a variety of service classes within a DiffServ domain. We show that the proposed framework can provide a high degree of network resource sharing among multiple traffic classes while satisfying their QoS requirements. To evaluate the effectiveness of the proposed framework, we perform a set of simulations on a number of bursty video traffic sources.

In recent years, there is an increasing trend of using biometric identifiers for personal authentication. Encouraged by advances in smart card technologies, the fingerprint matching gets increasingly embedded into smart cards for an effective personal authentication method. However, current generation of low cost smart cards are usually equipped with limited hardware resources such as an 8-bit or 16-bit microcontroller. The fingerprint matching typically is a time consuming, computationally intensive and costly process. Therefore, it is still a challenge to integrate the fingerprint matching into a smart card. In this paper, we present a fast memory-efficient fingerprint matching using minutia ridge shape feature. This feature offers advantages of smaller template size, smaller memory requirement, faster matching time and robust matching against image distortion over conventional minutiae-based feature. The implementation result shows that the proposed method can be embedded in smart cards for a real-time Match-on-Card system.

Currently, space division multiplexing (SDM), where individual data streams are transmitted from different antennas simultaneously, is expected to be a promising technology for achieving a high data rate within a limited frequency band in a multiple-input multiple-output channel. In this paper, transmitter and receiver architectures of SDM applications are described, and performance improvement with the increase of data streams is shown referring to results of computer simulations. In addition, channel coded systems are also evaluated.

This paper provides an overview of research in channel modeling for multiple-input multiple-output (MIMO) data transmission focusing on a radio wave propagation. A MIMO channel is expressed as an equivalent circuit with a limited number of eigenpaths according to the singular-value decomposition (SVD). Each eigenpath amplitude depends on the propagation structure not only of the path direction profiles for both transmission and reception points but also of intermediate regions. Inherent in adaptive control is the problem of instability as a hidden difficulty. In this paper these issues are addressed and research topics on MIMO from a radio wave propagation viewpoint are identified.

In wideband code division multiaccess (W-CDMA) uplink, immediate accommodation of high data rate packet causes power control error and makes active users' signal quality deteriorate in a beginning of a frame. To avoid the deterioration, we propose a new radio resource management (RRM) which accommodates high data rate traffic gradually in several frames. The proposed RRM reduces the signal quality deterioration in the beginning of the frame. We also propose an effective power control scheme, where a power increase command is sent to all users before a new high data rate packet is transmitted. Simulation results show that joint utilization of the proposed two methods is effective to keep signal quality good for all users.

We describe a transmission system having a data rate of 160 Gbit/s based on the RZ-DPSK modulation format. The 160 Gbit/s single-polarization signal is generated by optical time division multiplexing technology using the base rate of 40 Gbit/s. The setup is explained and results are given with a special focus on the stability issue of the transmission system. The pulse source, the optical gate for demultiplexing, the clock recovery and the balanced photo-detector are based on semiconductor components. We present long-term bit error measurements (10 hours) over two different long-haul fiber links. The first link comprises 3106 km standard single mode fiber and uses a PMD mitigation scheme. The other link consists of 4 dispersion managed 80 km fiber spans without the need for an additional PMD compensation. Using EDFA amplification solely and also no FEC, error-free operation was achieved over several hours, only limited by slow drift effects in the laboratory system.

Optical Burst Switching (OBS) has been developed as an efficient switching technique to exploit the capacity provided by Wavelength Division Multiplexing (WDM) transmission technology for the next generation optical Internet. One critical design issue in OBS is how to provide Quality-of-Service (QoS) on optical networks. In order to provide the service differentiation, we propose in this paper a buffer allocation algorithm to schedule bursts at the edge OBS nodes, a bandwidth allocation algorithm and a Fiber Delay Line (FDL) allocation algorithm to schedule bursts at the core OBS nodes. We also introduce a new burst assembly technique in which the burst is generated either when the sum of the collected packet sizes reaches the maximum threshold or when the burst assembling time reaches the timeout limit. Our simulation results show that the proposed algorithms achieve the controllable burst loss probability for different service classes. The bandwidth allocation algorithm performs very well at the core OBS nodes in terms of the low loss probability.

This paper proposes an iterative parallel genetic algorithm with biased initial population to solve large-scale combinatorial optimization problems. The proposed scheme employs a master-slave collaboration in which the master node manages searched space of slave nodes and assigns seeds to generate initial population to slaves for their restarting of evolution process. Our approach allows us as widely as possible to search by all the slave nodes in the beginning period of the searching and then focused searching by multiple slaves on a certain spaces that seems to include good quality solutions. Computer experiment shows the effectiveness of our proposed scheme.

Hypersequential programming is a new method of concurrent-program development in which the original concurrent program is first serialized, then tested and debugged as a set of sequential programs (scenarios), and finally restored into the target concurrent program by parallelization. Both high productivity and reliability are achieved by hypersequential programming because testing and debugging are done for the serialized versions and the correctness of the serialized programs is preserved during the subsequent parallelization. This paper proposes scenario-based hypersequential programming for reactive multitasking systems that have not only concurrency and nondeterminacy, but also interruption and priority. Petri nets with priority are used to model reactive systems featuring interruption and priority-based scheduling. How reactive systems are made highly reliable by this approach is explained and the effectiveness of the approach is demonstrated through the example of a telephone terminal control program.

We propose source coding algorithms that use the randomness of a past sequence. The proposed algorithms solve the problems of multi-terminal source coding, rate-distortion source coding, and source coding with partial side information at the decoder. We analyze the encoding rate and the decoding error rate in terms of almost-sure convergence.

We extend the differential space time block code (STBC) using nonconstant modulus constellations of two transmit antennas to four transmit antennas case. The proposed method obtains larger minimum Euclidean distances than those of conventional differential STBC with PSK constellations. We derive the symbol error rate (SER) performance of the proposed method and demonstrate the SER performance using computer simulations for both static and fast fading channels. For transmission rates greater than 2 bits/channel use and 3 bits/channel use, the proposed method outperforms the conventional differential STBC.

This paper proposes a new ad hoc routing protocol using route redundancy as one of route selection criteria. It is important to provide redundancy for the route from source to destination in mobile ad hoc networks that are susceptible to failure. Route redundancy implies the relative possibility that redundant paths will exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward a destination node by involving intermediate nodes with relatively more adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route rediscoveries at route failures. We show the route setup procedure considering link redundancy and the route reconfiguration procedures employing redundant path information at the intermediate nodes. Further, this paper presents a new route maintenance protocol. Most of existing ad hoc routing protocols re-initiate a route query procedure when a destination node moves away and a route failure occurs. However, our scheme makes the destination node find a neighbor node that knows the way to the source node and establish a partial route to the neighbor node. If the destination node can find any and connect to it, the route will be recovered. This produces less control overhead than a source-initiated route discovery. We show the performance of our routing schemes through simulations using the Network Simulator 2 (ns-2).