Downloads & Free Reading Options - Results

HPCC Information On Line 97 (NASA High Performance Computing and Communications)

From the bitsavers.org collection, a scanned-in computer-related document. rand :: joss :: P-3131 JOSS Examples Of The Use Of An Experimental On-Line Computing Service Apr65

The increased size of modern power systems demand faster and accurate means for the security assessment, so that the decisions for reliable and secure operation planning could be drawn in a systematic manner. Large computational overhead is the major impediment in preventing the power system security assessment (PSSA) from on-line use. To mitigate this problem, this paper proposes, a cluster computing based architecture for power system static security assessment, utilizing the tools in the open source domain. A variant of the master/slave pattern is used for deploying the cluster of workstations (COW), which act as the computational engine for the on-line PSSA. The security assessment is performed utilizing the developed composite security index that can accurately differentiate the secure and non-secure cases and has been defined as a function of bus voltage and line flow limit violations. Due to the inherent parallel structure of security assessment algorithm and to exploit the potential of distributed computing, domain decomposition is employed for parallelizing the sequential algorithm. Extensive experimentations were carried out on IEEE 57 bus and IEEE 145-bus 50 machine standard test systems for demonstrating the validity of the proposed architecture.

In this paper we consider several instances of the k-center on a line problem where the goal is, given a set of points S in the plane and a parameter k >= 1, to find k disks with centers on a line l such that their union covers S and the maximum radius of the disks is minimized. This problem is a constraint version of the well-known k-center problem in which the centers are constrained to lie in a particular region such as a segment, a line, and a polygon. We first consider the simplest version of the problem where the line l is given in advance; we can solve this problem in O(n log^2 n) time. We then investigate the cases where only the orientation of the line l is fixed and where the line l can be arbitrary. We can solve these problems in O(n^2 log^2 n) time and in O(n^4 log^2 n) expected time, respectively. For the last two problems, we present (1 + e)-approximation algorithms, which run in O((1/e) n log^2 n) time and O((1/e^2) n log^2 n) time, respectively.

In this paper we consider several instances of the k-center on a line problem where the goal is, given a set of points S in the plane and a parameter k >= 1, to find k disks with centers on a line l such that their union covers S and the maximum radius of the disks is minimized. This problem is a constraint version of the well-known k-center problem in which the centers are constrained to lie in a particular region such as a segment, a line, and a polygon. We first consider the simplest version of the problem where the line l is given in advance; we can solve this problem in O(n log^2 n) time. We then investigate the cases where only the orientation of the line l is fixed and where the line l can be arbitrary. We can solve these problems in O(n^2 log^2 n) time and in O(n^4 log^2 n) expected time, respectively. For the last two problems, we present (1 + e)-approximation algorithms, which run in O((1/e) n log^2 n) time and O((1/e^2) n log^2 n) time, respectively.

On the Effect of Local Attraction upon the Plumb-Line at Stations on the English Arc of the Meridian, between Dunnose and Burleigh Moor; and a Method of Computing Its Amount. Pratt, V Proceedings of the Royal Society of London (1854-1905). 1854-01-01. 7:440–443

On the Effect of Local Attraction upon the Plumb-Line at Stations on the English Arc of the Meridian, between Dunnose and Burleigh Moor; and a Method of Computing Its Amount. Pratt, V Proceedings of the Royal Society of London (1854-1905). 1854-01-01. 7:440–443

On the Effect of Local Attraction upon the Plumb-Line at Stations on the English Arc of the Meridian, between Dunnose and Burleigh Moor; and a Method of Computing Its Amount. Pratt, V Proceedings of the Royal Society of London (1854-1905). 1854-01-01. 7:440–443

The 'transmission-line' model is an approximation that is frequently used to relate the electric and magnetic fields radiated during lightning discharges to the currents that produce those fields. A principal prediction of this model is that the distant (radiation) fields are directly proportional to the current propagating along the lightning channel, multiplied by the velocity of propagation. This paper examines the derivation of this relationship and its implications in some detail. We show that the formulas commonly used to describe the transmission-line model cannot be correctly applied to many lightning processes. A correction factor is required that is significant when the channel is not oriented perpendicular to the line of sight to the observer, unless the propagation velocity is only a small fraction of the speed of light. An important implication of this more general version of the model is that the current and velocity decouple so that they could be separately determined by suitable, multistation measurements.

