ppxscal/embedding_network huggingface dataset:
Addressing instruction fetch bottlenecks by using an instruction register file
Authors: Stephen Roderick Hines, Gary Tyson, David Whalley
Venue: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (2007)

The Instruction Register File (IRF) is an architectural extension for providing improved access to frequently occurring instructions. An optimizing compiler can exploit an IRF by packing an application's instructions, resulting in decreased code size, reduced energy consumption and improved execution time primarily due to a smaller footprint in the instruction cache. The nature of the IRF also allows the execution of packed instructions to overlap with instruction fetch, thus providing a means for tolerating increased fetch latencies, like those experienced by encrypted ICs as well as the presence of low-power L0 caches. Although previous research has focused on the direct benefits of instruction packing, this paper explores the use of increased fetch bandwidth provided by packed instructions. Small L0 caches improve energy efficiency but can increase execution time due to frequent cache misses. We show that this penalty can be significantly reduced by overlapping the execution of packed instructions with miss stalls. The IRF can also be used to supply additional instructions to a more aggressive execution engine, effectively reducing dependence on instruction cache bandwidth. This can improve energy efficiency, in addition to providing additional flexibility for evaluating various design tradeoffs in a pipeline with asymmetric instruction bandwidth. Thus, we show that the IRF is a complementary technique, operating as a buffer tolerating fetch bottlenecks, as well as providing additional fetch bandwidth for an aggressive pipeline backend.
Graph-based pattern discovery in protein structures
Authors: Wei Wang
Venue:  (2006)

The rapidly growing body of 3D protein structure data provides new opportunities to study the relation between protein structure and protein function. Local structure pattern of proteins has been the focus of recent efforts to link structural features found in proteins to protein function. In addition, structure patterns have demonstrated values in applications such as predicting protein-protein interaction, engineering proteins, and designing novel medicines. My thesis introduces graph-based representations of protein structure and new subgraph mining algorithms to identify recurring structure patterns common to a set of proteins. These techniques enable families of proteins exhibiting similar function to be analyzed for structural similarity. Previous approaches to protein local structure pattern discovery operate in a pairwise fashion and have prohibitive computational cost when scaled to families of proteins. The graph mining strategy is robust in the face of errors in the structure, and errors in the set of proteins thought to share a function. Two collaborations with domain experts at the UNC School of Pharmacy and the UNC Medical School demonstrate the utility of these techniques. The first is to predict the function of several newly characterized protein structures. The second is to identify conserved structural features in evolutionarily related proteins.
Socializing artifacts as a half mirror of the mind
Authors: Toyoaki Nishida, Ryosuke Nishida
Venue: AI Society (2007)

In the near future, our life will normally be surrounded with fairly complicated artifacts, enabled by the autonomous robot and brain&#x2013;machine interface technologies. In this paper, we argue that what we call the responsibility flaw problem and the inappropriate use problem need to be overcome in order for us to benefit from complicated artifacts. In order to solve these problems, we propose an approach to endowing artifacts with an ability of socially communicating with other agents based on the artifact-as-a-half-mirror metaphor. The idea is to have future artifacts behave according to the hybrid intention composed of the owner&#x2019;s intention and the social rules. We outline the approach and discuss its feasibility together with preliminary work.
Credentials Management for Authentication in a Grid-Based E-Learning Platform
Authors: Felicia Ionescu, Vlad Nae, Alexandru Gherega
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

