ppxscal/embedding_network huggingface dataset:
Cross-Cultural Study of Avatar Expression Interpretations
Authors: Tomoko Koda, Toru Ishida
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Avatars are increasingly used to express our emotions in our online communications. Such avatars are based on the assumption that avatar expressions are interpreted universally among all cultures. This study aims to elucidate the following two issues: 1) Identifying cultural differences in interpreting avatars' facial expressions. This is done by applying psychological findings on cultural differences in human facial expression recognition to the case of avatar expressions. 2) Identifying avatar facial expressions that are recognized differently across cultures. We conducted an open web experiment to gather users' interpretations of various avatar facial expressions from eight countries within Asia, North and South America, and Europe. The results showed: 1) Cultural differences do exist in interpreting avatar facial expressions, which confirms the psychological findings that physical proximity affects recognition accuracy. Japan had the highest recognition accuracy for avatar expressions designed by Japanese designers, followed by Korea. 2) There are wide differences among cultures in interpreting positive expressions, while negative expressions had higher recognition accuracy regardless of culture.
Service-Oriented Knowledge Management on Virtual Organizations
Authors: He Huang, Yong Cheng, Lirong Qiu, Zhongzhi Shi
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

WWW is a repository of information mainly oriented to human consumption. The lack of explicit and formal expression of data semantics makes the Web increasingly difficult to use and exploit. To remedy it, Knowledge Management Sphere (KMSphere), taking advantages of Semantic Web, Web Services and Virtual Organizations, is proposed to explore important aspects of service-oriented and ontology-driven knowledge management on the grid. By building two kinds of mappings, ontologies construct a knowledge space on top of data repositories. KMSphere, based on OGSA, emphasizes how to organize, discover, utilize, and manage the knowledge resources in that space. This paper describes in detail the architecture of KMSphere.
Complexities in IS sourcing: equifinality and relationship management
Authors: Barbara L. Marcolin, Alain Ross
Venue: ACM SIGMIS Database (2005)

Growth in IS outsourcing spurred research in the area that spans many perspectives but contains contradictory findings. Inconsistent findings raise confusion and doubt, leaving managers uncertain about IS sourcing directions and researchers unclear about theoretical perspectives relevant to IS sourcing.We argue that the concept of equifinality accounts for much of this confusion. Equifinality suggests that, in the struggle to match conflicting functional demands with structural options, many equally viable alternatives may exist. For IS sourcing, this means that different sourcing choices can be leveraged producing similar IS capabilities. Thus, embracing equifinality requires that we understand more fully the complexities in the IS function and in the range of sourcing options available. We argue, as well, that the existence of multiple paths raises the importance of implementation and execution issues.Illustrating the complexities of the IS function, we outline several IS function elements, including IT resources, IS activities and IS strategy. An IS-Business Partnering framework is then presented demonstrating the multiplicity of partnering options, situating sourcing as one aspect. We conclude with several company illustrations showing these multiplicities for successful company outcomes.For IS sourcing researchers, equifinality holds important implications. No longer can we afford to view the IS function as a homogeneous entity nor can we limit our scope to a narrow range of sourcing and partnering options. More than one path exists to achieve a particular outcome. Hence, the pursuit in IS sourcing research can no longer be for one good answer but for a few good answers.
Tracking time-varying parameters in software systems with extended Kalman filters
Authors: Tao Zheng, Jinmei Yang, Murray Woodside, Marin Litoiu, Gabriel Iszlai
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

Autonomic control of a service system can take advantage of a performance model only if a way can be found to track the changes in the system. A Kalman Filter provides a framework for integrating various kinds of measured data, and for tracking changes in any time-varying system. This work evaluates the effectiveness of such a filter in tracking changes in performance parameters of a software system that occur at different rates and amplitudes. The time-varying system is a Web application deployed in a data centre with layered queuing resources, in which parameter variations happen at random instants. The tracking filter is based on a layered queuing model of this system, with parameters representing CPU demands and the user load intensity. Experiments were performed to evaluate the effectiveness of the filter in tracking the changes, and the requirements for the filter settings for fast and slow variations in the parameters. The target application is autonomic control of a service centre.
Review of "Statistical Quality Control Methods, by Irving W. Burr", Marcel Dekker, Inc., 1976
Venue: ACM SIGSIM Simulation Digest (1976)

Although most of us are not directly involved with quality control in computer systems, it is highly recommended that those who are rusty take the time to read this clear and concise volume. The emphasis is on data analysis and decision making. 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
007 - Acting and drawing for animation
Authors: Lucilla Potter Hoshor John W. Finnegan
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

