ppxscal/embedding_network huggingface dataset:
Agent Models for Dynamic 3D Virtual Worlds
Authors: Mary-Lou Maher, Kathryn Merrick
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Agents are systems capable of perceiving their environment through sensors, reasoning about their sensory input using some characteristic reasoning process and acting in their environment using effectors. When one or more agents control the objects that comprise a 3D virtual world, the result is a dynamic, adaptive environment that changes in response to users' actions. We have experimented with three different agent models for this purpose: a swarm model, a cognitive model and a motivated agent model. Each of these models differs in the complexity of its implementation and can thus be used to produce dynamic virtual environments of differing behavioural complexity. This paper introduces a schema for characterising the implementation and behavioural complexity of agent models for dynamic virtual environments. We apply this schema to the agent models we have studied to reveal their advantages and disadvantages and identify directions for future work.
Photo Defect Detection for Image Inpainting
Authors: Rong-Chi Chang, Yun-Long Sie, Su-Mei Chou, Timothy K. Shih
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Image inpainting (or image completion) techniques use textural or structural information to repair or fill damaged potions of a picture. However, most techniques request a human to identify the portion to be inpainted. We developed a new mechanism which can automatically detect defect portions in a photo, including damages by color ink spray and scratch drawing. The mechanism is based on several filters and structural information of damages. Old photos from the author's family are used for testing. Preliminary results show that most damages can be automatically detected without human involvement. The mechanism is integrated with our inpainting algorithms to complete a fully automatic photo defects repairing system.
Detection and Evaluation of Grasping Positions for Autonomous Agents
Authors: Fumihito Kyota, Tomoyuki Watabe, Suguru Saito, Masayuki Nakajima
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

The action of grasping an object is very important for a humanoid agent with hand, evolving autonomously in a virtual world. If an agent is given the order "Grasp the object", he has to determine the portion of the object to grasp. In order to determine a grasping position, it is necessary to recognize the form of the 3-dimensional geometry, and detect portions which are suitable for grasp. Assuming that the object is grasped by one hand, we propose two techniques for detecting appropriate portions to be grasped on the surface of an object and for generating the grasping postures. In this paper, our main contributions are as follows: The first is the detection of appropriate portions to be grasped on the surface of an object; The second is the formation of the hand shape to grasp various shaped objects. Using the two proposing methods, grasped positions and the hand shapes for each of them are computed. Moreover, these positions are evaluated by their stabilities using the robotics technique.
Maturation Stage of eCommerce in Developing Countries: A Survey of South African Companies
Authors: Alemayehu Molla,  Ph. D., Paul S. Licker
Venue: Information Technologies and International Development (2004)

There is a paucity of empirical data on the level of diffusion of eCommerce technologies and business activities enabled by these technologies in businesses in developing countries. This study investigates the implementation and plans of a range of e-enabling hard and soft technologies: electronically performed business functions and the overall maturity of eCommerce usage. The authors surveyed 150 South African businesses. The findings reveal the dominance of communication aspects, but not the transaction aspects, of eCommerce. The implementation of integrated eCommerce solutions and security-enabling applications is very limited. Implementation plans of eCommerce revolve around extending communication technologies and enabling upward movement along the value chain, particularly marketing and procurement activities. By establishing benchmarks, the study contributes to our understanding of developments of eCommerce in developing countries.
Stochastic optimization: algorithms and convergence results
Authors: Xiaoping Xiong
Venue:  (2005)

