ppxscal/embedding_network huggingface dataset:
Requirements for Maintaining Web Access for Hearing-Impaired Individuals
Authors: Daniel M. Berry
Venue: Software Quality Control (2004)

The current textual and graphical interfaces to computing, including the Web, is a dream come true for the hearing impaired. However, improved technology for voice and audio interface threaten to end this dream. Requirements are identified for continued access to computing for the hearing impaired. Consideration is given also to improving access to the sight impaired.
Novel methods for reversible logic synthesis and their application to quantum computing
Authors: Marek A. Perkowski
Venue:  (2002)

The biggest problems in system design today, and in the future, are the high rate of power consumption, and the emergence of quantum effects for highly dense ICs. The real challenge is to design reliable systems that consume as little power as possible and in which the signals are processed and transmitted at very high speeds with very high signal integrity. Current tools are used to design ICs using only classical design methodologies that apply conventional synthesis constraints such as area, delay, and power. As it was proven, physical processes have to be logically reversible in order to reduce (theoretically eliminate) power consumption. Logical reversibility requires that one can obtain the vector of inputs from the vector of outputs (i.e., backward process) as well as the vector of outputs from the vector of inputs (i.e., forward process). Since only ad-hoc methods were used previously for the reversible synthesis of logic functions, and since systematic and efficient reversible logic synthesis methodologies were significantly missing from previous literature, this dissertation provides several original contributions to reversible logic synthesis by providing a set of tools that can be systematically used to synthesize and evaluate logic functions using reversible logic. This includes, among other new results, Reversible Lattice Structures, Reversible Modified Reconstructability Analysis, Reversible Nets, Reversible Decision Diagrams, and Reversible Cascades. To solve the problem of high signal integrity when processing (computing and transmitting) information using extremely high dense circuits one needs to incorporate the physical quantum mechanical effects that are unavoidable in the nano scales. Since quantum circuits are reversible, and since many of the underlying theorems and formalisms for multiple-valued quantum computing were significantly missing from previous literature, new fundamental foundations for such computations had to be established. These new results include, but not limited to, Quantum Chrestenson Operator, new types of Quantum Decision Trees and Quantum Decision Diagrams as efficient representations for quantum computing, new Composite Basis States, new multiple-valued Einstein-Podolsky-Rosen (EPR) Basis States, and new classes of quantum primitives. Initial evaluations and conclusions for the comparative advantages and disadvantages of the new reversible and quantum computing methodologies are also provided.
Pricing considerations for delivering e-content on-demand
Authors: Srinivasan Jagannathan
Venue:  (2003)

Internet usage, available bandwidth, and the multimedia capabilities of end-user computers have increased tremendously over the last decade. These have enabled powerful ways to exchange data, and spawned new business ventures based on innovative technologies. Content providers can now sell multimedia-rich software and services using the Internet. Customers can download the e-content immediately after online transactions. Alternately, the content provider can stream the content to customers. For the success of such enterprises, content providers need to answer two important questions: (1) How to maximize revenue/profit? and (2) How to manage resources efficiently? In this thesis, we argue that both issues are addressed by choosing the &ldquo;right&rdquo; price. We illustrate how resource management is related to revenue maximization, and study the impact of price on system performance. We develop a theory to choose intelligent prices based on the available system resources and on models of customer behavior. We formulate revenue maximization problems for a number of service models, where the services differ in how system resources are utilized. We also construct a Finite State Machine to perform controlled price experiments. The data gathered from such experiments can be used to estimate approximation models of customer behavior in near real-time. The framework we develop is robust to changes in customer behavior. Based on our analysis of revenue and system utilization, and the framework to learn customer behavior, we develop dynamic pricing algorithms that not only generate high revenues but also reduce the number of requests denied service due to resource constraints. Using these pricing algorithms, content providers can develop services that generate more revenue while also being more compelling to users.
Multiplayer games: algorithms and approaches
Authors: Nathan Reed Sturtevant
Venue:  (2003)

