ppxscal/embedding_network huggingface dataset:
Automating the detection of breaks in continuous user experience with computer games
Authors: Tim Marsh, Kiyoung Yang, Cyrus Shahabi, Wee Ling Wong, Luciano Nocera, Eduardo Carriazo, Aditya Varma, Hyunjin Yoon, Chris Kyriakakis
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper describes an approach towards automating the identification of design problems with three-dimensional mediated or gaming environments through the capture and query of user-player behavior represented as a data schema that we have termed "immersidata". Analysis of data from a study of an educational computer game that we are developing shows that this approach is an effective way to pinpoint potential usability or design problems occurring in unfolding situational and episodic events that can interrupt or break user experience. As well as informing redesign, a key advantage of this cost-effective approach is that it considerably reduces the time evaluators spend analyzing hours of videoed study material.
Overview of Air Traffic Control using an SIMD COTS system
Authors: Stewart Reddaway, Will Meilander, Johnnie Baker, Justin Kidman
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Air Traffic Control is an important application with demanding real-time database processing requirements. Systems that have been implemented using current approaches have typically been expensive, late, over-budget and have not performed up to specification. In part this is because, in attempting to meet the real-time requirements, developers have been driven touse complex algorithms and software for what are inherently relatively simple requirements. Our analysis indicates that the use of modern SIMD COTS systems will enable guaranteedreal-time performance to be achieved with simpler algorithms on modest amounts of hardware. This paper covers the system, the approach to the application and some of the solution details.
Cache Miss Characterization and Data Locality Optimization for Imperfectly Nested Loops on Shared Memory Multiprocessors
Authors: Swarup Kumar Sahoo, Rajkiran Panuganti, Sriram Krishnamoorthy, P. Sadayappan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

This paper develops an algorithm to accurately characterize the number of cache misses for a class of computeintensive calculations encountered in accurate quantum chemistry models of electronic structure. The proposed approach can handle imperfectly nested loop structures, symbolic loop bounds, and non-constant dependences for a constrained class of array references. It is proposed in the context of tensor contraction computations, and extends previous work on .stack distances. by Almasi et. al. and Cascaval et. al. We illustrate the application of the approach for determination of effective tile sizes and parallelization on shared-memory parallel systems.
How to Do Everything with Your iPAQ Pocket PC, Third Edition, 3 edition
Authors: Derek Ball, Barry Shilmover
Venue:  (2006)

Maximize all the powerful capabilities of your iPAQ Pocket PC with help from this easy-to-use guide. You'll learn to use the email, Internet, phone, and camera features, and enjoy all the entertainment options like movies and music. You'll also find out how to be more productive on-the-go using the mobile office software--work on documents, spreadsheets, and presentations, all in the palm of your hand. With coverage of all models, How to Do Everything with Your iPAQ Pocket PC, Third Edition is your one-stop guide for getting the most out of this versatile handheld device. Table of contentsPart I: Meet Your iPAQ and Connect!Chapter 1: Meet Your Pocket PCChapter 2: Get Started with Your iPAQ Pocket PCChapter 3: Connect Wirelessly with Your iPAQChapter 4: Use Your iPAQ PhonePart II: Get Personal with Your iPAQChapter 5: Games, Music, Books, and Movies on Your iPAQChapter 6: Take and Send Pictures with Your iPAQChapter 7: Manage Your Home Entertainment with Your iPAQChapter 8: Manage Your Finances on the Go with Microsoft Money or QuickenChapter 9: Navigate with GPS on Your HP iPAQPart III: Work with Your Mobile OfficeChapter 10: Use Word Mobile to Read and Write DocumentsChapter 11: Use Excel Mobile to Work with NumbersChapter 12: Use Outlook Mobile to Take Control of Your Mobile LifeChapter 13: Take Your Presentations on the Road with Your iPAQChapter 14: Use Your iPAQ in Your EnterprisePart IV: Optimize and Secure Your iPAQChapter 15: Optimize Your iPAQChapter 16: Secure Your iPAQAppendix A: Troubleshooting Your iPAQAppendix B: Where to Go for More InformationIndex
LAMP: 3D layered, adaptive-resolution, and multi-perspective panorama&mdash;a new scene representation
Authors: Zhigang Zhu, Allen R. Hanson
Venue: Computer Vision and Image Understanding (2004)

