A new traffic engineering and operation of ATM networks is described, which features adaptive virtual path (VP) bandwidth control and VP network reconfiguration capabilities. We call this operation system resilient self-sizing operation. By making full use of self-sizing network (SSN) capabilities, we can operate an ATM network efficiently and keep high robustness against traffic demand fluctuation and network failures, while reducing operating costs. In a multimedia environment, the multimedia services and unpredictability of traffic demand make network traffic management a very challenging problem. SSNs, which are defined as ATM networks with self-sizing traffic engineering and operation capability are expected to overcome these difficulties. This paper proposes VP network operation methods of self-sizing networks for high flexibility and survivability. The VP network operation is composed of adaptive VP bandwidth control to absorb changes in traffic demand, VP rerouting control to recover from failures, and VP network reconfiguration control to optimize the network. The combination of these controls can achieve good performance in flexibility and survivability.

This paper proposes and performs the primary feasibility evaluation on Flow Attribute Notification Protocol (FANP), which is a protocol between neighbor CSR (Cell Switch Router) nodes for the management of cut-through packet forwarding, in order to apply label switching paradigm. In cut-through packet forwarding with label switching, a router doesn't have to perform conventional IP packet processing for the received packets. FANP indicates the mapping information between a data-link connection and a packet flow to the neighbor node. FANP defines two key procedures, i. e. , one is the VCID Notification Procedure, and the other is the Flow-ID Notification Procedure. The VCID Notification Procedure lets the label switching paradigm over the label swapped data-link, such as ATM link, though the other label switch architecture can not work over the label swapped data-link. The primary evaluation of FANP has been performed using the prototype system and with the actual packet statistics. The result shows that, with a corporate backbone level, the label switch router system with FANP would work well.

YBa2Cu3Ox films were grown on MgO(100) substrates by liquid phase epitaxy. Their structural and electrical properties were examined. From TEM plan-view images, it is found that the film consists of large grains whose misorientation angles are less than 1. Although the DC critical current density values decrease with increasing the film thickness, the critical current density value of 9. 3105 A/cm2 at 77 K is obtained for a 7 µm-thick film. A microstrip resonator at 10. 8 GHz with a YBCO ground plane shows Q0 values of 14200 at 77 K and 23300 at 40 K, which correspond to surface resistance values of 650 and 400 µΩ, respectively. By using a microstrip line resonator with a Ti/Au ground plane, the critical field of the film at 77 K and 10. 8 GHz is estimated to be 30 Oe. The third-order intercept of the resonator with the Ti/Au ground plane is the input power of +43 dBm and the output power of +30 dBm at 77 K.

This paper proposes an object oriented face region detection and tracking method using range color information. Range segmentation of the objects are obtained from the complicated background using disparity histogram (DH). The facial regions among the range segmented objects are detected using skin-color transform technique that provides a facial region enhanced gray-level image. Computationally efficient matching pixel count (MPC) disparity measure is introduced to enhance the matching accuracy by removing the effect of the unexpected noise in the boundary region. Redundancy operations inherent in the area-based matching operation are removed to enhance the processing speed. For the skin-color transformation, the generalized facial color distribution (GFCD) is modeled by 2D Gaussian function in a normalized color space. Disparity difference histogram (DDH) concept from two consecutive frames is introduced to estimate the range information effectively. Detailed geometrical analysis provides exact variation of range information of moving object. The experimental results show that the proposed algorithm works well in various environments, at a rate of 1 frame per second with 512 480 resolution in general purpose workstation.

