ppxscal/embedding_network huggingface dataset:
Modeling the Social and Technical Processes of Interorganizational Information Integration
Authors: Theresa A. Pardo, Anthony M. Cresswell, Sharon S. Dawes, G. Brian Burke
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Government leaders and IT executives increasingly recognize that interorganizational information integration (III) is a critical and complex process. Due to the need for integrated information at all levels of government, interorganizational information integration can no longer be pursued through ad hoc approaches that primarily rely on intuitive understandings of the way government operates [1]. This paper presents an effort currently underway to model the social and technical processes of interorganizational information integration to improve our understanding of information system development and of interorganizational collaboration. This research seeks to enhance both the conceptual and practical models of III by building new understanding of the interaction among the social and technical processes in interorganizational information integration.
Properties of the voronoi diagram cluster buster
Authors: Kelly A. Lyons, Henk Meijer, David Rappaport
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Programming distributed systems with a vast number of processors and communication links requires a method for visualizing the networ k as well as the systems running on the network. In many cases, there is a requirement to draw a graph with an existing layout in order to make the layout more readable. Cluster busting in anchored graph drawing moves the nodes of a graph around in an attempt to make the drawing more readable while keeping the nodes near to their original positions. The Voronoi diagram cluster buster is an algorithm that performs cluster busting in anchored graph drawing. In this paper we present some properties of the Voronoi diagram cluster buster.
Hand tracking for human-computer interaction with Graylevel VisualGlove: turning back to the simple way
Authors: Giancarlo Iannizzotto, Massimo Villari, Lorenzo Vita
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

Recent developments in the manufacturing and marketing of low power-consumption computers, small enough to be "worn" by users and remain almost invisible, have reintroduced the problem of overcoming the outdated paradigm of human-computer interaction based on use of a keyboard and a mouse. Approaches based on visual tracking seem to be the most promising, as they do not require any additional devices (gloves, etc.) and can be implemented with off-the-shelf devices such as webcams. Unfortunately, extremely variable lighting conditions and the high degree of computational complexity of most of the algorithms available make these techniques hard to use in systems where CPU power consumption is a major issue (e.g. wearable computers) and in situations where lighting conditions are critical (outdoors, in the dark, etc.). This paper describes the work carried out at VisiLAB at the University of Messina as part of the VisualGlove Project to develop a real-time, vision-based device able to operate as a substitute for the mouse and other similar input devices. It is able to operate in a wide range of lighting conditions, using a low-cost webcam and running on an entry-level PC. As explained in detail below, particular care has been taken to reduce computational complexity, in the attempt to reduce the amount of resources needed for the whole system to work.
Ethical and social aspects of biotechnology Ethical and social aspects of biotechnology
Authors: Bernhard Irrgang
Venue: Ubiquity (2003)

The globalisation of biotechnology brings not only new economic prospects but also new risks. The development of international bio-safety guidelines is essential.
Analysis of the Random Flow Generated by the Feedback Transport Protocol in a Data Transfer Network
Authors: O. Yu. Bogoyavlenskaya
Venue: Automation and Remote Control (2003)

A mathematical model for the distributed traffic control algorithm used in modern data transfer networks is designed and distributions of the important characteristics of the algorithm are derived. Numerical examples are given.
Microarray Gene Expression Profile Data Mining Model for Clinical Cancer Research
Authors: Rui Xue, Jianying Li, Dennis J. Streveler
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

