This paper presents a new analysis of power complementary filters using the state-space representation. Our analysis is based on the bounded-real Riccati equations that were developed in the field of control theory. Through this new state-space analysis of power complementary filters, we prove that the sum of the controllability/observability Gramians of a pair of power complementary filters is represented by a constant matrix, which is given as a solution to the bounded-real Riccati equations. This result shows that power complementary filters possess complementary properties with respect to the Gramians, as well as the magnitude responses of systems. Furthermore, we derive new theorems on a specific family of power complementary filters that are generated by a pair of invertible solutions to the bounded-real Riccati equations. These theorems show some interesting relationships of this family with respect to the Gramians, zeros, and coefficients of systems. Finally, we give a numerical example to demonstrate our results.

The security notion of indifferentiability was proposed by Maurer, Renner, and Holenstein in 2004. In 2005, Coron, Dodis, Malinaud, and Puniya discussed the indifferentiability of hash functions. They have shown that the Merkle-Damgård construction is not secure in the sense of indifferentiability. In this paper, we analyze the security of single-block-length and rate-1 compression functions in the sense of indifferentiability. We formally show that all single-block-length and rate-1 compression functions, which include the Davies-Meyer compression function, are insecure. Furthermore, we show how to construct a secure single-block-length and rate-1 compression function in the sense of indifferentiability. This does not contradict our result above.

The present paper introduces an integrated construction of binary sequences having a zero-correlation zone. The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. The proposed method enables more flexible design of the binary zero-correlation zone sequence set with respect to its member size, length, and width of zero-correlation zone. Several previously reported sequence construction methods of binary zero-correlation zone sequence sets can be explained as special cases of the proposed method.

This paper presents media processor architectures for automotive applications. Media processing applications with their requirements for LSI implementations are first described for vision based driver assistance as well as graphical user interface for car navigation using 3D graphics. Then, parallel processing architectures for vision and graphics in these applications are reviewed with their performance and cost. After that, future trends of automotive media processing such as integration of vision and 3D graphics functions are shown with their applications and the required performance. Moreover, parallel processing architectures are discussed for the integration of vision and graphics. Finally, an prospect of a next-generation media processing LSI for automotives is provided.

In the acquisition of projection data of X-ray CT, logarithm operation is indispensable. But noise distribution is nonlinearly projected by the logarithm operation, and this deteriorates the precision of CT number. This influence becomes particularly remarkable when only a few photons are caught with a detector. It generates a strong streak artifact (SA) in a reconstructed image. Previously we have clarified the influence of the nonlinearity by statistical analysis and proposed a correction method for such nonlinearity. However, there is a problem that the compensation for clamp processing cannot be performed and that the suppression of SA is not enough in photon shortage state. In this paper, we propose a new technique for correcting the nonlinearity due to logarithm operation for noisy data by combining the previously presented method and an adaptive filtering method. The technique performs an adaptive filtering only when the number of captured photons is very few. Moreover we quantitatively evaluate the influence of noise on the reconstructed image in the proposed method by the experiment using numerical phantoms. The experimental results show that there is less influence on spatial resolution despite suppressing SA effectively and that CT number are hardly dependent on the number of the incident photons.

In this paper, we extend our framework of speculative computation in multi-agent systems by introducing default constraints. In research on multi-agent systems, handling incomplete information due to communication failure or due to other agents' delay in communication is a very important issue. For a solution to this problem, we previously proposed speculative computation based on abduction in the context of master-slave multi-agent systems and gave a procedure in abductive logic programming. In our previous proposal, a master agent prepares a default value for a yes/no question in advance, and it performs speculative computation using the default without waiting for a reply to the question. This computation is effective unless the contradictory reply to the default is returned. In this paper, we formalize speculative constraint processing, and propose a correct operational model for such computation so that we can handle not only yes/no questions, but also more general types of questions.

