ppxscal/embedding_network huggingface dataset:
A Dynamic Programming Approach to Adaptive Tatum Assignment for Rhythm Transcription
Authors: Aaron C. Yang, Elaine Chew, Anja Volk
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

We present a method for segmenting music with different grid levels in order to properly quantize note values in the transcription of music. This method can be used in automatic music transcription systems and music information retrieval systems to reduce a performance of a music piece to the printed or digital score. The system will take only the onset data of performed music from either MIDI or audio, and determine the best maximal grid level onto which to fit the note onsets. This maximal grid level, or tatum, is allowed to vary from section to section in a piece. We obtain the optimal segmentation of the piece using dynamic programming. We present results from an audio based performance of Milhaud's Botafogo, as well as several MIDI performances of the Rondo- Allegro from Beethoven's Pathetique. The results show a reduction of error compared to quantization based only on one global metric level, and promises to create rhythm transcriptions that are parsimonious and readable.
Auto-Calibration of a Compound-Type Omnidirectional Camera
Authors: Hongdong Li, Richard Hartley, Lei Wang
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

We propose a method for auto-calibrating a compound-type omnidirectional camera (system). This camera produces spherical panoramic image through stitching some individual images captured by several modular cameras, each of which covers a different field of view of the full viewing sphere. By auto-calibration we mean that our algorithm works online in a self-calibration manner: it receives as input image point correspondences only, and outputs all the camera parameters. The calibration task consists of lens-distortion-removal, intrinsic-calibration, and relative-orientation. The focus of the paper is an algorithm for automatically removing lens distortion. By exploiting planar projective invariants, our algorithm is capable of estimating centre-of-distortion and distortion parameters efficientlywithout using any nonlinear iteration.
Random deviates from the DIPOLE distribution
Authors: Robert E. Knop
Venue: ACM SIGSIM Simulation Digest (1976)

