ppxscal/embedding_network huggingface dataset:
Formation of C49-TiSi2 in flash memories: a nucleation controlled phenomenon?
Authors: D. Mangelinck, P. Gas, T. Badéche, E. Taing, F. Nemouchi, C. Perrin-Pellegrino, M. Vuaroqueaux, S. Niel, P. Fornara, J. M. Mirabel, L. Fares, P. H. Albarede
Venue: Microelectronic Engineering (2003)

The formation of Ti silicides has been examined in flash memories with 0.25 µm linewidth by X-ray diffraction, scanning electron microscopy, and transmission electron microscopy. It has been observed that, after the first rapid thermal process and the selective metal etch, there is no silicide on the source and on a majority of drain contacts while C49-TiSi2 is found on the gate. A pre-amorphisation implant increases drastically the formation of C49-TiSi2 in the drain zone while modifications of annealing conditions have little impact. These results indicate that the formation of C49-TiSi2 is most likely controlled by nucleation and that this nucleation is sensitive to both the width and the length of the reaction zone. The formation of a Ti rich silicide may play an important role, in this nucleation by decreasing the driving force for the formation of C49-TiSi2. Curiously enough, the formation of C49-TiSi2 appears thus as a major concern for the salicide process in flash memories.
Illuminating software specifications
Authors: Arthur Ryman
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

A software specification is a description of what a system is to compute, and as such, it serves as an essential communication vehicle between the customers of the system and its implementers. The overriding concern in writing a specification is therefore one of clarity.Traditionally, specifications have been written in a procedural style known as structured English or pseudo-code. The problem with this style of specification is that it only implicitly defines what the system is to compute in terms of a procedure or algorithm that describes how to compute it. As a consequence, the reader of such a specification must mentally execute the procedure to understand what it computes, and thus ascertaining its correctness is error-prone.To remedy this situation, recent research has focused on declarative specification techniques, such as Z notation, that use mathematical logic to explicitly describe the goal of computation. While declarative specifications are an improvement over procedural ones in terms of precision and verifiability, mathematical logic is difficult to write and to read, even for experienced software engineers, much less typical customers.This paper describes a new technique for illuminating declarative software specifications through the use of complementary diagrams that are borrowed from database theory. This technique, based on the use of Entity-Relationship diagrams, a well-known conceptual modelling method, and GraphLog, a novel visual query language, has all the precision and formality of mathematical logic. In addition it presents information in a way that exploits the capability of the human visual system for pattern recognition. We claim that these diagrams often present typical specifications more clearly than the corresponding logical formulas. The paper illustrates this technique using a family tree application taken from a software engineering textbook, and concludes with a brief description of 4Thought, a supporting tool set that is currently under development.
On regular drawn symbolic picture languages
Authors: Gennaro Costagliola, Vincenzo Deufemia, Filomena Ferrucci, Carmine Gravino
Venue: Information and Computation (2003)

Drawn symbolic pictures are an extension of drawn pictures obtained by associating a symbol from an alphabet to each point of the picture. In the paper we will address some new interesting issues derived from the introduction of the symbols and we will identify the conditions, which ensure the preservation of properties holding for drawn pictures in the setting of the proposed extension.
Theories and techniques of program understanding
Authors: Santanu Paul, Atul Prakash, Erich Buss, John Henshaw
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

Understanding programs written by others is a difficult task. Most maintenance tasks in software require an understanding of the source code as a first step. Unfortunately, in most cases, the source code of a program is the only reliable documentation of its behavior. As a result, maintainers have to rely heavily on code browsing to acquire the necessary information. This paper surveys the various theories that have been proposed to explain the process of understanding, considers the different techniques used by the tools that are employed, and discusses their relative merits and demerits.
A generalized hierarchical fair service curve algorithm for high network utilization and link-sharing
Authors: Kihyun Pyun, Junehwa Song, Heung-Kyu Lee
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The number of real-time applications, such as video-on-demand and video conferencing, is rapidly increasing. Real-time data now occupies a significant portion of network traffic. These applications require real-time service; as such, they need to bound end-to-end delays. Generally, real-time service is provided by reserving bandwidth in advance. Thus, to admit a large number of real-time applications, bandwidth needs to be reserved efficiently. In addition, to share limited bandwidth effectively among multiple agencies, a link-sharing service is required. A link-sharing service provides a guaranteed share of link bandwidth to each agency. To provide both real-time and link-sharing services simultaneously, several hierarchical link-sharing schemes have been proposed. However, existing hierarchical schemes still have problems in achieving a high level of network utilization, especially when variable-bit-rate (VBR) video sessions participate in a hierarchy. The problem is serious since a large portion of real-time applications transmit MPEG-coded VBR data. We propose a new scheduling algorithm that can achieve a high level of network utilization even with VBR video sessions. The proposed scheduling algorithm is a hierarchical link-sharing scheme; it is an extension of the H-FSC generalized with a new bandwidth reservation scheme. The new scheme provides tight bandwidth reservations for VBR video sessions. Even with the advantage in network utilization, the generalized H-FSC does not require high overhead for scheduling; the scheduling complexity remains the same as that of the H-FSC.
Web Services in Communications Services
Authors: J. Darling, R. D. Tye
Venue: BT Technology Journal (2004)

