ppxscal/embedding_network huggingface dataset:
Coherence-Centric Logging and Recovery for Home-Based Software Distributed Shared Memory
Authors: Angkul Kongmunvattana, Nian-Feng Tzeng
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, called the coherence-centric logging (CCL) and recovery protocol, for home-based SDSM. Our CCL minimizes failure-free overhead by logging only data necessary for correct recovery and tolerates high disk access latency by overlapping disk accesses with coherence-induced communication existing in home-based SDSM, while our recovery reduces the recovery time by prefetching data according to the future shared memory access patterns, thus eliminating the memory miss idle penalty during the recovery process. To the best of our knowledge, this is the very first work that considers crash recovery in home-based SDSM.We have performed experiments on a cluster of eight SUN Ultra-5 workstations, comparing our CCL against traditional message logging (ML) by modifying Tread Marks, a state-of-the-art SDSM system, to support the home-based protocol and then implementing both our CCL and the ML protocols in it. The experimental results show that our CCL protocol consistently outperforms the ML protocol: Our protocol increases the execution time negligibly, by merely 1% to 6%, during failure-free execution, while the ML protocol results in the execution time overhead of 9% to 24% due to its large log size and high disk access latency. Our recovery protocol improves the crash recovery speed by 55% to 84% when compared to re-execution, and it outperforms ML-recovery by a noticeable margin, ranging from 5% to 18% under parallel applications examined.
Proceedings of the 17th Real-Time Systems Symposium WIP Session
Authors: Azer Bestavros
Venue:  (1996)

Abstract This technical report includes 14 short papers presented during the WIP session of the 17th Real-Time Systems Symposium, held in Washington DC on December 4-6, 1996. The title and authors are included below. ------ (1) A Specialized Specification and Verification System for Timed Automata Myla Archer and Constance Heitmeyer Naval Research Laboratory, USA Abstract: Assuring the correctness of specifications of real-time systems can involve significant human effort. The use of a mechanical theorem prover to encode such specifications and to verify their properties could significantly reduce this effort. A barrier to routinely encoding and mechanically verifying specifications has been the need first to master the specification language and logic of a general theorem proving system. Our approach to overcoming this barrier is to provide mechanical support for producing specifications and verifying proofs, specialized for particular mathematical models and proof techniques. We are currently developing a mechanical verification system called TAME (Timed Automata Modeling Environment), which provides this specialized support using SRI''s Prototype Verification System (PVS). Our system is intended to permit steps in reasoning similar to those in hand proofs that use model-specific techniques. TAME has recently been used to detect errors in a realistic example. ------ (2) Scheduling Slack in MetaH Pam Binns Honeywell Technology Center, USA Abstract: A real-time implementation for allocating slack to aperiodic proceesses in MetaH is nearing completion. The slack scheduling algorithm is based on the slack stealer originally proposed in "An Optimal Algorithm for Scheduling Soft-Aperiodic Tasks in Fixed-Priority Preemptive Systems" with practical extensions to allow for support of process criticalities, multiple process streams (of different criticalities) competing for pooled slack and inclusion of run-time overheads in the slack functions. Areas in need of future work are also identified. ------ (3) AFTER: A case tool to assist in Fine-tuning of embedded real-time systems Gaurav Arora and David Stewart University of Maryland, USA Abstract: AFTER (Assist in Fine-Tuning of Embedded Real-time systems) is an interactive analysis and predictor tool for embedded systems. It helps designers quickly identify timing problems and systematically fine-tune an application during and after the implementation phase of a product''s lifecycle. The tool begins with raw timing data collected from an embedded system. It analyzes the data to provide a temporal image of the current implementation, highlighting actual and potential problems. The user then interacts with AFTER to obtain predictions on what overall effect can be expected if small adjustments are made to configuration parameters or to the timing properties of specific software components. The tool integrates and extends prior research in scheduling, task monitoring, and operating system design for real-time s
Microsoft Windows Server 2003 TCP/IP Protocols and Services Technical Reference, 2 edition
Authors: Joseph Davies, Thomas Lee
Venue:  (2003)