The DNA microarray1 is the latest breakthrough in molecular biology, which provides researchers with an approach to monitor genome-wide expression systematically. Its application in cancer study has proved to be successful in elucidating the pathological mechanism, with the potential of altering clinical practice through individualized cancer care and ultimately of contributing to the battle against cancer. However, the current hurdle and challenge is how to make use of the tremendous amount and ever-growing microarray experimental data to precisely explain the cancer mechanism and to better predict the cancerdevelopment in the early stage. This topic has been realized by traditional biologists and presented to a new group of scientists from Biology, Statistics and Computer Science.We propose a newly designed data mining model, fashioned from a computer science point-of-view, to store microarray experimental data in a systematical organization, and to provide an efficient way for researchers to mine the database and populate it in a reasonable manner as their research progresses. The model in our design addresses the interpretation of the meaning of the microarray gene expression profile data in cancer research in the context of the biological pathway, with focus on the elucidation of key pathways in cancer development, thus providing a bridge between clinical cancer research and microarray geneexpression raw data.An object-relational database schema is proposed, which includes six subsystems: Array, Cancer, Drug, Gene, Image and Pathway. The relationship between the gene expression profiles under different experiment conditions and biological processes can be drawn fromthis database. This newly designed data mining model provides an efficient way to translate the large collection of existing profiles so as to be a handy reference for clinicians who face cancer early detection, clinical diagnosis and treatment decisions; it offers a new paradigm as a patient education tool for better patient care and health advisory against human disease; it also provides molecular biologists with an alternative and feasible route to interpret geneticexperimental data, which may ultimately lead to a more complete understanding of a complex human disease -- cancer.
Improved Approach for Noise Propagation to Identify Functional Noise Violations
Authors: Sachin Shrivastava, Dhanoop Varghese, Vikas Narang, NV Arvind
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper targets at reducing the crosstalk noiseclosure time by filtering the set of false violations. Wepropose two approaches to reduce the pessimism in thecrosstalk noise analysis. The first approach uses thearrival time windows for glitch propagation. Thesecond approach uses the critical window of thesequential cell pins to identify the violations. We havepresented some results that show the reduction innumber of violation with new approach.
Efficient evaluation of relevance feedback for multidimensional all-pairs retrieval
Authors: Michael Ortega, Kaushik Chakrabarti, Sharad Mehrotra
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

New retrieval applications support flexible comparison for all-pairs best match operations based on a notion of similarity or distance. The distance between items is determined by some arbitrary distance function. Users that pose queries may change their definition of the distance metric as they progress. The distance metric change may be explicit or implicit in an application (e.g., using relevance feedback). Recomputing from scratch the results with the new distance metric is wasteful. In this paper, we present an efficient approach to recomputing the all-pairs best match (join) operation using the new distance metric by re-using the work already carried out for the old distance metric. Our approach reduces significantly the work required to compute the new result, as compared to a naive re-evaluation.
Next-Generation Wearable Networks
Authors: Roy L. Ashok, Dharma P. Agrawal
Venue: Computer (2003)

Increased research in microelectronics, wireless communications, and human computerinteraction¿particularly augmented-reality applications has made a symbiotic system technically feasible. Wearable computing, or wearware, focuses on making this technology useful in everyday life, particularly for integrating contextual data with the Internet to automate mundane tasks.The availability of portable, energy efficient computing devices that can be easily integrated with clothing has renewed interest in the possibilities of wearware. The notion of a wearable networkof interactive devices aiding users in their day-to-day activities is extremely appealing, but for it to become a reality researchers must develop interesting and useful applications. Consumers are notinterested in the technology per se but in how it could enrich their lives.
Agent-based cooperative learning: a proof-of-concept experiment
Authors: Leen-Kiat Soh, Hong Jiang, Charles Ansorge
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

This paper presents an innovative multiagent system to support cooperative learning among students both in the real classrooms and in distance education. The system, called I-MINDS, consists of a group of intelligent agents. A teacher agent monitors the student activities and helps the teacher manage and better adapt to the class. A student agent, on the other hand, interacts with the teacher agent and other student agents to support cooperative learning activities behind-the-scene for a student. Two I-MINDS innovations are (a) agent-federated "buddy group" formation and (b) automated ranking of questions and responses. We have tested our I-MINDS prototype with experiment and control groups to evaluate the impact of I-MINDS in learning. The results are encouraging.
Poster abstract: multidimensional scaling based sensor positioning algorithms in wireless sensor networks
Authors: Xiang Ji, Hongyuan Zha
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Recently, a family of methods have been proposed for large scale ad hoc sensor networks that estimate the approximate positions of sensor nodes in the network. In the paper, we first investigate some situations that most existing sensor positioning methods fail to perform well. An example of such situations is that the topology of a sensor network is anisotropic. Then, we study the multidimensional scaling (MDS) technique, and a centralized sensor positioning algorithm is proposed based on MDS. We also propose a distributed sensor positioning algorithm, which is in iteration paradigm, to address these situations. The MDS technique is applied to recover a series of local maps for adjacent sensors, and these maps are then stitched together to form a portion of globe map. At last, the estimated anchor positions are compared with the anchors' physical position for accurate positioning.
A Rigorous Lower Bound for the Optimal Value of Convex Optimization Problems
Authors: Christian Jansson
Venue: Journal of Global Optimization (2004)

