ppxscal/embedding_network huggingface dataset:
Average response times in a Bluetooth piconet for 1-RRIFIFO, Enhanced 1-RR and CB-EDF
Authors: Antoine MERCIER, Pascale MINET, Laurent GEORGE
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

In this paper, we focus on a Bluetooth piconet, analyzing its ability to support the Quality of Service (QoS) requirements dejned by QoS sensitive applications. We consider two QoS parameters : ( i ) an application constraint denoting the importance degree of a message, and (ii) an endto- end delivery deadline. The QoS perceived by the application depends on the scheduling algorithms chosen at the medium access layer: We determine the average response time of a message obtained with three dzfferent scheduling algorithms. This evaluation takes into account message segmentation in the Bluetooth MAC layer: Thejrst scheduling is the Bluetooth native scheduling called One-Roud Robin (I-RR). The second is a variant of I-RR where the local scheduling is based on the two QoS parameters considered. The last one, called Class-Based Earliest Deadline First (CB-EDF), takes into account the two QoSparameters both at the local level and at the global level.
An Interview with William P. Dunk: On Collaboration
Authors: Ubiquity staff
Venue: Ubiquity (2005)

Management consultant and futurist William P. Dunk says, "What collaboration is about is distributed intelligence, and I think that systems and governments and companies are all in such a degree of gridlock now that we desperately need to have broad-based intelligence coming into play everywhere."
The SARA system for computer architecture design and modelling
Authors: Gerald Estrin
Venue: ACM SIGSIM Simulation Digest (1977)

There are many practical forces at work which encourage improvement in design methods. "Structural programming", "hierarchical design" and "modularity" are terms which have become commonplace. However, the frequency of their use does not mean that design methods now exist which can guarantee that a particular complex system, whose programs are shared by many users, will have no design errors. Nor do design methods yet exist which can guarantee that a digital system, "simple" enough to be integrated into one device and reproduced in the millions, will have no design errors.
Neural network application for radionuclide modelling and prediction of radioactivity levels
Authors: Myron Corbett Lynch,  Jr.
Venue:  (2004)

Existing applications of artificial neural networks in physics research and development have been analyzed as a basis for proposing new opportunities using that AI technology for data analysis in physics. A taxonomy was developed, based on an extensive literature search, for physics problems where neural network applications have been useful. Then, a particular use of neural networks was carried out to study ways to predict normal concentrations of radioactivity measured at monitoring stations in different geographic locations. The purpose of the data collection and analysis was to establish background levels that would serve as bases for detecting unusual levels of radioactivity, for example due to nuclear weapons testing, in these physical environments. Useful data sets were developed in this area and a process was discovered for modeling the background levels.
Maximizing the Robustness of TDMA Networks with Applications to TTP/C
Authors: Bruno Gaujal, Nicolas Navet
Venue: Real-Time Systems (2005)

In this study we show how one can use Fault-Tolerant Units (FTU) in an optimal way to make a TDMA network robust to bursty random perturbations. We consider two possible objectives. If one wants to minimize the probability of losing all replicas of a given message, then the optimal policy is to spread the replicas over time. This is proved using convexity properties of the loss probability. On the contrary if one wants to minimize the probability of losing at least one replica, then the optimal solution is to group all replicas together. This is proved by using majorization techniques. Finally we show how these ideas can be adapted for the TTP/C protocol.
Agent Based Assistance and Support in Process Control Systems
Authors: Knut Meissner, Hartmut Hensel
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

By means of software agents, user relevant information in process control systems should be searched for and presented in a user-friendly manner. In this paper the first steps of the design of the individual agents along with the suitable framework and the basic structure for the agent communication, will be presented. The emphasis of the work lies, on one hand, on the special requirements of the agent oriented software design in the process control, and on the other hand, on designing an open architecture for communication and integration of the agent in the existing structure of the system process control.
Point/Counterpoint
Authors: Adrian Colyer, Rob Harrop, Rod Johnson, Alexandre Vasseur, Danio Beuche, Cedric Beust
Venue: IEEE Software (2006)

POINT: AOP Will See Widespread Adoption Adrian Colyer, Rob Harrop, Rod Johnson, and Alexandre Vasseur AOP offers both the short--and long-term return on investment needed to ensure its widespread adoption.COUNTERPOINT: AOP Has Yet to Prove Its Value Danio Beuche and Cédric Beust Where is the proof that nonhierarchical modularization into aspects makes systems development cheaper or better?
A context-aware middleware for multimodal dialogue applications with context tracing
Authors: Manh-Thang Tran, Béat Hirsbrunner, Michèle Courant
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

