ppxscal/embedding_network huggingface dataset:
High frequency word entrainment in spoken dialogue
Authors: Ani Nenkova, Agustín Gravano, Julia Hirschberg
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Cognitive theories of dialogue hold that entrainment, the automatic alignment between dialogue partners at many levels of linguistic representation, is key to facilitating both production and comprehension in dialogue. In this paper we examine novel types of entrainment in two corpora---Switchboard and the Columbia Games corpus. We examine entrainment in use of high-frequency words (the most common words in the corpus), and its association with dialogue naturalness and flow, as well as with task success. Our results show that such entrainment is predictive of the perceived naturalness of dialogues and is significantly correlated with task success; in overall interaction flow, higher degrees of entrainment are associated with more overlaps and fewer interruptions.
CD-PAN: a protocol for peer-to-peer content distribution in a weakly connected and heterogeneous personal area network
Authors: Shiva Chaitanya, Prasenjit Sarkar
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

This paper presents CD-PAN, a mechanism to automatically distribute content objects to weakly connected heterogeneous content devices in a personal area network without a global namespace. The content devices under consideration range from cell phones to personal computers, each of which is capable of downloading content objects on its own. The proposed mechanism alleviates the need to manually synchronize content that is downloaded to each of these content devices. A simulation study shows that CD-PAN outperforms other prefetching schemes in all our workload experiments. The performance improvement tended to increase with increase in popularity distribution skew, temporal locality and frequency of content creation/updates. The performance of CD-PAN increases when pair-wise communication capabilities are higher, and also adapts well to increasing power and metadata constraints.
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
Authors: Srivatsava Daruru, Nena M. Marin, Matt Walker, Joydeep Ghosh
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a collaborative filtering (CF) solution to the Netflix Prize problem [1] based on weighted coclustering [5]. The dataflow library we use facilitates the development of sophisticated parallel programs designed to fully utilize commodity multicore hardware, while hiding traditional difficulties such as queuing, threading, memory management, and deadlocks. The dataflow CF implementation first compresses the large, sparse training dataset into co-clusters. Then it generates recommendations by combining the average ratings of the co-clusters with the biases of the users and movies. When configured to identify 20x20 co-clusters in the Netflix training dataset, the implementation predicted over 100 million ratings in 16.31 minutes and achieved an RMSE of 0.88846 without any fine-tuning or domain knowledge. This is an effective real-time prediction runtime of 9.7 us per rating which is far superior to previously reported results. Moreover, the implemented co-clustering framework supports a wide variety of other large-scale data mining applications and forms the basis for predictive modeling on large, dyadic datasets [4, 7].
In Stable Orbit: An Initial Assessment of Dispositional Changes Arising from Learning Using the Citizenship Education Videogame Space Station Leonis
Authors: Kenneth Y. T. Lim, Yam San Chee
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

This paper presents an initial analysis of data obtained from an implementation of citizenship education using the videogame Space Station Leonis in two Singapore classrooms. The paper highlights the importance of citizenship education today and describes how game environments can be used to foster identity construction as part of the broader agenda of citizenship education in Singapore. The data presented comprises a series of t-tests which were run between pre-and post-test questionnaires on attitudes related to civic consciousness and citizehsnhip administered to seventy-seven students who participated in the design intervention. Analysis of the results suggests that such participation can result in significant and positive changes in attitudes of relevance to various aspects of citizenship.
Enhancing Navigation Information with Tactile Output Embedded into the Steering Wheel
Authors: Dagmar Kern, Paul Marshall, Eva Hornecker, Yvonne Rogers, Albrecht Schmidt
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

Navigation systems are in common use by drivers and typically present information using either audio or visual representations. However, there are many pressures on the driver's cognitive systems in a car and navigational systems can add to this complexity. In this paper, we present two studies which investigated how vibro-tactile representations of navigational information, might be presented to the driver via the steering wheel to ameliorate this problem. Our results show that adding tactile information to existing audio, or particularly visual representations, can improve both driving performance and experience.
openSUSE Linux Unleashed, 1st edition
Authors: Michael McCallister
Venue:  (2007)

