ppxscal/embedding_network huggingface dataset:
A performance evaluation of a novel energy-aware data-centric routing algorithm in wireless sensor networks
Authors: Azzedine Boukerche, Xuzhen Cheng, Joseph Linus
Venue: Wireless Networks (2005)

In this paper, we present a novel Energy-Aware Data-Centric Routing algorithm for wireless sensor networks, which we refer to as EAD. We discuss the algorithm and its implementation, and report on the performance results of several workloads using the network simulator ns-2. EAD represents an efficient energy-aware distributed protocol to build a rooted broadcast tree with many leaves, and facilitate the data-centric routing in wireless micro sensor networks. The idea is to turn off the radios of all leaf nodes and let the non-leaf nodes be in charge of data aggregation and relaying tasks. The main contribution of this protocol is the introduction of a novel approach based on a low cost backbone provisioning within a wireless sensor network in order to turn off the non backbone nodes and save energy without compromising the connectivity of the network, and thereby extending the network lifetime. EAD makes no assumption on the network topology, and it is based on a residual power. We present an extensive simulation experiments to evaluate the performance of our EAD forwarding-to-parent routing scheme over a tree created by a single EAD execution, and compare it with the routing scheme over a regular Ad hoc On-Demand Distance Vector (AODV) Protocol. Last but not least, we evaluate the performance of our proposed EAD algorithm and compare it to the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, a cluster-based, energy-aware routing protocol specifically designed for sensor networks. Our results indicate clearly that EAD outperforms AODV and LEACH in energy conservation, throughput, and network lifetime extension.
Toward Exception-Handling Best Practices and Patterns
Authors: Rebecca J. Wirfs-Brock
Venue: IEEE Software (2006)

Agreeing on a reasonable exception-handling style for your application and following a consistent set of exception-handling practices is crucial to implementing software that's easy to work with, comprehend, evolve, and refactor. Demystifying exception-handling design requires writing about proven techniques, guidelines, and patterns.
Towards Green Grids: A Biologically-Inspired Adaptive Architecture for Power Efficient Server Farms
Authors: Paskorn Champrasert, Junichi Suzuki
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

This paper describes a biologically-inspired network architecture, called SymbioticSphere, which allows server farms to autonomously adapt to dynamic environmental changes and achieve power efficiency. SymbioticSphere follows certain biological principles such as decentralization, natural selection, emergence and symbiosis to design server farms (application services and middleware platforms). Each application service and middleware platform is modeled as a biological entity, analogous to an individual bee in a bee colony. Simulation results show that, like in biological systems, desirable system properties (e.g., adaptability and power efficiency) emerge from collective actions and interactions of application services and platforms.
Emotion-based norm enforcement and maintenance in multi-agent systems: foundations and petri net modeling
Authors: Julia Fix, Christian von Scheve, Daniel Moldt
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

A review of recent theories of emotion indicates close interconnections between emotion and social norms in human societies. We consider the possibility of implementing these mutual influences in a multi-agent system in order to establish dynamic and flexible control structures. According to some theories, emotion plays a key role in establishing and maintaining these structures by fostering the internalization of and compliance with social norms. Here we introduce a Petri Net based approach to modeling the emergence and maintenance of social norms in multi-agent systems.
End-to-End Differentiation of Congestion and Wireless Losses using a Fuzzy Arithmetic based on Relative Entropy
Authors: Yong Li, Fang Su, Yinglei Fan, Huimin Xu
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

