This paper describes a classification method for rotated and scaled textured images using invariant parameters based on spectral-moments. Although it is well known that rotation invariants can be derived from moments of grey-level images, the use is limited to binary images because of its computational unstableness. In order to overcome this drawback, we use power spectrum instead of the grey levels to compute moments and adjust the integral region of moment evaluation to the change of scale. Rotation and scale invariants are obtained as the ratios of the different rotation invariants on the basis of a spectral-moment property with respect to scale. The effectiveness of the approach is illustrated through experiments on natural textures from the Brodatz album. In addition, the stability of the invariants with respect to the change of scale is discussed theoretically and confirmed experimentally.

Video-on-Demand (VOD)servers are becoming feasible. These servers are a building component in a heterogeneous multimedia environment but have voluminous data to store and manage. If only disk-based secondary storage systems are used to store and manage this huge amount of data the system cost would be extensively high. A tape-based tertiary storage system seems to be a reasonable solution to lowering the cost of storage and management of this continuous data. However, the usage of a tertiary storage system to store large continuous data introduces several issues. These are mainly the replacement policy on disks, the decomposition and the placement of continuous data chunks on tapes, and the scheduling of multiple requests for materializing objects from tapes to disks. In this paper we address these issues and we propose solutions based on some heuristics we experimented in a simulator.

This paper gives an overview of Turbo codes principles, performance, and design issues for practical application. As fundamentals of Turbo codes, encoder structure, interleaver, and iterative decoding are explained. The performance is analyzed through their weight distribution, and the analysis gives code design rules for component codes. Practical decoding algorithms are presented in addition to MAP algorithm. Design issues are discussed for mobile communications as an example of practical application. Finally, research trends are briefly mentioned.

In this study the spectral intensities of a breaking arc were measured near the cathode and the anode between separating Pd contacts in a DC 50 V/5 A circuit, and arc temperature and metal-vapor quantity and density were calculated. Results show the radial distribution of temperature in the cross section of an arc column was constant both near the cathode and the anode from the beginning to the extinction of the breaking arc. Near the cathode the arc temperature in the position of the peak value of spectral intensity rose to about 6000 K at the beginning and remained constant, but near the anode it rose to about 6000 K at the beginning and then decreased towards the extinction of the arc. Both near the cathode and the anode metal-vapor quantity and density rose suddenly at the beginning. Afterwards, they fell near the cathode until extinction. But they became constant approaching extinction near the anode. And the metal-vapor quantity was greater and the density higher near the cathode than near the anode.

Variable-rate data transmission with no rate indicator is described for direct sequence code division multiple access (DS-CDMA) mobile radio. The variable-rate data to be transmitted is block-encoded using a cyclic redundancy check (CRC) and then convolutionally encoded before being spread. The convolutionally encoded data is always brought to the zero state at the end of the data sequence within each frame. Blind rate detection is incorporated into the process of Viterbi-decoding the received convolutional-coded frame data. At each possible end bit position (i. e. , each possible transmission rate), the trellis path arriving at the zero-state is selected if its path metric satisfies a certain condition, and is then traced back to recover the frame data. CRC is used to determine whether the recovered data is correct or not. The path selection condition is described. The average frame error rate (FER) and average false detection rate (FDR) are evaluated by computer simulation under frequency selective multipath Rayleigh fading environments and the results are compared with another variable-rate transmission scheme using a rate indicator.

With the advance of computer technologies, mobile computers can hold many local resources in themselves. In many cases it is impossible to announce local resources on them because almost information announcement systems are not designed for them. In this paper, an information announcement system for mobile computers based on WWW is proposed. The system efficiently announces resources on mobile computers independently of whether they are connected to a network or not, and wherever they are connected. The system can also select suitable announcement methods according to the type of resources. We implement a prototype of proposed system and evaluate it. The result of evaluation confirms effectiveness of the proposed system.

Fuzzy value is a Fuzzy set the α-cuts of which are closed intervals. Let [0,1] be the set of Fuzzy values on [0,1]. We introduce two kinds of metric D and D1 in it, and investigate some topological properties.

