ppxscal/embedding_network huggingface dataset:
A Userland Network Emulator with Packet Capture and Replay
Authors: Kaori Maeda, Masahide Ishino, Eitaro Kohno, Takashi Kishida
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

Testing of communication protocols and applications using simulated networks is necessary. In this paper, we show the development of a network emulator called as .Lenet.. Since our objective is to provide a network emulator as a user can use it more convenient, Lenet is developed as a userland application which is typically used by end users. Even though a userland application, Lenet has similar functions and accuracy to the existing software emulators of an in-kernel implementation type. Lenet gives two kinds of emulation. One is by parameters to simulate specific network conditions for an end-to-end. Another type of emulation is to replay the behavior of a real network using a replay scenario created by packet capture or written by a user. We present some evaluation results of Lenet on performance and convenience.
Competitive algorithms for packet scheduling in computer networks
Authors: Marek Chrobak
Venue:  (2006)

In this work we study two fundamental job scheduling problems arising in network systems.We first consider networks with aggregated links, that is networks in which physical link segments between two connected devices are grouped into a single logical link. A collaborative use of multiple links scales the bandwidth between the two devices, provides load balancing and improves system's fault-tolerance. It also presents new design challenges. One of these challenges is designing appropriate scheduling mechanisms to eliminate packet reordering which increases with parallelism of the system. Reordering of packets is undesirable, as it may negatively influence the performance of transmission protocols.The goal of scheduling algorithms, apart from eliminating the reordering, is also to provide high quality service to the users. This quality may be measured in many ways and in this work we concentrate on optimizing the maximum flow time of the schedule which is defined as the maximum time a packet spends in device queue.We also consider scheduling of network packets under overload conditions, i.e., when the traffic exceeds the capacity of a link. We focus on a model called buffer management with bounded delay, for which we give the first known online algorithm that is better than 2-competitive.
Graph-Based Procedural Abstraction
Authors: A. Dreweke, M. Worlein, I. Fischer, D. Schell, Th. Meinl, M. Philippsen
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Procedural abstraction (PA) extracts duplicate code segments into a newly created method and hence reduces code size. For embedded micro computers the amount of memory is still limited so code reduction is an important issue. This paper presents a novel approach to PA, that is especially targeted towards embedded systems. Earlier approaches of PA are blind with respect to code reordering, i.e., two code segments with the same semantic effect but with different instruction orders were not detected as candidates for PA. Instead of instruction sequences, in our approach the data flow graphs of basic blocks are considered. Compared to known PA techniques more than twice the number of instructions can be saved on a set of binaries, by detecting frequently appearing graph fragments with a graph mining tool based on the well known gSpan algorithm. The detection and extraction of graph fragments is not as straight forward as extracting sequential code fragments. NP-complete graph operations and special rules to decide which parts can be abstracted are needed. However, this effort pays off as smaller sizes significantly reduce costs on mass-produced embedded systems.
Workflow Management in a Protein Clustering Application
Authors: J. L. Vazquez-Poletti, E. Huedo, R. S. Montero, I. M. Llorente
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Bioinformatics is demanding more computational resources day after day. The problems proposed by this area are growing in such complexity that traditional computing systems are not able to face them. For solving complex problems which can be divided in tasks with dependencies, a workflow management system must be employed. In this paper, we introduce the use of the workflow management of the GridWay metascheduler for running a Bioinformatics application which implements a complex algorithm performing protein clustering in order to obtain non-redundant protein databases. The use of a general purpose meta-scheduling system will provide the application the fault-tolerance and advance scheduling capabilities needed to execute on a highly dynamic, heterogeneous and faulty environment. The execution results on a production Grid (the EGEE infrastructure) shows the dramatic impact of remote queue waiting times on the application performance; and the critical need of efficient re-scheduling capabilities.
Characterization of performance, robustness, and behavior relationships in a directly connected material handling system
Authors: Robert Sturges
Venue:  (2006)

In the design of material handling systems with complex and unpredictable dynamics, conventional search and optimization approaches that are based only on performance measures offer little guarantee of robustness. Using evidence from research into complex systems, the use of behavior-based optimization is proposed, which takes advantage of observed relationships between complexity and optimality with respect to both performance and robustness. Based on theoretical complexity measures, particularly algorithmic complexity, several simple complexity measures are created. The relationships between these measures and both performance and robustness are examined, using a model of a directly connected material handling system as a backdrop. The fundamental causes of the relationships and their applicability in the proposed behavior-based optimization approach are discussed.
A Novel Dynamic Multiple Rings-Based Local Restoration for One-to-Multipoint Multicast Traffic in WDM Mesh Networks
Authors: I-Shyan Hwang, Ren-Yuan Cheng, Zen-Der Shyu
Venue: Proceedings of the Sixth International Conference on Networking (2007)

