A data-parallel processing approach is promising for real-time volume rendering because of the massive parallelism in volume rendering. In data-parallel volume rendering, local results processing elements(PEs) generate from allocated subvolumes are integrated to form a final image. Generally, the integration causes an overhead unavoidable in data-parallel volume rendering due to communications among PEs. This paper proposes a data-parallel shear-warp volume rendering algorithm combined with an adaptive volume subdivision method to reduce the communication overhead and improve processing efficiency. We implement the parallel algorithm on a message-passing multiprocessor system for performance evaluation. The experimental results show that the adaptive volume subdivision method can reduce the overhead and achieve higher efficiency compared with a conventional slab subdivision method.

We propose a new probabilistic ID-based non-interactive key sharing scheme that has non-separable secret-key functions and a non-separable common-key function. The proposed scheme uses the calculation over modulo-P, modulo-Q and over integer ring for realizing non-separability. This proposed scheme has a large threshold against linear attack by the collusive entities.

The MC-CDMA (multi-carrier code division multiple access) technique is known to be appropriate for high data-rate wireless communications such as mobile multimedia communication due to its robustness to multipath fading and its capability of handling high data rates with a simple one-tap equalizer. In this paper, the performance of an MC-CDMA system employing antenna array at the base station in a fading channel is presented. Following the discussion of optimal beamformer not requiring explicit DOA (direction of arrival) or training signals, it is shown that the interference from other users within a cell can be significantly reduced for both reverse link (mobile to base station) and forward link (base station to mobile) using an MC-CDMA with antenna array, thus increasing the system's user-capacity. Computer simulations that demonstrate user-capacity improvement of the proposed approach are discussed.

The abilities of fuzzy inference methods in modeling of complicated systems are implemented to electromagnetics for the first time. The very popular and well known monopole antenna is chosen as a general example and a fast, simple and accurate fuzzy model for its input impedance is made by introducing a new point of view to impedance basic parameters. It is established that a surprisingly little number of input data points is sufficient to make a full model and also the system behavior (dominant rules) are saved as simple membership functions. The validity of the derived rules is confirmed through applying them to the case of thin-angled monopole antenna and comparing the results with the measured. Finally using the spatial membership function context, input impedance of thick-angled monopole antenna is predicted and a novel view point to conventional electromagnetic parameters is discussed to generalize the modeling method.

A shared buffer ATM switch loaded with bursty input traffic is modeled by a discrete-time queueing system. Also, the unbalanced and correlated routing traffic patterns are considered. An approximation method to analyze the queueing system under consideration is developed. To overcome the problem regarding the size of state space to be dealt with, the entire switching system is decomposed into several subsystems, and then each subsystem is analyzed in isolation. We first propose an efficient algorithm for superposing all the individual bursty cell arrival processes to the switch. And then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the obtained steady-state probabilities, we can derive some performance measures such as cell loss probability and average delay. Numerical examples of the proposed approximation method are given, which are compared with simulation results.

Ring head recording on single-layer perpendicular recording media was studied by a simple simulation analysis based on a loop tracing method considering only the perpendicular component. Although the assumed model was primitive, the simulation results qualitatively well explained the experimental results such as a decrease in output at high recording currents and its relaxation upon using a smaller gap-length head. The simulation results revealed that achievable recorded magnetization is, in general, much smaller than the saturation value due to a broad distribution of the ring head field, but a medium with a steeper slope in the perpendicular M-H loop could improve the recording performance. This was confirmed experimentally for the medium with a steeper loop slope, though the medium exhibited a larger medium noise at high densities. It was suggested that the development of perpendicular recording for higher output and lower noise could be performed for both media with a small and steep loop slope. The former should be improved by means of the recording head while the latter by the media. A large improvement is expected for both cases.

We have developed a diagnostic Case-Based Reasoning (CBR) system, Doctor, which infers possible defects in a home electrical appliance and lists up necessary service parts. The CBR is suitable to build a diagnostic system for the field service because the CBR imitates how experienced service technicians infer and is able to learn defect trends and novel repair cases from a service report database. In order to apply a CBR system to this real-world problem, Our system has the following new features: (1) Its CBR mechanism utilizes not only repair cases, but also diagnostic rules that are elicited from human experts so that accurate diagnosis can be achieved. (2) Its casebase maintenance mechanism updates the casebase and adapts it to the changing real world.

