19186309
Using an Aligned Ontology to Process User Queries
Ontologies have been developed for a number of knowledge domains as diverse as clinical terminology, photo camera parts and micro-array gene expression data. However, processing user queries over a set of overlapping ontologies is not straightforward because they have often been created by independent groups of expertise, each of them adopting different configurations for ontology concepts. A project being carried out at the Brazilian Corporation of Agricultural Research has produced ontologies in sub-domains such as beef cattle, dairy cattle, sheep and beans, among others. This paper focuses on an alignment method for these ontologies based on Formal Concept Analysis, a data analysis technique founded on lattice theory, and a strategy for processing user queries.
4850818
Analysis of Weblog Link Structure - A Community Perspective
In this paper, we report a two level study on weblog link structures. At the micro level, we carried out an in-depth investigation of individual weblogs. Our goal was to obtain some preliminary understanding of the different types of links that might indicate underlying communities of bloggers. Complete and detailed link data was collected from eight weblogs followed by a variety of analyses. The result shows that both incoming and outgoings follow Zipf like distribution in terms of the sources of those links. These suggest clustering patterns (communities) within the whole blogspace. We also examine the temporal aspects of weblogs. The average life span of a weblog entry is fairly long in most of our sample cases. In addition, analysis on individual comment authors shows that in average, active comment authors maintain a rather long relationship with a certain weblog. It provides evidence that historical data may be useful in understanding weblog communities. On a larger scale, we developed a program to collect complete link data from large number of interconnected weblogs and performed cluster analysis on it. Communities with common topics are successfully extracted using those link data.
18286129
Workflow Based Just-in-time Training
This paper focuses on the problem of information overload for newcomers in an organisation. We propose to address it by constructing a smart personal training assistant based upon workflow tools to drive temporal management of a just-intime workplace training system which will deliver a personalised and structured presentation of organisational documents.
17135898
The Economic Contribution of Software: An Alternative Perspective on the Productivity Paradox
The complex relationships between information technology investments and business value have been the focus of intensive research in recent years. There appears to be a discernible trend toward a more nuanced view in which the differential effects of the various categories of IT capital such as hardware, software, and their interactions with organizational factors are systematically investigated. As well, there is emerging evidence of accelerating investments in software and a greater shift toward “softwarization” (Langdon 2003) in which value addition is linked to combining flexible software with increasingly commoditized hardware. In this paper, we focus on the differential contributions of hardware and software capital and their interactions with labor capital. We use industry-level data to extend previous studies in three ways: (1) by using more recent data (1990 to 2002), (2) by focusing on IT-using industries in the private sector, and (3) by treating IT hardware and IT software as two distinct classes of IT capital. We adopt the commonly used log-linear Cobb Douglas production function approach. Our findings indicate that the impacts of software are significantly different in comparison with hardware and that the productivity benefits attributable to IT are largely due to the interactions between software and labor inputs. We conclude that software is the key to productivity growth in the IT-using world, and show that it can be used as the closest surrogate to represent business complementarities to IT in macro-level studies.
15297691
Aligning Ontologies and Evaluating Concept Similarities
An innate characteristic of the development of ontologies is that they are often created by independent groups of expertise, which generates the necessity of merging and aligning ontologies covering overlapping domains. However, a central issue in the merging process is the evaluation of the differences between two ontologies, viz. the establishment of a similarity measure between their concepts. Many algorithms and tools have been proposed for merging of ontologies, but the majority of them disregard the structural properties of the source ontologies, focusing mostly on syntactic analysis. This article focuses on the alignment of ontologies through Formal Concept Analysis, a data analysis technique founded on lattice theory, and on the use of similarity measures to identify cross-ontology related concepts.
35187915
Conceptual Data Modelling in Database Design: Similarities and Differences between Expert and Novice Designers
Abstract This paper explores the similarities and differences between experts and novices engaged in a conceptual data modelling task, a critical part of overall database design, using data gathered in the form of think-aloud protocols. It develops a three-level process model of the subjects' behavior and the differentiated application of this model by experts and novices. The study found that the experts focused on generating a holistic understanding of the problem before developing the conceptual model. They were able to categorize problem descriptions into standard abstractions. The novices tended to have more errors in their solutions largely due to their inability to integrate the various parts of the problem description and map them into appropriate knowledge structures. The study also found that the expert and novice behavior was similar in terms of modelling facets like entity, identifier, descriptor and binary relationship, somewhat different in modelling ternary relationship, but quite different in the modelling of unary relationship and category. These findings are discussed in relation to the results of previous expert-novice studies in other domains.
37350008
On Edge-Disjoint Spanning Trees in Hypercubes
In this note we give a construction for obtaining the maximum number of edge-disjoint spanning trees in a hypercube. The result has applications to multicast communication in wormhole-routed parallel computers.
8707443
Transactional memory coherence and consistency
In this paper, we propose a new shared memory model: transactional memory coherence and consistency (TCC). TCC provides a model in which atomic transactions are always the basic unit of parallel work, communication, memory coherence, and memory reference consistency. TCC greatly simplifies parallel software by eliminating the need for synchronization using conventional locks and semaphores, along with their complexities. TCC hardware must combine all writes from each transaction region in a program into a single packet and broadcast this packet to the permanent shared memory state atomically as a large block. This simplifies the coherence hardware because it reduces the need for small, low-latency messages and completely eliminates the need for conventional snoopy cache coherence protocols, as multiple speculatively written versions of a cache line may safely coexist within the system. Meanwhile, automatic, hardware-controlled rollback of speculative transactions resolves any correctness violations that may occur when several processors attempt to read and write the same data simultaneously. The cost of this simplified scheme is higher interprocessor bandwidth. To explore the costs and benefits of TCC, we study the characteristics of an optimal transaction-based memory system, and examine how different design parameters could affect the performance of real systems. Across a spectrum of applications, the TCC model itself did not limit available parallelism. Most applications are easily divided into transactions requiring only small write buffers, on the order of 4-8 KB. The broadcast requirements of TCC are high, but are well within the capabilities of CMPs and small-scale SMPs with high-speed interconnects.
10894133
Octree textures
Texturing using a set of two dimensional image maps is an established and widespread practice. However, it has many limitations. Parameterizing a model in texture space can be very difficult, particularly with representations such as implicit surfaces, subdivision surfaces, and very dense or detailed polygonal meshes. This paper proposes the use of a new kind of texture based on an octree, which needs no parameterization other than the surface itself, and yet has similar storage requirements to 2D maps. In addition, it offers adaptive detail, regular sampling over the surface, and continuity across surface boundaries. The paper addresses texture creation, painting, storage, processing, and rendering with octree textures.
7453479
Dienst: an architecture for distributed document libraries
As one of the five universities participating in the ARPA-sponsored Computer Science Technical Report project, we at Cornell have developed a digital library architecture called Dienst. Dienst is a protocol and implementation that provides Internet access to a distributed, decentralized multi-format document collection. The collection is managed by a set of interoperating Dienst servers distributed over the Internet. These servers provide three digital library services: repositories of multi-format documents; indexes into the document collection and search engines for these indexes; and user interfaces for browsing, searching, and accessing the collection.
2049771
Discovering Dynamics Using Bayesian Clustering
This paper introduces a Bayesian method for clustering dynamic processes and applies it to the characterization of the dynamics of a military scenario. The method models dynamics as Markov chains and then applies an agglomerative clustering procedure to discover the most probable set of clusters capturing the different dynamics. To increase efficiency, the method uses an entropy-based heuristic search strategy.