This paper, according to the traditional transfer control protocol(TCP)exposures the performance decline in the wireless environment.. presents a formulation for aggregating opinions about the alternatives into a single consensus or compromise one. The approach which is used to derive the aggregation formula is minimum relative entropy inference. Based on the relative entropy, we introduce an end-to-end arithmetic. The main idea of our arithmetic is to regard the average packet loss ratio and RFD as two decision makers. Those two decision makers give opinions to the network status separately; utilize the principle of relative entropy to infer the best choice of the network status. Therefore, we can differentiate the character of losses using decision-making. Our simulation measurements suggest that this arithmetic can work well in differentiating losses and throughputs.
Application of rare event techniques to trace driven simulation
Authors: Poul E. Heegaard, Bjarne E. Helvik, Ragnar Ø. Andreassen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper describes a trace driven, fast simulation approach applicable to deal with the performance evaluation of a multiplex of heterogeneous traffic streams with variable bit rate and long lived serial correlation offered routers in the Internet. A challenge with simulations of the Internet is the huge number of events that are needed for each event of interest, e.g. the loss or excessive delay of a packet. The simulation efficiency of the trace driven approach in this paper is improved by use of importance sampling to provoke constellation of traces where the loss and long delays are more likely. The approach is successfully applied to speedup the simulation of multiplexing of heterogeneous MPEG encoded video streams.
A polymorphic type system and compilation scheme for record concatenation
Authors: Benjamin F. Goldberg
Venue:  (2006)

The notion of records, which are used to organize closely related groups of data so the group can be treated as a unit, and also provide access to the data within by name, is almost universally supported in programming languages. However, in virtually all cases, the operations permitted on records in statically typed languages are extremely limited. Providing greater flexibility in dealing with records, while simultaneously retaining the benefits of static type checking is a desirable goal. This problem has generated considerable interest, and a number of type systems dealing with records have appeared in the literature. In this work, we present the first polymorphic type system that is expressive enough to type a number of complex operations on records, including three forms of concatenation and natural join. In addition, the precise types of the records involved are inferred, to eliminate the burden of explicit type declarations. Another aspect of this problem is an efficient implementation of records and their associated operations. We also present a compilation method which accomplishes this goal.
Simulation shows savings with RFID implementation
Authors: Carley Jurishica, Robert Schwieters
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This presentation will focus on how simulation was used in supporting the business case for RFID. Recently, a pilot study at several Allen-Bradley facilities evaluated RFID (radio frequency identification) use in the production and distribution of circuit boards. The pilot consisted of RFID tag application to three different products manufactured in the Allen-Bradley Twinsburg Ohio facility. The attached RFID tags were read upon arrival to the Champaign Distribution Center (CDC). While the tag read percentages and other system variables could be explicitly measured, the impact of a large-scale RFID implementation remained unclear. In order to provide answers to the "what if ..." questions proposed by the pilot project team, a simulation study of the RFID facility was launched. The study assisted in defining the impact on the labor savings and helped analyze the potential return on investment (ROI).
Computer-Based Aerial Port Simulation (CAPS): Designing an Experimental Platform for Examining Team-Based Logistics Collaboration
Authors: Jason Seyba, Joseph Lyons, David Ames
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Understanding of distributed logistics teams is invaluable to influencing the design of systems that will be used throughout the enterprise. Logistics research and development hinges on identifying the relevant variable through laboratory simulations. This paper discusses a specific laboratory task useful for examining psychological factors relevant to effective logistics collaboration in terms of both design and implementation.
Discrete-Time Risk Measures on General Probability Space
Authors: An Shi, Sun Jian, Wang Yan
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

A class of discrete-time risk measures on general probability space is established. According to the properties of general probability space, we propose the conception of acceptance set and capital requirement in the static framework. Then we mainly focus on the properties of dynamic risk measures. The properties of risk measures in the static framework are introduced into the dynamic framework. In particular, three axioms about dynamic risk measures have been presented in the third section. We propose strong, middle and poor consistency properties to improve the mathematical description of dynamic risk measures on general probability space. Finally, an example for TVaR solution based on binary tree of is provided.
Efficient simulation-based discrete optimization
Authors: Seth D. Guikema, Rachel A. Davidson, Zehra Çağnan
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In many practical applications of simulation it is desirable to optimize the levels of integer or binary variables that are inputs for the simulation model. In these cases, the objective function must often be estimated through an expensive simulation process, and the optimization problem is NP-hard, leading to a computationally difficult problem. We investigate efficient solution methods for this problem, and we propose an approach that reduces the number of runs of the simulation by using ridge regression to approximate some of the simulation calls. This approach is shown to significantly decrease the computational cost but at a cost of slightly worse solution values.
Identities and astronomy camp: how individual campers make meaning of science experiences
Authors: Deborah A. Fields
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This study uses the concept of affinity space to analyze youth participation in a summer science camp, examining how students took on virtual identities as astronomers, merged them with their real identities, and, to varying degrees, adopted projective identities of themselves as scientists. Analyzing camper interviews, I investigate the degree to which Astronomy Camp is an affinity space and present individual cases of ways campers make meaning of their research experiences by creating different identities.
QuRiNet: quail ridge natural reserve wireless mesh network
Authors: Daniel Wu, Dhruv Gupta, Stephanie Liese, Prasant Mohapatra
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

