ppxscal/embedding_network huggingface dataset:
Differentiation of Downlink 802.11e Traffic in the Virtual Collision Handler
Authors: Paal E. Engelstad, Olav N. Osterbo
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

A number of analytical models have been proposed to describe the priority schemes of the Enhanced Distributed Channel Access (EDCA) mechanism of the IEEE 802.11e standard. EDCA provides a class-based differentiated Quality of Service (QoS) to IEEE 802.11 WLANs. Many have used a multiple number of nodes to study the differentiation behaviour of the model. However, in many real-life usage scenarios Internet traffic is often asymmetric with much downlink traffic from the access point to the stations and little traffic in the reverse direction. Hence, most of the overall traffic differentiation will happen in the Virtual Collision Handler (VCH) of the access point. If the access point uses EDCA, it should know the characteristics of the VCH to be able to control the differentiation of the downlink traffic. The main contribution of this paper opposed to other works is that it demonstrates how a generic channel model of 802.11e can be modified to predict the performance behaviour of the VCH with a remarkably good accuracy. In doing so, we first introduce virtual collision handling into the generic model. We also show how to derive a closed-form solution for the performance. We observe good match between the analytical model and simulations.
New evolutionary approach to the GCP: a premature convergence and an evolution process character
Authors: Pawel B. Myszkowski
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

This paper presents a new approach to the Graph Coloring Problem (GCP) which utilizes information about conflict localization in a given coloring. In this context a partial fitness function (pff) and its usage to specialize genetic operators and phenotypic measure of diversity in population are described. Particular attention is given to the investigation of the influence of the population size and the usage of genetic operators on the character of the evolution, especially influence leading to a premature convergence in the evolution process. Experiments based on benchmark DIMACS graphs are presented.
Proportional Fairness for QoS Enhancement in IEEE 802.11e WLANs
Authors: Jeng Farn Lee, Wanjiun Liao, Meng Chang Chen
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we study the proportional fairness problem in IEEE 802.11e wireless local area networks (WLANs). With 802.11e EDCA, only priority-based service is supported. Such priority-based service, while allowing differentiated service for flows of different priorities, cannot ensure service amount in proportion to their demands. This calls for weighted fair service to be supported by EDCA. In this paper, we propose a mechanism called Weighted Fair - EDCA (WF-EDCA) to provide proportional fairness for IEEE 802.11 WLANs. With WF-EDCA, weighted fair service among different access categories (ACs) is provided, and strict priority service can also be implemented. We then conduct simulations based on ns-2 to compare the performance of WF-EDCA and EDCA. The results show that WF-EDCA outperforms EDCA in terms of providing proportional fairness and strict priority service for IEEE 802.11 WLANs while retaining comparable total throughput.
Transparent, Incremental Checkpointing at Kernel Level: a Foundation for Fault Tolerance for Parallel Computers
Authors: Roberto Gioiosa, Jose Carlos Sancho, Song Jiang, Fabrizio Petrini
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We describe the software architecture, technical features, and performance of TICK (Transparent Incremental Checkpointer at Kernel level), a system-level checkpointer implemented as a kernel thread, specifi- cally designed to provide fault tolerance in Linux clusters. This implementation, based on the 2.6.11 Linux kernel, provides the essential functionality for transparent, highly responsive, and efficient fault tolerance based on full or incremental checkpointing at system level. TICK is completely user-transparent and does not require any changes to user code or system libraries; it is highly responsive: an interrupt, such as a timer interrupt, can trigger a checkpoint in as little as 2.5µs; and it supports incremental and full checkpoints with minimal overhead-less than 6% with full checkpointing to disk performed as frequently as once per minute.
Extending BPEL for Run Time Adaptability
Authors: Dimka Karastoyanova, Alejandro Houspanossian, Mariano Cilia, Frank Leymann, Alejandro Buchmann
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

The existing Web Service Flow (WS-flow) technologies enable both static and dynamic binding of participating Web services (WSs) on the process model level. Adaptability on per-instance basis is not sufficiently supported and therefore must be addressed to improve process flexibility upon changes in the environment. Ad-hoc process instance changes can be enabled by swapping participating WS instances, by modifying port Types of the partners to be invoked, and by changing process logic. In this work we address the problem of dynamic binding of WSs to WS-flow instances at run time, i.e. the ability to exchange a WS instance participating in a WS-flow instance with an alternative one. The problem is additionally complicated by the fact that the execution of a process depends on its deployment. We describe the "find and bind" mechanism, and we show its representation as a BPEL extension. We discuss the benefits that could be gained and the disadvantages it brings in. The mechanism extends and improves the existing process technologies. It facilitates a precisely controlled policy-based selection of WSs at run time and also provides for process instance repair, while maintaining simplicity. We also discuss a prototypical implementation of the presented functionality.
A New Characterization of Semi-bent and Bent Functions on Finite Fields*
Authors: Khoongming Khoo, Guang Gong, Douglas R. Stinson
Venue: Designs, Codes and Cryptography (2006)

