ppxscal/embedding_network huggingface dataset:
QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming
Authors: Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue
Venue: IEEE Transactions on Computers (2006)

Given a directed network with two integer weights, cost and delay, associated with each link, Quality-of-Service (QoS) routing requires the determination of a minimum cost path from one node to another node such that the delay of the path is bounded by a specified integer value. This problem, also known as the Constrained Shortest Path problem (CSP), admits an Integer Linear Programming (ILP) formulation. Due to the integrality constraints, the problem is NP-hard. So, approximation algorithms have been presented in the literature. Among these, the LARAC algorithm, based on the dual of the LP relaxation of the CSP problem, is very efficient. In contrast to most of the currently available approaches, we study this problem from a primal perspective. Several issues relating to efficient implementations of our approach are discussed. We present two algorithms of pseudopolynomial time complexity. One of these allows degenerate pivots and uses an anticycling strategy and the other, called the NBS algorithm, is based on a novel strategy which avoids degenerate pivots. Experimental results comparing the NBS algorithm, the LARAC algorithm, and general purpose LP solvers are presented. In all cases, the NBS algorithm compares favorably with others and beats them on dense networks.
Sharing event data in optimistically scheduled multicast applications
Authors: Garrett Yaun, David Bauer, Christopher D. Carothers
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A major consideration when designing high performance simulation models is state size. Keeping the model state sizes small enhances performance by using less memory, thereby increasing cache utilization and reducing model execution time. The only remaining area for reducing model size is within the events they create. The event population is typically the most memory intensive region within a simulation especially in the case of multi/broadcast like applications which tend to schedule many events within the atomic processing of a single event. This paper introduces the idea of shared event data within an optimistic simulation system. Here, the read-only data section is shared for a multicast event, which may then be delivered to several LPs. From our performance study, we report a 22% reduction in the data cache miss rate, a processor utilization in excess of 80% and a reduction in model memory consumption by a factor of 20.
Scalarization of the fuzzy optimization problems
Authors: Hsien-Chung Wu
Venue: Fuzzy Optimization and Decision Making (2006)

Scalarization of the fuzzy optimization problems using the embedding theorem and the concept of convex cone (ordering cone) is proposed in this paper. Two solution concepts are proposed by considering two convex cones. The set of all fuzzy numbers can be embedded into a normed space. This motivation naturally inspires us to invoke the scalarization techniques in vector optimization problems to solve the fuzzy optimization problems. By applying scalarization to the optimization problem with fuzzy coefficients, we obtain its corresponding scalar optimization problem. Finally, we show that the optimal solution of its corresponding scalar optimization problem is the optimal solution of the original fuzzy optimization problem.
An Effective Cooperative Cache Replacement Policy for Mobile P2P Environments
Authors: Jin-Woo Song, Kyo-Sung Park, Sung-Bong Yang
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Recent researches in cooperative caching systems combined with P2P (peer-to-peer) web caching for mobile environments have been made quite actively owing to the advances in mobile technology. The hybrid cooperative caching technology in mobile environments enables P2P systems to achieve improved caching performance by utilizing the caches in neighbor peers. However, there is an important limitation of mobile caching system that the cache space of a mobile device is generally restricted. In this paper, we propose an effective cooperative cache replacement policy for mobile P2P environments that exploiting the sizes of objects in a system. The proposed replacement policy stores smaller objects in the local cache of each peer and stores larger objects in the local cache of its "idle" neighbor peer who has the least activity among its peers. The activity of a peer is determined by the request frequency and the latest request time. We compared the proposed replacement policy with the existing replacement policies for various mobile environments. The experiment results show that the proposed replacement policy achieves better performance than the existing replacement policies in terms of the hit ratio and the byte hit ratio. Especially when the cache size is reasonably small, the proposed replacement policy shows outstanding performance.
Computation hierarchy for in-network processing
Authors: Vlasios Tsiatsis, Ram Kumar, Mani B. Srivastava
Venue: Mobile Networks and Applications (2005)

