ppxscal/embedding_network huggingface dataset:
Real-time estimation of emotional experiences from facial expressions
Authors: Timo Partala, Veikko Surakka, Toni Vanhala
Venue: Interacting with Computers (2006)

The present aim was to develop methods that estimate emotional experiences in real time from the electromyographic activity of two facial muscles: zygomaticus major (activated when smiling) and corrugator supercilii (activated when frowning). Ten subjects were stimulated with a series of emotionally arousing pictures and videos. After each stimulus the subjects rated the valence of their emotional experience on a nine-point bipolar dimensional scale. At the same time the computer estimated the subjects' ratings on the basis of their electrical facial activity during each stimulation with 70 computational models. The models estimated the subjects' ratings either categorically or dimensionally with regression models. The best categorical models were able to estimate negative and positive ratings with an average accuracy of over 70 and 80% for pictures and videos, respectively. The best correlations between the human ratings and machine estimations formed with the regression models were high (r>0.9). These findings indicate that models estimating psycho-emotional experiences on the basis of facial activity can be created successfully in several ways.
CGI: a new approach for prioritizing genes by combining gene expression and protein--protein interaction data
Authors: Xiaotu Ma, Hyunju Lee, Li Wang, Fengzhu Sun
Venue: Bioinformatics (2007)

Motivation: Identifying candidate genes associated with a given phenotype or trait is an important problem in biological and biomedical studies. Prioritizing genes based on the accumulated information from several data sources is of fundamental importance. Several integrative methods have been developed when a set of candidate genes for the phenotype is available. However, how to prioritize genes for phenotypes when no candidates are available is still a challenging problem. Results: We develop a new method for prioritizing genes associated with a phenotype by Combining Gene expression and protein Interaction data (CGI). The method is applied to yeast gene expression data sets in combination with protein interaction data sets of varying reliability. We found that our method outperforms the intuitive prioritizing method of using either gene expression data or protein interaction data only and a recent gene ranking algorithm GeneRank. We then apply our method to prioritize genes for Alzheimer's disease. Availability: The code in this paper is available upon request. Contact: fsun@usc.edu Supplementary data: Supplementary data are available at Bioinformatics online.
Issues in holistic system design
Authors: Julia L. Lawall, Christian W. Probst, Ulrik Pagh Schultz
Venue: Proceedings of the 3rd workshop on Programming languages and operating systems: linguistic support for modern operating systems (2006)

The coordination of layers in computer and software systems is one of the main challenges in designing such systems today. In this paper we consider Holistic System Design as a way of integrating requirements and facilities of different system layers. We also discuss some of the challenges that this kind of system design poses for computer science in general as well as programming languages and operating systems in particular.
On the Newton iteration in the application of collocation methods to implicit delay equations
Authors: Nicola Guglielmi
Venue: Applied Numerical Mathematics (2005)

We consider stiffly accurate collocation methods based on Radau nodes for the integration of initial value problems for implicit delay differential equations of the form My'(t) = f(t, y(t), y(α1(t, y(t))),...,y(αp(t, y(t)))), where M is a constant matrix and αi(t, y(t)) (i=1,....,p) denote the deviating arguments, which are assumed to satisfy the inequalities αi (t, y(t))≤t for all i. In a recent paper [Computing 67 (2001) 1-12] we have described how collocation methods based on Radau nodes can be applied to solve problems of this type.The aim of this paper is that of explaining the difficulties arising when solving the Runge-Kutta equations using stepsizes larger than delays and to design techniques able to efficiently overcome them.
PMP Practice Questions Exam Cram 2
Authors: David Francis
Venue:  (2004)

The PMP Practice Questions Exam Cram 2 offers you a solid opportunity to drill and practice for the highly critical professional exam. The book features 500 questions based on the 9 Project Management Processes described in the PMI PMBOK and in our PMP Exam Cram 2. All questions found in the book will also be on the accompanying CD in a test engine powered by MeasureUp. The questions will have full explanations of correct and incorrect answers so you can use this manual to review and brush-up on weak areas. It features relevant Exam Notes to help you score better on the test, plus the ever popular "Cram Sheet" tear card, to use for last-minute cramming. Join the ranks of readers that have chosen Exam Cram 2 as part of their preparation for their certification exams!
A bias reducing technique in kernel distribution function estimation
Authors: Choongrak Kim, Sungsoo Kim, Mira Park, Hakbae Lee
Venue: Computational Statistics (2006)