In this paper we propose a method to aid a visually impaired person in the operation of a computer running a graphical user interface (GUI). It is based on image processing techniques, using images taken by a color camera placed over a Braille display. The shape of the user's hand is extracted from the image by analyzing the hue and saturation histograms. The orientation of the hand, given by an angle θ with the vertical axis, is calculated based on central moments. The image of the hand is then rotated to a normalized position. The number of pixels in each column of the normalized image is counted, and the result is put in a histogram. By analyzing the coefficient of asymmetry of this histogram, it can be determined whether the thumb is positioned along the pointing finger, or whether it is far from the other fingers. These two positions define two states that correspond to a mouse button up or down. In this way, by rotating the hand and moving the thumb, we can emulate the acts of moving a scroll bar and depressing a mouse button, respectively. These operations can be used to perform tasks in a GUI, such as cut-and-paste, for example. Experimental results show that this method is fast and efficient for the proposed application.

This paper presents both new analytical and new numerical solutions to the problem of generating waveforms exhibiting a low peak-to-peak factor. One important application of these results is in the generation of pseudo-white noise signals that are commonly uses in multi-frequency measurements. These measurements often require maximum signal-to-noise ratio while maintaining the lowest peak-to-peak excursion. The new synthesis scheme introduced in this paper uses the Discrete Fourier Transform (DFT) to generate pseudo-white noise sequence that theoretically has a minimized peak-to-peak factor, Fp-p. Unlike theoretical works in the literature, the method presented here is based in purely discrete mathematics, and hence is directly applicable to the digital synthesis of signals. With this method the shape of the signal can be controlled with about N parameters given N harmonic components. A different permutation of the same set of offset phases of the "source harmonics" creates an entirely different sequence.

This paper describes a new architecture-based DSP processor, which consists of n n mesh multiprocessor for digital signal processing. A prototype chip, RCDSP9701 has been designed and implemented using a CMOS 0. 6 µm process. This architecture has better performance compare to the traditional microprocessor solution to Digital Signal Processing. The proposed method poses remarkable flexibility compare to ASIC (Application Specified Integrated Circuits) approach for Digital Signal Processing applications. In addition, the proposed architecture is fault tolerant and suitable for parallel computing applications. In this paper, an implementation into a silicon chip of the new architecture is presented to give a better understanding of our work.

As a data transmission rate must be increased as required to support the future high-speed wireless communication systems under multipath fading, the conventional DS-CDMA scheme suffers considerably from an intensive processing requirement for the increased spreading rate to combat the inter-chip interference (ICI) and furthermore, from the intersymbol interference (ISI) as the symbol duration becomes less than the channel delay spread. In this paper, a multi-carrier parallel combinatory DS-CDMA (MC-PC-CDMA) scheme is considered as one possible variant access scheme to realize a bandwidth efficient transmission for high transmission rate while maintaining the beneficial features of the DS-CDMA scheme. This scheme combines the parallel combinatory signaling feature of the existing parallel combinatory CDMA (PC-CDMA) scheme with the orthogonal carrier multiplexing feature of multi-carrier modulation so as to improve the bandwidth efficiency and to reduce the self-interference among the parallel spreading sequences of each user, respectively. This particular system configuration also treats the previously proposed multi-carrier DS-CDMA systems as a special case. Our analysis of the bit error rate for the asynchronous CDMA system investigates the performance characteristics of the proposed system on varying design parameters, and shows the performance comparison with other types of multi-carrier DS-CDMA systems.

Secret sharing schemes are good for protecting the important secrets. They are, however, inefficient if the secret shadow held by the shadowholder cannot be reused after recovering the shared secret. Traditionally, the (t, n) secret sharing scheme can be used only once, where t is the threshold value and n is the number of participants. To improve the efficiency, we propose an efficient dynamic secret sharing scheme. In the new scheme, each shadowholder holds a secret key and the corresponding public key. The secret shadow is constructed from the secret key in our scheme, while in previously proposed secret sharing schemes the secret key is the shadow. In addition, the shadow is not constructed by the shadowholder unless it is necessary, and no secure delivery channel is needed. Morever, this paper will further discuss how to change the shared secret, the threshold policy and cheater detection. Therefore, this scheme provides an efficient way to maintain important secrets.

