ppxscal/embedding_network huggingface dataset:
Active documents in XML
Authors: Luca Bompani, Paolo Ciancarini, Fabio Vitali
Venue: ACM SIGWEB Newsletter (1999)

XML is an extremely promising approach to the standardization of most data structures, but the rendering semantics proposed with XSL is not sufficiently general, lacking support for arbitrary graphic objects and sophisticated notations.In this paper we introduce XMLC, a generic, modular XML browser that can display any kind of notation required for XML documents, and we also discuss the use of XMLC for active documents.
De-Lurking in Virtual Communities: A Social Communication Network Approach to Measuring the Effects of Social and Cultural Capital
Authors: Sheizaf Rafaeli, Gilad Ravid, Vladimir Soroka
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

The a-symmetry of activity in virtual communities is of great interest. While participation in the activities of virtual communities is crucial for a community's survival and development, many people prefer lurking, that is passive attention over active participation. Often, lurkers are the vast majority. There could be many reasons for lurking. Lurking can be measured and perhaps affected by both dispositional and situational variables. This project investigates social and cultural capital, situational antecedents of lurking and de-lurking. We propose a novel way of measuring such capital, lurking, and de-lurking. We try to figure out what are the triggers to active participation. We try to answer this by mathematically defining a social communication network of activities in authenticated discussion forums. Authenticated discussion forums provide exact log information about every participant's activities and allow us to identify lurkers that become first time posters. The proposed Social Communication Network approach (SCN) is an extension of the traditional social network methodology to include, beyond human actors, discussion topics (e.g. Usenet newsgroups threads) and subjects of discussions (e.g. Usenet groups) as well. In addition the Social Communication Network approach distinguishes between READ and POST link types. These indicate active participation on the part of the human actor. We attempt to validate this model by examining the SCN using data collected in a sample of 82 online forums. By analyzing a graph structure of the network at moments of initial postings we verify several hypotheses about causes of de-lurking and provide some directions towards measuring active participation in virtual communities.
Constructing Trees in Graphs whose Complement has no K2,s
Authors: Edward Dobson
Venue: Combinatorics, Probability and Computing (2002)

We show that, if G is a graph of order n with maximal degree &Delta;(G) and minimal degree &delta;(G) whose complement contains no K2,s, s &#x2265; 2, then G contains every tree T of order n&minus;s+1 whose maximal degree is at most &Delta;(G) and whose vertex of second-largest degree is at most &delta;(G). We then show that this result implies that special cases of two conjectures are true. We verify that the Erd&ouml;s&ndash;S&oacute;s conjecture, which states that a graph whose average degree is larger than k&minus;1 contains every tree of order k+1, is true for graphs whose complement does not contain a K2,4, and the Koml&oacute;s&ndash;S&oacute;s conjecture, which states that every graph of median degree at least k contains every tree of order k+1, is true for graphs whose complement does not contain a K2,3.
Asymptotic properties of the Fisher kernel
Authors: Koji Tsuda, Shotaro Akaho, Motoaki Kawanabe, Klaus-Robert Müller
Venue: Neural Computation (2004)

This letter analyzes the Fisher kernel from a statistical point of view. The Fisher kernel is a particularly interesting method for constructing a model of the posterior probability that makes intelligent use of unlabeled data (i.e., of the underlying data density). It is important to analyze and ultimately understand the statistical properties of the Fisher kernel. To this end, we first establish sufficient conditions that the constructed posterior model is realizable (i.e., it contains the true distribution). Realizability immediately leads to consistency results. Subsequently, we focus on an asymptotic analysis of the generalization error, which elucidates the learning curves of the Fisher kernel and how unlabeled data contribute to learning. We also point out that the squared or log loss is theoretically preferable--because both yield consistent estimators--to other losses such as the exponential loss, when a linear classifier is used together with the Fisher kernel. Therefore, this letter underlines that the Fisher kernel should be viewed not as a heuristics but as a powerful statistical tool with well-controlled statistical properties.
Logical foundations of active databases
Authors: Hector Levesque
Venue:  (2003)

