We propose an optimal throughput problem using graph transformations to maximize throughput of a pipelined data path with some loops. The upper bound of the throughput, equals to the lower bound of the iteration interval between the start of two successive iterations, is limited by the length of a critical loop. Therefore we can maximize the throughput by minimizing the length of the critical loop. The proposed method first schedules an initial Data Flow Graph (DFG) under the initial iteration interval as few as it can use resources, then it transforms the DFG into the flow graph with the minimal length of the critical loop by rescheduling the given initial scheduling result. If there are any control steps which violate the resource constraints owing to the transformations, then these operations are adjusted so as to satisfy given resource consrtraints. Finally by rescheduling the transformed DFG, it gives a schedule with maximum throughput. Experiments show the efficiency of our proposed approach.

An optimal control theory has been applied to a biological compartment system to show a method to analyze the control principle of biological system represented by compartments. Present theory has been proposed to afford a theoretical back ground and validity for the strategy of drug administration or control of the anesthetic agent in practical medicine. The instantaneous change of the concentration of a given material within a biological system has been expressed by differential equations. Each compartment has been set to be transferred a material from all other compartments and conversely each compartment sends it to all other compartments. The control input was restricted to be one kind. The performance function involved the deviation from the target value, the rate of change in concentration and the amount of the control variables. The biological system was defined to operate optimally only when the performance function has been minimized during a given time period. By the optimal control theory of Pontoriagin, above biological problem has been converted to a mathematical problem and was solved numerically by multiple shooting method. The calculated trajectory of the optimal control has been asymmetric parabolic one with the maximum at its initiation and the minimum at the middle of total reaction time. This pattern has been consistent with that of probable transient change of the concentration of anesthetic agent when it has been inhalated under the most up to date "Rapid Inhalation Induction" method. The optimal trasient change of the concentration at each compartment has beeb affected by the difference in time dependent nature and the magnitude of the transfer rate. Present theory afforded a method to analyze the control strategy of biological system expressed by compartments model and showed an availability for actual clinical medicine. The optimal control principle must be a most adequate one to describe the Homeostasis in biological system.

This paper proposes a new class of unidirectional byte error locating codes, called single symmetric bit error correcting and single unidirectional byte error locating codes, or SEC–SUbEL codes. Here, "byte" denotes a cluster of b bits, where b2. First, the necessary and sufficient conditions of the codes are clarified, and then code construction method is demonstrated. The lower bound on check bit length of the SEC–SUbEL codes is derived. Based on this, the proposed codes are shown to be very efficient in some range of the information length. The code design concept presented for the SEC–SUbEL codes induces the generalized unidirectional byte error locating codes with single symmetric bit error correction capability.

This paper presents a cost-effective network for very large ATM cross-connects. In order to develop it, we propose the delta network with expanded middle stages. This proposed network is the intermediate network between a nonblocking network and the delta network with respect to the cost of hardware and internal blocking probability. Using this network, we explore the tradeoff between the cost and internal blocking probability, and derive the optimum configuration under temporarily deviating traffic. Internal blocking occurs when input traffic temporarily deviates from its average value. However, we cannot evaluate the internal blocking probability by using conventional traffic models. In this paper, we adopt temporarily deviating traffic such that all traffic is described as the superposition of the paths which are defined by traffic parameters. As can easily be seen, the path corresponds to virtual path (VP) or virtual channel (VC). Therefore, we believe that our model describes actual traffic more exactly than conventional models do. We show that the optimum configuration is the proposed network whose expansion ratio γ=3 when the maximum number of paths that can be accommodated in one link is greater than 22. This network achieves the internal blocking probability of 10-10. As an example of this network, we show that the proposed network of size 7272 is constructed with only 40% of the hardware required by the nonblocking network.

