ppxscal/embedding_network huggingface dataset:
Proceedings of the 9th international conference on Multimodal interfaces
Venue: International Conference on Multimodal Interfaces (2007)

It is our great pleasure to welcome you to the Ninth International Conference on Multimodal Inter-faces (ICMI 2007) held on 12-15 November in Nagoya, JAPAN. ICMI 2007 is sponsored by the Association for Computing Machinery (ACM). Multimodal interfaces represent an emerging interdisciplinary research direction, involving interactive system design, computer human interaction, spoken language understanding, gesture and emotion recognition, computer vision, pattern recognition, context processing, experimental psychology, etc. Research in multimodal interfaces aims at efficient, convenient and natural interaction between com-puters and human users. Multimodal interfaces will one day enable humans to interact with computers in various shapes such as robots, meeting rooms, mobile phones, and automobiles using everyday skills. Computers and their interfaces will be able to inhabit everywhere in a multimodal symbiosis with humans. The ICMI 2007 program consists of three days of technical sessions with oral paper presentations, poster presentations, demonstrations, doctoral spotlight posters, and three keynote speeches by Yuri Ivanov of Mitsubishi Electric Research Laboratory (MERL), Norihiro Hagita of Advanced Telecom-munications Research Institute International (ATR), and Dominic Massaro of University of California, Santa Cruz (UCSC). ICMI 2007 also hosts three workshops on Multimodal Interfaces in Semantic Interaction Tagging, Mining and Retrieval of Human Related Activity Information, and Massive Datasets on November 15. The CD proceedings include the oral and poster papers, the abstracts of keynote speeches and introductions to the workshops. All of the materials including workshop papers will be published through the ACM's Digital Library. There were 99 total submissions in the regular (long and short) paper category. The review process involved a double blind-review with a minimum of three reviewers, and a meta-review by the relevant area-chair. The program committee (PC) consisted of 14 area chairs who are leading researchers in different aspects of multimodal interfaces. The final paper selection was done at a meeting of the area chairs and program chairs at the MIT Media Laboratory. This process led to the selection of 18 papers for oral presentation, 36 papers for poster presentation. The demonstrations were selected by the Demo chair and the Doctoral Spotlights were selected by the Program Co-Chairs. As a result, 5 demonstrations and 2 doctoral student posters will be presented during the conference.
RunBasedReordering: A Novel Approach for Test Data Compression and Scan Power
Authors: Hao Fang, Chenguang Tong, Xu Cheng
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

As the large size of test data volume is becoming one of the major problems in testing System-on-a-Chip (SoC), several compression coding schemes have been proposed. Extended frequency-directed run-length (EFDR) is one of the best coding compression schemes. In this paper, we present a novel algorithm named RunBasedReordering(RBR), which is based on EFDR codes. Three techniques have been applied to this algorithm: scan chain reordering, scan polarity adjustment and test pattern reordering. The experiment results show that the test data compression ratio is significantly improved and scan power consumption is dramatically reduced. Moreover, our algorithm can be easily integrated into the existing industrial flow with little area penalty.
Fault Injection Techniques and their Accelerated Simulation in SystemC
Authors: Silvio Misera, Heinrich Theodor Vierhaus, Andre Sieber
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

SystemC has been widely accepted for the description of electronic systems. An essential advantage of a SystemC description is the possibility of a built-in compiled-code simulation. Beyond the functional simulation for validation of a hardware design, there are additional requirements for an advanced simulation of faults in order to analyze the system behavior under fault conditions. The paper introduces known and novel methods of SystemC-based simulations with fault injections and provides first results. Some strategies are shown to accelerate the SystemC simulation by parallel computing. Additionally, we present gate level and switch level models for an effective simulation in SystemC.
Netstub: a framework for verification of distributed java applications
Authors: Elliot Barlas, Tevfik Bultan
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Automated verification of distributed programs is a challenging problem. Since the behavior of a distributed program encompasses the behavior of the network, possible configurations of the network have to be investigated during verification. This leads to very large state spaces, and automated verification becomes infeasible. We present a framework that addresses this problem by decoupling the behavior of distributed programs from the behavior of the network. Our framework is based on a set of stub classes that replace native methods used in network communication and enables verification of distributed Java applications by isolating their behavior from the network. The framework supports two modes of verification: unit verification and integration verification. Integration verification checks multiple interacting distributed application components by running them in a single JVM and simulating the behavior of the network within the same JVM via stub classes. Unit verification targets a single component of a distributed application and requires that the user write an event generator class that utilizes the API exported by the framework. While unit verification only checks a single application component, it benefits from a greatly reduced state space compared do that of integration verification
The computational complexity of choice sets
Authors: Felix Brandt, Felix Fischer, Paul Harrenstein
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of these criteria can be formulated in terms of choice sets that single out reasonable alternatives based on the preferences of the voters. In this paper, we consider choice sets whose definition merely relies on the pairwise majority relation. These sets include the Copeland set, the Smith set, the Schwartz set, von Neumann-Morgenstern stable sets (a concept originally introduced in the context of cooperative game theory), the Banks set, and the Slater set. We investigate the relationships between these sets and completely characterize their computational complexity which allows us to obtain hardness results for entire classes of social choice rules. In contrast to most existing work, we do not impose any restrictions on individual preferences, apart from the indifference relation being reflexive and symmetric. This assumption is motivated by the fact that many realistic types of preferences in computational contexts such as incomplete or quasi-transitive preferences may lead to general pairwise majority relations that need not be complete.
Exploring weak scalability for FEM calculations on a GPU-enhanced cluster
Authors: Dominik Göddeke, Robert Strzodka, Jamaludin Mohd-Yusof, Patrick McCormick, Sven H. M. Buijssen, Matthias Grajewski, Stefan Turek
Venue: Parallel Computing (2007)

