ppxscal/embedding_network huggingface dataset:
Mobile Capture for Wearable Computer Usability Testing
Authors: Kent Lyons, Thad Starner
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

The mobility of wearable computers makes usability testing difficult. In order to fully understand how a user interacts with the wearable, the researcher must examine both the user's direct interactions with the computer, as well as the external context the user perceives during their interaction. We present a tool that augments a wearable computer with additional hardware and software to capture the information needed to perform a usability study in the field under realistic conditions. We examine the challenges in doing the capture and present our implementation. We also describe VizWear, a tool for examining the captured data. Finally, we present our experiences using the system for a sample user study.
Evaluation of integrated system-level checks for on-line error detection
Authors: G. A. Kanawati, V. S. S. Nair, N. Krishnamurthy, J. A. Abraham
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

This paper evaluates the capabilities of an integrated system level error detection technique using fault and error injection. This technique is comprised of two software level mechanisms for concurrent error detection, control flow checking using assertions (CCA) and data error checking using application specific data checks. Over 300,000 faults and errors were injected and the analysis of the results reveals that the CCA detects 95% of all the errors while the data checks are able to detect subtle errors that go undetected by the CCA technique. Latency measurements also shelved that the CCA technique is faster than the data checks in detecting the error. When both techniques were incorporated, the system was able to detect over 98% of all injected errors.
A coupled reactive chemical transport model: mixing cell model with two solid phases and its application
Authors: D. K. Keum, P. S. Hahn
Venue: Computers Geosciences (2003)

A research tool for modeling the reactive flow and transport of groundwater contaminants in a one-dimensional scheme is presented. The use of a mixing cell concept with two solid phases for hydrological transport, and the incorporation of chemical reactions, recoil processes and phase transformation of minerals are some features of the model that make it a versatile research tool for the modeling of a wide variety of laboratory and field experiments. The treatment of chemical reactions is general so that the model can deal with aqueous complexation, adsorption, ion exchange, precipitation reaction, and decay reaction. The model has been applied to the analysis of uranium data obtained from the weathered zone of Koongarra uranium ore deposit in Australia, which illustrates some of these features.
Design and development of system level software tool for DCS simulation
Authors: N. G. P. C. Mahalik, S. K. Lee
Venue: Advances in Engineering Software (2003)

This paper contributes the knowledge base in the context of applicability of simulation environment (analogous to virtual reality) in the Distributed Control Systems (DCS) domain. A simulated platform has been designed and developed considering the advanced features of DCS: The design and development of such simulation tool is considered to be generic in nature while advocating the System Level Software Tool (SLST) for DCS. The idea emphasizes that before designing a real DCS network/system for a target platform (e.g. machine, plant, automation system, etc.) the designer designs and tests a virtual DCS network containing the image such as control code, logical connectivity, control network database, event information, etc. of the target. Once the virtual design is over such image is transferred to the real DCS network/system. Not only DCS validation is achieved with such simulation-based design approach but also a considerable amount of design and installation time can be saved. Although, such ideas are not new in the engineering field but there are no SLST accommodating such features are available either in the DCS technology marketplace or in the research fields.
A Formal Transformation and Refinement Method for Concurrent Programs
Authors: E. J. Younger, K. H. Bennett, Z. Luo
Venue: Proceedings of the International Conference on Software Maintenance (1997)

We describe a formal approach to the modeling of existing concurrent software systems, together with a theory of program equivalence and refinement. From this basis, we show how correctness-preserving transformations and refinements may be developed and proved, allowing us to change the structure of concurrent programs whilst preserving their functional behavior. We then demonstrate the application of transformations to a simple concurrent program implementing a mutual exclusion algorithm, to illustrate its restructuring into a simpler form, and outline how the formal modeling of the program allows us to derive safety and liveness properties.
A general four-parameter non-FSAL embedded Runge--Kutta algorithm of orders 6 and 4 in seven stages
Authors: M. E. A. El-Mikkawy, M. M. M. Eisa
Venue: Applied Mathematics and Computation (2003)

