ppxscal/embedding_network huggingface dataset:
Cosy: develop in user-land, run in kernel-mode
Authors: Amit Purohit, Charles P. Wright, Joseph Spadavecchia, Erez Zadok
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

User applications that move a lot of data across the user-kernel boundary suffer from a serious performance penalty. We provide a framework, Compound System Calls (Cosy), to enhance the performance of such user-level applications. Cosy provides a user-friendly mechanism to execute the data-intensive code segment of the application in the kernel. This is achieved by aggregating the data-intensive system calls and the intermediate code into a compound. This compound is executed in the kernel, avoiding redundant data copies. A Cosy version of GCC makes the formation of a Cosy compound simple. Cosy-GCC automatically converts user-defined code segments into compounds. To ensure the security of the kernel, we use a combination of static and dynamic checks. We limit the execution time of the application in the kernel by usinga modified preemptible kernel. Kernel data integrity is assured by performing necessary dynamic checks. Static checks are enforced by Cosy-GCC. To study the performance benefits of our Cosy prototype, we instrumented applications such as grep and ls. These application showed an improvement of 20-80%. Our current work focuses on faster and secure execution of entire programs in the kernel without source code modification.
New bounds on the edge number of a k-map graph
Authors: Zhi-Zhong Chen
Venue: Journal of Graph Theory (2007)

It is known that for every integer k&thinsp;&ge;&thinsp;4, each k-map graph with n vertices has at most kn - 2k edges. Previously, it was open whether this bound is tight or not. We show that this bound is tight for k&thinsp;=&thinsp;4, 5. We also show that this bound is not tight for large enough k (namely, k&thinsp;&ge;&thinsp;374); more precisely, we show that for every $0 < \epsilon < {3 \over 328}$ and for every integer $k \ge {140 \over {41\epsilon}}$, each k-map graph with n vertices has at most $({325 \over 328} + \epsilon){kn} - 2{k}$ edges. This result implies the first polynomial (indeed linear) time algorithm for coloring a given k-map graph with less than 2k colors for large enough k. We further show that for every positive multiple k of 6, there are infinitely many integers n such that some k-map graph with n vertices has at least $({11 \over 12}{k} + {1 \over 3}) {n}$ edges. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 267&ndash;290, 2007 A preliminary version of this paper appeared in Proceedings of the 10th Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, Vol. 3106, pp. 319&ndash;328, 2004.
Design optimization of main-profile MPEG-2 AAC decoder
Authors: Kyoung-Ho Bang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A system architecture optimized for the 2-channel main-profile MPEG-2 AAC decoder is presented. In order to enable an efficient job scheduling and allocation, the presented system comprises three hardware modules: Huffman decoder module, predictor module, and processing core module which is programmable using an assembly language of its own. The Huffman decoder is designed to finish the requested job in only 1 clock cycle time and the predictor forms parallel processing with other modules, so that utilization of the system resource is maximized. The developed system has been coded in VHDL and the MPEG-2 AAC decoding algorithm is programmed using the assembly language of the processing core. For the verification of the decoding algorithm, the 16-bit PCM output of the system was compared with the result of the floating-point simulation, and the result showed the maximum of 2-bit difference. Functional simulation verified that the developed system can decode standard MPEG-2 AAC main-profile bitstreams in real-time with high accuracy.
Data Level Fusion of Multilook Inverse Synthetic Aperture Radar (ISAR) Images
Authors: Zhixi Li, Ram M. Narayanan
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

