ppxscal/embedding_network huggingface dataset:
On the predictive connectionist models for automatic speech recognition
Authors: B. Petek
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper addresses the equivalence of mapping functions between linked predictive neural networks (LPNN) and hidden control neural networks (HCNN). Two theoretical results supported by Mathematica experiments are presented. First, it is proved that for every HCNN model there exist an equivalent LPNN model. Second, it is shown that the set of input-output functions of an LPNN model is strictly larger than the set of functions of an equivalent HCNN model. Therefore, when using equal architecture of the canonical building blocks (MLPs) for the LPNN and HCNN models, the LPNN models represent a superset of the approximation capabilities of the HCNN models. On the other hand, comparative experiments on the same task showed that the HCNN system outperforms the LPNN system.
The filter bank approach for the fractional Fourier transform
Authors: Der-Fen Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In this work, we develop an equivalent filter bank structure for the computation of the fractional Fourier transform (FrFT). The purpose of this work is to provide a unified approach to the computation of the FrFT via the filter bank approach.
Segmenting Biological Particles in Multispectral Microscopy Images
Authors: Shishir Shah
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

This paper presents a methodology and results for segmentation of biological particles in multispectral images by learning disparate models from each spectra for pixel classification coupled with contour evolution based on the use of level set theory. Traditional contour models have some limitations on the segmentation of complicated images whose sub-regions consist of multiple components. The segmentation of multispectral images is even a more difficult problem. Our proposed model overcomes these limitations and uses multiple classifiers, each of which solves the problem independently based on its input observations. Each classifier module is trained to detect distinct regions and a higher order decision integrator collects evidence from each of the modules to delineate a final region.
Efficient Parallel Shortest Path Algorithms for Banded Matrices
Authors: Y. Han, Y. Igarashi
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

We present efficient parallel shortest path algorithms for an n x n banded matrix of bandwidth b. Our algorithm computes all pair shortest distances within the band in time O(nb^{2}/p + l(b)logblog(n/b)) on the PRAM using p processors, where l(b) is logb on the EREW PRAM, loglogb on the CRCW PRAM, and a constant on the randomized CRCW PRAM. It computes all pair shortest distances in time O(n^{2}b/p+l(B)logblog(n/b)) using p processors.
Improving perceptual coding of narrowband audio signals at low rates
Authors: H. Najafzadeh-Azghandi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper discusses perceptual coding of narrowband audio signals at low rates. In particular, it proposes a new error measure which shapes the noise inside the critical bands, a window switching criterion based on the temporal masking effect of the hearing system, a more accurate model of the simultaneous masking effect of the hearing system, perceptually-based bit allocation algorithms based on two different approaches towards quantization noise shaping and a predictive vector quantization scheme to code the scale factors. The resulting coding scheme outperforms existing low rate speech coders for non-speech signals.
Modeling and Analysis of Energy Consumption in IEEE802.11e Networks
Authors: O. Bouattay, T. Chahed, M. Frikha, S. Tabbane
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Energy is a major concern in wireless networks, be it for the target mobile user, as is the case of IEEE802.11 Infrastructure mode, or for all the users as in IEEE802.11 ad hoc mode where it dictates the lifetime of the whole network. We focus in this paper on the modeling of energy consumption at the MAC layer in the context of QoS-capable WLAN, namely IEEE802.11e, and propose an analytical model for the lifetime of a terminal for different access categories. Our results quantify the impact of priority on energy consumption and show how the latter varies as a function of the network size, the number of stations in each priority group as well as the propagation environment : indoor versus outdoor. These results can be used at higher layers to optimize energy consumption through differentiation.
Error Tolerance in DNA Self-Assembly by (2k-1) x (2k-1) Snake Tile Sets
Authors: X. Ma, J. Huang, F. Lombardi
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