The 'transmission-line' model is an approximation that is frequently used to relate the electric and magnetic fields radiated during lightning discharges to the currents that produce those fields. A principal prediction of this model is that the distant (radiation) fields are directly proportional to the current propagating along the lightning channel, multiplied by the velocity of propagation. This paper examines the derivation of this relationship and its implications in some detail. We show that the formulas commonly used to describe the transmission-line model cannot be correctly applied to many lightning processes. A correction factor is required that is significant when the channel is not oriented perpendicular to the line of sight to the observer, unless the propagation velocity is only a small fraction of the speed of light. An important implication of this more general version of the model is that the current and velocity decouple so that they could be separately determined by suitable, multistation measurements.

This paper is in the public domain in USA. Metadata comes from the CrossRef API, see full record in the source URL below.

"On the Effect of Local Attraction upon the Plumb-Line at Stations on the English Arc of the Meridian, between Dunnose and Burleigh Moor; and a Method of Computing Its Amount" is an article from Proceedings of the Royal Society of London, Volume 7 . View more articles from Proceedings of the Royal Society of London . View this article on JSTOR . View this article's JSTOR metadata . You may also retrieve all of this items metadata in JSON at the following URL: https://archive.org/metadata/jstor-111822

"On the Effect of Local Attraction upon the Plumb-Line at Stations on the English Arc of the Meridian, between Dunnose and Burleigh Moor; and a Method of Computing Its Amount" is an article from Proceedings of the Royal Society of London, Volume 7 . View more articles from Proceedings of the Royal Society of London . View this article on JSTOR . View this article's JSTOR metadata . You may also retrieve all of this items metadata in JSON at the following URL: https://archive.org/metadata/jstor-111822

297 p. : 24 cm

This thesis investigates the combination of Peer-to-Peer (P2P) and Cloud Computing to support Massively Multiplayer On- line Games (MMOGs). MMOGs are large-scale distributed applications where a large number of users concurrently share a real-time virtual environment. Commercial MMOG infrastructures are sized to support peak loads, incurring in high economical cost. Cloud Computing represents an attractive solution, as it lifts MMOG operators from the burden of buying and maintaining hardware, while offering the illusion of infinite machines. However, it requires balancing the tradeoff between resource provisioning and operational costs. P2P- based solutions present several advantages, including the inherent scalability, self-repairing, and natural load distribution capabilities. They require additional mechanisms to suit the requirements of a MMOG, such as backup solutions to cope with peer unreliability and heterogeneity. We propose mechanisms that integrate P2P and Cloud Computing combining their advantages. Our techniques allow operators to select the ideal tradeoff between performance and economical costs. Using realistic workloads, we show that hybrid infrastructures can reduce the economical effort of the operator, while offering a level of service comparable with centralized architectures.

Flyer for a book: On-Line Computing Systems from American Data Processing Systems

Flyer for a book: On-Line Computing Systems from American Data Processing Systems

"On the Effect of Local Attraction upon the Plumb-Line at Stations on the English Arc of the Meridian, between Dunnose and Burleigh Moor; And a Method of Computing Its Amount" is an article from Philosophical Transactions of the Royal Society of London, Volume 146 . View more articles from Philosophical Transactions of the Royal Society of London . View this article on JSTOR . View this article's JSTOR metadata . You may also retrieve all of this items metadata in JSON at the following URL: https://archive.org/metadata/jstor-108579