This extended abstract describes our experiences in the deployment of QuRiNet, a wireless mesh network at the Quail Ridge Natural Reserve. Quail Ridge boasts 2,000 acres of untouched wilderness on a peninsula of Lake Berryessa, California. In deploying a mesh network at Quail Ridge, we seek to assist ecological research in the area by providing a communications infrastructure and also provide a platform for wireless mesh networks research. The network currently comprises of about six nodes and supports three video cameras and a few audio sensors. We plan to deploy five more nodes in the near future, with about twenty nodes being the final goal. This abstract will describe our work in deploying this network and give the reader an overview of our current system and deployment status.
Video Annotation by Active Learning and Cluster Tuning
Authors: Guo-Jun QI, Yan SONG, Xian-Sheng HUA, Hong-Jiang ZHANG, Li-Rong DAI
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Supervised and semi-supervised learning are frequently applied methods to annotate videos by map..ing low-level features into high-level semantic concepts. Though they work well for certain concepts, the performance is still far from reality due to the large gap between the features and the semantics. The main constraint of these methods is that the information contained in a limited number of labeled training samples can hardly represent the distributions of the semantic concepts. In this paper, we propose a novel semi-automatic video annotation framework, active learning with clustering tuning, to tackle the disadvantages of current video annotation solutions. In this framework, firstly an initial training set is constructed based on clustering the entire video dataset. And then a SVM-based active learning scheme is proposed, which aims at maximizing the margin of the SVM classifier by manually selectively labeling a small set of samples. Moreover, in each round of active learning, we tune/refine the clustering results based on the prediction results of current stage, which is beneficial for selecting the most informative samples in the active learning process, as well as helps further improve the final annotation accuracy in the post-processing step. Experimental results show that the proposed scheme performs superior to typical active learning algorithms in terms of both annotation accuracy and stability.
Energy aware self-organizing density management in wireless sensor networks
Authors: Erwan Le Merrer, Vincent Gramoli, Anne-Marie Kermarrec, Aline C. Viana, Marin Bertier
Venue: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking (2006)

Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy consumption of a single sensor node but also the extension of the entire network lifetime. We propose a simple and adaptive energy-conserving topology management scheme, called SAND (Self-Organizing Active Node Density). SAND is fully decentralized and relies on a distributed probing approach and on the redundancy resolution of sensors for energy optimizations, while preserving the data forwarding and sensing capabilities of the network. We present the SAND's algorithm, its analysis of convergence, and simulation results. Simulation results show that, though slightly increasing path lengths from sensor to sink nodes, the proposed scheme improves significantly the network lifetime for different neighborhood densities degrees, while preserving both sensing and routing fidelity.
Mac Address Assignment In Wireless Sensor Networks: A Mixed Strategy Game Approach
Authors: Kun Tu, Kun Bi, Naijie Gu, Wan Li Dong, Xiaohu Liu
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In this paper, we address the problem of MAC address assignment in wireless sensor networks. A novel scheme for MAC address assignment is proposed to reduce the overhead. We model the problem from the game theoretical view, prove there exists a mixed strategy Nash equilibrium in the model, and propose a distributed address assign algorithm to achieve the equilibrium, which takes the advantage of the exploitation of spatial address reuse to save energy. Simulation results demonstrate that our algorithm is efficient even for very largescale networks, which makes it a potential candidate for practical applications.
Database Transaction Management for High-Availability Cluster System
Authors: Ken-ichiro FUJIYAMA, Nobutatsu NAKAMURA, Ryuichi HIRAIKE
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