The well-known Dormand-Prince embedded RK 5(4) 7FM algorithm [J. Comput. Appl. Math. 6 (1980) 19] is of the FSAL type and uses seven stages per step. This algorithm has been recommended by Shampine [Math. Comput. 46 (1986) 135] as a candidate for an efficient production RK code. In fact the new MATLAB function ode45 is based on this algorithm. Later on another efficient RK 5(4) 7 embedded algorithm, also having orders 5 and 4, is developed by Sharp and Smart [SIAM J. Sci. Comput. 14 (1993) 338]. The last algorithm uses seven stages per step and it is of the non-FSAL type. The current paper shows that by using seven stages per step a general four-parameter, non-FSAL embedded RK algorithm having orders 6 and 4 may be designed. A special algorithm, called RK 6(4) 7 new is obtained by using suitable choices for the free parameters. This new algorithm together with the RK 5(4) 7FM in [J. Comput. Appl. Math. 6 (1980) 19] and the RK 5(4) 7 in [SIAM J. Sci. Comput. 14 (1993) 338] are applied to some test problems, which have known exact solutions. It is found that the new algorithm is competitive comparing with the algorithms in [J. Comput. Appl. Math. 6 (1980) 19] and in [SIAM J. Sci. Comput. 14 (1993) 338].
Social, affective and normative aspects of learning in ICT-enriched learning environments: collaborative exploration of societal aspects of ICT
Authors: Johannes Magenheim
Venue: Proceedings of the 3.1 and 3.3 working groups conference on International federation for information processing: ICT and the teacher of the future - Volume 23 (2003)

E-learning and learning in ICT integrated learning environments will be a most important part of future learning scenarios, especially in the fields of 'Media Education' and 'ICT in Education'. ICT integrated learning scenarios often only address the cognitive level of learning and teaching processes. But to learn successfully about problems of the digital divide, cyber risks, data privacy and the impact of ICT on a changing society there is not only a need for the acquisition of knowledge. It is also necessary to change attitudes, to reflect on normative orientations in a society, to develop criteria for the evaluation of ICT related action scenarios and to enable people to gain guidelines for their own behaviour in ICT evoked conflicts and dilemmas. Therefore the paper describes different types of ICT integrated learning scenarios such as computer supported simulations, role games and strategy games which we tested with students in the department of Computer Science at the University of Paderborn. The common concept of these learning scenarios is to provide the learners not only with knowledge within the area of ICT but also to create scenarios of individual concern and consternation. Learners will face conflicts and tasks which not only challenge their cognitive abilities but also confront them with their own attitudes and feelings towards ICT evoked dilemmas.
A Theory of Behaviour Observation in Software Testing
Authors: Hong Zhu, Xudong He
Venue:  (1999)

Software testing is a process in which a software system''s dynamic behaviours are observed and analysed so that the system''s properties can be inferred from the information revealed by test executions. While the existing software testing theories might be adequate in describing the testing of sequential systems, they are not capable to describe the testing of concurrent systems that can exhibit different behaviours on the same test case due to non-determinism and concurrency. This paper presents a theory of behaviour observation in software testing. We first introduce and formally define the notion of observation scheme that characterises systematic and consistent methods of behaviour observations and recordings. We propose a set of desirable properties for observation schemes and study the relationships among the properties. We provide several constructions of observation schemes that have direct implications in current software testing practice. We then explore the relationships between different observation schemes and examine these observation schemes with regard to the desirable properties. Finally, we apply the theory to a concrete computation model for concurrent systems, high-level Petri nets, and demonstrate how to use observation scheme to define test adequacy criteria.
Laplace approximation for Bessel functions of matrix argument
Authors: Ronald W. Butler, Andrew T. A. Wood
Venue: Journal of Computational and Applied Mathematics (2003)

We derive Laplace approximations to three functions of matrix argument which arise in statistics and elsewhere: matrix Bessel Av; matrix Bessel Bv; and the type II confluent hypergeometric function of matrix argument, Ψ. We examine the theoretical and numerical properties of the approximations. On the theoretical side, it is shown that the Laplace approximations to Av, Bv and Ψ given here, together with the Laplace approximations to the matrix argument functions 1F1 and 2F1 presented in Butler and Wood (Laplace approximations to hyper-geometric functions with matrix argument, Ann. Statist. (2002)), satisfy all the important confluence relations and symmetry relations enjoyed by the original functions.
Program Segmentation for Controlling Test Coverage
Authors: F. Belli, J. Dreyer
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

In this paper we present a new control-flow based approach to dynamic testing of sequential software. A practicable number of test cases is generated by using the boundary-interior path testing strategy and by dividing the test units into test segments (program fragments composed of one statement or a sequence of statements). The size of the test segments can be adjusted by means of a parameter, i.e. the thoroughness of the test coverage can be adapted to the needs of the tester. The selection of test cases is performed by constructing path-classes for each test segment. The coverage criteria constructed by means of our approach (test segment coverage criteria) are fulfilled if at least one path from each path-class is covered. A validation of our approach is given by comparing the fault detection capabilities of test segment coverage criteria with the fault detection capabilities of branch testing, multiple-condition testing, LCSAJ testing and all-uses testing using n test cases for each item (e.g. branch) to be covered. The comparison demonstrates that, compared with the other testing criteria, greater fault detection probabilities can be achieved if a test segment coverage criterion is used.
"New Lamps for Old!"(Generalized Multiple-Valued Neurons)
Authors: Claudio Moraga, Ralph Heider
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

