This paper presents a destributed algorithm that uses weak copy consistency to create mutual exclusion in a distributed computer system. The weak copy consistency is deduced from the uncertainty of state which occurs due to the finite and unpredictable communication delays in a distributed environment. Also the method correlates outdated state information to current state. The average number of messages to enter critical section in the algorithm is n/2 to n messages where n is the number of sites. We show that the algorithm achieves mutual exclusion and the fairness and liveness of the algorithm is proven. We study the performance of the algorithm by simulation technique.

A new error rate formula for narrowband Differential Quaternary Phase Shift Keyed system in a Rayleigh fading channel is obtained in closed-form. The formula predicts a non-zero error probability for noiseless reception. As predicted, the computed error rates approach some constant or floor values as the signal-to-noise ratio is increased beyond a certain limit. In the presence of various Doppler frequency shifts, an IF filter bandwidth of about one times the symbol rate is found to lead to a minimum error probability prior to the appearence of the error rate floor.

The subject of the paper is to analyze time complexity of the minimum modification problem in the Horn clause propositional logic. Given a set H of Horn clauses and a query Q in propositional logic, we say that Q is provable over H if and only if Q can be shown to be true by repeating Modus Ponens among clauses of H. Suppose that Q is not provable over H, and we are going to modify H and Q into H and Q , respectively, such that Q is provable over H . The problem of making such modification by minimum variable deletion (MVD), by minimum clause addition (MCA) or by their combination (MVDCA) is considered. Each problem is shown to be NP-complete, and some approximation algorithms with their experimental evaluation are given.

It is known that the uniquely decodable code pairs (C1, C2) for the two-user binary adder channel relates to the maximum independent set of a graph associated with a binary code. This paper formulates the independence number of a class of graphs associated with binary linear codes, and presents an algorithm of the maximum independent set for those graphs. Uniquely decodable code pairs (C1, C2)'s are produced, where C1 is a linear code and C2 is a maximum independent set of the graph associated with C1. For the given C1, the transmission rate of C2 is higher than that by Khachatrian, which is known as the best result as so far. This is not rather surprising because the code C2 is a maximum independent set in this paper but not be Khachatrian's.

This paper presents a simple method for avoiding both numerical errors and degeneracy in an incremental-type algorithm for constructing the Voronoi diagram with respect to points on a plane. It is assumed that the coordinates of the given points are represented with a certain fixed number of bits. All the computations in the algorithm are carried out in four times higher precision, so that degeneracy can be discerned precisely. Every time degeneracy is found, the points are perturbed symbolically according to a very simple rule and thus are reduced to a nondegenerate case. The present technique makes a computer program simple in the sense that it avoids all numerical errors and requires no exceptional branches of processing for degenerate cases.

Multiple-site diversity systems are foreseen for earth to satellite paths operating at frequencies above 10GHz in localities with high rain-induced attenuation. In some severe cases double-site protection can be proved to be inadequate and consequently triple-site diversity becomes indispensable. In the present paper, an approach for the prediction of the triple-site diversity performance based on an appropriate three-dimensional gamma distribution is proposed. The model is oriented for application to earth-space paths located in Japan and other locations with similar climatic conditions. Numerical results are compared with the only available set of experimental data taken from some parts of the United States. Some useful conclusions are deduced.

An application of wavelength conversion laser diodes (WCLDs) to a photonic cross-connect system using wavelength-division (WD) technology is presented. We propose a novel WD photonic cross-connect node architecture with multiwavelength selective filters. By using the filters, we can construct a nonblocking cross-connect switch by 2-stage connection. Next we describe the requirements to the optical devices in our switch, especially to the wavelength conversion devices in configuring a multistage connection of our switch. Finally, we have conducted the wavelength switching experiments using our wavelength conversion laser diode at a bit rate of 125Mb/s and shown its applicability to a WD photonic cross-connect system with over 3,000 channels.

