ppxscal/embedding_network huggingface dataset:
Learning to match ontologies on the Semantic Web
Authors: AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedro Domingos, Alon Halevy
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings between them. Manually finding such mappings is tedious, error-prone, and clearly not possible on the Web scale. Hence the development of tools to assist in the ontology mapping process is crucial to the success of the Semantic Web. We describe GLUE, a system that employs machine learning techniques to find such mappings. Given two ontologies, for each concept in one ontology GLUE finds the most similar concept in the other ontology. We give well-founded probabilistic definitions to several practical similarity measures and show that GLUE can work with all of them. Another key feature of GLUE is that it uses multiple learning strategies, each of which exploits well a different type of information either in the data instances or in the taxonomic structure of the ontologies. To further improve matching accuracy, we extend GLUE to incorporate commonsense knowledge and domain constraints into the matching process. Our approach is thus distinguished in that it works with a variety of well-defined similarity notions and that it efficiently incorporates multiple types of knowledge. We describe a set of experiments on several real-world domains and show that GLUE proposes highly accurate semantic mappings. Finally, we extend GLUE to find complex mappings between ontologies and describe experiments that show the promise of the approach.
Ghost fluid method for strong shock impacting on material interface
Authors: T. G. Liu, B. C. Khoo, K. S. Yeo
Venue: Journal of Computational Physics (2003)

It is found that the original ghost fluid method (GFM) as put forth by Fedkiw et al. [J. Comp. Phys. 152 (1999) 457] does not work consistently and efficiently using isentropic fix when applied to a strong shock impacting on a material interface. In this work, the causes for such inapplicability of the original GFM are analysed and a modified GFM is proposed and developed for greater robustness and consistency. Numerical tests also show that the modified GFM has the property of reduced conservation error and is less problem-related.
WebContext: remote access to shared context
Authors: Robert G. Capra,  III, Manuel A. Pérez-Quiñones, Naren Ramakrishnan
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

In this paper, we describe a system and architecture for building and remotely accessing shared context between a user and a computer. The system is designed to allow a user to browse web pages on a personal computer and then remotely make queries about information seen on the web pages using a telephone-based voice user interface.
Using modulization approach to design instructional systems for computer literacy courses
Authors: Kuan C. Chen
Venue: Current issues in IT education (2003)

In this chapter, the guiding principles of the modularization content arrangement that some instructors use is offered. Eight planning steps in module instructional design are summarized. A general strategy of these principles and applications in a case study is discussed in this chapter as well. A new modularization approach in instructional design, defining the course goals and arranging the course content, are two important issues for instructors. The author hopes the process of the module instructional design through essential knowledge and skills in the computer literacy course development will not only be a valuable synthesizing experience for instructors, but also the modularization approach may be preferable to students with a variety of backgrounds.
A method for the automatic deduction of priority lists of entities and tasks from the design knowledge
Authors: S. P. Drakatou, A. J. Dentsoras
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

This paper presents a method for the automatic deduction of priority lists of input information as well as for the extraction of task relations from the available design knowledge. The method is based on multiple extensive searches of the design space and produces a final priority list for the instantiation of the primary design entities. If followed, this list ensures the generation of the most decisive design information at the very beginning of the design process. Additionally, the method can produce a priority list of design tasks, which represents the order of completion of these tasks. Finally, it offers a representation platform for tracking the evolution of the design process. First, a brief overview of the current literature is presented, after which the method is presented in detail. Entities, descriptors, and tasks are used for the representation of the design knowledge. They are linked in order to form multiple design relations, formally represented by digraphs. Simple set relations and graph theories are used as mathematical background to the method. Design experience is also taken into account through a weighting process of the primary design entities. Finally, an example of a belt conveyor design is presented, followed by a discussion of the results and some general conclusions. The method may be considered as a design-assisting tool that dynamically processes pieces of design knowledge and suggests corresponding design paths. Additionally, it relates the design tasks in a ordered form. Its extension&mdash;currently under elaboration&mdash;is expected to treat systematically the problem of identifying and handling the design knowledge inconsistencies.
The emergence of reasons conjecture
Authors: J. B. Paris, A. Vencovská
Venue: Journal of Applied Logic (2003)

