ppxscal/embedding_network huggingface dataset:
Study of CoSi2 formation from a Co-Ni alloy
Authors: O. Chamirian, A. Steegen, H. Bender, A. Lauwers, M. de Potter, F. Marabelli, K. Maex
Venue: Microelectronic Engineering (2002)

CoSi2 formation from Co-Ni alloys with 25 and 10% Ni content was investigated. Samples with various Co-Ni/Ti stacks were characterized by four-point probe, AES, XRD, RBS and TEM. Light scattering measurements were carried out for roughness evaluation. Stress build-up was estimated from room temperature measurements of wafer curvature. It was found that Co disilicide formation temperature decreases with an increase of the Ni percentage. CoSi2 growth at temperatures around 450-500°C depending on Ni concentration and Ti cap thickness was observed. Sheet resistance of 5-6.5 Ω/sq. was measured for various Co-Ni/Ti compositions. CoSi2(220) and CoSi2(111) peaks were detected on XRD spectra for both Ni-rich and Ni-poor layer. Stress values of 0.9-1.9 GPa were calculated for silicidation of various Co-Ni/Ti stacks. The roughness of the silicide film was found to be dependent on Ni concentration, Ti cap thickness and anneal temperature.
The JavaSeal Mobile Agent Kernel
Authors: Ciarán Bryce, Jan Vitek
Venue: Autonomous Agents and Multi-Agent Systems (2001)

Mobile agents show promise as a new distributed programming paradigm in which locality plays a central role&mdash;programs that are able to move closer to their data can overcome limitations of connectivity, latency or bandwidth. Mobility also enables distributed systems to evolve; for instance, the deployment of a new service over a network can be programmed as part of the service itself. Of course, moving programs introduces new challenges. One of these is related to program structure: How much of a computation should be moved? Where are the boundaries between mobile and immobile entities drawn? A second challenge is to provide security guarantees: How can the actions of mobile agent be controlled? And what kinds of security properties can we realistically expect to enforce? We answer these questions within the framework of the JavaSeal mobile agent system kernel. JavaSeal provides several abstractions for constructing agent systems in Java. Our basic building block is the seal which is a nested encapsulated computation fragment with sharply delineated boundaries. Strands are sequential threads of computation bound to a seal. Capsules transfer passive seals and objects over communication channels; Traffic over channels is regulated by portals. We argue that these abstractions are sufficient to program secure mobile agent systems. An electronic commerce application built over our kernel is used as a demonstrator.
Gaining Intellectual Control of Software Development
Authors: Barry Boehm, Victor R. Basili
Venue: Computer (2000)

Recent disruptions caused by several events have shown how thoroughly the world has come to depend on software. The rapid proliferation of the Melissa virus hinted at a dark side of the ubiquitous connectivity that supports the information-rich Internet and lets e-commerce thrive.Indeed, as software plays an ever-greater role in managing the daily functions of modern life, its economic importance becomes proportionately greater.Yet despite its critical importance, software remains surprisingly fragile. Prone to unpredictable performance, dangerously open to malicious attack, and vulnerable to failure at implementation despite the most rigorous development processes, in many cases software has been assigned tasks beyond its maturity and reliability.The authors discuss how the results from two work-shops on software engineering research strategies, commissioned by the National Science Foundation last year, point to new directions in software development. Two future areas of software engineering research involve harnessing future IT to empower people and groups, and to weave a new information fabric that is much more reliable, supple, and adaptable than current technology.
Asymptotic Size Ramsey Results for Bipartite Graphs
Authors: Oleg Pikhurko
Venue: SIAM Journal on Discrete Mathematics (2003)

We show that $\lim_{n\to\infty}\hat r(F_{1,n},\dots,F_{q,n},F_{q+1},\dots,F_{r})/n$ exists, where the bipartite graphs $F_{q+1},\dots,F_r$ do not depend on $n$ while, for $1\le i\le q$, $F_{i,n}$ is obtained from some bipartite graph $F_i$ with parts $V_1\cup V_2=V(F_i)$ by duplicating each vertex $v\in V_2$ $(c_v+o(1))n$ times for some real $c_v>0$.In fact, the limit is the minimum of a certain mixed integer program. Using the Farkas lemma we show how to compute it when each forbidden graph is a complete bipartite graph, in particular answering the question of Erdos, Faudree, Rousseau, and Schelp [Period.\ Math.\ Hungar., 9 (1978), pp. 145--161], who asked for the asymptotics of $\hat r(K_{s,n},K_{s,n})$ for fixed $s$ and large $n$. Also, we prove (for all sufficiently large $n$) the conjecture of Faudree, Rousseau, and Sheehan in [Graph Theory and Combinatorics, B. Bollobas, ed., Cambridge University Press, Cambridge, UK, 1984, pp. 273--281] that $\hat r(K_{2,n},K_{2,n}) =18n-15$.
A PWM Fuzzy Logic Controller
Authors: Jon Tombs, Antonio J. Torralba, Leopoldo G. Franquelo
Venue: IEEE Micro (1996)