We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i+1) is semi-bent over GF(2n), n odd, by a polynomial GCD computation. By analyzing this GCD condition, we provide simpler characterizations of semi-bent functions. For example, we deduce that all linear combinations of Gold functions give rise to semi-bent functions over GF(2p) when p belongs to a certain class of primes. Second, we generalize our results to fields GF(pn) where p is an odd prime and n is odd. In that case, we can determine whether a GF(p)-linear combination of Gold functions Tr(xpi+1) is (generalized) semi-bent or bent by a polynomial GCD computation. Similar to the binary case, simple characterizations of these p-ary semi-bent and bent functions are provided.
An Optimization-based Approach to Dynamic Visual Context Management
Authors: Zhen Wen, Michelle X. Zhou, Vikram Aggarwal
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

We are building an intelligent multimodal conversation system to aid users in exploring large and complex data sets. To tailor to diverse user queries introduced during a conversation, we automate the generation of system responses, including both spoken and visual outputs. In this paper, we focus on the problem of visual context management, a process that dynamically updates an existing visual display to effectively incorporate new information requested by subsequent user queries. Specifically, we develop an optimization-based approach to visual context management. Compared to existing approaches, which normally handle predictable visual context updates, our work offers two unique contributions. First, we provide a general computational framework that can effectively manage a visual context for diverse, unanticipated situations encountered in a user-system conversation. Moreover, we optimize the satisfaction of both semantic and visual constraints, which otherwise are difficult to balance using simple heuristics. Second, we present an extensible representation model that uses feature-based metrics to uniformly define all constraints. We have applied our work to two different applications and our evaluation has shown the promise of this work.
MusicStory: a personalized music video creator
Authors: David A. Shamma, Bryan Pardo, Kristian J. Hammond
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we describe MusicStory, a system that automatically creates videos to accompany music with lyrics. MusicStory uses common search engines, photo-sharing websites, and simple analysis of the dynamics and tempo of the music to create personalized photo-narratives. Video pacing and content is based on the content of the song and structure of the image repositories selected. The image associations MusicStory presents amplify the emotional experience by externalizing the imagery in song lyrics with the content found within a social network. The resulting work juxtaposes the meanings inherent in the social network with those in the song.
Exploring XCS in multiagent environments
Authors: Hiroyasu Inoue, Keiki Takadama, Katsunori Shimohara
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This paper investigates the adaptability of XCS in four different multiagent environments. The environments are realized in a simplified soccer game, and they include (1) single-agent environment, (2) multiagent environment with an opponent, (3) multiagent environment with a teammate, (4) multiagent environment with both an opponent and a teammate. Although XCS generally seems inferior to strength-based XCS in such stochastic environments, experimental results in a specific stochastic environment show that XCS is superior to strength-based XCS. Furthermore, XCS with profit sharing is more effective than one using the bucket brigade in multiagent environments.
On the Server Fairness of Congestion Control in the ISP Edge Router
Authors: Hsien-Ming Wul, Chin-Chi Wu, Woei Linl
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The Internet Engineering Task Force (IETF) recommended the deployment ofActive Queue Management (AQM) in the Internet routers in 1998.There were more than 50 new AQM algorithms which have been proposed since 1999.They did not consider the server fairness problem caused by AQM mechanisms proposed.However, it happens that one may intentionally, but in a legal way, generates many"flows" for the same job in order to grab more bandwidth. This makes bandwidth sharesfor other servers unfair, and will make ISP price-based services policy enforcementdifficult. In this paper, we consider a novel server-based congestion control approachwhich is based on the well known AQM algorithm A-RED (Adaptive Random Earlier Detection)and is so called SF-RED. This approach can provide fair services to different serverswithout affecting congestion control performance in terms of packet loss rate and queuestability. We use NS2 simulator to prove the effectiveness of our approach.
Linearity Embedded in Nonconvex Programs
Authors: Leo Liberti
Venue: Journal of Global Optimization (2005)

Nonconvex programs involving bilinear terms and linear equality constraints often appear more nonlinear than they really are. By using an automatic symbolic reformulation we can substitute some of the bilinear terms with linear constraints. This has a dramatically improving effect on the tightness of any convex relaxation of the problem, which makes deterministic global optimization algorithms like spatial Branch-and-Bound much more eff- cient when applied to the problem.
An intelligent discussion-bot for answering student queries in threaded discussions
Authors: Donghui Feng, Erin Shaw, Jihie Kim, Eduard Hovy
Venue: Proceedings of the 11th international conference on Intelligent user interfaces (2006)

