The conventional decentralized supervisory control architectures for discrete event systems assume that default control of controllable events is static. In this paper, we propose a new decentralized supervisory control architecture using dynamic default control of controllable events. We present necessary and sufficient conditions for the existence of a decentralized supervisor in the proposed architecture. Then, we give an example of a language that is achieved in the proposed architecture, but not in the conventional architectures using static default control.

In the letter, the fast one-dimensional (1-D) and two-dimensional (2-D) algorithms for realizing low-complexity 44 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 44 DCT algorithm can be developed from the proposed fast 1-D 44 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 44 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.

Proportional fair bandwidth allocation in packet switches is a fundamental issue to provide quality of service (QoS) support in IP networks. In input-queued switches, packet-mode scheduling delivers all the segments of a packet contiguously from the input port to the output port, thus greatly simplifying the design of packet reassembly modules and yielding performance advantage over cell-mode scheduling under certain conditions [1]. One of the important issues of packet-mode scheduling is how to achieve fair bandwidth allocation among flows with different packet sizes. This paper presents an algorithm called packet-mode fair scheduling (pFS) that guarantees each flow a bandwidth proportional to its reservation regardless of the packet size distribution and the system load. Simulations show that our approach achieves good fairness as well as high throughput and low packet delay. Compared to algorithms without fairness mechanism, pFS yields significant performance improvement in terms of average packet delay when the traffic is heterogeneous. A hardware implementation is presented to show that the proposed algorithm has low complexity and the computation can be completed in a single clock cycle, which makes pFS applicable to high-speed switches.

This paper proposes two different packet schedulers for IEEE 802.16e type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA), which are the weighted fair scheduling (WFS) and the throughput guarantee scheduling (TGS). The performance of proposed schedulers is compared to those of some of conventional schedulers such as round robin (RR), proportional fair (PF), fast fair throughput (FFTH), and fair throughput (FTH) in terms of service coverage, effective throughput and fairness at 64 kbps and 128 kbps minimum user throughput requirements. For a relatively smaller throughput (64 kbps) requirement, the proposed schedulers increase the number of users per sector within 95% service coverage while satisfying the 1xEV-DV fairness criterion. For a relatively larger throughput (128 kbps) requirement, the proposed schedulers provide higher coverage than the PF scheduler while maintaining the same effective aggregate throughput.

Driving methods for TFT-OLEDs are explained with their features and classified from the viewpoints of grayscale methods and uniformizing methods. This classification leads us to a novel proposal using time ratio grayscale and current uniformization. This driving method maintains current uniformity and simultaneously overcomes charging shortage of the pixel circuit for low grayscale levels and current variation due to the shift of operating points. Tolerance toward degraded characteristics, linearity of grayscale and luminance uniformity against degraded characteristics are confirmed using circuit simulation.

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.

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.

In this paper the spectral density of the additive jitter noise in continuous time (CT) Delta-Sigma modulators (DSM) is derived analytically. Making use of the analytic results, extracted in this paper, a novel method for elimination of the damaging effects of the clock jitter in continuous time Delta-Sigma modulators is proposed. In this method instead of the conventional waveforms used in the feedback path of CT DSM's such as the non return to-zero, the return to-zero, and the half delay return to-zero, an impulse waveform is employed.

The presence of the complex scaling behavior in network traffic makes accurate traffic prediction a challenging task. Some conventional prediction tools such as the recursive least square method are not appropriate for network traffic prediction. In this paper we propose a timescale decomposition approach to real time traffic prediction. The raw traffic data is first decomposed into multiple timescales using the à trous Haar wavelet transform. The wavelet coefficients and the scaling coefficients at each scale are predicted independently using the ARIMA model. The predicted wavelet coefficients and scaling coefficient are then combined to give the predicted traffic value. This timescale decomposition approach can better capture the correlation structure of the traffic caused by different network mechanisms, which may not be obvious when examining the raw data directly. The proposed prediction algorithm is applied to real network traffic. It is shown that the proposed algorithm outperforms traffic prediction algorithms in the literature and gives more accurate results.

