ppxscal/embedding_network huggingface dataset:
Modulated filter banks and wavelets-a general unified theory
Authors: R. A. Gopinath
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper generalizes and unifies well-known results on modulated filter banks (MFBs) and modulated wavelet tight frames (MWTFs). It classifies MFBs based on the discrete cosine or sine transforms that they are associated with. By proper choice of the form of modulation the perfect reconstruction (PR) conditions are seen to be (surprisingly) identical for all classes of MFBs. This has the interesting consequence that optimal MFB prototype designs can be shared across MFB classes. For some classes of MFBs associated MWTFs do not exist, while for others they do. The results cover both orthogonal and biorthogonal MFBs; and the filters could be arbitrary sequences in l/sup 2/(Z).
GPU-based rendering and animation for Chinese painting cartoon
Authors: Manli Yuan, Xubo Yang, Shuangjiu Xiao, Zheng Ren
Venue: Proceedings of Graphics Interface 2007 (2007)

This paper presents a real-time rendering system for generating a Chinese ink-and-wash cartoon. The objective is to free the animators from laboriously designing traditional Chinese painting appearance. The system constitutes a morphing animation framework and a rendering process. The whole rendering process is based on Graphic Process Unit (GPU), including interior shading, silhouette extracting and background shading. Moreover, the morphing framework is created to automatically generate Chinese painting cartoon from a set of surface mesh models. These techniques can be applied to real-time Chinese style entertainment application.
Numerical studies of flow around aircraft using the multiprocessor computer systems
Authors: A. E. Lutskii, A. S. Chernoguzov
Venue: Automation and Remote Control (2007)

The topical problems of the computational aerodynamics were described. Consideration was given to the realization of algorithms on the multiprocessor computer systems. Difficulties arising with such problems were described. Examples of numerical modeling of some problems were presented.
High-accuracy connected digit recognition for mobile applications
Authors: S. K. Gupta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We present a connected digit recognition system with low storage and computational complexity which achieves good performance in car noise. Our system uses the TI-DIGITS database with additive car noise for training whole-word digit and background models. A digit accuracy of 96.1% is obtained on a 15-speaker database collected in a car using an open microphone with an average SNR of approximately 2 dB. There is a further error reduction of almost 35% if the top two candidate strings are considered using a traceback based N-best algorithm. The system can be implemented on a currently available fixed-point DSP chip. We show that significant performance improvements are obtained by using two-level cepstral mean subtraction (CMS), gender-dependent models and a decoding grammar constraining the possible lengths of digit strings.
Designing an experiment-a case study in student learning
Authors: P. D. Fisher
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper describes a methodology for students to learn how to design an experiment in their first electric circuits laboratory course. It focuses on, the process students would use to design and conduct experiments when experimental error or inaccuracies in the physical model cannot be ignored. Students learn that understanding and minimizing discrepancies between theoretical models and laboratory results becomes an iterative learning process. At the completion of any cycle, the current discrepancies between the current model-i.e., hypothesis-and the experimental results are known. A new hypothesis is then constructed which is intended to explain these discrepancies. In turn, a new set of experiments is designed to test the validity of this new hypothesis. Knowledge acquired by students during one cycle is then used to guide the student-learning process in the next cycle. The ultimate goal is not to ensure that no discrepancies exist but rather that the student adequately understands their origin and that a plan could be implemented to reduce them still further if necessary.
Approximation algorithms for budgeted learning problems
Authors: Sudipto Guha, Kamesh Munagala
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We present the first approximation algorithms for a large class of budgeted learning problems. One classicexample of the above is the budgeted multi-armed bandit problem. In this problem each arm of the bandithas an unknown reward distribution on which a prior isspecified as input. The knowledge about the underlying distribution can be refined in the exploration phase by playing the arm and observing the rewards. However, there is a budget on the total number of plays allowed during exploration. After this exploration phase,the arm with the highest (posterior) expected reward is hosen for exploitation. The goal is to design the adaptive exploration phase subject to a budget constraint on the number of plays, in order to maximize the expected reward of the arm chosen for exploitation. While this problem is reasonably well understood in the infinite horizon discounted reward setting, the budgeted version of the problem is NP-Hard. For this problem and several generalizations, we provide approximate policies that achieve a reward within constant factor of the reward optimal policy. Our algorithms use a novel linear program rounding technique based on stochastic packing.
A backtracking framework for beowulf clusters with an extension to multi-cluster computation and sat benchmark problem implementation
Authors: Jerome Paul
Venue:  (2006)

