ppxscal/embedding_network huggingface dataset:
Design Trade-Offs in VAX-11 Translation Buffer Organization
Authors: M. Satyanarayanan
Venue: Computer (1981)

A major feature of the VAX-11 is its large virtual address space. This trace-driven simulation scheme evaluates address translation hardware that supports this feature cost-effectively.
Persistent access control: a formal model for drm
Authors: Alapan Arnab, Andrew Hutchison
Venue: Proceedings of the 2007 ACM workshop on Digital Rights Management (2007)

Digital rights management (DRM) can be considered to be a mechanism to enforce access control over a resource without considering its location. There are currently no formal models for DRM, although there has been some work in analysing and formalising the interpretation of access control rules in DRM systems. A formal model for DRM is essential to provide specific access control semantics that are necessary for creating interoperable, unambiguous implementations. In this paper, we discuss how DRM differs as an access control model to the three well known traditional access control models - DAC, MAC and RBAC, and using these existing approaches motivate a set of requirements for a formal model for DRM. Thereafter, we present a formal description of LiREL, a rights expression language that is able to express access control policies and contractual agreement in a single use license. Our motivation with this approach is to identify the different components in a license contract and define how these components interact within themselves and with other components of the license. A formal notation allows for an uniform and unambiguous interpretation and implementation of the access control policies.
Analysis on the mutual inductance of planar transformer in CMOS technology
Authors: Heng-Ming Hsu, Chien-Wen Tseng, Hsien-Feng Liao
Venue: Microelectronic Engineering (2008)

An analytical formula for calculating the mutual inductance of planar transformer has been developed in CMOS technology. The proposed formula can predict different turn ratios between primary and secondary coils. Two on-chip transformers have been measured to verify this formula, the results demonstrate the proposed formula is feasible. Furthermore, the equivalent circuit and the corresponding model are proposed to describe the high frequency behavior.
Record matching in digital library metadata
Authors: Min-Yen Kan
Venue: Communications of the ACM (2008)

Using evidence from external sources to create more accurate matching systems.
The Many Faces of Simulation
Authors: I. M. Kay
Venue: Computer (1977)

The meaning of computer simulation, like beauty, rests in the eyes of the beholder. To the practitioner of econometrics, a model may be a complex algorithm, and he will simulate the prosperity (or poverty) of municipalities, states, and nations on the basis of the different values of the variables. Others have defined simulation as "the development and use of models to aid in the evaluation of ideas and the study of dynamic systems or situations."1The first paper in this issue will provide another definition. Obviously, more definitions could be quoted, but of one thing we can be certain: simulation provides a laboratory in which we can test proposals without subjecting ourselves to the penalties of trial in the real world. These penalties, in cost and time, have provided the motivation for developing the art of simulation.
Full Search of Side-Information in Distributed Video Coding
Authors: Yixuan Zhang, Ce Zhu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Distributed video coding (DVC) has attracted increasing research efforts due to the requirements of low complexity encoders for portable wireless video communication devices. The recently proposed DVC scheme using Low-Density-Parity-Check-Accumulate (LDPCA) code with hash-based motion estimation at the decoder has achieved very good performance. However, there is still a performance gap compared with conventional video coding schemes. In this paper, we propose a scheme using a full search for side-information to obtain the best possible side-information at the decoder without hash or other extra bits, thus improving the coding efficiency. The simulation results validate the effectiveness of the proposed scheme with better rate-distortion performance compared with the original hash-based LDPCA scheme.
On the Minimization of the Width of the Control Memory of Microprogrammed Processors
Authors: J. -L. Baer
Venue: IEEE Transactions on Computers (1979)

A branch and bound method to minimize the width of the control memory of microprogrammed processors is given. Although it is exponential in the worst case, it appears much more effective than previous enumerative solutions. Furthermore, it can lead quickly to near-optimal solutions representing "good engineering" reductions.
A framework for using materialized XPath views in XML query processing
Authors: Andrey Balmin, Fatma Özcan, Kevin S. Beyer, Roberta J. Cochrane, Hamid Pirahesh
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

