ppxscal/embedding_network huggingface dataset:
Evaluation of Ta and TaN-based Cu diffusion barriers deposited by advanced Hi-Fill (AHF) sputtering onto blanket wafers and high aspect ratio structures
Authors: S. R. Burgess, H. Donohue, K. Buchanan, N. Rimmer, P. Rich
Venue: Microelectronic Engineering (2002)

This paper investigates the properties of Ta and Ta(N) barrier layers deposited by Advanced Hi-Fill® (AHF) sputtering onto both blanket and patterned wafers. The differences, in terms of forming an effective diffusion barrier, between Ta and Ta(N) barriers of varying N2 content and the important integration issues that are brought about by the comparison of blanket and patterned wafers are emphasised. In particular, from the blanket study we find that Ta(N) films with high N2 content form the best diffusion barriers to Cu, while the study on patterned wafers indicates that an intermediate N2 flow consistent with a blanket deposition of mixed phase b.c.c, and β Ta forms the optimum barrier in terms of maximised sidewall coverage and material quality.
Techniques for including dielectrics when extracting passive low-order models of high speed interconnect
Authors: Luca Daniel, Alberto Sangiovanni-Vincentelli, Jacob White
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Interconnect structures including dielectrics can be modeled by an integral equation method using volume currents and surface charges for the conductors, and volume polarization currents and surface charges for the dielectrics. In this paper we describe a mesh analysis approach for computing the discretized currents in both the conductors and the dielectrics. We then show that this fully mesh-based formulation can be cast into a form using provably positive semidefinite matrices, making for easy application of Krylovsubspace based model-reduction schemes to generate accurate guaranteed passive reduced-order models. Several printed circuit board examples are given to demonstrate the effectiveness of the strategy.
Analyzing and Comparing Montgomery Multiplication Algorithms
Authors: Çetin Kaya Koç, Tolga Acar, Burton S. Kaliski,  Jr.
Venue: IEEE Micro (1996)

This article discusses several Montgomery multiplication algorithms, two of which have been proposed before. We describe three additional algorithms, and analyze in detail the space and time requirements of all five methods. These algorithms have been implemented in C and in assembler. The analyses and actual performance results indicate that the Coarsely Integrated Operand Scanning (CIOS) method, detailed in this article, is the most efficient of all five algorithms, at least for the general class of processor we considered. The Montgomery multiplication methods constitute the core of the modular exponentiation operation which is the most popular method used in public-key cryptography for encrypting and signing digital data.
Objective vs. Subjective Measures of Error-Proneness for Rule-Based Programs
Authors: Trevor T. Moores
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

This paper relates four objective measures of program structure and three subjective ratings of program complexity to the number of postrelease documented errors contained within 80 commercially developed Prolog programs. All seven measures show a significant correlation with the number of errors. A factor analysis showed that the objective and subjective measures were indeed different measures, although a hierarchical analysis of oblique factors showed a strong common root. Finally, the Mann-Whitney U test was used to determine whether the measures could differentiate between those programs with errors and those with no documented errors. The results suggest that "complexity" can be grounded in terms of the difficulty to debug or test a program, while measures of "structure" require a detailed count of the number of predicates used within the program.
Paracompactness in L-topological spaces
Authors: Fu-Gui Shi, Chong-You Zheng
Venue: Fuzzy Sets and Systems (2002)