DTW-based text-dependent speaker verification technology is an effective scheme for protecting personal information in personal electronic products from others. To enhance the performance of a DTW-based system, an impostor database covering all possible passwords is generally required for the matching scores normalization. However, it becomes impossible in our practical application scenario since users are not restricted in their choice of password. We propose a method to generate pseudo-impostor data by employing an acoustic codebook. Based on the pseudo-impostor data, two normalization algorithms are developed. Besides, a template compression approach based on the codebook is introduced. Some modifications to the conventional DTW global constraints are also made for the compressed template. Combining the normalization and template compression methods, we obtain more than 66% and 35% relative reduction in storage and EER, respectively. We expect that other DTW-based tasks may also benefit from our methods.

In this letter we introduce new generalized cyclotomic sequences of order two and length pq firstly, then we determine the linear complexity and autocorrelation values of these sequences. Our results show that these sequences are rather good from the linear complexity viewpoint.

This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. In this system, messages from two correlated sources are jointly encoded, and each decoder has access to one of the two messages to enable it to reproduce the other message. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical analyses.

We present a parallel multilevel fast multipole algorithm aimed at low cost parallel computers such as GRID computer environments and clusters of workstations. The algorithm is a scheduling algorithm where work packets are handled in a certain order to ensure minimal idle time of the processors and to avoid simultaneous bursts of communication between the processors. The algorithm is implemented on a method of moment discretization of a two-dimensional TM electromagnetic scattering problem. Examples of several optical devices with a size up to 28 500 wavelengths are presented.

In multiple-input multiple-output (MIMO) wireless relay networks, simultaneously using multiple relay nodes can improve the capacity of source-to-destination communications. Recent information theories have shown that passing the same message across multiple relay nodes can improve the capacity of source-to-destination communications. We have previously proposed three relay schemes that use jointly QR decomposition and the phase control matrix; computer simulations have confirmed the superiority of these schemes over conventional ones such as amplify-and-forward and zero-forcing schemes. In this paper, we analyze the capacity and achievable gains (distributed array gain, intra-node array gain and spatial multiplexing gain) of the previously proposed relay schemes (QR-P-QR, QR-P-ZF, and ZF-P-QR) and thus provide an insight into what contributes to their superiority over conventional schemes. The analyses show that the location of the relay nodes used has a significant impact on capacity. On the basis of this observation, we further propose a method that enables each relay node to individually select its relay scheme according to its channel conditions so as to maximize the capacity. A computer simulation confirms the capacity improvement achieved by the proposed selection method.

We present a linear-time algorithm for treating collision response of articulated rigid bodies in physically based modeling. By utilizing the topology of articulated rigid bodies and the property of linear equations, our method can solve in linear time the system of linear equations that is crucial for treating collision response.

High-resolution Direction-of-Arrival (DOA) estimation techniques for antenna arrays have been widely desired in many applications such as smart antennas, RF position location, and RFID system. To realize high-resolution capability of the techniques, precise array calibration is necessary. For an array of single-mode elements, a calibration matrix derived by the open-circuit method is the simplest one. Unfortunately, calibration performance of the method is not enough for the high-reslution DOA estimation techniques. In this paper, we consider problems of the calibration matrix derived by the method, and show that errors in the matrix can be effectively removed by an optimal diagonal weight coefficient. In the proposed compensation technique, the number of newly introduced parameters, or unknowns, is only one for an array of the identical elements. Performance of the simple compensation technique is verified numerically and experimentally.

