ppxscal/embedding_network huggingface dataset:
On the l1 procrustes problem
Authors: Nickolay T. Trendafilov
Venue: Future Generation Computer Systems (2003)

In this paper, the well-known Procrustes problem is reconsidered. The usual least squares objective function is replaced by more robust one, based on a smooth approximation of the ℓ1 matrix norm. This smooth approximation to the ℓ1 Procrustes problem is solved making use of the projected gradient method. The Procrustes problem with partially specified target is treated and solved as well. Several classical numerical examples from factor analysis (well-known with their least squares Procrustes solutions) are solved with respect to the smooth approximation of the ℓ1 matrix norm goodness-of-fit measure.
Typorganism
Authors: Gicheol Lee
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

Typorganism(http://www.typorganism.com) is a web-based work, which is comprised of eight communication experiments. This project's main focus is interactive kinetic typography, and I began with my metaphorical belief that "type is a life form."During the course of designing and developing this web site, the project itself has been evolved to embrace the experiment for multi-user interaction on the web.
Testability Analysis Applied to Embedded Data-flow Software
Authors: Thanh Binh Nguyen, Michel Delaunay, Chantal Robach
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Testability is an important quality factor of software,particularly embedded data-flow software such as avionicssoftware. A lack of testability of such software can badly affecttest costs and software dependability. Testability analysiscan be used to identify parts of software which are difficultfor testing.In this paper, we propose the use of the Static Single Assignment(SSA) form to transform source code generatedfrom data-flow designs into a data-flow representation, andthen we describe some algorithms to automatically translatethe SSA form into a testability model. Thus, some metricscan be applied to the testability model in order to locatethe software parts which induce a weakness of the testability.
Computational data modeling for network-constrained moving objects
Authors: Laurynas Speičvcys, Christian S. Jensen, Augustas Kligys
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

Advances in wireless communications, positioning technology, and other hardware technologies combine to enable a range of applications that use a mobile user's geo-spatial data to deliver online, location-enhanced services, often referred to as location-based services. Assuming that the service users are constrained to a transportation network, this paper develops data structures that model road networks, the mobile users, and stationary objects of interest. The proposed framework encompasses two supplementary road network representations, namely a two-dimensional representation and a graph representation. These capture aspects of the problem domain that are required in order to support the querying that underlies the envisioned location-based services.
QoS Evaluation of JMS: An Empirical Approach
Authors: Shiping Chen, Paul Greenfield
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

JMS is an API specification that defines a standard way for Java applications to access messaging services. All JMS products promise good performance and to properly support the QoS attributes specified in the standard, making it hard to choose between them. Customers who want to determine which JMS product best meets their requirements need a simple, effective and fair methodology for evaluating and comparing competing implementations. This paper presents an empirical methodology for evaluating the QoS implementation of a JMS product. We present a number of test scenarios and define metrics for measuring performance and message persistence. We then illustrate this methodology by using it to evaluate two leading JMS products. Our evaluation results show differences between these products in terms of their overall performance and the impact of various QoS attributes. The case study demonstrates that our empirical methodology is an effective and practical way to test the performance of JMS and other messaging systems.
Biased graphs IV: geometrical realizations
Authors: Thomas Zaslavsky
Venue: Journal of Combinatorial Theory Series B (2003)

A gain graph is a graph whose oriented edges are labelled invertibly from a group G, the gain group. A gain graph determines a biased graph and therefore has three natural matroids (as shown in Parts I and II): the bias matroid G has connected circuits; the complete lift matroid L0 and its restriction to the edge set, the lift matroid L, have circuits not necessarily connected. We investigate representations of these matroids. Each has a canonical vector representation over any skew field F such that G ⊆ F* (in the case of G) or G ⊆ F+ (in the case of L and L0). The representation of G is unique up to change of gains when the gain graph is full, but not in general. The representation of G or L is unique or semi-unique (up to changing the gains) for 'thick' biased graphs. The lift representations are unique (up to change of gains) for L0 but not for L. The bias matroid is representable also in other ways by points and hyperplanes; one of these representations dualizes the vector representation, while two, in projective space, strongly generalize the theorems of Menelaus and Ceva. (The latter specialize to properties of the geometry of midpoints and farpoints, and of median and edge-parallel hyperplanes, in an affine simplex.) The dual hyperplane representation can be abstracted away from fields to a kind of equational logic and permutation geometry that exist for every gain group. The lift matroids are representable by orthographic points and by linear, projective, and affinographic hyperplanes. L0 also has a metric hyperplanar representation that depends on the Pythagorean theorem. Incidental results are that Whitney's 2-isomorphism operations preserve gains and, to an extent, matroids; and new definitions of the bias and lift matroids based on extremal properties of the rank functions.
Using a Gigabit Ethernet Cluster as a Distributed Disk Array with Multiple Fault Tolerance
Authors: Alessandro Di Marco, Giovanni Chiola, Giuseppe Ciaccio
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

A cluster of PCs can be seen as a collection of networkedlow cost disks; such a collection can be operated by propersoftware so as to provide the abstraction of a single, largerblock device. By adding suitable data redundancy, such adisk collection as a whole could act as single, highly faulttolerant, distributed RAID device, providing capacity andreliability along with the convenient price/performance typicalof commodity clusters.We report about the design and performance of DRAID,a distributed RAID prototype running on a Gigabit Ethernetcluster of PCs. DRAID offers storage services undera Single I/O Space (SIOS) block device abstraction. TheSIOS feature implies that the storage space is accessible byeach of the stations in the cluster, rather than throughoutone or few end-points, with a potentially higher aggregateI/O bandwidh and better suitability to parallel I/O.
Operating in musical economies of compromise (or . . . When do I get paid for writing this?)
Authors: Terre Thaemlitz
Venue: Organised Sound (2001)

In this article Thaemlitz posits that the current state of digital audio production's borders are not determined by battles between academia and the marketplace, subsidy and enterprise, nor high-brow and low-brow. However, such binarisms continue to frame our efforts in ways which fuel rhetoric of transformation and revolution, while diffusing our material ability to impact a cultural mainstream. Rather than attempting to resolve such divisiveness and hypocrisy in our behaviour, Thaemlitz proposes an increased awareness of the cultural processes which facilitate our simultaneous participation in such seemingly irreconcilable arenas. In other words, celebrating diversity sometimes means throwing a party for a friend you are not particularly fond of.
Average time of computing Boolean operators
Authors: A. V. Chashkin
Venue: Discrete Applied Mathematics (2004)

The average time of computing Boolean operators by straight-line programs of two types is studied. Upper and lower bounds for the corresponding Shannon functions are obtained. Asymptotically exact formulas for Shannon functions are derived in the case when the number of components of the operators to be computed increases with the number of their arguments.
Creating engaging artificial characters for games
Authors: Penelope Sweetser, Daniel Johnson, Jane Sweetser, Janet Wiles
Venue: Proceedings of the second international conference on Entertainment computing (2003)

Game developers and researchers aim to model human behaviour in order to create more engaging, entertaining and satisfying artificial characters for computer games. It is a popular belief that intelligent behaviour is the key to creating better game AI. However, as yet there is no empirical evidence to support this theory or to indicate whether other attributes, such as social interaction, realistic behaviour and communication, should also be considered. This study aimed to find out which attributes people desire in team members and opponents in computer games. The study employed a questionnaire, administered to a group of university students, directed towards ascertaining the importance of different aspects of player behaviour in games. It was found that there are two different, non-homogenous groups, each with separate needs and wants that game developers should consider. Firstly, it was found that people who prefer playing computer games with other humans tend to value intelligent behaviour and social interaction more than people who prefer computer players. Secondly, it was found that people who prefer computer players do so for convenience, practice and a preference for games that can only be played individually. It is recommended that games developers should aim to model intelligent behaviour for the first group and that the second group require an in-game learning environment for skill-development.
CGEMS: Computer Graphics Educational Materials Server
Authors: Frederico C. Figueiredo, Dena E. Eber, Joaquim A. Jorge
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Computer graphics has evolved considerably over the past few decades. As computer science, digital arts, and other areas of study that use computer graphics continue to evolve and gain new substance, educators have come to master new content and achieve deeper understandings of computers and imagery. As the core field becomes more mature, educators in all computer graphics disciplines have a greater need for high-quality curricular resources. Offering excellent educational materials is an important service to the community of educators. Such support will empower both young and seasoned educators alike to benefit from and contribute to the work of others. In this way, we can achieve a higher standard of teaching worldwide.The purpose of our work is to provide tools to foster such a community of computer graphics educators. We will present a system that will act as the means for their work to be appraised, assessed and made available to others through an online server for refereed educational content in computer graphics.In this paper we describe the basis for and highlight some of the starting requirements of CGEMS, the online Computer Graphics Educational Materials Server. This is organized around a web-based groupware application that supports the submission, review, acquisition, and archiving of curricular resources.
A Daemon for Multicast Internet Key Exchange
Authors: Thorsten Aurisch, Christoph Karg
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

For securing multicast traffic with IPSec mechanisms, amandatory requirement is that each member of the communication group owns the group security parameters. Forthis purpose, a concept for Multicast Internet Key Exchangeis introduced for negotiation and controlled distribution ofgroup security parameters and membership management.A daemon is presented for use in a military environment.Hence, its protocols are designed to be insensitive againstpacket loss and are able to deal with special military conditions.
A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints
Authors: Xiaojun Chen, Masao Fukushima
Venue: Computational Optimization and Applications (2004)

We consider a mathematical program whose constraints involve a parametric P-matrix linear complementarity problem with the design (upper level) variables as parameters. Solutions of this complementarity problem define a piecewise linear function of the parameters. We study a smoothing function of this function for solving the mathematical program. We investigate the limiting behaviour of optimal solutions, KKT points and B-stationary points of the smoothing problem. We show that a class of mathematical programs with P-matrix linear complementarity constraints can be reformulated as a piecewise convex program and solved through a sequence of continuously differentiable convex programs. Preliminary numerical results indicate that the method and convex reformulation are promising.
Capacity planning tool for streaming media services
Authors: Ludmila Cherkasova, Wenting Tang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

The goal of the proposed capacity planning tool is to provide the best cost/performance configuration for support of a known media service workload. There are two essential components in our capacity planning tool: i) the capacity measurements of different h/w and s/w solutions using a specially designed set of media benchmarks and ii) a media service workload profiler, called MediaProf, which extracts a set of quantitative and qualitative parameters characterizing the service demand. The capacity planning tool matches the requirements of the media service workload profile, SLAs and configuration constraints to produce the best available cost/performance solution.
An Improved Search Technique for Optimal Winner Determination in Combinatorial Auctions
Authors: Merlin Nandy, Ambuj Mahanti
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Combinatorial auctions allow bidders to bid their synergistic values. Because of complementarities between different assets, bidders give their preferences not just for particular items but also for sets or bundles of items. This form of auction shows great potentialunder some given circumstances but is still in its infancy. The difficulty lies in finding the optimal price that is the price of a revenue maximizing set of winning bids. Determining the revenue maximizing set of winning bids is NP-complete. In this paper we review some of the existing approaches as detailed by Sandholm in one of his recent studies. We propose a heuristic, which is a lower bound on the maximal revenue, or an inadmissible heuristic. We then present an algorithm called, "Iterative Threshold Search (ITS) -- Hybrid". We show using this algorithm that, although inadmissible, such a heuristic near the optimal can be a better choice in practice than a surely admissible or upper bound heuristic. We establish through experiments that this new heuristic coupled with the proposed search algorithm improves the performance result significantly over the one presented by Sandholm.
High-Performance QuIDD-Based Simulation of Quantum Circuits
Authors: George F. Viamontes, Igor L. Markov, John P. Hayes
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and vectors modeling qubit states grow exponentially with the number of qubits. It has been shown experimentally that the QuIDD (Quantum Information Decision Diagram) datastructure greatly facilitates simulations using memory and runtime that are polynomial in the number of qubits. In this paper, we present a complexity analysis which formally describes this class of matrices and vectors. We also present an improved implementation of QuIDDs which can simulate Grover's algorithm for quantum search with the asymptotic runtime complexity of an ideal quantum computer up to negligible overhead.
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
Authors: Mukund Deshpande, Michihiro Kuramochi, George Karypis
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper we study the problem of classifying chemical compounddatasets. We present a sub-structure-based classificationalgorithm that decouples the sub-structure discovery processfrom the classification model construction and uses frequentsubgraph discovery algorithms to find all topological and geometricsub-structures present in the dataset. The advantage ofour approach is that during classification model construction, allrelevant sub-structures are available allowing the classifier tointelligently select the most discriminating ones. The computationalscalability is ensured by the use of highly efficient frequentsubgraph discovery algorithms coupled with aggressive featureselection. Our experimental evaluation on eight different classificationproblems shows that our approach is computationallyscalable and on the average, outperforms existing schemes by10% to 35%.
Modular refinement in novel schema calculi
Authors: Moshe Deutsch, Martin C. Henson, Besnik Kajtazi
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Using the language Z for more than specification is hinderedby the fact that its algebra of schemas is not monotonicwith respect to refinement; so specification is modular,but development is not. In this paper we isolate the reasonswhy Z suers from these problems and we describe alternativemodels for specifications and schema operations whichare monotonic. This leads us to explore a number of theoreticaland pragmatic questions: the former concern logicsfor modular refinement; the latter explore the use of novelschema calculi in practice.
Computer tools for better public sector management
Authors: Carl Grafton, Anne Permaloff
Venue: Public information technology: policy and management issues (2003)