Although techniques for resolution enhancement in single-aspect radar imaging have made rapid progress in recent years, it does not necessarily imply that such enhanced images will improve target identification or recognition. However, when multiple looks of the same target from different aspects are obtained, the available knowledge base increases allowing more useful target information to be extracted. Physics based image fusion techniques can be developed by processing the raw data collected from multiple ISAR sensors, even if these individual images are at different resolutions. We derive an appropriate data fusion rule in order to generate a composite image containing increased target shape characteristics for improved target recognition. The rule maps multiple data sets collected by multiple radars with different system parameters on to the same spatial-frequency space. The composite image can be reconstructed using the inverse 2-D Fourier Transform over the separated multiple integration areas. An algorithm called the Matrix Fourier Transform is created to realize such a complicated integral. This algorithm can be regarded as an exact interpolation, such that there is no information loss caused by data fusion. The rotation centers need to be carefully selected in order to properly register the multiple images before performing the fusion. A comparison of the IAR (Image Attribute Rating) curve between the fused image and the spatial-averaged images quantifies the improvement in the detected target features. The technique shows considerable improvement over a simple spatial averaging algorithm and thereby enhances target recognition.
Teaching engineering ethics: a new approach
Authors: N. Bekir
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Engineering programs across the USA are experimenting with new ways to integrate engineering ethics into the curriculum. In a large part, this is motivated by criterion three of ABET's Engineering Criteria 2000 that requires that engineering programs demonstrate that their graduates have an understanding of professional and ethical responsibility. Faculty are challenged to find an appropriate place to integrate this material into their curricula. The Electrical and Computer Engineering Department at California State University, Northridge has been experimenting with the use of "The Ethics Challenge", a board game that has been developed and used by the Lockheed Martin Corporation for its in-house annual ethics awareness training. This approach allows ethics to be integrated into the curriculum in many places and at levels from freshman to senior. This paper describes "The Ethics Challenge" and how it can be used to teach engineering ethics in any engineering program.
A Unified, Reconfigurable Architecture for Montgomery Multiplication in Finite Fields GF(p) and GF(2^n)
Authors: M. Sudhakar, R. V. Kamala, M. B. Srinivas
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper proposes a unified and reconfigurable Montgomery multiplier architecture which can operate in both primary GF(p) and binary extension fields GF(2^n). The multiplier provides efficient execution of Montgomery multiplication in either field for different operand lengths. It supports any operand length 'n', 1\le n \le N where the upper value of N is application dependent. The final result is obtained in 'n+2' clock cycles for either field. Propagation delay of the design is investigated and found to be comparable with the existing unified multiplier architectures while providing reconfigurability at the same time. The proposed architecture has high order of flexibility and low hardware complexity with critical path delay independent of operand length. The multiplier can find application in, for example, Elliptic curve cryptographic(ECC) processors.
Detecting Deadlock, Double-Free and Other Abuses in a Million Lines of Linux Kernel Source
Authors: Peter T. Breuer, Simon Pickin, Maria Larrondo Petrie
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

The formal analysis described here detects two so far undetected real deadlock situations per thousand C source files or million lines of code in the open source Linux operating system kernel, and three undetected accesses to freed memory, at a few seconds per file. That is notable because the code has been continuously under scrutiny from thousands of developers' pairs of eyes. In distinction to model-checking techniques, which also use symbolic logic, the analysis uses a "3-phase" compositional Hoare-style programming logic combined with abstract interpretation. The result is a customisable post-hoc semantic analysis of C code that is capable of several different analyses at once.
CPU reservations and time constraints: implementation experience on windows NT
Authors: Michael B. Jones, John Regehr
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

This paper presents an implementation of scheduling abstractions originally developed for the Rialto real-time operating system within a research version of Windows NT called Rialto/NT. These abstractions, CPU Reservations and Time Constraints, as described in the 1997 SOSP paper [Jones et al. 97], are intended to allow: (1) activities to obtain minimum guaranteed execution rates with application-specified reservation granularities via CPU Reservations, and (2) applications to schedule tasks by deadlines via Time Constraints, with on-time completion guaranteed for tasks with accepted constraints. The Rialto/NT scheduler differs from the original Rialto scheduler in several key respects. First, it has been extended to schedule multiprocessors--this is the primary new intellectual contribution of this work. It has been adapted to operate with operating system clock services that only provide timing interrupts at regular periodic intervals measured in milliseconds, rather than being able to schedule clock interrupts at arbitrary sub-millisecond points of time. It coexists with the existing Windows NT scheduler, allowing it to schedule time not scheduled by itself. Finally, it has been implemented in a particularly non-intrusive manner, using rather than replacing the existing Windows NT priority-based scheduler. Results presented will demonstrate that CPU Reservations and Time Constraints can be effectively implemented on multiprocessors. We will also describe the implementation techniques chosen and tradeoffs made as a result of implementing within Windows NT. Finally, we will present performance results and execution traces.
My Vision for Computer
Authors: Carl K. Chang
Venue: Computer (2007)

