ppxscal/embedding_network huggingface dataset:
Using Role-Based Modeling Language (RBML) to Characterize Model Families
Authors: Dae-Kyoo Kim, Robert France, Sudipto Ghosh, Eunjee Song
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Cost-effective development of large, integratedcomputer-based systems can be realized through systematicreuse of development experiences throughout thedevelopment procss. In this paper we describe a techniquefor representing reusable modeling experiences. The techniqueallows developers to express domain-specific designpatterns as a sub-language of the modeling language,the UML. Use of the sub-language to build application-specificUML models results in the reuse of the embeddeddesign experiences. We use a notation called the (meta-)Role-Based Modeling Language (RBML) to define UMLsub-languages. A (meta-)Role Model is a specializationof the UML (Unified Modeling Language) meta-model,that is, it determines a sub-language of the UML. We showhow RBML can be used to define domain-specific designpatterns.Keywords: Object-oriented design models, role-basedmodeling language, software reuse, UML
MacIP Sources and Applications
Authors: Mark Sherman, Tim Maroney
Venue:  (1986)

The MacIP set consists of three disks, all single-sided, MFS formatted. Two disks contain the Lisa Pascal/Lisa Assembler sources for the network libraries and application programs; the third disk contains the runnable applications along with an AppleTalk configured system. The current version by Tim Maroney fixes all reported bugs mentioned in the MacIP Technical Report and includes the TCP library and Telnet program.
Unitals and codes
Authors: Anton Betten, Dieter Betten, Vladimir D. Tonchev
Venue: Discrete Mathematics (2003)

A program is outlined for the enumeration of unital 2-(28,4,1) designs that uses tactical decompositions defined by vectors of certain weight in the dual binary code of a design. A class of designs with a spread that covers a codeword of weight 12 is studied in detail. A total of 909 nonisomorphic designs are constructed that include the classical hermitian and Ree unitals, as well as many other of the 145 previously known 2-(28,4,1) designs.
Approximating Perfect Failure Detectors in Asynchronous Distributed Systems
Authors: Laura Sabel
Venue:  (1995)

Systems that provide group membership services (e.g., Isis) can be used to solve many canonical problems in distributed systems, such as Consensus and Leader Election. However, solving these problems has been shown to require {\em failure detectors} of various strengths, all of which are impossible to implement in an asynchronous system. It has been shown that it is possible to solve Consensus in an asynchronous distributed system using a very weak failure detector. However, existing group membership systems do not appear to implement this type of failure detector. Furthermore, there are other problems that can be solved with group membership services, such as Leader Election, that are harder than Consensus and cannot be solved without a perfect failure detector. This leads to an apparent contradiction: how can provably impossible problems be solved in existing group membership systems? In this dissertation, we investigate {\em approximations} to perfect failure detectors in order to obtain acceptable and practical solutions to otherwise-impossible problems such as Election. We argue that approximating a perfect failure detector yields approximate solutions to these problems, and define a notion of approximation that yields solutions that are useful in practice. We give a formal specification of an approximately-perfect failure detector, give two protocols that implement our approximation, and derive upper bounds on the number of tolerable failures for any such protocol. The approximately-perfect failure detector presented in this dissertation is similar to that used in Isis; this implies that the failure detector implemented in group membership services such as Isis are actually approximately-perfect failure detectors, and that the resulting solutions to Consensus, Election, and other problems are approximate solutions. Furthermore, the protocols that implement our specification are very simple and can be easily implemented. Such an implementation could be used in existing or future group membership services, or by other systems programmers for whom group membership services are not necessary but for whom failure detection would be useful.
Parallel Sparse Cholesky Factorization
Authors: Hjalmtyr Hafsteinsson
Venue:  (1988)

