The differentiated services (Diffserv) architecture is a potential solution for providing quality of service (QoS) on the Internet. Most existing studies focus on providing service differentiation among few service classes. In this paper, we propose an approach which can achieve per-flow weighted fair rate allocation in a differentiated services network. Following the design philosophy of the Diffserv model, in the proposed approach core routers do not need to keep per-flow information. An edge router adjusts the transmission rate of a flow based on the feedback carried on control packets, which are inserted by the ingress edge router and returned by the egress edge router. Core routers periodically estimate the fair share rate of each virtual flow and mark the results in control packets. We use both simulations and analysis to evaluate the performance of the proposed approach. The analytical results show that our approach allows a system to converge to weighted fair rate allocations in limited time. Through the simulation results, we can further validate the analytical results, and demonstrate that better throughput can be achieved.

The reverse link signal power required for multimedia traffic in multipath faded single-code (SC-) and multi-code CDMA (MC-CDMA) systems is investigated. The effect of orthogonality loss among multiple spreading code channels is characterized by introducing the orthogonality factor. The required signal power in both CDMA systems is analyzed with varying system parameters of spreading bandwidth, the orthogonality factor, and the number of spreading codes. Analytical results show that MC-CDMA users transmitting only a single traffic type require significantly more power than SC-CDMA users with only a single traffic type. On the other hand, MC-CDMA users transmitting multimedia traffic require power levels approximately identical to SC-CDMA users with multimedia traffic.

Fourier synthesis of ultrafast optical-pulse trains was demonstrated using a simplified experimental configuration consisting of three independent continuous-wave lasers and a semiconductor optical amplifier (SOA) used as a four-wave mixer. When the three lasers were phase-locked, ultrafast optical-pulse trains were successfully generated at repetition frequencies ranging from 504 GHz to 1.8 THz with high waveform stability.

We present a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve over any non-binary field. The previous algorithms for scalar multiplication on a Montgomery form do not consider how to recover the y-coordinate. So although they can be applicable to certain restricted schemes (e.g. ECDH and ECDSA-S), some schemes (e.g. ECDSA-V and MQV) require scalar multiplication with recovery of the y-coordinate. We compare our proposed scalar multiplication algorithm with the traditional scalar multiplication algorithms (including Window-methods on the Weierstrass form), and discuss the Montgomery form versus the Weierstrass form in the performance of implementation with several techniques of elliptic curve cryptosystems (including ECES, ECDSA, and ECMQV). Our results clarify the advantage of the cryptographic usage of Montgomery-form elliptic curve in constrained environments such as mobile devices and smart cards.

In this paper, the sequence interference suppression characteristics of code-diversity DS/CDMA over multipath fading channels are presented. In a code-diversity system, the data signal is modulated with several PN sequences, and using these sequences at the receiver, diversity reception of the signal is carried out to suppress the influence of multiple access interference (MAI) or sequence interference (SI) especially under a near-far problem. First, in a sequence interference and AWGN environment, the basic performance of code-diversity system is presented. Next, in single-path (flat-fading) and multipath fading channels, the average BER performance of the code-diversity system is shown and the observation that the performance of code-diversity system (combined with RAKE reception) is more effective over a multipath fading channel is clarified. Finally, it is presented that by implementing adaptive weight control (AWC) for the code-diversity system over fading channels, the BER performance can further be improved.

Bidirectional reflection distribution functions (BRDFs) of commercially pure titanium sheets with three different kinds of surface morphology were measured. Those experimental BRDFs were analyzed by using Phong's reflection model. Topographic measurements of the specimens' surfaces were performed with using a stylus-method. An explicit microfacet model based on topographic data was proposed. With using the explicit microfacet model and geometrical optics the calculated BRDFs were obtained and then compared with the experimental BRDFs. Both of them were in a good agreement. Through this comparison physical meanings of Phong's reflection model were discussed. We concluded that with using the explicit microfacet model it will be possible to calculate the BRDF of the materials' surface in arbitrary illumination conditions and that this modeling will be useful to develop new aesthetic surface appearance in material industries, computer graphics, architectural design and surface science.

We describe a simple all-optical wavelength converter based on a Fabry-Perot semiconductor optical amplifier (FPSOA). We measure its static characteristics in detail and successfully demonstrate its dynamic wavelength-conversion operation (both inverted and non-inverted) at 2.5 Gbit/s. This is the first demonstration of FPSOA-based wavelength conversion. Quasi-digital response is also observed. Low input power, ease of fabrication and good compatibility with WDM networks are important advantages of FPSOA.

