A face recognition system based on the hard-limited eigenfunctions derived from the Karhunen-Loeve transform is proposed. The key of this approach is to change the inner product of the face image and the selected eigenvectors from floating point arithmetic to integer arithmetic. A database with 1000 facial images corresponding to 100 subjects is collected for system evaluation. It is demonstrated that 92% correct classification rate and 6-fold computational time saving can be achieved by the use of the first 150 hard-limited features.

A novel high speed, low voltage BiCMOS tristate buffer is presented and its performance characteristics are investigated by using PSPICE simulation. The results obtained are compared with a general CMOS and a couple of previous BiCMOS tristate buffer circuits which are conventional BiCMOS and complementary BiCMOS tristate buffer circuits. It is shown that the proposed BiCMOS tristate buffer circuit outperforms other previous tristate buffer circuits. At lower supply voltage, the proposed circuit has been shown more advantageous speed over previous circuits and it guarantees speed advantage over previous circuits even supply voltage application is at 1.5 volt. The pass transistor technique with a single MOS transistor driving is used to improve the driving capability. Furthermore, a complementary BiCMOS charge pump technique is used to eliminate the voltage loss due to base-emitter turn on voltage and to enhance the driving capability. With the positive and negative charge pump, it can be realized a high speed at low voltage with full swing operation without performance degradation due to shunt CMOS circuit as same as previous complementary BiCMOS tristate buffer circuit.

This paper presents a prototype of a distributed 3D rendering system in a hierarchical Grid environment. 3D rendering with massive data sets is a computationally intensive task. In order to make full use of computational resources on Grids, a hierarchical system architecture is designed to run over multiple clusters. This architecture involves both sort-first and sort-last parallel rendering algorithms to achieve excellent scalability, rendering performance and load balance.

A routing algorithm, utilizing two-hop relaying when necessary, is proposed to enhance the system capacity of code division multiple access (CDMA) cellular systems. Up to now, multihop relaying is applied to cellular systems mainly with the aim of decreasing the transmit power of each mobile station or extending the cell coverage area. Here, in this paper, potential benefit of multihop relaying is studied so as to increase the system capacity. A condition for the interference to be reduced by changing single-hop connections to two-hop connections is analyzed. In addition, a new route selection criterion maximizing the amount of interference reduction is proposed. Simulation results reveal that the proposed criterion is superior to the conventional criterion minimizing the total transmit power in respect of the amount of interference reduction. By using this criterion, an efficient routing algorithm for two-hop CDMA cellular systems is proposed to enhance the system capacity. Simulation results also indicate that by using the proposed routing algorithm in combination with a call admission control, the system capacity is increased even under heavy traffic conditions.

The market for IP convergence services is expanding rapidly due to the rising number of Internet users. To respond to market trends, service systems must provide services quickly. This paper discusses that application server called the service agent which provides IP convergence services. The service agent meets the requirements for four application servers, centralized intelligence, supporting various interfaces: service creativity and scalability. The architecture is based on that of AIN systems, but whole system is written in Java especially to achieve service creativity and scalability. As a result of trial manufacture, feasibility of the service agent and scalability was achieved. Enough performance was also confirmed to obtain for commercial services.

This paper proposes several novel hierarchical interconnection networks based on the (3, 3)-graphs, namely folded (3, 3)-networks, root-folded (3, 3)-networks, recursively expanded (3, 3)-networks, and flooded (3, 3)-networks. Just as the hypercubes, CCC, Peterson-based networks, and Heawood-based networks, these hierarchical networks have the following nice properties: regular topology, high scalability, and small diameters. Due to these important properties, these hierarchical networks seem to have the potential as alternatives for the future interconnection structures of multicomputer systems, especially massively parallel processors (MPPs). Furthermore, this paper will present the routing and broadcasting algorithms for these proposed networks to demonstrate that these algorithms are as elegant as the algorithms for hypercubes, CCC, and Petersen- or Heawood-based networks.

Performance of selective Rake (SRake) receiver is evaluated for direct sequence ultra wideband (DS-UWB) communications considering an independent Rayleigh channel having exponentially decaying power delay profile (PDP). BEP performances are shown. The results obtained are compared with similar results in a channel having flat PDP. Assumption of a flat PDP is found to predict the optimum spreading bandwidth to be lower and sub-optimum operating performance beyond optimum spreading bandwidth to be severely worse than that is achievable in a channel having exponentially decaying PDP by employing an SRake receiver having fixed number of combined paths. Optimum spreading bandwidth for SRake in a channel having exponentially decaying PDP is shown to be much larger than the one in a channel having flat PDP; that is specifically a good-news for UWB communications. Effects of partial band interference are also investigated. Interference is found to be less effective in exponentially decaying PDP.

