ppxscal/embedding_network huggingface dataset:
Modeling context in haptic perception, rendering, and visualization
Authors: Kanav Kahol, Priyamvada Tripathi, Troy Mcdaniel, Laura Bratton, Sethuraman Panchanathan
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2006)

Haptic perception refers to the ability of human beings to perceive spatial properties through touch-based sensations. In haptics, contextual clues about material,shape, size, texture, and weight configurations of an object are perceived by individuals leading to recognition of the object and its spatial features. In this paper, we present strategies and algorithms to model context in haptic applications that allow users to haptically explore objects in virtual reality/augmented reality environments. Initial results show significant improvement in accuracy and efficiency of haptic perception in augmented reality environments when compared to conventional approaches that do not model context in haptic rendering.
An Adjustable Multipath Flatted-Hexagon Search Algorithm for Block Motion Estimation
Authors: Tsong-Yi Chen, Thou-Ho (Chao-Ho) Chen, Shi-Feng Huang, Yi-Fan Li
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A novel and simple speed/accuracy adjustable block-matching algorithm (BMA) based on multipath flatted-hexagon search (MFHS) is developed for motion estimation. In the proposed method, an adaptive threshold of BDM is introduced to determine the required search directions in order to escape from being trapped into a local minimum BDM for the purpose of adjusting the search speed and matching probability. The estimated motion vector will be refined at each search step until the searching process is stopped. Experimental results show that the proposed MFHS algorithm can achieve an average matching probability up to 98% near to that of FS and about 10 times of checking points faster than FS in most of real-world sequences, especially for horizontal-motion-biased image sequences.
Fast H.264/AVC Inter-Mode Decision with RDC Optimization
Authors: Yu Hu, Qing Li, Siwei Ma, C.-C. Jay Kuo
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A complexity-constrained inter-mode decision algorithm for H.264/AVC video coding is developed using a rate-distortioncomplexity (RDC) optimization framework in this work. The proposed algorithm consists of two main steps. At the first step, we use the number of DCT coefficients of prediction errors quantized to zeros to predict whether the underlying block modes should be skipped. At the second step, a joint RDC cost function is adopted to control the mode decision process to manage motion search complexity. It is demonstrated by computer simulation that significant complexity saving can be achieved with negligible R-D performance degradation.
Making Sense of Sensemaking 1: Alternative Perspectives
Authors: Gary Klein, Brian Moon, Robert R. Hoffman
Venue: IEEE Intelligent Systems (2006)

This essay discusses the notion of sensemaking, including definitions and possibleapplications for intelligent decision support systems.The perspectives on the notion ofsensemaking are those of psychology, human-centered computing, and naturalistic decisionmaking. The essay discusses a number of myths about sensemaking (for example, that sensemaking is merely "connecting the dots"), showing how empirical evidence about expertdecision making refutes the myths.
Random walk based node sampling in self-organizing networks
Authors: Ming Zhong, Kai Shen
Venue: ACM SIGOPS Operating Systems Review (2006)

Random walk is a means of network node sampling that requires little index maintenance and can function on almost all connected network topologies. With careful guidance, node samples following a desired probability distribution can be generated with the only requirement that the sampling probabilities of each visited node and its direct neighbors are known at each walk step. This paper describes a broad range of network applications that can benefit from such guided random walks in dynamic and decentralized settings. This paper also examines several key issues for implementing random walks in self-organizing networks, including the convergence time of random walks, impact of dynamic network changes and particularly resulted walker losses, and the difficulty of pacing walk steps without synchronized clocks between network nodes. Our result suggests that with proper management, these issues do not cause significant problems under many realistic network environments.
Fast and accurate algorithms for protein side-chain packing
Authors: Jinbo Xu, Bonnie Berger
Venue: Journal of the ACM (JACM) (2006)

This article studies the protein side-chain packing problem using the tree-decomposition of a protein structure. To obtain fast and accurate protein side-chain packing, protein structures are modeled using a geometric neighborhood graph, which can be easily decomposed into smaller blocks. Therefore, the side-chain assignment of the whole protein can be assembled from the assignment of the small blocks. Although we will show that the side-chain packing problem is still NP-hard, we can achieve a tree-decomposition-based globally optimal algorithm with time complexity of O(Nnrottw &plus; 1) and several polynomial-time approximation schemes (PTAS), where N is the number of residues contained in the protein, nrot the average number of rotamers for each residue, and tw &equals; O(N2/3 log N) the treewidth of the protein structure graph. Experimental results indicate that after Goldstein dead-end elimination is conducted, nrot is very small and tw is equal to 3 or 4 most of the time. Based on the globally optimal algorithm, we developed a protein side-chain assignment program TreePack, which runs up to 90 times faster than SCWRL 3.0, a widely-used side-chain packing program, on some large test proteins in the SCWRL benchmark database and an average of five times faster on all the test proteins in this database. There are also some real-world instances that TreePack can solve but that SCWRL 3.0 cannot. The TreePack program is available at http://ttic.uchicago.edu/~jinbo/TreePack.htm.
Technology Transfer and the Tech Broker
Authors: Warren Harrison
Venue: IEEE Software (2006)

