ppxscal/embedding_network huggingface dataset:
Fixed Priority Scheduling with Limited Priority Levels
Authors: Shirish S. Sathaye, Daniel I. Katcher, Jay K. Strosnider
Venue: IEEE Transactions on Computers (1995)

This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limited priority levels. We introduce the degree of schedulable saturation (Smax) as an objective function. A multimedia task set is used to demonstrate how Smax can be used to optimize the grouping of tasks to priority levels.
Correction to "Ontological Versus Knowledge Engineering"
Authors: D. B. Lenat
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The author previously cited an incorrect publisher. The correct publisher information is: Reading, MA: Addison Wesley.
The level of nonmultiplicativity of graphs
Authors: Claude Tardif, Xuding Zhu
Venue: Discrete Mathematics (2002)

We introduce a parameter called the level of nonmultiplicativity of a graph, which is related to Hedetniemi's conjecture. We show that this parameter is equal to the number of factors in a factorization of the graph into a product of multiplicative graphs. Apart from the known multiplicative graphs, no graph is known to have a finite level of nonmultiplicativity. We show that the countably infinite complete graph KN0 has an infinite level of nonmultiplicativity and that there exist Kneser graphs with arbitrarily high levels of nonmultiplicativity.
Tracking direction of arrival with adaptive decomposed filters
Authors: Julio Vargas, Steve McLaughlin
Venue: Signal Processing (2002)

An adaptive technique for the estimation and tracking of the direction of arrival of multiple nonstationary plane waves from the outputs of a uniform linear array of sensors is presented. This task is performed by using a decomposed filtering structure to spatially isolate each signal component while a second stage is used to estimate the parameters of interest (angle of arrival). This results in a computationally simple algorithm suitable for the case of large arrays which enables the tracking of rapidly moving sources. The proposed approach is also applicable to the case of coherent signals.
Applied Operating System Concepts, 1st edition
Authors: Abraham Silberschatz, Peter Galvin, Greg Gagne
Venue:  (2001)

:This new book provides a clear description of the concepts that underlie all operating systems, using a real language--Java--to present many of the ideas. Rather than concentrating on a particular operating system or hardware, the authors discuss key concepts that are applicable to a wide variety of systems such as processes and inter-process communication, process scheduling, memory management, and IO. In addition to numerous examples of current operating systems, the book includes chapter-long case studies of UNIX, LINUX, and Windows NT.
Managing Process Diversity While Improving Your Practices
Authors: Michael Deck
Venue: IEEE Software (2001)

Software process improvement efforts will fail if we try to make development processes completely uniform across an organization. Uniform basic practices are important, but projects and subprojects will have needs that require specialized processes. By focusing on localized software practice improvement, organizations can tailor processes to meet specific needs, resulting in a more diverse set of processes to manage. This article describes software practice improvement and diversity management on one project.
Teaching the PSP: Challenges and Lessons Learned
Authors: Jürgen Börstler, David Carrington, Gregory W. Hislop, Susan Lisack, Keith Olson, Laurie Williams
Venue: IEEE Software (2002)

This article describes the experiences of five universities in using the Personal Software Process (PSP) to teach software engineering concepts in a variety of contexts. It also contains suggestions and techniques for introducing the PSP into a university curriculum. The article's objective is to encourage and guide other academics that might consider introducing the PSP in their own software engineering courses. Additionally, our experiences should be relevant to corporations considering the PSP in corporate educational programs.
Transactions and Updates in Deductive Databases
Authors: Danilo Montesi, Elisa Bertino, Maurizio Martelli
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

In this paper, we develop a new approach that provides a smooth integration of extensional updates and declarative query languages for deductive databases. The approach is based on a declarative specification of updates in rule bodies. Updates are not executed as soon are evaluated. Instead, they are collected and then applied to the database when the query evaluation is completed. We call this approach nonimmediate update semantics. We provide a top-down and equivalent bottom-up semantics which reflect the corresponding computation models. We also package set of updates into transactions and we provide a formal semantics for transactions. Then, in order to handle complex transactions, we extend the transaction language with control constructors still preserving formal semantics and semantics equivalence.
Contribution to the Determination of Vanishing Points Using Hough Transform
Authors: E. Lutton, H. Maitre, J. Lopez-Krahe
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

We propose a method to locate three vanishing points on an image, corresponding to three orthogonal directions of the scene. This method is based on two cascaded Hough transforms. We show that, even in the case of synthetic images of high quality, a naive approach may fail, essentially because of the errors due to the limitation of the image size. We take into account these errors as well as errors due to detection inaccuracy of the image segments, and provide a method efficient, even in the case of real complex scenes.
Efficient Attribute-Oriented Generalization for Knowledge Discovery from Large Databases
Authors: Colin L. Carter, Howard J. Hamilton
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

