We have proposed a recognition method for pulmonary nodules based on experimentally selected feature values (such as contrast, circularity, etc.) of pathologic candidate regions detected by our Variable N-Quoit (VNQ) filter. In this paper, we propose a new recognition method for pulmonary nodules by use of not experimentally selected feature values, but each CT value itself in a region of interest (ROI) as a feature value. The proposed method has 2 phases: learning and recognition. In the learning phase, first, the pathologic candidate regions are classified into several clusters based on a principal component score. This score is calculated from a set of CT values in the ROI that are regarded as a feature vector, and then eigen vectors and eigen values are calculated for each cluster by application of principal component analysis to the cluster. The eigen vectors (we call them "eigen-images") corresponding to the S-th largest eigen values are utilized as base vectors for subspaces of the clusters in a feature space. In the recognition phase, correlations are measured between the feature vector derived from testing data and the subspace which is spanned by the eigen-images. If the correlation with the nodule subspace is large, the pathologic candidate region is determined to be a nodule, otherwise, it is determined to be a normal organ. In the experiment, first, we decide on the optimal number of subspace dimensions. Then, we demonstrated the robustness of our algorithm by using simulated nodule images.

We propose an information-sharing network system, capable of forming and dynamically reconfiguring multiple information-sharing groups on the same network platform by using wavelength routing and distributed shared memory technologies. The network system comprises information-sharing terminal nodes equipped with a shared memory and a wavelength-tunable transmitter, network management terminal and an arrayed-waveguide grating (AWG). The information-sharing terminal nodes are connected to an AWG by a pair of optical fibers, forming a star-shaped topology. Information is shared among the information-sharing terminal nodes through the establishment of a logical information-sharing ring. This is accomplished by adjusting the output of the wavelength-tunable transmitter at each terminal node to an appropriate wavelength according to the wavelength-routing characteristics of the AWG wavelength router. We developed a prototype information-sharing network system, in which, as preliminary experiments, HDTV and SDTV videos were used for real-time information sharing. The dynamic reconfiguration of information-sharing groups and a simple automatic restoration technique have been successfully demonstrated. The system is applicable to distributed computer processing systems and high-capacity information-sharing applications such as high-quality videoconferences.

The playout delay for voice over IP applications is adjusted on every talkspurt. The parameter β that controls the delay/packet loss ratio is usually fixed, based on high jitter conditions. In this letter, a β-adaptive playout algorithm is presented, where the β is adjusted. The buffering delays and lateness rates are compared against the existing algorithm with the fixed β. We show that the β-adaptive system improves the lateness loss performance, especially for low jitter conditions, while maintaining almost identical buffering delay/lateness loss performance when jitter is high.

Broadening the frequency bandwidth of antennas has been one of the major subjects concerning antenna design technologies. Two of the major subjects for microstrip antennas, which appeared in the 1970s, have also been the broadening of the frequency bandwidth and the sharing of multifrequency bands. In this paper, we describe the broadband and multiband techniques of printed antennas, and show the configurations of realized broadband and multiband antennas and their characteristics. Here, resonant-type microstrip antennas, planar monopole antennas, fractal antennas and ultra-wideband printed antennas are introduced. The optimum design techniques using a genetic algorithm are introduced for developing broadband and multiband printed antennas. The usefulness of this method is verified by the simulation and experimental results of the fabricated planar monopole antenna which has ultrawide-band characteristics.

The theory of the method of moments (MoM), which has been widely used as a numerical technique for analyzing the characteristics of antennas and scatterers, is described. First, the steps of MoM to solve integral equations for conducting wires and planes are presented. It is pointed out that MoM combined with Galerkin's method yields highly accurate results. The importance of ensuring the continuity condition of current on conducting bodies is emphasized and numerical examples for a conducting structure involving junctions of wire segments and planar segments are presented. Finally, MoM for dielectric scatterers including recent developments is described.

This paper proposes a new framework to produce humanoid animations for simulating human tasks. Natural working movements are generated via management of motion capture data with our simulation package. An extensible middleware controls reactive human behaviors, and all processes of simulation in a cyber factory are controlled through XML documents including motions, scene objects, and behaviors. This package displays simulation using Web3D technology and X3D specifications which can supply a common interface for customizing cyberworlds.