EIC Carl K. Chang offers a look at his plans for Computer's future.
A robust method for the estimation of formant frequency modulation in speech signals
Authors: P. Rao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The presence of amplitude and frequency modulations in individual formants of the speech signal was demonstrated using the discrete-time energy separation algorithm (DESA). Formant modulation estimates are valuable to the understanding of speech production, and have found several applications. While the DESA has been successfully applied in tracking the amplitude envelope of formants, the DESA frequency estimator has been relatively unexploited for tracking formant frequency modulation (FM) due to its lack of robustness to conditions commonly occurring in practice. We consider an alternate method of frequency estimation based on the Wigner distribution (WD) and investigate its application to the estimation of formant FM in speech signals. It is shown using simulated and speech signals that the WD estimator can track formant FM with high time resolution under a wider range of conditions and is more robust to additive noise present in the signal than the DESA estimator. Finally the computational complexities of the two methods are compared. 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
Modeling of industrial problems on high-performance polyprocessor computing systems
Authors: B. N. Chetverushkin
Venue: Automation and Remote Control (2007)

Issues are considered that are related to the use of modern high-performance computer systems for the solution of problems of science and engineering. Special attention is given to the relation of technical possibilities, including the means of communication, computational algorithms, and auxiliary software tools. Examples are given of the use of high-performance systems for modeling of complex problems.
2-D high resolution spectral estimation based on multiple regions of support
Authors: S. Rouquette
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper deals with frequency estimation in the 2-D case when one has only few data points. We propose a method to estimate the frequencies of a sum of exponentials. This method is based on an original set of 2-D linear prediction models with new regions of support derived from the standard quarter plane support region. These models define various spectra which are finally combined by computing their harmonic mean. This method benefits from the subspace decomposition of the covariance matrix to perform well. It is demonstrated that the new regions of support improve the spectrum geometry and the estimation accuracy compared to the classical quarter plane (QP) support regions.
Collaborative Visualization of Large Scale Datasets Using Web Services
Authors: Yongwang Zhao, Chunyang Hu, Yonggang Huang, Dianfu Ma
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Visualization and collaboration of large scale data sets on Internet is still one of biggest challenges in scientific visualization. A distributed, real-time, collaborative system for large scale data like seismic model can be a valuable tool to support scientific research. In this paper, we present a new approach for web-based synchronized collaborative visualization of large scale data using web services and rich web clients which supports collaborative visualization in web browsers. We use WS-Resources in WSRF (Web Services Resource Framework) to maintain states collaborative server. On client side, we design an Ajax-based (Asynchronous JavaScript and XML) application using standard web technologies. A collaborative demonstration of 3D seismic model which is 2GB size is presented and experimental results are showed finally.
Reducing medical errors using secure RFID technology
Authors: Michael Anshel, Sarah Levitan
Venue: ACM SIGCSE Bulletin (2007)

RFID technology can successfully be used to reduce medical errors. This technology can aid in the accurate matching of patients with their medications and treatments. The enthusiasm for using RFID technology in medical settings has been tempered by privacy concerns. We discuss new encryption methods that address these concerns.
Isolation with flexibility: a resource management framework for central servers
Authors: David G. Sullivan, Margo I. Seltzer
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

Proportional-share resource management is becoming increasingly important in today's computing environments. In particular, the growing use of the computational resources of central service providers argues for a proportional-share approach that allows resource principals to obtain allocations that reflect their relative importance. In such environments, resource principals must be isolated from one another to prevent the activities of one principal from impinging on the resource rights of others. However, such isolation limits the flexibility with which resource allocations can be modified to reflect the actual needs of applications. We present extensions to the lottery-scheduling resource management framework that increase its flexibility while preserving its ability to provide secure isolation. To demonstrate how this extended framework safely overcomes the limits imposed by existing proportional-share schemes, we have implemented a prototype system that uses the framework to manage CPU time, physical memory, and disk bandwidth. We present the results of experiments that evaluate the prototype, and we show that our framework has the potential to enable server applications to achieve significant gains in performance.
Centertrack: an IP overlay network for tracking DoS floods
Authors: Robert Stone
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