As a possible technology for bottom-up manufacturing, DNA self-assembly requires tolerance to different errors. Among the methods for reducing the error rate, snake tile sets utilize a square block of even dimension of tiles (i.e., 2k × 2k). In this paper, an odd-sized square block (i.e., (2k-1)×(2k-1)) is proposed as basis for snake tile sets. In comparison with all other tile sets, the proposed snake tile sets achieve a considerable reduction in error rate for growth and facet roughening errors. Simulation results are provided.
Improvement of Shape Distinction by Kinesthetic-Tactile Integration
Authors: Katsunari Sato, Hiroyuki Kajimoto, Naoki Kawakami, Susumu Tachi
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The sensation of touch is divided into kinesthetic and tactile sensation. It is important for a touch sensation device to present both types of sensations. We mounted an electrotactile display on a kinesthetic display, and realized a compact display of touch sensation. This system can improve the ability to identify objects. In this paper, we evaluate the effect of integrating kinesthetic and electrotactile sensations for identifying the shape of an object.
MODD for CF: a representation for fast evaluation of multiple-output functions
Authors: T. L. Rajaprabhu, A. K. Singh, A. M. Jabir, D. K. Pradhan
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

Recently a mathematical framework was presented that bridges the gap between bit level BDD representation and word level representations such as BMD and TED. Here we present an approach that demonstrates that these diagrams admit fast evaluation of circuits for multiple outputs. The representation is based on characteristic function which provides faster evaluation time as well as compact representation. The average path length is used as a metric for evaluation time. The results obtained for benchmark circuits shows lesser number of nodes and faster evaluation time compared to binary representation.
PVFS: a parallel file system for linux clusters
Authors: Philip H. Carns, Walter B. Ligon,  III, Robert B. Ross, Rajeev Thakur
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

As Linux clusters have matured as platforms for low-cost, high-performance parallel computing, software packages to provide many key services have emerged, especially in areas such as message passing and networking. One area devoid of support, however, has been parallel file systems, which are critical for high-performance I/O on such clusters. We have developed a parallel file system for Linux clusters, called the Parallel Virtual File System (PVFS). PVFS is intended both as a high-performance parallel file system that anyone can download and use and as a tool for pursuing further research in parallel I/O and parallel file systems for Linux clusters. In this paper, we describe the design and implementation of PVFS and present performance results on the Chiba City cluster at Argonne. We provide performance results for a workload of concurrent reads and writes for various numbers of compute nodes, I/O nodes, and I/O request sizes. We also present performance results for MPI-IO on PVFS, both for a concurrent read/write workload and for the BTIO benchmark. We compare the I/O performance when using a Myrinet network versus a fast-ethernet network for I/O-related communication in PVFS. We obtained read and write bandwidths as high as 700 Mbytes/sec with Myrinet and 225 Mbytes/sec with fast ethernet.
A Service Supplier Database for Location-Based Mobile Commerce
Authors: PD Mzila, MO Adigun, SS Xulu
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Dynamic development and improvement of mobile devices in nowadays enforces more attention to the manner in which information is handled (storage and management) among participating components in mobile commerce environment. Many are times tourists become strangers in foreign countries and become worried about available services in each and every place they visit. These services which are known as location based services are normally available to only subscribers of those services. This research proposes a dynamic service discovery mechanism whereby every mobile user is capable of service discovery irrespective of being a subscriber or not. The research focuses on the structure of location based service supplier's database and the infrastructure in which participating components interact to enable mobile users in a given coverage area to easily access available services that are provided by suppliers in an advertising form. Through network operators using Mobile Network Coverage Area (MNCA), mobile device's current location is automatically detected. This mechanism occurs when a user with mobile device registers with local network transmitter through which network operators identify its location and inform Location Based Application Server (LBAS) about the current location of the user.
A comparative study of MIMO capacity with different antenna topologies
Authors: Liang Xiao, Lin Dal, Hairuo Zhuang, Shidong Zhou, Yan Yao
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Multiple input/multiple output (MIMO) is a hot topic in wireless communication and has a great advantage in its capacity. We investigate the influence of antenna topology on MIMO capacity and by comparing three topology schemes we find that selecting a proper antenna topology increases the capacity evidently. Three schemes under study are the traditional point-to-point concentrated antenna topology (CON), the multipoint-to-point distributed antenna topology (DIS) and the clustered antenna topology (CLUSTER). We explore their average capacity under different antenna number and power allocation methods. Simulation results show that DIS and CLUSTER excel the traditional concentrated MIMO structure in capacity.
A New Iterative Decoder of Space-Time Data in Time Selective MIMO Channels
Authors: Manav R. Bhatnagar, R. Vishwanath, M. K. Arti, Vaibhav Bhatnagar
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper we present a new iterative decoder of Space-Time Block Coded data in the presence of carrier offsets. This decoder starts the iteration with a small amount of training data to find the initial estimate of carrier offset, channel and noise co-variance. Subsequently it attempts to find the estimate of the STBC data by an alternating maximization (AM) technique. In this way better estimates of Space---Time data are achieved after the final iteration as compared to those found without an iterative method. Thus the new decoder reduces the training overhead required by the conventional data-aided (DA) estimators for efficient estimates of carrier offsets and S---T data, and provides higher data rate.
An effective approach to adaptive IIR filtering
Authors: M. Harteneck
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

