Although consistent learning is sufficient for PAC-learning, it has not been found what strategy makes learning more efficient, especially on the sample complexity, i.e., the number of examples required. For the first step towards this problem, classes that have consistent learning algorithms with one-sided error are considered. A combinatorial quantity called maximal particle sets is introduced, and an upper bound of the sample complexity of consistent learning with one-sided error is obtained in terms of maximal particle sets. For the class of n-dimensional axis-parallel rectangles, one of those classes that are consistently learnable with one-sided error, the cardinality of the maximal particle set is estimated and O(d/ε1/ε log 1/δ) upper bound of the learning algorithm for the class is obtained. This bound improves the bounds due to Blumer et al. and meets the lower bound within a constant factor.

This paper describes a parameter extraction system that can easily accommodate many MOSFET models. The model-adaptability is contributed by tow factors; a model-adaptable initial value estimation technique and an environment which stores and reuses extraction procedures. A designer can easily develop an extraction procedure for a new MOSFET model by modifying a procedure for another MOSFET model developed previously. We have verified that the system is suitable for major SPICE models.

This letter presents new estimation algorithm of ARMAX systems which do not always satisfy the strictly positive real (SPR) condition. We show how estimated parameters can converge to their true values based on the overparameterized system. Finally, the results of computer simulation are presented to illustrate the effectiveness of the proposed method.

In this paper we investigate the learnability of relations in Inductive Logic Programming, by using equality theories as background knowledge. We assume that a hypothesis and an observation are respectively a definite program and a set of ground literals. The targets of our learning algorithm are relations. By using equality theories as background knowledge we introduce tree structure into definite programs. The structure enable us to narrow the search space of hypothesis. We give pairs of a hypothesis language and a knowledge language in order to discuss the learnability of relations from the view point of inductive inference and PAC learning.

The superconducting magnet on a maglev vehicle vibrate and heats up inside under the influence of various disturbances in running. We have investigated the characteristics of heating in the superconducting magnet vibrating under the electro-magnetic disturbance from the ground coils. This magnetic disturbance has a frequency component ranging widely from 0 Hz to several hundred Hz which is proportional to the speed of the maglev vehicle. It was revealed that an extreme increase of heat load on the inner vessel of the energized magnet occurred at a particular frequency and it surpassed the capacity of the refrigerator installed in the tank of the superconducting magnet. As a result of the investigation, we could identify broadly three factors of heating, and now we have good prospects of largely suppressing the heating by reducing the disturbance through the folded arrangement of the ground coils and a structural improvement of the magnet.

This paper describes a fully digitized modem designed for variable baud rate transmission systems with the aim of efficiently providing multimedia services over a wireless communication network. The concept of a variable baud rate wireless communication system is discussed focusing on the access scheme and channel allocation from the viewpoint of frequency utilization efficiency. For easy system construction, we propose a fully digitized variable baud rate modem based on multirate digital signal processing, taking into account the need for even performance and easy clock control for all transmission rates. We also discuss the operational principle of modulation, the degradation factor in the A/D converter, and the configuration of the clock recovery circuit. Steady modulation performance can be kept by generating the same frequency system clock for all transmission rates and using the sampling rate conversion technique without selecting the channel filter for each transmission rate. It is proved by the analysis of the degradation factor in the A/D converter that only the bandwidth of the channel filter in demodulator should be changed for the transmission rate. A double loop clock recovery configuration capable of both tank-limit type and baseband estimation type clock recovery is shown to be suitable for this system. The tank-limit clock recovery circuits can be constructed easily by employing a tank circuit array. Finally, we present experimental results for a modem having transmission rates of 1.544Mbps and 6.312Mbps for the digital hierarchy and information speed of video signals such as MPEG-1 and MPEG-2. The measured basic performance of the proposed modem shows it delivers superior performance without the need for precise adjustment when a QPSK modulation scheme is employed.

The performance of trellis coded hybrid frequency and phase shift modulation (TC HFPSK) with the expurgated phase code and the asymmetric signal constellation is investigated by using the minimum squared free Euclidean distance d 2free and the bit error rate (BER). It is found that TC hybrid 2FSK/4PSK with the expurgated phase code shows larger d 2free than the corresponding TC hybrid 2FSK/4PSK with the complete phase code for varying the angle φ that determines the asymmetric signal constellation. The maximum value of d 2free of TC hybrid 2FSK/4PSK with the expurgated phase code can be obtained when the signal constellation is symmetric. The performance of BER is analyzed in additive white Gaussian noise (AWGN) and fading channels by using uniform error property and error bound based on transfer function. It is found that the coding gain of TC hybrid 2FSK/4PSK with the expurgated phase code over uncoded hybrid 2FSK/2PSK at BER=10-4 are 2.71dB and 4.74dB in AWGN and fading channels, respectively. The performance improvements of TC hybrid 2FSK/4PSK with the expurgated phase code over TC 8PSK at BER=10-4 are 0.68dB and 4.07dB in AWGN and fading channels, respectively.

