ppxscal/embedding_network huggingface dataset:
Where are the semantics in the semantic web?
Authors: Michael Uschold
Venue: AI Magazine (2003)

The most widely accepted defining feature of the semantic web is machine-usable content. By this definition, the semantic web is already manifest in shopping agents that automatically access and use web content to find the lowest air fares or book prices. However, where are the semantics? Most people regard the semantic web as a vision, not a reality--so shopping agents should not "count." To use web content, machines need to know what to do when they encounter it, which, in turn, requires the machine to know what the content means (that is, its semantics). The challenge of developing the semantic web is how to put this knowledge into the machine. The manner in which it is done is at the heart of the confusion about the semantic web. The goal of this article is to clear up some of this confusion.I explain that shopping agents work in the complete absence of any explicit account of the semantics of web content because the meaning of the web content that the agents are expected to encounter can be determined by the human programmers who hardwire it into the web application software. I therefore regard shopping agents as a degenerate case of the semantic web. I note various shortcomings of this approach. I conclude by presenting some ideas about how the semantic web will likely evolve.
Improving individual and organizational performance through communities of practice
Authors: David R. Millen, Michael A. Fontaine
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Organizations have been increasingly providing communities of workers with resources, time, physical space and collaborative technologies to enhance the exchange and flow of knowledge and information. In this paper the results of a multi-organizational survey of four work-based communities is presented. These results offer insights into the resource usage, time use for various work activities, and reported individual, community and organizational benefits. A descriptive model is developed and discussed to show the relationships between community participation, time use, and individual and organizational outcomes.
Graph algorithms for complex networks
Authors: Joseph Yannkae Wang
Venue:  (2003)

It has been observed that many real world networks have small diameters, skewed degree distributions, and highly clustered subgraphs. In this dissertation, we present a fast approximation algorithm for computing closeness centrality on such networks. We then consider a probabilistic model to the searchability problem. We also describe a steady state model for generating graphs with power law degree distributions. Finally, we give an easily computable graph property that captures clustering behaviors in networks.
A Consistency Model for Evaluating Distributed Virtual Environments
Authors: Suiping Zhou, Wentong Cai, Stephen J. Turner, Hanfeng Zhao
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

A Distributed Virtual Environment (DVE) enablesgeographically distributed clients to interact with eachother in a simulated environment. Due to the distributed architecture of DVEs, it is generally not easy to evaluate the performance of DVEs. In this paper,we propose a consistency model based on a metriccalled time-space inconsistency. The model relates ahuman participant's perception to the characteristicparameters of a DVE. Based on the model, the performance of a DVE can be easily evaluated without the actual execution of the DVE application, which isespecially useful in the designing stage of a DVE. APing-Pong game is developed to verify the proposedmodel. Experiment results show that the model is effective in evaluating the performance of the game.
Lenses in arrangements of pseudo-circles and their applications
Authors: Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
Venue: Journal of the ACM (JACM) (2004)

