ppxscal/embedding_network huggingface dataset:
The Social Context Model for Research Activities in a Cyberspace
Authors: Fang Sheng, Zhang Min, Huang Ling, Wei Yongshan
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

A lot of activities in the cyberworld are the just corresponding of the real world social activities. For high efficiency and good service quality, the social context should be taken into accounts for the activities executed in the cyberspace. As an important and special social activities, research is full of characteristics of personalization, intelligence and often done in the team form. Taking researching as a typical one of the social activities shifted into cyberworld to be carried out, this paper propose two kinds of contexts, the relatively unchanged social contexts related to activities and social factors, and the action background context that may be different for users in each activity. In the virtual research community system based on the expanded JXTA, a social context model is build by OWL. This supports a quality and efficiency guarantee for the research activities, such as searching for researching fellows, literatures and automatically generating a research report.
A new forward masking model and its application to perceptual audio coding
Authors: Yuan-Hao Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents a new forward masking model for perceptual audio coding. This model exploits adaptation of the peripheral sensory and neural elements in the auditory system, which is often deemed as the cause of forward masking. Nonlinearity of the ear is modeled by a nonlinear analog circuit with difference equations. We incorporate this model in the MPEG layer III audio coding scheme and construct a masking plane in the frequency-time space. With some extra computations, the new audio coding scheme can improve the sound quality of the decoded audio signals. In our experiments, subjective and objective sound quality measurements show that, to achieve the same reconstructed sound quality, the new scheme requires 12% to 23% less bits than the original MPEG layer III scheme.
An Exploratory Case Study Using CBSP and Archium
Authors: Charles L. Chen, Danhua Shao, Dewayne E. Perry
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The need for architectural rationale has long been recognized, but unfortunately it has remained a relatively unexplored area of research in software architecture. However, there is growing interest in methods for capturing the rationale behind software architectures. We summarize two of these methods (CBSP and Archium), present an exploratory case study using both methods to evolve a real software system, and then use the results from this case study to analyze and compare these methods. From this analysis, we conclude that the CBSP and Archium methods are complementary rather than competing because of their respective strengths and weaknesses.
Monitoring the Neighbor Discovery Protocol
Authors: Frederic Beck, Thibault Cholez, Olivier Festor, Isabelle Chrisment
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

While IPv6 is increasingly being deployed in networks, including ISPs, the need to monitor and manage the associated protocols increases. In this paper we focus on the Neighbor Discovery Protocol and we motivate the importance to monitor it. We also present our approach for this task together with the functionalities we provide and the software, NDPMon, that we developed.
Eleventh Securities Technologies (ST) Workshop Report
Authors: David P. Gilliam, Matt Bishop
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

The Securities Technologies (ST) Workshop for WETICE 2006 accepted papers covering a wide-variety of topics that had applicability to the other WETICE workshops. The cross-over interest of papers in this, and other, workshops was discussed in the wrap-up presentation on the final day.
Adaptive spatial noise shaping for DCT based image compression
Authors: S. J. P. Westen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

