ppxscal/embedding_network huggingface dataset:
Effectiveness of Information Extraction, Multi-Relational, and Semi-Supervised Learning for Predicting Functional Properties of Genes
Authors: Mark-A. Krogel, Tobias Scheffer
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We focus on the problem of predicting functional propertiesof the proteins corresponding to genes in the yeastgenome. Our goal is to study the effectiveness of approachesthat utilize all data sources that are availablein this problem setting, including unlabeled and relationaldata, and abstracts of research papers. We study transductionand co-training for using unlabeled data. We investigatea propositionalization approach which uses relationalgene interaction data. We study the benefit of informationextraction for utilizing a collection of scientific abstracts.The studied tasks are KDD Cup tasks of 2001 and 2002.The solutions which we describe achieved the highest scorefor task 2 in 2001, the fourth rank for task 3 in 2001, thehighest score for one of the two subtasks and the third placefor the overall task 2 in 2002.
Using Column Dependency to Compress Tables
Authors: Binh Dao Vo, Kiem-Phong Vo
Venue: Proceedings of the Conference on Data Compression (2004)

Large amounts of business data are kept in tables of fixed-length records. Columns in such a table may be functionally dependent on one another, resulting in low overall information content. This paper shows how to exploit this source of information redundancy to compress table data. Experiments with a wide variety of massive tables including telecom data and stock quotes show that this technique compresses table data well, up to 48:1 or even 100:1 reduction in some cases.
Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques
Authors: Huseyin Polat, Wenliang Du
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Collaborative Filtering (CF) techniques are becomingincreasingly popular with the evolution of the Internet. Toconduct collaborative filtering, data from customers areneeded. However, collecting high quality data from customersis not an easy task because many customers areso concerned about their privacy that they might decide togive false information. We propose a randomized perturbation(RP) technique to protect users' privacy while stillproducing accurate recommendations.
Usability trade-offs for adaptive user interfaces: ease of use and learnability
Authors: Tim F. Paymans, Jasper Lindenberg, Mark Neerincx
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

An analysis of context-aware user interfaces shows that adaptation mechanisms have a cost-benefit trade-off for usability. Unpredictable autonomous interface adaptations can easily reduce a system's usability. To reduce this negative effect of adaptive behaviour, we have attempted to help users building adequate mental models of such systems. A user support concept was developed and applied to a context-aware mobile device with an adaptive user interface. The approach was evaluated with users and as expected, the user support improved ease of use, but unexpectedly it reduced learnability. This shows that an increase of ease of use can be realised without actually improving the user's mental model of adaptive systems.
A study of three esl teachers' beliefs about the roles of teachers and l2 learning and their integration of computers
Authors: Hoe Kyeung Kim
Venue:  (2003)

It is often assumed that the use of computers in classrooms will enhance teachers' effectiveness in their teaching practices by creating a constructivist learning environment without consideration of the teachers' purposes for implementing computers. However, it is necessary to understand the teacher's perspectives about computers since teachers play a significant role in how computers are used in the classroom. This study explored three ESL teachers' integration of Computer-Assisted Language Learning (CALL) in their college-level classrooms. Focusing on the role of teachers, especially their beliefs on language teaching, the following three research questions were developed: (1) In what ways, if any, do ESL teachers integrate CALL in their classrooms? (2) What are ESL teachers' beliefs about the roles of computers in their classrooms and the roles of teachers in CALL? (3) How do their beliefs affect their design and integration of CALL? To explore the ESL teachers' use of computers, the methodology of case study was employed. As for data collection, 6 weeks of non-participant observations of three ESL courses (academic skill, composition and pronunciation) and interviews with three teachers regarding their beliefs about L2 teaching were conducted. Based on the findings, four conclusions were made: (1) ESL teachers' beliefs about the computer were context-bounded and interaction-focused; (2) teachers' use of computers did not necessarily yield a constructivist teaching approach; (3) teachers' knowledge of computers did not seem to correlate with the frequency and the amount of their computer use; and (4) attention to the significance and necessity of a teacher education program and mentoring in integrating computers is needed.
Digital document life cycle development
Authors: Henryk Krawczyk, Bogdan Wiszniewski
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The paper reports on the ongoing project IST-2001-33441-MEMORIAL funded by EU under the Framework 5 Programme, aimed at developing an interactive electronic document model suitable for creating a Virtual Memorial Web portal. Documents are based on personal records of prisoners of former Nazi concentration camps, which are mostly machined typed paper forms. Despite the strong focus on historical documents in the project, the OCR and Web technology being developed by the consortium has a great potential for application in other areas, because machine typed documents have been widely used for over half a century and contain huge amount of information that is still needed in the digital world.
A Service Environment for Air Traffic Control Based on SIP
Authors: Klaus Darilion, Christoph Kurth, Wolfgang Kampichler, Karl M. Goeschka
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

