ppxscal/embedding_network huggingface dataset:
There's No Such Thing as a Free (Software) Lunch
Authors: Jay Michaelson
Venue: Queue (2004)

"The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software to make sure the software is free for all its users." So begins the GNU General Public License, or GPL, which has become the most widely used of open source software licenses. Freedom is the watchwordit's no coincidence that the organization that wrote the GPL is called the Free Software Foundationand that open source developers everywhere proclaim, "Information wants to be free."
Disease Gene Explorer: Display Disease Gene Dependency by Combining Bayesian Networks with Clustering
Authors: Qian Diao, We Hu, Hao Zhong, Juntao Li, Feng Xue, Tao Wang, Yimin Zhang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Constructing gene networks is one of the hot topics in the analysis of the microarray gene expression data. When combined with the output of disease gene finding, the generated gene networks will give a recommendation mechanism and an intuitive form for biologists to identify the underlying relationship among those biomarkers of the disease. In this paper, we present a display system, Disease Gene Explorer, which can graphically display the dependency among genes, especially those biomarkers of a disease. It combines Bayesian networks (BN) learning with clustering and disease gene selection. We test the system on Colon cancer data set and obtain some interesting results: most high-score biomarkers of the disease are partitioned into one group; the dependency among these disease genes are displayed as a directed acyclic graph (DAG).
Cognitive schema and naturalistic decision making in evidence-based practices
Authors: Paul R. Falzer
Venue: Journal of Biomedical Informatics (2004)

A recent article in this journal proposed a naturalistic approach to decision making that overcomes problems intrinsic to classical decision theory. The approach emphasizes cognitive and multi-level processes, the development of expert reasoning, and the role of decision support in individual and organizational decision making. The current paper builds on this effort by suggesting a naturalistic, multi-level, theory that can facilitate the dissemination of evidence-based practices (EBPs). The paper presents "Image Theory," a theory that has been extensively investigated in other disciplines, but has yet to be utilized in medical decision research. It is suggested that its rich, empirically tested, distinctions among kinds of cognitive and organizational processes and types of decisions and tasks make Image Theory especially valuable in describing impediments to implementing EBPs. The paper discusses how naturalistic theory can assist clinicians, administrators, researchers, and policy makers in achieving a balance between evidence-based medicine and patient-centered practice.
Design and evaluation of team work in distributed collaborative virtual environments
Authors: Gernot Goebbels, Vali Lalioti, Martin Göbel
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

We present a framework for the design and evaluation of distributed, collaborative 3D interaction focussing on projection based systems. We discuss the issues of collaborative 3D interaction using audio/video for face-to-face communication and the differences in using rear projection based Virtual Environments. Further, we explore how the use of video/audio, input device representations and other disturbance factors typical of projection-based virtual environments affect co-presence, co-working and co-knowledge in distributed CVEs. We present results from co-presence and co-working evaluation sessions of about 60 users of various profiles. An extensive statistical, group and variation group analysis of the results is carried out. The findings and the resulting design guidelines are presented in this paper in respect to the above factors.
Managing XML Data: An Abridged Overview
Authors: Juliana Freire, Michael Benedikt
Venue: Computing in Science and Engineering (2004)

XML's flexibility makes it a natural format for both exchanging and integrating data from diverse data sources. In this survey, the authors give an overview of issues in managing XML data, discuss existing solutions, and outline the current technology's open problems and limitations.
Smarandache sequence of triangular numbers
Authors: Shyam Sunder Gupta
Venue: Smarandache Notions Journal (2004)

In this article, we present the results of investigation of Smarandache Concatenate Sequence formed from the sequence of Triangular Numbers and report some primes and other results found from the sequence
Probabilistic Motion Sequence Generation
Authors: Mirko Sattler, Ralf Sarlette, Reinhard Klein
Venue: Proceedings of the Computer Graphics International (2004)

Creating long animation sequences with non-trivial repetitionsis a time consuming and often difficult task. This istrue for 2D images and even more true for 3D sequences.Based upon the idea of video textures we propose a simplealgorithm to create new user controlled animation sequencesbased only on a few key frames by the analysisof velocity and position coherence. The simplicity of themethod is achieved by carrying out the calculations onthe main principal components of the reference animation,hence reducing the dimensionality of the input data. Thisalso leads to significant compression. Smooth animationsare ensured, using one of the proposed blending schemes.
Performance of Beamspace Transmit Diversity Technique in Two Beam Rayleigh Fading Channels
Authors: Murat Torlak
Venue: Wireless Personal Communications: An International Journal (2004)