DVD Includes openSUSE 10.3 openSUSE Linux Unleashed presents comprehensive coverage of the community version of SUSE Linux, one of the most popular and most complete Linux distributions in the world. This book provides detailed information on installing, using, and administering openSUSE. Youll learn how to unleash the vast array of software products included in openSUSE so that you can use it as a desktop computer, as a professional workstation, or as a powerful server. openSUSE Linux Unleashed includes a broad range of coverage: from using software you need everydaysuch as email clients, web browsers, and productivity software including the OpenOffice.org productivity suiteto configuring and administering a wide range of network and server products, such as the Apache web server, and MySQL database. Additionally, this book provides details on openSUSEs acclaimed YaST administration tools, web programming, networking, and choosing from a wide selection of graphical interfaces and desktop environments, including both KDE and GNOME. Plan your openSUSE installation based on your computing needs Configure and use the X Window Systemthe Linux graphical interfaceand the two primary desktop environments for LinuxKDE and GNOME Run OpenOffice.org and other productivity tools Create your own websites and weblogs Manage the kernel and its modules Set up networks Run the Apache web server Use the LAMP web programming suite: Linux, Apache, MySQL, and the scripting languages Perl, Python, and PHP Play music, video, and games Preserve an existing Windows installation for dual-boot launching DVD-ROM includes: The complete openSUSE 10.3 binary distributionthe equivalent of five CDspacked with thousands of applications and utilities The latest Apache web server Samba for Windows-based file and printer sharing The OpenOffice.org office productivity suite Games for the desktop Hundreds of additional programs, utilities, and development tools Register your book at www.samspublishing.com/register for convenient access to updates and other resources related to this book. Michael McCallister has been making computing easier for the full spectrum of users for more than a decade. Currently a technical writing consultant with Compuware, he is also a senior member of the Society for Technical Communication and the National Writers Union. He has run a SUSE Linux installation since version 5.3 and knows firsthand how far the distribution has come over the years. Besides SUSE Linux Unleashed, he is the author of Computer Certification Handbook (Arco Press), and has had articles published in Linux Journal, SearchEnterpriseLinux.com, Java Developers Journal, Internet Voyager, and Isthmus. Category:Operating Systems/Linux Covers:openSUSE Linux 10.3 User Level:IntermediateAdvanced $49.99 USA / $56.99 CAN / 35.99 Net UK (inc. of VAT) 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
Potential field approach for haptic selection
Authors: Jean Simard, Mehdi Ammi, Flavien Picon, Patrick Bourdot
Venue: Proceedings of Graphics Interface 2009 (2009)

In a number of 3d applications and especially in Computer Aided Design (CAD), the accuracy of the selection process is important for subsequent operations. In this paper, we propose a mathematical model to manage haptic selection of topological entities (vertices, edges, faces...) used in CAD. We have developed an analytical expression with a generic and unified representation based on potential fields. The result is a simplified model for software implementation. Moreover, these functions introduce a smooth, accurate and stable force profile.
The PML for rough surface scattering
Authors: Simon N. Chandler-Wilde, Peter Monk
Venue: Applied Numerical Mathematics (2009)

In this paper we investigate the use of the perfectly matched layer (PML) to truncate a time harmonic rough surface scattering problem in the direction away from the scatterer. We prove existence and uniqueness of the solution of the truncated problem as well as an error estimate depending on the thickness and composition of the layer. This global error estimate predicts a linear rate of convergence (under some conditions on the relative size of the real and imaginary parts of the PML function) rather than the usual exponential rate. We then consider scattering by a half-space and show that the solution of the PML truncated problem converges globally at most quadratically (up to logarithmic factors), providing support for our general theory. However we also prove exponential convergence on compact subsets. We continue by proposing an iterative correction method for the PML truncated problem and, using our estimate for the PML approximation, prove convergence of this method. Finally we provide some numerical results in 2D.
Tutorial Dialogue as Adaptive Collaborative Learning Support
Authors: Rohit Kumar, Carolyn P. Rosé, Yi-Chia Wang, Mahesh Joshi, Allen Robinson
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

In this paper we investigate the role of reflection in simulation based learning by manipulating two independent factors that each separately lead to significant learning effects, namely whether students worked alone or in pairs, and what type of support students were provided with. Our finding is that in our simulation based learning task, students learned significantly more when they worked in pairs than when they worked alone. Furthermore, dynamic support implemented with tutorial dialogue agents lead to significantly more learning than no support, while static support was not statistically distinguishable from either of the other two conditions. The largest effect size in comparison with the control condition of individuals working alone with no support was Pairs+Dynamic support, with an effect size of 1.24 standard deviations.
An empirical assessment of attitude toward computers, motivation, perceived satisfaction from the e-learning system, and previous academic performance and their contribution to persistence of college student athletes enrolled in e-learning courses
Authors: Yair Levy
Venue:  (2008)