In this paper a certain fuzzy paracompactness is presented by means of the concept of α-locally finite family of L-fuzzy sets. The concept of α-locally finite family can be used to characterize fuzzy countable compactness. This fuzzy paracompactness is a natural generalization of Lowen fuzzy compactness. A fuzzy countably compact L-set is fuzzy paracompact if and only if it is fuzzy compact. A topological space (X, J) is paracompact if and only if its induced space (X, ω(J)) is fuzzy paracompact. When ms(L) ≤ ω, the fuzzy enhanced real line R(L) is fuzzy paracompact. The product of a fuzzy compact set and a fuzzy paracompact set is fuzzy paracompact. A fuzzy strongly T2 paracompact space is strongly S*-regular and strongly WS*-normal. Moreover a strongly S*-regular Lindelöf space is fuzzy paracompact.
Structure from Motion Causally Integrated Over Time
Authors: A. Chiuso, P. Favaro, H. Jin, S. Soatto
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We describe an algorithm for reconstructing three-dimensional structure and motion causally, in real time from monocular sequences of images. We prove that the algorithm is minimal and stable, in the sense that the estimation error remains bounded with probability one throughout a sequence of arbitrary length. We discuss a scheme for handling occlusions (point features appearing and disappearing) and drift in the scale factor. These issues are crucial for the algorithm to operate in real time on real scenes. We describe in detail the implementation of the algorithm, which runs on a personal computer and has been made available to the community. We report the performance of our implementation on a few representative long sequences of real and synthetic images. The algorithm, which has been tested extensively over the course of the past few years, exhibits honest performance when the scene contains at least 20-40 points with high contrast, when the relative motion is slow compared to the sampling frequency of the frame grabber (30Hz), and the lens aperture is large enough (typically more than 30^o of visual field).
A Foundation for Conventional and Temporal Query Optimization Addressing Duplicates and Ordering
Authors: Giedrius Slivinskas, Christian S. Jensen, Richard Thomas Snodgrass
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Most real-world databases contain substantial amounts of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications may benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation, optimization, and processing mechanisms must be provided. This paper presents a foundation for query optimization that integrates conventional and temporal query optimization and is suitable for both conventional DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing for temporal queries, thus generalizing all existing approaches known to the authors. It includes a temporally extended relational algebra to which SQL and temporal SQL queries may be mapped, six types of algebraic equivalences, concrete query transformation rules that obey different equivalences, a procedure for determining which types of transformation rules are applicable for optimizing a query, and a query plan enumeration algorithm. The presented approach partitions the work required by the database implementor to develop a provably correct query optimizer into four stages: The database implementor has to 1) specify operations formally, 2) design and prove correct appropriate transformation rules that satisfy any of the six equivalence types, 3) augment the mechanism that determines when the different types of rules are applicable to ensure that the enumeration algorithm applies the rules correctly, and 4) ensure that the mapping generates a correct initial query plan.
A Rotation Invariant Rule-Based Thinning Algorithm for Character Recognition
Authors: Maher Ahmed, Rabab Ward
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper presents a novel rule-based system for thinning. The unique feature that distinguishes our thinning system is that it thins symbols to their central lines. This means that the shape of the symbol is preserved. It also means that the method is rotation invariant. The system has 20 rules in its inference engine. These rules are applied simultaneously to each pixel in the image. Therefore, the system has the advantages of symmetrical thinning and speed. The results show that the system is very efficient in preserving the topology of symbols and letters written in any language.
Hierarchical Wrapper Induction for Semistructured Information Sources
Authors: Ion Muslea, Steven Minton, Craig A. Knoblock
Venue: Autonomous Agents and Multi-Agent Systems (2001)

With the tremendous amount of information that becomes available on the Web on a daily basis, the ability to quickly develop information agents has become a crucial problem. A vital component of any Web-based information agent is a set of wrappers that can extract the relevant data from semistructured information sources. Our novel approach to wrapper induction is based on the idea of hierarchical information extraction, which turns the hard problem of extracting data from an arbitrarily complex document into a series of simpler extraction tasks. We introduce an inductive algorithm, STALKER, that generates high accuracy extraction rules based on user-labeled training examples. Labeling the training data represents the major bottleneck in using wrapper induction techniques, and our experimental results show that STALKER requires up to two orders of magnitude fewer examples than other algorithms. Furthermore, STALKER can wrap information sources that could not be wrapped by existing inductive techniques.
Ambiguous Configurations for the 1D Structure and Motion Problem
Authors: Kalle Åström, Fredrik Kahl
Venue: Journal of Mathematical Imaging and Vision (2003)

In this paper we investigate, determine and classify the critical configurations for solving structure and motion problems for 1D retina vision. We give a complete categorization of all ambiguous configurations for a 1D (calibrated or uncalibrated) perspective camera irrespective of the number of points and views. It is well-known that the calibrated and uncalibrated case are linked through the circular points. This link enables us to solve for both cases simultaneously. Another important tool is the duality in exchanging points and cameras and its corresponding Cremona transformation. These concepts are generalized to the 1D case and used for the investigation of ambiguous configurations. Several examples and illustrations are also provided to explain the results and to provide geometrical insight.
SQL Extension for Interval Data
Authors: Nikos A. Lorentzos, Yannis G. Mitsopoulos
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

IXSQL, an extension to SQL, is proposed for the management of interval data. IXSQL is syntactically and semantically upwards consistent with SQL2. Its specification has been based both on theoretical results and actual user requirements for the management of temporal data, a special case of interval data. Design decisions and implementation issues are also discussed.
Navigation patterns & usability of zoomable user interfaces: with and without an overview
Authors: Kasper Hornbaek, Benjamin B. Bederson, Catherine Plaisant
Venue: interactions (2003)

The following abstracts are from recent issues and the forthcoming issue of ACM's Transactions of Computer Human Interaction (ToCHI). They are included here to alert interactions' readers to what research is being done in the field of Computer Human Interaction. The complete papers, when published, can be found in ACM's Digital Library at www.acm.org/pubs/contents/journals/tochi/
Formally Analyzed Dynamic Synthesis of Hardware
Authors: Kong Woei Susanto, Tom Melham
Venue: The Journal of Supercomputing (2001)