The tremendous potential of Web Services to revolutionise distributed computing has been the subject of intense excitement across the spectrum of IT professionals. The communications industry has also realised the potential for using Web Services for constructing communication solutions. However, as yet there are relatively few real implementations of the technology, especially when applied to the real-time communications space. This paper describes a case study of a BT product that uses web services to offer real-time communications capability. The experiences gained during the development and deployment of this service are described. Based on these experiences, a future service with a richer set of capabilities is then proposed.
On monotone iteration and Schwarz methods for nonlinear parabolic PDEs
Authors: S.-H. Lui
Venue: Journal of Computational and Applied Mathematics (2003)

The Schwarz Alternating Method can be used to solve elliptic boundary value problems on domains which consist of two or more overlapping subdomains. The solution is approximated by an infinite sequence of functions which results from solving a sequence of elliptic boundary value problems in each of the subdomains.In this paper, proofs of convergence of some Schwarz Alternating Methods for nonlinear parabolic problems which are known to have solutions by the monotone method (also known as the method of subsolutions and supersolutions) are given. In particular, an additive Schwarz method for scalar as well some coupled nonlinear PDEs are shown to converge to the solution on finitely many subdomains. In the coupled system case, each subdomain PDE is linear, decoupled and can be solved concurrently with other subdomain PDEs. These results are applicable to several models in population biology. The convergence behavior is illustrated by two numerical examples.
Configuration research and commercial solutions
Authors: David W. Franke
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

In this paper we intend to motivate various research areas in configuration, based on our experience in developing commercial configuration solutions. Informal definitions are given for the configuration task and for configuration specification and description languages. We also offer an abstract characterization of the issue addressed in configuration models, most often represented as constraints or rules. With these definitions and examples of configuration problems from various domains, we motivate research in (1) a common ontology for configuration, (2) function representation and functional reasoning in configuration, and (3) scaling configuration to large problems.
Exact boundary condition for time-dependent wave equation based on boundary integral
Authors: Zhen-Huan Teng
Venue: Journal of Computational Physics (2003)

An exact non-reflecting boundary conditions based on a boundary integral equation or a modified Kirchhoff-type formula is derived for exterior three-dimensional wave equations. The Kirchhoff-type non-reflecting boundary condition is originally proposed by L. Ting and M.J. Miksis [J. Acoust. Soc. Am. 80 (1986) 1825] and numerically tested by D. Givoli and D. Cohen [J. Comput. Phys. 117 (1995) 102] for a spherically symmetric problem. The computational advantage of Ting Miksis boundary condition is that its temporal non-locality is limited to a fixed amount of past information. However, a long-time instability is exhibited in testing numerical solutions by using a standard nondissipative finite-difference scheme. The main purpose of this work is to present a new exact boundary condition and to eliminate the long-time instability. The proposed exact boundary condition can be considered as a limit case of Ting-Miksis boundary condition when the two artificial boundaries used in their method approach each other. Our boundary condition is actually a boundary integral equation on a single artificial boundary for wave equations, which is to be solved in conjunction with the interior wave equation. The new boundary condition needs only one artificial boundary, which can be of any shape, i.e., sphere, cubic surface, etc. It keeps all merits of the original Kirchhoff boundary condition such as restricting the temporal non-locality, free of numerical evaluation of any special functions and so on. Numerical approximation to the artificial boundary condition on cubic surface is derived and three-dimensional numerical tests are carried out on the cubic computational domain.
Database integration using multidatabase views
Authors: Patrick Martin, Wendy Powley
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Multidatabase systems (MDBSs) are a popular approach to supporting applications that require access to multiple, pre-existing distributed databases. Database integration is the phase of MDBS development in which the schemas from the component database systems are combined to facilitate the global applications of the MDBS.Our approach to database integration is based upon the concept of MDBS Views which are views that span multiple heterogeneous databases. We describe a framework for database integration, and an integration methodology based on MDBS Views. We discuss extensions to SQL which support our integration methodology and describe the features of a prototype database integration tool. The integration tool is one component of a prototype MDBS currently under development.
Fortran 77 input-output seems out of touch
Authors: Michael D. Shapiro
Venue: ACM SIGPLAN Notices (1977)