Techniques for human-motion recovery are applicable to a variety of areas, such as sports, dancing, virtual reality, and video-game production. The people who work in this area focus their attention on recovering information on the motion of individuals rather than groups of people. It is important to demonstrate the possibility of recovering descriptions of the 3-D motion in team sports, since such information is able to provide us with a variety of information on the relations among players. This paper presents a new experimental result on 3-D motion recovery from a team sport. The result was obtained by a non-rigid shape recovery technique based on images from uncalibrated cameras. The technique was applied to recovering the 3-D motion of the players in a mini-basketball game which was played in a gymnasium. Some attention is focused on the analysis of the players' motion. Satisfactory results were obtained.

We have developed a novel human facial tracking system that operates in real time at a video frame rate without needing any special hardware. The approach is based on the use of Lie algebra, and uses three-dimensional feature points on the targeted human face. It is assumed that the roughly estimated facial model (relative coordinates of the three-dimensional feature points) is known. First, the initial feature positions of the face are determined using a model fitting technique. Then, the tracking is operated by the following sequence: (1) capture the new video frame and render feature points to the image plane; (2) search for new positions of the feature points on the image plane; (3) get the Euclidean matrix from the moving vector and the three-dimensional information for the points; and (4) rotate and translate the feature points by using the Euclidean matrix, and render the new points on the image plane. The key algorithm of this tracker is to estimate the Euclidean matrix by using a least square technique based on Lie algebra. The resulting tracker performed very well on the task of tracking a human face.

It has been over a decade since the "Eigenfaces" approach to automatic face recognition, and other appearance-based methods, made an impression on the computer vision research community and helped spur interest in vision systems being used to support biometrics and human-computer interface. In this paper I give a personal view of the original motivation for the work, some of the strengths and limitation of the approach, and progress in the years since. Appearance-based approaches to recognition complement feature- or shape-based approaches, and a practical face recognition system should have elements of both. Eigenfaces is not a general approach to recognition, but rather one tool out of many to be applied and evaluated in the appropriate context.

A mesh-connected processor array consists of many similar processing elements (PEs), which can be executed in both parallel and pipeline processing. For the implementation of an array of large numbers of processors, it is necessary to consider some fault tolerant issues to enhance the (fabrication-time) yield and the (run-time) reliability. In this paper, we introduce the 1(1/2)-track switch torus array by changing the connections in 1(1/2)-track switch mesh array, and we apply our approximate reconfiguration algorithm to the torus array. We describe the reconfiguration strategy for the 1(1/2)-track switch torus array and its realization using WSI, especially 3-dimensional realization. A hardware realization of the algorithm is proposed and simulation results about the array reliability are shown. These imply that a self-reconfigurable system with no host computer can be realized using our method, hence our method is effective in enhancing the run-time reliability as well as the fabrication-time yield of processor arrays.

The paper proposes a vision-based system for adaptively inferring the interactional intention of a person coming close to a robot, which plays an important role in the succeeding stage of human/robot cooperative handling of works/tools in production lines. Here, interactional intention is ranged in the meaning of the intention to interact/operate with the robot, which is proposed to be estimated by the human head moving path during an incipient period of time. To implement this intention inference capability, first, human entrance is detected and is modeled by an ellipse to supply information about the head position. Second, B-spline technique is used to approximate the trajectory with reduced control points in order that the system acquires information about the human motion direction and the curvature of the motion trajectory. Finally, Hidden Markov Models (HMMs) are applied as the adaptive inference engines at the stage of inferring the human interactional intention. The HMM algorithm with a stochastic pattern matching capability is extended to supply whether or not a person has an intention toward the robot at the incipient time. The reestimation process here models the motion behavior of an human worker when he has or doesn't have the intention to operate the robot. Experimental results demonstrate the adaptability of the inference system using the extended HMM algorithm for filtering out motion deviation over the trajectory.

We previously developed a novel transmission power control method for code-division multiple access (CDMA) wireless systems that is suitable for the transmission control protocol (TCP) and constant bit rate (CBR) connections. It allows each mobile terminal to send packets to arbitrary slots without negotiation or the use of the ALOHA protocol. It results in high bandwidth utilization for TCP connections without the need to modify the TCP protocol or use a snoop agent. In this paper, we improve our previously developed power control method so as to adapt itself to distance variations and instantaneous fluctuations in the received power due to fading. We show that the developed method enables efficient bandwidth utilization compared with the conventional power control technique under various conditions.

We describe a method for object recognition with 2D image queries to be identified from among a set of 3D models. The pose is known from a previous step. The main target application is face recognition. The 3D models consist of both shape and color texture information, and the 2D queries are color camera images. The kernel of the method consists of a lookup table that associates 3D surface normals with expected image brightness, modulo albedo, for a given query. This lookup table is fast to compute, and is used to render images from the models for a sum of square difference error measure. Using a data set of 42 face models and 1764 (high quality) query images under 7 poses and 6 lighting conditions, we achieve average recognition accuracy of about 83%, with more than 90% in several pose/lighting conditions, using semi-automatically computed poses. The method is extremely fast compared to those that involve finding eigenvectors or solving constrained equation systems.

