In this paper, we propose a new concept of receiver structure with diversity reception technique to realize multi-service simultaneous reception, which shares diversity branches between receiving communication services. In the proposed receiver structure, each diversity branch selects the receiving services dynamically according to channel states, and each communication service is always selected by at least one branch to realize multi-service simultaneous reception. A basic algorithm is also described to select combinations of a diversity branch and a receiving communication service. The total number of branches decreases and the effective number of branches per communication service increases, by sharing the branches between communication services in the proposed receiver. Simulation results are shown that the proposed diversity receiver achieves both complexity reduction and performance improvement.

The problem of multi-body motion segmentation is important in many computer vision applications. In this paper, we propose a novel algorithm called fuzzy k-subspace clustering for robust segmentation. The proposed method exploits the property that under orthographic camera model the tracked feature points of moving objects reside in multiple subspaces. We compute a partition of feature points into corresponding subspace clusters. First, we find a "soft partition" of feature points based on fuzzy k-subspace algorithm. The proposed fuzzy k-subspace algorithm iteratively minimizes the objective function using Weighted Singular Value Decomposition. Then the points with high partition confidence are gathered to form the subspace bases and the remaining points are classified using their distance to the bases. The proposed method can handle the case of missing data naturally, meaning that the feature points do not have to be visible throughout the sequence. The method is robust to noise and insensitive to initialization. Extensive experiments on synthetic and real data show the effectiveness of the proposed fuzzy k-subspace clustering algorithm.

Volume Graphics Clusters (VG Clusters) have proven to be efficient in a wide range of visualization applications and have also shown promise in some other applications where the image composition device could be fully utilized. The main differentiating feature from other graphics clusters is a specialized image composition device, commercially available as the MPC Image Compositor, which enables the building of do-it-yourself VG Clusters. Although this device is highly scalable, the unidirectional composition flow limits the data subdivision to the quantity of physically available rendering nodes. In addition, the limited buffer memory limits the maximum capable image composition size, therefore limiting its use in large-scale data visualization and high-resolution visualization. To overcome these limitations, we propose and evaluate an image composition mechanism in which additional hardware is used for assisting the image composition process. Because of the synergistic use of two distinct image composition hardware devices we named it "Hybrid Image Composition". Some encouraging results were obtained showing the effectiveness of this solution in improving the VG Cluster 's potential. A low-cost parallel port based hardware barrier is also presented as an efficient method for further enhancing this kind of small-scale VG Cluster. Moreover, this solution has proven to be especially useful in clusters built using low-speed networks, such as Fast Ethernet, which are still in common use.

The performance of avalanche photodiodes with deep guard rings for Geiger mode operation is studied. The electric field distribution is calculated using the finite element method and the carrier multiplication characteristic is calculated along typical lines in the device. The nonlinear dependence of the ionization rates on the electric field strength can make a guard ring less effective in Geiger mode operation. The maximum single photon detection efficiency that can be obtained without breakdown at the guard ring is calculated for several structure parameters. It is shown that the single photon detection efficiency strongly depends on the guard ring design.

This paper proposes a new detection ordering scheme, which minimizes average error rate of the MIMO system with per antenna rate control. This paper shows an optimal scheme minimizing average error rate expressed by the Q function, and simplifies the optimal scheme by using the minimum equivalent SINR scaled by modulation indices, based on approximated error rate. In spite of reduced complexity, the simplified scheme demonstrates the almost same performance as the optimal scheme. Owing to the diversity of detection ordering, the proposed scheme has over 2 dB higher SNR gain at the BER of 10-3 than the existing ordering schemes in balanced array size systems.

The minimum initial marking problem MIM of Petri nets is described as follows: "Given a Petri net and a firing count vector X, find an initial marking M0, with the minimum total token number, for which there is a sequence δ of transitions such that each transition t appears exactly X(t) times in δ, the first transition is enabled at M0 and the rest can be fired one by one subsequently." This paper proposes two heuristic algorithms AAD and AMIM + and shows the following (1) and (2) through experimental results: (1) AAD is more capable than any other known algorithm; (2) AMIM + can produce M0, with a small number of tokens, even if other algorithms are too slow to compute M0 as the size of an input instance gets very large.

Recently, there are so many researches on Autonomous Distributed Manufacturing Systems (ADMSs), where cooperation among agents is used to solve problems, such as the scheduling problem and the vehicle routing problem. We target ADMSs where an ADMS consists of two sub-systems: a Production System (PS) and an Autonomous Transportation System (ATS). This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for ATSs under conditions of given production schedule and finite buffer capacity. The TARP results in a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW), and this paper gives a mathematical formulation of the problem. This paper, also, proposes a cooperative algorithm to obtain suboptimal solutions in which no deadlocks and buffer overflows occur. By computational experiments, we will examine the effectiveness of the proposed algorithm. Computational experiments show that the proposed algorithm is able to obtain efficient and deadlock-free routes even though the buffer capacity is less.