In this paper, we consider the computation of a rigorous lower error bound for the optimal value of convex optimization problems. A discussion of large-scale problems, degenerate problems, and quadratic programming problems is included. It is allowed that parameters, which define the convex constraints and the convex objective functions, may be uncertain and may vary between given lower and upper bounds. The error bound is verified for the family of convex optimization problems which correspond to these uncertainties. It can be used to perform a rigorous sensitivity analysis in convex programming, provided the width of the uncertainties is not too large. Branch and bound algorithms can be made reliable by using such rigorous lower bounds.
The creation of value in electronic commerce: an empirical study
Authors: Tom Powers
Venue:  (2003)

The purpose of this study was to determine if value could be created in electronic commerce, as applied to the Internet, and what did businesses identify as value in this area. A review of the literature reveals that individuals receive value in a means-end way, by the use of attributes, consequences, and goals (Woodruff, 1997). An individuals use of a product or service attribute allows them to realize certain consequences which helps them to achieve higher-level goals, and place value on that product or service. Models exist, e.g., laddering, that helps researchers uncover these value components (Gutman, 1982). Previous literature and research has described and attempted to look at value in traditional business commerce. This study expands on these value theories to uncover value in electronic commerce, and utilized the Delphi Group's (2000) B2B grouping which divided electronic commerce into eight categories, in which three were empirically tested in this research. Since conventional markets do not exist on the Internet, value in electronic commerce will have to be in its products and services (Kenny, 1999). Data was collected in two phases. The first phase consisted of field interviews to obtain measures within each category to use in an electronic Web-based questionnaire the researcher had setup. In the second phase, emails were sent to 2,000 companies asking them to complete the Web-based questionnaire. Out of 190 returned surveys, 164 surveys were usable, for a rate of 11.4%. Results of the data findings and analysis from the Web-based questionnaires, described in chapter four, show which measures initially obtained in the field interviews are supported. Out of the 69 hypotheses developed for this study, 36 were supported, 33 were not supported. This research started with what was perceived to be a problem in delivering value in electronic commerce. The results of this research seem to indicate that businesses can uncover what is value to their customers.
Differentiating data- and text-mining terminology
Authors: Jan H. Kroeze, Machdel C. Matthee, Theo J. D. Bothma
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

When a new discipline emerges it usually takes some time and lots of academic discussion before concepts and terms get standardised. Such a new discipline is text mining. In a groundbreaking paper, <i>Untangling text data mining</i>, Hearst [1999] tackled the problem of clarifying text-mining concepts and terminology. This essay aims to build on Hearst's ideas by pointing out some inconsistencies and suggesting an improved and extended categorisation of data- and text-mining techniques. The essay is a conceptual study. A short overview of the problems regarding text-mining concepts is given. This is followed by a summary and critical discussion of Hearst's attempt to clarify the terminology. The essence of text mining is found to be the discovery or creation of new knowledge from a collection of documents. The parameters of non-novel, semi-novel and novel investigation are used to differentiate between full-text information retrieval, standard text mining and intelligent text mining. The same parameters are also used to differentiate between related processes for numerical data and text metadata. These distinctions may be used as a road map in the evolving fields of data/information retrieval, knowledge discovery and the creation of new knowledge.
Supporting online shopping through a combination of ontologies and interface metaphors
Authors: John Domingue, Arthur Stutt, Maria Martins, Jiacheng Tan, Helgi Petursson, Enrico Motta
Venue: International Journal of Human-Computer Studies (2003)

In this paper we describe some results of the Alice project. Alice is an ontology-based e-commerce project which aims to support online users in the task of shopping. Ontologies describing customers, products, typical shopping tasks and the external context form the basis for the Alice architecture. We also build upon two novel interface metaphors originally developed for navigating databases: the Guides metaphor and Dynamic Queries. The Guides metaphor was developed at Apple to reduce the cognitive load on learners navigating a large hypermedia database. Within Alice we use the Guides metaphor to allow online shoppers to interact with the system in a variety of ways. In effect, by choosing these options they are classifying themselves for the purpose of customizing system responses. We discuss the link between Alice Guides and Kozinets' notion of e-tribes or Virtual Communities of Consumption. Our second interface metaphor Dynamic Queries (coupled with Starfield displays) allows users to very quickly find relevant items by displaying the results of queries, posed via specialized slider widgets, within 100 ms, We have constructed a tool, Quiver, which constructs Dynamic Query interfaces on-the-fly as the result of queries to knowledge models stored on the Alice server.
Applying information visualization techniques to capture and explore the course of cognitive behavioral therapy
Authors: Monika Lanzenberger, Silvia Miksch, Susanne Ohmann, Christian Popow
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Tracking and especially comparing psychotherapeutic processes is a complex task involving a large number of individual and complexly related parameters. Therefore, descriptive and classical statistical methods are only suited for partial analyses. To overcome these limitations we introduce LinkVis, a new Information Visualization (InfoVis) tool used to visualize and evaluate psychotherapeutic processes. LinkVis is developed and clinically tested on the basis of Cognitive Behavioral Therapy treating anorectic girls. The user gets new insight into the data under investigation due to the combination of three different visualization techniques: scatterplots, Chernoff faces, and parallel coordinates. LinkVis supports exploring of complex time-dependent data in order to gain more information about the psychotherapeutic process, especially when comparing different patients and groups.
Preparing students for distributed teamwork
Authors: Mary Z. Last
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This poster presents some practical tips for preparing students to work in distributed project courses that require teamwork. These tips are based on empirical research that investigated virtual team interactions over a three-year period.
Sequential versus parallel grammar formalisms with respect to measures of descriptional complexity
Authors: Suna Aydin, Henning Bordihn
Venue: Fundamenta Informaticae (2002)