As a representative of the linear discriminant analysis, the Fisher method is most widely used in practice and it is very effective in two-class classification. However, when it is expanded to a multi-class classification problem, the precision of its discrimination may become worse. A main reason is an occurrence of overlapped distributions on the discriminant space built by Fisher criterion. In order to take such overlaps among classes into consideration, our approach builds a new discriminant space by hierarchically classifying the overlapped classes. In this paper, we propose a new hierarchical discriminant analysis for texture classification. We divide the discriminant space into subspaces by recursively grouping the overlapped classes. In the experiment, texture images from many classes are classified based on the proposed method. We show the outstanding result compared with the conventional Fisher method.

There is increasing evidence from in vivo recordings in monkeys trained to respond to stimuli by making left- or rightward eye movements, that firing rates in certain groups of neurons in oculo-motor areas mimic drift-diffusion processes, rising to a (fixed) threshold prior to movement initiation. This supplements earlier observations of psychologists, that human reaction-time and error-rate data can be fitted by random walk and diffusion models, and has renewed interest in optimal decision-making ideas from information theory and statistical decision theory as a clue to neural mechanisms. We review results from decision theory and stochastic ordinary differential equations, and show how they may be extended and applied to derive explicit parameter dependencies in optimal performance that may be tested on human and animal subjects. We then briefly describe a biophysically-based model of a pool of neurons in locus coeruleus, a brainstem nucleus implicated in widespread norepinephrine release. This neurotransmitter can effect transient gain changes in cortical circuits of the type that the abstract drift-diffusion analysis requires. We also describe how optimal gain schedules can be computed in the presence of time-varying noisy signals. We argue that a rational account of how neural spikes give rise to simple behaviors is beginning to emerge.

In this paper, we shall construct mathematical theory based on the concept of set-valued mappings, suitable for available operation of extraordinarily complicated large-scale network systems by introducing some connected-block structures. A fine estimation technique for availability of system behaviors of such network systems are obtained finally in the form of fixed point theorem for a special system of fuzzy-set-valued mappings.

In this paper, a source coding model for learning multiple concept descriptions of data is proposed. Our source coding model is based on the concept of transmitting data over multiple channels, called multiple description (MD) coding. In particular, frame expansions have been used in our MD coding models for pattern classification. Using this model, there are several interesting properties within a class of multiple classifier algorithms that share with our proposed scheme. Generalization of the MD view under an extension of local discriminant basis towards the theory of frames allows the formulation of a generalized class of low-complexity learning algorithms applicable to high-dimensional pattern classification. To evaluate this approach, performance results for automatic target recognition (ATR) are presented for synthetic aperture radar (SAR) images from the MSTAR public release data set. From the experimental results, our approach outperforms state-of-the-art methods such as conditional Gaussian signal model, Adaboost, and ECOC-SVM.

In the future network, optical technology will play a stronger role not only for transmission but also for switching. Optical burst switching (OBS) emerged as a promising switching paradigm. It brings together the complementary strengths of optics and electronics. This paper presents the design and implementation of an overlay mode burst-switched photonic network testbed, including its architecture, protocols, algorithms and experiments. We propose a flexible "transceiver + forwarding" OBS node architecture to perform both electronic burst assembly/disassembly and optical burst forwarding. It has been designed to provide class of service (CoS), wavelength selection for local bursts, and transparency to cut-through bursts. The functional modules of OBS control plane and its key design issues are presented, including signaling, routing, and a novel scheduling mechanism with combined contention resolution in space and wavelength domains. Finally, we report the experimental results on functional verification, performance analysis and service demonstration.

