ppxscal/embedding_network huggingface dataset:
Time-critical distributed contact for 6-DoF haptic rendering of adaptively sampled reduced deformable models
Authors: Jernej Barbič, Doug James
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Real-time evaluation of distributed contact forces for rigid or deformable 3D objects is important for providing multi-sensory feedback in emerging real-time applications, such as 6-DoF haptic force-feedback rendering. Unfortunately, at very high temporal rates (1 kHz for haptics), there is often insufficient time to resolve distributed contact between geometrically complex objects. In this paper, we present a spatially and temporally adaptive sample-based approach to approximate contact forces under hard real-time constraints. The approach is CPU based, and supports contact between a rigid and a reduced deformable model with complex geometry. Penalty-based contact forces are efficiently resolved using a multi-resolution point-based representation for one object, and a signed-distance field for the other. Hard realtime approximation of distributed contact forces uses multi-level progressive point-contact sampling, and exploits temporal coherence, graceful degradation and other optimizations. We present several examples of 6-DoF haptic rendering of geometrically complex rigid and deformable objects in distributed contact at real-time kilohertz rates.
Interactive presentation: Simulation methodology and experimental verification for the analysis of substrate noise on LC-VCO's
Authors: S. Bronckers, C. Soens, G. Van der Plas, G. Vandersteen, Y. Rolain
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper presents a methodology for the analysis and prediction of the impact of wideband substrate noise on a LC-Voltage Controlled Oscillator (LC-VCO) from DC up to Local Frequency (LO). The impact of substrate noise is modeled a priori in a high-ohmic 0.18&mu;m 1P6M CMOS technology and then verified on silicon on a 900MHz LC-VCO. Below a frequency of 10MHz, the impact is dominated by the on-chip resistance of the VCO ground, while above 10MHz the bond wires, parasitics of the on-chip inductor and the PCB decoupling capacitors determine the behavior of the perturbation.
Error performance of a channel of known impulse response
Authors: P. D. Teal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper addresses the problem of blind channel equalization in the context of digital communications. Recent results have shown that certain operations applied to the source signal at the transmitter help in the blind identification and equalization of the channel at the receiver. For example, cyclostationarity is induced by multiplying the baseband data signal with a periodic sequence. Here, the baseband data signal is multiplied with a chirp sequence. Exploiting certain structural properties arising from this operation, a simple and fast converging algorithm is obtained for estimating the equalizer coefficients. The algorithm is deterministic, i.e. it provides optimal equalizer settings using finite data in the noiseless case.
An Architecture for a Next-Generation Internet Based on Web Services and Utility Computing
Authors: John Darlington, Jeremy Cohen, William Lee
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

We present an architecture for a next-generation Internet based on Web Services and Utility Computing. This architecture would be realised as a series of open but interacting markets. We present a scenario whereby these markets could develop, driven by economic forces and market opportunities, exploiting technologies developed in e- Science and Grid computing. We argue that, if properly realised, such an architecture would provide a safer and more cost-effective way of supporting the Internet than the current infrastructure and would provide many opportunities for radical developments, affecting and unifying many areas of academia, business and society.
QoS Mapping and Adaptation in Next Generation Networks
Authors: E. Cerqueira, T. Sousa, A. Neto, L. Veloso, M. Curado, E. Monteiro, P. Mendes
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

The end-to-end Quality of Service (QoS) control is one of the key factors to the success of next generation networks. Therefore, this paper presents a session-aware QoS mapping and adaptation mechanism that maps the session QoS requirements into the most suitable network service class across heterogeneous mobile networks as well as it adapts the session to the current network conditions. The proposed scheme allows mobile operators to keep network internals sufficiently opaque and to reduce operational costs by mapping and/or adapting sessions to groups of heterogeneous mobile users. Concurrently, the proposed scheme assures acceptable quality levels to on-going sessions, independently of the movement of users. In addition, an experimental evaluation in a QoS mobile multicast environment is presented.
State of the art review of the existing bayesian-network based approaches to trust and reputation computation
Authors: Farookh Khadeer Hussain, Elizabeth Chang, Omar Khadeer Hussain
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

