Since IIR filters have lower computational complexity than FIR filters, some design methods for IIR filter banks have been presented in the recent literatures. Smith et al. have proposed a class of linear phase IIR filter banks. However this method restricts the order of the numerator to be odd and has some drawbacks. In this paper, we present two design methods for linear phase IIR filter banks. One is based on Lagrange-Multiplier method, and optimal IIR filter banks in least squares sense are obtained. In an other approach, IIR filter banks with the maximum number of zeros are derived analytically.

A partial buffer sharing scheme is proposed as loss-priority control for a finite buffer with batch inputs. A partial batch acceptance strategy is used for a batch arriving at a finite buffer. Customer loss probabilities for high- and low-priority customers are derived under this batch acceptance strategy, using a supplementary variable method that is a standard tool for queueing analysis. A comparison of the partial buffer sharing scheme and a system without loss-priority control is made in terms of admissible offered load.

We report the state of the art of superconducting network switching circuits and system technology. Mainly, we describe our switching core circuits and challenges to demonstrate superconducting prototype systems. And also, we review other approach to perform the superconducting digital communication briefly. In our switching core circuits, a ring-pipeline architecture has been proposed and the component circuits of the prototype chips have been fabricated and tested successfully. It is very important to demonstrate the prototype system in order to estimate the total performance of the system with superconducting devices. We have designed a multi-processor system with a superconducting network as a prototype system to demonstrate an interprocessor network system.

An efficient hybrid scheme has been developed for optimizing register allocation applicable to CISC and RISC processors, which is crucial for maximizing their execution speed. Graph-coloring at the function level is combined with a powerful local register assigner. This assigner uses accurate program flows and access patterns of variables, and optimizes a wider local range, called an extended basic-block (EBB), than other optimizing compilers. The EBB is a set of basic-blocks that constitute a tree-shaped control flow, which is suitable for the large nested branches that frequently appear in embedded system-control programs, such as those for telephone call processing. The coloring at the function level involves only the live-ranges of program variables that span EBBs. The interference graph is therefore very small even for large functions, so it can be constructed quickly. Instead of iterative live-range splitting or spilling, the unallocated live-ranges are optimized by the EBB-based register assigner, so neither load/store insertion nor code motion is needed. This facilitates generating reliable code and debug symbols. The information provided for the EBB-based assigner facilitates the priority-based heuristics, fine-grained interference checking, and deferred coloring, all of which increase the colorability. Using a thread-support package for CHILL as a sample program, performance measurement showed that local variables are successfully located in registers, and the reduction of static cycles is about 20-30%. Further improvements include using double registers and improving debuggability.

We describe several properties of very thin stacks of 10 to 20 intrinsic Josephson junctions fabricated on the surface of Bi2Sr2CaCu2O8+δ single crystals. We show that the Joule heating is significantly reduced in these stacks and that the gap structure is clearly observable in the quasiparticle current-voltage (I-V) characteristics. The I-V curves are characterized by a large subgap conductance and a significant gap suppression due to the injection of quasiparticle current. It is found that the IcRn product of these intrinsic Josephson junction stacks is significantly small compared with that expected from the BCS theory. It is also found that there is a tendency that IcRn decreases with increasing c-axis resistivity. Both Ic and the gap voltage exhibit unsaturated temperature dependence at low temperatures. The behavior presents a sharp contrast to that of Josephson junctions made of conventional superconductors. The characteristics are discussed in relation to the d-wave symmetry of the order parameter.

We propose a novel soft-decision decoding algorithm for cyclic codes based on energy minimization principle. The well-known soft-decision decoding algorithms for block codes perform algebraic (hard-decision) decoding several times in order to generate candidate codewords using the reliability of received symbols. In contrast, the proposed method defines energy as the Euclidean distance between the received signal and a codeword and alters the values of information symbols so as to decrease the energy in order to seek the codeword of minimum energy, which is the most likely codeword. We let initial positions be the information parts of signals obtained by cyclically shifting a received signal and look for the point, which represents a codeword, of minimum energy by moving each point from several initial positions. This paper presents and investigates reducing complexity of the soft-decision decoding algorithm. We rank initial positions in order of reliability and reduce the number of initial positions in decoding. Computer simulation results show that this method reduces decoding complexity.

