ppxscal/embedding_network huggingface dataset:
Static validation of XSL transformations
Authors: Anders Møller, Mads Østerby Olesen, Michael I. Schwartzbach
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2007)

XSL Transformations (XSLT) is a programming language for defining transformations among XML languages. The structure of these languages is formally described by schemas, for example using DTD or XML Schema, which allows individual documents to be validated. However, existing XSLT tools offer no static guarantees that, under the assumption that the input is valid relative to the input schema, the output of the transformation is valid relative to the output schema. We present a validation technique for XSLT based on the XML graph formalism introduced in the static analysis of JWIG Web services and XACT XML transformations. Being able to provide static guarantees, we can detect a large class of errors in an XSLT stylesheet at the time it is written instead of later when it has been deployed, and thereby provide benefits similar to those of static type checkers for modern programming languages. Our analysis takes a pragmatic approach that focuses its precision on the essential language features but still handles the entire XSLT language. We evaluate the analysis precision on a range of real stylesheets and demonstrate how it may be useful in practice.
TTL routing for VoIP congestion reduction
Authors: S. H. Srinivasan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The flexibility and widespread availability of Internet has added an additional service: voice. Voice over IP attempts to deliver voice over the Internet protocol (IP). The main drawback of VoIP is the unpredictable performance of IP networks. Since voice traffic is real-time, voice packets need to be delivered before a certain deadline. We propose a routing strategy based on this observation.
Scheduling Policies for Processor Coallocation in Multicluster Systems
Authors: Anca I. D. Bucur, Dick H. J. Epema
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Building multicluster systems out of multiple, geographically distributed clusters interconnected by high-speed wide-area networks can provide access to a larger computational power and to a wider range of resources. Jobs running on multiclusters and, more generally, in grids, may require (processor) coallocation, i.e., the simultaneous allocation of resources (processors) in different clusters or subsystems of a grid. In this paper, we propose four scheduling policies for processor coallocation in multiclusters, and we assess with simulations their performance under a wide variety of parameter settings. In particular, in our simulations we use synthetic workloads and workloads derived from the logs of actual systems and from runtime measurements. We conclude that although coallocation makes scheduling more difficult and the wide-area communication critically impacts the performance, there is a wide range of realistic applications that may benefit from coallocation. However, unrestricted coallocation is not recommended: Limiting the total job size or the number or the sizes of their components improves performance.
A survey on congestion control for mobile ad hoc networks: Research Articles
Authors: Christian Lochert, Björn Scheuermann, Martin Mauve
Venue: Wireless Communications Mobile Computing (2007)

Congestion control is a key problem in mobile ad hoc networks. The standard congestion control mechanism of the Transmission Control Protocol (TCP) is not able to handle the special properties of a shared wireless multi-hop channel well. In particular, the frequent changes of the network topology and the shared nature of the wireless channel pose significant challenges. Many approaches have been proposed to overcome these difficulties. In this paper, we give an overview over existing proposals, explain their key ideas and show their interrelations. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Some properties of sequences of generalized fuzzy integrable functions
Authors: Jin-xuan Fang
Venue: Fuzzy Sets and Systems (2007)

In this paper, we continue with the investigation of the generalized fuzzy integral (for short, (G) fuzzy integral), which is introduced by Wu et al. in 1993 [Generalized fuzzy integrals: part 1. Fundamental concepts, Fuzzy Sets and Systems 57 (1993) 219-226]. Some properties of (G) fuzzy integrable functions are obtained. The relations between convergence in fuzzy measure and mean convergence in (G) fuzzy integral for a sequence of non-negative measurable functions are discussed. Moreover, we also study the uniform integrability of a sequence of (G) fuzzy integrable functions, the uniformly absolute continuity and the uniform boundedness of a sequence of (G) fuzzy integrals.
A model of attention-guided visual sparse coding
Authors: Qingyong Li, Jun Shi, Zhongzhi Shi
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

Sparse coding theory demonstrates that the neurons in primary visual cortex form a sparse representation of natural scenes in the viewpoint of statistics, but a typical scene contains many different patterns (corresponding to neurons in cortex) compete for neural representation because of the limited processing capacity of the visual system. We propose an attention-guided sparse coding model. This model includes two modules: nonuniform sampling module simulating the process of retina and; data-driven attention module based on the response saliency. Our experiment results show that the model notably decreases the number of coefficients which may be activated and retains the main vision information at the same time.
Two level minimization in multidimensional scaling
Authors: Antanas Žilinskas, Julius Žilinskas
Venue: Journal of Global Optimization (2007)

