This paper proves a general sampling theorem, which is an extension of Shannon's classical theorem. Let o be a closed subspace of square integrable functions and call o a signal space. The main aim of this paper is giving a necessary and sufficient condition for unique existence of the sampling basis {Sn}o without band-limited assumption. Using the general sampling theorem we rigorously discuss a frequency domain treatment and a general signal space spanned by translations of a single function. Many known sampling theorems in signal spaces, which have applications for multiresolution analysis in wavelets theory are corollaries of the general sampling theorem.

Machine learning in real-world situations sometimes starts from an initial collection of training instances; learning then proceeds off and on as new training instances come intermittently. The idea of two-phase learning has then been proposed here for effectively solving the learning problems in which training instances come in this two-stage way. Four two-phase learning algorithms based on the learning method PRISM have also been proposed for inducing rules from training instances. These alternatives form a spectrum, showing achievement of the requirement of PRISM (keeping down the number of irrelevant attributes) heavily dependent on the spent computational cost. The suitable alternative, as a trade-off between computational costs and achievement to the requirements, can then be chosen according to the request of the application domains.

The classical max-min policy has been suggested by the ATM Forum to support the available bit rate (ABR) service class. However, there are several drawbacks in adopting the max-min rate allocation policy. In particular, the max-min policy is not able to support the minimum cell rate (MCR) requirement and the peak cell rate (PCR) constraint for each ABR connection. Furthermore, the max-min policy does not offer flexible options for network providers wishing to establish a usage-based pricing criterion. In this paper, we present a generic weight-based rate allocation policy, which generalizes the classical max-min policy by supporting the MCR/PCR for each connection. Our rate allocation policy offers a flexible usage-based pricing strategy to network providers. A centralized algorithm is presented to compute network-wide bandwidth allocation to achieve this policy. Furthermore, a simple switch algorithm using ABR flow control protocol is developed with the aim of achieving our rate allocation policy in a distributed networking environment. The effectiveness of our distributed algorithm in a local area environment is substantiated by simulation results based on the benchmark network configurations suggested by the ATM Forum.

In communication networks there is a growing need for ensuring that networks maintain service despite failures. To meet the need, the concept of δ-reliable channel is introduced; it is a set of communication channels along a set of paths. The δ-reliable channel meets the requirement that if a link or node fails, failure is limited to a maximum of δ f (f total capacity of the channels, and 0<δ 1). The max-flow min-cut theorem of δ-reliable flow has been proved for the single-commodity case. In this paper we give a method for evaluating the maximum δ-reliable flow between a specified pair of vertices for single commodity case. The method consists of a maximum of 1/δ iterations of calculations of the maximum flow value.

In this paper, we propose a new lemma facility, called the strong contraction rule, for model elimination calculus, and we study some implementation issues of strong contraction in a PTTP-based theorem prover. Strong contraction has the ability to shorten possible proofs and prevent some irrelevant computation to a target goal. Strong contraction never broadens the search space, in principle, and thus, has a stable effect on the acceleration of top-down proof search. However, it is difficult to embed the strong contraction into a PTTP-based theorem prover, because strong contraction imposes a truncation operation of center chains in model elimination calculus. We show a self-truncation-style Prolog code, which makes it possible to retain the high performance of a PTTP-based prover with strong contraction. Finally, we evaluate the performance and effect of strong contraction by performing some experiments.

Many image-processing techniques are based on texture features or gradation features of the image. However, Landsat images are complex; they also include physical features of reflection radiation and heat radiation from land cover. In this paper, we describe a method of constructing a super-resolution image of Band 6 of the Landsat TM sensor, oriented to analysis of an agricultural area, by combining information (texture features, gradation features, physical features) from other bands. In this method, a knowledge-based hierarchical classifier is first used to identify land cover in each pixel and then the least-squares approach is applied to estimate the mean temperature of each type of land cover. By reassigning the mean temperature to each pixel, a finer spatial resolution is obtained in Band 6. Computational results show the efficiency of this method.

We discussed on relationship between the width of slit ray and the accuracy of the measurement system for surface profile of electric contact. To obtain resolution of 10 [µm], we designed the mechanism which keeps constant the focal length between the object and the lens. As a result, the width of slit ray was clear in the whole surface. A section image could measured exactly and enhanced the resolution.

Repeaterless transmission system design employing remote pumping in a single fiber is clarified. The design is aimed to realize cost effective submarine transmission systems with easy maintenance. Remote pumping in a single fiber can extend repeaterless transmission distance without decreasing the system capacity per cable. It is applicable for high-count-fiber cable such as the 100-fiber submarine cable already developed. A simple but effective system configuration is presented that uses remote pumping from receiver end; both remote-pre erbium-doped fiber (EDF) amplification and backward pumping Raman amplification are employed. Stable transmission can be obtained without optical isolators, therefore the optical time domain reflectometry (OTDR) method is supported by this system. Three fiber configurations, which consist of dispersion shifted fiber (DSF), pure silica core fiber (PSCF) and a combination of DSF and PSCF, are examined to compare system performance. Remote-pre EDF is optimized in terms of length and location from receiver end by optical SNR (OSNR) calculations. Maximum signal output power is also determined through a waveform simulation based on the split-step Fourier method, in order to avoid waveform distortion caused by the combined effect of self-phase modulation (SPM) and group velocity dispersion (GVD). Through these calculations and simulations, we confirm the proposed repeaterless transmission system performance of 600Mbit/s-451 km with PSCF, 2. 5 Gbit/s-407 km with DSF + PSCF, and 10 Gbit/s-376 km with DSF+PSCF, which include system margin.