In this paper we show how the maxent paradigm may be used to produce an inductive method (in the sense of Carnap) applicable to a wide class of problems in inductive logic. We then state a conjecture about the answers given by this method and prove the conjecture in a particular case which extends all previous partial confirmations.
Equistable chordal graphs
Authors: Uri N. Peled, Udi Rotics
Venue: Discrete Applied Mathematics (2003)

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a chordal graph is equistable if and only if every two adjacent non-simplicial vertices have a common simplicial neighbor.
Clustering documents in a web directory
Authors: Giordano Adami, Paolo Avesani, Diego Sona
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Hierarchical categorization of documents is a task receiving growing interest due to the widespread proliferation of topic hierarchies for text documents. The worst problem of hierarchical supervised classifiers is their high demand in terms of labeled examples, whose amount is related to the number of topics in the taxonomy. Hence, bootstrapping a huge hierarchy with a proper set of labeled examples is a critical issue. In this paper, we propose some solutions for the bootstrapping problem, implicitly or explicitly using a taxonomy definition: a baseline approach where documents are classified according to class labels, and two clustering approaches, where training is constrained by the a-priori knowledge of the taxonomy structure, both at terminological and topological level. In particular, we propose the TaxSOM model, that clusters a set of documents in a predefined hierarchy of classes, directly exploiting the knowledge of both their topological organization and their lexical description. Experimental evaluation was performed on a set of taxonomies taken from the Google Web directory.
Net Buffering in the Presence of Multiple Timing Views
Authors: Rajeev Murgai
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Several modern complex digital designs involve multiple clock domains.For instance, it is not uncommon to see telecommunicationchips having threee to thirty clock domains.Timing views are a wayto represent multiple sets of timing information at a circuit node.In this paper, we address the optimization problem of net bufferingin the presence of multiple timing views.To the best of our knowledge,this is the first time that this problem has been addressedin the literature.We propose a technique which considers simultaneouslyall the timing views at a node and is efficient, effective, and robust.Experimental results on large industrial designs showthat our technique yields better quality results and runs up to 5.75times faster as compared to an iterative technique which works onone timing view at a time.
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
Authors: Mary Cryan, Martin Dyer
Venue: Journal of Computer and System Sciences (2003)

We consider the problem of counting the number of contingency tables with given row and column sums. This problem is known to be #P-complete, even when there are only two rows (Random Structures Algorithms 10(4) (1997) 487). In this paper we present the first fully polynomial randomized approximation scheme for counting contingency tables when the number of rows is constant. A novel feature of our algorithm is that it is a hybrid of an exact counting technique with an approximation algorithm, giving two distinct phases. In the first, the columns are partitioned into "small" and "large". We show that the number of contingency tables can be expressed as the weighted sum of a polynomial number of new instances of the problem, where each instance consists of some new row sums and the original large column sums. In the second phase, we show how to approximately count contingency tables when all the column sums are large. In this case, we show that the solution lies in approximating the volume of a single convex body, a problem which is known to be solvable in polynomial time (J. ACM 38 (1) (1991) 1).
Collecting data for software reliability analysis and modeling
Authors: Joe Palma, Jeff Tian, Peng Lu
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

This paper studies the collection of appropriate data for software reliability analysis and modeling. Our approach satisfies the data requirements for various reliability models under the constraints imposed by our project environment. These data-model relations and data - environment constraints are characterized to provide a tentative roadmap for data collection. In the process of collecting data for a group of projects in the system testing stage, we encountered various problems and devised solutions and improvement initiatives to deal with them. We summarize our experience in this paper so that similar initiatives in quality improvement under similar environments can be implemented more effectively.
An Interview with Kathy Schroeder: the plot quickens
Authors: Kathy Schroeder
Venue: Ubiquity (2003)

New book tells the inside story of the development and innovative marketing of Intuit's automated personal finance software. Author Kathy Schroeder explains it all.
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
Authors: Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter
Venue: Combinatorics, Probability and Computing (1998)

For any integer k, we prove the existence of a uniquely k-colourable graph of girth at least g on at most k12(g+1) vertices whose maximal degree is at most 5k13. From this we deduce that, unless NP=RP, no polynomial time algorithm for k-Colourability on graphs G of girth g(G)&ge;log&#x2223;G&#x2223;&#x002F;13logk and maximum degree &Delta;(G)&le;6k13 can exist. We also study several related problems.
Factor models for multivariate count data
Authors: Michel Wedel, Ulf Böckenholt, Wagner A. Kamakura
Venue: Journal of Multivariate Analysis (2003)

