ppxscal/embedding_network huggingface dataset:
NePalTM: design and implementation of nested parallelism for transactional memory systems
Authors: Haris Volos, Adam Welc, Ali-Reza Adl-Tabatabai, Tatiana Shpeisman, Xinmin Tian, Ravi Narayanaswamy
Venue: ACM SIGPLAN Notices (2009)

We present the programming model, design and implementation of NePalTM; a transactional memory system where atomic blocks can be used for concurrency control at an arbitrary level of nested parallelism.
Efficient resource utilization for an extensible processor through dynamic instruction set adaptation
Authors: Lars Bauer, Muhammad Shafique, Jörg Henkel
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

State-of-the-art application-specific instruction set processors (ASIPs) allow the designer to define individual prefabrication customizations, thus improving the degree of specialization towards the actual application requirements, e.g., the computational hot spots. However, only a subset of hot spots can be targeted to keep the ASIP within a reasonable size. We propose a modular Special Instruction composition with multiple implementation possibilities per Special Instruction, compile-time embedded instructions to trigger a run-time adaptation of the instruction set, and a run-time system that dynamically selects an appropriate variation of the instruction set, i.e., a situation-dependent beneficial implementation for each Special Instruction. We thereby achieve a better efficiency of resource usage of up to 3.0× (average 1.4×) compared with current state-of-the-art ASIPs, resulting in a 3.1× (average 1.4×) improved application performance (compared with a general purpose processor up to 25.7× and average 17.6×).
Color Image Retrieval Using M-Band Wavelet Transform Based Color-Texture Feature
Authors: Malay K. Kundu, Priyank Bagrecha
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Feature Extraction algorithm is a very important component of any retrieval scheme. We propose M-band Wavelet Transform based feature extraction algorithm in this paper. The MxM sub-bands are used as primitive features, over which energies computed in a neighborhood are taken as the features for each pixel of the image. These features are clustered using FCM to obtain image signature for similarity matching using the Earth Mover's Distance. The results obtained were compared with MPEG-7 content descriptor based system and found to be superior.
Objective characterization of oesophageal voice supporting medical diagnosis, rehabilitation and monitoring
Authors: B. García, I. Ruiz, A. Méndez, M. Mendezona
Venue: Computers in Biology and Medicine (2009)

Otolaryngologists use computational tools in the objective diagnosis of vocal folds pathologies by means of a set of acoustic parameters among others. This can be achieved in the cases of slight pathologies, but it does not exist any commercial software suitable for severe degradations of speech, as they are the oesophageal voice of laryngectomees. The present article shows a high-accuracy algorithm for the detection of the periodicity cycles of both oesophageal and laryngeal voices with low quality which allows the accurate and automatic estimation of pitch, jitter and shimmer. As the proposed algorithm works also with slighter pathologies, it is a useful contribution which allows doctors to perform an objective control during rehabilitation and monitoring stages. Thus, a patient can be controlled during oesophageal voice learning stage and it can also be saved a medical record with the results of the acoustic parameters' measurements in order to detect possible relapses.
Enhancing communication with groups of agents using learned non-unanimous ontology concepts
Authors: Mohsen Afsharchi, Jörg Denzinger, Behrouz H. Far
Venue: Web Intelligence and Agent Systems (2009)

We present an extension to the definition of a concept in an ontology that allows an agent to simultaneously communicate with a group of agents that might have different understandings of some concepts. We also provide a way to learn such non-unanimous concepts by using a method for learning concepts from a group of teachers. The general idea of non-unanimous concepts is to use the teachers to identify the core of a concept everyone agrees on and what else at least some of the teachers think belongs into the concept. The learning agent also decides what belongs to the concept for itself and whenever it needs to communicate with a group of other agents and needs to be precise it makes use of these three concept aspects by providing additional example objects for what might be misunderstood.
New Algorithms for Admission Control and Scheduling to support Multimedia Feedback Remote Control Applications
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Multimedia feedback remote control applications use a control loop between devices such as robot hands and cameras and a human user. Application-to-application quality of service guarantees are required. Network and end-point resources must be controlled and integrated in a robust admission and scheduling process. We focus in this paper on a novel admission and scheduling process for the end-points. The algorithms were prototyped within our OMEGA architecture, which controls the end-point resources in full-feedback applications such as telerobotics. 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
Deriving Efficient Data Movement from Decoupled Access/Execute Specifications
Authors: Lee W. Howes, Anton Lokhmotov, Alastair F. Donaldson, Paul H. Kelly
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