XML languages, such as XQuery, XSLT and SQL/XML, employ XPath as the search and extraction language. XPath expressions often define complicated navigation, resulting in expensive query processing, especially when executed over large collections of documents. In this paper, we propose a framework for exploiting materialized XPath views to expedite processing of XML queries. We explore a class of materialized XPath views, which may contain XML fragments, typed data values, full paths, node references or any combination thereof. We develop an XPath matching algorithm to determine when such views can be used to answer a user query containing XPath expressions. We use the match information to identify the portion of an XPath expression in the user query which is not covered by the XPath view. Finally, we construct, possibly multiple, compensation expressions which need to be applied to the view to produce the query result. Experimental evaluation, using our prototype implementation, shows that the matching algorithm is very efficient and usually accounts for a small fraction of the total query compilation time.
Compiler-Directed Energy Optimization for Parallel Disk Based Systems
Authors: Seung Woo Son, Guangyu Chen, Ozcan Ozturk, Mahmut Kandemir, Alok Choudhary
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Disk subsystem is known to be a major contributor to overall power consumption of high-end parallel systems. Past research proposed several architectural level techniques to reduce disk power by taking advantage of idle periods experienced by disks. While such techniques have been known to be effective in certain cases, they share a common drawback: they operate in a reactive manner; i.e., they control disk power by observing past disk activity (e.g., idle and active periods) and estimating future ones. Consequently, they can miss opportunities for saving power and incur significant performance penalties, due to inaccuracies in predicting idle and active times. Motivated by this observation, this paper proposes and evaluates a compiler-driven approach to reducing disk power consumption of array-based scientific applications executing on parallel architectures. The proposed approach exposes disk layout information to compiler, allowing it to derive disk access pattern, i.e., the order in which parallel disks are accessed. This paper demonstrates two uses of this information. First, we can implement proactive disk power management, i.e., we can select the most appropriate powersaving strategy and disk preactivation strategy based on the compiler-predicted future idle and active periods of parallel disks. Second, we can restructure the application code to increase length of idle disk periods, which leads to better exploitation of available power-saving capabilities. We implemented both these approaches within an optimizing compiler and tested their effectiveness using a set of benchmark codes from the Spec2000 suite and a disk power simulator. Our results show that the compiler-driven disk power management is very promising. The experimental results also reveal that, while proactive disk power management is very effective, code restructuring for disk power achieves additional energy savings across all the benchmarks tested, and these savings are very close to optimal savings that can be obtained through an ILP (Integer Linear Programming) based scheme.
Frequency Selective Model Order Reduction via Spectral Zero Projection
Authors: Mehboob Alam, Arthur Nieuwoudt, Yehia Massoud
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

As process technology continues to scale into the nanoscale regime, interconnect plays an ever increasing role in determining VLSI system performance. As the complexity of these systems increases, reduced order modeling becomes critical. In this paper, we develop a new method for the model order reduction of interconnect using frequency restrictive selection of interpolation points based on the spectral-zeros of the RLC interconnect model's transfer function. The methodology uses the imaginary part of spectral zeros for frequency selective projection and provides stable as well as passive reduced order models for interconnect in VLSI systems. For large order interconnect models with realistic RLC parameters, the results indicate that our method provides more accurate approximations than techniques based on balanced truncation and moment matching with excellent agreement with the original system's transfer function.
Study of electrochemical etch-stop for high-precision thickness control of single-crystal Si in aqueous TMAH: IPA : pyrazine solutions
Authors: Gwiy-Sang Chung
Venue: Microelectronic Engineering (2008)

In this paper, we describe a method of controlling the thickness of single-crystal Si membranes, fabricated by wet anisotropic etching in aqueous tetramethyl ammonium hydroxide (TMAH) : isopropyl alcohol (IPA) : pyrazine solutions. The Si surface of the etch-stopped microdiaphragm is extremely flat with no noticeable taper or nonuniformity. The benefits of the electrochemical etch-stop method for the etching of n epilayer-embedded p-type single-crystal Si(001) wafers in aqueous TMAH became apparent when the reproducibility of the microdiaphragm's thickness in mass production was realized. The results indicated that the use of the electrochemical etch-stop method for the etching of Si in aqueous TMAH provided a powerful and versatile alternative process for the fabrication of high-yield Si microdiaphragms (20+/-0.26@mm s.d). With etch-stop, the pressure sensitivity of devices fabricated on the same wafer can be controlled to within +/-2.3% s.d.
Errata
Venue: Computer (1981)

The dates for COMPSAC 81, the IEEE Computer Society's Fifth International Computer Software and Applications Conference, have been changed since their listing in the Calendar and Call for Papers sections of the February issue of Computer. The correct dates are tutorials, November 16-17; Conference, November 18-20, 1981. 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
A two-stage approach to domain adaptation for statistical classifiers
Authors: Jing Jiang, ChengXiang Zhai
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

