ppxscal/embedding_network huggingface dataset:
Apple Training Series: GarageBand 3 (Apple Training)
Authors: Mary Plummer
Venue:  (2006)

Whether you're an accomplished musician or a student, Garageband is the most rewarding way to create, perform, and record your own music. In the only Apple-certified guide to Garageband, composer and master trainer Mary Plummer shows you just how easy it is to turn your Mac into a fully featured recording studio. Plummer offers a complete, self-paced course in all aspects of Garageband - from mastering the interface and basic recording techniques to the secrets of arranging a song, editing and mixing tracks, adding effects, and distributing your Garageband compositions. Fully updated for version 3, Mary covers all of Garageband's hot new features including podcast recording and iMovie scoring. 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
PEAKS: identification of regulatory motifs by their position in DNA sequences
Authors: Nicolás Bellora, Domènec Farré, M. Mar Albà
Venue: Bioinformatics (2007)

Summary: Many DNA functional motifs tend to accumulate or cluster at specific gene locations. These locations can be detected, in a group of gene sequences, as high frequency 'peaks' with respect to a reference position, such as the transcription start site (TSS). We have developed a web tool for the identification of regions containing significant motif peaks. We show, by using different yeast gene datasets, that peak regions are strongly enriched in experimentally-validated motifs and contain potentially important novel motifs. Availability: http://genomics.imim.es/peaks Contact: malba@imim.es Supplementary information: Supplementary Data are available at Bioinformatics online.
Oracle PL/SQL for DBAs
Authors: Arup Nanda, Steven Feuerstein
Venue:  (2005)

PL/SQL, Oracle's powerful procedural language, has been the cornerstone of Oracle application development for nearly 15 years. Although primarily a tool for developers, PL/SQL has also become an essential tool for database administration, as DBAs take increasing responsibility for site performance and as the lines between developers and DBAs blur. Until now, there has not been a book focused squarely on the language topics of special concern to DBAs Oracle PL/SQL for DBAs fills the gap. Covering the latest Oracle version, Oracle Database 10g Release 2 and packed with code and usage examples, it contains:A quick tour of the PL/SQL language, providing enough basic information about language fundamentals to get DBAs up and runningExtensive coverage of security topics for DBAs: Encryption (including both traditional methods and Oracle's new Transparent Data Encryption, TDE); Row-Level Security (RLS), Fine-Grained Auditing (FGA); and random value generationMethods for DBAs to improve query and database performance with cursors and table functionsCoverage of Oracle scheduling, which allows jobs such as database monitoring and statistics gathering to be scheduled for regular executionUsing Oracle's built-in packages (DBMS_CRYPTO, DBMS_RLS, DBMS_FGA, DBMS_RANDOM, DBMS_SCHEDULING) as a base, the book describes ways of building on top of these packages to suit particular organizational needs. Authors are Arup Nanda, Oracle Magazine 2003 DBA of the Year, and Steven Feuerstein, the world's foremost PL/SQL expert and coauthor of the classic reference, Oracle PL/SQL Programming.DBAs who have not yet discovered how helpful PL/SQL can be will find this book a superb introduction to the language and its special database administration features. Even if you have used PL/SQL for years, you'll find the detailed coverage in this book to be an invaluable resource.
Speed scaling to manage energy and temperature
Authors: Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs
Venue: Journal of the ACM (JACM) (2007)

Speed scaling is a power management technique that involves dynamically changing the speed of a processor. We study policies for setting the speed of the processor for both of the goals of minimizing the energy used and the maximum temperature attained. The theoretical study of speed scaling policies to manage energy was initiated in a seminal paper by Yao et al. [1995], and we adopt their setting. We assume that the power required to run at speed s is P(s) &equals; s&alpha; for some constant &alpha; > 1. We assume a collection of tasks, each with a release time, a deadline, and an arbitrary amount of work that must be done between the release time and the deadline. Yao et al. [1995] gave an offline greedy algorithm YDS to compute the minimum energy schedule. They further proposed two online algorithms Average Rate (AVR) and Optimal Available (OA), and showed that AVR is 2&alpha; &minus; 1 &alpha;&alpha;-competitive with respect to energy. We provide a tight &alpha;&alpha; bound on the competitive ratio of OA with respect to energy. We initiate the study of speed scaling to manage temperature. We assume that the environment has a fixed ambient temperature and that the device cools according to Newton's law of cooling. We observe that the maximum temperature can be approximated within a factor of two by the maximum energy used over any interval of length 1/b, where b is the cooling parameter of the device. We define a speed scaling policy to be cooling-oblivious if it is simultaneously constant-competitive with respect to temperature for all cooling parameters. We then observe that cooling-oblivious algorithms are also constant-competitive with respect to energy, maximum speed and maximum power. We show that YDS is a cooling-oblivious algorithm. In contrast, we show that the online algorithms OA and AVR are not cooling-oblivious. We then propose a new online algorithm that we call BKP. We show that BKP is cooling-oblivious. We further show that BKP is e-competitive with respect to the maximum speed, and that no deterministic online algorithm can have a better competitive ratio. BKP also has a lower competitive ratio for energy than OA for &alpha; &ge;5. Finally, we show that the optimal temperature schedule can be computed offline in polynomial-time using the Ellipsoid algorithm.
The ideal of verified software
Authors: Tony Hoare
Venue: Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications (2006)

