ppxscal/embedding_network huggingface dataset:
The need for accurate alignment in natural language system evaluation
Authors: Andrew Kehler, John Bear, Douglas Appelt
Venue: Computational Linguistics (2001)

As evaluations of computational linguistics technology progress toward higher-level interpretation tasks, the problem of determining alignments between system responses and answer key entries may become less straightforward. We present an extensive analysis of the alignment procedure used in the MUC-6 evaluation of information extraction technology, which reveals effects that interfere with the stated goals of the evaluation. These effects are shown to be pervasive enough that they have the potential to adversely impact the technology development process. These results argue strongly/ or the use of accurate alignment criteria in natural language evaluations, and/ or maintaining the independence of alignment criteria and mechanisms used to calculate scores.
IEEE Distributed Systems Online: Looking to the Future
Authors: Jean Bacon
Venue: IEEE Internet Computing (2004)

In 2004, IEEE Distributed Systems Online (http://dsonline.computer.org) becomes the IEEE's first online-only publication. The original material from our monthly issues will be in the CS Digital Library, including our peer-reviewed, archived material since our launch in 2000. IEEE Internet Computing has cosponsored DSO since 2002. We value this connection and look forwardto future collaboration. We are particularly interested in novel ways in which DSO can extend the material presented in a paper magazine.
Removable Circuits in Binary Matroids
Authors: Luis A. Goddyn, Bill Jackson
Venue: Combinatorics, Probability and Computing (1999)

We show that, if M is a connected binary matroid of cogirth at least five which does not have both an F7-minor and an F&#x002A;7-minor, then M has a circuit C such that M &minus; C is connected and r(M &minus; C) = r(M).
Weakly Saturated Hypergraphs and Exterior Algebra
Authors: Oleg Pikhurko
Venue: Combinatorics, Probability and Computing (2001)

Given an r-graph F, an r-graph G is called weakly F-saturated if the edges missing from G can be added, one at a time, in some order, each extra edge creating a new copy of F. Let w-sat(n, F) be the minimal size of a weakly F-saturated graph of order n. We compute the w-sat function for a wide class of r-graphs called pyramids: these include many examples for which the w-sat function was known, as well as many new examples, such as the computation of w-sat(n,Ks + Kt), and enable us to prove a conjecture of Tuza.Our main technique, developed from ideas of Kalai, is based on matroids derived from exterior algebra. We prove that if it succeeds for some graphs then the same is true for the &lsquo;cones&rsquo; and &lsquo;joins&rsquo; of such graphs, so that the w-sat function can be computed for many graphs that are built up from certain elementary graphs by these operations.
Natural Thinking Mechanisms and Computer Intelligence
Authors: Z. L. Rabinovich
Venue: Cybernetics and Systems Analysis (2003)

A model is considered in the paper as a communication link between natural intelligence and artificial one. It is both of cognitive and applied value, based on well-known facts of natural science and on cybernetic hypotheses necessary for its construction. It is shown in the paper that it is possible and expedient to use the model features in development of internal computer intelligence. The main principles of construction of a new class of intelligent solving machines are given as an example.
Inductive graphs and functional graph algorithms
Authors: Martin Erwig
Venue: Journal of Functional Programming (2001)

We propose a new style of writing graph algorithms in functional languages which is based on an alternative view of graphs as inductively defined data types. We show how this graph model can be implemented efficiently, and then we demonstrate how graph algorithms can be succinctly given by recursive function definitions based on the inductive graph view. We also regard this as a contribution to the teaching of algorithms and data structures in functional languages since we can use the functional-style graph algorithms instead of the imperative algorithms that are dominant today.
Static reflector: a pattern for object-oriented access to non-object-oriented interfaces
Authors: Bob Jolliffe, J. A. van der Poll
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

Somewhere near the bottom of the food chain of object oriented programming, the developer frequently encounters a non object oriented API. This paper describes a specialisation of the Wrapper Facade pattern. Wrapper Facades encapsulate functions and data provided by existing non object oriented API's. The Static Reflector addresses the particular problem of building wrappers which contain functions which take C function pointers as parameters. The pattern makes use of a static reflection method to facilitate the construction of cohesive, reusable framework classes which make use of such C functions. We show that the application of this pattern is surprisingly wide. Though concerned primarily with the interface between C and C++, the pattern has implications for and applications to other languages as diverse as Java and [incr Tcl].This pattern was workshopped at the PLOP 2001 conference, Illinois. It is structured according to the canonical form under the headings Name, Problem, Context, Forces, Solution, Resulting Context, Rationale, Examples and Related Patterns.
A Foreground/Background Separation Algorithm for Image Compression
Authors: Patrice Y. Simard, Henrique S. Malvar, James Rinker, Erin Renshaw
Venue: Proceedings of the Conference on Data Compression (2004)

Many bitmap documents are composed by the superposition of layers withpictures and text. These documents do not compress well using image compressionalgorithms such as JPEG-2000, because text introduces sharp edgeson top of the smooth surfaces typically found in natural images. Similarly,compression algorithms for text facsimiles, such as JBIG2, are not suited forcolor or gray level images. We propose the SLIm system for separating textand line drawing from background images, in order to compress both moreeffectively. This approach differ from previous ones such as DjVu, Tiff-FX,and MRC, by being extremely simple and fast, while yielding close to state-of-the-art compression performance. We present results that show that theSLIm compression performance is attractive for many applications.
Increasing workplace independence for people with cognitive disabilities by leveraging distributed cognition among caregivers and clients
Authors: Stefan Carmien, Rogerio DePaula, Andrew Gorman, Anja Kintsch
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

In this paper we describe a current group configuration that is used to support people with cognitive disabilities (hereinafter referred to as "clients") in the workplace. A client receiving face-to-face, often one-to-one assistance from a dedicated human job coach is characteristic of this "traditional" model. We compare this traditional model with other group configurations that are used in cooperative and distributed work practices. In so doing, we highlight requirements that are unique to task support for people with cognitive disabilities. A survey of technologies that have been developed to provide clients with greater levels of independence is then presented. These endeavors often attempt to replace human job coaches with computational cognitive aids. We discuss some limitations of such approaches and then present a model and prototype that extends the computational job coach by incorporating human caregivers in a distributed one-to-many support system.
Incremental processing and acceptability
Authors: Glyn Morrill
Venue: Computational Linguistics (2000)

We describe a left-to-right incremental procedure for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly predicts a wide variety of performance phenomena including garden pathing, the unacceptability of center embedding, preference for lower attachment, left-to-right quantifier scope preference, and heavy noun phrase shift.
Managing information technology component of knowledge management: outsourcing as a strategic option in developing countries
Authors: Adekunle Okunoye
Venue: Managing globally with information technology (2003)

Information technology and social-cultural, organizational variables are considered major components to support knowledge processes in knowledge management. These components have to be carefully managed and be supported in balanced proportion for organization to create and retain greater value from their core competencies. The peculiar situation of developing countries, where there is lack of adequate information technology infrastructure, emphasizes the importance of strategic management of organizational information technology. Using a case study, we discuss the possibility of outsourcing the management of the information technology in order to have more focus on the other components in knowledge management.
Moving from embedded systems to embedded computing
Authors: Joseph A. Fisher
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

In the middle of the last decade, there was a large gulf between embedded systems and general-purpose computing. Most researchers and advanced developers in general-purpose computing thought naively that real-time considerations added a little twist, but after that it was mostly a matter of size. Their impression was that embedded systems were just like general-purpose systems, but smaller. At the same time, those working in embedded systems were usually insufficiently aware of progress in computing that could be applied to what they were doing, and felt that theirs was a discipline apart.
Distributed suffix trees and their application to large-scale genomic analysis
Authors: Raphaël Clifford, Marek Sergot
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We have recently presented a variant of the suffix tree which allows much larger genome sequence databases to be analysed efficiently. The new data structure, termed the distributed suffix tree (DST), is designed for distributed memory parallel computing environments (e.g. Beowulf clusters). It tackles the memory bottleneck by constructing subtrees of the full suffix tree independently. The standard operations on suffix trees of biological importance are easily translatable to this new data structure. While none of these operations on the DST require inter-process communication, many have optimal expected parallel running times.
A hierarchical stochastic model for automatic prediction of prosodic boundary location
Authors: M. Ostendorf, N. Veilleux
Venue: Computational Linguistics (1994)

Prosodic phrase structure provides important information for the understanding and naturalness of synthetic speech, and a good model of prosodic phrases has applications in both speech synthesis and speech understanding. This work describes a statistical model of an embedded hierarchy of prosodic phrase structure, motivated by results in linguistic theory. Each level of the hierarchy is modeled as a sequence of subunits at the next level, with the lowest level of the hierarchy representing factors such as syntactic branching and prosodic constituent length using a binary tree classification. A maximum likelihood solution for parameter estimation is presented, allowing automatic training of different speaking styles. For predicting prosodic phrase breaks from text, a dynamic programming algorithm is given for finding the maximum probability prosodic parse. Experimental results on a corpus of radio news demonstrate a high rate of success for predicting major and minor phrase boundaries from text without syntactic information (81% correct prediction with 4% false prediction).
Considering the direction of cursor movement for efficient traversal of cascading menus
Authors: Masatomo Kobayashi, Takeo Igarashi
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

Cascading menus are commonly seen in most GUI systems. However, people sometimes choose the wrong items by mistake, or become frustrated when submenus pop up unnecessarily. This paper proposes two methods for improving the usability of cascading menus. The first uses the direction of cursor movement to change the menu behavior: horizontal motion opens/closes submenus, while vertical motion changes the highlight within the current menu. This feature can reduce cursor movement errors. The second causes a submenu to pop up at the position where horizontal motion occurs. This is expected to reduce the length of the movement path for menu traversal. A user study showed that our methods reduce menu selection times, shorten search path lengths, and prevent unexpected submenu appearance and disappearance.
Can GRID services provide answers to the challenges of national health information sharing?
Authors: I. Bilykh, Y. Bychkov, D. Dahlem, J. H. Jahnke, G. McCallum, C. Obry, A. Onabajo, C. Kuziemsky
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

It has been widely recognized that one of the keys to cost reduction and service improvement in national health care lies in the integration of medical information system. Integration of information can not only improve care delivery today, but it can also help build research bases to enhance future care delivery. The question is how to achieve such integration? Imposing a single client software solution or common clinical terminology does not appear likely to happen. That lack of single software solutions and common terminologies means that solutions to integrate medical information will have to use, and somehow solve, the many heterogeneous data sources that currently exist. We believe the GRID computing paradigm has the potential to provide viable solutions to this problem. In collaboration with researchers in Health Information Science and practitioners in Health Care, we have developed a prototype for the Health Information Grid, a middleware technology that supports inexpensive mediation of medical information among rapidly evolving, heterogeneous medical information sources. This paper makes three main contributions: (1) it discusses issues and requirements arising from constructing a global health information network in Canada from a software engineering point of view, (2) it presents the concepts of a technology developed to address these issues, and (3) it presents a prototype of this technology along with a case study developed in collaboration with domain experts and practitioners.
What Energy Functions Can Be Minimizedvia Graph Cuts?
Authors: Vladimir Kolmogorov, Ramin Zabih
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes many previous constructions and is easily applicable to vision problems that involve large numbers of labels, such as stereo, motion, image restoration, and scene reconstruction. We give a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. We also provide a general-purpose construction to minimize such an energy function. Finally, we give a necessary condition for any energy function of binary variables to be minimized by graph cuts. Researchers who are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.
A social learning theory and moral disengagement analysis of criminal computer behavior: an exploratory study
Authors: James Ogloff
Venue:  (2001)

This study was exploratory and examined the characteristics of individuals engaged in computer criminal activity. It was predicted that individuals who had engaged in illicit computer activity would have higher rates of differential association, differential reinforcement, and moral disengagement than non-criminals. It was also hypothesized that the combination of differential association, differential reinforcement, and moral disengagement better predict criminal computer behavior than either variable alone. In Phase 1 of the study, a comparative analysis was conducted on demographic data from 132 computer and general criminals. In phases 2 and 3, 112 Internet participants, and 36 general criminals participants completed the Computer Crime Index Social Learning Questionnaire (Rogers, 2000), and the Paulhus Deception Scale (Paulhus, 1998). The hypotheses regarding differential association, differential reinforcement, and moral disengagement were supported. However, contrary to the predictions, the reduced model consisting of moral disengagement and differential association better predict criminal computer behavior. Additional exploratory analyses and the implications for future research are also discussed.
The applicability of grounded theory as research methodology in studies on the use of methodologies in IS practices
Authors: Roelien Goede, Carina de Villiers
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

Information Systems (IS) development can be seen as a social activity. Research methodologies from social sciences, such as Grounded Theory (GT) can therefore be used to investigate IS practices. This paper asks whether GT can be used to investigate the use of specific methodologies by IS practitioners when the practitioners are not familiar with the methodologies in question. It aims to contribute to GT research methods as well as systems thinking research methods.
Lessons from the implementation of an adaptive parts acquisition ePortal
Authors: Rafael Alonso, Jeffrey A. Bloom, Hua Li
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In recent work we have developed a novel approach to the design and implementation of an online portal (ePortal) to help application engineers find replacements for electronic parts that have become obsolete (and hence will no longer be produced). Our approach makes use of machine learning techniques to improve the performance of a database search function. However, the purpose of this note is not to describe in detail the application nor our technical solution - that has been done elsewhere (see [1,2]). Rather, it is our intention to present some of the lessons learned from our project. Below, we provide a brief introduction to the technical approach, concentrate on several of the most salient lessons, and conclude with a description of the current state of the project.
Physiological data feedback for application in distance education
Authors: Martha E. Crosby, Brent Auernheimer, Christoph Aschwanden, Curtis Ikehara
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

This paper describes initial experiments collecting physiological data from subjects performing computer tasks. A prototype realtime Emotion Mouse collected skin temperature, galvanic skin response (GSR), and heartbeat data. Possible applications to distance education, and a second-generation system are discussed.
Minimizing ADMs on WDM directed fiber trees
Authors: FengFeng Zhou, GuoLiang Chen, YinLong Xu, Jun Gu
Venue: Journal of Computer Science and Technology (2003)

This paper proposes a polynomial-time algorithm for Minimum WDM/SONET Add/Drop Multiplexer Problem (MADM) on WDM directed fiber trees whether or not wavelength converters are used. It runs in time O(m2n), where n and m are the number of nodes of the tree and the number of the requests respectively. Incorporating T. Erlebach et al.'s work into the proposed algorithm, it also reaches the lower bound of the required wavelengths with greedy algorithms for the case without wavelength converters. Combined with some previous work, the algorithm reduces the number of required wavelengths greatly while using minimal number of ADMs for the case with limited wavelength converters. The experimental results show the minimal number of required ADMs on WDM directed fiber trees.
Developing Relational Navigation to Effectively Understand Software
Authors: Daniel Jarrott, Anthony MacDonald
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Effective comprehension of complex software systems requiresunderstanding of both the individual documents thatrepresent software and the complex relationships that existwithin and between documents. Relationships of allkinds play a vital role in a software engineer's comprehensionof, and navigation within and between, softwaredocuments. User-determined relationships have the additionalrole of enabling the engineer to create and maintainrelational documentation that cannot be generatedby tools or derived from other relationships. In this paper,we argue that for a software development environmentto effectively support the understanding of complex softwaresystems, relational navigation must be supported atboth the document-focused (intra-document) and relation-focused(inter-document) levels. The need for a relation-focusedapproach is highlighted by an evaluation of anexisting document-focused relational interface. This papercloses with the requirements for a relation-focused approachto relational navigation. These requirements focuson the user's perspective when interacting with a collectionof related documents. This work defines the requirementsfor a software development environment that effectively supportsthe understanding of the software documents and relationshipsthat define a complex software system.
Relationship between guaranteed rate server and latency rate server
Authors: Yuming Jiang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

To analyze scheduling algorithms in computer networks, two models have been proposed and widely used in the literature, namely the Guaranteed Rate (GR) server model and the Latency Rate (LR) server model. While a lot scheduling algorithms have been proved to belong to GR or LR or both, it is not clear what is the relationship between them. The purpose of this paper is to investigate this relationship. We prove that if a scheduling algorithm belongs to GR, it also belongs to LR and vice versa. In addition, we review several other models that are also used for analysis of scheduling algorithms and discuss their relationship with LR model and GR model.