In, Okeya and Sakurai proposed the recovery of the y-coordinate on a Montgomery-form elliptic curve. With their method, it can calculate efficiently coordinates of scalar multiplication of point, in which we need only x-coordinate and finally, (x,y) of the terminal point can be recovered. The method is very suitable for some applications such as ECDSA-V and MQV, etc. Unfortunately, there is a significant fault in that paper. Thus, many results about computation amount are wrong due to the significant fault. First, we will show this fault, and then raise the correction of the significant fault. Finally, Table A1 about comparison of computation amount in is also corrected.

This paper proposes an efficient query evaluation scheme for a mediator system intended to integrate heterogeneous computing environment in terms of operating systems, database management systems, and other software. Most of mediator systems transform a global query into a set of sub-queries based on their target remote servers. Each sub-query is evaluated by the query modification method to evaluate a global query. However, it is possible to reduce the evaluation cost of a global query when the results of frequently requested sub-queries are materialized in a mediator. In a mediator, its integrating schema can be incrementally modified and the evaluation frequency of a global query can also be continuously varied. In order to select the optimized set of materialized sub-queries with respect to their current evaluation frequencies, the proposed method applies a decay factor for modeling the recent access behavior of each sub-query. In other words, the latest access of a sub-query gets the highest attention in the selection process of materialized sub-queries. As a result, it is possible to adjust the optimized set of materialized sub-queries adaptively according to the recent changes in the evaluation frequencies of sub-queries. Since finding the optimum solution of this problem is NP-hard, it takes too long to be used in practice when the number of sub-queries is large. Consequently, given the size of mediator storage, the rank-based selection algorithm proposed in this paper finds the set of materialized sub-queries which minimizes the total evaluation cost of global queries in linear search complexity.

A large-scale packet-switch architecture for a tera bit/s system--which uses a combined-packet-distribution (CPD) method for a crossbar packet switch--was developed. This method eliminates the restriction on scheduling processing time by extending a switching data unit. The data unit is called a combined packet that consists of plural variable-length packets or their fragments. The combined packets are sequentially distributed among multiple crossbar switch planes and their sequence integrity is preserved. Distributive targets among the switch planes are selectable. As a result, when one or more switch planes are damaged, redundancy of the switch fabric is easily attained in a so-called "graceful degradation" manner. Moreover, this switch uses a novel algorithm called hierarchical priority scheduling. This algorithm enables fairness of scheduling by taking account of queuing state. The repetition required for priority scheduling is reduced by a novel hierarchical approach. The simulated performance of this algorithm shows that it performs better than the simple maximal matching method under both uniform and non-uniform traffic.

Many techniques have been proposed for segmenting feature point trajectories tracked through a video sequence into independent motions, but objects in the scene are usually assumed to undergo general 3-D motions. As a result, the segmentation accuracy considerably deteriorates in realistic video sequences in which object motions are nearly degenerate. In this paper, we propose a multi-stage unsupervised learning scheme first assuming degenerate motions and then assuming general 3-D motions and show by simulated and real video experiments that the segmentation accuracy significantly improves without compromising the accuracy for general 3-D motions.

In this report we present all-optical switches and modulators based on the intersubband transition in semiconductor quantum wells. The use of InGaAs/AlAsSb coupled double quantum well structures is proposed to facilitate intersubband transitions in the optical-communication band, and to reduce the intersubband absorption recovery time from several picoseconds to a few hundred femtoseconds by utilizing enhanced electron-phonon scattering. Subpicosecond all-optical gating and modulation in coupled double quantum wells are observed using pump-probe experiments at optical-communication wavelengths. The results indicate that the intersubband transition in this structure is very useful for ultrafast all-optical switching devices.

This paper proposes a new on-chip linearizer self-adapting to the input power and its implementation to high linear monolithic microwave integrated circuit (MMIC) power amplifier for 1.95 GHz wide-band code division multiple-access (W-CDMA) system. The linearizer consists of InGaP/GaAs heterojunction bipolar transistor (HBT) active bias circuit and reverse biased junction diode of which dynamic admittance to input power level functions adaptively to control the bias to the amplifier. The proposed linearizer has little insertion power loss, and more importantly, it consumes no additional die area and DC power. The HBT MMIC power amplifier with the integrated linearizer exhibits a maximum output power of 30.3 dBm, a power gain of 27.5 dB, a power added efficiency of 42% at the maximum output power under an operation voltage of 3.4 V, and adjacent channel leakage power ratio of -38 dBc at 27 dBm of output power.

In this paper a new watermarking technique which is combined with joint photographic experts group (JPEG) encoding system is presented. This method operates in the frequency domain by embedding a pseudo-random sequence of real numbers in a selected set of discrete cosine transform (DCT) coefficients. The embedded sequence is extracted without restoring the original image to fit the trend in the digital still camera (DSC) system. The proposed technique represents a major improvement on methods relying on the comparison between the watermarked and original images. Experimental results show that the proposed watermarking method is robust to several common image processing techniques, including JPEG compression, noise, and blurring. We also implement the whole design by synthesizing with TSMC 1P4M 0.35 µm standard cell. The chip size is 3.0643.064 mm2 for 46374 gate counts. The simulation speed can reach 50 MHz. The power dissipation is 69 mW at 3.3 V 50 MHz.