:This technical reference delivers must-know information on TCP/IP for any IT professional working with Windows .NET Server. The book focuses on core TCP/IP protocols such as IP, ICMP, IGMP, and UDP; physical protocols such as Ethernet; and application protocols such as DNS, DHCP and WINS. It also provides details on NDIS and Windows NT(r)-based networking architecture. The book starts with the fundamentals and builds comprehension layer by layer. Companion CD-ROM contains supplemental materials, including technical white papers.
TASOM: The Time Adaptive Self-Organizing Map
Authors: H. Shah-Hosseini, R. Safabakhsh
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The time-decreasing learning rate and neighborhood function of the basic SOM (Self-Organizing Map) algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changing environments, we propose a modified SOM algorithm called ¿Time Adaptive SOM¿, or TASOM, that automatically adjusts learning rate and neighborhood size of each neuron independently.The proposed TASOM is tested with stationary environments and its performance is compared with that of the basic SOM. It is also tested with non-stationary environments for representing the letter ¿L¿, which may be translated, rotated, or scaled. Moreover, the TASOM is used for adaptive segmentation of images, which may have undergone gray-level transformation.
The DCode Intermediate Program Representation Reference Manual and Report
Authors: K. J Gough
Venue:  (1993)

This document describes the intermediate program representation DCode. The representation is an ASCII format which specifies instructions for an abstract stack machine. Interpretive code generators may process this file to produce object code for various target machines. The semantics of each instruction in the code is explained, and the various directives detailed. This document is intended to serve as a guide for those wishing to create new code generator back-ends for the existing compilers, and for those wishing to create front-ends for a new language for the existing code generators.
Randomized Complexity of Linear Arrangements and Polyhedra
Authors: Karpinski Marek
Venue:  (1999)

We survey some of the recent results on the complexity of recognizing n-dimensional linear arrangements and convex polyhedra by randomized algebraic decision trees. We give also a number of concrete applications of these results. In particular, we derive first nontrivial, in fact quadratic, randomized lower bounds on the problems like Knapsack and Bounded Integer Programming. We formulate further several open problems and possible directions for future research.
Principal Component Analysis with Missing Data and Its Application to Object Modeling
Authors: Heung Shum, Katsushi Ikeuchi, Raj Reddy
Venue:  (1993)

Observation-based object modeling often requires integration of shape descriptions from different views. In current conventional methods, to sequentially merge multiple views, accurate description of each surface patch has to be precisely known in each view and transformation between any adjacent views needs to be accurately recovered. When noisy data and mismatches are present, recovered transformation becomes erroneous. In addition, the transformation error accumulates and propagates along the sequence, which results in an inaccurate object model. To overcome these problems, we have developed a weighted least square (WLS) approach which simultaneously recovers object shape and transformation among different views without recovering inter-frame motion as an intermediate step. We show that object modeling from a sequence of range images is a problem of principal component analysis with missing data (PCAMD), which can be generalized as a WLS minimization problem. An efficient algorithm is devised to solve the problem of PCAMD. After we have segmented surface regions in each view and tracked over all the sequence, we construct a 3 F x P normal measurement matrix of surface normals, and an F x P distance measurement matrix of normal distances to the origin for all visible P regions appeared over the whole sequence of F views, respectively. These two measurement matrices, which have many missing elements due to noise, occlusion and mismatching, enable us to formulate multiple view merging as a combination of two WLS problems. A two-step algorithm, which employs the quaternion representation of the rotation matrix, is presented to compute surface descriptions and transformations among different views simultaneously. After surface equations are extracted, spatial connectivity among these surfaces is established to enable the object model to be reconstructed. Experiments using synthetic data and real range images show that our approach is robust against noise and mismatching and generates accurate object model by averaging over all visible surfaces. Specifically, using a sequence of real range images, we illustrate the reconstruction of a toy house model.
Software Organization for Dynamic and Adaptable Wearable Systems
Authors: Stephen Fickas, Gerd Kortuem, Zary Segall
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

There is a growing interest in a class of systems having dynamic and adaptable properties. In this paper we discuss our work on one subclass of such systems, that of wearable computers. In particular, our interest is in the software organization necessary to build wearable computing systems. We will examine some of the key properties of such a software organization such as the ability to rapidly and dynamically reconfigure software to meet both physical changes and information changes of the wearable system. This has lead us to study a middleware layer for a wearable system that supports dynamic reconfiguration. The middleware approach is studied in the context of the NETMAN - a network maintenance assistant. Current results from the system evaluations and the final system requirements and open issues are presented.
Web Site Privacy with P3P, 1 edition
Authors: Helena Lindskog, Stefan Lindskog
Venue:  (2002)

