ppxscal/embedding_network huggingface dataset:
Comparing Passive Network Monitoring of Grid Application Traffic with Active Probes
Authors: Marcia Zangrilli, Bruce B. Lowekamp
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

Distributed applications require timely network measurementsso that they can adapt to changing network conditionsand make efficient use of grid resources. One of thekey issues in obtaining network measurements is the intrusivenessof the measurements themselves-how much networkperformance is "wasted" taking the measurements?Our goal is to combine active and passive monitoring techniquesto reduce the need for intrusive measurements withoutsacrificing the accuracy of the measurements. We aredeveloping a bandwidth monitoring tool as part of the Wrennetwork measurement system that will reduce the burden onthe network by passively obtaining measurements from existingapplication traffic whenever possible, instead of activelyprobing the network. By using passive measurementswhen an application is running and active measurementswhen none are running, we can offer accurate, timely availablebandwidth measurements while limiting the invasivenessof active probes. We have completed a prototype ofthe Wren bandwidth monitoring tool and present our preliminaryanalysis of its performance in this paper. We provideresults from passive implementations of several availablebandwidth techniques and demonstrate the close quantitativerelationship between the results of both active andpassive techniques. We have tested our implementation ina cluster, across a campus, and across the Internet usingbulk data transfers as well as an adaptive eigenvalue application.Our results with this diverse set of environmentsand traffic types show promise toward implementing thesetechniques as measurement services in production environments.
Maximizing Battery Life Routing in Wireless Ad Hoc Networks
Authors: Prithviraj (Raj) Dasgupta, Azad Azadmanesh
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Most wireless ad hoc networks consist of mobile devices which operate on batteries. Power consumption in this type of network therefore is paramount important. To maximize the lifetime of an ad hoc network, it is essential to prolong each individual node (mobile) life through minimizing the total transmission energy consumption for each communication request. Therefore, an ef.cient routing protocol must satisfy that the energy consumption rate at each node is evenly distributed and at the same time the total transmission energy for each request is minimized. To devise a routing protocol meeting the above two conflict objectives simultaneously is very dif.cult due to the NP hardness of the problem. Instead, an approximation solution is desirable and appreciated.In this paper we focus on developing power-aware routing algorithms which find routing paths that maximize the lifetime of individual nodes and minimize the total transmission energy consumption, thereby prolong the life of the entire network. In particular, for an ad hoc network consisting of the same type of battery mobile nodes, two approximation algorithms are proposed. The running times of the proposed algorithms are determined by the accuracies of the approximation solutions. Compared with a previously known result, our algorithms have less energy overhead and can be implemented in a distributed environment. For an ad hoc network equipped with different types of battery mobile nodes, a new power-aware routing protocol is proposed, and the algorithm can also be implemented distributively.
Reaching agreement on an unknown network with partial graphic information
Authors: S. C. Wang, K. Q. Yan, C. F. Cheng
Venue: ACM SIGOPS Operating Systems Review (2003)

The Byzantine Agreement (BA) is an important topic in the reliable distributed system because the system can cope with the influences from faulty components when the agreement is achieved. In the literature concerned, the BA problem has been well formulated in a Fully Connected Network (FCN) and a Generalized Connected Network (GCN) under the assumption that each processor in the network has the common knowledge of the graphic information about the entire network structure. However, in the real world, each processor may not have the common knowledge of the graphic information about the entire network structure. That is, the processors may only have the partial knowledge as to their own graphic information. In this paper, the Byzantine Agreement problem will be visited in an Unknown Network (UNet) to increase the capability of fault tolerance by allowing faulty processors with dual failure mode. The proposed protocols, the Unknown Agreement Protocol (UAP) and the Relay Channel (RC), use the minimum number of rounds of message exchange and can tolerate the maximum number of faulty processors allowed.
Potential of amorphous Mo-Si-N films for nanoelectronic applications
Authors: M. Ylönen, H. Kattelus, A. Savin, P. Kivinen, T. Haatainen, J. Ahopelto
Venue: Microelectronic Engineering (2003)

