To provide a bounded-delay service with an end-to-end delay guarantee and utilize network efficiently, the admission control functions in a network require an adequate per-switch delay allocation policy to allocate end-to-end delay requirement to a set of local switches. This letter present an optimal delay allocation policy, according to a deterministic traffic model, and a rate-controlled scheduler. Empirical results indicate that the proposed policy perform better than EQ allocation policy, using the admission load region as index.

Node placement optimization in ShuffleNets is a combinatorial optimization problem. In this paper, a new heuristic node placement algorithm, called Lookahead Algorithm, is proposed. Its performance is compared with the lower bounds derived in [1], as well as some existing algorithms in the literature. Significant reduction in weighted mean hop distance hd is obtained, especially when the traffic distribution in ShuffleNets is highly skewed. Consider a ShuffleNet with 8 nodes, the hd obtained using Lookahead Algorithm is only 1.90% above the lower bound under the skewed traffic distribution (with traffic skew factor γ = 100), and 16.04% under uniform random traffic distribution.

This paper theoretically analyzed the performance of the RAKE combining (in the time domain), maximal ratio combining (in the spatial domain), and two-dimensional RAKE combining (in the spatial and time domains) techniques for multipath fading environments, where multipath waves are distributed in the spatial and time domains. The analysis was based on a diversity combining technique that employed the eigenvalues of the covariance matrix between branch signals. It was found that the performance of the fading mitigation was normalized by the beamwidth of an array antenna, for various parameters such as the number of antenna elements, angular spread, and angle of arrival.

The original DQRUMA/MC-CDMA protocol may suffer severe code collisions due to a limited number of request codes. An enhanced DQRUMA/MC-CDMA protocol using minislots for request accesses is proposed to reduce request collisions. In the proposed protocol, request attempts are transmitted concurrently with data packets of other calls. A random scheme (Scheme I) and a designated scheme (Scheme II) are distinguished depending on the methods which select a request code and a request minislot based on a lattice pool for request accesses (LPRA). Both schemes yield low request access delays due to few or no collisions during request accesses. In Scheme I one of request minislots is selected with a randomly chosen code, while in Scheme II the minislot and the code uniquely used in request attempts can resolve a code collision problem during request accesses. The performance of the proposed protocol is evaluated by simulation and the result shows that the proposed protocol outperforms the original DQRUMA/MC-CDMA protocol in terms of average total delay.

An efficient location management for mobile stations plays an important role in personal communication systems. The key elements of location management are location registration and paging. In this paper, we propose the improved movement-based registration method with a selective paging scheme which enables to minimize the signaling traffic such as a paging load and a registration load. For reducing the paging load, we newly establish a paging area and analyze its performance by modeling as one dimensional random walk model with a barrier state. Further, for decreasing the registration load, we also propose a new movement-based registration scheme by using a counter and a buffer which can store the number of cell boundary crossings and the cell identification, respectively. Through numerical results, we show that our proposed movement-based registration provides a better performance than the conventional movement-based registration.

An experimental 640-Gbit/s ATM switching system is described. The switching system is scalable and quasi-non-blocking and uses hardware self-rearrangement in a three-stage network. Hardware implementation results for the switching system are presented. The switching system is fabricated using advanced 0.25-µm CMOS devices, high-density multi-chip-module (MCM) technology, and optical wavelength-division-multiplexing (WDM) interconnection technology. A scalable 80-Gbit/s switching module is fabricated in combination with a developed scalable-distributed-arbitration technique, and a WDM interconnection system that connects multiple 80-Gbit/s switching modules is developed. Using these components, an experimental 640-Gbit/s switching system is partially constructed. The 640-Gbit/s switching system will be applied to future broadband ATM networks.

This letter proposes an initial frame synchronization algorithm for orthogonal frequency division multiplexing (OFDM) systems. Since the proposed scheme utilizes only the cyclic prefix and the phase shift of the demodulated data without the aid of any known signals, it can be applied not only at the beginning of data transmission but also at any instant during transmission. The performance of the proposed algorithm is confirmed by computer simulation for QPSK, 8-PSK, and 16-QAM systems.

