ppxscal/embedding_network huggingface dataset:
Iterative maximum-likelihood/cross-correlation algorithm for reflection and pulse TOA estimation
Authors: A. B. Doser
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

An iterative method that combines a parametric channel model with the maximum likelihood and cross-correlation estimation techniques has been developed to estimate the reflection, creeping wave, and times of arrival (TOAs) from an echo (backscatter) emanating from a rigid acoustic sphere. The modelled echo is assumed to be more complex than a linear combination of delayed and scaled versions of the transmitted pulse, and the individual backscatter pulses need not be disjoint. Experimental results demonstrate that the algorithm is successful in determining the proper time delays of the reflection and the creeping wave for a variety of received signal-to-noise ratios (SNRs).
An Integrated Scheme for Compression and Interactive Access to Document Images
Authors: Gaurav Harit, Ritu Garg, Santanu Chaudhury
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

We present an integrated scheme for document image compression which preserves the layout structure, and still allows the display of textual portions to adapt to the user preferences and screen area. We encode the layout structure of the document images in an XML representation. The textual components and picture components are compressed separately into different representations. We derive an SVG (Scalable Vector Graphics) representation of the complete document image. Compression is achieved since the word-images are encoded using specifications for geometric primitives that compose a word. A document rendered from its SVG representation can be adapted for display and interactive access through common browsers on desktop as well as mobile devices. We demonstrate the effectiveness of the proposed scheme for document access.
A Deterministic Algorithm for Finding All Minimum $k$-Way Cuts
Authors: Yoko Kamidoi, Noriyoshi Yoshida, Hiroshi Nagamochi
Venue: SIAM Journal on Computing (2006)

Let $G=(V,E)$ be an edge-weighted undirected graph with $n$ vertices and $m$ edges. We present a deterministic algorithm to compute a minimum $k$-way cut of $G$ for a given $k$. Our algorithm is a divide-and-conquer method based on a procedure that reduces an instance of the minimum $k$-way cut problem to $O(n^{2k-5})$ instances of the minimum $(\lfloor (k+\sqrt{k})/2\rfloor+1)$-way cut problem, and can be implemented to run in $O(n^{4k/(1-1.71/\sqrt{k}) -31} )$ time. With a slight modification, the algorithm can find all minimum $k$-way cuts in $O(n^{4k/(1-1.71/\sqrt{k}) -16} )$ time.
Mobile Wireless Sensor Network: Architecture and Enabling Technologies for Ubiquitous Computing
Authors: Saad Ahmed Munir, Biao Ren, Weiwei Jiao, Bin Wang, Dongliang Xie, Jian Ma
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

A mobile wireless sensor network owes its name to the presence of mobile sink or sensor nodes within the network. The advantages of mobile WSN over static WSN are better energy efficiency, improved coverage, enhanced target tracking and superior channel capacity. In this paper we will present and discuss hierarchical multi-tiered architecture for mobile wireless sensor network. This architecture is proposed for the future pervasive computing age. We also elaborate on the impact of mobility on different performance metrics in mobile WSN. A study of some of the possible application scenarios for pervasive computing involving mobile WSN is also presented. These application scenarios will be discussed in their implementation context. While discussing the possible applications, we will also study related technologies that appear promising to be integrated with mobile WSN in the ubiquitous computing. With an enormous growth in number of cellular subscribers, we therefore place the mobile phone as the key element in future ubiquitous wireless networks. With the powerful computing, communicating and storage capacities of these mobile devices, the network performance can benefit from the architecture in terms of scalability, energy efficiency and packet delay, etc.
Spatial processing technique adaptive beamforming (SPTABF) via compactly supported orthonormal wavelets
Authors: Shun-Hsyung Chang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We propose a new adaptive beamformer which uses the generalized sidelobe canceller (GSC) as the underlying structure. However, unlike the traditional adaptive beamformer, which uses the time-domain least mean squares (LMS) algorithm, the new one employs the wavelet-based LMS as the adaptive scheme for adjusting the system weights. The latter, as demonstrated in the literature, can indeed yield faster convergence rate as opposed to the time-domain counterpart. In addition, the new beamformer has also incorporated the spatial smoothing technique so that it can handle the case of coherent interference. The resulting adaptive beamformer, thus, admits efficient hardware implementations as the GSC. It also exhibits a fast tracking capability, and, at the same time, works well for both noncoherent and coherent interference. Simulation results are provided to verify this new structure.
Examining cognitive processes of unstructured decision making
Authors: James Shanteau
Venue:  (2006)