The properties of amorphous metallic molybdenum-silicon-nitrogen (Mo-Si-N) films were characterised for use in nanoelectronic applications. The films were deposited by co-sputtering of molybdenum and silicon targets in a gas mixture of argon and nitrogen. The atomic composition, microstructure and surface roughness were studied by RBS, TEM and AFM analyses, respectively. The electrical properties were investigated in the temperature range 80 mK to 300 K. No transition into a superconductive state was observed. Nanoscale wires were fabricated using electron beam lithography with their properties measured as a function of temperature.
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Authors: Jiawei Han, Jian Pei, Yiwen Yin, Runying Mao
Venue: Data Mining and Knowledge Discovery (2004)

Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist a large number of patterns and/or long patterns.In this study, we propose a novel frequent-pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develop an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth. Efficiency of mining is achieved with three techniques: (1) a large database is compressed into a condensed, smaller data structure, FP-tree which avoids costly, repeated database scans, (2) our FP-tree-based mining adopts a pattern-fragment growth method to avoid the costly generation of a large number of candidate sets, and (3) a partitioning-based, divide-and-conquer method is used to decompose the mining task into a set of smaller tasks for mining confined patterns in conditional databases, which dramatically reduces the search space. Our performance study shows that the FP-growth method is efficient and scalable for mining both long and short frequent patterns, and is about an order of magnitude faster than the Apriori algorithm and also faster than some recently reported new frequent-pattern mining methods.
SQL Tuning
Authors: Dan Tow
Venue:  (2003)

A poorly performing database application not only costs users time, but also has an impact on other applications running on the same computer or the same network. SQL Tuning provides an essential next step for SQL developers and database administrators who want to extend their SQL tuning expertise and get the most from their database applications. There are two basic issues to focus on when tuning SQL: how to find and interpret the execution plan of an SQL statement and how to change SQL to get a specific alternate execution plan. SQL Tuning provides answers to these questions and addresses a third issue that's even more important: how to find the optimal execution plan for the query to use. Author Dan Tow outlines a timesaving method he's developed for finding the optimum execution plan--rapidly and systematically--regardless of the complexity of the SQL or the database platform being used. You'll learn how to understand and control SQL execution plans and how to diagram SQL queries to deduce the best execution plan for a query. Key chapters in the book include exercises to reinforce the concepts you've learned. SQL Tuning concludes by addressing special concerns and unique solutions to "unsolvable problems." Whether you are a programmer who develops SQL-based applications or a database administrator or other who troubleshoots poorly tuned applications, SQL Tuning will arm you with a reliable and deterministic method for tuning your SQL queries to gain optimal performance.
Emotional effects of shooting activities: 'real' versus 'virtual' actions and targets
Authors: Matthias Rauterberg
Venue: Proceedings of the second international conference on Entertainment computing (2003)

The results of an empirical study are presented to investigate the relationship between different action types (real versus virtual shooting) and different target types (real versus virtual targets) on the actual emotional state (well being) of the player. The results show significantly that virtual shooting on real targets in a group (Laser Tag game) enhances the well-being, and on the other side that virtual shooting on virtual targets (Wolfenstein game) diminishes the well-being of an individual player.
Layered coding vs. multiple descriptions for video streaming over multiple paths
Authors: J. Chakareski, S. Han, B. Girod
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper, we examine the performance of specific implementations of multiple description coding and of layered coding for video streaming over error-prone packet switched networks. We compare their performance using different transmission schemes with and without network path diversity. It is shown that given the specific implementations there is a large variation in relative performance between multiple description coding and layered coding depending on the employed transmission scheme. For scenarios where the packet transmission schedules can be optimized in a rate-distortion sense, layered coding provides a better performance. The converse is true for scenarios where the packet schedules are not rate-distortion optimized.
A gate-matrix oriented partitioning approach for multilevel logical networks
Authors: Frank H. Huentemann, Utz G. Baitinger
Venue: Proceedings of the conference on European design automation (1990)

A novel approach for gate-matrix synthesis starting from an EDIF logical network description is presented. The networks are automatically decomposed into gate-matrix 'macrocells' with approximately equal layout area using a very effective algorithm, which is adapted to the layout topology, featuring simultaneous module placement in conjunction with a new reliable module area estimation technique.Dramatic improvements in overall layout generation time and layout area are achieved; area savings are significantly higher than previously reported.
Generalization error bounds for Bayesian mixture algorithms
Authors: Ron Meir, Tong Zhang
Venue: The Journal of Machine Learning Research (2003)