We present GDBR (Generalize DataBase Relation) and FIGR (Fast, Incremental Generalization and Regeneralization), two enhancements of Attribute-Oriented Generalization, a well-known knowledge discovery from databases technique. GDBR and FIGR are both O(n) and, as such, are optimal. GDBR is an on-line algorithm and requires only a small, constant amount of space. FIGR also requires a constant amount of space that is generally reasonable although, under certain circumstances, may grow large. FIGR is incremental, allowing changes to the database to be reflected in the generalization results without rereading input data. FIGR also allows fast regeneralization to both higher and lower levels of generality without rereading input. We compare GDBR and FIGR to two previous algorithms, LCHR and AOI, which are O(n log n) and O(np), respectively, where n is the number of input tuples and p the number of tuples in the generalized relation. Both require O(n) space that, for large input, causes memory problems. We implemented all four algorithms and ran empirical tests, and we found that GDBR and FIGR are faster. In addition, their runtimes increase only linearly as input size increases, while the runtimes of LCHR and AOI increase greatly when input size exceeds memory limitations.
Spintronics with Si quantum dots
Authors: Leonid P. Rokhinson, Lingue J. Guo, Steven Y. Chou, Daniel C. Tsui
Venue: Microelectronic Engineering (2002)

Electron transport through small Si quantum dot is investigated. The B-dependence of energy levels is dominated by the Zeeman shift, allowing us to measure the spin difference between two successive ground states directly. Combined with the ability to change the number of electrons N in the dot between 0 and 30, we are able to map the spin of the the dot as a function of N and B. Various spin-related phenomena, such as singlet-triplet transitions and spin blockade, are observed.
Introduction to Word 2002, 1st edition
Authors: David C. Kuncicky
Venue:  (2002)

:Part of EsourcePrentice Hall's Engineering Source, this book provides a flexible introduction to the use of Word in engineering. Featuring over 25 modules and growing, the ESource series provides a comprehensive resource of essential engineering topics. Covers topics such as formatting documents, using tables in documents, and writing technical documents. For any Engineer or Computer Scientist interested in a brief introduction to Word.
A Metric for Line Segments
Authors: P. F. M. Nacken
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

This correspondence presents a metric for describing line segments. This metric measures how well two line segments can be replaced by a single longer one. This depends for example on collinearity and nearness of the line segments. The metric is constructed using a new technique using so-called neighborhood functions. The behavior of the metric depends on the neighborhood function chosen. In this correspondence, an appropriate choice for the case of line segments is presented. The quality of the metric is verified by using it in a simple clustering algorithm that groups line segments found by an edge detection algorithm in an image. The fact that the clustering algorithm can detect long linear structures in an image shows that the metric is a good measure for the groupability of line segments.
A Descriptor-Based Approach to OO Code Reuse
Authors: Ernesto Damiani, Maria Grazia Fugini, Enrico Fusaschi
Venue: Computer (1997)

The COOR environment (Classification of Object-Oriented Code for Reuse) is based on an abstraction method that represents code behavior in terms of software descriptors. Descriptors constitute a classification and retrieval unit and are constructed from source code and other documentation as lists of term pairs, called features, that describe component functionalities. The protocol for efficiently extracting features from OO code interfaces assumes that methods have consistent and coherent names with respect to the concepts they represent. COOR extracts features from code semiautomatically, because it is not feasible to completely automate the information-extraction process (the process of deriving higher abstractions from lower ones). In our approach, a human expert, or application engineer, maintains the system for an audience of users, or application developers. COOR provides tools for the classification and search for reuse candidates. Our experience with COOR suggests that descriptors can provide several advantages over class interfaces. COOR descriptors support different levels of component classification granularity (like application frameworks rather than single classes). Moreover, in COOR, component behavior description is enhanced due to filtering out linguistic noise by means of a controlled vocabulary.
Compiling Communication-Efficient Programs for Massively Parallel Machines
Authors: J. Li, M. Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A method of generating parallel target code with explicit communication for massively parallel distributed-memory machines is presented. The source programs are shared-memory parallel programs with explicit control structures. The method extracts syntactic reference patterns from a program with shared address space, selects appropriate communication routines, places these routines in appropriate locations in the target program text and sets up correct conditions for invoking these routines. An explicit communication metric is used to guide the selection of data layout strategies.
Dynamic dead-instruction detection and elimination
Authors: J. Adam Butts, Guri Sohi
Venue: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems (2002)