In this paper, we show the effectiveness of software shaping through evaluation of our extensions to the internet transport protocols, TCP (Transmission Control Protocol) and UDP (User Datagram Protocol). These extensions are aimed at efficient realization of bulk data transfer and continuous media communication. The extensions are to be used with resource reservation, a possible and promising approach to resolve transport issues that the current TCP/IP networks cannot support. Although it seems straightforward to utilize dedicated bandwidth set up via resource reservation, filling up the reserved pipe is not so trivial. Performance analysis shows that, by applying the traffic shaping extensions, not only is the reserved pipe easily filled up, but the timely data delivery required by continuous media communication is also provided. Our experiments with a real system also show that overheads introduced by the new extensions are small enough to permit their practical use. The extensions are implemented in the UNIX system kernel.

This paper introduces an adaptive distributed routing algorithm for the faulty star graph. The algorithm is based on that the n-star graph has uniform node degree n-1 and is n-1-connected. By giving two routing rules based on the properties of nodes, an optimal routing function for the fault-free star graph is presented. For a given destination in the n-star graph, n-1 node-disjoint and edge-disjoint subgraphs, which are derived from n-1 adjacent edges of the destination, can be constructed by this routing function and the concept of Breadth First Search. When faults are encountered, according to that there are n-1 node-disjoint paths between two arbitrary nodes, the algorithm can route messages to the destination by finding a fault-free subgraphs based on the local failure information (the status of all its incident edges). As long as the number f of faults (node faults and/or edge faults) is less than the degree n-1 of the n-star graph, the algorithm can adaptively find a path of length at most d+4f to route messages successfully from a source to a destination, where d is the distance between source and destination.

Wavelength-division multiplexing (WDM) transmission systems have been intensely researched in order to increase the transmission capacity. One of the most important key devices for this use is erbium-doped fiber amplifiers (EDFAs) which feature a flattened gain, a high pumping efficiency and a low noise figure (NF), simultaneously. To fulfill these requirements, hybrid silica-based EDFAs (EDSFAs) composed of Al codoped and P/Al codoped EDSFs have been proposed so far. They are also attractive from the viewpoint of productivity, reliability, and cost-effectiveness. On the other hand, the optical bandwidth has been around 15 nm at most. In this paper, we have proposed newly designed hybrid EDSFAs for more than 25 nm optical bandwidth. The gain peak around 1. 53 µm can be suppressed through the saturation degree control in both EDSFs. The remaining obstacle is the diparound 1. 54 µm, which results in the relative gain non-uniformity of 10. 7% over the wavelength range from 1535 to 1560 nm. Owing to the glass composition optimization, the relative gain non-uniformity has been reduced to 5.8% without gain equalizers(GEQs), which is comparable to that of EDFFAs. As another solution, the hybrid EDSFA including two-stage Fabry Perot etalons as the GEQ has been proposed. In this configuration, the hybrid EDSFA has been designed to exhibit the gain profile similar to the summation of two sinusoidal curves, and the relative gain non-uniformity has been reduced to 3. 7%, which is almost equal to that of the hybrid EDFAs composed of EDSF and EDFF. Moreover, it has been demonstrated that newly developed hybrid EDSFAs exhibit a higher pumping efficiency and a lower NF than EDFFAs and hybrid EDSF/EDFFAs.

By sacrificing approximately ten percent of the transmission speed, ultra-high speed optical time division multiplexed network can be fully operatable by the use of currently available electrical switches. The network utilizes dispersion managed quasi-solitons and transmits TDM packet which comprises of ATM cells that are introduced from a gateway through bit compression to match to the ultra-high speed traffics. The network can provide flexible bandwidth and bit on demand at burst rate of the maximum LAN speed.