The users of Grid-based e-learning platforms must be able to use any standard Web browser to access the e-learning and Grid resources through a Grid Portal, at any time, from any location. Standard Web security protocols, employed between a Web client and server, do not support delegation and, due to this constraint, Grid Portals are forced to give the portal special privileges to act on users' behalf on the Grid. We solved this problem by integration of the Grid authentication mechanisms with the capabilities of Web servers using an online credential repository, called MyProxy server. Our development provides a complete and concise solution for the problem of credentials management and delegation for trusted access of users to the e-learning resources, including Grid services.
A high-throughput, low power architecture and its VLSI implementation for DFT/IDFT computation
Authors: Shen-Fu Hsiao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A recursive algorithm for computation of both forward and backward DFT has been proposed where the common entries in the decomposed matrices are factored out in order to reduce the number of multipliers needed during implementation. The derived algorithm is essentially the band-matrix-vector multiplication with matrix bandwidth of 3. By exploiting the heterogeneous dependency graphs for the matrix-vector multiplication and using an efficient mapping technique, only log/sub 2/N adders and log/sub 2/N-1 multipliers are needed to compute the DFT of size N, a great saving from a previously proposed systolic architecture which calls for 3log/sub 2/N adders and 3log/sub 2/N multipliers. Furthermore, due to the simplicity and regularity of the architectures, it is possible to design a low power processor by turning off the hardware components of no operation at proper time steps. VLSI implementation of the DFT/IDFT processor with distributed finite state machine (FSM) for timing control is also presented.
A flash-memory based file system
Authors: Atsuo Kawaguchi, Shingo Nishioka, Hiroshi Motoda
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

A flash memory device driver that supports a conventional UNIX file system transparently was designed. To avoid the limitations due to flash memory's restricted number of write cycles and its inability to be overwritten, this driver writes data to the flash memory system sequentially as a Log-structured File System (LFS) does and uses a cleaner to collect valid data blocks and reclaim invalid ones by erasing the corresponding flash memory regions. Measurements showed that the overhead of the cleaner has little effect on the performance of the prototype when utilization is low but that the effect becomes critical as the utilization gets higher, reducing the random write throughput from 222 Kbytes/s at 30% utilization to 40 Kbytes/s at 90% utilization. The performance of the prototype in the Andrew Benchmark test is roughly equivalent to that of the 4.4BSD Pageable Memory based File System (MFS).
Normalized discriminant analysis with application to a hybrid speaker-verification system
Authors: Qi Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

A modified linear discriminant analysis technique for speaker verification, referred to as normalized discriminant analysis (NDA), is presented. Using this technique it is possible to design an efficient linear classifier with very limited training data and to generate normalized discriminant scores with comparable magnitudes for different classifiers. The NDA technique is applied to a classifier for speaker verification based on speaker specific information obtained when utterances are processed with speaker independent models. In experiments conducted on a network based telephone database, the NDA technique provides an equal-error rate of 6.13% while the classifier using Fisher linear discriminant analysis has an equal-error rate of 18.18%. Furthermore, when the NDA combined with HMM approach in a hybrid speaker verification system, the rate was reduced from 5.30% (HMM with cohort normalization) to 4.32%.
A syllable-synchronous network search algorithm for word decoding in Chinese speech recognition
Authors: Fang Zheng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The Chinese language is syllabic in nature with frequent homonym phenomena and severe word boundary uncertainty problem. This makes the Chinese continuous speech recognition (CSR) slightly difficult. In order to solve these problems, a Chinese syllable-synchronous network search (SSNS) algorithm is proposed. Together with the vocabulary word search tree and the N-gram based language model, the syllable-synchronous network search algorithm gives a good solution to the Chinese syllable-to-word conversion. In addition, this algorithm is a good method for the accent Chinese speech recognition. The experimental results have showed that the SSNS algorithm can achieve a good overall continuous Chinese speech recognition system performance.
Enhanced Reliability Modeling of RAID Storage Systems
Authors: Jon G. Elerath, Michael Pecht
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

