ppxscal/embedding_network huggingface dataset:
Evaluating performance of different multicast routing algorithms
Authors: Dan Mancas, Ecaterina - Irina Manole, Nicolae Enescu
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In this paper, an evaluation of the network routing algorithms is made. Problems that arise in routing are treated, each presented in different scenarios in order to obtain a result in comparing different topologies. The comparison analysis is pursuing obtaining a result over the performance of the network. In order to measure performance, the costs of a network and the delays are aimed. After that, the topology effect is presented. In matter of performance, topology and blocking problems are strongly related. As conclusions, solutions for the presented scenarios and also for other important scenarios are given.
3D Dynamic Scene Surveillance and Management Using a 3D Kinetic Spatial Data Structure
Authors: Mir Abolfazl Mostafavi, Leila Hashemi Beni, Marina Gavrilova
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Abstract-Tracking, monitoring and management of moving objects become increasingly important in modern geospatial application. An important example of such applications is monitoring and management of a dynamic scene captured bya network of videos or sensors for ensuring for example the security of the people during a public event, or for leading emergency or rescue teams in real environment. While current GIS are widely used to represent and manage spatiotemporal phenomena, their applications for 3D dynamic environments are very limited due to the 2D static nature of most of existing spatial data structures. In this paper, we first present a review of important requirements for efficient management of a dynamic scene. Next, we present a 3D kinetic data structure based on Delaunay tetrahedralization and Voronoi diagram that allows representation of static and moving objects and their interactions in a 3D dynamic environment, simultaneous tracking of a large number of moving objects, detection of the important events and collisions and other interesting analysis of a dynamic scene. Finally, we discuss other potentials and limitations of the proposed model and suggest some new research avenues regarding the improvement of the proposed model.
Capo: a software-hardware interface for practical deterministic multiprocessor replay
Authors: Pablo Montesinos, Matthew Hicks, Samuel T. King, Josep Torrellas
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

While deterministic replay of parallel programs is a powerful technique, current proposals have shortcomings. Specifically, software-based replay systems have high overheads on multiprocessors, while hardware-based proposals focus only on basic hardware-level mechanisms, ignoring the overall replay system. To be practical, hardware-based replay systems need to support an environment with multiple parallel jobs running concurrently -- some being recorded, others being replayed and even others running without recording or replay. Moreover, they need to manage limited-size log buffers. This paper addresses these shortcomings by introducing, for the first time, a set of abstractions and a software-hardware interface for practical hardware-assisted replay of multiprocessor systems. The approach, called Capo, introduces the novel abstraction of the Replay Sphere to separate the responsibilities of the hardware and software components of the replay system. In this paper, we also design and build CapoOne, a prototype of a deterministic multiprocessor replay system that implements Capo using Linux and simulated DeLorean hardware. Our evaluation of 4-processor executions shows that CapoOne largely records with the efficiency of hardware-based schemes and the flexibility of software-based schemes.
Novel Cross-Transition Elimination Technique Improving Delay and Power Consumption for On-Chip Buses
Authors: Antoine Courtay, Johann Laurent, Olivier Sentieys, Nathalie Julien
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Interconnects are now considered as the bottleneck in the design of system-on-chip (SoC) since they introduce delay and power consumption. To deal with this issue, data coding for interconnect power and timing optimization has been introduced. In today's SoCs these techniques are not efficient anymore due to their codec complexity or to their unrealistic experimentations. Based on some realistic observations on interconnect delay and power estimation, the spatial switching technique [1] is proposed. It allows the reduction of delay and power consumption (including extra power consumption due to codecs) for on-chip buses. The concept of the technique is to detect all cross-transitions on adjacent wires and to decide if the adjacent wires are exchanged or not. Results show the spatial switching efficiency for different technologies and bus lengths. The power consumption reduction can reach up to 12% for a 5-mm bus and more if buses are longer.
Spatiotemporal Segmentation and Tracking of Objects for Visualization of Videoconference Image Sequences
Authors: Ioannis Kompatsiaris, Michael G. Strintzis
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper a procedure is described for the segmentation, content-based coding and visualization of videoconference image sequences. First, image sequence analysis is used to estimate the shape and motion parameters of the person facing the camera. The foreground object is segmented in a number of subobjects, in order to identify the facial region. For this purpose, we propose the novel procedure of K-Means with connectivity constraint algorithm as a general segmentation algorithm combining several types of information including intensity, motion and compactness. In this algorithm, the use of {\em spatiotemporal regions} is introduced since a number of frames is analyzed simultaneously and as a result the same region is present in consequent frames. Based on this information, a 3D ellipsoid is adapted to the person's face using an efficient and robust algorithm. The rigid 3D motion is estimated next using a least median of squares approach. Finally a VRML file is created containing all the above estimated information; this file may be viewed by using any VRML 2.0 compliant browser.
The engineering of micro agents in smart environments
Authors: Caio Augustus Morais Bolzani, Marcio Lobo Netto
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2009)