The wireless streaming media communications are fragile to the delay jitter because the conditions and requirements vary frequently with the users' mobility. Buffering is a typical way to reduce the delay jitter of media packets before the playback, however, it will incur a longer end-to-end delay. Our motivation in this paper is to improve the balance between the elimination of delay jitter and the decrease of end-to-end delay. We propose a novel adaptive playback buffer (APB) based on the probing scheme. By utilizing the probing scheme, the instantaneous network situations are collected, and then the delay margin and the delay jitter margin are employed to calculate the step length (sl) which is used to adjust the playback buffer in each time. The adaptive adjustment to the playback buffer in APB enables the continuous and real-time representation of streaming media at the receiver. Unlike the previous studies, the novelty and contributions of the paper are: a) Accuracy: by employing the instantaneous network information, the adjustment to the playback buffer correctly reflects the current network situations and therefore achieves the improved balance between the elimination of delay jitter and the decrease of end-to-end delay; Hence, APB adjustment is accurate in terms of improving such balance; b) Efficiency: by utilizing the simple probing scheme, APB achieves the current network situations without the complex mathematic predictions, which enables the adjustment to be more timely and efficient. Performance data obtained through extensive simulations show that our APB is effective to reduce both delay jitter and playback buffer delay.

The lifting scheme is an efficient and flexible method for the construction of linear and nonlinear wavelet transforms. In this paper, a novel lossless image coding technique based on the lifting scheme using discrete-time cellular neural networks (DT-CNNs) is proposed. In our proposed method, the image is interpolated by using the nonlinear interpolative dynamics of DT-CNN, and since the output function of DT-CNN works as a multi-level quantization function, our method composes the integer lifting scheme for lossless image coding. Moreover, the nonlinear interpolative dynamics by A-template is used effectively compared with conventional CNN image coding methods using only B-template. The experimental results show a better coding performance compared with the conventional lifting methods using linear filters.

We define discretized Markov transformations and find an algorithm to give the number of maximal-period sequences based on discretized Markov transformations. In this report, we focus on the discretized dyadic transformations and the discretized golden mean transformations. Then we find an algorithm to give the number of maximal-period sequences based on these discretized transformations. Moreover, we define a number-theoretic function related to the numbers of maximal-period sequences based on these discretized transformations. We also introduce the entropy of the maximal-period sequences based on these discretized transformations.

In this paper, it is proved that there is a transformation between two types of nonlinear feedback shift register which can be regarded as implementation of the Bernoulli and tent maps with finite precision. This transformation can be interpreted as a sort of finite dimension version of topological conjugation between the Bernoulli and tent maps on continuous phase space. Several properties of periodic sequences generated from extended NFSRs are derived from the relation.

Connection of internal scan chains in core wrapper design (CWD) is necessary to handle the width match of TAM and internal scan chains. However, conventional serial connection of internal scan chains incurs power and time penalty. Study shows that the distribution and high density of don't care bits (X-bits) in test patterns make scan slices overlapping and partial overlapping possible. A novel parallel CWD (pCWD) approach is presented in this paper for lowering test power by shortening wrapper scan chains and adjusting test patterns. In order to achieve shift time reduction from overlapping in pCWD, a two-phase process on test pattern: partition and fill, is presented. Experimental results on d695 of ITC2002 benchmark demonstrated the shift time and test power have been decreased by 1.5 and 15 times, respectively. In addition, the proposed pCWD can be used as a stand-alone time reduction technique, which has better performance than previous techniques.

This paper studies power spectrum density (PSD) of multi-user aggregate time hopping (TH) ultra wideband (UWB) signal with asynchronous transmission and synchronous transmission. TH codes under consideration are deterministic periodic code and random integer code. Based on the PSD, the in-band interference power for TD SCDMA is investigated as function of UWB system parameters. Two UWB modulations, TH pulse position modulation (PPM) and TH BPSK, are considered for calculating the in-band interference power. The numerical results indicate that asynchronous transmission is an effective way to decrease the peak in-band interference caused by multi-user aggregate TH-PPM UWB signal. Although increasing the maximum of time hopping code elements can smooth the PSD of TH UWB signal, it is not a good idea for reducing the peak in-band interference for TD SCDMA. For the random integer TH code, while only TH UWB continuous spectral exists in TD SCDMA band or multi-user signals of TH UWB are transmitted asynchronously, the in-band interference for TD SCDMA is in proportion to the number of the UWB users. For TD SCDMA in which band discrete spectral line exists the in-band interference caused by TH UWB with synchronous transmission is in proportion to the square of the number of the UWB users.