This paper deals with the problem of assigning tasks to the processors of a multiprocessor system such that the sum of execution and communication costs is minimized. If the number of processors is two, this problem can be solved efficiently using the network flow approach pioneered by Stone. This problem is, however, known to be NP-complete in the general case, and thus intractable for systems with a large number of processors. In this paper, we propose a network flow approach for the task assignment problem in homogeneous hypercube networks, i.e., hypercube networks with functionally identical processors. The task assignment problem for an n-dimensional homogeneous hypercube network of N (=2n) processors and M tasks is first transformed into n two-terminal network flow problems, and then solved in time no worse than O(M3 log N) by applying the Goldberg-Tarjan's maximum flow algorithm on each two-terminal network flow problem.

Lingas developed an NC algorithm for subgraph isomorphism for connected graphs of bounded separator and bounded valence. We present an NC algorithm for computing canonical forms of graphs of bounded separator by using the similar technique.

A photonic switching system is expected to have advantages over a conventional electronic switching system in exchanging broadband signals. Extensive studies have recently done on various photonic switching systems. State-of-art technology in photonic switching systems is surveyed in this paper. Small-capacity space-division switching systems using waveguide optical matrix switches are most practical and expected to be introduced to broadband local-area network in the near future. Wavelength division switching technology is important in extending switching capacity to large value. Application of photonic switching technology for ATM switching systems is also recently extensively studied to achieve switching throughput larger than that of electronic ATM switches.

For the efficient circuit simulation by the direct method, network tearing and latency techniques have been studied. This letter describes a circuit simulator SPLIT with hierarchical decomposition and latency. The block size of the latent subcircuit can be determined dynamically in SPLIT. We apply SPLIT to the MOS circuit simulation and verify its availability.

The subject of the paper is to propose a simple O(|V|+|E|) algorithm for finding all 3-edge-components of a given undirected multigraph G=(V, E). An 3-edge-connected component of G is defined as a maximal set of vertices such that G has at least three edge-disjoint paths between every pair of vertices in the set. The algorithm is based on the depth-first search (DFS) technique. For any fixed DFS-tree T of G, cutpairs of G are partitioned into two types: a type 1 pair consists of an edge of T and a back edge; a type 2 pair consists of two edges of T. All type 1 pairs can easily be determined in O(|V|+|E|) time. The point is that an edge set KE(T) in which any type 2 pair is included can be found in O(|V|+|E|) time. All 3-edge-components of G appear as connected components if we delete from G all edges contained in type 1 pairs or in the edge set KE(T).

It has been recognized that there exist some disparities between properties of continuous control systems and those of discrete ones which are obtained from their continuous counterparts by use of a sampler and zero order hold. This still remains true even if the sampling rate becomes fast enough and sometimes causes unfavorable effects in control systems design. To reconcile with this conflict, use of delta operator has been proposed in place of z-operator recently. This note formulates a delta domain Lyapunov matrix equation and shows that the equation actually mediates the discrete Lyapunov equation and its continuous counterpart.

Networks in this paper consist of non-commensurate transmission lines with branches and branching resistors at junctions. When signals on a transmission line are divided multiple ways at the junctions of branched lines, multiple reflection waves occur by the impedance mismatching. For the analysis of multiple reflections and network design, lattice diagrams have been used so far. However, the expansions of network transfer functions provide an easier way for the same purpose as in the case of lattice diagram. The output transient responses can be directly calculated from the expansions of network transfer functions or can be numerically calculated by software such as the fast Laplace transform. Therefore, once the network transfer functions are given, calculation of transient responses can be carried out quite easily. In this paper, the expansions of network transfer functions have been derived with respect to delay elements ξi=exp(-sτi) by formularizing the propagation of multiple reflection waves, and then the multi-variable rational network transfer functions have been obtained from the expansions. As an example, a 3-port transmission line network with normalized characteristic impedances 1, 1, 6 and normalized branching resistors 1/23, 1/23, 126/23 has been taken up. As the terminal resistances at output ports can be determined from the relation of the first arriving wave to the steady state, the design of 3-port transmission line networks which will furnish output waveforms similar to the waveform of the input within given tolerances has been considered. The output waveforms have been calculated for pure terminal resistances and for the pure terminal resistances plus parasitic parallel capacitances.

