ppxscal/embedding_network huggingface dataset:
Proceedings of the 3rd international conference on Virtual execution environments
Venue: ACM/Usenix International Conference On Virtual Execution Environments (2007)

On behalf of the Organizing Committee of the Third International Conference on Virtual Execution Environments (VEE), it is our pleasure to welcome you to San Diego, California and to the 2007 Federated Computing Research Conference (FCRC). VEE this year continues to grow both in terms of the quality of the technical contributions and in community participation. The technical program this year is outstanding. We are grateful to the truly exceptional committee of experts from the international research communities of both operating systems and programming languages, who, under the tireless and focused leadership of Steven Hand and David Tarditi, reviewed a VEE-record 70 submissions and ultimately selected 19 papers for the program, representing some of the most topical work in the field of virtualization. The committee met in person in Seattle, Washington to identify the final program. We deeply appreciate the tremendous amount of work required to accomplish this result and to the entire VEE community for continuing to submit high-quality papers.
Methods for evaluating games: how to measure usability and user experience in games?
Authors: Regina Bernhaupt, Manfred Eckschlager, Manfred Tscheligi
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

This workshop addresses current needs in the games developers' community and games industry to evaluate the overall user experience of games. New forms of interaction techniques, like gestures, eye-tracking or even bio-physiological input and feedback present the limits of current evaluation methods for user experience, and even standard usability evaluation used during game development. This workshop intends to bring together practitioners and researchers sharing their experiences using methods from HCI to explore and measure usability and user experience in games. To this workshop we also invite contributions from other disciplines (especially from the games industry) showing new concepts for user experience evaluation.
Exemplifying the Inter-Disciplinary Nature of Visualization Research
Authors: Robert F. Erbacher
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper proposes an interdisciplinary design process for the development of novel visualization techniques and discusses requirements for ensuring that such a process results in effective techniques which meet the demands of a the target user base. In essence, we are attempting to make explicit the process by which many researchers implicitly design visualizations and urge for greater explicit collaborations between fields to improve the effectiveness of visualization design. This process is dependent on the application of cognitive psychology, art and architecture, domain experts, and target users. We discuss how such a wide and disparate group must work together in an integrated fashion within the design process. We lay out the process itself as well as typical design goals. Given the importance of perception, we highlight the impact of perception, and thus cognitive psychology, on the visual interpretation process.
Electronic Marketing
Authors: Ajit Kambil, Arnold Kamis, Marios Koufaris, Bruce D. Weinberg
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Electronic marketing is an established and fast growing research stream within electronic commerce that continues to evolve. New methods, models, lessons and best practices continue to be tested, discovered, refined and advanced. Our minitrack, now in its seventh year, highlights several interesting studies done in this area. We have accepted papers in two areas: 1) quantitative, empirical research with strong theoretical underpinnings, and 2) novel methods and approaches for envisioning and creating effective online/Internet marketing theory development or managerial best practice.
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Authors: Surender Baswana, Sandeep Sen
Venue: Random Structures Algorithms (2007)

Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. A t-spanner of the graph G, for any t &ge; 1, is a subgraph (V,ES), ES &sube; E, such that the distance between any pair of vertices in the subgraph is at most t times the distance between them in the graph G. Computing a t-spanner of minimum size (number of edges) has been a widely studied and well-motivated problem in computer science. In this paper we present the first linear time randomized algorithm that computes a t-spanner of a given weighted graph. Moreover, the size of the t-spanner computed essentially matches the worst case lower bound implied by a 43-year old girth lower bound conjecture made independently by Erd&odblac;s, Bollob&aacute;s, and Bondy & Simonovits. Our algorithm uses a novel clustering approach that avoids any distance computation altogether. This feature is somewhat surprising since all the previously existing algorithms employ computation of some sort of local or global distance information, which involves growing either breadth first search trees up to &thetas;(t)-levels or full shortest path trees on a large fraction of vertices. The truly local approach of our algorithm also leads to equally simple and efficient algorithms for computing spanners in other important computational environments like distributed, parallel, and external memory. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007 Preliminary version of this work appeared in the 30th International Colloquium on Automata, Languages and Programming, pages 384&ndash;396, 2003.
Kava - using byte code rewriting to add behavioural reflection to Java
Authors: Ian Welch, Robert J. Stroud
Venue: Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6 (2001)