Almost any public sector task employing a computer can be accomplished more efficiently with a variety of tools rather than any single one. Basic tools are word processing, spreadsheet, statistics, and database management programs. Beyond these, Web authoring software, presentation graphics, optical character recognition (OCR), and project planning and management software can be helpful depending upon the job at hand.
New challenges in privacy protection
Authors: Lech J. Janczewski
Venue: Advanced topics in global information management (2003)

The protection of privacy is a function of many variables: culture, politics, and point of view. Practically all countries have introduced laws regulating these problems. Terrorist attacks culminating with the destruction of the World Trade Center in New York and the Pentagon in Washington indicated a need to change these regulations. Therefore, this chapter defines the notion of privacy and cites typical regulations related to the protection of privacy and the interception of private communications and documents. This discussion terminates with a presentation of a worldwide prognosis in this field.
Towards extensible graphical formalisms
Authors: Carlo Ghezzi, Mauro Pezzè
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

We discuss how to tailor a graphical notation on top of a kernel formal (graphical) specification language. The goal is to allow an environment supporting formal specifications written in a kernel formal notation to be extended to support additional, application domain oriented, graphical notations. The semantics of the newly defined notation is given by a translation scheme into the kernel notation. Our approach is founded on high-level Petri nets, the kernel formalism, and graph grammars, which define the new graphical notations and their translation into target nets. The paper provides examples of the definition of Statecharts on top of the kernel formalism.
A maximum likelihood approach to single-channel source separation
Authors: Gil-Jin Jang, Te-Won Lee
Venue: The Journal of Machine Learning Research (2003)

