ppxscal/embedding_network huggingface dataset:
Rule-based static analysis of network protocol implementations
Authors: Octavian Udrea, Cristian Lumezanu, Jeffrey S. Foster
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

Today's software systems communicate over the Internet using standard protocols that have been heavily scrutinized, providing some assurance of resistance to malicious attacks and general robustness. However, the software that implements those protocols may still contain mistakes, and an incorrect implementation could lead to vulnerabilities even in the most well-understood protocol. The goal of this work is to close this gap by introducing a new technique for checking that a C implementation of a protocol matches its description in an RFC or similar standards document. We present a static (compile-time) source code analysis tool called Pistachio that checks C code against a rule-based specification of its behavior. Rules describe what should happen during each round of communication, and can be used to enforce constraints on ordering of operations and on data values. Our analysis is not guaranteed sound due to some heuristic approximations it makes, but has a low false negative rate in practice when compared to known bug reports. We have applied Pistachio to implementations of SSH and RCP, and our system was able to find many bugs, including security vulnerabilities, that we confirmed by hand and checked against each project's bug databases.
Multi-line fitting using polynomial phase transforms and downsampling
Authors: K. Abed-Meraim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A new signal processing method is developed for solving the multiline fitting problem in a two dimensional image. We first reformulate the former problem in a special parameter estimation framework such that a first order or a second order polynomial phase signal structure is obtained. Then, the previously developed algorithms in that formalism (and particularly the downsampling technique for high resolution frequency estimation) can be exploited to produce accurate estimates for line parameters. This method is able to estimate the parameters of parallel lines with different offsets and handles the quantization noise effect which can not be done by the sensor array processing technique introduced by Aghajan et al. (1993). Simulation results are presented to demonstrate the usefulness of the proposed method.
Design and modeling of electromagnetic actuator in mems-based valveless impedance pump
Authors: Hsien-Tsung Chang, Chia-Yen Lee, Chih-Yung Wen
Venue: Microsystem Technologies (2007)

This study models and optimizes the electromagnetic actuator in an MEMS-based valveless impedance pump. The actuator comprises an electroplated permanent magnet mounted on a flexible PDMS diaphragm and electroplated Cu coils located on a glass substrate. In optimizing the design of the actuator, the objective is to maximize the output flow rate of the micropump while maintaining the mechanical integrity of its constituent parts. The study commences by developing optimized theoretical models for each of the components within the actuator, namely the diaphragm, the magnet, and the micro-coils. The theoretical models are then verified numerically using FEA software. The magnitude of the magnetic force acting on the flexible diaphragm is calculated using Ansoft/Maxwell3D FEA software. The simulation results obtained by ANSYS FEA software for the diaphragm deflection are found to be in good agreement with the theoretical predictions. In general, the results show that the desired diaphragm deflection of 15&#x00a0;&#x03bc;m can be obtained by passing a current of 0.6&#x2013;0.7&#x00a0;A through the micro-coil to produce a compression force of 11&#x00a0;&#x03bc;N. The valveless micro impedance pump proposed in this study is easily fabricated and is readily integrated with existing biomedical chips due to its plane structure. The results of this study provide a valuable contribution to the ongoing development of Lab-on-a Chip systems.
Jam: make(1) redux
Authors: Christopher Seiwald
Venue: Proceedings of the USENIX Applications Development Symposium Proceedings on USENIX Applications Development Symposium Proceedings (1994)

Despite the progress of UNIX, the basic mechanism by which developers build their programs - make(1) - has remained at its core unimproved since its inception. Most notably, the make language has seen few improvements. Jam is a make replacement that uses an extensible, expressive language for describing ways in which files relate. This new language simplifies the description of systems, both small and large, and renders extending Jam's functionality not only possible but easy. Jam exists now and runs on many UNIX platforms, VMS, and NT. It is freely available in the comp.sources.unix archives. As proof of concept, it has been used to build a very large commercial product, generating in a single invocation 1,000 deliverable files from 12,000 source files.
Domain word translation by space-frequency analysis of context length histograms
Authors: P. Fung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We report a new statistical feature relating a bilingual word pair in a non-parallel English-Chinese corpus. It is found that the lengths of context segments of a word are closely correlated to that of the translation, even when the corpus is non-parallel, i.e., monolingual texts which are not translations of each other. The context segment length histogram of a word has a characteristic pattern and corresponds to that of its translation. If a word appears most frequently in long segments, its translation is found to be most likely occurring in long segments. One way to match these histograms is to first extract their salient shape characteristics by space-frequency analysis and then match them against each other using dynamic time warping. The results of matching can be used in combination with other statistical features to bootstrap a word or term translation algorithm from non-parallel corpora.
Evaluation of Computer-Assisted Quantification of Carotid Stenosis
Authors: D. Stampouli, M. R. Varley, C. F. Walshaw, A. P. Jones, R. W. Bury, L.-K. Shark
Venue: Proceedings of the International Conference on Medical Information Visualisation - BioMedical Visualisation (2007)