It is shown that a self–recurrent fuzzy inference can cause chaotic responses at least three membership functions, if the inference rules are set to represent nonlinear relations such as pie–kneading transformation. This system has single input and single output both with crisp values, in which membership functions is taken to be triangular. Extensions to infinite memberships are proposed, so as to reproduce the continuum case of one–dimensional logistic map f(x)=Ax(1–x). And bifurcation diagrams are calculated for number N of memberships of 3, 5, 9 and 17. It is found from bifurcation diagrams that different periodic states coexist at the same bifurcation parameter for N9. This indicates multistability necessarily accompanied with hysteresis effects. Therefore, it is concluded that the final states are not uniquely determined by fuzzy inferences with sufficiently large number of memberships.

In this paper, we propose the architecture of BALANCE (Better Adaptive Load-balancing through Acquiring kNowledge of Characteristic of an Environment) in which users can submit their jobs without acquiring either a status of an environment or characteristics of jobs and servers even in a widely connected heterogeneous network. The architecture of BALANCE includes three types of information bases and two types of daemons. Information bases, namely job, resource, and environment information base, manage the knowledge of job characteristics, available resources for CPUs, and status of the environment, respectively, as a proxy for users. The dispatching daemon selects an adequate server for each job using knowledge stored in the information bases. A service daemon executes each job. On completing each job, a service daemon gets a statistic of the job and returns it to the dispatching daemon where the job came from so that the statistic will be available at the next dispatching time. BALANCE enables an environment (1) to balance the load, (2) to share software functions as well as hardware facilities, and (3) to learn a user's job characteristics. We have implemented a prototype with more than 50 heterogeneous UNIX workstations connected by different networks. Two simple experiments on this prototype are presented. These experiments show a load balancing scheme that takes the characteristics of each job into account.

We are developing GENESIS, a new seamless total environment for designing, developing, installing, and operating various types of telecommunication networks as extremely large distributed processing applications in the future network integrated by ATM. Similar uniform architectures for quick introduction and easy management of service or operation applications have been proposed, such as by TINA, but there has been insufficient study on how to operate and con figure those applications. This paper discusses the implementation model and execution environment in GENESIS from the viewpoint of flexible operation according to network conditions. The implementation model can describe detailed configurations under various conditions on design or operation, independently of the execution environment. To achieve the goals of GENESIS, our execution environment provides message handling functions and a transparent interface for controlling network resources independently of the configuration, and dynamic reconfiguration functions that are independent of the execution. This paper also reports the prototype system GENESIS-1. The GENESIS-1 message handling mechanism and the effect of the reconfiguration functions are described.

In this paper we study the bifurcation phenomena of quasi–periodic states of a model of the human circadian rhythm, which is described by a system of coupled van der Pol equations with a periodic external forcing term. In the system a periodic or quasi–periodic solution corresponds to a synchronized or desynchronized state of the circadian rhythm, respectively. By using a stroboscopic mapping, called a Poincar mapping, the periodic or quasi–periodic solution is reduced to a fixed point or an invariant closed curve (ab. ICC). Hence we can discuss the bifurcations for the periodic and quasi–periodic solutions by considering that of the fixed point and ICC of the mapping. At first, the geometrical behavior of the 3 generic bifurcations, i.e., tangent, Hopf and period doublig bifurcations, of the periodic solutions is given, Then, we use a qualitative approach to bring out the similar behavior for the bifurcations of the periodic and quasi–periodic solutions in the phase space and in the Poincarsection respectively. At last, we show bifurcation diagrams concerning both periodic and quasi–periodic solutions, in different parameter planes. For the ICC, we concentrate our attention on the period doubling cascade route to chaos, the folding of the parameter plane, the windows in the chaos and the occurrence of the type I intermittency.

This paper proposes new real–time heuristic distributed parallel algorithms for search, which are based on the concepts of propagations and competitions of concurrent waves. These algorithms are characterized by simplicity and clearness of control strategies for search, and distinguished abilities in many aspects, such as real–time performance, wide suitability for searching AND/OR implicit graphs, and ease in hardware implementation.

