ppxscal/embedding_network huggingface dataset:
Proceedings of the 3rd annual ACM workshop on Mining network data
Venue: Joint International Conference on Measurement and Modeling of Computer Systems (2007)

Welcome to the Third ACM Workshop on Mining Network Data.. Today's IP networks are extensively instrumented for collecting a wealth of information including traffic traces (e.g., packet or flow level traces), control information (e.g., on router forwarding tables, BGP and OSPF updates), and management data (e.g., alarms, SNMP traps). The real challenge is to process and analyze this vast amount of primarily unstructured information and extract structures, relationships, and "higher level knowledge" embedded in it and use it to aid network management and operations. The goal of this workshop is to explore new directions in network data collection, storage, and analysis techniques, and their application to network monitoring, management, and remediation. The workshop provides a venue for researchers and practitioners from different backgrounds, including networking, data mining, machine learning, and statistics, to get together and collaboratively approach this problem from their respective vantage points. 18 papers were submitted to the workshop and underwent a rigorous single blind review and discussions by the PC members. Finally papers were selected after detailed discussions at the PC meeting. Given the one-day format for the workshop, the Program Committee was only able to accept 9 papers.
Efficient network attack graph generation
Authors: Paul Ammann
Venue:  (2007)

Attack graphs are often used by penetration testing teams to represent the individual steps an attacker could use to compromise a network. The graphs built manually by these teams though are often incomplete and require substantial effort to create. Because of this, automated network attack graph generation is an area that has enjoyed significant research over the last several years. This dissertation further develops the body of knowledge in automated network attack graphs specifically focused on proving its usefulness to protecting real networks. I show that attack graph construction and analysis can be automated while maintaining characteristics of real networks, that attack graphs can be used to assess the resiliency of candidate enterprise networks and that attack graphs can be scaled to enterprise sized networks.
Dynamic probes and generalised kernel hooks interface for linux
Authors: Richard J. Moore
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

Dynamic Probes (Dprobes)[1] is a generic and pervasive system debugging facility that will operate under the most extreme software conditions such as debugging a deep rooted operating system problems in a live environment. For example, page-manager bugs in the kernel or perhaps user or system problems that will not re-create easily in either a lab or production environment. For such inaccessible problem scenarios Dprobes not only offers a technique for gathering diagnostic information but has a high probability of successful outcome without the need to build custom modules for debugging purposes. Dprobes allows the insertion of fully automated breakpoints or probepoints, anywhere in the system and user space. Probepoints are global by definition, that is they are defined relative to a module and not to a storage address. Each probepoint has an associated set of probe instructions that are interpreted when the probe fires. These instructions allow memory and CPU registers to be examined and altered using conditional logic. When the probe program terminates an external debugging facility may be optionally triggered - should it register for this purpose. For example: A trace facility may augment its capability with a dynamic trace capability by using the Dprobes facility as a means of inserting tracepoints - dynamically, without any prior code modification. A crash dump facility may use Dprobes as a means of invoking dumps conditionally when a specific set of circumstances occurs in a particular code path. A debugger may use Dprobes as high-speed complex conditional breakpoint service. This paper describes the architecture of Dynamic Probes and briefly discusses a couple of examples of its successful application. In creating Dynamic Probes, we were challenged with the conflicts between: Size of the kernel modification Co-existence with other kernel enhancements, particularly debugging and instrumentation enhancements. Maintaining concurrency with the latest kernel version. Ease of development and continued enhancement of Dynamic Probes. We alleviated these problems by developing a generalised interface for kernel modifications to use allowing them to exist as dynamically loadable kernel modules. This interface: The Generalised Kernel Hooks Interface (GKHI) is described in the second part of this paper.
Automatic generation of fast matrix multiplication algorithms
Authors: K. Sikorski
Venue:  (2006)