Technology transfer is the process of transferring an idea from its originator to someone who can use it. Typically, this implies the transfer of research developed in academia to industry. While there's no dearth of technologies that academic researchers have available and are anxious to transfer, precious little technology transfer involving academia takes place, at least in the software development community. Why don't we see more tech transfer in our field? What the software community needs is an infrastructure that matches researchers with adopters at a specific point in time and helps them overcome the administrative barriers. One example of a successful technology broker is SERC, a two-decade-old consortium of industrial organizations and universities that facilitates the brokering of technology transfer from academia to industry.
Inferno: a functional simulation infrastructure for modeling microarchitectural data speculations
Authors: Hong Wang, S. Manor
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

This paper presents key insights and design rationales behind Inferno, a functional simulation construction framework developed at Intel to support execution-driven cycle-accurate performance modeling and simulation of advanced microarchitectural data speculation techniques for future processor designs and explorations. Inferno divides the task of functional simulation into three essential components, namely: (1) context manager of in-flight speculatively executed instructions, (2) stateless emulator of instruction semantics, and (3) a high speed functional simulator capable of booting OS and running large-scale system workloads. These building block components work together in concert via a set of well-architected functional model convergence APIs. With a novel abstraction called speculative domain, the context manager serves effectively as a relational database about the in-flight instructions and on-going speculations. Through a set of functional model usage APIs, the context manager enables performance models to express arbitrary microarchitectural data speculation scenarios. The contribution of this paper is to demonstrate the importance of providing a functional model with modular construction, proper abstraction and expressive APIs for speculative state management. Inferno is such a functional model construction framework and has significantly improved productivity in modeling a variety of sophisticated data speculation microarchitecture techniques.
A web-based virtual factory and simulator for industrial statistics
Authors: Xuesong Chi, Matthew P. J. Pepper, Trevor A. Spedding
Venue: Proceedings of the 36th conference on Winter simulation (2004)

An educational web-based virtual factory and simulator environment is presented in this paper. It has been developed for university students to apply various statistical quality control techniques to explore the quality problems. The architecture of the simulator and methodologies for developing the website are discussed. Major benefits for both the students and lecturers are demonstrated.
A Monte Carlo Simulation Model to Assess Volunteer Response Times in a Public Access Defibrillation Scheme in Northern Ireland
Authors: Adele H. Marshall, Karen J. Cairns, Frank Kee, Michael J. Moore, Andrew J. Hamilton, A. A. Jennifer Adgey
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper describes the development of a model to assess the distribution of response times for mobile volunteers of a Public Access Defibrillation (PAD) scheme in Northern Ireland. Using parameters based on a trial period, the model predicts that a PAD volunteer would arrive before the Emergency Medical Services (EMS) to 18.8% of events to which they are paged in a given year period. This is in agreement with what has actually been observed during the trial period (where volunteers have actually reached 15% of events before the EMS), and thus assisting validation of the model. Results from this model illustrate how ongoing volunteer commitment is key to the success of the scheme.
Distribution Dimensions in Software Development Projects: A Taxonomy
Authors: Dorina C. Gumm
Venue: IEEE Software (2006)

Distribution in software development projects is a complex phenomenon with many dimensions. In addition to the obvious physical dimension entailed by geographically dispersed project personnel and resources, projects must contend with organizational distribution among various company departments, for example, as well as temporal and stakeholder distributions. A review of the literature on globally distributed software development projects produced a preliminary taxonomy based on a dimensional analysis of distribution. Developers can use this taxonomy to identify and visualize their project's distribution dimensions and scopes. A real-world case study of the taxonomy's use illuminates its value, as well as common challenges and possible solutions to distribution problems.This article is part of a special issue on Global Software Development.
Towards an Identification Framework for Software Drifts: A Case Study
Authors: Yutao Ma, Keqing He, Jianghua Wu, Jianxun Chen
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Software drift is a common phenomenon in software development processes, which may lead to process deviation and then affect software quality. Effectively controlling negative software drifts is the key to achieving acceptable, predictable, and dependable software evolution in the model-driven development. In this paper we put forward a general taxonomy to identify different drifts in development processes according to their effects on software development. Based on the taxonomy, categories of process drift and quality drift are detailedly introduced. Moreover, we propose an integration framework for different drifts to realize the integration between development process and product quality. Eventually, a case study from practical project development is shown to prove the validity of our identification framework.
Recollections: The Rise and Fall of WordStar
Authors: Seymour Rubinstein
Venue: IEEE Annals of the History of Computing (2006)

