ppxscal/embedding_network huggingface dataset:
Robust temporal and spectral modeling for query By melody
Authors: Shai Shalev-Shwartz, Shlomo Dubnov, Nir Friedman, Yoram Singer
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

Query by melody is the problem of retrieving musical performances from melodies. Retrieval of real performances is complicated due to the large number of variations in performing a melody and the presence of colored accompaniment noise. We describe a simple yet effective probabilistic model for this task. We describe a generative model that is rich enough to capture the spectral and temporal variations of musical performances and allows for tractable melody retrieval. While most of previous studies on music retrieval from melodies were performed with either symbolic (e.g. MIDI) data or with monophonic (single instrument) performances, we performed experiments in retrieving live and studio recordings of operas that contain a leading vocalist and rich instrumental accompaniment. Our results show that the probabilistic approach we propose is effective and can be scaled to massive datasets.
Learn QuickBooks 6 in a Weekend
Authors: Katherine Murray, Prima Development
Venue:  (1998)

:With Learn Quickbooks In a Weekend, small business owners can revolutionize their financial lives in a just a couple of days. Written in an entertaining manner, this book aids in business accounting, estimating, online banking, and much more. All it takes is just one weekend.
Constructing Intelligent Agents with Java: A Programmer's Guide to Smarter Applications
Authors: Joseph P. Bigus, Jennifer Bigus
Venue:  (1997)

:The authors explain the principles of AI program design using Java's object-oriented features and present the essential AI algorithms used to develop agents that reason, model, and learn to adapt to the world around them. They then show how to apply these algorithms and techniques in practical "real-world" distributed computing applications. They develop an intelligent agent architecture and use it to construct several agent-enhanced programs, including a PC management agent, an adaptive Internet news reader that filters articles based on user preferences, and an electronic marketplace application where agents do the buying and selling.
Internet for Dummies Quick Reference, 4th edition
Authors: John Levine, Margaret Levine Young, Arnold Reinhold
Venue:  (1998)

:The Internet empowers you to do so many things that you'll wonder how your ever lived without it. But the Net can be bewildering at times, with its strange commands, obscure messages, and dozens of choices of programs and services. The Internet For Dummies Quick Reference, 4th Edition, offers plain-English explanations as it guides you through the Internet with helpful tips and examples. A complete index and glossary enable you to find just the information you need -- fast. Owning a copy of this compact, easy-to-use reference is like having a team of Internet experts right in your pocket -- and it lies flat on your desk without squirming! Look for IDG Books Worldwide's The Internet For Dummies&reg;, 5th Edition, the fast and friendly way to find out how to navigate the Net!
Super Searchers Cover the World: The Online Secrets of International Business Researchers
Authors: Mary Ellen Bates
Venue:  (2001)

:As the ubiquity of the Internet has fostered more interest in business outside the United States, the need for companies to see their market and competitive environment in a global perspective has forced more businesses to think internationally. This book asks the experts to reveal their strategies for finding international business information on the Web. Through a collection of 15 interviews with expert online researchers, exploration of the specific challenges of reaching outside a researchers geographic area and expertise is detailed. In-country experts from around the world such as librarians and researchers from government organizations, multinational companies, universities, and small businesses discuss issues such as non-native language sources, cultural bias, and judging reliability of unfamiliar sources. Interviewees are from countries such as the United States, United Kingdom, Japan, China, Italy, Argentina, Mexico, and The Netherlands.Author Biography: Mary Ellen Bates is a principal of Bates Information Services, an information brokerage, and the author of Mining for Gold on the Internet and Researching Online for Dummies. She lives in Washington, D.C.
Advantage Series: Microsoft Excel 2000 Brief Edition, 1st edition
Authors: Sarah Hutchinson-Clifford, Glen J. Coulthard
Venue:  (1999)

