ppxscal/embedding_network huggingface dataset:
Aspect-oriented analysis for architectural design
Authors: Tomoji Kishi, Natsuko Noda
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

It is expected that software architecture remains steady throughout its evolution. In order to design software architecture to have robustness towards evolution, it is important to capture the commonality and differences among potential software that will be developed on the software architecture, and design the software architecture to accommodate the commonality and differences. We have to capture the commonality and differences not only from functional aspect, but also from aspects relate to quality attributes, such as performance and reliability, because requirements on quality attributes also have strong impact on software architecture. In this paper, we propose aspect-oriented analysis method, in which we can capture commonality and differences between software, considering requirements on quality attributes.
Data Networks, IP and the Internet: Networks, Protocols, Design and Operation
Authors: Martin P. Clark
Venue:  (2003)

:Data Networking is a capability that allows users to combine separate data bases, telecommunication systems, and specialised computer operations into a single integrated system, so that data communication can be handled as easily as voice messages. Data communications is the problem of getting information from one place to another reliably (secure both from channel disruptions and deliberate interference) while conforming to user requirements. IP (Internet protocol) is the central pillar of the Internet and was designed primarily for internetworking as being a simple protocol almost any network could carry.The business world appears to increasingly revolve around data communications and the Internet and all modern data networks are based around either the Internet or at least around IP (Internet Protocol)-based networks. However, many people still remain baffled by multiprotocol networks - how do all the protocols fit together? How do I build a network? What sort of problems should I expect? This volume is intended not only for network designers and practitioners, who for too long have been baffled by the complex jargon of data networks, but also for the newcomer - eager to put the plethora of "protocols" into context.After the initial boom the rate of IP development is now beginning to stabilise, making a standard textbook and reference book worthwhile with a longer shelf life. Highly illustrated and written in an accessible style this book is intended to provide a complete foundation textbook and reference of modern IP-based data networking - avoiding explanation of defunct principles that litter other books.Network/IP engineers, Network operators, engineering managers and senior undergraduate students will all find this invaluable.
Generalized Normal Forms for Probabilistic Relational Data
Authors: D. Dey, S. Sarkar
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In recent years, several approaches have been proposed for representing uncertain data in a database. These approaches have typically extended the relational model by incorporating probability measures to capture the uncertainty associated with data items. However, previous research has not directly addressed the issue of normalization for reducing data redundancy and data anomalies in probabilistic databases. In this paper, we examine this issue. To that end, we generalize the concept of functional dependency to stochastic dependency and use that to extend the scope of normal forms to probabilistic databases. Our approach is a consistent extension of the conventional normalization theory and reduces to the latter.
A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy
Authors: W. G. Tzeng
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

The cryptographic key assignment problem is to assign cryptographic keys to a set of partially ordered classes so that the cryptographic key of a higher class can be used to derive the cryptographic key of a lower class. In this paper, we propose a time-bound cryptographic key assignment scheme in which the cryptographic keys of a class are different for each time period, that is, the cryptographic key of class $C_i$ at time $t$ is $K_{i,t}$. Key derivation is constrained not only by the class relation, but also the time period. In our scheme, each user holds some secret parameters whose number is independent of the number of the classes in the hierarchy and the total time periods. We present two novel applications of our scheme. One is to broadcast data to authorized users in a multilevel-security way and the other is to construct a flexible cryptographic key backup system.
Implementing Accountability
Authors: Kathy V. C. Parris
Venue: IEEE Software (1996)

A willing victim of its own success, the F-16 approaches midlife with customer demand for new and modified capabilities exceeding its already repeatedly expanded avionics computer capacity. Affordability and agility, the imperatives of the post-cold war military, drove the US Air Force and F-16 contractor Lockheed Martin Tactical Aircraft Systems to embrace a bold, far-sighted solution: development of a modular mission computer designed to increase computing capacity by an order of magnitude and reduce the cost and schedule of future software changes.The participants thus faced a dual challenge: developing state-of-the-art avionics hardware and software, as well as developing team culture and modes of operation. This article presents a case study of the resulting management systems and underlying mental models, written from my partisan viewpoint as their chief advocate and designer.
OO Systems Analysis: Is It or Isn't It?
Authors: David W. Embley, Robert B. Jackson, Scott N. Woodfield
Venue: IEEE Software (1995)