The next generation mobile communications systems must support multimedia communications services as well as conventional voice service. DS-CDMA is regarded as the most promising candidate, because it is indispensable to cope with multimedia. The system capacity of DS-CDMA system is limited by the total interference level. As a result, in DS-CDMA systems many users suffer very poor communication quality if the total interference level exceeds this limit. Therefore, this paper considers smoothing interference fluctuation using the difference between voice and data in a type of QoS (quality of service). In other words, voice communication is suitable for a loss system because the quality of voice communication is delay-sensitive. On the other hand, data communication is suitable for a waiting system because the quality of data communication is non-delay-sensitive. This paper focuses on a system that applies a circuit switching method for voice traffic and a reservation type packet switching method for data traffic and proposes a data traffic control method. In this proposed data traffic control method, a base station controls data transmission from a mobile station to utilize unused voice traffic resources. As a result, the proposed method achieves highly efficient use of the radio spectra by smoothing interference fluctuation in DS-CDMA systems. This paper evaluates the performance level of the proposed method from a system capacity standpoint. It is shown that the proposed method achieves higher system capacity in voice/data integrated transmission.

Electrochemomechanical deformation (ECMD) of poly(o-methoxyaniline) (PoMAn) film has been studied in various acid solutions, such as Cl-, HSO4-, BF4-, and p-toluene sulfate. The magnitude of ECMD of the film depends linearly on the degree of oxidation of the film similarly to the case of polyaniline (PAn). 2. 53% of deformation ratios along the stretched direction are obtained for 30% of reduction. In contrast to that of PAn, however, the ECMDs of PoMAn do not markedly depend on the kind of anions. Transient responses of current and deformation are investigated by the potential application stepwise and the diffusion coefficient of ions in films. The results are discussed in terms of the effect of substituted methoxy group.

This paper presents some fundamental properties of multiple-valued logic functions monotonic in a partial-ordering relation which is introduced in the set of truth values and does not necessarily have the greatest or least element. Two kinds of necessary and sufficient conditions for monotonic p-valued functions are given with the proofs. Their logic formulas using unary operators defined in the partial-ordering relation and a simplification method for those logic formulas are also given. These results include as their special cases our former results for p-valued functions monotonic in the ambiguity relation which is a partial-ordering relation with the greatest element.

This paper describes an efficient method to simulate lossy coupled transmission lines based on the delay evaluation technique. First, we review the previous methods, and refer to several problems concerned with these methods. Next, a novel waveform relaxation-based simulation method is proposed, which uses the delay evaluation technique. This method enables to obtain the accurate transient waveforms using smaller number of moments than the other moment methods use, and is modified for acceleration by the generalized line delay window partitioning (GLDW) technique. Finally, this method is implemented in the waveform relaxation-based circuit simulator DESIRE3T+, and the performance is estimated.

An efficient algorithm is proposed for finding all solutions of bipolar transistor circuits. This algorithm is based on a simple test that checks the nonexistence of a solution using linear programming. In this test, right-angled triangles are used for surrounding exponential functions of the Ebers-Moll model, by which the number of inequality constraints decreases and the test becomes efficient and powerful.

A GaAs power MESFET amplifier with a low-distortion, 10-dB gain-variable attenuator has been developed for 1. 9-GHz Japanese personal handy phone system (PHS). Independently of its gain, a very low 600-kHz adjacent channel leakage power (ACP) with sufficient output power was attained. In single low 2. 4-V supply operation, an output power of 21. 1 dBm, a low dissipated current of 157 mA and a high power-added efficiency (PAE) of 37. 2% were obtained with an ACP of -55 dBc.

The following, which is related to the design of the microwave filters, is mainly presented: (1) certain useful approximation which can be obtained by double-resistive- terminated 2-ports consisting of a cascade of two 1-variable 2-ports in different variables, and (2) an approach for filter design from 2-variable viewpoint. Approximations presented provide useful magnitude responses in 2-D domain. Hence it is discussed that how the provided 2-D responses can be used for the design of the microwave filters. Furthermore, properties of the 2-variable transfer functions resulting in such circuits are given.

