Irradiation of ultrasonic waves induces cavitation in a solution, and a chemical action instigated by radicals occurs. This chemical action is reported to be most efficient in the region of several hundred kilohertz frequencies. Application of sonochemistry based on ultrasonic chemical action remains at the laboratory scale and has not yet reached the industrial practical scale. In order to realize practical applications of sonochemistry, there is a need to scale-up the sonochemical reactors. For this purpose, we used a 490-kHz cylindrical sonochemical reactor that is long in the irradiation direction, and used potassium iodide (KI) dosimetry, sonochemical luminescence, and calorimetry to evaluate the sonochemical reaction efficiency and reaction field of the reactor. We performed the evaluation with the ultrasonic irradiation direction in the horizontal and vertical directions. As a result, we observed sonochemical luminescence and a rise in temperature near the reflection surface, for both the horizontal and vertical irradiation. For the horizontal irradiation, the 13 concentration was evenly distributed in the irradiation direction. Moreover, we found that the sonochemical reaction efficiency was the same for both the horizontal irradiation and the vertical irradiation. (C) 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 1-8, 2007; Published online in Wiley InterScience (www.interscience.wiley.com).
There has recently been much discussion of MPLS multicast approaches. MMT and BLAST-Cast have been proposed as means of establishing multicast LSP using unicast LSP. These techniques are useful not only as transfer techniques in introducing the MPLS multicast technique, but also for the deployment of MPLS multicasting in established MPLS networks, since the scale can be expanded stepwise, and the cost of deployment and operation can be reduced in the deployment of MPLS multicast in established MPLS networks. However, there have been few studies of the detailed signaling protocol to be used in such an approach, or of problems accompanying these techniques. Consequently, we investigated a signaling protocol that can be applied to these approaches, and devised an MPLS multicast mechanism using RSVP-TE. The proposed mechanism was implemented and evaluate. This paper discusses the design and implementation of the proposed mechanism, together with its evaluation. (C) 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(11): 40-49, 2007; Published online in Wiley InterScience (www.interscience.wiley.com).
Face detection from images is a complex and non-linear problem due to the various kinds of face images. This problem is solved by conversion of the original feature vectors extracted from images into high-dimension feature vectors using nonlinear mapping, and then finding face/nonface discriminant functions in the mapping space. If such discriminant functions are based on the inner products of high-dimension vectors, such inner products can be easily obtained by substitute calculations of kernel functions in the original feature space. However, in conventional recognition algorithms using kernel functions, numerous features are required to improve recognition accuracy. This paper proposes a new face detection on the basis of Kullback-Leibler divergence (KLD). KLD refers to a distance between the distributions of face and nonface data for certain features. Features with large KLD are used for face detection. Moreover, by evaluating the features based on their KLDs, we can generate new features, and deal with different kinds of features concurrently. In experiments, a classifier designed by the proposed method achieved high recognition performance, while using few features. (C) 2007 Wiley Periodicals, Inc.
Median filters and other nonlinear filters have been investigated for restoration of degraded images with Poisson noise. Recently, subband image restoration using the wavelet transform has been attracting much attention. This method is effective for small-amplitude noise, but in the case of Poisson noise, large-amplitude noise exceeds the preset threshold and is not removed. In this study, we propose a new method of noise removal from degraded images with Poisson noise by using a combination of the M-transformation [5] and the wavelet BayesShrink method. (C) 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3. 90(11): 11-20, 2007; Published online in Wiley InterScience (www.interscience.wiley.com).
Coordinated checkpointing techniques ensure that a consistent global state is maintained by means of coordination between processes. The approach requires that application messages temporarily cease to be exchanged but the rollback procedure when recovering from a fault is consequently simplified and the recovery costs are small. With current reductions in communications costs, the importance of coordinated techniques may be seen to be growing. However, in large-scale systems there is a possibility that performance will be seriously impaired due to the frequent halting of the exchange of messages. In this paper we propose a method whereby coordination is performed at only a subset of the checkpoint generation points that are periodically visited while at the remaining points each process independently generates an incremental snapshot. This method aims to both alleviate the performance degradation incurred from coordination and to realize relatively high-speed recovery. In evaluating the effectiveness of this method we estimate the checkpointing overheads and recovery costs using a probabilistic model and simulations and compare it with existing coordination methods. The results show that the proposed method is more effective than existing coordination methods from the perspective of both performance and reliability in environments with a relatively low frequency of messages. In addition, we perform comparisons of two different delta schemes for representing the incremental snapshots and discuss which environments they are each respectively suited to. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 39– 53, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20296
A structure is proposed for an adaptive system with an adaptive filter located before the unknown system (pre-inverse adaptive system) for estimation of the inverse of the transfer function (inverse transfer function) of the unknown system. In general, when an adaptive transversal filter is used as an adaptive filter, the delay signal of the output of the unknown system is needed in the adaptive algorithm for the weights. Since an adaptive filter is inserted in the front stage, this signal cannot be observed, so that a replica of the unknown system is needed. In this paper, an adaptive system that does not require this replica is discussed. Estimation of the inverse transfer function of the minimum phase of the unknown system is performed by an adaptive exponential filter and an inverse copy of the weights of the exponential filter placed in front of the unknown system. The signal within the adaptive algorithm consists of the observable input signal to the adaptive exponential filter and the estimation error. Estimation of the inverse transfer function for the allpass transfer function of the unknown system is performed by the adaptive transversal filter and the reversing copy of the weight to the transversal filter located before the unknown system. The signal in the adaptive system consists of the observable input signal to the exponential filter and the estimation error. Convergence of the weight is studied from the point of view of monotonic increase of the gradient. The unique feature of the approach is that the algorithm of the two adaptive filters consists of a gradient algorithm with guaranteed convergence for the weights and of copies of the weights after updating. Finally, a performance evaluation of the adaptive system and a comparison with conventional systems are performed by numerical simulation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 10– 17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20305
Existing data-driven processors offer the advantages of being able to naturally resolve the problems inherent in a wide variety of granularities of parallelism, and of being able to multiprocess without overhead. However, because an instruction is not issued until the instruction that generates the source operand finishes executing, a delay equal to the number of stages in the pipeline occurs before an instruction that has a data-dependency relationship can be executed. As a result, portions of sequential processing in a program become a bottleneck. The authors are therefore in the process of developing an LSI processor that is able to retain the advantages of conventional data-driven processors while being able to efficiently execute blocks of sequential processing. This paper presents and evaluates the performance of the proposed execution model and pipeline structure of this processor. This processor uses the same pipeline to perform instruction level multiprocessing of data-driven programs that issue instructions based on the data-dependency relationships and control-driven programs that issue instructions sequentially based on a program counter. The effectiveness of parallel processing by data-driven programs, improvements in the efficiency of sequential processing by introducing control-driven programs, and the ability to evenly share the pipeline when data-driven and control-driven programs are multiprocessing are evaluated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(12): 36–49, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20358
This paper proposes a novel data hiding method for JPEG 2000 coded images that embed multi-level information into quantized discrete wavelet transformed coefficients. Since the proposed method hides information represented as an integer to a transformed coefficient rounded to an integer, a JPEG 2000 code-stream conveying data keeps its standard JPEG 2000 code-stream structure. The proposed method is able to extract hidden data Without memorizing embedding positions; it thus Chooses transformed coefficients to which data is hidden freely. This characteristic makes the proposed method suitable for hiding data to a JPEG 2000 coded image with consideration of Region of Interest (ROI) coding that is a major feature. Simulation results show the effectiveness of the proposed method. (c) 2007 Wiley Periodicals, Inc.
This paper is intended to develop an LSI that restores in real time an image pattern with defects and contamination. To this end, based on the principle of shape formation in biological bodies, a reaction-diffusion model that can generate and repair Turing patterns, such as stripes and spots seen in fingerprint and body marks, is proposed. A parallel architecture of the reaction-diffusion chips incorporating this model is presented. By means of circuit simulation, it is shown that this LSI can restore stripe (spot) patterns. (C) 2006 Wiley Periodicals, Inc.
In this paper the authors propose a program allocation method for the purpose of achieving real-time processing using a chip multiprocessor-type data-driven processor. The data-driven processor can perform parallel processing of executable processes without interference as long as the pipeline is not overloaded. The turnaround time for the individual processes being subjected to multiprocessing is independent of other processes being executed at the same time, and is maintained as is for the execution time when a single process is executed. Therefore, real time for a program can be estimated, and if the program can be allocated to a process such that overload does not occur, then real-time processing can be achieved without scheduling during execution. In this paper the authors first formalize a program allocation method in a data-driven processor. They then propose a combined method using genetic algorithms and a heuristic algorithm that uses lists as a program allocation method that is better at satisfying the time constraints and offers greater scalability for large-scale program and multiprocessor systems to be subjected to allocation. Finally, the authors use experiments in which a communications protocol process is allocated to verify the effectiveness of their program allocation method. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 48– 60, 2007; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/ecjc.20324
In this paper, the authors propose a new noise suppression technique that executes iterative processing and sets parameters that are suited for that processing in the spectral subtraction method, which is a noise reduction technique for noise-added speech. Iterative processing is a technique in which speech enhancement processing is executed by considering the estimated speech that is obtained when noise reduction processing is executed once as the input signal again so that a reduction of the residual noise is anticipated. A further reduction of residual noise for which speech degradation is controlled can be achieved by adjusting the parameters for each iteration. The authors also simultaneously propose a technique for maintaining the real-time nature of spectral subtraction when the proposed technique is executed. They use actual speech to which white noise, automobile noise, and crowd babble noise is added to compare the characteristics of the two proposed methods with the conventional spectral subtraction method and its improvements. The authors verified according to objective and subjective evaluations that each proposed technique showed superior results in all noisy environments. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(4): 39 –51, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20242
We used ultrasound exposure to perform disaggregation and surface modification of aggregated nano-diamond particles. We formed a standing-wave sound field using a Langevin transducer to drive a stainless-steel vibrating disk installed at the bottom of a water tank, and generated efficient acoustic cavitation. With 20 minutes of ultrasonic exposure, we were able to reduce aggregated nano-diamond particles with average particle diameters of 5µm to average particle diameters of 100 nm or less. We also confirmed that we had improved the zeta potential, an index of surface modification, by a factor of more than two. Furthermore, we used a hydrophone to measure the sound field inside the water tank, and calculated the average acoustic intensity at 800W/m2 or more to demonstrate that the nano-diamond surfaces had been modified. We confirmed that the zeta potential and average particle diameter of the nano-diamonds could be maintained for at least 150 days after ultrasound exposure. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(12): 10– 18, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20268
Changes are occurring in the environment Surrounding business organizations, such as the development of open networks and flexible migration of employees. In the context of such changes, it has recently been considered more important to prepare measures against information leaks from inside the organization. Among these, an urgent issue in ordinary organizations is to reinforce the existing business system so as to realize highly cost-effective security functions. This paper considers an actual case of information leakage as a model and systematically summarizes the conditions regarding security functions, based on the views of legal specialists. An actually introduced security system based on fingerprint identification is investigated, and it is shown that practical security measures can be established. A development configuration is then proposed in which part of the security system is placed in a data center and shared by multiple organizations. (C) 2007 Wiley Periodicals, Inc.
In the ubiquitous computing environment, the physical locations of persons and goods are extremely important information. In this paper, the design of a fully distributed localization system based on ultrasound, mainly for the indoor environment, is described. This system performs localization with as few positioning references as possible by an iterative technique. When such a localization method is used, deterioration of localization accuracy due to no-line-of-sight signals and to accumulated errors is a problem. In this paper, the resolution of these problems is discussed and system evaluation by implementation experiments is carried out. With 24 devices, localization with an accuracy of about 20 cm is demonstrated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 17– 26, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20249
We propose hybrid intra prediction, a new method for generating intra prediction images in intra coding. When generating intra prediction images in pixel domain, this method selects the intra prediction image from one generated using pixel-based intra prediction and another generated using block-based intra prediction, according to which is optimal based on a rate distortion criterion. This selection is performed for macroblock units and segmented macroblock units that we term sub-macroblocks. In addition, information indicating which intra prediction method was used within a macroblock is described within the bitstream using a tree structure. We evaluate the proposed method by implementing it in an H.264-based intra prediction coding scheme. Experimental results confirm that compared to conventional methods, our implementation of the proposed method is able to achieve a 6% reduction in bit rate while maintaining the same peak signal to noise ratio (PSNR). (C) 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(2): 50-62, 2007;
We propose a method of keeping conversations secret using the differences in the amount of degradation (bit-reversal sensitivity) in decoded speech when reversing the bits in the ITU-T standard 8-kbit/s sound encoding method G.729. In communications using the Internet or other open networks, there is a risk of eavesdropping by third parties, so the content of communications should be hidden using appropriate methods. In this paper we analyze the bit-reversal sensitivity in G.729 and propose an efficient method for creating secrecy based on these results. In the proposed method, the decoded speech is greatly distorted and secrecy is achieved by converting and operating on only 10 of 80 bits in the G.729 synthesis filter and excitation source. Using objective values we evaluated the efficiency of each operation and using subjective evaluations we confirmed that our method is good at maintaining secrecy. (C) 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(2): 63-71, 2007;
In sensor networks, many of the sensor nodes are often positioned in clusters, and there is a correlation between the data obtained at the various sensor nodes by observation. This kind of observational data is collected at fusion centers. In this paper, we study the observation precision at fusion centers from the viewpoint of the Kullback–Leibler (KL) information. In particular, we consider transmission path errors arising when transmission is made from each sensor node via wireless communication paths, as a factor in the deterioration of the KL information, or in other words, observation precision, and study its effects and methods for reducing it. In this paper, we study the KL information obtained in fusion centers when there have been transmission path errors in cases where the correlation between observational data is all equal, and where the correlation is random. We show that the deterioration of the KL information can be reduced in fusion centers by using the correlation of observational data in the estimates of error data. In addition, we present examples of estimating the correlation between observational data in fusion centers that use correlation, and of estimating error data using correlation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(11): 1–10, 2007; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecjc.20250
For satellite communication links to be used comprehensively and in a manner consistent with their features as a basis for Internet communications, it has become necessary to add a framework based on the features of satellite communications to the protocol architecture of the Internet. For this purpose, the authors' group has been engaged in the development of the new UDLR (unidirectional link routing) protocol mechanism. This paper discusses UDLR from the following viewpoints. (1) The method of actual network construction should be established effectively so as to make use of the features and advantages of satellite communications. (2) Conditions other than protocol definitions should be stated clearly for the purpose. (3) A feasibility network should be constructed to explore the optimal application area. The principles in their current form are summarized for each of the above points. UDLR has been implemented on the feasibility testbed over the whole Asian area. The transparent coexistence of a multicast video distribution system utilizing the concurrency feature of satellite communications and other Internet application systems has been achieved. It is demonstrated that UDLR functions effectively in the use of satellite communications in the Internet. The possibility of using satellite communications to support new modes of Internet application, such as broadcast stream distribution, is shown. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(5): 60– 69, 2007; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecjc.20319
The construction of an infinite number of nonstabilizer codes of Clifford type was given for the first tithe by the authors. However, the method of construction was restricted to encoding from odd prime p-level quantum states to 2p-level states. In this paper, the result is extended to the construction of nonstabilizer-type quantum codes which encode quantum states of arbitrary odd 2j+1-level to quantum states of 2h(2j+1)-level, where h are mutually prime 2j+1. (C) 2006 Wiley Periodicals, Inc.
In recent years theories on filter banks (cyclic filter banks) in cyclic LTI systems have been proposed. Not only are cyclic filter banks that use cyclic convolution suitable for processes such as picture signals (finite signals), the design of cyclic filter banks is also limited to specific discrete frequency points. Consequently, there are advantages such as greater freedom of design compared to filter banks (noncyclic filter banks) in noncyclic LTI systems which use conventional linear convolution. Definite design methods have been given which realize a two-partition construction as a cyclic filter bank with linear phase characteristics and orthogonality at the same time not possible in conventional noncyclic filter banks up to the present. Other than this, there have been no discussions on multipartition construction utilizing, for example, a modulated structure, methods that utilize various other advantages which can obtain a cyclic LTI system, or discussions on problems which can be solved by these. Based on this, we propose one method to achieve a cyclic filter bank in this paper. We propose a configuration that uses DFT modulation. To start with, we lead with polyphase expressions of cyclic filter banks that use DFT modulation and then present complete reconstruction conditions. We subsequently mention that the complete reconstruction conditions are given as a linear equation whose synthesized coefficients are unknown parameters by means of using a resolution given beforehand. Next, we examine the essential properties of a cyclic LTI system and then describe the advantages of this configuration method obtained by means of using these properties. Finally, we provide a design example of the proposed cyclic filter bank and show that a cyclic filter bank can be configured with DFT modulation. In addition, we mention the combined effects when dividing and synthesizing image signals based on applying this method to image compression applications. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(5): 9– 18, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20070