Recently, it has been shown that the received signal in the orthogonal frequency-division multiplexing (OFDM) systems can be viewed as the synchronous code-division multiple access (SCDMA) signal in receiver after some mathematical manipulation, and the ICI term in the OFDM system is equivalent to the multiple access interference (MAI) term in SCDMA system. They proposed a successive interference cancellation multicarrier detector and it performs better than the conventional single-carrier detection schemes. To further improve the performance of OFDM systems in the presence of ICI, we propose to use a soft-in soft-out (SISO) multicarrier detector and a SISO convolutional decoder in an iterative (turbo) way. Note that full-complexity turbo multicarrier detector and turbo decoder are not used to strike a balance between performance and complexity of OFDM systems. And the transmitter structure of OFDM systems is unchanged. The simulation results show that the first iteration of the proposed scheme demonstrates 2-3 dB gain compared to the previous multicarrier detection schemes. The second and third iterations improve the performance further.

An adaptive service framework is expected to support real-time multimedia services in wirless/mobile cellular networks with various classes of traffic and diverse bandwidth requirements. Quality of service (QoS) provisioning in an adaptive framework is another challenging consideration, such as quantifying the level of bandwidth degradation of an ongoing calls and guaranteeing stable QoS levels. Considering both the period and the depth of degradation, the degradation area ratio (DAR) represents the average ratio of a call's degradation and is one of the meaningful measures for adaptive service in call level analysis. In this paper, analytical models for estimating the DAR and finding the optimal control parameters are presented in multi-class traffic call management situations. In complete partitioning capacity based threshold-type call admission control (CAC), a one-dimensional Markov chain with an absorbing state is proposed for estimating the DAR in each traffic class. We formulate a two-leveled optimization problem minimizing the total blocking probabilities subject to QoS requirements and present the procedures required in finding the optimal capacities and threshold values by using modified dynamic programming. In complete sharing capacity based threshold-type CAC, the multidimensional Markov model is approximately reduced to a one-dimensional model in order to reduce complexity and hence calculation time. The reduced model is compared with multidimensional Markov model in numerical examples. The optimization problem is formulated minimizing the total blocking probabilities subject to QoS requirements and the optimal threshold parameters are found by using a genetic algorithm. Performance of two adopted admission policies in adaptive framework situations is illustrated by numerical results.

A new technique incorporating combinatorial deposition to develop thin-film phosphors by r.f. magnetron sputtering is demonstrated using subdivided powder targets. In comparison with development using conventional r.f. magnetron sputtering, the atomic ratios of Si and Ge as well as the Mn content in Zn2Si1-XGeXO4:Mn thin film phosphors could be more efficiently optimized in order to obtain the highest intensity in electroluminescent and photoluminescent emissions. High luminances of 11800 and 1536 cd/m2 were obtained in Zn2Si0.6Ge0.4O4:Mn thin-film electroluminescent devices fabricated under optimized conditions and driven at 1 kHz and 60 Hz, respectively.

This paper addresses the parameter estimation problem of an interval-based hybrid dynamical system (interval system). The interval system has a two-layer architecture that comprises a finite state automaton and multiple linear dynamical systems. The automaton controls the activation timing of the dynamical systems based on a stochastic transition model between intervals. Thus, the interval system can generate and analyze complex multivariate sequences that consist of temporal regimes of dynamic primitives. Although the interval system is a powerful model to represent human behaviors such as gestures and facial expressions, the learning process has a paradoxical nature: temporal segmentation of primitives and identification of constituent dynamical systems need to be solved simultaneously. To overcome this problem, we propose a multiphase parameter estimation method that consists of a bottom-up clustering phase of linear dynamical systems and a refinement phase of all the system parameters. Experimental results show the method can organize hidden dynamical systems behind the training data and refine the system parameters successfully.

This paper considers the low-frequency scattering by a circular dielectric cylinder and modifies the exact polarizability tensor to extend the valid region of the known low-frequency solution. When compared to the traditional formulation, the proposed solution is shown to be valid for cylinders with a higher dielectric constant and larger radius.

This paper defines the maximum available radio resource of a WCDMA downlink in a multiservice context under different wireless conditions. The derived closed-form expression for the maximum available resource, denoted by Rmax, is determined by four important service-independent system parameters: the maximum downlink transmission power, the average propagation loss, the average orthogonality factor, and the average other-to-own-cell interference ratio of the cell. From the Rmax some important radio characteristics of a WCDMA downlink are observed. The application of the Rmax to the link-sharing dimensioning process of WCDMA networks is presented in the paper. Simulation studies are provided to show the accuracy of the analytical model under various urban macro cell conditions.