In this paper we suggest a bias reducing technique in kerneldistribution function estimation. In fact, it uses a convex combination of three kernel estimators, and it turned out that the bias has been reduced to the fourth power of the bandwidth, while the bias of the kernel distribution function estimator has the second power of the bandwidth. Also, the variance of the proposed estimator remains at the same order as the kernel distribution function estimator. Numerical results based on simulation studies show this phenomenon, too.
Making routing robust to changing traffic demands: algorithms and evaluation
Authors: David Applegate, Edith Cohen
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Intra-domain traffic engineering can significantly enhance the performance of large IP backbone networks. Two important components of traffic engineering are understanding the traffic demands and configuring the routing protocols. These two components are inter-linked, as it is widely believed that an accurate view of traffic is important for optimizing the configuration of routing protocols, and through that, the utilization of the network.This basic premise, however, seems never to have been quantified. How important is accurate knowledge of traffic demands for obtaining good utilization of the network? Since traffic demand values are dynamic and illusive, is it possible to obtain a routing that is "robust" to variations in demands?We develop novel algorithms for constructing optimal robust routings and for evaluating the performance of any given routing on loosely constrained rich sets of traffic demands. Armed with these algorithms we explore these questions on a diverse collection of ISP networks. We arrive at a surprising conclusion: it is possible to obtain a robust routing that guarantees a nearly optimal utilization with a fairly limited knowledge of the applicable traffic demands.
Extended Hough transform for linear feature detection
Authors: J. Cha, R. H. Cofer, S. P. Kozaitis
Venue: Pattern Recognition (2006)

Improving the accuracy of line segment detection reduces the complexity of subsequent high-level processing common in cartographic feature detection. We developed a new extension to the Hough transform and reported on its application to building extraction. We expanded the Hough space by a third parameter, the horizontal or vertical coordinate of the image space, to provide incremental information as to the length of the lineal feature being sought. Using this extended HT transform allowed us to more accurately detect the true length of a line segment. In addition, we used a Bayesian probabilistic approach to process our extended Hough space that further increased the accuracy of our extended Hough transform.
Lotus Notes and Domino 6 System Administrator Exam Cram 2 (620, 621, 622)
Authors: Karen Fishwick, Tony Aveyard
Venue:  (2003)

Lotus Notes and Domino 6 System Administrator Exam Cram 2 is the best exam preparation available and the only one of its type for the IBM Certified Professional exams. This book covers the three exams required to become an IBM CP. Those who are current Certified Lotus Professionals now become IBM Certified Professional System Administrators - Lotus Notes and Domino 6 (IBM CP). The desire to attain a Lotus certification is growing because Lotus is one of the top 10 certifications for salary level, % of salary increase, and promotional opportunities. CPs earn higher salaries with each certification and 80% of Lotus certified candidates continue from a specialist (CS) to a professional (CP). This Exam Cram 2 is perfect for those who have proven experience with Notes client and Domino server and are now ready to take the exam. The best-selling Exam Cram 2 series shows them exactly what they need to know to pass the exam.
A finite element penalty-projection method for incompressible flows
Authors: M. Jobelin, C. Lapuerta, J.-C. Latché, Ph. Angot, B. Piar
Venue: Journal of Computational Physics (2006)

The penalty-projection method for the solution of Navier-Stokes equations may be viewed as a projection scheme where an augmentation term is added in the first stage, namely the solution of the momentum balance equation, to constrain the divergence of the predicted velocity field. After a presentation of the scheme in the time semi-discrete formulation, then in fully discrete form for a finite element discretization, we assess its behaviour against a set of benchmark tests, including in particular prescribed velocity and open boundary conditions. The results demonstrate that the augmentation always produces beneficial effects. As soon as the augmentation parameter takes a significant value, the projection method splitting error is reduced, pressure boundary layers are suppressed and the loss of spatial convergence of the incremental projection scheme in case of open boundary conditions does not occur anymore. For high values of the augmentation parameter, the results of coupled solvers are recovered. Consequently, in contrast with standard penalty methods, there is no need for a dependence of the augmentation parameter with the time step, and this latter can be kept to reasonable values, to avoid to degrade too severely the conditioning of the linear operator associated to the velocity prediction step.
Proceedings of the 6th international workshop on Software engineering and middleware
Venue: Foundations of Software Engineering (2006)

The Sixth International Software Engineering and Middleware Workshop takes place on November 10, 2006 and is co-located with the Fourteenth ACM SIGSOFT Symposium on Foundations of Software Engineering. These proceedings are distributed at the workshop and are published in the ACM Digital Library.
Selection and multiple-comparison procedures for regenerative systems
Authors: Marvin K. Nakayama
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We propose two-stage methods for selection and multiple comparisons with the best (MCB) of steady-state performance measures of regenerative systems. We assume the systems being compared are simulated independently, and the methods presented are asymptotically valid as the confidence-interval width parameter shrinks and the first-stage run length grows at a rate that is at most the inverse of the square of the confidence-interval width parameter. When the first-stage run length is asymptotically negligible compared to the total run length, our procedures are asymptotically efficient. We provide an asymptotic comparison of our regenerative MCB procedures with those based on standardized time series (STS) methods in terms of mean and variance of total run length. We conclude that regenerative MCB methods are strictly better than STS MCB methods for any fixed number of batches, but the two become equivalent as the number of batches grows large.
Testing SAP R/3: A Manager's Step-by-Step Guide
Authors: Jose Fajardo, Elfriede Dustin
Venue:  (2007)