As sequential computers seem to be approaching their limits in CPU speed there is increasing interest in parallel computers. This development calls for parallel algorithms for problems that may already have efficient sequential algorithms. The problem of solving a linear system of equations arises in many areas of science and engineering. Quite often each equation only involves a small number of the variables. In that case the linear systems is sparse. If we can take advantage of the sparsity we can solve much larger systems. Consider the linear system $Ax = b$, where $A$ is a sparse symmetric positive define matrix. A common approach to solving this system is to use Cholesky factorization. Algorithms that solve sparse linear systems using the Cholesky factorization usually consist of the following steps. First the matrix $A$ is permuted in order to get a sparse Cholesky factor $L$. Then there is the symbolic factorization of $A$ to determine the nonzero structure of $L$. Finally the value of $L$ is calculated in the numeric factorization phase and $x$ is computed by solving the triangular systems $Ly = b$ and $L^{T}x = y$. In this thesis we present parallel algorithms for all the above steps except for the permutation step. Before the symbolic factorization we compute the elimination tree of $A$. Elimination trees have many applications in sparse matrix computations. Therefore our parallel algorithm to find elimination trees is important in its own right. The algorithm we present for symbolic factorization then uses the elimination tree to compute the nonzero structure of $L$. We next present a parallel algorithm to compute the numeric factorization of $A$. It runs in time proportional to the height of $A$''s elimination tree times a log factor. We also show how that algorithm can be converted into an NC algorithm (i.d., an algorithm that runs in polygarithmic time) by use of fast algorithms for dense matrices. Finally we demonstrate a parallel algorithm to solve sparse triangular systems of equations. There again we show a version that runs in time related to the height of the elimination tree and a version that is an NC algorithm.
A lower bound for randomized searching on m rays
Authors: Sven Schuierer
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

We consider the problem of on-line searching on m rays. A point robot is assumed to stand at the origin of m concurrent rays one of which contains a goal g that the point robot has to find. Neither the ray containing g nor the distance to g are known to the robot. The only way the robot can detect g is by reaching its location. We use the competitive ratio as a measure of the performance of a search strategy, that is, the worst case ratio of the total distance DR traveled by the robot to find g to the distance D from the origin to g.We present a new proof of a tight lower bound of the competitive ratio for randomized strategies to search on m rays. Our proof allows us to obtain a lower bound on the optimal competitive ratio for a fixed m even if the distance of the goal to the origin is bounded from above.Finally, we show that the optimal competitive ratio converges to 1 +2(eα- 1)/α2 m ∼ 1 + 2.1.544 m, for large m where α minimizes the function(ex- 1)/x2.
IRM Enforcement of Java Stack Inspection
Authors: Ulfar Erlingsson, Fred B Schneider
Venue:  (2000)

Two implementations are given for Java''s stack-inspection access-control policy. Each implementation is obtained by generating an inlined reference monitor (IRM) for a different formulation of the policy. Performance of the implementations is evaluated, and one is found to be competitive with Java''s less-flexible, JVM-resident implementation. The exercise illustrates the power of the IRM approach for enforcing security policies.
LOOP - A Language for LP-based AI Applications
Authors: Alin Suciu, Kalman Pusztai, Tudor Muresan, Zsolt Simon
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

One major drawback of logic programming, particularly Prolog, is the lack of mechanisms for structuring knowledge (i.e. program clauses). This makes programming-in-the-large a difficult task even using the module system. To overcome this, various attempts were made to extend the logic programming paradigm with object-oriented features. We introduced LOOP, a class-based, logic and object-oriented programming language, centered around the view of objects as persistent mutable terms with backtrackable state, which extends Prolog in a simple and straightforward fashion. To validate our ideas we recently developed a prototype based on expansion to Prolog code, implemented in Sicstus Prolog, a state of the art Prolog system which supports mutable terms with baktrackable destructive assignment.
A Multimedia Learning Environment for Creative Engineering Design
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The purpose of the paper is to design an asynchronous on-line and off-line multimedia learning environment for the learners. The learners include those students in school and graduate people in work. It provides the learners an interesting and vivid environment for self study. The learners are able to systematically study the selected course whatever/whenever they like. The environment includes text, graphics, pictures, audio and video in order to provide the users an easy and comfortable learning environment. The body of the subjects is well-designed by both the software tools and hardware facilities, such as hypermedia hierarchy, motion pictures, Video on Demand (VOD) films, and the equipment for on-line interaction. The software is popularization and freely shares with other users in the net. Creative Engineering Design (CED) is selected as a pioneer in developing such an object-oriented lesson in the environment. The other object lesson, the cam follower interactive instruction system is also introduced in the paper.
XML and Perl
Authors: Mark Riehl, Llya Sterin
Venue:  (2002)

