ppxscal/embedding_network huggingface dataset:
XML in Office 2003: Information Sharing with Desktop XML
Authors: Charles F. Goldfarb, Priscilla Walmsley
Venue:  (2003)

Co-authors are the world-renowned inventor of markup languages and a developer of the W3C XML Schema specification Detailed coverage of Office 2003 Professional XML features, plus all the XML knowledge you need to use them Learn to edit your XML document with Word, analyze its data with Excel, store it with Access, and publish it to the Web with FrontPage(R) Build dynamic custom XML forms with the remarkable new InfoPath(TM) 2003-structured data collection with word processing flexibility"This is a book on re-inventing the way millions of people write and interact with documents. It succeeds in communicating the novel underlying vision of Office 2003 XML while focusing on task-oriented, hands-on skills for using the product."Desktop XML affects every Office 2003 Professional Edition user! It transforms millions of desktop computers from mere word processors into rich clients for Web services, editing front-ends for XML content management systems, and portals for XML-based application integration.And this book shows you how to benefit from it. You'll learn exactly what XML can do for you, and you'll master its key concepts, all in the context of the Office products you already know and use.With 200 tested and working code and markup examples and over 150 screenshots and illustrations from the actual shipped product (not betas), you'll see step by step how: Office users can share documents more easily, without error-prone rework, re-keying, or cut-and-paste. Office data from your documents can be captured for enterprise databases. Office documents can be kept up-to-date with live data from Web Services and enterprise data stores. Office solutions can overcome traditional limitations by using XML and Smart Documents.BONUS XML SKILLS SECTION! All the XML expertise you'll need, adapted for Office 2003 users from the best-selling Charles F. Goldfarb's XML Handbook, Fifth Edition: the XML language, XML Schema, XPath, XSLT, Web services ... and more!
Letter to the editor: on the exponential stability of a class of nonlinear systems including delayed perturbations
Authors: Ju H. Park, Ho Y. Jung
Venue: Journal of Computational and Applied Mathematics (2003)

In this letter, the problem of robust stabilization of a class of nonlinear dynamical systems with delayed perturbations is considered. Based on the stability of the nominal systems, a new stabilizing control law for exponential stability of the system is designed using Lyapunov stability theory.
Interoperability architecture using RM-ODP
Authors: Csaba Egyhazy, Raj Mukherji
Venue: Communications of the ACM (2004)

RM-ODP gives architects the level of detail necessary to address key integration and interoperability issues.
Secure mechanical verification of mutually recursive procedures
Authors: Peter V. Homeier, David F. Martin
Venue: Information and Computation (2003)

The verification of programs that contain mutually recursive procedures is a difficult task, and one which has not been satisfactorily addressed in the literature. Published proof rules have been later discovered to be unsound. Verification condition generator (VCG) tools have been effective in partially automating the verification of programs, but in the past these VCG tools have in general not themselves been proven, so any proof using and depending on these VCGs might not be sound. In this paper, we present a set of proof rules for proving the partial correctness of programs with mutually recursive procedures, together with a VCG that automates the use of the proof rules in program correctness proofs. The soundness of the proof rules and the VCG itself have been mechanically proven within the Higher Order Logic theorem prover, with respect to the underlying structural operational semantics of the programming language. This proof of soundness then forms the core of an implementation of the VCG that significantly eases the verification of individual programs with complete security.
Validating and Refining Clusters via Visual Rendering
Authors: Keke Chen, Ling Liu
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The automatic clustering algorithms are known towork well in dealing with clusters of regular shapes, e.g.compact spherical/elongated shapes, but may incur highererror rates when dealing with arbitrarily shaped clusters.Although some efforts have been devoted to addressingthe problem of skewed datasets, the problem of handlingclusters with irregular shapes is still in its infancy,especially in terms of dimensionality of the datasets andthe precision of the clustering results considered. Notsurprisingly, the statistical indices works ineffective invalidating clusters of irregular shapes, too. In this paper,we address the problem of clustering and validatingarbitrarily shaped clusters with a visual framework(VISTA). The main idea of the VISTA approach is tocapitalize on the power of visualization and interactivefeedbacks to encourage domain experts to participate inthe clustering revision and clustering validation process.
Advanced control methods for power electronics systems
Authors: J. Fernando A. da Silva, V. Fernão Pires, Sónia Ferreira Pinto, J. Dionísio Barros
Venue: Mathematics and Computers in Simulation (2003)