In this paper, we consider the problem of adapting statistical classifiers trained from some source domains where labeled examples are available to a target domain where no labeled example is available. One characteristic of such a domain adaptation problem is that the examples in the source domains and the target domain are known to follow different distributions. Thus a regular classification method would tend to overfit the source domains. We present a two-stage approach to domain adaptation, where at the first <generalization stage, we look for a set of features generalizable across domains, and at the second adaptation stage, we pick up useful features specific to the target domain. Observing that the exact objective function is hard to optimize, we then propose a number of heuristics to approximately achieve the goal of generalization and adaptation. Our experiments on gene name recognition using a real data set show the effectiveness of our general framework and the heuristics.
Online fault tolerance for FPGA logic blocks
Authors: John M. Emmert, Charles E. Stroud, Miron Abramovici
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Most adaptive computing systems use reconfigurable hardware in the form of field programmable gate arrays (FPGAs). For these systems to be fielded in harsh environments where high reliability and availability are a must, the applications running on the FPGAs must tolerate hardware faults that may occur during the lifetime of the system. In this paper, we present new fault-tolerant techniques for FPGA logic blocks, developed as part of the roving self-test areas (STARs) approach to online testing, diagnosis, and reconfiguration [1]. Our techniques can handle large numbers of faults (we show tolerance of over 100 logic faults via actual implementation on an FPGA consisting of a 20 × 20 array of logic blocks). A key novel feature is the reuse of defective logic blocks to increase the number of effective spares and extend the mission life. To increase fault tolerance, we not only use nonfaulty parts of defective or partially faulty logic blocks, but we also use faulty parts of defective logic blocks in nonfaulty modes. By using and reusing faulty resources, our multilevel approach extends the number of tolerable faults beyond the number of currently available spare logic resources. Unlike many column, row, or tile-based methods, our multilevel approach can tolerate not only faults that are evenly distributed over the logic area, but also clusters of faults in the same local area. Furthermore, system operation is not interrupted for fault diagnosis or for computing fault-bypassing configurations. Our fault tolerance techniques have been implemented using ORCA 2C series FPGAs which feature incremental dynamic runtime reconfiguration.
Realization Methods for Asynchronous Sequential Circuits
Authors: G. Mago
Venue: IEEE Transactions on Computers (1971)

This paper gives a unified approach for describing various systematic ways of using built-in delays in normal fundamental mode circuits. The transition of the circuit from one total stable state to another is characterized by the constraints imposed upon the next-state functions, and the realization method is characterized by the conditions under which these constraints can be satisfied simultaneously.
Pricing Multi-Asset American Options: A Finite Element Method-of-Lines with Smooth Penalty
Authors: Pavlo Kovalov, Vadim Linetsky, Michael Marcozzi
Venue: Journal of Scientific Computing (2007)

This paper studies the problem of pricing multi-asset American-style options in the Black---Scholes---Merton framework. The value function of an option contract is known to satisfy a partial differential variational inequality (PDVI) when early exercise is permitted. We develop a computational method for the valuation of multi-asset American-style options based on approximating the PDVI by a non-linear penalized PDE with a penalty term with continuous Jacobian. We convert the non-linear PDE to a variational (weak) form, discretize the weak formulation spatially by a Galerkin finite element method to obtain a system of ODEs, and integrate the resulting system of ODEs in time with an adaptive variable order and variable step size solver SUNDIALS. Numerical results demonstrate that employing a penalty term with continuous Jacobian in contrast to the penalty terms with discontinuous Jacobians in use in the literature improves computational performance of the adaptive temporal integrator. In our framework we are able to price American-style options with payoffs dependent on up to six assets on a PC. This is in contrast to the existing literature on the pricing of American options by PDE methods, that has so far been limited to at most three-dimensional problems. Our results open avenues for further applications to multi-dimensional problems, such as pricing convertible bonds in multi-factor models, that will be explored in future work.
Distributed Nearest Neighbor-Based Condensation of Very Large Data Sets
Authors: Fabrizio Angiulli, Gianluigi Folino
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