This paper treats the data routing problem for fault-tolerant systolic arrays based on Triple Modular Redundancy (TMR) in mixed spatial-temporal domain. The number of logical links required in TMR systolic array is basically 9 times larger than the one for corresponding non-fault-tolerant systolic array. The link sharing is a promising method for reducing the number of physical links, which may, however, degrade the fault tolerance of TMR system. This paper proposes several robust data-routing and resource-sharing (plural data transfers share a physical link, or a data transfer and a computational task share a PE as a relay node for the former and as a processor for the latter), by which certain classes of fault tolerant property will be guaranteed. A stage and a dominated set are introduced to characterize the features of routing/resource-sharing in TMR systems, and conditions on the dominated set and their resultant fault-tolerant properties are derived.

An improved algorithm is developed for correcting the topographic impact on satellite imagery. First, we analyze the topography induced distortion on satellite image. It is shown that the variation of aspect can cause the obvious different distortions in the remotely sensed image, and also effect the image illumination significantly. Because the illumination is the basis for topographic correction algorithms, we consider its variation in different sun-facing aspects in calculation a correction parameter and take it as a key element in the modified correction algorithm. Then, we apply the modified correction method on the actual Landsat Thematic Mapper satellite image. The topographic correction was done in different image data with different season and different solar angle. The corrected results show the effectiveness and accuracy using this approach.

This paper describes the JAINTM JavaTM Call Control (JCC) Application Programming Interface (API), and its relationship to network protocols, in particular the Session Initiation Protocol (SIP). JCC is a high-level object-oriented open, standard API for Next Generation Network (NGN) softswitches that enables rapid creation, by third parties, of services that can run independently of the underlying network technology (e.g. wireless, wired, packet, IP, PSTN) and protocols. SIP is a protocol that has been proposed for a wide variety of uses in IP networks, including call control. We argue that instead of being competitors, JCC and SIP are complementary, with JCC offering higher-layer programming abstractions and protocol-independence, and demonstrate by examples how to map JCC version 1.0 to a SIP environment. We thus show that for common call control applications using JCC is simpler, faster and less maintenance intensive than using SIP directly.

We analyzed the performance of adaptive array antennas with a RAKE receiver by employing a common correlation matrix of the sample matrix inversion (CCM-SMI) algorithm in a multipath Rayleigh fading environment for W-CDMA reverse link. A common correlation matrix is usually used to provide adaptive weights for multiple users and multiple delay paths and can be used in packet communications transmitted using frame units. The proposed CCM-SMI algorithm had a better BER and SINR for lower computational complexity compared with the conventional SMI algorithm, even when using a RAKE receiver in multipath Rayleigh fading environment.

This paper elucidates through experiments the improvement in the achievable bit error rate (BER) performance when space time transmit diversity (STTD) is applied to the wideband direct sequence code division multiple access (W-CDMA) forward link. First, laboratory experimental results clarify that the received path timing difference of transmitted signals from two antennas, due to the propagation delay, should be within a chip duration of approximately 1/4 and 1/2 with and without fast transmit power control (TPC), respectively, in order to achieve a prominent transmit diversity effect. We show that the required average received signal energy per bit-to-background noise spectrum density (Eb/N0) at the average BER of 10-3 using STTD is decreased by approximately 4.2 (1.7) dB compared to the case of single-antenna transmission at the maximum Doppler frequency, fD, of 5 Hz without (with) antenna diversity reception at a mobile station (MS) due to the increasing randomization effect of burst error. Furthermore, we elucidate that although the gain of STTD in field experiments is decreased compared to that in laboratory experiments, since the degradation in path search accuracy is greater due to the frequently changing delay time of each path in a real multipath-fading channel, the required average received signal energy per bit-to-interference plus background noise power spectrum density ratio (Eb/I0) at the average BER of 10-3 with STTD is decreased by approximately 1.3 to 1.5 (0.7 to 1.0) dB without (with) antenna diversity reception when fast TPC is not applied in the forward link. This indicates that STTD is effective for a channel without TPC such as a common control channel in a real multipath-fading channel.

Reverse link performance analyses of single-code (SC) and multi-code (MC) CDMA systems in multipath fading environments are presented. The degree of orthogonality loss among multiple spreading code channels is characterized by introducing the orthogonality factor. This factor depends on the multipath delay power profiles of the propagation channel and the number of paths resolved at a Rake receiver. The link capacity and the signal power of both CDMA systems are then analyzed according to varying system parameters, including spreading bandwidth, traffic load, the orthogonality factor, and the number of spreading codes assigned to a user. Analytical results show that the SC-CDMA system provides a larger link capacity and MC users require more power than SC users. The dominant parameters affecting the performance difference are the spreading bandwidth and multipath delay power profiles.