On multi-core architectures with software-managed memories, effectively orchestrating data movement is essential to performance, but is tedious and error-prone. In this paper we show that when the programmer can explicitly specify both the memory access pattern and the execution schedule of a computation kernel, the compiler or run-time system can derive efficient data movement, even if analysis of kernel code is difficult or impossible. We have developed a framework of C++ classes for decoupled Access/Execute specifications, allowing for automatic communication optimisations such as software pipelining and data reuse. We demonstrate the ease and efficiency of programming the Cell Broadband Engine architecture using these classes by implementing a set of benchmarks, which exhibit data reuse and non-affine access functions, and by comparing these implementations against alternative implementations, which use hand-written DMA transfers and software-based caching.
Browsing with Dynamic Key Frame Collages in Web-Based Entertainment Video Services
Authors: Kent Wittenburg, John Nicol, Jim Paschetto, Chris Martin
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper we discuss video browsing in the context of Web-based entertainment video services. We propose dynamic collages of key frames as a suitable technique for rapid evaluation of moderately-sized sets of candidate videos that have been selected via hierarchical browsing or querying techniques elsewhere in the interface. Dynamic key frame collages integrate temporal and spatial layout, and thus potentially retain the advantages of each. We relate our designs to the research of Marchionini and colleagues, who have evaluated the effectiveness of other temporal and spatial key frame presentation techniques.
Simplify Multi-valued Decision Trees
Authors: Chien-Liang Liu, Chia-Hoang Lee
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Decision tree is one of the popular data mining algorithms and it has been applied on many classification application areas. In many applications, the number of attribute values may be over hundreds and that will be difficult to analyze the result. The purpose of this paper will focus on the construction of categorical decision trees. A binary splitting decision tree algorithm is proposed to simplify the classification outcomes. It adopts the complement operation to simplify the split of interior nodes and it is suitable to apply on the decision trees where the number of outcomes is numerous. In addition, meta-attribute could be applied on some applications where the number of outcomes is numerous and the meta-attribute is meaningful. The benefit of meta-attribute representation is that it could transfer the original attributes into higher level concepts and that could reduce the number of outcomes.
Towards Distributed Synthetic Environments for Training in Industry
Authors: Axe1 Hintze, Marco Schumann, Stefan Stuering
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Synthetic erwirotments provide new possibilities for leurning and training. Added benefits can be achieved 6) the use of networks. This requires the distribution of applications and their interoperabili~. In the case of distributed simulation, a new standard called High-Level- Architecture (HLA) exists. HLA N' CIS designed by the DMSO/DOD of the United States of America. Together with its partners in a European-fimded project, Fraunhofer IFF is developing a prototype of a VR-based distributed trair+g system for mainterlance technicians. This contribution to the conjerence shobvs different specific aspects of the development, e.g. the technical and methodological basis, the la!er architectlrre of the information management of the applicatiori, arid the use of HLA for the multi-site and multi-user aspects.
Programming languages matters
Authors: Richard Wyatt, Lonnie Fairchild, Adrian Ionescu, David Hemmendinger, Amruth N. Kumar
Venue: Journal of Computing Sciences in Colleges (2009)

What, I asked the panelists, should an undergraduate Programming Languages course at a mid-level institution consist of? ABET and CC-2005 are not much help. They leave an enormous range of options; all they say on the matter is: ABET: IV-6. The core materials must provide basic coverage of ..., concepts of programming languages... [2008--2009 Criteria for Accrediting Computing Programs, p. 3] ACM/IEEE: Theory of Programming Languages Principles and design of programming languages including grammars (syntax), semantics, type systems, and various language models (e.g., declarative, functional, procedural, and object-oriented). [ACM and IEEE Computing Curricula 2005, p. 56]
Case Study on Optimization of Rectangular Object Layout by Genetic Algorithm
Authors: Xiaozhen Mi, Xiaodong Zhao, Wenzhong Zhao, Wenhui Fan
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