This paper presents a context-aware middleware for multimodal dialogue applications. The middleware has the context tracing feature, which is the possibility of the middleware to explain why and how a situation occurs (or occurred). The middleware consists of several agents communicating with each other and an ontology is used to describe various concepts such as resources, situations, plans, structure of context history, and data to be exchanged between the agents.
Traffic-partitioning Approaches to Grooming Ring Networks
Authors: Koundinya Srinivasarao, Rudra Dutta
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Traffic grooming has become an increasingly important area in optical networking research in recent years. Very recently, a min-max approach to network cost optimization has emerged as a new focus area. In this cost model, it is assumed that different network nodes will be provisioned with similar Opto-Electro-Optic (OEO) equipment; hence an objective seeking to minimize the maximum OEO capability needed at any node is appropriate. In this paper, we propose heuristics for traffic grooming with this objective in ring networks, which are practically important. We advance two approaches, both based on the concept of partitioning the traffic matrix, but in different ways. The approaches are of complementary strength, being useful for different traffic patterns. We present numerical results validating the performance of the algorithms.
A Novel Approach to Evaluate Trustworthiness and Uncertainty of Trust Relationships in Peer-to-Peer Computing
Authors: Rui He, Jianwei Niu, Kai Hu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In peer-to-peer computing, traditional security mechanisms that are based on pre-registration are hardly useful because users are dynamic and can not be pre-defined. Hence trust models were introduced into peer-to-peer systems. In this paper, a novel trust model is proposed, which employs a new approach to model trustworthiness and uncertainty of trust relationships between peers, namely cloud-model. Since the cloud-model is exotic and still in the progress of development, it can not be applied into modeling trust directly, we extend it first according to our need. Then we present an extended-cloud-model-based trust model (ECMBTM). To prove the validity of ECMBTM, a simulation experiment was carried out, and ECMBTM was compared quantificationally with three typical trust models, which are based on different mathematic theories. And the experiment results demonstrate the advantage of ECMBTM preliminarily.
From Wheels to Wings with Evolutionary Spiking Circuits
Authors: Dario Floreano, Jean-Christophe Zufferey, Jean-Daniel Nicoud
Venue: Artificial Life (2005)

We give an overview of the EPFL indoor flying project, whose goal is to evolve neural controllers for autonomous, adaptive, indoor micro-flyers. Indoor flight is still a challenge because it requires miniaturization, energy efficiency, and control of nonlinear flight dynamics. This ongoing project consists of developing a flying, vision-based micro-robot, a bio-inspired controller composed of adaptive spiking neurons directly mapped into digital microcontrollers, and a method to evolve such a neural controller without human intervention. This article describes the motivation and methodology used to reach our goal as well as the results of a number of preliminary experiments on vision-based wheeled and flying robots.
A Human Interactive Proof Algorithm Using Handwriting Recognition
Authors: Amalia Rusu, Venu Govindaraju
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The recognition of unconstrained handwriting continues to be a difficult task for computers despite active research for several decades. This is because handwritten text offers great challenges such as: character and word segmentation, character recognition, variation between handwriting styles, different character size and orientation, no font constraints, the type of printing surface, as well as the background clarity. In this paper we explore the gap in the ability in reading handwritten text between humans and computers to propose solutions for security problems in Web Services. We present a new HIP algorithm that uses handwriting recognition task to distinguish between humans and computers. We propose methods to deform handwritten text images to make them indecipherable by computers and explore the cognitive factors that assist humans in reading and understanding. Experimental results on both humans and computers are presented and compared.
On Learning Asymmetric Dissimilarity Measures
Authors: Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agrawal
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Many practical applications require that distance measures to be asymmetric and context-sensitive. We introduce Context-sensitive Learnable Asymmetric Dissimilarity (CLAD) measures, which are defined to be a weighted sum of a fixed number of dissimilarity measures where the associated weights depend on the point from which the dissimilarity is measured. The parameters used in defining the measure capture the global relationships among the features. We provide an algorithm to learn the dissimilarity measure automatically from a set of user specified comparisons in the form "x is closer to y than to z," and study its performance. The experimental results show that the proposed algorithm outperforms other approaches due to the context sensitive nature of the CLAD measures.
Integral Normalized Gradient Image A Novel Illumination Insensitive Representation
Authors: Samsung Samsung
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In this paper, we present a novel illumination insensitive image, called integral normalized gradient image (INIGI), for face recognition. Unlike previous model-based methods, which require training images or have many str constrains for implementation, the proposed representation is simple and generic. Based on the intrinsic and extrinsic factor definition, we firstly normalized the gradient with a smoothed version of input image and then integrate the result into new grayscale image. To avoid unwanted smoothing effects on step edge region, anisotropic diffusion method is introduced. Experiment results on FRGC DB prove that our new approach is very effective in improving verification rate for both holistic and local features.
High-level synthesis using computation-unit integrated memories
Authors: Chao Huang, S. Ravi, A. Raghunathan, N. K. Jha
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

