ppxscal/embedding_network huggingface dataset:
An assistant framework for procuring components and code samples
Authors: Kajal T. Claypool
Venue:  (2006)

Software reuse has been targeted as a panacea for reducing software costs and for improving both software quality and programmer productivity. Today, it is accepted practice for software developers to reuse software units, that range from ascii units such as code fragments, to binary units such as functions, modules and even entire application systems, to both guide and reduce their development efforts. These software units are typically bundled with library or framework packages, are available as in-house and off-the-shelf components, or are accessible via books, manuals, web sites, live application code and code that the developer has written previously. Software unit procurement is the first key step of the reuse process at the software implementation stage, and is often broken down into component procurement and code sample procurement based on the two popular types of software units. While tools exist to assist developers in this procurement process, the tools are limited in their capabilities by the type of queries they provide, the efficient matching/mining techniques that underlie the procurement process and the effective ranking techniques used to evaluate the procured units. We broadly classify these limitations as quality of procured units and the effective ranking of the same. This dissertation contributes solutions that address the quality and ranking of retrieved software units. As part of this dissertation, we have developed two assistant frameworks, the XML-based Component Discovery and Evaluation (XCoDE) framework and the XML-based Code Snippet Mining and Ranking (XSnippet) framework for procuring components and code samples, respectively. The XCoDE framework allows developers to query for components based on the component information. Our approach is based on a unique Quality of Match (QoM) metric that qualitatively and quantitatively evaluates the match of two given components. The QoM metric forms the basis for a disciplined application of different matching techniques to all aspects of a component, thereby exploiting the diversity of syntactic and semantic information inherent in a component. Our experiments have shown that XCoDE has significant potential to provide higher accuracy than individual matching techniques and other combination techniques. The XSnippet framework allows developers to query for code samples based on the context of code under development. Our approach is based on a novel graph-based code mining algorithm that supports the range of object instantiation-specific queries, and an innovative context-sensitive ranking heuristic that has been experimentally proven to provide better ranking of best-fit code samples than context-independent heuristics. Our experimental evaluation has shown that XSnippet has significant potential to assist developers, and provides better coverage of tasks and better rankings for best-fit code samples than other code assistant systems.
Musical Instrument Recognizer "Instrogram" and Its Application to Music Retrieval Based on Instrumentation Similarity
Authors: Tetsuro Kitahara, Masataka Goto, Kazunori Komatani, Tetsuya Ogata, Hiroshi G. Okuno
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Instrumentation is an important cue in retrieving musical content. Conventional methods for instrument recognition performing notewise require accurate estimation of the onset time and fundamental frequency (F0) for each note, which is not easy in polyphonic music. This paper presents a non-notewise method for instrument recognition in polyphonic musical audio signals. Instead of such notewise estimation, our method calculates the temporal trajectory of instrument existence probabilities for every F0 and visualizes it as a spectrogram-like graphical representation, called an instrogram. This method can avoid the influence by errors of onset detection and F0 estimation because it does not use them. We also present methods for MPEG- 7-based instrument annotation and music information retrieval based on the similarity between instrograms. Experimental results with realistic music show the average accuracy of 76.2% for the instrument annotation and that the instrogram-based similarity measure represents the actual instrumentation similarity better than an MFCC-based one.
Trace formula and Spectral Riemann Surfaces for a class of tri-diagonal matrices
Authors: Plamen Djakov, Boris Mityagin
Venue: Journal of Approximation Theory (2006)

For tri-diagonal matrices arising in the simplified Jaynes-Cummings model, we give an asymptotics of the eigenvalues, prove a trace formula and show that the Spectral Riemann Surface is irreducible.
Rate allocation for FGS coded video using composite R-D analysis
Authors: Hui Cheng, Y. Q. Shi
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we propose a constant quality rate allocation algorithm for MPEG-4 FGS (fine granularity scalability) coded video sequences. The rate allocation problem is formulated as a constrained minimization of quality fluctuation. The minimization is solved using a novel composite rate distortion analysis. For a set of video frames, a composite rate distortion curve is first computed and then used for computing the optimal rate allocation. The proposed algorithm is very efficient because it is neither iterative nor recursive. In addition, after the composite rate distortion curve is computed, it can be used to calculate optimal rate allocation for any rate budget. Therefore, it is suitable for FGS coded bitstreams, which need to be transmitted and decoded many times at many different rates. Moreover, the composite rate distortion curve can be updated efficiently over sliding windows. This further reduces the computational complexity. Experiments using both synthetic and real FGS coded videos have shown the effectiveness and the efficiency of the proposed algorithm.
Satellite Image Processing Applications in MedioGRID
Authors: Ovidiu Muresan, Florin Pop, Dorian Gorgan, Valentin Cristea
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