Systems analysis is the study of a system for the purpose of understanding and documenting its essential characteristics. Analysis is neither design nor implementation. Analysis focuses on real-world problems, whereas design and implementation focus on computerized solutions. During analysis, you should take care that you don't begin devising solutions like, "How can these naturally parallel activities be done sequentially?" Some critics of object-oriented analysis have concluded that object-oriented analysis as preached and practiced is more preliminary design than pure analysis and offers little real analytical support. In general, we agree with this assessment. We surveyed several of the most popular object-oriented analysis methods and found that many of their features are more appropriate for design than analysis. We believe the presence of such features can corrupt the analysis process by introducing design considerations -- solutions -- before the problem has been fully defined. We have developed a new analysis method -- object-oriented systems analysis -- that focuses exclusively on analysis. We argue that OSA both directly addresses the problems cited by object-oriented analysis critics and offers some interesting new insights into object-oriented analysis. It avoids being a preliminary design method because it specifically omits several design features.
A statistical approach to case based reasoning, with application to breast cancer data
Authors: J. Dippon, P. Fritz, M. Kohler
Venue: Computational Statistics Data Analysis (2002)

Given a large set of problems and their individual solutions case based reasoning seeks to solve a new problem by referring to the solution of that problem which is "most similar" to the new problem. Crucial in case based reasoning is the decision which problem "most closely" matches a given new problem. A new method is proposed for deciding this question. The basic idea is to define a family of distance functions and to use these distance functions as parameters of local averaging regression estimates of the final result. Then that distance function is chosen for which the resulting estimate is optimal with respect to a certain error measure used in regression estimation. The method is illustrated by simulations and applied to breast cancer data.
A Speech Understanding and Dialog System with a Homogeneous Linguistic Knowledge Base
Authors: M. Mast, F. Kummert, U. Ehrlich, G. A. Fink, T. Kuhn, H. Niemann, G. Sagerer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This article presents the speech understanding and dialog system EVAR. All levels of linguistic knowledge are used both to control the analysis process and for the interpretation of an utterance. All kinds of knowledge are integrated in a homogeneous knowledge base. The control algorithm used for the analysis is defined within the representation scheme and does not depend on the application. One of the aims of EVAR is to develop a system structure where linguistic and nonlinguistic expectations could be used not only for the interpretation but also as predictions for the recognition process.
A type theory for memory allocation and data layout
Authors: Leaf Petersen, Robert Harper, Karl Crary, Frank Pfenning
Venue: ACM SIGPLAN Notices (2003)

Ordered type theory is an extension of linear type theory in which variables in the context may be neither dropped nor re-ordered. This restriction gives rise to a natural notion of adjacency. We show that a language based on ordered types can use this property to give an exact account of the layout of data in memory. The fuse constructor from ordered logic describes adjacency of values in memory, and the mobility modal describes pointers into the heap. We choose a particular allocation model based on a common implementation scheme for copying garbage collection and show how this permits us to separate out the allocation and initialization of memory locations in such a way as to account for optimizations such as the coalescing of multiple calls to the allocator.
Vying for the Lead in High-Performance Processors
Venue: Computer (1999)

With other major vendors delaying products or contending with corporate change, Sun's Ultrasparc III could have a window of opportunity in the competition among high-performance, 64-bit processors.In an interview with Computer, Gary Lauterbach, Ultrasparc III's chief architect, describes this processor's key features--its extended pipeline, speculation mechanisms, two-cycle load latency, and memory system design--and compares Ultrasparc III to its major competitors.
Scalable Processors in the Billion-Transistor Era: IRAM
Authors: Christoforos E. Kozyrakis, Stylianos Perissakis, David Patterson, Thomas Anderson, Krste Asanovic, Neal Cardwell, Richard Fromm, Jason Golbus, Benjamin Gribstad, Kimberly Keeton, Randi Thomas, Noah Treuhaft, Katherine Yelick
Venue: Computer (1997)

T his article proposes a new architecture called "trace processors," which consist of multiple, distributed on-chip processor cores, each of which simultaneously executes a different trace. All but one core executes the traces speculatively, having used branch prediction to select traces that follow the one executing. (Although this architectural concept is similar to multiscalar processors, described in a sidebar, it does not require explicit compiler support). The authors argue that future processors will rely heavily on replication and hierarchy, and they show how their architecture exploits these concepts.
From Macrogeneration to Syntactic Abstraction
Authors: R. Kent Dybvig
Venue: Higher-Order and Symbolic Computation (2000)

