ppxscal/embedding_network huggingface dataset:
Pipelines and size constraints
Authors: Ehud Reiter
Venue: Computational Linguistics (2000)

Some types of documents need to meet size constraints, such as fitting into a limited number of pages. This can be a difficult constraint to enforce in a pipelined natural language generation (NLG) system, because size is mostly determined by content decisions, which usually are made at the beginning of the pipeline, but size cannot be accurately measured until the document has been completely processed by the NLG system. I present experimental data on the performance of single-solution pipeline, multiple-solution pipeline, and revision-based variants of the STOP system (which produces personalized smoking-cessation leaflets) in meeting a size constraint. This shows that a multiple-solution pipeline does much better than a single-solution pipeline, and that a revision-based system does best of all.
Parallel iterative methods for dense linear systems in inductance extraction
Authors: Hemant Mahawar, Vivek Sarin
Venue: Parallel Computing (2003)

Accurate estimation of the inductive coupling between interconnect segments of a VLSI circuit is critical to the design of high-end microprocessors. This paper presents a class of parallel iterative methods for solving the linear systems of equations that arise in the inductance extraction process. The coefficient matrices are made up of dense and sparse submatrices where the dense structure is due to the inductive coupling between current filaments and the sparse structure is due to Kirchoff's constraints on current. By using a solenoidal basis technique to represent current, the problem is transformed to an unconstrained one that is subsequently solved by an iterative method. A dense preconditioner resembling the inductive coupling matrix is used to increase the rate of convergence of the iterative method. Multipole-based hierarchical approximations are used to compute products with the dense coefficient matrix as well as the preconditioner. A parallel formulation of the preconditoned iterative solver is outlined along with parallelization schemes for the hierarchical approximations. A variety of experiments is presented to show the parallel efficiency of the algorithms on shared-memory multiprocessors.
Translating Content-Based Authorizations for XML Documents
Authors: Somchai Chatvichienchai, Mizuho Iwaihara, Yahiko Kambayashi
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Access control policies of XML documents are often specified based on user roles and data content of the documents. Content-based authorization is crucial for providing fine-grained access control to data in XML document. Since authorization rules (authorizations, for short) use path expressions of XPath for locating data in documents, authorization definition is related to structure of the document. However, the structure of XML documents tends to change by various reasons such as application extension and information exchange betweenorganizations. Therefore, authorizations must be revised whenever they become incompatible with a new structure of the document. As far as we know, no previous work has discussed the problem of transforming content-based authorizations for XML documents by using schema mapping information. We define classes for schema and document transformations that allow transforming authorizations without access to source and target XML documents. We propose an algorithm that computes authorizations of role-based access control (RBAC)model for a target DTD instance from given RBAC authorizations of a source DTD instance and schema mapping information under the specified classes of schema and document transformations while preserving the authorization policy of the source DTD instance.
Exploring the Relationship between Experience and Group Performance in Software Review
Authors: Yuk Kuen Wong, David Wilson
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