A fuzzy Kohonen clustering network was proposed which integrates the Fuzzy c-means (FCM) model into the learning rate and updating strategies of the Kohonen network. This yields an optimization problem related to FCM, and the numerical results show improved convergence as well as reduced labeling error. However, the clusters may be either hyperspherical-shaped or hyperellipsoidal-shaped, we use a generalized objective function involving a collection of linear varieties. In this way the model is distributed and consists of a series of `local' linear-type models (based on the revealed clusters). We propose a method to generalize the fuzzy Kohonen clustering networks. Anderson's IRIS data and the artificial data set are used to illustrate this method; and results are compared with the standard Kohonen approach and the fuzzy Kohonen clustering networks.

An efficient finite element-integral equation method is presented for calculating scattered fields from conducting objects. By combining the integral equation solution with the finite element method, this formulation allows a finite element computational domain terminated very closely to the scatterer and thus results in the decrease of the resultant matrix size. Furthermore, we employ a new integral approach to establish the boundary condition on the finite element terminating surface. The expansion of the fields on the integration contour is not related to the fields on the terminating surface, hence we obtain an explicit expression of the boundary condition on the terminating surface. Using this explicit boundary condition with the finite element solution, our method substantially improves the computational efficiency and relaxes the computer memory requirements. Only one matrix inversion is needed through our formulation and the generation and storing of a full matrix is not necessary as compared with the conventional hybrid finite element methods. The validity and accuracy of the formulation are checked by some numerical solutions of scattering from two-dimensional metallic cylinders, which are compared with the results of other methods and/or measured data.

Simplification orderings, like the recursive path ordering and the improved recursive decomposition ordering, are widely used for proving the termination property of term rewriting systems. The improved recursive decomposition ordering is known as the most powerful simplification ordering. Recently Jouannaud and Rubio extended the recursive path ordering to higher-order rewrite systems by introducing an ordering on type structure. In this paper we extend the improved recursive decomposition ordering for proving termination of higher-order rewrite systems. The key idea of our ordering is a new concept of pseudo-terminal occurrences.

Complex rule conditions are commonly required to describe complicated business semantics. In these cases, efficient condition evaluation is crucial for high performance of active database systems. Most previous works used the incremental evaluation techniques, whose operations are relatively expensive due to the processing based on the exact calculation of the condition expression. In this paper we propose a new filtering technique that effectively identifies false condition in an early stage of condition monitoring. Since the results of condition evaluation tend to be false in most practical cases, an efficient filtering method can highly facilitate fast condition evaluation. The proposed filtering technique is developed based on the new perspective of database state and database operations, i. e. , a vector space model. We first present vector representations of database states, database operations, and complex condition expressions. Then, we propose a filtering method based on the properties of a vector space, called the sphere containment test. Our proposed method determines the truth value of the rule conditions only with the delta vectors maintained in main memory. We compare our method with a typical incremental evaluation method and show that the proposed method can give a significant performance enhancement.

In this study, a coupled chaotic circuits network is realized by real circuit elements. By using a simple circuit converting generating spatial patterns to digital signal, irregular self-switching phenomenon of the appearing patterns can be observed as real physical phenomenon.

Though response of neurons is mainly decided by synaptic events, the length of a time window for the neuronal response has still not been clarified. In this paper, we analyse the time window within which a neuron processes synaptic events, on the basis of the Hodgkin-Huxley equations. Our simulation shows that an active membrane property makes neurons' behavior complex, and that a few milliseconds is plausible as the time window. A neuron seems to detect coincidence synaptic events in such a time window.

Secret sharing schemes are good for protecting the important secrets. They are, however, inefficient if the secret shadow held by the shadowholder cannot be reused after recovering the shared secret. Traditionally, the (t, n) secret sharing scheme can be used only once, where t is the threshold value and n is the number of participants. To improve the efficiency, we propose an efficient dynamic secret sharing scheme. In the new scheme, each shadowholder holds a secret key and the corresponding public key. The secret shadow is constructed from the secret key in our scheme, while in previously proposed secret sharing schemes the secret key is the shadow. In addition, the shadow is not constructed by the shadowholder unless it is necessary, and no secure delivery channel is needed. Morever, this paper will further discuss how to change the shared secret, the threshold policy and cheater detection. Therefore, this scheme provides an efficient way to maintain important secrets.

The Heart Rate Variability (HRV) analysis has become vigorous these days. One reason for this is that the HRV analysis investigates the dynamics of the autonomic nervous system activities which control the HRV. The Integral Pulse Frequency Modulation (IPFM) model is a pulse generating mechanism model in the nervous system, that is one of the models which connects the HRV to the autonomic nervous system activities. The IPFM model is a single frequency component model; however, the real HRV has multiple frequency components. Moreover, there are refractory periods after generating action potentials are initiated. Nevertheless, the IPFM model does not consider refractory periods. In order to make sure of the accuracy and the effectiveness of the integral function (IF) method applied to the real data, we consider the absolute refractory periods and two frequency components. In this investigation, the simulated HRV was made with a single and double frequency component using the IPFM model with and without absolute refractory periods. The original generating function of the IPFM model was demodulated by using the instantaneous heart rate tachogram. The power of the instantaneous pulse rate per minute was analyzed by the direct FFT method, the IF FFT method without the absolute refractory periods, and the IF FFT method with the absolute refractory periods. It was concluded that the IF FFT method can demodulate the original generating function accurately.

For two-tier cellular network design, resource management between tiers is an important issue to be studied. In this paper, in order to use the network resources preciously, we considered sharing of the available spectrum between the tiers. We evaluate this sharing for two network architectures. In the first architecture, called System I, DS-CDMA is deployed in both tiers. In the second architecture, called System II, TDMA is deployed for users in the microcell tier and CDMA for macrocell users. Using analytically evaluated intercell interference for a two-tier cellular system, we will show the performance and the allowable system capacity for the above systems.

Hogg and Huberman have proposed a strategy for stabilizing chaotic multi-agent systems. This paper applies their strategy to a resource allocation problem in a manufacturing system consisting of two machines and two types of parts. These part-types conflict each other over resource allocation. We introduce a discrete-time model of the system by using game theory, and examine stability and bifurcation phenomena of its fixed point. We show by computer simulation that chaotic behaviors are observed after successive occurrence of period-doubling bifurcations. It is also shown that the optimal state of the system is stabilized by a reward mechanism.

A photorefractive ring resonator with self-pumped four-wave mixing (PRRR-SPFWM) in which the Cat mirror region and the four-wave mixing region are formed in a single photorefractive crystal is proposed, and the steady-state analysis of this unknown device is first performed. Since the backward pump beam is generated as a phase conjugate of the forward pump beam in the Cat mirror region, counterpropagation of both pump beams is spontaneously obtained. We analyze its oscillation intensities in steady state, and show that the threshold coupling strength of oscillation depends on the cavity mirror reflectivity and the reflectivity of the Cat mirror region. We also show interesting property of PRRR-SPFWM, the possibility to switch over between unidirectional and bidirectional oscillation by controlling the amplitude of coupling strength.

We fabricated a tunable and polarization-insensitive arrayed-waveguide grating (AWG) 1616 multiplexer that operates around the wavelength of 1. 55 µm using fluorinated polyimides. The wavelength channel spacing was 0. 8 nm, and the 3-dB passband width was 0. 26 nm. The insertion loss at each channel was from 8 to 12 dB, and the crosstalk was less than -28 dB. The transmission pass wavelength was tuned over a wide range of 6 nm by heating from 24 to 64. The slope of the temperature dependence of the pass wavelength was -0. 15 nm/, which is ten times that of a silica-based multiplexer. Polarization-insensitivity was achieved by fabricating a film AWG multiplexer, which was formed by removing the silicon substrate and annealing at 350. The polarization-dependent wavelength shift was smaller than the spectrum analyzers wavelength resolution of 0. 1 nm.

We demonstrate that the frequency modulated video signals in the subcarrier multiple access optical network can be satisfactorily transmitted using our proposed method, that broadens an optical spectrum by multiplying the subcarrier signals by an additional signal and that reduces optical beat interference, even if the wavelengths of four Fabry-Perot laser diodes are very close each other.

We present a mechanism, named the law of the jungle (LOJ), to improve the Kohonen learning. The LOJ is used to be an adaptive vector quantizer for approximating nonstationary probability distribution functions. In the LOJ mechanism, the probability that each node wins in a competition is dynamically estimated during the learning. By using the estimated win probability, "strong" nodes are increased through creating new nodes near the nodes, and "weak" nodes are decreased through deleting themselves. A pair of creation and deletion is treated as an atomic operation. Therefore, the nodes which cannot win the competition are transferred directly from the region where inputs almost never occur to the region where inputs often occur. This direct "jump" of weak nodes provides rapid convergence. Moreover, the LOJ requires neither time-decaying parameters nor a special periodic adaptation. From the above reasons, the LOJ is suitable for quick approximation of nonstationary probability distribution functions. In comparison with some other Kohonen learning networks through experiments, only the LOJ can follow nonstationary probability distributions except for under high-noise environments.