The long-term growth of air traffic requires integrated audio and data services to improve the support of air traffic controllers in maintaining safety despite increased capacity. The use of an IP (Internet Protocol) based network for voice and data communication will ease this integration but on the other hand causes new challenges when facing the characteristics of packet based networks.The presented software architecture combines audio services with basic data services and offers interfaces to integrate them with other air traffic control systems. Air traffic control uses radio based air/ground communication. We use the session initiation protocol (SIP) forsetting up audio sessions and the SIP specific event notification to control radios. We implemented a prototype to measure notification delays. Compared with air traffic control requirements the concept is proven in general, but implementation details have to be improved to reach the performance requirements for large systems.
Reasoning about Pointers in Refinement Calculus
Authors: Ralph-Johan Back, Xiaocong Fan, Viorel Preoteasa
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Pointers are an important programming concept. Theyare used explicitely or implicitly in many programming languages.In particular, the semantics of object-oriented programminglanguages rely on pointers. We introduce a semanticsfor pointer structures. Pointers are seen as indexesand pointer fields are functions from these indexes to values.Using this semantics we turn all pointer operationsinto simple assignments and then we use refinement calculustechniques to construct a pointer-manipulating programthat checks whether or not a single linked list has a loop. Wealso introduce an induction principle on pointer structuresin order to reduce complexity of the proofs.
On tabular expressions
Authors: Ryszard Janicki, Alan Wassyng
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Tabular expressions (Parnas et al. [18, 26, 28, 29]) are a means to represent the complex relations that are used to specify or document software systems. A formal model and a semantics for tabular expressions are presented. The model covers most known types of tables used in Software Engineering, and admits precise classification and definition of new types of tables. The practical importance of the semantics of tabular expressions is discussed briefly.
Combined ICA and FCA Schemes for a Hierarchical Network
Authors: Jun Ping Huang, Jeich Mar
Venue: Wireless Personal Communications: An International Journal (2004)

A combined idle channel assignment (ICA) and fixed channel assignment (FCA) scheme is proposed to improve the traffic performance in a hierarchical network. This dual-mode network integrates the Frequency Division Duplex (FDD) and Time Division Duplex (TDD) modes of the Universal Mobile Telecommunication System (UMTS) and Terrestrial Radio Access (UTRA) in a given cell. This approach includes a high traffic load area and a blocked area as an example to evaluate the traffic performance. The ICA threshold and network timeout period effects on the traffic performance of this integrated dual-mode network are also investigated. The analytical results show that the handoff failure probabilities of the integrated dual-mode network can be reduced significantly with a minimal increase in the new call blocking probability when the combined ICA and FCA scheme replaces the FCA scheme. The integrated dual-mode network using the combined ICA and FCA scheme also increases the carried traffic. The traffic performance improvements for non-uniformly generated new calls are more significant than those for uniformly generated new calls when the combined ICA and FCA scheme is used. An increase in the high ICA threshold will result in an increase in the total carried traffic and an increase in the new call blocking and handoff failure probabilities for higher-tiered and low-tiered systems located in the high traffic load area. The traffic performance was evaluated using the discrete time simulation method to validate the analysis results.
An Assessment of Elearning Technologies to Support Telecommunications Laboratory Learning Objectives
Authors: Joyce Lucca, Nicholas C. Romano,  Jr., Ramesh Sharda, Mark Weiser
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

While current distance learning (DL), now sometimes referred to as "eLearning", technologies focus on bringing the classroom to a remote student, the next generation of eLearning, has the potential to bring remote students into the laboratory. Virtual Reality systems are being developed to engage the user as fully as possible within a computer-supported environment.This paper describes an on-going implementation of an environment that allows remote interaction with equipment and other participants that previously required co-location. Technology is used to extend a telecommunications laboratory (lab) to enable acquisition of cognitive, affective and psychomotor skills. New hardware and software are being appliedto develop a virtual lab experience through which remote students can attain learning objectives as well as students that use a traditional face-to-face (F2F) lab environment. A Same-Time/Different-Place (STDP) learning environment can be both a cost effective andconvenient way to educate students. The design, development, and assessment of such a system is presented.
Introduction
Authors: Andrea Corradini, Hartmut Ehrig, Grzegorz Rozenberg, Gabriele Taentzer
Venue: Mathematical Structures in Computer Science (2002)