A novel ring-based local fault recovery mechanism, Multiple Rings-based Local Restoration (MRLR), for one-point to multi-point multicast traffic based on the minimum spanning tree (MST) in WDM mesh networks is proposed in this paper. The MRLR mechanism dismembers the multicast tree into several disjoint segment-blocks (sub-trees) and reserves preplanned spare capacity to set up multiple protection rings in each segment-block for providing rapid local recovery. The MRLR scheme outperforms other methodologies in terms of the blocking probability, recovery time and average hop count of protection path per session for different network topologies.
High Tech Academy: preparing secondary students for high tech careers
Authors: S. L. Herr
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

High Tech Academy represents a partnership between Henrico County Public Schools and Infineon Technologies Richmond to recruit, educate, and train secondary students in the pursuit of technological career paths. In addition to a rigorous academic education in advanced subjects, including physics, calculus and chemistry, the program offers hands-on industrial training utilizing sophisticated state of the art equipment. Academic subjects and industrial applications are integrated through project-based learning. Students are organized into yearlong teams that work together on projects that employ the training equipment. Program objectives go beyond traditional technical education, teaching the soft-skills of the modern workplace. Students must learn to work together and gain first hand experience of working on team projects with hard deadlines. Finally, through on-site orientations, summer internships, and robotics competitions partnered with Infineon Technologies, High Tech Academy creates an environment similar to that of the modern workplace.
A block least squares approach to acoustic echo cancellation
Authors: E. Woudenberg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We propose an efficient block least squares (BLS) algorithm for acoustic echo cancellation. The high computation and memory requirements associated with a long room echo make the simple, gradient-based LMS filter a more acceptable commercial solution than a full-fledged LS canceler. However, the LMS echo canceler has slower convergence and worse steady-state performance than its LS counterpart. In the proposed BLS approach, the autocorrelation and cross-correlation of the source and echo, required in solving the LS normal equations, are performed once per block using FFTs. With appropriate data windowing the autocorrelation matrix is constrained to be Toeplitz, allowing the corresponding normal equations to be solved efficiently. The positive definiteness of the autocorrelation function eliminates the stability problems of other fast LS algorithms. BLS can reduce the echo residual to the level of background noise, allowing a residual power based, statistical near-end speech detector to be devised. Performance in real environments under various settings of filter length, SNR, near-end speech presence, etc., is investigated.
Cygwin32: a free win32 porting layer for UNIX® applications
Authors: Geoffrey J. Noer
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

Cygwin32 is a full-featured Win32 porting layer for UNIX applications, compatible with all Win32 hosts (currently Microsoft Windows NT, Windows 95, and Windows 98). It was invented in 1995 by Cygnus Solutions as part of the answer to the question of how to port the GNU development tools to the Win32 host. The Win32-hosted GNUPro compiler tools that use the library are available for a variety of embedded processors as well as a native version for writing Win32 programs. By basing this technology on the GNU tools, Cygnus provides developers with a high-performance, feature-rich 32-bit code development environment, including a graphical source-level debugger. Cygwin32 is a Dynamic-Linked Library (DLL) that provides a large subset of the system calls found in common UNIX implementations. The current release includes all POSIX.1/90 calls except for setuid and mkfifo, all ANSI C standard calls, and many common BSD and SVR4 services including Berkeley sockets. This article will discuss our experiences porting the GNU development tools to the Win32 host and explore the development and architecture of the Cygwin32 library.
About paths with two blocks
Authors: Amine El Sahili, Mekkia Kouider
Venue: Journal of Graph Theory (2007)

The function f(n) is defined to be the smallest integer such that any f(n)-chromatic digraph contains all paths with two blocks P(k,j) with k + j = n - 1. El Sahili conjectured that f(n) = n. We prove in this paper that f(n) &le; n + 1. Our argument yields a very short and direct proof of the Gallai&ndash;Roy result about directed paths. We also treat the problem under some supplementary conditions. One of them is used to give a simple proof of a result of Saks and S&oacute;s about claws. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 221&ndash;226, 2007
Hardware and software tools and laboratory experiments for an undergraduate EET course in digital signal processing
Authors: A. J. A. Oxtoby
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