Fuzzy--logic controllers have found an extensive application in the last few years. Several fuzzy chips have been presented in the literature and some of them are now commercially available. This article presents the silicon implementation of a fuzzy--logic controller which uses a current--mode circuit for the input membership functions, and pulse--stream arithmetic in the inference process. The circuit has been fabricated using a standard 1.5\mu CMOS process.
Fault-Tolerant, Real-Time Communication in FDDI-Based Networks
Authors: Biao Chen, Sanjay Kamat, Wei Zhao
Venue: Computer (1997)

As more organizations field high-speed networks for distributed systems, ensuring the fault tolerance of those networks assumes greater importance. Although the US Department of Defense has adopted the fiber distributed data interface as part of its Safenet standard, FDDI's built-in features do not meet Safenet's reliability requirements. This standard requires that a network survive multiple faults; an FDDI network may fail after just two trunk faults. So how do you manage a real-time, FDDI network to meet such a stringent fault-tolerance requirement? The authors' solution involves the use of online and offline components that manage network resources to work around breaks (faults). An integrated approach, their network management strategy combines temporal and spatial redundancy. Temporal redundancy migrates messages on faulty routes to fault-free ones. Spatial redundancy tries to overcome faults by sending multiple copies of messages, hoping that if one copy gets lost, others will reach their destination. Based on four message characteristics-length, period, deadline, and fault-tolerance limit-algorithms perform network management functions. To minimize network overhead, the authors' management strategy manipulates message sets rather than individual messages. Simulation results show that the integrated approach provides better performance than either a temporal or spatial redundancy approach alone.
Coping with Latency in SOC Design
Authors: Luca P. Carloni, Alberto L. Sangiovanni-Vincentelli
Venue: IEEE Micro (2002)

Latency-insensitive design is the foundation of a correct-by-construction methodology for SOC design. This approach can handle latency's increasing impact on deep-submicron technologies and facilitate the reuse of intellectual-property cores for building complex systems on chips, reducing the number of costly iterations in the design process.
Toward a More Reliable Theory of Software Reliability
Authors: James A. Whittaker, Jeffrey Voas
Venue: Computer (2000)

The notions of time and the operational profile incorporated into software reliability are incomplete. The authors assert that reliability should be redefined as a function of application complexity, test effectiveness, and operating environment. Errors made during software development and testing often cause post-release software failures. Software reliability theory is one of industry's seminal approaches for predicting the likelihood of software field failures.Software reliability theory seems to work accurately in telecommunications and aerospace. Governments regulate product quality in these two fields, whereas in other disciplines, quality has historically been an add-on, of lesser market value than feature richness or short release cycles. Today, accurate quality measurement cannot be confined to particular industries; it is especially needed in shrink-wrap software.The authors' goal is to create a dialogue in the reliability community and to identify a technology base that will widen interest in software reliability among practitioners outside the telecom and aero-space domains. They propose a new method for software reliability research. They challenge the software reliability community to consider these ideas in future models.
Enumeration of Cayley graphs and digraphs
Authors: Brian Alspach, Marni Mishna
Venue: Discrete Mathematics (2002)

This paper deals with the enumeration of various families of Cayley graphs and digraphs. Both the directed and undirected cases of the following three families are studied: Cayley graphs on cyclic groups, known as circulant graphs, of square-free order, circulant graphs of arbitrary order n whose connection sets are subsets of the group of units of Zn, and Cayley graphs on elementary abelian groups.
Weak Pinsker Joinings of Processes Satisfying the Weak Pinsker Property
Authors: J.-P. Thouvenot
Venue: Journal of Dynamical and Control Systems (1999)

We show that when two transformations satisfy the weak Pinsker property, those among their joinings which also satisfy this property are dense. In particular, the \bar {d}-bar distance can be arbitrarily well approached while staying in the class.
Single-electron charging in nanocrystalline silicon point-contacts
Authors: Z. A. K. Durrani, T. Kamiya, Y. T. Tan, H. Ahmed, N. Lloyd
Venue: Microelectronic Engineering (2002)

Room-temperature single-electron effects are observed in 20 nm × 20 nm point-contact transistors fabricated in nanocrystalline silicon thin films. The films are deposited using low-temperature plasma enhanced chemical vapour deposition and contain grains typically 4-8 nm in size. Low-temperature oxidation and high-temperature annealing is used to oxidise selectively the grain boundaries. Single-electron effects occur in crystalline silicon grains isolated by tunnel barriers at the grain boundaries. The thermal processing improves the grain-boundary tunnel barrier and increases the maximum temperature for single-electron effects. Similar effects are also observed in devices fabricated in low-pressure chemical vapour deposited polysilicon films.
Reliability and Survivability of Wireless and Mobile Networks
Authors: Andrew P. Snow, Upkar Varshney, Alisha D. Malloy
Venue: Computer (2000)

