The FDTD method needs Fourier analysis to obtain the fields of a single frequency. Furthermore, the frequency spectra of the fields used in the FDTD method ordinarily have wide bands, and all the fields in FDTD are treated as real numbers. Therefore, if the permittivity ε and the permeability µ of the medium depend on frequency, or if the surface impedance used for the surface impedance boundary condition (SIBC) depends on the frequency, the FDTD method becomes very complicated because of convolution integral. In the electromagnetic theory, we usually assume that the fields oscillate sinusoidally, and that the fields and ε and µ are complex numbers. The benefit of introduction of the complex numbers is very extensive. As we do in the usual electromagnetic theory, the authors assume that the fields in FDTD oscillate sinusoidally. In the proposed FDTD, the fields, ε, µ and the surface impedances for SIBC are all treated as the complex numbers. The proposed FDTD method can remove the above-mentioned weak points of the conventional FDTD method.

In distributed systems, the provision for failure-recovery is always a hot design issue, whereas no fault-tolerant feature has been extensively considered in the current RMI, CORBA and other OODP environments. As a result, application developers have to implement their own fault tolerant mechanisms. In this paper, we propose a fault-tolerant development environment based on one kind of RMI, called FT_HORB, as a Java extension for the reliable distributed computing with checkpoints and rollback-recovery mechanism. The FT_HORB is implemented on the Sun Ultra10 workstations connected through a 100 Mbps network. We observe that experimental applications on the FT_HORB can continue their operations in spite of hardware and software failures. Three benchmark models such as the nqueens problem, the traveling salesman problem and the gaussian elimination problem are experimented with the FT_HORB to evaluate its performance. The results show the performance of FT_HORB is acceptable. In addition, experiments demonstrate its possibility of extension to fully support our optimal design goal.

The measurement sensitivity of microwave surface resistance, Rs, of high temperature superconducting (HTS) thin films using half-wavelength microstrip resonator with copper and HTS ground plane is analyzed for fundamental and higher order modes of the resonator. The estimated sensitivity of Rs-measurement is at least an order of magnitude greater at fundamental resonant frequency compared to when measured using higher order harmonic modes.

This paper introduces a probabilistic modeling of alarm observation delay, and shows a novel method of model-based diagnosis for time series observation. First, a fault model is defined by associating an event tree rooted by each fault hypothesis with probabilistic variables representing temporal delay. The most probable hypothesis is obtained by selecting one whose Akaike information criterion (AIC) is minimal. It is proved by simulation that the AIC-based hypothesis selection achieves a high precision in diagnosis.

We have fabricated ramp-type Josephson junctions in trilayer structures. A bilayer of YBa2Cu3O7-x (YBCO)/CeO2 was deposited on a SrTiO3 (100) substrate. Then, circle patterns with a diameter of 2 µm were etched on the bilayer surface using standard photolithography process. During the Ar ion milling with an incident angle of 45 degrees to the bilayer surface, the sample was rotated. This process led to upside-down conical formations. After the ramp-edge surface was modified, another YBCO film was deposited for the top electrode. The junctions showed the I-V characteristics between resistively shunted junction and flux-flow types.

We have proposed an intracell uplink of a spread-spectrum code-division multiple-access (SS-CDMA) flexible wireless network based on approximately synchronized (AS) CDMA. Since the AS-CDMA has no co-channel interference, complicated transmission power control (TPC) is not required. A modem of the AS-CDMA has been designed and implemented for the Japanese 2.4 GHz industrial, scientific and medical (ISM) band. Using the implemented modem, the degradation of Eb/N0 from the theoretical limit is 1.0 dB at a bit error rate (BER) of 10-3. Under 2-user environment, the degradation of carrier-to-noise ratio (CNR) is 0.5 dB at a BER of 10-3 when the desired-to-undesired signal ratio (DUR) is -20.3 dB. We have evaluated BER performances in cases of varying carrier frequency offset and median DUR with computer simulation. Under 8-user environment, at the carrier frequency offset of 0.3 ppm, the BER with the DUR of -16 dB is found to be 10-3. Using the AS-CDMA with a 4-step open-loop TPC technique, the design of intracell uplink is available.

In this paper, we propose a new scheduling algorithm to achieve fault tolerance in multiprocessor systems. This algorithm first partitions a parallel program into subsets of tasks, based on the notion of height of a task graph. For each subset, the algorithm then duplicates and schedules the tasks in the subset successively. We prove that schedules obtained by the proposed algorithm can tolerate a single processor failure and show that the computational complexity of the algorithm is O(|V|4) where V is the set of nodes of a task graph. We conduct simulations by applying the algorithm to two kinds of practical task graphs (Gaussian elimination and LU-decomposition). The results of this experiment show that fault tolerance can be achieved at the cost of small degree of time redundancy, and that performance in the case of a processor failure is improved compared to a previous algorithm.