The application of modeling methods suitable for control and simulation of power electronic systems is outlined as a self-contained approach to solve the simulation and control problems of novel structures of power electronics converters. The straightforward non-linear modeling for controller design and simulation uses switched state-space models avoiding the averaging task, needs few linear control concepts, derives the stability study from geometric properties and leads to an integrated design of the control, modulators and simulation tasks. On-line sliding mode control techniques are well suited to power converters as they are inherently variable structure systems. Obtained controllers are robust concerning converter parameter variations, semiconductor non-ideal characteristics, load and line disturbances. Main modeling and design steps are summarized and some examples given. Results show fast dynamics, no steady-state errors and robustness against semiconductor non-idealities and dead times.
The Story of the GeoToolKit&mdash;An Object-Oriented Geodatabase Kernel System
Authors: Oleg Balovnev, Thomas Bode, Martin Breunig, Armin B. Cremers, Wolfgang Müller, Gleb Pogodaev, Serge Shumilov, Jörg Siebeck, Agemar Siehl, Andreas Thomsen
Venue: Geoinformatica (2004)

The quickly increasing number of spatio-temporal applications in fields like environmental monitoring, geology and mobile communication is a new challenge to the development of geodatabases. However, the query functionality of today&rsquo;s geo-information systems is still limited to the thematic attributes of spatial objects and to spatial 2-D objects. This article reports on GeoToolKit, an object-oriented geo-database kernel system developed at Bonn University to support 3-D/4-D geological applications. GeoToolKit is not a GIS-in-a-box package, but rather a library of C ++ classes that allows the incorporation of spatio-temporal functionality within an application. Being a component toolkit, it encourages the development and deployment of re-usable and open software. The history, concepts and implementation of GeoToolKit are discussed in detail. Performance tests underline the practicability of the concepts. Extensions to and experiences with GeoToolKit applications like GeoStore, GeoWeb and WellStore are presented. Finally, we give an outlook on our future research introducing GeoToolKit as a 3-D/4-D database component within a network of distributed and mobile geo-information services.
The ESA/NASA SOHO mission interruption: using the STAMP accident analysis technique for a software related 'mishap'
Authors: C. W. Johnson, C. M. Holloway
Venue: Software&mdash;Practice Experience (2003)

Mishap investigations provide important information about adverse events and are intended to help avoid any recurrence of previous failures. However, the complexity of many safety critical systems poses new challenges for mishap analysis. Similarly, the recognition that many failures have complex, systemic causes has helped to widen the scope of many mishap investigations. A new generation of mishap analysis techniques has been proposed to help investigators address these problems. For instance, Leveson has recently developed the Systems Theory Accident Modelling and Process (STAMP) approach to address some of the weaknesses associated with previous 'chain of event' approaches that can miss the systemic causes of adverse events. There are relatively few examples of the STAMP approach. This paper, therefore, presents the results obtained when two analysts performed an independent application of this technique to analyse the causes, including software problems, which led to the mission interruption of the joint European Space Agency (ESA) and National Aeronautics and Space Administration (NASA) Solar and Heliocentric Observatory (SOHO).
Lazy XSL transformations
Authors: Steffen Schott, Markus L. Noga
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tree are computed only upon initial access. As these computations have limited fan-in, sparse output coverage propagates backwards through the pipeline.In comparative measurements with traditional eager implementations, our approach is on par for complete coverage and excels as coverage becomes sparser. In contrast to eager evaluation, lazy evaluation also admits infinite intermediate results, thus extending the design space for transformation sequences.To demonstrate that lazy evaluation preserves the semantics of XSLT, we reduce XSLT to the lambda calculus via a functional language. While this is possible for all languages, most imperative languages cannot profit from the confluence of lambda as only one reduction applies at a time.
MAC Layer QoS Support for Wireless Networks of Unmanned Air Vehicles
Authors: Ionu" Cârdei, Sabera Kazi
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Mission-critical applications in wireless environments depend on a cross layer approach forQuality of Service. Dealing efficiently with variable link quality and dynamic topologies involves QoS integration at the link, network and transport layers interfaces. In this paper we present a new contention-based Medium Access Control protocol for wireless ad-hoc networks ofunmanned air vehicles. A receiver-initiated access control protocol with sender scheduling provides the mechanisms to implement effective MAC-layer bandwidth allocation with support for ad-hoc scenarios. A variable RTS lead time procedure integrated with binary exponential backoff improves fairness and provides low access latency for critical data frames. A major protocol design factor is efficient operation under heavy load. Performance measurements from simulations indicate consistent performance and promising results.
Technology-enhanced e-Learning: perceptions of first year information systems students at the Cape Technikon
Authors: Marlon Parker
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