For tabled Lindenmayer systems and their languages, the degree of synchronization and the degree of nondeterminism are well investigated measures of descriptional complexity. In this paper the sequential counterparts of tabled Lindenmayer systems, namely cooperating distributed grammar systems and their pure variant (working in the so-called t-mode of derivation) are treated with respect to these complexity measures. In the pure case, where no distinction between terminal and nonterminal symbols is made, the sequential mechanisms are compared with the parallel ones, investigating whether one mechanism may have a better descriptional complexity than the other one when the same language is described.
Gate sizing in MOS digital circuits with linear programming
Authors: Michel R. C. M. Berkelaar, Jochen A. G. Jess
Venue: Proceedings of the conference on European design automation (1990)

In this paper a solution is presented to tune the delay of a circuit composed of cells to a prescribed value, while minimizing power consumption. The tuning is performed by adapting the load drive capabilities of the cells. This optimization problem is mapped onto a linear program, which is then solved by the Simplex algorithm. This approach guarantees to find the global optimum, and has proven feasible for circuits of up to several thousand cells. The method can be used with any convex delay model. Results show that circuits can be speeded up by a factor of 2 at a cost of only 10 to 30% of extra power.
Design Scan Test Strategy for Single Phase Dynamic Circuits
Authors: Ching-Hwa Cheng
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

The mixed static-dynamic circuits are widely used to design high-performance circuits (e.g. ALU, communication circuit etc), among them the most famous one is the True Single-PhaseClocked (TSPC) dynamic circuits. The TSPC is often used to design high-speed dynamic-sequential CMOS circuits, which contain dynamic, static circuits and memory elements (such as latches, and flip-flops). All these components are operated in a single clocking phase system. Although the scan design is an applicable technique for most circuits, especially for the Intellectual Property (IP) design, scan testing issues for mixed dynamic/static circuit themselves are seldom discussed. In this paper, we propose a new design of scan latch and full/partial scan test strategy for single phase dynamic TSPC circuits, which are constructed by N (P) type of domino logic and clock latches. The full-scan deign could support circuit diagnosis capability while the partial-scan would lead to less performance penalty.
Modeling Geoscience Data in a Multisensory Virtual Environment
Authors: Chris Harding
Venue: Computing in Science and Engineering (2004)

The author describes ongoing efforts to combine high-quality 3D graphics, haptics (from the Greek word haptesthai, to grasp or to touch), and sonification (the use of sound for visualization) into multisensory systems to interactively manipulate geoscientific data. These systems could facilitate many complex tasks that geoscientists in academia and industry face today, lead to new insights, and solve problems in less time. This research applies to many different geoscience branches but here I focus on the oil and gas industry because I spent the last five years working in this domain.
Channel routing with non-terminal doglegs
Authors: Bryan Preas
Venue: Proceedings of the conference on European design automation (1990)

Many automatic layout systems for VLSI circuits employ channel routing as the basic interconnection function. The wide range of uses and the importance of channel routing have inspired many good channel routing algorithms. However, many algorithms were developed with the geometric regularity of standard cell and gate array designs in mind. As a result these algorithms have difficulty routing channels with geometric generality (rectilinear boundaries and wires and terminals that can have different widths and irregular spacings) and simultaneously guaranteeing completion of all routes. This paper presents an algorithm for resolving cyclic vertical constraints using a general channel model. When this algorithm is combined with a constraint-based channel router, routing completion can be guaranteed, even for routing problems with generalized geometries. This algorithm is implemented with a constrain-based, alternating-edge, dogleg channel router. Extensions are described which permit the channel router to implement switchbox routing.