Agent concepts are natural to describe intelligent and adaptive systems in a distributed and collaborative scenario. In this paper we outline the different aspects we have considered in order to build a tool for supporting developers to handle the complexity they are faced to when designing smart environments. Such tool uses agent-based technologies, and therefore this paper presents the use of micro agents in a general-purpose framework for ambient intelligence. The framework provides all the information about people, places, and things (any objects) with computational functionalities to assist and annotate them. Using a Zigbee wireless network to provide real time people tracking and environmental sensing information to the Home Sapiens -the smart home framework- the micro agents can offer location-aware and personalized services. The framework enables users to develop rules directly accessing its services from an application program interface and to analyze its reliability in a real home automation application.
System-level thermal aware design of applications with uncertain execution time
Authors: Sushu Zhang, Karam S. Chatha
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The paper introduces the problem of system-level thermal aware design of applications with uncertain run time on an embedded processor equipped with dynamic voltage/frequency scaling features. The problem takes as inputs a task sequence, cycle time distribution of each task, and processor thermal model. The solution specifies a voltage/frequency assignment to the tasks such that the expected latency is minimized subject to the probability that the peak temperature constraint is not violated is no less than a designer specified value. We prove that the problem is at least NP-hard, and present optimal and (1 + &epsilon;) fully polynomial time approximation scheme as solutions. To the best of our knowledge, this paper is the first work that addresses the stochastic version of the system-level thermal-aware design problem. We evaluate the effectiveness of our techniques by experimenting with realistic and synthetic benchmarks.
Design and Implementation of Context-Sensitive Mobile Marketing Platforms
Authors: Andreas Albers, Christian Kahl
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

The increasing competition in the Mobile Marketing market indicates that Mobile Marketing platform providers will be forced to integrate identity- and context information offered by the mobile network, in order to improve the efficiency of their applications. However, existing concepts/implementations only unassertively exploit available opportunities as well as insufficiently address emerging impacts in this context. This paper discusses these issues and shows how to consider them when designing Mobile Marketing platforms. In order to demonstrate the feasibility of such a concept, a prototypical implementation is build and documented. Besides showing the feasibility of the concept, the foundation for conducting empirical research (e.g. user acceptance tests) about the young field of context-sensitive Mobile Marketing is provisioned.
Uniform help facilities for a cooperative user interface
Authors: Philip J. Hayes
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper describes the design of the help and explanation component of a user-friendly operating system command interface called COUSIN. The facility can provide two kinds of information: (1) static descriptions of the various subsystems that can be invoked, their parameters, and the syntax that must be used; (2) dynamically generated descriptions of the state of the current interaction, why that state has arisen, and what the user's options for action are. Both types of information are presented in the same way through a network of small text frames connected by semantically motivated links in the style of the ZOG system. Frames containing static information are generated automatically for each subsystem from a declarative description of the subsystem which is also used by COUSIN for its other services, including spelling and grammar correction and interactive error resolution. Dynamically generated frames are incorporated temporarily into the static network with semantic links appropriate to the current command context.
Design decisions for the intelligent database machine
Authors: Robert Epstein, Paula Hawthorn
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The Intelligent Database Machine (IDM), manufactured by Britton-Lee Inc., is a back-end processor and storage system that contains a complete data management system. It includes specialized hardware to perform data management functions. It is our contention that the designers of a database machine must choose a focus for their machine which strongly influences other design decisions. The IDM is low cost, high performance machine designed to support "midrange" users. This paper presents the reasons for this choice, and the resultant design issues.
A maturity model for CBSE
Authors: Ratneshwer Gupta
Venue: Proceedings of the 2nd India software engineering conference (2009)