The world is becoming more dependent on wireless and mobile services, but the ability of wireless network infrastructures to handle the growing demand is questionable. As wireless and mobile services grow, weaknesses in network infrastructures become clearer. Failures not only affect current voice and data use but could also limit emerging wireless applications such as e-commerce and high-bandwidth Internet access. As wireless and mobile systems play greater roles in emergency response, including 911 and enhanced 911 services, network failures take on life-or-death significance.Therefore, in addition to directing some attention to designing survivable wireless and mobile networks, developers must also keep in mind that increasingly pervasive and demanding services will further escalate the importance of reliability and survivability requirements.The authors explain several options providers must consider to decrease the number of network failures and to cope with failures when they do occur.
Accelerating Development with Agent Components
Authors: Martin L. Griss, Gilda Pour
Venue: Computer (2001)

This analytical survey reveals that software engineering methodologies and development strategies must support the construction of enterprise systems that assemble flexible components written at different times by various developers. Component-based software engineering offers an attractive alternative for building Web-based enterprise application systems. It develops and evolves software from reusable components and assembles them within appropriate software architectures. The component-based software development approach promises large-scale software reuse, which reduces development cost and time to market, and enhances the reliability, maintainability, and quality of enterprise software systems. Agent-oriented software engineering offers opportunities for developing and maintaining Web-based enterprise systems at Internet speed.Driven by goals and plans rather than procedural code, agents encapsulate business or domain knowledge. They differ from each other by the knowledge they have and the roles they play.
Domain ontologies for data sharing-an example from environmental monitoring using field GIS
Authors: Hardy Pundt, Yaser Bishr
Venue: Computers Geosciences (2002)

Different geospatial information communities, public authorities as well as private institutions, recognize increasingly the World Wide Web as a medium to distribute their data. With the occurrence of national laws that push authorities to make environmental data accessible, Internet-based services have to be developed to enable the public to obtain information digitally. Dissemination of data is only one side of the coin. The other side is the use of such data. The use requires mechanisms to share data via networks. Lack of semantic interoperability has been identified as the main obstacle for data sharing. Research, however, must develop methods to overcome the problems of sharing data considering their semantics. Ontologies are considered to be one approach to support data sharing.This paper describes the use of ontologies via the Internet based on an example from field GIS supported environmental monitoring. The basic idea is that the members of different information communities get access to the meaning of data if they can approach the ontologies that have been developed by those who collected the data. This might be possible by applying the resource definition framework (RDF) and RDF/Schema. RDF can be used to define and structure terms and vocabulary used in a specific information community. The goal of the paper is to examine the role of ontologies based on the study of a particular application domain, namely stream surveying. The use of RDF/ Schema is described related to the example.
Coordination in a Content-Addressable Web
Authors: R. Menezes, I. Merrick, A. Wood
Venue: Autonomous Agents and Multi-Agent Systems (1999)

The World Wide Web is a very successful phenomenon, and is increasingly being used as a medium for electronic commerce rather than simple information exchange. In this paper it is argued that the low-level infrastructure of the Web is badly suited for these new applications, as well as being somewhat inefficient in its original applications; an alternative infrastructure offering better functionality and flexibility is proposed. The new infrastructure is based on the Linda coordination model, and adds a layer of abstraction over the absolute location of resources. Both theoretical and real-world issues are covered, including the problem of integrating this new system with the existing infrastructure of the Web.
Computer graphics in a campus environment
Authors: Scott L. Luebking
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Computer graphics is an extremely flexible tool for helping both students and researchers. Three dimensional images of molecules can aid the creation of new drugs. Mathematical surfaces are easily examined. Bridges can be designed, re-designed and re-designed again.It is becoming important for campus computer centers to provide graphics facilities. Professors can use computer graphics to aid their lectures. Graphics can help students with their work, besides giving them useful experience for their future careers.The first part of the presentation will provide an over-view to computer graphics with the goal of helping computer center personnell make rational decisions when establishing or enhancing graphics facilities. The various kinds of graphics equipment currently available will be discussed. The main emphasis will be on terminals and the differences among them, but other devices such as film generators and the "mouse" will be discussed. Current software packages and the proposed standards for basic graphics software will be reviewed.The last part of the presentation will be about establishing a modern graphics facility at a campus computer center. It will discuss come of the problems a computer center encounters when designing the facilities and will offer some advice. 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
Implementing Microsoft Visual Interdev: Activate and Automate Web Site Development, 10th edition
Authors: Paul B. Thurrott
Venue:  (1997)