Stochastic approximation is one of the oldest approaches for solving stochastic optimization problems. In the first part of the dissertation, we study the convergence and asymptotic normality of a generalized form of stochastic approximation algorithm with deterministic perturbation sequences. Both one-simulation and two-simulation methods are considered. Assuming a special structure on the deterministic sequence, we establish sufficient conditions on the noise sequence for a.s. convergence of the algorithm and asymptotic normality. Finally we propose ideas for further research in analysis and design of the deterministic perturbation sequences. In the second part of the dissertation, we consider the application of stochastic optimization problems to American option pricing, a challenging task, particularly for high-dimensional underlying securities. For options where there are a finite number of exercise dates, we present a weighted stochastic mesh method that only requires some easy-to-verify assumptions and a method to simulate the behavior of underlying securities. The algorithm provides point estimates and confidence intervals for both price and value-at-risk. The estimators converge to the true values as the computational effort increases. In the third part, we deal with an optimization problem in the field of ranking and selection. We generalize the discussion in the literature to a non-Gaussian correlated distribution setting. We propose a procedure to locate an approximate solution, which can be shown to converge to the true solution asymptotically. The convergence rate is also provided for the Gaussian setting.
A Framework for Component Mining of Java Applications via Dynamic Slicing
Authors: Adam J. Conover, Yeong-Tae Song
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Abstract: This paper explores the use of program slicing as a tool for "component mining" of Java" source code. We define component mining to be the extraction of an executable slice from source code, which satisfies a specific use case (or set of use cases) and provides a standard component interface for its use. However, before a component can be generated, the desired features themselves must be isolated from the source code. Traditionally, software slicing has concerned itself with the value of a variable of interest (or set of variables) at a specific point of execution. This severely limits the usefulness of the traditional definition of a slicing criterion as a tool for feature isolation. We propose the repurposing of software "unit-tests" to aid in the isolation of features of interest within source code. By executing a target application in our JPDA (Java Platform Debugging Architecture) based slicer, a selected unit-test may then serve as the slicing criterion.
Educating the DP technical writer
Authors: Daniel Brantley
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1981)

A skilled DP specialist with equally developed writing ability is not found around just any corner. Yet the need to communicate effectively will not go away.
A review of adaptive population sizing schemes in genetic algorithms
Authors: Fernando G. Lobo, Cláudio F. Lima
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This paper reviews the topic of population sizing in genetic algorithms. It starts by revisiting theoretical models which rely on a facetwise decomposition of genetic algorithms, and then moves on to various self-adjusting population sizing schemes that have been proposed in the literature. The paper ends with recommendations for those who design and compare adaptive population sizing schemes for genetic algorithms.
An Approach towards Benchmarking of Table Structure Recognition Results
Authors: Thomas Kieninger, Andreas Dengel
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

After we developped a model free table recognition system we had the desire to automatically register the effect of minor changes to parameters upon the overall performance quality of our system in order to tune parameters. Therefore we developed a complete benchmarking environment, containing a user frontend to acquire ground truth data as well as mechanisms to evaluate the quality of the recognition results. The tasks involved in the analysis systems were the locating of table regions, identification of cells and mapping of cells to rows and columns. This paper presents our approach towards the comparison of recognition results with the ground truth. The established definitions of recall and precision did not meet our requirements, as we wanted to register even smallest improvements (or changes in general) in the results, even when both results were imperfect. We therefore extended the measures recall and precision in order to deal with recognition probabilities of objects rather than just with boolean values.
Optimization-based simulation of nonsmooth rigid multibody dynamics
Authors: Mihai Anitescu
Venue: Mathematical Programming: Series A and B (2006)

We present a time-stepping method to simulate rigid multibody dynamics with inelastic collision, contact, and friction. The method progresses with fixed time step without backtracking for collision and solves at every step a strictly convex quadratic program. We prove that a solution sequence of the method converges to the solution of a measure differential inclusion. We present numerical results for a few examples, and we illustrate the difference between the results from our scheme and previous, linear-complementarity-based time-stepping schemes.
Sharp interface Cartesian grid method I: An easily implemented technique for 3D moving boundary computations
Authors: S. Marella, S. Krishnan, H. Liu, H. S. Udaykumar
Venue: Journal of Computational Physics (2005)

A Cartesian grid method is developed for the simulation of incompressible flows around stationary and moving three-dimensional immersed boundaries. The embedded boundaries are represented using level-sets and treated in a sharp manner without the use of source terms to represent boundary effects. The narrow-band distance function field in the level-set boundary representation facilitates implementation of the finite-difference flow solver. The resulting algorithm is implemented in a straightforward manner in three-dimensions and retains global second-order accuracy. The accuracy of the finite-difference scheme is established and shown to be comparable to finite-volume schemes that are considerably more difficult to implement. Moving boundaries are handled naturally. The pressure solver is accelerated using an algebraic multigrid technique adapted to be effective in the presence of moving embedded boundaries. Benchmarking of the method is performed against available numerical as well as experimental results.
Towards Quantitative Measures of Image Morphing Quality
Authors: TzuYen Wong, Peter Kovesi, Amitava Datta
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Image morphing has been successfully used to synthesize realistic transitional effects in the computer graphics field for more than 15 years. It has a wide range of applications from the entertainment industry to human machine interfaces. However, little work has been done to quantify the quality of the morphed transition. Consequently, there are no quantitative measures that allow one to compare among different morphing approaches. Our work aims to quantitatively address this particular question — "Is this a good morph?". This paper presents an overview of our ideas and describes an error measure based on epipolar geometry for morphing between images of different viewpoints.
Libraries and machine-readable data
Authors: Judith Rowe
Venue: ACM SIGSOC Bulletin (1974)

