ppxscal/embedding_network huggingface dataset:
Generating Language-Based Environments
Authors: Thomas Reps
Venue:  (1982)

This thesis concerns the design of interactive, language-based programming environments that use knowledge of a programming language to provide functions based on the structure and meaning of programs. The goal of the research is a system-constructor to enable editors for different languages to be created easily. The most challenging aspect of such a system is the design of the semantic component, because a language-based editor performs static semantic analysis when a program is altered in order to detect erroneous constructions or to prevent illegal modifications. For efficiency, this should be performed incrementally, re-using as much old information as possible; therefore, a major focus of my research concerns a model of editing for which it is possible to perform incremental semantic analysis efficiently. In this model, a program is represented as an attributed tree in which all attributes have consistent values; programs are modified by tree operations such as pruning, grafting, and deriving. After each modification, some of the attributes require new values; incremental semantic analysis is performed by updating attribute values to again make them all consistent. The thesis presents several algorithms for this process that are asymptotically optimal in time. The chief disadvantage of attribute grammars is that they use large amounts of storage. The thesis discusses three aspects of utilizing storage efficiently in such systems. One way to reduce the amount of storage used is to reduce the number of atttribute values retained at any stage of attribute evaluation. The thesis establishes two results concerning this idea: it presents one algorithm for evaluating an n-attribute tree that never saves more than $O(\sqrt{n}$ attribute values, and it presents a second algorithm that never saves more than $O(\log n)$ attribute values. A second method for reducing the amount of storage is to share the space used for storing attributes whose values are complex data structures; the thesis presents a very general method for such sharing that can be applied to attributes of many types. Finally, the thesis describes how, by restricting the class of attribute grammars, it is possible to reduce the amount of storage overhead required for updating trees in optimal time.
Dynamic Computation Scheduling for Load Balancing in Home-Based Software DSMs
Authors: Weisong Shi, Zhimin Tang
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Load balancing is a critical issue for achieving good performance in any parallel and distributed systems. However, this issue is neglected in the research area of software DSMs in the past decade. In this paper, we present and evaluate a dynamic computation scheduling scheme for load balancing of iterative applications in software DSM system. The experiment platform is a home based DSM system named JIAJIA. Preliminary results show that this load balancing scheme is efficient and can be used at any software DSM systems. Furthermore, although simple chunk self scheduling scheme works well for single iteration applications, new affinity-based self scheduling proposed in this paper can improve the system performance about 30\%.
On the number of monochromatic Schur triples
Authors: Boris A. Datskovsky
Venue: Advances in Applied Mathematics (2003)

Let S = {1, 2,...,n}, and let S = S1 ∪ S2 be a partition of S in two disjoint subsets. A triple (a, b, c), a, b, c ∈ S, is called a Schur triple if a + b = c. If in addition a, b, and c all lie in the same subset Si of S, we call the triple (a, b, c) monochromatic. In this paper we give a simple proof that the minimal number of monochromatic Schur triples is asymptotic to n2/11. We also show that the number of monochromatic Schur triples modulo n equals n2 - 3|S1||S2|.
On the Equivalence of Mechanical Evaluation Strategies
Authors: Clement McGowan
Venue:  (1969)

Two mechanical evaluation strategies are shown to correctly implement the $\lambda$-K-calculus and to be equivalent.
Partitioning of Large HDL ASIC Designs Into Multiple FPFA Devices for Prototyping and Verification
Authors: H. Selvaraj, P. Sapiecha, N. Dhavlikar
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

The ASIC designs are growing larger everyday.It is very hard to simulate these designsbecause the simulation time has risen tremendously.An alternate solution is to partition thelarge design into modules and perform incremental simulation.Hardware EmbeddedSimulation (HES) is a technology that facilitates incremental design verification of largeASICs.On the other hand, since the introduction of FPGAs, they have been playing animportant role in ASIC design cycle. But due to very large size of today's ASIC designs(millions of gates) compared to FPGAs, it is not possible to fit an entire ASIC design into asingle FPGA device.This problem can be solved by partitioning the given design into multiplesmall size designs (modules) and fitting those modules into multiple FPGAs.This paper takesa large RTL design of an ASIC into consideration, analyzes the size of each module in termsof number of CLBs, I/Os, flip-flops, latches and applies the algorithm to partition itautomatically into minimum number of FPGAs.
The M-M/G/1-Type Oscillating Systems
Authors: A. Chydzinski
Venue: Cybernetics and Systems Analysis (2003)

An oscillating queuing system with input stream intensity switching is considered in the paper. The research into this topic is a continuation of previous studies on oscillating stochastic processes. A steady-state distribution of a queue length in the M-M/G/1 oscillating system is obtained and presented. The paper gives a numerical example that illustrates the usefulness of the presentation obtained.
An approach to computer modeling and visualization of geological faults in 3D
Authors: Qiang Wu, Hua Xu
Venue: Computers Geosciences (2003)

Computer modeling and visualization of geological faults in 3D is currently a topical research area because of its important theoretical and application value. The usual method demands enough fault data to be able to construct geological models in 3D. However, in reality, the quantity of the input data is sparse and undersampled. In this paper, we propose a novel approach to modeling faults in 3D. Following the basic properties of geological faults and by using a simple plane to simulate the fault or multiple combined planes to approximate the fault, we can deduce unknown points on a fault and implement mathematical description for the geometry of the fault. We also introduce a new technique called lag insertion and local reconstruction, and an object-oriented framework, which can carry out computer modeling and visualization of complex faults in 3D involving obverse/reverse faults and faults that terminate within geologic models.
Introduction to Object-Oriented Systems Engineering, Part 2
Authors: Haig F. Krikorian
Venue: IT Professional (2003)

Based on a set of views for the system, use cases help define the behavior of a system, from its top-level to its terminal components. 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
RTC: A Real-Time Communication Middleware on Top of RTAI-Linux
Authors: Tales Heimfarth, Marcelo Götz, Franz J. Rammig, Fl ávio R. Wagner
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

This paper describes RTC, a partially object-oriented middleware inspired on the ISO/OSI standard that implements complete real-time communication platform on cluster running under real-time Linux.Media Access Control (MAC) is implemented by means of modified TDMA protocol, and at the application level channel-oriented communication is provided. The RTC platform guarantees bandwidth for each channel, which makes it attractive for multimedia applications, which currently is the main application considered. In addition, RTC supports non-real-time traffic using TCP/IP, for instance. The platform has two principal components: the communication protocols implemented as modules of the Linux/RTAI operating system and the user space API (Application Program Interface) implemented in object-oriented manner and based on the LXRT feature of the RTAI. Furthermore, the non-real-time capabilities are supported by software layer in the kernel of Linux. Currently, SCI is used as underlying communication network. SCI has been selected due to its low latency, low jitter and high bandwidth [6 ]. RTC, however has been designed to support other network technologies as well. Included in the paper are performance evaluation results thatdemonstrate the real-time properties of RTC.
A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods
Authors: John E. Dennis,  Jr., Jorge J. More
Venue:  (1973)

Let F be a mapping from real n-dimensional Euclidean space into itself. Most practical algorithms for finding a zero of F are of the form $x_{k+1} = x_{k} B_{k}^{-1_{Fx_{k}}}$ where $\{B_{k}\}$ is a sequence of non-singular matrices. The main result of this paper is a characterization theorem for the superlinear convergence to a zero of F of sequences of the above form. This result is then used to give a unified treatment of the results on the superlinear convergence of the Davidon-Fletcher-Powell method obtained by Powell for the case in which exact line searches are used, and by Broyden, Dennis, and More for the case without line searches. As a by-product, several results on the asymptotic behavior of the sequence $\{B_{k}\}$ are obtained. An interesting aspect of these results is that superlinear convergence is obtained without any consistency conditions; i.e. without requiring that the sequence $\{B_{k}\}$ converge to the Jacobian.
UML 2 Toolkit
Authors: Hans-Erik Eriksson, Magnus Penker, David Fado
Venue:  (2003)

:Unified Modeling Language (UML) 2.0 represents the largest change to the language since its debut in 1997Complete revision of a bestseller to correspond to the exciting new version of UMLOffers more than sixty percent new material while still retaining the features that readers have enjoyedJava focus, case studies, visual UML glossaryIncludes in-depth coverage of the problems that UML 2.0 is expected to solve, and is honest about what it still doesn't doDiscusses design patterns for UMLCD-ROM contains all of the UML models and Java code in the book and related modeling tools, including Visio and Rational Rose
A Web Based Wireless Order Management Application
Authors: David Cohen, Gary Larson, Bill Ware
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

The Wireless Industry finds itself under significant economic pressure on both margins and revenue. competition and recent 3G network investments demand new revenues streams.This further increases the pressure on network operators to deploy faster andmore cost effective operations support solutions.The electronic customer contract management system (eccm) application is a software platform that tackles thisbusiness challenge at three levels:1. It delivers software functionality in the context of baslined operations processes using faster cycle times (e.g., one software release per week or faster),2. It provides center management the tools required to professionally manage center resources and to facilitate enhancements to the center's process maturity level.3. It provides the organization the option to selectively deploy a teleworker-based operation that reduces cost, and increases productivity while significantly improving employee's quality of life.
Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean d-dimensional space
Authors: M. L. Gavrilova, J. Rokne
Venue: Computer Aided Geometric Design (2003)

The problem of dynamic maintenance of a Voronoi diagram for a set of spheres moving independently in d-dimensional space is addressed in this paper. The maintenance of this Voronoi diagram for spheres moving along given trajectories, requires the calculation of topological events, that occur when d + 2 spheres become tangent to a common sphere. The criterion for determination of the topological event in the Euclidean metric is derived as a solution of a system of non-linear algebraic equations. The criterion is given in the form of polynomial algebraic equations dependent on the coordinates and trajectories of the moving spheres. These equations are solved using numerical methods. Application of the method to study the structure of a system of polydisperse spheres in a three-dimensional Euclidean space is briefly discussed.
Performance analysis of parallel frame synchronization scheme in SDH systems
Authors: M. S. Obaidat, Jun Teng
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We analyze the performance of a new parallel frame synchronization system used for SDH networks. The performance is measured by using false synchronous probability P/sub FS/, the average synchronous incoming time T/sub ASI/, the average synchronous catching time T/sub ASC/, and the average synchronization holding time T/sub ASH/. Analysis indicates that the performance of our scheme is similar to that of the traditional approaches, or better under some condition. Furthermore, our scheme permits designers to use off-the-shelf integrated circuits to build SDH synchronization system.
Visualization schemas and a web-based architecture for custom multiple-view visualization of multiple-table databases
Authors: Chris North, Nathan Conklin, Kiran Indukuri, Varun Saini
Venue: Information Visualization (2002)

Relational databases provide significant flexibility to organize, store, and manipulate an infinite variety of complex data collections. This flexibility is enabled by the concept of relational data schemas, which allow data owners to easily design custom databases according to their unique needs. However, user interfaces and information visualizations for accessing and utilizing databases have not kept pace with this level of flexibility. Visualizations need to integrate multiple tables and diverse visualization tools into custom solutions. This paper describes advances to Snap-Together Visualization, introduces Visualization Schemas, and presents an extensible system architecture. The Snap model for custom multiple-view visualization establishes an analogy to the relational data model, enabling coordinated data design and visualization design. Visualization Schemas are a natural extension to data schemas, and provide a user interface that enables data owners to rapidly construct and disseminate custom visualizations without programming. The web-based software architecture supports run-time extensibility, enabling end-user integration and dissemination of diverse data and visualization tools from the field.
Supporting Reactive Planning Tasks on an Evolving Multidatabase
Authors: Marian H. Nodine, Stanley B. Zdonik
Venue:  (1992)

In this paper we discuss our open nested multidatabase transaction model for multidatabases called {\em Interactions}. Interactions sit above a layer that provides atomic, serializable global multidatabase transactions. This model provides additional support for {\em planning applications}, which are long-running applications that may need to respond to changes in the underlying evolving multidatabase. We begin by describing Interactions and the multidatabase architecture that they run on. We then discuss synchronization of Interactions. We describe the nature of {\em events}, which the applications can use to monitor changes in the information in the multidatabase. When relevant events occur, we define how they are detected and how to respond to them. This response usually involves semantically undoing part of at least one Interaction, and then potentially re-executing the Interaction from that invalid point. We point out some problems with using standard compensation order (as defined in the Sagas paper) when doing this type of recovery response. We then define a new type of recovery, called {\em replacement recovery}, that attempts to avoid these problems.
COFE: A Prototype Memo and Mail System for Non-Programmers
Authors: Richard W. Conway, Steven L. Worona
Venue:  (1983)

NO SUPPLIED
A characterization theorem on the rotation construction for triangular norms
Authors: Sándor Jenei
Venue: Fuzzy Sets and Systems (2003)

The rotation construction for t-norms is introduced in (J. Appl. Non-Classical Logics 10 (2000) 83-92). In the present paper we characterize the widest class of operators with which the rotation construction results in left-continuous t-norms with involutive associated negations.
Types and Concept Analysis for Legacy Systems
Authors: Tobias Kuipers, Leon Moonen
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

We combine type inference and concept analysis in order to gain insight into legacy software systems. Type inference for COBOL yields the types for variables and program parameters. These types are used to perform mathematical concept analysis on legacy systems.We have developed ConceptRefinery, a tool for interactively manipulating concepts. We show how this tool facilitates experiments with concept analysis, and lets reengineers employ their knowledge of the legacy system to refine the results of concept analysis.
Brave New Unwired World: The Digital Big Bang and the Infinite Internet
Authors: Alex Lightman
Venue:  (2002)

:A whirlwind tour through the exciting landscape opening up around digital wireless communication In The Brave New Unwired World, the CEO of one of today's hottest wireless businesses explores the latest thinking and trends in the exciting world of digital wireless communication and boldly predicts the future of this hot new field. He acquaints readers with the amazing technologies involved and the no less amazing profit opportunities opening up around them. Drawing upon his unique access to top management at Nokia, Ericsson, Motorola, Verizon, IBM, Cisco, Psion, Microsoft, and other key players, he profiles those who are vying to be among the first to cash in on the wireless revolution while holding their own against brilliant upstarts, government regulation, and the threat of extinction by competitors who appear from virtually nowhere, at any moment.
Caches versus object allocation
Authors: J. Liedtke
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Dynamic object allocation usually stresses the randomness of data memory usage; the variables of a dynamic cache working set are to some degree distributed stochastically in the virtual or physical address space. This interferes with cache architectures, since, currently, most of them are highly sensitive to access patterns. In the above mentioned stochastically distributed case, the true capacity is far below the cache size and largely differs from processor to processor. As a consequence, object allocation schemes may substantially influence cache/TLB hit rates and thus overall program performance. After presenting basic cache architectures in short, we sketch an analytical model for evaluating their true capacities. Some industrial processors are evaluated and potential implications for memory management techniques are discussed.
A Deployment System for Pervasive Computing
Authors: Jesper Andersson
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Software has for a long time been used for controlling different systems. Today, there is a trend towards integrating more software in consumer electronics, home appliances, cars etc. Suddenly, software is moving from traditional environments, such as the desktop computer into new and unknown territory. This will influence many aspects of the software engineering process; above all several new problems arise in the domain of software deployment. How can software be effectively deployed in these environments? Current deployment strategies are not directly applicable. This paper discusses problems with current deployment models and proposes a new, modified model. A deployment model for pervasive computing must support component based development, different delivery models, and installation and activation strategies. Support for dynamic installation and activation (i.e. making modifications without de-activating the software), is especially important. We introduce a prototype implementation, the Java Distributed Run-time Updating Management System (JDRUMS), which we have used as a vehicle for eliciting requirements for our deployment model.
SHB: A Strategic Hierarchy Builder for Managing Heterogeneous Databases
Authors: Christophe Nicolle, Nadine Cullot, Kokou Yétongnon
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

This paper presents a methodology based on data model translation for the management of interoperable information systems. The key features of this solution are 1) a set of abstract metatypes that capture the characteristics of various modeling concepts and 2) the organization of the metatypes in a generalization hierarchy to allow unification and correlation of data models. Description logic formalism is used to provide formal specification of the metatypes and a tool called "Strategic Hierarchy Builder" is defined to build the metatype hierarchy semi-automatically. The Strategic Hierarchy Builder organizes the hierarchy and implements an extensible metamodel in which new metatypes are created by specialization of existing metatypes.
A Transition Based BIST Approach for Passive Analog Circuits
Authors: Alvernon Walker, Parag K. Lala
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