In this paper we present a state of the art review of the bayesian-network based approaches for trust and reputation computation. We divide the bayesian network based approaches for trust and reputation computation into four different classes. Each of the four different classes is discussed in this paper.
Designing and testing products to meet the requirements of regulatory agencies
Authors: M. Marcus
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Conventional engineering and engineering technology courses may teach students how to design functional products, but almost never address the very practical problem of meeting regulatory requirements. The paper discusses actual instrumentation and some of the design specifications and modifications that were implemented to meet the requirements of various regulatory agencies. Both hardware and software considerations are discussed. Requirements to gain approval from the following agencies are considered: 1. Underwriter Lab Listing (UL). 2. Third party testing agencies. 3. FDA for Laser Safety. 4. Compliance engineering (C.E. Marking). 5. R.F. and EMI testing. 6. FDA Premarket Notification, 510 k. An understanding of the requirements from regulatory agencies leads to better product design and reduces product development time. Case histories of actual products that were submitted by the author and approved by various regulatory agencies are presented.
VMware: not your granddaddy's virtual machine
Authors: Darryl Ramm
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

VMware (www.vmware.com) is a virtual machine monitor for PCs. VMware provides isolated environments in which multiple x86 operating systems and applications can run concurrently on a standard PC. VMware has a lot of capabilities hidden under the covers, besides just running multiple operating systems. This talk will cover some of the architecture of VMware and discuss some of the more interesting capabilities and technical tricks for advanced users -- including virtual disks, undoable and non-persistent disk modes, virtual networking and advanced networking and security applications.
Multirate as a hardware paradigm
Authors: B. W. Suter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The architecture and circuit design are the two most effective means of reducing power in CMOS VLSI. Mathematical manipulations, based on applying ideas from multirate signal processing have been applied to create high performance, low power architectures. To illustrate this approach, two case studies are presented-one concerns the design of a fast Fourier transform (FFT) device, while the other one is concerned with the design of analog-to-digital converters.
Building distributed process management on an object-oriented framework
Authors: Ken Shirriff
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

The Solaris MC distributed operating system provides a single-system image across a cluster of nodes, including distributed process management. It supports remote signals, waits across nodes, remote execution, and a distributed /proc pseudo file system. Process management in Solaris MC is implemented through an object-oriented interface to the process system. This paper has three main goals: it illustrates how an existing UNIX operating system kernel can be extended to provide distributed process support, it provides interfaces that may be useful for general access to the kernel's process activity, and it gives experience with object-oriented programming in a commercial kernel.
Libscheme: scheme as a C library
Authors: Brent W. Benson,  Jr.
Venue: Proceedings of the USENIX 1994 Very High Level Languages Symposium Proceedings on USENIX 1994 Very High Level Languages Symposium Proceedings (1994)

Because of its small size and simplicity, Scheme is often seen as an ideal extension or scripting language. While there are many Scheme implementations available, their interfaces are often complex and can get in the way of using the implementation as part of a larger software product. The libscheme library makes the Scheme language available as a C library. Its interface is through a single C header file and it is easily extended with new primitive procedures, new primitive types, and new syntax. It is portable to any system that has an ANSI C compiler and to which Hans Boehm's popular conservative garbage collector [1] has been ported. It has been used to build a variety of special purpose data manipulation tools, and as an extension language for an ethernet monitor.
SSA-based mobile code: Implementation and empirical evaluation
Authors: Wolfram Amme, Jeffery von Ronne, Michael Franz
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2007)

Although one might expect transportation formats based on static single-assignment form (SSA) to yield faster just-in-time compilation times than those based on stack-based virtual machines, this claim has not previously been validated, in practice. We attempt to quantify the effect of using an SSA-based mobile code representation by integrating support for a verifiable SSA-based IR into Jikes RVM. Performance results, measured with various optimizations and on both the IA32 and PowerPC, show improvements in both compilation time and code quality.
Automatic program transformation with JOIE
Authors: Geoff A. Cohen, Jeffrey S. Chase, David L. Kaminsky
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