Multimedia services based on broadband ISDN (B-ISDN) technology need a network architecture that satisfies the requirements of users, carriers, and vendors. This paper describes a new network architecture for B-ISDN service control and management based on INA. We list general requirements, and present implementation issues of INA. A network architecture and main components, which resolve implementation issues, is then proposed. We also describe a video-on-demand service based on our proposed architecture.

For medical imaging, non-rigid motion analysis of the heart deformability is a nontrivial problem. This paper introduces a new method to analyze the gated SPECT (Single Photon Emission Computed Tomography) imges for 3-D motion information of left ventricular. Our motion estimation method is based on a new concept called normal direction constraint" in that the normal of a surface patch of some deforming objects at certain time instant is constant. This paper consists of the following processes: contour extraction, slices interpolation, normal vector field generation, expanding process, motion estimation for producing a 2-D motion vector field, and deprojection for a 3-D motion vector field. In the experiments, we will demonstrate the accuracy of our method in analyzing the 3-D motion field of deforming object.

Bifurcations of quasi–periodic responses in an oscillator described by conductively coupled van der Pol equations with a sinusoidal forcing term are investigated. According to the variation of three base frequencies, i.e., two natural frequencies of oscillators and the forcing frequency, various nonlinear phenomena such as harmonic or subharmonic synchronization, almost synchronization and complete desynchronization are ovserved. The most characteristic phenomenon observed in the four–dimensional nonautonomous system is the occurrence of a double Hopf bifurcation of periodic solutions. A quasi–periodic solution with three base spectra, which is generated by the double Hopf bifurcation, is studied through an investigation of properties of limit cycles observed in an averaged system for the original nonautonomous equations. The oscillatory circuit is particularly motivated by analysis of human circadian rhythms. The transition from an external desynchronization to a complete desynchronization in human rest–activity can be referred to a mechanism of the bifurcation of quasi–periodic solutions with two and three base spectra.

We prove that the maximum likelihood estimator for estimating 3-D motion from noisy optical flow is not optimal", i.e., there is an unbiased estimator whose covariance matrix is smaller than that of the maximum likelihood estimator when a Gaussian noise distribution is assumed for a sufficiently large number of observed points. Since Gaussian assumption for the noise is given, the maximum likelihood estimator minimizes the mean square error of the observed optical flow. Though the maximum likehood estimator's covariance matrix usually reaches the Cramér-Rao lower bound in many statistical problems when the number of observed points is infinitely large, we show that the maximum likelihood estimator's covariance matrix does not reach the Cramér-Rao lower bound for the estimation of 3-D motion from noisy optical flow under such conditions. We formulate a superior estimator, whose covariance matrix is smaller than that of the maximum likelihood estimator, when the variance of the Gaussian noise is not very small.

The access control method adopted by UNIX is simple, understandable, and useful. However, it is quite possible that unexpected information flows occur when we are cooperating with some group members on UNIX. Introducing notions such as "flow right," "maximal permission" and "minimal umask value", this note proposes a simple method, can be seen as a natural extension of UNIX, to control indirect information flows without losing availability and understandability of UNIX.

A stepwise refinement method of communications service specifications is proposed to generate communications software that can conform to any network architecture. This method uses a two-layered language; one layer is a service specification description language (STR), and the other layer is a supplementary specification description language for implementing STR description on a communications system (STR/D). STR specifies terminal behaviors that can be recognized from a perspective outside of the communications systems. With STR, a communications service is defined by a set of rules that can be described without detailed knowledge of communications systems or communications network architectures. Each STR rule describes a global state transition of terminals. Supplementary specifications, such as terminal control and network control, are needed to implement communications services specified by STR rules. These supplementary specifications are described by STR/D rules. Communications services, such as UPT (Universal Personal Telecommunication), are standardized so that they can be provided on a given functional model consisting of functional entities. Specifications for each functional entity in a network are obtained from the two kinds of initially described specifications mentioned above. The obtained specifications are described by STR(L) and STR/D(L) rules, which specify local specifications of a functional entity. These specifications for functional entities are then transformed into software specifications, and finally communications software is generated from these software specifications. This stepwise refinement method makes it possible to generate communications software that can conform to any functional model from service specifications.