:If you are a Perl programmer looking to explore Perl's XML capabilities or an XML developer with a basic understanding of Perl, this book will provide you with all the tools required for XML processing with Perl. XML and Perl teaches you to create portable, powerful, and extensible applications when you use XML and Perl together. You'll also learn to customize your XML processing facilities to accomplish unique tasks.Authors Mark Riehl and Ilya Sterin, who have written Perl XML modules and administer the official Perl XML web site (www.perlxml.net), have filled this book with practical code samples and exercises that will help you test drive your new knowledge. With this book, you'll quickly see the advantages of using XML and Perl together, and you'll be able to perform even complicated tasks more easily with powerful Perl XML modules.
An Agent-Based Approach for Interpreting Medical Images
Authors: Mihail Popescu, Yi Shang
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper, we present an agent-based approach for medical image interpretation. The system is based on the concept of active fusion for image recognition and is composed of two major types of intelligent agents: radiologist agents and patient representative agents. A patient representative agent takes images from the patient through a Web-based interface, asks for multiple opinions from radiologist agents in interpreting them, and then integrates the opinions for the user. A radiologist agent decomposes the image interpretation task into smaller subtasks, uses multiple agents to solve the subtasks, and combines the solutions to the subtasks intelligently to solve the image interpretation problem.
Application of Security Principles to Integration of Enterprise, System and Software Engineering Methods
Authors: Dennis A. Weiss, Samuel E. Moore, James A. Robbins
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

A considerable amount of research and development effort by various engineering communities has been directed towards the engineering of complex Information Technology (IT) systems. As a result, there are a number of non-proprietary processes, methods and tools designed to support the engineering of complex systems. A critical limitation has been the lack of examples relevant to specialist domains, particularly for secure IT systems. This paper summarizes the results of a study funded by the Government of Canada's Communication Security Establishment to apply security principles throughout a development life cycle for a sample IT system. The study demonstrates how traditional development methods are tailored to ensure security needs are included and how different engineering methods and design criteria are integrated and managed during IT system development.
On the Region Proximity in Metric Spaces
Authors: Paolo Ciaccia, Fausto Rabitti, Pasquale Savino, Pavel Zezula
Venue:  (1998)

The problem of defining a measure of proximity for regions of generic metric spaces, as needed for designing and implementing indexes for similarity retrieval, is investigated. Though the proposed probabilistic approach is valid for arbitrary regions, specific ready-to-use formulas are developed for the important case of ball regions, considering both the uniform and the actual distribution of objects'' pair-wise distances. The theoretical results are verified by experiments. Possible applications of the approach to practical data and index management problems are discussed. EMAIL:: savino@iei.pi.cnr.it
Reactive Web Agents with Open Constraint Programming
Authors: Kenny Q. Zhu, Wee-Yeh Tan, Andrew E. Santosa, Roland H. C. Yap
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

This paper describes a new programming system for writing web applications with reactive agents, i.e. the agents can have complex responses which depend on how the environment changes. Our prototype system is based on the Open Constraint Programming framework using the Constraint Logic Programming language CLP(R). The benefit of reactive web agents is that activities of agents can be coordinated and synchronized using a common store and the agents can themselves be written as a system of interacting rules. Our thesis is that such a system makes it easy to write powerful reactive applications. We use a stock trading system to illustrate our reactive agents. Some details of the implementation are also given.
{\bf (Revised to CS-1994-16.)} SATCHMORE: Satchmo with Relevancy
Authors: W D Loveland, W D Reed, S D Wilson
Venue:  (1993)