Strassen's matrix multiplication algorithm was a significant step in lowering the computational complexity of multiplying two matrices. A natural question was "Was it the best possible?" The first step was to determine a class of similar divide-and-conquer algorithms for matrix multiplication. We associated each such algorithm with a solution to a system of polynomial equations. The systems of equations are trilinear, are nonhomogeneous, and have a different number of equations than variables. Thus, there is a family of systems of equations, the solutions to which have a one-to-one mapping to the divide-and-conquer matrix multiplication algorithms. Therefore, answering questions about algorithms gives results in solving systems of equations, and answering questions about solving systems of equations gives results in algorithms. To explore this correlation, many of the systems of equations must be solved, and others must be shown to have no solution. Even the smallest of the systems of equations in the family is large (64 equations in 60 complex variables). Using software developed and search algorithms found in this work, many approximate solutions were found to the smallest system known to have solutions (64 equations in 84 variables), since Strassen's algorithm gives one. A roughly equivalent effort, applied to a smaller system (64 equations in 72 variables), has found only local minima that are not solutions. The developed software included designing a programming language and writing an interpreter for it. It allows the user to write and run a program, monitor the progress of the running program, and even change the program while it runs. In particular, it allows the portions of the program that are written to start running before writing and adding other parts (to the running program). The important search algorithm found is an improvement to the line search method for systems of equations that are linear in each variable. The traditional line search method repeatedly selects a line that can be followed to get closer to a minimum of the function and then advances iteratively along the line towards the minimum. The improvement computes the optimum advance along the line in one step.
Robust template tracking with drift correction
Authors: David Schreiber
Venue: Pattern Recognition Letters (2007)

We propose an efficient robust version of the Lucas-Kanade template matching algorithm. The robust weights used by the algorithm are based on evidence which is accumulated over many frames. We also present a robust extension of the algorithm proposed by Matthews et al. [Matthews, I., Ishikawa, T., Baker, S., 2004. The template update problem. IEEE Trans. Pattern Anal. Machine Intell. 26 (6), 810-815] which corrects the template drift. We demonstrate that in terms of tracking accuracy, the robust version of the drift-correcting algorithm outperforms the original algorithm, while remaining still extremely fast.
Speech enhancement based on a priori signal to noise estimation
Authors: P. Scalart
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper addresses the problem of single microphone frequency domain speech enhancement in noisy environments. The main characteristics of available frequency domain noise reduction algorithms are presented. We have confirmed that the a priori SNR estimation leads to the best subjective results. According to these conclusions, a new approach is then developed which achieves a trade-off between effective noise reduction and low computational load for real-time operations. The obtained solutions demonstrate that the subjective and objective results are much better than existing methods.
Systematic t-Unidirectional Error-Detecting Codes over Zm
Authors: Bella Bose, Samir Elmougy, Luca G. Tallini
Venue: IEEE Transactions on Computers (2007)

Some new classes of systematic t-unidirectional error-detecting codes over Zm are designed. It is shown that the constructed codes can detect two errors using two check digits. Furthermore, the constructed codes can detect up to m^{r - 2} + r - 2 errors using r ≥ 3 check bits. A bound on the maximum number of detectable errors using r check digits is also given.
Waiting time estimation with pre-specified accuracy in a single-server queueing system
Authors: S. M. Berber
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper contains results on the development of accurate methods for the mean value estimation for a stochastic process with statistically dependent outcomes. Firstly, the regenerative method is explained, and then. a new method, based on the expression for the sample size as a function of the accuracy of estimation, is developed and explained. In contrast to the regenerative method, which estimates the confidence interval for the defined confidence level and a constant sample size, the proposed method and techniques estimate the mean value with the pre-specified accuracy and with a variable sample size.
Internet infrastructure security
Authors: G. Manimaran
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Summary form only given. The Internet has grown enormously over the last decade and has become ubiquitous. Most past research has focused on improving the performance and scalability of the Internet. The issue of securing the Internet has become a central issue due to a series of attacks that shut down some of the world's most high profile Web sites. Moreover, the growing concerns for cyber terrorism have made governments and researchers realize the importance of Internet security. Securing the Internet, as in any other field of computers, is based on the principle of confidentiality and integrity. This principle exists in every field, but the presence of packet sniffers, malicious routers, covert channels, eavesdroppers, denial-of-service (DoS) in the Internet makes this problem quite challenging. There has been a surge of Internet security research in the field of information assurance, which primarily focused on protecting the data using techniques such as authentication and encryption. However, information assurance assumes that the devices responsible for encrypting, forwarding and sending are trustworthy. Researchers are now questioning these assumptions, as instances have occurred where the network infrastructure (e.g., routers, servers) is compromised to the advantage of the malicious adversaries. Therefore, Internet infrastructure security is the need of the hour.
Optimal estimation of subband speech from nonuniform non-recurrent signal-driven sparse samples
Authors: P. S. Penev
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Speech signals are comprised of auditory objects that are localized in time, but can appear anywhere in the record. We introduce a strategy for non-recurrent irregular signal-driven sampling and subsequent maximum likelihood interpolation of speech subbands that achieves object constancy-the representation of an auditory object is precisely locked to the timing of its features, but is otherwise constant. Moreover, the reconstruction fidelity can be traded flexibly for sampling rate, over a broad range of signal-to-noise ratios and application requirements. In an experiment with wideband speech, we find a regime in the rate/distortion curve that has almost perfect reconstruction at a rate substantially lower than the respective Nyquist rate.
A Model-Driven Approach to Extract Views from an Architecture Description Language
Authors: Cristovao Oliveira, Michel Wermelinger
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