This course provides an introduction to acting and drawing techniques used to develop stronger character animation. Physical warm ups, trust and improvisation will be introduced. Participants will physically participate in theater games and drawing methods. The exercises will inspire an instinctive understanding of staging principles, thumbnail drawing, animal personification, mime, emotional recall and audience awareness. Participants will view demonstrations of acting and drawing by lecturers. Each participant will be provided with theater props, animation paper and pencils for exercises. Animation, from Siggraph's Animation and Electronic Theater, will spotlight excellent acting in animation examples during the course.
Hardware Design of On-Line Jawi Character Recognition Chip using Discrete Wavelet Transform
Authors: R Zaidi, S Rosli., Y Mashkuri
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we will discuss further on our previous works [1] on developing a recognition chip of Jawi characters using Chain Code Algorithm and problems occurred. An explanation of Jawi characters have been made in [1]. We will also discuss our second approach i.e using discrete wavelet transform (DWT) to extract coefficients from the characters based on their features and using these coefficients to develop a unique code. This unique code will be used to recognize it. Hardware model entities integration is presented in the last section. Paper orientation will be like this. First we will discuss on why we choose DWT & way of implement it and followed by the problems we faced in using chain code algorithm. The full implementation of the design will be explained in the last section, followed by a conclusion .
Annotating Real World objects using a Steerable Projector-Camera Unit
Authors: Andreas Butz, Christian Schmitz
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

We describe the annotation of real world objects with labels similar to the "tool tips" known from desktop interfaces using a steerable projector-camera unit. Labels containing text or graphics are projected onto objects or next to objects on suitable surfaces and are placed automatically according to a set of weighted criteria ensuring an unambiguous mapping between labels and labeled objects as well as consistency among the set of labels. The method has been implemented in our instrumented environment to form the basis for making this environment to some extent selfexplaining.
Image management using pattern recognition systems
Authors: Bongwon Suh
Venue:  (2005)

With the popular usage of personal image devices and the continued increase of computing power, casual users need to handle a large number of images on computers. Image management is challenging because in addition to searching and browsing textual metadata, we also need to address two additional challenges. First, thumbnails, which are representative forms of original images, require significant screen space to be represented meaningfully. Second, while image metadata is crucial for managing images, creating metadata for images is expensive. My research on these issues is composed of three components which address these problems. First, I explore a new way of browsing a large number of images. I redesign and implement a zoomable image browser, PhotoMesa, which is capable of showing thousands of images clustered by metadata. Combined with its simple navigation strategy, the zoomable image environment allows users to scale up the size of an image collection they can comfortably browse. Second, I examine tradeoffs of displaying thumbnails in limited screen space. While bigger thumbnails use mare screen space, smaller thumbnails are hard to recognize. I introduce an automatic thumbnail cropping algorithm based on a computer vision saliency model. The cropped thumbnails keep the core informative part and remove the less informative periphery. My user study shows that users performed visual searches mare than 18% faster with cropped thumbnails. Finally, I explore semi-automatic annotation techniques to help users make accurate annotations with low effort. Automatic metadata extraction is typically fast but inaccurate while manual annotation is slow but accurate. I investigate techniques to combine these two approaches. My semi-automatic annotation prototype, SAPHARI, generates image clusters which facilitate efficient bulk annotation. For automatic clustering, I present hierarchical event clustering and clothing based human recognition. Experimental results demonstrate the effectiveness of the semi-automatic annotation when applied on personal photo collections. Users were able to make annotation 49% and 6% faster with the semi-automatic annotation interface on event and face tasks, respectively.
GPU-assisted decoding of video samples represented in the YCoCg-R color space
Authors: Wesley De Neve, Dieter Van Rijsselbergen, Charles Hollemeersch, Jan De Cock, Stijn Notebaert, Rik Van de Walle
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Although pixel shaders were designed for the creation of programmable rendering effects, they can also be used as generic processing units for vector data. In this paper, attention is paid to an implementation of the YCoCg-R to RGB color space transform, as defined in the H.264/AVC Fidelity Range Extensions, by making use of pixel shaders. Our results show that a significant speedup can be achieved by relying on the processing power of the GPU, relative to the CPU. To be more specific, high definition video (1080p), represented in the YCoCg-R color space, could be decoded to RGB at 30 Hz on a PC with an AMD Athlon XP 2800+ CPU, an AGP bus and an NVIDIA GeForce 6800 graphics card, an effort that could not be realized in real-time by the CPU.
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
Authors: Andrew Ireland, Jamie Stark
Venue: Automated Software Engineering (2006)

