ppxscal/embedding_network huggingface dataset:
2-D affine generalized fractional Fourier transform
Authors: Jian-Jiun Ding
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

The 2-D Fourier transform has been generalized into the 2-D separable fractional Fourier transform (replaces the 1-D Fourier transform by the l-D fractional Fourier transform for each variable) and the 2-D separable canonical transform (further replaces the fractional Fourier transform by canonical transform) of Sahin, Ozaktas and Mendlovic (see Appl. Opt., vol.37, no.11, p.2130-41, 1998). It also has been generalized into the 2-D unseparable fractional Fourier transform with 4 parameters of Sahin et al. (see Appl. Opt., vol.37, no.23, p.5444-53, 1998). In this paper, we introduce the 2-D affine generalized fractional Fourier transform (AGFFT). These 2-D transforms has been further generalized. We show it can deal with many problems that can not be dealt with by these 2-D transforms and extend their utility.
Selective direction finding for cyclostationary signals by exploitation of new array configuration
Authors: Minli Yao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

This paper presents a new cyclic direction-of-arrival (DOA) estimation algorithm. By exploiting a new minimum-redundancy linear array (MRLA) configuration and cyclostationarity, the proposed algorithm constructs a matrix pencil from the pseudo-data matrix of 2N-1 virtual sensors, which are the results of temporal and spatial processing with designed M-sensor Sum-MRLA. Theoretical analysis and computer simulations show that, for each cyclic frequency, the algorithm can estimate 2N-2 DOAs with M-sensor Sum-MRLA (N>M).
A novel adaptive step size control algorithm for adaptive filters
Authors: S. Koike
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A novel adaptive step size control algorithm is proposed, in which the step size is approximated to the theoretically optimum value via leaky accumulators, realizing quasi-optimal control. The algorithm is applicable to most of the known tap weight adaptation algorithms. Analysis yields a set of difference equations for theoretically calculating expected filter convergence, and derives residual mean squared error (MSE) after convergence in a formula explicitly solved. Experiments with some examples prove that the proposed algorithm is highly effective in improving the convergence rate. The theoretically calculated convergence is shown to be in good agreement with that obtained through simulations.
Visual speech recognition using active shape models and hidden Markov models
Authors: J. Luettin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper describes a novel approach for visual speech recognition. The shape of the mouth is modelled by an active shape model which is derived from the statistics of a training set and used to locate, track and parameterise the speaker's lip movements. The extracted parameters representing the lip shape are modelled as continuous probability distributions and their temporal dependencies are modelled by hidden Markov models. We present recognition tests performed on a database of a broad variety of speakers and illumination conditions. The system achieved an accuracy of 85.42% for a speaker independent recognition task of the first four digits using lip shape information only.
MICROCAST: smart card based (micro)pay-per-view for multicast services
Authors: Josep Domingo-Ferrer, Antoni Martínez-Ballesté, Francesc Sebé
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

With the increased availability of broadband fixed and mobile communications, multicast content delivery can be expected to become a very important market. Especially for wireless multicast delivery, it is important that payment collection be fine-grain: the customer should pay only for the content that she actually consumes. This can be achieved by using pay-per-view based on micropayments. This paper proposes the first method for enabling pay-as-you-watch services in a multicast content delivery environment. On the customer's side, micropayment generation is implemented in a smart card which can be plugged into the customer's receiving device (computer, digital video receiver, PDA, mobile phone, etc.). Micropayment collection and verification are distributed among multicast routers, which avoids bottlenecks inherent to many-to-one payment transmission.
Measuring and managing the remote client perceived response time for web transactions using server-side techniques
Authors: Jason Nieh
Venue:  (2006)