Attenuated total reflection (ATR) properties and scattered light properties were measured for Ag thin films and arachidic acid (C20) Langmuir-Blodgett (LB) ultrathin films on the Ag thin films to obtain the information about their complex dielectric constants and surface roughness utilizing an excited surface plasmon polariton. The complex dielectric constants for the Ag thin films and the C20 LB films were obtained by fitting the calculated ATR curves to the experimental ones. The surface roughnesses of these films were estimated by the angular distribution of the scattered light assuming the Gaussian function as an autocorrelation function and a linear superposition of roughness spectra. The angular spectra strongly depended on the roughness parameters: the transverse correlation length σ and the surface corrugation depth δ. The experimental angular distributions were explained by some pairs of σ and δ. It was suggested that the surface roughness of the C20 LB films changed with the number of monolayers since the angular spectra varied with the number of the C20 LB monolayers on the Ag films. It is thought that the measurement of the scattered light is useful to evaluate surface roughnesses of LB ultrathin films.

This paper presents a test generation method for sequential circuits under IDDQ testing environment and the identification of untestable faults based on the information of illegal states. We consider a short between two signal lines, a short within one gate and a short between two nodes in different gates. The proposed test generation method consists of two techniques. First technique is to use weighted random vectors, and second technique is to use test generator for stuck-at faults. By using the two techniques together, high fault coverage and short computational time can be achieved. Finally experimental results for ISCAS89 benchmark circuits are presented.

This paper presents a new methodology for diagnosing transistor leakage faults in a CMOS circuit by using both IDDQ and logic value information. A hierarchical procedure is used to identify and delete impossible fault candidates efficiently and a procedure is employed to generate diagnostic tests for improving diagnostic resolution. A novel approach for handling the intermediate output voltage of a faulty gate is used in new methods for fault simulation and diagnostic test generation based on primary output values. Experimental results on ISCAS85 circuits show the effectiveness of the proposed methodology.

Testing for delay faults is very important in the verification of the timing behavior of digital circuits. When a circuit which is unable to operate at the desired clock speed is identified, it is necessary to locate the delay fault(s) affecting the circuit in order to remedy the situation. In this paper, we present a path-tracing method of multiple gate delay fault diagnosis in combinational circuits. We first present the basic rules for deducing suspected faults based on the multiple gate delay fault assumption. Next, in order to improve diagnostic resolution, we introduce rules for deducing non-existent faults based on the fault-free responses at the primary outputs. Using these rules, we present the detailed method for diagnosing multiple delay faults based on paths sensitized by test-pairs generated for marginal delays and gate delay faults [7]. Finally, we present results obtained from experiments on the ISCAS '85 benchmark circuits. The experimental results show the effectiveness of our method.

The final closed-form expression of the bit error rate (BER) is presented for a DS-CDMA system using a maximal ratio combining (MRC) diversity in conjunction with simple channel coding over a Rician fading channel. The accuracy of the BER evaluated by this expression is verified through comparison with a semi-analytic simulation result. The effect of diversity order and channel coding on the bit error rate performance is also considered for typical multipath delay profiles with different Rician ratios.

From an information geometric viewpoint, we investigate a characteristic of the submanifold of a mixture or exponential family in the manifold of finite discrete distributions. Using the characteristic, we derive a direct calculation method for an em-geodesic in the submanifold. In this method, the value of the primal parameter on the geodesic can be obtained without iterations for a gradient system which represents the geodesic. We also derive the similar algorithms for both problems of parameter estimation and functional extension of the submanifold for a data in the ambient manifold. These theoretical approaches from geometric analysis will contribute to the development of an efficient algorithm in computational complexity.

This paper presents a novel classified vector quantizer (CVQ) design algorithm which can control the rate and storage size for applications of image coding. In the algorithm, the classification of image blocks is based on the edge orientation of each block in the wavelet domain. The algorithm allocates the rate and storage size available to each class of the CVQ optimally so that the average distortion is minimized. To reduce the arithmetic complexity of the CVQ, we employ a partial distance codeword search algorithm in the wavelet domain. Simulation results show that the CVQ enjoys low average distortion, low encoding complexity, high visual perception quality, and is well-suited for very low bit rate image coding.