ppxscal/embedding_network huggingface dataset:
An abstraction-based approach to measuring the structural similarity between two unordered XML documents
Authors: Marco Mesiti, Elisa Bertino, Giovanna Guerrini
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Measuring the structural similarity between two document-centric XML documents is a well-known problem. Many approaches have been proposed that, by fixing constraints in the evaluation of similarity, compute the similarity with polynomial time complexity. Despite this huge activity for document-centric XML documents, no approaches have been presented so far for data-centric XML documents (i.e., XML documents for which order among elements is not relevant) mainly because this problem is, in general, NP-complete. In this paper we propose an approach for measuring the structural similarity between two data-centric XML documents that, when the structure of elements with the same label is not heterogenous, is polynomial.
Real Option Data Requirements of Power System Data for Competitive Bidding
Authors: Guillermo Gutiérrez-Alcaraz, Gerald B. Sheblé
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The interaction of markets and the power system network is stronger based on real options analysis than on traditional single event net present value analysis. The optionality of network restrictions due to congestion increases the importance of network information beyond the values found with traditional net present value for bidding. This paper demonstrates the importance of option analysis in the bidding process. The value of high volatility, due to network congestion and to network operating restrictions, leads to larger valuations. As always, larger uncertainty leads to larger values when opportunities can be recognized in advance. This paper shows how such information can be used in the bidding process.
Preface to Locus Solum
Authors: Pierre-Louis Curien
Venue: Mathematical Structures in Computer Science (2001)

The theory presented here is a new, radical step in the research program that started with linear logic and aiming at an interactive, resource and space conscious account of reasoning and programming.
How clean is the future of SOAP?
Authors: Conan C. Albrecht
Venue: Communications of the ACM (2004)

If developers are not wise with its application, SOAP may lose the ability to tunnel through firewalls---an ability that represents one of its primary advantages.
Security Issues for the Semantic Web
Authors: Bhavani Thuraisingham
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

This paper first describes the developments insemantic web and then provides an overview ofsecure semantic web. In particular XML security,RDF security, and secure information integrationand trust on the semantic web are discussed. Finallydirections for research on secure semantic web areprovided.
Organizing multicast receivers deterministically by packet-loss correlation
Authors: Brian Neil Levine, Sanjoy Paul, J. J. Garcia-Luna-Aceves
Venue: Multimedia Systems (2003)

The ability to trace multicast paths is currently available on the Internet by means of Internet Group Management Protocol MTRACE packets. We introduce Tracer, a protocol that organizes the receivers of a multicast group deterministically into a logical tree structure while maintaining exact packet-loss correlation for local error recovery, and without requiring any changes to existing multicast routing protocols. Tracer uses MTRACE packets in the Internet Group Management Protocol to allow a receiver host to obtain its path to the source of a multicast group. Receivers use the multicast path information to determine how to achieve local error recovery and effective congestion control. We compare the tracing approach with prior mechanisms that attempt local recovery. Results of measurements carried out over the Collaborative Advanced Internet Research Network illustrate the fact that tracing multicast paths is an effective tool to organize receivers based on their packet-loss correlation.
Peer-to-peer overlay broker networks in an event-based middleware
Authors: Peter R. Pietzuch, Jean Bacon
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

Overlay broker networks are an important part of an event-based middleware. In this paper, we investigate the requirements of overlay broker networks and argue that using peer-to-peer techniques for their creation and the content-based routing of events has many advantages. We support our claims with an experimental evaluation of Hermes, an event-based middleware architecture that uses a peer-to-peer routing substrate, in comparison with a standard publish/subscribe system that has a simple, predefined overlay topology. The results reveal that Hermes has better routing efficiency and keeps less routing state at the event brokers.
A fast solver for the orthogonal spline collocation solution of the biharmonic Dirichlet problem on rectangles
Authors: Bernard Bialecki
Venue: Journal of Computational Physics (2003)

A fast Schur complement algorithm is presented for computing the piecewise Hermite bicubic orthogonal spline collocation solution of the biharmonic Dirichlet problem on a rectangular region. On an N × N uniform partition, the algorithm, which involves the preconditioned conjugate gradient method and fast Fourier transforms, requires O(N2 log2 N) arithmetic operations.
Specification criticism via goal-directed envisionment
Authors: Keith Downing, Stephen Fickas
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

