TL;DR: The Advanced Research Projects Agency (ARPA) Computer Network (hereafter referred to as the "ARPA network") is one of the most ambitious computer networks attempted to date, but no one node is in control of the network.
Abstract: The Advanced Research Projects Agency (ARPA) Computer Network (hereafter referred to as the "ARPA network") is one of the most ambitious computer networks attempted to date. The types of machines and operating systems involved in the network vary widely. For example, the computers at the first four sites are an XDS 940 (Stanford Research Institute), an IBM 360/75 (University of California, Santa Barbara), an XDS SIGMA-7 (University of California, Los Angeles), and a DEC PDP-10 (University of Utah). The only commonality among the network membership is the use of highly interactive time-sharing systems; but, of course, these are all different in external appearance and implementation. Furthermore, no one node is in control of the network. This has insured generality and reliability but complicates the software.
TL;DR: In this article, a method of discretizing irregular and inhomogeneous two-dimensional continua into triangular elements using a magnetic pen to record node point data and a computer program to generate element data is presented.
Abstract: This paper presents a labour-saving method of discretizing irregular and inhomogeneous two-dimensional continua into triangular elements. The method uses a magnetic pen to record node point data and a computer program to generate element data. This technique eliminates the tedium in the manual generation of data and the delay due to mistakes which would otherwise arise frequently for a complex mesh.
TL;DR: This paper considers a distribution model with upper and lower bounds on the number of units shipped from an origin or to a destination, and generalization of the classical distribution problem makes the model more versatile from a theoretical standpoint and more usable from an applications viewpoint.
Abstract: This paper considers a distribution model with upper and lower bounds on the number of units shipped from an origin or to a destination. Our problem differs from the classical distribution model in which the node shipping amounts are, by contrast, specified exactly. This generalization of the classical distribution problem not only makes the model more versatile from a theoretical standpoint but also makes the model more usable from an applications viewpoint.
TL;DR: In this paper, a necessary and sufficient criterion for the realization of the modified cut-set matrix of a resistive n-port network having a prescribed configuration is given, and a new approach to the synthesis of short-circuit conductance matrix of resistive N-port networks with more than (n + 1) nodes is outlined.
Abstract: The concepts of network of departure and padding n-port network are defined and certain important properties of these networks are stated. A necessary and sufficient criterion for the realization of the modified cut-set matrix of a resistive n-port network having a prescribed configuration is given. A new approach to the synthesis of short-circuit conductance matrix of a resistive n-port network with more than (n + 1) nodes is outlined. Necessary and sufficient conditions for the realization of the potential factor matrix of an (n + 2) node resistive n-port network are also obtained. These conditions lead to a simple t&t for the realizability of the modified cut-set matrix of an (n + 2) node n-port network. Examples are worked out to illustrate the application of these results.
TL;DR: A novel technique using heuristic approach that can design suitable location to install the reference nodes and improve the location determination performance for a single-floor area and the multi-floor building and can improve the error distances up to 20% which is better than those of the other techniques.
Abstract: Accuracy of location determination is one of the keys to success for any indoor positioning system. This performance metric is influenced by how reference nodes (RNs) are installed. However, most of existing research studies ignored the problem of optimal reference node placement and efficient system design for indoor positioning systems. In this paper, we propose a novel technique using heuristic approach that can design suitable location to install the reference nodes and improve the location determination performance for a single-floor area and the multi-floor building. A mathematical formulation of reference node placement is developed as a Binary Integer Linear Programming (BILP) problem. The proposed formulation aims to minimize the number of reference nodes and derive their suitable locations for the indoor positioning systems. We developed an efficient solution technique based on Simulated Annealing algorithm (SA), called Maximizing Summation of the Maximum RSS for Multi-floor building (MSMR-M). The results from performance study show that by using the proposed RN placement technique, the indoor positioning systems can gain up to five meters of accuracy at 90% precision for single-floor building. Moreover, in the case of the multi-floor building, the proposed technique can improve the error distances up to 20% which is better than those of the other techniques. The proposed technique can provide an average error distance within 1.42 meters where the grid spacing of fingerprint is 2m2m.
TL;DR: A new analytical technique is presented for evaluating the steady-state performance of large repairable systems which cannot be described in terms of series-parallel subsystems, based on a novel combinatorial algorithm.
Abstract: A new analytical technique is presented for evaluating the steady-state performance of large repairable systems which cannot be described in terms of series-parallel subsystems. The method, which is based on a novel combinatorial algorithm, is used to calculate the frequency of failures and expected failure durations at each node in networks of repairable devices. The networks may have multiple input and output nodes, but the uptimes and downtimes of the devices in the network are assumed to be exponentially distributed and independent. To demonstrate the usefulness of the technique for large-scale networks of general configuration, the solution of a sample problem using a pilot computer program is also included.
TL;DR: The evaluation results of a distributed sorting algorithm which was presented by the authorsflO is presented, designed to sort a very large file which is physically distributed over many sites (work-stations).
Abstract: This paper presents the evaluation results of a distributed sorting algorithm which was presented by the authorsflO]. The evaluation is done by simulation. The algorithm makes use of the statistical properties of the data file. The objective of the algorithm is to minimize the number of messages required for the whole sorting process. The algorithm is designed to sort a very large file which is physically distributed over many sites (work-stations). The file size is so large that it is not feasible to transfer all data to a single node as no node has sufficient memory space for internal sorting. The sorting work will be shared by all sites involved and data will be sent along the lines communicating in bulk.
TL;DR: In this article, the authors propose a simulation approach to container terminal management to support performance analysis for different scenarios, such as level of demand and alternative configurations, and the main activities of a conventional container terminal are characterized.
Abstract: In this paper the authors propose a simulation approach to container terminal management to support performance analysis for different scenarios, such as level of demand and alternative configurations. The main activities of a conventional container terminal are characterized. The developed model is calibrated on actual data of different terminals of North-West Italian coast and simulations results allow the analysis of efficacy and efficiency of services provided by terminal operators.
TL;DR: The automatic detection model of single-phase earth fault of new distribution network is proposed, and the experimental results show that the proposed model has high detection accuracy.
Abstract: The current distribution network single-phase ground fault detection model knowledge expression is poor, its production process only based on the normal distribution network sample data, no single-phase ground fault data, did not make full use of a prior knowledge, resulting in low detection accuracy. The automatic detection model of single-phase earth fault of new distribution network is proposed. The fault characteristic vector is taken as the input vector, and the degree of matching between the input vector and the weight vector element is introduced as the second layer. The fault vector is used as the input vector, and the fault vector is used as the input vector. Node input, the second layer of the output as the third layer of the input, the model training, the output of the results of the distribution network is a single-phase ground fault detection results. The experimental results show that the proposed model has high detection accuracy.Â