Bayesian approaches to learning and estimation have played a significant role in the Statistics literature over many years. While they are often provably optimal in a frequentist setting, and lead to excellent performance in practical applications, there have not been many precise characterizations of their performance for finite sample sizes under general conditions. In this paper we consider the class of Bayesian mixture algorithms, where an estimator is formed by constructing a data-dependent mixture over some hypothesis space. Similarly to what is observed in practice, our results demonstrate that mixture approaches are particularly robust, and allow for the construction of highly complex estimators, while avoiding undesirable overfitting effects. Our results, while being data-dependent in nature, are insensitive to the underlying model assumptions, and apply whether or not these hold. At a technical level, the approach applies to unbounded functions, constrained only by certain moment conditions. Finally, the bounds derived can be directly applied to non-Bayesian mixture approaches such as Boosting and Bagging.
A Multidimensional Generalization of the Erd&ouml;s&ndash;Szekeres Lemma on Monotone Subsequences
Authors: Tibor Szabó, Gábor Tardos
Venue: Combinatorics, Probability and Computing (2001)

We consider an extension of the Monotone Subsequence lemma of Erd&ouml;s and Szekeres in higher dimensions. Let v1,&hellip;,vn &isin; &Ropf;d be a sequence of real vectors. For a subset I &sube; [n] and vector &srarr;c &isin; {0,1}d we say that I is &srarr;c-free if there are no i < j &isin; I, such that, for every k = 1,&hellip;,d, vik < vik if and only if &srarr;ck = 0. We construct sequences of vectors with the property that the largest &srarr;c-free subset is small for every choice of &srarr;c. In particular, for d = 2 the largest &srarr;c-free subset is O(n&frac58;) for all the four possible &srarr;c. The smallest possible value remains far from being determined.We also consider and resolve a simpler variant of the problem.
Realizability of high-level message sequence charts: closing the gaps
Authors: Markus Lohrey
Venue: Theoretical Computer Science (2003)

We study the notion of safe realizability for high-level message sequence charts (HMSCs) (Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete (Greece), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 797-808). We show that safe realizability is EXPSPACE-complete for bounded HMSCs but undecidable for the class of all HMSCs. This solves two open problems from Alur et al. Moreover we prove that safe realizability is also EXPSPACE-complete for the larger class of globally-cooperative HMSCs.
Student status monitoring tool (SSM): proxy for the real world expert in online course delivery
Authors: Ravikumar Darbhamulla, Manirupa Das, Pamela Lawhead
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Distance Education has entered a new era, where it is now possible for courseware to be delivered online in a very effective, efficient and appealing manner. At the Institute for Advanced Education in GeoSpatial Science (IAESG), a project funded by NASA, it is our objective to develop a repository of dynamic online coursework in the field of Geospatial Information Technology. These courses are intended to enhance the traditional university learning through visually rich content, and also through closely emulating the concept of an Expert in a virtual environment. It thus becomes imperative to address a number of pedagogical issues in the design of such a dynamic web-based course delivery system. Traditional education generally involves two main entities: an Expert, and some form of reference material such as a textbook. The Expert imparts knowledge interactively in the real world, and is in some sense the more 'active' or 'intelligent' agent, whereas the textbook is just reference since it has limited scope, and hence is the 'passive' or 'static' agent. Thus the pedagogical issue that needs the most immediate attention, while dealing with learner-centered online course delivery is the issue of how to emulate the real-world Expert in a virtual learning environment. We realize that the role, the Expert plays in knowledge transfer is multi-faceted. One of the roles of the Export is to use traditional testing methodologies like quizzes and exercise to evaluate the performance of a learner. In an online environment, the best way to achieve this continous evaluation is to get constant feedback on the performance and learning style of the student, via 'Student Status Monitoring' (SSM) tool. The research we present focuses on this pivotal aspect of effective online learning.
Evaluation of a Human-Robot Interface: Development of a Situational Awareness Methodology
Authors: Jean Scholtz, Brian Antonishek, Jeff Young
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

This paper outlines a methodology to evaluate supervisory user interfaces for robotic vehicles based on an assessment of situational awareness. The results of an initial experiment are discussed. The evaluation method will be validated in a future experiment that will also result in a benchmarked user interface.
Asynchronous and deterministic objects
Authors: Denis Caromel, Ludovic Henrio, Bernard Paul Serpette
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

This paper aims at providing confluence and determinism properties in concurrent processes, more specifically within the paradigm of object-oriented systems. Such results should allow one to program parallel and distributed applications that behave in a deterministic manner, even if they are distributed over local or wide area networks. For that purpose, an object calculus is proposed. Its key characteristics are asynchronous communications with futures, and sequential execution within each process.While most of previous works exhibit confluence properties only on specific programs -- or patterns of programs, a general condition for confluence is presented here. It is further put in practice to show the deterministic behavior of a typical example.
Evolving real-time systems using hierarchical scheduling and concurrency analysis
Authors: John Regehr, Alastair Reid, Kirk Webb, Michael Parker, Jay Lepreau
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