The changes in delivery methods of Information Systems subjects are a suggestion of the technological changes in our society as a whole. The growth of the use of the Internet has contributed to various types of e-Learning in tertiary institutions.This pilot study utilized a student survey in electronic form to assess first year Information Systems student perceptions of e-Learning. This paper firstly addresses the theory behind technology-enhanced e-Learning. It then examines some aspects of technology-enhanced e-Learning and describes e-Learning at the Cape Technikon. The paper concludes with some discussion on findings from the survey.
Extracting information from free-text aircraft repair notes
Authors: Benoit Farley
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

For every problem mentioned by crew members in an aircraft log book, an associated repair action note is entered in the same log book by a maintenance technician after the problem has been handled. These hand-written repair notes, subsequently transcribed into a database, give an account of the actions undertaken by the technicians to fix the problems. Written in a free-text format with peculiar linguistic characteristics, including many arbitrary abbreviations and missing auxiliaries, they contain valuable information that can be used for decision support methods such as case-based reasoning. We use natural language techniques in our information extraction system to analyze the structure and contents of these notes in order to determine the pieces of equipment involved in a repair and what was done to them. Lexical information and domain knowledge are extracted from an electronic version of the illustrated parts catalog for the particular airplane, and are used at different stages of the process, from the morpholexical analysis to the evaluation of the semantic expression generated by the syntactical analyzer.
Whatever happened to...?
Authors: Aaron Weiss
Venue: netWorker (2003)

Examining the remnants of yesterday's technologies du jour
Parametrizing Quantum States and Channels
Authors: T. Constantinescu, V. Ramakrishna
Venue: Quantum Information Processing (2003)

This work describes one parametrization of quantum states and channels and several of its possible applications. This parametrization works in any dimension and there is an explicit algorithm which produces it. Included in the list of applications are a simple characterization of pure states, an explicit formula for one additive entropic quantity which does not require knowledge of eigenvalues, and an algorithm which finds one Kraus operator representation for a quantum operation without recourse to eigenvalue and eigenvector calculations.PACS: 03.67a, 03.67-Hk, 03.67-Lx
Infrastructuring for the Long-Term: Ecological Information Management
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

This paper foregrounds the long-term perspective and the role of information management in creating infrastructure to support collaborative ecological research. The case study of the Long-Term Ecological Research Network is an ongoing research collaboration that integrates ethnographic and action research approaches. We describe three interdependent elements of science, data and technology for which information management provides support, and the articulation work needed for balancing their inherent tensions and the requirements generated by short and long term time-frames. We further describe information managers' learning community and collaboration-indesign, two mechanisms created within the LTER for continuing technology development over the long-term. The notion of infrastructuring is related to ecological information management as an ongoing design process that highlights participation and co-construction, as well as the complex relationships between the long-term, data, participants, collaborations, information systems, and infrastructure. The under-studied area that entails issues of long-term, care/maintenance, and infrastructure presents challenges for the design of large-scale collaborative information systems.
Interpretation by Implementation for Understanding a Multiagent Organization
Authors: Keiki Takadama, Takao Terano, Katsunori Shimohara
Venue: Computational Mathematical Organization Theory (2003)

This paper stresses the importance of focusing on the modeling process of computational models for precisely understanding a complex organization and for solving given problems in the organization. Based on our claim, we proposes a method of interpretation by implementation (IbI), which explores factors that drastically change simulation results through an investigation on the modeling process of computational models. A careful investigation on the capabilities of the IbI approach, which comprises the three methods of (a) breakdown and representation, (b) assumption or premise modification, and (c) layer change investigation, derives the following conclusions: (1) the IbI approach has the potential of finding underlying factors that determine the characteristics of an organization&semi; (2) the IbI approach can specify points of attention at necessary levels when analyzing an organization&semi; and (3) the IbI approach has such advantages as wide applicability, the effective use of employed models, and KISS principle support.
Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques
Authors: Michael Dimopoulos, Panagiotis Linardis
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The test sequence compaction problem is modeled here, first, as a set covering problem. This formulation enables the straightforward application of set covering methods for compaction. Because of the complexity inherent in the first model, a second more efficient, formulation is proposed where the test sequences are modeled as matrix columns with variable costs (number of vectors). Further, matrix reduction rules appropriate to the new formulation, which do not affect the optimality of the solution, are introduced. Finally, the reduced problem is minimized with a Branch & Bound algorithm. Experiments on a large number of test sets show significant reductions to the original problem by simply using the presented reduction rules. Experimental results comparing our method with others from the literature and also with the absolute minima of the examples, computed separately with the MINCOV algorithm, support the potential of the proposed approach.
Parallel, multigrain iterative solvers for hiding network latencies on MPPs and networks of clusters
Authors: James R. McCombs, Andreas Stathopoulos
Venue: Parallel Computing (2003)