Classical database management systems (DBMSs) have been enhanced over the past fifteen years with the addition of rule-based programming to obtain active DBMSs. Active behavior is mainly characterized by a rule language and an execution model. Execution models go hand in hand with advanced transaction models (ATMs) which relax the so-called ACID (Atomicity-Consistency-Isolation-Durability) properties. Both rule languages and execution models have been proposed in an ad hoc way to deal with applications which are not easily implementable using the classical DBMSs. Therefore an open problem in this area is to formally account for active behavior using a uniform formalism. This thesis gives logical foundations to active databases using the situation calculus, a logic for reasoning about actions. Our approach appeals to theories in which one may refer to all past database states. We give a logical semantics to an ATM by specifying this as a theory of the situation calculus called basic relational theory, which is a set of sentences suitable for referring to past database states in the context of database transactions. We express the properties of the ATM as formulas of the same calculus. Such properties are logically entailed by the basic relational theory that captures the ATM. We illustrate our framework by formalizing various transaction models. Next, we introduce active relational theories , which extend basic relational theories by capturing typical aspects of active behavior found in existing active DBMSs. We give a formal semantics to various features of active behavior by using active relational theories. We capture the most popular active rules, the Event-Condition-Action (ECA) rules, as programs written in a situation calculus based logic programming language that accounts for parallelism and we also write transaction programs transaction programs that have active relational theories as background axioms. We also classify various execution semantics for ECA rules. Finally, we give a method for implementing active relational theories in Prolog.
Special Section: Evolutionary Design
Authors: Peter Bentley
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

This issue of AIEDAM is the second in a series of three &ldquo;mini&rdquo; special issues on Evolutionary Design by computers. The papers continue the theme that began in Vol. 13, No. 3, 1999, of using Evolutionary Computation for design problems. The first paper by Eby, Averill, Punch and Goodman provides an excellent overview of the most recent work at Michigan State University on this subject. They describe their work on the optimization of flywheels by an injection island genetic algorithm, and show the importance of minimizing the computation time devoted to evaluation for such real-world applications.
Identification of contact regions in semiconductor transistors by level-set methods
Authors: Weifu Fang, Kazufumi Ito
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper we present the formulation of level-set methods for the inverse problem of identifying an interface in the coefficient of an elliptic equation from a boundary measurement. This problem arises from the modeling of the identification of contact regions by boundary measurements for semiconductor transistors. We propose the Gauss-Newton direction as the interface velocity, and implement the scheme for a parameterized class of interfaces.
The impact of ubiquitous computing on a teacher's practice: factors and conditions affecting the operationalizing of a constructivist teaching philosophy
Authors: Diane Bottomley
Venue:  (2003)

The purpose of this study was to explore the impact of how ubiquitous computing would affect an elementary teacher's ability to more fully operationalize her existing constructivist teaching philosophy. Research on computing technologies in K&ndash;12 schools has documented that there are numerous important barriers to technology integration in the classroom, one of which is access to computer technologies. In addition, the research documents that new technologies can act as a catalyst toward teacher change of instructional practices over time when using such technologies for teaching and learning. The literature also suggests that a teacher's use of computing technologies may contribute to a shift toward more constructivist teaching practices. Ubiquitous computing technologies are becoming more and more prevalent in K&ndash;12 schools and are removing the barriers of sufficient access and related issues of infrastructure, making it increasingly feasible to study the impact of computer-saturated environments on teaching and learning. This qualitative single case study investigated the impact of full-time inschool computer ubiquity via wireless laptops for every student and the teacher in this fifth grade classroom during the 2002&ndash;2003 school year. Qualitative methods were used in the gathering and analysis multiple forms of data. Findings. (1) Key enabling conditions of ubiquitous technology-supported constructivist practices were (i) peer support and collaboration, (ii) ubiquitous access to information, curriculum, and tools, (iii) time to plan and implement inquiry-based instruction, (iv) technical support, technical knowledge, and reliable hardware, and (v) software to support student construction of knowledge and projects. (2) This teacher's preexisting pedagogical beliefs positively impacted her ability to implement and sustain a shift toward more constructivist teaching practices. (3) Computing ubiquity facilitated this teacher's (i) planning for inquiry-based learning activities, (ii) ability to remain flexible and spontaneous, (iii) desire and motivation to pursue her own professional inquiry, (iv) it reduced the amount of risk required to make and sustain changes of pedagogy coupled with high technology use, and (v) it accelerated the time required to assume ownership of a technological innovation. This study concludes with the suggestion for a new model of ubiquitous computing based upon the findings of this study.
A spanning-tree-based genetic algorithm for some instances of the rectilinear Steiner problem with obstacles
Authors: Rita M. Hare, Bryant A. Julstrom
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Given sets of points and obstacles in the plane, the rectilinear Steiner problem with obstacles seeks to connect the points with a rectilinear Steiner tree---a tree made up of vertical and horizontal line segments---that avoids the obstacles and has minimum total length. We consider only rectangular obstacles and further restrict the problem by requiring that it be possible to connect every point to the tree via exactly one vertical and one horizontal segment. Rectilinear Steiner trees that conform to this restriction can be represented by spanning trees augmented to specify the rectilinear segments. A genetic algorithm that uses a spanning-tree-based coding of rectilinear Steiner trees outperforms a greedy heuristic on 45 instances of the problem, of up to 469 points and 325 obstacles. However, the coding cannot represent arbitrary rectilinear Steiner trees, so it cannot address the unrestricted case, and in the case considered here, it leaves some potentially shorter trees unexamined.
Creating the Collaborative Organisation: The Promise of Relationship Management
Authors: Jane Coughlan, Mark Lycett, Robert D. Macredie
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Collaboration within an organisation can be said to be subject to the effective management of relationships. This study focuses on one such relationship, that between the business and IT sides of an organisation, which need to communicate and coordinate their activities for thesuccessful development of working systems. The management of this key organisational relationship has been given increased attention with the set-up of Relationship Management' programmes, envisioned to mediate and improve organisational relations, strategy and performance, by bridging activities between the business and IT. To investigate the potential efficacy of such an initiative, this study looks at Relationship Management within a major UK bank, with the aid of a communication framework. Interviews with 29 individuals from the mid-high management level of the retail business and IT departments revealed mixed perceptions of the efficacy of such a programme. The merits of such an initiative in creating a one-team culture within this organisation are debated against the backdrop of the underlying problems that this particular organisation faces.
Exact Expectations and Distributions for the Random Assignment Problem
Authors: Sven Erick Alm, Gregory B. Sorkin
Venue: Combinatorics, Probability and Computing (2002)

