ppxscal/embedding_network huggingface dataset:
An information-theoretic approach to network monitoring and measurement
Authors: Yong Liu, Don Towsley, Tao Ye, Jean C. Bolot
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Network engineers and operators are faced with a number of challenges that arise in the context of network monitoring and measurement. These include: i) how much information is included in measurement traces and by how much can we compress those traces?, ii) how much information is captured by different monitoring paradigms and tools ranging from full packet header captures to flow-level captures (such as with NetFlow) to packet and byte counts (such as with SNMP)? and iii) how much joint information is included in traces collected at different points and can we take advantage of this joint information? In this paper we develop a network model and an information theoretic framework within which to address these questions. We use the model and the framework to first determine the benefits of compressing traces captured at a single monitoring point, and we outline approaches to achieve those benefits. We next consider the benefits of joint coding, or equivalently of joint compression of traces captured a different monitoring points. Finally, we examine the difference in information content when measurements are made at either the flow level or the packet/byte count level. In all of these cases, the effect of temporal and spatial correlation on the answers to the above questions is examined. Both our model and its predictions are validated against measurements taken from a large operational network.
Validation Techniques for Image-Based Simulations
Authors: Doug Fraedrich
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

This paper, describes a series of steps on how to perform model validation and how to interpret the results. The first step is to establish how much error is allowable. If this is not done, then the results of the validation will be very hard to interpret. Once this allowable error is established, the paper describes a procedure for how to perform the validation and analyze the results in a productive way.
A grammatical approach to understanding textual tables using two-dimensional SCFGs
Authors: Dekai Wu, Ken Wing Kuen Lee
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We present an elegant and extensible model that is capable of providing semantic interpretations for an unusually wide range of textual tables in documents. Unlike the few existing table analysis models, which largely rely on relatively ad hoc heuristics, our linguistically-oriented approach is systematic and grammar based, which allows our model (1) to be concise and yet (2) recognize a wider range of data models than others, and (3) disambiguate to a significantly finer extent the underlying semantic interpretation of the table in terms of data models drawn from relation database theory. To accomplish this, the model introduces Viterbi parsing under two-dimensional stochastic CFGs. The cleaner grammatical approach facilitates not only greater coverage, but also grammar extension and maintenance, as well as a more direct and declarative link to semantic interpretation, for which we also introduce a new, cleaner data model. In disambiguation experiments on recognizing relevant data models of unseen web tables from different domains, a blind evaluation of the model showed 60% precision and 80% recall.
Interactive presentation: Novel test infrastructure and methodology used for accelerated bring-up and in-system characterization of the multi-gigahertz interfaces on the cell processor
Authors: P. Yeung, A. Torres, P. Batra
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Design-for-test (DFT) techniques are continuously used in designs to help identify defects during silicon manufacturing. However, prior to production, a significant amount of time and effort is needed to bring-up and validate various aspects of the silicon design in the system. In particular, the use of multi-Gigabit I/O signaling for a high I/O count, high-volume product introduces unique test challenges during these two phases of the product life cycle. In this paper, we shall discuss the test infrastructure and methodologies used to accelerate bring-up and in-system silicon characterization for high-speed mixed-signal I/O. These ideas will lead to a shortened time to market (TTM) at a lower cost. As a case study, we shall illustrate these techniques used in the development of the Rambus FlexIO&trade; processor bus and XIO&trade; memory interface used on the first generation Cell processor (aka Cell Broadband Engine&trade; or Cell BE). Cell was co-developed by Sony Corporation, Sony Computer Entertainment Inc, Toshiba Corporation, and IBM and is used in the Sony Play Station&reg; 3 (PS3&trade;) game console and other intense computational applications. The Cell processor uses 5Gbps links for the processor's FlexIO system interface and 3.2Gbps links for the processor's XDR&trade; memory interface. This per pin bandwidth translates into a system interface with a bandwidth of 60GB/s and a memory interface with a bandwidth of 25.6GB/s, respectively.
A Multi-objective Genetic Algorithm with Relative Distance: Method, Performance Measures and Constraint Handling
Authors: Praveen Kumar Tripathi, Sanghamitra Bandyopadhyay, Sankar Kumar Pal
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