While the availability of platform-independent code on the Internet is increasing, third-party code rarely exhibits all of the features desired by end users. Unfortunately, developers cannot foresee and provide for all possible extensions. In this paper, we describe load-time transformation, a stage in the program development lifecycle in which classes are modified at load time according to user-supplied directives. This allows the users to select transformations that add new features, customize the implementation of existing features, and apply the changes to all classes in the environment. The Java Object Instrumentation Environment (JOIE) is a toolkit for constructing transformations of Java classes. An enhanced class loader calls user-supplied transformers that specify rules for transforming target classes. We describe some applications of load-time transformation, including extending the Java environment, integrating classes with specialized environments, and adding functionality directly to classes.
High availability, scalable storage, dynamic peer networks: pick two
Authors: Charles Blake, Rodrigo Rodrigues
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to any data guarantees. However, preserving redundancy in the face of highly dynamic membership is costly. We use a simple resource usage model to measured behavior from the Gnutella file-sharing network to argue that large-scale cooperative storage is limited by likely dynamics and cross-system bandwidth -- not by local disk space. We examine some bandwidth optimization strategies like delayed response to failures, admission control, and load-shifting and find that they do not alter the basic problem. We conclude that when redundancy, data scale, and dynamics are all high, the needed cross-system bandwidth is unreasonable.
Corridor Navigation and Obstacle Avoidance using Visual Potential for Mobile Robot
Authors: Naoya Ohnishi, Atsushi Imiya
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper, we develop an algorithm for corridor navigation and obstacle avoidance using visual potential for visual navigation by an autonomous mobile robot. The robot is equipped with a camera system which dynamically captures the environment. The visual potential is computed from an image sequence and optical flow computed from successive images captured by the camera mounted on the robot. Our robot selects a local pathway using the visual potential observed through its vision system. Our algorithm enables mobile robots to avoid obstacles without any knowledge of a robot workspace. We demonstrate experimental results using image sequences observed with a moving camera in a simulated environment and a real environment. Our algorithm is robust against the fluctuation of displacement caused by mechanical error of the mobile robot, and the fluctuation of planar-region detection caused by a numerical error in the computation of optical flow.
Scheduling Strategies for Sparse Cholesky Factorization on a Shared Virtual Memory Parallel Computer
Authors: Mounir Hahad, Jocelyne Erhel, Theirry Priol
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

To solve a given problem on a distributed memory parallel computer (DMPC), the message passing programming model involves distributing both the data and the computations among the processors. While this can be easily feasible for well structured problems, it can become fairly hard for unstructured ones, like sparse matrix computations, unless you use some runtime support. In this paper, we consider a relatively new approach to implementing the Cholesky factorization on a DMPC, by using a shared virtual memory (SVM). The abstraction of a shared memory on top of a distributed memory allows us to introduce a large-grain factorization algorithm, synchronized with events. Experiments conducted so far show that some scheduling techniques enhance not only the parallelism but the SVM behavior as well, allowing interesting results.
Deployment of microsoft windows NT in a design engineering environment
Authors: Jason Sampson, Elwood Coslett, Gary Washington, Bob Paauwe, Russ Craft, Kevin Wheeler
Venue: Proceedings of the 2nd conference on Large Installation System Administration of Windows NT - Volume 2 (1999)

This paper details some of the experiences and issues Intel Corporation encountered when developing and deploying a Microsoft Windows NT 4.0* based environment for usein by our chip designers. We are deploying Itel* based Windows NT workstations to engineers designing Intel's next generation products. We offer our experiences in hope that other groups using NT in a design engineering environment can benefit. Along the way we explain how we solved the problems associated with a tightly controlled design engineering workstation and environment presented us.
An executable formal java virtual machine thread model
Authors: J. Strother Moore, George M. Porter
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