This memoir focuses chiefly on the story of WordStar, the pioneering word processing software for personal computers that was ahead of its time. A series of unfortunate circumstances--personal illness, management ineptitude, clash of egos, changing business conditions--converged to bring low a once-promising and shining venture.
Research of Mobile Agent Based Network Topology Discovery
Authors: Chao Dong, Xiao-rong Cheng, Ming-quan Zhang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

With the proliferation of new networking technologies, and the demand for new services, it will become increasingly difficult to manage large-scale networks with the traditional Client/Server management system. Discovering and keeping track of the topology of a network is essential for effective network management. In this paper we introduce a distributed algorithm for discovering the network topology using mobile agents. The approach offers a more distributed and scalable solution, and is therefore, a significant improvement over the C/Sbased scheme.
Software-Aided Mass Spectrometry Analysis for Identification of Protein-Protein Interaction in Signal Transduction Pathways
Authors: Aki Hasegawa, Kazumi Kuriyama-Matsumura, Xiaomei Yu, Mariko Mariko Hatakeyama, Akihiko Konagaya
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Protein-protein interaction (PPI) networks, which are caused by extracellular stimuli in the signal transduction pathways, are not fully understood for all cells. Mass spectrometric analysis is one of the powerful tools available for revealing these interactions. However, this analytical method is sometimes inefficient because of the many false positive candidates resulting from extracellular matrix or exogenous protein contaminants. To efficiently identify PPIs in signal transduction pathways, we developed a software program 'PROMISS' for LC/MS/MS. PROMISS contains all known PPIs and domain information, which are very useful for deducting the PPIs in different signal transduction pathways. By referring to the domain and interaction information in PROMISS, users can effectively select from enormous numbers of candidates the proteins that are related to specific PPIs. We also show that gel filtration chromatography is useful for pretreating and fractioning the interacting protein complex in the cell. In this study, we report a method of identifying epidermal growth factor receptor (EGFR) binding protein in EGF-treated A431 cells using PROMISS and gel filtration. Based on mass spectrometry analysis and bioinformatics approaches, this strategy is effective for identification of PPIs in signal transduction pathways.
Simulation of imperfect information in vulnerability modeling for infrastructure facilities
Authors: Dean A. Jones, Mark A. Turnquist, Linda K. Nozick
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A model of malicious intrusions in infrastructure facilities is developed that uses a network representation of the system structure together with Markov models of intruder progress and strategy. Simulation is used to analyze varying levels of imperfect information on the part of the intruders in planning their attacks. This provides an explicit mechanism to estimate the probability of successful breaches of physical security, and to evaluate potential means to reduce that probability.
Designing an online service for a math community
Authors: Martin Wessner, Wesley Shumar, Gerry Stahl, Johann Sarmiento, Martin Mühlpfordt, Stephen Weimar
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

