ppxscal/embedding_network huggingface dataset:
Optimal and Suboptimal Reliable Scheduling of Precedence-Constrained Tasks in Heterogeneous Distributed Computing
Authors: Atakan Dogan, Füsun Özgüner
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

This paper introduces algorithms, which can produce both optimal, and suboptimal task assignments to minimize the probability of failure of an application executing on a heterogeneous distributed computing system. A cost function which defines this probability under a given task assignment is derived. To find optimal and suboptimal task assignments efficiently, the reliable matching and scheduling problem is converted to the state-space search problem in which the cost function derived is used to guide the search. The A* algorithm for finding optimal task assignments and the \math and hill-climbing algorithms for finding suboptimal task assignments are presented. The simulation results are provided to confirm the performance of the proposed algorithms.
Handbook of Interactive Management, 2 edition
Authors: John N. Warfield, A. Roxana Cardenas
Venue:  (2002)

:This companion work to John Warfield's A Science of Generic Design: Managing Complexity Through Systems Design goes beyond theory to present actual working models for practitioners to follow in the search for solutions to complex systems problems. It addresses the use of the computer to aid decision-making and includes case studies of actual practical applications. Systems design skills will be an integral part of general education in the near future. A Handbook of Interactive Management provides techniques for problem solving, emphasizing the skills necessary to integrate knowledge from diverse disciplines and to implement the resulting solutions. Managers and administrators of complex sociotechnical systems will welcome this guide to translating the principles of generic design into effective action.
A Protocol for Removing Communication Intrusion in Monitored Distributed Systems
Authors: Wanqing Wu, Madalene Spezialetti
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

The development of a distributed application that exhibits both desired functionality as well as performance is a complex task. Therefore, the construction of monitoring tools to assist in the development of complex distributed applications is of great practical significance. For example, monitoring tools can be used to observe the behavior and fine tune the performance. One of the fundamental problems that must be addressed is to ensure that the monitoring tool is able to report the true behavior of an application, that is, it is able to monitor the application non-intrusively. In this paper, we identify the intrusive effects of monitoring on communication in an arbitrary point-to-point network and present the enhanced communication protocol for on-line communication intrusion removal. Our experiments demonstrates that the intrinsic overhead of a distributed system integrated with on-line intrusion removal techniques is 0.43\%, 98.3\% of intrusion on the accumulated number of events and 97.2\% of intrusion on the sequence of event occurrences can be removed successfully.
Query Plans - Their Cost and Generation in a Distributed Heterogeneous Environment
Authors: George Semeczko, Stanley Y.W. Su
Venue:  (1997)

As with other distributed database systems, it is important in an Active Object Oriented Knowledge Base Management System (AOOKBMS) to be able to execute distributed queries efficiently and cost effectively. In this paper, we show how this task is being tackled in an ongoing project at the University of Florida dealing with Virtual Enterprises (VE). This project uses an AOOKBMS to not only describe a common view of the VEs data and processing capabilities, but to also support distributed query optimization and processing. Through the use of wrappers this system allows the distributed execution of a query defined in an Object Query Language. It can be executed on heterogeneous systems that may include Object Oriented and Relational databases as well as non-database oriented systems. The results of this distributed processing is then combined and presented in a single uniform result, thus supporting the concept of a truly Virtual Enterprise. In this paper we cover how query optimization can be achieved using the AOOKBMS to store and manipulate all aspects of the query optimization and distributed processing tasks. In this paper we show that the AOOKBMS is a suitable tool for this task. To do this we present a cost function for any query tree defined in the AOOKBMS as well as an algorithm for turning a centralized query tree into a distributed query plan. Both this algorithm as well as the execution control mechanism are then presented using the implementation programming language developed for the AOOKBMS.
Canard: A Framework for Community Messaging
Authors: Pascal R. Chesnais
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

A portable and extensible framework for community messaging is described. It integrates off-the-shelf communications devices and protocols by converting them into a uniform message representation. Using personal databases, the relevancy of a message is evaluated and appropriate delivery channels selected. This framework is being tested with a group of forty students in a living group at MIT. They have been equipped with two--way pagers which can be carried at all times and work in concert with this communication framework. The framework's ability to autonomously manage communications, makes it a flexible model for the wearable community where communications reliability is an issue.
A Multigrid Method for Elastic Scattering
Authors: Jan Mandel, Mirela Popa
Venue:  (1997)

