ppxscal/embedding_network huggingface dataset:
Resource allocation and wireless scheduling scheme for a HiperLAN/2 system
Authors: Christophe Mangin, Gwillerm Froc, Romain Rollet
Venue: Mobile Networks and Applications (2005)

In this paper, a dynamic resource allocation scheme for a wireless local area network system is presented. It aims at enforcing the Quality of Service requirements of the applications that are carried on the wireless link even when errors occur on it. The allocation takes benefit from the coexistence of connections that have different QoS tolerances so that, when facing errors, the bandwidth allocated to the more tolerant connections could be reduced and attributed to the connection with more stringent QoS requirements to perform retransmissions. For that purpose, two classes of Quality of Service are considered that are related to Constant Bit Rate traffics and best-effort traffics. The scheduling framework is then based on a hierarchical rate-based fair queuing algorithm and is extended in order to cope with error. To illustrate its operation, the proposed scheme is applied to the ETSI HiperLAN/2 WLAN. Some simulation results are reported and show the impact of the scheduling principles on best-effort traffics such as TCP applications and its actual benefits for CBR traffic. The efficiency of the proposed mechanism is evaluated using measurement of delays and throughputs at Data Link Layer level. The aim of this paper is not so much to prove the fairness of this mechanism but rather its ability to guarantee negotiated services required by heterogeneous applications.
Fifth SIGSMALL Symposium 2, 3, 4 August 1982 Colorado Springs, Colorado
Authors: Hal Berghel
Venue: ACM SIGSMALL Newsletter (1982)

In the summer of 1980, a California communications firm contracted me to conduct a feasibility study, the focus of which was to be a hand-held Diet Calculator which would keep a running total of the calories, tata, carbohydrates, cholesterol, protein, sodium, etc. intake for individuals on restricted diets. The president of the firm wanted a display prototype and a rough estimate of unit cost. If the results of the study looked favorable, a new company would be formed to manufacture and market this product. In this paper I will brietly summarize the results of this project.The key to this endeavor was flexibility. We were unsure of which food properties would eventually be important to monitor, and what ultimate size the calculator should have. So we aimed at 8 food properties, and an overall dimension of approximately 6" &times; 3" &times; 1/2". Other than these basic guidelines, the project was omnidirectional. Every facet of the product had to be explored including the hardware and software engineering, subcontracting the plastics, keyboard, LCD display, power supply, estimates on tooling and mask charges, etc. This soon became an eye-opening experience.
Is problem solving, or simulation model solving, mission critical?
Authors: Ray J. Paul, Tillal Eldabi, Jasna Kuljis, Simon J. E. Taylor
Venue: Proceedings of the 37th conference on Winter simulation (2005)

How do we consider problems and models in the practice of simulation? It is our possibly contentious observation that simulation model solving seems to be more critical to the mission of simulation modeling than problem solving. Inspired by the theme of this year's Winter Simulation Conference, we ask the question, "Is problem solving, or simulation model solving, mission critical?" To investigate this we look at three perspectives, those of the textbook, the article and the editorial. The textbook perspective is the balance of the "traditional" view of simulation presented by the academic textbook against practical experience. The article perspective is a classification of papers published in four leading simulation journals in the year 2004 (ACM TOMACS, SIMULATION, Simulation Modelling Practice and Theory, and Simulation & Gaming). The editorial perspective is a discussion of editorial policy presented by the same journals. Our findings show that our observation is not contradicted.
Energy Optimization under Informed Mobility
Authors: Chiping Tang, Philip K. McKinley
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Energy optimization is important in wireless ad hoc networks, where node battery power is usually limited. Research results show that such a network can exploit controlled node mobility to reduce communication-related energy consumption. However, node movement itself usually consumes energy. In this paper we study the energy optimization problem that accounts for energy costs associated with both communication and physical node movement. We refer to this model as informed mobility. We first review the theoretical foundations on how to reduce total communication energy consumption, as well as increase system lifetime, by combining node movement and transmission power adaptation. Next, we describe and analyze the informed mobility optimization problem. Based on this analysis, we introduce localized algorithms and protocols for informed mobility. We propose iMobif, a flow-based informed mobility framework that collects network information for mobility decision making. We demonstrate how to use iMobif to minimize total communication energy consumption as well as to maximize system lifetime. We compare the performance of iMobif to that of systems with no mobility or only cost-unaware mobility. Simulation results show iMobif is effective in reducing energy consumption relative to such systems.
An Integration of HOL and ACL2
Authors: Michael J. C. Gordon, James Reynolds, Warren A. Hunt, Matt Kaufmann
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