A common approach to defining architectural views is to have independent heterogeneous representations that are tailored to each view's purpose, but this makes reconciling views into an overall architectural description harder. In this paper we put forward a complementary (not alternative) approach in which some views are derived from a given architecture description language (ADL) in a systematic way, by listing the design questions each view should answer. The approach is based on constructing the language's metamodel and extending it with the entities and associations needed to capture and explicitly relate the required views.
Distributed wireless sensor networks and industrial control systems - a new partnership
Authors: G. Platt, M. Blyde, S. Curtin, J. Ward
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

CSIRO is investigating the application of mote devices as intelligent agents in a distributed energy control system. This is a significant paradigm shift from the application of motes as sensor networks - it involves the interaction of motes and industrial control systems hardware, and this paper details our early development work in this area.
Automatic synthesis of compressor trees: reevaluating large counters
Authors: Ajay K. Verma, Paolo Ienne
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Despite the progress of the last decades in electronic design automation, arithmetic circuits have always received way less attention than other classes of digital circuits. Logic synthesisers, which play a fundamental role in design today, play a minor role on most arithmetic circuits, performing some local optimisations but hardly improving the overall structure of arithmetic components. Architectural optimisations have been often studied manually, and only in the case of very common building blocks such as fast adders and multi-input adders, ad-hoc techniques have been developed. A notable case is multi-input addition, which is the core of many circuits such as multipliers, etc. The most common technique to implement multi-input addition is using compressor trees, which are often composed of carry-save adders (based on (3 : 2) counters, i.e., full adders). A large body of literature exists to implement compressor trees using large counters. However, all the large counters were built by using full and half adders recursively. In this paper we give some definite answers to issues related to the use of large counters. We present a general technique to implement large counters whose performance is much better than the ones composed of full and half adders. Also we show that it is not always useful to use larger optimised counters and sometimes a combination of various size counters gives the best performance. Our results show 15% improvement in the critical path delay. In some cases even hardware area is reduced by using our counters.
Investigating aesthetic visualizations
Authors: Christopher G. Healey
Venue:  (2007)

Visualizations enable scientists to inspect, interpret, and analyze large multi-dimensional data sets. Effective visualizations are designed to both orient and engage viewers by directing attention in response to a visual stimulus, and then encouraging a viewer's vision to linger at a given image location. Research into human visual perception provides information about how to orient viewers, using salient visual features, such as color, orientation, and flicker. Less is known about how to build engaging visualizations. Increasing the aesthetic merit of visualizations is a promising approach to increasing engagement. Intuition suggests that visualizations with a more aesthetic presentation style will be judged as more artistic, but this is an open problem. In this thesis, we explored an important question pertaining to creating aesthetic visualizations: Is it possible to affect the perceived artistic merit of a scientific visualization? To investigate this question, we developed three new painterly visualization techniques, designed to vary different visual qualities important to aesthetics: interpretational complexity (IC), indication and detail (ID), and visual complexity (VC). We conducted four experiments to investigate how these qualities affect the aesthetics. Observers were asked to rank IC, ID, and VC images, together with Master abstract and Impressionist paintings on five questions: artistic merit, pleasure, arousal, meaningfulness, and complexity. Although realistic Impressionist paintings consistently ranked as most artistic, computer visualizations were considered as artistic as and more pleasing than Master abstractionist artwork in certain situations. There was also a significant preference for aesthetic visualizations that used more sophisticated presentation styles. This provides strong evidence that our aesthetic techniques can increase the perceived artistic merit of a visualization, possibly leading to a significant improvement in the visualizations's ability to engage its viewers. We applied our experimental techniques to real meteorological and supernova data sets, to explore their capabilities in a real-world setting. Anecdotal feedback from a domain expert in astrophysics was strongly positive, further supporting the theory that enhancing the artistic merit of visualizations is a worthwhile contribution to the scientific community.
Automatic Synthesis of Robust Numerical Controllers
Authors: Giuseppe Della Penna, Daniele Magazzeni, Alberto Tofani, Benedetto Intrigila, Igor Melatti, Enrico Tronci
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

