Junbo CHEN Bo ZHOU Lu CHEN Xinyu WANG Yiqun DING
One of the most well-studied problems in data mining is computing the collection of frequent itemsets in large transactional databases. Since the introduction of the famous Apriori algorithm [14], many others have been proposed to find the frequent itemsets. Among such algorithms, the approach of mining closed itemsets has raised much interest in data mining community. The algorithms taking this approach include TITANIC [8], CLOSET+ [6], DCI-Closed [4], FCI-Stream [3], GC-Tree [5], TGC-Tree [16] etc. Among these algorithms, FCI-Stream, GC-Tree and TGC-Tree are online algorithms work under sliding window environments. By the performance evaluation in [16], GC-Tree [15] is the fastest one. In this paper, an improved algorithm based on GC-Tree is proposed, the computational complexity of which is proved to be a linear combination of the average transaction size and the average closed itemset size. The algorithm is based on the essential theorem presented in Sect. 4.2. Empirically, the new algorithm is several orders of magnitude faster than the state of art algorithm, GC-Tree.
Muneomi SAGARA Hiroaki MUKAIDANI Toru YAMAMOTO
This paper discusses the infinite horizon static output feedback stochastic Nash games involving state-dependent noise in weakly coupled large-scale systems. In order to construct the strategy, the conditions for the existence of equilibria have been derived from the solutions of the sets of cross-coupled stochastic algebraic Riccati equations (CSAREs). After establishing the asymptotic structure along with the positive semidefiniteness for the solutions of CSAREs, recursive algorithm for solving CSAREs is derived. As a result, it is shown that the proposed algorithm attains the reduced-order computations and the reduction of the CPU time. As another important contribution, the uniqueness of the strategy set is proved for the sufficiently small parameter ε. Finally, in order to demonstrate the efficiency of the proposed algorithm, numerical example is given.
Lei WANG Jun WANG Satoshi GOTO Takeshi IKENAGA
With the ubiquitous application of Internet and wireless networks, H.264 video communication becomes more and more common. However, due to the high-efficiently predictive coding and the variable length entropy coding, it is more sensitive to transmission errors. The current error concealment (EC) scheme, which utilizes the spatial and temporal correlations to conceal the corrupted region, produces unsatisfied boundary artifacts. In this paper, first we propose variable block size error concealment (VBSEC) scheme inspired by variable block size motion estimation (VBSME) in H.264. This scheme provides four EC modes and four sub-block partitions. The whole corrupted macro-block (MB) will be divided into variable block size adaptively according to the actual motion. More precise motion vectors (MV) will be predicted for each sub-block. Then MV refinement (MVR) scheme is proposed to refine the MV of the heterogeneous sub-block by utilizing three step search (TSS) algorithm adaptively. Both VBSEC and MVR are based on our directional spatio-temporal boundary matching algorithm (DSTBMA). By utilizing these schemes, we can reconstruct the corrupted MB in the inter frame more accurately. The experimental results show that our proposed scheme can obtain better objective and subjective EC quality, respectively compared with the boundary matching algorithm (BMA) adopted in the JM11.0 reference software, spatio-temporal boundary matching algorithm (STBMA) and other comparable EC methods.
Takayuki NOZAKI Kenta KASAI Tomoharu SHIBUYA Kohichi SAKANIWA
Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles. Evolution of degree distributions in residual graphs is important characteristic which is used for finite-length analysis of the expected block and bit error probability over the binary erasure channel. In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.
Sung-Min OH Sunghyun CHO Jae-Hyun KIM Jonghyung KWUN
This letter proposes an efficient uplink scheduling algorithm for the voice over Internet protocol (VoIP) service with variable frame-duration according to the voice activity in IEEE 802.16e/m systems. The proposed algorithm dynamically changes the grant-interval to save the uplink bandwidth, and it uses the random access scheme when the voice activity changes from silent-period to talk-spurt. Numerical results show that the proposed algorithm can increase the VoIP capacity by 26 percent compared to the conventional extended real-time polling service (ertPS).
The C-oscillation due to Martin-Löf shows that {α| ∀ n [C(α
Ignacio ALGREDO-BADILLO Claudia FEREGRINO-URIBE Rene CUMPLIDO Miguel MORALES-SANDOVAL
MD5 is a cryptographic algorithm used for authentication. When implemented in hardware, the performance is affected by the data dependency of the iterative compression function. In this paper, a new functional description is proposed with the aim of achieving higher throughput by mean of reducing the critical path and latency. This description can be used in similar structures of other hash algorithms, such as SHA-1, SHA-2 and RIPEMD-160, which have comparable data dependence. The proposed MD5 hardware architecture achieves a high throughput/area ratio, results of implementation in an FPGA are presented and discussed, as well as comparisons against related works.
Katsuhisa YAMANAKA Shin-ichi NAKANO
A rectangular drawing is a plane drawing in which every face is a rectangle. In this paper we give a simple encoding scheme for rectangular drawings. Given a rectangular drawing R with maximum degree 3, our scheme encodes R with m + o(n) bits where n is the number of vertices of R and m is the number of edges of R. Also we give an algorithm to supports a rich set of queries, including adjacency and degree queries on the faces, in constant time.
Noboru KUNIHIRO Kaoru KUROSAWA
For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(=pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA, where N=prq while ed=1 mod(p-1)(q-1). In this paper, we show that a deterministic polynomial time equivalence also holds in this variant. The coefficient matrix T to which LLL algorithm is applied is no longer lower triangular, and hence we develop a new technique to overcome this problem.
Hirotoshi HONMA Shigeru MASUYAMA
Given a simple graph G with n vertices, m edges and k connected components. The spanning forest problem is to find a spanning tree for each connected component of G. This problem has applications to the electrical power demand problem, computer network design, circuit analysis, etc. An optimal parallel algorithm for finding a spanning tree on the trapezoid graph is given by Bera et al., it takes O(log n) time with O(n/log n) processors on the EREW (Exclusive-Read Exclusive-Write) PRAM. Bera et al.'s algorithm is very simple and elegant. Moreover, it can correctly construct a spanning tree when the graph is connected. However, their algorithm can not accept a disconnected graph as an input. Applying their algorithm to a disconnected graph, Concurrent-Write occurs once for each connected component, thus this can not be achieved on EREW PRAM. In this paper we present an O(log n) time parallel algorithm with O(n/log n) processors for constructing a spanning forest on trapezoid graph G on EREW PRAM even if G is a disconnected graph.
Tetsuo ASANO Shinnya BITOU Mitsuo MOTOKI Nobuaki USUI
This paper presents an algorithm for rotating a subimage in place without using any extra working array. Due to this constraint, we have to overwrite pixel values by interpolated values. Key ideas are local reliability test which determines whether interpolation at a pixel is carried out correctly without using interpolated values, and lazy interpolation which stores interpolated values in a region which is never used for output images and then fills in interpolated values after safety is guaranteed. It is shown that linear interpolation is always safely implemented. An extension to cubic interpolation is also discussed.
We point out that the interval algorithm can be expressed in the form of a shift on the sequence space. Then we clarify that, by using a Bernoulli process, the interval algorithm can generate only a block of Markov chains or a sequence of independent blocks of Markov chains but not a stationary Markov process. By virtue of the finitary coding constructed by Hamachi and Keane, we obtain the procedure, called the finitary interval algorithm, to generate a Markov process by using the interval algorithm. The finitary interval algorithm also gives maps, defined almost everywhere, which transform a Markov measure to a Bernoulli measure.
Chang Woo LEE Hyeonwoo CHO Sang Woo KIM
This letter presents a new mathematical expression for the excess mean-square error (EMSE) of the affine projection (AP) algorithm. The proposed expression explicitly shows the proportional relationship between the EMSE and the condition number of the input signals.
Masayoshi ODA Yoshihiro YAMAGAMI Junji KAWATA Yoshifumi NISHIO Akio USHIDA
We propose here a fully Spice-oriented design algorithm of op-amps for attaining the maximum gains under low power consumptions and assigned slew-rates. Our optimization algorithm is based on a well-known steepest descent method combining with nonlinear programming. The algorithm is realized by equivalent RC circuits with ABMs (analog behavior models) of Spice. The gradient direction is decided by the analysis of sensitivity circuits. The optimum parameters can be found at the equilibrium point in the transient response of the RC circuit. Although the optimization time is much faster than the other design tools, the results might be rough because of the simple transistor models. If much better parameter values are required, they can be improved with Spice simulator and/or other tools.
Takashi IMAMICHI Hiroshi NAGAMOCHI
In this paper, we consider a collision detection problem of spheres which asks to detect all pairs of colliding spheres in a set of n spheres located in d-dimensional space. We propose a collision detection algorithm for spheres based on slab partitioning technique and a plane sweep method. We derive a theoretical upper bound on the time complexity of the algorithm. Our bound tells that if both the dimension and the maximum ratio of radii of two spheres are bounded, then our algorithm runs in O(n log n + K) time with O(n + K) space, where K denotes the number of pairs of colliding spheres.
Feng YANG Yu ZHANG Jian SONG Changyong PAN Zhixing YANG
Based on the expectation-maximization (EM) algorithm, an iterative time-domain channel estimation approach capable of using a priori information is proposed for orthogonal frequency division multiplexing (OFDM) systems in this letter: it outperforms its noniterative counterpart in terms of estimation accuracy as well as bit error rate (BER) performance. Numerical simulations demonstrate that an SNR gain of 1 dB at BER=10-4 with only one iteration and estimation mean square error (MSE) which nearly coincides with the Cramer-Rao bound (CRB) in the low SNR region can be obtained, thanks to the efficient use of a priori information.
Kang ZHAO Jinian BIAN Sheqin DONG Yang SONG Satoshi GOTO
Programming the multiprocessor system-on-chip (MPSoC) requires partitioning the sequential reference programs onto multiple processors running in parallel. However, designers still need to partition the code manually due to the lack of automated partition techniques. To settle this issue, this paper proposes a partition exploration algorithm based on the search space smoothing techniques, and implements the proposed method using a commercial extensible processor (Xtensa LX2 processor from Tensilica Inc.). We have verified the feasibility of the algorithm by implementing the MPEG2 benchmark on the Xtensa-based two-processor system. The final experimental results indicate a performance improvement of at least 1.6 compared to the single-processor system.
Kostas PSANNIS Yutaka ISHIBASHI
The H.264/AVC standard provides several new error-resilient features to enable the reliable transmission of compressed video signals over lossy packet networks. Flexible Macroblock Ordering (FMO) is one of the most interesting resilient features within the H.264/AVC standard. Unlike former standards, in which slices were constructed out of consecutive raster scan macroblocks, FMO suggests new slices composed of spatially distributed Macroblocks (MBs), and organized in a mixed-up fashion. H.264/AVC specifies seven types of FMO. The standard defines also an explicit FMO type (Type 6), which allows explicitly assignment of each MB within the frame to any available slice groups. Therefore new FMO types can be used and integrated into H264/AVC without violating the standard. In this paper we propose a new Explicit Chessboard-Wipe (ECW) Flexible Macroblocks Ordering (FMO) technique, which outperforms all other FMO types. The new ECW ordering results in effective error scattering which maximizes the number of correctly received macroblocks located around corrupted macroblocks, leading to better error concealment. Performance evaluations demonstrate that the proposed Explicit FMO approach outperforms all the FMO types. Both subjective and objective visual quality comparative study has been also carried out in order to validate the proposed approach.
Todorka ALEXANDROVA Hiroyoshi MORITA
Constructing ideal (t,n) threshold secret sharing schemes leads to some limitations on the maximum number of users, that are able to join the secret sharing scheme. We aim to remove these limitations by reducing the information rate of the constructed threshold secret sharing schemes. In this paper we propose recursive construction algorithms of (t,n) threshold secret sharing schemes, based on the generalized vector space construction. Using these algorithms we are able to construct a (t,n) threshold secret sharing scheme for any arbitrary n.
IEEE 802.16 broadband wireless access (BWA) technology is suitable for providing multimedia applications without accessing the wired networks directly. Although IEEE 802.16 standard well defines the quality of service (QoS) framework, it makes no specific recommendation with regard to the bandwidth allocation. In this paper, we propose an algorithm for allocating bandwidth in response to dynamic changes in the arrival rate such that the total bandwidth is efficiently utilized.