High-level synthesis (HLS) of memory-intensive applications has featured several innovations in terms of enhancements made to the basic memory organization and data layout. However, increasing performance and energy demands faced by application-specific integrated circuits (ASIC) are forcing designers to alter the fundamental architectural template of the HLS output, namely, a controller-datapath associated with a memory subsystem (monolithic, banked, etc.). We propose an architectural template for the HLS output that consists of a controller-datapath circuit associated with a memory subsystem into which computation units have been integrated. The enhanced memory subsystem is called computation-unit integrated memory (CIM). A CIM offers higher memory bandwidth (relative to what is offered through the system bus) to computation units present locally within it and reduces the overall communication between the memory subsystem and the controller-datapath, thus providing a template highly suitable for deriving efficient implementations of memory-intensive applications. This work addresses the challenge of providing an automatic synthesis framework for a CIM-based architecture. Our framework can analyze the various trade-offs involved in selecting suitable operations in a behavior for execution using a CIM and generate a high-performance, low-overhead implementation. Experiments with several behaviors indicate that an average performance improvement of 1.88/spl times/ (a maximum of 2.63/spl times/) is possible with very low area overheads. The energy-delay product improves by an average of 2.1/spl times/ (maximum of 3.4/spl times/).
3D Modeling of Indoor Environments for a Robotic Security Guard
Authors: Peter Biber, Sven Fleck, Tom Duckett
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Autonomous mobile robots will play a major role in future security and surveillance tasks for large scale environments such as shopping malls, airports, hospitals and museums. Robotic security guards will autonomously survey such environments, unless a remote human operator takes over control. In this context a 3D model can convey much more useful information than the typical 2D maps used in many robotic applications today, both for visualization of information and as human machine interface for remote control. This paper addresses the challenge of building such a model of a large environment (50× 60m2) using data from the robot¿s own sensors: a 2D laser scanner and a panoramic camera. The data are processed in a pipeline that comprises automatic, semiautomatic and manual stages. The user can interact with the reconstruction process where necessary to ensure robustness and completeness of the model. A hybrid representation, tailored to the application, has been chosen: floors and walls are represented efficiently by textured planes. Non-planar structures like stairs and tables, which are represented by point clouds, can be added if desired. Our methods to extract these structures include: simultaneous localization and mapping in 2D and wall extraction based on laser scanner range data, building textures from multiple omnidirectional images using multiresolution blending, and calculation of 3D geometry by a graph cut stereo technique. Various renderings illustrate the usability of the model for visualizing the security guard¿s position and environment.
IMPRESS
Authors: Mike Armer
Venue: ACM SIGSOC Bulletin (1974)

IMPRESS (Interdisciplinary Machine Processing for Research and Education in the Social Sciences) is an integrated set of computer programs and social science data sets designed to allow students and faculty who have very little computer expertise to analyze and manipulate social science data in a time-sharing environment. The user of IMPRESS need not know computer programming in order to access the 64 data sets currently on disc in the IMPRESS public library, nor is it necessary to prepare data decks or instruction cards. The user's only task is to type in simple English commands at his console and await the return of the tables, plots, and statistics he has requested. Indeed, even the most naive first-time user of IMPRESS can generally produce some sort of intelligent output within an hour or so of his introduction to the system. This interactive capability means that undergraduates can learn non-trivial social science data analysis at the freshman and sophomore level, and that both faculty and students can regularly do their own quantitative research, and incorporate that research in their courses. 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
A 20 Gbps Scalable Load-Balanced TDM Switch with CODEC for High Speed Networking Applications
Authors: Ching-Te Chiu, Chun-Chieh Chang, Shih-Min Chen, Hou-Cheng Tzeng, Ming-Chang Du, Yu-Ho Hsu, Jen-Ming Wu, Kai-Ming Feng
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