Contributions to multiple-valued threshold logic in the seventies are reviewed at the light of developments in the area of artificial neural networks. It is shown that it is possible to adapt methods of design of feedforward neural networks to generate networks of multiple-valued neurons to realize any multiple-valued function.
Dr. Mac: The OS X Files, 1 edition
Authors: Bob LeVitus
Venue:  (2002)

:Totally updated, enhanced and expanded for OS X Jaguar, Panther, and beyond, this book picks up where the bestselling first edition left off and offers advice, suggestions, diagnoses, prescriptions, and cures for Mac OS X users.
Debugging scientific applications in the .NET Framework
Authors: David Abramson, Greg Watson
Venue: Future Generation Computer Systems (2003)

The Microsoft .NET Framework represents a major advance over previous runtime environments available for Windows platforms and offers a number of architectural features that would be of value in scientific programs. However there are such major differences between .NET and legacy environments under both Windows and UNIX, that the effort of migrating software is substantial. Accordingly, software migration is unlikely to occur unless tools are developed for supporting this process. In this paper we discuss a 'relative debugger' called Guard which provides powerful support for debugging programs as they are ported from one environment or platform to another. We describe a prototype implementation developed for Microsoft's Visual Studio.NET--a rich interactive environment that supports code development for the .NET Framework. The paper discusses the overall architecture of Guard under VS.NET and highlights some of the technical challenges that were encountered during its development. A simple case study is provided that demonstrates the effectiveness of relative debugging in locating subtle errors that occur when even a minor upgrade is attempted from one version of a language to another. For this example, we illustrate the use of relative debugging using a Visual Basic program that was ported from Visual Basic 6.0 to Visual Basic.NET.
Variational approach to the Lane--Emden equation
Authors: Ji-Huan He
Venue: Applied Mathematics and Computation (2003)

By the semi-inverse method, a variational principle is obtained for the Lane-Emden equation, which gives much numerical convenience when applying finite element methods or Ritz method.
Mobile-Agent Planning in a Market-Oriented Environment
Authors: Jonathan Bredin, David Kotz, Daniela Rus
Venue:  (1999)

We propose a method for increasing incentives for sites to host arbitrary mobile agents in which mobile agents purchase their computing needs from host sites. We present a scalable market-based CPU allocation policy and an on-line algorithm that plans a mobile agent''s expenditure over a multihop ordered itinerary. The algorithm chooses a set of sites at which to execute and computational priorities at each site to minimize execution time while preserving a prespecified budget constraint. We present simulation results of our algorithm to show that our allocation policy and planning algorithm scale well as more agents are added to the system.
Component Customization for Object-Oriented Distributed Real-Time Software Development
Authors: Stephen S. Yau, Fariaz Karim
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

To apply the component-based approach to distributed real-time software development, it is necessary to identify components based on both functional and real-time requirements. Since a component may be acquired from external sources, it becomes necessary during integration to ensure that a component satisfies the real-time requirements of the target application software.Since these requirements vary, a component should be customizable so that during integration it can adapt itself to the specific real-time requirements of the target-distributed software. To facilitate such activities, it is preferable to have components that are capable of performing self-customization using a set of built-in services. In this paper, an object-oriented real-time component framework and two built-in customization services are presented to address the specified issues.
Start!: The No Nonsense Guide to Mac OS X Jaguar, 1 edition
Authors: Kate Bodenmiller
Venue:  (2002)

:C'mon, you're not a dummy. Heck, you're not even an idiot. So, why buy a book that talks down to you. This No-Nonsense Guide speak to you in plain, useful language that will help you learn exactly what you need to run the Mac operating system.
PhotoShop 6 Learning Studio
Authors: Steve Romaniello
Venue:  (2002)