A novel Multi-Objective Evolutionary Algorithm (MOEA), called Multi-objective Genetic Algorithm with Relative Distance (MOGARD) is described. A novel relative distance parameter that ensures convergence to the Pareto optimal front and a nearest neighbour based method for maintaining diversity in the non-dominated set is used. Two novel performance measures are formulated to estimate the performance of the MOEAs. A penalty based constraint handling concept is introduced in MOGARD, for handling constraints. Experimental results demonstrate the superiority of MOGARD on several test problems, as compared to other recent and well known algorithms.
Rule extraction from an RBF classifier based on class-dependent features
Authors: Xiuju Fu, Lipo Wang
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Rule extraction is a technique for knowledge discovery. Compact rules with high accuracy are desirable. Due to the curse of irrelevant features to classifiers, feature selection techniques are discussed widely. We propose to extract rules based on class-dependent features from a radial basis function (RBF) classifier by genetic algorithms (GA). Each Gaussian kernel function of the RBF neural network is active for only a subset of patterns which are approximately of the same class. Since each feature may have different capabilities in discriminating different classes, features should be masked differently for different classes. In our method, different feature masks are used for different groups of Gaussian kernel functions corresponding to different classes. The feature masks are adjusted by GA. The classification accuracy of the RBF neural network is used as the fitness function. Thus, the dimensionality of a data set is reduced. Concise rules with high accuracy are subsequently obtained based on the class-dependent features. We demonstrate our approach using computer simulations.
Detecting electronic watermarks in digital video
Authors: J.-P. Linnartz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Electronic watermarking is an active area of research with many applications being foreseen. Watermarks may become an essential tool for copy management in future consumer electronic or PC devices. With simple circuits, detection of watermarks after noise addition, MPEG compression, D/A conversion, pixel shifts appears feasible, but detection after transformations, such as cropping and stretching, remains a challenge. We propose a model to evaluate the effect of scaling on the detector reliability and verify it with experiments.
Fast Enumeration of Solutions for Data Dependence Analysis and Data Locality Optimization
Authors: C. Eisenbeis, O. Temam, H. Wijshoff
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

Most of the sophisticated optimization tools dealing with data dependence analysis, parallelization and data locality exploitation cannot provide satisfactory solutions to a number of problems because they are, in general, unable to precisely handle some complex systems of linear equations coming from dependence equations between array subscripts. For such cases, these algorithms either provide rough estimates or resort to unefficient and therefore costly enumeration strategies. In this paper, we present an efficient technique, named Fast Determination, for dealing with the enumeration problem which degrades the behavior of sophisticated algorithms. Incorporating Fast Determination would enhance the performance and accuracy of existing algorithms, and widen their scope of application.
QuaSR: a large-scale automated, distributed testing environment
Authors: Steven Grady, G. S. Madhusudan, Marc Sugiyama
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

The QuaSR project at Sybase, Inc. involves the creation of thousands of automated tests for Sybase, Inc.'s SQL Server, each implemented as an independent Tcl program. The resulting test suite, significantly more than a million lines of code, comprises the largest known Tcl code base. The test harness is written in [incr Tcl] and the test cases in Tcl. Tcl and [incr Tcl]'s extensibility, simplicity, and reliability have made them uniquely suited to the development of a sophisticated automated testing system.
A planar hypohamiltonian graph with 48 vertices
Authors: Carol T. Zamfirescu, Tudor I. Zamfirescu
Venue: Journal of Graph Theory (2007)