The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate these methods and heuristics as a basis for mechanizing program synthesis. Our approach combines proof planning with conventional partial order planning. Proof planning is an automated theorem proving technique which uses high-level proof plans to guide the search for proofs. Proof plans are structured in terms of proof methods, which encapsulate heuristics for guiding proof search. We demonstrate that proof planning provides a local perspective on the synthesis task. In particular, we show that proof methods can be extended to represent heuristics for guiding program construction. Partial order planning complements proof planning by providing a global perspective on the synthesis task. This means that it allows us to reason about the order in which program fragments are composed. Our hybrid approach has been implemented in a semi-automatic system called Bertha. Bertha supports partial correctness and has been tested on a wide range of non-trivial programming examples.
A chip prototyping substrate: the flexible architecture for simulation and testing (FAST)
Authors: John D. Davis, Stephen E. Richardson, Charis Charitsis, Kunle Olukotun
Venue: ACM SIGARCH Computer Architecture News (2005)

We describe a hybrid hardware emulation environment: the Flexible Architecture for Simulation and Testing (FAST). FAST integrates field-programmable gate arrays (FPGAs), microprocessors, and memory to enable rapid prototyping of chip multiprocessors, multithreaded architectures, or other novel computer architectures and chip-level memory systems. FAST combines configurable and fixed-function hardware and software to facilitate rapid prototyping by utilizing components optimized for their particular tasks: FPGAs for interconnect and glue logic; processors for rapid program execution; and SRAMs for fast memory. Unlike software simulators, FAST can simulate complex designs at multi-megahertz speeds regardless of the simulation detail. We illustrate FAST's utility by describing mappings of both a small-scale CMP with speculation support and a large-scale CMP connected using a network. We then show performance results from a very simple, decoupled 4-way CMP executing small test programs.
eMailSift: Email Classification Based on Structure and Content
Authors: Manu Aery, Sharma Chakravarthy
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper we propose a novel approach that uses structure as well as the content of emails in a folder for email classification. Our approach is based on the premise that representative — common and recurring — structures/patterns can be extracted from a pre-classified email folder and the same can be used effectively for classifying incoming emails. A number of factors that influence representative structure extraction and the classification are analyzed conceptually and validated experimentally. In our approach, the notion of inexact graph match is leveraged for deriving structures that provide coverage for characterizing folder contents. Extensive experimentation validate the selection of parameters and the effectiveness of our approach for email classification.
Geometric Restrictions on Producible Polygonal Protein Chains
Authors: Erik D. Demaine, Stefan Langerman, Joseph O&#x2019;Rourke
Venue: Algorithmica (2006)

Fixed-angle polygonal chains in three dimensions serve as an interesting model of protein backbones. Here we consider such chains produced inside a "machine" modeled crudely as a cone, and examine the constraints this model places on the producible chains. We call this notion producible, and prove as our main result that a chain whose maximum turn angle is &#x03b1; is producible in a cone of half-angle &#x2265; &#x03b1; if and only if the chain is flattenable, that is, the chain can be reconfigured without self-intersection to lie flat in a plane. This result establishes that two seemingly disparate classes of chains are in fact identical. Along the way, we discover that all producible configurations of a chain can be moved to a canonical configuration resembling a helix. One consequence is an algorithm that reconfigures between any two flat states of a "nonacute chain" in O(n) "moves," improving the O(n2)-move algorithm in [ADD+]. Finally, we prove that the producible chains are rare in the following technical sense. A random chain of n links is defined by drawing the lengths and angles from any "regular" (e.g., uniform) distribution on any subset of the possible values. A random configuration of a chain embeds into &#x211d;3 by in addition drawing the dihedral angles from any regular distribution. If a class of chains has a locked configuration (and no nontrivial class is known to avoid locked configurations), then the probability that a random configuration of a random chain is producible approaches zero geometrically as n &#x2192; &#x221e;.
POLAR: portable, optical see-through, low-cost augmented reality
Authors: Alex Olwal, Tobias Höllerer
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

We describe POLAR, a portable, optical see-through, low-cost augmented reality system, which allows a user to see annotated views of small to medium-sized physical objects in an unencumbered way. No display or tracking equipment needs to be worn. We describe the system design, including a hybrid IR/vision head-tracking solution, and present examples of simple augmented scenes. POLAR's compactness could allow it to be used as a lightweight and portable PC peripheral for providing mobile users with on-demand AR access in field work.
Wearable Technology for Crime Scene Investigation
Authors: Chris Baber, Paul Smith, James Cross, Damien Zasikowsk, John Hunter
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

