A new approach for generating a system model from its input-output data is presented. The model is approximated as a linear combination of simple basis functions. The number of basis functions is kept as small as possible to prevent over-fitting and to make the model efficiently computable. Based on these conditions, genetic programming is employed for the generation and selection of the appropriate basis. Since the obtained model can be expressed in simple mathematical expressions, it is suitable for using the model as a macro or behavior model in system level simulation. Experimental results are shown.

Topological Walk is an algorithm that can sweep an arrangement of n lines in O(n2) time and O(n) space. This paper revisits Topological Walk to give its new interpretation in contrast with Topological Sweep. We also survey applications of Topological Walk to make the distinction clearer.

We have proposed a non-invasive method for diagnosis of the early stage of atherosclerosis, namely, the detection of small vibrations on the aortic wall near the heart by using ultrasound diagnostic equipment. It is, however, necessary to confirm the effectiveness of such measurement of the pulse wave velocity for quantitative evaluation of the local characteristics of atherosclerosis. It is well known that Young's modulus of a tube wall, estimated from measured pulse wave velocity, depends on inner pressure because of the non-linear relationship between the inner pressure and the change of volume in the tube. The inner pressure, however, changes during the period of one heartbeat. In this experimental study, we found for the first time that Young's modulus of the tube wall, estimated from the measured pulse wave velocity, depends not only on the diastolic pressure but also on the pulse pressure and the pressure gradient of the systolic period.

A formal necessary and sufficient condition on the general Petri net reachability problem is presented by eliminating all spurious solutions among known nonnegative integer solutions of state equation and unifying all the causes of those spurious solutions into a maximal-strongly-connected and siphon-and-trap subnet Nw. This result is based on the decomposition of a given net (N, Mo) with Md and the concepts of "no immature siphon at the reduced initial marking Mwo" and "no immature trap at the reduced end marking Mwd" on Nw which are both extended from "no token-free siphon at the initial marking Mo" and "no token-free trap at the end marking Md" on N, respectively, which have been both effectively, explicitly or implicitly, used in the well-known fundamental and simple subclasses.

Time series prediction is very important technology in a wide variety of fields. The actual time series contains both linear and nonlinear properties. The amplitude of the time series to be predicted is usually continuous value. For these reasons, we combine nonlinear and linear predictors in a cascade form. The nonlinear prediction problem is reduced to a pattern classification. A set of the past samples x(n-1),. . . ,x(n-N) is transformed into the output, which is the prediction of the next coming sample x(n). So, we employ a multi-layer neural network with a sigmoidal hidden layer and a single linear output neuron for the nonlinear prediction. It is called a Nonlinear Sub-Predictor (NSP). The NSP is trained by the supervised learning algorithm using the sample x(n) as a target. However, it is rather difficult to generate the continuous amplitude and to predict linear property. So, we employ a linear predictor after the NSP. An FIR filter is used for this purpose, which is called a Linear Sub-Predictor (LSP). The LSP is trained by the supervised learning algorithm using also x(n) as a target. In order to estimate the minimum size of the proposed predictor, we analyze the nonlinearity of the time series of interest. The prediction is equal to mapping a set of past samples to the next coming sample. The multi-layer neural network is good for this kind of pattern mapping. Still, difficult mappings may exist when several sets of very similar patterns are mapped onto very different samples. The degree of difficulty of the mapping is closely related to the nonlinearity. The necessary number of the past samples used for prediction is determined by this nonlinearity. The difficult mapping requires a large number of the past samples. Computer simulations using the sunspot data and the artificially generated discrete amplitude data have demonstrated the efficiency of the proposed predictor and the nonlinearity analysis.

We describe the design of ECL write circuits and a CMOS memory cell in an ECL-CMOS SRAM to achieve ultra-fast cycle time. Factors determining the write cycle are reduced by several novel circuit techniques and by optimizing the design of the write circuits and CMOS memory cell, thereby, enabling ultra-fast cycle time. Key techniques are a bit line overdriving, the use of an overshoot suppressing emitter follower and a WPG with a replica memory cell delayer. The 72-kb ECL-CMOS SRAM macro through which these techniques were implemented was fabricated using 0. 3-µm BiCMOS technology. The RAM macro achieves a short cycle time of 2 ns without sacrificing stable memory cell operation. These techniques thus provide SRAMs with a shorter cycle time in the cache memories of high performance computer systems.