This paper presents a high level architectural specification of MedioGRID, a research project aiming at implementing a real-time satellite image processing system for extracting relevant environmental and meteorological parameters on a Grid system. The presentation focuses on the key architectural decisions of the GRIDaware satellite image processing system, highlighting the technologies for each of the major components. An essential part of managing a global Data Grid is a monitoring system that is able to monitor and track all the site facilities, networks, and tasks in progress, all in real time. Considering this issue the paper analyzes the possible grid monitoring approaches, proposes a solution and presents a set of monitoring results for the MedioGRID data management subsystem.
DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling
Authors: Ashiq Anjum, Richard McClatchey, Heinz Stockinger, Arshad Ali, Ian Willers, Michael Thomas, Muhammad Sagheer, Khawar Hasham, Omer Alvi
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The use of meta-schedulers for resource management in large-scale distributed systems often leads to a hierarchy of schedulers. In this paper, we discuss why existing meta-scheduling hierarchies are sometimes not sufficient for Grid systems due to their inability to re-organise jobs already scheduled locally. Such a job re-organisation is required to adapt to evolving loads which are common in heavily used Grid infrastructures. We propose a peer-topeer scheduling model and evaluate it using case studies and mathematical modelling. We detail the DIANA (Data Intensive and Network Aware) scheduling algorithm and its queue management system for coping with the load distribution and for supporting bulk job scheduling. We demonstrate that such a system is beneficial for dynamic, distributed and self-organizing resource management and can assist in optimizing load or job distribution in complex Grid infrastructures.
How to Orientate Arcs in a Bayesian Network Based Student Model?
Authors: Mathieu Hibou, Jean-Marc Labat
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Bayesian networks have been successfully used for student modeling in many systems. In this paper we address the problem of Bayesian network structure construction and more particularly that of arc orientation. We think that, in the case of cognitive task modeling, the traditional causal interpretation of arc orientation is not adequate. Instead, we use the information flow to provide a systematic a priori analysis of the conditional dependencies between variables. Finally, we explain why we think that different Bayesian networks should be taken into account and how this could be done.
Voronoi Diagram and Delaunay Triangulation: Applications and Challenges in Bioinformatics
Authors: Binhai Zhu
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

In this talk, I first cover the applications of Voronoi Diagram and Delaunay Triangulation based on my personal experience. On the successful part, I will cover the history and development of the Jump-and-Walk algorithm, which is known as the first sublinear geometric algorithm nowadays and has been used in several famous software packages. On the bioinformatics applications, I will focus on three challenges: (1) contour interpolation, (2) protein folding, and (3) protein local structure alignment. I think that Voronoi Diagram and Delaunay Triangulation can play important roles in handling these problems.
Model compression
Authors: Cristian Buciluǎ, Rich Caruana, Alexandru Niculescu-Mizil
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classifiers, and the time required to execute them at run-time, prohibits their use in applications where test sets are large (e.g. Google), where storage space is at a premium (e.g. PDAs), and where computational power is limited (e.g. hea-ring aids). We present a method for "compressing" large, complex ensembles into smaller, faster models, usually without significant loss in performance.
Toward a Pragmatic Taxonomy of Knowledge Maps: Classification Principles, Sample Typologies, and Application Examples
Authors: Martin J. Eppler
Venue: Proceedings of the conference on Information Visualization (2006)