We introduce a relevancy detection algorithm to be used in conjunction with the SATCHMO prover. The version of SATCHMO considered here is essentially a bidirectional prover, utilizing Prolog (back chaining) on Horn clauses and forward chaining on non-Horn clauses. Our extension, SATCHMORE (SATCHMO with RElevancy), addresses the major weakness of SATCHMO: the uncontrolled use of forward chaining. By marking potentially relevant clause head literals, and then requiring that all the head literals be marked relevant (be ``totally relevant'''') before a clause is used for forward chaining, SATCHMORE is able to guide the use of these rules. Furthermore, the relevancy testing is performed without extending the proof search beyond what is done in SATCHMO. In addition, a very simple implementation of the extended SATCHMO can be written in Prolog. We describe our relevancy testing approach, present the implementation, prove soundness and completeness, and provide examples which demonstrate the power of relevancy testing.
Towards interest-based negotiation
Authors: Iyad Rahwan, Liz Sonenberg, Frank Dignum
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Negotiation is essential in settings where agents have conflicting interests and a desire to cooperate. In many approaches, agents are assumed to have pre-set, fixed preferences, and complete awareness of the space of possible outcomes. Such strong conditions are often not satisfied. In this paper, we argue that since preferences are adopted to pursue particular goals, one agent may influence another agent's preferences by discussing the underlying motivations and interests behind adopting the associated goals. We identify concepts that seem essential for supporting this type of dialogue. In particular we demonstrate that arguing about beliefs needs to be complemented by arguing about goals, and we begin an analysis of dialogue moves involving goals.
Software maintenance in Hong Kong
Authors: S. W. L. Yip
Venue: Proceedings of the International Conference on Software Maintenance (1995)

In order to find out the state of software maintenance in Hong Kong, we have conducted a questionnaire survey, supplemented by telephone interviews and industrial visits. Our results indicate that, in Hong Kong, about 66% of the total software life cycle cost is spent on software maintenance. The average application system is about 5.1 years old, consisting of 577 programs and 308,000 lines of code. The most often cited problems in software maintenance are staff turnover, poor documentation and changing user requirements. We also observed that software maintenance work has not been given proper recognition. This paper attempts to contrast our survey findings with that of a similar survey conducted in USA. We also present some initial results of a series of experiments to compare OO with 4GL and conventional development approaches.
A Survey on Software Quality Assurance - A Malaysian Perspective
Authors: Siew Hock Ow, Mashkuri Hj. Yaacob
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

This paper presents the findings of a survey on the aspect of software quality assurance (SQA). Fifty-two sets of questionnaires were collected for analysis. Brief discussions on the survey methodology, data processing and analysis are included. Highlights of this survey encompass the trends of SQA investments, QA problems encountered, the tools being used and their weaknesses as well as the people who are involved in SQA activities.
On the Method of Weighting for Equality Constrained Least Squares Problems
Authors: Charles Van Loan
Venue:  (1984)

The generalized singular value decomposition is used to analyze the problem of minimizing $||Ax b||_{2}$ subject to the constraint Bx = d. A byproduct of the analysis is a new iterative procedure that can be used to improve an approximate solution obtained via the method of weights. All that is required to implement the procedure is a single QR factorization. These developments turn out to be of interest when A and B are sparse and for the case when systolic architectures are used to carry out the computations.
The Aurora Abstract Machine and its Emulator
Authors: Mats Carlsson, Peter Szeredi
Venue:  (1990)

Aurora is a prototype or-parallel implementation of the full Prolog language for shared-memory multiprocessors, developed as part of an informal research collaboration known as the "Gigalips Project". This report describes the abstract machine of the implementation, expressed in terms of a Prolog engine adapted for or-parallel execution by means of the SRI model. An algorithmic interface defining the communication between the engine and scheduler components of each Aurora process is described, and enables different engine and scheduler components to be used interchangeably. Both the in-terface and the engine are fundamentally revised versions of those used in previous generations of the implementation
Overload Cntrol of SCP in Advanced Intelligent Network with Fairness and Priority
Authors: Yong Lee, Joo Seok Song
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

In this paper we propose two mechanisms for overload control of SCP in AIN ; continuous gapping method and new arrival gapping method. They are all interactive mechanisms in which an SCP and SSPs exchange load information for overload control. These mechanisms are based on the general ACG and apply different call gapping times to each SSP under the fairness scheme. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. Fairness about the probability of rejection is maintained with the same value on all SSPs. On the priority scheme, new arrival gapping method has better priority achievement than continuous gapping method.
CORBA Application Tailored Manager for Quality of Service Support
Authors: Didier Le Tien, Olivier Villin, Christian Bac
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

We describe in this paper a component for supporting Quality of Service (QoS) in object environments. This component, called the micro QoS manager (mu QoS-Mngr), is associated to an application and handles all aspects of static and dynamic QoS management related to that application.End to end QoS management is provided through the co-operation of the mu QoS-Mngr with a set of object resource managers (OR-Mngr) each of which is responsible for the QoS management of a specific resource, including, admission control, real-time scheduling and monitoring functionalities. QoS renegotiation is achieved through application process monitoring and communication with the OR-Mngr.This paper focuses on the micro QoS manager, and gives an overview of its implementation in a CORBA platform in the context of a video on demand application.
Selective Text Traversal
Authors: Gerard Salton, Amit Singhal
Venue:  (1995)

In information retrieval and text processing, the size of the available databases and text collections has grown enormously in the past few years, and users find it difficult to cope with the amount of text that is potentially of interest. As a result, there is growing interest in approaches capable of breaking down large texts into smaller constituent units, and in using short text passages for storage and retrieval purposes. Methods are described in this study for identifying important text passages in large texts, and suggestions are made for implementing useful text reading and text traversal strategies that provide selective text access in accordance with user needs. Some evaluation results for selective text access are appended.