As businesses continue to grow their dependence on the World Wide Web, it is increasingly vital for them to accurately measure and manage response time of their Web services. This dissertation shows that it is possible to determine the remote client perceived response time for Web transactions using only server-side techniques and that doing so is useful and essential for the management of latency based service level agreements. First, we present Certes, a novel modeling algorithm, that accurately estimates connection establishment latencies as perceived by the remote clients, even in the presence of admission control drops. We present a non-linear optimization that models this effect and then we present an O(c) time and space online approximation algorithm. Second, we present ksniffer, an intelligent traffic monitor which accurately determines the pageview response times experienced by a remote client without any changes to existing systems or Web content. Novel algorithms for inferring the remote client perceived response time on a per pageview basis are presented which take into account network loss, RTT, and incomplete information. Third, we present Remote Latency-based Management (RLM), a system that controls the latencies experienced by the remote client by manipulating the packet traffic into and out of the Web server complex. RLM tracks the progress of each pageview download in real-time, as each embedded object is requested, making fine grained decisions on the processing of each request as it pertains to the overall pageview latency. RLM introduces fast SYN and SYN/ACID retransmission and embedded object rewrite and removal techniques to control the latency perceived by the remote client. We have implemented these mechanisms in Linux and demonstrated their effectiveness across a wide-range of realistic workloads. Our experimental results demonstrate for the first time that server-side response time measurements can be done in real-time at giga-bit traffic rates to within 5This is an order of magnitude better than common application-level techniques run at the Web server. Our results also demonstrate for the first time how both the mean and the shape of the per pageview client perceived response time distribution can be dynamically controlled at the server complex.
Uncovering Potential Attribute Relevance via MIA-Processing in Data Mining
Authors: Sam Chao, Yiping Li
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The purpose of a classification learning algorithm is to accurately and efficiently map an input instance to an output class label, according to a set of labeled instances. In which data preprocessing, especially feature selection (FS) and continuous feature discretization (CFD), are considered as the significant issues. Since the quality of the data highly affects the result of a learning problem. Especially in medical domain, symptoms are interacted with each other; a compound symptom always could reveal more accurate diagnostic results. Therefore, a useless attribute by itself may become potentially relevant by providing hidden supportive information to other attributes. In this paper, our MIA-Processing methods focus on uncovering hidden attributes relevance during FS and CFD. Our methods hence minimize the uncertainty and at the same time maximize the final classification accuracy. The empirical results demonstrate a comparison of performance of various classification algorithms on several real-life datasets from UCI repository.
Repeating earthquakes, episodic tremor and slip: Emerging patterns in complex earthquake cycles?: Research Articles
Authors: Wang-Ping Chen, Michael R. Brudzinski
Venue: Complexity (2007)

The lack of regularity in earthquake cycles continues to be a confounding issue in earthquake science. Lately, observations of episodic nonvolcanic tremor and slip (ETS) along a few well-instrumented tectonic plate boundaries are intriguing: these features recur together with predictable time intervals. Data now trace recurring ETS back to 1990 and no significant earthquake ever followed an ETS episode. This observation and the fact that stress drops associated with episodic slips are low, only on the order of 0.01 MPa, suggests that repeated ETS has little cumulative effects in priming the fault for the next large earthquake. Another known regularity in seismic activity is the so-called repeating earthquakes that rupture the same patch of fault repetitively. Current hypotheses for repeating earthquakes point to the interaction of continual, aseismic fault slip with locked, seismogenic patches of the fault. Interestingly, ETS also recur near where the transition between brittle faulting and plastic flow is expected, although it is not clear how and why regularities in space and time are interconnected. New data show that ETS recurs throughout the entire length of the Cascadia subduction zone, thus ruling out any special, local factors as necessary conditions for ETS. Recurrence intervals of ETS vary along the Cascadia. Such variations are not governed by the rate of plate motion that ultimately drives the earthquake process, but they do coincide with variations in the geology of the overriding plate that can influence the rheology along the plate interface. To this end, we call attention to the Portevin-Le Chatelier effect (PLC, or jerky flow) as a potential analog to the earthquake process. The dynamics of the PLC has been extensively studied and shows many intriguing features as the system goes from chaotic to self-organized critical regimes as strain rate increases. In particular, the PLC exhibits not only stick-slip behavior (stress serration) over time but also spatial interactions over extended regions&mdash;features that are necessary to account for complex spatio-temporal variations associated with earthquake activities. &copy; 2007 Wiley Periodicals, Inc. Complexity 12: 33&ndash;43, 2007 This paper was submitted as an invited paper resulting from the &ldquo;Understanding Complex Systems&rdquo; conference held at the University of Illinois-Urbana Champaign, May 2005
Integrating component cues for human pose tracking
Authors: F. Mokhtarian, R. Nevatia
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