An approach to adaptive IIR filtering based on a pseudo-linear regression and a QR matrix decomposition is developed. The algorithm has proved to be stable and has good convergence properties if the unknown system satisfies the strictly positive real condition. The derivation of the algorithm is straightforward and the computational complexity is less than the computational complexity of the IIR-RPE algorithm. Simulation results of system identification with synthetic and real world data are shown comparing the algorithm with the IIR-RPE and the IIR-LMS algorithm.
Towards Ubiquitous Government Services through Adaptations with Context and Views in a Three-Tier Architecture
Authors: Dickson K. W. Chiu, Dan Hong, S. C. Cheung, Eleanna Kafeza
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

With the recent advances in mobile technologies and infrastructures, citizens start to demand for not just mobile but also ubiquitous access to e-government services. Further with the invention of new interaction devices, the context in which the service is being used becomes an integral part of the activity carried out with the system. This demands a new paradigm for system requirements elicitation and design in order to make good use of such extended context information. Instead of redesigning or adapting existing e-government services in an ad-hoc manner, we introduce a methodology for the elicitation of contextaware adaptation requirements and the matching of context- awareness features to the target context by capability matching. For the implementation of these adaptations, we propose the use of three tiers of views: user interface views, data views, and process views. This approach centers on a novel notion of process views to ubiquitous government (u-government) service adaptation, where mobile users may execute a more concise version or modified procedures of the original process according to their context. The process view also serves as the key mechanism for integrating user interface views and data views. We demonstrate our methodology by extending an egovernment appointment service into a mobile one with context support.
Teaching Condor Grid Computing to Beginning Programming Students
Authors: Amy Apon, Matt Baker
Venue: IEEE Distributed Systems Online (2007)

When instructors at the University of Arkansas wanted to teach grid computing to beginning programming students, they focused on teaching the students to create and submit a grid job. Their involvement with the Open Science Grid led them to choose Condor. The material evolved over three iterations of the course and a special-studies course, with students learning to write programs to solve computational problems and to use Condor grid programming to solve scientific problems.
A parameter-space search algorithm tested on a Hodgkin&#x2013;Huxley model
Authors: Michael S. Reid, Edgar A. Brown, Stephen P. DeWeerth
Venue: Biological Cybernetics (2007)

We demonstrate a parameter-space search algorithm using a computational model of a single-compartment neuron with conductance-based Hodgkin&#x2013;Huxley dynamics. To classify bursting (the desired behavior), we use a simple cost function whose inputs are derived from the frequency content of the neural output. Our method involves the repeated use of a stochastic gradient descent-type algorithm to locate parameter values that allow the neural model to produce bursting within a specified tolerance. We demonstrate good results, including those showing that the utility of our algorithm improves as the pre-defined allowable parameter ranges increase and that the initial approach to our method is computationally efficient.
Influence Control for Dynamic Reconfiguration
Authors: Zhikun Zhao, Wei Li
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Dynamic reconfiguration is a useful technique for software update because it can achieve an architectural change without shutdown of a system. However, so far in the state-of-arts, there has not been an approach that can evaluate and control both the functional influence and performance influence of reconfiguration in a unified framework. In this paper, we present an approach that addresses the above drawback. In our approach, we use a reconfiguration algorithm and a reconfiguration scheduler to control these two types of influence. The algorithm reduces the logical performance influence by allowing old and new components coexisting and uses a version management mechanism to avoid functional side effect in the coexisting period. The scheduler controls the physical performance influence through restricting the processor time spent on the reconfiguration procedure. We implement the algorithm and the scheduler in our Reconfiguration Data Flow model.
A Variational Approach to Reconstructing Images Corrupted by Poisson Noise
Authors: Triet Le, Rick Chartrand, Thomas J. Asaki
Venue: Journal of Mathematical Imaging and Vision (2007)