This paper discusses pragmatic ways of classifying knowledge maps to give an overview of their application formats and contexts. We show where and how the term knowledge map has been previously used and what criteria must be met in a sound and useful knowledge map classification. Various possible classification principles are presented. A table matches map formats to purposes and contents to serve as a selection framework in knowledge management processes. Examples of some of the main types of knowledge maps are presented to illustrate the varieties of knowledge mapping present in the classifications. The article concludes by discussing its limitations and future research questions.
A Semi-Automatic Tool using Ontology to Extract Learning Objects
Authors: Bich-Lien Doan, Yolaine Bourda, Vasile Dumitrascu
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The approach presented in this paper is intended for the semi-automatic construction of a learning object repository from HTML pages. An extraction method consists of applying the extraction patterns defined in a configuration file, and using a pre-defined ontology, tries also to discover partially matched objects and to assign them proper tags conformed to an XML schema.
On the Execution of Collaborative Business Processes
Authors: Belinda M. Carter, Maria E. Orlowska
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Management of collaborative business processes that span multiple business entities has emerged as a key requirement for business success. These processes are embedded in sets of rules describing complex message-based interactions between parties such that if a logical expression defined on the set of received messages is satisfied, one or more outgoing messages are dispatched. The execution of these processes presents significant challenges since each contentrich message may contribute towards the evaluation of multiple expressions in different ways and the sequence of message arrival cannot be predicted. These challenges must be overcome in order to develop an efficient execution strategy for collaborative processes in an intensive operating environment with a large number of rules and very high throughput of messages. In this paper, we present a discussion on issues relevant to the evaluation of such expressions and describe a basic query-based method for this purpose, including suggested indexes for improved performance. We conclude by identifying several potential future research directions in this area.
A large deviations perspective on ordinal optimization
Authors: Peter Glynn, Sandeep Juneja
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studied in the literature in an approximate mathematical framework under the assumption that the underlying random variables have a Gaussian distribution. We use the large deviations theory to develop a mathematically rigorous framework for determining the optimal allocation of computing resources even when the underlying variables have general, non-Gaussian distributions. Further, in a simple setting we show that when there exists an indifference zone, quick stopping rules may be developed that exploit the exponential decay rates of the probability of false selection. In practice, the distributions of the underlying variables are estimated from generated samples leading to performance degradation due to estimation errors. On a positive note, we show that the corresponding estimates of optimal allocations converge to their true values as the number of samples used for estimation increases to infinity.
Efficient adaptive collect using randomization
Authors: Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer
Venue: Distributed Computing (2006)

An adaptive algorithm, whose step complexity adjusts to the number of active processes, is attractive for distributed systems with a highly-variable number of processes. The cornerstone of many adaptive algorithms is an adaptive mechanism to collect up-to-date information from all participating processes. To date, all known collect algorithms either have non-linear step complexity or they are impractical because of unrealistic memory overhead.This paper presents new randomized collect algorithms with asymptotically optimal O(k) step complexity and linear memory overhead only. In addition we present a new deterministic collect algorithm that beats the best step complexity for previous polynomial-memory algorithms.
Cybercrimes against Consumers: Could Biometric Technology Be the Solution?
Authors: Juline E. Mills, Sookeun Byun
Venue: IEEE Internet Computing (2006)

Although information technology's positive impacts on businesses and individuals are substantial, cybercrime continues to represent one of the greatest threats in the digital world. Advances in biometric technology's capabilities hold promise for solving this problem by offering users greater protection, but more legislative and social-policy work is needed to help realize the technology's full potential. In the near term, however, organizations can begin by incorporating users' security and privacy concerns into their biometric policies in terms of data collection, storage, access, and use.
Slope rotatability over all directions with correlated errors: Research Articles
Authors: Rabindra Nath Das, Sung H. Park
Venue: Applied Stochastic Models in Business and Industry (2006)

Das (Calcutta Statist. Assoc. Bull. 2003; 54:57&ndash;70) initiated a study of slope rotatability over axial directions with correlated errors. General conditions for second-order slope rotatability over axial directions were derived when errors have a general correlated error structure.In this paper, a class of multifactor designs for estimating the slope of second-order response surfaces is considered when errors in observations are correlated. General conditions for second-order slope rotatability over all directions have been derived assuming that errors in observations have a general correlated error structure. It has been derived that robust second-order rotatable designs are also robust slope rotatable over all directions. The class of robust slope-rotatable designs over all directions has been examined when errors in observations have the following variance&ndash;covariance structures: intra-class, inter-class, compound symmetry, tri-diagonal and autocorrelated structure. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Efficient genetic algorithm design for power-of-two FIR filters
Authors: P. Gentili, F. Piazza, A. Uncini
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