This paper describes a discussion-bot that provides answers to students' discussion board questions in an unobtrusive and human-like way. Using information retrieval and natural language processing techniques, the discussion-bot identifies the questioner's interest, mines suitable answers from an annotated corpus of 1236 archived threaded discussions and 279 course documents and chooses an appropriate response. A novel modeling approach was designed for the analysis of archived threaded discussions to facilitate answer extraction. We compare a self-out and an all-in evaluation of the mined answers. The results show that the discussion-bot can begin to meet students' learning requests. We discuss directions that might be taken to increase the effectiveness of the question matching and answer extraction algorithms. The research takes place in the context of an undergraduate computer science course.
Uncertainty: A Meta-Property of Software
Authors: Phillip A. Laplante, Colin J. Neill
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

Uncertainty pervades all aspects of engineering, and its management is of paramount importance. In software engineering, uncertainty can occur at many levels. It can appear in the software artifacts including requirements specifications, designs, and the code itself. Uncertainty can also manifest in the way we use tools, and in the engineering practices employed. It is even present in the life cycle methodologies we employ. In short, uncertainty is a persistent, negative quality of both the software and the processes that rendered it. Unfortunately, it is too easy, but often the case, that software engineers ignore issues of uncertainty or overlook them as they become marginalized within other abstractions. In this paper we propose uncertainty as a persistent software quality attribute and examine several approaches for modeling that uncertainty. Finally, we offer suggestions for future work in this regard.
How to Fake 1000 Registers
Authors: David W. Oehmke, Nathan L. Binkert, Trevor Mudge, Steven K. Reinhardt
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Large numbers of logical registers can improve performance by allowing fast access to multiple subroutine contexts (register windows) and multiple thread contexts (multithreading). Support for both of these together requires a multiplicative number of registers that quickly becomes prohibitive. We overcome this limitation with the virtual context architecture (VCA), a new register-file architecture that virtualizes logical register contexts. VCA works by treating the physical registers as a cache of a much larger memorymapped logical register space. Complete contexts, whether activation records or threads, are no longer required to reside in their entirety in the physical register file. A VCA implementation of register windows on a single-threaded machine reduces data cache accesses by 20%, providing the same performance as a conventional machine while requiring one fewer cache port. Using VCA to support multithreading enables a four-thread machine to use half as many physical registers without a significant performance loss. VCA naturally extends to support both multithreading and register windows, providing higher performance with significantly fewer registers than a conventional machine.
Stability of Vector Problems of Integer Optimization: Relationship with the Stability of Sets of Optimal and Nonoptimal Solutions
Authors: T. T. Lebedeva, N. V. Semenova, T. I. Sergienko
Venue: Cybernetics and Systems Analysis (2005)

Several types of stability against perturbations of vector criterion coefficients are analyzed from the same point of view for a vector integer optimization problem with quadratic criterion functions. The concept of stability is defined. Necessary and sufficient conditions are formulated and analyzed for each type of stability. The topological structure of the sets of initial data on which some solution remains optimal is described.
New Products
Authors: Keith Farkas, Eyal de Lara
Venue: IEEE Pervasive Computing (2005)

In this column, editors Keith Farkas and Eyal de Lara review a Bluetooth-based proximity broadcasting system and a Wi-Fi watchdog system, both of which raise some privacy issues. They also review a video display that projects into thin air, technology enabling 3D TVs, and a production-quality two-way display, which is similar in spirit to the prototype we reviewed in the last column. Finally, they examine a virtual computer, an ultraportable personal server, a novel keyboard, and a bionic arm that suggests the future of human-computer integration.
Measuring the Complexity of a UML Component Specification
Authors: Sajjad Mahmood, Richard Lai
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Component Based System (CBS) development is about assembling individual components to produce a working system. However, its overall complexity does not only depend on the complexity of individual components. Further, component source code information is usually unavailable and they introduce additional properties such as constraints associated with its use, interactions among components, and customizability. The traditional complexity metrics are not adequate and do not easily apply to CBS as they mainly focus on either Lines of Codes (LOC) or information based on objects, classes and their inheritance properties. Recent CBS research suggests that most faults are found in few components. A complexity measure at specification level can be used for identifying these components; and precautionary actions can be taken to avoid the likely failures and to lower maintenance costs. There is therefore a need to develop a new technique for measuring the complexity of a component specification. This paper describes a complexity measure for a component specification written in Unified Modeling Language (UML).
Successful simulation of complex systems with SIMSCRIPT II.5
Authors: J. S. Annino, E. C. Russell
Venue: ACM SIGSIM Simulation Digest (1978)