A highly reliable and available network which automatically can restore itself from failures is an important concept for the future high capacity broadband networks. Self-healing algorithm, restoring the failed VPs (Virtual Paths) in the backbone ATM networks, is an indispensable technique to meet these requirements. In this paper we propose a coordination-based restoring self-healing algorithm called C-TRUS, which meets different requirements of service classes of survivability by using a simple rerouting and capacity reserving protocols. The simulation results show that the proposed algorithm can restore VPs quickly and improve the restoration time in case of multi-failures by using network resources very efficiently. Furthermore, C-TRUS outperforms the combination method in both restoration ratio and restoration time. In addition, the significant improvement of restoration ratio in the multi-failure scenario has been achieved.

Site diversity causes unfairness in packet reception that depends on the location of the mobile stations in the up-link of CDMA cellular packet communication systems. This paper proposes an adaptive transmit permission probability control scheme that reduces this unfairness in CDMA cellular slotted-ALOHA systems with site diversity. The proposed scheme adaptively controls the transmit permission probability according to the offered load and the location of the mobile stations. Successful packet reception rate, fairness coefficient and throughput performance are evaluated in fading environments with imperfect power control. Computer simulation shows that adaptive transmit permission probability control improves fairness of service for all mobile stations and throughput performance across all channel loads compared with the conventional scheme.

The emergence of nomadic applications have recently generated a lot of interest in wireless network infrastructures which support multimedia services. In this paper, we propose a bandwidth routing algorithm for multimedia support in a multihop wireless network. This network can be interconnected to wired networks (e. g. ATM or Internet) or stand alone. Our bandwidth routing includes bandwidth calculation and reservation schemes. Under such a routing algorithm, we can derive a route to satisfy bandwidth requirement for quality-of-service (QoS) constraint. At a source node, the bandwidth information can be used to decide to accept a new call or not immediately. This is specially important to carry out a fast handoff when interconnecting to an ATM backbone infrastructure. It enables an efficient call admission control. The simulation results show that the bandwidth routing algorithm is very useful in extending the ATM virtual circuit service to the wireless network. Different types of QoS traffic can be integrated in such a dynamic radio network with high performance.

We have developed a polymer tunable wavelength filter using cross-linked silicone as a waveguide material for wavelength division multiplexing (WDM) systems. The filter operated with a low insertion loss of 3.6-4.1 dB, a low crosstalk of < -30 dB, and a wide tuning range of 10 nm in the 20 to 80C temperature region without any changes in the spectral profile. We investigated the optical characteristics of the 32-ch WDM signals transmitted through the filter. We realized a stable filtering operation by introducing a feedback system. We also applied the filter to a WDM/SCM (subcarrier multiplexing) broadcast-and-select LAN system. We were able to realize a LAN system which operated at 6 Mbit/s and had 3200 channels by using 10-wavelength WDM signal. This suggests that our polymer tunable wavelength filter is suitable for practical use.

Scheduling directed a-cyclic task graphs (DAGs) onto multiprocessors is known to be an intractable problem. Although there have been several heuristic algorithms for scheduling DAGs onto multiprocessors, few address the mapping onto a given number of completely connected processors with an objective of minimizing the finish time. We present an efficient algorithm called ClusterMerge to statically schedule directed a-cyclic task graphs onto a homogeneous completely connected MIMD system with a given number of processors. The algorithm clusters tasks in a DAG using a longest path heuristic and then iteratively merges these clusters to give a number of clusters identical to the number of available processors. Each of these clusters is then scheduled on a separate processor. Using simulations, we demonstrate that ClusterMerge schedules task graphs yielding the same or lower execution times than those of other researchers, but using fewer processors. We also discuss pitfalls in the various approaches to defining the longest path in a directed a-cyclic task graph.

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of resource copies needed. Resources include special I/O processors, expensive peripheral devices, or such software modules as compilers, library routines, and data files. Due to the delay in accessing each of these resources, system performance degrades as the distance between each processor and its nearest resource copy increases. Thus, every processor must be within a given distance k1 of at least one resource copy, which is called the k-bounded placement problem. The structure of a distributed computing system is represented by a graph. The k-bounded placement problem is first transformed into the problem of finding smallest k-dominating sets in a graph. Searching for smallest k-dominating sets is formulated as a state-space search problem. We derive heuristic information to speed up the search, which is then used to solve the problem with the well-known A* algorithm. An illustrative example and some experimental results are presented to demonstrate the effectiveness of the heuristic search.