Accurate segmentation of the internal carotid artery (ICA) is a critical step towards the diagnosis of carotid artery disease. A method is presented and evaluated for segmentation of internal carotid arteries using adaptive thresholding. Thirty-two arteries were segmented with the proposed method and their stenoses classified. A specialised graphical user interface tool for 3D artery visualization was created to enable manual delineation and segmentation. The segmentation results from two clinical experts using this tool were used for evaluation of the automatic method. The comparison of the manual and automated delineations show that there is a good correspondence. Treating the automatic method as a third "observer", inter-observer variability was also evaluated, and it was found that the algorithm's performance was comparable to that of a clinical expert.
Author feedback experiment at PAM 2007
Authors: Konstantina Papagiannaki
Venue: ACM SIGCOMM Computer Communication Review (2007)

This editorial article is put together to disseminate the experience gained through the author feedback experiment, performed at the 2007 Passive and Active Measurement (PAM) conference.
Blind separation of sources based on their time-frequency signatures
Authors: Y. Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Blind source separation based on spatial time-frequency distributions (STFDs) has been previously introduced. This method provides improved performance over blind source separation methods based on second-order statistics, when dealing with nonstationary signals that are localizable in the time-frequency domain. In the STFD method, the covariance matrix is first used to whiten the signal vector, then the unitary matrix is estimated using high signal-to-noise ratio (SNR) time-frequency points. This paper modifies the STFD method by performing both whitening and estimation steps using STFD matrices. The eigenvectors of the signal subspace obtained from a properly selected STFD matrix are more robust to noise than those obtained from the covariance matrix and, therefore, are more appropriate to use, particularly for low SNR environments. Further, for small array apertures and high number of arrivals, the STFD whitening matrix can be used as means to reduce the number of signals considered by the blind source separation algorithm.
Jitter identification techniques for a regular event-based process
Authors: S. D. Elton
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Two system identification techniques are proposed for discriminating between the type of timing jitter that perturbs the arrival time sequence recorded for an event-based process. A univariate point process is used to characterise the observed signal activity. The first jitter identification method requires a visual inspection of an estimate of the expectation density computed for the point process. The second method involves a statistical hypothesis test for a renewal process. 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
Using the World Wide Web to teach biological engineering
Authors: S. M. Blanchard, S. A. Hale
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Two courses, BAE235: Engineering Biology (http://www.bae.ncsu.edu/bae/courses/bae235/) and BAE465: Biomedical Engineering Applications (http://www.bae.ncsu.edu/-bae/courses/bae465/), in the Biological Engineering curriculum of the Biological and Agricultural Engineering Department at North Carolina State University have made extensive use of the World Wide Web (1) to distribute course materials to students, (2) to obtain supplementary information from throughout the world, and (3) to provide a vehicle for multimedia student projects. Hot links were provided from the syllabus to the instructional objectives for the topics covered in each course. The "Engineering Biology" course also had links to homework assignments, to supplementary materials e.g. the Human Genome Project, and to instructional objectives for each lab. An e-mailer was provided to allow BAE235 students to send anonymous feedback to the instructors. Students in "Biomedical Engineering Applications" were given homework assignments which involved using the World Wide Web to find the home pages of other biological and biomedical engineering programs and to find examples of topics they were studying in class. In addition, the BAE465 students worked in groups to produce electronic term projects. Each group made an on-line presentation of its project to the class at the end of the term. These projects will form the basis for an introductory electronic textbook on biomedical engineering which will be available to the global community. BAE465 projects have also been linked to relevant topics in the syllabus for BAE235.
Maintaining High Process Capability in a Student Project Course
Authors: Terence P. Rout, John Seagrott
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

We have provided a focus on process management and improvement as a basis for conducting student group projects. This paper summarises the lessons learnt from eight years of experience in improvement-focussed projects. The approach has been based upon the establishment of the course as a separate and identifiable organization unit, with its own set of process assets. The responsibility for establishment of these assets resides with the students. Assessment for the course is based on an intensive assessment of the capability of the processes implemented by the project team. The project was assessed on three criteria: the process capability achieved; the achievement against a target capability profile defined by the student team in an Improvement Plan; and the comparison of the capability achieved compared to previous year's achievements We have found that it has been quite possible for the student project to achieve capabilities equivalent to Level 3 (as defined in ISO 15504) for a significant set of processes under their control. This work demonstrates the feasibility of maintaining organizational identification in a student project course, with the accompanying benefit of achieving improvement in process capability. The educational benefit of the course derives from exposure to process improvement as a critical goal for the students.
On-line algorithms for combining language models
Authors: A. Kalai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Multiple language models are combined for many tasks in language modeling, such as domain and topic adaptation. In this work, we compare on-line algorithms from machine learning to existing algorithms for combining language models. On-line algorithms developed for this problem have parameters that are updated dynamically to adapt to a data set during evaluation. On-line analysis provides guarantees that these algorithms will perform nearly as well as the best model chosen in hindsight from a large class of models, e.g., the set of all static mixtures. We describe several on-line algorithms and present results comparing these techniques with existing language modeling combination methods on the task of domain adaptation. We demonstrate that, in some situations, on-line techniques can significantly outperform static mixtures (by over 10% in terms of perplexity) and are especially effective when the nature of the test data is unknown or changes over time.
Distance estimation in virtual and real environments using bisection
Authors: Bobby Bodenheimer, Jingjing Meng, Haojie Wu, Gayathri Narasimham, Bjoern Rump, Timothy P. McNamara, Thomas H. Carr, John J. Rieser
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

Systematic error in judging distances in virtual environments is one of the most interesting problems in perceptual studies of virtual environments. The causes of this error are not known. This paper presents an experiment designed to investigate distance perception in virtual environments using the method of distance bisection (fractionation). Most other studies of distance perception in virtual environment rely on measures involving motor responses or time judgments. Unlike these, the method used in this study depends purely on visually perceived distances. Our experiment compares distance bisection judgments in virtual environments, bisection judgments in the real-world, and bisection judgments in the real-world with limited field of view. We also perform the judgments in two environmental contexts, an outdoor environment and an indoor environment. We find evidence that nonlinear distance compression occurs in virtual environments, but judgments in real-world conditions are accurate. We do not find an effect of environmental context.
Trident: From High-Level Language to Hardware Circuitry
Authors: Justin L. Tripp, Maya B. Gokhale, Kristopher D. Peterson
Venue: Computer (2007)

Unlocking the potential of field-programmable gate arrays requires compilers that translate algorithmic high-level language code into hardware circuits. The Trident open source compiler translates C code to a hardware circuit description, providing designers with extreme flexibility in prototyping reconfigurable supercomputers.
Knowledge-based extraction of control skeletons for animation
Authors: F. Dellas, L. Moccozet, N. Magnenat-Thalmann, M. Mortara, G. Patan"e, M. Spagnuolo, B. Falcidieno
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

In this paper we propose a method for the automatic extraction and annotation of the animation control skeleton of virtual humans, which relies on an a-priori knowledge of the human anatomy. The method is based on a segmentation of the virtual human shape into semantically meaningful features, like arms or legs, and on an automatic location and labeling of joints of the control skeleton. The method is particularly relevant for computer animation where the process still largely relies on manual tasks, and especially for virtual characters built on real scanned data. Several examples will show the results obtained with our approach.
Multiplivative matching pursuit
Authors: A. Serir
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper introduces a novel nonlinear low-level representation of an image with signal-dependent noise. For multiplicative noisy image, we introduce an algorithm called multiplicative matching pursuit decomposition (MMPD), that decomposes the signal containing the intrinsic variation into a nonlinear expansion of waveforms that are selected from a redundant dictionary of functions. These waveforms are chosen in order to best match the signal local structures. The convergence of this new multiplicative decomposition has been proved and tested in practice. An application to speckle reduction in SAR images is described.
Noisy speech recognition using variance adapted likelihood measure
Authors: Jen-Tzung Chien
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Because the norm of testing cepstral vector was shrinked in a noisy environment, the model parameters, i.e., mean vector and covariance matrix, should be adapted simultaneously. We propose a method called variance adapted likelihood measure (VALM) which adapts the mean vector using a projection-based scale factor and adapts the covariance matrix using a variance reduction function estimated from the training database. The variance reduction function can be obtained according to various phonetic units. In the hidden Markov model based experiments, the speech recognition performance is greatly improved by applying VALM. The most significant improvement is achieved when the variance reduction function is separately estimated for different state parameters.
A multiresolution stochastic process for image compression
Authors: S. Moni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We define a data structure called a "web" together with an algorithm to choose scale-space atoms for representing an image. The corresponding wavelet coefficients (of the atoms chosen using this method) have useful properties which lead to (i) the definition of a stochastic process for representing images and (ii) an efficient image compression algorithm. The advantage of our image compression algorithm is that the computational requirement is very low. The stochastic process is useful in a theoretical sense because it gives us a framework in which to understand images and certain image compression algorithms.
The Theoretical Framework of the Optimization of Public Transport Travel
Authors: Jolanta Koszelew
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

With the increase of cars on the streets, more and more people in big cities, decide to move from one place to another by public transport, such as tram, metro or bus. Public transport users need detail informations about network connections. Therefore, some urban portals offer to use systems of optimization of public transport travel. However, finding one or several optimal routes, according to user preferences, is a difficult problem. This paper presents an original method for determining optimal paths in public transportation network. Author describes a network model with time-dependent and bi-modal links, defines the problem of finding optimal routes with users' preferences and proposes algorithm, which can be a solution of this problem.
Resonant pole identification from the acoustic backscatter of small submerged multi-specular elastic targets
Authors: J. Wilbur
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper describes a methodology for identification and pole characterization of resonance modes in the acoustic backscatter from a small submerged elastic target. The estimator follows from resonance scattering theory (RST) which provides a mathematical formalism for expressing target resonance in the form of singularities. Estimation is performed directly on the acoustic backscatter where pole characterization of the lowest order flexural and dilational leaky Lamb modes is obtained from an ensemble of multi-aspect backscattered responses.
MBAC Robustness to Traffic Variations: A Simulation Study
Authors: Anne Nevin, Yuming Jiang, Peder J. Emstad
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Measurement Based Admission Control (MBAC) has long been recognized as the best method for providing stochastic service guarantees. Since MBAC relies on measurements, the actual performance of MBAC can only be established through simulations or on real networks. There are two main performance measures, 1) How well the MBAC can actually meet the QoS target specified by a flow and 2) how well the MBAC can utilize the network resources. The main work in the literature has mostly been on finding optimal MBAC algorithms that increase network utilization. In this simulation study we focus on an MBAC's ability to meet the QoS target under variations in the number of flow attempts within an interval and variations in flow lifetimes. We introduce an ideal admission controller based on analytical values and show the importance of using this ideal when assessing the performance of an MBAC. Most MBAC algorithms rely on tuning parameters to help in the decision making. Tuning these parameters is a difficult task, and a setting that gives excellent performance under one scenario, may give a very pessimistic or too optimistic performance in another scenario. We show that by adding two policies, the so called pessimistic policy together with a back-off policy, the reliance on tuning parameters diminishes. With these two policies in place we show that an MBAC can perform close to the ideal admission controller under various traffic loads without relying on explicit tuning parameters.
In search of the optimal Walsh-Hadamard transform
Authors: J. Johnson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper describes an approach to implementing and optimizing fast signal transforms. Algorithms for computing signal transforms are expressed by symbolic expressions, which can be automatically generated and translated into programs. Optimizing an implementation involves searching for the fastest program obtained from one of the possible expressions. We apply this methodology to the implementation of the Walsh-Hadamard transform. An environment, accessible from MATLAB, is provided for generating and timing WHT algorithms. These tools are used to search for the fastest WHT algorithm. The fastest algorithm found is substantially faster than standard approaches to implementing the WHT. The work reported in this paper is part of the SPIRAL project. An ongoing project whose goal is to automate the implementation and optimization of signal processing algorithms.