Validating a complex system specification is a difficult problem. Generating behaviors and using them to critique a specification is one effective approach. Up until now, symbolic evaluation has been the key technique of behavior generation. Unfortunately, it has drawbacks both in the amount of time it takes to complete a symbolic run, and in the large amount of uninteresting data it produces.We propose goal-directed envisionment as an alternative to symbolic evaluation, supplementing the basic envisioning techniques of qualitative physics with behavioral goals. This approach overcomes the problems of symbolic evaluation by generating interpretations in a reasonable amount of time and by exploiting goals to prioritize and analyze the interpretations.This paper describes and evaluates SC, an implemented system which employs goal-directed envisionment to critique specifications.
Understanding Project Sociology by Modeling Stakeholders
Authors: Ian Alexander, Suzanne Robertson
Venue: IEEE Software (2004)

Ian Alexander and Suzanne Robertson have collaborated on ways to improve how they involve stakeholders in projects. Here, they summarize the approach they've been taking to discover the right stakeholders and maintain their involvement.
Normal forms for context-free node-rewriting hypergraph grammars
Authors: Renate Klempien-Hinrichs
Venue: Mathematical Structures in Computer Science (2002)

Confluent node-rewriting hypergraph grammars represent the most comprehensive known method for defining sets of hypergraphs in a recursive way. For a large natural subclass of these grammars, we show that the maximal rank of hyperedges indispensable for generating some set of hypergraphs equals the maximal rank of the hyperedges occurring in the hypergraphs of that set. Moreover, if such a grammar generates a set of graphs, one can construct from that grammar a C-edNCE graph grammar generating the same set of graphs.
Knowledge discovery from structured data represented by graphs
Authors: Roy Villafane
Venue:  (2003)

Data mining is very useful for gleaning insight about entities that can be described by, have, generate, or otherwise deal with large volumes of data. Traditional methods discover and present acquired knowledge not only as relationships between two attributes, but often between sets of attributes. However, further knowledge can be acquired by considering a discovered fact as something more than a set or a sequence. As a set, a fact is simply a flat list of items, where ordering is sometimes not important. Allowing a fact to be a structured entity, such as a graph, makes it a more informative medium than if it just were a set. Many natural and artificial objects are inherently structured and complex. Data is acquired from operation of a factory, including sensors and other mechanical objects. Database operations (transactions, query subsystems), computer systems (file systems, network operations, program traces, performance data), medical issues (temporal and other relationships among symptoms, illnesses and treatments), and other sources are also rich in structure. This data can be processed using the proposed methodology to reveal interesting and unexpected relationships and behavior, which would go unnoticed, were it only processed using queries or other data mining methods that are not designed to handle structured data. The methodology for the automated discovery of such structured facts in arbitrary multigraphs (not just transactionally partitioned) using a guided search of the entire associated combinatorial space is proposed and studied. Benefits, limitations, and other associated issues are discussed.
Propagating constants past software to hardware peripherals on fixed-application embedded systems
Authors: Greg Stitt, Frank Vahid
Venue: Compilers and operating systems for low power (2003)

Many embedded systems include a microprocessor that executes a single program for the lifetime of the system. These programs often contain constants used to initialize control registers in peripheral hardware components. Now that peripherals are often purchased in intellectual property (core) form and synthesized along with the microprocessor onto a single chip, new optimization opportunities exist. We introduce one such optimization, which involves propagating the initialization constants past the microprocessor to the peripheral, such that synthesis can further propagate the constants inside the peripheral core. While constant propagation in synthesis tools is commonly done, this work illustrates the benefits of recognizing initialization constants from the software as really being constants for hardware. We describe results that demonstrate 2-3 times reductions in peripheral size, and 10-30% savings in power, on several common peripheral examples.
An efficient placement method for large standard-cell and sea-of-gates designs
Authors: H. J. Kappen, F. M. J. de Bont
Venue: Proceedings of the conference on European design automation (1990)

A fast placement algorithm is presented for large Standard-Cell and Sea-of-Gates placement problems. The time complexity of the algorithm is O (n log2n). In comparison with a state of the art conventional placement and routing tool it yields more than 10 % smaller layouts with significantly better timing characteristics. The method underlying this algorithm uses a quadratic cost function of the wire length and has a wider applicability than existing methods. We expect that with this algorithm high quality placements upto 100000 cells can be obtained.
Reasoning with BKBs &ndash; Algorithms and Complexity
Authors: Tzachi Rosen, Solomon Eyal Shimony, Eugene Santos,  Jr.
Venue: Annals of Mathematics and Artificial Intelligence (2004)

Bayesian Knowledge Bases (BKB) are a rule-based probabilistic model that extends the well-known Bayes Networks (BN), by naturally allowing for context-specific independence and for cycles in the directed graph. We present a semantics for BKBs that facilitate handling of marginal probabilities, as well as finding most probable explanations.Complexity of reasoning with BKBs is NP hard, as for Bayes networks, but in addition, deciding consistency is also NP-hard. In special cases that problem does not occur. Computation of marginal probabilities in BKBs is another hard problem, hence approximation algorithms are necessary &ndash; stochastic sampling being a commonly used scheme. Good performance requires importance sampling, a method that works for BKBs with cycles is developed.
Technology for boundaries
Authors: Susanne Bødker, Jannie F. Kristensen, Christina Nielsen, Werner Sperschneider
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