This paper presents a new technique for achieving blind signal separation when given only a single channel recording. The main concept is based on exploiting a priori sets of time-domain basis functions learned by independent component analysis (ICA) to the separation of mixed source signals observed in a single channel. The inherent time structure of sound sources is reflected in the ICA basis functions, which encode the sources in a statistically efficient manner. We derive a learning algorithm using a maximum likelihood approach given the observed single channel data and sets of basis functions. For each time point we infer the source parameters and their contribution factors. This inference is possible due to prior knowledge of the basis functions and the associated coefficient densities. A flexible model for density estimation allows accurate modeling of the observation and our experimental results exhibit a high level of separation performance for simulated mixtures as well as real environment recordings employing mixtures of two different sources.
Residual reliability of P-threshold graphs
Authors: A. A. Chernyak
Venue: Discrete Applied Mathematics (2004)

We solve the problem of computing the residual reliability (the RES problem) for all classes of P-threshold graphs for which efficient structural characterizations based on decomposition to indecomposable components have been established. In particular, we give a constructive proof of existence of linear algorithms for computing residual reliability of pseudodomishold, domishold, matrogenic and matroidal graphs. On the other hand, we show that the RES problem is #P-complete on the class of biregular graphs, which implies the #P-completeness of the RES problem on the classes of indecomposable box-threshold and pseudothreshold graphs.