Dynamic hardware reconfiguration based on run-time system specialization is viable with FPGAs. The research challenge for formal verification is to help ensure the correctness of dynamically generated hardware. In this paper, the approach is to verify a specialization synthesis algorithm used to reconfigure FPGA designs at run-time. The verification approach is based on a deep embedding of a language for netlist and the relational hardware modeling style.
Launching Extreme Programming at a Process-Intensive Company
Authors: James Grenning
Venue: IEEE Software (2001)

The author describes a project that was started using many Extreme Programming practices in a company that has a traditional formal development process. He discusses how XP was proposed to management, how the project seed was started and grown, what the team faced during its first six months, and what worked.
A complete characterization of complete intersection-type preorders
Authors: M. Dezani-Ciancaglini, F. Honsell, F. Alessi
Venue: ACM Transactions on Computational Logic (TOCL) (2003)

We characterize those type preorders which yield complete intersection-type assignment systems for &lambda;-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics, the simple semantics, and the F-semantics. These semantics arise by taking as interpretation of types subsets of applicative structures, as interpretation of the preorder relation, &leq;, set-theoretic inclusion, as interpretation of the intersection constructor, &cap;, set-theoretic intersection, and by taking the interpretation of the arrow constructor, &rightarrow; &agrave; la Scott, with respect to either any possible functionality set, or the largest one, or the least one.These results strengthen and generalize significantly all earlier results in the literature, to our knowledge, in at least three respects. First of all the inference semantics had not been considered before. Second, the characterizations are all given just in terms of simple closure conditions on the preorder relation, &leq;, on the types, rather than on the typing judgments themselves. The task of checking the condition is made therefore considerably more tractable. Last, we do not restrict attention just to &lambda;-models, but to arbitrary applicative structures which admit an interpretation function. Thus we allow also for the treatment of models of restricted &lambda;-calculi. Nevertheless the characterizations we give can be tailored just to the case of &lambda;-models.
Passion: Optimized I/O for Parallel Applications
Authors: Rajeev Thakur, Alok Choudhary, Rajesh Bordawekar, Sachin More, Sivaramakrishna Kuditipudi
Venue: Computer (1996)

We have implemented Passion on Intel's Paragon, Touchstone Delta, and iPSC/860 systems, and on the IBM SP system. We have also made it publicly available through the World Wide Web (http://www.cat.syr.edu/passion.html). We are in the process of porting the library to other machines and extending its functionality.
The Importance of Prepass Code Scheduling for Superscalar and Superpipelined Processors
Authors: Daniel M. Lavery, Pohua P. Chang, Scott A. Mahlke, William Y. Chen, Wen-mei W. Hwu
Venue: IEEE Transactions on Computers (1995)

Superscalar and superpipelined processors utilize parallelism to achieve peak performance that can be several times higher than that of conventional scalar processors. In order for this potential to be translated into the speedup of real programs, the compiler must be able to schedule instructions so that the parallel hardware is effectively utilized. Previous work has shown that prepass code scheduling helps to produce a better schedule for scientific programs, but the importance of prescheduling has never been demonstrated for control-intensive non-numeric programs. These programs are significantly different from the scientific programs because they contain frequent branches. The compiler must do global scheduling in order to find enough independent instructions.In this paper, the code optimizer and scheduler of the IMPACT-I C compiler is described. Within this framework, we study the importance of prepass code scheduling for a set of production C programs. It is shown that, in contrast to the results previously obtained for scientific programs, prescheduling is not important for compiling control-intensive programs to the current generation of superscalar and superpipelined processors. However, if some of the current restrictions on upward code motion can be removed in future architectures, prescheduling would substantially improve the execution time of this class of programs on both superscalar and superpipelined processors.
Jini Home Networking: A Step toward Pervasive Computing
Authors: Rahul Gupta, Sumeet Talwar, Dharma P. Agrawal
Venue: Computer (2002)

Two trends are moving us closer to pervasive computing. First, recentadvances in technology fuel the market for intelligent devices that caninteract with each other anytime, worldwide. Second, decreasing processor costsand size let engineers endow thesedevices with application-specific processingpower. Home networks represent a significant step toward realizing the pervasive computing vision. Because a home network allows appliances to communicate witheach other, it needs a technology that can seamlessly integrate assorted devices intoa monolithic communications network. Jini accomplishes this by integrating distributedcomputing, network-based services, and reliable smart devices in a scalable network without administrative overhead.
A Space-and-Time-Efficient Coding Algorithm for Lattice Computations
Authors: D. D. Ganguly, C. K. Mohan, S. Ranka
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