A compact visual representation, called the 3D layered, adaptive-resolution, and multi-perspective panorama (LAMP), is proposed for representing large-scale 3D scenes with large variations of depths and obvious occlusions. Two kinds of 3D LAMP representations are proposed: the relief-like LAMP and the image-based LAMP. Both types of LAMPs concisely represent almost all the information from a long image sequence. Methods to construct LAMP representations from video sequences with dominant translation are provided. The relief-like LAMP is basically a single extended multi-perspective panoramic view image. Each pixel has a pair of texture and depth values, but each pixel may also have multiple pairs of texture-depth values to represent occlusion in layers, in addition to adaptive resolution changing with depth. The image-based LAMP, on the other hand, consists of a set of multi-perspective layers, each of which has a pair of 2D texture and depth maps, but with adaptive time-sampling scales depending on depths of scene points. Several examples of 3D LAMP construction for real image sequences are given. The 3D LAMP is a concise and powerful representation for image-based rendering.
A local version of the Pawłucki-Pleśniak extension operator
Authors: M. Altun, A. Goncharov
Venue: Journal of Approximation Theory (2005)

Using local interpolation of Whitney functions, we generalize the Pawłucki and Pleśniak approach to construct a continuous linear extension operator. We show the continuity of the modified operator in the case of generalized Cantor-type sets without Markov's Property.
Moderately hard, memory-bound functions
Authors: Martin Abadi, Mike Burrows, Mark Manasse, Ted Wobber
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. It has been suggested that such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we research moderately hard functions that most recent systems will evaluate at about the same speed. For this purpose, we rely on memory-bound computations. We describe and analyze a family of moderately hard, memory-bound functions, and we explain how to use them for protecting against abuses.
Algorithms and Databases in Bioinformatics: Towards a Proteomic Ontology
Authors: Mario Cannataro, Pietro Hiram Guzzi, Tommaso Mazza, Giuseppe Tradigo, Pierangelo Veltri
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Classification of bioinformatics tools and databases, as well as modelling of biological processes, can help the design of complex in silico experiments. After presenting a survey of bioinformatics algorithms and biological databases, we describe a first design of an ontology for the Proteomics domain. The ontology can be used either to better understand biological processes or to enhance design of distributed bioinformatics applications.
A combined heuristic optimization technique
Authors: H. Schmidt, G. Thierauf
Venue: Advances in Engineering Software (2005)

Realistic problems of structural optimization are characterized by non-linearity, non-convexity and by continuous and/or discrete design variables. There are non-linear dependencies between the optimised parameters. Real-world problems are rarely decomposable or separable. In this contribution a combined heuristic algorithm is described which is well suited for problems, for which the application-requirements of gradient-based algorithms are not fulfilled. The present contribution describes a combination of the Threshold Accepting Algorithm with Differential Evolution with particular emphasis on structural optimization, it can be classified as a Hybrid Evolutionary Algorithm. The Threshold Accepting Algorithm is similar to Simulated Annealing. Differential Evolution is based on Genetic Algorithms.
The Cover Time of Random Regular Graphs
Authors: Colin Cooper, Alan Frieze
Venue: SIAM Journal on Discrete Mathematics (2005)

Let $r \ge 3$ be constant, and let ${\cal G}_{r}$ denote the set of r-regular graphs with vertex set V = {1,2,...,n}. Let G be chosen randomly from ${\cal G}_{r}$. We prove that with high probability (\whp) the cover time of a random walk on G is asymptotic to $\frac{r-1}{r-2}\;n\log n$.
Optimal control of stochastic dynamic systems with past history and poison switchings
Authors: V. S. Korolyuk, V. K. Yasinskii, S. V. Antonyuk
Venue: Cybernetics and Systems Analysis (2005)

An optimal control problem for systems of stochastic differential-functional linear equations with past history and Poisson switchings is formulated. The Bellman equation is solved for this problem.
Model of an intellectual search engine represented by the fuzzy sets theory
Authors: Hristina Moneva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In this report an attempt to explain the role and place of the fuzzy set theory with its typical techniques and methods in the process of the knowledge representation is proffered. A usage of the fuzzy sets and fuzzy logic for organizing a knowledge base is described. Their role with their typical characteristics in the process of designing a system for searching and classifying documents based on knowledge is examined. A generalized model of an intellectual system for searching and classifying documents in the Web is proposed.
Autonomic Computing " Panacea or Poppycock?
Authors: Roy Sterritt, Mike Hinchey
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Autonomic Computing arose out of a need for a means to cope with rapidly growing complexity of integrating, managing, and operating computer-based systems as well as a need to reduce the total cost of ownership of todayýs systems. Autonomic Computing (AC) as a discipline was proposed by IBM in 2001, with the vision to develop self-managing systems [1]. As the name implies, the influence for the new paradigm is the human body's autonomic system, which regulates vital bodily functions such as the control of heart rate, the bodyýs temperature and blood flow ¿ all without conscious effort. The vision is to create selfware through self-* properties. The initial set of properties, in terms of objectives, were self-configuring, self-healing, selfoptimizing and self-protecting, along with attributes of self-awareness, self-monitoring and self-adjusting. This self-* list has grown: self-anticipating, self-critical, selfdefining, self-destructing, self-diagnosis, self-governing, self-organized, self-reflecting, and self-simulation, for instance [2][3].
Real-Time GC in JeRTy"VM Using the Return-Barrier Method
Authors: Hideaki Saiki, Yoshiharu Konaka, Tsuneyasu Komiya, Masahiro Yasugi, Taiichi Yuasa
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