We introduce a subclass of context-free languages, called pure context-free (PCF) languages, which is generated by context-free grammars with only one type of symbol (i. e. , terminals and nonterminals are not distinguished), and consider the problem of identifying paralleled even monogenic pure context-free (pem-PCF) languages, PCF languages with restricted and enhanced features, from positive data only. In this paper we show that the ploblem of identifying the class of pem-PCF languages is reduced to the ploblem of identifying the class of monogenic PCF (mono-PCF), by decomposing each string of pem-PCF languages. Then, with its result, we show that the class of pem-PCF languages is polynomial time identifiable in the limit from positive data. Further, we refer to properties of its identification algorithm.

Many `output-scheduling' algorithms have been proposed for improving the performance of input queueing asynchronous transfer mode (ATM) switches, whereby cells from different random-access input queues destined for the same output can be scheduled for non-conflicting transmissions. An optimal output-scheduling algorithm, one with the full coordination of transmissions to all outputs, can approach the performance of output queueing. Because of the complexity of such an optimal scheduler, output schedulers proposed in the literature are without such coordination. We propose a simple way to incorporate such a full coordination in output-scheduling with much simple hardware, for small size switches. Throughput of the input queueing switch thus approaches that of the output queueing switch, without speed-up, input/output grouping or complicated hardware. To make the output-scheduling algorithm fast enough, we incorporate parallelism and pipelining. We perform detailed simulation study of the performance of the input queueing switch with the proposed scheduling algorithm.

We discuss the uniqueness of 3-D shape reconstruction of a polyhedron from a single shading image. First, we analytically show that multiple convex (and concave) shape solutions usually exist for a simple polyhedron if interreflections are not considered. Then we propose a new approach to uniquely determine the concave shape solution using interreflections as a constraint. An example, in which two convex and two concave shapes were obtained from a single shaded image for a trihedral corner, has been given by Horn. However, how many solutions exist for a general polyhedron wasn't described. We analytically show that multiple convex (and concave) shape solutions usually exist for a pyramid using a reflectance map, if interreflection distribution is not considered. However, if interreflection distribution is used as a constraint that limits the shape solution for a concave polyhedron, the polyhedral shape can be uniquely determined. Interreflections, which were considered to be deleterious in conventional approaches, are used as a constraint to determine the shape solution in our approach.

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 MOSFET sizes and wire widths become very small in recent years, influence of resistive component of interconnects on the estimation of propagation delay and power dissipation can no longer be neglected. In this paper we present formulas of output waveform at driving point and short-circuit power dissipation for static CMOS logic gates driving a CRC π load. By representing the short-circuit current and the current flowing in the resistance of a CRC π load by piece-wise linear functions, a closed-form formula is derived. On the gate delay the error of our formula is less than 8% from SPICE in our experiments. These formulas will contribute to faster estimation of circuit speed and power dissipation of VLSI chips on timing level simulators.

We developed a glass ferrule fiber optic connector. During development, we also studied wear-resistant coating technology for preventing scratches on the surface of a glass ferrule. The method of coating was sputtering, and the material was alumina. We confirmed that a thin uniform coating could be formed on the ferrule surface to improve the durability of glass ferrule connectors.

The location of stations on the buses can not be ignored in the analysis of the DQDB protocol, especially when traffic load is heavy. In this paper, we propose a new method to model the DQDB (Distributed Queue Dual Bus) protocol by assuming that the request arrival process depends on both the value of the request counter and the location of a station on the buses. By taking these dependences, we can catch the real behavior of the DQDB stations, which is locationally dependent and unfair under heavy load traffic. Based on this model, we analyze the DQDB system with finite buffer by considering the request counter states and buffer states separately and obtain the throughput, mean packet delay and packet reject probability of individual stations. The throughput in individual stations matches that of simulation very well within the range of traffic up to the channel capacity. Also the delay and packet reject rate performance is good up to moderate traffic load. These numerical results reveal the properties of the location dependence and the unfairness of DQDB system under heavy load condition. The analytic results under heavy load traffic for a general DQDB system has not been reported till now. Therefore we conclude that our model and analysis are valid and effective.

A more judicious choice of trial functions to implement the Improved Circuit Theory (ICT) application to multi-element antennas is achieved. These new trial functions, based on Tai's modified variational implementation for single element antennas, leads to an ICT implementation applicable to much longer co-planar dipole arrays. The accuracy of the generalized impedance formulas is in good agreement with the method of moments. Moreover, all these generalized formulas including the radiation pattern expressions are all in closed-form. This leads to an ICT implementation which still requires much shorter CPU time and lesser computer storage compared to method of moments. Thus, for co-planar dipole arrays, the proposed implementation presents a relatively very efficient method and would therefore be found useful in applications such as CAD/CAE systems.

This correspondence reports novel computationally efficient algorithms for multiplication of bicomplex numbers, which belong to hypercomplex numbers. The proposed algorithms require less number of real multiplications than existing methods. Furthermore, they give more effective implementation when applied to constant coefficient digital filters.

The timing jitter of the optical pulse from a gain-switched laser diode is reduced by CW light injection. The reduction ratio of the timing jitter is 5. 5. The pulse width was compressed by a nonlinear optical loop mirror to a pedestal-free optical pulse with a pulse width of 420 fs.

Electroabsorption modulators are high speed devices that are rapidly being commercialised and finding applications in a number of areas, particularly in telecommunications. A CW laser diode modulated by an electroabsorption modulator constitutes an extremely stable, robust and simple source of high quality, high repetition rate ultrashort optical pulses. In this paper we describe the capabilities and limitations of such pulse sources, and present nonlinear pulse compression and manipulation techniques that allow one to overcome these limitations. We also present the design of a new class of comb-like dispersion-profiled fibre compressor. Such a compressor is easily fabricated from commercially available fibres and represents a simple yet powerful way of extending the range of pulse durations available. As the electroabsorption modulator is essentially a high speed switch it is also applicable to optical processing problems, and we report the application of such a device to demultiplexing.

This paper evaluates the throughput performance of a switch architecture for broadband networks that is capable of switching variable-length packets. The structure is connectionless, so that no bandwidth reservation takes place before the user packet, or datagram, is transferred. The interconnection network is assumed to be internally non-blocking and provided with input queues. A previous approximated throughput analysis of the proposed system has been carried out under the hypothesis that the length of the offered packets is uniformly distributed. In this work we perform an exact throughput analysis and we show how the actual throughput of the system can be expressed analytically with a simple closed form. Moreover, we consider a more general case of packet length distributed as a truncated exponential. In this way it is possible to account for cases in which short packets are more frequent than long packets or, conversely, long packets are more frequent than short ones. The minimum throughput of the system is obtained when packets are uniformly distributed; a better performance is obtained when short (long) packets are more frequent than long (short) ones.

This paper describes short pulse generation at over 40 GHz using monolithic mode-locked lasers integrated with electroabsorption modulators. The electroabsorption modulator using strained-InGaAsP multiquantum wells provides a pulse shortening gate at a high-repetition frequency. Pulse generation around 4 ps has been realized at a repetition frequency of 43. 5 GHz. Pulse compression using a 1. 3 µm single mode fiber is performed and a 0. 87 ps pulse is obtained.

This paper introduces and studies the performance of an NN space-division, single-stage ATM switch with dual input-queueing. Each input port has two separate FIFO queues, an "odd" and an "even" queue. An incoming cell is stored at the input at either of two FIFOs according its output port destination (output ports are also labeled as "odd" or "even"). Hence we call this scheme the Odd-Even switch. We compare the Odd-Even switch to the ordinary input-buffered switch and we find that it can achieve a remarkably higher performance, in terms of throughput, mean delay and cell loss. This is due to the fact that the Head-of-Line effect becomes less problematic under the Odd-Even switch. Our results are based on various traffic models. Finally, we compare the Odd-Even scheme to the Look-ahead (input "window") policy.