A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any two of its members intersect at most twice. A closed curve composed of two subarcs of distinct pseudo-circles is said to be an empty lens if the closed Jordan region that it bounds does not intersect any other member of the family. We establish a linear upper bound on the number of empty lenses in an arrangement of n pseudo-circles with the property that any two curves intersect precisely twice. We use this bound to show that any collection of n x-monotone pseudo-circles can be cut into O(n8/5) arcs so that any two intersect at most once; this improves a previous bound of O(n5/3) due to Tamaki and Tokuyama. If, in addition, the given collection admits an algebraic representation by three real parameters that satisfies some simple conditions, then the number of cuts can be further reduced to O(n3/2(log n)O(&alpha;(s(n))), where &alpha;(n) is the inverse Ackermann function, and s is a constant that depends on the the representation of the pseudo-circles. For arbitrary collections of pseudo-circles, any two of which intersect exactly twice, the number of necessary cuts reduces still further to O(n4/3). As applications, we obtain improved bounds for the number of incidences, the complexity of a single level, and the complexity of many faces in arrangements of circles, of pairwise intersecting pseudo-circles, of arbitrary x-monotone pseudo-circles, of parabolas, and of homothetic copies of any fixed simply shaped convex curve. We also obtain a variant of the Gallai--Sylvester theorem for arrangements of pairwise intersecting pseudo-circles, and a new lower bound on the number of distinct distances under any well-behaved norm.
Lateral neural model of binocular rivalry
Authors: Lars Stollenwerk, Mathias Bode
Venue: Neural Computation (2003)

This article introduces a two-dimensionally extended, neuron-based model for binocular rivalry. The basic block of the model is a certain type of astable multivibrator comprising excitatory and inhibitory neurons. Many of these blocks are laterally coupled on a medium range to provide a two-dimensional layer. Our model, like others, needs noise to reproduce typical stochastic oscillations. Due to its spatial extension, the noise has to be laterally correlated. When the contrast ratio of the pictures varies, their share of the perception time changes in a way that is known from comparable experimental data (Levelt, 1965; Mueller & Blake, 1989). This is a result of the lateral coupling and not a property of the single model block. The presentation of simple and suitable inhomogeneous stimuli leads to an easily describable perception of periodically moving pictures like propagating fronts or breathing spots. This suggests new experiments. Under certain conditions, a bifurcation from static to moving perceptions is predicted and may be checked and employed by future experiments. Recent "paradox" (Logothetis, 1999) observations of two different neuron classes in cortical areas MT (Logothetis & Schall, 1989) and V4 (Leopold & Logothetis, 1996), one that behaves alike under rivaling and nonrivaling conditions and another that drastically changes its behavior, are interpreted as being related to separate inhibitor neurons.
Category-based constraint logic
Authors: Răzvan Diaconescu
Venue: Mathematical Structures in Computer Science (2000)

The research reported in this paper exploits the view of constraint programming as computation in a logical system, namely constraint logic. The basic ingredients of constraint logic are: constraint models for the semantics (they form a comma-category over a fixed model of &lsquo;built-ins&rsquo;); generalized polynomials in the role of basic syntactic ingredient; and a constraint satisfaction relation between semantics and syntax. Category-based constraint logic means the development of the logic is abstract categorical rather than concrete set theoretical.We show that (category-based) constraint logic is an institution, and we internalize the study of constraint logic to the abstract framework of category-based equational logic, thus opening the door for considering constraint logic programming over non-standard structures (such as CPO's, topologies, graphs, categories, etc.). By embedding category-based constraint logic into category-based equational logic, we integrate the constraint logic programming paradigm into (category-based) equational logic programming. Results include completeness of constraint logic deduction, a novel Herbrand theorem for constraint logic programming characterizing Herbrand models as initial models in constraint logic, and logical foundations for the modular combination of constraint solvers based on amalgamated sums of Herbrand models in the constraint logic institution.
An approach to gathering undocumented information
Authors: Purvis M. Jackson, Sara E. Moss
Venue: ACM SIGCUE Outlook (1986)

The Software Engineering Institute is a Federally Funded Research and Development Center operated by Carnegie-Mellon University under contract to the Department of Defense. The views and conclusions contained in this paper are those of the authors and should not be construed as representing the official policies, either expressed or implied, of the Software Engineering Institute, Carnegie-Mellon University, or the Department of Defense.
Programming by steps
Authors: Raluca Oana Scarlatescu
Venue: Acta Cybernetica (2003)

The paper introduces a new method of software analysis, design and programming based on a different implementation of a logical flow: the sequence of steps is memorised in a database table, and each step is linked to a specific function inserted in a library. A main application manages the steps' information and runs the functions, until the steps are finished. The database management system stores the data of the each step and its precedence rules, the functions and their parameters, the static and dynamic values of the parameters, the errors, etc.The paper details the principles of the "Programming by steps", explains the reasons, which originally motivated the development of the method, and defines the principal requisites to build an application system. Future aspects of the implementation, as well as advantages/disadvantages of design, implementing and maintaining the system are stated.The paper includes a comparative analysis between the "Programming by steps" and another two methods of software engineering: the "Rapid Prototyping" and the "Component-based Design" Integrative comments and conclusive remarks are provided in the conclusion of the paper.
Computers and learning
Authors: William K. Purves, Mary E. Williams
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

The important questions for instructors to address concern what skills the student is to learn and how the student is to be motivated to acquire those skills. Questions about simulations, graphics tools, and the like are unimportant until the first two questions have been answered adequately. We discuss the role of explanation by students and describe a mechanism for motivating students to learn.
Book Review
Venue: Queue (2003)

Simon Singh Delacorte Press, 2000, $15.00, ISBN: 0-385-49532-3 This is a superb text. It is both comprehensive and accessible, which is an unusual combination. It introduces the reader to cryptography and cryptanalysis—subsets of the broader field of cryptology—which might be loosely referred to as the study of codes.
Database aggregation of imprecise and uncertain evidence
Authors: Bryan Scotney, Sally McClean
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Information from which knowledge can be discovered is frequently distributed due to having been recorded at different times or to having arisen from different sources. Such information is often subject to both imprecision and uncertainty. The Dempster-Shafer representation of evidence offers a way of representing uncertainty in the presence of imprecision, and may therefore be used to provide a mechanism for storing imprecise and uncertain information in databases. We consider an extended relational data model that allows the imprecision and uncertainty associated with attribute values to be quantified using a mass function distribution. When a query is executed, it may be necessary to combine imprecise and uncertain data from distributed sources in order to answer that query. A mechanism is therefore required both for combining the data and for generating measures of uncertainty to be attached to the (imprecise) combined data. In this paper we provide such a mechanism based on aggregation of evidence. We show first how this mechanism can be used to resolve inconsistencies and hence provide an essential database capability to perform the operations necessary to respond to queries on imprecise and uncertain data. We go on to exploit the aggregation operator in an attribute-driven approach to provide information on properties of and patterns in the data. This is fundamental to rule discovery, and hence such an aggregation operator provides a facility that is a central requirement in providing a distributed information system with the capability to perform the operations necessary for Knowledge Discovery.
Enhancing Levin's method for computing quadric-surface intersections
Authors: Wenping Wang, Ronald Goldman, Changhe Tu
Venue: Computer Aided Geometric Design (2003)

Levin's method produces a parameterization of the intersection curve of two quadrics in the form p(u) = a(u) ± d(u) √s(u), where a(u) and d(u) are vector valued polynomials, and s(u) is a quartic polynomial. This method, however, is incapable of classifying the morphology of the intersection curve, in terms of reducibility, singularity, and the number of connected components, which is critical structural information required by solid modeling applications. We study the theoretical foundation of Levin's method, as well as the parameterization p(u) it produces. The following contributions are presented in this paper: (1) It is shown how the roots of s(u) can be used to classify the morphology of an irreducible intersection curve of two quadric surfaces. (2) An enhanced version of Levin's method is proposed that, besides classifying the morphology of the intersection curve of two quadrics, produces a rational parameterization of the curve if the curve is singular. (3) A simple geometric proof is given for the existence of a real ruled quadric in any quadric pencil, which is the key result on which Levin's method is based. These results enhance the capability of Levin's method in processing the intersection curve of two general quadrics within its own self-contained framework.
Proxy Encryptions for Secure Multicast Key Management
Authors: Ritesh Mukherjee, J. William Atwood
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

With the advent of digital technologies and wideninginternet bandwidth in recent years there has been amarked rise in new multimedia services.These servicesinclude teleconferencing, pay-per-view, interactivesimulation, software updates and real-time delivery ofstock market information.Security in groupcommunications is an important requirement when thedelivery includes confidential or copyrighted data.Proposals for multicast security solutions so far arecomplex and often require trust in intermediatecomponents or are inefficient.In this paper we present aframework using proxy key encryptions for scalablemulticast key management.The solution guaranteesperfect forward and backward secrecy.It has very lowcomplexity and overhead.We propose a simple keymanagement solution and discuss its properties.
The Distributed Time-Triggered Simulation Scheme: Core Principles and Supporting Execution Engine
Authors: K. H. (Kane) Kim
Venue: Real-Time Systems (2004)

Distributed real-time simulation is a young technology field but its practice is under increasing demands. In recent years the author and his collaborators have been establishing a new approach called the distributed time-triggered simulation (DTS) scheme which is conceptually simple and easy to use but widely applicable. The concept was initiated in the course of developing a new-generation object-oriented real-time programming scheme called the time-triggered message-triggered object (TMO) programming scheme. Some fundamental issues inherent in distributed real-time simulation that were learned during recent experimental studies are discussed along with some approaches for resolving the issues. An execution engine developed to support both the TMOs engaged in control computation and the TMOs engaged in DTS is also discussed along with its possible extensions that will enable significantly larger-scale DTSs.
On the meaning of "but"
Authors: Pierre-Yves Schobbens
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

In this paper, a formalisation of exceptions to a general rule is proposed. It builds upon the modularisation of theories proposed by the algebraic specification approach, and preserves its engineering principles: modularity and compositionality. It relies on a model-theoretic definition of the "but" conjunctive, whose properties and implementations are explored.
Parallel scheduling of the PCG method for banded matrices rising from FDM/FEM
Authors: E. M. Ortigosa, L. F. Romero, J. I. Ramos
Venue: Journal of Parallel and Distributed Computing (2003)

An implicit time-linearized finite difference discretization of partial differential equations on regular/structured meshes results in an n-diagonal block system of algebraic equations, which is usually solved by means of the Preconditioned Conjugate Gradient (PCG) method. In this paper, an analysis of the parallel implementation of this method on several computer architectures and for several programming paradigms is presented. For three-dimensional regular/structured meshes, a new implementation of the PCG method with Jacobi preconditioner is proposed. For the computer architectures and number of processors employed in this study, it has been found that this implementation is more efficient than the standard one, and can be applied to narrow-band matrices and other preconditioners, such as, for example, polynomial ones.
A Low Power Pseudo-Random BIST Technique
Authors: Nadir Z. Basturkmen, Sudhakar M. Reddy, Irith Pomeranz
Venue: Journal of Electronic Testing: Theory and Applications (2003)

Peak power consumption during testing is an important concern. For scan designs, a high level of switching activity is created in the circuit during scan shifts, which increases power consumption considerably. In this paper we propose a pseudo-random BIST scheme for scan designs, which reduces the peak power consumption as well as the average power consumption as measured by the switching activity in the circuit. The method reduces the switching activity in the scan chains and the activity in the circuit under test by limiting the scan shifts to a portion of the scan chain structure using scan chain disable. Experimental results on various benchmark circuits demonstrate that the technique reduces the switching activity caused by scan shifts.
An Industrial Experience in Reverse Engineering
Authors: Daniel L. Moise, Kenny Wong
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

This paper describes a reverse engineering case studywith an industrial-scale software system. The steps followedin the study involved: establishing a more comprehensivedomain model for representing structural factsabout C/C++ software; adapting a robust C/C++ parserthat focuses on source code before the preprocessing stage;decomposing or clustering the extracted artifacts in variousways for different understanding needs; generating reportsto highlight anomalies in the system; and clarifyingknowledge about its conceptual architecture. Also summarizedare lessons learned from this experience.
From Proprietary to Open Source Tools in Information Systems Development
Authors: Nicolás Serrano, Sonia Calzada, Jose Mari Sarriegui, Ismael Ciordia
Venue: IEEE Software (2004)

Over the past decade, this university's academic management system evolved from a mainframe environment to a Windows-based client-server architecture and then to a Web environment. Aiming for independence from vendors, these developers adopted open-source solutions for their Web applications and were delighted with the results.
SPAM on the menu: the practical use of remote messaging in community care
Authors: Keith Cheverst, Karen Clarke, Dan Fitton, Mark Rouncefield, Andy Crabtree, Terry Hemmings
Venue: Issue 73-74 (June-September 2002) (2002)

This paper presents some early design work of the 'Digital Care' project, developing technologies to assist care in the community for user groups with different support needs. Our focus is on developing a SMS Public Asynchronous Messenger (SPAM) system for SMS messaging to a situated display in hostels for ex-psychiatric patients run by a charitable Trust. Such settings pose both methodological and design challenges. We face the methodological challenge to uncover requirements in such a sensitive domain by using ethnography, cultural probes and user workshops. The design challenge in this care setting is to provide support rather than new forms of dependence, and we report on early experiences of the deployed system.
On the design of knowledge management system for R&D organization: integration of process management and contents management
Authors: Yongtae Park, Yeongho Kim, Intae Kang
Venue: Knowledge management: current issues and challenges (2003)

This chapter proposes a framework for designing knowledge management system (KMS) for R&D organization. Broadly, KMS comprises two principal modules: a process management module to administer knowledge activities to generate and utilize knowledge, and a contents management module to deal with knowledge contents, input and output of knowledge activities. The two modules are then materialized through two operational systems." workflow management system (WFMS) for R&D process and R&D knowledge management system (RKMS) for R&D contents. As a building block to integrate the two systems, workflow-based knowledge map is suggested. The authors admit that the research is an exploratory proposal that suggests merely a conceptual scheme. Therefore, it is required to elaborate detailed procedure and materialize real system.
Vesselness enhancement diffusion
Authors: C. Cañero, P. Radeva
Venue: Pattern Recognition Letters (2003)

We propose a new anisotropic diffusion filter to enhance the local coherence of multiscale tubular structures on 2D images. The proposed filter uses a diffusion tensor with diffusion direction and strength determined by the local structure, and chooses automatically for each pixel the diffusion tensor scale. In this paper, we show how this filter enhances X-ray coronary angiographic images to facilitate vessel segmentation. To this aim, we present experimental results of the performance of the filter on synthetic and real images.
Promoting universal usability with multi-layer interface design
Authors: Ben Shneiderman
Venue: Proceedings of the 2003 conference on Universal usability (2003)

Increased interest in universal usability is causing some researchers to study advanced strategies for satisfying first-time as well as intermittent and expert users. This paper promotes the idea of multi-layer interface designs that enable first-time and novice users to begin with a limited set of features at layer 1. They can remain at layer 1, then move up to higher layers when needed or when they have time to learn further features. The arguments for and against multi-layer interfaces are presented with two example systems: a word processor with 8 layers and an interactive map with 3 layers. New research methods and directions are proposed.