A flexible model for estimating reliability of RAID storage systems is presented. This model corrects errors associated with the common assumption that system times to failure follow a homogeneous Poisson process. Separate generalized failure distributions are used to model catastrophic failures and usage dependent data corruptions for each hard drive. Catastrophic failure restoration is represented by a three-parameter Weibull, so the model can include a minimum time to restore as a function of data transfer rate and hard drive storage capacity. Data can be scrubbed as a background operation to eliminate corrupted data that, in the event of a simultaneous catastrophic failure, results in double disk failures. Field-based times to failure data and mathematic justification for a new model are presented. Model results have been verified and predict between 2 to 1,500 times as many double disk failures as that estimated using the current mean time to data loss method.
Definitions and Detection of Deadlock, Livelock, and Starvation in Concurrent Programs
Authors: Kuo-Chung Tai
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Deadlock, livelock, starvation, and other terms have been used to describe undesirable situations involving blocking or not making progress for processes in a concurrent program However, definitions of these terms are inconsistent and often informal This paper provides formal definitions of deadlock, livelock, and starvation in terms of the reachability graph of a concurrent program Also, this paper shows algorithms for the detection of deadlock, livelock, and starvation.
Parachuting software engineering practices into the hostile environment of 4th year final term
Authors: M. R. Smith
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Two years ago, an elective 4th year microprocessor course taught to a small class of 35 was switched to become a compulsory 3rd year course taught to 150. Student grades became bimodal, either D+/C- or A-/A, and the instructor's teaching evaluation plummeted. A rework of the program the following year made no significant difference. To overcome these problem, elements from Humphrey's personal software process were parachuted into the undergraduate program. Modified versions of the earned value analysis procedure and review sheets were developed, together with a defect analysis approach directed towards improving the manner in which laboratories were handled.
Improvements in switchboard recognition and topic identification
Authors: B. Peskin, S. Connolly, L. Gillick, S. Lowe, D. McAllaster, V. Nagesha
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We revisit a topic identification test on the Switchboard Corpus first reported by Gillick et al. (see Proc. ICASSP-93, 1993 and ARPA Workshop on Human Language Technology, 1993). This approach to topic ID uses a large vocabulary continuous speech recognizer as a front-end to transcribe the speech and then scores the transcripts using a set of topic-specific language models. Our recognition of conversational telephone speech has improved dramatically in the three years since the original test, dropping from word error rates in the 90%'s to those in the 40%'s. Changing only the recognition engine but otherwise leaving our 1993 topic ID system in place, the resulting rate of message misclassification drops from 33/120 in 1993 down to 1/120 now-the same error rate that we obtain from the true transcriptions. This paper describes the topic classification test and the many improvements to the recognition engine that made such a dramatic reduction possible.
Visualizing the performance of large-aperture microphone arrays
Authors: H. F. Silverman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The use of arrays of microphones having a large number of elements (hundreds) is now in place in research laboratories, and will soon be practical for real applications. In rooms of auditorium or conference size, a large number of microphones will virtually always imply that the aperture will be large compared to the focal distance. This requires understanding the volume selectivity of irregular, widely-distributed sets of microphones. In this paper, several pictures of the beamforming performance of large-aperture distributions of microphones are presented. The purpose is to illustrate some of the pitfalls in large-aperture microphone-array design.
Open programmable switched network architecture for IP-based converged multi-services
Authors: Jaewoo Park
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

With great progress in LAN technologies, users require high quality real-time services as well as data communication. This is expediting network services to be gradually converging over an IP-based network platform, especially in intranet-based enterprise and campus LANs. In this paper, we propose a quality-of-service-supported programmable switched local area network architecture under development, which can provide a variety of converged multi-services on an IP-based converged network. 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
Edge sensitive subband coding of images
Authors: K. Cinkler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

In this paper, we introduce a family of novel edge preserving image coding techniques based on the discrete wavelet transform (DWT). These techniques utilize the edge map (which not necessarily contains closed curves) of the processed image or its subbands in the way that no filtering over edges is performed. This results in a reduction of power in the higher frequency bands. The achievable savings are higher than the additional bit rate needed for transmission of the edge map.
An approach to analyze the evolution of symbolic conditions in learning classifier systems
Authors: Pier Luca Lanzi, Stefano Rocca, Stefania Solari
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

In this paper, we introduce an approach for the identification of building blocks in symbolic expressions and apply it to analyze the emergence of building blocks in XCS with symbolic representation. The objective is to extract from a sequence of evolving populations a set of recurrent patterns which identifies pieces of the problem solution, so to track the emergence of the optimal solution. This permits the introduction of better measures of performance which might be useful in diagnosing problems and adapting algorithms.
Automatic Annotation of Humans in Surveillance Video
Authors: D. M. Hansen, B. K. Mortensen, P. T. Duizer, J. R. Andersen, T. B. Moeslund
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper we present a system for automatic annotation of humans passing a surveillance camera. Each human has 4 associated annotations: the primary color of the clothing, the height, and focus of attention. The annotation occurs after robust background subtraction based on a Codebook representation. The primary colors of the clothing are estimated by grouping similar pixels according to a body model. The height is estimated based on a 3D mapping using the head and feet. Lastly, the focus of attention is defined as the overall direction of the head, which is estimated using changes in intensity at four different positions. Results show successful detection and hence successful annotation for most test sequences.
Fast user-mode rootkit scanner for the enterprise
Authors: Yi-Min Wang, Doug Beck
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