The Capability Maturity Model (proposed by SEI-CMU) does not consider Component Based Software Engineering (CBSE) principles in its considerations of levels and KPAs. It is therefore necessary to consider a model that is based on peculiarities and importance of CBSE and hence a new model under the name ICMM (Integrated Component Maturity Model) for this purpose is being proposed herein. The model, ICMM, is applicable for many types of organizations like organizations that develop components only, organizations that develop CBS or organizations that develop components along with CBS. This work starts a discussion and calls for more extensive research oriented studies by professionals and academicians for perfection of the model.
A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
Authors: M. Oğuzhan Külekci
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

The performance of the pattern matching algorithms based on bit-parallelism degrades when the input pattern length exceeds the computer word size. Although several divide-and-conquer methods have been proposed to overcome that limitation, the resulting schemes are not that much efficient and hard to implement. This study introduces a new fast bit-parallel pattern matching algorithm that is capable of searching patterns of any length in a common bit-parallel fashion. The proposed bit-parallel length invariant matcher (BLIM) is compared with the Shift-Or and bit-parallel non-deterministic matching (BNDM) algorithms along with the standard Boyer-Moore and Sunday's quick search, which are known to be the very fast in general. Benchmarks have been conducted on natural language, DNA sequence, and binary alphabet random texts. Besides the length invariant architecture of the algorithm, experimental results indicate that on the average BLIM is 18%, 44%, and 6% faster than BNDM, which is accepted as one of the fastest algorithms of this genre, on natural language, DNA sequence and binary random texts respectively.
Path finding in the tile assembly model
Authors: Yuriy Brun, Dustin Reishus
Venue: Theoretical Computer Science (2009)

Swarm robotics, active self-assembly, and amorphous computing are fields that focus on designing systems of large numbers of small, simple components that can cooperate to complete complex tasks. Many of these systems are inspired by biological systems, and all attempt to use the simplest components and environments possible, while still being capable of achieving their goals. The canonical problems for such biologically-inspired systems are shape assembly and path finding. In this paper, we demonstrate path finding in the well-studied tile assembly model, a model of molecular self-assembly that is strictly simpler than other biologically-inspired models. As in related work, our systems function in the presence of obstacles and can be made fault-tolerant. The path-finding systems use @Q(1) distinct components and find minimal-length paths in time linear in the length of the path.
A Sample of Stochastic Simulation of an Automatic Teller Machine
Authors: Naiyue Zhang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

With appropriate assumptions, this paper gives a stochastic model on the ATMs which provide cash service to the people who need to get money from the bank and gives a formula which can offer the gross of the money provided to the people when the number of people obeys Poisson distribution and the the quantity of money obeys Normal distribution. Besides, this paper gives a conclusion with stochastic simulation.
Adaptive Context Transfer Scheme for Fast Handoff in Proxy Mobile IPv6
Authors: JaeJong Baek, JooSeok Song
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

In IETF NetLMM WG (Network-Based Localized Mobility Management), Proxy Mobile IPv6 has attracted a lot of attention to support IP mobility for mobile nodes without host involvement. For supporting delay sensitive services like VoIP, various faster handoff schemes have been proposed recently. In this paper, we propose adaptive context transfer schemes for a fast handoff in Proxy Mobile IPv6 which reduces the delay in AAA authentication and specified context transfer scenarios taking into account proactive and reactive handoff. A context transfer protocol will reduce the latency and packet losses by avoiding the re-initiation of signaling to and from the mobile node.
A Geometry of Approximation: Rough Set Theory Logic, Algebra and Topology of Conceptual Patterns (Trends in Logic), 1st edition
Authors: Piero Pagliani, Mihir Chakraborty
Venue:  (2008)

'A Geometry of Approximation' addresses Rough Set Theory, a field of interdisciplinary research first proposed by Zdzislaw Pawlak in 1982, and focuses mainly on its logic-algebraic interpretation. The theory is embedded in a broader perspective that includes logical and mathematical methodologies pertaining to the theory, as well as related epistemological issues. Any mathematical technique that is introduced in the book is preceded by logical and epistemological explanations. Intuitive justifications are also provided, insofar as possible, so that the general perspective is not lost. Such an approach endows the present treatise with a unique character. Due to this uniqueness in the treatment of the subject, the book will be useful to researchers, graduate and pre-graduate students from various disciplines, such as computer science, mathematics and philosophy. It features an impressive number of examples supported by about 40 tables and 230 figures. The comprehensive index of concepts turns the book into a sort of encyclopaedia for researchers from a number of fields. 'A Geometry of Approximation' links many areas of academic pursuit without losing track of its focal point, Rough Sets.
Resource demand and supply in BitTorrent content-sharing communities
Authors: Nazareno Andrade, Elizeu Santos-Neto, Francisco Brasileiro, Matei Ripeanu
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