In the Virtual Math Teams project an online service for groups of people to discuss and collaboratively solve mathematical problems is being developed. The paper takes a qualitative approach to looking at the design-based research process of developing the platform for a synchronous math problem solving environment. We sketch the transition from early experiments with commercially available tools to a series of studies conducted with a research tool finally to the design of a platform which provides the technical basis to a scalable public service. For this design we had to take into account requirements from students, tutors, the service provider as well as researchers from various disciplines. We discuss some design decisions which lead to a platform which addresses the diverse requirements of the various stakeholders. The paper underscores the value of a design-based research process and a self-reflexive process as we develop insights about online math problem solving.
Multi-radio channel allocation in competitive wireless networks
Authors: Mark Felegyhazi, Mario Cagalj, Jean-Pierre Hubaux
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic into the focus of research again. In this paper, we provide a formal analysis of the selfish multi-radio channel allocation problem using game theory. We conclude that in spite of the non-cooperative behavior of such devices, their channel allocation results in a Pareto- and system-optimal solution. Furthermore, we present a simple algorithm to achieve this efficient channel allocation. To the best of our knowledge, our paper is the first contribution to this important topic.
An examination of forward volatility
Authors: Ray Popovic, David Goldsman
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper investigates the adequacy of various principal components (p.c.) approaches as data reduction schemes for processing contingent claim valuations on baskets of equities. As a general proposition we are interested in discovering possible features and rules-of-thumb for the applicability of p.c. techniques. In particular, what accuracy does one lose in valuation-hedging schemes as the dimensionality of the p.c. space is reduced? We also have an interest in validating the posted "stylized" facts of implied volatility as they apply to our data sets.
Progressive image transmission by adaptive interpolation
Authors: T. K. Shih, L. H. Lin, Jen-Shiun Chiang
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Progressive image transmission is a mechanism that transmits the most significant portion of an image, followed by its less important parts. Applications of such a mechanism include browsing large image files on the Internet. We propose an adaptive mechanism, based on the characteristics of images. The mechanism use neighbor pixels to guess a target pixel value, without actually transmitting the target pixel. An error correction scheme is also designed to cope with a failure guessing. The prototype is tested on 1500 bit-mapped pictures of different categories. Preliminary results should that the transmission rate is lower than others, with reasonable PSNR values of the transmitted images. Interested readers can find the prototype tool and our evaluations at http://www.mine.tku.edu.tw/demos/ProgTransmission.
Bluetooth Inquiry Time Characterization and Selection
Authors: Brian S. Peterson, Rusty O. Baldwin
Venue: IEEE Transactions on Mobile Computing (2006)

The Bluetooth discovery process requires use of the inquiry substate which not only consumes significant power, but prevents normal data traffic flow and simultaneously acts as a potential noise source for neighboring networks. Therefore, the inquiry substate dwell time should be limited to discovering an acceptable number of neighboring devices. Although an estimate of the probability density function of the time to discover scanning devices is straightforward, the complex temporal and spectral interactions between two devices make precise inquiry time characterization difficult. We characterize these interactions and derive detailed analytical expressions for the probability distribution of the inquiry time for a Bluetooth-enabled device that follows v1.1 of the Bluetooth specification and uses the default 11.25 ms inquiry scan window that opens every 1.28 s. Subsequently, we show a single inquirer will locate 99 percent of all scanning devices within transmission range in 5.12 seconds rather than the 10.24 s recommended in the specification. Using specification v1.2, we show that the inquiry time can be reduced to 3.84 seconds and 1.28 seconds using the standard and interlaced inquiry scan modes, respectively. Substantial inquiry time reduction results in reduced power requirements and increased throughput by increasing data traffic and reducing interference with neighboring piconets. Our results are validated via comparison with existing simulation models and measurement studies. The models used to derive the distribution also lend themselves to characterizing the discovery time with variations in the discovery process.
Efficient collision culling among deformable objects using graphics processors
Authors: Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha
Venue: Presence: Teleoperators and Virtual Environments (2006)

We present a fast collision culling algorithm for performing inter- and intra-object collision detection among complex models using graphics hardware. Our algorithm utilizes visibility queries on the GPUs to eliminate a subset of geometric primitives that are not in close proximity and computes a potentially colliding set (PCS) of primitives. We perform no precomputation and the algorithm proceeds in multiple stages: object-level PCS computation, subobject level PCS computation, followed by exact collision detection. We extend our PCS computation algorithm to perform intra-object or self-collisions between complex models. Furthermore, we describe a novel visibility-based classification scheme to reduce the size of potentially-colliding sets of objects and primitives, and the number of visibility queries for further improving the performance and culling efficiency. We have implemented our algorithm on a PC with an NVIDIA GeForce FX 6800 Ultra graphics card and applied it to three complex simulations, each consisting of objects with tens of thousands of triangles. In practice, we are able to compute all the self-collisions for cloth simulation up to image-space precision at interactive rates.
Jazz Sebastian Bach: A GA System for Music Style Modification
Authors: Dimitrios Tzimeas, Eleni Mangina
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Genetic algorithms (GAs) have successfully been employed in a wide range of artificial intelligence problems. This paper reviews the use of GAs in the area of art creativity and focuses on the connection between the human creativity procedure and the operators of selection-mutation-crossover in a simple GA trying to outline a new algorithmic analogue. It presents "Jazz Sebastian Bach", a novel GA-based computational music system that performs a style modification of a J. S. Bach theme to a Jazz melody. The system's sources of innovation are addressed and exemplified, as is an evaluation of its outputs. The paper concludes with a summary of the main findings and discusses the potential application of the system in the areas of computer-assisted composition and music education.