Finding the source of forged Internet Protocol (IP) datagrams in a large, high-speed network is difficult due to the design of the IP protocol and the lack of sufficient capability in most high-speed, high-capacity router implementations. Typically, not enough of the routers in such a network are capable of performing the packet forwarding diagnostics required for this. As a result, tracking-down the source of a flood-type denial-of-service (DoS) attack is usually difficult or impossible in these networks. CenterTrack is an overlay network, consisting of IP tunnels or other connections, that is used to selectively reroute interesting datagrams directly from edge routers to special tracking routers. The tracking routers, or associated sniffers, can easily determine the ingress edge router by observing from which tunnel the datagrams arrive. The datagrams can be examined, then dropped or forwarded to the appropriate egress point. This system simplifies the work required to determine the ingress adjacency of a flood attack while bypassing any equipment which may be incapable of performing the necessary diagnostic functions.
Augmented RAC codes in block-coded phase/frequency modulation schemes
Authors: L. Kaya
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

A new block-coded phase/frequency modulation (BCM) scheme for augmented row and column (ARAC) is presented. A BCM scheme based on the trellis diagram is shown. The procedure of encoding, mapping, and decoding of the proposed BCM method are given. The method of constructing ARAC codes from original row and column (RAC) codes is given. The trellis diagram construction procedure of ARAC codes is illustrated. Examples of ARAC coding and their use in the BCM scheme are presented. 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
Towards Practical Security Monitors of UML Policies for Mobile Applications
Authors: Fabio Massacci, Katsiaryna Naliuka
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

There is an increasing demand for security mechanisms for mobile devices that will be able to control execution of different interacting applets in a concurrent environment. An analysis of the security requirements for the booming domain of mobile games [4] shows that to capture some of the requirements we need to introduce a notion of session. A session accumulates all events that occur in the application since we have started it and until it is terminated. Then we can aggregate the constraints into two large classes: constraints on the current session and constraints across multiple sessions of the application (or its interaction with other applications).
Do Children Understand Binary Numbers by Electric Card Game?
Authors: Hiroyuki Mitsuhara, Hiroaki Ogata, Kazuhide Kanenishi, Yoneo Yano
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

This paper describes the card game enhanced learning where a child learns how to translate a binary number to the corresponding decimal number by playing Concentration (one of popular card games) with some children. We developed the prototype system of computer-based Concentration that substitutes RFID cards for the playing cards. We demonstrated the prototype system at an educational event for children. From the demonstration, we observed that the participants (children) enjoyed the Concentration and had interest in binary numbers.
Enhancing Text Retrieval Performance using Conceptual Ontological Graph
Authors: Shady Shehata, Fakhri Karray, Mohamed Kamel
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Most of the data representation techniques are based on word and/or phrase analysis of the text. The statistical analysis of a term (word or phrase) frequency captures the importance of the term within a document. However, to achieve a more accurate analysis, the underlying data representation should indicate terms that capture the semantics of the text from which the importance of a term in a sentence and in the document can be derived. A new concept-based representation that relies on the analysis of the sentence semantics, rather than, the traditional analysis of the document dataset only is introduced. The proposed conceptual ontological graph representation denotes the terms which contribute to the sentence semantics. Then, each term is chosen based on its position in the proposed representation. Lastly, the selected terms are associated to their documents as features for the purpose of indexing in the text retrieval. Experiments using the proposed conceptual ontological graph representation in text retrieval are conducted. The evaluation of results is relied on two quality measures, the precision and the recall. Both of these quality measures improved when the newly developed representation is used to enhance the performance of the text retrieval.
Data ONTAP GX: a scalable storage cluster
Authors: Michael Eisler, Peter Corbett, Michael Kazar, Daniel S. Nydick, Christopher Wagner
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Data ONTAP GX is a clustered Network Attached File server composed of a number of cooperating filers. Each filer manages its own local file system, which consists of a number of disconnected flexible volumes. A separate namespace infrastructure runs within the cluster, which connects the volumes into one or more namespaces by means of internal junctions. The cluster collectively exposes a potentially large number of separate virtual servers, each with its own independent namespace, security and administrative domain. The cluster implements a protocol routing and translation layer which translates requests in all incoming file protocols into a single unified internal file access protocol called SpinNP. The translated requests are then forwarded to the correct filer within the cluster for servicing by the local file system instance. This provides data location transparency, which is used to support transparent data migration, load balancing, mirroring for load sharing and data protection, and fault tolerance. The cluster itself greatly simplifies the administration of a large number of filers by consolidating them into a single system image. Results from benchmarks (over one million file operations per second on a 24 node cluster) and customer experience demonstrate linear scaling.