The most important visual artefacts that result from DCT based image compression are mosquito noise and blocking. Mosquito noise becomes visible due to the uniform spatial distribution of the quantization noise in blocks which contain textured as well as flat regions, which results in clearly visible noise in the flat regions. Spatial noise shaping is an encoder based technique which can be used to reduce mosquito noise by "hiding" the noise in that part of the block where it has the lowest visibility. We propose an efficient noise-shaping algorithm which gives accurate control of the spatial noise distribution. The encoder based technique is fully compatible with the JPEG and MPEG standards. Experiments show that noise shaping leads to a significant mosquito noise reduction.
A Semi-Structured representation for Knowledge Discovering using Remote Sensing Images
Authors: Erick Lopez-Ornelas, Florence Sedes
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper we describe the basic functionalities of a system dedicated to process high-resolution satellite images and to handle them through (semi-) structured descriptors. These descriptors enable to manage in a unified representation two families of features extracted from the objects identified by image segmentation: the attributes characterizing each object, and the attributes characterizing relationships between objects. Our aim is to focus on the complementarity of two approaches, on one hand concerns the remote sensing and the image segmentation, and on the other hand concerns the knowledge discovery and the modeling.
A Delay Composition Theorem for Real-Time Pipelines
Authors: Praveen Jayachandran, Tarek Abdelzaher
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt it. In this paper, we bound the end-to-end delay of a job in a multistage pipeline as a function of higher-priority job execution times on different stages. We show that the end-to-end delay is bounded by that of a single virtual "bottleneck" stage plus a small additive component. This contribution effectively transforms the pipeline into a single stage system. The wealth of schedulability analysis techniques derived for uniprocessors can then be applied to decide the schedulability of the pipeline. The transformation does not require imposing artitifical per-stage deadlines, but rather models the pipeline as a whole and uses the end-to-end deadlines directly in the single-stage analysis. It also does not make assumptions on job arrival patterns or periodicity and thus can be applied to periodic and aperiodic tasks alike. We show through simulations that this approach outperforms previous pipeline schedulability tests except for very short pipelines or when deadlines are sufficiently large. The reason lies in the way we account for execution overlap among stages. We discuss how previous approaches account for overlap and point out interesting differences that lead to different performance advantages in different cases. We hope that the pipeline delay composition rule, derived in this paper, may be a step towards a general schedulability analysis foundation for large distributed systems.
Functional Broadside Tests with Different Levels of Reachability
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Functional broadside tests for transition faults are broadside tests that detect transition faults using only states that the circuit can visit during functional operation, or reachable states. Reachability was used before as a binary property, i.e., a state is either reachable or not. We extend this concept to associate a level of reachability with every state. A non-zero level is associated with a reachable state. A reachable state that is more likely to occur during functional operation is associated with a higher reachability level than a state that is less likely to occur. Tests based on states with high levels of reachability and tests based on states with low levels of reachability can serve different purposes, and both may be needed for a high-quality test set. We describe a process of constructing a test set for transition faults such that each detectable fault would be detected by two functional broadside tests with the most extreme possible levels of reachability.
Essential Fault-Tolerance Metrics for NoC Infrastructures
Authors: Cristian Grecu, Lorena Anghel, Partha P. Pande, Andre Ivanov, Resve Saleh
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Fault-tolerant design of Network-on-chip communication architectures requires the addressing of issues pertaining to different elements described at different levels of design abstraction -- these may be specific to architecture, interconnection, communication and application issues. Assessing the effectiveness of a particular fault-tolerant implementation can be a challenging task for designers, constrained with tight system performance specifications and other requirements In this paper, we provide a top-down view of fault-tolerance methods for NoC infrastructures, and present a range of metrics used for estimating their quality. We illustrate the use of these metrics by simulating a few simple but realistic fault-tolerant scenarios.
Self-Organizing Services for Browsing the World: Challenges and Directions
Authors: Franco Zambonelli
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

The imminent mass deployment of pervasive computing technologies such as sensor networks and RFID tags, together with the increasing participation of the Web community in feeding geo-located information within tools such as Google Earth, will soon make available an incredible amount of information about the physical and social worlds and their processes.
Linear distances as branch metrics for Viterbi decoding of trellis codes
Authors: Hui-Ling Lou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

In the Viterbi algorithm for decoding convolutional and trellis codes, squared Euclidean distance is the optimum branch metric for decoding sequences transmitted in additive white Gaussian noise channels and in Rayleigh fading channels when the channel state information is appropriately included. For high bit-rate applications; multiple parallel branch metric computation units may be required. Duplication of the multipliers or large look-up tables to obtain the squared distances can increase the decoder complexity significantly. Furthermore, the multipliers and the delay occurred in accessing large look-up tables can become the bottleneck for a fully pipelined Viterbi decoder. In this paper, we show that linear distances can be used to represent the branch metrics, without compromising the Viterbi decoder performance. Thus, adders rather than multipliers can be used to compute the branch metrics and this breaks the potential bottleneck in the Viterbi decoder.
3D Hand Model Fitting for Virtual Keyboard System
Authors: Huan Du, Edoardo Charbon
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