This talk is intended as an introduction to this afternoon's discussion on Grand Challenge problems for the ACL2 community. I want to invite you to address the possibility of an even more broadly based challenge, directed towards the scientific ideal of verified software. This is a challenge that will bring together the talents of theorists, tool-builders, and experimental scientists from around the world. It will provide opportunity for collaboration and scientific competition between many research communities, over a period of fifteen years or more. And it has a testable goal---the production and automatic verification of (say) a million of lines of useful code, drawn from many areas of computer application.
Distributed augmentation-based learning: a learning algorithm for distributed collaborative programming-by-demonstration
Authors: Vittorio Castelli, Lawrence Bergman
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

The learning algorithms used in Programming-by-Demonstration (PBD) are either on-line and incremental or off-line and batch. Neither category is entirely suitable for capturing know-how from demonstrations in a distributed, collaborative environment, where multiple experts can independently provide examples to improve the model.In this paper we describe Distributed Augmentation-Based Learning (DABL), the first real-time PBD learning algorithm suited for distributed know-how acquisition. DABL is an incremental learning algorithm that uses a version-control-like paradigm to combine independently constructed procedure models. An expert can check out a procedure model from a repository and modify it by means of new demonstrations or by manually editing it. The expert then reconciles the changes with those concurrently made by other experts and checked into the repository.DABL automatically merges the two procedures, learns new decision points based on reconcilable differences, and identifies conflicts where there are multiple valid ways of combining the changes or where the combination produces an invalid model, that is, one that does not lie in the search space of the learning algorithm.
On Text-based Mining with Active Learning and Background Knowledge Using SVM
Authors: Catarina Silva, Bernardete Ribeiro
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

Text mining, intelligent text analysis, text data mining and knowledge-discovery in text are generally used aliases to the process of extracting relevant and non-trivial information from text. Some crucial issues arise when trying to solve this problem, such as document representation and deficit of labeled data. This paper addresses these problems by introducing information from unlabeled documents in the training set, using the support vector machine (SVM) separating margin as the differentiating factor. Besides studying the influence of several pre-processing methods and concluding on their relative significance, we also evaluate the benefits of introducing background knowledge in a SVM text classifier. We further evaluate the possibility of actively learning and propose a method for successfully combining background knowledge and active learning. Experimental results show that the proposed techniques, when used alone or combined, present a considerable improvement in classification performance, even when small labeled training sets are available.
Supporting small groups in the museum by context-aware communication services
Authors: Tsvi Kuflik, Julia Sheidin, Sadek Jbara, Dina Goren-Bar, Pnina Soffer, Oliviero Stock, Massimo Zancanaro
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

Visitors often tend to visit museums in groups, mainly with family or friends, yet most of the today mobile museum guides focus on supporting the individual visitor. The technology described in this paper allows supporting groups of visitors in addition to individuals by providing context-aware services aimed at supporting the whole group. These include context-aware communication and alerting services that are provided by the museum visitor's guide system developed in the framework of the PIL (PEACH-Israel) project, as an example case of a larger variety of possible context-aware services.
Thorough static analysis of device drivers
Authors: Thomas Ball, Ella Bounimova, Byron Cook, Vladimir Levin, Jakob Lichtenberg, Con McGarvey, Bohus Ondrusek, Sriram K. Rajamani, Abdullah Ustuner
Venue: Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 (2006)

Bugs in kernel-level device drivers cause 85% of the system crashes in the Windows XP operating system [44]. One of the sources of these errors is the complexity of the Windows driver API itself: programmers must master a complex set of rules about how to use the driver API in order to create drivers that are good clients of the kernel. We have built a static analysis engine that finds API usage errors in C programs. The Static Driver Verifier tool (SDV) uses this engine to find kernel API usage errors in a driver. SDV includes models of the OS and the environment of the device driver, and over sixty API usage rules. SDV is intended to be used by driver developers "out of the box." Thus, it has stringent requirements: (1) complete automation with no input from the user; (2) a low rate of false errors. We discuss the techniques used in SDV to meet these requirements, and empirical results from running SDV on over one hundred Windows device drivers.
QuarkXPress 7 for Windows & Macintosh (Visual QuickStart Guide)
Authors: Elaine Weinmann, Peter Lourekas
Venue:  (2006)