This paper presents an efficient genetic approach to the design of digital finite impulse response (FIR) filters with coefficients constrained to be sums of power-of-two terms. To obtain such efficiency, i.e. a reduction of computational costs and an improvement in performance, a specific filter coefficient coding scheme has been studied and implemented. The resulting genetic algorithm (GA) is explained and compared experimentally with other state-of-the-art design techniques on several power-of-two FIR filter design cases. It can be seen that the proposed genetic technique is able to attain results as good as or better than the other methods. Moreover it can be easily implemented on parallel hardware.
Simulation of multiple-drift tunnel construction with limited resources
Authors: Photios G. Ioannou, Veerasak Likhitruangsilp
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Construction work is often performed with limited resources. The optimal dynamic allocation of resources at simulation runtime sometimes requires that non-critical tasks be held back deliberately and not be allowed to start so that resources will be available to perform more critical activities later. This is an important issue that has escaped rigorous investigation. For certain projects it may be more expedient to model work at the activity level and not the resource level and embed the routing of resources into precedence relationships. The Hanging Lake Tunneling Project is presented as an example where the estimation of tunnel advance rates for all tunneling alternatives is performed at the activity level and where the allocation of limited resources is encapsulated in tunneling plans particular to the tunneling alternative being analyzed.
Computers Play Chess; Humans Play Go
Authors: James Hendler
Venue: IEEE Intelligent Systems (2006)

The future of AI must involve exploring and understanding the parts of human intelligence we haven'tbeen looking at that much--the stuff at the heart of human thought. To do this, we need to stop looking fornew ways to solve well-defined problems and start looking for ways to combine the things we know how to do,and then see if this helps us explore problems with more diversity and scope.
Exposing digital forgeries in video by detecting double MPEG compression
Authors: Weihong Wang, Hany Farid
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

With the advent of sophisticated and low-cost video editing software, it is becoming increasingly easier to tamper with digital video. In addition,an ever-growing number of video surveillance cameras is giving rise to an enormous amount of video data. The ability to ensure the integrity and authenticity of this data poses considerable challenges. Here we begin to explore techniques for detecting traces of tampering in digital video. Specifically, we show how a doublycompressed MPEG video sequence introduces specific static and temporal statistical perturbations whose presence can be used as evidence of tampering.
Communicating with Synchronized Environments
Authors: Tiberiu Seceleanu, Axel Jantsch
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

In the modern design environments, different modules, available in existent libraries, may obey different architectural styles and execution models. Reaching a well- behaved composition of such modules is a very important task of the system designer. In the framework of the action systems formalism, we analyze the co-existence of two models of execution, one synchronized, the other, interleaved. We devise a communication scheme, similar to the classical paradigm of polling, which allows us to model synchronized components that correctly exchange information, within the borders of a global system, with their non-synchronized partners. Derivations of such mechanisms follow specific correctness rules for refinement. We illustrate our methods on an audio system example, implementable as either a software or a hardware device.
Feature analysis for architectural evaluation methods
Authors: A. Grimán, M. Pérez, L. Mendoza, F. Losavio
Venue: Journal of Systems and Software (2006)

Given the complexity of today's software systems, Software Architecture is a topic that has recently increased in significance. It is consider as a key element in the design and development of systems and has the ability to promote/punish some quality characteristics. Quality is related mainly to the non-functional requirements expected of the system. Using appropriate methods for Architectural Evaluation can help to reduce the risk of low quality Architecture. The objective of this research is to conduct a Features Analysis for three Architectural Evaluation Methods applied to a single case. This resulted in two significant contributions; the aspects which must be present in an architectural evaluation method which is translated in a set of 49 metrics, grouped into features and sub-features to enable the evaluation of a particular method. Different methods can be compared on the basis of these features; however, the choice of method will depend largely on the requirements of the evaluating team. The second contribution pinpoints the strengths of the methods evaluated. The methods studied were: Design and Use of Software Architectures, Architecture Tradeoff Analysis Method, and Architectural Evaluation Method. The evaluation method employed for this research was Features Analysis Case Study.