To address the extreme dynamism and the rapidly changing user's requirements in current information systems, an Autonomous Community Information System (ACIS) has been developed. ACIS is a decentralized architecture that forms a community of individual end-users (community members) having the same interests and demands at specified time and location. It admits them to mutually cooperate and share information without loading up any single node excessively. ACIS does not embrace the advantage of heterogeneity of the community nodes-nodes latencies. In this paper, ACIS-Hierarchy, decentralized hierarchical community architecture is proposed. It considers latency between community nodes as an important criterion that need to be optimized. It takes advantage of heterogeneity of the community nodes-nodes latencies to improve the communication delay among the community. In this paper, an efficient autonomous decentralized community construction technology is proposed to reduce: the communication delays among members taking into consideration the latency among them and the required time to join/leave. This paper illustrates the step-step construction technology and the membership management operations for ACIS-Hierarchy. Experimental results show that ACIS-Hierarchy improves the community communication delay.

In this paper, based on maximum neural network, we propose a new parallel algorithm that can escape from local minima and has powerful ability of searching the globally optimal or near-optimum solution for the maximum clique problem (MCP). In graph theory a clique is a completely connected subgraph and the MCP is to find a clique of maximum size of a graph. The MCP is a classic optimization problem in computer science and in graph theory with many real-world applications, and is also known to be NP-complete. Lee and Takefuji have presented a very powerful neural approach called maximum neural network for this NP-complete problem. The maximum neural model always guarantees a valid solution and greatly reduces the search space without a burden on the parameter-tuning. However, the model has a tendency to converge to the local minimum easily because it is based on the steepest descent method. By adding a negative self-feedback to the maximum neural network, we proposed a parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm is then fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the maximum neural network and the chaotic neurodynamics. A large number of instances have been simulated to verify the proposed algorithm.

High performance scientific and engineering applications running on clusters have different communication requirements. Current cluster configurations typically provide multiple network interfaces per node and multiple interconnections among nodes. However, transport protocols such as TCP do not utilize existing multiple network interfaces to enhance communication performance. This paper introduces a new configurable communication model utilizing multiple interconnections. The model adds mechanisms to manage and enhance the overall communication performance of clusters. These configurations include the use of parallel message transfers, the separation of the transfer channels between small messages and large messages, and load balancing among the channels. The main advantages of the model are: (1) providing a flexible, enhanced network infrastructure, (2) hiding the technical details of the heterogeneous network resources from the applications, and (3) providing an easy and flexible way to extend the network capacities for specific nodes. To illustrate the advantages and performance enhancements of the model, a prototype was implemented to experimentally evaluate the cluster network performance, which showed considerable gains.

Optimistic log-based rollback recovery protocols have been regarded as an attractive fault-tolerant solution in distributed systems based on message-passing paradigm due to low overhead in failure-free time. These protocols are based on a Piecewise Deterministic (PWD) Assumption model. They, however, assumed that all logged non-deterministic events in a consistent global recovery line must be determinately replayed in recovery time. In this paper, we give the impossibility of deterministic replaying of logged non-deterministic event in a consistent global recovery line as a Ω Line Problem, because of asynchronous properties of distributed systems: no bound on the relative speeds of processes, no bound on message transmission delays and no global time source. In addition, we propose a new optimistic log-based rollback recovery protocol, which guarantees the deterministic replaying of all logged non-deterministic events belonged in a consistent global recovery line and solves a Ω Line Problem in recovery time.

Shared memory multiprocessors in which each processor has its own TLB must manage consistency among TLBs and a page table. As the large-scale CC-NUMA (cache-coherent non-uniform memory access) shared memory multiprocessors become popular, it is important for TLB consistency management algorithms to be highly scalable. In this paper, we propose a TLB update-hint algorithm as a scalable TLB consistency management solution for CC-NUMA multiprocessors. By using a lazy TLB invalidation approach, we reduced the number of unnecessary processor interruptions and idle-waiting time, and achieved a high level of scalability. Using a shared memory simulator, we evaluated the TLB update-hint algorithm. For performance comparison, we also simulated the TLB shootdown algorithm, one of the most popular TLB consistency algorithms. The simulations demonstrated that the TLB update-hint algorithm scales well in systems with a large number of processors. At 64 node systems, the TLB update-hint algorithm shows 4787% better performance than the TLB shootdown algorithm.

A new scheme for watermarking based on vector quantization (VQ) over a binary symmetric channel is proposed. By optimizing VQ indices with genetic algorithm, simulation results not only demonstrate effective transmission of watermarked image, but also reveal the robustness of the extracted watermark.