Multidimensional scaling with city block norm in embedding space is considered. Construction of the corresponding algorithm is reduced to minimization of a piecewise quadratic function. The two level algorithm is developed combining combinatorial minimization at upper level with local minimization at lower level. Results of experimental investigation of the efficiency of the proposed algorithm are presented as well as examples of its application to visualization of multidimensional data.
Electronics education system for non-electronic engineers
Authors: A. Salaverria
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The article describes a CAL system for electronics education of non-electronic engineers. Our system uses hypermedia combined with simulation and electronic modules to achieve a complete education about the capabilities of electronics as a tool to improve the efficiency of industrial processes including mechanics, fluidics, etc.
Closing the loop: industry site visits for program outcomes assessment
Authors: S. K. Ramesh
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The Electrical & Electronic Engineering department at California State University, Sacramento, USA, formed an Industry Liaison Council in 1998 to assist in evaluating program educational objectives, and their outcomes assessment process. With the help of the Council, they have successfully used site visits to industry to validate program outcomes and improve their program. A team of department faculty visits a selected site where several of their alumni are employed. A set of open-ended questions is distributed to the participants prior to the visit, allowing them sufficient time to reflect on the issues and to take an active part in the group discussions. In this paper, the authors report on the structure and format of the site visits and how the data from the visits has been used to make program improvements. The broader educational partnerships that have resulted from these visits have been an unexpected, but welcome benefit.
Quantum clustering algorithms
Authors: Esma Aïmeur, Gilles Brassard, Sébastien Gambs
Venue: Proceedings of the 24th international conference on Machine learning (2007)

By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, we initiate the idea of quantizing clustering algorithms by using variations on a celebrated quantum algorithm due to Grover. After having introduced this novel approach to unsupervised learning, we illustrate it with a quantized version of three standard algorithms: divisive clustering, k-medians and an algorithm for the construction of a neighbourhood graph. We obtain a significant speedup compared to the classical approach.
Reaching Semantic Interoperability through Semantic Association of Domain Standards
Authors: Hung-Ju Chu, Randy Y. C. Chow
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

The vision of semantic interoperability has led much research on ontology matching. Research in this area primarily focuses on discovering similarity between entities of ontologies. The performance of proposed approaches relies on the existence of such similarity relationship and sufficient data for inferring it. However, in reality, many distributed systems do not have such presumptions. This paper addresses this challenge by associating the entities through affinity semantic (to what degree they are related in their application context). Through the analysis of a motivating example in building construction industry, this paper formally defines semantic association based on multiple-perspective domain standards. This paper hypothesizes that the establishment and the use of such standards can practically serve as a framework for reaching semantic interoperability between autonomous information systems. This paper also shows that such framework has the potential to make revolutionary impacts on workflow automation, information retrieval, and ontology matching research areas.
A Partitioning Analysis of the .NET Common Language Runtime
Authors: Joshua R. Dick, Kenneth B. Kent, Joseph C. Libby
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Microsoft's .NET platform was developed to simplify development of Windows applications. At the core of the .Net platform is a virtual machine known as the Common Language Runtime (CLR). Virtual machines do not allow for optimal performance, and a full hardware implementation is not always feasible. The goal of this paper is to present a preliminary partitioning scheme upon which future refinements can be made, and to analyze the performance of the partitioning scheme based on instructions executed in each partition and the data to be passed between partitions. Conclusions and recommendations as to implementation of the hardware partition are given to aid in future implementations of a hardware/ software co-designed CLR.
The effects of handset variability on speaker recognition performance: experiments on the Switchboard corpus
Authors: D. A. Reynolds
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper presents an empirical study of the effects of handset variability on text-independent speaker recognition performance using the Switchboard corpus. Handset variability occurs when training speech is collected using one type of handset, but a different handset is used for collecting test speech. For the Switchboard corpus, the calling telephone number associated with a file is used to imply the handset used. Analysis of experiments designed to focus on handset variability on the SPIDRE database and the May95 NIST speaker recognition evaluation database, show that a performance gap between matched and mismatched handset tests persists even after applying several standard channel compensation techniques. Error rates for the mismatched tests are over 4 times those for the matched tests. Lastly, a new energy dependent cepstral mean subtraction technique is proposed to compensate for nonlinear distortions, but is not found to improve performance on the databases used.
Streaming State Space: A Method of Distributed Model Verification
Authors: Viliam Holub, Petr Tuma
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

