Naoko KASAI Yoshimi HATSUKADE Hiroshi TAKASHIMA
Carbon fiber composites are increasingly used as structural materials because of their unique and advantageous characteristics. Carbon fiber reinforced carbon matrix composite (C/C) has the characteristics of high fatigue resistance, fracture toughness and heat resistance up to 3000 K, and is an important component of refractory tiles and nozzles in space shuttles. Useful nondestructive testing methods for C/C are now required. We have developed a SQUID-NDT system based on a non-magnetic coaxial pulse tube cryocooler (PTC), a HTS-SQUID gradiometer and a field generator with ferrite cores that induces high currents in specimens with low electric conductivity. The cryostat with the PTC is compact, at 50 mm in diameter and 400 mm in height. It weighs a total of 4 kg. The system noise is 80 µ0/Hz1/2 corresponding to 1.3 nT/m/Hz1/2 at 100 Hz. We used the system to investigate the usefulness of the SQUID-NDT in detecting flaws in C/C composites. Hidden cracks in C/C multi-layered specimens were detected up to depth of 15 mm. Hidden cracks in C/C-Al stacked sample was also clearly detected. In addition, we magnetically detected the mechanical breaking process of a C/C specimen under tensile load using the current injection method. For this study, a technique for visualizing current detouring defects was developed for detection of deteriorating areas in the specimen. The deteriorating area, identified from the current map, expands during breaking process and agrees with the results obtained by the microscopic observation of the breaking process. The interrupted current Iint, estimated by summing the detour current, clearly changed depending on the stage of the breaking process, suggesting that Iint may be applicable as good index for distinguishing each stage in the breaking process. It is concluded that a SQUID-NDT is applicable to C/C composites and advanced complex materials with low electric conductivity in addition to metallic materials.
Kiyohiro FURUTANI Takeshi HAMAMOTO Takeo MIKI Masaya NAKANO Takashi KONO Shigeru KIKUDA Yasuhiro KONISHI Tsutomu YOSHIHARA
This paper describes two circuit techniques useful for the design of high density and high speed low cost double data rate memories. One is a highly flexible row and column redundancy circuit which allows the division of flexible row redundancy unit into multiple column redundancy unit for higher flexibility, with a new test mode circuit which enables the use of the finer pitch laser fuse. Another is a compact read data path which allows the smooth data flow without wait time in the high frequency operation with less area penalty. These circuit techniques achieved the compact chip size with the cell efficiency of 60.6% and the high bandwidth of 400 MHz operation with CL=2.5.
In this letter, we propose a low-complexity estimation method of cyclic-prefix (CP) length for a discrete multitone (DMT) very high-speed digital subscriber line (VDSL) system. Using the sign bits of the received DMT VDSL signals, the proposed method provides a good estimate of CP length, which is suitable for various channel characteristics. This simple estimation method is consistent with the initialization procedure of T1E1.4 multi-carrier modulation (MCM)-based VDSL Standard. Finally, simulation results with VDSL test loops are presented.
Junji KAWATA Yuichi TANJI Yoshifumi NISHIO Akio USHIDA
In this paper, we propose a new algorithm for calculating the exact poles of the admittance matrix of RLCG interconnects. After choosing dominant poles and corresponding residues, each element of the exact admittance matrix is approximated by partial fraction. A procedure to obtain the residues that guarantee the passivity is also provided, based on experimental studies. In the procedure the residues are calculated by using the least squares method so that the partial fraction matches each element of the exact admittance matrix in the frequency-domain. From the partial fraction representation, the asymptotic equivalent circuit models which can be easily simulated with SPICE are synthesized. It is shown that an efficient model-order reduction is possible for short-length interconnects.
Il-Gu LEE Hyung-Joun YOO Sin-Chong PARK
In the recent draft of the 802.11e MAC, the Hybrid Coordinator (HC) gives transmission opportunity (TXOP) for a station to transmit burst frames in TXOP for improving throughput efficiency. In this paper, we express the expected throughput for the Block Ack policy in Polled TXOP as a closed form function of the number of burst MSDUs, the number of fragmented MPDUs, the data payload length, the frame retry count, the wireless channel condition, and the selected PHY mode. Based on our simulation study and analysis, we show that the TXOP and proper Ack policy can enhance system performance, and that there are the Block Ack efficient block size and frame length to transmit the burst frames for each PHY mode. Moreover, we also show that when the Block Ack mechanism is combined with link adaptation, it has better throughput performance.
We show that a problem of deciding whether a formula for a multivariate polynomial of n variables over a finite field of characteristic 2 has degree n when reduced modulo a certain Boolean ideal belongs to P. When the formula is allowed to have succinct representations as sums of monomials, the problem becomes P-complete.
Shinji WATANABE Yasuhiro MINAMI Atsushi NAKAMURA Naonori UEDA
A Shared-State Hidden Markov Model (SS-HMM) has been widely used as an acoustic model in speech recognition. In this paper, we propose a method for constructing SS-HMMs within a practical Bayesian framework. Our method derives the Bayesian model selection criterion for the SS-HMM based on the variational Bayesian approach. The appropriate phonetic decision tree structure of the SS-HMM is found by using the Bayesian criterion. Unlike the conventional asymptotic criteria, this criterion is applicable even in the case of an insufficient amount of training data. The experimental results on isolated word recognition demonstrate that the proposed method does not require the tuning parameter that must be tuned according to the amount of training data, and is useful for selecting the appropriate SS-HMM structure for practical use.
Given a graph G, we give a fast algorithm for approximating the vertex connectivity κ of G. Our algorithm delivers a minimum vertex cut of G if κ δ/2, and returns a message "κ > δ/2" otherwise, where δ denotes the minimum degree of G. The algorithm runs in O(n2(1 + min {κ2, κ/δ)) time and O(n + m) space, where n and m denote the numbers of vertices and edges in G, respectively.
Yuki KATO Hiroyuki SEKI Tadao KASAMI
Several grammars have been proposed for representing RNA secondary structure including pseudoknots such as simple linear tree adjoining grammar (sl-tag), extended sl-tag (esl-tag) and RNA pseudoknot grammar (rpg). The main purpose of this paper is to compare the generative power of these grammars by identifying them as subclasses of multiple context-free grammars (mcfg). Specifically, it is shown that the class of languages generated by esl-tag (ESL-TAL) properly includes the class of languages generated by sl-tag (SL-TAL) and the class of languages generated by cfg. Also, we show that the class of languages generated by rpg coincides with the class of languages generated by mcfg with dimension one or two and rank one or two. Furthermore, it is shown that SL-TAL is a full trio and ESL-TAL is a substitution closed full AFL.
Satoshi INOUE Katsushi INOUE Akira ITO Yue WANG
For each positive integer r 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of path-bounded one-way (simple) multihead nondeterministic finite automata. It is shown that for each k 2 and r 1, there is a language accepted by an (r + 1) path-bounded one-way nondeterministic k head finite automaton, but not accepted by any r path-bounded one-way nondeterministic k head finite automaton whether or not simple.
Wonil LEE Donghoon CHANG Sangjin LEE Soohak SUNG Mridul NANDI
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar's construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup's sequential algorithm. But it is not too large as in all practical situations we need just two more masks than Shoup's. Our second algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result, we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its parallelizability performance is less efficient than complete tree based constructions. However if l is getting larger, then the parallelizability of the construction is also getting near to that of complete tree based constructions. We also give a sufficient condition for valid domain extension in sequential domain extension.
Won Seug CHOI Harksoo KIM Jungyun SEO
Analysis of speech acts and discourse structures is essential to a dialogue understanding system because speech acts and discourse structures are closely tied with the speaker's intention. However, it has been difficult to infer a speech act and a discourse structure from a surface utterance because they highly depend on the context of the utterance. We propose a statistical dialogue analysis model to determine discourse structures as well as speech acts using a maximum entropy model. The model can automatically acquire probabilistic discourse knowledge from an annotated dialogue corpus. Moreover, the model can analyze speech acts and discourse structures in one framework. In the experiment, the model showed better performance than other previous works.
Hyuk-Choon KWON Won-Seok JANG Sang-Kook HAN
We have proposed and experimentally demonstrated a novel WDM-PON downstream optical link. It is composed of a wavelength-locked FP-LD with a spectrally-sliced FP-LD as an external-injection optical source and operated as directly-modulating in a downstream-traffic transmitter. The downstream transmissions at 622 Mbps and 2.5 Gbps were performed for four channels over 25 km. The proposed WDM-PON downstream transmitter can be expanded up to eight channels by controlling an external-injection optical source of a spectrally-sliced FP-LD. Also, the transmitter has facility of multi-channel selection by controlling temperature. We verified the potential of the transmitter in WDM-PON optical link.
Takafumi FUJITA Atsushi OHTA Takeshi ONIZAWA Takatoshi SUGIYAMA
This paper proposes a reduced-complexity signal detection scheme for Orthogonal Frequency Division Multiplexing with Space Division Multiplexing (OFDM/SDM) systems that utilize Zero-Forcing (ZF) and K-best algorithms. It is known that Maximum Likelihood Detection (MLD) with exhaustive search achieves mathematically optimal performance for SDM signal detection. However, it also suffers from exponential computational complexity against the number of transmit antennas and modulation order. In order to reduce the computational complexity of MLD, we apply the K-best algorithm for signal detection. It is known that the K-best algorithm itself inherently reduces the computational complexity of MLD because it avoids exhaustive search. In this paper, we propose the modified K-best algorithm, which exploits the ZF algorithm for initial symbol estimation. This initial symbol estimation improves the decoding accuracy of the original K-best algorithm. We evaluate the performance of the proposed scheme through computer simulations. The computer simulation results show that the performance degradation from the MLD algorithm is suppressed to just 1 dB or so in terms of the required Eb/N0 for packet error rate (PER) = 10-2, When either 16 Quadrature Amplitude Modulation (16QAM) or 64QAM is applied with three transmit and three receive antennas. In these cases, 87% and 99% fewer metric computations are required than the MLD algorithm. It is confirmed that the proposed MLD algorithm offers a significant reduction in the computational complexity from the MLD algorithm while suppressing the performance degradation.
Ryuhei FUNADA Hiroshi HARADA Yukiyoshi KAMIO Shoji SHINODA
Pilot-symbol-aided (PSA) channel estimation for OFDM wireless access systems enables the periodic estimation of channel frequency response by generating reference data from the received OFDM signals. The accuracy of this channel estimation can be improved through the average over a certain time period in each subcarrier-channel. However, the accuracy of the channel estimates by the average degrades as the Doppler shift is large due to a decrease in the average section size according to the Doppler shift for the tracking of the time-varying channel. This paper proposes a novel PSA channel estimation method to mitigate the influence of the noises and interferences. This method detects the channel estimates affected by the noises and interferences, and then removes them before the arithmetic or harmonic averaging to avoid propagating the influence of the noises and interferences. This paper also evaluated the proposed channel estimation method by clipping log-likelihood ratio (LLR) data to inspect the influence of the channel estimation on the LLR calculation by computer simulation.
It is reported that TCP does not perform well in high-speed wide area networks. Because MulTCP behaves like the aggregate of N TCP flows, MulTCP can be used to achieve throughputs of 1 Gbps or more. However, no performance evaluation of MulTCP in high-speed wide area networks has been published. Computer simulations are used to evaluate the performance of MulTCP. The results clarify that synchronized packet losses greatly impact the performance of MulTCP.
This paper deals with broadcast encryption schemes, in which a sender can send information securely to a group of receivers excluding some receivers over a broadcast channel. In this paper we propose modifications of the Complete Subtree (CS), the Subset Difference (SD) and the Layered Subset Difference (LSD) methods based on the Master Key Tree (MKT). Our modifications eliminate log N keys or labels from receivers' storage, in exchange for an increase in the computational overhead, where N is the total number of receivers. We also propose modifications of the SD and LSD methods by applying the Trapdoor One-way Permutation Tree (TOPT) which is originally proposed in order to modify the CS method. Our modifications based on TOPT also eliminate log N labels, and the computational cost is much smaller than MKT based methods.
In this study, we construct balanced Boolean functions with a high nonlinearity and an optimum algebraic degree for both odd and even dimensions. Our approach is based on modifying functions from the Maiorana-McFarland's superclass, which has been introduced by Carlet. A drawback of Maiorana-McFarland's function is that their restrictions obtained by fixing some variables in their input are affine. Affine functions are cryptographically weak functions, so there is a risk that this property will be exploited in attacks. Due to the contribution of Carlet, our constructions do not have the potential weakness that is shared by the Maiorana-McFarland construction or its modifications.
Akio OGIHARA Hitoshi UNNO Akira SHIOZAKI
We propose discrimination method of synthetic speech using pitch pattern of speech signal. By applying the proposed synthetic speech discrimination system as pre-process before the conventional HMM speaker verification system, we can improve the safety of conventional speaker verification system against imposture using synthetic speech. The proposed method distinguishes between synthetic speech and natural speech according to the pitch pattern which is distribution of value of normalized short-range autocorrelation function. We performed the experiment of user verification, and confirmed the validity of the proposed method.
The complete subtree (CS) method is one of the most well-known broadcast encryptions which do not enforce the receivers to keep "online." This paper is to reduce the size of secret information which must be stored in a terminal of the method. In the original CS method, the size of the secret information increases as the number of terminals increases. It is shown in this paper that, by making use of a one-way trapdoor permutation, we can make the size constant regardless of the number of terminals. The security of the proposed scheme is investigated, and detailed comparison with other similar schemes is presented. The proposed scheme is suitable for practical implementations of the CS method.