:The Advantage Series presents the Why,What and How of computer application skills to today's students. Each lab in this series is built upon an efficient learning model,which provides students and faculty with complete coverage and enhances critical thinking skills.
Updateable simulation of communication networks
Authors: Steve L. Ferenci, Richard M. Fujimoto, Mostafa H. Ammar, Kalyan Perumalla, George F. Riley
Venue: Proceedings of the sixteenth workshop on Parallel and distributed simulation (2002)

A technique called updateable simulations is proposed to reduce the time to complete multiple executions of a discrete event simulation program. This technique updates the results of a prior simulation run rather than re-execute the entire simulation to take into account variations in the underlying simulation model. A framework for creating updateable simulations is presented. This framework is applied to the problem of simulating a set of cascaded ATM multiplexers and a network of ATM switches. Performance measurements of sequential and parallel implementations of these simulations on a shared memory multiprocessor are presented, demonstrating that updateable simulations can yield substantial reductions in the time required to complete multiple simulation runs if there is much similarity among the runs.
A hybrid graphical model for rhythmic parsing
Authors: Christopher Raphael
Venue: Artificial Intelligence (2002)

A method is presented for the rhythmic parsing problem: Given a sequence of observed musical note onset times, we simultaneously estimate the corresponding notated rhythm and tempo process. A graphical model is developed that represents the evolution of tempo and rhythm and relates these hidden quantities to an observable performance. The rhythm variables are discrete and the tempo and observation variables are continuous. We show how to compute the globally most likely configuration of the tempo and rhythm variables given an observation of note onset times. Experiments are presented on both MIDI data and a data set derived from an audio signal. A generalization to computing MAP estimates for arbitrary conditional Gaussian distributions is outlined.
E-Leader: Reinventing Leadership in a Connected Economy
Authors: Robert Hargrove
Venue:  (2000)

:How the dynamics of the connected economy are transforming the roles and rules of leadership.To be sure, the Internet has permeated every aspect of business todayfrom customer service to supply chain management, from recruitment to product development. Regardless of the dot.com fallout, the dynamics of the "connected economy" are transforming the practice and philosophy of leadership. In E-Leader, Robert Hargrove identifies the new mindset and skills that leaders must develop in order to thrive in a world where wealth is built on relationships and experiences, not products or even technology, and shows aspiring leaders in all types of organizations how to manage for the future. Author Biography: Robert Hargrove is founder and co-CEO of Masterful Coaching, Inc. An expert on organizational collaboration, coaching, and leadership, he consults worldwide and speaks and writes regularly on these issues. He lives in Brookline, Massachusetts. 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
Determination of geometrical invariants of rationally parametrized conic sections
Authors: Gudrun Albrecht
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

We address the problem of finding geometrical invariant , such as foci, axes, center and vertices of an non-degenerate conic section. Uniquely from its rational quadratic parameterization, i.e., without knowing its implicit representation. The main idea, namely the determination of the conic foci. Is based on the projective definition of the foci of a non-degenerate conic sections.
Applied Neural Networks For Signal Processing
Authors: Fa-Long Luo, Rolf Unbehauen
Venue:  (1999)

:This book begins by covering the basic principles and models of neural networks in signal processing. The authors then discuss a number of powerful algorithms and architectures for a range of important problems, and describe practical implementation procedures. A key feature of the book is that many carefully designed simulation examples are included to help guide the reader in the development of systems for new applications. The book will be an invaluable reference for scientists and engineers working in communications, control or any other field related to signal processing.
Computing minimum spanning trees efficiently
Authors: A. Kershenbaum, R. Van Slyke
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