We have developed a new way to look at real-time andembedded software: as a collection of execution environmentscreated by a hierarchy of schedulers. Common schedulersinclude those that run interrupts, bottom-half handlers,threads, and events. We have created algorithms forderiving response times, scheduling overheads, and blockingterms for tasks in systems containing multiple executionenvironments. We have also created task scheduler logic,a formalism that permits checking systems for race conditionsand other errors. Concurrency analysis of low-levelsoftware is challenging because there are typically severalkinds of locks, such as thread mutexes and disabling interrupts,and groups of cooperating tasks may need to acquiresome, all, or none of the available types of locks to createcorrect software. Our high-level goal is to create systemsthat are evolvable: they are easier to modify in responseto changing requirements than are systems created usingtraditional techniques. We have applied our approach totwo case studies in evolving software for networked sensornodes.
Hospital Operating Room Capacity Expansion
Authors: William S. Lovejoy, Ying Li
Venue: Management Science (2002)

A large midwestern hospital is expecting an increase in surgical caseload. New operating room (OR) capacity can be had by building new ORs or extending the working hours in the current ORs. The choice among these options is complicated by the fact that patients, surgeons and surgical staff, and hospital administrators are all important stakeholders in the health service operation, and each has different priorities. This paper investigates the trade-offs among three performance criteria (wait to get on schedule, scheduled procedure start-time reliability, and hospital profits), which are of particular importance to the different constituencies. The objective is to determine how the hospital can best expand its capacity, acknowledging the key role that each constituency plays in that objective. En route, the paper presents supporting analysis for process improvements and suggestions for optimal participation-inducing staff contracts for extending OR hours of operation.
Documenting-in-the-large vs. documenting-in-the-small
Authors: Scott R. Tilley
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

There is a significant difference between documenting large programs and documenting small ones. By large programs we mean on the order of 1,000,000 lines, usually written by many different people over a long period of time. Most software documentation may be termed documenting-in-the-small, since it typically describes the program at the algorithm and dat a structure level. To understand large legacy systems, one needs documenting-in-the-large: documentation describing the high-level structural aspects of the software system's architecture from multiple perspectives. This paper outlines an approach to supporting software evolution through documenting-in-the-large. The approach is based on a flexible reverse engineering process which uses virtual subsystem stratifications to represent multiple abstract views of a software system.
Tur&#x00E1;n's theorem in sparse random graphs
Authors: Tibor Szabó, Van H. Vu
Venue: Random Structures Algorithms (2003)

We prove the analogue of Turán's Theorem in random graphs with edge probability p(n) > n-1/(k-1.5). With probability 1 - o(1), one needs to delete approximately 1/k-1-fraction of the edges in a random graph in order to destroy all cliques of size k.
FPGA implementation of a near computation free image compression scheme based on adaptive decimation
Authors: Angus Wu, P. W. M. Tsang, Johnson Tang
Venue: Integration, the VLSI Journal (2003)

Adaptive decimation is a technique that can be applied to compress images with good visual quality at low bit-rate. Despite the low complexity of the method, the encoding process involves floating point computation that requires the use of medium speed processors in order to achieve real time operation. In this paper, a new approach has been taken to restructure the adaptive decimation algorithm to a form that includes only small amount of arithmetic operations. The revised algorithm can be implemented with simple logic circuits. The encoder is practically free from complicated numerical computation. A FPGA implementation of the proposed algorithm was realized. The architecture of the encoder is simple and suitable for valuable applications in the development of low cost non-processor based multimedia products.
Application of Tightly Coupled Engineering Team for Development of Test Automation Software - A Real World Experience
Authors: Ajay Pandey, Nader Kameli, Abraham Eapen, Corey Miklos, Francoise Boudigou, Imelda Sutedjo, Manoj Paul, Vivek Vijay, Wesley Mcdermott
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Studies have been conducted in the past on the effect ofcollaboration on productivity and quality in softwaredevelopment. In this paper we propose a new frameworkof Tightly Coupled Engineering Team (TCET) process tofacilitate collaboration in a team and thereby improveproductivity and software quality. We apply this conceptin a 21-month software project for development of a testautomation software suite for a real-time embeddedmedical device at Guidant Corporation. We observe thatthere is quantitative and qualitative evidence to show thatthe process contributed to increased productivity andsoftware quality, and there is a definite increase in theintra-team training, ownership, and knowledge flow withinthe team. We also observe that project risk is reducedwithout harm to schedule contrary to popular perceptionthat such collaboration may lead to redundancies and thuscost and schedule overrun.