A new Mixed-Signal Built-in Self-test approach that is based upon voltage transitions at the primary output of the analog block under test (CUT) is presented in this paper. This CUT output is the pulse response of the CUT for a rail-to-rail pulse stream. The technique can effectively detect both soft and hard faults and does not require an analog-to-digital converter (ADC) or/and digital-to-analog converter (DAC). This approach also does not require any additional analog circuits to realize the test signal generator and sample circuits. The paper is concluded with an example of the application of the proposed approach for a passive second order notch filter.
Centralized Wavelength Conversion Protocols for WDM Broadcast-and-Select Star Networks
Authors: Georgios I. Papadimitriou, Andreas S. Pomportsis
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

WDM broadcast-and-select star networks using fixed lasers and tunable optical filters are favored by the current state-of-the-art in technology over the other WDM star architectural forms. However, networks of this architectural form suffer from low efficiency when the offered traffic is bursty. Under bursty traffic conditions, it is probable that some wavelengths are idle, while some other wavelengths are overloaded. Therefore, the overall network performance is degraded. In this paper, a new MAC protocol which is capable of operating efficiently under bursty traffic conditions is introduced. According to the proposed protocol an array of tunable wavelength converters is placed at the network hub in order to uniformly distribute the incoming packets to the available wavelengths. In this way, the load is balanced between the wavelengths and consequently, the network performance is improved. The performance of the proposed protocol is studied via analytical and simulation results which indicate that a WDM Star network operating under this protocol achieves a high throughput-delay performance under both bursty and non-bursty traffic conditions.