ppxscal/embedding_network huggingface dataset:
Analysis of deformational transformations with spatio-temporal continuous wavelet transforms
Authors: J. Corbett
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper deals with the estimation of deformational parameters in discrete spatio-temporal signals. The parameters of concern correspond to time-varying scales. As such they can be the coefficients of either a Taylor expansion of the scale or a given deformational transformation. At first sight there are just a few deformational transformations that provide continuous wavelet transforms. The approach presented in this paper associates deformational transformations to motion transformations taking place in higher dimensional spaces and projected on the sensor plane. Then finding continuous wavelet transforms becomes much easier since numerous continuous wavelet transforms have already been defined for motion analysis. It is also known that spatio-temporal continuous wavelet transforms provide minimum-mean-squared-error estimates of motion parameters. Any deformational transformation of features embedded in a spatio-temporal signal may always be related to the projection on the sensor plane of the motion of a rigid object taking place in a higher dimensional space. This reasoning applies conversely. The associated rigid motion may be actual or virtual may take place either on a flat space or on a curved space immersed in higher dimensions. Continuous wavelet transforms for the estimation of deformational parameters may be then deduced from those already existing in motion analysis.
Automatic inference of optimizer flow functions from semantic meanings
Authors: Erika Rice Scherpelz, Sorin Lerner, Craig Chambers
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Previous work presented a language called Rhodium for writing program analyses and transformations, in the form of declarative flow functions that propagate instances of user-defined dataflow fact schemas. Each dataflow fact schema specifies a semantic meaning, which allows the Rhodium system to automatically verify the correctness of the user's flow functions. In this work, we have reversed the roles of the flow functions and semantic meanings: rather than checking the correctness of the user-written flow functions using the facts' semantic meanings, we automatically infer correct flow functions solely from the meanings of the dataflow fact schemas. We have implemented our algorithm for inferring flow functions from fact schemas in the context of the Whirlwind compiler, and have used this implementation to infer flow functions for a variety of fact schemas. The automatically generated flow functions cover most of the situations covered by an earlier suite of handwritten rules.
Incorporating mathematics in a freshman engineering course
Authors: W. Venable, R. McConnell, A. Stiller
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The paper discusses how new freshman engineering courses at West Virginia University integrated computers, mathematics, and design while giving a more rigorous introduction to engineering. Pilot sections were started in the Fall 1994 semester. One day per week is devoted to maths. Three days a week are project work. Projects are not chosen for mathematical content, but stress mathematics within each project. The engineering instructor does not replace the mathematics faculty or tutors. Engineers act as experts on the uses of mathematics. Since we feel most successful engineering students study cooperatively we promote group study activity in mathematics.
The Telecomputing laboratory: a multipurpose facility used in DSP education at the University of Oklahoma
Authors: V. E. DeBrunner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper describes the use of a new, multiple use laboratory facility in DSP education at the University of Oklahoma. The facility, funded by a combination of NSF grant money, industrial donations and university funds supports the teaching of signal and image processing, telecommunications and multimedia courses. This unique combination of related areas has fostered significant faculty and department interaction to support the strong telecommunications industry in the region. In fact, the laboratory was chosen as the model laboratory for the joint OU/OSU program in Telecomputing.
Recognizing and parametrizing curves isomorphic to a line
Authors: Chi-Ming Lam, Vladimir Shpilrain, Jie-Tai Yu
Venue: Journal of Symbolic Computation (2007)