We develop a general class of factor-analytic models for the analysis of multivariate (truncated) count data. Dependencies in multivariate counts are of interest in many applications, but few approaches have been proposed for their analysis. Our model class allows for a variety of distributions of the factors in the exponential family. The proposed framework includes a large number of previously proposed factor and random effect models as special cases and leads to many new models that have not been considered so far. Whereas previously these models were proposed separately as different cases, our framework unifies these models and enables one to study them simultaneously. We estimate the Poisson factor models with the method of simulated maximum likelihood. A Monte-Carlo study investigates the performance of this approach in terms of estimation bias and precision. We illustrate the approach in an analysis of TV channels data.
Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
Authors: Viorica Sofronie-Stokkermans
Venue: Journal of Symbolic Computation (2003)

We establish a link between the satisfiability of universal sentences with respect to classes of distributive lattices with operators and their satisfiability with respect to certain classes of relational structures. This justifies a method for structure-preserving translation to clause form of universal sentences in such classes of algebras. We show that refinements of resolution yield decision procedures for the universal theory of some such classes. In particular, we obtain exponential space and time decision procedures for the universal clause theory of (i) the class of all bounded distributive lattices with operators satisfying a set of (generalized) residuation conditions, and (ii) the class of all bounded distributive lattices with operators, and a doubly-exponential time decision procedure for the universal clause theory of the class of all Heyting algebras.
On the role of human mortality in information system security: from the problems of descriptivism to non-descriptive foundations
Authors: Mikko T. Siponen
Venue: Advanced topics in information resources management (2003)

The question of whether ethical theories appealing to human morality can serve as a means of protection against information system security breaches has been recognized by several authors. The existing views concerning the role of ethics in information systems security can be divided into two categories. These are (1) expressions about the use of human morality and (2) arguments claiming that the use of ethics is useless or, at best, extremely restricted. However, the former views are general statements lacking concrete guidance and the latter viewpoint is based on cultural relativism, and can be thus classified as descriptivism. This paper claims that the use of ethical theories and human morality is useful for security, particularly given that Hare's Overriding thesis has validity--though it has its limitations, too. This paper further argues that descriptivism (including the doctrine of cultural relativism) leads to several problems, contradictions and causes detrimental effects to our well-being (and security). Therefore, an alternative approach to using ethics in minimizing security breaches that is based on nondescriptive theories is proposed. The use of non-descriptivism will be demonstrated using Rawls' concept of the "veil of ignorance." The limitations of non-descriptivism, and appealing to human morality in a general sense, will also be discussed. Finally, suggestions for future research directions are outlined.
Spatial Interest Pixels (SIPs): Useful Low-Level Features of Visual Media Data
Authors: Qi Li, Jieping Ye, Chandra Kambhamettu
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Visual media data such as an image is the raw data representationfor many important applications. The biggestchallenge in using visual media data comes from the extremelyhigh dimensionality. We present a comparativestudy on spatial interest pixels (SIPs), including eight-way(a novel SIP miner), Harris, and Lucas-Kanade, whose extractionis considered as an important step in reducing thedimensionality of visual media data. With extensive casestudies, we have shown the usefulness of SIPs as the low-levelfeatures of visual media data. A class-preserving dimensionreduction algorithm (using GSVD) is applied tofurther reduce the dimension of feature vectors based onSIPs. The experiments showed its superiority over PCA.
Fast contouring of solutions to partial differential equations
Authors: Emma L. Bradbury, Wayne H. Enright
Venue: ACM Transactions on Mathematical Software (TOMS) (2003)

The application of Differential Equation Interpolants (DEIs) to the visualization of the solutions to Partial Differential Equations (PDEs) is investigated. In particular, we describe how a DEI can be used to generate a fine mesh approximation from a coarse mesh approximation; this fine mesh approximation can then be used by a standard contouring function to render an accurate contour plot of the surface. However, the standard approach has a time complexity equivalent to that of rendering a surface plot, O(fm2) for each element of the coarse mesh, (where fm is the ratio of the width of the coarse mesh to the fine mesh). To address this concern three fast contouring algorithms are proposed that compute accurate contour lines directly from the DEI, and have time complexity at most O(fm) for each coarse mesh element.
Circuit emulation services over ethernet-part 2: prototype and experimental results
Authors: James Aweya
Venue: International Journal of Network Management (2004)