This special issue of Mathematical Structures in Computer Science is devoted to the theory and applications of graph transformations. This research area dates back to the early seventies and is based on mathematical techniques from graph theory, algebra, logic and category theory. The theory of graph transformations has become attractive as a modelling and programming paradigm for complex graphical structures in a large variety of areas in computer science and for applications to other fields. During the Joint APPLIGRAPH&sol;GETGRATS Workshop on Graph Transformation Systems (GRATRA 2000) &ndash; a satellite of ETAPS 2000 in Berlin &ndash; 35 lectures were presented by participants from all over the world. The authors of presentations that stressed the theoretical point of view were invited to submit a full version of their presentation to Mathematical Structures in Computer Science. After a careful refereeing process nine papers have been accepted, seven of which are included in this special issue.The paper by Ehrenfeucht, Petre, Prescott and Rozenberg connects the important new area of DNA computing in vivo to our area of graph transformation. An application of hypergraph constructions to the static analysis of concurrent systems is presented by K&ouml;nig, and normal forms for context-free node rewriting hypergraph grammars by Klempien-Hinrichs. The construction of pushout complements for &lsquo;partly total algebras&rsquo; generalising attributed graphs is presented by Burmeister, Llabr&eacute;s and Rosell&oacute;. Finally, Courcelle and Makowsky present operations on relational structures (generalising different kinds of graphs and hypergraphs) that are compatible with monadic second order logic. Four other accepted papers could not be included in this special issue because of space limitations.They will appear in regular issues of MSCS:&mdash; R. Heckel, M. Llabr&eacute;s, H. Ehrig and F. Orejas: Concurrency and loose semantics of open graph transformation systems.&mdash; L. Helouet, C. Jard and B. Caillaud: An event structure based semantics for high-level message sequence charts.&mdash; J. Larossa and G. Valiente: Constraint satisfaction algorithms for graph pattern matching.&mdash; N. Verlinden and D. Janssens: Algebraic properties for Local Action Systems.We are most grateful to all the referees of these papers, to Olga Runge and Claudia Ermel for technical support, and to Giuseppe Longo and Cambridge University Press for fruitful cooperation in editing this special issue.
A Software Cost Model for Quantifying the Gain with Considerations of Random Field Environments
Authors: Xiaolin Teng, Hoang Pham
Venue: IEEE Transactions on Computers (2004)

Abstract--In this paper, we present a software gain model under random field environment with consideration of not only time to remove faults during in-house testing, cost of removing faults during beta testing, risk cost due to software failure, but also the benefits from reliable executions of the software during the beta testing and field operation. To our knowledge, this is the first study that incorporates the random field environmental factor into the cost model. We also provide an optimal release policy in which the net gain of the software development process is maximized. This gain model can help managers and developers to determine when to stop testing the software and release it to beta testing users and to end-users.
Just one slice of innovation, please
Authors: Esther Schindler
Venue: netWorker (2003)

We all like to think that humans are hungry for innovation, anxious to find revolutionary products that improve the way we live and work. Recently, though, I've begun to wonder if that's true. I think we want technology to enhance the quality of life, but not actually to change us. Or, at least, the revolution has to arrive packaged in an already-acceptable form, nice and convenient, so we don't have to bother learning anything new.
Wireless Networking Considered Flaky
Authors: Eric Allman
Venue: Queue (2003)

You know what bugs me about wireless networking? Everyone thinks it’s so cool and never talks about the bad side of things. Oh sure, I can get on the ’net from anywhere at Usenix or the IETF (Internet Engineering Task Force), but those are _hostile_ _nets_. Hell, all wireless nets are hostile. By their very nature, you don’t know who’s sharing the ether with you. But people go on doing their stuff, confident that they are OK because they’re behind the firewall.
Complex independent component analysis of frequency-domain electroencephalographic data
Authors: Jörn Anemüller, Terrence J. Sejnowski, Scott Makeig
Venue: Neural Networks (2003)

Independent component analysis (ICA) has proven useful for modeling brain and electroencephalographic (EEG) data. Here, we present a new, generalized method to better capture the dynamics of brain signals than previous ICA algorithms. We regard EEG sources as eliciting spatio-temporal activity patterns, corresponding to, e.g. trajectories of activation propagating across cortex. This leads to a model of convolutive signal superposition, in contrast with the commonly used instantaneous mixing model. In the frequency-domain, convolutive mixing is equivalent to multiplicative mixing of complex signal sources within distinct spectral bands. We decompose the recorded spectral-domain signals into independent components by a complex infomax ICA algorithm. First results from a visual attention EEG experiment exhibit: (1) sources of spatio-temporal dynamics in the data, (2) links to subject behavior, (3) sources with a limited spectral extent, and (4) a higher degree of independence compared to sources derived by standard ICA.
Related specifications reuse
Authors: P. Wolff
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