Tracking human body pose in monocular video in the presence of image noise, imperfect foreground extraction and partial occlusion of the human body is important for many video analysis applications. Human pose tracking can be made more robust by integrating the detection of components such as face and limbs. We proposed an approach based on data-driven Markov chain Monte Carlo (DD-MCMC) where component detection results are used to generate state proposals for pose estimation and initialization. Experimental results on a realistic indoor video sequence show that the method is able to track a person during turning and sitting movements.
Analysis of the Linux Kernel Evolution Using Code Clone Coverage
Authors: Simone Livieri, Yoshiki Higo, Makoto Matsushita, Katsuro Inoue
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Most studies of the evolution of software systems are based on the comparison of simple software metrics. In this paper, we present our preliminary investigation of the evolution of the Linux kernel using code-clone analysis and the code-clone coverage metrics. We examined 136 versions of the stable Linux kernel using a distributed extension of the code clone detection tool CCFinder. The result is shown as a heat map.
Performance of input devices in FPS target acquisition
Authors: Poika Isokoski, Benoît Martin
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

We evaluated the performance of a wheel mouse, an XBox360 controller, the combination of a mouse and a keyboard, and a Trackmouse in FPS target acquisition. The device combinations where mouse was used for aiming performed better than the Xbox360 controller.
Improving packet delivery efficiency using multi-radio diversity in wireless lans
Authors: Hari Balakrishnan
Venue:  (2006)

Data transmissions in Wireless Local Area Networks (WLANs) often suffer front bit errors that arise front the notoriously complex and time-varying signal propagation characteristics of the wireless medium. A number of physical factors such as attenuation and multi-path are prevalent indoors and can lead to high bit-error rates at the link layer. These in turn lead to packet losses, low throughput, and higher and more variable packet latencies observed at higher layers, degrading the performance of many delay-sensitive and traffic-intensive wireless applications such as games, file-sharing, voice-over-IP, and streaming video. We use the notion of path diversity to develop an approach that improves data delivery efficiency and throughput in presence of transmission errors. Path diversity relies on multiple access points (APs) covering a given area or multiple radios on the user's device (or both). The hypothesis underlying this system is as follows: because frame errors are often path-dependent (e.g., due to multi-path fading), location-dependent (e.g., clue to noise), and statistically independent between different transmitting radios, transmissions are likely to succeed from at least one of the available transmitters (transmit diversity). Likewise, multiple radios that all receive versions of the same transmission may together be able to correctly recover a frame, even when any given individual radio is not (receive diversity). Using these principles, we design and implement the Multi-Radio Diversity (MRD) system, which leverages the properties of path diversity at the transmitter and receiver to reduce frame loss rates in the link-layer, leading to increased throughput and packet delivery efficiency. We introduce several techniques that make path selection, retransmission, and rate adaptation work efficiently in a MRD system based on the 802.11 MAC. We used commodity PCs and wireless interfaces to build a MRD system and conducted a wide range of indoor experiments. Our experiments measured throughput gains up to three times over conventional schemes without consuming much extra wireless bandwidth. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Offline compression for on-chip ram
Authors: Nathan Dean Cooprider, John David Regehr
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

We present offline RAM compression, an automated source-to-source transformation that reduces a program's data size. Statically allocated scalars, pointers, structures, and arrays are encoded and packed based on the results of a whole-program analysis in the value set and pointer set domains. We target embedded software written in C that relies heavily on static memory allocation and runs on Harvard-architecture microcontrollers supporting just a few KB of on-chip RAM. On a collection of embedded applications for AVR microcontrollers, our transformation reduces RAM usage by an average of 12%, in addition to a 10% reduction through a dead-data elimination pass that is also driven by our whole-program analysis, for a total RAM savings of 22%. We also developeda technique for giving developers access to a flexible spectrum of tradeoffs between RAM consumption, ROM consumption, and CPU efficiency. This technique is based on a model for estimating the cost/benefit ratio of compressing each variable and then selectively compressing only those variables that present a good value proposition in terms of the desired tradeoffs.
Preprocessing for Accelerating Convergence of Repulsive-Particle Systems for Sampling Implicit Surfaces
Authors: Masafumi Oka, Susumu Nakata, Satoshi Tanaka
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

Recently repulsive-particle systems have been used as convenient tools for homogeneously distributing particles over an implicit surface. However, the deathand- split scheme of particles makes the convergence of the systems much slow, if the system includes a large number of particles. To avoid the use of the death-andsplit scheme, we propose a novel preprocessing technique to tune an initial state of the particle systems. The preprocessing can make initial particle density either uniform or non-uniform. Then an excellent initial state is realized for the particle systems, and the death-and-split scheme becomes unnecessary. Therefore our preprocessing accelerates convergence of the particle systems noticeably keeping the number of particles constant. It also leads to uniform inter-particle distances in the final convergent state. Moreover our preprocessing is fast, easy to implement, and enables the particle systems to handle several hundreds of thousand particles.
Pipeline processor for fast architecture oriented regular DCT-IDCT algorithm
Authors: D. Akopian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