The first part of this paper surveys co-processor approaches for commodity based clusters in general, not only with respect to raw performance, but also in view of their system integration and power consumption. We then extend previous work on a small GPU cluster by exploring the heterogeneous hardware approach for a large-scale system with up to 160 nodes. Starting with a conventional commodity based cluster we leverage the high bandwidth of graphics processing units (GPUs) to increase the overall system bandwidth that is the decisive performance factor in this scenario. Thus, even the addition of low-end, out of date GPUs leads to improvements in both performance- and power-related metrics.
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms
Authors: Hipólito Hernández-Pérez, Juan-José Salazar-González
Venue: Networks (2007)

This article concerns the &ldquo;One-commodity Pickup-and-Delivery Traveling Salesman Problem&rdquo; (1-PDTSP), in which a single vehicle of fixed capacity must either pick up or deliver known amounts of a single commodity to a given list of customers. It is assumed that the product collected from the pickup customers can be supplied to the delivery customers, and that the initial load of the vehicle leaving the depot can be any quantity. The problem is to find a minimum-cost sequence of the customers in such a way that the vehicle's capacity is never exceeded. This article points out a close connection between the 1-PDTSP and the classical &ldquo;Capacitated Vehicle Routing Problem&rdquo; (CVRP), and it presents new inequalities for the 1-PDTSP adapted from recent inequalities for the CVRP. These inequalities have been implemented in a branch-and-cut framework to solve to optimality the 1-PDTSP that outperforms a previous algorithm (Hern&aacute;ndez-P&eacute;rez and Salazar-Gonz&aacute;lez, Discrete Appl Math 145 (2004), 126&ndash;139). Larger instances (with up to 100 customers) are now solved to optimality. The classical &ldquo;Traveling Salesman Problem with Pickups and Deliveries&rdquo; (TSPPD) is a particular case of the 1-PDTSP, and this observation gives an additional motivation for this article. The here-proposed algorithm for the 1-PDTSP was able to solve to optimality TSPPD instances with up to 260 customers. &copy; 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(4), 258&ndash;272 2007
Real users, real results: examining the limitations of learning styles within AEH
Authors: Elizabeth Brown, Tony Fisher, Tim Brailsford
Venue: ACM SIGWEB Newsletter (2007)

This paper examines the current state of AEH (adaptive educational hypermedia) research into explicit learning style modelling for user personalisation. It addresses the problem of non-na&iuml;ve test subjects, who are often in user trials, thus contributing to experimental bias. Instead, the authors suggest using "real people", i.e. users with a range of backgrounds and abilities, in order to gain a truer insight into evidence-based research. We report on a study carried out with "real" users: around 80 children at a UK primary school. The study investigated sequential and global learning styles as a personalisation mechanism in an AEH system. The user trial involved matching and mismatching users and learning environments to see if learning improved. The AEH system used by the children was DEUS, a new e-learning platform that is conceptually similar to WHURLE, an AEH that also used learning styles as its user model. No statistically significant differences were found between experimental groups, learning style preferences or learning environments. We discuss the significance of this, and then critically analyse the use of learning styles in relation to this study and also in the wider context.
Product Profile
Venue: Computer (1975)