A ubiquitous problem in mathematical programming is the calculation of minimum spanning trees. Minimum spanning tree algorithms find application in such diverse areas as: least cost electrical wiring, minimum cost connecting communication and transportation networks, network reliability problems, minimum stress networks, clustering and numerical taxonomy, algorithms for solving traveling salesman problems, and multiterminal network flows. It is therefore important to know how to carry out these computations as efficiently as possible.The problem is to find a spanning subtree of a given connected network which has minimum total length. Kruskal in 1956 showed that a "greedy" algorithm could be used; that is, if one looks at arcs in order of increasing length the first tree that can be formed is a minimum spanning tree. Shortly thereafter Prim and Dijkstra suggested another algorithm which appeared to be more efficient. Recent work suggests that a suitable implementation of Kruskal's Algorithm is computationally more efficient in a number of interesting cases, in particular when the network under consideration is sparse.A modification of Kruskal's Algorithm for the solution to the MST problem is presented and is compared with Prim's Algorithm. Prim's Algorithm is shown to have an upper bound on the number of calculations on the order of NN2, when applied to a network with NN nodes, regardless of the number of arcs in the network. The modification of Kruskal's Algorithm is shown to have an upper bound on the order of NA log2 NA calculations, where NA is the number of arcs in the network. Thus for sparse networks a dramatic reduction in execution time can be obtained by the use of Kruskal's Algorithm. The effect is enhanced by the fact that Prim's Algorithm achieves its upper bound while the Kruskal modification, in general, does not. Modifications to both Prim's and Kruskal's Algorithms are introduced which give significant improvements for the complete range of sparseness.The relative merit of each algorithm is a function of sparseness of the network, the form in which the problem data is represented, the tradeoff between computation speed and storage requirements, the amount of time one wants to spend in coding, as well as many other factors. The interaction of these factors in choosing the appropriate algorithms for important classes of applications will be discussed in detail.
Lifting results for categories of algebras
Authors: P. S. Mulry
Venue: Theoretical Computer Science (2002)

In this paper, we present results that provide an abstract setting for the construction and interpretation of categories of algebras appearing in various semantic examples including those related to Scott domains and cartesian closed categories. A methodology is introduced that lifts adjoint pairs on categories with monads to categories whose objects are algebras for these monads. Results are achieved by exploiting prior work on Kleisli liftings and the existence of key isomorphisms. While applicable to domain theory and the semantics of partiality, the construction at work is considerably more general and is applicable to other settings as well.
Bridging the digital divide in South Africa
Authors: Linda Martindale
Venue: Linux Journal (2002)

When you have to localize both Mozilla and OpenOffice, do you have to teach your translators two sets of tools? No--just use KDE's KBabel.
A+: Windows /DOS Study Guide, 1st edition
Authors: David Groth, Doug Robert
Venue:  (1998)

:Here's your ticket to acing the A+ Windows/DOS Module, the more popular of the two electives for the A+ hardware and support certification organized by the Computing Technology Industry Association (CompTIA). This CompTIA-approved study guide provides comprehensive coverage of each A+ objective, together with practical exercises and reference information. Covers the current A+ Windows/DOS exam and the forthcoming Windows 95 update of the A+ Windows/DOS exam.
Window frames as areas for information visualization
Authors: Staffan Björk, Johan Redström
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

We describe how the frames of document windows can be used as areas for visualizing information about a document. A number of design examples are presented as illustrations of how users can be supported with contextual information about a document in a way that does not interfere with the visual presentation of the document itself. A ChangeIndicator is used as an example of how information can be mapped to basic design variables of a frame, such as its color. More complex visualizations can be achieved by mapping information about parts of documents to parts or details of the frame. This is illustrated with a Readability-Viewer. Finally, the ScrollSearcher is presented as an example of how the results of processes and functions can be visualized in the frames of a document.
Free Stuff for Quilters on the Internet, 2nd edition
Authors: Judy Heim, Gloria Hansen
Venue:  (1999)

:This edition has more than 150 updated and new links to Web sites offering free quilt patterns, information on fabric dyeing, painting, stamping, and photo transferring, plus discussion groups, guilds, organizations, quilt and textile galleries, quilting shops, and other useful guidance for novices and pros alike. 75 illustrations.
MCSE: Windows 2000 Directory Services Administration Exam Notes
Authors: Quentin Docter, James Chellis
Venue:  (2000)