A link between the ACL2 and HOL4 proof assistants is described. This allows each system to be deployed smoothly within a single formal development. Several applications are being considered: using ACL2's execution environment for simulating HOL models; using ACL2's proof automation to discharge HOL proof obligations; and using HOL to specify and verify properties of ACL2 functions that cannot easily be stated in the first-order ACL2 logic. Care has been taken to ensure sound translations between the logics supported by HOL and ACL2. The initial ACL2 theory has been defined inside HOL, so that it is possible to prove mechanically that first-order ACL2 functions on S-expressions correspond to higher-order functions operating on a variety of types. The translation between the two systems operates at the level of S-expressions and is intended to handle large hardware and software models.
Robust mechanisms for information elicitation
Authors: Aviv Zohar, Jeffrey S. Rosenschein
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based on proper scoring rules. Scoring rules, like many other mechanisms set in a probabilistic environment, assume that all participating agents share some common belief about the underlying probability of events. In real-life situations however, underlying distributions are not known precisely, and small differences in beliefs about these distributions may alter agent behavior under the prescribed mechanism.We propose designing elicitation mechanisms in a manner that will be robust to small changes in belief. We show how to algorithmically design such mechanisms in polynomial time using tools of stochastic programming and convex programming, and discuss implementation issues for multiagent scenarios.
Fabrication, experiment of a microactuator using magnetic fluid for micropump application
Authors: Wonchul Sim, Jaegeun Oh, Bumkyoo Choi
Venue: Microsystem Technologies (2006)

This paper presents the characteristics of the first microactuator using magnetic fluid (MF). MF actuators with flat and corrugated diaphragms are fabricated by the micromachining technique and their deflections are measured. The MF actuator consists of an inductor, a fluid chamber filled with magnetic fluid, and a parylene diaphragm. In the presence of the magnetic field, magnetic fluid easily deforms its shape and generates some pressure. The relation between the MF pressure and magnetic flux density is obtained by the comparison of the deflection for the applied air pressure with that for the MF pressure. At 110 Gauss, the deflection of MF actuator with corrugated parylene diaphragm is more than 200&#x00a0;&#x03bc;m and the generated MF pressure is 2.8&#x00a0;kPa. The successful operation of the first MF actuator shows the high potential for the application to the micromachined devices.
A Framework for a Collaborative DDoS Defense
Authors: George Oikonomou, Jelena Mirkovic, Peter Reiher, Max Robinson
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Increasing use of the Internet for critical services makes flooding distributed denial-of-service (DDoS) a top security threat. A distributed nature of DDoS suggests that a distributed mechanism is necessary for a successful defense. Three main DDoS defense functionalities -- attack detection, rate limiting and traffic differentiation -- are most effective when performed at the victim-end, core and sourceend respectively. Many existing systems are successful in one aspect of defense, but none offers a comprehensive solution and none has seen a wide deployment. We propose to harvest the strengths of existing defenses by organizing them into a collaborative overlay, called DefCOM, and augmenting them with communication and collaboration functionalities. Nodes collaborate during the attack to spread alerts and protect legitimate traffic, while rate limiting the attack. DefCOM can accommodate existing defenses, provide synergistic response to attacks and naturally lead to an Internet-wide response to DDoS threat.
Approaching Effective Data Visualisation in a Research Setting
Authors: Mark R. Titchener
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

A general purpose, easy-to-use graphical visualisation tool has been developed to facilitate the display of experiment data. It supports simultaneous or selective rendering of surfuces, graphs and animated traces in a virtual 30 environment. It can accept as many as 100,000 objectsfor animated replay, and allows for interactive control of viewing position, lighting and other display parameters. The viewer is thus well suited to scoping expeviment results, visually debugging data processing algorithms, andpresenting conzplex data. Its principal application is in the visualisation of surfaces and graphs in the entropy analysis of medical and industrial related time-series.
Introducing a Java-Based Simple API for Binary REpresentations (SABRE)
Authors: Michael Hartle, Max Muhlhauser
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

This paper presents the Simple API for Binary REpresentations (SABRE) in its initial ver,sion 1.0. SABRE dejines observer-pattern interfaces for processing hierarchically structured, binary-oriented documents, comparable to the Simple API for XML (SAX). By modularizing processing steps into seperate stages of a streaming pipeline, SABRE facilitates parsing, transforming and serializing of large binary documents. Its applicability for multimedia documents is demonstrated through its use case, the generation of Apple Quick- Time multimedia documents, and an example for a selected portion of such a document is given.
Why You Shouldn't Study Security
Authors: Tuomas Aura
Venue: IEEE Security and Privacy (2006)