Information on the products and services advertised in PRODUCT PROFILE may be obtained by writing the product listing's number (found following each listing) on the postage-paid reader service card in this issue. 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
A New Vectorial Signature for Quick Symbol Indexing, Filtering and Recognition
Authors: W. Zhang, W. Liu
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper, we propose a novel descriptor based on symbol signatures for symbol filtering and recognition. First of all, all symbols are assumed in vectorial forms. All the primitive-pair relationships in a symbol are recorded and employed to create the signature representing the sym- bol. Although the approach aims at discriminating the sym- bol rapidly, it still preserves high recognition accuracy. Ex- periments on the data sets in GREC2003 [6] show its invari- ance on rotation, scaling, and other affine transformations.
The complexity of two problems on arithmetic circuits
Authors: Pascal Koiran, Sylvain Perifel
Venue: Theoretical Computer Science (2007)

By using arithmetic circuits, encoding multivariate polynomials may be drastically more efficient than writing down the list of monomials. Via the study of two examples, we show however that such an encoding can be hard to handle with a Turing machine even if the degree of the polynomial is low. Namely we show that deciding whether the coefficient of a given monomial is zero is hard for P^#^P under strong nondeterministic Turing reductions. As a result, this problem does not belong to the polynomial hierarchy unless this hierarchy collapses. For polynomials over fields of characteristic k>0, this problem is Mod"kP-complete. This gives a coNP^M^o^d^"^k^P algorithm for deciding an upper bound on the degree of a polynomial given by a circuit in fields of characteristic k>0.
Problem Oriented Software Engineering: A design-theoretic framework for software engineering
Authors: Jon G. Hall, Lucia Rapanotti, Michael Jackson
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

A key challenge for software engineering is to learn how to reconcile the formal world of the machine and its software with the non-formal real world. In this paper, we discuss elements of Problem Oriented Software Engineering (POSE), an approach that brings both nonformal and formal aspects of software development together in a single theoretical framework for software engineering design. POSE presents development as the representation and step-wise transformation of software problems. It allows for the identification and clarification of system requirements, the understanding and structuring of the problem world, the structuring and specification of a hardware/software machine that can ensure satisfaction of the requirements in the problem world, and the construction of adequacy arguments, convincing both to developers and to customers, users and other interested parties, that the system will provide what is needed. Examples are used throughout the paper to illustrate how formal and non-formal descriptions are reconciled under POSE.
Hardware organization to achieve high-speed elliptic curve cryptography for mobile devices
Authors: Sining Liu, Brian King, Wei Wang
Venue: Mobile Networks and Applications (2007)

Elliptic curve cryptography (ECC) is recognized as a fast cryptography system and has many applications in security systems. In this paper, a novel sharing scheme is proposed to significantly reduce the number of field multiplications and the usage of lookup tables, providing high speed operations for both hard-ware and software realizations.
Hardware/Software Partitioned Implementation of Real-time Object-oriented Camera for Arbitrary-shaped MPEG-4 Contents
Authors: Jisu Kim, Hyuk-Jae Lee, Tae-Ho Lee, Myungje Cho
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

Recently developed MPEG-4 part 2 compression standard provides a novel capability to handle arbitrary video objects. To support this capability, an efficient object segmentation technique is required. This paper proposes a real-time algorithm for foreground object segmentation in video sequences. The proposed algorithm consists of two steps: the first step that segments a frame into several sub-regions using spatio-temporal watershed transform and the second one that extracts a foreground object segment from the sub-regions generated in the first step. For real-time processing, the algorithm is partitioned into hardware and software parts so that computationally expensive parts are off-loaded from a processor and executed by hardware accelerators. Simulation results show that the proposed implementation can handle QCIF-size video at 15 fps to extract an accurate foreground object
Measuring the effectiveness of programmingland
Authors: Curt Hill, Brian M. Slator, Vijayakumar Shanmugasundaram
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

ProgrammingLand, as a resource for Computer Science instruction, continues to evolve and improve. ProgrammingLand delivers content, monitors student activities, contains a variety of educational exercises and may make assignments. Certain facilities of Learning Management Systems (LMS) are now incorporated into the system. The existing and new features were used in an experiment with two sections of the same course. One of these used a standard textbook and LMS, while the other one used ProgrammingLand, without either a textbook or another LMS. The results of this experiment favor continued development of the system.
Implementation of Dynamic Bandwidth Re-allocation in Optical Interconnects using Microring Resonators
Authors: Chander Kochar, Avinash Kodi, Ahmed Louri
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