Unstructured decision making is a dynamic process where an individual must create an alternative because one is not available or provided. In this type of a decision, an individual may not have formed preferences or may not know the path to arrive at a solution. As opposed to selecting from existing alternatives, little research examines when decision makers create an alternative. Electronic commerce websites allow individuals to create a product by customizing it. A web-based simulation called Interactive Choice was developed for the investigation. It is an interactive naturalistic decision space permitting experimental controls such as random placement of participants into conditions and random display of stimuli. Participants customized three products (pizza, cell phones, shoes). Building on theoretical foundations of unfolding model and Image Theory, a model asserts the presentation of the information and preparation of the decision maker influences a decision maker. A phased examination explores decision makers' cognitive processes by measuring participants' evaluations of the product created and the process to create it.In the first phase, three experiments find, contrary to previous independent investigations, participants rarely retain a pre-selected default value. Logistic regression reveals that the odds ratio of predicting default retention is dependent on product type. In the second phase, results identify that problem solving instructions influence decision making. Analyses of multidimensional scaling and cluster analysis reveal patterns for default retention and problem solving instructions that define an electronic decision aid called Choice Builder. The dissertation suggests that when an individual creates a product, he or she has more control over the process that subsequently reduces the influence of the default. A new theoretical foundation is proposed identifying that for unstructured decisions individuals construct both decision strategies and preferences while creating an alternative. With an active process of acquiring and evaluating information, an individual forms a decision strategy and updates preferences to achieve an ideal outcome. This dissertation makes four contributions that include (1) a research tool, Interactive Choice, for exploration, (2) the identification of cognitive processes involved, (3) a proposal of a new theoretical approach, and (4) an electronic decision aid, Choice Builder.
Hardware scheduling support in SMP architectures
Authors: André C. Nácul, Francesco Regazzoni, Marcello Lajolo
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In this paper we propose a hardware real time operating system (HW-RTOS) that implements the OS layer in a dual-processor SMP architecture. Intertask communication is specified by means of dedicated APIs and the HW-RTOS takes care of the communication requirements of the application and also implements the task scheduling algorithm. The HW-RTOS allows to have smaller footprints, since it avoids the need to link to the final executables traditional software RTOS libraries. Moreover, the HW-RTOS is able to exploit the easy task migration feature provided by an SMP architecture much more efficiently than a traditional software RTOS, due to its faster execution and we show how this significantly overcomes the performance achievable with optimal static task partitioning among two processors. Preliminary results show that the hardware overhead in a dual processor architecture is less than 20K gates.
Adaptive Multi-levels Dictionaries and Singular Value Decomposition Techniques for Autonomic Problem Determination
Authors: Hoi Chan, Thomas Kwok
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose such a system using dynamic and adaptive multi-levels dictionaries and "Singular Value Decomposition techniques" (SVD). Compared to standard SVD, our system uses an iterative method that enables dynamic interaction between events and the current dictionaries with its entries being updated continuously to reflect relative importance of each event, thereby accelerating its convergence. The system captures knowledge in a hierarchical form for complex knowledge representation. It does not require a formal knowledge model or intensive training by examples. It is efficient with sufficient accuracy for autonomic problem determination.
Subdivision Interpolating Polygonization of Implicit Surfaces with Normal Meshes
Authors: Mingyong Pang, Zhigeng Pan, Jie Tang, Fuyan Zhang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Normal mesh is a new fundamental surface descrip-tion, which is multiresolution mesh where each level can be written as a normal offset from a coarser version. In this paper, we present an algorithm to create normal subdivision triangulations approxi-mating implicit surfaces. Our algorithm begins from a coarse base mesh created by a space-division based polygonization method for implicit surface, and the base mesh is then optimized by Laplacian smoothing operator. Subsequently, the faces of the base mesh are subdivided iteratively and the newly created vertices are located on the implicit surface along a certain direction, which depends on the normals of vertices of the faces. Finally, we obtain a piecewise-linear appro-ximation of the surface, which is a normal mesh with subdivision connectivity and provides a multi-resolution description of the implicit surface naturally. Under the same error restriction, the mesh has much fewer data with respect to the traditional polygoniza-tion algorithms.
Implicit decimation for FIR systems and its application to acoustic echo cancellation
Authors: W. A. Frank
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents a filter structure which performs implicit decimation of the impulse response. As a result, the number of required operations is reduced or, equivalently, the impulse response length of the filter can be increased. Analysis in the frequency domain shows that this implicit decimation can be applied to systems that exhibit low-pass characteristics or have a smooth transfer function at high frequencies. Such behaviour can be assumed for many technical systems. For the determination of the optimal coefficients many well known algorithms for FIR systems can be used after a slight modification of the signal vector. The performance of implicit decimation is demonstrated for acoustic echo cancellation. Comparison with different algorithms shows that implicit decimation outperforms conventional FIR filtering.
Establishing Tap Reliability in Expert Witness Testimony: Using Scenarios to Identify Calibration Needs
Authors: Barbara E. Endicott-Popovsky, J. D. Fluckiger, Deborah A. Frincke
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