Testing SAP R/3: A Manager's Step-by-Step Guide shows how to implement a disciplined, efficient, and proven approach for testing SAP R/3 correctly from the beginning of the SAP implementation through post-production support. The book also shows SAP professionals how to efficiently provide testing coverage for all SAP objects before they are moved into a production environment.
Creating a Database in FileMaker Pro: Visual QuickProject Guide
Authors: Steve Schwartz
Venue:  (2005)

The problem: Your boss has demanded a database, and you don't know how to create one. It doesn't matter that it's just a simple one (for tracking invoices, inventory, and contacts), or that flexible, powerful software (FileMaker Pro 7) has already been purchased. If you've never created a database before, the task can be daunting. The solution: This low-priced, compact guide! Recognizing that you don't necessarily want or need to know about every FileMaker Pro 7 feature, this focused, four-color volume demonstrates the quickest route to creating a functional, organized database-nothing more and certainly nothing less. Using large color illustrations and a minimum of verbiage, it provides the basics you need to get going without bogging you down with detailed explanations of all of FileMaker's intricacies. It also serves as the perfect jumping-off point for more extensive database exploration-for example, through FileMaker Pro 7: Visual QuickStart Guide.
Optimal NT policies for M/G/1 system with a startup and unreliable server
Authors: Jau-Chuan Ke
Venue: Computers and Industrial Engineering (2006)

This paper studies the control policies of an M/G/1 queueing system with a startup and unreliable server, in which the length of the vacation period is controlled either by the number of arrivals during the idle period, or by a timer. After all the customers are served in the queue exhaustively, the server immediately takes a vacation and operates two different policies: (i) the server reactivates as soon as the number of arrivals in the queue reaches to a predetermined threshold N or the waiting time of the leading customer reaches T units; and (ii) the server reactivates as soon as the number of arrivals in the queue reaches to a predetermined threshold N or T time units have elapsed since the end of the completion period. If the timer expires or the number of arrivals exceeds the threshold N, then the server reactivates and requires a startup time before providing the service until the system is empty. Furthermore, it is assumed that the server breaks down according to a Poisson process and his repair time has a general distribution. We analyze the system characteristics for each scheme. The total expected cost function per unit time is developed to determine the optimal thresholds of N and T at a minimum cost.
Working with Microsoft Dynamics(TM) CRM 3.0
Authors: Mike Snyder, Jim Steger
Venue:  (2006)

Get a practical, hands-on introduction to Microsoft Dynamics CRM 3.0, including topics on how to design, customize, integrate, and maintain Microsoft CRM implementations. This book includes a 120-day evaluation copy of Microsoft CRM 3.0.
BuzzTrack: topic detection and tracking in email
Authors: Gabor Cselle, Keno Albrecht, Roger Wattenhofer
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

We present BuzzTrack, an email client extension that helps users deal with email overload. This plugin enhances the interface to present messages grouped by topic, instead of the traditional approach of organizing email in folders. We discuss a clustering algorithm that creates the topic-based grouping, and a heuristic for labeling the resulting clusters to summarize their contents. Lastly, we evaluate the clustering scheme in the context of existing work on topic detection and tracking (TDT) for news articles: Our algorithm exhibits similar performance on emails as current work on news text. We believe BuzzTrack's organization structure, which can be obtained at no cost to the end user, will be helpful for managing the massive amounts of email that land in the inbox every day.
Medial axis extraction and shape manipulation of solid objects using parabolic PDEs
Authors: Haixia Du, Hong Qin
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