We present an alternative to traditional approaches of parallel and distributed model verification. In contrast to methods based on partitioning the state space, we keep the states together, sorted and organized as a stream. The stream is passed across computational nodes in a logical circle where each node updates the states in the part of the stream it currently sees. The presented method relies on state locality, allows storing the state space at external storage devices, and scales well on a non-dedicated, nonuniform cluster of up to tens of nodes. We have implemented an experimental version of the algorithm and obtained very promising results in scalability in the number of processors and computational nodes used in a large real-life use case.
Power Preserving 2: 1 Bandwidth Reduction Mappings
Authors: Amir Ingber, Meir Feder
Venue: Proceedings of the 2007 Data Compression Conference (2007)

In this work we consider dimension reducing mappings that can be used for joint source-channel coding (JSCC) systems. In such systems, the source coding and the channel coding is performed as a single operation. Although it is known by Shannon's separation theorem that asymptotically JSCC is not required for attaining the optimal performance, utilizing such schemes is beneficial for practical reasons such as delay and implementation simplicity. We specifically focus on the bandwidth reduction case, where the bandwidth of the data is greater than the bandwidth of the channel. More specifically, we focus on bandwidth reduction mappings, where the JSCC operation is performed using a single nonlinear operation.
Expansion of weighted pseudoinverse matrices with positive definite weights into matrix power products. Iterative methods
Authors: I. V. Sergienko, E. F. Galba, V. S. Deineka
Venue: Cybernetics and Systems Analysis (2007)

Weighted pseudoinverse matrices with positive definite weights are expanded into matrix power products with negative exponents and arbitrary positive parameters. These expansions are used to develop and analyze iterative methods for evaluating weighted pseudoinverse matrices and weighted normal pseudosolutions and solving constrained least-squares problems.
Spatial Topology Graphs for Feature-Minimal Correspondence
Authors: Zinovi Tauber, Ze-Nian Li, Mark S. Drew
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Multiview image matching methods typically require feature point correspondences. We propose a novel spatialtopology method that represents the space with a set of connected projective invariant features. Typically, isolated features, such as corners, cannot be matched reliably. Hence, limitations are imposed on viewpoint changes, or projective invariant descriptions are needed. The fundamental matrix is discovered using stochastic optimization requiring a large number of features. In contrast, our enhanced feature set models connectivity in space, forming a unique configuration that can be matched with few features and over large viewpoint changes. Our features are derived from edges, their curvatures, and neighborhood relationships. A probabilistic spatial topology graph models the space using these features and a second graph represents the neighborhood relationships. Probabilistic graph matching is used to find feature correspondences. Our results show robust feature detection and an average 80% discovery rate of feature matches.
A contribution to the stability test for one-dimensional discrete time linear systems
Authors: A. Constantinides
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The objective of this paper is to produce a general formulation of an order reduction procedure for testing the stability of discrete time linear systems. The order reduction procedure involves a series of iterations and, at each step of the iteration process, the aim is to derive a new polynomial of order lower than the given one. The new polynomial serves as the input to the following iteration. A specific form of the formulation is considered in which first order auxiliary polynomials are employed in the order reduction process. There follows from this a new testing procedure which is computationally more efficient than the existing ones. Moreover the current methods appear as special cases of the new test. An extension is further proposed which employs second order auxiliary polynomials within the order reduction formulation. This second order form is, however, for all practical cases the limit to which such a procedure can be put.
Weblint: just another perl hack
Authors: Neil Bowers
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Weblint is a utility for checking the syntax and style of HTML pages. It was inspired by lint [15], which performs a similar function for C and C++ programmers. Weblint does not aspire to be a strict SGML validator, but to provide helpful comments for humans. The importance of quality assurance for web sites is introduced, and one particular area, validation of HTML, is described in more detail. The bulk of the paper is devoted to weblint: what it is, how it is used, and the design and implementation of the current development version.
Proceedings of the 5th IEEE workshop on Challenges of large applications in distributed environments
Venue: High Performance Distributed Computing (2007)