The concept of flexible system is long being used by many researchers, aiming to solve some particular problem of adaptation. The problem is viewed differently in different situations. In this paper, we first give a set of definitions and specifications to generalize this concept applicable to any system and in particular to communication networks. Through these definitions we will formalize, what are the conditions a system should satisfy to be called as a Flexible Communication System. The rest of the paper we formalize the concepts of flexible information network, and propose an agent oriented architecture that can realize it.

In this paper, the dispersion characteristics of magnetostatic surface waves (MSSW) in a nonlinear gyromagnetic medium are analytically investigated. Assuming the nonlinearity as the first order perturbation in permeability tensor of the gyromagnetic medium, the perturbation technique based on the multiple scale method is used to deduce the nonlinear dispersion relations for the MSSW. It is observed that for a given propagation constant of the MSSW the frequency decreases with microwave power. It is also observed that group velocity decreases, and as a consequence, delay time increases with power of the microwave. By evaluating the dependence of frequency on power and variation of group velocity on propagation constant within the accuracy of the perturbation theory, it is confirmed that the conditions for formation of bright soliton are not satisfied for the MSSW.

Customers' requirements for telecommunications services have been changing from simple point-to-point and single-medium communications to multiple-point and multiple-media, as well as changes in bandwidth requirements. In addition, customers' end stations (ES) will not be homogeneous, from POTS-like terminal to sophisticated multimedia workstation that handles various kind of media. This paper discusses communications management architectures that provide multimedia multipoint communications in a heterogeneous ESs environment. It summarizes existing communications management architectures, and discusses advanced architectures that provide multimedia communications, multipoint communications and heterogeneity handling capabilities in a flexible and efficient manner. The objectives of this architecture are to integrate multimedia multipoint communications capabilities into the network, and provide customers with versatile communications service request interface which can handle from plain single-medium point-to-point communications to multimedia multipoint communications. This paper especially focuses on the management functionalities for multimedia multipoint service fabrics (MMSF) which may be owned by the network provider, the third-party service provider, or the customer. It discusses variations of MMSF management protocol implementations in the case that the MMSF is owned by either of the three. It also discusses implementation of customers' various operations requests to the MMSF in the communication phase.

The warp model of the extended Hough transform (EHT) has been proposed to design the explicit expression of the transform function of EHT. The warp model is a skewed parameter space (R(µ,ξ), φ(µ,ξ)) of the space (µ,ξ), which is homeomorphic to the original (ρ,θ) parameter space. We note that the introduction of the skewness of the parameter space defines the angular and positional sensitivity characteristics required in the detection of lines from the pattern space. With the intent of contributing some solutions to basic computer vision problems, we present theoretically a dynamic and centralfine/peripheral-coarse camera vision architecture by means of this warp model of Hough transform. We call this camera vision architecture askant vision' from an analogy to the human askant glance. In this paper, an outline of the EHT is briefly shown by giving three functional conditions to ensure the homeomorphic relation between (µ,ξ) and (ρ,θ) parameter spaces. After an interpretation of the warp model is presented, a procedure to provide the transform function and a central-coarse/peripheralfine Hough transform function are introduced. Then in order to realize a dynamic control mechanism, it is proposed that shifting of the origin of the pattern space leads to sinusoidal modification of the Hough parameter space.

A particle trajectory estimation method from far electromagnetic fields are discussed in this paper. Authors have already presented a trajectory estimation method for single particle system and good agreements between a source particle trajectory and an estimated one have been obtained. For this, this paper discusses twin particles system as an examples of multi-particles systems for simplicity. First of all, it is pointed out that far electromagnetic fields from the twin particles system show quite different aspect from the single particle system using an example, radiation patterns produced by two particles which carry out circular motion. This result tells us that any trajectory estimations for general multi-particles system are almost impossible. However, it is shown that when the distance between the particles is small, the estimation method for the single particle system can be applied to the twin particles system, and that twin particles effects appear as disturbance of estimated trajectory.