Wednesday evening, July 10th, 8:30-10:30 is the time scheduled for a panel discussion: "Government Publications in Machine-Readable Form: A New Tool for the Reference Librarian." A part of the American Library Association's 1974 New York Conference, the meeting is co-sponsored by the Government Documents Round Table's (GODORT) Machine-Readable Data Files Committee, the Federal Librarians Round Table (FLIRT), the RASD Information Retrieval Committee and the RASD/RTSD/ASLA Public Documents Committee. 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
The Role of Deferred Requirements in a Longitudinal Study of Emailing
Authors: Stephen Fickas, William Robinson, McKay Sohlberg
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Our group has taken a clinical approach to doing requirements engineering for a specific domain: delivering email tools to the cognitively impaired population. The clinical view suggests a process that first gathers an individual's goals, assesses the individual's abilities, delivers a tailored system, and finally, monitors usage over time to look for adaptation needs. One concept that has arisen from our project is the notion of a deferred requirement (or deferred goal). Professional clinicians ask an individual to think broadly of the goals they have, and think about not only goals that are achievable today, but ones that might be striven for and become achieved in the future. We discuss this idea of deferred requirements in terms of a longitudinal study working with nine participants over a two-year period. We also report on initial attempts to build automated tools around deferred requirements, monitoring, and system adaptation.
Real Time Change Detection and Alerts from Highway Traffic Data
Authors: Robert Grossman, Michal Sabala, Anushka Aanand, Steve Eick, Leland Wilkinson, Pei Zhang, John Chaves, Steve Vejcik, John Dillenburg, Peter Nelson, Doug Rorem, Javid Alimohideen, Jason Leigh, Mike Papka, Rick Stevens
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We developed a testbed containing: real time data from over 830 highway traffic sensors in the Chicago region, data about weather, and text data about events that might affect traffic. The goal was to detect in real time interesting changes in traffic conditions. Given the size and complexity of the data, we choose to build a large number of separate baseline models. We built a separate baseline for each hour in the day, for each day in the week, and for every 2 or 3 traffic sensors, resulting in over 42,000 separate baseline models. We also built a baseline engine to build the necessary baselines automatically. We modified an open source scoring engine to process in real time each new sensor reading, update the appropriate feature vectors, score the updated feature vectors using the baseline models, and send out real time alerts when deviations from the baselines were detected.
Verifying the correctness of hume programs: an approach combining deductive and algorithmic reasoning
Authors: Gudmund Grov
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Hume is a programming language targeted at safety-critical, resource-bounded systems. Bounded time and space usage is achieved by a clear separation of coordination and computation in the design of the language. However, there is no correctness verification. Such verification is imperative in safety-critical environments. It is our contention that the language design makes a combination of deductive and algorithmic reasoning tractable.
Generating Scalable Polynomial Models: Key to Low Power High Performance Designs
Authors: G. Girishankar, Shitanshu Tiwari
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

As the need for power reduction techniques based on on-chip dynamic voltage scaling is on the rise, a design flow that can take full advantage of the performance/power tradeoffs is required. In this paper, we present a Scalable Polynomial Model (SPM) based approach to precisely estimate the power and performance achievable through voltage scaling techniques. The main challenge here is generating accurate Scalable Polynomial Models for Timing and Power and coming up with the right usage methodology. Novel techniques have been employed to generate piecewise polynomials for any given set of data without loss of accuracy. A new approach for incrementing the polynomial orders for reduction in run time is presented along with results. SPM libraries were generated for an entire library and validated at the cell level and design level. A complete usage model for designs using dynamic voltage scaling is also presented.
Address-Indexed Memory Disambiguation and Store-to-Load Forwarding
Authors: Sam S. Stone, Kevin M. Woley, Matthew I. Frank
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