In his 1967 lecture notes, Christopher Strachey states that macrogenerators are useful as the only alternative to rewriting the compiler when language extensions are needed. He also states, however, that they deal inappropriately with programs as strings of symbols, ignoring their semantic content, and that they lead to inconvenient syntax and often less transparent code. He concludes that a goal of language designers should be to eliminate the need for macrogeneration. This article attempts to reconcile the contemporary view of syntactic abstraction, which deals with programs at a higher level, with Strachey's views on macrogeneration.Syntactic abstraction has evolved to address the deficiencies of macrogeneration and has, to a large extent, eliminated them. Syntactic abstractions are conveniently expressed, conveniently used, and usually lead to more rather than less transparent code. While a worthwhile goal for language designers is to reduce the need for macrogeneration through the inclusion of an appropriate set of built-in syntactic forms, this article concludes that syntactic abstraction is a valuable tool for programmers to define language extensions that are not anticipated by the language designer or are domain-specific and therefore not of sufficiently general use to be included in the language core.
Extending the High Level Architecture Paradigm to Economic Simulation
Authors: James A. Calpin, Marnie R. Salisbury, John A. Vitkevich,  Jr., David R. Woodward
Venue: Computational Economics (2001)

This paper describes the potential application of a US Department of Defense-developed simulation architecture to the domain of economic and financial simulation. This approach, known as the High Level Architecture (HLA)1 for Simulation Interoperability, provides the ability to link disparate simulations. This approach supports simulation interoperability and re-use, allowing for the development of composable sets of interacting simulations. The HLA approach has proven to be extremely successful in the military simulation arena, a domain that has a number of strong analogies to the economic and financial simulation domain. This paper provides an overview of the tenets of the HLA approach and proposes an extension of the tools and capabilities to the economic simulation domain.
Mastering Agreement Problems in Distributed Systems
Authors: Michel Raynal, Mukesh Singhal
Venue: IEEE Software (2001)

Nonblocking atomic commitment is a well-known agreement problem of practical interest to distributed-systems engineers and designers. The authors present this problem as a case study in the context of synchronous and asynchronous distributed systems to survey recent notions about failure detection. They also show how systems engineers can use these findings to gain deeper insight into the challenges they encounter.
AMBA: Enabling Reusable On-Chip Designs
Authors: David Flynn
Venue: IEEE Micro (1997)

Advanced RISC Machines Limited designs and licenses Intellectual Property in the form of low-power, small die-area, microprocessor macro-cells and peripherals. These components are combined into a wide range of embedded control integrated circuits, and it is important to ARM's business to make the job of designing a particular controller as simple as possible. AMBA, ARM's Advanced Micro-controller Bus Architecture is the result of five years of development of embedded controller and Application Specific Standard Parts (ASSPs). AMBA defines both a bus specification and a technology independent methodology for designing, implementing and testing customized high-integration embedded controllers. The bus interface is rationalized to ensure right-first-time designs and improve product migration to next-generation cached microprocessors and multiprocessor designs. A further benefit of a well-defined on-chip bus specification is to facilitate the design and exchange of components between ARM Semiconductor licensees and peripheral developers. This paper outlines the issues facing designers when integrating RISC cores into integrated circuits, describes the rationale and specific bus protocols developed for such embedded processor applications and introduces novel approaches to macro-cell test and bus partitioning for power minimization. Finally future plans are introduced for extending the bus for products integrating on-chip DRAM and higher-bandwidth external memory.
Software architecture adaptability: an NFR approach
Authors: Nary Subramanian, Lawrence Chung
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Adaptation of software systems is almost an inevitable process, due to the change in customer requirements, needs for faster development of new, or maintenance of existing, software systems, etc. No doubt numerous techniques have been developed to deal with adaptation of software systems. In this paper we present an overview of some of these techniques. As the first step in the development of software solution it is our opinion that software architecture should itself be adaptable for the final software system to be adaptable. In order to systematically support adaptation at the architectural level, this paper adapts the NFR (Non-Functional Requirements) Framework and treats software adaptability requirement as a goal to be achieved during development. Through this adaptation, then, consideration of design alternatives, analysis of tradeoffs and rationalization of design decisions are all carried out in relation to the stated goals, and captured in historical records. This NFR approach can also be adapted to a knowledge-based approach for (semi-)automatically generating architectures for adaptable software systems and we also discuss how this can be achieved.
A library-based approach to portable, parallel, object-oriented programming: interface, implementation, and application
Authors: Steven Parkes, John A. Chandy, Prithviraj Banerjee
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