This paper proposes constructive timing-violation (CTV) and evaluates its potential. It can be utilized both for increasing clock frequency and for reducing energy consumption. Increasing clock frequency over that determined by the critical paths causes timing violations. On the other hand, while supply voltage reduction can result in substantial power savings, it also causes larger gate delay and thus clock must be slow down in order not to violate timing constraints of critical paths. However, if any tolerant mechanisms are provided for the timing violations, it is not necessary to keep the constraints. Rather, the violations would be constructive for high clock frequency or for energy savings. From these observations, we propose the CTV, which is supported by the tolerant mechanism based on contemporary speculative execution mechanisms. We evaluate the CTV using a cycle-by-cycle simulator and present its considerably promising potential.

In this paper, we investigate self diagnosable systems on multi-processor systems, known as one-step t-diagnosable systems introduced by Preparata et al. Kohda has proposed "highly structured system" to design diagnosable systems such that faulty processors are diagnosed efficiently. On the other hand, it is known that Cayley graphs have been investigated as good models for architectures of large-scale parallel processor systems. We investigate some conditions for Cayley graphs to be topologies for optimal highly structured diagnosable systems, and present several examples of optimal diagnosable systems represented by Cayley graphs.

A new dimension-reduced interference suppression scheme is proposed for DS-CDMA systems over multipath channels. The proposed receiver resolves the problems of interference and multipath effects without needing to estimate the channel and training sequences. The minimum mean squared error (MMSE) criterion is used to obtain an algorithm to cancel the interference of each path. The MMSE filter is composed of two stages based on multipath effects. The proposed receiver has low complexity without great degradation of performance compared with the full dimension MMSE receiver with known channel information. Simulation results show that the proposed receiver converges to the optimal value rapidly because of its reduced dimension.

A 2D photonic crystal surface-emitting laser using a triangular lattice is developed, and current-injected lasing oscillation is demonstrated. From consideration of the Bragg diffraction condition in the 2D triangular-lattice structure, it is shown that the 2D coupling phenomenon occurs in the structure. As a result of the 2D periodicity of the structure, the longitudinal mode and lateral mode can be controlled, and stable single-mode oscillation is possible over a large 2D area. The lasing mode of the structure is analyzed by calculating the photonic band diagram by the 2D plane-wave expansion method, and we show that four band edges at which the lasing oscillation can occur exist at the Γ point. Current-injected lasing oscillation is successfully demonstrated at room temperature under pulsed conditions. The threshold current density is 3.2 kA/cm2 and the lasing wavelength is 1.285 µm. From the near-field and far-field patterns, it is shown that large-area 2D (diameter 480 µm) lasing oscillation occurs in the device and the divergence angle is very narrow (less than 1.8). We also demonstrate the correspondence between the measured lasing wavelengths and calculated band diagram by comparing the polarization characteristics with the calculated distribution of the electromagnetic field. The results indicate that 2D coherent lasing oscillation occurs due to the multi-directional coupling effect in the 2D photonic crystal. Finally, we show that the polarization patterns of the lasers can be controlled by introducing artificial lattice defects from the theoretical calculation.

The vertical-cavity surface-emitting laser (VCSEL) is becoming a key device in high-speed optical local-area networks (LANs) and even wide-area networks (WANs). This device is also enabling ultra parallel data transfer in equipment and computer systems. In this paper, we will review its physics and the progress of technology covering the spectral band from infrared to ultraviolet by featuring materials, fabrication technology, and performances such as threshold, output power, polarization, modulation and reliability. Lastly, we will touch on its future prospects.

We propose a new and fast full search (FS) motion estimation algorithm for video coding. The computational reduction comes from sequential rejection of impossible candidates with derived formula and subblock norms. Our algorithm reduces more the computations than the recent fast full search (FS) motion estimation algorithms.

In the paper, we propose a congestion control scheme for reliable multicast communication which enables TCP fairness and prevents a drop-to-zero problem. The proposed congestion control scheme is rate-based one based on NAKs from receivers and cooperatively works with a flow control scheme. The congestion control scheme consists of two components of a rate-based controller and a selection mechanism of a representative. The rate-based controller runs between the sender and the representative and achieves TCP fairness and fast response to losses at the representative. The selection mechanism of the representative allows the sender to select the representative in a scalable manner, in which the sender makes use of NAKs from receivers to select it. In the paper, we also propose the switchover mechanism of the flow and congestion control schemes which enables the sender to use either of them adaptively based on network situations. When the network is congested, the congestion control scheme works to share network resources fairly with competing TCP flows. Otherwise, the flow control scheme works to adapt the transmission rate to the slowest receiver. We verify the performance of our proposed schemes by using computer simulation.

