ppxscal/embedding_network huggingface dataset:
Inferring similarity between music objects with application to playlist generation
Authors: R. Ragno, C. J. C. Burges, C. Herley
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

The growing libraries of multimedia objects have increased the need for applications that facilitate search, browsing, discovery, recommendation and playlist construction. Many of these applications in turn require some notion of distance between, or similarity of, such objects. The lack of a reliable proxy for similarity of entities is a serious obstacle in many multimedia applications.In this paper we describe a simple way to automatically infer similarities between objects based on their occurrences in an authored stream. The method works both for audio and video. This allows us to generate playlists by emulating a particular stream or combination of streams, recommend objects that are similar to a chosen seed, and derive measures of similarity between associated entities, such as artists.
Towards Development on a Silicon-based Cellular Computing Machine
Authors: Gunnar Tufte, Pauline C. Haddow
Venue: Natural Computing: an international journal (2005)

Today's reconfigurable technology provides vast parallelism that may be exploited in the design of a cellular computing machine (CCM). In this work a virtual Sblock FPGA is implemented on an existing FPGA, achieving not only an architecture in keeping with cellular computing principles but also suited to biologically inspired design methods. The design method proposed is a combination of evolution and development and results of running a developmental model on the CCM are presented.
Regular splicing languages and subclasses
Authors: Paola Bonizzoni, Giancarlo Mauri
Venue: Theoretical Computer Science (2005)

Recent developments in the theory of finite splicing systems have revealed surprising connections between long-standing notions in the formal language theory and splicing operation. More precisely, the syntactic monoid and Schützenberger constant have strong interaction with the investigation of regular splicing languages. This paper surveys results of structural characterization of classes of regular splicing languages based on the above two notions and discusses basic questions that motivate further investigations in this field.In particular, we improve the result in [6] that provides a structural characterization of reflexive symmetric splicing languages by showing that it can be extended to the class of all reflexive splicing languages: this is the larger class for which a characterization is known.
CPAR-Cluster: a runtime system for heterogeneous clusters with mono and multiprocessor nodes
Authors: G. D. S. Craveiro, L. M. Sato
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

The advances in hardware technology enable the inclusion of an SMP node into a cluster of PC or even clusters of SMP. These are becoming viable alternatives for high performance computing. The challenge is the exploration of the computational resources that these hardware platforms provide. A hybrid programming paradigm which uses a shared memory architecture through multi threading and through a message passing model for inter node communication is an alternative. However, programming in such a paradigm is very hard. This work presents CPAR-Cluster, a runtime system that provides shared memory abstraction on top of a cluster composed by mono and multiprocessor nodes. Its implementation is at the library level and does not require special resources such as specific hardware or operating system modifications. Models, strategies, implementation aspects and some results are presented.
Attention-Based Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Bounds
Authors: Tamar Avraham, Michael Lindenbaum
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This work proposes a dynamic visual search framework based mainly on inner-scene similarity. Given a number of candidates (e.g., subimages), we hypothesize is that more visually similar candidates are more likely to have the same identity. We use this assumption for determining the order of attention. Both deterministic and stochastic approaches, relying on this hypothesis, are considered. Under the deterministic approach, we suggest a measure similar to Kolmogorov's epsilon-covering that quantifies the difficulty of a search task. We show that this measure bounds the performance of all search algorithms and suggest a simple algorithm that meets this bound. Under the stochastic approach, we model the identity of the candidates as a set of correlated random variables and derive a search procedure based on linear estimation. Several experiments are presented in which the statistical characteristics, search algorithm, and bound are evaluated and verified.
Panoply of Utilities in Taverna
Authors: K. Wolstencroft, T. Oinn, C. Goble, J. Ferris, C. Wroe, P. Lord, K. Glover, R. Stevens
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The Taverna e-Science Workbench is a central component of myGrid, a loosely coupled suite of middleware services designed to support in silico experiments in biology. Taverna enables the construction and enactment of complex workflows over resources on local and remote machines, allowing the automation of otherwise labour-intensive multi-step bioinformatics tasks. As the Taverna user community has grown, so has the demand for new features and additions. This paper outlines the functional requirements that have become apparent over the last year of working with domain scientists, along with the solutions implemented in both the Taverna workbench and the Freefluo enactment engine to address concerns relating to workflow construction and enactment, respectively.
Pre-equalization Techniques for Downlink and Uplink TDD MC-CDMA Systems
Authors: P. Bisaglia, L. Sanguinetti, M. Morelli, N. Benvenuto, S. Pupolin
Venue: Wireless Personal Communications: An International Journal (2005)