In this paper we explore the network level architecture of distributed sensor systems that perform in-network processing. We propose a system with heterogeneous nodes that organizes into a hierarchical structure dictated by the computational capabilities. The presence of high-performance nodes amongst a sea of resource-constrained nodes exposes new tradeoffs for the efficient implementation of network-wide applications. Our experiments show that even for a low relative density of resource-constrained nodes to high-performance nodes there are certain gains in performance for a heterogeneous and hierarchical network over a homogeneous one. The introduction of hierarchy enables partitioning of the application into sub-tasks that can be mapped onto the heterogeneous nodes in the network in multiple ways. We analyze the tradeoffs between the execution time of the application, accuracy of the output produced and the overall energy consumption of the network for the different mapping of the sub-tasks onto the heterogeneous nodes. We evaluate the performance and energy consumption of a typical sensor network application of target tracking via beamforming and line of bearing (LOB) calculations on the different nodes. Our experiments also include the study of the overall performance and energy consumption of the LOB calculation using two different types of resource constrained sensor nodes (MICA and MICA2 nodes) and show how these metrics are affected by changes in the node architecture and operation. Our results indicate that when using MICA motes as resource-constrained nodes, 85% of the time on average the hierarchical network outperforms a homogeneous network for approximately the same energy budget. When using MICA2 motes as resource-constrained nodes, 54% of the time the hierarchical network performs better than a homogeneous network with approximately the same energy budget.
Multilabel Neural Networks with Applications to Functional Genomics and Text Categorization
Authors: Min-Ling Zhang Zhi-Hua Zhou
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

In multilabel learning, each instance in the training set is associated with a set of labels and the task is to output a label set whose size is unknown a priori for each unseen instance. In this paper, this problem is addressed in the way that a neural network algorithm named BP-MLL, i.e., Backpropagation for Multilabel Learning, is proposed. It is derived from the popular Backpropogation algorithm through employing a novel error function capturing the characteristics of multilabel learning, i.e., the labels belonging to an instance should be ranked higher than those not belonging to that instance. Applications to two real-world multilabel learning problems, i.e., functional genomics and text categorization, show that the performance of BP-MLL is superior to that of some well-established multilabel learning algorithms.
News Briefs
Authors: Linda Dailey Paulson
Venue: Computer (2006)

Topics covered include using chaotic lasers to encrypt data, a DNA computer that is a tic-tac-toe champ, a musical robot, and Nokia's new wireless approach.
Composite subset measures
Authors: Lei Chen, Raghu Ramakrishnan, Paul Barford, Bee-Chung Chen, Vinod Yegneswaran
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Measures are numeric summaries of a collection of data records produced by applying aggregation functions. Summarizing a collection of subsets of a large dataset, by computing a measure for each subset in the (typically, user-specified) collection is a fundamental problem. The multidimensional data model, which treats records as points in a space defined by dimension attributes, offers a natural space of data subsets to be considered as summarization candidates, and traditional SQL and OLAP constructs, such as GROUP BY and CUBE, allow us to compute measures for subsets drawn from this space. However, GROUP BY only allows us to summarize a limited collection of subsets, and CUBE summarizes all subsets in this space. Further, they restrict the measure used to summarize a data subset to be a one-step aggregation, using functions such as SUM, of field-values in the data records.In this paper, we introduce composite subset measures, computed by aggregating not only data records but also the measures of other related subsets. We allow summarization of naturally related regions in the multidimensional space, offering more flexibility than either GROUP BY or CUBE in the choice of what data subsets to summarize. Thus, our framework allows more meaningful summaries to be computed for a targeted collection of data subsets.We propose an algebra called AW-RA and an equivalent pictorial language called aggregation workflows. Aggregation workflows allow for intuitive expression of composite measure queries, and the underlying algebra is designed to facilitate efficient multiscan execution. We describe an evaluation framework based on multiple passes of sorting and scanning over the original dataset. In each pass, several measures are evaluated simultaneously, and dependencies between these measures and containment relationships between the underlying subsets of data are orchestrated to reduce the memory footprint of the computation. We present a performance evaluation that demonstrates the benefits of our approach.
Reliable, Secure, and Transacted Web Service Compositions with AO4BPEL
Authors: Anis Charfi, Benjamin Schmeling, Andreas Heizenreder, Mira Mezini
Venue: Proceedings of the European Conference on Web Services (2006)