Fast packet switches for variable-size packets have become an everyday necessity with the rapid growth in the volume of Internet traffic. Such switches can be designed in two different ways, either by segmenting packets into smaller fixed-size cells and designing packet switches for such cells, or by designing generic packet switches for variable-size packets, where packet segmentation and reassembly can be omitted. The second option is investigated in this paper. The synchronous operation mode with time-limited bulk service is selected. The switching fabric is assumed to be internally non-blocking and provided with input queues. A previous maximum switch throughput analysis has been done under the assumption that the length of the time slot is fixed set to its minimum allowed value (Tmin). In this work, a so-called time-slot stretch factor (SF) is introduced. The actual time-slot length is determined by multiplying Tmin with the SF, where SF. Next, a so-called Internet traffic-source model is proposed based on findings from real IP traffic measurements. The performance implications of the proposed time-slot length modification are analyzed by discrete-event computer simulation. The maximum switch throughput is increased by increasing the SF value, e.g. for uniform packet size distribution and SF=10, the maximum switch throughput is increased from 75% to 97%. The influence of the traffic-source characteristics on the maximum switch throughput is decreased when SF value is increased. In order to prevent any possible throughput degradations, it is advisable to use integer SF values. Packet delay analysis has revealed that by increasing the SF value, the mean packet delay is also increased. Nevertheless, it is shown that the number of switch input and output ports is the most important factor to be considered when packet delay is at stake. Service class differentiation inside investigated packet switch is possible and is not affected by the increasing SF value. Such a packet switch is suitable for implementation in wide area networks, due to high transmission speeds and the small number of switch ports.

Image processing in transform domain has many advantages but it could be suffered from local effects such as a blocking artifact. In this paper, an image processing is performed by weighting coefficients in the compressed domain, i.e., filtering coefficients are appropriately selected according to the processing. Since we find the appropriate factors according to global image enhancement, blocking artifacts are reduced between inter-blocks. Experimental results show that the proposed technique has the advantages of simple computation and easy implementation.

Recent activities on ultrafast photonic device technology development in the Femtosecond Technology Project sponsored by NEDO are introduced. Topics include management and control of the higher order dispersions of optical fibers, ultrafast mode-locked semiconductor laser, symmetric Mach-Zehnder type all-optical switch, ultrafast serial-to-parallel signal converter and sub-picosecond wavelength switch. Challenges towards novel ultrafast switching material systems are also described.

In Vivo Diffusion Tensor Magnetic Resonance Imaging (DT-MRI) can now be used to elucidate and investigate major nerve pathways in the brain. Nerve pathways are constructed by a) calculating a continuous diffusion tensor field from the discrete, noisy, measured DT-MRI data and then b) solving an equation describing the evolution of a fiber tract, in which the local direction vector of the trajectory is identified with the direction of maximum apparent diffusivity. This approach has been validated previously using synthesized, noisy DT-MRI data. Presently, it is possible to reconstruct large white matter structures in the brain, such as the corpus callosum and the pyramidal tracts. Several problems, however, still affect the method's reliability. Its accuracy degrades where the fiber-tract directional distribution is non-uniform, and background noise in diffusion weighted MRIs can cause computed trajectories to jump to different tracts. Nonetheless, this method can provide quantitative information with which to visualize and study connectivity and continuity of neural pathways in the central and peripheral nervous systems in vivo, and holds promise for elucidating architectural features in other fibrous tissues and ordered media.

A feedback-based congestion control mechanism is essential to realize an efficient data transfer service in packed-switched networks. TCP (Transmission Control Protocol) is a feedback-based congestion control mechanism, and has been widely used in the current Internet. An improved version of TCP called TCP Vegas has been proposed and studied in the literature. It can achieve better performance than TCP Reno. In previous studies, performance analysis of a window-based flow control mechanism based on TCP Vegas only for a simple network topology has been performed. In this paper, we extend the analysis to a generic network topology where each connection is allowed to have a different propagation delay and to traverse multiple bottleneck links. We first derive equilibrium values of window sizes of TCP connections and the number of packets waiting in a router's buffer. We also derive throughput of each TCP connection in steady state, and investigate the effect of control parameters of TCP Vegas on fairness among TCP connections. We then present several numerical examples, showing how control parameters of TCP Vegas should be configured for achieving both stability and better transient performance.

Space-variant approaches subject to local image characteristics are useful in practical image restoration because many natural images are nonstationary. Motivated by the success of denoising approaches in the wavelet domain, we propose a region-adaptive restoration approach which adopts a wavelet denoising technique in flat regions after an under-regularized constrained least squares restoration. Experimental results verify that this approach not only improves image quality in mean square error but also contributes to ringing reduction.