This handy Visual QuickStart Guide offers the quickest way to begin working with QuarkXPress 7, including all the new graphic effects, Job Jackets, expanded output options, and other great workflow enhancements. In these pages, best-selling authors and veteran educators Elaine Weinmann and Peter Lourekas use task-based, step-by-step instruction and loads of visual aids to provide a solid base of skills in QuarkXPress 7. Progressing from the basics of planning and designing layouts, working with text, and creating and importing graphics to more advanced topics like exporting documents as Web pages, this indispensable reference covers it all.
When humans form media and media form humans: An experimental study examining the effects different digital media have on the learning outcomes of students who have different learning styles
Authors: J. L. Alty, A. Al-Sharrah, N. Beacham
Venue: Interacting with Computers (2006)

A set of computer-based experiments are reported that investigate the understanding achieved by learners when studying a complex domain (statistics) in a real e-learning environment using three different media combinations-Text only, Text and Diagrams and Spoken Text and Diagrams, and the results agree with earlier work carried out on more limited domains. The work is then extended to examine how student interaction and student learning styles affect the learning outcomes. Different responses to the media combinations are observed and significant differences occur between learners classified as Sensing and Reflective learners. The experiment also identified some important differences in performance with the different media combinations by students registered as Dyslexic. The experiment was therefore repeated with a much larger sample of Dyslexic learners and the earlier effects were found to be significant. The results were surprising and may provide useful guidance for the design of material for Dyslexic students.
Developing interoperability standards for distributed simulaton and COTS simulation packages with the CSPI PDG
Authors: John Ladbrook, Malcolm Y. H. Low, Steffen Strassburger, Simon J. E. Taylor, Stephen J. Turner, Xiaoguang Wang
Venue: Proceedings of the 38th conference on Winter simulation (2006)

For many years discrete-event simulation has been used to analyze production and logistics problems in manufacturing and defense. In the early 1980s, visual interactive modelling environments were created that supported the development, experimentation and visualization of simulation models. Today these environments are termed Commercial-off-the-shelf Simulation Packages (CSPs). With the advent of distributed simulation and, later, the High Level Architecture, the possibility existed to link together these CSPs and their models to simulate larger problems within enterprises (e.g. multiple production lines) and across supply chains. However, the problem of standardizing the use of the HLA and its constituent parts in this domain exists. The solution of this problem is the work of the CSP Interoperability Product Development Group (CSPI PDG). The purpose of this paper is to introduce the CSPI PDG and to review the suite of standards proposed by the group and current progress.
Efficient parallel queuing system simulation
Authors: Tobias Kiesling, Thomas Krieger
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Queuing systems are an important building block for performance evaluation in various application areas, due to their powerful, yet simple nature. Although it is often possible to perform an analytical evaluation of a queuing model, simulation of queuing systems remains an important technique in the context of performance evaluation. In order to speed up queuing simulation executions, parallel and distributed simulation techniques have been devised. Unfortunately, existing methods are complex in nature, leading to increased development costs. Moreover, most of these approaches have been developed for tightly coupled parallel processing machines. Consequently, they are not suited for a distributed computing environment. This paper investigates an alternative approach based on the technique of time-parallel simulation with fix-up computations. The salient features of this novel approach are its simplicity and its suitability for execution in a distributed environment.
From the chair
Venue: ACM SIGMIS Database (2007)

Happy New Year! I hope this year brings you health, happiness, and good cheer!Thanks to those of you who attended the "Sixth Annual ACM-SIGMIS Reception," held as an ACM-SIGMIS event prior to the International Conference on Information Systems (ICIS2006) in Milwaukee, WI USA. It was great fun seeing everyone. Please visit ACM-SIGMIS's website at: http://www.acm.org/sigmis to view photos from this event. Mark your calendar now for next year's reception, scheduled for Saturday, December 8, 2007, from 5:30-7:00pm, prior to ICIS2007 to be held in Montreal, Canada, December 9-12, 2007.Just a reminder for this year's CPR2007 conference and Doctoral Consortium: Conference: ACM-SIGMIS Computer Personnel Research 2007 Conference Theme: "The Global Information Technology Workforce" When & Where: April 19-21, 2007, St. Louis, Missouri, USA Doctoral Consortium: April 19, 2007 Website: http://www.sigmis.org.The beautiful Blue Ridge Mountains of North Carolina, USA is the venue for next year's CPR2008. Please consider sending a submission by the October 2007 deadline. Your participation is welcome!Also, please consider attending the upcoming conferences this year with which we are in-cooperation: Autonomous Infrastructure, Management, and Security (AIMS), http://www.aims2007.org; Business Information Systems (BIS), http://bis.kie.ae.poznan.pl; International Conference on e-Business (ICE-B), http://www.ice-b.org; International Conference on e-Business and Telecommunications (ICETE), http://www.icete.org; and International Conference on Enterprise Information Systems (ICEIS), http://www.iceis.org.As always, thanks for your support of SIGMIS. We encourage your involvement. Please contact any one of us with suggestions or other input.We look forward to seeing you at ACM-SIGMIS CPR'07!
Computing worst-case tail probabilities in credit risk
Authors: Soumyadip Ghosh, Sandeep Juneja
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Simulation is widely used to measure credit risk in portfolios of loans, bonds, and other instruments subject to possible default. This analysis requires performing the difficult modeling task of capturing the dependence between obligors adequately. Current methods assume a form for the joint distribution of the obligors and match its parameters to given dependence specifications, usually correlations. The value-at-risk risk measure (a function of its tail quantiles) is then evaluated. This procedure is naturally limited by the form assumed, and might not approximate well the "worstcase" possible over all joint distributions that match the given specification. We propose a procedure that approximates the joint distribution with chessboard distributions, and provides a sequence of improving estimates that asymptotically approach this "worst-case" value-at-risk. We use it to experimentally compare the quality of the estimates provided by the earlier procedures.
Approaches for automated detection and classification of masses in mammograms
Authors: H. D. Cheng, X. J. Shi, R. Min, L. M. Hu, X. P. Cai, H. N. Du
Venue: Pattern Recognition (2006)

