ppxscal/embedding_network huggingface dataset:
Effect of oxygen on the reactions is Si/Ta/Cu and Si/TaC/Cu systems
Authors: T. Laurila, K. Zeng, J. Molarius, T. Riekkinen, I. Suni, J. K. Kivilahti
Venue: Microelectronic Engineering (2002)

The effect of oxygen on the reactions in the Si/Ta/Cu and Si/TaC/Cu metallization systems was investigated by utilizing the assessed Ta-O binary and the evaluated ternary Ta-C-O phase diagrams together with detailed transmission electron microscopy (TEM) and secondary ion mass spectrometry analyses (SIMS). The presence of some form of amorphous tantalum oxide at the Ta/Cu and TaC/Cu interfaces was experimentally verified. The formation of the interfacial layers was explained with the help of the assessed phase diagrams as well as with the available kinetic data.
Choosing among maximals
Authors: Josep E. Peris, Begoña Subiza
Venue: Journal of Mathematical Psychology (2002)

In a choice situation, it is usually assumed that the agents select the maximal elements. Nevertheless, there are situations in which the number of maximal elements is large, and a selection inside the maximal set is then required. This selection may be done in a random way or, as we propose in this work, by obtaining additional information from the preference relation that may provide a way of discriminating among the maximal elements and selecting the "best" ones.
Assessing a Mixture Model for Clustering with the Integrated Completed Likelihood
Authors: Christophe Biernacki, Gilles Celeux, Gérard Govaert
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

We propose assessing a mixture model in a cluster analysis setting with the integrated completed likelihood. With this purpose, the observed data are assigned to unknown clusters using a maximum a posteriori operator. Then, the Integrated Completed Likelihood (ICL) is approximated using an à la Bayesian information criterion (BIC). Numerical experiments on simulated and real data of the resulting ICL criterion show that it performs well both for choosing a mixture model and a relevant number of clusters. In particular, ICL appears to be more robust than BIC to violation of some of the mixture model assumptions and it can select a number of clusters leading to a sensible partitioning of the data.
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Venue: International Conference on Computer Aided Design (2000)

On behalf of the ICCAD-2000 Executive and Technical Program Committees, I would like to welcome you tothe International Conference on Computer-Aided Design, which will take place between November 5-9 at theSan Jose DoubleTree Hotel. The technical program for ICCAD-2000 was assembled by a program committee which inclcdes experts from industry and academia around the world. The committee was organized and directed by Rolf Ernst. Its members devoted several days to reviewing the papers, and then participated in the full-day meeting to select papers from the many excellent submissions. Each paper was reviewed by at least 5 experts in the field. 86 papers were accepted from 265 papers submitted. A new part of the technical program this year is the IEEE/GAS William J. McCalla ICCAD Best Paper Award. This award is given in memory of William McCalla, for his contributions to ICCAD and his CAD technical work throughout his career. The award will be given to the authors of a best paper selected through a rigorous and multi-stage review process. It will be given during the opening session on Monday morning, November 6. Also new this year is the keynote address, which will be given by William J. Dally and is entitled "Lets Get Physical: ASICXOC Design in the Era of Wire-Limited Technology". This year we have increased the number of 90-minute tutorials to seven, as they have been a highly appreciated part of the technical program. The tutorials will cover the topics of communications systems, challenges in physical design, incremental CAD, verification, testing future systems-on-a-chip, low-power processors, and manufacturability. On Tuesday afternoon, there will be a technical panel organized by Lawrence Pileggi. The panel will be led by Richard Newton, entitled "Why Doesn't EDA Get Enough Respect", and the members will discuss the status of the CAD domain within the larger technology and businessworlds. Complementing the technical program is the 2000 tutorial program, on November 9th, organized by Andreas Kuehlmann. This year's tutorials include the following topics: 1) Algorithms for physical design, 2) Interconnect design and analysis for electrical integrity? 3) Principles and advanced techniques for symbolic model checking, and 4) Gain-based logic synthesis. The first three tutorials address the corner areas of a modern integrated synthesis flow, covering logic synthesis, layout design, and signal integrity analysis. The fourth tutorial presents recent advances in verification algorithms basecl on model checking. The rapid pace of advance at both ends - deep submicron and mixed signal technology at the physical end as well as systems-on-a-chip and platform-based design at t.he systems end-continues to make CAD research and tool development an exciting domain. ICCAD-2000 offers a place For CAD researchers, CAD developers, and VLSI designers to meet and exchange ideas about the problems and solutions for next-generation electronic systems.
Algebraic Functions For Recognition
Authors: Amnon Shashua
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In the general case, a trilinear relationship between three perspective views is shown to exist. The trilinearity result is shown to be of much practical use in visual recognition by alignment¿yielding a direct reprojection method that cuts through the computations of camera transformation, scene structure and epipolar geometry. Moreover, the direct method is linear and sets a new lower theoretical bound on the minimal number of points that are required for a linear solution for the task of reprojection. The proof of the central result may be of further interest as it demonstrates certain regularities across homographies of the plane and introduces new view invariants. Experiments on simulated and real image data were conducted, including a comparative analysis with epipolar intersection and the linear combination methods, with results indicating a greater degree of robustness in practice and a higher level of performance in reprojection tasks.
Making Components Contract Aware
Authors: Antoine Beugnard, Jean-Marc Jézéquel, Noël Plouzeau, Damien Watkins
Venue: Computer (1999)