Many authors have proposed using byte code rewriting as a way of adapting or extending the behaviour of Java classes. There are toolkits available that simplify this process and raise the level of abstraction above byte code. However, to the best of our knowledge, none of these toolkits provide a complete model of behavioural reflection for Java. In this paper, we describe how we have used load-time byte code rewriting techniques to construct a run-time metaobject protocol for Java that can be used to adapt and customise the behaviour of Java classes in a more flexible and abstract way. Apart from providing a better semantic basis for byte code rewriting techniques, our approach also has the advantage over other reflective Java implementations that it doesn't require a modified compiler or JVM, can operate on byte code rather than source code and cannot be bypassed. In this paper we describe the implementation of Kava, our reflective implementation of Java, and discuss some of the linguistic issues and technical challenges involved in implementing such a tool on top of a standard JVM. Kava is available from http://www.cs.ncl.ac.uk/research/dependability/reflection.
Vibrational energy scavenging with Si technology electromagnetic inertial microgenerators
Authors: Christophe Serre, Alejandro P&#x00e9;rez-Rodr&#x00ed;guez, Nuria Fondevilla, Joan Ramon Morante, Josep Montserrat, Jaume Esteve
Venue: Microsystem Technologies (2007)

In this work, we present the design and optimization of an electromagnetic inertial microgenerator for energy scavenging applications, compatible with Si technology. It consists of a fixed micromachined coil and a movable magnet (inertial mass) mounted on a resonant structure (Kapton&#x00ae; membrane). The modeling of the device, based on a velocity damped resonator, has allowed to make a quantitative analysis of the capabilities of this simple device structure for the development of power generators for autonomous microsystem applications. The characterization of a first (not optimized) prototype has allowed the validation of the model, which is then used as a roadmap for a number of optimizations for the final device design. For this design, the model developed shows the possibility to achieve power levels up to hundreds of &#x03bc;W&#x2019;s, with voltage levels compatible with the requirements of standard rectifying circuits.
A framework for building extensible C++ class libraries
Authors: Arindam Banerji, Dinesh Kulkarni, David Cohn
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

Extensibility leads to better designed and more reusable software. Traditionally, implementors have built extensible C++ software using ad hoc mechanisms built from scratch. This paper identifies specific characteristics that constitute extensible software. A framework for building extensible C++ libraries has been defined and constructed on AIX 3.2. Finally, the paper gives guidelines for implementors of extensible software through a discussion of an on-going application of the framework.
Sampling on unions of non-commensurate lattices via complex interpolation theory
Authors: S. D. Casey
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Solutions to the analytic Bezout equation associated with certain multichannel deconvolution problems are interpolation problems on unions of non-commensurate lattices. These solutions provide insight into how one can develop general sampling schemes on properly chosen non-commensurate lattices. We give specific examples of non-commensurate lattices and use a generalization of B.Ya. Levin's (1996) sine-type functions to develop interpolating formulae on these lattices.
Automatically classifying benign and harmful data racesallusing replay analysis
Authors: Satish Narayanasamy, Zhenghao Wang, Jordan Tigani, Andrew Edwards, Brad Calder
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Many concurrency bugs in multi-threaded programs are due to dataraces. There have been many efforts to develop static and dynamic mechanisms to automatically find the data races. Most of the prior work has focused on finding the data races and eliminating the false positives. In this paper, we instead focus on a dynamic analysis technique to automatically classify the data races into two categories - the dataraces that are potentially benign and the data races that are potentially harmful. A harmful data race is a real bug that needs to be fixed. This classification is needed to focus the triaging effort on those data races that are potentially harmful. Without prioritizing the data races we have found that there are too many data races to triage. Our second focus is to automatically provide to the developer a reproducible scenario of the data race, which allows the developer to understand the different effects of a harmful data race on a program's execution. To achieve the above, we record a multi-threaded program's execution in a replay log. The replay log is used to replay the multi-threaded program, and during replay we find the data races using a happens-before based algorithm. To automatically classify if a data race that we find is potentially benign or potentially harmful, were play the execution twice for a given data race - one for each possible order between the conflicting memory operations. If the two replays for the two orders produce the same result, then we classify the data race to be potentially benign. We discuss our experiences in using our replay based dynamic data race checker on several Microsoft applications.
Deductive multi-valued model checking
Authors: Gopal Gupta
Venue:  (2006)

Model checking is widely used in the verification of computer systems. Classical model checking methods are based on the boolean interpretation of temporal logic formulas over Kripke structures. However, this method does not scale well and model checking of large systems is often intractable, due to the problem of state space explosion. Multi-valued logics go beyond the boolean interpretation of truth, by offering a multitude of truth values that can precisely encode contextual information, and at the same time provide reasonable generalizations of the operators of Boolean logic. In this dissertation, we develop the theory of multi-valued model checking, which is the multi-valued interpretation of formulas of temporal logic over multi-valued structures. The mechanism of Horn logic is used to specify the denotational semantics of temporal formulas over multi-valued Kripke structures, thereby yielding a systematic and efficient model checking procedure. Multi-valued logics are a canonical form of the lattice-based theory of abstract interpretation. A complete abstraction procedure for Kripke structures is developed, using Belnap's four-valued logic as the abstract domain. For an infinite state system, that satisfies a given &mu;-calculus formula, a finite abstraction is produced, that also satisfies the same formula. The abstraction method is also extended to game theoretic generalizations of Kripke structures, to yield similar results. Finally, the theory of co-Logic programming is used to develop model checking techniques for the verification of liveness properties using coinductive reachability analysis. Another application of co-Logic programming---reasoning about sequences of actions in real-time is also presented.
Experimental Validation of Stochastic Performance Models of General Layered Task Systems
Authors: Athar B. Tayyab, Jon G. Kuhl
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Performance analysis of synchronization mechanisms for simple layered task systems has recently been reported. In this paper, we develop and validate performance models for general layered task systems which are applicable to a wider range of synchronization mechanisms and parallel task systems. Synchronization mechanisms considered include both strong (barrier) synchronization and weak (partial) synchronization. The models explicitly consider overheads due to synchronization waiting time and contention for shared software and hardware resources. The models are solvable for a number of commonly used task computation time distributions and are experimentally validated on two different shared-memory multiprocessors. It is shown that the task computation behavior, the amount of intertask dependencies, synchronization overheads, and throughput of the processor-memory interconnection network interact in a multi-dimensional, but predictable, way to impact overall performance. Approximate and asymptotic models are used to demonstrate these relationships, in both qualitative and quantitative terms.
Alpine: a user-level infrastructure for network protocol development
Authors: David Ely, Stefan Savage, David Wetherall
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

In traditional operating systems, modifying the network protocol code is a tedious and error-prone task, largely because the networking stack resides in the kernel. For this reason, among others, many have proposed moving the networking stack to user-level. Unfortunately, implementations of this design have never entered widespread use due to the impractical requirements they place on the user: either the kernel or applications must be modified; or code cannot be moved seamlessly between the user-level and kernel stacks. In this paper, we present Alpine, a user-level networking infrastructure free from these drawbacks. Alpine supports a FreeBSD networking stack on top of a Unix operating system. It is freely available as source code. In this paper, we discuss the challenges we faced in virtualizing the FreeBSD networking stack without compromising on kernel, networking stack, and application compatibility. We then show how Alpine is effective at easing the burden of debugging and testing protocol modifications or new network protocols. In our experience, Alpine can reduce the overhead of modifying a protocol from hours to minutes.
A fast subband room response simulator
Authors: F. Jabloun
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper we present a subband scheme to decrease the computational complexity of simulating room responses to acoustic signals, important for instance in microphone array systems. Besides, the new method offers added flexibility to the well known image method by allowing to choose the reflection coefficients of every frequency subband independently of each others. The efficiency of this method is tested experimentally.
Maximize Parallelism Minimize Overhead for Nested Loops via Loop Striping
Authors: Chun Xue, Zili Shao, Edwin H.-M. Sha
Venue: Journal of VLSI Signal Processing Systems (2007)

Majority of scientific and Digital Signal Processing (DSP) applications are recursive or iterative. Transformation techniques are generally applied to increase parallelism for these nested loops. Most of the existing loop transformation techniques either can not achieve maximum parallelism, or can achieve maximum parallelism but with complicated loop bounds and loop indexes calculations. This paper proposes a new technique, loop striping, that can maximize parallelism while maintaining the original row-wise execution sequence with minimum overhead. Loop striping groups iterations into stripes, where all iterations in a stripe are independent and can be executed in parallel. Theorems and efficient algorithms are proposed for loop striping transformations. The experimental results show that loop striping always achieves better iteration period than software pipelining and loop unfolding, improving average iteration period by 50 and 54% respectively.
Corrector&#x2013;predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Authors: Florian A. Potra
Venue: Mathematical Programming: Series A and B (2007)

Two corrector&#x2013;predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the $${\mathcal{N}_{\infty}^{-}}$$ neighborhood of the central path. The first algorithm uses line search schemes requiring the solution of higher order polynomial equations in one variable, while the line search procedures of the second algorithm can be implemented in $${O(m\, n^{1+\alpha})}$$ arithmetic operations, where n is the dimension of the problems, $${\alpha\in(0,1]}$$ is a constant, and m is the maximum order of the predictor and the corrector. If $${m = \Omega(\log n)}$$ then both algorithms have $${O(\sqrt{n}L)}$$ iteration complexity. They are superlinearly convergent even for degenerate problems.
Development of online undergraduate object-oriented programming curriculum
Authors: V. Uskov
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The rapid spread and accessibility of the Internet since the beginning of this decade has baffled most technology forecasters. A telling comparison shows that it took 40 years for radio technology to reach 50 million users in the U.S., and it took TV 13 years, while it took only 4 years for the World Wide Web to reach the same number of users. While the growth in employment of all occupations in the U.S. information technology (IT) industry between 1996-2006 is projected at 88.25%, the growth of college/university IT faculty is only projected at 18.3% (http://www.ed.gov). These findings motivated us to propose the NSF-CCLI-EMD project to create a basis for several IT online degree programs in the US colleges and universities. A design and development of the online object-oriented programming (OOP) curriculum is a vital part of this project.
Text, illustrations, and animations: how do repetition and mental model organizers affect young adults' understanding and recall of new computerized banking skills?
Authors: Joseph M. Fitzgerald
Venue:  (2006)

Two explanations for the cognitive processes underlying the supportive effects of illustrations were investigated: (1) Illustrations repeat information in a dual code format (both visual and verbal), which allows for two independent access routes, thereby increasing the likelihood of recall: (2) Illustrations encourage the reorganization of text material into a useful mental model, which then encourages selection and reorganization of new material; thereby improving understanding and recall. 132 college students with low-prior knowledge of banking skills learned to operate Quicken 6.0 for Windows, a computer application for keeping a person checkbook, from a tutorial that included No Illustrations, Fixed Illustrations, or Animated Illustrations, either with or without an Advance Category Graphic that was designed to encourage the construction of a mental model. Both fixed and animated illustrations consistently improved procedural task performance (both response time and number of correct moves) and number correct on a problem-solving task, supporting a dual code explanation. Only animated illustration improved (decreased) response time for a creative problem-solving task indicating animated illustrations offer at some advantage over fixed illustrations. The advance Category Graphic improved performance on the knowledge transfer portion of a creative problem-solving task, but did not increase the overall amount learned, suggesting students built a mental model of the banking skill information.
Making music with MATLAB: an electronic music synthesis course for engineering students
Authors: E. Doering
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

An elective course in electronic music synthesis has been developed for electrical and computer engineering students. The course provides an interesting way to integrate and apply DSP and computer manipulation concepts studied in previous courses, and extends student understanding of more advanced concepts such as time-evolving spectra. MATLAB is a standard platform used in the signals and DSP courses, so MATLAB forms the primary tool for converting algorithmic descriptions of waveforms into sound. The paper outlines course topics and methods, includes a detailed example of pedagogy, and presents assessment results. 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
LEAP: Leadership in Engineering Advancing the Profession
Authors: J. E. Lyczko
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

LEAP is Cooper Union's new leadership and professional development program which is designed to offer engineering students a structured, yet flexible, selection of participatory leadership experiences, workshops and courses. LEAP's goal is to cultivate the professional and interpersonal skills of engineering students and to enhance their leadership potential in both the college and the workplace, thereby advancing the profession of engineering. 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