Many theories of exploiting spatial diversity in wireless communications and more recently space-time coding are results of understanding the spatial channel models for antenna array communication systems. For example, the models for rich scattering environments assume the channel coefficients to be almost independent when the spacing between the antennas is sufficient. This could limit the possibility of extracting direction of the signal propagation with respect to antenna locations (G. Xu et al., IEEE Transactions on Signal Processing, Vol. 42, No. 2, pp. 349&ndash;355, 1994). On the other hand, when the scattering is limited to few dominant reflectors, the directions of the signals traveling through the environment can prevail in the channel coefficients. Extracting the propagation direction (beam direction) information from the channel coefficients has been investigated extensively in array signal processing literature. These investigations have led to many algorithms of direction of arrival (DOA) estimation and beamforming. Here, we propose a transmit diversity technique that exploits beam directions in environments with few beam directions. While we present this technique for two-beam Rayleigh fading channels (J.E. Mazo, IEEE Transaction on Communication, Vol. 39, No. 7, pp. 1027&ndash;1030, 1991), it can be easily extended to multibeam general fading channels. The proposed method does not require feedback from the receiver.
Editor's Note
Authors: David S. Ebert
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

reg
A multimodal learning interface for grounding spoken language in sensory perceptions
Authors: Chen Yu, Dana H. Ballard
Venue: ACM Transactions on Applied Perception (TAP) (2004)

We present a multimodal interface that learns words from natural interactions with users. In light of studies of human language development, the learning system is trained in an unsupervised mode in which users perform everyday tasks while providing natural language descriptions of their behaviors. The system collects acoustic signals in concert with user-centric multisensory information from nonspeech modalities, such as user's perspective video, gaze positions, head directions, and hand movements. A multimodal learning algorithm uses this data to first spot words from continuous speech and then associate action verbs and object names with their perceptually grounded meanings. The central ideas are to make use of nonspeech contextual information to facilitate word spotting, and utilize body movements as deictic references to associate temporally cooccurring data from different modalities and build hypothesized lexical items. From those items, an EM-based method is developed to select correct word--meaning pairs. Successful learning is demonstrated in the experiments of three natural tasks: "unscrewing a jar," "stapling a letter," and "pouring water."
Almost periodic configurations on linear cellular automata
Authors: Klaus Sutner
Venue: Fundamenta Informaticae (2003)

We study computational properties of linear cellular automata on configurations that differ from spatially periodic ones in only finitely many places. It is shown that the degree structure of the orbits of cellular automata is the same on these configurations as on the space of finite configurations. We also show that it is undecidable whether the cellular automaton exhibits complicated behavior on configurations of sufficiently long spatial periods and exhibit cellular automata with undecidable orbits whose orbits on backgrounds of all fixed sizes are decidable.
A Possible World Approach to Uncertain Relational Data
Authors: Ander de Keijzer, Maurice van Keulen
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Data exchange between embedded systems and other small or large computing devices increases. Since data in different data sources may refer to the same real world objects, data cannot simply be merged. Furthermore, in many situations, conflicts in data about the same real world objects need to be resolved without interference from a user. In this paper, we report on an attempt to make a RDBMS probabilistic, i.e., data in a relation represents all possible views on the real world, in order to achieve unattended data integration. We define a probabilistic relational data model and review standard SQL query primitives in the light of probabilistic data. It appears that thinking in terms of 'possible worlds' is powerful in determining the proper semantics of these query primitives.
A characterization of software design tools
Authors: M. K. Rajaraman
Venue: ACM SIGSOFT Software Engineering Notes (1982)

Software tools have been proposed and are available for a number of major activities involved in an information system development. Tools exist that help the designer in systems analysis, requirements specification, program design, coding, testing and implementation. However, there is very little standardization of tool characteristics, terminology, applicability, and classification. This paper identifies the global environment in which software design tools exist and proposes a hierarchy of characteristics that are required or desirable for tools to serve their intended purpose. Once formally established and accepted, such characteristics and properties will not only help tool developers, but also be useful in selection and use of tools in the system development environment.
Automating Lighting Design for Interactive Entertainment
Authors: Magy Seif El-Nasr, Ian Horswill
Venue: Computers in Entertainment (CIE) (2004)