A colleague recently mentioned that his son was looking for a PhD program and was considering security as a topic. The immediate reaction from the security researchers present was something to this effect: "No, don't. There are so many other, more interesting things in the world." This might sound like a group of disappointed people, but as far as I know, we all thoroughly enjoy working in the field and by no means regret it as a career choice.
New Mathematical Method for Computer Graphics
Authors: Ray Seyfarth, Joseph Kolibal, Daniel Howard
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Rendering two-dimensional data in the case of rough, complex surfaces is a challenge in computer graphics. Typically, splines with knots and control points are used, and while they yield useful surfaces they can be of poor quality, or can be difficult to apply. Fundamentally splines are local. An alternative mathematical method is to construct global methods which can be tuned to have polynomial behavior, or behave in ways that are not as restrictive, and which can be local, or not, depending on user input. This study examines a hybrid method of stochastic interpolation built around Bernstein functions. This approach is non-polynomial and global, but readily computable and can successfully fit complex two-dimensional surface data to obtain high quality at low computational cost. The representation of parametric surfaces in 3 dimensions can be achieved using approximation, or interpolation using this method. The generation of computational surfaces rendered using OpenGL, shows that this hybrid method of Bernstein function interpolation is a sound approach to surface rendering, and computational issues in achieving speed with accuracy are discussed. The hybrid method is shown to be robust, and can be selectively adjusted to yield controlled smoothing of the surface data. The method enables use of computational stencils of arbitrary size, and permits the construction of infinitely differentiable surfaces if needed.
Ideas for modeling and simulation of supply chains with Arena
Authors: Guilherme Ernani Vieira
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper presents a research project being developed at the Industrial and Systems Engineering Graduate Program at the Catholic University of Paran&aacute; (Brazil). The objective is to develop a system to aid professionals from management and logistics areas to evaluate the performance of supply chains through computer simulation. Among the several possibilities for analysis, simulation can allow one to perform detailed studies on the bullwhip effect in supply chains, caused by the demand variation from the point-of-sale to the suppliers. Two performance measures are of particular interest: average inventory level and service level, both for each stage at and for the whole supply chain. The structure considered in this project is the traditional supply chain composed by suppliers, manufactures, distributors (or wholesalers), retailers and customers. A first version of the proposed Arena simulation models is under development and is presented in this paper.
RouterFarm: towards a dynamic, manageable network edge
Authors: Mukesh Agrawal, Susan R. Bailey, Albert Greenberg, Jorge Pastor, Panagiotis Sebos, Srinivasan Seshan, Kobus van der Merwe, Jennifer Yates
Venue: Proceedings of the 2006 SIGCOMM workshop on Internet network management (2006)

Planned maintenance is a fact of life in IP networks. Examples of maintenance activities include updating router software as well as processor upgrades, memory upgrades, installation of additional line cards, and other hardware upgrades. While planned maintenance is clearly necessary, it is also costly. Software upgrades, for example, require rebooting the router. Due to the time required to reboot the router, and then synchronize state (such as BGP routing information) with network neighbors, the upgrade process can yield outages of 10--15 minutes.
End-to-End Batch Transmission in a Multihop and Multirate Wireless Network: Latency, Reliability, and Throughput Analysis
Authors: Teerawat Issariyakul, Ekram Hossain, Attahiru Sule Alfa
Venue: IEEE Transactions on Mobile Computing (2006)

This paper presents a novel Markov-based model for analyzing the end-to-end transmission of a batch of packets in a multihop wireless network using multirate transmission. The end-to-end reliability of this transmission (in terms of the number of packets delivered to the destination node) is controlled through different types of Automatic Repeat reQuest (ARQ)-based error control mechanisms implemented at each node. For a batch of packets, we derive complete statistics (i.e., probability mass function) for end-to-end latency and the number of packets successfully delivered to the destination node. Typical numerical results obtained from the model are validated by means of simulation. These results reveal the trade-off between end-to-end latency and end-to-end reliability, which would be an important issue in designing and engineering multihop wireless networks. Also, we demonstrate the usefulness of the proposed analytical model in predicting the latency and the reliability performances of TCP (Transmission Control Protocol) in a multihop wireless scenario.
Renyi information and signal-dependent optimal kernel design
Authors: Tzu-Hsien Sang, W. J. Williams
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The Renyi uncertainty measure has been proposed to be a measurement of complexity of signals. We further suggest that it can be used to evaluate the performance of different time-frequency distributions (TFDs). We provide two schemes of normalization in calculating the Renyi uncertainty measure. For the first one, TFDs are normalized by their energy, while for the second one, normalized with their volume. The behavior of the Renyi uncertainty measure under several situations is studied. A signal-dependent algorithm is developed to achieve TFDs with a minimal uncertainty measure. For the first normalization scheme, the Wigner distribution is found to be optimal or near-to-optimal under certain constraints. If the second scheme is used, our program can generate minimum uncertainty product kernels which are very effective at suppressing cross terms and maintaining high resolution.
Distributed computer supported collaborative learning through shared practice and social participation
Authors: Lone Dirckinck-Holmfeld, Elsebeth K. Sorensen
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