This paper presents a study of an organisation, which is undergoing a process transforming organisational and technological boundaries. In particular, we shall look at three kinds of boundaries: the work to maintain and change the boundary between the organisation and its customers; boundaries between competencies within the organisation; and boundaries between various physical locations of work, in particular between what is done in the office and what is done on site. Maintaining and changing boundaries are the processes through which a particular community sustains its identity and practice on the one hand, and where it is confronted with the identity and practices on the other.The organisation being studied employs a multitude of IT systems that support and maintain these boundaries in a particular manner that are in many ways inappropriate to the current needs of the organisation.After analysing the history and the current boundary work, the paper will propose new technological support for boundary work. In particular the paper will suggest means of supporting boundaries when these are productive and for changing boundaries when this seems more appropriate. In total, flexible technologies seem a core issue when dealing with technology for boundaries.
Factors associated with teacher computer use in kindergarten through grade 12 school music classrooms in alabama, georgia, and florida
Authors: John William Jinright
Venue:  (2003)

This study examined levels of computer use in Kindergarten through Grade 12 music teachers in Alabama, Georgia, and Florida. The study had a dual purpose: (a) to describe the computer use in the music classrooms in Alabama, Georgia, and Florida and (b) to determine factors that are associated with use. A pilot questionnaire was tested and used to construct the final instrument. Music teachers (N = 556) completed a 33-question survey. An examination of sample characteristics found that Florida's music teachers were significantly less likely to hold advanced degrees than teachers from the other states (F(2, 549) = 16.57, p <= .000, &eta;2 = .057). A factor analysis (N = 400) was employed to consolidate variables selected to describe the proclivity of the music teaching environment to support computer use. The variables selected were: suitable software, available computers, attitude, training, age, teaching experience, and computer use. Variables were grouped into two distinct factors, Environment and Experience, which described the nature of the music classroom and its tendency to support computer use. Two subsidiary hypotheses were developed to test the interpretability of the Environment construct. An analysis of variance for the first subsidiary hypothesis found a significant difference in the teaching environment among music teachers of different areas of specialization (F(3, 392) = 3,812, p = .010, &eta; 2 = 028). LSD post hoc tests found general music teachers' environments to be significantly more supportive of computer use than vocal, band, and orchestra teachers (F(3, 392) = 3.812, p = .010, &eta;2 = .028). An analysis of variance for the second subsidiary hypothesis found a significant difference in the support for computer use between music teachers in the three states (F(2, 397) = 3.222, p = .041, &eta;2 = .016). Subsequent follow-up tests revealed that Alabama's support for computer use in the music classroom is significantly less than the other two states. Examination of open-ended responses from the participants revealed several issues that suggest areas for future research.
Validating an Online Adaptive System Using SVDD
Authors: Yan Liu, Srikanth Gururajan, Bojan Cukic, Tim Menzies, Marcello Napolitano
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

One of the goals of verification and validation (V&V) activities for online adaptive control systems is providing assurance that they are able to detect novel system behaviors and provide adequate (safe) control actions. Novel (or abnormal) system behaviors cannot be enumerated or fully and explicitly described in requirements documentation. Therefore, they have to be observed and recognized during the operation. Novelty detection methods, therefore, provide an adequate approach for the V&V purposes.We propose a novelty detection method based on Support Vector Data Description (SVDD) as a candidate approach for validating adaptive control systems. As a one-class classifier, the support vector data description is able to form a decision boundary around the learned data domain with very little or no knowledge of data points outside the boundary (outliers). We apply the SVDD techniques for novelty detection as part of the validation on an Intelligent Flight Control System (IFCS). Experimental results show that the SVDD can be adopted as an effective tool for finding indications of the safe region for the learned domain,whereby we are able to separate faulty behavior from normal events.
Some Identities for Enumerators of Circulant Graphs
Authors: Valery Liskovets
Venue: Journal of Algebraic Combinatorics: An International Journal (2003)

We establish analytically several new identities connecting enumerators of different types of circulant graphs mainly of prime, twice prime and prime-squared orders. In particular, it is shown that the half-sum of the number of undirected circulants and the number of undirected self-complementary circulants of prime order is equal to the number of directed self-complementary circulants of the same order. Several identities hold only for prime orders p such that (p + 1)/2 is also prime. Some conjectured generalizations and interpretations are discussed.
Secure hybrid robust watermarking resistant against tampering and copy attack
Authors: F. Deguillaume, S. Voloshynovskiy, T. Pun
Venue: Signal Processing (2003)