This article is from PLoS ONE , volume 9 . Abstract Sentence comprehension involves timely computing different types of relations between its verbs and noun arguments, such as morphosyntactic, semantic, and thematic relations. Here, we used EEG technique to investigate the potential differences in thematic role computing and lexical-semantic relatedness processing during on-line sentence comprehension, and the interaction between these two types of processes. Mandarin Chinese sentences were used as materials. The basic structure of those sentences is “Noun+Verb+‘le’+a two-character word”, with the Noun being the initial argument. The verb disambiguates the initial argument as an agent or a patient. Meanwhile, the initial argument and the verb are highly or lowly semantically related. The ERPs at the verbs revealed that: relative to the agent condition, the patient condition evoked a larger N400 only when the argument and verb were lowly semantically related; however, relative to the high-relatedness condition, the low-relatedness condition elicited a larger N400 regardless of the thematic relation; although both thematic role variation and semantic relatedness variation elicited N400 effects, the N400 effect elicited by the former was broadly distributed and reached maximum over the frontal electrodes, and the N400 effect elicited by the latter had a posterior distribution. In addition, the brain oscillations results showed that, although thematic role variation (patient vs. agent) induced power decreases around the beta frequency band (15–30 Hz), semantic relatedness variation (low-relatedness vs. high-relatedness) induced power increases in the theta frequency band (4–7 Hz). These results suggested that, in the sentence context, thematic role computing is modulated by the semantic relatedness between the verb and its argument; semantic relatedness processing, however, is in some degree independent from the thematic relations. Moreover, our results indicated that, during on-line sentence comprehension, thematic role computing and semantic relatedness processing are mediated by distinct neural systems.

From the bitsavers.org collection, a scanned-in computer-related document. trw :: trw-85 :: Culler Fried An On-Line Computing Center for Scientific Problems Jun63

From the bitsavers.org collection, a scanned-in computer-related document. informatics :: On-Line Computing Systems 1965

Adaptive computing systems (ACS) rely on reconfigurable hardware to adapt the system operation to changes in the external environment, and to extend mission capability by implementing new functions on the same hardware platform. This results in increased functional density and reduced power consumption - features very important in many domains, such as space missions or mobile devices. Field-programmable gate arrays (FPGAs) featuring incremental dynamic runtime reconfiguration (RTR) offer additional benefits by allowing the system to continue to execute uninterrupted, while portions of the FPGA are reconfigured for new logic functions. ACS are often deployed in harsh and/or hostile remote environments, and they are subject to strict high-reliability and high-availability requirements. Cosmic radiation may perturb the operation of a defect-free FPGA, and marginal defects not causing failures in manufacturing testing (such as a short initially having very high resistance) may become active with the aging of the device, or because of environmental factors. Since direct human intervention for maintenance and repair is impossible in such environments, fault-tolerant (FT) techniques resulting in graceful degradation must be used to achieve the desired mission life even in the presence of faults. However, traditional FT design, based on replicated modular redundancy and voting, is extremely expensive given the space, weight, and power constraints of ACS.

From the bitsavers.org collection, a scanned-in computer-related document. rand :: joss :: P-2922 JOSS A Designers View Of An Experimental On-Line Computing System Aug64

On the Effect of Local Attraction upon the Plumb-Line at Stations on the English Arc of the Meridian, between Dunnose and Burleigh Moor; And a Method of Computing Its Amount. Pratt, J Philosophical Transactions of the Royal Society of London (1776-1886). 1856-01-01. 146:31–52

An on-line digital system allowing an unusually direct coupling between the user (physicist, mathematician, engineer) and the computer is described. This system, which has been successfully operated during the past six months, was designed principally to provide assistance for problems whose structure is partially unknown (and frequently surprising). These typically require the development of new methods of ATTACK, AND HENCE AN AMOUNT OF PROGRAM EXPERIMENTATION NOT FEASIBLE WITH CLASSICAL COMPUTER CENTER ORGANIZATIONS. With the system described here, the interaction between user and computer is close enough to permit effective use of a scientist's intuition and of his detailed understanding of techniques and procedures, machine representations of those tools he considers essential to his area, and then use these, on-line, to study or solve problems of interest.

An on-line computing system has been developed which allows direct use of a high speed digital computer by mathematicians and scientists in their specialized fields. This report describes the system in detail from a user's point of view. For reference purposes, the report includes a listing of all computer programs used in the system.

JOSS (JOHNNIAC Open-Shop System) is an experimental on-line, time- shared computing service. It is in daily use by staff members of The RAND corporation for the solution of small numerical problems. The users compose stored programs and interact with JOSS through remote typewriter consoles by using a single, high-level language. The system is described with emphasis on those features which have led users to accept it as a convenient new tool. JOSS provides use of familiar typewriters, exact input/output, decimal arithmetic, high-level algebraic language with English punctuation rules, easy modification and repair of programs, and report-quality formatted output.