Components have long promised to encapsulate data and programs into a box that operates predictably without requiring that users know the specifics of how it does so. Many advocates have predicted that components will bring about widespread software reuse, spawning a market for components usable with such mainstream software buses as the Common Object Request Broker Architecture (CORBA) and the Distributed Component Object Model (DCOM). In the Windows world, at least, this prediction is becoming a reality. Yet recent reports indicate mixed results when using and reusing components in mission-critical settings. Such results raise disturbing questions. How can you trust a component? What if the component behaves unexpectedly, either because it is faulty or simply because you misused it? Before we can trust a component in mission-critical applications, we must be able to determine, reliably and in advance, how it will behave. In this article the authors define a general model of software contracts and show how existing mechanisms could be used to turn traditional components into contract-aware ones.
Design of Pseudoexhaustive Testable PLA with Low Overhead
Authors: W. -Z. Shen, G. -H. Hwang, W. -J. Hsu, Y. -J. Jan
Venue: IEEE Transactions on Computers (1993)

The pseudoexhaustive testing (PET) scheme is an economical approach to testing a large embedded programmable logic array (PLA). The authors propose an efficient algorithm named low overhead PET (LOPET) to partition the product lines. By applying this algorithm, both the area overhead and test length are reduced significantly.
The &Sigma;&Delta;-BIST Method Applied to Analog Filters
Authors: L. Cassol, O. Betat, L. Carro, M. Lubaszewski
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This paper describes the &Sigma;&Delta;-BIST method, defined as an analog BIST circuit in the context of mixed signal systems. The test procedure is based on the reuse of existing analog circuits configured as sigma-delta modulators in the analog domain. The test procedure reuses most of existing blocks in a mixed signal system, and thus has small area overhead. Test sensitivity is very high, detecting small component deviations. Moreover, the proposed test technique can be applied to continuous or sampled time circuits, and the test procedure can be developed in the field. The paper explains the method and presents practical results to validate the proposed approach.
Defining Team Processes Using OO Metaphors
Authors: Csaba Egyhazy, Scott Eyestone, Janet Martino
Venue: IEEE Software (2001)

The authors' technique for process definition demonstrates practical value beyond direct project planning and risk mitigation: using object-oriented technology metaphors, it can express responsibilities and collaborations among work units as classes. The technique yields a detailed work breakdown structure, accelerates development of more concise contract language for follow-up work, improves level-of-effort estimates for future work, and enables continuous process improvement. The process definition technique also introduces team members to OOT principles and concepts.
Grain Size Determination for Parallel Processing
Authors: Boontee Kruatrachue, Ted Lewis
Venue: IEEE Software (1988)

A method called grain packing is proposed as a way to optimize parallel programs. A grain is defined as one or more concurrently executing program modules. A grain begins executing as soon as all of its inputs are available, and terminates only after all of its outputs have been computed. Grain packing reduces total execution time by balancing execution time and communication time. Used with an optimizing scheduler, it gives consistently better results than human-engineered scheduling and packing. The method is language-independent and is applicable to both extended serial and concurrent programming languages, including Occam, Fortran, and Pascal.
The relation graph
Authors: K. T. Huber, V. Moulton
Venue: Discrete Mathematics (2002)