Anechoic chambers have been effectively used for microwave propagation, electromagnetic interference (EMI) and immunity testing. The electromagnetic compatibility (EMC) problem has recently become serious and many of these chambers have been constructed. The results of a questionnaire survey sent to anechoic chamber manufacturers are described that a total of 450 anechoic chambers have been constructed in Japan since 1964. Twenty years ago the purpose of the chambers was microwave propagation research, but more than 50 each year have recently being built for EMC/EMI and immunity testing. Their size has gradually been reduced by the use of absorbing materials such as ferrite with dielectric materials. The lowest frequency of most chambers is 30MHz for the 3 m method of site attenuation.

The subject of the paper is to analyze time complexity of the minimum axiom set problem (MASHC) in the Horn clause propositional logic. MASHC is defined by "Given a set H of Horn clauses and a query Q, all in propositional logic, such that Q is provable over H, find an axiom set of minimum cardinality, HH, with respect to Q, where Q is provable over H if and only if Q can be shown to be true by repeating Modus Ponens starting from clauses of H under the assumption that all of them are originally assumed to be true". If Q is provable over H then H is called an axiom set (with respect to Q). As stated in the definition of MASHC, detecting if Q is provable over H is required. This leads us to a problem, called the provability detecting problem (PDPHC), defined by "Given a set H of Horn clauses and a query Q in propositional logic, determine if Q is provable over H". First an O(σ) algorithm BFSHC for PDPHC is given based on the breadth-first search, where σ is the formula size of a given set of Horn clauses. For MASHC, it is shown that the problem is NP-complete, and an O(σ) approximation algorithm FMAS is given. Its experimental evaluation is also presented.

New methods are needed for accessing very large information services. This paper proposes the use of a user model neural network to allow better access to a news service. The network is constructed on the basis of articles read, and articles marked as rejected. It adapts over time to better represent the user's interests and rank the articles supplied by the news service. Using an augmented keyword search we can also search for articles using keywords in conjunction with the user model neural network. Trials of the system in a USENET news environment show promising results for the use of this approach in information retrieval.

This paper presents a survey on bicriteria network optimization problems. When there are two conflicting criteria that evaluate the solution, the bicriteria optimization is to find a solution for which these criteria are both acceptably satisfied. Standard approaches to these problems are to combine these two criteria into an aggregated single criterion. Among such problems, this paper first deals with the case in which the aggregated objective function, denoted h(f1(x), f2(x)), is convex in original two objectives f1(x) and f2(x), and, as its special case, it reviews a strongly polynomial algorithm for the bicriteria minimum-cost circulation problem. It then discusses the case in which h is concave and demonstrates that a parametric approach is effective for this case. Several interesting applications in network optimization that belong to this class are also introduced. Finally we deal with the minimum range problems which seek to find a solution such that weights of the components used in the solution are most uniform. We shall present efficient algorithms for solving these problems arised in network optimization.

A new model for a computer simulation of RF capacitive type hyperthermia has been developed by taking account of the following points. Blood flow is usually determined by many physiological parameters, but is regarded as a function of only blood temperature under some conditions. The temperature dependence of blood flow of tumors and normal tissues is assumed by referring the data obtained by Song et al. and Tanaka. The blood temperature which is elevated by externally applied power significantly affects temperatures of the body and the tumors. The transport of heat from the body surface is studied by considering air convection. These points are examined by experiments on a computer with simple phantom models and real patients. The results of simulation on the patient have shown a good agreement with clinical inspection based on CT images and a temperature of the stomach.

ATM cross-connect systems, which will be used for provisioning virtual paths (i.e. logical direct connections between exchanges) in future broadband transport networks, simplify network configuration and yield increased routing and capacity allocating flexibility. This paper describes the design of a large capacity ATM cross-connect system that has a multi-stage network structure which requires only one type of switch module. The capacity of the proposed system can be easily increased without service interruptions. To realize cell sequence integrity, a time stamp is added to the self-routing tag. Required time stamp length and efficient module size are discussed.