:MCSE: Windows 2000 Directory Services Administration Exam Notes provides the fastest and most effective way to make sure you're ready to pass the Directory Services Administration exam. The unique, innovative Exam Notes approach helps you gain and retain the knowledge you need, objective by objective: Critical Information sections provide detailed analyses of the key issues for each exam objective. Necessary Procedures sections cover the nuts and bolts of each topic with concise step-by-step instructions. Exam Essentials sections highlight crucial subject areas you'll need to know for the exam. Key Terms and Concepts sections define the words and concepts vital to passing the exam. Sample Questions sections preview the types of questions found in the exam and give answers and explanations.
Smooth Approximations to Nonlinear Complementarity Problems
Authors: Bintong Chen, Patrick T. Harker
Venue: SIAM Journal on Optimization (1997)

It is well known that a nonlinear complementarity problem (NCP) can be formulated as a system of nonsmooth equations. Chen and Mangasarian [Comput. Optim. Appl., 5 (1996), pp. 97--138] proposed a class of parametric smooth functions by twice integrating a probability density function. As a result, the nonsmooth equations can be approximated by smooth equations. This paper refines the smooth functions proposed by Chen and Mangasarian and investigates their structural properties. The refinement allows us to establish the existence, uniqueness, and limiting properties of the trajectory defined by the solutions of these smooth equation approximations. In addition, global error bounds for the NCP with a uniform P-function are obtained.
On a Generic Existence Result in Optimization
Authors: Alexander J. Zaslavski
Venue: SIAM Journal on Optimization (2000)

In this work we consider the minimization problem $f(x)+h(x) \to \min$, $x \in X,$ with $f \in C_l(X)$ and $h \in M$. Here X is a complete metric space, Cl(X) is the space of all lower semicontinuous bounded from below functions on X endowed with an appropriate uniform structure, and Mis a countable union of compact subsets of Cl(X) . We will establish the existence of a set ${\cal F} \subset C_l(X)$ which is a countable intersection of open everywhere dense sets in Cl(X) such that for each $f \in {\cal F}$ and each $h \in M$ the minimization problem has a solution and, moreover, the set of its solutions is compact. In particular this result is valid when M is a countable union of a convex hull of finite sets in Cl(X) satisfying certain assumptions.
Professional chapters
Authors: Scott Lang, Colleen Cleary
Venue: ACM SIGGRAPH Computer Graphics (1998)

This month's column features our regular chapters wrap-up and an article by the Mexico City Chapter Newsletter Editor, Gonzalo Le oacute;n. We hope you enjoy it.
Laser-Doppler-anemometry studies of flow behavior in rigid and elastic varicose vein models
Authors: L. Schalin, D. Liepsch
Venue: Technology and Health Care (2001)

Flow behavior and velocity were studied in six varicose vein models with simulated arteriovenous anastomoses (AVAs). Experiments were performed to determine whether incoming flow entering from AV-anastomoses or small feeder veins could create either small jet streams or velocity fluctuation, which might then cause veins to bulge and get tortuous. Flow was analyzed in areas of flow change. Studies were performed in rigid Plexiglas and elastic, silicon rubber models that exactly replicated the geometry and compliance of varicose veins. Flow was visualized with dyes for steady flow and with a birefringent solution for pulsatile flow studies. Local velocity was measured with a laser-Doppler-anemometer (LDA). Very low forces and shear stresses were found on the interior wall opposite the entrance of the simulated AV anastomoses. However, these values were ten times that of an idealized flow in a straight tube without added flow from simulated AV anastomoses.
GPGS: a device-independent general purpose graphic system for stand-alone and satellite graphics
Authors: L. C. Caruthers, J. van den Bos, A. van Dam
Venue: Proceedings of the 4th annual conference on Computer graphics and interactive techniques (1977)