Some time ago, Shpilrain and Yu reported an algorithm for deciding whether or not a polynomial p@?K[x,y] is a coordinate, or, equivalently, whether or not a plane curve p(x,y)=0 is isomorphic to a line. Here K is any constructible field of characteristic 0. In this paper, we show that their algorithm requires O(n^2) field operations, where n is the degree of a given polynomial. We also show how their algorithm can be used to find a polynomial parametrization of a plane curve p(x,y)=0 which is isomorphic to a line. This requires O(n^2log"2n) field operations.
Hierarchical Communications for Battlefields
Authors: Mimoza Durresi, Arjan Durresi, Leonard Barolli
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

We present a hierarchical protocol for communications on battlefields. In battlefields operates various military mobile objects, such as tanks, vehicles, soldiers, flying vehicles, etc. that need to communicate quickly and will minimum of overhead, in order to accomplish their missions. Depending on the battlefield conditions, mobile objects will move in groups, which elements will have a small relative speed. We use this feature to develop our Hierarchical Communications Protocol (HCP) for battlefields that builds a virtual infrastructure of the battlefield The hierarchical structure enables the optimization of the routing process. The battlefield is divided in virtual cells, which move as the nodes move. Each cell has a center, which is chosen by the cell members and is located approximately in the geographical center of the cell. The center will behave for a certain time interval as a Base Station. Every node has its geographical position given by Global Positioning System. HCP enables point-to-point and broadcast communications. The major characteristic of HCP is its scalability, which is validated by our simulation results.
Context-Based Recommender Systems in Conventional Grocery--An Economic Analysis
Authors: Daniel Ch. Buser
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In today's grocery the products are getting more homogenous and attributes are getting more complex. Consumers should be supported in their decisions during the shopping process. The main objective of this paper is to look at the conditions needed to transfer the concepts of online recommender systems to conventional brick-and-mortar grocery stores. RFID and plan recognition is considered to observe and forecast the consumer's behavior. The basic architecture consists thereby of a RFID infrastructure, a personal shopping assistant and a back-end system integrated into the retail information system. Based on the proposed architecture the second objective is to build a concept explaining how to judge the economic feasibility. Therefore, a framework to rate single applications and the overall system will be developed. The sum of the implemented applications needs to satisfy both, the seller and the consumer through net benefits. The variables determining these net benefits are identified and explained.
Performance of ordered statistics decoding for robust video transmission on the WSSUS channel
Authors: W.-H. J. Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

This paper investigates the performance of ordered statistics decoding of linear block codes with binary differential phase-shift-keying (2DPSK) transmission on the wide-sense-stationary uncorrelated-scattering (WSSUS) Rayleigh fading channel. For a typical mobile speed of 60 mph, tropospheric scatter radio communication at a carrier frequency of 900 MHz and very low bit rate video communication at a transmission speed of 32 kbit/s, the channel is modeled as a frequency non-selective, slow fading environment without inter-symbol interference (ISI). At a bit error rate (BER) of 10/sup -5/, 34.5 dB and 38 dB gains compared to uncoded 2DPSK are obtained for the decoding of the (24,12,8) extended Golay code and the (128,64,22) extended BCH code with sufficient degree of interleaving.
TUTOR68: educational software for the learning of the MC68000 assembly language
Authors: F. Quintana, L. Herrera
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

TUTOR68 is a tool that facilitates the user's transition from theoretical classes to assembly language programming allowing the student to put the acquired knowledge into practice, without needing to know any kind of tool, such as assemblers, linkers or simulators. Its power lies, in fact, in the diversity of the ways that the user can interact with it, adapting to the preferences and knowledge level of each student/user. It is an application that can also be used for complementing the teacher's explanations with graphical examples. It allows exercises of different difficulty levels to be done, within a fixed time or not, randomly or explicitly selected, exercises about addressing modes or about instruction families. All these possibilities are complemented with a context dependent help system with cross references, a learning and self-assessment course and a calculator which is integrated into the application.
Information maximization in face processing
Authors: Marian Stewart Bartlett
Venue: Neurocomputing (2007)

This perspective paper explores principles of unsupervised learning and how they relate to face recognition. Dependency coding and information maximization appear to be central principles in neural coding early in the visual system. These principles may be relevant to how we think about higher visual processes such as face recognition as well. The paper first reviews examples of dependency learning in biological vision, along with principles of optimal information transfer and information maximization. Next, we examine algorithms for face recognition by computer from a perspective of information maximization. The eigenface approach can be considered as an unsupervised system that learns the first- and second-order dependencies among face image pixels. Eigenfaces maximize information transfer only in the case where the input distributions are Gaussian. Independent component analysis (ICA) learns high-order dependencies in addition to first- and second-order relations, and maximizes information transfer for a more general set of input distributions. Face representations based on ICA gave better recognition performance than eigenfaces, supporting the theory that information maximization is a good strategy for high level visual functions such as face recognition. Finally, we review perceptual studies suggesting that dependency learning is relevant to human face perception as well, and present an information maximization account of perceptual effects such as the atypicality bias, and face adaptation aftereffects.
Analog Circuit Testing Using Auto Regressive Moving Average Models
Authors: Jeffrey Ayres, Michael L. Bushnell
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We present a new method of testing analog circuits based on spectral estimation using auto regressive moving average (ARMA) models. We use a tiered testing approach where each tier becomes progressively more computationally expensive. Badly damaged circuits are quickly eliminated without wasting tester time. The models are generated using input and output analog circuit samples. Results are presented for two passive filters and an active multiplier/modulator. The first two levels of the tiered testing approach use model parameters and the third tier estimates the spectral content of the circuits' output. Incorporating this method into an analog/mixed-signal built-in-self-test (BIST) environment is also discussed, including hardware overhead and general implementation. Our 3-tiered ARMA testing method was highly effective, had 0% yield loss, and achieved low defect level of 0.0821514 on a population of 28,290 circuit variations generated by Monte-Carlo analysis.
Comfortable Wristband Interface Measuring Myoelectric Pattern
Authors: Yasutoshi Makino, Hiroyuki Shinoda
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

In this paper, we propose a new haptic interface based on measurement of two-dimensional patterns of myoelectric potentials on a surface of a forearm. A myoelectric signal is an electrical impulse that produces contraction of muscle fibres in the body. Measuring high density 2D patterns of the myoelectric signals enables us to predict the movements of one's fingers and to estimate the related force. The key issue for realizing such a device that covers whole area of the forearm with high density electrode array is the wiring to each sensor element. The wires also constrain the motion of the forearm. To solve this problem, we adopt a Two-Dimensional Communication (TDC) sheet as a substitution for the individual wires. Electrical power is also supplied through the TDC sheet to each sensor by microwave as well as the signal. Based on this technology, we show that a small sensing unit without electrical contacts to the TDC sheet can measure the EMG signal without the significant influence of the common mode noise.
Formal specification and state space analysis of an operational planning process
Authors: Brice Mitchell, Lars Michael Kristensen, Lin Zhang
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2007)