A generalization of the random assignment problem asks the expected cost of the minimum-cost matching of cardinality k in a complete bipartite graph Km,n, with independent random edge weights. With weights drawn from the exponential distribution with intensity 1, the answer has been conjectured to be&Sigma;i,j&ge;0, i+j<k1/(m&minus;i)(n&minus;j).Here, we prove the conjecture for k &les; 4, k = m = 5, and k = m = n = 6, using a structured, automated proof technique that results in proofs with relatively few cases. The method yields not only the minimum assignment cost's expectation but the Laplace transform of its distribution as well. From the Laplace transform we compute the variance in these cases, and conjecture that, with k = m = n &rarr; &infin;, the variance is 2&#x002F;n + O(log n&#x002F;n2). We also include some asymptotic properties of the expectation and variance when k is fixed.
Screening and interpreting multi-item associations based on log-linear modeling
Authors: Xintao Wu, Daniel Barbará, Yong Ye
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Association rules have received a lot of attention in the data mining community since their introduction. The classical approach to find rules whose items enjoy high support (appear in a lot of the transactions in the data set) is, however, filled with shortcomings. It has been shown that support can be misleading as an indicator of how interesting the rule is. Alternative measures, such as lift, have been proposed. More recently, a paper by DuMouchel et al. proposed the use of all-two-factor loglinear models to discover sets of items that cannot be explained by pairwise associations between the items involved. This approach, however, has its limitations, since it stops short of considering higher order interactions (other than pairwise) among the items. In this paper, we propose a method that examines the parameters of the fitted loglinear models to find all the significant association patterns among the items. Since fitting loglinear models for large data sets can be computationally prohibitive, we apply graph-theoretical results to divide the original set of items into components (sets of items) that are statistically independent from each other. We then apply loglinear modeling to each of the components and find the interesting associations among items in them. The technique is experimentally evaluated with a real data set (insurance data) and a series of synthetic data sets. The results show that the technique is effective in finding interesting associations among the items involved.
An Analysis of Virtual Private Network Solutions
Authors: Gustav Rosenbaum, William Lau, Sanjay Jha
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

VPN services have been available for decades but notwidely used until recently.A combination of new VPN technologies,network technologies and business communicationrequirements is the driving force behind the take-upof VPN services.This paper gives an overview of recentVPN solutions and analysis their scalability and flexibility.VPN solutions are categorized and related to potentialcustomer segments.Furthermore, measurement based ona large north-American carrier's backbone are presented.The results show that provision of a moderate number oflarge VPNs puts higher constraints on the provider networkthan a large number of moderately sized VPNs.
CORDS multidatabase project: research and prototype overview
Authors: Neil Coburn, T. Patrick Martin, Per-Åke Larson, Jacob Slonim
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