A finite element discretization and a multigrid method for an acoustic elastodynamic model are presented. The model problem is a channel with rigid walls and elastic obstacle in the middle, Dirichlet boundary condition for the incoming wave, Neumann boundary conditions at rigid surfaces on the sides, and an absorbing boundary at the outgoing side. The discrete solutions appear to converge as O(h^2). The discretization is verified by comparing discrete solutions with known analytic solutions for a modified problem. An efficient V-cycle multigrid algorithm is developed to solve the discrete equations. The method employs smoothing by iterating on the squared system, combined with a block Jacobi step to resolve variables in a neighborhood of the interface. The efficiency of the method is demonstrated on numerical experiments.
Gossip-Based Ad Hoc Routing
Authors: Zygmunt Haas, Joseph Y. Halpern, Li Li
Venue:  (2001)

Many ad hoc routing protocols are based on(some variant of) flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossiping-based approach to reduce the overhead of the routing protocols. In large networks, Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fraction of the nodes gets the message. The fraction of executions in which most nodes gets the message depends on the gossiping probability and the topology of the network. In the networks we have considered, using gossiping probability between 0.6 and 0.8 suffices to ensure that almost every node gets the message in almost every execution. For large networks, this simple gossiping protocol uses up to 35% fewer messages than flooding, with improved performance. Gossiping can also be combined with various optimizations of flooding to yield further benefits. Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes only. We expect that the improvement should be even more significant in larger networks.
Guaranteeing Multiple QoSs in Differentiated Services Internet
Authors: Hoon Lee, Hyejin Kwon, Yoshiaki Nemoto
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, we propose a new architecture for guaranteeing the multiple Quality of Services (QoSs) in Differentiated Service Internet. We take into account the IETF's Differentiated Service (DiffServ) architecture as well as the QoS requirements of each user application. The main focus lies in the modeling and performance evaluation of the prioritized packet service scheme in the core router which supports weighted priority services in the packet with three service classes defined in IETF: EF (Expedited forwarding), AF (Assured forwarding) and DF (Default forwarding) PHB (Per Hop Behavior). Via simulation experiments, we discuss the implication of the proposed scheme.
Non-destructive testing of ground anchorages using the GRANIT&#x00AE; technique
Authors: A. Starkey, A. Ivanovic, R. D. Neilson, A. A. Rodger
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

The GRANIT® system is a non-destructive integrity testing method for ground anchorages. It has won two major UK Awards - the Design Council Millennium Product Status in 1999 and the John Logie Baird Award in 1997. It makes use of novel artificial intelligence techniques in order to learn the complicated relationship that exists between an anchorage and its frequency response to an impulse. The GRANIT® system has a worldwide patent and is currently licensed to AMEC plc.It is widely recognised that non-destructive testing methods for ground anchorages need to be developed as a high priority [1], with only between 1-5% of anchorages currently being monitored in service [2]. The GRANIT® system is a solution for this requirement, and this paper describes how the use of artificial intelligence techniques enabled, for the first time, the cross-anchorage diagnosis of ground anchorages, where data taken from one anchorage was used to train a neural network, which was then used to diagnose the condition of an adjacent anchorage.The results presented in this paper describe the training of a neural network on data taken from a bolt anchorage, and the diagnosis using this neural network, of further test data taken from the same anchorage. Data taken from an adjacent anchorage of similar construction is also presented to the neural network, and the cross-anchorage diagnosis of the load level of the second anchorage is achieved.
Design of One-Vector Testable Binary Systems Based on Ternary Logic
Authors: Mou Hu
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