In rail-vehicle manufacturing enterprises, material costs are main part of total costs, so nesting optimization and material quota is important for enterprise's cost control and supply chain management. Because most parts are rectangular, rectangular object layout is solved first in nesting optimization. Rectangular object layout is not a simple NP (nondeterministic polynomial) optimization problem because of the practical production rules, such as guillotine. Under certain situations, the guillotine is even more important than the pure using ratio of metal sheets. The purpose of this paper is to construct the model of genetic algorithm and design the genetic operators for a practical case. Combined with the lowest-horizontal-line search algorithm, Genetic algorithm model is applied into rectangular object layout optimization. Results show that the model can satisfy not only the practical production requirements of guillotine, but also the requirement for production convenience. In this way, users can get optimal layout results and a higher material using ratio for practical production effectively and quickly.
A Model-Driven Engineering Approach for the Usability of Plastic User Interfaces
Authors: Jean-Sébastien Sottet, Gaëlle Calvary, Joëlle Coutaz, Jean-Marie Favre
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Plastic User Interfaces (UI) are able to adapt to their context of use while preserving usability. Research efforts have focused so far, on the functional aspect of UI adaptation, while neglecting the usability dimension. This paper investigates how the notion of mapping as promoted by Model Driven Engineering (MDE), can be exploited to control UI adaptation according to explicit usability criteria. In our approach, a run-time UI is a graph of models related by mappings. Each model (e.g., the task model, the Abstract UI, the Concrete UI, and the final UI) describes the UI from a specific perspective from high-level design decisions (conveyed by the task model) to low-level executable code (i.e. the final UI). A mapping between source and target models specifies the usability properties that are preserved when transforming source models into target models. This article presents a meta-model for the notion of mapping and shows how it is applied to plastic UIs.
DAGmap View
Authors: Vassilis Tsiaras, Ioannis G. Tollis
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

DAGmap view is a program written in Java that draws directed acyclic graphs using space filling techniques. In DAGmap view the layout function and the hierarchy presentation function have been decomposed to improve the stability of the layout during navigation and zooming.
Brief paper: Subspace like identification incorporating prior information
Authors: Pavel Trnka, Vladimír Havlena
Venue: Automatica (Journal of IFAC) (2009)

The subspace identification methods have proved to be a powerful tool, which can further benefit from the prior information incorporation algorithm proposed in this note. In the industrial environment, there is often some knowledge about the identified system (known static gains, dominant time constants, low frequency character, etc.), which can be used to improve model quality and its compliance with first principles. The proposed algorithm has two stages. The first one is similar to the subspace methods as it uses their interpretation as an optimization problem of finding parameters of an optimal multi-step linear predictor for the experimental data. This problem is reformulated in the Bayesian framework allowing prior information incorporation in the form of the mean value and the covariance of the impulse response, which is shown to be useful for the incorporation of several prior information types. The second stage with state space model realization from the posterior impulse response estimate is different from the standard subspace methods as it is based on the structured weighted lower rank approximation, which is necessary to preserve the prior information incorporated in the first stage.
An efficient XML encoding and labeling method for query processing and updating on dynamic XML data
Authors: Jun-Ki Min, Jihyun Lee, Chin-Wan Chung
Venue: Journal of Systems and Software (2009)

In this paper, we propose an efficient encoding and labeling scheme for XML, called EXEL, which is a variant of the region labeling scheme using ordinal and insert-friendly bit strings. We devise a binary encoding method to generate the ordinal bit strings, and an algorithm to make a new bit string inserted between bit strings without any influences on the order of preexisting bit strings. These binary encoding method and bit string insertion algorithm are the bases of the efficient query processing and the complete avoidance of re-labeling for updates. We present query processing and update processing methods based on EXEL. In addition, the Stack-Tree-Desc algorithm is used for an efficient structural join, and the String B-tree indexing is utilized to improve the join performance. Finally, the experimental results show that EXEL enables complete avoidance of re-labeling for updates while providing fairly reasonable query processing performance.
New thiophene monolayer-protected copper nanoparticles: synthesis and chemical-physical characterization
Authors: Elisabetta Foresti, Guido Fracasso, Massimiliano Lanzi, Isidoro Giorgio Lesci, Luisa Paganin, Tommaso Zuccheri, Norberto Roveri
Venue: Journal of Nanomaterials (2008)