We present a planar hypohamiltonian graph on 48 vertices, and derive some consequences. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 338&ndash;342, 2007
Retrieval effectiveness of table of contents and subject headings
Authors: Youngok Choi, Ingrid Hsieh-Yee, Bill Kules
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The effectiveness of two modes of subject representation - table of contents (TOC) and subject headings - in subject searching in an online public access catalog (OPAC) system was investigated. The retrieval difference between TOC and the Library of Congress subject headings (LCSH) was statistically significant; the effect of subject domain was not statistically significant; users had better success matching their keywords to TOC than to LCSH; but their keywords often failed to retrieve items similar to the target items. These findings underscore the need to bridge user keywords to both TOC and LCSH.
Single-radio location-based multihop packet relaying
Authors: Ahmed Bader
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In wireless multihop networks, all nodes falling within the reception neighborhood of a certain packet transmission are candidate relays. Existing schemes that are based on a CSMA/CA MAC were not originally designed to have the capability of discriminating between similar and dissimilar packets. Nodes attempting to relay the same packet will contend for medium access as much as they will do when relaying dissimilar packets. Exchanging information between nodes will obviously resolve this issue. However, as the node density or communication range increase, the coordination overhead increases and thus reducing bandwidth efficiency. To overcome this problem, we propose a packet relaying scheme. The proposed scheme offers a cross-layer design approach where location-based relaying criteria is integrated with an OFDM-based MAC. It utilizes the fact that the OFDM receivers are tolerant to signal delays. This allows for the design of a connectionless and distributed relaying scheme where the relaying decision is locally taken at each node. For the injection of newly generated packets, Clear Channel Assessment (CCA) is utilized in this scheme.
Robust signal detection using the bootstrap
Authors: Hwa-Tung Ong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper presents a CFAR detector based on the bootstrap for detecting signals with unknown amplitude, phase and frequency such as found in conventional pulsed radar and sonar systems. The detector is robust against non-Gaussian noise, and can still maintain the false alarm rate without much modification if consistent estimates are substituted for unknown parameters. Preliminary asymptotic results are given on the performance of the detector, and simulations are used to study the performance for small samples sizes.
F0 Control Model for Mandarin Singing Voice Synthesis
Authors: Wen-Hsing Lai
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

An F0 control model that can control F0 fluctuations and generate natural F0 contours of singing-voices are shown. A Mandarin singing synthesis system is built. The system employs a concatenation-based text-to-speech method to synthesize arbitrary lyrics in Mandarin. Using information contained in a score file, the system concatenates and modifies units from an inventory of 414 syllables, originally recorded in reading style, to form arbitrary lyrical singing voice.
A first approach to the closed-form specification and analysis of an autonomic control system
Authors: Simon Dobson, Eoin Bailey, Stephen Knox, Ross Shannon, Aaron Quigley
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Control systems must increasingly be designed to involve collections of hardware and software components, both of which may evolve over the lifetime of the system, and which are expected to provide self-managing, adaptive, autonomic behaviour. Understanding the behaviour such a system will exhibit under any specific conditions is a significant design challenge. We present a model derived from approaches to modelling dynamical systems in which the adaptive behaviour of an autonomic system may be described and analysed as a whole. We explain our ideas with reference to a hybrid hardware/software system, and argue that it generalises to other classes of autonomic systems.
Blind point-source image restoration using subspace techniques
Authors: B. A. Chipman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Blind point-source image restoration refers to the problem of high resolution recovery of point-like sources which are blurred by an unknown point spread function (PSF). Applications include astronomical star field localization, magnetoencephalogram brain current imaging, and seismic deconvolution. This paper shows that with suitable constraints the problem can be cast in the language of subspace decomposition as used in blind signal copy algorithms for digital wireless communications. Assuming a separable PSF, we propose a deterministic, non-iterative ESPRIT-like solution to the restoration problem. We next extend the algorithm to non-separable PSFs by approximating them as a series expansion of a few separable components.
A Static Scheduling Algorithm Using Dynamic Critical Path for Assigning Parallel Algorithms onto Multiprocessors
Authors: Yu-Kwong Kwok, Ishfaq Ahmad
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

An algorithm for compile-time static scheduling of task graphs onto multiprocessors is proposed. The proposed algorithm, which is called Dynamic Critical Path (DCP) scheduling algorithm, is different from previously reported algorithms in a number of ways. First, it determines the critical path of the task graph and selects the next node to be scheduled in a dynamic fashion. Second, it rearranges the schedule on each processor dynamically in the sense that the positions of the nodes in the partial schedules are not fixed until all nodes have been considered. Third, it uses an intelligent way to select a suitable processor for a node by looking ahead the potential start times of the remaining critical nodes on that processor and by scheduling relatively less important nodes to the processors already in use. Four related scheduling algorithms are also discussed. Although these algorithms are efficient in general, they possess drawbacks which can lead to poor performance. The proposed DCP algorithm overcomes the drawbacks of these algorithms and outperforms them by a considerable margin. Despite having a number of new features, the DCP algorithm is fast, efficient in terms of the number of processors used and is equally suitable for different types of graph structures.
XULRunner: A New Approach for Developing Rich Internet Applications
Authors: Brent Stearn
Venue: IEEE Internet Computing (2007)

The Web 2.0 world abounds with solutions for developing Web-based rich Internet applications (RIAs). Desktop application developers have seen a similar maturation of full-featured frameworks to help simplify development. Mozilla's XULRunner application runtime engine offers a compromise between Web-based RIAs and a desktop application's power.
The engage program: results from renovating the first year experience at the University of Tennessee
Authors: F. E. Weber
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