The main topic of this dissertation involves cluster-based computing, specifically relating to computations performed on Beowulf clusters. I have developed a light-weight library for dynamic interoperable message passing, called the InterCluster Interface (ICI). This library not only supports computations performed over multiple clusters that are running different Message Passing Interface (MPI) implementations, but also can be used independently of MPI. In addition I developed the Backtracking Framework (BkFr) that simplifies implementations of the parallel backtracking paradigm in the single cluster environment, and supports the extension of computations over multiple clusters. BkFr uses MPI for the intra-cluster communication and ICI for the inter-cluster communication. I have also developed a template-based library of programming modules that facilitate the introduction of the rapidly emerging message passing parallel computing paradigm in upper-division undergraduate courses. An important application of ICI and the backtracking framework discussed in this dissertation is the computation of Van der Waerden numbers, which involve the existence of arithmetic progressions in arbitrary partitions of {1, 2, ..., n} for sufficiently large n. The computations of these numbers utilized a special SAT solver that I developed. For example, I almost doubled the previously known lower bound for the Van der Waerden number W(2, 6), and I am running a calculation whether the lower bound is actually the exact value. Among other reductions, I was able to drastically reduce the search for potential solutions with the aid of a tunneling technique based on an aggressive addition of uninferred constraints. The tunneling technique has the likely potential to be used in a number of other satisfiability settings. I also developed an FPGA version of my SAT solver for Van der Waerden numbers that improved the search speed up to 230 times or more compared to its sequential equivalent. Utilizing this special SAT solver has resulted in significant progress in the search to determine bounds or exact values for Van der Waerden numbers and, more generally, for Van der Waerden subnumbers. I have found the exact values for several of these subnumbers, specifically W(2; 5,6)=206, W(2; 4,8)=146, W(2; 3,16)=238 and W(3; 2,4,7)=119.
A single-carrier frequency-domain SDMA basestation
Authors: P. Vandenameele
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Two major technical challenges in the design of future broadband wireless networks are the impairments of the propagation channel and the need for spectral efficiency. We previously proposed a combined OFDM/SDMA approach that mitigates the channel impairments by orthogonal frequency division multiplexing (OFDM) with cyclic prefix insertion and that achieves a high spectral efficiency by space division multiple access (SDMA). However, because of the multicarrier modulation, this approach requires high-backoff power amplifiers in the analog frontend. We present a SC-FD-SDMA basestation, which avoids these expensive amplifiers by using constant-envelope single-carrier (SC) modulation and still features the advantages of frequency-domain (FD) multipath mitigation and SDMA. We pay special attention to the initialization of such basestation and its fixed point requirements, since they are critical aspects of any realistic implementation. A case-study shows how SC-FD-SDMA enables a 100 Mbps wireless LAN with a bandwidth efficiency of 8 bps/Hz and an uncoded BER of 10/sup -3/ at 13.5 dB.
Spatial and temporal filtering in a low-cost MPEG bit rate transcoder
Authors: A. Morel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The MPEG bit-rate transcoder with motion compensation, MC-BRT, that exactly derives from a simplified synchronized decoder/encoder cascade, is considered. Such a transcoder is cost effective but lacks features such as spatial and temporal filtering. These features are known to improve the encoder performance at low bit-rates. Such features would be highly desirable in the MC-BRT since most applications now involve critical bit-rates. This paper shows that spatial and motion compensated temporal filtering can be implemented in the MC-BRT at a negligible cost. The filters are analyzed and control variables are given. Simulations reveal the efficiency of the method in terms of noise reduction as well as its great impact on image quality.
Domains of concern in software architectures and architecture description languages
Authors: Nenad Medvidovic, David S. Rosenblum
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