Dynamic bandwidth re-allocation (DBR) technique balances traffic by re-allocating bandwidth from under utilized links to over utilized links. This results in significant improvement in overall throughput and latency. In previous study, passive optical devices, namely arrayed waveguide gratings (AWGs) and couplers were used to implement DBR [2]. Although the performance was significantly improved, the design was cost prohibitive since it required n2 number of lasers per board (where n is the number of transmitters per board). In this paper we propose the implementation of DBR using silicon on insulator (SOI) based microring resonators. We call this technique row-column switch implementation. The proposed active implementation reduces the number of required lasers by a factor of n without any degradation in performance. Analytical and simulation studies were conducted to compare the passive implementation of DBR with the proposed active approach. This comparison included area, power consumption, throughput, power loss (dB), power-delay product and area-delay product. Results show that the proposed active switch provides throughput and latency similar to the passive implementation of DBR while dramatically improving cost by a factor of n. There is a slight increase in power consumption (0.4% for the worst case traffic) using the active switch implementation.
Fault-Tolerant Multiprocessor Link and Bus Network Architectures
Authors: D. K. Pradhan
Venue: IEEE Transactions on Computers (1985)

This paper presents a general class of regular networks which provide optimal (near-optimal) fault tolerance.
A Taxonomy of Clutter Reduction for Information Visualisation
Authors: Geoffrey Ellis, Alan Dix
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Information visualisation is about gaining insight into data through a visual representation. This data is often multivariate and increasingly, the datasets are very large. To help us explore all this data, numerous visualisation applications, both commercial and research prototypes, have been designed using a variety of techniques and algorithms. Whether they are dedicated to geo-spatial data or skewed hierarchical data, most of the visualisations need to adopt strategies for dealing with overcrowded displays, brought about by too much data to fit in too small a display space. This paper analyses a large number of these clutter reduction methods, classifying them both in terms of how they deal with clutter reduction and more importantly, in terms of the benefits and losses. The aim of the resulting taxonomy is to act as a guide to match techniques to problems where different criteria may have different importance, and more importantly as a means to critique and hence develop existing and new techniques.
Research Algorithm Based on Ant-Cooperation for Grid Service
Authors: Jibo Liu, Chunhua Hu, Peidong Zhu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

It is very important for Web service to be located as quickly as possible in grid environments. Based on the fact of the default of the existing service resource locating methods,the research algorithm based on Ant- Cooperation for Web service is presented in the paper. In this algorithm, the resource management model is constructed by the minimum connected dominating sets, which shows a good performance in decreasing location time.Theoretical analysis shows the minimum dominating sets proposed is connected each other. Ant cooperation is applied to resolve the service search problem in different connected dominating sets in the paper. The approach is evaluated by comprehensive experiments, and the results show that it is feasible and applicable. Compared with other service recourse research algorithms, it shows some characters such as high performance and validity. It is an effective service recourse search algorithm in grid environments.
MAC Performance and Improvement in Mobile Wireless Sensor Networks
Authors: Bing Liu, Ke Yu, Lin Zhang, Huimin Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Former Media Access Control (MAC) protocols for Wireless Sensor Networks (WSNs) are mainly for static networks. In the networks where mobile nodes exist, the performance will degrade greatly. In this paper the performance of MAC in mobile WSNs (mWSNs) is analyzed and improved algorithms are presented. Simulations validate the effects. A new MAC protocol also is presented for the scenario with more mobile nodes.
Steiner Surface Patches
Authors: T. Sederberg, D. Anderson
Venue: IEEE Computer Graphics and Applications (1985)

Gain valuable insight into better geometric approaches to high- degree surface patches by studying the simple free-form Steiner patch.
Searching for diverse, cooperative populations with genetic algorithms
Authors: Robert E. Smith, Stephanie Forrest, Alan S. Perelson
Venue: Evolutionary Computation (1993)

In typical applications, genetic algorithms (GAs) process populations of potential problem solutions to evolve a single population member that specifies an 'optimized' solution. The majority of GA analysis has focused on these optimization applications. In other applications (notably learning classifier systems and certain connectionist learning systems), a GA searches for a population of cooperative structures that jointly perform a computational task. This paper presents an analysis of this type of GA problem. The analysis considers a simplified genetics-based machine learning system: a model of an immune system. In this model, a GA must discover a set of pattern-matching antibodies that effectively match a set of antigen patterns. Analysis shows how a GA can automatically evolve and sustain a diverse, cooperative population. The cooperation emerges as a natural part of the antigen-antibody matching procedure. This emergent effect is shown to be similar to fitness sharing, an explicit technique for multimodal GA optimization. Further analysis shows how the GA population can adapt to express various degrees of generalization. The results show how GAs can automatically and simultaneously discover effective groups of cooperative computational structures.