In recent years, the application of Information Technologies has fostered a tremendous growth in e-learning courses at colleges and universities in the United States. Subsequently, some colleges and universities have reported dropout rates of over 60% in e-learning courses. Therefore, the persistence of identifiable groups of students enrolled in e-learning courses has garnered increased attention and research. Information Systems researchers suggested that studies of persistence e-learning courses identify and investigate specific constructs as well as identifiable target populations. Furthermore, as a separate and identifiable group, the college student athlete has received extensive coverage in the research literature, however, limited attention for their dropout in e-learning courses. Therefore, this research investigated persistence in e-learning courses of an identified population of college student athletes. In order to predict the persistence of college student athletes enrolled in e-learning courses, this research an empirically assessed a conceptual model, e-Learning Persistence Model (e-LPM). e-LPM was based on selected constructs that have previously shown tendencies to persistence in e-learning courses. This research, therefore, empirically assessed the constructs of e-LPM in the predication of persistence in a population of 187 college student athletes enrolled in e-learning courses. The constructs of e-LPM includes, student's attitude toward computers, student's intrinsic and extrinsic motivation, student's perceived satisfaction from the e-learning system, and student's previous academic performance measures (high school GPA and SAT score). The e-LPM constructs were empirically assessed and weighted in order to evaluate their contribution to persistence in e-learning courses. Survey response data from college student athletes at the beginning and at the end of e-learning courses were quantitatively analyzed using Ordinal Logistic Regression, ANOVA, chi-square, and t-test statistical techniques. Results of this research showed that e-LPM was able to predict persistence in e-learning course 81.4% of the time. The previous academic performance measure of GPA was shown to significantly predict e-learning course persistence in the research population. In the analysis of gender, female college student athletes exhibited higher intrinsic and extrinsic motivation than their male counterparts.
The Best Damn Server Virtualization Book Period: Including Vmware, Xen, and Microsoft Virtual Server
Authors: Rogier Dittner, David Rule
Venue:  (2007)

Server Sprawl and escalating IT costs have managers and system administrators scrambling to find ways to cut costs and reduce Total Cost of Ownership of their physical infrastructure. Combining software applications onto a single server, even if those applications are from the same software vendor, can be dangerous and problems hard to troubleshoot. Virtualization allows you to consolidate many servers onto a single physical server reducing hardware, electrical, cooling, and administrative costs. These virtual servers run completely independent of each other so if one crashes the other are not affected. Planning and implementing a server consolidation is a complex process. This book details the requirements for such a project, includes sample forms and templates, and delivers several physical to virtual migration strategies which will save both time and costs. Readers of this book will easily be able to plan and deploy VMware, Microsoft Virtual Server, and Xen. Key Features:* Create a virtual network to exchange information or provide a service to other virtual machines or computers.* Use virtualization to support removable media such as CD or DVD optical disks* Reduce server costs, administration overhead, and complexity
Visual examples of recursion
Authors: Ben Stephenson
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

Because recursion is generally introduced early in the curriculum, the range of problems that can be used to motivate its study is limited. We describe three interesting visual problems that use recursion effectively. Each problem demonstrates the utility of recursion in an engaging way while being appropriate for students nearing the end of CS1.
Interoperability of Monitoring Tools with JINEXT
Authors: Włodzimierz Funika, Arkadiusz Janik
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Monitoring tools are commonly used in modern software engineering. They provide feedback information for both development and for productional phases. The use of monitoring tools is especially important in distributed and grid systems, where different aspects of the environment have to be analyzed/manipulated by different types of tools, to support the process of program development. However, in order to avoid improper influences of one tool on other ones these tools must cooperate, what is called interoperability. In this paper we present an interoperability model designed and used in the JINEXT extension to OMIS specification, intended to provide interoperability for OMIS-compliant tools. We present a few practical experiments done with JINTOP --the reference implementation of JINEXT.
Roles, rights, and responsibilities: Better governance through decision rights automation
Authors: Alexander Kofman, Avi Yaeli, Tim Klinger, Peri Tarr
Venue: Proceedings of the 2009 ICSE Workshop on Software Development Governance (2009)