Web Service Compositions in BPEL have several nonfunctional requirements such as security, reliable messaging, and transactions. Although many WS-* specifications address such non-functional concerns in the Web Service context, they focus only on the messaging-level requirements without addressing the process-level requirements. In this paper, we discuss different non-functional requirements in BPEL workflows and observe that current orchestration engines lack support for the specification and enforcement of such requirements, especially for process-level requirements. To solve this problem, we present a container framework, which introduces an XML-based deployment descriptor to specify the non-functional requirements in a declarative way. To enforce these requirements, a process container intercepts the process execution and calls dedicated middlewareWeb Services. We implemented the process container as a lightweight container using a set of AO4BPEL aspects that are automatically generated from the deployment descriptor. In addition, we have implemented BPEL middleware Web Services for reliable messaging, security, and transaction.
Argus invasive species spread model constructed using agent-based modeling approach and cellular automata
Authors: S. Clifton Parks, Maxim Garifullin, Rainer Dronzek
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The stochastic Argus Invasive Species Spread Model (AISSM) is constructed using an Agent-Based Modeling (ABM) approach with cellular automata (CA) to account for spatial relationships and changes in those relationships over time. The model was constructed to support a wide range of geographical locations; however, this paper focuses on its application in the state of California. A time-series of daily historical weather observations on a 6-kilometer grid was obtained for six weather variables important to insect and disease development. Weather conditions were then simulated using the K- nearest neighbor (K-nn) regional weather generator. The weather simulations were summarized into a monthly time-step and coupled with satellite land cover imagery to identify a habitat quality for each simulated month. This information was combined with the introduction of invasive species in the AnyLogic&trade; modeling environment. The spread of invasive species is driven by the habitat quality layer, which regulates its dispersal rate.
Multisensory Interaction in Saccadic Reaction Time: A Time-Window-of-Integration Model
Authors: Hans Colonius
Venue: Journal of Cognitive Neuroscience (2004)

Saccadic reaction time to visual targets tends to be faster when stimuli from another modality (in particular, audition and touch) are presented in close temporal or spatial proximity even when subjects are instructed to ignore the accessory input (focused attention task). Multisensory interaction effects measured in neural structures involved in saccade generation (in particular, the superior colliculus) have demonstrated a similar spatio-temporal dependence. Neural network models of multisensory spatial integration have been shown to generate convergence of the visual, auditory, and tactile reference frames and the sensorimotor coordinate transformations necessary for coordinated head and eye movements. However, because these models do not capture the temporal coincidences critical for multisensory integration to occur, they cannot easily predict multisensory effects observed in behavioral data such as saccadic reaction times. This article proposes a quantitative stochastic framework, the time-window-of-integration model, to account for the temporal rules of multisensory integration. Saccadic responses collected from a visual&ndash;tactile focused attention task are shown to be consistent with the time-window-of-integration model predictions.
Efficient, Energy Conserving Transaction Processing in Wireless Data Broadcast
Authors: SangKeun Lee Chong-Sun Hwang Masaru Kitsuregawa
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Broadcasting in wireless mobile computing environments is an effective technique to disseminate information to a massive number of clients equipped with powerful, battery operated devices. To conserve the usage of energy, which is a scarce resource, the information to be broadcast must be organized so that the client can selectively tune in at the desired portion of the broadcast. In this paper, the efficient, energy conserving transaction processing in mobile broadcast environments is examined with widely accepted approaches to indexed data organizations suited for a single item retrieval. The basic idea is to share the index information on multiple data items based on the predeclaration technique. The analytical and simulation studies have been performed to evaluate the effectiveness of our methodology, showing that predeclaration-based transaction processing with selective tuning ability can provide a significant performance improvement of battery life, while retaining a low access time. Tolerance to access failures during transaction processing is also described.
UAV airspace management system UAMS
Authors: Regis Vincent, Osher Yagdar, Andrew Agno
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

As technology advances, unmanned aerial vehicles (UAVs) are capable of more complex missions. Miniaturization results in a migration of capability from larger to smaller UAV platforms and in cost reduction. According to the DoDs Unmanned Aircraft Systems Roadmap 2005-2030, military UAVs are now required to execute intelligence, surveillance, reconnaissance, strike, suppression of enemy air defense, electronic attack, communications, aerial delivery, and resupply missions. It is therefore evident that UAV developments require a more intelligent and autonomous airspace and mission management approach then ever.
Teaming discrete-event simulation and geographic information systems to solve a temporal/spatial business problem
Authors: Richard G. Born
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Although discrete-event simulation has pedagogically been rooted in computer science, and the practicality of geographic information systems in geography, the combined use of both in the business world allows solving some very challenging temporal/spatial (time and space dependent) business problems. The discrete-event simulation language WebGPSS, an ideal simulation environment for the business person, is teamed with Microsoft MapPoint, a GIS (geographic information system) designed to bring powerful mapping and analysis techniques to corporate office desktops. The result is the ability to solve innovative business strategy problems before implementing them in the real world. This paper focuses on one such problem by using WebGPSS to drive a simulation that provides geographic data for display by MapPoint, and ultimately map animations showing spatial and temporal business changes.
Explanation-Oriented Design
Authors: Andrew Raybould
Venue: IEEE Software (2006)