GPGS is a subroutine package offering powerful and versatile support for passive and interactive vector graphics, for time-sharing, batch, and stand-alone minicomputer systems. The package is computer, language, and operating system, as well as display device independent. Its key purpose is to allow for transportabiliit of programs and programmers by providing easy to learn, high level features. The applications programmer writes his program once and then executes it on any supported graphics equipment without recompiling or relinking it. Device-independence was implemented by dividing GPGS into a device-independent part invoked by the applications programmer, and internal, "device drivers", one per display device. Like the GSPC "Core System" whose design it influenced, GPGS is a general purpose package. It has a subset of graphics facilities to handle output of line and character primitives with attributes such as line style and character size, and input from interaction tools such as lightpens, keyboards, valuators, and function keys. It also supports 2D and 3D viewin transformationss for clipping and window to viewport mapping, and coordinate transformations.Unlike the GSPC Core System, GPGS also includes a set of basic features for modelling objects which allows definition of device independent masters called seudo picture segment. These are distinguished from normal, device (DPU) dependent pictur segments into which primitives and their attribute-value settings are ordinarily compiled. These masters may be instanced subject to affine transformations (translate, rotate, and scale) to create a typical master-instance hierarchy. The hierarchy may be stored in a disk based library or compiled into a normal picture segment for output to a display device.The images of objects stored in device dependent picture segments may be transformed on the display surface by v port (image) transformations. These typically allow use of hardware transformation capabilities for dragging or tumbling object images.Host/satellite graphics is accommodated by having the device independent part of GPGS in the host and splitting the device drivers across host and satellite. At the source code level it therefore makes no difference on which.configuration a program will be executed.Among the existing implementations are versions written in assembler for the IB 360/370 and the PDP 11, in both stand-alone and satellite mode, and under a variety of operating systems. They support plotters, storage tubes, and high performance refresh displays. FORTRAN based implementations exist for the Univac 1108, the PDP 10, and a Harris minicomputer.
Software performance testing based on workload characterization
Authors: Alberto Avritzer, Joe Kondek, Danielle Liu, Elaine J. Weyuker
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

A major concern of most businesses is their ability to meet customers' performance requirements. This paper describes our workload-based approach to performance testing, and includes a case study that demonstrates the application of this approach to a large, industrial software system. For this system, we collected data in the field to determine the current production usage, and then assessed the performance of the system under both current workloads, and those likely to be encountered in the future. This led to the identification of a software bottleneck, which, had it occurred in the field rather than in the test lab, would have likely had significant consequences.
Oracle8i Backup and Recovery, 1st edition
Authors: Rama Velpuri, George Williams, Anand Adkoli
Venue:  (2000)

:Includes information that every Oracle administrator and programmer must know to maximize uptime and recover data without compromising mission critical systems. Protect Your Company's Data from System Failure Back up your organization's data and implement proactive measures without compromising the availability of your mission-critical systems. This Oracle authorized guide explains in detail how to implement the new features of Oracle8i to maintain 24x7 database uptime - and protect data. Inside,you'll find complete details on Oracle8i architecture,physical and logical backup techniques,recovery and replication methods,and diagnostic practices. You'll also learn from real-world case studies. Planning and testing backup procedures for your Oracle database is the only insurance you have to protect your data in the event of system failure - this book shows you how to implement a solid backup and recovery plan. Get details on Oracle8i architecture and configuration Archive online redo log files to multiple destinations Implement physical and logical backups Use Oracle8i's new import and export utilities Deploy backup scripts in Microsoft Windows NT,UNIX,and OpenVMS environments Ensure continuous data availability using replication methods Create a hot standby database Pinpoint database corruption and recover data using the DBMS_REPAIR package Take advantage of the new Fast-Start recovery feature Monitor,diagnose,and maintain your database using the Oracle Diagnostics pack