Software architectures shift the focus of developers from lines-of-code to coarser-grained elements and their interconnection structure. Architecture description languages (ADLs) have been proposed as domain-specific languages for the domain of software architecture. There is still little consensus in the research community on what problems are most important to address in a study of software architecture, what aspects of an architecture should be modeled in an ADL, or even what an ADL is. To shed light on these issues, we provide a framework of architectural domains, or areas of concern in the study of software architectures. We evaluate existing ADLs with respect to the framework and study the relationship between architectural and application domains. One conclusion is that, while the architectural domains perspective enables one to approach architectures and ADLs in a new, more structured manner, further understanding of architectural domains, their tie to application domains, and their specific influence on ADLs is needed.
Dynamic Supply Chain Integration through Intelligent Agents
Authors: Minhong Wang, Huaiqing Wang, Jiming Liu
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The success of supply chains depends on the match between the requirements and offerings that deliver the services. It can be ensured by separating requirements from the means of realization as well as dynamically assigning available resources to requests. To achieve this, we need coordinate the flow of information among the services and link their business processes under various constraints. Existing approaches to this problem have relied on complete information of services and resources, and have failed to adequately address the dynamics and uncertainties of the operating environments. The problem is complicated as a result of undetermined requirements of decomposed individual services and unpredictable solutions contributed by service providers. This paper examines an agent-mediated coordination approach to dynamic supply chain integration. Each agent works as a broker for each service involved in the chain, exploring service requests as well as identifying suitable resources for achieving compatibility and coherence among the decisions of individual services. Based on the approach, a prototype has been implemented with simulated experiments highlighting the effectiveness of the approach.
A theoretical and experimental performance study of a root-MUSIC algorithm based on a real-valued eigendecomposition
Authors: M. Pesavento
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A real-valued (unitary) formulation of the popular root-MUSIC direction-of-arrival (DOA) estimation technique is considered. This unitary root-MUSIC algorithm is shown to reduce the computational complexity in the eigenanalysis stage of root-MUSIC, because it exploits the eigendecomposition of a real-valued covariance matrix. Theoretical, numerical, and experimental results are presented showing that, additionally, unitary root-MUSIC has improved threshold and asymptotic performances relative to conventional root-MUSIC. It can be then recommended that the former technique should always be preferred to the conventional root-MUSIC algorithm.
Audio coding using the wavelet packet transform and a combined scalar-vector quantization
Authors: S. Boland
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper investigates a hybrid scalar-vector quantization scheme for coding high quality audio signals. A wavelet packet transform (WPT) is used to decompose the audio signal into frequency bands slightly finer than the critical band divisions. A masking model computation is then used as input to the hybrid quantization scheme, where scalar quantization is used for coding the subbands from 0-5.5 kHz, and vector quantization is used for coding the subbands from 5.5-22 kHz. The performance of the proposed coder is assessed from segmental signal-to-noise ratios (SNR) and the perceived quality for a number of signals. The perceived quality is determined from informal comparisons between the uncoded signals at the original bitrate of 705 kb/s, and the same signals coded with (1) the proposed coder at 80 kb/s, (2) a coder using only scalar quantization at both 128 kb/s and 96 kb/s, and (3) the MPEG layer III coder at 64 kb/s. The comparisons indicate that a very good coder quality is possible with the proposed coder at bitrates of approximately 80 kb/s. This represents a saving of about 16 kb/s over full scalar quantization with a similar quality. Further bitrate reduction with the proposed coder is possible by entropy coding of the scalar quantized transform coefficients and the VQ indices.
Constant Approximation Algorithms for Rectangle Stabbing and Related Problems
Authors: Guang Xu, Jinhui Xu
Venue: Theory of Computing Systems (2007)

In this paper we present constant approximation algorithms for two NP-hard rectangle stabbing problems, called the weighted rectangle stabbing (WRS) problem and the rectangle stabbing with rejecting cost (RSRC) problem. In the WRS problem a set of axis-aligned rectangles is given, with each rectangle associated with a positive weight, and a set of weighted horizontal and/or vertical stabbing lines is sought so that each rectangle is intersected by at least one stabbing line with a weight (called cost) no less than that of the rectangle and the total cost (or weight) of all stabbing lines is minimized. In the RSRC problem each rectangle is associated with an additional positive rejecting cost and is required to be either stabbed by a stabbing line or rejected by paying its rejecting cost. For the WRS problem, we present a polynomial time 2e-approximation algorithm, where e is the natural logarithmic base. Our algorithm is based on a number of interesting techniques such as rounding, randomization, and lower bounding. For the RSRC problem, we give a 3e-approximation algorithm by using a simple but powerful LP rounding technique to identify those to-be-rejected rectangles. Our techniques are quite general and can be easily applied to several related problems, such as the stochastic rectangle stabbing problem and polygon stabbing problem from fixed directions. Algorithms obtained by our techniques are relatively simple and can be easily implemented for practical purpose.
Body Part Detection for Human Pose Estimation and Tracking
Authors: Mun Wai Lee, Ram Nevatia
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