Historically, much work in Artificial Intelligence research has gone into designing computer programs to play two-player perfect-information games such as Chess, Checkers, Backgammon, and Othello. Comparatively little work, however, has gone into multi-player games such as Chinese Checkers, Abalone, Cribbage, Hearts, and Spades. As a result, we have highly optimized techniques for two-player games, but very little knowledge of how they work in multi-player games. In this thesis we extend many of the standard techniques from two-player games to multi-player games. We present two decision rules, maxn [Luckhardt and Irani, 1986] and paranoid, examining their theoretical properties. For maxn we also introduce several pruning techniques, including Alpha-Beta Branch-and-Bound pruning and Speculative pruning. Speculative pruning is the first multi-player pruning algorithm that can prune any constant-sum multi-player game, and provides an order of magnitude reduction in node expansions over previous search techniques in games like Chinese Checkers. We also analyze the properties of common two-player game techniques, such as zero-window search and iterative deepening, showing how their properties change in multi-player games. Finally, we present results of all these techniques in a variety of multi-player domains, including Chinese Checkers, Abalone, Cribbage, Hearts and Spades. These methods have allowed us to write state-of-the-art programs for playing Hearts and a version of Chinese Checkers on a smaller board.
Interconnect optimisation during data path allocation
Authors: L. Stok
Venue: Proceedings of the conference on European design automation (1990)

In previous research interconnection was optimised when the module allocation for the operations and the register allocation for the variables already had been done. However, both the amount of multiplexing and interconnect are crucial factors to both the delay and the area of a circuit. In this paper it is shown that when variables are grouped into register files and operations are assigned to modules to minimise the interconnections, significant savings (20%) can be obtained in the number of local interconnections and the amount of global interconnect on the expense of only slightly more register area. This can be enhanced by splitting read and write phases of registers and even more by introducing serial(re-)write operations for the same value. The variable grouping is based on edge colouring algorithms that provide a sharp upper bound on the number of colours needed.
Convergence of Finite Volume Approximations for a Nonlinear Elliptic-Parabolic Problem: A "Continuous" Approach
Authors: Boris A. Andreianov, Michaël Gutnic, Petra Wittbold
Venue: SIAM Journal on Numerical Analysis (2004)

We study the approximation by finite volume methods of the model parabolic-elliptic problem $b(v)_t={{\rm div \,}} (|Dv|^{p-2} Dv)$ on $(0,T)\times\Omega\subset \R\times\R^d$ with an initial condition and the homogeneous Dirichlet boundary condition. Because of the nonlinearity in the elliptic term, a careful choice of the gradient approximation is needed. We prove the convergence of discrete solutions to the solution of the continuous problem as the discretization step h tends to 0, under the main hypotheses that the approximation of the operator ${{\rm div \,}} (|Dv|p-2 Dv) provided by the finite volume scheme is still monotone and coercive, and that the gradient approximation is exact on the affine functions of $x\in \Om$. An example of such a scheme is given for a class of two-dimensional meshes dual to triangular meshes, in particular for structured rectangular and hexagonal meshes. The proof uses the rewriting of the discrete problem under a "continuous" form. This permits us to directly apply the Alt--Luckhaus variational techniques which are known for the continuous case.
A backpropagation and initialization routine for hyperbolic sigma-pi neural networks
Authors: Burkhard Lenze
Venue: Neural, Parallel Scientific Computations (2003)

As it is well-known, sigma-pi neural networks offer an interesting alternative to classical ridge-type neural networks, especially when aspects of invariances enter the field. In this contribution, we develop a backpropagation-type algorithm for a special kind of these networks, so-called hyperbolic sigma-pi neural networks, together with a well-founded initialization routine for finding proper starting parameters. We will not only sketch the mathematical machinery but also give detailed pseudo code for rapid implementation.
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
Authors: Dimitri Theodoratos
Venue: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP (2003)

Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the evaluation of these queries is the join of the usually huge fact table with the restricted dimension tables (star-join). Recently, a multidimensional hierarchical clustering schema for star schemas is suggested. Subsequently, query evaluation plans for multidimensional queries appeared that essentially implement a star join as a multidimensional range restriction.We present a number of transformations for such plans. The transformations place grouping/aggregation operations before joins and safely prune aggregated tuples. They can be applied at no or minimal extra I/O cost. We show how these transformations can be used to construct a new evaluation plan for grouping/aggregation queries over multidimensional hierarchically clustered schemas. The new plan improves previous results by grouping and aggregating tuples and by excluding aggregated tuples from further consideration at an early stage of the computation of a query.
The Metasaxophone: concept, implementation, and mapping strategies for a new computer music instrument
Authors: Matthew Burtner
Venue: Organised Sound (2002)