Time division duplex (TDD) multi carrier-code division multiple access (MC-CDMA) systems have recently been proposed as potential candidates for next generation (4G) technology. In order to mitigate multiple access interference, in this paper we investigate pre-equalization schemes for both downlink and uplink transmissions, the former also in a multiple transmit antenna scenario. In particular, new pre-equalizer techniques are introduced and complexity issues addressed. Numerical results are given to highlight the effectiveness of the proposed schemes with respect to other existing pre-equalizer solutions.
Inverse Polynomial Reconstruction of Two Dimensional Fourier Images
Authors: Jae-Hun Jung, Bernie D. Shizgal
Venue: Journal of Scientific Computing (2005)

The Gibbs phenomenon is intrinsic to the Fourier representation for discontinous problems. The inverse polynomial reconstruction method (IPRM) was proposed for the resolution of the Gibbs phenomenon in previous papers [Shizgal, B. D., and Jung, J.-H. (2003) and Jung, J.-H., and Shizgal, B. D. (2004)] providing spectral convergence for one dimensional global and local reconstructions. The inverse method involves the expansion of the unknown function in polynomials such that the residue between the Fourier representations of the final representation and the unknown function is orthogonal to the Fourier or polynomial spaces. The main goal of this work is to show that the one dimensional inverse method can be applied successfully to reconstruct two dimensional Fourier images. The two dimensional reconstruction is implemented globally with high accuracy when the function is analytic inside the given domain. If the function is piecewise analytic and the local reconstruction is sought, the inverse method is applied slice by slice. That is, the one dimensional inverse method is applied to remove the Gibbs oscillations in one direction and then it is applied in the other direction to remove the remaining Gibbs oscillations. It is shown that the inverse method is exact if the two-dimensional function to be reconstructed is a piecewise polynomial. The two-dimensional Shepp---Logan phantom image of the human brain is used as a preliminary study of the inverse method for two dimensional Fourier image reconstruction. The image is reconstructed with high accuracy with the inverse method
Fluorescence photon migration by the boundary element method
Authors: Francesco Fedele, Margaret J. Eppstein, Jeffrey P. Laible, Anuradha Godavarty, Eva M. Sevick-Muraca
Venue: Journal of Computational Physics (2005)

The use of the boundary element method (BEM) is explored as an alternative to the finite element method (FEM) solution methodology for the elliptic equations used to model the generation and transport of fluorescent light in highly scattering media, without the need for an internal volume mesh. The method is appropriate for domains where it is reasonable to assume the fluorescent properties are regionally homogeneous, such as when using highly specific molecularly targeted fluorescent contrast agents in biological tissues. In comparison to analytical results on a homogeneous sphere, BEM predictions of complex emission fluence are shown to be more accurate and stable than those of the FEM. Emission fluence predictions made with the BEM using a 708-node mesh, with roughly double the inter-node spacing of boundary nodes as in a 6956-node FEM mesh, match experimental frequency-domain fluorescence emission measurements acquired on a 1087cm^3 breast-mimicking phantom at least as well as those of the FEM, but require only 1/8 to 1/2 the computation time.
A Commentary on Horton's Designing and Writing Online Documentation
Authors: Mark Simpson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1993)

The technical writing community is fortunate to have William Horton's book because it is among the first to provide comprehensive, well thought-out advice about the issues writers and online designers face almost daily. But as one reviewer has already pointed out, "gaps exist, and we should be willing to review" Horton's book (Johnson, 1990, p. 181).
An approximate search engine for structure
Authors: Jason Wang
Venue:  (2004)