This paper examines seasonal change of the true water area of Lake "Sakata" by using Polarimetric Synthetic Aperture Radar (POLSAR) image analysis. The true water area includes not only the body of water but also the water area under emerged-plants and/or floating-leave plants in the lake. Statistical POLSAR image analysis is carried out for both X- and L-band data, based on the three-component scattering power decomposition method, where the decomposed components are surface scattering, double-bounce scattering and volume scattering components. From the results of the image analysis for the L-band POLSAR data acquired by Pi-SAR system, it is found that strong double-bounce scattering can be observed at the vicinity of the boundary region between water area and the surrounding emerged-plants area in early and middle summer. This phenomenon is an important factor for environmental monitoring. To verify the generating mechanism of the double-bounce scattering, the Finite-Difference Time-Domain (FDTD) polarimetric scattering analysis is also executed for a simplified boundary model, which simulates the local boundary region around the lake and consists of lots of vertical thin dielectric pillars on a perfect electric conductor (PEC) plate or on a PEC and dielectric hybrid plate. Taking into account the polarimetric feature of the double-bounce scattering obtained by both the FDTD and POLSAR image analyses, one can distinguish the actual water area from the bush of the emerged-plants around the lake, even when the water area is concealed by emerged-plants and/or floating-leave plants. Consequently, it is found that by using the proposed approach, one can estimate the true water area seasonal change for the lake and the surrounding wetland.

We present MobileOBJ, a formal framework for specifying and verifying mobile systems. Based on hidden algebra, the components of a mobile system are specified as behavioral objects or Observational Transition Systems, a kind of transition system, enriched with special action and observation operators related to the distinct characteristics of mobile computing systems. The whole system comes up as the concurrent composition of these components. The implementation of the abstract model is achieved using CafeOBJ, an executable, industrial strength algebraic specification language. The visualization of the specification can be done using CafeOBJ graphical notation. In addition, invariant and behavioral properties of mobile systems can be proved through theorem proving techniques, such as structural induction and coinduction that are fully supported by the CafeOBJ system. The application of the proposed framework is presented through the modeling of a mobile computing environment and the services that need to be supported by the former.

This paper describes a novel discrimination method of pulmonary nodules based on statistical analysis of thoracic computed tomography (CT) scans. Our previous Computer-Aided Diagnosis (CAD) system can detect pulmonary nodules from CT scans, but, at the same time, yields many false positives. In order to reduce the false positives, the method proposed in the present paper uses a relationship between pulmonary nodules, false positives and image features in CT scans. The trend of variation of the relationships is acquired through statistical analysis of a set of CT scans prepared for training. In testing, by use of the trend, the method predicts the appearances of pulmonary nodules and false positives in a CT scan, and improves the accuracy of the previous CAD system by modifying the system's output based on the prediction. The method is applied to 218 actual thoracic CT scans with 386 actual pulmonary nodules. The receiver operating characteristic (ROC) analysis is used to evaluate the results. The area under the ROC curve (Az) is statistically significantly improved from 0.918 to 0.931.

This study investigates a new transmission method of light from a point source in a multimode graded-index fiber. The position of the point source is arranged along with a mode pattern to precisely determine the location of an output point image. Propagation performance is observed in an experiment and estimated by simulation.

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.

We survey traffic matrix models, whose elements represent the traffic demand between source-destination pair nodes. Modeling the traffic matrix is useful for multilayer Traffic Engineering (TE) in IP optical networks. Multilayer TE techniques make the network so designed flexible and reliable. This is because it allows reconfiguration of the virtual network topology (VNT), which consists of a set of several lower-layer (optical) paths and is provided to the higher layer, in response to fluctuations (diurnal) in traffic demand. It is, therefore, important to synthetically generate traffic matrices as close to the real ones as possible to maximize the performance of multilayer TE. We compare several models and clarify their applicability to VNT design and control. We find that it is difficult in practice to make an accurate traffic matrix with conventional schemes because of the high cost for data measurement and the complicated calculations involved. To overcome these problems, we newly introduce a simplified traffic matrix model that is practical; it well mirrors real networks. Next, this paper presents our developed server, the IP Optical TE server. It performs multilayer TE in IP optical networks. We evaluate the effectiveness of multilayer TE using our developed IP Optical server and the simplified traffic matrix. We confirm that multilayer TE offers significant CAPEX savings. Similarly, we demonstrate basic traffic control in IP optical networks, and confirm the dynamic control of the network and the feasibility of the IP Optical TE server.

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.