For the first time, we implemented a reconfigurable load-balanced TDM switch for high speed networking applications. An N×N TDM switch could be constructed recursively from the proposed switch modules to achieve switching capacity of hundred gigabits per second or higher. Two architectures were implemented. One was an 8×8 TDM switch with serial input/output ports and embedded 8/10B CODECs for Ethernet applications. The other was a dual-mode 8×8 or 64×64 TDM switch with parallel ports. A novel testing circuit was also implemented to easily verify switching results. Our results showed a 20 Gbps switching capacity for the 8×8 TDM switch with parallel input and output ports and a 640 Gbps capacity for the 64×64 switch. All implementation were based on the 0.18 µm CMOS technology.
Limitations of Mobile Phone Learning
Authors: Wang Shudong, Michael Higgins
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In this paper, we will describe the weaknesses inherent in, and some non-viable factors of mobile phone learning (PDA and other mobile devices are not included). Our conclusion is that while e-learning has only just been accepted by educators and is increasingly being put into extensive and effective use for learning, m-learning, especially its main delivery system, mobile phone learning, will have a long way to go to before it can or will be effectively, extensively used or accepted for learning purposes, by either educators or the general public, unless the problems raised in this article are solved.
Hierarchical Reinforcement Learning for Metrical Task Systems
Authors: Manoel Junior Leandro de Lima, Jorge Dantas de Melo, Adriao Duarte Doria Neto
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

The use of reinforcement learning to implement Metrical Task Systems is limited to smaller scale problems due to the curse of dimensionality inherent in the method. This paper aims to present an algorithm based on decomposition techniques which allows us to apply this approach to realistic control problems. It analyzes aspects associated with the quality of the solution and its limitations, as well as discuss about the relevant theoretical topics of the approach presented.
Dynamic textures: modeling, learning, synthesis, animation, segmentation, and recognition
Authors: Gianfranco Doretto
Venue:  (2005)

Dynamic textures are sequences of images of dynamic scenes that exhibit some temporal regularity properties, intended in a statistical sense; these include, for example, ocean waves, smoke, whirlwind, fire, foliage, but also moving objects with a &ldquo;defined shape,&rdquo; for instance flowers, or flags in wind etc. This work presents a characterization of this class of video sequences, and poses the problems of modeling, learning, synthesis, animation, recognition, and segmentation of dynamic textures. Since, in absence of any additional prior knowledge, the visual reconstruction problem from images alone is ill-posed, in this work we give up trying to infer the physical model that generated the images, and analyze sequences of images solely as visual signals. We do so by building a statistical framework, and draw on disciplines like time series analysis, system, control, and identification theory. We derive three generative models, the simplest possible, that are able to capture, respectively, the temporal second-order statistics, the spatio-temporal second-order statistics, and the higher-order temporal statistics of dynamic textures. We propose to learn model parameters in the maximum-likelihood sense, or minimum prediction error variance. We derive efficient closed-form inference procedures for learning the second-order statistics, and revert to non-linear optimization techniques for the higher-order ones. After learning a model, it can be used to extrapolate, or predict new image data both in the temporal and spatial domain. We analyze the meaning of the parameters of a model, and show how they can be manipulated to control, or animate the simulation. Using the geometry of subspaces, and statistical pattern recognition theory we derive a technique to discriminate between models, and assess the potential for building a recognition system. Finally, by combining these results with a variational framework, we design a region-based segmentation system able to partition a video sequence into regions characterized by different spatio-temporal statistics.
A practical guide to global illumination using ray tracing and photon mapping
Authors: Henrik Wann Jensen
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

This course serves as a practical guide to ray tracing and photon mapping. The notes are mostly aimed at readers familiar with ray tracing, who would like to add an efficient implementation of photon mapping to an existing ray tracer. The course itself also includes a description of the ray tracing algorithm.There are many reasons to augment a ray tracer with photon maps. Photon maps makes it possible to efficiently compute global illumination including caustics, diffuse color bleeding, and participating media. Photon maps can be used in scenes containing many complex objects of general type (i.e. the method is not restricted to tessellated models). The method is capable of handling advanced material descriptions based on a mixture of specular, diffuse, and non-diffuse components. Furthermore, the method is easy to implement and experiment with.This course is structured as a half day course. We will therefore assume that the participants have knowledge of global illumination algorithms (in particular ray tracing), material models, and radiometric terms such as radiance and flux. We will discuss in detail photon tracing, the photon map data structure, the photon map radiance estimate, and rendering techniques based on photon maps. We will emphasize the techniques for efficient computation throughout the presentation. Finally, we will present several examples of scenes rendered with photon maps and explain the important aspects that we considered when rendering each scene.