Formal models of business processes support performance and behavioural analysis of the processes for continuous improvement. Formal models are also useful in guiding the development of software tools to support the processes. This paper presents a formal model of the operational planning process used in an operational headquarters of the Australian Defence Force. The formal process model was developed using coloured petri nets (CPN or CP-nets). The constructed CPN model has allowed the planning process to be validated and analysed using simulation and state spaces. State space analysis was conducted using full state spaces and the sweep-line state space reduction method.
The hierarchical HDL-based design of an integrated MEMS-CMOS oscillator
Authors: R. Gaddi
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A hierarchical and mixed-domain design approach is implemented within the Cadence/sup /spl reg// simulation framework and applied to an integrated MEMS-CMOS oscillator. Parameters concerning both the electronic circuit description at transistor level and the MEMS structure defined by its topology and dimensions, are available during simulation. This approach can lead to a full optimisation of the complete MEMS-CMOS sub-system, with a view to both electrical and mechanical specifications. 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
On the Parallel Diagonal Dominant Algorithm
Authors: Xian-He Sun
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

The Parallel Diagonal Dominant (PDD) algorithm is a highly efficient, ideally scalable tridiagonal solver. In this paper, a detailed study of the PDD algorithm is given. First the PDD algorithm is introduced. Then the algorithm is extended to solve periodic tridiagonal systems. 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
Detecting stepping stones
Authors: Yin Zhang, Vern Paxson
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