A new concept, one-vector testability, is defined. Design method to achieve one-vector testability of binary systems based on ternary logic is proposed. Some techniques for designing testable binary systems based on ternary circuits are re-examined by using the proposed design method.
DRAM-Cell-Based Multiple-Valued Logic-in-Memory VLSI with Charge Addition and Charge Storage
Authors: Takahiro Hanyu, Hiromitsu Kimura, Michitaka Kameyama
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A multiple-valued logic-in-memory VLSI with fast reprogrammability is proposed to realize transfer-bottleneck-free VLSI systems. A basic component, in which a dynamic storage function and a multiple-valued threshold-literal function are merged, can be simply implemented by charge addition and charge storage with a DRAM-cell-based circuit structure. Any logic circuits with multiple-valued inputs and binary outputs can be realized by the combination of the basic components and logic-value conversion. As a typical example, a parallel magnitude comparator between three-valued input and stored words is designed by using the proposed logic-in-memory VLSI architecture. Its performance is superior to that of a corresponding binary implementation by using HSPICE simulation under a 0.5-um CMOS technology.
Effective Search Strategies for Application-Independent Speedup in UDP Demultiplexing
Authors: Joseph T. Dixon, Kenneth L. Calvert
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We present UDP datagram demultiplexing techniques that can yield potentially substantial application-independent performance gains over BSD-derived UDP implementations. Our demultiplexing strategies exploit local host and UDP implementation features -- (1) how UDP processes connection-less datagrams, (2) local host application as client or server, and (3) local host application "density" -- resulting in straight- forward hash-based search strategies that caused demultiplexing speedups as high as 24-to-1 over BSD's one-behind cache. Furthermore, while past researchers have shown that cache-based schemes yield little performance benefit for UDP, we show that cache-based implementations can actually degrade demultiplexing performance. Finally, we recommend simple, non-protocol altering local host modifications for existing and future UDP implementations. We used four server traffic traces and eight algorithms in our trace-driven simulations, and executed more than 60 simulations to obtain our results.
A Combination Method of Two Classifiers Based on the Information of Confusion Matrix
Authors: S. H. Jeong, K. T. Lim, Y. S. Nam
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper describes some of research results related to the development of a character recognizer appropriate for fast handwritten Korean address reading. Our goal is to design a handwritten Korean character recognizer retaining the following three characteristics: reliablerecognition scores indicating probability, high speed, and naturally acceptable cumulative recognition rates. We have adopted two statistical classifiers to satisfy the first characteristic and proposed methods coupling the two classifiers to meet the second and third ones. Thesuperiority of the proposed combination methods has been proven through experiments done with the PE92 database.
Projection-Based Multiuser Receiver over Frequency Selective Channels
Authors: Zhengyuan(Daniel) Xu
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

In multiuser communication, the receiver's performance is degraded by multiuser interference (MUI) as well as multipath distortions. This paper aims at elimination of these side effects. By projecting the received data onto the orthogonal code space of interfering users, equivalent single user and MUI free data vectors are obtained. Since the projection matrix consists of orthonormal bases, the whiteness of original additive Gaussian noise is still preserved after projection operation. Therefore various detection techniques, e.g., constant modulus algorithm (CMA), subspace, iterative least squares with projection (ILSP), etc. can be successfully applied to estimate transmitted symbols and the multipath channel of the desired user, but with reduced complexity and asymptotically optimal performance. The proposed receiver is simulated by ILSP method and its performance compared with the RAKE receiver and the decorrelating receiver. Much lower bit error probability is achieved for a wide range of signal to noise ratios. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Timestamping Messages in Synchronous Computations
Authors: Vijay K. Garg, Chakarat Skawratananond
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

In this paper, we present a new method of timestamping messages and events in synchronous computations that capture the order relationship with vectors of size less than or equal to the size of the vertex cover of the communication topology of the system. Our method is fundamentally different from that of Fidge and Mattern's technique. The timestamps in our method do not use one component per process but still guarantee that the order relationship is captured accurately. Our algorithm is online and only requires piggybacking of timestamps on program messages. It is applicable to all programs that either use programming languages based on synchronous communication such as CSP, or use synchronous remote procedure calls.
Pseudospectra of linear operators
Authors: Lloyd N. Trefethen
Venue:  (1995)

The advent of ever more powerful computers has brought with it a new way of conceiving some of the fundamental eigenvalue problems of applied mathematics. If a matrix or linear operator $A$ is far from normal, its eigenvalues or more generally its spectrum may have little to do with its behavior as measured by quantities such as $\|A^n\|$ or $\EtA$.\ \ More may be learned by examining the sets in the complex plane known as the {\it pseudospectra} of $A$, defined by level curves of the norm of the resolvent, $\Resz$. Five years ago, the author published a paper that presented computed pseudospectra of thirteen highly non-normal matrices arising in various applications. Since that time, analogous computations have been carried out for differential and integral operators. This paper, a companion to the earlier one, presents ten examples, each chosen to illustrate one or more mathematical or physical principles.
Effects of an Asynchronous Resource Allocation Protocol on End-to-End Service Provision
Authors: Spyros Lalis, Manolis Marazakis, Dimitris Papadakis
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