Recent advances in computer graphics, particularly in real-time rendering, have resulted in major improvements in 3D graphics and rendering techniques in interactive entertainment. In this article we focus on the scene-lighting process, which we define as configuring the number of lights in a scene, their properties (e.g., range and attenuation), positions, angles, and colors. Lighting design is well known among designers, directors, and visual artists for its vital role in influencing viewers' perception by evoking moods, directing their gaze to important areas (i.e., providing visual focus), and conveying visual tension. It is, however, difficult to set positions, angles, or colors for lights within interactive scenes to accommodate these goals because an interactive scene's spatial and dramatic configuration, including mood, dramatic intensity, and the relative importance of different characters, change unpredictably in real-time. There are several techniques developed by the game industry that establish spectacular real-time lighting effects within 3D interactive environments. These techniques are often time- and labor-intensive. In addition, they are not easily used to dynamically mold the visual design to convey communicative, dramatic, and aesthetic functions as addressed in creative disciplines such as art, film, and theatre. In this article we present a new real-time lighting design model based on cinematic and theatric lighting design theory. The proposed model is designed to automatically, and in real-time, adjust lighting in an interactive scene to accommodate the dramatic, aesthetic, and communicative functions described by traditional lighting design theories, while taking artistic constraints on style, visual continuity, and aesthetic function into account.
Hourly analysis of a very large topically categorized web query log
Authors: Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury, David Grossman, Ophir Frieder
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We review a query log of hundreds of millions of queries that constitute the total query traffic for an entire week of a general-purpose commercial web search service. Previously, query logs have been studied from a single, cumulative view. In contrast, our analysis shows changes in popularity and uniqueness of topically categorized queries across the hours of the day. We examine query traffic on an hourly basis by matching it against lists of queries that have been topically pre-categorized by human editors. This represents 13% of the query traffic. We show that query traffic from particular topical categories differs both from the query stream as a whole and from other categories. This analysis provides valuable insight for improving retrieval effectiveness and efficiency. It is also relevant to the development of enhanced query disambiguation, routing, and caching algorithms.
Interaction with Hand Gesture for a Back-Projection Wall
Authors: Hyosun Kim, Dieter W. Fellner
Venue: Proceedings of the Computer Graphics International (2004)

(Semi-)immersive displays like back projection wallshave become widely used in various visual domains. Despitethe superior image quality of ýthrough-the-windowsVRý users are still not satisfied with the interaction capabilities¿ mostly due to the extra wiring for the interaction devices.This paper represents a hand gesture interaction systemfor a back-projection wall environment, supporting objectmanipulation (translation, rotation, and uniform scale)and selection tasks through the vision-tracking technique.We propose to use thimble-shaped fingertip markers madeof white printing paper with a ýblack lightý source. Gestureparameters are calculated by 3D positions of the markedfingertips and their pinching states.
Is telemedicine the panacea for Sub-Saharan Africa's medical nightmare?
Authors: Victor W. A. Mbarika
Venue: Communications of the ACM (2004)

"Ever since my eye swelled up, I've gone to church to pray for a cure...I always knew He would send a way to make me better---I just didn't know it was going to be from London," says Anna Mobutsu, a 23-year-old farm laborer, who cannot imagine journeying farther than a bus ride from her home in the small African town of Nelspruit. An illiterate single parent with a 7-year-old and an elderly mother to support on about $56 a month, Anna does not even own a TV to introduce her to a world beyond her own. "But this afternoon I went to London" [2].
The kappa statistic: a second look
Authors: Barbara Di Eugenio, Michael Glass
Venue: Computational Linguistics (2004)