Digital simulation is an effective method of pretesting proposed systems, plans or policies prior to the development of expensive prototypes, field tests or actual implementations. In simulation analysis the computer traces out in detail the implications and consequences of a proposed system or course of action. Compared with other forms of analysis, simulation is more realistic, more easily understood and more conclusive. Because the results are easier to understand, the conclusions receive wider acceptance.
GcpSensor: a CPU Performance Tool for Grid Environments
Authors: Dong Guo, Liang Hu, Meng Zhang, Zhuopeng Zhang
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

In grid computing environments, CPU performance discovery and allocation is a serious issue. Before they run their applications, grid users need to choose grid nodes based on available CPUs performance. Hence a tool is needed for measuring CPUs performance. To address this need, GcpSensor (Grid CPU performance Sensor) was developed. GcpSensor runs a typical benchmark program in every grid node to measure CPU performance and returns a metric named WMFLOPS which can be used to compare different CPUs performance directly. An algorithm, which can choose a moderate computation cost dynamically, is designed to ensure that every test is comprehensive and the added overhead is comparatively small. Our experiments have proved that GcpSensor can indicate the CPU performance sensitively and that users can use the GcpSensor data to compare different CPUs performance straightforward, thus the accuracy and efficiency for selecting computing resources are increased.
Electron mobility in multi-FinFET with a (111) channel surface fabricated by orientation-dependent wet etching
Authors: Y. X. Liu, E. Sugimata, M. Masahara, K. Endo, K. Ishii, T. Matsukawa, H. Takashima, H. Yamauchi, E. Suzuki
Venue: Microelectronic Engineering (2005)

This paper presents, for the first time, the experimental electron mobility in FinFETs with a (111) channel surface fabricated by the orientation-dependent wet etching. The maximum electron mobility (ueff) is around 300-cm2/V-s, which is close to that in the (111) bulk MOSFETs. Moreover, the value of ueff is comparable or better than the reported ones in the usual FinFETs with a (110) channel surface prepared with careful surface treatments. This result indicates that the quality and channel surface roughness of the Si-fins by the orientation-dependent wet etching are much better than those fabricated by the conventional reactive ion etching (RIE) process.
Password-authenticated 3PEKE with Round Efficiency without Server's Public Key
Authors: Ya-Fen Chang, Chin-Chen Chang
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

People only can remember simple or meaningful passwords. In three-party key exchange protocols with password authentication, a client is allowed to share an easy-to-remember password with a trusted server so that two users can negotiate a session key for secure communication. Steiner et al. proposed a three-party protocol based on the encrypted key exchange protocols in 1995; but, their protocol suffered from off-line and undetectable on-line password guessing attacks. In 2000, Lin et al. proposed a secure threeparty protocol with server's public key. Since a certificate is needed, this protocol is not practical for some environments. In 2001, Lin et al. proposed a new three-party protocol without server's public key with two more rounds. Later, Lin et al. proposed an improvement. We propose a secure three-party EKE protocol with only five rounds in this paper.
Lights and Camera: Intelligently Controlled Multi-channel Pose Estimation System
Authors: Olena Borzenko, Wei Xu, Mark Obsniuk, Arjun Chopra, Piotr Jasiobedzki, Michael Jenkin, Yves Lesperance
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

Guiding the spacecraft docking process requires the use of sensors that estimate the relative position of the two vessels. This task is complicated by the widely variable on-orbit illumination. To combat this, controllable docking cameras are augmented by computer-controlled illuminants. But how should these illumination and capture parameters be controlled and how should the images obtained under different conditions be combined in order to estimate the relative pose of the vessels? We address these issues in the "Lights and Camera" system. Images captured with the same camera and scene geometry but under different lighting conditions are merged, and the resulting edges are used to estimate the target's pose. A high level controller monitors the imaging process and determines the set of images to capture and use for pose estimation. This paper describes the "Lights and Camera" system architecture and initial results of its operation on mockups of space hardware.
Use of domain information to improve the performance of an evolutionary algorithm
Authors: Ricardo Landa Becerra, Carlos A. Coello Coello
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

The main goal of this thesis work is to explore the capacities of cultural algorithms to add domain knowledge in evolutionary computation. Within our objectives is to develop a cultural algorithm for constrained optimization, and other for multiobjective optimization. With a proper desing of the belief space we expect to obtain competitive results compared with other state-of-the-art evolutionary algorithms, but reducing the number of fitness function evaluations needed. In this paper we focus in the algorithm for constrained optimization, because the development of the algorithm for multiobjective optimzation is an early stage.