As expert system technology gains wider acceptance in digital system design, the need to build and maintain a large scale knowledge base will assume greater importance. However, how to build a correct and efficient rule base is even a hard part in the knowledge-based system development. In this paper, we develop FARHDL (Frame-And-Rule-based Hardware Description Language) to form a knowledge base. The FARHDL is simple but powerful to specify the hardware requirements and can be directly simulated by PROLOG. Through the knowledge base transformed from FARHDL, a formal method can be developed to design, implement, and validate the digital hardware systems. Furthermore, behavioral properties, anomaly properties, structural properties, and timing properties are applied to analyze the requirements specification. The purposes of those properties are used to detect explicit/implicit incorrect specification clauses and to capture some desired requirements, such as completeness and consistency. Finally, the analysis results can be a useful tool for finding obscure problems in tricky digital system designs and can also aid in the development of formal specifications.

In this paper, we describe the properties of an external cavity modelocked semiconductor laser with a tunability of wavelength, pulse width and repetition rate. This modelocked laser generates optical pulses with pulse widths down to 180 fs and with repetition rates up to 14 GHz in a 120 nm wavelength range near 1. 55 µm or 1. 3 µm. The generated pulses are close to the transform limit and are therefore suitable for very high speed communication systems. In addition to the tunability, this pulse source is a compact and mechanically stable device. We report on two applications of this pulse source in optical time division multiplexing experiments. In the first example the modelocked laser is used as an all-optical clock recovery. In the second example the modelocked laser was used to characterize an interferometric switch by pump-probe experiments.

Requirements engineering refers to activities of gathering and organizing customer requirements and system specifications, making explicit representations of them, and making sure that they are valid and accounted for during the course of the design lifecycle of software. One very popular software development practice is the incremental development practice. The incremental development refers to practices that allow a program, or similarly specifications, to be developed, validated, and delivered in stages. The incremental practice is characterized by its depth-first process where focuses are given to small parts of the system in sequence to fair amounts of detail. In this paper, we present a development and validation of specifications in such an incremental style using a tool called ASADAL, a comprehensive CASE tool for real-time systems. ASADAL supports incremental and hierarchical refinements of specifications using multiple representational constructs and the evolving incomplete specifications can be formally tested with respect to critical real time properties or be simulated to determine whether the specifications capture the intended system behavior. In particular, we highlight features of ASADAL's specification simulator, called ASADAL/SIM, that plays a critical role in the incremental validation and helps users gain insights into the validity of evolving specifications. Such features include the multiple and mixed level simulation, real-value simulation, presentation and analysis of simulation data, and variety of flexible simulation control schemes. We illustrate the overall process using an example of an incremental specification development of an elevator control system.

We propose a new method for verifying synchronous circuits using the Boyer-Moore Theorem Prover (BMTP) based on an efficient use of induction. The method contains two techniques. The one is the representation method of signals. Each signal is represented not as a waveform, but as a time parameterized function. The other is the mechanical transformation of the circuit description. A simple description of the logical connection of the components of a circuit is transformed into such a form that is not only acceptable as a definition of BMTP but also adequate for applying induction. We formalize the method and show that it realizes an efficient proof.

This paper presents a new self-organization classification algorithm for remote-sensing images. Kohonen and other scholars have proposed self-organization algorithms. Kohonen's model easily converges to the local minimum by tuning the elaborate parameters. In addition to others, S. C. Amatur and Y. Takefuji have also proposed self-organization algorithm model. In their algorithm, the maximum neuron model (winner-take-all neuron model) is used where the parameter-tuning is not needed. The algorithm is able to shorten the computation time without a burden on the parameter-tuning. However, their model has a tendency to converge to the local minimum easily. To remove these obstacles produced by the two algorithms, we have proposed a new self-organization algorithm where these two algorithms are fused such that the advantages of the two algorithms are combined. The number of required neurons is the number of pixels multiplied by the number of clusters. The algorithm is composed of two stages: in the first stage we use the maximum self-organization algorithm until the state of the system converges to the local-minimum, then, the Kohonen self-organization algorithm is used in the last stage in order to improve the solution quality by escaping from the local minimum of the first stage. We have simulated a LANDSAT-TM image data with 500 pixel 100 pixel image and 8-bit gray scaled. The results justifies all our claims to the proposed algorithm.

This paper presents a method for land cover classification using the SIR-C/X-SAR imagery based on the maximum likelihood method and the polarimetric filtering. The main feature is to use polarimetric enhanced image information in the pre-processing stage for the classification of SAR imagery. First, polarimetric filtered images are created where a specific target is enhanced versus another, then the image data are incorporated into the feature vector which is essential for the maximum likelihood classification. Specific target classes within the SAR image are categorized according to the maximum likelihood method using the wavelet transform. Addition of polarimetric enhanced image in the preprocessing stage contributes to the increase of classification accuracy. It is shown that the use of polarimetric enhanced images serves efficient classifications of land cover.