Caustics are patterns of light focused by reflective or refractive objects. Because of their visually fascinating patterns, several methods have been developed to render caustics. We propose a method for the quick rendering of caustics formed by refracted and converged light through transparent objects. First, in the preprocess, we calculate sampling rays incident on each vertex of the object, and trace the rays until they leave the object taking refraction into account. The position and direction of each ray that finally transmits the transparent object are obtained and stored in a lookup table. Next, in the rendering process, when the object is illuminated, the positions and directions of the rays leaving the object are calculated using the lookup table. This makes it possible to render refractive caustics due to transparent objects at interactive frame rates, allowing us to change the light position and direction, and translate and rotate the object.

The fairness algorithm of the Resilient Packet Ring IEEE 802.17 standard suffers from throughput degradation under an unbalanced overload. This letter proposes an enhanced fairness algorithm using a valuable piece of information, represented by the transit buffer length, about congestion alleviation on a congested node, under which the throughput degradation can be completely improved.

In this paper, a cycle-based network recovery method for optical mesh networks is studied. The study in this paper concentrates on improving two performance requirements on network recovery: efficient spare resource utilization, and robustness for multiple failures. The proposed method uses multiple ring-covers and performs distributed link restoration using preplanned logical cycles embedded in physical mesh topologies. This method provides fast and simple recovery operation by exploiting the characteristics of ring topology and also provides efficient resource utilization by using multiple backup paths per link to improve the sharability of overall spare resources in the networks. With this method, layered reliability can be provided to network services by enabling priority-based robustness against multiple failures. The performance results reveal the trade-off between the resource efficiency for single failure and the robustness for multiple failures, and show the preconfiguration of a few logical cycles per link can provide enhanced resource efficiency and priority-based hierarchical robustness.

This paper describes pixel-parallel image-matching circuit schemes that provide the optimal binarization, the high-speed low-power comparison, and the accurate matching of fingerprint images needed for fingerprint verification. Image binarizing is adjusted adaptively during the fingerprint sensing operation. The obtained image is compared with the template in the pixel array, and the results from all of the pixels are totaled by a variable-delay circuit at high speed and low power. For accurate matching, the image is scanned by shifting it in the pixel array while maintaining whole image. The experimental results demonstrate that the proposed schemes provide optimal binary images of most fingers under any condition and environment, 11-µs 147-µW totaling of results from 20,584 pixels, and wide-range image scanning and accurate matching for fingerprint images. These schemes are effective for fast and low-power fingerprint verification for a single-chip fingerprint sensor and identifier.

A new edge-coloring algorithm for bipartite graphs is presented. This algorithm, based on the framework of the O(m log d + (m/d) log (m/d) log d) algorithm by Makino-Takabatake-Fujishige and the O(m log m) one by Alon, finds an optimal edge-coloring of a bipartite graph with m edges and maximum degree d in O(m log d + (m/d) log (m/d)) time. This algorithm does not require elaborate data structures, which the best known O(m log d) algorithm due to Cole-Ost-Schirra depends on.

In this paper, a detailed model of a hybrid dual-stage Raman/erbium-doped fiber (EDF) amplifier is presented. This model takes into account the impact of double Rayleigh backscattering (DRB) noise, amplified spontaneous emission (ASE) noise and Kerr-nonlinearity induced impairments in the amplification process. Using this model, we present a comprehensive analysis of the operation of hybrid dual-stage Raman/EDF amplifiers under above impairments. We show that under fixed total gain conditions for the amplifier module, high Raman gain causes the introduction of increased DRB noise to the amplified signals whereas low Raman gain causes the introduction of high ASE noise power through EDF amplifier. Therefore a balance between the Raman amplifier gain and EDF amplifier gain is required for optimal operation. These observations are then combined to show an optimization process, which could be applied to improve the design of hybrid dual-stage Raman/EDF amplifiers.

The wavelength-division multiplexing (WDM) technology has been popular in communication societies for providing very large communication bands by multiple lightpaths with different wavelengths on a single optical fiber. Particularly, a double-ring optical network architecture based on the packet-over-WDM technology such as the HORNET architecture, has been extensively studied as a next generation platform for metropolitan area networks (MANs). Each node in this architecture is equipped with a wavelength-fixed optical-drop and a fast tunable transmitter so that a lightpath can be established between any pair of nodes without wavelength conversions. In this paper, we formulate the optical-drop wavelength assignment problem (ODWAP) for efficient wavelength reuse under heterogeneous traffic in this network, and prove the NP-completeness of its decision problem. Then, we propose a simple heuristic algorithm for the basic case of ODWAP. Through extensive simulations, we demonstrate the effectiveness of our approach in reducing waiting times for packet transmissions when a small number of wavelengths are available to retain the network cost for MANs.