An undergraduate EET course in digital signal processing with a heavy emphasis on laboratory based applications using the Analog Devices ADSP2101, 16 bit fixed point processor is described. Exercises in waveform generation, filtering and spectral estimation are covered and extended into DSP applications designed to spark the students' enthusiasm. Waveform generation is extended to include generation of a waveform derived from an automobile engine speed sensor, FIR filtering is extended into /spl times/8 output over-sampling of audio signals and the IIR filter is extended to a 6 band graphical audio equaliser. Elements of hardware interfacing through the processor's high speed serial ports are also included. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Quadratic programming and combinatorial minimum weight product problems
Authors: Walter Kern, Gerhard Woeginger
Venue: Mathematical Programming: Series A and B (2007)

We present a fully polynomial time approximation scheme (FPTAS) for minimizing an objective (a T x&#x00a0;+&#x00a0;&#x03b3;)(b T x&#x00a0;+&#x00a0;&#x03b4;) under linear constraints A x &#x2264; d. Examples of such problems are combinatorial minimum weight product problems such as the following: given a graph G&#x00a0;=&#x00a0;(V,E) and two edge weights $${a},{b}: E \rightarrow \mathbb{R}_+$$ find an s &#x2212; t path P that minimizes a(P)b(P), the product of its edge weights relative to a and b.
Unique association between self-occlusion and double-touching towards binding vision and touch
Authors: Yuichiro Yoshikawa, Koh Hosoda, Minoru Asada
Venue: Neurocomputing (2007)

Binding is one of the most fundamental cognitive functions, how to find the correspondence of sensations between different modalities such as vision and touch. Learning the multimodal representation of the body is supposed to be the first step toward binding since the morphological constraints on sensations during self-body-observation would make the binding problem tractable. In this paper, we address an issue of learning to match the foci of attention in vision and touch through self-body-observation. We propose the cross-anchoring Hebbian learning rule to uniquely associate double-touching and self-occlusion. Experiments with both the computer simulation and a real robot show the validity of the proposed method.
Efficiently computing minimax expected-size confidence regions
Authors: Brent Bryan, H. Brendan McMahan, Chad M. Schafer, Jeff Schneider
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Given observed data and a collection of parameterized candidate models, a 1 -- &alpha; confidence region in parameter space provides useful insight as to those models which are a good fit to the data, all while keeping the probability of incorrect exclusion below &alpha;. With complex models, optimally precise procedures (those with small expected size) are, in practice, difficult to derive; one solution is the Minimax Expected-Size (MES) confidence procedure. The key computational problem of MES is computing a minimax equilibria to a certain zero-sum game. We show that this game is convex with bilinear payoffs, allowing us to apply any convex game solver, including linear programming. Exploiting the sparsity of the matrix, along with using fast linear programming software, allows us to compute approximate minimax expected-size confidence regions orders of magnitude faster than previously published methods. We test these approaches by estimating parameters for a cosmological model.
A new time-domain deconvolution algorithm and its applications
Authors: T. E. Tuncer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

A new time-domain method has been presented for deconvolution. This multidimensional method completely eliminates the problems of the previous methods in one dimension and covers a reasonable part of the solutions in multidimensions. In this paper, we present some of the properties of this method. We especially focus on the frequency domain behaviour of the algorithm as well as the performance under numerical errors and errors due to noise. In addition we present examples of the applications including blind deconvolution with a modified non-negativity and support recursive inverse filter (NAS-RIF) algorithm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Conceptual Architecture of a Multi-Agent System for News Syndication
Authors: Iuliana Dogaru, Amelia Badica, Costin Badica
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

This note reports our initial results with the development of a multi-agent distributed system for Web news content syndication. Our proposal builds on a multi-agent platform compliant with FIPA specifications. An initial implementation, design outline and sample experiment are presented.
Teaching risk communication to engineering students
Authors: P. A. Carlson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Risk communication carries a high potential for failure. Not only is the content usually difficult to comprehend and to compress, but the source and the receiver are almost always mismatched in level of expertise, available resources, relationship to power structures, and expectations. Add to this the fact that risk communication and ambiguity, and the demands may appear overwhelming. This presentation outlines a course in risk communication for junior/senior level engineering students.
Teaching to identify problems in a creative way
Authors: E. Sutinen
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Identification and specification belong to the initial stages of problem management. Traditionally, creative methods in these phases have not been considered a part of a computer scientist's expertise or skills. For innovative systems, however, it is crucial that computer experts have a stronger contribution in formulating and even recognizing problems. Managing a problem up to its solution as a software product is a long process that needs creativity and flexibility. Thus, in addition to the basic elements of computer science curriculum, namely knowledge and skills, also training at attitudinal level is required. A dedicated course in creative problem management as a combination of these elements. Preliminary feedback of a pilot course indicates that the course increased students' motivation and supported their self-image as creative agents.
Detection of point targets in image sequences by hypothesis testing: a temporal test first approach
Authors: A. P. Tzannes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper addresses the problem of designing an efficient and effective image sequence processing scheme that will successfully detect very small (point) targets in a cluttered background when both the target and clutter are moving through the image scene. The specific application area was detection of targets such as airplanes in infrared (IR) image sequences of a cloudy sky which have been taken by a stationary camera. In general we assume that targets are typically one to two pixels in extent and move only a fraction of a pixel per frame, are often low amplitude, and are found in scenes which also contain evolving clutter, e.g. clouds. Our algorithm is based on signal processing and detection theory, includes a perfect measurement performance analysis, and can be made computationally efficient compared to other approaches. Thus the algorithm could be applicable to other image sequence processing scenarios, using other acquisition systems besides IR, such as detection of small moving objects or structures in a biomedical or biological imaging scenario or the detection of satellites, meteors or other celestial bodies in night sky imagery acquired using a telescope. We present a GLRT solution, perfect measurement analysis including ROC curves, and results using real-world infrared data.
Vector symbol convolutional decoding with list symbol decisions
Authors: Usana Tuntoolavest, John J. Metzner
Venue: Integrated Computer-Aided Engineering (2002)

Error correcting codes can play a key role in improving the efficiency and reliability of digital communications. One way to simplify the decoder is by using concatenated codes. Reed-Solomon codes have been popular as an outer code of concatenated codes because of their feature of maximum minimum distance between code words. In this paper, we present Vector Symbol Decoding (VSD) with list symbol decisions as a relatively simple and high performance decoding technique for convolutional outer codes. The performance of VSD is evaluated by two computerized approaches. The first one is by developing recursive equations based on the property of the decoder. These equations are readily implemented in a computer program to find the large vector upper bound performance. The second one is to simulate the VSD directly to compute the exact decoding failure probability, which is shown to be two magnitudes lower than that of Reed-Solomon Code.
Tracking vehicle targets with large aspect change
Authors: Behzad Jamasbi, Seyed Ahmad Motamedi, Alireza Behrad
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

In this paper we present a novel method for tracking rigid objects (mostly vehicles) in video sequences with cluttered background, obtained from a mobile camera. We estimate the motion model of the target using corners extraction and matching together with LMedS statistical approach. The resultant model assists an active contour (snake) to track the target efficiently. To avoid tracking errors resulting from large aspect change of the target, we propose a snake with an automatic local swelling mechanism. This mechanism enables the snake to include new parts of the target which appear as a result of large aspect change. Several experiments have been conducted to show the promise of our algorithms. Key words: contour tracking , moving target , aspect change , active contour , feature matching
Transformation of Existing Programs into Autonomic and Self-healing Entities
Authors: M. Muztaba Fuad, Michael J. Oudshoorn
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Autonomic computing is a grand challenge in computing, which aims to produce software that has the properties of self-configuration, self-healing, self-optimization and self-protection. Adding such autonomic properties into existing applications is immensely useful for redeploying them in an environment other than they were developed for. Such transformed applications can be redeployed in different dynamic environments without the user making changes to the application. However, creating such autonomic software entities is a significant challenge because of the amount of code transformation required. This paper presents feasible solutions to such code transformations and identifies associated issues. To illustrate such code transformations, a technique is presented that inserts Java byte code with self-healing primitives and transforms it to become a self-healing component. Experiments show that such code transformations are challenging however they are worthwhile in order to provide transparent autonomic behavior.
A clinical neurophysiology information system based on Tcl/Tk
Authors: Martin B. Andrews, Richard C. Burgess
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

The Department of Neurology at the Cleveland Clinic has replaced a restricted patient information system with a new one based on Tcl/Tk. Tcl/Tk along with several novel extensions provides the base for creating portable client-server database applications. These extensions and some of the clinical applications are presented.