We propose a database transaction management framework that enables a database replication function to be added to existing cluster systems. This framework is generally applicable to various database products merely by replacing the database connection API library. In this framework, the enhanced database connection API library duplicates the transactions issued by clustered applications and issues them to the primary and backup databases while controlling the issue order for consistency between the two databases. We implemented the proposed framework on a database connection API library for Java and confirmed that the overhead caused by duplication and order control was smaller than the existing replication method's overhead.
Seamless Network Management in Presence of Heterogeneous Management Protocols for Next Generation Networks
Authors: Bhagi Sri Karthik, Manish Jaiswal, Vasant Menon, Vidhya Kannan, Shobha Venkobarao, Madan Pande, Asoke Talukder, Debabrata Das
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Addition of different service requirements by users and advent of new access networks have increased the complexity to manage these networks uniformly. However, there are many management protocols available today like SNMP, JMX, WBEM, etc, which are being used to manage networks. Because of complexity and heterogeneity of these management protocols it has become very difficult for a network manager to manage different network elements (NE) since these may be instrumented using different such protocols. One critical example of such a complex network is IP Multimedia Subsystem (IMS). 3GPP does not specify the management protocol to be used to manage network elements in IMS. In this paper, the authors have proposed a novel network management solution, which can be used to manage IMS components independent of heterogeneous management protocols like WBEM, SNMP, JMX etc. Moreover, authors have developed a prototype resource adapter to test the suitability of the protocol.
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games
Authors: Michal Koucky, Clemens Lautemann, Sebastian Poloczek, Denis Therien
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable byAC0 circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for general AC^0 circuits.
Novel Approach for Reengineering Relational Databases into XML
Authors: Chunyan Wang, Anthony Lo, Reda Alhajj, Ken Barker
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In this paper, we present COCALEREX (converting relational to XML) which can address both catalog-based and legacy relational databases. It handles the latter category by first applying the reverse engineering approach described in [2] to extract the ER (Extended Entity Relationship) model from legacy relational databases. This reverse engineering approach is emplyed also not to extract from catalog-based databases meta-data not available in the catalog. Then, COCALEREX converts the ER to XML schema. Deriving the ER model empowers the proposed approach to smoothly consider many-to-many and nary relationships during the mapping into XML schema.COCALEREX provides a user-friendly interface that displays the result of each phase of the conversion process. Experimental results are encouraging, demonstrating the applicability and effectiveness of the proposed approach.
The advise learning architecture: specialized authoring tools for educational software
Authors: Michael Korcuska
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

The current methodology for building computer-based tutoring systems requires that designers assemble these systems from either basic component modules or completely from scratch. This is true of most commercially available authoring tools (e.g., Authorware, SuperCard, HyperCard, Director, etc.) and even many more experimental systems developed in research labs. The "build it from the ground up" methodology implicit in these tools does makes sense from the perspective of creating a tool that can build a wide variety of tutoring systems. However, this methodology also suffers from several serious problems that affect the cost, quality, and reusability of computer-based tutoring systems. This paper briefly describe these problems and presents an alternative methodology for creating authoring tools for computer-based tutoring systems.
A Universal Full Text Index with Access Control and Annotation Driven Information Retrieval
Authors: Edgar Chavez, Eric Sadit Tellez
Venue: Proceedings of the 15th International Conference on Computing (2006)

Full text databases are tightly linked to the application layer. Currently IR projects must be integrated in the back-end using, at best, a general-purpose language-independent API. This architecture limits and precludes the rapid prototyping. In this paper we present a new approach, a very simple architecture, towards the development of a general purpose full-text database. We implemented a standard inverted file index, providing various extra capabilities. For each document stored we simply added a set of qualifiers, MD5 hashes and keywords, algorithmically unrelated to the document content. This allows to hierarchically control access to the document, iteratively improve document categorization, add and delete annotations, and document versions. All transactions are done through a standard web service interface. This feature facilitates system integration, and testing. We describe a set of applications where our concept can be useful. The universe of applications for our concept encompass those areas where document annotations are relevant. Once stored and annotated (with qualifiers), the documents can be retrieved by a combination of qualifiers and document content. Additionally, we show our prototype in action, explaining how can be extended to support retrieval and storage models appeared in some popular sites recently.