A major problem of numerical controllers is their robustness, i.e. the state read from the plant may not be in the controller table, although it may be close to some states in the table. For continuous systems, this problem is typically handled by interpolation techniques. Unfortunately, when the plant contains both continuous and discrete variables, the interpolation approach does not work well. To cope with this kind of systems, we propose a general methodology that exploits explicit model checking in an innovative way to automatically synthesize a (time-) optimal numerical controller from a plant specification and apply an optimized strengthening algorithm only on the most significant states, in order to reach an acceptable robustness degree. We implemented all the algorithms within our CGMur\varphitool, an extension of the well-known CMur\varphiverifier, and tested the effectiveness of our approach by applying it to the well-known truck and trailer obstacles avoidance problem.
Finding misconvergences in blind equalizers and new variance constraint cost functions to mitigate the problem
Authors: M. J. Minardi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We show that the equalizer weights that cause the overall channel-equalizer response to approximate a pure delay (in a mean square error sense) are within the region of convergence of a stable local minimum of the Bussgang cost function. For any nontrivial channel the approximations for some delay values are poor. If a Bussgang algorithm is initialized with these weights it misconverges. A Monte-Carlo simulation created misconvergence as predicted. We propose the variance constraint (VC) algorithms that have more robust convergence properties than the Bussgang algorithms. The VC cost functions are similar to the well-known Godard cost functions. They incorporate estimates of the channel-equalizer overall gain and use a linear constraint on the weights. These two modifications push the bad stable points farther away in weight space from the stable points with good performance (i.e., low intersymbol interference). A Monte-Carlo simulation of nearly 2000 channels shows no misconvergence.
Residual modeling in music analysis-synthesis
Authors: M. Goodwin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

In analysis-synthesis of musical sounds based on a sinusoidal model, the difference between the original signal and the synthesized signal, termed the residual, is typically a broadband noise process. It contains such musical phenomena as flute breath noise or violin bow noise. Synthesis without such "noise" tends to sound artificial; it is desirable to improve the synthesis realism by modeling the residual in such a way that it can be reinjected in the synthesized signal. This paper deals with a model of noise perception based on the equivalent rectangular bands (ERBs) of the auditory system. Since a broadband noise is perceptually well-represented by the time-varying energy in each of these frequency bands, the residual is parametrized in terms of these energies in the proposed model. An application of the model to music synthesis based on the inverse fast Fourier transform (FFT) is described in detail.
A modified overall on-line modeling algorithm for the feedforward multiple-point ANC system
Authors: D. Cochran
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper proposes a modified overall on-line modeling algorithm for application in a feedforward multiple-point active noise control (ANC) system, in which acoustic path decoupling can be improved. First, the structure of the ANC system adopting the proposed method is discussed. Second, the update equations of the system modules employing the LMS algorithm are derived. Next, the off-line initialization procedures of the system modules together with the update equations are described. Computer simulations illustrate the performance of the feedforward multiple-point ANC system adopting the proposed method. Simulation results show that the system can achieve superb low-frequency noise reduction and the reconvergence of the system error is guaranteed even when changes are encountered in the primary and secondary paths. 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
Propagating Diversity through Active Dissemination
Authors: Katie A. Siek, Kay Connelly, Suzanne Menzel, Laura Hopkins
Venue: Computer (2007)

Bring IT On! teaches students at historically black colleges and universities how to create K-12 outreach programs.