ppxscal/embedding_network huggingface dataset:
Concurrency Control and View Notification Algorithms for Collaborative Replicated Objects
Authors: Robert Strom, Guruduth Banavar, Kevan Miller, Michael Ward, Atul Prakash
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objects may be atomically updated, and these objects automatically maintain consistency with their replicas using an optimistic algorithm. Changes to these objects may be optimistically or pessimistically observed by view objects by taking consistent snapshots. The algorithms for both update propagation and view notification are based upon optimistic guess propagation principles, adapted for fast commit by using primary copy replication techniques. The main contribution of the paper is the synthesis of these two algorithmic techniques --- guess propagation and primary copy replication --- for implementing a framework that is easy to program to and is well suited for the needs of groupware applications.
Implementing Enterprise Portfolio Management with Microsoft Project Server 20002
Authors: Gary L. Chefetz
Venue:  (2003)

:"Real World Enterprise Portfolio Management with Microsoft Project Server 2002" is written for anyone contemplating or actively engaged in implementing and managing Microsoft Project Server. It takes you through a structured approach to implementation and conveys best practices for using the software once you've got it up and running. In writing this book, my goal was to provide you with the manual that the software didn't come with as well as the insight necessary to achieve success without the missteps many people make during implementation.Microsoft Project Server 2002 provides organizations with an extensible technology platform to securely develop and successfully deploy best practices for project management across your organization. Through a centrally-managed repository for standardized project and resource data, Microsoft Project Server provides teams with convenient access to business-critical information through its Web interface, Microsoft Project Web Access. By providing powerful Web-based collaboration, analysis, and reporting tools, Microsoft Project Web Access enables entire project teams-including team members, resource managers, and executives-to stay informed, up-to-date, and on track. With its enterprise-ready security and performance capabilities, Microsoft Project Server provides a customizable foundation for organizations to successfully develop and integrate their project management processes with their current and future business systems."
DIMACS Research and Education Institute (DREI ''97) Cryptography and Network Security(July 28 - August 15, 1997) Abstracts of Talks Presented
Authors: Joan Feigenbaum
Venue:  (1997)

During the summer of 1997 we held a three-week program of research workshops aimed at scientists from academia and industry, and open to graduate students and postdoctoral fellows, along with an educational program for high school and college teachers, undergraduates and others. In addition, there were plenary sessions and evening lectures aimed at meshing the two groups in discussion and problem-solving and creating partnerships in the educational enterprise.
Causation, explanation and nonmonotonic temporal reasoning
Authors: Peter D. Grunwald
Venue:  (1997)