An accurate and efficient numerical solution is presented for a two-dimensional electromagnetic wave scattering from a multilayered resistive strip grating embedded in a dielectric slab. Both E- and H-waves are treated. The problem is formulated into a set of integral equations, which is solved by the moment method accompanied by a regularization procedure. The resultant set of linear algebraic equations has the form of the Fredholm second kind, and therefore yields stable and accurate numerical solutions. The power distribution is computed for several grating parameters. Attention is paid to seek a set of parameters that maximizes absorption in the strips. The low frequency approximate formulas are also derived. This analysis would be useful in designing electromagnetic wave absorbers.

A head-disk spacing tester that includes the effect of lubricant will be necessary if the slider-disk interaction is to be considered. The interaction and interaction induced spacing variation can be quantitatively characterized by optical method and by replacing the functional disk media with a glass disk covered with a carbon layer and a lubricant layer of the same materials and the same layer thickness as the functional disk media. This paper reports a tester configuration based on that concept. Experimental investigations into the nanometer spaced head-disk interface with such a setup are presented also. Results indicate that the lubricant plays an important role in slider-disk interaction and the vibration of the slider-disk interface. Two types of interface vibration were noticed: contact vibration and bouncing vibration. For the bouncing case, the natural frequency of air-bearing and its fold frequencies will be excited and air-bearing plays more important role in the determination of the slider vibration, comparing with the contact-vibration case.

Measuring the cross-track profiles of a microtrack created by DC erasing both sides of a recorded track, the linear recording density dependence of the written track fringe width and that of the read track fringe width were successfully separated, both of which are usually observed in combination. It was clarified that when a thin-film head is used for reading, the read track fringe width increases as the linear recording density decreases, whereas it remains almost constant when an MR head with wide shielding layers is used. It was also clarified that the record head fringe width for a thin-film inductive head is less dependent on the linear recording density. The effects of several heads with different pole shapes on track edge phenomena were also evaluated, by partially DC erasing a written track from the track edge and measuring the change in the residual track output. It was found that the fringe field width of a record head changes depending on the pole shape, and the trimming of record head poles is very effective in reducing head field fringe effects.

This paper proposes an implementation of the Telecommunications Information Networking Architecture (TINA) connection management system, based on our involvement of The TINA Trial (TTT). The system is used for managing ATM networks, which consist of network elements with SNMP interfaces. It provides setup, configuration, and release of ATM connection with a GUI-based network design tool that generates network resource data used for deploying TINA software components. This paper reports on a method of implementing TINA components over a Distributed Processing Environment (DPE) and an effective way to manage computational objects with multiple interfaces by using the Trading Service.

Internet communication is increasingly becoming an important element in daily life. Keeping this network safe from malicious elements is an urgent task for network management. To maintain the security level networks are generally, monitored for indications of usage with ill-intentions. Such indications are events which need to be collated, correlated and analyzed in real-time to be effective. However, on an average medium to large size network the number of such events are very large. This makes it practically impossible to analyze the information in real-time and provide the necessary security measures. In this paper, we propose a mechanism that keeps the number of events, to be analyzed, low thereby making it possible to provide ample security measures. We discuss a real-time Intrusion Detection System (IDS) for detecting network attacks. The system looks out for TCP ACK/RST packets, which are generally caused by network scans. The system can extract the tendency of network flows in real-time, based on the newly developed time-based clustering and Dynamic Access Tree creation techniques. The algorithm, implemented and deployed on a medium size backbone network using RMON (Remote MONitoring) technology, successfully detected 195 intrusion attempts during a one month period. The results of the pilot deployment are discussed. In this paper, the proposal, implementation and evaluation will be described.

In this paper, we describe the PS3 load distribution scheme. A target service is a transaction service consisting of multiple processes that communicate with each other. A target system consists of workstations connected by a LAN. PS3 determines the process allocation by estimating response times and throughputs. It allows us to set an upper limit of a response time, and to set lower and upper limits for the throughput of each service. PS3 tries to find a process allocation that provides the minimum response time under conditions set by the user in advance. We measured the response times and throughputs and compared the values with the estimated ones. The results show that PS3 provides an appropriate process allocation, and that calculated results agree well with the measured ones.

In this paper, an effective method of system modeling and dynamic scheduling to improve operation and control for the Back-End process of semiconductor manufacturing is developed by using Colored Timed Petri-Nets (CTPNs). The simulator of a CTPNs model was utilized to generate a new heuristic scheduling method with genetic algorithm(GA) which enables us to obtain the optimal values of the weighted delay time and standard deviation of lead time.