As the size of structural databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute-value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. In this dissertation, efficient search techniques are presented for retrieving trees from a database that are similar to a given query tree. Rooted ordered labeled trees, rooted unordered labeled trees and free trees are considered. Ordered labeled trees are trees in which each node has a label and the left-to-right order among siblings matters. Unordered labeled trees are trees in which the parent-child relationship is significant, but the order among siblings is unimportant. Free trees (unrooted unordered trees) are acyclic graphs. These trees find many applications in bioinformatics, Web log analysis, phyloinformatics, XML processing, etc. Two types of similarity measures are investigated: (i) counting the mismatching paths in the query tree and a data tree, and (ii) measuring the topological relationship between the trees. The proposed approaches include storing the paths of trees in a suffix array, employing hashing techniques to speed up retrieval, and counting the number of up-down operations to move a token from one node to another node in a tree. Various filters for accelerating a search, different strategies for parallelizing these search algorithms and applications of these algorithms to XML and phylogenetic data management are discussed. The proposed techniques have been implemented into a phylogenetic search engine which is fully operational and is available on the World Wide Web. Experimental results on comparing the similarity measures with existing tree metrics and on evaluating the efficiency of the search techniques demonstrate the effectiveness of the search engine. Future work includes extending the techniques to other structural data, as well as developing new filters and algorithms for speeding up searching and mining in complex structures.
Cunning, plausible lies
Authors: R. C. Lillington
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

When asked to write this article (or perhaps I volunteered--the distinction was not very clear at the time) I was unable to obtain any clear instruc instructions as to what the subject matter should be. The thought struck me that this must be a familiar enough situation to most technical writers, and this, in turn, triggered a temporary feeling of forgiveness for those faceless people who have managed to create for me my most memorable periods of chaos. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
ClassSheets: automatic generation of spreadsheet applications from object-oriented specifications
Authors: Gregor Engels, Martin Erwig
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Spreadsheets are widely used in all kinds of business applications. Numerous studies have shown that they contain many errors that sometimes have dramatic impacts. One reason for this situation is the low-level, cell-oriented development process of spreadsheets.We improve this process by introducing and formalizing a higher-level object-oriented model termed ClassSheet. While still following the tabular look-and feel of spreadsheets, ClassSheets allow the developer to express explicitly business object structures within a spreadsheet, which is achieved by integrating concepts from the UML (Unified Modeling Language). A stepwise automatic transformation process generates a spreadsheet application that is consistent with the ClassSheet model. Thus, by deploying the formal underpinning of ClassSheets, a large variety of errors can be prevented that occur in many existing spreadsheet applications today.The presented ClassSheet approach links spreadsheet applications to the object-oriented modeling world and advocates an automatic model-driven development process for spreadsheet applications of high quality.
Task planning for human-robot interaction
Authors: Rachid Alami, Aurélie Clodic, Vincent Montreuil, Emrah Akin Sisbot, Raja Chatila
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Human-robot interaction requires explicit reasoning on the human environment and on the robot capacities to achieve its tasks in a collaborative way with a human partner.This paper focuses on organization of the robot decisional abilities and more particularly on the management of human interaction as an integral part of the robot control architecture. Such an architecture should be the framework that will allow the robot to accomplish its tasks but also produce behaviors that support its engagement vis-a-vis its human partner and interpret similar behaviors from him.Together and in coherence with this framework, we intend to develop and experiment various task planners and interaction schemes, that will allow the robot to select and perform its tasks while taking into account explicitly the constraints imposed by the presence of humans, their needs and preferences.We have considered a scheme where the robot plans for itself and for the human in order not only (1) to assess the feasibility of the task (at a certain level) before performing it, but also (2) to share the load between the robot and the human and (3) to explain/illustrate a possible course of action.
Assignment of Orthologous Genes via Genome Rearrangement
Authors: Xin Chen, Jie Zheng, Zheng Fu, Peng Nan, Yang Zhong, Stefano Lonardi, Tao Jiang
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2005)

The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics. Existing methods that assign orthologs based on the similarity between DNA or protein sequences may make erroneous assignments when sequence similarity does not clearly delineate the evolutionary relationship among genes of the same families. In this paper, we present a new approach to ortholog assignment that takes into account both sequence similarity and evolutionary events at a genome level, where orthologous genes are assumed to correspond to each other in the most parsimonious evolving scenario under genome rearrangement. First, the problem is formulated as that of computing the signed reversal distance with duplicates between the two genomes of interest. Then, the problem is decomposed into two new optimization problems, called minimum common partition and maximum cycle decomposition, for which efficient heuristic algorithms are given. Following this approach, we have implemented a high-throughput system for assigning orthologs on a genome scale, called SOAR, and tested it on both simulated data and real genome sequence data. Compared to a recent ortholog assignment method based entirely on homology search (called INPARANOID), SOAR shows a marginally better performance in terms of sensitivity on the real data set because it is able to identify several correct orthologous pairs that are missed by INPARANOID. The simulation results demonstrate that SOAR, in general, performs better than the iterated exemplar algorithm in terms of computing the reversal distance and assigning correct orthologs.
Bayesian Perspective of Optimal Checkpoint Placement
Authors: Naoki Kobayashi, Tadashi Tadashi
Venue: Proceedings of the Ninth IEEE International Symposium on High-Assurance Systems Engineering (2005)