Accurate 3-D human body pose tracking from a monocular video stream is important for a number of applications. We describe a novel hierarchical approach for tracking human pose that uses edge-based features during the coarse stage and later other features for global optimization. At first, humans are detected by motion and tracked by fitting an ellipse in the image. Then, body components are found using edge features and used to estimate the 2D positions of the body joints accurately. This helps to bootstrap the estimation of 3D pose using a sampling-based search method in the last stage. We present experiment results with sequences of different realistic scenes to illustrate the performance of the method.
AProSec: an Aspect for Programming Secure Web Applications
Authors: Gabriel Hermosillo, Roberto Gomez, Lionel Seinturier, Laurence Duchien
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Adding security functions in existing Web application servers is now vital for the IS of companies and organizations. Writing crosscutting functions in complex software should take advantage of the modularity offered by new software development approaches. With Aspect-Oriented Programming (AOP), separating concerns when designing an application fosters reuse, parameterization and maintenance. In this paper, we design a security aspect called AProSec for detecting SQL injection and Cross Scripting Site (XSS) that are common attacks in web servers. We experiment this aspect with the AspectJ language and the JBoss AOP framework. With this experimentation, we show the advantage of runtime platforms such as JBoss AOP for changing security policies at runtime. Finally, we describe related work on security and AOP.
Automated problem diagnosis in distributed systems
Authors: Barton P. Miller
Venue:  (2006)

Quickly finding the cause of software bugs and performance problems in production environments is a crucial task that currently requires substantial effort of skilled analysts. Our thesis is that many problems can be accurately located with automated techniques that work on unmodified systems and use little application knowledge for diagnosis. This dissertation identifies main obstacles for such diagnosis and presents a three-step approach for addressing them.First, we introduce self-propelled instrumentation, an execution monitoring approach that can be rapidly deployed on demand in a distributed system. We dynamically inject a fragment of code referred to as the agent into one of the application processes. The agent starts propagating through the system, inserting instrumentation ahead of the control flow in the traced process and across process and kernel boundaries. As a result, it obtains the distributed control flow trace of the execution. Second, we introduce a flow-separation algorithm, an approach for identifying concurrent activities in the system. In parallel and distributed environments, applications often perform multiple concurrent activities, possibly on behalf of different users. Traces collected by our agent would interleave events from such activities thus complicating manual examination and automated analysis. Our flow-separation algorithm is able to distinguish events from different activities using little user help.Finally, we introduce an automated root cause analysis approach. We focus on identification of anomalies rather than massive failures, as anomalies are often harder to investigate. Our techniques help the analyst to locate an anomalous flow (e.g., an abnormal request in an e-commerce system or a node of a parallel application) and to identify a function call in that flow that is a likely cause of the anomaly.We evaluated these three steps on a variety of sequential and distributed applications. Our tracing approach proved effective for low-overhead on-demand data collection across the process and kernel boundaries. Manual trace examination enabled us to locate the causes of two performance problems in a multimedia and a GUI application, and a crash in the Linux kernel. Our automated analyses enabled us to find the causes of four problems in the Score and Condor batch scheduling systems.
Designing effective DSP laboratory courses
Authors: D. L. Jones
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The multi-disciplinary nature of a DSP laboratory course makes it depend more heavily on the surrounding curriculum than many other courses. We argue that the most effective DSP laboratory courses are tailored to their specific curricula. Based on almost 15 years of experience in designing DSP laboratory courses for three different electrical and computer engineering (ECE) curricula at two different institutions, we present a general philosophy for designing DSP laboratory courses and evaluate our previous course designs as case studies.
Simultaneous speech segmentation and phoneme recognition using dynamic programming
Authors: R. S. Bajwa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

In this paper a dynamic programming algorithm for simultaneous speech segmentation and phoneme recognition is presented. Given a sequence of samples of an unknown speech pattern and a library of phonemes, this algorithm finds the best phonological match and, with a backtracking step, identifies the phoneme boundaries. This approach is different from a traditional two step process whereby first the phoneme boundaries are determined locally and then speech recognition is performed. Its advantage over the two step process is that incorrect phoneme boundaries due to slurring or sudden changes in the speech are reduced. Unlike other dynamic programming algorithms, it does not lend itself to systolic wavefront processing, hence an alternate parallel algorithm is presented.