The input-output section of the proposed Fortran 77 is compared to the services provided by the Mass Storage Control System required to support standard Cobol and is found wanting.
Tutte Polynomials of Perfect Matroid Designs
Authors: Eunice Gogo Mphako
Venue: Combinatorics, Probability and Computing (2000)

This paper gives a general expression for the Tutte polynomial of perfect matroid designs, that is, for matroids in which all ats of the same rank are equicardinal. In particular, explicit expressions are given for the Tutte polynomial of projective and affine geometries over a finite field.
Approaches to Large-Scale Urban Modeling
Authors: Jinhui Hu, Suya You, Ulrich Neumann
Venue: IEEE Computer Graphics and Applications (2003)

This article summarizes current state-of-the-art approaches to large-scale urban modeling.Technologies and systems are classified into photogrammetry, active-sensor, and hybrid techniques.The advantages and disadvantages of each technique and point to possible future approaches are discussed.
Cooperation Schemes between a Web Server and a Web Search Engine
Authors: Carlos Castillo
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Search engines provide search results based on a large repository of pages downloaded by a web crawler from several servers. To provide best results, this repository must be kept as fresh as possible, but this can be difficult due to the large volume of pages involved and to the fact that polling is the only method for detecting changes.In this paper, we explore and compare several alternatives for keeping fresh repositories that involve some degree of cooperation from servers.
Toolkit: GNU Tools: Still Relevant?
Authors: Alexander Wolfe
Venue: Queue (2003)

Often lost amid the focus on software you don’t have to pay for—such as Linux and Eclipse—is any mention of the organization that started it all: the Free Software Foundation (FSF).1
New spaces / new places: a Sound House for the performance of electroacoustic music and sonic art
Authors: Simon Emmerson
Venue: Organised Sound (2001)

The author has written articles and papers on the possibilities of differentiated spaces in the composition of electroacoustic music (Emmerson 1994, 1998). He extends this into a more practical discussion on the spaces used for the presentation of electroacoustic music (acousmatic music and &lsquo;live electronic&rsquo; music), sound installations and other sonic art. The move into more informal &lsquo;club&rsquo; environments is not without controversy. The &lsquo;sampling&rsquo; approach to the very act of listening and &lsquo;consuming&rsquo; sonic art has challenged traditional concert hall presentation. This paper brings various possibilities into plans (at once conceptual but also intended to have practical application) for a multi-space &lsquo;Sound House&rsquo;: a centre for the performance of the sonic arts. This centre is socially embedded within interpersonal human interaction and is not to be found in the current performance possibilities of the Internet &ndash; though it may be connected to others of its kind through this means.
Efficient event generation for detecting races
Authors: Scotte Zinn, Michael Coffin
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

A data race is a situation during the execution of a parallel program where a variable is accessed concurrently by two independent threads and at least one of the accesses is a write operation. Races are a common cause of errors in parallel programs, so detecting them is an essential debugging task.A brute-force strategy used in many postmortem race detection methods involves instrumenting the program to record each inter-thread synchronization and each shared variable access in a log file. Races are then located by analyzing this event log after execution. The problem with this method is the volume of information involved: the time and space required to generate and store events can be prohibitive, even for fairly small programs.This paper describes a technique for using static program analysis to greatly reduce the number and size of events that are generated at run time. We focus on the program instrumentation phase of any post-mortem race detection method rather than actual race detection. The analysis technique involves extending a language grammar with four attributes and adding rules to each grammar production describing the interaction between these attributes. The parse tree is traversed during the compilation phase, and attribute values are computed at each node. These attribute values are then used to instrument the program far more sparsely than the brute-force strategy. A static-log file maintains the list of variables accessed between synchronization points. The result is that far fewer events, in conjuction with the static-log file, suffice to locate races.
Computer assisted communication system
Authors: J. T. Ackerman, H. N. Dorris, D. Hagelbarger, M. J. Shannon
Venue: Issue 24 (October 1978) (1978)

This paper describes a continuing series of experiments aimed at providing improved communications for non-vocal, motion-impaired people. Special keyboards, coupled with a computer which permits one or two keystrokes to call out a complete phrase, have been enthusiastically used by children at the United Cerebral Palsy Association in Edison, New Jersey. After a brief review of previous systems, the current one, which uses a stand-alone microcomputer, is described.
A Multi-Echelon Inventory System with Information Exchange
Authors: Kamran Moinzadeh
Venue: Management Science (2002)