Runtime systems for applications written in certain languages such as Java¿ and Lisp usually have a garbage collection (GC) feature to make efficient use of memory. With this feature, the system, before running out of memory space, automatically reclaims unnecessary fragments of memory at one burst and recycles them for use by applications. In conventional implementations, however, the system has to suspend the execution of applications while carrying out GC, which renders GC generally unsuitable for real-time processing systems.As a solution to this problem, Yuasa, et al. of Kyoto University developed the return-barrier method based on snapshot GC.Return-barrier enhances real-time GC processing over the original snapshot GC.Some reports have been published on the evaluation of the return-barrier method in the Lisp environment such as Kyoto Common Lisp (KCL).In this paper, we report the implementation of the return-barrier method for JeRty¿VM, which is a real-time environment for embedded Java applications developed by OMRON Corporation, and its performance improvement over the conventional GC in JeRTyVM.
Detection of Linear and Cubic Interpolation in JPEG Compressed Images
Authors: Andrew C. Gallagher
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

A novel algorithm is introduced that can detect the presence of interpolation in images prior to compression as well as estimate the interpolation factor. The interpolation detection algorithm exploits a periodicity in the second derivative signal of interpolated images. The algorithm performs well for a wide variety of interpolation factors, both integer factors and non-integer factors. The algorithm performance is noted with respect to a digital camera's "digital zoom" feature. Overall, the algorithm has demonstrated robust results and might prove to be useful for situations where an original resolution of the image determines the action of an image processing chain.
Development of visual communication applications by combining multisource video data
Authors: Phuong H. Nguyen, Jozef Hatala, Gilles Privat, Pascal Sicard
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

In this paper, we present an ambiance sharing application based on multimedia streams. The functionalities toward an ambient communication are studied. We described also the architecture of our application and give the results of its experimentations in various contexts. From these works, we define a new application' architecture based on a flexible, adaptive and distributed multimedia framework.
Power Control and Multiuser Diversity in Multiple Access Channels with Two Time-Scale Fading
Authors: Alex S. C. Leong, Jamie S. Evans, Subhrakanti Dey
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

We derive the optimal power control strategy to maximize the sum rate of a multiple access channel with two time-scale fading, where transmitters have access to each of the other usersý ýslowý fading information and the statistics of the ýfastý fading, but no knowledge of the instantaneous fast fading states. Assuming identical fast fading distributions for all users, it is found that the optimal strategy is to let at most one user transmit, with the user transmitting the one with the ýbestý slow fading conditions. An example with users undergoing lognormal shadowing and Rayleigh fast fading is considered, and capacity comparisons made. Simple sub-optimal power control schemes which provide close to optimal performance in certain favorable channel conditions are also proposed and analysed.
A compressible finite volume formulation for large eddy simulation of turbulent pipe flows at low Mach number in Cartesian coordinates
Authors: Xiaofeng Xu, Joon Sang Lee, Richard H Pletcher
Venue: Journal of Computational Physics (2005)

A finite volume formulation for large eddy simulation (LES) of turbulent pipe flows based on the compressible time-dependent three-dimensional Navier-Stokes equations in Cartesian coordinates with non-Cartesian control volumes is presented. The small scale motions are modeled by a dynamic subgrid-scale (SGS) model. A dual-time stepping approach with time derivative preconditioning is employed to enable the simulations to run efficiently at low Mach numbers. The equations with primitive variables, (p,u,v,w,T), are solved with an implicit lower-upper-symmetric-Gauss-Seidel (LU-SGS) scheme. An isothermal turbulent pipe flow at two Reynolds numbers, and a turbulent pipe flow with a low heat transfer are simulated to evaluate this compressible LES finite volume formulation. The results agree very well with the experimental data and DNS results, verifying the accuracy of the present scheme.
An empirical study of "bogon" route advertisements
Authors: Nick Feamster, Jaeyeon Jung, Hari Balakrishnan
Venue: ACM SIGCOMM Computer Communication Review (2005)