Given a set R of distinct, non-trivial partitions of a finite set, we define the relation graph GR of R. In case R consists only of bipartitions, GR is the well-known Buneman graph, a median graph that has applications in the area of phylogenetic analysis. Here we consider properties of the relation graph for general sets of partitions and, in particular, we see that it mimics the behaviour of the Buneman graph by proving the following two theorems: (i) The graph GR is a Hamming graph if and only if R is strongly incompatible. (ii) The graph GR is a block graph with #R blocks if and only if R is strongly compatible.
Causal Maps: Theory, Implementation, and Practical Applications in Multiagent Environments
Authors: Brahim Chaib-draa
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Analytical techniques are generally inadequate for dealing with causal interrelationships among a set of individual and social concepts. Usually, causal maps are used to cope with this type of interrelationships. However, the classical view of causal maps is based on an intuitive view with ad hoc rules and no precise semantics of the primitive concepts, nor a sound formal treatment of relations between concepts. In this paper, we solve this problem by proposing a formal model for causal maps with a precise semantics based on relation algebra and the software tool, CM-RELVIEW, in which it has been implemented. Then, we investigate the issue of using this tool in multiagent environments by explaining through different examples how and why this tool is useful for the following aspects: 1) the reasoning on agents' subjective views, 2) the qualitative distributed decision making, and 3) the organization of agents considered as a holistic approach. For each of these aspects, we focus on the computational mechanisms developed within CM-RELVIEW to support it.
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
Authors: Marcello Pelillo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association graph whose maximal cliques are in one-to-one correspondence with maximal common subtrees. We then solve the problem using simple payoff-monotonic dynamics from evolutionary game theory. We illustrate the power of the approach by matching articulated and deformed shapes described by shape-axis trees. Experiments on hundreds of larger, uniformly random trees are also presented. The results are impressive: despite the inherent inability of these simple dynamics to escape from local optima, they always returned a globally optimal solution.
Synthesis of minimal cost nonlinear feedback shift registers
Authors: D. Linardatos, N. Kalouptsidis
Venue: Signal Processing (2002)

This paper is concerned with the determination of the "minimal" nonlinear feedback shift register (NLFSR) that generates a given sequence. A total ordering between structural vectors that takes into account the implementation cost is specified. Minimality is defined with respect to this ordering. A block as well as a sequential algorithm are developed that combine a linear dependence test implemented by an extension of the Fundamental Iterative Algorithm (EFIA) with a minimality procedure that traces the totally ordered structural vectors.
Performance Modeling and Measurements of Real Time Multiprocessors with Time-Shared Buses
Authors: M. H. Woodbury, K. G. Shin
Venue: IEEE Transactions on Computers (1988)

A closed queueing network model is constructed to address workload effects on computer performance for a highly reliable unibus multiprocessor used in real-time control. The model consists of multiserver nodes and a nonpreemptive priority queue. Use of this model requires partitioning the workload into task classes. The time-average steady-state solution of the queuing model directly produces useful results that are necessary in performance evaluation. The model was experimentally justified with the fault-tolerant multiprocessor located at the NASA AIRLAB. Extensive experiments were performed using a synthetic workload generator to measure directly performance parameters, such as processor idle time, system bus contention and task processing times. These measurements determine values for parameters in the queueing model. Experimental and analytic results are compared, demonstrating the validity of the model.
A Mixed Mode BIST Scheme Based on Reseeding of Folding Counters
Authors: Sybille Hellebrand, Hua-Guo Liang, Hans-Joachim Wunderlich
Venue: Journal of Electronic Testing: Theory and Applications (2001)

In this paper a new scheme for deterministic and mixed mode scan-based BIST is presented. It relies on a new type of test pattern generator which resembles a programmable Johnson counter and is called folding counter. Both the theoretical background and practical algorithms are presented to characterize a set of deterministic test cubes by a reasonably small number of seeds for a folding counter. Combined with classical approaches for test width compression and with pseudo-random pattern generation these new techniques provide an efficient and flexible solution for scan-based BIST. Experimental results show that the proposed scheme outperforms previously published approaches based on the reseeding of LFSRs or Johnson counters.
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
Authors: J. Bruck, R. Cypher, D. Soroker
Venue: IEEE Transactions on Computers (1994)

We consider the problem of embedding a cube-connected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a list of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of the faulty edges. The algorithm has optimal running time and tolerates the maximum number of faults (in a worst-case setting). Because ascend-descend algorithms can be implemented efficiently on a CCC, this embedding enables the implementation of ascend-descend algorithms, such as bitonic sort, on hypercubes with edge faults. We also present a number of related results, including an algorithm for embedding a CCC into a hypercube with edge and node faults and an algorithm for embedding a spanning torus into a hypercube with edge faults.
Cap partitions of the Segre variety S1,3
Authors: R. D. Baker, A. Bonisoli, A. Cossidente, G. L. Ebert
Venue: Discrete Mathematics (2002)

We prove that the Segre variety I1,3 of PG(7,q>) can be partitioned into caps of size (q4- 1)/(q- 1). It can also be partitioned into three-dimensional elliptic quadrics or into twisted cubics.
Data Communication in Systems with Heterogeneous Timing
Authors: Fei Xia, Alex V. Yakovlev, Ian G. Clark, Delong Shang
Venue: IEEE Micro (2002)

Asynchronous communication mechanisms permit the implementation of data interfaces between heterogeneously timed entities at various hardware levels. A systematic approach to ACM classification, specification, and implementation facilitates their use in heterogeneously timed networks.
Java- and CORBA-Based Network Management
Authors: Mika Leppinen, Pekka Pulkkinen, Aapo Rautiainen
Venue: Computer (1997)