This paper describes a prototype implementation and experimental results for unstructured circuit emulation service (UCES) of T3 data stream over Ethernet. As explained in Part 1 of this paper, packet-switched networks such as Ethernet are not designed to transport TDM data and so have no inherent clock distribution and synchronization mechanisms. Thus, to allow the frequency of the source TDM stream to be regenerated at the receiver, the prototype employed the clock synchronization scheme described in Part 1 of this paper. Our experiments showed that the recovered clock conforms to ITU-T G.824 requirements even for networks that introduce high jitter and packet loss.
sendmail Cookbook
Authors: Craig Hunt
Venue:  (2003)

The sendmail Cookbook provides step-by-step solutions for the administrator who needs to solve configuration problems fast. Each recipe in the sendmail Cookbook outlines a configuration problem, presents the configuration code that solves that problem, and then explains the code in detail. The book also provides lots of new material that doesn't get much coverage elsewhere--STARTTLS and AUTH are given entire chapters, and LDAP is covered in recipes throughout the book.
Justifying the Use of a Bespoke Management System for Experimental Research on Programmable Test Beds
Authors: A. Hughes
Venue: BT Technology Journal (2004)

It is the belief of our research group that the use of a bespoke management system with programmable routers makes experimental evaluation of router software more accessible to network researchers. This paper justifies the need for such a system, and that the results that can be obtained using it are valid. Additionally, case studies are presented that will allow us to show experimentally that our system does in fact deliver the functionality outlined in previous work.
Simple offset assignment in presence of subword data
Authors: Bengu Li, Rajiv Gupta
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Many embedded architectures support indirect addressing mode with autoincrement/autodecrement. By maximizing the use of this mode, generation of explicit instructions for performing address arithmetic can be avoided and thus reductions in code size and improvements in performance are achieved. Bartley [2] and Liao et al. [16] developed a method for finding a storage layout for program variables so that the use of autoincrement/autodecrement could be maximized. They introduced the Simple Offset Assignment (SOA) problem and solved it using a Path Cover (PC) formulation.We observe that many media and network processing applications make extensive use of subword data. Therefore, for such applications, by packing multiple subword variables into a single word, we can generate storage layouts that further reduce the cost of address arithmetic in two ways. First the need for address arithmetic is reduced as variables that are packed together share the same address. Second opportunities for using autoincrement andautodecrement instructions are increased as layouts are now possible which place a variable adjacent to more than two variables. This approach has become feasible because of the recent trend in embedded processor design which allows subword variables that are packed together to be accessed and manipulated without incurring performance penalty. We introduce the SubWord Offset Assignment (SWOA) problem and solve it using a Path Cover with Node Coalescing (PCwNC) formulation. Node coalescing corresponds to packing of multiple subword variables into a single word while path covering corresponds to placement of variables in adjacent memory locations to enable the use of autoincrement/autodecrement. We present three heuristics to solve the PCwNC problem. Experiments show that when the program is optimized for code size, the three proposed algorithms achieve 26%, 26.9% and 32% reduction in the number of static explicit address arithmetic instructions over Liao et al.'s algorithm. The algorithms also achieve 14.5%, 22.1%and 22.7% reduction in stack frame size. If the program is optimized for performance, the algorithms achieve 24.3%, 24.7% and 30.2% reduction in the dynamic instruction count of explicit address arithmetic instructions.
A Security Characterisation Framework for Trustworthy Component Based Software Systems
Authors: Khaled Khan, Jun Han
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

This paper explores how to characterise securityproperties of software components, and how to reasonabout their suitability for a trustworthy compositionalcontract. Our framework provides an explicit opportunityfor software composers as well as software components totest a priori security properties of software components ina system composition. The proposed framework uses logicprogramming as a tool to represent security properties ofatomic components and reason about their compositionalmatching with other components. This enables softwarecomponents as well as composers to 'test' possiblematches and mismatches between the security propertiesof the candidate components and the securityrequirements of the enclosing application system.
Electroacoustic voices in vocal performance art&mdash;a gender issue?
Authors: Theda Weber-Lucks
Venue: Organised Sound (2003)

In my dissertation Gender Perspectives in Vocal Performance Art, I examine the history and aesthetics of the genre. The core of my work is a vocal database that focuses especially on the extended vocal techniques of the natural voice. In this article, I concentrate on the electronic aspect of vocal performance art. While I provide a brief historical overview of the developments of vocal performance art and its technological developments from the 1970s to the 1990s, the central question of this article is whether gender patterns exist when these practices are combined with electronic sound technologies.