An important factor in the robustness of the interdomain routing system is whether the routers in autonomous systems (ASes) filter routes for "bogon" address space---i.e., private address space and address space that has not been allocated by the Internet Assigned Numbers Authority (IANA). This paper presents an empirical study of bogon route announcements, as observed at eight vantage points on the Internet. On average, we observe several bogon routes leaked every few days; a small number of ASes also temporarily leak hundreds of bogon routes. About 40% of these bogon routes are not withdrawn for at least a day. We observed 110 different ASes originating routes for bogon prefixes and a few ASes that were responsible for advertising a disproportionate number of these routes. We also find that some ASes that do filter unallocated prefixes continue to filter them for as long as five months after they have been allocated, mistakenly filtering valid routes. Both of these types of delinquencies have serious implications: the failure to filter valid prefixes can could make nefarious activities such as denial of service attacks difficult to trace; failure to update filters when new prefixes are allocated prevents legitimate routes from being globally visible.
Information Assurance for the Enterprise: A Roadmap to Information Security, 1 edition
Authors: Corey Schou, Daniel Paul Shoemaker
Venue:  (2006)

Going beyond the technical coverage of computer and systems security measures, Information Assurance for the Enterprise provides readers an overarching model for information assurance for businesses, government agencies, and other enterprises needing to establish a comprehensive plan. All the components of security and how they relate are featured, and readers will also be shown how an effective security policy can be developed. Topics like asset identification, human factors, compliance with regulations, personnel security, risk assessment and ethical considerations are covered, as well as computer and network security tools and methods. This is one of the only texts on the market that provides an up-to-date look at the whole range of security and IA topics. In post-9/11 times, managers and IT professionals need to address a wide range of security-related issues, and develop security systems that take all these diverse factors into account. As someone who has worked extensively with the U.S. State Department and other governmental agencies, Corey Schou is uniquely positioned to write the definitive book on the subject; and Daniel Shoemaker is a professor and consultant to the Department of Homeland Security in matters of Information Assurance policy. Table of contentsPart I The Organizational/Policy Domain1 Organizational Security Policy and Planning2 Defined and Documented Infrastructure3 Education and Awareness4 Asset Management5 Business Continuity6 Legal and Regulatory Compliance Part II The Managerial/Administrative Domain7 Building Security Functions Into Development8 Personnel Security 9 Physical SecurityPart III The Operational/Technical Domain10 Access Control11 Operations Security12 Network Security13 Application and System Software Security14 Operational Risk Assessment and AuditPart IV The Community/Contextual Domain15 Ethics 16 A Standard Implementation Model Glossary Index
Quantifying the Performability of Cluster-Based Services
Authors: Kiran Nagaraja, Gustavo Gama Ricardo Bianchini, Richard P. Martin, Wagner Meira Jr. Thu D. Nguyen
Venue: IEEE Transactions on Parallel and Distributed Systems (2005)

In this paper, we propose a two-phase methodology for systematically evaluating the performability (performance and availability) of cluster-based Internet services. In the first phase, evaluators use a fault-injection infrastructure to characterize the service's behavior in the presence of faults. In the second phase, evaluators use an analytical model to combine an expected fault load with measurements from the first phase to assess the service's performability. Using this model, evaluators can study the service's sensitivity to different design decisions, fault rates, and other environmental factors. To demonstrate our methodology, we study the performability of a multitier Internet service. In particular, we evaluate the performance and availability of three soft state maintenance strategies for an online bookstore service in the presence of seven classes of faults. Among other interesting results, we clearly isolate the effect of different faults, showing that the tier of Web servers is responsible for an often dominant fraction of the service unavailability. Our results also demonstrate that storing the soft state in a database achieves better performability than storing it in main memory (even when the state is efficiently replicated) when we weight performance and availability equally. Based on our results, we conclude that service designers may want an unbalanced system in which they heavily load highly available components and leave more spare capacity for components that are likely to fail more often.
Information retrieval by metabrowsing: Research Articles
Authors: F. Wiesman, H. J. van den Herik, A. Hasman
Venue: Journal of the American Society for Information Science and Technology (2004)

This article investigates a new, effective browsing approach called metabrowsing. It is an alternative for current information retrieval systems, which still face six prominent difficulties. We identify and classify the difficulties and show that the metabrowsing approach alleviates the difficulties associated with query formulation and missing domain knowledge. Metabrowsing is a high-level way of browsing through information: instead of browsing through document contents or document surrogates, the user browses through a graphical representation of the documents and their relations to the domain. The approach requires other cognitive skills from the user than what is currently required. Yet, a user evaluation in which the metabrowsing system was compared with an ordinary query-oriented system showed only some small indicatory differences in effectiveness, efficiency, and user satisfaction. We expect that more experience with metabrowsing will result in a significantly better performance difference. Hence, our conclusion is that the development of new cognitive skills requires some time before the technologies are ready to be used. &copy; 2005 Wiley Periodicals, Inc.