An innovative new freshman engineering initiative called engage has been fully implemented at the University of Tennessee. This is a comprehensive approach to meeting the educational and developmental needs of our freshmen. Extensive data on student performance was collected during the two-year phase in of this new program. Results presented include retention rates (engineering college and university), progression through the program, performance on common final exams and performance in sophomore courses. Comparisons are also made between the engage program and nationally administered surveys, i.e. Pittsburgh survey on engineering student attitudes. In all these areas students in the new program did as well or better than those in the traditional curriculum.
CAD Modeling of a Microwave Rectangular Coaxial Filtering Device
Authors: Aline Jaimes-Vera, Ignacio Llamas-Garro, Alonso Corona-Chavez, Ignacio Zaldivar-Huerta
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

In this paper we discuss the adequate filter parameter selection to obtain a low loss coaxial cable, out of which a narrowband filtering device is designed. The design parameters under interest are the attenuation constant (á) obtained, which will depend on the size of the rectangular coaxial cross section used. And the decision beyond which frequency higher order modes should start to propagate through the cable resulting in a dispersive coaxial cable. The tradeoff between these two parameters is discussed in detail. After the coaxial design parameters are chosen to meet a design specification, (in this paper a 4 pole, 4% fractional bandwidth filter, centered at 9 GHz), the design of an air filled coaxial feed line is discussed, followed by the design of the microwave filter, and finally the integration of the complete device is presented. The coaxial cable discussed in this paper uses air as the propagation medium, thus resulting in a conductor loss limited structure, where no dielectric or radiation losses are present. All calculations were done using Ansoft HFSS a commercial full wave 3D EM simulator.
A Model for Service Composition with Multiple QoS Constraints
Authors: Xingzhi Feng, Yi Ren, Jianqiang Hu, Quanyuan Wu, Yan Jia
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

With the development of theory and technology of web service, Web Service Composition has become the core Service-Oriented Computing technology. It is important for business process to select the best service components with multi-dimensional QoS assurance to construct a complex one. In this paper we propose a web service composition model with multiple QoS constraints. We define the utility function as the evaluation standard considering all QoS parameters of each service component and use Subjective-objective Weight Mode to set the weight of each QoS metric.
Skeleton-based Hierarchical Shape Segmentation
Authors: Dennie Reniers, Alexandru Telea
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

We present an effective framework for segmenting 3D shapes into meaningful components using the curve skeleton. Our algorithm identifies a number of critical points on the curve skeleton, either fully automatically as the junctions of the curve skeleton, or based on user input. We use these points to construct a partitioning of the object surface using geodesics. Because it is based on the curve skeleton, our segmentation intrinsically reflects the shape symmetry and topology. By using geodesics we obtain segments that have smooth, minimally twisting borders. Finally, we present a hierarchical segmentation of shapes which reflects the hierarchical structure of the curve skeleton. We describe a voxel-based implementation of our method which is robust and noise resistant, computationally efficient, able to handle shapes of complex topology, and which delivers levelof- detail segmentations. We demonstrate the framework on various real-world 3D shapes.
Losing control
Authors: Scott Davidson
Venue: IEEE Design Test (2007)

This column looks back at the days when we had direct, tactile control of our appliances and wonders what impact the loss of this control is having on our children's interest in engineering. Increased complexity in our work life also leads to our feeling this lack of direct control. Yet, perhaps it's a mistake to pine for those days of direct control. Maybe our children's ability to find and fix a problem by its symptoms will be essential for testing the products of the future.
An approach to a virtual learning environment through a game
Authors: Pasi Mattila, Jukka Miettunen, Tony Manninen
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

The traditional notion of a learning environment has expanded to cover virtual spaces. Today, these extremely popular virtual learning environments are often network-based and readily accessible to a certain group of students. These considerations have inspired the present project that has produced a 3D virtual learning environment with the aim of providing a space for learning activities. The games designed for this space offer challenges the players try to solve as a team. They emphasize group work skills, group interaction, and cooperation in various conflict situations that have to be negotiated inside the virtual world. Historical information plays a key role in gameplay and thus the learning experience is integrated into the events of the games, making learning fun. The environment does not contain violent or destructive elements, and therefore it is suitable for children of all ages and both sexes.