Shape skeletonization (i.e., medial axis extraction) is powerful in many visual computing applications, such as pattern recognition, object segmentation, registration, and animation. This is because medial axis (or skeleton) provides more compact representations for solid models while preserving their topological properties and other features. Meanwhile, PDE techniques are widely utilized in computer graphics fields to model solid objects and natural phenomena, formulate physical laws to govern the behavior of objects in real world, and provide means to measure the feature of movements, such as velocity, acceleration, change of energy, etc. Certain PDEs such as diffusion equations and Hamilton-Jacobi equation have been used to detect medial axes of 2D images and volumetric data with ease. However, using such equations to extract medial axes or skeletons for solid objects bounded by arbitrary polygonal meshes directly is yet to be fully explored. In this paper, we expand the use of diffusion equations to approximate medial axes of arbitrary 3D solids represented by polygonal meshes based on their differential properties. It offers an alternative but natural way for medial axis extraction for commonly used 3D polygonal models. By solving the PDE along time axis, our system can not only quickly extract diffusion-based medial axes of input meshes, but also allow users to visualize the extraction process at each time step. In addition, our model provides users a set of manipulation toolkits to sculpt extracted medial axes, then use diffusion-based techniques to recover corresponding deformed shapes according to the original input datasets. This skeleton-based shape manipulation offers a fast and easy way for animation and deformation of complicated solid objects.
Programming in Objective-C
Authors: Stephen Kochan
Venue:  (2003)

Programming in Objective-C is a concise, carefully written tutorial on the basics of Objective-C and object-oriented programming. The book makes no assumption about prior experience with object-oriented programming languages or with the C language (upon which Objective-C is based). And because of this, both novice and experienced programmers alike can use this book to quickly and effectively learn the fundamentals of Objective-C. Readers can also learn the concepts of object-oriented programming without having to first learn all of the intricacies of the underlying procedural language (C). This approach, combined with many small program examples and exercises at the end of each chapter, makes it ideally suited for either classroom use or self-study. Growth is expected in this language. At the January 2003 MacWorld, it was announced that there are 5 million Mac OS X users and each of their boxes ships with Objective-C built in.
Adaptive grid optical tomography
Authors: Ivo Ihrke, Marcus Magnor
Venue: Graphical Models (2006)

Image-based modeling of semi-transparent, dynamic phenomena is a challenging task. We present an optical tomography method that uses an adaptive grid for the reconstruction of a three-dimensional density function from its projections. The proposed method is applied to reconstruct thin smoke and flames volumetrically from synchronized multivideo recordings. Our adaptive reconstruction algorithm computes a time-varying volumetric model, that enables the photorealistical rendering of the recorded phenomena from arbitrary viewpoints. In contrast to previous approaches we sample the underlying unknown, three-dimensional density function adaptively which enables us to achieve a higher effective resolution of the reconstructed models.
Concepts of high-level-language computer architecture
Authors: Yaohan Chu
Venue: ACM SIGMICRO Newsletter (1975)

High-level-language (HLL) computer architecture refers to those architecture which can accept one or more high-level languages (such as Fortran, Alogl, Snobol, etc.). This paper classifies the HLL computer architecture into four types (von Neumann architecture, syntax-oriented architecture, indirect execution architecture, and direct execution architecture) based on the criterion of proximity in lexicality, syntax and semantics between the high-level language and the machine language. It then introduce es concepts of these high-level-language architecture. A simple example is employed to illustrate the differences among these four types of architecture.
Nonparametric comparisons with k2 > 2 controls using normal scores and savage statistics
Authors: Eleanne Solorzano
Venue: Computational Statistics (2006)

Distribution-free methods are considered for comparing k 1 treatments to k 2 controls in the one-way layout. Using normal scores statistics, one-sided tests are developed for k 1 treatment versus k 2 control comparisons of medians. Using Savage statistics, analogous results are developed for comparing scale parameters of the treatments to the controls with non-negative data. Upper bounds for the Type I error probabilities are established for general k 1 and k 2 using the concept of partitions and a union---intersection algorithm. The code for the computations in this manuscript is available at http ://wsbe.unh.edu/WSBE_FacultyStaff / Faculty_Staff.cfm under the author's name. Asymptotic relative efficiencies of these tests relative to their competitors are identical to their two-sample counterparts.
Game Scripting Mastery (Premier Press Game Development (Paperback))
Authors: Alex Varanese
Venue:  (2002)

As a game programmer, you realize the importance of creating stunningly realistic characters and captivating plots- players should lose themselves in your game. You also understand the attraction of modding, and recognize the need to design a game that allows players to reshape it to fit their own vision. So how do you create a game that is all things to all people? Through scripting-creating a custom-designed language. This comprehensive book contains everything you need to know in order to easily script and control your in-game entities and environments, as well as how to give players the ability to write mods and extensions. With a foreword by legendary game designer John Romero, Game Scripting Mastery is the serious game programmer's one-stop guide to scripting. Features Fully explains the design and implementation of an entire procedural scripting system from scratch. It contains primers covering assembly language, compiler theory, and virtual machine theory to ensure that even intermediate coders will be able to master the techniques. The CD includes executable versions of all demo programs, including the final version of XtremeScript, a full-featured scripting system read to use immediately.