This paper proposes a novel representation scheme for self-healing networks, and estimates the performance of restoration algorithms in terms of survivability. This representation is based on that of ring networks. For an arbitrary topology, the network is partitioned into ring sub-networks which are independent of each other, and we consider an extended network constructed by the concatenation of the ring sub-networks. After the statement of the general case, examples of a self-healing ring and a Digital Cross-connect System(DCS)based network are described.

Cell delay variation (CDV) has been considered as an important performance measure due to the stringent timing requirement for video and multimedia services. In this paper we address the problem of CDV performance guarantee in virtual path (VP)-based ATM multiplexing. We propose a rate-based and non-work-conserving scheduling algorithm, called interleaved round robin (IRR), for serving traffic streams among VPs into the outgoing link. Through our performance analysis, the proposed scheme is capable of providing upper and lower bounds on the inter-visit time (IVT) for each VP, where the difference between the upper bound and the lower bound is simply dependent upon the number of multiplexed VPs. The distribution of VP IVT scheduled by an IRR server can also be well approximated using a random incidence technique. In addition to the VP-level CDV performance, we further examine the virtual connection (VC)-level CDV incurred within a multi-stage network through simulation study. The simulation results show that the IRR server can provide traffic regulation and smoothness at each network node. Moreover, the CDV distribution of a tagged VC is insensitive to the source traffic characteristic, node location, and the hop count traversed in the network.

We propose a finite-capacity single-vacation model, with close-down/setup times and a Markovian arrival process (MAP), for SVC-based IP-over-ATM networks. This model considers the SVC processing overhead and the bursty nature of IP packet arrivals. Specifically, the setup time corresponds to the SVC setup time and the vacation time corresponds to the SVC release time, while the close-down time corresponds to the SVC timeout. The MAP is a versatile point process by which typical bursty arrival processes like the IPP (interrupted Poisson process) or the MMPP (Markov modulated Poisson process) is treated as a special case. The approach we take here is the supplementary variable technique. Compared with the embedded Markov chain approach, it is more straightforward to obtain the steady-state probabilities at an arbitrary instant and the practical performance measures such as packet loss probability, packet delay time, and SVC setup rate. For the purpose of optimal design of the SVC-based IP-over-ATM networks, we also propose and derive a new performance measure called the SVC utilization ratio. Numerical results show the sensitivity of these performance measures to the SVC timeout period as well as to the burstiness of the input process.

In this paper, we propose a descriptor as a shape signature and the projective refinement as a verification method for recognizing 2D curved objects with occlusions from their partial views. For an extracted curve segment, we compute a series of the geometric invariance of equally spaced five co-planar points on the curve. Thus the resulting descriptor is invariant only under rotation, translation, and scale, but sufficient similarity is preserved even under large distortions. It is more stable and robust since it does not need derivatives. We use this transformation-invariant descriptor to index a hash table. We show the efficiency of the method through experiments using seriously distorted images of 2-D curved objects with occlusions.

Let H=(V(H),E(H)) be a directed graph with distinguished vertices s and t. An st-path in H is a simple directed path starting from s and ending at t. Let (H) be defined as { SS is the set of vertices on an st-path in H (s and t are excluded)}. For an undirected graph G=(V(G),E(G)) with V(G) V(H)- { s,t }, if the family of maximal independent sets of G coincides with (H), we call H an MIS-diagram for G. In this paper, we provide a necessary and sufficient condition for a directed graph to be an MIS-diagram for an undirected graph. We also show that an undirected graph G has an MIS-diagram iff G is a cocomparability graph. Based on the proof of the latter result, we can construct an efficient algorithm for generating all maximal independent sets of a cocomparability graph.

This paper proposes a new design method of a nonlinear filtering algorithm in continuous-time stochastic systems. The observed value consists of nonlinearly modulated signal and additive white Gaussian observation noise. The filtering algorithm is designed based on the same idea as the extended Kalman filter is obtained from the recursive least-squares Kalman filter in linear continuous-time stochastic systems. The proposed filter necessitates the information of the autocovariance function of the signal, the variance of the observation noise, the nonlinear observation function and its differentiated one with respect to the signal. The proposed filter is compared in estimation accuracy with the MAP filter both theoretically and numerically.