ppxscal/embedding_network huggingface dataset:
Scalable and accurate approaches for program dependence analysis, slicing, and verification of concurrent object oriented programs
Authors: John M. Hatcliff
Venue:  (2006)

With the advent of multi-core processors and rich language support for concurrency, the paradigm of concurrent programming has arrived; however, the cost of developing and maintaining concurrent programs is still high. Simultaneously, the increase in social ubiquity of computing is reducing the "time-to-market" factor while demanding stronger correctness requirements. These effects are amplified with ever-growing size of software systems. Consequently, there is (will be) a rise in the demand for scalable and accurate techniques to enable faster development and maintenance of correct large scale concurrent software.This dissertation presents a collection of scalable and accurate approaches to tackle the above situation. Primarily, the approaches are focused on discovering dependences (relations) between various parts of the software/program and leveraging the dependences to improve maintenance and development tasks via program slicing (comprehension) and verification.Briefly, the proposed approaches are embodied in the following specific contributions: (1) New trace-based foundation for control dependences. (2) An equivalence class based analysis to efficiently and accurately calculate escape information and intra- and inter-thread dependences. (3) A new parametric data flow style slicing algorithm with various extensions to uniformly and easily realize and reason about most existing forms of static sequential and concurrent slicing. (4) A new generic notion of property/trace sensitivity to represent and reason about richer forms of context sensitivity. (5) Program dependence based partial order reduction techniques to enable efficient and accurate state space exploration in both static and dynamic mode.In an attempt to simplify the approaches, they have been based on the basic concepts/ideas of the affected techniques (e.g. program slicing is a rooted transitive closure of dependence relation). As trace-based reasoning is well suited for concurrent systems, an attempt has been made to explore trace-based reasoning wherever possible.While providing a rigorous theoretical presentation of these techniques, this effort also validates the techniques by implementing them in a robust tool framework called Indus (available from http://indus.projects.cis.ksu.edu) and then providing experimental results that demonstrate the effectiveness of the techniques on various concurrent applications.Given the current trend towards concurrent programming and social ubiquity of computing, the approaches proposed in this dissertation provide a foundation for collectively attacking scalability, accuracy, and soundness challenges in current and emerging systems.
Application of a modified neural fuzzy network and an improved genetic algorithm to speech recognition
Authors: K. F. Leung, F. H. F. Leung, H. K. Lam, S. H. Ling
Venue: Neural Computing and Applications (2007)

This paper presents the recognition of speech commands using a modified neural fuzzy network (NFN). By introducing associative memory (the tuner NFN) into the classification process (the classifier NFN), the network parameters could be made adaptive to changing input data. Then, the search space of the classification network could be enlarged by a single network. To train the parameters of the modified NFN, an improved genetic algorithm is proposed. As an application example, the proposed speech recognition approach is implemented in an eBook experimentally to illustrate the design and its merits.
How Clones are Maintained: An Empirical Study
Authors: Lerina Aversano, Luigi Cerulo, Massimiliano Di Penta
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Despite the conventional wisdom concerning the risks related to the use of source code cloning as a software development strategy, several studies appeared in literature indicated that this is not true. In most cases clones are properly maintained and, when this does not happen, is because cloned code evolves independently. Stemming from previous works, this paper combines clone detection and co-change analysis to investigate how clones are maintained when an evolution activity or a bug fixing impact a source code fragment belonging to a clone class. The two case studies reported confirm that, either for bug fixing or for evolution purposes, most of the cloned code is consistently maintained during the same co-change or during temporally close co-changes.
Total variation denoising in coloured noise
Authors: V. Solo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We consider total variation denoising in the presence of coloured noise. We show that noise can sometimes but not always cause major problems with reconstruction. We suggest that signal to noise ratio is not the crucial factor, rather the spectral content of the noise is crucial. We show how to modify the reconstruction algorithm to deal with coloured noise as well as how to do automatic tuning parameter selection.
Roller interface for mobile device applications
Authors: Lijian Wang, A. S. M. Sajeev
Venue: Proceedings of the eight Australasian conference on User interface - Volume 64 (2007)

Mobile devices generally have small screens. To display information that is well suited for larger screens (e.g. desktop computers), the information has to be segmented into many small presentation units that can fit into the small screen of mobile devices. This makes it difficult to effectively organize information and help users navigate to and from the information they want. This paper presents Roller, a new interface technique to present application interface on mobile devices. Roller helps alleviate the screen real estate limitations in user-interface design and provides rich contextual information to ease users' navigation tasks. Our primary trial study shows the effectiveness of using Roller to organize and present information on small screens.
Informed audio watermarking scheme using digital chaotic signals
Authors: G. C. M. Silvestre
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

An informed audio watermarking scheme using chaotic waveforms is proposed. The watermark consists of an attenuated signal embedded in the original audio signal. A modulation scheme based on vector quantization is used to achieve blind detection of the watermark signal. A method for self-synchronization of the watermark detector is proposed using chaotic orthogonal waveforms. A perceptual model is employed to ensure inaudibility of the embedded signal that is shaped to the spectrum of the host signal. High robustness to external noise is achieved by spreading the watermark data over a period of time. The robustness of the scheme is assessed by computer simulations.
Proceedings of the international conference on Advances in computer entertainment technology
Venue: ACM International Conference Proceeding Series; Vol. 203 (2007)

Welcome to the 4th ACE Conference, the International Conference on Advances in Computer Entertainment Technology, which is held between June 13th--15th, 2007 in Salzburg, Austria. Computer entertainment and games have become an integral part of our everyday lives. The challenge to design new forms of entertainment and developing methods on how to evaluate games towards users needs, is addressed by the various researchers, practitioners and developers whose work is published within these conference proceedings. The main goal of the ACE conference is to share the latest results and developments in design, development and evaluation of new forms of entertainment technology. The ACE Conference Series started in Singapore in 2004 and was followed by Valencia and Hollywood as subsequent locations in 2005 and 2006 respectively. We would like to thank all former Chairs for making this great conference series happen and supporting us in hosting this current conference. ACE is continuously growing and this is demonstrated this year by receiving 44 long papers from which we accepted the best 18. We had 74 short paper/poster submissions out of which we accepted 21 for presentation and 25 as poster. To encourage broader and more active conference participation, we enriched the program by holding three workshops on June 12th, 2007. To provide various forms of entertainment experiences we accepted 16 demonstrations including a late submission category for industrial case studies -- to show latest developments to the ACE community. This year we invite participants not only to be contributors, but to be actively involved in this conference. Starting with a keynote speech, which actively involves participants in a social event, demonstrating historic ideas of new forms of playful user experiences, this year's conference theme active and playful participation in games will be highlighted throughout the whole conference. The theme is reflected in this year's conference topics, covering games in all kinds of environments, interaction techniques like tangible interaction, new kinds of entertainment and novel ways of addressing music, rounded up by evaluation of games.
Using fault injection and modeling to evaluate the performability of cluster-based services
Authors: Kiran Nagaraja, Xiaoyan Li, Ricardo Bianchini, Richard P. Martin, Thu D. Nguyen
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

We propose a two-phase methodology for quantifying the performability (performance and availability) of cluster-based Internet services. In the first phase, evaluators use a fault-injection infrastructure to measure the impact of faults on the server's performance. In the second phase, evaluators use an analytical model to combine an expected fault load with measurements from the first phase to assess the server's performability. Using this model, evaluators can study the server's sensitivity to different design decisions, fault rates, and environmental factors. To demonstrate our methodology, we study the performability of 4 versions of the PRESS Web server against 5 classes of faults, quantifying the effects of different design decisions on performance and availability. Finally, to further show the utility of our model, we also quantify the impact of two hypothetical changes, reduced human operator response time and the use of RAIDs.
Yahoo University hackday
Authors: Murray Rowan, Tim Hawkins, Andy Cobley
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Yahoo has recently embarked upon a program of supporting and organising "University Hack Days". This program is designed to help Yahoo reach out to new generations of aspiring web developers, and provide them with early experience of what it's like to work in the competitive new media development industry. HackDays[1] are also a great vehicle for Yahoo to use to help foster awareness of its APIs and other technologies from the Yahoo Developer Network[2] that can be used and mixed to create innovative new "mash-ups". The program encourages students to perform the following tasks: 1. To come up with a new and innovative idea that has relevance to the new media industry. 2. To present their ideas in a fashion designed to inform others about the nature of their project, and to invite discussion and feedback from industry professionals. 3. To develop a working prototype using the most appropriate technologies and development techniques. 4. To present the finished project in a competitive environment similar to that met in commercial organisations. The "University Hack Day" is an extension of the "Hack Day" program that Yahoo has been running internally for its engineers and now publicly in the "Open Hack Day" program.
Building a Grid in Latin America: The EELA Project e-Infrastructure
Authors: B. Marechal, P. H. Rausch Bello, D. Carvalho
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Several international projects and collaborations have emerged in the last years due to the increasing demand for grid distributed resources around the world. One important aspect of these initiatives deals with the "gridification of computing intensive scientific applications otherwise difficult to run efficiently. The EELA Project (E-Infrastructure shared between Europe and Latin America) is a collaboration between Latin American and European institutions that has developed a potent e-Infrastructure for e-Science applications. This paper describes the consolidated EELA e-Infrastructure and the progress achieved so far.
Reducing Connection Memory Requirements of MPI for InfiniBand Clusters: A Message Coalescing Approach
Authors: Matthew J. Koop, Terry Jones, Dhabaleswar K. Panda
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Clusters in the area of high-performance computing have been growing in size at a considerable rate. In these clusters, the dominate programming model is the Message Passing Interface (MPI), so the MPI library has a key role in resource usage and performance. To obtain maximal performance, many clusters deploy a high-speed interconnect between compute nodes. One such interconnect, InfiniBand, has been gaining in popularity due to its various features including Remote Data Memory Access (RDMA), and high-performance. As a result, it is being deployed in a significant number of clusters and has been chosen as the standard interconnect for capacity clusters within the DOE Tri-Labs. As these clusters grow in size, care must be taken to ensure the resource usage does not increase too significantly with scale. In particular, the MPI library resource usage should not grow at a rate which will exhaust the node memory or starve user applications.
Hyperspectral hypertemporal feature extraction methods with applications to aquatic invasives target detection
Authors: Lori M. Bruce
Venue:  (2006)

In this dissertation, methods are designed and validated for the utilization of hyperspectral hypertemporal remotely sensed data in target detection applications. Two new classes of methods are designed to optimize the selection of target detection features from spectro-temporal space data. The first method is based on the consideration that all the elements of the spectro-temporal map are independent of each other. The second method is based on the consideration that the elements of the spectro-temporal map have some vicinal dependency among them. Methods designed for these two approaches include various stepwise selection methods, windowing approaches, and clustering techniques. These techniques are compared to more traditional feature extraction methods such as Normalized Difference Vegetation Index (NDVI), spectral analysis, and Principal Component Analysis (PCA). The efficacies of the new methods are demonstrated within an aquatic invasive species detection application, namely discriminating waterhyacinth from other aquatic vegetation such as American lotus. These two aquatic plant species are chosen for testing the proposed methods as they have very similar physical characteristics and they represent a practical life target detection problem. It is observed from the overall classification accuracy estimates that the proposed feature extraction methods show a marked improvement over conventional methods. Along with improving the accuracy estimates, these methods demonstrate a capability to drastically reduce the dimensionality while retaining the desired hyperspectral hypertemporal features. Furthermore, the feature set extracted using the newly developed methods provide information about the optimum subset of the hyperspectral hypertemporal data for a specific target detection application, which makes these methods serve as tools to strategize more intelligent data collection plans.
STMBench7: a benchmark for software transactional memory
Authors: Rachid Guerraoui, Michal Kapalka, Jan Vitek
Venue: ACM SIGOPS Operating Systems Review (2007)

Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse-grained locking and easier to use than fine-grained locking. However, STM implementations have yet to demonstrate that their runtime overheads are acceptable. To date, empiric evaluations of these implementations have suffered from the lack of realistic benchmarks. Measuring performance of an STM in an overly simplified setting can be at best uninformative and at worst misleading as it may steer researchers to try to optimize irrelevant aspects of their implementations. This paper presents STMBench7: a candidate benchmark for evaluating STM implementations. The underlying data structure consists of a set of graphs and indexes intended to be suggestive of many complex applications, e.g., CAD/CAM. A collection of operations is supported to model a wide range of workloads and concurrency patterns. Companion locking strategies serve as a baseline for STM performance comparisons. STMBench7 strives for simplicity. Users may choose a workload, number of threads, benchmark length, as well as the possibility of structure modification and the nature of traversals of shared data structures. We illustrate the use of STMBench7 with an evaluation of a well-known software transactional memory implementation.
Adaptive-Size Reservoir Sampling over Data Streams
Authors: Mohammed Al-Kateb, Byung Suk Lee, X. Sean Wang
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Reservoir sampling is a well-known technique for sequential random sampling over data streams. Conventional reservoir sampling assumes a fixed-size reservoir. There are situations, however, in which it is necessary and/or advantageous to adaptively adjust the size of a reservoir in the middle of sampling due to changes in data characteristics and/or application behavior. This paper studies adaptivesize reservoir sampling over data streams considering two main factors: reservoir size and sample uniformity. First, the paper conducts a theoretical study on the effects of adjusting the size of a reservoir while sampling is in progress. The theoretical results show that such an adjustment may bring a negative impact on the probability of the sample being uniform (called uniformity confidence herein). Second, the paper presents a novel algorithm for maintaining the reservoir sample after the reservoir size is adjusted such that the resulting uniformity confidence exceeds a given threshold. Third, the paper extends the proposed algorithm to an adaptive multi-reservoir sampling algorithm for a practical application in which samples are collected from memory-limited wireless sensor networks using a mobile sink. Finally, the paper empirically examines the adaptivity of the multi-reservoir sampling algorithm with regard to reservoir size and sample uniformity using real sensor networks data sets.
Decomposition of modular destination graphs for many-many packet routing in multi-link binary hypercubes
Authors: D. A. Batovski
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

The paper considers the existence of oblivious many-many packet routing in multi-link binary hypercubes. Modular destination graphs are decomposed according to a certain number of links for a particular dimension n of the hypercube in order to establish conflict-free tight minimum routing within a network cycle consisting of n hops. Quasi-dimension-order routing is applied, where the replacements of the unidentical bit positions between source and destination are cyclic. Sample results of graph decomposition for a number of dimensions n /spl les/ 7 are presented in the Appendix.
The private city through the hot images
Authors: Cristina Portalés
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Hot Images is an artistic mixed reality application that deals with the relation between human beings and city environments, thus proposing a novel cartography and navigation tool for the city. Within the virtual recreated environment of the Hot Images, the inert city is closed to the human field, transforming the cold aspect of the city into the hotness of the close friends and relatives. The user is carrying a laptop where a 3D virtual model of the city is presented within a blue color. Some images of past events related to the user are hidden in the city, and s/he has to find them. As the user gets closer to the images locations, the environment changes to red color. Once the user arrives to a location, s/he can catch some images that will appear mapped on some of the buildings' facades, thus changing the aspect of the city. The location of the user is achieved with a combination of a GPS and an inertial sensor. The interface is done with the Max/MSP Jitter software.
Automatic detection of the breast border and nipple position on digital mammograms using genetic algorithm for asymmetry approach to detection of microcalcifications
Authors: M. Karnan, K. Thangavel
Venue: Computer Methods and Programs in Biomedicine (2007)

The presence of microcalcifications in breast tissue is one of the most incident signs considered by radiologist for an early diagnosis of breast cancer, which is one of the most common forms of cancer among women. In this paper, the Genetic Algorithm (GA) is proposed for automatic look at commonly prone area the breast border and nipple position to discover the suspicious regions on digital mammograms based on asymmetries between left and right breast image. The basic idea of the asymmetry approach is to scan left and right images are subtracted to extract the suspicious region. The proposed system consists of two steps: First, the mammogram images are enhanced using median filter, normalize the image, at the pectoral muscle region is excluding the border of the mammogram and comparing for both left and right images from the binary image. Further GA is applied to magnify the detected border. The figure of merit is calculated to evaluate whether the detected border is exact or not. And the nipple position is identified using GA. The some comparisons method is adopted for detection of suspected area. Second, using the border points and nipple position as the reference the mammogram images are aligned and subtracted to extract the suspicious region. The algorithms are tested on 114 abnormal digitized mammograms from Mammogram Image Analysis Society database.
A method for generation of GSTE assertion graphs
Authors: E. Smith
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

Generalized symbolic trajectory evaluation (GSTE) is a formal verification technique developed by Intel and used on next-generation microprocessor designs. One of its current drawbacks is that each property must be supplied in the form of a state-transition diagram known as an assertion graph. Assertion graphs are difficult to construct, to read and to reason about because they describe properties at a low level. In this paper, we propose a higher-level property language for GSTE in which we can specify properties as what we call assertion programs. We describe a way of applying weakest precondition calculations to these programs to generate assertion graphs. These can then be supplied to existing GSTE tools for verification. 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