In recent years, the kappa coefficient of agreement has become the de facto standard for evaluating intercoder agreement for tagging tasks. In this squib, we highlight issues that affect κ and that the community has largely neglected. First, we discuss the assumptions underlying different computations of the expected agreement component of κ. Second, we discuss how prevalence and bias affect the κ measure.
Reeb Graph Representation of Surfaces with Boundary
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Reeb graphs can be used in many applications toconstruct simple graph-like sketches of shapes, which retain thetopology/connectivity of the original shape. In this paper, ourReeb graph representation is extended to generic surfaces withboundary.
An Active Adapter with Edge Cache Approach for Order Status Information Integration
Authors: Jih-Shyr Yih, Shiwa S. Fu, Shyh-Kwei Chen, Sebastien Houillot
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Sharing information among multiple business operations and distributed locations in an integrated manner has always been one of the central issues in business activity and process management. The effectiveness of the entire commerce value chain for an enterprise is largely dependent on the satisfaction of the information requesters. Improving upon the typical data federation approach, we propose to add data caches in the adapters that connect directly to the information requesters for fast data retrieval. To demonstrate the proposed approach, we have implemented the new active features for the IBM Websphere Business Integration middleware. Experimental results show that the active adapter approach significantly reduces the average data access time under a real order status tracking system.
Cost-Efficient Implementation of Adaptive Finite State Machines
Authors: Maik Boden, Manfred Koegst, Jose Luis Tiburcio Badia, Steffen Rulke
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper concerns the implementation of adaptive controllers, in particular Finite State Machines (FSMs) that change their behavior at run-time. The main emphasis is to develop a technique for creating very dense-coded FSMs in order to reduce SoC programming cost. We propose an approach that combines memory-based function generators with a programmable logic to achieve proper results. For experimental tests of our FSM core we utilized a Xilinx Virtex FPGA.
Web-page classification through summarization
Authors: Dou Shen, Zheng Chen, Qiang Yang, Hua-Jun Zeng, Benyu Zhang, Yuchang Lu, Wei-Ying Ma
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Web-page classification is much more difficult than pure-text classification due to a large variety of noisy information embedded in Web pages. In this paper, we propose a new Web-page classification algorithm based on Web summarization for improving the accuracy. We first give empirical evidence that ideal Web-page summaries generated by human editors can indeed improve the performance of Web-page classification algorithms. We then propose a new Web summarization-based classification algorithm and evaluate it along with several other state-of-the-art text summarization algorithms on the LookSmart Web directory. Experimental results show that our proposed summarization-based classification algorithm achieves an approximately 8.8% improvement as compared to pure-text-based classification algorithm. We further introduce an ensemble classifier using the improved summarization algorithm and show that it achieves about 12.9% improvement over pure-text based methods.
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree
Authors: Carsten Thomassen
Venue: Combinatorica (2002)

We prove that, for each &#xfb01;xed real number c > 1/3, the triangle-free graphs of minimum degree at least cn (where n is the number of vertices) have bounded chromatic number. This problem was raised by Erd&#x0151;s and Simonovits in 1973 who pointed out that there is no such result for c < 1/3.
Cache Optimization For Embedded Processor Cores: An Analytical Approach
Authors: Arijit Ghosh, Tony Givargis
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Embedded microprocessor cores are increasingly beingused in embedded and mobile devices. The softwarerunning on these embedded microprocessor cores is often apriori known, thus, there is an opportunity for customizingthe cache subsystem for improved performance. In thiswork, we propose an efficient algorithm to directly computecache parameters satisfying desired performance criteria.Our approach avoids simulation and exhaustiveexploration, and, instead, relies on an exact algorithmicapproach. We demonstrate the feasibility of our algorithmby applying it to a large number of embedded systembenchmarks.
Comparing Transaction Commit Protocols for Mobile Environments
Authors: Christophe Bobineau, Cyril Labbe, Claudia Roncancio, Patricia Serrano-Alvarado
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper presents a study of protocols to commit transactions distributed over several mobile and fixed units. Performance indices regarding to the number of mobile units involved in a transaction and the connectivity characteristics of the environment are given.
Exact Bayesian Structure Discovery in Bayesian Networks
Authors: Mikko Koivisto, Kismat Sood
Venue: The Journal of Machine Learning Research (2004)

Learning a Bayesian network structure from data is a well-motivated but computationally hard task. We present an algorithm that computes the exact posterior probability of a subnetwork, e.g., a directed edge; a modified version of the algorithm finds one of the most probable network structures. This algorithm runs in time O(n 2n + nk+1C(m)), where n is the number of network variables, k is a constant maximum in-degree, and C(m) is the cost of computing a single local marginal conditional likelihood for m data instances. This is the first algorithm with less than super-exponential complexity with respect to n. Exact computation allows us to tackle complex cases where existing Monte Carlo methods and local search procedures potentially fail. We show that also in domains with a large number of variables, exact computation is feasible, given suitable a priori restrictions on the structures; combining exact and inexact methods is also possible. We demonstrate the applicability of the presented algorithm on four synthetic data sets with 17, 22, 37, and 100 variables.
Self-Managing Remote Object Interconnections
Authors: Stefan Paal, Reiner Kammuller, Bernd Freisleben
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The interconnection of remote objects in a heterogeneous network environment like the Internet is typically achieved by employing object-oriented middleware approaches (OOM) like CORBA or Java RMI. While they offer various options to configure and to adjust the actual binding process, they typically lack features for self-managing the configuration, e.g. selecting the proper protocol settings for establishing a TCP link. In this paper, we present a new approach supporting the self-management of object interconnections. It relies on an integration middleware called Remote Method Streaming which is able to dynamically customize an object interconnection across different OOM and without affecting a running application. In addition, the actual self-managing features can be implemented independent of the current application and communication approach, respectively. The paper describes the conceptual details of our approach, the related implementation in Java and finally illustrates its application.