The function subprogram DIPOLE, written by Robert E. Knop of the Physics Department, The Florida State University at Tallahassee FL 32306, returns a random deviate -&infin; < z < &infin; sampled from the two parameters (R2 < 1, &alpha; arbitrary) family of the density function: f(z) = 1/(&pi; (1+ z2)) + R2 * ((1 - z2) * cos(2&alpha;) + 2* z* sin(2&alpha;) / (&pi; * (1+z2)2). 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
A Grid Environment for Data Integration of Scientific Databases
Authors: Hideo Matsuda
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Effective integration of heterogeneous data sources has been studied as the most pressing challenge in various fields; such as, high energy physics, astronomy, and life sciences. In this talk, we present a data integration system by using Globus Toolkit with OGSA-DAI. For associating related data among many databases, we have introduced metadata based on their domain ontologies. Using the system one can make a database access flow for describing a set of queries as a workflow, and can query across the databases without aware of their locations and schemas.
Semi-supervised graph clustering: a kernel approach
Authors: Brian Kulis, Sugato Basu, Inderjit Dhillon, Raymond Mooney
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are natural for graphs, yet most semi-supervised clustering algorithms are designed for data represented as vectors. In this paper, we unify vector-based and graph-based approaches. We show that a recently-proposed objective function for semi-supervised clustering based on Hidden Markov Random Fields, with squared Euclidean distance and a certain class of constraint penalty functions, can be expressed as a special case of the weighted kernel k-means objective. A recent theoretical connection between kernel k-means and several graph clustering objectives enables us to perform semi-supervised clustering of data given either as vectors or as a graph. For vector data, the kernel approach also enables us to find clusters with non-linear boundaries in the input data space. Furthermore, we show that recent work on spectral learning (Kamvar et al., 2003) may be viewed as a special case of our formulation. We empirically show that our algorithm is able to outperform current state-of-the-art semi-supervised algorithms on both vector-based and graph-based data sets.
Enabling security, privacy, and transparency in an on dand world
Authors: Michael R. Nelson
Venue: Proceedings of the 2005 workshop on Secure web services (2005)

The deployment of gigabit-per-second networks; the development of Grid computing, peer-to-peer applications, and Web services; the spread of wireless networks and pervasive computing; the development of autonomic, self-monitoring systs; and the adoption of open standards that enable tighter integration of IT systs and business processes within companies and across companies are ushering in the new paradigm of open standards-based, distributed computing. Companies will be able to integrate their corporate IT systs into grids, making it far easier to move data within the company and fostering collaboration between ployees. In time, it is likely that companies and organizations will link their networked systs with those of business partners and with "utility grids" and data centers run by third parties. One barrier to the adoption of this model is that customers may doubt that their personal data can be protected when it is moving between multiple servers and storage systs scattered across the country or even around the world. In Canada and other countries this is becoming a serious policy issue and there have been proposals to ban out-of-country outsourcing of government IT services.In this changing landscape, today's privacy solutions whether technologies, services, or regulations will be unable to meet the needs of either individuals or corporations. Entirely new classes of products and services are badly needed. The paper explores new types of privacy-enhancing technologies to address ployees' and customers' privacy concerns. Some questions to be examined by this talk include: How will privacy and expectations of privacy change where distributed computing is commonplace?How can privacy and transparency be built into distributed computing systs?What can governments do to protect privacy without inhibiting the growth of distributed computing (e.g. virtualization, Web services, Grid computing, peer-to-peer applications)? 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
A 2.3GHz CMOS Transimpedance Preamplifier for Optical Communication
Authors: Yanjie Wang, Kris Iniewski
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

A 2.3GHz transimpedance preamplifier designed in a TSMC 0.18µm CMOS technology for optical communication is presented. A wide-swing cascode (WSC) topology provides high transimpedance gain, wide bandwidth, large output voltage swing, low input impedance and low power consumption. The SpectreS simulations show a transimpedance gain of 1.12K. (61dB.), 3-dB bandwidth of 2.3GHz, low input impedance (
Numerical Software Quality Control in Object Oriented Development
Authors: Tsuneo Yamaura, Akira K. Onoma
Venue: Proceedings of the IEEE International Workshop (2005)

This paper proposes new method to predict the number of the remaining bugs at the delivery inspection applied to every iteration of OOD, Object Oriented Development. Our method consists of two parts. The first one estimates the number of the remaining bugs by applying the Gompertz curve. The second one uses the interval estimation called OOQP, Object Oriented Quality Probe. The basic idea of OOQP is to randomly extract a relatively small number of test cases, usually 10 to 20% of the entire test cases, and to execute them in the actual operation environment. From the test result of OOQP, we can efficiently predict the number of the remaining bugs by the interval estimation. The premier problem of OOQP is that OOD is imposed to use the system design specification document whose contents, like UML, tend to be ambiguous. Our estimation method will work well at a matrix-typed organization where a QA team and a development team collaboratively work together to improve the software quality.
Automated generation of testing tools for domain-specific languages
Authors: Hui Wu, Jeff Gray
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Domain-specific languages (DSLs) assist a domain expert (or end-user) in writing a software program using idioms that are closer to the abstractions found in a specific problem domain. Language tool support for DSLs is lacking, however, when compared to the capabilities provided for standard general purpose languages (e.g., Java and C++). For example, support for debugging and testing a program written in a DSL is often nonexistent. A DSL grammar serves as the primary artifact for defining DSLs from a higher level of abstraction. This paper describes an investigation into a grammar-driven technique to build a testing tool from existing DSL grammars. The DSL grammars are used to generate the hooks needed to interface with a supporting infrastructure written for an Integrated Development Environment (IDE) that assists in debugging and testing a program written in a DSL. We describe a DSL framework that we have implemented to generate DSL testing tools (e.g., debugger and test engine). This framework demonstrates the feasibility and applicability of using the information derived from DSL grammars and existing software components and services to support end-user debugging and testing in a domain friendly programming environment.
Automatic generation of personalized human avatars from multi-view video
Authors: Naveed Ahmed, Edilson de Aguiar, Christian Theobalt, Marcus Magnor, Hans-Peter Seidel
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

In multi-user virtual environments real-world people interact via digital avatars. In order to make the step from the real world onto the virtual stage convincing the digital equivalent of the user has to be personalized. It should reflect the shape and proportions, the kinematic properties, as well as the textural appearance of its real-world equivalent. In this paper, we present a novel spatio-temporal approach to create a personalized avatar from multi-view video data of a moving person. The avatar's geometry is generated by shape-adapting a template human body model. Its surface texture is assembled from multi-view video frames showing arbitrary different body poses. consistent surface texture for the model is generated using multi-view video frames from different camera views and different body poses. With our proposed method photo-realistic human avatars can be robustly generated.
Reconfiguration Algorithms for Power Efficient VLSI Subarrays with Four-Port Switches
Authors: Wu Jigang Thambipillai Srikanthan
Venue: IEEE Transactions on Computers (2006)

Techniques to determine subarrays when processing elements of VLSI arrays become faulty have been investigated extensively. These tend to identify the largest subarray that is possible without concentrating on the power efficiency of the resulting subarray. In this paper, we propose new techniques, based on heuristic strategy and dynamic programming, to minimize the interconnect length in an attempt to reduce power dissipation without performance penalty. Our algorithms show that notable improvements in the reduction of the number of long interconnects could be realized in linear time and without sacrificing the size of the subarray. Our evaluations show that, for a VLSI array of size 256 \times 256, the number of long interconnects in the subarray can be reduced by up to 95 percent for clustered faults and up to 50 percent and 73 percent for a random fault with density of 10 percent and 0.1 percent, respectively, when compared with the most efficient implementation cited in the literature. The interconnect power saving for a VLSI array of size 512\times 512 is by up to 11 percent for a random fault. We have also shown that interconnect power savings of up to 14 percent are possible for the cases investigated. Simulations based on several random and clustered fault scenarios clearly reveal the superiority of the proposed techniques for power efficient realizations. In addition, the lower bound of the performance has been proposed to demonstrate that the proposed algorithms are nearly optimal for the cases considered in this paper.
The Relation between the ROC Curve and the CMC
Authors: R. M. Bolle, J. H. Connell, S. Pankanti, N. K. Ratha, A. W. Senior
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

The Cumulative Match Curve (CMC) is used as a measure of 1:m identification system performance. It judges the ranking capabilities of an identification system. The Receiver Operating Characteristic curve (ROC curve) of a verification system, on the other hand, expresses the quality of a 1:1 matcher. The ROC plots the False Accept Rate (FAR) of a 1:1 matcher versus the False Reject Rate (FRR) of the matcher. We show that the CMC is also related to the FAR and FRR of a 1:1 matcher, i.e., the matcher that is used to rank the candidates by sorting the scores. This has as a consequence that when a 1:1 matcher is used for identification, that is, for sorting match scores from high to low, the CMC does not offer any additional information beyond the FAR and FRR curves. The CMC is just another way of displaying the data and can be computed from the FAR and FRR.
Criterion functions for document clustering
Authors: George Karypis, Ding-Zhu Du
Venue:  (2005)

Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In this thesis, we focus on a class of clustering algorithms that treat the clustering problem as an optimization process which seeks to maximize or minimize a particular clustering criterion function defined over the entire clustering solution. In this thesis, we present a comprehensive study on desirable characteristics and feasibility of various criterion functions under different clustering requirements raised by real world applications. In particular, we focus on seven global criterion functions for clustering large documents datasets, three of which are introduced by us. The first part of this thesis consists of a detailed experimental evaluation using 15 different datasets and three different partitional clustering approaches, followed by a theoretical analysis of the characteristics of the various criterion functions. Our analysis shows that the criterion functions that are more robust to the difference of cluster tightness and produce more balanced clusters tend to perform well. Our three new criterion functions are among the ones achieving the best overall results. We further discuss how the various criterion functions perform to produce hierarchical and soft clustering solutions. We present a comprehensive experimental evaluation of six partitional and nine agglomerative hierarchical clustering methods using twelve datasets. A new class of agglomerative algorithms, constrained agglomerative algorithm, is also proposed and achieves the best results. We also focus on four criterion functions, derive their soft-clustering extensions, present a comprehensive experimental evaluation involving twelve different datasets, and analyze their overall characteristics. Finally, we extend the various criterion functions to incorporate prior knowledge on natural topics existing in datasets. Specifically, we define the problem of topic-driven clustering, which organizes a document collection according to a given set of topics. We propose three topic-driven schemes that consider the similarity between documents and topics and the relationship among documents themselves simultaneously. Our experimental results show that the proposed topic-driven schemes are efficient and effective with topic prototypes of different levels of specificity.
A similarity-aware approach to testing based fault localization
Authors: Dan Hao, Ying Pan, Lu Zhang, Wei Zhao, Hong Mei, Jiasu Sun
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Debugging is a time-consuming task in software development and maintenance. To accelerate this task, several approaches have been proposed to automate fault localization. In particular, testing based fault localization (TBFL), which utilizes the testing information to localize the faults, seem to be very promising. However, the similarity between test cases in the test suite has been ignored in the research on TBFL. In this paper, we investigate this similarity issue and propose a novel approach named similarity-aware fault localization (SAFL), which can calculate the suspicion probability of each statement with little impact by the similarity issue. To address and deal with the similarity between test cases, SAFL applies the theory of fuzzy sets to remove the uneven distribution of the test cases. We also performed an experimental study for two real-world programs at different size levels to evaluate SAFL together with another two approaches to TBFL. Experimental results show that SAFL is more effective than the other two approaches when the test suites contain injected redundancy, and SAFL can achieve a competitive result with normal test suites. SAFL can also be more effective than applying test suite reduction to current approaches to TBFL.
Modelling mobile health systems: an application of augmented MDA for the extended healthcare enterprise.
Authors: Val Jones, Arend Rensink, Ed Brinksma
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

Mobile health systems can extend the enterprise computing system of the healthcare provider by bringing services to the patient any time and anywhere. We propose a model-driven design and development methodology for the development of the m-health components in such extended enterprise computing systems. The methodology applies a model-driven design and development approach augmented with formal validation and verification to address quality and correctness and to support model transformation. Recent work on modelling applications from the healthcare domain is reported. One objective of this work is to explore and elaborate the proposed methodology. At the University of Twente we are developing m-health systems based on Body Area Networks (BANs). One specialization of the generic BAN is the health BAN, which incorporates a set of devices and associated software components to provide some set of health-related services. A patient will have a personalized instance of the health BAN customized to their current set of needs. A health professional interacts with their patients¿ BANs via a BAN Professional System. The set of deployed BANs are supported by a server. We refer to this distributed system as the BAN System. The BAN system extends the enterprise computing system of the healthcare provider. Development of such systems requires a sound software engineering approach and this is what we explore with the new methodology. The methodology is illustrated with reference recent modelling activities targeted at real implementations. In the context of the Awareness project BAN implementations will be trialled in number of clinical settings including epilepsy management and management of chronic pain.
Validation of Embedded Systems Using Formal Method Aided Simulation
Authors: Daniel Karlson, Petru Eles, Zebo Peng
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper proposes a validation approach, based on simulation, which addresses problems related to both state space explosion of formal methods and low coverage of infor- mal method. Formal methods, in particular model checking, are used to aid the simulation process in certain situations in order to boost coverage. The invocation frequency of the model checker is dynamically controlled by estimating certain parameters, based on statistics collected previously during the same validation session, in order to minimise verefication time and at the same time achieve reasonable coverage. The approach has been demonstrated feasible by numerous ex- perimental results.
Identification of Optimized Diagnostic Features of Multi-Stage Gearbox Condition
Authors: Walter Bartelmus, Radoslaw Zimroz, Harish Batra
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The occurrence of many gearbox faults simultaneously and possibilities of their identification on the basis of vibration symptoms is not a topic of research work in the literature. The authors of this research are concentrated on identification of a single type of fault on the basis of a single symptom. This paper presents the research work on selection of diagnostic features during gearbox degradation when many faults occur simultaneously. The paper presents the problem of choosing the signal receiving points. In the result of collected signal at many points we obtain a multidimensional matrix from which a point is to be selected for which we get the best distribution of symptoms for the particular faults. In these types of problems we try to find out the answer to the following questions: Which symptoms give the better results for classification of different faults at simultaneous different faults occurrence? For which signal receiving point good/bad technical state classes separateability is the highest? Is it possible to reduce symptoms matrix?
Sharp interface Cartesian grid method III: Solidification of pure materials and binary solutions
Authors: Yi Yang, H. S. Udaykumar
Venue: Journal of Computational Physics (2005)

A numerical technique is presented for computing dendritic growth of crystals from pure melts and binary solutions. The governing equations are solved on a fixed Cartesian mesh and the immersed phase boundary is treated as a sharp solid-fluid interface. The interface is tracked using a level-set field. A finite-difference scheme is presented that incorporates the immersed phase boundary with only a small change to a standard Cartesian grid Poisson solver. The scheme is simple to implement in three-dimensions. The results from our calculations show excellent agreement with two-dimensional microscopic solvability theory for pure material solidification. It is shown that the method predicts dendrite tip characteristics in excellent agreement with the theory. The sharp interface treatment allows discontinuous material property variation at the solid-liquid interface. This facilitates sharp-interface simulations of dendritic solidification of binary solutions.