A means to establish a level of soundness for low-layer network devices is important to support in-house organizational investigations that pursue legal remedies. Those providing expert testimony must be able to speak competently to the reliability of these devices in order to establish confidence in the accuracy and completeness of the data they collect; however, manufacturers rarely provide conclusive information about performance to a degree that will survive legal challenge. This paper applies a model for creating calibration test suites, developed in [1], to several misuse and defense-against-negligence scenarios in order to create appropriate calibration tests. The insights gained result in recommendations for a calibration regime for forensic aggregator taps that will ready them for supporting expert testimony.
Identifying Malicious Peers Before It's Too Late: A Decentralized Secure Peer Sampling Service
Authors: Gian Paolo Jesi, David Hales, Maarten van Steen
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Many unstructured peer to peer (P2P) systems rely on a Peer Sampling Service (PSS) that returns randomly sampled nodes from the population comprising the system. PSS protocols are often implemented using "gossiping" approaches in which connected nodes exchange their links in a randomized way. However, such services can be defeated easily by malicious nodes executing "hub attacks" which distort the PSS such that all nodes in the network, ultimately, only gain access to malicious nodes. From this leading status - i.e. being a "hub" - the malicious nodes can affect the overlay in several ways, ranging from total network disruption to obtaining an application dependent advantage. We present a completely distributed defense against such attacks and give results from simulation experiments. The approach is generic as it is independent of the adopted PSS implementation.
A primer of legal issues for software engineering education
Authors: R. L. Upchurch
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Software engineering education has evolved over the past ten years as our understanding of the issues related to the practice of developing software systems has increased. Part of that evolution is an increased appreciation for the diverse body of knowledge software developers must possess. Learning software development skills requires more than merely participating in design projects and managing technical details. Design projects provide a context within which the social and technical aspects of software engineering become visible, yet the legal issues involved in software engineering may not be fully addressed. This lack of coverage of legal issues is the result of the fragmented placement of topics in the curriculum. We are addressing this failure by constructing modules, consisting of scenarios, for our software engineering course to cover the critical legal issues with which our students need to be familiar. These modules can be used independently of particular courses. The first modules are covered, and include 1) intellectual property, 2) privacy, and 3) theories of liability. We describe the importance of legal topics in software engineering education, offer a preliminary view of the content of the modules, provide an overview of the scenario construction strategy, and provide a glimpse into the methods we use to refine the scenarios we develop.
Evaluation of Algorithms for Tracking Multiple Objects in Video
Authors: A. G. Amitha Perera, Anthony Hoogs, Chukka Srinivas, Glen Brooksby, Wensheng Hu
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