This paper describes a scalable, low-complexity alternative to the conventional load/store queue (LSQ) for superscalar processors that execute load and store instructions speculatively and out-of-order prior to resolving their dependences. Whereas the LSQ requires associative and age-prioritized searches for each access, we propose that an address-indexed store-forwarding cache (SFC) perform store-to-load forwarding and that an address-indexed memory disambiguation table (MDT) perform memory disambiguation. Neither structure includes a CAM. The SFC behaves as a small cache, accessed speculatively and out-oforder by both loads and stores. Because the SFC does not rename in-flight stores to the same address, violations of memory anti and output dependences can cause in-flight loads to obtain incorrect values from the SFC. Therefore, the MDT uses sequence numbers to detect and recover from true, anti, and output memory dependence violations. We observe empirically that loads and stores that violate anti and output memory dependences are rarely on a program¿s critical path and that the additional cost of enforcing predicted anti and output dependences among these loads and stores is minimal. In conjunction with a scheduler that enforces predicted anti and output dependences, the MDT and SFC yield performance equivalent to that of a large LSQ that has similar or greater circuit complexity. The SFC and MDT are scalable structures that yield high performance and lower dynamic power consumption than the LSQ, and they are well-suited for checkpointed processors with large instruction windows.
Multimodal metadata fusion using causal strength
Authors: Yi Wu, Edward Y. Chang, Belle L. Tseng
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We propose a probabilistic framework that uses influence diagrams to fuse metadata of multiple modalities for photo annotation. We fuse contextual information (location, time, and camera parameters), visual content (holistic and local perceptual features), and semantic ontology in a synergistic way. We use causal strengths to encode causalities between variables, and between variables and semantic labels. Through analytical and empirical studies, we demonstrate that our fusion approach can achieve high-quality photo annotation and good interpretability, substantially better than traditional methods.
Using a Free-Parts Representation for Visual Speech Recognition
Authors: Patrick Lucey, Simon Lucey, Sridha Sridharan
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Motivated by the success of free-parts based representations in face recognition, we have attempted to address some of the problems associated with applying such a philosophy to the task of speaker-independent visual speech recognition. A major problem with canonical area-based approaches in automatic visual speech recognition is the dependence these approaches have on locating and tracking the speaker's region of interest (ROI) correctly. By employing a free-parts representation,we assume that the position/structure of patches within the mouth image can be relaxed so they can "freely" move to varying extents, hence reducing the influence of the front-end effect. In this paper, we show that by using a free-parts representation we gain some robustness against the problem of ROI localisation and tracking compared to current area-based feature extraction techniques such as the discrete cosine transform (DCT). Also in this paper, we expose the importance of representation for the task of visual speech recognition highlighted by the poor results current representations yield.
ShanghaiGrid: an Information Service Grid: Research Articles
Authors: Minglu Li, Min-You Wu, Ying Li, Jian Cao, Linpeng Huang, Qianni Deng, Xinhua Lin, Changjun Jiang, Weiqin Tong, Yadong Gui, Aoying Zhou, Xinhong Wu, Shui Jiang
Venue: Concurrency and Computation: Practice Experience (2006)

The goal of the ShanghaiGrid is to provide information services to the people. It aims to construct a metropolitan-area information service infrastructure and establish an open standard for widespread upper-layer applications from both communities and the government. The Information Service Grid Toolkit and a typical application called the Traffic Information Grid are discussed in detail. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A Comprehensive Solution for True Hierarchical Timing and Crosstalk Delay Signoff
Authors: K. A. Rajagopal, R. Sivakumar, N. V. Arvind, C. Sreeram, Vish Visvanathan, Shailendra Dhuri, Roopesh Chander, Patrick Fortner, Subra Sripada, Qiuyang Wu
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Leading edge technology advancements have posed big challenges for the digital design flow. Designing multi-million gate ICs at aggressive cycletimes requires new design methodologies and innovative approaches. Hierarchical analysis is a key need to achieve these cycletime goals and gain capacity and runtime advantages in the design flow. Timing and crosstalk delay closure are iterative and hierarchical analysis gains significant cycletime in the overall closure process. In this paper, we present a complete solution for true hierarchical timing and crosstalk delay signoff. The paper discusses challenging problems and caveats with hierarchical signoff and novel solutions to address them. We explore gaps in hierarchical STA and present the first structured solution for hierarchical signoff. The results show 2x-4x cycletime and memory savings using our hierarchical signoff analysis methodology.