There exist two basic methods to interconnect n processors under the condition where the relation among each processor and its directly connected neighboring processors is perfectly regular: 1-dimensional and multi-dimensional topological connections. This paper treats three types of general topological connections, and investigates the optimal connections with a smaller number of data transmission steps. It is concluded that two kinds of them have a smaller number of data transmission steps and the smallest number of data transmission steps depends on the number n.

The M^(m)/M/K and M^(m)/M/ models with synchronous fluctuation of traffic intensity are considered. The phase process is assumed to make changes according to an irreducible m-phase Markov chain. In contrast to the model with asynchronous fluctuation of parameters, phase changes may occur in synchronization with an arrival or beginning of a customer's service. We study mainly the steady-state regime of our models, and observe that, in general, closed form solutions for the limiting probabilities are difficult to obtain but their numerical computation is rather straightforward. We give a necessary and sufficient condition for the steady-state to be attained. For the model M^(m)/M/K, it is shown that, for the case where the traffic intensity of one phase is greater than one (even if the average traffic intensity is less than one) the average queue length approaches infinity as the fluctuations among phases gets more sluggish. However, for the case where the traffic intensity for all phases is less than one, the queue length is moderate and not dependent as much on the rate of fluctuation among phases. Numerical examples are given and discussed. Finally, we point out that, our models may be more tractable than the asynchronous ones, when we try to generalize them to the case of general inter-arrival, service, or sojourn time distribution.

This paper presents queueing analysis methods for mixed loss and delay systems. The queueing models considered here are an extension of the previously analyzed models and are applicable to the Facsimile Intelligent Communication System (FICS). First, assuming compound Poisson arrivals and a single server, an exact result for performance measures of the model is obtained by the supplementary variable technique. Second, assuming general batch arrivals and many servers, a diffusion process approximation with the elementary return boundary is developed. A new recursive scheme for the steady-state distribution of the number of customers in the system is derived. Some numerical examples are provided and compared with exact and simulated results, which demonstrate the accuracy of the approximation.

A new method to obtain the availability of a cold standby series system with spare units is presented. Two models are considered. The first one is a series system with spare units. The other is m series systems with common spare units. The availabilities are solutions of nonlinear simultaneous equations and are obtained numerically.

Markov renewal process (MRP) is widely used in communication theory, OR, physics and so on. This paper is concerned with the mathematically rigorous construction of the stationary MRP with finite states on the whole time axis. A joint (forward and backward) invariant probability exists uniquely for an irreducible MRP. A stationary MRP on the whole time axis is defined by setting the joint invariant probability at the point of origin and by forming the MRP in the positive direction and the reverse MRP in the negative direction. An elementary proof of the stationarity of the defined process is given by showing directly that any finite-dimensional distribution is invariant under the shift of time. The proof of the existence and uniqueness of the joint invariant probability is also presented. Once the stationarity of the defined MRP is established, various stochastic processes generated thereof can easily be shown to be stationary as well.

The convolutional coding combined with continuous phase modulation (CPM) is well known for its good tradeoff between coding gain and bandwidth. On the other hand, the multi-h modulation i.e., the scheme in which plural modulation indices are in cyclically use, is also introduced to obtain the higher power efficiency. However the study of the combination of convolutional coding multi-h scheme is not reported yet. In this study, we consider the combination of convolutional coded CPM with multi-h modulation to achieve larger Euclidean distance. We found that, in some cases, our proposed convolutional coded multi-h CPM can give considerable gains compared with those of conventional single-h scheme.

This paper describes an experimental system for designing three-dimensional solid objects through three-view orthographic drawings, using automatic three-dimensional interpretation in cooperating with a set of interactive drawing-oriented design utilities. In the design process based on the system approach, an object is viewed as being consisting of several volumetric instances, each of which is further composed a number of simple subvolumes. In the system, whereas the automatic interpretation is employed to construct the instances from their orthographic projections, the design utilities are provided to allow modifications of a solid-object model being composed of the constructed instances. Once a solid-object model is created from a drawing containing the projections of an instance, modifications on the drawing can be performed for addition of new instances into the existing solid-object model, and changes and deletion of the instances existing in the model. Being aimed at a two-dimensional interface for the Constructive Solid Geometry, or CSG method, the system provides the user with design interaction procedures which let the user manipulate the projections of the instances in terms of two-dimensional graphical primitives, such as straight lines, arcs, and circles, obtain and display a solid object constructed from the projections being designed. In addition, more complex three-dimensional object shapes can be achieved using this alternative approach after the interpretation concept.