This paper reports on the suitability of the SUSAN filter for the removal of artifacts that result from quantization errors in wavelet video coding. In this paper two extensions of the original filter are described. The first uses a combination of 2-D spatial filtering followed by 1-D temporal filtering along motion trajectories, while the second extension is a pure 3-D motion compensated SUSAN filter. The SUSAN approach effectively reduces coding artifacts, while preserving the original signal structure, by relying on a simple pixel-difference-based classification procedure. Results reported in the paper clearly indicate that both extensions efficiently reduce ringing that is the prevalent artifact perceived in wavelet-based coded video. Experimental results indicate an increase in perceptual as well as objective (PSNR) decoded video quality, which is competitive with state-of-the-art post-processing algorithms, especially when low computational demands of the proposed approach are taken into account.

Cyberworlds are being formed in cyberspaces as computational spaces. Now cyberspaces are rapidly expanding on the Web either intentionally or spontaneously, with or without design. Widespread and intensive local activities are melting each other on the web globally to create cyberworlds. The major key players of cyberworlds include e-finance that trades a GDP-equivalent a day and e-manufacturing that is transforming industrial production into Web shopping of product components and assembly factories. Lacking proper theory and design, cyberworlds have continued to grow chaotic and are now out of human understanding and control. This research first presents a generic theoretical framework and design based on algebraic topology, and also provides an axiomatic approach to theorize the potentials of cyberworlds.

We demonstrated a vertically coupled microring resonator (VCMRR) filter as an Add/Drop wavelength filter. However, the accuracy of center wavelength was not sufficiently high for dense wavelength division multiplexing (DWDM) systems. Thus, a UV trimming technique using a SiN (n=2.01 at λ=1.55 µm) ring core was previously developed. Although a wide center wavelength trimming range of -12.1 nm and the long-term stability of center wavelength were realized, the core size required for single-mode propagation was too small for fabrication using a photolithography process. Therefore in this study, we introduced SiON as the microring core to relax the single-mode condition of core size. We discovered a large UV sensitivity of SiON film formed by a PECVD method, and a wide range UV trimming of microring resonator of -10.5 nm was demonstrated using this phenomenon.

This paper presents a long length discrete Hartley transform (DHT) design with a new hardware efficient distributed arithmetic (DA) approach. The new DA design approach not only explores the constant property of coefficients as the conventional DA, but also exploits its cyclic property. To efficiently apply this approach to long length DHT, we first decompose the long length DHT algorithm to short ones using the prime factor algorithm (PFA), and further reformulate it by using Agarwal-Cooley algorithm such that all the partitioned short DHT still consists of the cyclic property. Besides, we also exploit the scheme of computation sharing on the content of ROM to reduce the hardware cost with the trade-off in slowing down the computing speeds. Comparing with the existing designs shows that the proposed design can reduce the area-delay product from 52% to 91% according to a 0.35 µm CMOS cell library.

In this letter, we propose "Torus Ring", which is a modified version of 2-level hierarchical ring. The Torus Ring has the same complexity as the hierarchical rings, since the only difference is the way it connects the local rings. It has an advantage over the hierarchical ring when the destination of a packet is the adjacent local ring, especially to the backward direction. Although we assume that the destination of a network packet is uniformly distributed across the processing nodes, the average number of hops in Torus Ring is equal to that of the hierarchical ring. However, the performance gain of the Torus Ring is expected to increase, due to the spatial locality of the application programs in the real parallel programming environment. In the simulation results, latencies of the interconnection network are reduced by up to 19%, with moderate ring utilization ratios.

For mission-critical and safety-critical systems such as medical, financial, or administrative information systems, a secure and reliable storage system is indispensable. The main purpose of our research is to develop a highly secure and highly reliable storage system. We have proposed a storage system that utilizes a secret sharing scheme. The storage system is called the Secret Sharing Storage System. So far, we have developed a prototype of the storage system. In this paper, we propose an automatic repair mechanism, and an interval decision method for this system.

Nowadays, customers spend much time and effort in finding the best suitable goods since more and more information is placed on-line. To save their time and effort in searching the goods they want, a customized recommender system is required. In this paper we present an improved neighbor selection algorithm that exploits a graph approach. The graph approach allows us to exploit the transitivity of similarities. The algorithm searches more efficiently for set of influential customers with respect to a given customer. We compare the proposed recommendation algorithm with other neighbor selection methods. The experimental results show that the proposed algorithm outperforms other methods.