In this paper, we consider a supply-chain model consisting of a single product, one supplier, and multiple retailers. Demand at the retailers is random, but stationary. Each retailer places her orders to the supplier according to the well-known ( Q,R) policy. We assume that the supplier has online information about the demand, as well as inventory activities of the product at each retailer, and uses this information when making order/replenishment decisions. We first propose a replenishment policy for the supplier, which incorporates information about the inventory position of the retailers. Then, we provide an exact analysis of the operating measures of such systems. Assuming the inventory/replenishment decisions are made centrally for the system, we compare the performance of our model with those that do not use information in their decision making, namely, systems that use installation stock policies via a numerical experiment. Based on our numerical results, we identify the parameter settings under which information sharing is most beneficial.
Parallel performance measures for volume ray casting
Authors: Cláudio T. Silva, Arie E. Kaufman
Venue: Proceedings of the conference on Visualization '94 (1994)

We describe a technique for achieving fast volume ray casting on parallel machines, using a load balancing scheme and an efficient pipelined approach to compositing. We propose a new model for measuring the amount of work one needs to perform in order to render a given volume, and use this model to obtain a better load balancing scheme for distributed memory machines. We also discuss in detail the design tradeoffs of our technique. In order to validate our model we have implemented it on the Intel iPSC/860 and the Intel Paragon, and conducted a detailed performance analysis.
Scalable Model-based Clustering by Working on Data Summaries
Authors: Huidong Jin, Man-Leung Wong, Kwong-Sak Leung
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The scalability problem in data mining involves the developmentof methods for handling large databases withlimited computational resources. In this paper, we presenta two-phase scalable model-based clustering framework:First, a large data set is summed up into sub-clusters; Then,clusters are directly generated from the summary statisticsof sub-clusters by a specifically designed Expectation-Maximization(EM) algorithm. Taking example for Gaussianmixture models, we establish a provably convergentEM algorithm, EMADS, which embodies cardinality, mean,and covariance information of each sub-cluster explicitly.Combining with different data summarization procedures,EMADS is used to construct two clustering systems:gEMADS and bEMADS. The experimental results demonstratethat they run several orders of magnitude faster thanthe classic EM algorithm with little loss of accuracy. Theygenerate significantly better results than other model-basedclustering systems using similar computational resources.
A Study of the Metrics applied to the Software Evaluation Framework 'SEF'
Authors: Bernard Wong
Venue: Proceedings of the Third International Conference on Quality Software (2003)

The primary objective of this paper was to present astudy on the metrics which can be applied to the SoftwareEvaluation Framework. The paper presents the results ofa preliminary study, which focuses on the measurementsapplied to the framework. It provides a description of themetrics used and an analysis of how they compare toeach other in the measurement of the softwarecharacteristics. This objective was accomplished byempirically testing the model with quantitativetechniques. An earlier qualitative study provided a list ofmetrics, which were then tested with the quantitativestudy described in this paper. The results of this studyare important as it identifies the metrics, perceived bystakeholders as essential for applying the SoftwareEvaluation Framework to software evaluation.
Indexical expressions in the scope of attitude verbs
Authors: Andrew R. Haas
Venue: Computational Linguistics (1993)

A sentential theory of attitudes holds that propositions (the things that agents believe and know) are sentences of a representation language. Given such a theory, it is natural to suggest that the proposition expressed by an utterance of natural language is also a sentence of a representation language. This leads to a straightforward account of the semantics of attitude verbs. However, this kind of theory encounters problems in dealing with indexicals: expressions such as "I," "here," and "now." It is hard to explain how an indexical in the scope of an attitude verb can be opaque. This paper suggests that while the propositions that agents believe and know are sentences, the propositions expressed by utterances are not sentences: they are singular propositions, of the type used in Kaplan's theory of direct reference. Drawing on recent work in situation semantics, this paper shows how such a theory can describe the semantics of attitude verbs and account for the opacity of indexicals in the scope of these verbs.
Structural monitoring using engineer&ndash;computer interaction
Authors: Ruth Stalker, Ian F. C. Smith
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Engineer&ndash;computer interaction (ECI) is a new subdomain of human&ndash;computer interaction that is specifically tailored to engineers' needs. ECI uses an information classification schema, provides a modular approach to task decomposition, and integrates standard engineering characteristics and working procedures into software. A software tool kit that interprets monitoring data taken from bridges was developed according to ECI guidelines. This tool kit was given to engineers for testing and evaluation. An empirical evaluation using questionnaires was performed. The results show that this ECI software corresponds to engineers' needs and the ECI approach has potential applications to other engineering tasks.