:Privacy on the Internet is a very complicated -- and delicate -- subject. It is about making sure that sites are honest with the people using their services, and providing the end user with the choice of whether or not to share information with the original server. The Platform for Privacy Preferences Project (P3P), an emerging industry standards set developed by the World Wide Web Consortium (W3C), provides a simple way for users to gain more control over the use of personal information on the Web sites they visit. By using P3P to encode privacy policies in XML format, browsers can interpret whether a Web site meets an individual's privacy standards and alert the user when a site does not. Written by experts, this is the first book to show systems architects how to embed and design a Web site that is compliant with P3P. The authors provide detailed descriptions of the P3P standard and its parameters, as well as guidelines, explanations, and P3P how-to examples that you can follow.
Modelling an industrial software process using a commercially available tool
Authors: D. Martin, R. Nilsson, J. Hallstrand, P. Jauhiainen, H. Malm
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

Although there has been much interest in process modelling and automation within the software industry, there have been few independent reports of experience gained an the application of this technology to industrial software processes. The paper describes the experience gained modelling an extract from a large industrial software process using a commercially available tool. The purpose of the project was to assess the maturity of process modelling technology and specifically the functionality provided by the tool used. Feedback is given on programming a software process using the underlying notation of the tool, on the issues surrounding the translation from an organisation's process notation to that of a particular tool, and on process modelling and automation issues in general. The conclusions are that while benefits can be gained from an automation effort, modelling and translation between notations can be difficult.
TimeSleuth: A Tool for Discovering Causal and Temporal Rules
Authors: Kamran Karimi, Howard J. Hamilton
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Discovering causal and temporal relations in a system is essential to understanding how it works, and to learning to control the behaviour of the system. TimeSleuth is a causality miner that uses association relations as the basis for the discovery of causal and temporal relations. It does so by introducing time into the observed data. TimeSleuth uses C4.5 as its association discoverer, and by using a series of pre-processing and post-processing techniques to enable the user to try different scenarios for mining causality. The data to be mined should originate sequentially from a single system. TimeSleuth's use of a standard decision tree builder such as C4.5 puts it outside the current mainstream method of discovering causality, which is based on conditional independencies and causal Bayesian Networks. This paper introduces TimeSleuth as a tool, and describes its functionality. TimeSleuth expands the abilities of C4.5 in some important ways. It is an unsupervised tool that can handle and interpret temporal data. It also helps the user in analyzing the relationships among the attributes by enabling him/her to see the rules, and statistics about them, in tabular form. There is also a mechanism to distinguish between causality and acausal relations. The user is thus encouraged to perform experiments and discover the nature of relationships among the data.
On the numerical solutions of integral equation of mixed type
Authors: M. A. Abdou, Khamis I. Mohamed, A. S. Ismail
Venue: The Korean Journal of Computational Applied Mathematics (2003)

Toeplitz matrix method and the product Nystrom method are described for mixed Fredholm-Volterra singular integral equation of the second kind with Carleman Kernel and logarithmic kernel. The results are compared with the exact solution of the integral equation. The error of each method is calculated.
An Integrated Approach for Studying Architectural Evolution
Authors: Qiang Tu, Michael W. Godfrey
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Studying how a software system has evolved over time is difficult, time consuming, and costly; existing techniques are often limited in their applicability, are hard to extend, and provide little support for coping with architectural change. This paper introduces an approach to studyingsoftware evolution that integrates the use of metrics, software visualization, and origin analysis, which is a set of techniques for reasoning about structural and architectural change. Our approach incorporates data from various statistical and metrics tools, and provides a query engine as well as a web-based visualization and navigation interface. It aims to provide an extensible, integrated environment for aiding software maintainers in understanding the evolution of long-lived systems that have undergone significant architectural change. In this paper, we use the evolution of GCC as an example to demonstrate the uses of various functionalities of BEAGLE, a prototype implementation of the proposed environment.
Survey of design goals for operating systems
Authors: David H. Abernathy, John S. Mancino, Charls R. Pearson, Dona C. Swiger
Venue: ACM SIGOPS Operating Systems Review (1973)

The paper reports the results of a literature search on the subject "design goals for operaring systems." In addition, design goals of specific operating systems are reviewed and a general set of operating system design goals is developed. Special-purpose design goals and conflicts among design goals are also discussed.
A GUI Approach to Programming of TMO Frames and Design of Real-Time Distributed Computing Software
Authors: K. H. (Kane) Kim, Seok-Joong Kang
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