In this work, PFCNN, a distributed method for computing a consistent subset of very large data set for the nearest neighbor classification rule is presented. In order to cope with the communication overhead typical of distributed environments and to reduce memory requirements, different variants of the basic PFCNN method are introduced. An analysis of spatial cost, CPU cost, and communication overhead is accomplished for all the algorithms. Experimental results, performed on both synthetic and real very large data sets, revealed that these methods can be profitably applied to enormous collections of data. Indeed, they scale-up well and are efficient in memory consumption, confirming the theoretical analysis, and achieve noticeable data reduction and good classification accuracy. To the best of our knowledge, this is the first distributed algorithm for computing a training set consistent subset for the nearest neighbor rule.
Brief paper: On-line identification of SISO linear time-invariant delay systems from output measurements
Authors: Oscar Gomez, Yury Orlov, Ilya V. Kolmanovsky
Venue: Automatica (Journal of IFAC) (2007)

The paper presents a theoretical treatment of on-line identification issues and develops parameter identification algorithms for a class of single input single output (SISO) linear time delay systems (LTDS) with uncertain time-invariant parameters. The delays can also be unknown if their possible values belong to a set consisting of a finite number of known values. Since only output measurements are assumed to be available, a sliding mode-based observer of an underlying SISO LTDS with uncertain parameters is constructed and utilized to design an adaptive identifier of system parameters. The theory is supported by an application of the developed algorithms to transient fuel identification in a port fuel injected (PFI) internal combustion engine.
Cognitive enhancements to support dependability
Authors: Partha Pal, Franklin Webber, Richard Schantz
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

The threat of cyber-attacks is not limited to the boundary of information systems any longer. Safety and reliability of almost any system can be compromised by exploiting the vulnerabilities in the information systems that connect with or control them. Agile and ongoing manipulation of (redundant and diverse) system components, defense mechanisms and system resources is essential for surviving attacks and continuing operation. Cyber-defense administration-- dynamic management of components, defense mechanism and systems resources--is therefore a current topic of significant interest to the dependability community. In this paper, we present our ongoing work on automated support for intelligent cyber-defense administration.
Author Identification Using Imbalanced and Limited Training Texts
Authors: Efstathios Stamatatos
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper deals with the problem of author identification. The Common N-Grams (CNG) method [6] is a language-independent profile-based approach with good results in many author identification experiments so far. A variation of this approach is presented based on new distance measures that are quite stable for large profile length values. Special emphasis is given to the degree upon which the effectiveness of the method is affected by the available training text samples per author. Experiments based on text samples on the same topic from the Reuters Corpus Volume 1 are presented using both balanced and imbalanced training corpora. The results show that CNG with the proposed distance measures is more accurate when only limited training text samples are available, at least for some of the candidate authors, a realistic condition in author identification problems.
A Fault-Driven, Comprehensive Redundancy Algorithm
Authors: John Day
Venue: IEEE Design Test (1985)

This article describes a fault-driven algorithm that generates all possible repair solutions for a given bit failure patternin a redundant RAM. Benefits of this approach include the ability to select repair solutions based on userdefined preferences(for example, fewest total elements invoked or fewest rows invoked). Perhaps the greatest advantage of this algorithm is itsability to generate solutions for any theoretically repairable die that would be deemed unrepairable by existing algorithms.
Exploring Multiple Trees through DAG Representations
Authors: Martin Graham
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a Directed Acyclic Graph visualisation designed to allow interaction with a set of multiple classification trees, specifically to find overlaps and differences between groups of trees and individual trees. The work is motivated by the need to find a representation for multiple trees that has the space-saving property of a general graph representation and the intuitive parent-child direction cues present in individual representation of trees. Using example taxonomic data sets, we describe augmentations to the common barycenter DAG layout method that reveal shared sets of child nodes between common parents in a clearer manner. Other interactions such as displaying the multiple ancestor paths of a node when it occurs in several trees, and revealing intersecting sibling sets within the context of a single DAG representation are also discussed.
Summarizing data using a similarity based mountain method
Authors: Ronald R. Yager, Dimitar P. Filev
Venue: Information Sciences: an International Journal (2008)

We consider the problem of summarizing a collection of data values. Here we use a mountain method like approach based on the similarities of the data. Fundamental to our work is the possibility of allowing for multiple summarizing values. We present an algorithm, in the spirit of the mountain method, that uses the similarity between the data points to find focus points which serve as the seed for finding summarizing centers. Central to this algorithm is a process of reducing the energy of the data points which we show can be implemented most generally using a t-norm. We provide an application of the algorithm to the problem of binning data which is used in data mining and the development of histograms. Here we allow the location of the bins to be determined by the data rather then fixed a priori.