Checkpointing and rollback recovery is a commonly used technique to save the information on the main memory in file systems to a safe secondary medium. In this paper we develop fully Bayesian learning algorithms to place the checkpoint adaptively. Based on two kinds of prior distributions for the Weibull system failure time distribution, we give semi-parametric estimation methods of the optimal checkpoint interval minimizing the expected operating cost rate. Simulation experiments show how to determine the hyper-parameters as well as asymptotic properties of the resulting estimators.
Designing Reliable Systems from Unreliable Components: The Challenges of Transistor Variability and Degradation
Authors: Shekhar Borkar
Venue: IEEE Micro (2005)

As technology scales, variability will continue to become worse. Random dopantfluctuations and sub-wavelength lithography will yield static variations, supply voltageand temperature variations will affect circuit performance and leakage power, soft-errorrates will continue to rise, and transistor aging will become worse. We discuss theseeffects and propose solutions to build reliable systems with billions of unreliablecomponents.
Search-Based Amorphous Slicing
Authors: Deji Fatiregun, Mark Harman, Robert M. Hierons
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

Amorphous slicing is an automated source code extraction technique with applications in many areas of software engineering, including comprehension, reuse, testing and reverse engineering. Algorithms for syntax-preserving slicing are well established, but amorphous slicing is harder because it requires arbitrary transformation; finding good general purpose amorphous slicing algorithms therefore remains as hard as general program transformation. In this paper we show how amorphous slices can be computed using search techniques. The paper presents results from a set of experiments designed to explore the application of genetic algorithms, hill climbing, random search and systematic search to a set of six subject programs. As a benchmark, the results are compared to those from an existing analytical algorithm for amorphous slicing, which was written specifically to perform well with the sorts of program under consideration. The results, while tentative at this stage, do give grounds for optimism. The search techniques proved able to reduce the size of the programs under consideration in all cases, sometimes equaling the performance of the specifically-tailored analytic algorithm. In one case, the search techniques performed better, highlighting a fault in the existing algorithm.
Breakdowns in high-k gate stacks of nano-scale CMOS devices
Authors: K. L. Pey, R. Ranjan, C. H. Tung, L. J. Tang, V. L. Lo, K. S. Lim, T. A. L. Selvarajoo, D. S. Ang
Venue: Microelectronic Engineering (2005)

New failure mechanisms associated with breakdown in high-k gate stack consisting of HfO2/SiOx bilayered structure are presented. In addition to dielectric-breakdown-induced epitaxy (DBIE) commonly found in breakdowns in poly-Si/SiOxNy and poly-Si/Si3N4 MOSFETs, grain-boundary and field-assisted breakdowns near the poly-Si edge are found. A model based on breakdown induced thermo-chemical reactions has been developed to describe the physical microstructural damages triggered by breakdown in the high-k gate stack and the associated post-breakdown electrical performance. Some abnormal post-breakdown electrical behaviors such as recouping of the transistor's saturated drain current, percolation resistance and transconductance are found to be common for high-k MOSFETs. Grain-boundary enhanced breakdown in annealed HfO2 films is of critical importance in degrading the reliability of high-k gate stacks.
Predictable embedding of large data structures in multiprocessor networks-on-chip
Authors: Sander Stuijk, Twan Basten, Bart Mesman, Marc Geilen
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Predictable, tile-based multiprocessor networks-onchip are considered as future embedded systems platforms. Each tile contains one or a few processors and local memories. These memories are typically too small to store large data structures (e.g. a video frame). A solution to this is to embed tiles with large memories in the architecture. However, fetching data from these memories is slow because of the large network delays. The delay can be hidden by using prefetching. Our main contributions are models that allow timing analysis to provide guaranteed quality and performance when using remote memories and prefetching. We use two realistic video applications to show that our models can be used in practice to derive a predictable system using large memory tiles and prefetching, and to provide guaranteed real-time performance.