In this paper, a 3D hand model fitting method is presented which can recover the accurate finger positions for a virtual keyboard system. The 3D hand model consists of a detailed polygonal skin driven by an underlying skeleton system. The system uses a structured light sensor to generate dense range measurements of user's hand motion. We exploit depth information and match it against the model to estimate the pose of the hand. The parameters for model deformation are optimized with the guide of the applied forces between model points and range measurements. To speed up the optimization, we simplify the physical model and apply hash table-based fast point pair matching. The system can be used in any application requiring zero formfactor and requires no contact with a medium. Examples of applications include virtual reality, gaming, design, etc.
A Novel Haptic Interface for Navigation in Large Volume Environments
Authors: T. A. Smith, A. L. Barrow, R. G. Barrow, W. S. Harwin
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Haptic interfaces can provide highly realistic interaction with objects within their workspace, but the task of interacting with objects over large areas or volumes is made difficult by the limits of interface travel. This paper details the development of a custom haptic interface for navigating a large virtual environment (a simulated supermarket), and investigation into different control methods which allow for haptic interaction over extremely large workspaces.
A framework for higher-order functions in C++
Authors: Konstantin Läufer
Venue: Proceedings of the USENIX Conference on Object-Oriented Technologies on USENIX Conference on Object-Oriented Technologies (COOTS) (1995)

C and C++ allow passing functions as arguments to other functions in the form of function pointers. However, since function pointers can refer only to existing functions declared at global or file scope, these function arguments cannot capture local environments. This leads to the common misconception that C and C++ do not support function closures. In fact, function closures can be modeled directly in C++ by enclosing a function inside an object such that the local environment is captured by data members of the object. This idiom is described in advanced C++ texts and is used, for example, to implement callbacks. The purpose of this paper is twofold: First, we demonstrate how this idiom can be generalized to a type-safe framework of C++ class templates for higher-order functions that support composition and partial application. Second, we explore the expressiveness of the framework and compare it with that of existing functional programming languages. We illustrate by means of various examples that object-oriented and functional idioms can coexist productively and can be used to enhance the functionality of common classes, for example, of nonlinear collections such as trees. A C++ implementation of the framework is available on request.
Reaching minority, female and disadvantaged students
Authors: B. G. Summers, H. R. Hicks, C. E. Oliver
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Adventures in Supercomputing (AiS) is an innovative educational outreach program to address the shortfall in human resources in science and engineering. The program has been funded since 1992 as part of the Department of Energy's High Performance Computing and Communications Program. Supercomputers are used both as a magnet to draw students into science and engineering and as an enabling tool to assist them to explore simulations based on mathematical or physical models. The program presently involves 69 high schools and 5 middle schools in five states: Alabama, Colorado, Iowa, New Mexico, and Tennessee. The primary goal of this program is to capture and cultivate the interest of minority, female and disadvantaged students in science, mathematics, and computing. By improving the teachers' computer expertise and scientific knowledge through intense training, teachers are able to reach out confidently to this target group of students. An environment to support computing education for both students and teachers is strengthened during the year through continued technical support. The paper discusses methods of encouraging minorities, women, and disadvantaged students to become involved in the Adventures in Supercomputing program. It shares achievements of this diverse school population over the past years as these students engage in long term computational science projects. It also shares the assessment results, showing the success of the program.
Cooperative caching: using remote client memory to improve file system performance
Authors: Michael D. Dahlin, Randolph Y. Wang, Thomas E. Anderson, David A. Patterson
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