Systems to manage distributed heterogeneous networks and services must often use off-the-shelf components and leverage legacy applications. Much of the telecommunications industry uses a network architecture based on CMIP (Common Management Information Protocol) to manage networks and services, while much of the Internet uses the SNMP (Simple Net work Management Protocol). To provide distributed network management, the telecommunications industry must accommodate both. Nokia developed the Distributed Computing Platform prototype to support the creation, management, and invocation of distributed telecommunications services. Using CORBA as a base, DCP handles network management by adding managed-object models and protocols. It provides mechanisms that allow communication between CMIP-based objects and a gateway for SNMP-based systems. The prototype also allows users to access network information via Web browsers, CGI gateways, and Java or HTTP daemons. The Nokia engineers also discuss the lessons they learned about Java and CORBA integration.
Testing for a Unit Root in a Process Exhibiting a Structural Break in thePresence of GARCH Errors
Authors: Chris Brooks, Alistair G. Rew
Venue: Computational Economics (2002)

This paper considers the effect of GARCH errors on the tests proposed by Perron (1997) for a unit root in the presence of a structural break. We assess the impact of degeneracy and integratedness of the conditional variance individually and find that, apart from in the limit, the testing procedure is insensitive to the degree of degeneracy but does exhibit an increasing over-sizing as the process becomes more integrated. When we consider the GARCH specifications that we are likely to encounter in empirical research, we find that the Perron tests are reasonably robust to the presence of GARCH and do not suffer from severe over-or under-rejection of a correct null hypothesis.
Effects of complex feedback on computer-assisted modular instruction
Authors: Jan Gordijn, Wim J. Nijhof
Venue: Computers Education (2002)

The aim of this study is to determine the effects of two versions of Computer-Based Feedback within a prevocational system of modularized education in The Netherlands. The implementation and integration of Computer-Based Feedback (CBF) in Installation Technology modules in all schools (n = 60) in The Netherlands is new. The main idea is that feedback in general has proven to be effective, but it has to be customized to the needs of the students. Therefore two complex variations of feedback are designed and tested in a population experiment following and extending a study of Roper on different forms of complex feedback. In this experiment 537 students were involved. The subject is instruction on theory of installation technology in the fields of sanitary technology, gas technology and heating technology. After a pilot test, two experiments took place. This study suggests that the application of complex feedback is effective, but does not significantly increase post-test results. Students with good reading comprehension skills benefit much more from complex feedback than those with poor reading skills.
Constructing &#x00BD;-arc-transitive graphs of valency 4 and vertex stabilizer Z2&#x00D7; Z2
Authors: Aleksander Malnic, Dragan Marusic
Venue: Discrete Mathematics (2002)

An infinite familiy of ½-arc-transitive graphs of valency 4 with alternating cycles of length 4 is given. Besides, an infinite family of ½-arc-transitive graphs of valency 4 with vertex stabilizer isomorphic to Z2 × Z2 is constructed.
Optimizing Nested Loops Using Local CPS Conversion
Authors: John Reppy
Venue: Higher-Order and Symbolic Computation (2002)

Local CPS conversion is a compiler transformation for improving the code generated for nested loops by a direct-style compiler that uses recursive functions to represent loops. The transformation selectively applies CPS conversion at non-tail call sites, which allows the compiler to use a single machine procedure and stack frame for both the caller and callee. In this paper, we describe LCPS conversion, as well as a supporting analysis. We have implemented Local CPS conversion in the MOBY compiler and describe our implementation. In addition to improving the performance of loops, Local CPS conversion is also used to aid the optimization of non-local control flow by the MOBY compiler. We present results from preliminary experiments with our compiler that show significant reductions in loop overhead as a result of Local CPS conversion.
Online Testing Approach for Very Deep-Submicron ICs
Authors: Michele Favalli, Cecilia Metra
Venue: IEEE Design Test (2002)

Very deep-submicron technologies pose new challenges to IC testing. In particular, crosstalk and transient faults are difficult to detect with traditional methods. Online testing techniques can detect these faults, however, and a new approach extends these techniques to include gross-delay faults. Moreover, this approach can be exploited to detect stuck-at and bridging faults offline.
Making Process Improvement Personal
Authors: Watts S. Humphrey
Venue: IEEE Software (1995)

What are the three most important things to remember when you buy a house? Most real estate agents have a simple answer: location, location, location. And what are the three most important things to remember when attempting software-process improvement? My answer: people, people, people.Watts Humphrey has addressed the people issue by developing a comprehensive strategy for personal improvement in software engineering. Called the Personal Software Process, Humphrey¿s strategy combines incremental improvements in software engineering practices, measurement at an individual level, and an increased quality focus ¿ all driven by the individual. His bottom-up approach to software process improvement is a refreshing change from ponderous top-down strategies. In this issue¿s column, we get an introduction to PSP.¿ Roger Pressman