Parallel iterative solvers are often the only means of solving large linear systems and eigenproblems. However, these solvers are usually implemented in a fine-grain manner and can incur significant performance penalties due to synchronization overheads on large MPPs. This problem is exacerbated in clusters of workstations (COWs) and SMPs that are interconnected via a hierarchy of networks. In this paper, we describe a novel scheme for hiding the synchronization overheads, and thus improving scalability, of block iterative solvers that employ a correction equation through an inner iterative method.Block methods are not only robust in the presence of eigenvalue multiplicities and multiple right-hand sides, but provide better latency tolerance by performing more floating-point operations between synchronizations. We take a different approach to inducing latency tolerance by increasing the granularity at which the correction equation is solved for each block vector. This is accomplished by splitting the processors into smaller subgroups which are then used to solve the correction for each block vector concurrently. The rest of the algorithm is still performed in fine grain. We call this combination of fine and coarse-grain parallelism multigrain parallelism.We implemented a multigrain, block Jacobi-Davidson algorithm for computing the extreme eigenvalues of a symmetric matrix. We obtained improvements of 45-50% over both the block and non-block implementations of the fine-grain method when testing on an IBM SP and on a collection of clusters of Sun workstations.
Cell based performance optimization of combinational circuits
Authors: Uwe Hinsberger, Reiner Kolla
Venue: Proceedings of the conference on European design automation (1990)

Performance optimization, i.e. the problem of finding an optimal investment of transistor area which meets given delay constraints, is considered from an abstract, cell based point of view which allows only solutions within a discrete solution space of coarse granularity. The main advantages of this problem modelling are the independence of the methods from concrete delay modelling (and thus from technology) and the applicability to even very restrictive design styles (as for example gate arrays or sea of gates). The paper contains a classification of the computational complexity of the performance optimization problem as well as efficient algorithms (where they exist), heuristics and experimental results.
The anatomy of a multimodal information filter
Authors: Yi-Leh Wu, King-Shy Goh, Beitao Li, Huaxing You, Edward Y. Chang
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

The proliferation of objectionable information on the Internet has reached a level of serious concern. To empower end-users with the choice of blocking undesirable and offensive websites, we propose a multimodal information filter, named MORF. In this paper, we present MORF's core components: its confidence-based classifier, a Cross-bagging ensemble scheme, and multimodal classification algorithm. Empirical studies and initial statistics collected from the MORF filters deployed at sites in the U.S. and Asia show that MORF is both efficient and effective, due to our classification methods.
Interactive storytelling: from AI experiment to new media
Authors: Marc Cavazza, Fred Charles, Steven J. Mead
Venue: Proceedings of the second international conference on Entertainment computing (2003)

The recent development of Interactive Storytelling techniques has not yet generated widespread interest in the traditional storytelling community. Part of the explanation lies in the lack of maturity of authoring formalisms and techniques. In this paper, we review some underlying problems in the light of our own experience in developing Interactive Storytelling technologies. We introduce the various elements for story generation and presentation in an Interactive Storytelling system. We discuss the connection between AI formalisms used in Interactive Storytelling systems and the formalism used in narrative analysis and the implication of these formalisms for authoring interactive narratives.
Self-Stabilizing Autonomic Recoverer for Eventual Byzantine Software
Authors: Olga Brukman, Shlomi Dolev, Elliot K. Kolodner
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

We suggest to model software package flaws (bugs) byassuming eventual Byzantine behavior of the package. Inparticular, the package has been tested by the manufacturerfor limited length scenarios when started in a predefinedinitial state; the behavior beyond the tested scenario maybe Byzantine. Restarts (reboots) are useful for recoveringsuch systems.We suggest a general yet practical framework andparadigm, based on a theoretical foundation, for the monitoringand restarting of systems. An autonomic recovererthat monitors and restarts the system is proposed, where:The autonomic recoverer is designed to handle differenttasks given specific task requirements in the form of predicatesand actions. DAG subsystem hierarchy structure isused by a consistency monitoring procedure in order toachieve gracious recovery. The existence and correct functionalityof the autonomic recovery is guaranteed by theuse of a kernel resident (anchor) process, and the design ofthe process to be self-stabilizing. The autonomic recovereruses new scheme for liveness assurance via on-line monitoringthat complements known schemes for on-line ensuringsafety.