We are pleased to welcome you to the 5th IEEE Workshop on Challenges of Large Applications in Distributed Environments -- CLADE 2007. This year's workshop is held in conjunction with the 16th International Symposium on High Performance Distributed Computing (HPDC 2007). A new era of large scale, distributed applications are exploiting advances in networking, high-end computers, large data stores and middleware capabilities to address challenging problems. The CLADE series of workshops addresses the challenges faced by large-scale application developers working in heterogeneous environments. A variety of complex issues have been covered at the workshops including adaptive algorithm development, middleware capabilities, and resource management and dynamic load balancing. Large scale applications in science, engineering, medicine, business, economics, education, and other disciplines have been presented at the workshops. CLADE 2007 authors will discuss a wide variety of applications. A library for parallel tree search algorithms will speed the analysis of large astronomical datasets. An approach for managing parameter sweeps will make large scale computations feasible in a range of disciplines. Highly scalable algorithms in plasma turbulence will make it possible to solve the most challenging numerical simulations which are a key in the design and construction of fusion devices. In the medical field, computational grids are successfully being used to produce and manage hundreds of millions of docking simulations, increasing the understanding of malaria and the avian flu. Scientists are able to analyze and share pathological images for cancer treatment. In addition, the program includes a several invited speakers, a panel addressing the challenges of distributed data and a keynote speech by Scott Oster from The Ohio State University who will be discussing the National Cancer Institute's cancer Biomedical Informatics Grid, caBIG. We hope that these proceedings will serve as a valuable reference for security researchers and developers.
Better widget design: a practitioner's approach
Authors: Ed Lycklama
Venue: Proceedings of the USENIX Applications Development Symposium Proceedings on USENIX Applications Development Symposium Proceedings (1994)

Programming in Motif employs a powerful object-oriented concept based on widgets. This paper discusses the Motif widget model, showing how they are used and briefly discusses how to create a new widget class. Issues involved in designing new high-quality widget classes are discussed, drawing from the author's experience in implementing several commercial Motif widgets.
A path model linking organizational knowledge attributes, information processing capabilities, and perceived usability
Authors: Tzu-Chuan Chou, Pao-Long Chang, Yih-Ping Cheng, Chien-Tzu Tsai
Venue: Information and Management (2007)

Employees' perceptions of knowledge management (KM) has been of increasing interest to organization researchers who have suggested that the understanding of organization information processing (OIP) capabilities is important in providing KM activities. Yet, there has been little research on the link between OIP capabilities and employees' perceived usability of KM tools in an organization. We developed a path model employing several constructs: teachability, codificability, information acquisition, information dissemination, organizational memory, information integration, and perceived usability. We then explored the relationships between employees' perception of the effectiveness of KM activities and empirically tested the model using a sample of 157 enterprises from the Taiwanese Information Service Industry. Our results showed that all proposed relationships except a link between codificability and memory capability were supported by the data. The findings and their implications are discussed.
Tcl/Tk HTML tools
Authors: Brent Welch, Steve Uhler
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

This paper describes tools and techniques that support HTML processing with Tcl and Tk. The tools include an HTML parser, a table-driven display engine, and WebEdit, which is a WYSIWYG editor for HTML documents. The parser and display engine are written as a small library that can easily be added to applications that need to display HTML documents. The library has a modular implementation so that applications can customize and extend the library for specialized needs. In particular, WebEdit extends the library to provide an authoring environment. The editor uses the tag and mark facilities of the Tk text widget as the primary data structure for the representation of HTML within the edited document. The paper also describes the performance issues associated with the text widget and one optimization to its implementation.
Detecting Interfaces in a Parabolic-Elliptic Problem from Surface Measurements
Authors: Florian Fru&uml;hauf, Bastian Gebauer, Otmar Scherzer
Venue: SIAM Journal on Numerical Analysis (2007)

Assuming that the heat capacity of a body is negligible outside certain inclusions the heat equation degenerates to a parabolic-elliptic interface problem. In this work we aim to detect these interfaces from thermal measurements on the surface of the body. We deduce an equivalent variational formulation for the parabolic-elliptic problem and give a new proof of the unique solvability based on Lions&rsquo;s projection lemma. For the case that the heat conductivity is higher inside the inclusions, we develop an adaptation of the factorization method to this time-dependent problem. In particular this shows that the locations of the interfaces are uniquely determined by boundary measurements. The method also yields to a numerical algorithm to recover the inclusions and thus the interfaces. We demonstrate how measurement data can be simulated numerically by a coupling of a finite element method with a boundary element method, and finally we present some numerical results for the inverse problem.