We discuss an axiomatic description of a simple abstract machine similar to the Java Virtual Machine (JVM). Our model supports classes, with fields and bytecoded methods, and a representative sampling of JVM bytecodes for basic operations for both data and control. The GETFIELD and PUTFIELD instructions accurately model inheritance, as does the INVOKEVIRTUAL instruction. Our model supports multiple threads, synchronized methods, and monitors. Our current model is inadequate or inaccurate in many respects (e.g., we do not formalize the JVM's finite arithmetic nor do we describe class loading and initialization). But the model is a useful tool for studying the application of formal reasoning to the JVM and to Java programs. We demonstrate two useful aspects of an operational formal semantics. First, the model is executable: bytecoded methods can be run on the model. Second, the model allows us to prove theorems about those methods or, more generally, about the model. Because the JVM provides a relatively clean semantics for Java, our model can be thought of as a step towards Java software verification. We illustrate these points. We cite some theorems proved about our model, including a theorem involving unbounded multi-threading and mutual exclusion with MONITORENTER and MONITOREXIT. Our proofs are carried out with the ACL2 theorem prover.
Automatic Test Data Generation for XML Schema-based Partition Testing
Authors: Antonia Bertolino, Jinghua Gao, Eda Marchetti, Andrea Polini
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

We present the XML-based Partition Testing (XPT) approach for the automatic generation of XML instances from a XML Schema. The approach is inspired by the well-known Category Partition method for black-box testing. The generated instances can be used for inter-operability testing of applications that expect in input conforming XML instances, as well as for other interesting purposes, such as database population, XML Schema benchmarking, web services testing, and so on. The implementation of XPT in a prototype tool called TAXI is described. To limit the number of generated instances, TAXI also incorporates practical strategies for handling element weights and type values.
Constructing a Reading Guide for Software Product Audits
Authors: Remco C. de Boer, Hans van Vliet
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Architectural knowledge is reflected in various artifacts of a software product. In the case of a software product audit this architectural knowledge needs to be uncovered and its effects assessed, in order to evaluate the quality of the software product. A particular problem is to find and comprehend the architectural knowledge that resides in the software product documentation. The amount of documents, and the differences in for instance target audience and level of abstraction, make it a difficult job for the auditors to find their way through the documentation. This paper discusses how the use of a technique called Latent Semantic Analysis can guide the auditors through the documentation to the architectural knowledge they need. Using Latent Semantic Analysis, we effectively construct a reading guide for software product audits.
Positive solutions for a class of boundary value problems on time scales
Authors: Meiqiang Feng, Xuemei Zhang, Weigao Ge
Venue: Computers Mathematics with Applications (2007)

By obtaining intervals of the parameter @l, this paper is concerned with the existence and nonexistence of positive solution of the second-order nonlinear dynamic equation on time scales -[p(t)x^@D(t)]^@?+q(t)x(t)=@lw(t)f(t,x),@ax(@r(a))-@bx^[^@D^](@r(a))=0,@cx(b)+@dx^[^@D^](b)=0 for t@?[a,b]@?T, where T is a time scale, @a>=0,@c>=0,@b>0,@d>0 with @a+@c>0. The arguments are based upon fixed point theorems in a cone.
Similarity analysis of cardiac signals using temporal features
Authors: B. de Jesus
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We present an application of fuzzy clustering to the identification of heartbeat arrhythmias. Many classification algorithms have been developed to distinguish ventricular tachyarrhythmia, a potentially dangerous arrhythmia, from normal sinus rhythm. Few techniques exist to distinguish additional types of arrhythmias due to their overlapping feature sets which prevent successful classification with traditional clustering algorithms. We develop a set of temporal features and a fuzzy clustering algorithm necessary to uniformly and objectively judge the similarity of a patients' arrhythmic heartbeats to their normal sinus rhythm. Our algorithm, called the fuzzy logic similarity analysis algorithm, successfully distinguishes ventricular tachyarrhythmia, as well as ectopic atrial tachycardia, from normal sinus rhythm. We compare our technique to the nearest neighbor clustering algorithm and demonstrate a significant reduction in misclassifications.
On Verification of Communicating Finite State Machines Using Residual Languages
Authors: El maati Chabbar, Mohamed Bouhdadi
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

FIFO channel languages of Communicating Finite State Machines are useful for protocol verification The reachability set is the set of all reachable states and it's the purpose of reachability analysis. Computing this set is not reasonable especially if it's infinite. Context free grammars are defined for languages for FIFO channel systems. A grammar 'like' context free is defined for each CFSM. Each rule is of the form X \to u^{-1}Yv, where u^{-1}Yv stands for the residual of the language (L(Y)v) with regard to u. Context-free grammar properties are used to make transformations for calculating the channel languages which are fix-point of a system of equations. In this paper we use some acceleration techniques to calculate the channel languages and we show how we can use theoretical framework to verify some protocol properties such as reachability and deadlock problems.
Lecture video capture for the masses
Authors: Surendar Chandra
Venue: ACM SIGCSE Bulletin (2007)

Earlier work had shown the positive learning impact of the ability to review class lecture videos. Prior video capture systems used university provided infrastructure such as video technicians and post-production facilities. However, such capture is expensive; forcing schools to carefully choose the courses that can be video taped. We show that technology advances can allow every faculty member to make a modest effort and video tape their lectures, perform simple post processing and disseminate the contents either through their own web servers, using podcasts or via services such as Google video. Consumer grade HD cameras remove the need for accurate tracking of the faculty member and chalkboards; one stationary camera can frame the entire chalkboard. Desktop computers are powerful enough to perform the required multimedia operations. The faculty can also add pedantically useful annotations; a step that is unlikely to be performed by the video technicians. Many students own iPods, PSPs, laptops and other devices that allow them to watch the video at their convenience. We report on the tools used, the associated network cost and our experiences with video recording an undergraduate Operating Systems (Spring 2006). For the twelve month duration from Feb '06 - Feb '07, the OS course consumed over five days worth of our external network link bandwidth. The network cost in distributing all the lectures taught in our university can be prohibitive.