:The Complete Hands-On Training Solution for Photoshop 6 Nothing beats the hands-on training of the Photoshop 6 Learning Studio. It's leaps beyond the video instruction offered by "other" software training products. An Adobe certified instructor steps you through self-paced, narrated, interactive lessons. Hands-on projects allow you to click through a simulated Photoshop interface to practice newly learned skills. Coupled with a powerful search engine, it's the only training you'll need to master Photoshop. Master Photoshop with Interactive Lessons and Hands-On Projects The Photoshop 6 Learning Studio is an interactive hands-on guide to the tools and functionality of Adobe's amazing image editing software. Digital imaging concepts, real-world explanations, and powerful techniques are presented in comprehensive lessons filled with video introductions, narrated interactive presentations, and hands-on projects that make mastering Photoshop simple. Interactive Step-by-Step Lessons Learn at your own pace as your personal instructor guides you through step-by-step lessons with narration, text information, a clickable simulated Photoshop interface, and tons of tips and tricks. Real-World Hands-On Projects Interactive hands-on projects using the Photoshop Learning Studio's unique Show Me, Try Me, Test Me feature allows you to practice by clicking through a simulated Photoshop interface. Show Me Watch as your personal instructor leads you through an animated sequence of steps to help you master Photoshop techniques and learn the fundamentals of digital imaging. Try Me After watching and listening to the Show Memodule, practice in a simulated Photoshop interface. Your instructor guides you through the proper steps by showing you where to click, what to select, and which keys to press. Test Me Now that you have watched the instructor and practiced the steps, it's your turn to show what you have learned. The Test Me module allows you to click through the simulated Photoshop interface, letting you know when you have chosen in the right and wrong steps. The Complete Hands-On Training Solution for Photoshop 6 Packed with all the knowledge you will need to master Photoshop 6, the Learning Studio is an interactive trainer and comprehensive reference to all the features and functionality of Photoshop. An easy-to-navigate content interface and the next-generation search engine make finding answers to your imaging questions effortless. Mastering Photoshop 6 Book FREE! The Photoshop 6 Learning Studio is based on the Mastering Photoshop 6 book. As a bonus, we've included the book as part of your purchase for FREE! Now you have all the tools you need to harness the power of Photoshop. Your personal Adobe Photoshop certified technical trainer, Steve Romaniello, will talk you through each detailed lesson at your own pace. Steve is both an artist and teacher, who conducts digital photography, pre-press and web authoring seminars nationally and is the department head of the Visual Communications Department at Pima Community College in Tucson, Arizona.
An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees
Authors: Abul Kashem, Xiao Zhou, Takao Nishizeki
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels >i leaves connected components, each having at most c vertices with label i. We present a parallel algorithm to find a c-vertex-ranking of a partial k-tree using the minimum number of ranks. This is the first parallel algorithm for c-vertex-ranking of a partial k-tree G, and takes O(\log n) time using a polynomial number of processors on the common CRCW PRAM for any positive integer c and any fixed integer k, where n is the number of vertices in G.
Packing Random Rectangles
Authors: Coffman E. G., Lueker George S., Spencer Joel, Winkler Peter M.
Venue:  (1999)

A random rectangle is the product of two independent random intervals, each being the interval between two random points drawn independently and uniformly from [0,1]. We prove that the number of items in a maximum cardinality disjoint subset of n random rectangles has the tight asymptotic bound Theta(n^{1/2}). Although tight bounds for the problem generalized to d<2 dimensions remain an open problem, we are able to show that Omega(n^{1/2}) and O((n log^{d-1}n)^{1/2}) are asymptotic lower and upper bounds. In addition, we prove that Theta(n^{d/(d+1)}) is a tight asymptotic bound for the case of random cubes.
A model of multimedia information retrieval
Authors: Carlo Meghini, Fabrizio Sebastiani, Umberto Straccia
Venue:  (1998)

A multimedia document may be seen as a complex information object, with components of different kinds, such as text, images, video and sound, all in digital form. An ever growing amount of people need to retrieve the multimedia documents that would prove useful to their information needs. Research on multimedia information retrieval (MIR) has witnessed a booming interest during the last five years or so. A prominent feature of this research trend is its simultaneous but independent materialization within several fields of computer science. The resulting richness of paradigms, methods and systems that has occurred as a result may, on the long run, result in a fragmentation of efforts prone to slow down progress. The primary goal of this study is to promote an integration of methods and techniques for MIR by contributing a conceptual model which places in a unified and coherent perspective the many efforts and results that are being produced under the label of MIR. Besides this foundational goal, the model provides the guidelines for the design of systems that are able to provide a generalized multimedia retrieval service, where the existing forms of retrieval not only coexist in harmony, but can be combined in any desired manner. Following these guidelines, and using an appropriate tool that implements the model, a designer can quickly build a prototype of the system to be developed, and use such a prototype to test its adequacy to the user''s functional requirements. The paper presents a prototype of a significant portion of such a tool. Finally, by its viewing MIR as a special form of uncertain implication, this model may be used as a basis for formal investigations on specific aspects of MIR.
Open GL Extension Guide
Authors: Eric Lengyel
Venue:  (2003)

:About the AuthorEric Lengyel (Sunnyvale, CA), best-selling author of Mathematics for 3D Game Programming and Computer Graphics, is the Chief Technology Officer for the game engine development studio Terathon Software. He holds an M.S. in Mathematics from Virginia Tech and has written several articles for gamasutra.com and the Game Programming Gems series (Charles River Media).
Slap it Together and Ship it!
Authors: Aart J. de Geus
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

In today's world of e-commerce and dot-com instant business successes, time to market constraints have taken the upper hand in almost all product decisions. In that scenario, what happens to the role of quality in the design of semiconductors and electronic systems? In this keynote, Aart de Geus addresses the trade-offs of if market's needs vs. is quality's needs and shows that what appears to be a trade-off may not be one at all.