One of the data services offered within the CORDS Service Environment is a multidatabase. Fulfilling this service requirement is the man date of the CORDS Multidatabase project involving researchers at the University of Waterloo and Queen's University. One objective of this project is to research issues in multidatabase systems. Thus far these include schema integration, (global) query decomposition and optimization, and distributed transaction management. A second objective is to design and implement a multidatabase prototype. The latter objective presented an opportunity to explore and assess a number of international and industry standards: for example, Microsoft's Open Database Connectivity (oDBC) and the Open Software Foundation's Distributed Computing Environment (OSF/DCE).This paper discusses the overall design of the multidatabase, the research issues addressed, and the status of the prototype implementation.
A Bus Encoding Technique for Power and Cross-talk Minimization
Authors: P. Subrahmanya, R. Manimegalai, V. Kamakoti, Madhu Mutyam
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Considerable research has been done in the areaof bus-encoding techniques, for either power minimization or cross-talk elimination in system-level buses, butnot both together. We propose No Adjacent Transition(NAT) coding scheme, a bus encoding technique that simultaneously reduces power consumption and eliminatescross-talk. NAT-encoding and decoding algorithms areproposed and an analytical study of power dissipation ispresented.
A Posteriori Error Estimators for Regularized Total Variation of Characteristic Functions
Authors: Francesca Fierro, Andreas Veeser
Venue: SIAM Journal on Numerical Analysis (2003)

We consider a nonuniformly elliptic double obstacle problem arising from "convexifying" and regularizing a minimization of a functional with total variation in the set of characteristic functions. We derive a posteriori estimators for the discretization error with linear finite elements, which are uniform in the regularization, incorporate computable and local information on the conditioning, vanish in the intersection of discrete and exact contact sets, and are not affected by possible nonuniqueness. Moreover, we integrate these estimators in an adaptive algorithm and illustrate their properties by various numerical experiments.
Modelling and performance evaluation of mobile multimedia systems using QoS-GSPN
Authors: Tony Tsang
Venue: Wireless Networks (2003)

Quality of Service (QoS) measurement of multimedia applications is one of the most important issues for call handoff and call admission control in mobile networks. Based on the QoS measures, we propose a Generalized Stochastic Petri Net (GSPN) based model, called QoS-GSPN, which can express the real-time behavior of QoS measurement for mobile networks. QoS-GSPN performance analysis methodology includes the formal expression and performance analysis environment. It offers the promise of providing real-time behavior predictability for systems characterized by substantial stochastic behavior. With this methodology we model and analyze the call handoff and call admission control schemes in the different multimedia traffic environments of a mobile network. The results of simulation experiments are used to verify the optimal performance achievable for these schemes under the QoS constraints in the given setting of design parameters.
Trends in the evolution of the database curriculum
Authors: Mary Ann Robbert, Catherine M. Ricardo
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This paper focuses on the current database curriculum and how it reflects changes in the practice of data management. The content of the database course is determined using a series of three surveys given to groups of database educators over a period of four years. The results of these surveys are presented in the paper and are used to indicate trends in database courses as they are actually taught. The paper examines the different focus choices used in the introductory database course and describes how these have changed during the period, 1999-2002. The paper also examines how actual database curricula compare with the CC2001 curriculum recommendations.
A horizontal stereoscopic projection system for working at the artist studio & Mimesis, the function that made the organ
Authors: Agueda Simó
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

Stereoscopy is a very strong emotional and esthetic factor in visual arts and can be greatly explored using stereoscopic projection systems. However, due to their high cost these systems are very restricted to artists. In this sketch, I describe a horizontal stereoscopic projection system, inspired in the "Responsive Workbench" (GMD, Germany) and the "Taula estereosc&oacute;pica" (UPC, Spain ), that is low cost and can be set up in a small studio. In addition, this system has advantages over vertical projection systems as it is shown in Mimesis, the function that made the organ.
Visual structures for image browsing
Authors: Ricardo S. Torres, Celmar G. Silva, Claudia B. Medeiros, Heloisa V. Rocha
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Content-Based Image Retrieval (CBIR) presents several challenges and has been subject to extensive research from many domains, such as image processing or database systems. Database researchers are concerned with indexing and querying, whereas image processing experts worry about extracting appropriate image descriptors. Comparatively little work has been done on designing user interfaces for CBIR systems. This, in turn, has a profound effect on these systems since the concept of image similarity is strongly influenced by user perception. This paper describes an initial effort to fill this gap, combining recent research in CBIR and Information Visualization, studied from a Human-Computer Interface perspective. It presents two visualization techniques based on Spiral and Concentric Rings implemented in a CBIR system to explore query results. The approach is centered on keeping user focus on both the query image, and the most similar retrieved images. Experiments conducted so far suggest that the proposed visualization strategies improves system usability.