The use of parallel platforms, despite increasing availability, remains largely restricted to well-structured, numeric applications. We address the issue of facilitating the use of parallel platforms on unstructured problems through object-oriented design techniques and the actor model of concurrent computation. We present a multi-level approach to expressing parallelism for unstructured applications: a high-level interface based on the actor model of concurrent object-oriented programming and a low-level interface which provides an object-oriented interface to system services across a wide range of parallel architectures. The high- and low-level interfaces are implemented as part of the ProperCAD II C++ class library which supports shared-memory, message-passing, and and hybrid architectures. We demonstrate our approach through a detailed examination of the parallelization process for an existing unstructured serial application, a state-of-the-art VLSI computer-aided design application. We compare and contrast the library-based actor approach to other methods for expressing parallelism in C++ on a number of applications and kernels.
Image Manipulation Using M-filters in a Pyramidal Computer Model
Authors: M. e. Montiel, A. s. Aguado, M. a. Garza-Jinich, J. Alarcón
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents how morphological transformations can be related to representations of a set on different lattices. A hierarchical definition of structuring element conveys to a class of multigrid transformations ¿k that handle changes on discrete representations of regions. The transformations correspond to upward and downward processes in a hierarchical structure. Based on multigrid transformations, a method to delineate not-perfectly-isolated objects in an nxn image requiring O(log n) time is presented. The approach considers grey level regions as sets and processes through a pyramid to carry out geometric manipulations. Extending the concept of boundary to cope with hierarchical representations of a set, a second method which identifies the boundaries in an image is discussed.
Estimates, Uncertainty, and Risk
Authors: Barbara Kitchenham, Stephen Linkman
Venue: IEEE Software (1997)

The authors examine four of the leading contributors to estimate uncertainty and assert that a broad-based approach to risk management spanning all of an organization's projects will be most effective in mitigating the penalties for estimate error.
Interleaving radiosity
Authors: Wu Enhua, Wang Wenping
Venue: Journal of Computer Science and Technology (2002)

A system of linear equations is in general solved to approximate discretely the illumination function in radiosity computation. To improve the radiosity solution, a method that performs shooting and gathering in an interleaving manner is proposed in the paper. Besides, a criterion has been set up and tested for choosing object elements used in the gathering operation, and a criterion is established to quantify the solution errors by taking into account more reasonably of the human perception of the radiosity solution. Experimental results show that the method proposed has nice performance in improving the radiosity solution.
Parallel Evaluation of Attribute Grammars
Authors: A. Klaiber, M. Gokhale
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

Examines the generation of parallel evaluators for attribute grammars, targeted to shared-memory MIMD computers. Evaluation-time overhead due to process scheduling and synchronization is reduced by detecting coarse-grain parallelism (as opposed to the naive one-process-per-node approach). As a means to more clearly expose inherent parallelism, it is shown how to automatically transform productions of the form X to Y X into list-productions of the form X to Y/sup +/. This transformation allows for many simplifications to be applied to the semantic rules, which can expose a significant degree of inherent parallelism, and thus further increase the evaluator's performance. Effectively, this constitutes an extension of the concept of attribute grammars to the level of abstract syntax.
Color permutation: an iterative algorithm for memory packing
Authors: Jianwen Zhu, Edward S. Rogers,  Sr.
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

It is predicted that 70% of the silicon real-estate will be occupied by memories in future system-on-chips. The minimization of on-chip memory hence becomes increasingly important for cost, performance and energy consumption. In this paper, we present a reasonably fast algorithm based on iterative improvement, which packs a large number of memory blocks into a minimum-size address space. The efficiency of the algorithm is achieved by two new techniques. First, in order to evaluate each solution in linear time, we propose a new algorithm based on the acyclic orientation of the memory conflict graph. Second, we propose a novel representation of the solution which effectively compresses the potentially infinite solution space to a finite value of n!, where n is the number of vertices in th memory conflict graph. Furthermore, if a near-optimal solution is satisfactory, this value can be dramatically reduced to &chi;!, where &chi;! is the chromatic number of the memory conflict graph. Experiments show that consistent improvement over scalar method by 30% can be achieved.
The IXM2 Parallel Associative Processor for AI
Authors: Tetsuya Higuchi, Kennichi Handa, Naoto Takahashi, Tatsumi Furuya, Hitoshi Iida, Eiishiro Sumita, Kozo Oi, Hiroaki Kitano
Venue: Computer (1994)

Describes the IXM2 associative processor and its main application in speech-to-speech translation. The IXM2 is a semantic memory system machine that began as a faithful implementation of the NETL semantic network machine and grew into a massively parallel SIMD machine that has demonstrated the power of large associative memories. Such processors can support robust performance in speech applications. In fact, the IXM2 with 73 transputers has outperformed a Cray in some language-translation tasks. We selected speech-to-speech translation as our main application because it is one of the grand challenges of massively parallel artificial intelligence. The social implications of successful automatic translation are enormous-e.g. people who speak different languages could communicate in real time by using interpreting telephony.