The aim of this paper is to examine the importantrelationships between experience, task training andsoftware review performance.One hundred and ninety-twovolunteer university students were randomly assignedinto 48 four-member groups.Subjects were required todetect defects from a design document.The main findingsinclude (1) role experience has a positive effect ofsoftware review performance; (2) working experience inthe software industry has a positive effect on softwarereview performance; (3) task training has no significanteffect on software review performance; (4) roleexperience has no significant effect on task training; (5)working experience in the software industry has a significant effect on task training.
Quantitative Analysis of Strategies for Streaming Media Distribution
Authors: Marisa A. Vasconcelos, Leonardo C. da Rocha, Juliano de C. Santos, José Ismael,  Jr., Leonardo L. P. da Mata, Jussara M. Almeida, Wagner Meira,  Jr., Virgílio A. F. Almeida
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Distribution of streaming media content, including live news, music and videos, is becoming increasingly popular in today's Internet. Traditional client/server architectures are inefficient for distributing streaming media objects because of the high demands for systemresources, especially server and network bandwidth, which severely limit the total number of simultaneous users the system can support. One proposal for improving the scalability of media distribution systems is the use of P2P overlay networks. Although a number of previous work has evaluated different aspects of P2P systems, mainly through simulation, there is a lack of a thorough quantitative analysis of the requirements for server and network resources (i.e., CPU, server and network bandwidth) in actual P2P systems, compared to traditional client/server systems.This work aims at filling this gap by providing experimental results that quantify the savings in server and network resources if a P2P approach is used for distributing live streaming media instead of the traditional client/server approach. Towards this goal, we build an experimentaltestbed, in a controlled environment, to evaluate actual systems with varying number of clients during periods when the distribution tree is static. A key component of this experimental test-bed is a new efficient and scalable application called streaming servent, which can act both as a client and a server, forwarding packets to other clients. We also use simple analytical formulas to evaluate the scalability of our servent application. The experimentalresults quantify the intuitive better scalability of the P2P architecture. As an example, the total server bandwidth decreases from 15 Mbits/s to 9 Mbits/s (a 40% reduction) if a P2P architecture is used instead of a client/server architecture for live delivery of a given file to 24 clients.
Enhancement of wavelet-based medical image retrieval through feature evaluation using an information gain measure
Authors: O. H. Karam, A. M. Hamad, S. Ghoniemy, S. Rady
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Medical image retrieval covers a major application area, providing significant assistance in medical diagnosis. In this paper, several parameters for a wavelet-based retrieval system for HRCT lung images are analyzed, in order to improve the performance of the system in terms of precision and retrieval time. The information gain measure is used to evaluate extracted features to find the features that have the most discriminating power across image disease classes. A weighted similarity metric based on the evaluation is used for image retrieval. The number of levels for wavelet decomposition is studied for 2 types of wavelets, haar and daubechies-8. A filtering criteria based on the features with the highest information gain is used to enhance the retrieval time. Experiements on HRCT lung images that cover 8 disease classes show that the weighted approach achieves about 10% improvement in the average disease class precision, and 4.75% in the average total system precision, over the unweighted approach. Retrieval time is much enhanced while still maintaining high precision ratios.
Control algorithms for networked control and communication systems
Authors: Nitin R. T. Swamy
Venue:  (2003)

NC architectures that utilize processing power at each node allow for the modularization of functionality and standard interfaces for interchangeability and interoperability. With independent sensors and actuators, it is possible then to create a network of such nodes to exchange information like reference input, plant output, control effort, etc., among the control system components. Sensors and sensor networks are fast gaining popularity amongst research circles. In recent years, sensor research has been undergoing a quiet revolution, promising to have significant impact on a broad range of applications relating to national security, health care, the environment, energy, food safety, and manufacturing. The convergence of the Internet, communications, and information technologies with techniques for miniaturization has placed sensor technology at the threshold of a period of major growth. Large numbers of sensors may be integrated into systems to improve performance and lifetime, and decrease life-cycle costs. Communications networks for sensors need to provide rapid access to information and computing, eliminating the barriers of distance and time for telemedicine, transportation, tracking endangered species, detecting toxic agents, and monitoring the security of civil and engineering infrastructures. Sensor networking research needs to include: enabling networking technologies for distributed wireless and wired sensor networks; scalable and robust architectures; design, automated tasking, and querying techniques; adaptive management and control of sensor nodes; design tradeoffs and performance optimization in resource-constrained sensor networks; design of ultra-low power processing nodes for local information management; investigation of localized versus distributed versus centralized processing of sensor data; common building blocks and interfaces for sensor networking; strategies for using heterogeneous sensor and network nodes to enhance performance and host of other issues. This dissertation attempts to demonstrate the use of existing network structures for advanced control system implementation and to suggest new network structures and algorithms for rapid deployment of sensors and sensor networks. The use of Local Area Networks and the Internet for implementation of intelligent control algorithms is discussed. A novel hierarchical network structure is proposed, where the nodes could be sensors, actuators or controllers. The network could be either a control network or a data network. Routing algorithms for message routing in the proposed structure are suggested. The proposed structure is analyzed for problems such as link failures. Deadlock issues in the routing algorithms are discussed and a deadlock avoidance algorithm is proposed. Issues related to distributed implementation of the proposed algorithms for routing, failure recovery and deadlock avoidance are discussed and a few distributed algorithms are suggested.
K-D Decision Tree: An Accelerated and Memory Efficient Nearest Neighbor Classifier
Authors: Tomoyuki Shibata, Takekazu Kato, Toshikazu Wada
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Most nearest neighbor (NN) classifiers employ NN searchalgorithms for the acceleration. However, NNclassification does not always require the NN search.Based on this idea, we propose a novel algorithm namedk-d decision tree (KDDT). Since KDDT uses Voronoicondensed prototypes, it is less memory consuming thannaive NN classifiers. We have confirmed that KDDT ismuch faster than NN search based classifiers through thecomparative experiment (from 9 to 369 times faster).
System-Level Analysis of Fault Effects in an Automotive Environment
Authors: F. Corno, S. Tosato, P. Gabrielli
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