As video tracking research matures, the issue of tracker performance evaluation has emerged as a research topic in its own right, as evidenced by a series of workshops devoted solely to this purpose (the workshops on Performance Evaluation of Tracking and Surveillance PETS). However, evaluations such as PETS have been limited to small scenarios with a handful of moving objects. In this paper, we present an evaluation methodology and set of experiments focused on large-scale video tracking problems with hundreds of objects in close proximity. The scale and complexity of this data exposes a number of issues. First, the association of computed tracks to image-truth tracks may have multiple plausible solutions, resulting in a combinatorial grouping problem that must be solved with an approximate solution. Second, computed tracks may be only partially correct, complicating the association problem further and indicating that multiple measures are required to characterize performance. We have created a system that associates computed tracks to manually-generated image-truth tracks, and calculates various measures such as the per-frame probability of detection, false alarm rate, and fragmentation, which is the number of computed tracks associated to a single track. We also normalize fragmentation by track length to reward fewer computed tracks for longer true tracks. The measures were used to compare three tracking methods on an aerial video sequence containing hundreds of objects, long occlusions, and deep shadows.
Adaptive Index Coding Scheme for VQ Indices Compression
Authors: K. Somasundaram, S. Domnic
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

An efficient lossless coding scheme to encode Vector Quantization (VQ) indices is presented in this paper. In our scheme, we have designed a new coding model based on the schemes proposed in the previous works. The computational complexity of the method is quite low and its memory requirement is small. So that it can be implemented in hardware. The experimental results show that the proposed scheme gives better compression than existing lossless index coding schemes.
Bypassing Data Execution Prevention on MicrosoftWindows XP SP2
Authors: Nenad Stojanovski, Marjan Gusev, Danilo Gligoroski, Svein. J. Knapskog
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The evolution of Microsoft Windows from a desktop operating system into a server operating system has brought attention to and concern of some severe security issues. Attacks that exploited buffer overflows started appearing for the services that were used on the new server operating system. Recently, Microsoft decided to implement a protective measure: Data Execution Prevention - DEP in two of their products: Service Pack 2 for Windows XP and Service Pack 1 for Windows 2003. The measure has been implemented as one of the core security mechanisms with the intention to prevent the attackers from breaking into the system i.e., to prevent the execution of code in non-executable memory regions. In this paper we show that the initial implementation of the software for DEP in Windows XP Service Pack 2 is actually not at all secure and that stack overflow attacks against DEP are as effective as attacks against systems that do not have DEP.
Building a pseudo object-oriented very low bit-rate video coding system from a modified optical flow motion estimation algorithm
Authors: Chung-Wei Ku
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

A modified optical flow algorithm (MOFA) is proposed for the development of a very low bit-rate video coding system. Another edge preserving constraint and pyramid approach are suggested to generate an accurate motion field and reduce the possibility of being trapped in a local minimum. Post-processing schemes are also designed to eliminated the problems for special regions. Compared with other motion estimation algorithms, the proposed method gives a more exact estimation in terms of the PSNR and subjective view. The arbitrarily shaped transform of the motion field is then selected to further remove the spatial redundancy. According to some primary simulation results, most of the test sequences are compressed into 16 kbps or lower with excellent picture quality.
KHEPERA: a system for rapid implementation of domain specific languages
Authors: Rickard E. Faith, Lars S. Nyland, Jan F. Prins
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

The KHEPERA system is a toolkit for the rapid implementation and long-term maintenance of domain specific languages (DSLs). Our viewpoint is that DSLs are most easily implemented via source-to-source translation from the DSL into another language and that this translation should be based on simple parsing, sophisticated tree-based analysis and manipulation, and source generation using pretty-printing techniques. KHEPERA emphasizes the use of familiar, pre-existing tools and provides support for transformation replay and debugging for the DSL processor and end-user programs. In this paper, we present an overview of our approach, including implementation details and a short example.
Hardware-Assisted Scanning for Signature Patterns in Image File Fragments
Authors: Yoginder S. Dandass
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The ability to detect fragments of deleted image files and to reconstruct these image files from all available fragments on disk is an important activity in the field of digital forensics. Although reconstruction of image files from the file fragments on disk can be accomplished by simply comparing the content of sectors on disk with the content of known files, this brute-force approach can be time consuming. This paper presents results from research into the use of field programmable gate arrays (FPGAs) in detecting specific image file byte patterns in disk clusters. Unique identifying pattern for each disk sector is compared against patterns in known images. A pattern match indicates the potential presence of an image and flags the disk sector for further in-depth examination to confirm the match. The FPGA-based implementation outperforms the software implementation by a significant margin.