The Metasaxophone is an acoustic tenor saxophone retrofitted with an onboard computer microprocessor and an array of sensors that convert performance data into MIDI control messages. The instrument has additionally been outfitted with a unique microphone system that allows for detailed control of the amplified sound. While maintaining full acoustic functionality it is also a versatile MIDI controller and an electric instrument. A primary motivation behind the Metasaxophone is to put signal processing under direct expressive control of the performer. Through the combination of gestural and audio performance control, employing both discrete and continuous multilayered mapping strategies, the Metasaxophone can be adapted for a wide range of musical purposes. This paper explores the artistic and technical development of the instrument, as well as new conceptions of musical mappings arising from the enhanced interface.
PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets
Authors: Mehmet Koyutürk, Ananth Grama
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

This paper presents an efficient framework for error-bounded compression of high-dimensional discrete attributed datasets. Such datasets, which frequently arise in a wide variety of applications, pose some of the most significant challenges in data analysis. Subsampling and compression are two key technologies for analyzing these datasets. PROXIMUS provides a technique for reducing large datasets into a much smaller set of representative patterns, on which traditional (expensive) analysis algorithms can be applied with minimal loss of accuracy. We show desirable properties of PROXIMUS in terms of runtime, scalability to large datasets, and performance in terms of capability to represent data in a compact form. We also demonstrate applications of PROXIMUS in association rule mining. In doing so, we establish PROXIMUS as a tool for preprocessing data before applying computationally expensive algorithms or as a tool for directly extracting correlated patterns. Our experimental results show that use of the compressed data for association rule mining provides excellent precision and recall values (near 100%) across a range of support thresholds while reducing the time required for association rule mining drastically.
How Can System-Level Design Solve the Interconnect Technology Scaling Problem?
Authors: Francky Catthoor, Andrea Cuomo, Grant Martin, Patrick Groeneveld, Lauwereins Rudy, Karen Maex, Patrick van de Steeg, Ron Wilson
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The scaling of interconnect technology hits a red brick wall: interconnect delay and power do not follow Moore's law anymore. The use of new materials like Cu and low-k alleviated the problem temporarily, but physical limits are being hit. What does this mean for system level design? The session starts with an embedded tutorial, given by an interconnect semiconductor technology expert, explaining the physics behind the interconnect problem and the degrees of freedom semiconductor technology offers system designers. Panelists will then express their thoughts and discuss with you how the interconnect problem can be solved by taking these degrees of freedom into account at the system design level. Views from industrial designers, CAD vendors, IC manufacturers and researchers will be presented.
Factors Influencing the Adoption of Residential Broadband Connections to the Internet
Authors: Laura J. Stanton
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Broadband adoption has been slower than anticipated in the United States resulting in a number of proposed policy interventions ranging from non-intervention to extreme measures. Digital divide advocates are concerned that demographics of broadband users will reveal the same digital divide gaps that are observed in computer ownership and home Internet access. This study analyzes the factors influencing the adoption of residential broadband services using the Current Population Survey data from September 2001. Three statistical models oncomputer ownership, home Internet access, and broadband access are analyzed to illustrate the differences in demographics between the dependent variables. Using a logit regression model, the results show that the digital divide is the widest for computer ownership and the narrowest for broadband access. The implications of this study are that public policy interventions to bridge the digital divide should focus more on computer ownership, and less on broadband specific policies.
A Dynamic Broadcast Ring Based Multicast Routing Protocol for Ad Hoc Networks
Authors: Yuan Zhou, Guangsheng Li, Qirong Mao, Yongzhao Zhan, Yibin Hou
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Ad hoc networks are self-organizing, dynamic topology networks formed by a collection of mobile nodes through radio links. Characteristics of this network, such as dynamic topology, power constrained, bandwidth constrained links, make multicasting extremely challenging. This paper proposes a novel multicast protocol for ad hoc networks, called Dynamic Broadcast Ring based Multicast routing Protocol (DBRMP). In DBRMP, the concept of dynamic broadcast ring is used, and each group member has a dynamic broadcast ring. When the graph composed of all broadcast rings is connected, multicast route can be established. For the radius of the broadcast ring can be adjusted dynamically according to the distance between members, the overhead of route maintenance is well controlled. Simulation results show that DBRMP can ensure the effectiveness of routing and improve the scalability of protocol.
The A-TABLE data-type for LISP systems
Authors: Shimon Cohen
Venue: ACM SIGPLAN Notices (1979)