In the last years, new requirements in terms of vehicle performance increased significantly the amount of on-board electronics, thus raising more concern about safety and fault tolerance induced by the electronic system in automotive products. The adoption of several on board active systems and their interactions forced designers to substitute point to point connections with networking systems mainly based on the Controller Area Network (CAN) protocol.This paper presents some recent results to improve the evaluation of reliability due to network connections. Evaluation is based on first modeling the network at the functional leveland then integrating it into a complete vehicle model describing both electronic and mechanical behavior; in this way, it is possible to build an automated fault injection environment to forecast the effects of faults at the network level on the vehicle dynamics.We evaluated this approach on the vehicle dynamic control subsystem, and analyzed theeffects on vehicle performance in presence of several network faults.
Cryptography and computer security for undergraduates
Authors: Paul De Palma, Charles Frank, Suzanne Gladfelter, Joshua Holden
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

The panel discusses solutions to the problem of computer security education.
Triangle Factors in Random Graphs
Authors: Michael Krivelevich
Venue: Combinatorics, Probability and Computing (1997)

For a graph G=(V, E) on n vertices, where 3 divides n, a triangle factor is a subgraph of G, consisting of n&#x002F;3 vertex disjoint triangles (complete graphs on three vertices). We discuss the problem of determining the minimal probability p=p(n), for which a random graph G&isin;&Gscr;(n, p) contains almost surely a triangle factor. This problem (in a more general setting) has been studied by Alon and Yuster and by Ruci&nacute;ski, their approach implies p=O((log n&#x002F;n)1&#x002F;2). Our main result is that p=O(n)&minus;3&#x002F;5) already suffices. The proof is based on a multiple use of the Janson inequality. Our approach can be extended to improve known results about the threshold for the existence of an H-factor in &Gscr;(n, p) for various graphs H.
MPEG-4 ALS: an Emerging Standard for Lossless Audio Coding
Authors: Tilman Liebchen, Yuriy A. Reznik
Venue: Proceedings of the Conference on Data Compression (2004)

We provide a brief overview of an emerging ISO/IEC standard for lossless audio coding,MPEG-4 ALS.We explain choices of algorithms used in its design, and compare it to currentstate-of-the-art algorithms for lossless audio compression.
Computer vision in the interface
Authors: Matthew Turk
Venue: Communications of the ACM (2004)

There are still obstacles to achieving general, robust, high-performance computer vision systems. The last decade, however, has seen significant progress in vision technologies for human-computer interaction.
Coates-wiles towers for cm-abelian varieties
Authors: Christopher Michael Rowe
Venue:  (2003)

When A/Q is an elliptic curve of Mordell-Weil-rank zero with complex multiplication, Coates and Wiles showed that A satisfies the weak Birch and Swinnerton-Dyer conjecture. An alternate proof was given by Stark and Gupta, by computing conductors in what he called the Coates-Wiles tower. The main goal of this thesis is to approach the Birch and Swinnerton-Dyer problem for abelian varieties with complex multiplication by generalizing Gupta's work on Coates-Wiles towers. In particular, let K be a Galois CM-field, A an abelian variety defined over K with full complex multiplication by the ring of integers of K, and p a prime of K at which A has good reduction. Then we want to describe congruence relations on units in Kn, the extension of K generated by the pn -torsion points of A. We assume the existence of a point of infinite order Q &isin; A( K), and we let Ln be the extension of Kn generated by the pn -division values of Q (i.e., Ln = Kn( 1pn Q )). Then there exists a positive integer e such that Ln/Kn is an unramified extension, for n < e, and Le/Ke is ramified. We demonstrate that the conductor of Le/K e possesses an analogous form to the conductors calculated by Gupta. In the elliptic case, conductors of the form we calculate determine congruence relations on units of Ke. In the general case, we compute congruence relations on exterior products of units in Ke. These congruence relations relate to a recent conjecture of de Shalit.
Neuro-fuzzy comprehensive assemblability and assembly sequence evaluation
Authors: X. F. Zha
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