This paper proposes a Generalized Traffic Engineering Protocol (GTEP). GTEP is a protocol that permits communication between a Path Computation Element (PCE) and a Generalized Multi-Protocol Label Switching (GMPLS) controller (CNTL). The latter is hosted by each GMPLS node; it handles GMPLS and MPLS protocols such as routing and signaling protocols as well as controlling the GMPLS node host. The PCE provides multi-layer traffic engineering; it calculates Label Switched Path (LSP) routes and judges whether a new lower-layer LSP should be established. GTEP functions are implemented in both the PCE and GMPLS router. We demonstrate a multi-layer traffic engineering experiment conducted with GTEP.

Some cryptographic schemes based on the bilinear pairings were proposed recently. In this paper, we apply the pairings on elliptic curve and Elliptic Curve Cryptography to the key agreement of dynamic peer group. Each member performs authentication and contributes a secret data to negotiate a group common key by means of a binary key tree. The proposed protocol does not need a dedicated central server to perform the key agreement, and the overhead is distributed among the group members. To provide a secure dynamic group communication, the key renewing mechanism has to be included. While the member joins/leaves, the group session key will be renewed to provide the backward/forward privacy, respectively. The key renewing is much efficient because it is only confined to the keys of the key-path. The proposed protocol is flexible while the change of membership is frequent.

A new detection methodology for both of the core and the delta of the fingerprint using the extended relational graph is presented. This paper shows the way to detect both of the core loop and the delta loop from the extended relational graph, which we proposed in order to summarize the global feature of the fingerprint ridge pattern distribution. The experimental results for 180 fingerprint samples show that the processing time is ranging from 0.34 [sec] to 0.44 [sec] for each fingerprint image by using Pentium 4 1.8 GHz Processor. In our experiments, the core and the delta were successfully extracted in 94.4% of the 180 samples.

In this paper, we briefly describe situations that may cause HFN de-synchronization for ciphering applications in UMTS. Detection methods of HFN de-synchronization are discussed and the lower bound of the HFN de-synchronization perceptibility is derived. A supporting simulation result of the perceptibility is given. Then, an Automatic Recovery of HFN Synchronization (ARHS) algorithm is presented. The average lost PDU number of the ARHS algorithm is derived and supported by simulation results. The average lost SDU number is used as the figure of merit for HFN synchronization recovery procedures. Simulation results of the average lost SDU number show that the ARHS algorithm is quite effective to recover HFN synchronization after HFN de-synchronization situations happen.

This paper describes a pattern classifier for detecting frontal-view faces via learning a decision boundary. The proposed classifier consists of two major parts for improving classification accuracy: the implicit modeling of both the face and the near-face classes resulting in an extended discriminative feature set, and the subsequent composite Support Vector Machines (SVMs) for speeding up the classification. For the extended discriminative feature set, Principal Component Analysis (PCA) or Independent Component Analysis (ICA) is performed for the face and near-face classes separately. The projections and distances to the two different subspaces are complementary, which significantly enhances classification accuracy of SVM. Multiple nonlinear SVMs are trained for the local facial feature spaces considering the general multi-modal characteristic of the face space. Each component SVM has a simpler boundary than that of a single SVM for the whole face space. The most appropriate component SVM is selected by a gating mechanism based on clustering. The classification by utilizing one of the multiple SVMs guarantees good generalization performance and speeds up face detection. The proposed classifier is finally implemented to work in real-time by cascading a boosting based face detector.

We propose a system that enables us to gather hundreds of images related to one set of keywords provided by a user from the World Wide Web. The system is called Image Collector II. The Image Collector, which we proposed previously, can gather only one or two hundreds of images. We propose the two following improvements on our previous system in terms of the number of gathered images and their precision: (1) We extract some words appearing with high frequency from all HTML files in which output images are embedded in an initial image gathering, and using them as keywords, we carry out a second image gathering. Through this process, we can obtain hundreds of images for one set of keywords. (2) The more images we gather, the more the precision of gathered images decreases. To improve the precision, we introduce word vectors of HTML files embedding images into the image selecting process in addition to image feature vectors.

We analyze the noise sensitivity of the focal length computation, the principal point estimation, and the orthogonality enforcement for single-view 3-D reconstruction based on vanishing points and orthogonality. We point out that due to the nonlinearity of the problem the standard statistical optimization is not very effective. We present a practical compromise for avoiding the computational failure and preserving high accuracy, allowing a consistent 3-D shape in the presence of however large noise.