We observe a non-negligible fraction--3 to 16% in our benchmarks--of dynamically dead instructions, dynamic instruction instances that generate unused results. The majority of these instructions arise from static instructions that also produce useful results. We find that compiler optimization (specifically instruction scheduling) creates a significant portion of these partially dead static instructions. We show that most of the dynamically instructions arise from a small set of static instructions that produce dead values most of the time.We leverage this locality by proposing a dead instruction predictor and presenting a scheme to avoid the execution of predicted-dead instructions. Our predictor achieves an accuracy of 93% while identifying over 91% of the dead instructions using less than 5 KB of state. We achieve such high accuracies by leveraging future control flow information (i.e., branch predictions) to distinguish between useless and useful instances of the same static instruction.We then present a mechanism to avoid the register allocation, instruction scheduling, and execution of predicted dead instructions. We measure reductions in resource utilization averaging over 5% and sometimes exceeding 10%, covering physical register management (allocation and freeing), register file read and write traffic, and data cache accesses. Performance improves by an average of 3.6% on an architecture exhibiting resource contention. Additionally, our scheme frees future compilers from the need to consider the costs of dead instructions, enabling more aggressive code motion and optimization. Simultaneously, it mitigates the need for good path profiling information in making inter-block code motion decisions.
Direct Estimation of Range Flow on Deformable Shape From a Video Rate Range Camera
Authors: M. Yamamoto, P. Boulanger, J. A. Beraldin, M. Rioux
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A method of estimating range flow (space displacement vector field) on nonrigid as well as rigid objects from a sequence of range images is described. This method can directly estimate the deformable motion parameters by solving a system of linear equations that are obtained from substituting a linear transformation of nonrigid objects expressed by the Jacobian matrix into motion constraints based on an extension of the conventional scheme used in intensity image sequences. The range flow is directly computed by substituting these estimated motion parameters into the linear transformation. The algorithm is supported by experimental estimations of range flow on a sheet of paper, a piece of cloth, human skin, and a rubber balloon being inflated, using real range image sequences acquired by a video rate range camera.
Mathematical modeling of three-dimensional kinetically-limited laser chemical vapor deposition
Authors: R. Nassar, C. Zhang, W. Dai, H. Lan, J. Maxwell
Venue: Microelectronic Engineering (2002)

Three-dimensional laser chemical vapor deposition is an important technique in freeform fabrication of microstructures. In order to optimize the system, a mathematical model is developed under kinetically-limited deposition for predicting laser dwell times on the surface scanned by the laser beam in order to fabricate a microstructure with a prespecified geometry. A numerical algorithm is developed based on this model. To demonstrate the applicability of the model, laser dwell times are computed in order to determine the laser scanning pattern for obtaining a parabolic microstructure, such as a microlens.
Over-Redundant Digit Sets and the Design of Digit-By-Digit Division Units
Authors: P. Montuschi, L. Ciminiera
Venue: IEEE Transactions on Computers (1994)

Over-redundant digit sets are defined as those ranging from /spl minus/s to +s, with s/spl ges/B, B being the radix. This paper presents new techniques for the direct computation of division, that use an over-redundant digit set for representing the quotient, instead of simply redundant ones used previously. In particular, general criteria for synthesizing the digit selection rules and remainder updating are given for any radix and index of redundancy. A methodology combining the use of over-redundant digit sets with the prescaling of the divisor is also studied in order to achieve radix-B division units with trivial digit selection functions. It is also shown, for the specific case of radix-4 that using a prescaling slightly wider than in a radix-4 unit by M.D. Ercegovac and T. Lang (1990) possible to avoid the digit selection table. The paper also presents a modified algorithm for on-the-fly conversion of the result into the irredundant form. The proposed methodology can be considered as an alternative to existing division techniques.
An Operating System for a Fault-Tolerant Multiprocessor Controller
Authors: Ronald D. Williams, Barry W. Johnson, Thomas E. Roberts
Venue: IEEE Micro (1988)

The development of an operating system that is a central component of a fault-tolerant multiprocessor is described. The operating system, while relatively simple and small, supports multitasking and multiprocessing, as well as both self-diagnostics and cross-diagnostics for fault detection. In the event of a fault, the system permits rapid reconfiguration in a manner that retains processing for the highest-priority tasks. Since the hardware needed to provide fault tolerance is available when there are no faults, the operating system can utilize this excess capacity to accomplish lower-priority tasks during normal operation. This approach yields graceful degradation in response to faults in the system components.
IDDQ Testing: Issues Present and Future
Authors: Jerry M. Soden, Charles F. Hawkins
Venue: IEEE Design Test (1996)