In this paper we propose a new far-field RCS prediction method using cylindrical or planar near-field RCS data. First we derive the relation between RCS and the scattering coefficient using physical optics technique. The far-field RCS prediction algorithm is obtained by approximating the relation using the condition of Fresnel region and the paraxial constraint of scanning angle in the case of cylindrical or planar scanning. Finally we predict the far-field RCS using measured or calculated near-field RCS data of the conducting rectangular prism or plate. The validity of the proposed algorithm is demonstrated.

In this paper, a quite general systematic procedure is presented for defining incremental field contributions, that may provide effective tools for describing a wide class of scattering and diffraction phenomena at any aspect, whthin a unitary, self-consistent framework. This is based on a generalization of the localization process for cylindrical canonical problems with elementary source illumination and arbitrary observation aspects. In particular, it is shown that the spectral integral formulation of the exact solution may also be represented as a spatial integral convolution along the axis of the cylinder. Its integrand is then directly used to define the relevant incremental field contribution. This procedure, that will be referred to as a ITD (Incremental Theory of Diffraction) Fourier transform convolution localization process, is explicitly applied to both wedge and circular cylinder canonical configurations, to define incremental diffiraction and scattering contributions, respectively. These formulations are asymptotically approximated to find closed form high-frequency expression for the incremental field contributions. This generalization of the ITD lacalization process may provide a quite general, systematic procedure to find incremental field contributions that explicitly satisfy reciprocity and naturally lead to the UTD ray field representation, when it is applicable.

Since spontaneously spoken language expressions appear continuously, the transfer stage of a spoken language machine translation system have to work incrementally. In such the system, the high degree of incrementality is also strongly required rather than that of quality. This paper proposes an incremental machine translation system, which translates English spoken words into Japanese in accordance with the order of appearances of them. The system is composed of three modules: incremental parsing, transfer and generation, which work synchronously. The transfer module utilizes some features and phenomena characterizing Japanese spoken language: flexible wordorder, ellipses, repetitions and so forth. This in influenced by the observational facts that such characteristics frequently appear in Japanese uttered by English-Japanese interpreters. Their frequent utilization is the key to success of the exceedingly incremental translation between English and Japanese, which have different word-order. We have implemented a prototype system Sync/Trans, which parses English dialogues incrementally and generates Japanese immediately. To evaluate Sync/Trans we fave made an experiment with the conversations consisting of 27 dialogues and 218 sentences. 190 of the sentences are correct, providing a success rate of 87.2%. This result shows our incremental method to be a promising technique for spoken language translation with acceptable accuracy and high real-time nature.

Next generation hand-held devices must provide seamless connectivity while obeying stringent power and size constrains. In this paper we examine this issue from the point of view of the Network Interface (NI). We measure the power usage of two PDAs, the Apple Newton Messagepad and Sony Magic Link, and four NIs, the Metricom Ricochet Wireless Modem, the AT&T Wavelan operating at 915 MHz and 2.4 GHz, and the IBM Infrared Wireless LAN Adapter. These measurements clearly indicate that the power drained by the network interface constitutes a large fraction of the total power used by the PDA. We then examine two classes of optimizations that can be used to reduce network interface energy consumption on these divices: transport-level strategies and application-level strategies. Simulation experiments of transport-level strategies show that the dominant cost comes not from the number of packets sent or received by a particular transport protocol but the amount of time that the NI is in an active but idle state. Simulation experiments of application-level strategies that significant energy savings can be made with a minimum of user-visible latency.

In this paper, a new trial for the signal processing is proposed along the same line as a previous study on the extended regression analysis based on the Bayes' theorem. This method enables us to estimate a response probability property of complicated systems in an actual case when observation values of the output response are roughly observed due to the quantization mechanism of measuring equipment. More concretely, the main purpose of this research is to find the statistics of the joint probability density function before a level quantization operation which reflects every proper correlation informations between the system input and the output fluctuations. Then, the output probability distribution for another kind of input is predicted by using the estimated regression relationship. Finally, the effectiveness of the proposed method is experimentally confirmed by applying it to the actually observed input-output data of the acoustic system.

This paper describes a nondestructive measurement method for complex permittivity of dielectric plates at 2 GHz, using a cylindrical cavity resonator. The resonator is divided into two parts at the center. Two dielectric plates are symmetrically loaded around the center of the cavity. These plates have high permittivity of 45. A dielectric plate specimen is clamped with these halves. The values of relative permittivity ε and loss tangent tanδ of the specimen are obtained from the resonant frequency and unloaded Q-value of TE011 mode. Measured results of various materials are compared with those values obtained at 3 and 10 GHz by other cavity resonator method. An edge effect is taken into account by a reference method, using measurement data of a sapphire plate. The errors of the present method are smaller than 1% and 2-310-5 for ε and tanδ, respectively.