We introduce a new approach to reasoning about action and change using nonmonotonic logic. The approach is arrived at by applying Pearl''s theory of causal networks to logical formalizations of temporal reasoning domains. It handles complicated reasoning domains involving concurrent actions, actions with nondeterministic effects, preconditions over several points in time, ramification/qualification constraints and causal chains of events. Our theory comes in two versions: version ${\bf S}_0$ that works for logical theories in which causal knowledge is represented explicitly, and version ${\bf I}_0$ that works for theories in which this is not the case. We show that ${\bf S}_0$ can be seen as a generalization and/or correction of most existing approaches that are explicitly based on causation. Specifically, we prove that on a large class of reasoning domains, ${\bf S}_0$ is equivalent to McCain & Turner''s theory of Ramifications and Qualifications. For another large class of reasoning domains, ${\bf S}_0$ turns out to be equivalent to Baral & Gelfond''s ${\cal L}_{3}$ approach. We give examples of reasoning domains that fall outside these classes and for which ${\bf S}_0$ yields better results than either McCain & Turner''s or Baral & Gelfond''s approach. We give strong arguments that ${\bf S}_0$ and Lin''s recent causal theory are equivalent on all reasoning domains on which both are defined. For the causal approaches of Morgenstern & Stein, Geffner, Haugh and Lifschitz & Rabinov we again provide examples of reasoning domains that ${\bf S}_0$ handles better than they do. We also show that two of the most well-known non-causal approaches, namely Baker''s account and `chronological minimization with filter preferential entailment'', can be reinterpreted as approximations of ${\bf I}_0$. In the case of Baker we again give an equivalence theorem and a counterexample. We thus provide a reinterpretation in terms of causal network theory of much of the work done in nonmonotonic temporal reasoning.
Networked Multimedia Systems Courses: Evolution, Current Courses, and Future Directions
Authors: Nalin Sharda
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper presents an overview of courses in the evolving discipline of Networked Multimedia Systems (NMS). Many new subjects and some courses on NMS are already on offer at various universities. Most of the current subjects in NMS are offered in existing computer science and computer engineering courses. Some universities are also offering full-edged degree programs in NMS and related areas. NMS area is developing into an independent discipline much quicker than did Computer Science. Practical work is an important aspect of any NMS subject or course. NMS is a fast developing area, hence the practical exercises and projects must be designed to absorb this fast pace of development. A systematic and forward-looking view of NMS subjects and courses is required to ensure cohesive development in the future.
Feedback, evolution and software technology
Authors: M. M. Lehman
Venue: Proceedings of the 10th International Software Process Workshop (1996)

1970s studies of the evolution of OS/360 and other software systems suggested that E-type software development processes display feedback system like behaviour, develop a controlling dynamics and are subject to a number of laws termed laws of program evolution. Following the 1994 formulation of a FEAST hypothesis that, inter alia, encapsulates these observations, further studies are now underway. These are re-examining the feedback phenomenon and seeking ways to exploit it so as to improve the process of software process improvement. This paper outlines these themes, summarises some preliminary results and introduces a two year funded project FEAST/1 that, in collaboration with industry, will pursue the matter further. FEAST/1 is seen as laying the foundations for a longer term interdisciplinary study which, if the FEAST hypothesis is valid, should have a significant impact on the industrial process of software development while also providing foundations for a theory of software process and software product evolution.
User Agents and Flexible Messages: A New Approach to Wireless Two-Way Messaging
Authors: Thomas Y. C. Woo, Thomas F. la Porta, Krishan K. Sabnani
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Wireless messaging, in the form of two-way paging, is an integral part of universal Personal Communications Services (PCS). Basic wireless messaging services include providing reliable (acknowledged) message delivery, reply capabilities, and message origination from a messaging device. Many more advanced services can also be envisioned.Wireless networks and end devices impose many limitations on system design. To overcome the problems caused by such an environment, we have introduced network based proxies, called user agents, to assist simple end devices, and a novel way to define messages, called flexible messages, so that advanced messaging services may be offered. In this paper, we describe how user agents and flexible messages assist in providing messaging services in the Pigeon two-way messaging research prototype at Bell Laboratories.
AVISPA: visualizing the performance prediction of parallel iterative solvers
Authors: V. Blanco, P. González, J. C. Cabaleiro, D. B. Heras, T. F. Pena, J. J. Pombo, F. F. Rivera
Venue: Future Generation Computer Systems (2003)

The selection of the best method and preconditioner for solving a sparse linear system is as determinant as the efficient parallelization of the selected method. We propose a tool for helping to solve both problems on distributed memory multiprocessors using iterative methods. Based on a previously developed library of HPF and message-passing interface (MPI) codes, a performance prediction is developed and a visualization tool (AVISP A) is proposed. The tool combines theoretical features of the methods and preconditioners with practical considerations and predictions about aspects of the execution performance (computational cost, communications overhead, etc.). It offers detailed information about all the topics that can be useful for selecting the most suitable method and preconditioner. Another capability is to offer information on different parallel implementations of the code (HPF and MPI) varying the number of available processors.
Performance Evaluation of Practical Parallel Computation Model LogPQ
Authors: Takayoshi Touyama, Susumu Horiguchi
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Massively parallel computers consisting of a large number of processing elements have been developed and expected as high performance computers in advanced science and technology. Practical parallel computation model has been required to analyze parallel algorithms on massively parallel computers. We present a practical parallel computation model LogPQ taking account of communication queues into the LogP model.The LogPQ model has three queues for each communication line, and four supplement parameters in addition to the LogP model. This paper addresses the performance of parallel matrix multiplication using the LogPQ model. The parallel performances on the parallel machine CM-5 are compared between the LogP and LogPQ model. It is seen that the LogPQ model expects the execution times more accurately than the LogP model.
A Domain-Theoretic Model for a Higher-Order Process Calculus
Authors: Radhakrishnan Jagadeesan, Prakash Panangaden
Venue:  (1989)

In this paper we study a higher-order process calculus, a restriction of one due to Boudol, and develop an abstract, model for it. By abstract we mean that the model is constructed domain-theoretically and reflects a certain conceptual viewpoint about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction that can be given additional algebraic structure that allows one to model concurrent composition, in the same sense that Plotkin''s powerdomain can have a continuous binary operation defined on it to model choice. We show that the model constructed this way is adequate with respect to the operational semantics. The model that we develop and our analysis of it is closely related to the work of Abramsky and Ong on the lazy lambda calculus.
Dynamic Data Broadcasting with Traffic Awareness
Authors: Chih-Lin Hu, Ming-Syan Chen
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Data dissemination has significantly served as a scalable data delivery mechanism in wireless networks. However, even though the broadcast traffic has the nature of dynamic changes, most previous research efforts were elaborated upon the premise of static workloads and access patterns without having proper traffic awareness. In this paper, we address the existence of client impatience and accordingly devise an on-line traffic awareness mechanismbased on a novel selective deferment and reflection technique (SDR) to estimate the dynamic workloads and access patterns in a granularity of a broadcast cycle. In comparison with prior probing and feedback approaches, our design is of practical usefulness in that it has low complexity and is light-weight without performance degradation. With various dynamic traffic scenarios, the experimental results show that with an increasing/decreasing workload, the real access frequency distribution is bounded by two specific estimated distributions. This fact in turn suggests us to employ a trigonometric tuning method to further enhance the estimation. Inaddition, we examine that the mean difference between the estimated access frequency distribution and the real one is very small, consequently indicating the feasibility and reliabilityof our proposed data broadcast mechanism with traffic awareness.
Graphical Programming of Time-Deterministic Real-Time Systems
Authors: Per-Arne Wiberg
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In this paper we present the Picasso programming language and the underlying design philosophy. Our goal is to provide programmers working with distributed embedded real-time systems with a tool to manage the complexity of this class of systems. The proposed tool allows easy and safe changes of the system software and hardware at any time during the lifetime of the system. This means that even during operation the system can be changed safely. This is not only important for enhancing the design process but is also necessary for a class of systems that need to be in service at all times. We have chosen to call this approach Change-Orientation. The most characteristic properties of the language are that it is graphical and that it shows time explicitly. All processing is described as functional transformations. These transformations are called processes. A very direct way of implementing a process is possible because the semantics of the description maps directly on the computation model of the processor.
Software Change Through Design Maintenance
Authors: Ira D. Baxter, Christopher W. Pidgeon
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Conventional software engineering tends to focus on a small part of the software life cycle: the design and implementation of a product. The bulk of the lifetime cost is in the maintenance phase, where one must live with the product previously developed. Presently, we have little theory and fewer tools to help us manage the maintenance activity. We contend that a fundamental cause of the difficulty is the failure to preserve design information. This results from an over preoccupation with the synthesis and maintenance of code. We offer an alternative paradigm: * make the design the central focus of the construction process-get code as a byproduct; * make the design the central focus of the maintenance process-preserve revised designs and get code as a byproduct. A transformational scheme for accomplishing this is presented. We call it the Design Maintenance System. The programming roles change radically from coding instances for ill-defined specifications to specifiers of functionality and (compiler-like) implementation methods. Specification and implementation method debugging would then become prominent activities. The design scheme and change management procedures are illustrated with a simple data processing application. We sketch an ongoing implementation.
Development of an International Standard for High-level Petri Nets
Authors: Jonathan Billington
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

Work has commenced on the development of an international standard for high-level Petri nets within ISO/IEC JTC1/SC7/WG11 Software Engineering Data Description and Representation. A ballot subdividing Project 7.19, Diagrams for Software Engineering, was held in the last half of 1995, and resulted in the subdivision being approved. The first Working Draft (WD) was circulated to members of Working Group 11 for discussion at the Ottawa interim meeting in October 1996. The result of this meeting was that a revised WD is currently being circulated to SC7 for comment. We hope to circulate the revised draft as a Committee Draft in the middle of 1997, and to progress the document to a Draft International Standard by 1998. This paper provides the background, scope, justification and current status of this project.
Prefetching and Caching Techniques in File Systems for MIMD Multiprocessors
Authors: F D Kotz
Venue:  (1991)

\indent The increasing speed of the most powerful computers, especially multiprocessors, makes it difficult to provide sufficient I/O bandwidth to keep them running at full speed for the largest problems. Trends show that the difference in the speed of disk hardware and speed of processors is increasing, with I/O severely limiting the performance of otherwise fast machines. This widening access-time gap is known as the ``I/O bottleneck crisis.'''' One solution to the crisis, suggested by many researchers, is to use many disks in parallel to increase the overall bandwidth. This dissertation studies some of the file system issues needed to get high performance from parallel disk systems, since parallel hardware alone cannot guarantee good performance. The target systems are large MIMD multiprocessors used for scientific applications, with large files spread over multiple disks attached in parallel. The focus is on automatic caching and prefetching techniques. We show that caching and prefetching can transparently provide the power of parallel disk hardware to both sequential and parallel applications using a conventional file system interface. We also propose a new file system interface (compatible with the conventional interface) that could make it easier to use parallel disks effectively. Our methodology is a mixture of implementation and simulation, using a software testbed that we built to run on a BBN GP1000 multiprocessor. The testbed simulates the disks and fully implements the caching and prefetching policies. Using a synthetic workload as input, we use the testbed in an extensive set of experiments. The results show that prefetching and caching improved the performance of parallel file systems, often dramatically.
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Authors: Shummet Baluja
Venue:  (1994)

Genetic algorithms (GAs) are biologically motivated adaptive systems which have been used, with varying degrees of success, for function optimization. In this study, an abstraction of the basic genetic algorithm, the Equilibrium Genetic Algorithm (EGA), and the GA in turn, are reconsidered within the framework of competitive learning. This new perspective reveals a number of different possibilities for performance improvements. This paper explores population-based incremental learning (PBIL), a method of combining the mechanisms of a generational genetic algorithm with simple competitive learning. The combination of these two methods reveals a tool which is far simpler than a GA, and which out-performs a GA on large set of optimization problems in terms of both speed and accuracy. This paper presents an empirical analysis of where the proposed technique will outperform genetic algorithms, and describes a class of problems in which a genetic algorithm may be able to perform better. Extensions to this algorithm are discussed and analyzed. PBIL and extensions are compared with a standard GA on twelve problems, including standard numerical optimization functions, traditional GA test suite problems, and NP-Complete problems.
Educating Managers with Tomorrow's Technologies
Authors: Charles Wankel, Bob DeFillippi
Venue:  (2003)

This volume covers key applications of new technologies in management education and development. The new open model of e-education with new integrations of corporate and academic courses and new levels of customization to fit the learning needs of particular individuals and their organizations. A spectrum of web-based and cd-based approaches to business education is presented. Some of these platforms involve video, audio, PowerPoint, chat, and other software presented in integrated ways. New approaches to e-libraries and e-reserves in support of management education are described. Online and network mediated simulations and games is the topic of a chapter. Another focuses on web-format case studies. An e-portfolio is a compendium communicating the academic accomplishments and professional resumes of a student using videos and other media that paper-form ones cannot. The innovative Place and Space model of Duke University's Fuqua School of Business's Internet-mediated MBA programs is explained. Teaching soft skills using software-supported training is covered. The new possibilities of wireless communication are covered by leading experts. Integrating ERP into business education discusses the use of ERP vendor provided simulations and exercises and issues of reconciling incompatible ERP systems in management education are discussed. A model of technology planning initiatives to improve the delivery of management education is presented. If properly harnessed, the technologies and management education applications described in this volume should provide superior tools for management education and management learning in the 21st Century.
A New Method of Facial Action Extraction and Expression Recognition of Person without Language
Authors: Y. Dai, Y. Shibata, K. Hashimoto, D. Cai, K. Katamachi, T. Ishii, A. Osuo, K. Nokuchi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, a method to extract the facial actions and recognize the expressions of person without language is presented. In this proposed method, a difference image of two successive frames of an image sequence, and a corresponding I component image in Y IQ image representation were combined to extract the facial action and detect the facial region. The optical flows of the corresponding image sequence, which appeared the facial actions, were computed. Based on the optical flow projection histogram on X and Y coordinate axes in the mouth region and the eye region, the motion features of facial expressions were extracted to compose the associate memory model of the facial expressions. By utilizing this model, the facial expressions were recognized.
Engineering or Sloganeering? The Counterattack on Privacy
Authors: Michael A. Caloyannides
Venue: IEEE Security and Privacy (2003)

This column this entire publication is about the engineering aspects of privacy and security, not politics. That said, technologists are often viewed with suspicion these days by the "if you're not with us, you're against us" crowd that considers treasonous anything less than unconditional endorsement of its actions.