This paper describes the A-TABLE Data-Type for LISP-based languages. The A-TABLE is introduced in an attempt to unify different structures such as the PASCAL-Record, SNOBOL-Table AND INTERLISP Funarg-Block.A set of functions is defined to apply A-TABLES to: (1) Creating, accessing and updating Records; (2) Managing associatively indexed tables; (3) Providing context-dependent computations in processes and coroutines; (4) Defining multivalued functions.We show how and why these functions can be efficiently implemented with respect to access, space, garbage-collection and page-faults. We compare the A-TABLE with other facilities - LIST, ARRAY, etc.It is suggested that the A-TABLE should be one of the data-types in LISP-based systems where it can fill the gap between types "LIST" and "ARRAY".
Isomorphisms of generic recursive polynomial types
Authors: Marcelo Fiore
Venue: ACM SIGPLAN Notices (2004)

This paper gives the first decidability results on type isomorphism for recursive types, establishing the explicit decidability of type isomorphism for the type theory of sums and products over an inhabited generic recursive polynomial type. The technical development provides connections between themes in programming-language theory (type isomorphism) and computational algebra (Gröbner bases).
Path sharing and predicate evaluation for high-performance XML filtering
Authors: Yanlei Diao, Mehmet Altinel, Michael J. Franklin, Hao Zhang, Peter Fischer
Venue: ACM Transactions on Database Systems (TODS) (2003)

XML filtering systems aim to provide fast, on-the-fly matching of XML-encoded data to large numbers of query specifications containing constraints on both structure and content. It is now well accepted that approaches using event-based parsing and Finite State Machines (FSMs) can provide the basis for highly scalable structure-oriented XML filtering systems. The XFilter system [Altinel and Franklin 2000] was the first published FSM-based XML filtering approach. XFilter used a separate FSM per path query and a novel indexing mechanism to allow all of the FSMs to be executed simultaneously during the processing of a document. Building on the insights of the XFilter work, we describe a new method, called "YFilter" that combines all of the path queries into a single Nondeterministic Finite Automaton (NFA). YFilter exploits commonality among queries by merging common prefixes of the query paths such that they are processed at most once. The resulting shared processing provides tremendous improvements in structure matching performance but complicates the handling of value-based predicates.In this article, we first describe the XFilter and YFilter approaches and present results of a detailed performance comparison of structure matching for these algorithms as well as a hybrid approach. The results show that the path sharing employed by YFilter can provide order-of-magnitude performance benefits. We then propose two alternative techniques for extending YFilter's shared structure matching with support for value-based predicates, and compare the performance of these two techniques. The results of this latter study demonstrate some key differences between shared XML filtering and traditional database query processing. Finally, we describe how the YFilter approach is extended to handle more complicated queries containing nested path expressions.
Singularity Probabilities for Random Matrices over Finite Fields
Authors: Jeff Kahn, János Komlós
Venue: Combinatorics, Probability and Computing (2001)

Fix q and let Mn be an n &times; n matrix with entries drawn independently from the finite field Fq according to some distribution &mu;n. It is shown that, except in certain pathological cases, the probability that Mn is nonsingular is asymptotically the same as for uniform entries; that is,****** Insert formula here ******
Composing for an ensemble of atoms: the metamorphosis of scientific experiment into music
Authors: Bob L. Sturm
Venue: Organised Sound (2001)

In quantum mechanics a particle can behave like a particle or a wave. Thus, systems of particles can be likened to a superposition of waves. Since sound can be described as a superposition of frequencies, it can also be described in terms of a system of particles manifest as waves. This metaphor between &lsquo;particle physics&rsquo; and sound synthesis is quantitatively developed here, suggested initially from some similarities between the two domains. It is applied to a few fundamental physical principles to show how these can be sonified. The author discusses the process of using a simulated &lsquo;atom trap&rsquo; to compose a piece that does not require a physicist to appreciate it. This metaphor blurs the distinctions between science and art, where scientific experiment becomes musical composition, and exploring a musical idea involves playing with particle system dynamics. In the future, methods like these could be used with a real system of particles &ndash; the particle accelerator will become an expressive musical instrument, and the particle physicist will become the composerscientist.
An improved algorithm for semantic clustering
Authors: Gabriel Castillo, Gerardo Sierra, John McNaught
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Sierra & McNaught (2000) proposed a clustering algorithm based on analogy. It takes as input pairs of definitions sharing the same term headword, in the same domain but from different sources, compares these definitions and identifies couples of words in the same extended semantic context. These couples are then grouped to yield semantically-related clusters. Here, we further evaluate the clustering algorithm, and develop an improved version whose results are also evaluated.