:Implementing Microsoft Visual InterDev was written by a Web developer for Web developers. The book is divided into three sections. Each enables users to solve real-world problems with Visual InterDev. The sites become progressively more challenging, each presenting its own unique set of design goals. The first asks users to take a standard HTML-based site and add active content. The second requires a complete rewrite, taking advantage of ActiveX controls. In the third, users create a new site using Visual InterDev and SQL Server to dynamically generate content.Explains how to create, publish, and manage interactive Web applications using Visual InterDevProfiles three specific Web sitesShows how to use InterDev to solve real-world Web site problemsEnables users to exchange information with professional colleaguesProvides access to Internet Nexus, a leading Web design and development Web site, which offers support, news, and information for Microsoft Web developersHTML 3.2 and an HTML editorFTP clientsGraphics utilityDigital sound editor
Optimal Total Exchange in Cayley Graphs
Authors: Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Consider an interconnection network and the following situation: Every node needs to send a different message to every other node. This is the total exchange or all-to-all personalized communication problem, one of a number of information dissemination problems known as collective communications. Under the assumption that a node can send and receive only one message at each step (single-port model), it is seen that the minimum time required to solve the problem is governed by the status (or total distance) of the nodes in the network. We present here a time-optimal solution for any Cayley network. Rings, hypercubes, cube-connected cycles, and butterflies are some well-known Cayley networks which can take advantage of our method. The solution is based on a class of algorithms which we call node-invariant algorithms and which behave uniformly across the network.
The converses of two fixed point theorems
Authors: Stefan M. Soltuz
Venue: Octogon Mathematical Magazine (2001)

A converse result for the main theorems from -[S. Abbaoui, Deux theoremes du point fixe, Bull. Soc. Math. Belg. serie B, 43 (1991), 117-121], and from -[B. E. Rhoades, A Fixed Point Theorem in Search of an Example, Panamer. Math. J. 6 (1996):3, 35-39], are given.
Design and Analysis of a Robust Real-Time Engine Control Network
Authors: Michael Ellims, Stephen Parker, James Zurlo
Venue: IEEE Micro (2002)

The process and techniques used to design a safety-related real-time control network provides a framework for x-by-wire system development projects.
Developing Integrated Environments with ASDL
Authors: Bernd Krämer, Heinz-Wilhelm Schmidt
Venue: IEEE Software (1989)

The authors present the Abstract-Type and Scheme-Definition Language (ASDL), a new formalism and environment kernel. The main goal of this object-oriented kernel is to reconcile integration and extensibility. ASDL adopts the ideas underlying language-based editor generators but overcomes their extensibility deficiencies. ASDL combines an object-oriented type system with syntax-directed translation schemes and a target-language interface. Its power lies in utilizing inheritance for structure-driven computations. The authors discuss object types, translation rules, and semantic information in ASDL.
IP for Embedded Diagnosis
Authors: Stephen Pateras
Venue: IEEE Design Test (2002)

An integrated BIST-based flow streamlines debugging and fault diagnosis of increasingly complex SoC devices. This methodology can help meet the requirement for shorter time to market.
Adjacency and incidence framework: a data structure for efficient and fast management of multiresolution meshes
Authors: Frutuoso G. M. Silva, Abel J. P. Gomes
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

This paper introduces a concise and responsiveness data structure, called AIF (Adjacency and Incidence Framework), for multiresolution meshes, as well as a new simplification algorithm based on the planarity of neighboring faces. It is an optimal data structure for polygonal meshes, manifold and non-manifold, which means that a minimal number of direct and indirect accesses are required to retrieve adjacency and incidence information from it. These querying tools are necessary for dynamic multiresolution meshing algorithms (e.g. refinement and simplification operations). AIF is an orientable, but not oriented, data structure, i.e. an orientation can be topologically induced as needed in many computer graphics and geometric modelling applications. On the other hand, the simplification algorithm proposed in this paper is "memoryless" in the sense that only the current approximation counts to compute the next one; no information about the original shape or previous approximations is considered.
A Critical Look at Software Capability Evaluations
Authors: Terry B. Bollinger, Clement McGowan
Venue: IEEE Software (1991)

The methods used by the Software Engineering Institute (SEI's) Software Capability Evaluation program (SCE) are assessed. The goal of the SCE program is to provide the US Defense Department with a method by which it can rank the overall capability of organizations to produce software in a timely, repeatable fashion. Because SEI assessments are a preparation for SCEs, the authors first describe the major steps in an SEI process assessment and highlight its strengths and weaknesses. The SCE grading methods are described, focusing on their statistical reliability. It is concluded that the system is so seriously and fundamentally flawed that it should be abandoned rather than modified or updated. SEI's overall process-improvement paradigm, that is, the set of goals and directions it is trying to impart to the industry through its assessment and evaluation programs, is examined. It is suggested that the assessment program needs some type of structured, preferably graphical, method for recording the details of an organization's existing processes.