This paper proposes a method to construct smaller binary decision diagrams for characteristic functions (BDDs for CFs). A BDD for CF represents an n-input m-output function, and evaluates all the outputs in O(n+m) time. We derive an upper bound on the number of nodes of the BDD for CF of n-bit adders (adrn). We also compare complexities of BDDs for CFs with those of shared binary decision diagrams (SBDDs) and multi-terminal binary decision diagrams (MTBDDs). Our experimental results show: 1) BDDs for CFs are usually much smaller than MTBDDs; 2) for adrn and for some benchmark circuits, BDDs for CFs are the smallest among the three types of BDDs; and 3) the proposed method often produces smaller BDDs for CFs than an existing method.

In the visual secret sharing scheme proposed by Naor and Shamir, a secret image is encoded into shares, of which size is larger than that of the secret image and the shares are decoded by stacking them without performing any cryptographic computation. In this paper we propose a (k,n) visual secret sharing scheme to encode a black-and-white image into the same size shares as the secret image, where the reconstructed image of the proposed scheme is visible as well as that of the conventional scheme.

Motivated by intention to evaluate asymptotically multiple-burst-error-correcting codes on channels with memory, we will derive the following fact. Let {Zi } be a hidden Markov process, i. e. , a functional of a Markov chain with a finite state space, and Wb(Z1Z2Zn) denote the number of burst errors that appear in Z1Z2Zn, where the number of burst errors is counted using Gabidulin's burst metric , 1971. As the main result, we will prove the almost sure convergence of relative burst weight Wb(Z1Z2Zn)/n, i. e. , the relative frequency of occurrence of burst errors, for a broad class of functionals { Zi } of finite Markov chains. Functionals of Markov chains are often adopted as models of the noises on channels, especially on burst-noise channels, the most famous model of which is probably the Gilbert channel proposed in 1960. Those channel models described with Markov chains are called channels with memory (including channels with zero-memory, i. e. , memoryless ones). This work's achievement enables us to extend Gilbert's code performance evaluation in 1952, a landmark that offered the well-known Gilbert bound, discussed its relationship to the (memoryless) binary symmetric channel, and has been serving as a guide for the-Hamming-metric-based design of error-correcting codes, to the case of the-burst-metric-based codes (burst-error-correcting codes) and discrete channels with or without memory.

Experiment is reported of enhanced backscattering of light in binary and ternary suspensions of rutile and/or alumina particles. With a conventional CCD camera system for observing the phenomena, the angular line shape and the enhancement factor were agreed with the theoretically predicted curve and value. Observation of the angular distribution scattered at the backscattered direction supported the hypothesis proposed by Pine et al. , in which the transport mean free path of the polydisperse mixture can be expressed in terms of summing its reciprocal values weighted over the particle sizes.

In this paper, we apply the discrete wavelet transform (DWT) and the discrete wavelet packet transform (DWPT) with the Daubechies wavelet of order 16 to effectively solve for the electromagnetic scattering from a one-dimensional inhomogeneous slab. Methods based on the excitation vector and the [Z] matrix are utilized to sparsify an MoM matrix. As we observed, there are no much high frequency components of the field in the dielectric region, hence the wavelet coefficients of the small scales components (high frequency components) are very small and negligible. This is different from the case of two-dimensional scattering from perfect conducting objects. In the excitation-vector-based method, a modified excitation vector is introduced to extract dominant terms and achieve a better compression ratio of the matrix. However, a smaller compression ratio and a tiny relative error are not obtained simultaneously owing to their deletion of interaction between different scales. Hence, it is inferior to the [Z]-matrix-based methods. For the [Z]-marix-based methods, our numerical results show the column-tree-based DWPT method is a better choice to sparsify the MoM matrix than DWT-based and other DWPT-based methods. The cost of a matrix-vector multiplication for the wavelet-domain sparse matrix is reduced by a factor of 10, compared with that of the original dense matrix.

Analytical solutions have been obtained for the electromagnetic scattering by a modified Luneberg lens with the permittivity of arbitrary parabolic function. They are expressed by four spherical vector wave functions for radially stratified medium which were introduced for the Luneberg lens by C. T. Tai. They consist of the confluent hypergeometric function and a "generalized" confluent hypergeometric function, in which the parameters for the permittivity of arbitrary parabolic function are involved. The characteristics of the modified Luneberg lens are numerically investigated using exact solutions in comparison with that of the conventional Luneberg lens. The bistatic cross section, the forward cross section and the radar cross section are studied in detail. The near-field distribution is also investigated in order to study the focal properties of the Luneberg lens. The focal shifts defined by the distance between the geometrical focal point and the electromagnetic focal point are obtained for various ka (k is the wave number and a is the radius of the lens). The focal shift normalized to the radius of the sphere becomes larger as ka is smaller. However it drops down rapidly for ka5 when the peak of the electric field amplitude appears on the surface of sphere.