Digital watermarking appears today as an efficient mean of securing multimedia documents. Several application scenarios in the security of digital watermarking have been pointed out, each of them with different requirements. The three main identified scenarios are: copyright protection, i.e. protecting ownership and usage rights; tamper proofing, aiming at detecting malicious modifications; and authentication, the purpose of which is to check the authenticity of the originator of a document. While robust watermarks, which survive to any change or alteration of the protected documents, are typically used for copyright protection, tamper proofing and authentication generally require fragile or semi-fragile watermarks in order to detect modified or faked documents. Further, most of robust watermarking schemes are vulnerable to the so-called copy attack, where a watermark can be copied from one document to another by any unauthorized person, making these schemes inefficient in all authentication applications. In this paper, we propose a hybrid watermarking method joining a robust and a fragile or semi-fragile watermark, and thus combining copyright protection and tamper proofing. As a result this approach is at the same time resistant against copy attack. In addition, the fragile information is inserted in a way which preserves robustness and reliability of the robust part. The numerous tests and the results obtained according to the Stirmark benchmark demonstrate the superior performance of the proposed approach.
A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
Authors: J. K. Dugdale, A. J. W. Hilton
Venue: Combinatorics, Probability and Computing (2000)

The core of a graph G is the subgraph G&Delta; induced by the vertices of maximum degree. We define the deleted core D(G) of G. We extend an earlier sufficient condition due to Hoffman [7] for a graph H to be the core of a Class 2 graph, and thereby provide a stronger sufficient condition. The new sufficient condition is in terms of D(H). We show that in some circumstances our condition is necessary; but it is not necessary in general.
A Large Deviation Result on the Number of Small Subgraphs of a Random Graph
Authors: Van H. Vu
Venue: Combinatorics, Probability and Computing (2001)

Fix a small graph H and let YH denote the number of copies of H in the random graph G(n, p). We investigate the degree of concentration of YH around its mean, motivated by the following questions.&bull; What is the upper tail probability Pr(YH &ge; (1 + ε)&Eopf;(YH))?&bull; For which &lambda; does YH have sub-Gaussian behaviour, namely***** Insert formula here *****where c is a positive constant?&bull; Fixing &lambda; = &omega;(1) in advance, find a reasonably small tail T = T(&lambda;) such that***** Insert formula here *****We prove a general concentration result which contains a partial answer to each of these questions. The heart of the proof is a new martingale inequality, due to J. H. Kim and the present author [13].
Semantics of paragraphs
Authors: Wlodek Zadrozny, Karen Jensen
Venue: Computational Linguistics (1991)

We present a computational theory of the paragraph. Within it we formally define coherence, give semantics to the adversative conjunction "but" and to the Gricean maxim of quantity, and present some new methods for anaphora resolution.The theory precisely characterizes the relationship between the content of the paragraph and background knowledge needed for its understanding. This is achieved by introducing a new type of logical theory consisting of an object level, corresponding to the content of the paragraph, a referential level, which is a new logical level encoding background knowledge, and a metalevel containing constraints on models of discourse (e.g. a formal version of Gricean maxims). We propose also specific mechanisms of interaction between these levels, resembling both classical provability and abduction. Paragraphs are then represented by a class of structures called p-models.
Maintaining discovered frequent itemsets: cases for changeable database and support
Authors: Xiao Ping Du, Shi Wei Tang, Akifumi Makinouchi
Venue: Journal of Computer Science and Technology (2003)

Mining frequent itemsets from large databases has played an essential role in many data mining tasks. It is also important to maintain the discovered frequent itemsets for these data mining tasks when the database is updated. All algorithms proposed so far for the maintenance of discovered frequent itemsets are only performed with a fixed minimum support, which is the same as that used to obtain the discovered frequent itemsets. That is, users cannot change the minimum support even if the new results are unsatisfactory to the users. In this paper two new complementary algorithms, FMP (First Maintaining Process) and RMP (Repeated Maintaining Process), are proposed to maintain discovered frequent itemsets in the case that new transaction data are added to a transaction database. Both algorithms allow users to change the minimum support for the maintenance processes. FMP is used for the first maintaining process, and when the result derived from the FMP is unsatisfactory, RMP will be performed repeatedly until satisfactory results are obtained. The proposed algorithms re-use the previous results to cut down the cost of maintenance. Extensive experiments have been conducted to assess the performance of the algorithms. The experimental results show that the proposed algorithms are very resultful compared with the previous mining and maintenance algorithms for maintenance of discovered frequent itemsets.