In this paper we report the concept and initial prototype of a device that can be used to support evidence recovery at a crime scene. The key elements are radio frequency identification (RFID) tags that are fitted to evidence bags, which provide an association between the bag's content and an evidence log. The log contains such details as a description of the objects (provided through speech), images of the scene or the objects (captured through digital cameras), the time of recovery, the location of recovery (captured through either global positioning system or through ultrasonic positioning equipment) and the ID of the person who recovered the object. Subsequent analysis can also be linked to the RFID tag.
Quality Analysis of NL Requirements: An Industrial Case Study
Authors: A. Bucchiarone, S. Gnesi, P. Pierini
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Nowadays common practice indicates that the Requirement Engineering (RE) process critically influences the success of the system development life cycle. Several commercial tools allow to classify, archive and manage requirements and then to print out reports and requirement documents. QuARS (Quality Analyzer for Requirements Specifi- cations) is an automatic analyzer of such requirement documents, developed by ISTI - CNR, that can be adopted to evaluate the document quality by linguistic point of view. In this paper is presented how a requirement management tool, an automatic document generator and QuARS can be integrated to define an RE automation support. The case study investigates and highlights the efficacy and the role of such proposed support in the Siemens C.N.X. development process.
Recycling data for multi-agent learning
Authors: Santiago Ontañón, Enric Plaza
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Learning agents can improve performance cooperating with other agents, particularly learning agents forming a committee outperform individual agents. This "ensemble effect" is well known for multi-classifier systems in Machine Learning. However, multi-classifier systems assume all data is known to all classifiers while we focus on agents that learn from cases (examples) that are owned and stored individually. In this article we focus on how individual agents can engage in bargaining activities that improve the performance of both individual agents and the committee. The agents are capable of self-evaluation and determining that some data used for learning is unnecessary. This "refuse" data can then be exploited by other agents that might found some part of it profitable to improve their performance. The experiments we performed show that this approach improves both individual and committee performance and we analyze how these results in terms of the "ensemble effect".
Robust analog/RF circuit design with projection-based posynomial modeling
Authors: Xin Li, P. Gopalakrishnan, Yang Xu, T. Pileggi
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

We propose a robust analog design tool (ROAD) for post-tuning analog/RF circuits. Starting from an initial design derived from hand analysis or analog circuit synthesis based on simplified models, ROAD extracts accurate posynomial performance models via transistor-level simulation and optimizes the circuit by geometric programming. Importantly, ROAD sets up all design constraints to include large-scale process variations to facilitate the tradeoff between yield and performance. A novel convex formulation of the robust design problem is utilized to improve the optimization efficiency and to produce a solution that is superior to other local tuning methods. In addition, a novel projection-based approach for posynomial fitting is used to facilitate scaling to large problem sizes. A new implicit power iteration algorithm is proposed to find the optimal projection space and extract the posynomial coefficients with robust convergence. The efficacy of ROAD is demonstrated on several circuit examples.
ReSlice: Selective Re-Execution of Long-Retired Misspeculated Instructions Using Forward Slicing
Authors: Smruti R. Sarangi, Wei Liu,  Josep Torrellas, Yuanyuan Zhou
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

As more data value speculation mechanisms are being proposed to speed-up processors, there is growing pressure on the critical processor structures that must buffer the state of the speculative instructions. A scalable solution is to checkpoint the processor and retire speculative instructions. However, in this environment, misprediction recovery becomes very wasteful, as it involves discarding and re-executing all the instructions executed since the checkpoint. To speed-up execution in this environment, this paper presents a novel architecture (ReSlice) that selectively re-executes only the speculatively-retired instructions that directly depended on the mispredicted value, namely its Forward Slice. ReSlice buffers the (typically very few) instructions in the forward slice of the predicted value as such instructions initially execute. Then, potentially thousands of instructions later, ReSlice can quickly re-execute the slice if a misprediction is declared, and merge its state with the program state. In addition, this paper develops a sufficient condition for correct slice re-execution and merge. As one possible use of ReSlice, we apply it to recover from cross-task dependence violations in a chip multiprocessor with Thread-Level Speculation (TLS). ReSlice speeds up SpecInt applications over aggressive TLS by up to 33%, with a geometric mean of 12%. Moreover, E × D2 decreases by 20%. All this is obtained by saving on average 61% of the task squashes through slice re-execution. On average, a slice re-executes only 6.6 instructions, compared to the 210 that would be re-executed on a squash.