User-mode resource hiding through API interception and filtering is a well-known technique used by malware programs to achieve stealth. Although it is not as powerful as kernel-mode techniques, it is more portable and reliable and, as a result, widely used. In this paper, we describe the design and implementation of a fast scanner that uses a cross-view diff approach to detect all user-mode hiding Trojans and rootkits. We also present detection results from a large-scale enterprise deployment to demonstrate the effectiveness of the tool.
Using machine learning techniques to build a comma checker for Basque
Authors: Iñaki Alegria, Bertol Arrieta, Arantza Diaz de Ilarraza, Eli Izagirre, Montse Maritxalar
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

In this paper, we describe the research using machine learning techniques to build a comma checker to be integrated in a grammar checker for Basque. After several experiments, and trained with a little corpus of 100,000 words, the system guesses correctly not placing commas with a precision of 96% and a recall of 98%. It also gets a precision of 70% and a recall of 49% in the task of placing commas. Finally, we have shown that these results can be improved using a bigger and a more homogeneous corpus to train, that is, a bigger corpus written by one unique author.
Intrusion Detection System Modeling
Authors: Keesook J. Han, Joseph Giordano
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Database Management System (DBMS) controls and manages the data to eliminate data redundancy and to ensure data integrity, consistency and availability, among other features. Even though DBMS vendors continue to offer greater automation and simplicity in managing databases, the need for intrusion database modeling and management practices have not been considered. Our research focuses on not only anomaly detection but also intrusion database management through planning and best practice adoption to improve operational efficiency, lower costs, privacy and security.
Successful students' strategies for getting unstuck
Authors: Robert McCartney, Anna Eckerdal, Jan Erik Mostrom, Kate Sanders, Carol Zander
Venue: ACM SIGCSE Bulletin (2007)

Students often "get stuck" when trying to learn new computing concepts and skills. In this paper, we present and categorize strategies that successful students found helpful in getting unstuck. We found that the students reported using a broad range of strategies, and that these strategies fall into a number of recognizably different categories.
Amplitude estimation with application to system identification
Authors: P. Stoica
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

We investigate herein the problem of amplitude estimation of sinusoidal signals from observations corrupted by colored noise. A relatively large number of amplitude estimators are described which encompass least squares (LS) and weighted least squares (WLS) methods. Additionally, filterbank approaches, which are widely used for spectral analysis, are extended to amplitude estimation. Specifically, we consider the matched-filterbank (MAFI) approach and show that, by appropriately designing the prefilters, the MAFI approach includes the WLS approach. The amplitude estimation techniques discussed in this paper do not model the noise, and yet they are all asymptotically statistically efficient. It is their different finite-sample properties that are of particular interest to this study. Numerical examples are provided to illustrate the differences among the various estimators. Though amplitude estimation applications are numerous, we focus on system identification using sinusoidal probing signals.
Making connections through development [engineering college marketing]
Authors: S. Vanneman
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

This is the sixth in a series of six companion papers that address the marketing of the College of Engineering at the University of Arkansas, Fayetteville, USA. While valuable as an independent resource, the content of this document should be considered within the context of all six papers. Making connections through development is marketing "up close and personal". As public institutions become more active in pursuing private support for academic programs, they are putting more emphasis on the development of partnerships with alumni, friends, corporations, and foundations. The development of these partnerships takes time and patience, and above all, a strategy based on the culture of the institution and its donors. This paper describes the strategy of the University of Arkansas College of Engineering in obtaining the private support necessary to become a top 25 public college of engineering. 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