Analysis of assembly properties of a product is needed during the initial design stage in order to identify potential assembly problems, which affect product performance in the later stages of life cycle. Assemblability analysis and evaluation play a key role in assembly design, assembly operation analysis and assembly planning. This paper develops a novel approach to assemblability and assembly sequence analysis and evaluation using the concept of the fuzzy set theory and neuro-fuzzy integration. Assemblability is described by assembly-operation difficulty, which can be represented by a fuzzy number between 0 and 1. Assemblability evaluation is therefore fuzzy evaluation of assembly difficulty. The evaluation structure covers not only the assembly parts' geometric and physical characteristics, but also takes into account the assembly operation data necessary to assemble the parts. The weight of each assemblability factor is subject to change to match the real assembly environments based on expert advice. The approach has the flexibility to be used in various assembly methods and different environments. It can be used in a knowledge-based design for assembly expert system with learning ability. Through integration with the CAD system, the developed system can effectively incorporate the concurrent engineering knowledge into the preliminary design process so as to provide users with suggestions for improving a design and also helping to obtain better design ideas. The applications in assembly design and planning show that the proposed approach and system are feasible.
A pneumatic tactile alerting system for the driving environment
Authors: Mario Enriquez, Oleg Afonin, Brent Yager, Karon Maclean
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

Sensory overloaded environments present an opportunity for innovative design in the area of Human-Machine Interaction. In this paper we study the usefulness of a tactile display in the automobile environment. Our approach uses a simple pneumatic pump to produce pulsations of varying frequencies on the driver's hands through a car steering wheel fitted with inflatable pads. The goal of the project is to evaluate the effectiveness of such a system in alerting the driver of a possible problem, when it is used to augment the visual display presently used in automobiles. A steering wheel that provides haptic feedback using pneumatic pockets was developed to test our hypothesis. The steering wheel can pulsate at different frequencies. The system was tested in a simple multitasking paradigm on several subjects and their reaction times to different stimuli were measured and analyzed. For these experiments, we found that using a tactile feedback device lowers reaction time significantly and that modulating frequency of vibration provides extra information that can reduce the time necessary to identify a problem.
A proof-irrelevant model of Martin-L&ouml;f's logical framework
Authors: Daniel Fridlender
Venue: Mathematical Structures in Computer Science (2002)

We extend the proof-irrelevant model defined in Smith (1988) to the whole of Martin-L&ouml;f's logical framework. The main difference here is the existence of a type whose objects themselves represent types rather than proof-objects. This means that the model must now be able to distinguish between objects with different degree of relevance: those that denote proofs are irrelevant whereas those that denote types are not. In fact a whole hierarchy of relevance exists.Another difference is the higher level of detail in the formulation of the formal theory, such as the explicit manipulation of contexts and substitutions. This demands an equally detailed definition of the model, including interpreting contexts and substitutions.We are thus led to a whole reformulation of the proof-irrelevant model. We present a model that is built up from an arbitrary model of the untyped lambda calculus. We also show how to extend it when the logical framework itself is enlarged with inductive definitions. In doing so, a variant of Church numerals is introduced.As in Smith (1988), the model can only be defined in the absence of universes, and it is useful to obtain an elementary proof of consistency and to prove the independence of Peano's fourth axiom.
An automatic singing voice rectifier design
Authors: Cheng-Yuan Lin, J.-S. Roger Jang, Mao-Yuan Hsu
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper proposes a new approach to automatic singing voice rectification. There are two components in the rectifier; one is the recognizer based on dynamic time warping and the other is the synthesizer based PSOLA (Pitch Synchronous Overlap and Add) for pitch shifting. The purpose of the recognizer is to identify the locations of off-key parts of the user's acoustic input. Then with the target music score, the synthesizer tries to correct the off-key parts by appropriate pitch shifting to match the give music score. We also attempt some singing and listening experiments for evaluating the feasibility of the rectifier and the results exhibit the satisfactory performance.
Privacy-preserving Distributed Clustering using Generative Models
Authors: Srujana Merugu, Joydeep Ghosh
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We present a framework for clustering distributed datain unsupervised and semi-supervised scenarios, taking intoaccount privacy requirements and communication costs.Rather than sharing parts of the original or perturbed data,we instead transmit the parameters of suitable generativemodels built at each local data site to a central location.We mathematically show that the best representative of allthe data is a certain "mean" model, and empirically showthat this model can be approximated quite well by generatingartificial samples from the underlying distributions usingMarkov Chain Monte Carlo techniques, and then fittinga combined global model with a chosen parametric form tothese samples. We also propose a new measure that quantifiesprivacy based on information theoretic concepts, andshow that decreasing privacy leads to a higher quality of thecombined model and vice versa. We provide empirical resultson different data types to highlight the generality of ourframework. The results show that high quality distributedclustering can be achieved with little privacy loss and lowcommunication cost.