Breast cancer continues to be a significant public health problem in the world. Early detection is the key for improving breast cancer prognosis. Mammography has been one of the most reliable methods for early detection of breast carcinomas. However, it is difficult for radiologists to provide both accurate and uniform evaluation for the enormous mammograms generated in widespread screening. The estimated sensitivity of radiologists in breast cancer screening is only about 75%, but the performance would be improved if they were prompted with the possible locations of abnormalities. Breast cancer CAD systems can provide such help and they are important and necessary for breast cancer control. Microcalcifications and masses are the two most important indicators of malignancy, and their automated detection is very valuable for early breast cancer diagnosis. Since masses are often indistinguishable from the surrounding parenchymal, automated mass detection and classification is even more challenging. This paper discusses the methods for mass detection and classification, and compares their advantages and drawbacks.
Scalable visual assessment of cluster tendency for large data sets
Authors: Richard J. Hathaway, James C. Bezdek, Jacalyn M. Huband
Venue: Pattern Recognition (2006)

The problem of determining whether clusters are present in a data set (i.e., assessment of cluster tendency) is an important first step in cluster analysis. The visual assessment of cluster tendency (VAT) tool has been successful in determining potential cluster structure of various data sets, but it can be computationally expensive for large data sets. In this article, we present a new scalable, sample-based version of VAT, which is feasible for large data sets. We include analysis and numerical examples that demonstrate the new scalable VAT algorithm.
Fair webs
Authors: Johannes Wallner, Helmut Pottmann, Michael Hofer
Venue: The Visual Computer: International Journal of Computer Graphics (2006)

Fair webs are energy-minimizing curve networks. Obtained via an extension of cubic splines or splines in tension to networks of curves, they are efficiently computable and possess a variety of interesting applications. We present properties of fair webs and their discrete counterparts, i.e., fair polygon networks. Applications of fair curve and polygon networks include fair surface design and approximation under constraints such as obstacle avoidance or guaranteed error bounds, aesthetic remeshing, parameterization and texture mapping, and surface restoration in geometric models.
Efficient processing of 3D scanned models
Authors: Roberto Scopigno
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

The construction of detailed and accurate 3D models is made easier by the increasing diffusion of automatic sampling devices (often called 3D scanners). These allow to build digital models of real 3D objects in a cost- and time-effective manner. The talk will present the capabilities of this technology focusing mainly on some issues which are preventing a wider use of this technology, such as for example the considerable user intervention required and the complexity of the models produced. Another emerging issue is how to support the visual presentation of the models (local or remote) with guaranteed interactive rendering and data protection. Some examples of the results of current projects, mainly in the Cultural Heritage field, will be shown.
O'Leary Series: Microsoft PowerPoint 2003 Brief, 1 edition
Authors: Timothy J. O'Leary, Linda I. O'Leary
Venue:  (2003)

The goal of the O’Leary Series is to give students a basic understanding of computing concepts and to build the skills necessary to ensure that information technology is an advantage in whatever career they choose in life. The O’Leary Microsoft Office 2003 texts are crafted to be the true step-by-step way for students to develop Microsoft Office application skills. The text design emphasizes step-by-step instructions with full screen captures that illustrate the results of each step performed. Each Tutorial (chapter) combines conceptual coverage with detailed software-specific instructions. A running case that is featured in each tutorial highlights the real-world applications of each software program and leads students step-by-step from problem to solution.Table of contentsTutorial 1: Creating a Presentation Tutorial 2: Modifying and Refining a PresentationWorking Together: Copying, Embedding and Linking Between Applications