This paper discusses some problems in Molecular Biology for which learning paradigms are strongly desired. We also present a framework of knowledge discovery by PAC-learning paradigm together with its theory and practice developed in our work for discovery from amino acid sequences.

This paper concerns the issue of learning strategies for problem solvers from trace data. Many works on Explanation Based Learning have proposed methods for speeding up a given problem solver (or a Prolog program) by optimizing it on some subspace of problem instances with high probability of occurrences. However, in the current paper, we discuss the issue of identifying a target strategy exactly from trace data. Learning criterion used in this paper is the identification in the limit proposed by Gold. Further, we use the tree pattern language to represent preconditions of operators, and propose a class of strategies, called decision list strategies. One of the interesting features of our learning algorithm is the coupled use of state and operator sequence information of traces. Theoretically, we show that the proposed algorithm identifies some subclass of decision list strategies in the limit with the conjectures updated in polynomial time. Further, an experimental result on N-puzzle domain is presented.

We have investigated the Josephson microwave self-radiation and the linewidth from different types of YBa2Cu3Oy(YBCO) grain boundary junctions: natural grain boundary junctions, step-edge junctions and bicrystal junctions. The Josephson self-rediation was directly observed using a total power radiometer receiver with receiving frequencies fREC=1.7-72 GHz. All junctions exhibited microwave self-radiation peaks with intensity of order of 10-12-10-14 W. For step-edge and bicrystal junction, they appeared at a voltage related to the Josephson frequency-voltage relation, V=n(h/2e)f, while for natural grain boundary junctions, the above relation did not hold, suggesting a Josephson medium property. For all types of junctions the observed Josephson linewidth deviated from the theoretical RSJ values due to the extra noise source in the grain boundary junction. The Josephson linewidth decreased with increasing the receiving frequency for all type of junctions. The reduction of Josephson linewidth at higher frequencies indicates that the critical current fluctuations due to a critical current spread at small bias voltages and a crystalline disorientation at the junction boundary generate an additional noise in grain boundary junctions.

We reported that a competitive learning neural network had the ability of self-organization in the classification of questionnaire survey data. In this letter, its self-organized learning was evaluated by means of mutual information. Mutual information may be useful to find efficently the network which can give optimal classification.

As a first step to develop a system to analyze or recognize patterns contained in mages, it is important to provide a good base representation that can facilitate efficiently the interpretation of such patterns. Since structural features of basic patterns in document images such as characters or tables are horizontal and vertical stroke components, we propose a new expression of document image based on the MCR expression that can express well such features of text and tabular components of an image.

A multiple instruction stream-multiple data stream (MIMD) computer is a parallel computer consisting of a large number of identical processing elements. The essential feature that distinguishes one MIMD computer family from another is the interconnection network. In this paper, we are concerned with a representative type of interconnection networks: the hypercube connected network. A family of regular graphs is presented as a possible candidate for the implementation of a distributed system and for fault-tolerant architectures. The symmetry of graphs makes it possible to determine message routing by using a simple distributed algorithm. A candidate having the same property is the hypercube connected network. Arbitrary data permutations are generally accomplished by sorting. For certain classes of permutations, however, this is, for many frequently used permutations in parallel processing such as bit reversal, bit shuffle, bit complement, matrix transpose, butterfly permutations used in FFT algorithms, and segment shuffles, there exist algorithms that are more efficient than the best sorting algorithm. One such class is the bit permute complement (BPC) class of permutations. In this paper, we, first, develop an algorithm to realize an arbitrary BPC permutation in hypercube connected networks. The developed algorithm in hypercube connected networks requires only 1 token memory register in each node. We next evaluate the ability to realize BPC permutations in these networks of an arbitrary size by estimating the number of required routing steps.

A 10-kW (53V/200A), forced-air-cooled DC-DC converter has been developed for fuel cell systems. This converter uses new high-voltage bipolar-mode static induction transistors (BSIT), a new driving method, a zero-voltage-switched pulse-width-modulation technique, and a new litz wire with low AC resistance. It weighs only 16.5kg, has a volume of 26,000cm3, operates at 40kHz, and has a power conversion efficiency of about 95%. The power loss of this converter is 20% less than that of conventional natural-air-cooled DC-DC converters, and the power density is 3 times as high.