In this paper we present a protocol for acquiring resource bundles from autonomously operating markets and discuss results of experiments that were performed to quantify the protocol performance at high loads. A major finding from our experiments is that an application class may be penalized by experiencing delays in accessing a shared resource as a result of overload on resources used by other application classes, which are unknown to this class. In turn, these delays may cause under-utilization of other resources used by this application class. Moreover, we illustrate how such effects can emerge by varying the relative occurrence frequencies of application classes, but without changing the aggregate load of the system.
Fragmentation based D-MAC Protocol in Wireless Ad Hoc Networks
Authors: Zhenmin Li, Pin Zhou, Jennifer C. Hou
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Directional antennas have been recently suggested to be usedin wireless ad hoc networks to reduce interference outsidethe antenna direction and to increase spatial reuse of wireless channels. Several MAC schemes that exploit directional antennas have been proposed, among which the twoD-MAC schemes proposed in [5] may have received the mostattention. In this paper, we carefully analyze how the second D-MAC scheme proposed in [5] operates in the hidden/exposed terminal scenarios and show that it not onlyintroduces new collisions, but also reduces spatial reuse tosome extent. To remedy these problems, we propose an enhanced version of the second D-MAC scheme, called fragmentation based D-MAC (FD-MAC), to reduce collision,to achieve better spatial reuse (than the second D-MACscheme), and to improve fairness. Through ns-2 simulation, we demonstrate the effectiveness of FD-MAC, andin particular, we show that in complex scenarios such asmultihop forwarding and mesh topologies, FD-MAC significantly outperforms DCF with RTS/CTS and the two D-MAC schemes, both in terms of throughput and fairness.
Applying Artificial Intelligence Theory to Helicopter SAF Simulation Based on HLA/RTI (1)
Authors: Kazuo Uchiyama, Yasuko Iwai, Toshikazu Ichinoseki, Kiyoshi Kayama
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper describes helicopter SAF simulation model based on HLA/RTI.Since Helicopter SAF requires complicated behavior on three dimensional space.Actual situation in battle space has uncertainty that is difficult to express in the usual simulation. In this study, we have developed helicopter SAF model at first in Japan and confirmed the effectiveness of ourmodel.The characteristics of study are as follows. 1) This helicopter has "intention" by applying Artificial Intelligence (AI) theory. So it will behave as autonomic and judge by itself. 2) Applying Rule Based Reasoning (RBR) and Case Based Reasoning (CBR), we can reflect the proficient pilot behavior to our developed model.As the result, the helicopter conducts with much complicated flying pattern as terrain avoidance, nap of the earth etc. 3) In this model, the operator has set mission to search enemy which location is unknown.The helicopter theorizes the location of enemy and plans the flight scheme using AI theory. 4) Algorithm for detecting enemy is based on the searching pattern data that we have surveyed from a proficient watchman. 5) Enemy can also detect the Helicopter by using radar and watchman.And they can assault the helicopter by missile. 6) Regarding environmental federation, we use digital map data and input weather data as visibility, ceiling, cloudy status, wind velocity, wind direction etc.Hence, we can realize more actual meteorological situation than existing simulation. 7) To scrutinize helicopter-flying pattern, we can conduct complicated simulation by using simpler rules for the helicopter flight pattern than usual one.A computer's processor is required less work than usual RBR.As the result, we found the way to conduct major scale federation or more realistic simulation than existing model.
What Is Preventive Software Maintenance?
Authors: Risto Vehvilainen
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

In this talk, I will approach software maintenance from the service point of view. I will particularly emphasize co-operation with the client. My definition of software maintenance is: Software maintenance refers to all the actions that are needed to keep software in such a running order that it achieves all its objectives from the beginning until the end of the usage. The ideas I will present are based on several software maintenance development projects that I have been involved in as a consultant. I will answer to the title question by describing 'preventive software maintenance' in connection with classification factors.
Integrity Constraints versus View Constraints
Authors: Patrizia Asirelli
Venue:  (1996)

The problem of Integrity Constraints checking in the area of logic databases is consid- ered and some research results are presented in which two dierent notions of constraints emerge: ''Integrity Constraints'' and ''View Constraints''. These two notions are presented and discussed by means of two examples of applications. Two approaches towards the implemen- tation of View Constraints are also presented. EMAIL:: asirelli@iei.pi.cnr.it