Showing papers on "Node (networking) published in 1974"

Probabilistic Load Flow

Abstract: The paper describes a method for evaluation of power flow which takes into consideration uncertainty of node data. The essence of the method is that the net loads are given as a set of values together with additional information on the frequency of its accuracy. The described mathematical model and the practtical application are discussed and an example given.

Finding the n Most Vital Nodes in a Flow Network

Abstract: The n most vital nodes in a network are those n nodes whose removal, along with all arcs incident with them, would cause the greatest decrease in maximum flow between a specified node pair. Results are established for this problem that lead to a procedure for determining the n most vital nodes.

Public Facilities Location Under Stochastic Demand

Abstract: This paper extends the current state of public facilities location problems on a road network to cover situations in which the number of users at each node may be a random variable. The basic location model is reformulated as a chance-constrained programming problem with fractile criterion. A computational procedure for solving the non-linear deterministic equivaent problem derived is presented. Finally, a hypothetical numerical example i1lustrates the pos-sibility of changes in the location decision when the stochastic nature of the problem is taken into account.

Para‐Aortic Node Irradiation in Carcinomas

Abstract: The authors have retrospectively analyzed the results of para‐aortic node irradiation in 75 cases of metastatic carcinoma treated at the Department of Radiation Therapy, Roswell Park Memorial Institute, between 1963 and 1972. This group includes 62 patients with primary squamous cell carcinoma of the uterine cervix, 6 with adenocarcinomas of the sigmoid colon, 2 with adenocarcinomas of the endometrium, 3 with carcinomas of the vulva, 1 with adenocarcinoma of the ovary, and 1 with squamous cell carcinoma of the anus. The clinicopathologic behavior of para‐aortic metastasis is studied in detail, including the relationship with the primary site, histologic grade, and degree of lymphatic invasion at the primary site. The group of cervical cancer patients seems to consist predominantly of those with advanced clinical stage, less differentiated tumors, endophytic or endocervical lesions, and those with endometrial or myometrial involvement. This study showed that the presence of metastatic carcinomas in the para‐aortic nodes does not necessarily indicate the existence of more distant metastasis. These carcinomas can be safely irradiated and cured in a significant percentage of cases. Survival appears more favorable with higher radiation dosages. Six thousand rads delivered in 8 weeks, alone or concomitantly with pelvic irradiation, can be safely applied with minimal acute normal tissue reaction, and can eradicate the para‐aortic node metastasis.

On the status of the VP node in Japanese

Abstract: This paper will be concerned with determining the existence or non-existence of a VP node in Japanese. Following Schwartz (1972): 220, "the notion VP means, in the transitive case, a constituent whose head is a predicate and whose complement is a nominal in the patient relation to it." This concern may, of course, be explored on two different levels; a level of surface structure and a level of semantic representation.1 Both of these levels will be examined, and it will be shown that a VP node is an unnecessary feature of either level. As far as I can determine, there are five possible-and I must here emphasize the word possible-arguments for establishing a constituent VP2 in any language. In section I, each of these arguments will be discussed, and it will be shown that each argument is either not a valid argument, or if it is a valid argument, that it does not hold for Japanese. In section II, the implications of this fact will be discussed.

Multiple link nodal switching network

Abstract: A multilink nodal switching network is disclosed which permits heavy traffic among a plurality of equi-interconnectible switching nodes. Circuitry for busy-testing, for marking idle links and for steering crosspoint operating potential to a selected idle link in a designated direction is shown. The multilink nodal network is a higher traffic carrying version of the single link nodal switching network of my prior patent application Ser. No. 393,595 filed Aug. 31, 1973. A link marking potential is applied at the given node to which the connection has reached, a next node in the direction of the called node is ascertained and a group of its links lying in the direction of the given node are busy tested. A crosspoint operating potential is steered to a first idle one of the tested links at the next node and, in cooperation with the marking potential, operates a crosspoint at the given node. After the crosspoint operates at the given node the link marking potential replaces the crosspoint operating potential at the next node.