The understanding of a software design should not be left as an exercise for its reader.
Query optimization over web services
Authors: Utkarsh Srivastava, Kamesh Munagala, Jennifer Widom, Rajeev Motwani
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Web services are becoming a standard method of sharing data and functionality among loosely-coupled systems. We propose a general-purpose Web Service Management System (WSMS) that enables querying multiple web services in a transparent and integrated fashion. This paper tackles a first basic WSMS problem: query optimization for Select-Project-Join queries spanning multiple web services. Our main result is an algorithm for arranging a query's web service calls into a pipelined execution plan that optimally exploits parallelism among web services to minimize the query's total running time. Surprisingly, the optimal plan can be found in polynomial time even in the presence of arbitrary precedence constraints among web services, in contrast to traditional query optimization where the analogous problem is NP-hard. We also give an algorithm for determining the optimal granularity of data "chunks" to be used for each web service call. Experiments with an initial prototype indicate that our algorithms can lead to significant performance improvement over more straightforward techniques.
Empirical evaluation of capacity estimation tools
Authors: C. D. Murta, M. E. Augusto
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

Bandwidth estimation is an important task because the knowledge of the bandwidth of a path is useful in a wide variety of contexts. Clients, applications and servers benefit greatly from knowing the bandwidth of a route. In this paper we describe and discuss experiments carried out to provide bandwidth estimates using five tools: bprobe, clink, nettimer pathrate, and pchar The tools are evaluated and compared according to the criteria accuracy, statistical robustness and time to estimation. We show several results for short and long network paths. The topologies tested include links which capacities range from 2 Mb/s to 1 Gb/s.
Colour Spectrum's of Opinion: An Information Visualisation Interface for Representing Degrees of Emotion in Real Time
Authors: James Ohene-Djan, Andrew Sammon, Rachel Shipsey
Venue: Proceedings of the conference on Information Visualization (2006)

In this paper we present an information visualisation interface that enables a user to input a real-time continuous flow of their predominant emotion incorporating degrees of uncertainty relative to other choices. The novel equilateral triangle-based interface allows users to express opinions on temporal media presentations such as television advertisements, video and musical compositions. The continuous flow of information generated by the interface is mapped into a colour spectrum which reveals a user's developing opinion of the presentation. Such a colour spectrum not only provides a visual snapshot to enhance statistical interpretations of user input but also provides valuable insight into when, how and with what degree of certainty opinions were developed and changed over time. The Real-Time Emotional Spectrum Tool (REST) is being developed to answer a need in the commercial research market. It is intended for use in gathering opinions from online audiences.
A handheld mirror simulation
Authors: A. R. J. Francois, E.-Y. E. Kang
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

We present the design and construction of a handheld mirror simulation device. The perception of the world reflected through a mirror depends on the viewer's position with respect to the mirror and the 3-D geometry of the world. In order to simulate a real mirror on a computer screen, images of the observed world, consistent with the viewer's position, must be synthesized and displayed in real- time. Our system is build around a LCD screen manipulated by the user, a single camera fixed on the screen, and a tracking device. The continuous input video stream and tracker data is used to synthesize, in real-time, a continuous video stream displayed on the LCD screen. The synthesized video stream is a close approximation of what the user would see on the screen surface if it were a real mirror. Our system provides a generic interface for applications involving rich, first-person interaction, such as the virtual daguerreotype.
A simplified hand gesture interface for spherical manipulation in virtual environments
Authors: Jong Seo Lee, Seung Eun Lee, Sun Yean Jang, Kyoung Shin Park
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper presents the design and application of a simplified gesture interface for spherical user interaction in the virtual environment. The interface is implemented using a tilt, a electric compass, and three flex sensors. It measures eight directional hand movements and four finger gestures. Using this interface, a user can perform spherical manipulation such as rotating a sphere full of thumbnail images, pointing and selecting a thumbnail image, and releasing to put it back on the sphere.
Examining the feasibility of constructing simulation models using the web-based 'Grab-and-Glue' framework
Authors: Tillal Eldabi, Man Wai Lee, Ray J. Paul
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The Grab and Glue discrete event simulation (Grab-and-Glue) framework has been proposed for several years. This paper investigates the feasibility of this framework. A simulation model of a single server queuing system is constructed by following the Grab-and-Glue framework as a ubiquitous example. Different scissions are grabbed from the Web or programming textbooks, and glued together using JBuilder5. The potential of Grab-and-Glue is discussed as well as the current challenges of constructing Grab-and-Glue simulation models. Some critiques and recommendations for the ongoing research on constructing simulation models based on the Grab-and-Glue framework have also been proposed.