We present an encoding algorithm for lattices that significantly reduces space requirements while allowing fast computations of least upper bounds and greatest lower bounds of pairs of elements. We analyze the algorithms for encoding, LUB and GLB computations, and prove their correctness. Empirical experiments reveal that our method is significantly more space efficient than the transitive closure method, and the saving becomes increasingly more important as the size of the lattice increases.
Reciprocal-Wedge Transform for Space-Variant Sensing
Authors: Frank Tong, Ze-Nian Li
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

The Reciprocal-Wedge Transform (RWT) is presented as an alternative to the log-polar transform which has been a popular model for space-variant sensing in computer vision. The log-polar transform provides efficient data reduction. It simplifies the centric rotational and scaling image transformations. However, it adversely complicates the linear features and translational transformations. The RWT facilitates an anisotropic variable resolution. Unlike the log-polar, its variable resolution is predominantly in one dimension. Consequently, the RWT preserves linearity of lines and translations in the original image. In this paper, a concise matrix representation of the RWT is presented. Its properties in geometrical transformations and data reduction are described. A projective model for the transform and a potential hardware RWT camera design are also illustrated.As examples of initial applications, the RWT is used for finding road directions in navigation, and for recovering depth in motion stereo. Two types of motion stereo are presented, namely the longitudinal and lateral motion stereo. In all cases, the RWT images offer much reduced and adequate data owing to the variable resolution. In road navigation, perspective distortion of the road image is readily corrected by the variable resolution of the RWT. In cases of the motion stereo, the correspondence problem in the RWT domain is reduced to a simpler problem of extracting collinear points in the epipolar plane. Preliminary experimental results from test images of road-vehicle navigation and moving objects on a miniature assembly line are demonstrated.
An Abstraction-Based Approach to 3-D Pose Determination from Range Images
Authors: F. Quek, Ramesh Jain, T. E. Weymouth
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An abstraction-based paradigm that makes explicit the process of imposing assumptions on data is discussed. The units of abstraction are models in which levels of abstraction are determined by the degree of assumption necessary for their application. A general-to-specific refinement process provides a mechanism to proceed gracefully through the abstraction hierarchy. This strategy was applied to the recognition and pose determination of objects comprising simple and compound cylindrical and planar surfaces in dense range data. A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximations of surfaces is demonstrated. A means for determining the pose of constructed geometric forms whose algebraic surface descriptions are nonlinear in terms of their orienting parameters is developed. It is shown that biquadratic surfaces are suitable companion-linear forms for cylinder approximation and parameter estimation. The estimates provide the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data.
A Modified Rank One Update Which Converges Q-Superlinearly
Authors: P. Spellucci
Venue: Computational Optimization and Applications (2001)

Quasi-Newton methods are generally held to be the most efficient minimization methods for small to medium sized problems. From these the symmetric rank one update of Broyden (Math. Comp., vol. 21, pp. 368&ndash;381, 1967) has been disregarded for a long time because of its potential failure. The work of Conn, Gould and Toint (Math. Prog., vol. 50, pp. 177&ndash;195, 1991), Kelley and Sachs (COAP, vol. 9, pp. 43&ndash;64, 1998) and Khalfan, Byrd and Schnabel (SIOPT, vol. 3, pp. 1&ndash;24, 1993&semi; SIOPT, vol. 6, pp. 1025&ndash;1039, 1996) has renewed the interest in this method. However the question of boundedness of the generated matrix sequence has not been resolved by this work. In the present paper it is shown that a slightly modified version of this update generates bounded updates and converges superlinearly for uniformly convex functions. Numerical results support these theoretical considerations.
Transactional lock-free execution of lock-based programs
Authors: Ravi Rajwar, James R. Goodman
Venue: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems (2002)

This paper is motivated by the difficulty in writing correct high-performance programs. Writing shared-memory multi-threaded programs imposes a complex trade-off between programming ease and performance, largely due to subtleties in coordinating access to shared data. To ensure correctness programmers often rely on conservative locking at the expense of performance. The resulting serialization of threads is a performance bottleneck. Locks also interact poorly with thread scheduling and faults, resulting in poor system performance.We seek to improve multithreaded programming trade-offs by providing architectural support for optimistic lock-free execution. In a lock-free execution, shared objects are never locked when accessed by various threads. We propose Transactional Lock Removal (TLR) and show how a program that uses lock-based synchronization can be executed by the hardware in a lock-free manner, even in the presence of conflicts, without programmer support or software changes. TLR uses timestamps for conflict resolution, modest hardware, and features already present in many modern computer systems.TLR's benefits include improved programmability, stability, and performance. Programmers can obtain benefits of lock-free data structures, such as non-blocking behavior and wait-freedom, while using lock-protected critical sections for writing programs.