Structural Reliability of Centralized Communication Networks

Abstract: An algorithm for assigning a node as center in a communication network with respect to a reliability criterion is given. For a nonplanar network a suboptimal procedure is proposed.

A decentralized computer network for supervision of multiple psychological laboratories

Abstract: The computer network described was designed to optimize the use of a number of independent minicomputers as a single integrated system for process control of several research laboratories. The implementation of the network required both the development of a special purpose interprocessor interface and the design of a software support system to direct network operations. The network was designed according to the familiar “star” configuration, with the exception that the central computer in the star does not exercise exclusive supervisory control over the system. Rather, each computer on the system “sees” the central computer as a peripheral similar in characteristics to a medium speed I/O device. This design allows each computer to serve not only as a node in the network, but also as an entirely independent process controller.

Routing of solid waste collection vehicles. appendix b: a heuristic solution to the m-postmen's problem

Abstract: This paper presents the theory and procedure of an algorithm which routes a known number of solid waste collection vehicles on a city street network. The network is assumed to be planar and connected and consists of only undirected edges (two-way streets). Each edge has a cost and load associated with it. The purpose of the procedure is to route the vehicles from a depot to a collection area (district), through the district and back to the depot. The algorithm determines districts and tours simultaneously. For each tour it lists a sequence of nodes and specifies whether the edge leading to each node is traveled or serviced. Computational experience shows that the algorithm is feasible for a network with as many as 90 nodes.

The design of a topology information maintenance scheme for a distributed computer network

Abstract: In order for the nodes of a distributed computer network to communicate, each node must have information about the network's topology. Since nodes and links sometimes crash, a scheme is needed to update this information. One of the major constraints on such a scheme is that it may not involve a central controller. In this report a straightforward scheme involving adjacency matrices and a broadcast scheme are discussed and their inadequacies described. The NETCHANGE Protocol which is based on Baran's “Hot Potato Heuristic Routing Doctrine,” is presented. This system has been implemented on the MERIT Computer Network and its correctness has been proved. We end by showing how the NETCHANGE Protocol can be modified into a shortest path algorithm.

Selected reliability studies for the NERVA program

Abstract: An investigation was made into certain methods of reliability analysis that are particularly suitable for complex mechanisms or systems in which there are many interactions. The methods developed were intended to assist in the design of such mechanisms, especially for analysis of failure sensitivity to parameter variations and for estimating reliability where extensive and meaningful life testing is not feasible. The system is modeled by a network of interconnected nodes. Each node is a state or mode of operation, or is an input or output node, and the branches are interactions. The network, with its probabilistic and time-dependent paths is also analyzed for reliability and failure modes by a Monte Carlo, computerized simulation of system performance.

A multicommodity flow problem

Abstract: This paper presents an algorithm for finding maximal sized sets of flows in a certain class of multicommodity flow networks. The class consists of networks with integer capacity edges and with each node being a source or sink for all but at most one commodity. This new procedure lifts a restriction in a previous algorithm that required flow in edges joining source and sink of the same commodity.

We consider a class of dynamic network flow problems in which the amount of flow leaving one node, say i, in one time period for another node, say j, is a certain fraction of the total amount of flow which arrived at node i during the

Abstract: This paper is concerned with a class of dynamic network flow problems in which the amount of flow leaving node i in one time period for node j is the fraction piJ of the total amount of flow which arrived at node i during the previous time period. The fraction Pij whose sum over j equals unity may be interpreted as the transition probability of a finite Markov chain in that the unit flow in state i will move to state jwith probability pij during the next period of time. The conservation equations for this class of flows are derived, and the limiting behavior of the flows in the network as related to the properties of the fractions Pij are discussed. DYNAMIC NETWORK FLOW; FINITE MARKOV CHAIN; TRANSITION PROBABILITIES; NON-NEGATIVE MATRICES; APERIODICITY; IRREDUCIBILITY