Building a program from an existing one - called design with program reuse - has a number of interesting payoffs but differs from classical program designs. This paper addresses the issue of program reuse in the context in which design is achieved by a transformational development. A design method for making easy the reuse is introduced. The idea is to highlight and exploit the link between two related specifications - the specification for which a program has to be developed and the specification of the program selected to be reused - in order to guide the program reuse. In practice, a set of "Reuse Schemes" is proposed and the program design is done by applying one or several of them to an initial specification. The use of such schemes allows to partially or completely systematize the program reuse by using first-order theorem proving. A reuse example illustrates the proposed design method.
A Note on a Problem by Welsh in First-Passage Percolation
Authors: Sven Erick Alm
Venue: Combinatorics, Probability and Computing (1998)

Consider first-passage percolation on the square lattice. Welsh, who together with Hammersley introduced the subject in 1963, has formulated a problem about mean first-passage times, which, although seemingly simple, has not been proved in any non-trivial case. In this paper we give a general proof of Welsh's problem.
A Protection Environment for Administrators of Windows 2000/XP Against Malicious Program Attacks
Authors: Adrian Spalka, Marcel Winandy
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Malicious programs pose a serious threat to operatingsystems. If an operator can be tricked into running sucha program its abilities to manipulate a system are unlimited.This work, which addresses Windows 2000/XP, is apart of our effort of creating a protected execution environmentfor applications with high security demands. We analyseattacks by malicious programs that manipulate systemcomponents during their installation by an administrator. Itturns out that most of these manipulations are likely to remainunnoticed by the human user. However, we show thatthe operating system's protection mechanisms can be usedto prevent or detect all manipulations that can endanger ourprotected environment. We combine these mechanisms in arestricted shell, which the administrator should use for theexecution of possibly untrustworthy programs.
Optimistic fair contract signing for Web services
Authors: Hiroshi Maruyama, Taiga Nakamura, Tony Hsieh
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

Reliable and atomic transactions are a key to successful e-Business interactions. Reliable messaging subsystems, such as IBM's MQ Series, or broker-based techniques have been traditionally used for this purpose. In this paper, we take a radically different approach to address this problem, which is to apply the idea of Optimistic Fair Contract Signing recently proposed by Asokan, Shoup, and Waidner. We show a design of the protocol based on the latest XML and Web Services Security standards and discuss the benefits and limitations of this approach.
Strategic Equilibrium for a Pair of Competing Servers with Convex Cost and Balking
Authors: Duane Christ, Benjamin Avi-Itzhak
Venue: Management Science (2002)

A two-person game is formulated for a queuing situation involving a pair of exponential servers competing for arriving customers. The servers have identical characteristics except for their service rates. Each server is free to select its own service rate. The objective of each server is to select a service rate that will maximize its own profit. Arrivals are Poisson. The probability that an arriving customer enters the queue is allowed to depend on the queue length at the time of arrival. The proportion of arrivals to a given server is shown to be strictly concave in the server's own service rate and decreasing in the other service rate. Furthermore, we show that when the cost function is convex and increasing, there exists a unique pure strategy Nash equilibrium point for the resulting game.
Applications of sampling and fractional factorial designs to model-free data squashing
Authors: William DuMouchel, Deepak K. Agarwal
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

The concept of "data squashing" was introduced by DuMouchel et al [4] as a method of summarizing massive data sets that preserves statistical relationships among variables. The idea is to create a smaller data set that allows statistical modeling to take place using in-memory algorithms, and to preserve the modeling results more accurately than would a same-size random sample from the massive data set. This research attempts to avoid several limitations of previous approaches to data squashing. Our method avoids the curse of dimensionality by a double use of principal components transformations that makes computing time linear in the number of cases and quadratic in the number of variables. Categorical and continuous variables are smoothly integrated. Because the binning is based on principal components, which are uncorrelated, we can use fractional factorial designs that sample less than one point per bin. We also investigate various weighting schemes for the squashed sample to see whether matching moments or matching subregion data counts is more effective. Finally, previous work required the specification of a statistical model, either to perform the squashing algorithm or to compare the worth of different squashing methods. Our approach to evaluation is model free and does not even require the specification of variables as responses or predictors. Instead, we develop a chi-squared like measure of accuracy to compare the closeness of various discrete densities (the squashed data sets) to the discrete massive data set.