For the first time copper 3-(6-mercaptohexyl) thiophene-protected nanoparticles (Cu T6SH) have been synthesized by a one-phase system, utilizing an NaBH4/LiCl mixture in diglyme as the reducing reagent and avoiding water medium dissolving copper salts. The prepared nanoclusters, characterized by transmission electron microscopy (TEM), have shown a constant spherical morphology with a size dimension of 5-6 nm in diameter. After their synthesis, no morphological evolution and irreversible aggregation process has been observed after a storage in CH2Cl2 at low temperature for a period up to six months long. Cu T6SH nanoparticles have been investigated by UV-Visible (UV-Vis) and Fourier transmission infrared (FTIR) spectroscopes to characterize the alkylthiophenes monolayer conformations and the particles optoelectronic properties. The UV-Vis reveals the lack of the surface plasmonic band, previously observed in Cu-nanosized clusters at about 556-570 nm, and shows a wide-band centered at 293 nm, probably due to the high-conformational surface ordering of thiophene rings on the Cu core. The results highlight the importance of the modifications ported to the well-known one-phase synthetic reactions to obtain a clear lack, even after a storage of six months, of any irreversible aggregation that has always characterized chain thiophene-protected metallic nanoparticles.
Keynote Speech: A Review of the Ontological Status, Computational Foundations and Methodological Processes of Agent-Based Modeling and Simulation Approaches: Open Challenges and Research Perspectives
Authors: Alexis Drogoul
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Agent based modeling (ABM) and simulation techniques are now used in a number of domains, ranging from social sciences, ecology or biology to exact sciences like physics. They provide modelers with the ability to understand and reproduce, through virtual experiments, the emergence of nearly any kind of macro-structure or macro-dynamics from the interactions of lower level computer programs called agents. As these agents can be programmed with all the details required and can arbitrarily cover any level of representation, ABM undeniably represents one of the most versatile approaches to understanding complex systems through simulation.
Online Marketing Techniques for Real Estate Agents and Brokers: Insider Secrets You Need to Know to Take Your Business to the Next Level
Authors: Karen Vieira
Venue:  (2008)

In this groundbreaking new book you will learn the secrets of top producing real estate agents and brokers and how they use the Web to market listings and get new clients and listings. You will learn how top agents and brokers are taking their business to the next level by using low cost and highly effective methods on the Internet. Learn how to take advantage of new marketing systems so you can connect with today's Internet savvy real estate consumers. Learn what Internet consumers want most and how easy and affordable it is to provide. This new book will show you how to build, promote, get new clients and sell your listings using the Internet, with minimal costs. Let us arm you with the knowledge you need to make your business a success. Learn how to generate more traffic for your site with hundreds of Internet marketing methods, including many free and low-cost promotions. This new book presents a comprehensive, hands-on, step-by-step guide for increasing Web site traffic by using hundreds of proven tips, tools, and techniques. Learn how to target more customers and optimize your Web site from a marketing perspective. You will learn to target your campaign, use keywords, generate free advertising, search engine strategies, the insider secrets of e-mail marketing, how to build Web communities, co-branding, auto-responders, Google advertising, banner advertising, eBay storefronts, Web design information, search engine registration, directories, and real-world examples of what strategies are succeeding and what strategies are failing.
Theory and Practice of Rate Division in Distributed Video Coding
Authors: Peng Wang, Jia Wang, Songyu Yu, Yuye Pang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Wyner and Ziv characterized the rate distortion function for lossy source coding with side information at the decoder. It is well known that for the quadratic Gaussian case, the Wyner-Ziv rate-distortion function coincides with the conditional rate-distortion function. In this paper, we extend the problem to the coding of multivariate Gaussian source with multiple Gaussian side information at the decoder. The achievable region is obtained, and it is easily extended to the case that the difference between the source and the side information is multivariate Gaussian, no matter what distributions the source and the side information are. We apply this theoretical model to Distributed Video Coding (DVC) by considering the difference of the Distributed frame (D frame) and the Side-information frame (S frame) to be multivariate Gaussian distributed. This introduces rate allocation problem into DVC, which can be solved by a reverse water-filling method. Simulation results show that around 1.5-2 dB coding gain benefits from the multivariate Gaussian Wyner-Ziv coding model.
Cost-effective ways of improving database computer performance
Authors: David K. Hsiao
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

In this paper the hardware features that characterize the performance bottlenecks of conventional database computers are identified. Motivations for and proposals of new architectures for overcoming the bottlenecks for future database computers are given.