BitTorrent is a widely popular peer-to-peer content distribution protocol. Unveiling patterns of resource demand and supply in its usage is paramount to inform operators and designers of BitTorrent and of future content distribution systems. This study examines three BitTorrent content-sharing communities regarding resource demand and supply. The resulting characterization is significantly broader and deeper than previous BitTorrent investigations: it compares multiple BitTorrent communities and investigates aspects that have not been characterized before, such as aggregate user behavior and resource contention. The main findings are three-fold: (i) resource demand - a more accurate model for the peer arrival rate over time is introduced, contributing to workload synthesis and analysis; additionally, torrent popularity distributions are found to be non-heavy-tailed, what has implications on the design of BitTorrent caching mechanisms; (ii) resource supply - a small set of users contributes most of the resources in the communities, but the set of heavy contributors changes over time and is typically not responsible for most resources used in the distribution of an individual file; these results imply some level of robustness can be expected in BitTorrent communities and directs resource allocation efforts; (iii) relation between resource demand and supply - users that provide more resources are also those that demand more from it; also, the distribution of a file usually experiences resource contention, although the communities achieve high rates of served requests.
From geek to sleek: integrating task learning tools to support end users in real-world applications
Authors: Aaron Spaulding, Jim Blythe, Will Haines, Melinda Gervasio
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Numerous techniques exist to help users automate repetitive tasks; however, none of these methods fully support end-user creation, use, and modification of the learned tasks. We present an integrated task learning system (ITL) that learns executable procedures based on user demonstration and instruction, constituting a first step toward a broader solution for procedure management. We discuss our deployment of ITL into a collaborative command-and-control system. In this complex domain, ITL's performance with end users doing real tasks indicates that providing multiple, integrated learning techniques both extends functionality and improves user experience. Our experience in integrat-ing this system also provides key insights for future designs of domain-independent task learning systems, specifically in supporting users' ability to understand and edit lengthy procedures.
Bee colony optimization algorithm with big valley landscape exploitation for job shop scheduling problems
Authors: Li-Pei Wong, Chi Yung Puan, Malcolm Yoke Hean Low, Chin Soon Chong
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Scheduling is a crucial activity in semiconductor manufacturing industry. Effective scheduling in its operations leads to improvement in the efficiency and utilization of its equipment. Job Shop Scheduling is an NP-hard problem which is closely related to some of the scheduling activities in this industry. This paper presents an improved Bee Colony Optimization algorithm with Big Valley landscape exploitation as a biologically inspired approach to solve the Job Shop Scheduling problem. Experimental results comparing our proposed algorithm with Shifting Bottleneck Heuristic, Tabu Search Algorithm and Bee Colony Algorithm with Neighborhood Search on Taillard JSSP benchmark show that it is comparable to these approaches.
A Framework for Suspicious Action Detection with Mixture Distributions of Action Primitives
Authors: Yoshio Iwai
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper, we propose a generic framework for detecting suspicious actions with mixture distributions of action primitives, of which collection represents human actions. The framework is based on Bayesian approach and the calculation is performed by Sequential Monte Carlo method, also known as Particle filter. Sequential Monte Carlo is used to approximate the distributions for fast calculation, but it tends to converge one local minimum. We solve that problem by using mixture distributions of action primitives. By this approach, the system can recognize people's actions as whether suspicious actions or not.
Robust clustering analysis for the management of self-monitoring distributed systems
Authors: Andres Quiroz, Nathan Gnanasambandam, Manish Parashar, Naveen Sharma
Venue: Cluster Computing (2009)

We present a decentralized algorithm for online clustering analysis used for anomaly detection in self-monitoring distributed systems. In particular, we demonstrate the monitoring of a network of printing devices that can perform the analysis without the use of external computing resources (i.e. in-network analysis). We also show how to ensure the robustness of the algorithm, in terms of anomaly detection accuracy, in the face of failures of the network infrastructure on which the algorithm runs. Further, we evaluate the tradeoff in terms of overhead necessary for ensuring this robustness and present a method to reduce this overhead while maintaining the detection accuracy of the algorithm.
What manufacturers would like to see happening in point-of-sale
Authors: Gerald T. Montgomery, Vernon L. Schatz
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Implementation of electronic Point-of-Sale (POS) Systems is still in its early stages, so many of the potential benefits are still untapped.