At its essence software development governance is about guiding the development organization so that it produces value that aligns with the needs of the business. As software development platforms mature they provide increasingly sophisticated capabilities for process measurement and guidance. These new capabilities in turn offer an excellent opportunity for governance tools to help guide the development. In this paper we discuss a model of the development organization that includes: roles, responsibilities, decisions, rights, artifacts and their lifecycles. We show how this model can be elicited and deployed as part of a governance solution to guide the development organization and provide a description of a prototype we have built to automate this process. We conclude with a discussion and important directions for future work in the area.
An improved particle correction procedure for the particle level set method
Authors: Zhaoyuan Wang, Jianming Yang, Frederick Stern
Venue: Journal of Computational Physics (2009)

The particle level set method [D. Enright, R. Fedkiw, J. Ferziger, I. Mitchell, A hybrid particle level set method for improved interface capturing, J. Comput. Phys. 183 (2002) 83-116.] can substantially improve the mass conservation property of the level set method by using Lagrangian marker particles to correct the level set function in the under-resolved regions. In this study, the limitations of the particle level set method due to the errors introduced in the particle correction process are analyzed, and an improved particle correction procedure is developed based on a new interface reconstruction scheme. Moreover, the zero level set is ''anchored'' as the level set functions are reinitialized; hence the additional particle correction after the level set reinitialization is avoided. With this new scheme, a well-defined zero level set can be obtained and the disturbances to the interface are significantly reduced. Consequently, the particle reseeding operation will barely result in the loss of interface characteristics and can be applied as frequently as necessary. To demonstrate the accuracy and robustness of the proposed method, two extreme particle reseeding strategies, one without reseeding and the other with reseeding every time step, are applied in several benchmark advection tests and the results are compared with each other. Three interfacial flow cases, a 2D surface tension driven oscillating droplet, a 2D gas bubble rising in a quiescent liquid, and a 3D drop impact onto a liquid pool are simulated to illustrate the advantages of the current method over the level set and the original particle level set methods with regard to the smoothness of geometric properties and mass conservation in real physical applications.
Efficient algorithms for path problems in weighted graphs
Authors: Guy Blelloch
Venue:  (2008)

Problems related to computing optimal paths have been abundant in computer science since its emergence as a field. Yet for a large number of such problems we still do not know whether the state-of-the-art algorithms are the best possible. A notable example of this phenomenon is the all pairs shortest paths problem in a directed graph with real edge weights. The best algorithm (modulo small polylogarithmic improvements) for this problem runs in cubic time, a running time known since the 1960s (by Floyd and Warshall). Our grasp of many such fundamental algorithmic questions is far from optimal, and the major goal of this thesis is to bring some new insights into efficiently solving path problems in graphs. We focus on several path problems optimizing different measures: shortest paths, maximum bottleneck paths, minimum nondecreasing paths, and various extensions. For the all-pairs versions of these path problems we use an algebraic approach. We obtain improved algorithms using reductions to fast matrix multiplication. For maximum bottleneck paths and minimum nondecreasing paths we are the first to break the cubic barrier, obtaining truly subcubic strongly polynomial algorithms. We also consider a nonalgebraic, combinatorial approach, which is considered more efficient in practice compared to methods based on fast matrix multiplication. We present a combinatorial data structure that maintains a matrix so that products with given sparse vectors can be computed efficiently. This allows us to obtain good running times for path problems in unweighted sparse graphs. This thesis also gives algorithms for some single source path problems. We obtain the first linear time algorithm for the single source minimum nondecreasing paths problem. We give some extensions to this, including an algorithm to find cheapest minimum nondecreasing paths. Besides finding optimal paths, we consider the related problem of finding optimal cycles. In particular, we focus on the problem of finding in a weighted graph a triangle of maximum weight sum. We obtain the first truly subcubic algorithm for finding a maximum weight triangle in a node-weighted graph. We also present algorithms for the edge-weighted case. These algorithms immediately imply good algorithms for finding maximum weight k-cliques, or arbitrary maximum weight pattern subgraphs of fixed size.
A simple algorithm for constructing perfect monolinear sona tree drawings, and its application to visual art education
Authors: Yang Liu, Godfried Toussaint
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

The traditional sona drawing art of Angola is compared from the structural point of view to similar geometric arts found in other parts of the world. A simple algorithm is proposed for constructing a sub-class of sona drawings, called perfect monolinear sona drawings, on a given set of points in the plane, that exhibit the topological structure of a tree. The application of the tree sona drawings obtained with this algorithm to the visual arts and Discipline Based Art Education is illustrated.