An advanced high-level approach for programming of real-time distributed computing applications, the TMO (Time-triggered Message-triggered Object) programming and specification scheme, has been enabled without creating any new language or compiler. Instead, a middleware system named the TMO Support Middleware (TMOSM) and an API that wraps around the execution support services of TMOSM have been established. An approach enabling further reduction of the labor in TMO programming is to let the programmer use a GUI to build structural frames of application TMO networks. The supporting tool called the Visual Studio for TMO (ViSTMO) consists of a GUI part for interactive design of TMO-network structures and a part for automated generation of C++TMO code-frameworks. The TMO scheme contains mechanisms enabling efficient design of autonomy-rich structures of application systems and ViSTMO provides GUIs for programming the use of those mechanisms among others. The recent expansion and refinement of the functionality of and the implementation techniques used in ViSTMO are discussed in this paper.
Building and applying a concept hierarchy representation of a user profile
Authors: Nikolaos Nanas, Victoria Uren, Anne De Roeck
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Term dependence is a natural consequence of language use. Its successful representation has been a long standing goal for Information Retrieval research. We present a methodology for the construction of a concept hierarchy that takes into account the three basic dimensions of term dependence. We also introduce a document evaluation function that allows the use of the concept hierarchy as a user profile for Information Filtering. Initial experimental results indicate that this is a promising approach for incorporating term dependence in the way documents are filtered.
Program Comprehension through Multiple Simultaneous Views: A Session with VinEd
Authors: Jorma Sajaniemi
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Program comprehension is a hard cognitive task that can be promoted by the use of views, i.e., automatically created concrete representations of a program revealing different aspects of its structure and behavior. VinEd is a view-based editor that allows users to add their own views to the system. This paper analyzes the VinEd approach by presenting a scenario of a session where VinEd is used in a comprehension task. The scenario is analyzed from a cognitive point of view. The VinEd approach is also evaluated using two requirement lists proposed for software exploration tools.
Knowledge Acquisition for Classification Systems
Authors: Takao Miura, Isamu Shioya
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We propose a new method to mine type scheme semi-automatically from initial database scheme and the instances. Our data model assumes one entity may have more than one types and classification (or type scheme). It might be appropriate when each entity is classified into at most k (least general) classes with respect to Is a hierarchy to keep database processing efficient.Our method differs from others in evolving Is a hierarchy by introducing semantical metric. We propose a sophisticated algorithm to simplify, evolve and generate type schemes.
Coalgebra, concurrency, and control
Authors: J. J.M.M. Rutten
Venue:  (1999)

Coalgebra is used to generalize notions and techniques from concurrency theory, in order to apply them to problems concerning the supervisory control of discrete event systems. The main ingredients of this approach are the characterization of controllability in terms of (a variant of) the notion of bisimulation, and the observation that the family of (partial) languages carries a final coalgebra structure. This allows for a pervasive use of coinductive definition and proof principles, leading to a conceptual unification and simplification and, in a number of cases, to more general and more efficient algorithms.
Noise in Radio Frequency Circuits: Analysis and Design Implications
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper provides an overview of noise analysis techniques and noise models for radio frequency (RF) circuits and the implication of noise constraints on RF circuit design. In order to accurately account for the circuit nonlinearities, the circuit noise sources are modelled as stochastic processes and the circuit equations are solved with these stochastic processes as inputs, using techniques from stochastic calculus. Noise analysis and modelling techniques are presented for both autonomous (oscillatory) and non-autonomous circuits. Using these models, noise analysis of a phase feedback system (phase-locked loop) is also presented. Additionally, design techniques for minimizing noise in these circuits which are based on these analyses are also presented. 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
An Expert System for Multiple Emotional Classification of Facial Expressions
Authors: M. Pantic, L. J. M. Rothkrantz
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper discusses Integrated System for Facial Expression Recognition (ISFER), which performs facial expression analysis from a still dual facial view image. The system consists of three major parts: facial data generator, facial data evaluator and facial data analyzer. While the facial data generator applies fairly conventional techniques for facial features extraction, the rest of the system represents a novel way of performing a reliable identification of 30 different face actions and a multiple classification of expressions into the six basic emotion categories. An expert system has been utilized to convert low level face geometry into high level face actions, and then this into highest level weighted emotion labels. The system evaluation results demonstrated rather high concurrent validity with human coding of facial expressions using the FACS and formal instructions in emotion signals.