New architecture oriented regular algorithms are proposed for the discrete cosine transform (DCT), used in DSP problems, with a simple data shuffling pattern similar to the Cooley-Tukey FFT algorithm. One can easily extend many of parallel FFT approaches for these algorithms. The only pipeline structure with logN-1 arithmetic units and transform time of order O(N) is considered. It is simpler than the known pipeline structures.
On-line alert systems for production plants: A conflict based approach
Authors: Thomas D. Nielsen, Finn V. Jensen
Venue: International Journal of Approximate Reasoning (2007)

We present a new methodology for detecting faults and abnormal behavior in production plants. The methodology stems from a joint project with a Danish energy consortium. During the course of the project we encountered several problems that we believe are common for projects of this type. Most notably, there was a lack of both knowledge and data concerning possible faults, and it therefore turned out to be infeasible to learn/construct a standard classification model for doing fault detection. As an alternative we propose a method for doing on-line fault detection using only a model of normal system operation. Faults are detected by measuring the conflict between the model and the sensor readings, and knowledge about the possible faults is therefore not required. We illustrate the proposed method using real-world data from a coal driven power plant as well as simulated data from an oil production facility.
On learning and computational complexity of FIR radial basis function networks. Part II. Complexity measures
Authors: K. Najarian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

For pt. I see ibid., vol.II, p.1321-4(2001). Recently, the complexity control of dynamic neural models has gained significant attention from the signal processing community. The performance of such a process depends highly on the applied definition of "model complexity", i.e. complexity models that give simpler networks with better model accuracy and reliability are preferred. The learning theory creates a framework to assess the learning properties of models. These properties include the required size of the training samples as well as the statistical confidence over the model. In this paper, we apply the learning properties of two families of FIR radial basis function networks (RBFN) to introduce new complexity measures that reflect the learning properties of such neural models. Then, based on these complexity terms, we define cost functions, which provide a balance between the training and testing performances of the model, and give desirable levels of accuracy and confidence.
Video genre classification using dynamics
Authors: M. J. Roach
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The problem addressed here is the classification of videos at the highest level into pre-defined genre. The approach adopted is based on the dynamic content of short sequences (/spl sim/30 secs). This paper presents two methods of extracting motion from a video sequence: foreground object motion and background camera motion. These dynamics are extracted, processed and applied to classify 3 broad classes: sports, cartoons and news. Experimental results for this 3 class problem give error rates of 17%, 8% and 6% for camera motion, object motion and both combined respectively, on /spl sim/30 second sequences.
Plug'n Simulate
Authors: Jan Himmelspach, Adelinde M. Uhrmacher
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Developments in simulation systems, e.g. new simulators, partitioning algorithms, modeling formalisms, or specialized user interfaces, often implies the realization of entire simulation systems from scratch. This requires significant efforts, and, in addition, it hampers the evaluation of the results achieved. The proposed Plug'n simulate concept enables developers to integrate their ideas into an existing framework and thus eases the development and the evaluation of results.
A mini challenge: build a verifiable filesystem
Authors: Rajeev Joshi, Gerard J. Holzmann
Venue: Formal Aspects of Computing (2007)

We propose tackling a &#x201c;mini challenge&#x201d; problem: a nontrivial verification effort that can be completed in 2&#x2013;3&#x00a0;years, and will help establish notational standards, common formats, and libraries of benchmarks that will be essential in order for the verification community to collaborate on meeting Hoare&#x2019;s 15-year verification grand challenge. We believe that a suitable candidate for such a mini challenge is the development of a filesystem that is verifiably reliable and secure. The paper argues why we believe a filesystem is the right candidate for a mini challenge and describes a project in which we are building a small embedded filesystem for use with flash memory.
EPICS: documenting service-learning to meet EC 2000
Authors: L. H. Jamieson
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Engineering Projects in Community Service-EPICS-is a service-learning program that was initiated at Purdue University (USA) in the Fall of 1995. Under this program, undergraduate students in engineering earn academic credit for long-term team projects that solve technology-based problems for local community service organizations. The program has grown to include 20 project teams with approximately 300 students participating each semester during the 2000-01 academic year. With its emphasis on start-to-finish design of significant projects that will be deployed by the community customers, EPICS addresses many of the program outcomes mandated for ABET accreditation. In this paper, the authors outline the procedures and documentation that have been developed to assess and track student outcomes in the EPICS courses.