One widely-used technique by which network attackers attain anonymity and complicate their apprehension is by employing stepping stones: they launch attacks not from their own computer but from intermediary hosts that they previously compromised. We develop an efficient algorithm for detecting stepping stones by monitoring a site's Internet access link. The algorithm is based on the distinctive characteristics (packet size, timing) of interactive traffic, and not on connection contents, and hence can be used to find stepping stones even when the traffic is encrypted. We evaluate the algorithm on large Internet access traces and find that it performs quite well. However, the success of the algorithm is tempered by the discovery that large sites have many users who routinely traverse stepping stones for a variety of legitimate reasons. Hence, stepping-stone detection also requires a significant policy component for separating allowable stepping-stone pairs from surreptitious access.
A cluster-based power-efficient MAC scheme for event-driven sensing applications
Authors: Georgios Y. Lazarou, Jing Li, Joseph Picone
Venue: Ad Hoc Networks (2007)

In developing an architecture for wireless sensor networks (WSNs) that is extensible to hundreds of thousands of heterogeneous nodes, fundamental advances in energy efficient communication protocols must occur. In this paper, we first propose an energy-efficient and robust intra-cluster communication bit-map assisted (BMA) MAC protocol for large-scale cluster-based WSNs and then derive energy models for BMA, conventional TDMA, and energy efficient TDMA (E-TDMA) using two different approaches. We use simulation to validate these analytical models. BMA is intended for event-driven sensing applications, that is, sensor nodes forward data to the cluster head only if significant events are observed. It has low complexity and utilizes a dynamic scheduling scheme. Clustering is a promising distributing technique used in large-scale WSNs, and when combined with an appropriate MAC scheme, high energy efficiency can be achieved. The results indicate that BMA can improve the performance of wireless sensor networks by reducing energy expenditure and packet latency. The performance of BMA as an intra-cluster MAC scheme relative to E-TDMA depends on the sensor node traffic offer load and several other key system parameters. For most sensor-based applications, the values of these parameters can be constrained such that BMA provides enhanced performance.
Exploiting processing locality for adaptive computing systems
Authors: Tarek El-Ghazawi
Venue:  (2006)

Reconfigurable Computers (RCs), built from configurable logic processors, such as Field Programmable Gate Arrays (FPGAs), can offer high performance in implementing a wide range of applications. However, there exist multiple challenges that must be resolved in order to develop efficient solutions for reconfigurable computing systems. One of the challenges is that some large circuits require more hardware resources than what is available, and the design cannot fit in a single FPGA chip. One solution to this problem is run-time reconfiguration (RTR). On the other hand, the problem of the reconfiguration time overhead has always been a concern in RTR. As configuration time could be significant, eliminating, reducing, or hiding this overhead becomes very critical for reconfigurable systems. In this work, a virtual-memory-like technique, called Virtual Configuration Management (VCM), has been proposed. The proposed technique extends cache and memory management techniques to reconfigurable platforms and augmented them with data mining concepts using association rule mining (ARM). Processing locality characteristics are used to discover at run time the workload processing needs and reconfigure the hardware accordingly. These principles have the potential for solving the problem of limited hardware resources through Run-Time Reconfiguration (RTR). In addition, the reconfiguration time overhead may be also hidden if locality of processing is well exploited. In order to exploit processing locality, both spatial and temporal simultaneously, the proposed technique groups hardware functions into hardware configuration blocks of fixed size (pages), variable size (segments), or hybrid approach (paged segments) where each segment is composed of one or more fixed size pages. Multiple blocks can be configured on a chip simultaneously. Standard, replacement algorithms as those found in caching were considered. By grouping only related functions that are typically requested together, processing spatial locality can be exploited. Temporal locality is exploited through page replacement techniques. To avoid excessive delays and starvation, VCM uses a dual-track execution paradigm, which allows functions to be performed using either the microprocessor or the reconfigurable hardware. New placement algorithms for FPGAs that can provide a tradeoff between placement quality and speed have been proposed. Simulation and emulation, using the Cray-XD1 reconfigurable computer, were used for the experimental study. The results have shown that the virtual configuration model can provide several folds of speed over previous techniques.