Board-to-board signal transmission in a rack system is affected by various types of noise. Signal transmission capability is evaluated on the basis of physical construction parameters and signal conditions, such as rise time and amplitude. This paper examines noise in a rack system and shows that the maximum single-ended transmission capability is 100Mbps when pin-type connectors are used with a signal/ground pin assignment ratio of 1/1.

This paper studies congestion control schemes for integrated variable bit-rate (VBR) video and data communications, where the quality of service (QOS) of each medium needs to be satisfied. In order to control congestion, we exert here either dynamic resolution control or QOS control. The dynamic resolution control scheme in this paper dynamically changes the temporal or spatial resolution of video according to the network loads. The QOS control scheme here assigns a constant capacity of buffer to each connection and determines the video resolution in order to guarantee the QOS of each medium at the connection establishment. The performance of these schemes is evaluated through simulation in terms of throughput, video frame delay probability distribution, and video frame loss rate. We also examine the effects of priority scheduling and packet discarding on the performance. Numerical results indicate that both dynamic resolution and QOS control attain low delay jitters as well as large video and data throughput. In particular, the QOS control is shown to be more suitable for integrated VBR video and data communications.

In this paper, the ATM Mini-Bar System (AMBS) which is a future information providing service infrastructure is proposed. The purpose of AMBS is to provide a multi-media environment in which a user can (1) select and get quickly any needed information, in low cost, at any time, among very large amount of different media information provided by a variety of providers, (2) be charged only for the information which is selected and used, (3) edit or process informations into users' individually requested style or format before using them. The basic concept and configurations of AMBS are also addressed. This system is basically a center-end oriented one-way information providing system. The information center broadcasts its contents to all user equipments based on a user request forecast, and every user equipment stores the delivered contents in its large storage. A user can select one's needed informations from the storage, and may edit or process them within the user equipment. The charge is only on the read informations from the storage, not on all contents in it. The key points of this system are the following three. (A) Introduction of a broadcast (or multicast) media for economical information delivery (exactly speaking, it is a predelivery which means a delivery before request) to user equipments. (B) Introduction of a 1 to 1 communication network for selective charging and control of each user equipments. (C) Introduction of the user equipment storage for Quick response to user information request in most cases with the broadcast (or multicast) information delivery media described above, Separation of information delivery speed and replay speed to increase system flexibility, Local user information processing or editing. As an example of technical solutions, a memory architecture, which is based on hierarchical architecture, is described. AMBS is expected to give some impacts to information industries because it can integrate many kinds of services into the same platform, but some standerdization items are needed to realize it.

Complexity of Boolean functions satisfying the propagation criterion (PC), an extended notion of the perfect nonlinearity, is discussed on several computation models. The following topics are investigated: (i) relationships between the unateness and the degree of the PC, (ii) the inversion complexity of perfectly nonlinear Boolean functions, (iii) the formula size of Boolean functions that satisfy the PC of degree 1, (iv) the area-time-square complexity of VLSI circuits computing perfectly nonlinear Boolean functions, (v) the OBDD size perfectly nonlinear Boolean functions.

In this paper, it is stated that visualization and abstraction of program specifications can be highly integrated on the basis of decision tables and condition expressions. In order to demonstrate this idea, we developed an automatic programming system called SPACE: SPecification Acquisition and Compiling Engine. SPACE is designed to ease the production of business data processing program. SPACE has functions both to support the creation of visual program specifications and to generate COBOL programs according to the input program specifications. To visualize program specification, SPACE design windows are comprised of two diagrams and four tables in a format similar to the conventional detailed design sheets. To represent module functions, in particular, a visualized computation model called a decision table is used. All the possible execution states of a module are represented by combining the state function called condition expressions. The condition expressions represent the typical file processing patterns in very familiar form to actual business application designer. They do not simply give function values; each of them carries out implicit attached procedures according to the characteristic I/O control logic for business data processing. Hence users can describe program specifications concisely by designating merely the condition expression instead of the detailed I/O control logic. This paper uses sample descriptions of stock control problems to explain how visualization of computation and abstraction of algorithm can be integrated and formalized on a basis of a decision table and a condition expression. Also the paper describes how to generate programs from visual specifications.

In this paper, we present a method for extracting the Japanese printed characters from unformatted document images. This research takes into account the multiple general features specific to the Japanese printed characters. In our method, these features are thought of as the constraints for the regions to be extracted within the constraint satisfaction approach. This is achieved by minimizing a constraint function estimating quantitative satisfaction of the features. Our method is applicable to all kinds of the Japanese documents because it is no need of a priori knowledge about the document layout. We have favorable experimental results for the effectiveness of this method.