As an educational approach, Computer Supported Collaborative Learning is often interpreted as a restricted concept concerning shared knowledge acquisition rather than, more broadly, as a holistic process of shared formation and socialization. Several aspects of learning and cases of research, however, indicate that we need to consider the idea of educational processes as processes of socialization, e.g. Jean Lave and Etienne Wenger (1991) who work from a concept of learning as social participation.In physical institutions there are different socialization structures at work which support the learning process: the buildings, the course plan, the schedule, the pedagogical principles, the physical gatherings, the evaluation system, etc., all of which are elements in the socialization process. Normally, these socialization structures work "tacitly" and, as such, they are not reflected. However, when establishing virtual educational programs, we need to make explicit the socialization structures which may support the learning processes and the shared knowledge construction.This paper presents an educational design of Distributed CSCL. From central key concepts in the social, analytical framework of Situated Learning (Lave & Wenger 1991), the paper discusses how - and to what extent the request of supporting socialization structures in the virtual distributed learning process are dealt with.
Interactive Intelligent Agent Architecture
Authors: Rym Ameur, Jean-Claude Heudin
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

This paper proposes a conversational creature model. It is based on multi-agent subsumption architecture. Behaviours agents are represented by classifiers. We use an ethological hierarchy of agents from reflexive agent to cognitive agent. A strategic agent is also developed to control the whole dialogue, into a proactive architecture. To make this conversational creature evolve, we use a classifier system based on lisp-like s-expressions.
QCWS: an implementation of QoS-capable multimedia web services
Authors: Tao Yu, Kwei-Jay Lin
Venue: Multimedia Tools and Applications (2006)

QoS (Quality of Service), which defines service quality such as latency, availability, timeliness and reliability, is important for web applications that provide real-time information, multimedia content, or time-critical services. Many web applications are best implemented by servers with a guaranteed server processing capacity. In this research, we study the QoS control issues using the current Web services standards. We propose a QoS-capable Web service architecture, QCWS, by deploying a QoS broker between Web service clients and providers. The functions of the QoS broker module include tracking QoS information about servers, making selection decisions for clients, and negotiating with servers to get QoS agreements. We have implemented a QCWS prototype using IBM WSDK, enhanced with simple QoS capabilities. We have measured the performance running under different service priorities.
Multicue HMM-UKF for Real-Time Contour Tracking
Authors: Yunqiang Chen, Yong Rui, Thomas S. Huang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

We propose an HMM model for contour detection based on multiple visual cues in spatial domain and improve it by joint probabilistic matching to reduce background clutter. It is further integrated with unscented Kalman filter to exploit object dynamics in nonlinear systems for robust contour tracking.
Scrap your boilerplate with XPath-like combinators
Authors: Ralf Lämmel
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

XML programming involves idioms for expressing 'structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the relationships between such XML idioms and generic functional programming, while focusing on the (Haskell-based) 'Scrap your boilerplate' style of generic programming (SYB). This work gives insight into mechanisms for traversal and selection. We compare SYB and XSLT. We approximate XPath in SYB. We make a case for SYB's programmability, when compared to XPath's fixed combinators. We allude to strengthened type checking for SYB traversals so as to reject certain, trivial behaviors.
Dynamic Appearance Modeling for Human Tracking
Authors: Hwasup Lim, Octavia I. Camps, Mario Sznaier, Vlad I. Morariu
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Dynamic appearance is one of the most important cues for tracking and identifying moving people. However, direct modeling spatio-temporal variations of such appearance is often a difficult problem due to their high dimensionality and nonlinearities. In this paper we present a human tracking system that uses a dynamic appearance and motion modeling framework based on the use of robust system dynamics identification and nonlinear dimensionality reduction techniques. The proposed system learns dynamic appearance and motion models from a small set of initial frames and does not require prior knowledge such as gender or type of activity. The advantages of the proposed tracking system are illustrated with several examples where the learned dynamics accurately predict the location and appearance of the targets in future frames, preventing tracking failures due to model drifting, target occlusion and scene clutter.