We propose a new variational model to denoise an image corrupted by Poisson noise. Like the ROF model described in [1] and [2], the new model uses total-variation regularization, which preserves edges. Unlike the ROF model, our model uses a data-fidelity term that is suitable for Poisson noise. The result is that the strength of the regularization is signal dependent, precisely like Poisson noise. Noise of varying scales will be removed by our model, while preserving low-contrast features in regions of low intensity.
Chain replication for supporting high throughput and availability
Authors: Robbert van Renesse, Fred B. Schneider
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

Chain replication is a new approach to coordinating clusters of fail-stop storage servers. The approach is intended for supporting large-scale storage services that exhibit high throughput and availability without sacrificing strong consistency guarantees. Besides outlining the chain replication protocols themselves, simulation experiments explore the performance characteristics of a prototype implementation. Throughput, availability, and several object-placement strategies (including schemes based on distributed hash table routing) are discussed.
Mechanisms for object caching in distributed applications using Java RMI
Authors: John Eberhard, Anand Tripathi
Venue: Software&mdash;Practice Experience (2007)

Remote Method Invocation (RMI), a mechanism to access remote objects in Java-based distributed applications, uses network communication for each method invocation. Consequently, using RMI in a wide-area environment can cause poor application performance. One solution to improve performance is to cache the objects such that network communication is not necessary for each method invocation. In this paper, we present mechanisms to transparently add object caching to RMI. These mechanisms are compatible with existing RMI applications and use an event-based model to support different consistency policies. The mechanisms also include the ability to adaptively select the consistency policy for an object based on its usage pattern. A novel feature of our mechanisms is the use of a &lsquo;reduced object&rsquo;, which is a partial representation of the RMI object. We experimentally evaluate and demonstrate the benefits of our mechanisms. Copyright &copy; 2006 John Wiley & Sons, Ltd.
An environment for easy cross synchronization of multimedia Web based material
Authors: I. Stiubiener
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The use of Web based content presentations as an information exposure method is essential for the online learning process. Our main goal is to present the main functional specifications of an easy-to-use tool for creating Web based cross-synchronized multimedia presentations.
Interactive presentation: BIST method for die-level process parameter variation monitoring in analog/mixed-signal integrated circuits
Authors: Amir Zjajo, Manuel J. Barragan Asian, Jose Pineda de Gyvez
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper reports a new built-in self-test scheme for analog and mixed-signal devices based on die-level process monitoring. The objective of this test is not to replace traditional specification-based tests, but to provide a reliable method for early identification of excessive process parameter variations in production tests that allows quickly discarding of the faulty circuits. Additionally, the possibility of on-chip process deviation monitoring provides valuable information, which is used to guide the test and to allow the estimation of selected performance figures. The information obtained through guiding and monitoring process variations is re-used and supplement the circuit calibration.
The integration of instructional computer technology in a k--5 math, science, and technology school
Authors: William Mccomas
Venue:  (2006)

As the number of computer-based technologies increasingly impact teaching and learning, it becomes ever more important to understand how such tools are used in instruction (Grabe Grabe, 2004; Meyer, 2001). This study sought to understand how computer technology was integrated into the fabric of a school that had made computer technology an explicit instructional focus. The Alexander Science Center School (ASCS) in Los Angeles was designed with an increased focus in the curricular areas of math, science, and technology and was the setting for this research. This study used both quantitative and qualitative data sources to understand how computers were integrated and applied by teachers at this technology-rich school. A survey based on the National Educational Technology Standards (NETS) which define expectations for technology-enhanced schools was given to teachers to inquire how they applied computers in their instruction, how they had been trained to use such technology, software they and their students used at the school, and the nature of the general and technical support these teachers received. Additionally, a review of relevant documents regarding technology at the school was conducted. The study found that the teachers were minimally integrating computers into their instruction. When integrating, computers were typically used as productivity (i.e. word processing) and research (i.e. the Internet) tools. Most frequently, teachers had been trained to use computers through independent learning. Teachers knew introductory computer skills but shared three computer training needs: learning specific applications (i.e. software), learning about computer integration, and learning computer management strategies. Teachers conveyed frustration with the general and technical support they had been given at the school to use computers. Recommendations from this study include that the school create a robust and inclusive technology plan, staff should familiarize themselves with the NETS, teachers should receive software and training that supports inquiry-based learning, administration should model, support, and encourage the use of technology, a technician should be hired to oversee the lab and to assist teachers, and students should be given further instructional opportunities to use computers.