IDDQ testing has emerged from a company-specific CMOS IC test technology in the 1960's and 1970's to a worldwide-accepted technique that is a requirement for low-defect PPM levels and failure rates. It is the single most sensitive test method to detect CMOS IC defects and an abundance of studies have laid a solid foundation for why this is so.The IDDQ test uses the quiescent power supply current of logic states as an indication of defect presence. Its major requirement for maximum efficiency is that the design implement nanowatt power levels (nanoamp supply current) in the quiescent portion of the power supply current. No direct connections are allowed between VDD and VSS during the quiescent period.IDDQ testing has increased significantly since 1990, highlighting problems and driving solutions not addressed by the high reliability manufacturers of earlier technologies. Faster IDDQ instrumentation and better software tools to generate and grade IDDQ test patterns are a result of this increased interest. Two major issues confronting IDDQ testing are addressed: the yield loss issue and increased background current of deep submicron IC technologies projected by the SIA/Sematech road map. Both issues are points of controversy.
Efficient conflict driven learning in a boolean satisfiability solver
Authors: Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz, Sharad Malik
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes. Extensive experiments with real world examples show that the best performing new learning scheme has at least a 2X speedup compared with learning schemes employed in state-of-the-art SAT solvers.
Theoretical and Experimental Analysis of a Two-Stage System for Classification
Authors: Nicola Giusti, Francesco Masulli, Alessandro Sperduti
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We consider a popular approach to multicategory classification tasks: a two-stage system based on a first (global) classifier with rejection followed by a (local) nearest-neighbor classifier. Patterns which are not rejected by the first classifier are classified according to its output. Rejected patterns are passed to the nearest-neighbor classifier together with the {\rm{top}}\hbox{-}h ranking classes returned by the first classifier. The nearest-neighbor classifier, looking at patterns in the {\rm{top}}\hbox{-}h classes, classifies the rejected pattern. An editing strategy for the nearest-neighbor reference database, controlled by the first classifier, is also considered. We analyze this system, showing that even if the first level and nearest-neighbor classifiers are not optimal in a Bayes sense, the system as a whole may be optimal. Moreover, we formally relate the response time of the system to the rejection rate of the first classifier and to the other system parameters. The error-response time trade-off is also discussed. Finally, we experimentally study two instances of the system applied to the recognition of handwritten digits. In one system, the first classifier is a fuzzy basis functions network, while in the second system it is a feed-forward neural network. Classification results as well as response times for different settings of the system parameters are reported for both systems.
A Tutorial on Built-in Self-Test. I. Principles
Authors: Vishwani D. Agrawal, Charles R. Kime, Kewal K. Saluja
Venue: IEEE Design Test (1993)

An overview of built-in self-test (BIST) principles and practices is presented. The issues and economics underlying BIST are discussed, and the related hierarchical test structures are introduced. The fundamental BIST concepts of pattern generation and response analysis are explained. Linear feedback shift register theory is reviewed.
Design of LDV: A Multilevel Secure Relational Database Management
Authors: P. D. Stachour, B. Thuraisingham
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

The authors describe the design of a secure database system,LDV (Lock Data Views), that builds upon the classical security policies for operating systems. LDV is hosted on the LOgical Coprocessing Kernel (LOCK) Trusted Computing Base (TCB). LDVs security policy builds on the security policy of LOCK. Its design is based on three assured pipelines for the query, update, and metadata management operations. The authors describe the security policy of LDV, its system architecture, the designs of the query processor, the update processor, the metadata manager, and the operating system issues. LDVs solutions to the inference and aggregation problems are also described.
Measuring Dynamic Program Complexity
Authors: John C. Munson, Taghi M. Khoshgoftaar
Venue: IEEE Software (1992)

A relative complexity technique that combines the features of many complexity metrics to predict performance and reliability of a computer program is presented. Relative complexity aggregates many similar metrics into a linear compound metric that describes a program. Since relative complexity is a static measure, it is expanded by measuring relative complexity over time to find a program's functional complexity. It is shown that relative complexity gives feedback on the same complexity domains that many other metrics do. Thus, developers can save time by choosing one metric to do the work of many.
Semotus Visum: a flexible remote visualization framework
Authors: Eric J. Luke, Charles D. Hansen
Venue: Proceedings of the conference on Visualization '02 (2002)

By offering more detail and precision, large data sets can provide greater insights to researchers than small data sets. However, these data sets require greater computing resources to view and manage. Remote visualization techniques allow the use of computers that cannot be operated locally. The Semotus Visum framework applies a high-performance client-server paradigm to the problem. The framework utilizes both client and server resources via multiple rendering methods. Experimental results show the framework delivers high framerates and low latency across a wide range of data sets.