Emerging high-speed networks will allow machines to access remote data nearly as quickly as they can access local data. This trend motivates the use of cooperative caching: coordinating the file caches of many machines distributed on a LAN to form a more effective overall file cache. In this paper we examine four cooperative caching algorithms using a trace-driven simulation study. These simulations indicate that for the systems studied cooperative caching can halve the number of disk accesses, improving file system read response time by as much as 73%. Based on these simulations we conclude that cooperative caching can significantly improve file system read response time and that relatively simple cooperative caching algorithms are sufficient to realize most of the potential performance gain.
Feature parameter curve method for high performance NN-based speech recognition
Authors: Shan Zhu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper proposes a novel high-performance NN-based isolated word speech recognition method named feature parameter curve method (FPCM), which contains three sub-methods, i.e., the feature frame parameter method, the broken line fitting method and the representing-point sequence (RPS) method. Using feature parameter curve to represent the contour of LPC-based cepstral coefficient sequence, our new methods solve the time alignment problem, greatly lighten the burden on neural network and thus reducing the complexity of the neural network. Compared with other NN-based methods, our methods have many strong points such as much faster training and recognition, simpler structure of neural nets, and is more robust. A recognition system of all Mandarin syllables has been established based on this method and the comparative experiments confirmed the good characteristics stated above. The idea of reconstructing original speech signals is also first shown in speech recognition. 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
Autonomous Stair Climbing for Tracked Vehicles
Authors: Anastasios I. Mourikis, Nikolas Trawny, Stergios I. Roumeliotis, Daniel M. Helmick, Larry Matthies
Venue: International Journal of Robotics Research (2007)

In this paper, an algorithm for autonomous stair climbing with a tracked vehicle is presented. The proposed method achieves robust performance under real-world conditions, without assuming prior knowledge of the stair geometry, the dynamics of the vehicle's interaction with the stair surface, or lighting conditions. The approach relies on fast and accurate estimation of the robot's heading and its position relative to the stair boundaries. An extended Kalman filter is used for quaternion-based attitude estimation, fusing rotational velocity measurements from a 3-axial gyroscope, and measurements of the stair edges acquired with an onboard camera. A two-tiered controller, comprised of a centering- and a heading-control module, utilizes the estimates to guide the robot rapidly, safely, and accurately upstairs. Both the theoretical analysis and implementation of the algorithm are presented in detail, and extensive experimental results demonstrating the algorithm's performance are described.
Towards a digital learning community for engineering education
Authors: B. Muramatsu
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The paper presents lessons learned from the decade of experience NEEDS (National Engineering Education Delivery System) has in developing and running a digital library for engineering education. It demonstrates and discusses current features and services. NEEDS has developed a scalable infrastructure that allows engineering educators to locate and discuss digital learning resources and participate as part of a community of practice. NEEDS is now in the process of expanding to include a broader community of learners and educators in Science, Mathematics, Engineering and Technology Education (SMETE).
Individual Differences in the Effects of Perceived Controllability on Pain Perception: Critical Role of the Prefrontal Cortex
Authors: Tim V. Salomons, Tom Johnstone, Misha-Miroslav Backonja, Alexander J. Shackman, Richard J. Davidson
Venue: Journal of Cognitive Neuroscience (2007)

The degree to which perceived controllability alters the way a stressor is experienced varies greatly among individuals. We used functional magnetic resonance imaging to examine the neural activation associated with individual differences in the impact of perceived controllability on self-reported pain perception. Subjects with greater activation in response to uncontrollable (UC) rather than controllable (C) pain in the pregenual anterior cingulate cortex (pACC), periaqueductal gray (PAG), and posterior insula/SII reported higher levels of pain during the UC versus C conditions. Conversely, subjects with greater activation in the ventral lateral prefrontal cortex (VLPFC) in anticipation of pain in the UC versus C conditions reported less pain in response to UC versus C pain. Activation in the VLPFC was significantly correlated with the acceptance and denial subscales of the COPE inventory [Carver, C. S., Scheier, M. F., & Weintraub, J. K. Assessing coping strategies: A theoretically based approach. Journal of Personality and Social Psychology, 56, 267--283, 1989], supporting the interpretation that this anticipatory activation was associated with an attempt to cope with the emotional impact of uncontrollable pain. A regression model containing the two prefrontal clusters (VLPFC and pACC) predicted 64% of the variance in pain rating difference, with activation in the two additional regions (PAG and insula/SII) predicting almost no additional variance. In addition to supporting the conclusion that the impact of perceived controllability on pain perception varies highly between individuals, these findings suggest that these effects are primarily top-down, driven by processes in regions of the prefrontal cortex previously associated with cognitive modulation of pain and emotion regulation.