In this paper, we propose an elegant approach for illumination invariant face recognition based on the photometric stereo technique. The basic idea is to reconstruct the surface normal and the albedo of a face using photometric stereo images, and then use them as the illumination independent model of the face. And, we have investigated the optimal light source directions for accurate surface shape reconstruction, and the robust estimation technique for the illumination direction of an input face image. We have tested the proposed algorithm with 125 real face images of 25 persons which are taken under 5 quite different illumination conditions, and achieved the success rate of more than 80%. Comparison results of conventional face recognition methods and the proposed method are also evaluated. These results demonstrate that the proposed technique have a great potential for the robust face recognition even when the lighting condition changes severely.

This paper proposes a new method for reconstruction a shape of skin surface replica from shaded image sequence taken with different light source directions. Since the shaded images include shadows caused by surface height fluctuation, and specular and inter reflections, the conventional photometric stereo method is not suitable for reconstructing its surface accurately. In the proposed method, we choose measured intensity which does not include specular and inter reflections and self-shadows so that we can calculate accurate normal vector from the selected measured intensity using SVD (Singular Value Decomposition) method. The experimental results from real images demonstrate that the proposed method is effective for shape reconstruction from shaded images, which include specular and inter reflections and self-shadows.

A new method to recover and display 3D fundus pattern on the inner bottom surface of eye-ball from stereo fundus image pair is developed. For the fundus stereo images, a simple stereo technique does not work, because the fundus is observed through eye lens and a contact wide-angle enlarging lens. In this method, utilizing the fact that fundus forms a part of sphere, we identify their optical parameters and correct the skews of the lines-of-sight. Then, we obtain 3D images of the fundus by back-projecting the stereo images.

Since for recognition tasks it is known that planar invariants are more easily obtained than others, decomposing a scene in terms of planar parts becomes very interresting. This paper presents a new approach to find the projections of planar surfaces in a pair of images. For this task we introduce the facet concept defined by linked edges (chains) and corners. We use collineations as projective information to match and verify their planarity. Our contribution consists in obtaining from an uncalibrated stereo pair of images a match of "planar" chains based on matched corners. Collineations are constrained by the fundamental matrix information and a Kalman filter approach is used to refine its computation.

We propose a new sampling control system on image sensor array. Contrary to the random access pixels, the proposed sensor is able to read out spatially variant sampled pixels at high speed, without inputting pixel address for each access. The sampling positions can be changed dynamically by rewriting the sampling position memory. The proposed sensor has a memory array that stores the sampling positions. It can achieve any spatially varying sampling patterns. A prototype of 64 64 pixels are fabricated under 0.7 µm CMOS precess.

The visual inspection of printed circuit boards (PCBs) at the final production stage is necessary for quality assurance and the requirements for an automated inspection system are very high. However, consistent inspection of patterns on these PCBs is very difficult due to pattern complexity. Most of the previously developed techniques are not sensitive enough to detect defects in complex patterns. To solve this problem, we propose a new optical system that discriminates pattern types existing on a PCB, such as copper, solder resist and silk-screen printing. We have also developed a hybrid defect detection technique to inspect discriminated patterns. This technique is based on shape measurement and features extraction methods. We used the proposed techniques in an actual automated inspection system, realizing real time transactions with a combination of hardware equipped with image processing LSIs and PC software. Evaluation with this inspection system ensures a 100% defect detection rate and a fairly low false alarm rate (0.06%). The present paper describes the inspection algorithm and briefly explains the automated inspection system.

A novel method is proposed to retrieve image sequences with the goal of forecasting complex and time-varying natural patterns. To that end, we introduce a framework called Memory-Based Forecasting; it provides forecast information based on the temporal development of past retrieved sequences. This paper targets the radar echo patterns in weather radar images, and aims to realize an image retrieval method that supports weather forecasters in predicting local precipitation. To characterize the radar echo patterns, an appearance-based representation of the echo pattern, and its velocity field are employed. Temporal texture features are introduced to represent local pattern features including non-rigid complex motion. Furthermore, the temporal development of a sequence is represented as paths in eigenspaces of the image features, and a normalized distance between two sequences in the eigenspace is proposed as a dissimilarity measure that is used in retrieving similar sequences. Several experiments confirm the good performance of the proposed retrieval scheme, and indicate the predictability of the image sequence.