Yuichi OHSITA Shingo ATA Masayuki MURATA
Distributed denial-of-service attacks on public servers have recently become more serious. More are SYN Flood attacks, since the malicious attackers can easily exploit the TCP specification to generate traffic making public servers unavailable. To assure that network services will not be interrupted, we need faster and more accurate defense mechanisms against malicious traffic, especially SYN Floods. One of the problems in detecting SYN Flood traffic is that server nodes or firewalls cannot distinguish the SYN packets of normal TCP connections from those of SYN Flood attack. Moreover, since the rate of normal network traffic may vary, we cannot use an explicit threshold of SYN arrival rates to detect SYN Flood traffic. In this paper we introduce a mechanism for detecting SYN Flood traffic more accurately by taking into consideration the time variation of arrival traffic. We first investigate the statistics of the arrival rates of both normal TCP SYN packets and SYN Flood attack packets. We then describe our new detection mechanism based on the statistics of SYN arrival rates. Our analytical results show that the arrival rate of normal TCP SYN packets can be modeled by a normal distribution and that our proposed mechanism can detect SYN Flood traffic quickly and accurately regardless of time variance of the traffic.
Naofumi TAKAGI Shunsuke KADOWAKI Kazuyoshi TAKAGI
A hardware algorithm for integer division is proposed. It is based on the radix-2 non-restoring division algorithm. Fast computation is achieved by the use of the radix-2 signed-digit (SD2) representation. The algorithm does not require normalization of the divisor, and hence, does not require an area-consuming leading-one (or zero) detection nor shifts of variable-amount. Combinational (unfolded) implementation of the algorithm yields a regularly structured array divider, and sequential implementation yields compact dividers.
Takahiro HADA Toyonori MUNAKATA
In this paper we discuss an adaptive process, which is based on the so-called self-tuning mechanism. We simplify this mechanism and apply it to a threshold system. From view points of information quantity and estimation accuracy we show this mechanism enhances information transmission through the threshold system. In addition we extend our theory so that it could be applied to a truncation coding.
EunJung CHANG HoYeol KWON John M. CIOFFI
Tone Injection (TI) can reduce the high peak-to-average ratio (PAR) which can substantially limit the performance of multicarrier systems without bandwidth loss. However, TI results in peak regrowth since it does not consider second peaks which can be higher than the peak after performing TI and also the average transmit power is increased because of huge constellation. In this paper, a no-rate loss PAR reduction technique, Injected Tone Constellation (ITC), is proposed along with an iterative algorithm to achieve the performance increase and to minimize the average transmit power without high complexity.
Yu HU Yinhe HAN Xiaowei LI Huawei LI Xiaoqing WEN
LSI testing is critical to guarantee chips are fault-free before they are integrated in a system, so as to increase the reliability of the system. Although full-scan is a widely adopted design-for-testability technique for LSI design and testing, there is a strong need to reduce the test data Volume, scan-in Power dissipation, and test application Time (VPT) of full-scan testing. Based on the analysis of the characteristics of the variable-to-fixed run-length coding technique and the random access scan architecture, this paper presents a novel design scheme to tackle all VPT issues simultaneously. Experimental results on ISCAS'89 benchmarks have shown on average 51.2%, 99.5%, 99.3%, and 85.5% reduction effects in test data volume, average scan-in power dissipation, peak scan-in power dissipation, and test application time, respectively.
Hitoshi ASAEDA Wacharapol POKAVANICH Soh YAMAMOTO
An end-user who wants to participate in group communication on the Internet must first resolve the session information including the contents type, data source and destination addresses. An effective session directory system is therefore the necessary component for the delivery of the maximum group communication value to a large number of world-wide users. In this paper, we formalize a distributed session directory system called "Channel Reflector (CR)." The advantage of CR is that, while an end-user can retrieve interesting session information from CR through a regular web interface, there is no contradiction to the dynamic nature of the session announcement scheme and the scoping technique in this architecture. For the deployment purpose, we show the actual implementation and the measurement results on the session synchronization delay given by the PlanetLab overlay network testbed.
Chisa TAKANO Kaori MURANAKA Keita SUGIYAMA Masaki AIDA
In current IP-based networks, the application of window-based end-to-end flow control, including TCP, to ensure reliable flows is an essential factor. However, since such a flow control is provided by the end hosts, end-to-end control cannot be applied to decision-making in a time-scale shorter than the round-trip delay. We have previously proposed a diffusion-type flow control mechanism to realize the extremely time sensitive flow control that is required for high-speed networks. In this mechanism, each network node manages its own traffic only on the basis of the local information directly available to it, by using predetermined rules. The implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies showed that the mechanism works well, by itself, in high-speed networks. However, to apply this mechanism to actual networks, it needs to be able to coexist with other existing protocols. In this paper, we investigate the performance of diffusion-type flow control coexisting with TCP. We show that diffusion-type flow control can coexist with TCP and the two can be complementary. Then, we show that a combination of both controls achieves higher network performance than TCP alone in high-speed networks.
Shuaiqi WANG Fule LI Yasuaki INOUE
This paper proposes a 15-bit 10-MS/s pipelined ADC based on the incomplete settling principle. The traditional complete settling stage is improved to the incomplete settling structure through dividing the sampling clock of the traditional stage into two parts for discharging the sampling and feedback capacitors and completing the sampling, respectively. The proposed ADC verifies the correction and validity of optimizing ADCs' conversion speed without additional power consumption through the incomplete settling. This ADC employs scaling-down scheme to achieve low power dissipation and utilizes full-differential structure, bottom-plate-sampling, and capacitor-sharing techniques as well as bit-by-bit digital self-calibration to increase the ADC's linearity. It is processed in 0.18 µm 1P6M CMOS mixed-mode technology. Simulation results show that 82 dB SNDR and 87 dB SFDR are obtained at the sampling rate of 10 MHz with the input sine frequency of 100 kHz and the whole static power dissipation is 21.94 mW.
Hisanori NOTO Hirotsugu YAMAMOTO Yoshio HAYASAKI Syuji MUGURUMA Yoshifumi NAGAI Yoshinori SHIMIZU Nobuo NISHIDA
We have developed a stereoscopic large LED display with parallax barrier for use by the general public and stereoscopic cameras to show real world images in 3D. This paper aims to analyze stereoscopic camera separation and convergence angle to make the most use of a field of interest and the reproducible space provided by the large stereoscopic LED display. We describe the principle of a stereoscopic LED display with a parallax barrier and its reproducible space that is determined by the allowable range of disparity to fuse stereoscopic images. By using a model of stereoscopic imaging and display process, we introduce the formulas of the reproduced positions on our developed stereoscopic LED display. Furthermore, we analyze relationships between the stereoscopic camera separation, the convergence angle, the area of a field of interest, and the depth range of the reproduced space. The results show there are four categories in camera configurations: there are three kinds of camera configurations that have different characteristics and one configuration that is not recommended. Category A configuration reproduces a wide area of the field of interest in a long range of depth. Category B functions as a reduction of the field of interest. Category C functions as a magnification of the field of interest. In Category D, a narrow area of the field is reproduced in a short range of depth. In particular, for use by stereoscopic LED display with a rather low resolution, Category A and Category C are recommended because they fully use the reproducible positions.
The notion of correlation intractable function ensembles (CIFEs) was introduced in an attempt to capture the "unpredictability" property of random oracles [12]: If O is a random oracle then it is infeasible to find an input x such that the input-output pair (x,O(x)) has some desired property. In this paper, we observe relationships between zero-knowledge protocols and CIFEs. Specifically, we show that, in the non-uniform model, the existence of CIFEs implies that 3-round auxiliary-input zero-knowledge (AIZK) AM interactive proofs exist only for BPP languages. In the uniform model, we show that 3-round AIZK AM interactive proofs with perfect completeness exist only for easy-to-approximate languages. These conditional triviality results extend to constant-round AIZK AM interactive proofs assuming the existence of multi-input CIFEs, where "multi-input" means that the correlation intractability is satisfied with respect to multiple input-output pairs. Also, as a corollary, we show that any construction of uniform multi-input CIFEs from uniform one-way functions proves unconditionally that constant-round AIZK AM interactive proofs with perfect completeness only for easy-to-approximate languages.
In this paper, we shall describe about a refined theory based on the concept of set-valued operators, suitable for available operation of extremely complicated large-scale network systems. The deduction of theory is accomplished in a weak topology introduced into the Banach space. Fundamental conditions for availability of system behaviors of such network systems are clarified, as a result, in a form of fixed point theorem for system of set-valued operators.
In-Su KANG Seung-Hoon NA Jong-Hyeok LEE
Compound noun segmentation is a key component for Korean language processing. Supervised approaches require some types of human intervention such as maintaining lexicons, manually segmenting the corpora, or devising heuristic rules. Thus, they suffer from the unknown word problem, and cannot distinguish domain-oriented or corpus-directed segmentation results from the others. These problems can be overcome by unsupervised approaches that employ segmentation clues obtained purely from a raw corpus. However, most unsupervised approaches require tuning of empirical parameters or learning of the statistical dictionary. To develop a tuning-less, learning-free unsupervised segmentation algorithm, this study proposes a pruning-based unsupervised technique that eliminates unhelpful segmentation candidates. In addition, unlike previous unsupervised methods that have relied on purely character-based segmentation clues, this study utilizes word-based segmentation clues. Experimental evaluations show that the pruning scheme is very effective to unsupervised segmentation of Korean compound nouns, and the use of word-based prior knowledge enables better segmentation accuracy. This study also shows that the proposed algorithm performs competitively with or better than other unsupervised methods.
In the reverse link of orthogonal frequency division multiplexing (OFDM)/ space division multiple access (SDMA) systems, each receive antenna of a base station receives a multiplexed version of signals transmitted from users, where the transmitted signals have individual amounts of frequency offset. Therefore, a frequency offset compensation scheme which is different from those used in general OFDM systems is required. For this requirement, frequency offset compensation schemes using the feedback transmission from the base station to user terminals have been proposed for multiuser OFDM systems. These schemes work with good precision when the feedback information is correct and is transmitted without errors. However, when the offset information is incorrectly received at user terminals, the frequency offset is not accurately compensated for. In OFDM/SDMA systems, one user is enough for causing inter-carrier interference to all users. Therefore, a frequency offset compensation scheme without feedback transmission is sometimes preferable. In this paper, we propose a frequency offset compensation scheme without feedback transmission. To compensate for frequency offset in every transmitted signal, the multiplexed received signals must be separated into each user's component before the offset compensation. Thus, we adopt the principle of the parallel interference cancellation (PIC). By employing PIC, the received signals can be separated before the offset compensation. Thus, the frequency offset of every user's signal can be compensated for. Simulation results show the bit error rate performance of the proposed scheme attains almost the same as that of the conventional scheme using the feedback transmission without errors.
Seiko ICHIKAWA Katsumi SUEKUNI Masatoshi ISHIMARU Hiroyuki NAKATANI Takao UNATE Akira NAKASUGA
Large liquid crystal display (LCD) panels have several cell-gap problems. For example, gravity defects are observed as thicker cell-gap areas at the bottom of an LCD panel at a high temperature, and cold-bubble defects are observed as bubbles in an LCD panel at a low temperature. We have developed a gap simulation to investigate these problems. The calculation was carried out for both column and ball spacers. It was shown that gap defects can be substantially reduced using ball spacers.
Takafumi KANAZAWA Toshimitsu USHIO
If some differences of perceptions arise between populations, then strategies which are regarded as the same strategy in a population may be perceived distinguishably in the other populations. To discuss such a situation, replicator dynamics for multi-population hypergames has been proposed. However, it is assumed that players' perceptions are given and fixed. In this paper, we consider that each population has various interpretation functions and choose one of them depending on payoffs, and we propose a hybrid system representation of replicator dynamics with changes of interpretation functions. Moreover, we apply our proposed model to a well-known example of a hypergame "Soccer Hooliganism" and show that behaviors converging to heteroclinic orbits can appear by the changes of the interpretation functions.
Shingo YOSHIZAWA Yoshikazu MIYANAGA
We present a low power architecture that dynamically controls wordlengths in a wireless OFDM demodulator. Finding the optimum wordlength for digital circuit systems is difficult because the trade-off between the hardware cost and system performance is not conclusive. Actual circuit systems have large wordlengths at the circuit design level to avoid calculation errors caused by a lack of dynamic range. This indicates that power dissipation can still be reduced under better conditions. We propose a tunable wordlength architecture that dynamically changes its own wordlength according to the communication environment. The proposed OFDM demodulator measures error vector magnitudes (EVMs) from de-modulated signals and tunes the wordlength to satisfy the required quality of communication by monitoring the EVM performance. The demodulator can reduce dissipated energy by a maximum of 32 and 24% in AWGN and multipath fading channels.
Weon Heum PARK Myung Hoon SUNWOO Seong Keun OH
This paper proposes efficient DSP instructions and their hardware architecture for the Viterbi algorithm. The implementation of the Viterbi algorithm on a DSP chip has been attracting more interest for its flexibility, programmability, etc. The proposed architecture can reduce the Trace Back (TB) latency and can support various wireless communication standards. The proposed instructions perform the Add Compare Select (ACS) and TB operations in parallel and the architecture has special hardware, called the Offset Calculation Unit (OCU), which automatically calculates data addresses for acceleration of the trellis butterfly computations. When the constraint length K is 5, the proposed architecture can reduce the decoding cycles about 17% compared with Carmel DSP and about 45% compared with TMS320C55x.
There is a certain level of requirements for system performance that intrusion detection systems on the Internet need. One of them is to lower the rate of "False Positive" and "False Negative." Another one is to have a convenient user interface so that users can manage system security easily with the detection systems. However, scan detection systems on public domain show a high rate of false detection and have difficulty in detecting various scanning techniques. In addition, since current scan detection systems are based on the command interface, the systems have been poor at user interface and therefore it is difficult to apply them to system security management. Hence, we first propose a set of new filter rules, which detect various scan attacks based on port scanning techniques. Secondly, a set of ABP-Rules derived from attacker's behavioral patterns is proposed in order to minimize the False Positive rate. With these methods, we implement a new real-time scan detection system, overcoming the limitations of current real-time scan detection systems. Also the implemented system contains a GUI interface for user's convenience of managing the network security, which was developed with Tcl/Tk.
This paper proposes a fast motion estimation algorithm for variable block-sizes by utilizing motion vector bottom-up procedure for H.264. The refined motion vectors of adjacent small blocks are merged to predict the motion vectors of larger blocks for reducing the computation. Experimental results show that our proposed method has lower computational complexity than full search, fast full search and fast motion estimation of the H.264 reference software JM93 with slight quality decrease and little bit-rate increase.
Byoung-Ju YUN Jae-Soo CHO Yun-Ho KO
In this paper, we propose a new vertex adjustment method which is based on the size ratio of an object and that of a polygon. In the conventional polygonal approximation methods, the sizes of an object and an approximating polygon are quite different, therefore there are so many error pixels between them. The proposed method reduces the size of error regions by adjusting the size of the polygon to that of an object. Simulation results show outstanding performance of the proposed method.