ppxscal/embedding_network huggingface dataset:
Modeling Languages: Syntax, Semantics and All That Stuff, Part I: The Basic Stuff
Authors: D. Harel, B. Rumpe
Venue:  (2000)

The motivation for this paper, the first in a planned series of three parts, is the multitude of concepts surrounding the proper definition of complex modeling languages for systems and software, and the confusion that this often causes. Particularly relevant is the case of the recently standardized UML, which we refer to quite extensively as we proceed. Our intention is to discuss and clarify the notions involved in defining modeling languages. The main theme is the distinction between syntax and semantics, the nature and purpose of each, their usage and style, and the various means for defining and dealing with them. Underlying the exposition are the dichotomies of textual vs.&#x00A0;visual languages, structural vs.&#x00A0;behavioral specification, and requirements vs.&#x00A0;system models. We hope that the paper will be useful to language designers, methodologists, tool vendors and educators.
Assumption Based Reasoning and Clause Management Systems
Authors: Alex Kean, George K. Tsiknis
Venue:  (1990)

A {\em truth maintenance system} is a subsystem that manages the utilization of assumptions in the reasoning process of a problem solver. Doyle''s original motivation for creating a truth maintenance system was to augment a reasoning system with a control strategy for activities concerning its non-monotonic state of beliefs. Hitherto, much effort has been invested in designing and implementing the concept of truth maintenance and little effort has been dedicated to the formalization that is essential to understanding it. This paper provides a complete formalization of the principle of truth maintenance. Motivated by Reiter and de Kleer''s preliminary report on the same subject, this paper extends their study and gives a formal account of the concept of truth maintenance under the general title of {\em assumption based reasoning}. The concept of assumption based theory is defined and the notions of explanation and direct consequence are presented as forms of plausible conclusion with respect to this theory. Additionally, the concept of extension and irrefutable sentences are discussed together with other variations of explanation and direct consequence. A set of algorithms for computing these conclusions for a given theory are presented using the notion of prime implicates. Finally, an extended example on Boolean circuit diagnosis is shown to examplify these ideas.
Stack and Queue Layouts of Posets
Authors: Lenwood S. Heath, Sriram V. Pemmaraju
Venue:  (1992)

The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and the queuenumber of its covering graph. A lower bound of is shown for the queuenumber of the class of planar posets. The queuenumber of a planar poset is shown to be within a small constant factor of its width. The stacknumber of posets with planar covering graphs is shown to be . These results exhibit sharp differences between the stacknumber and queuenumber of posets as well as between the stacknumber (queuenumber) of a poset and the stacknumber (queuenumber) of its covering graph.
Building a virtual campus
Authors: Stephen Ast, Cassandra Gerfen
Venue: Designing portals: opportunities and challenges (2003)

For the higher education world, comprising three million faculty and administrators, 15 million students and 60 million alumni (Budzynski & Zabora, 2000), a Web presence is essential. But the means by which institutions "go online" can differ dramatically, including the implementation of brochure websites, development of online registration systems, offering Web-based course supplements and distance learning courses, putting administrative functions online, and giving students Web access to extracurricular resources and other networked information. When delivered together, these functions represent a comprehensive platform, while alone they create a fragmented Web presence.In this chapter, we will explore the trends leading up to the need for an institution-wide solution; how the eCollege CampusPortalSM can connect a campus' administrative, academic and community aspects together through a seamless, single point of contact; the development process and technology that makes this possible; and the building of a virtual campus at Montana State University-Billings.
A Flexible Security System for Metacomputing Environments
Authors: Adam Ferrari, Frederick Knabe, Marty Humphrey, Steve Chapin, Andrew Grimshaw
Venue:  (1998)

A metacomputing environment is a collection of geographically distributed resources (people, computers, devices, databases) connected by one or more high-speed networks and potentially spanning multiple administrative domains. Security is an essential part of metasystem design -- high-level resources and services defined by the metacomputer must be protected from one another and from possibly corrupted underlying resources, while those underlying resources must minimize their vulnerability to attacks from the metacomputer level. We present the Legion security architecture, a flexible, adaptable framework for solving the metacomputing security problem. We demonstrate that this framework is flexible enough to implement a wide range of security mechanisms and high-level policies.
Artificial Neural Network Comparative Performance as Part I
Authors: Anthony Zaknich, Christopher J.S. deSilva
Venue:  (1991)

This report compares the performance of a number of Artificial Neural Networks (ANNs for classification of eight dimensional data. The ANNs have been implemented in software and have been run on the same AT compatible 80386 Personal Computer (PC) with a 22 MHz clock and 80387 math co-profeccor to show accuracy and trianing and running time comparisons. The following ANNs are included in this, Part I, report: 1. Probabilistic Neural Network (PNN), 1988, (Specht) Conjugate Gradient backpropagation Neural Network (CGPNN), 1990, coded by deSilva A variant of the Backpropagation Neural Network (BPN), 1974-85 (Werbos, Parker, Rumelhart) 3. Gaussian Mixture Model by Estimation-Maximisation (GMMEM) (Wolfe 1970, and Dempster, Laird, Rubin 1976) by deSilva. More ANNs will be investigated in Part II at a later date by using the same data set. The data are spectral colour information of a type of gemstone ore which have been supplied by the CRA Advanced Technical Development group and includes: 1. 897 usable samples in two of the most difficult brown classes with a total 448 in one class and 449 in the other. (Data file names - TRAIN.PAT and EVALUATE.PAT). 2. 3150 samples of six classes with 525 in each class. (Data file name - 6COLOUR.PAT).
The BB-SR System
Authors: I. D. Craig
Venue:  (1987)

This paper briefly describes the BB-SR system. BB-SR integrates the blackboard model of problem solving with a powerful object-oriented knowledge represenation system. The combined blackboard and knowledge base system provides a sophisticated and powerful environment within which to examine self-reflection in problem solving and within which to develop systems to solve complex problems.
Simulation Model Development: System Specification Techniques
Authors: Lynne F. Barger, Richard E. Nance
Venue:  (1986)

A review of software specification techniques and specification languages is described. Special emphasis given to simulation model specification and the degree to which general software techniques are applicable in the modeling domain. The role of specification is examined in terms of existing techniques as well as abstraction permitting the identification of desirable properties unrelated to existing tools. A categorization of specification languages assists in understanding the similarities and differences among current approaches.
New Graph Arborescence and Steiner Constructions for High-Performance FPGA Routing
Authors: Michael J. Alexander, Gabriel Robins
Venue:  (1994)

The flexibility and reusability of field-programmable gate arrays (FPGAs) enable significant speed and cost savings in the VLSI design/validation/simulation cycle. However, this is achieved at a substantial performance penalty due to signal delays through the programmable interconnect. This motivates a critical-net routing objective which seeks to minimize source-sink signal propagation delays; we formulate this objective as a graph Steiner arborescence (i.e., shortest-path tree with minimum wirelength) problem and propose an effective heuristic which produces routing trees with optimal source-sink pathlengths, and having wirelength on par with the best existing graph Steiner tree heuristics. Our second contribution is a new class of greedy Steiner tree constructions in weighted graphs, based on an iterated application of an arbitrary given graph Steiner heuristic; this construction significantly outperforms the best known graph Steiner tree heuristics of Kou, Markowsky and Berman, and of Zelikovsky. We incorporated our algorithms into an actual router, enabling the complete routing of several industrial designs while requiring a reduced maximum channel width. All of our methods are directly applicable to other graph-based routing regimes, such as building-block design, routing in the presence of obstacles, etc., as well as in non-CAD areas such as multicasting in communication networks.
Development of the CODER System: A Test-bed for Artificial Intelligence Methods in Information Retrieval
Authors: Edward A. Fox
Venue:  (1986)

The CODER (COmposite Document Expert/Extended/Effective Retrieval) system is a test-bed for investigating the application of artificial intelligence methods to increase the effectiveness of information retrieval systems. Particular attention is being given to analysis and representation of heterogeneous documents, such as electronic mail digests or messages, which vary widely in style, length, topic, and structure. Since handling passages of various types in these collections is difficult even for experimental systems like SMART, it is necessary to turn to other techniques being explored by information retrieval and artificial intelligence researchers. The CODER system architecture involves communities of experts around active blackboards, accessing knowledge bases that describe users, documents, or lexical items of various types. Most of the lexical knowledge base construction work is now complete, and experts for search and temporal reasoning can perform a variety of processing tasks. User information and queries are being gathered, and the first prototype is nearly complete. It appears that a number of artificial intelligence techniques are needed to best handle such common, but complex, document analysis and retrieval tasks.
An Heterogeneous M-SIMD Architecture for Kalman Filter Controlled Processing of Image Sequences
Authors: T. J. Atherton, Darren J. Kerbyson, Graham R. Nudd
Venue:  (1992)

An heterogeneous Multiple-SIMD (M-SIMD) architecture is used to analyse image sequences by integrating image processing operations with optimal recursive (Kalman) estimators. The architecture uses SIMD processors for data parallel (iconic) operations and MIMD processors for control parallel (numeric and symbolic) tasks. The SIMD processors are configured as small contiguous sub-arrays, with each subarray attached to a single MIMD processor. This allows operational autonomy intermediate between the pure data and control parallel paradigms. Use of the architecture is illustrated with size-based detection and segmentation techniques that are guided by Kalman filters through an image sequence. The measurements of object size on the image plane allow a robust estimate of the range and physical size of the object in the world. Results are presented for the architecture performance, the image processing, and the estimation techniques.
Analysis, Modeling and Optimization of Multiprocessing Execution Time
Authors: Emile K. Haddad
Venue:  (1989)

A new approach is presented for the analytical modeling of the execution times of a partitioned program running on parallel processors of a multiprocessor or distributed computed system. The model represents the execution time of the individual processors as well as the aggregate system both in the deterministic and stochastic contexts. The analytical model encompasses a broader class of multiprocessing situations and formulates a mode accurate analytical representation of the execution times than has hitherto been presented in recent literature. The representation expresses the processor execution times in terms of the program module run times, the internal intermodule communication times, interprocessor (external) times and the number of modules assigned to each processor. A criterion is derived on the optimal assignment policy for minimizing execution time, or its statistical mean in the stochastic representation.
Determinitic Resource Discovery in Distributed Networks
Authors: S. Kutten, D. Peleg, U. Vishkin
Venue:  (2000)

The resource discovery problem was introduced by Harchol-Balter, Leighton and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph, that represents the nodes'' ``knowledge'''' about the topology of the underlying communication network. The current paper proposes a deterministic algorithm for the problem in the same model, with improved time, message, and communication complexities. Each previous algorithm had a complexity that was higher at least in one of the measures. Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity O(n3) (with message complexity O(n2)), or message complexity O(|E>sub<0>/sub<| logn) (where E>sub<0>/sub< is the edge set of the initial graph). Compared to the main randomized algorithm of Harchol-Balter, Leighton, and Lewin, the time complexity is reduced from O(log2n) to O(logn ), the message complexity from O(n log2 n) to O(n logn ), and the communication complexity from O(n2 log3 n) to O(|E>sub<0>/sub<|log2 n). Our work significantly extends the connectivity algorithm of Shiloach and Vishkin which was originally given for a parallel model of computation. Our result also confirms a conjecture of [HLL99] and addresses an open question due to R.&#x00A0;Lipton.
Connectivity in the South American Internet
Authors: Flavio Junqueira, Renata Teixeira
Venue:  (2003)

In this paper, we address connectivity in the South American Internet. We analyze routing traces from sources inside and outside South America in order to investigate the behavior of communication both within and from outside the continent. In particular, we examine the round-trip time of IP packets and the routing paths between sources and destinations.
Characterizing World Wide Web Queries
Authors: Abdulla Ghaleb, Liu Binzhang, Saad Rani, Fox Edward A.
Venue:  (1997)

Locating information on the WWW is a major activity for users, and Web Information Retrieval Systems (IRS) are becoming more important to support their endeavors. In this paper we characterize queries performed by Web users to such systems and give distributions for accesses to different Web IRS. We characterize clients'' accesses, queries and user sessions. Our purpose is to reduce network and bandwidth by identifying ways to optimize interactions with the Web. We characterize clients'' sessions by a sequence of Browsing, Searching, and Next steps, and demonstrate that more search steps correlate with a reduction in the number of bytes transferred.
Improving Concurrency in Common Object Models
Authors: Challa Siva, Kafura Dennis
Venue:  (1998)

Most common object models of distributed object systems lack features related to ''concurrency'' (the ability to have more than one thread of execution in an object simultaneously). The lack of support for concurrency restricts the development of new components and limits reuse of existing components that use these advanced features. In this paper, the concurrency features of the Interoperable Common Object Model (ICOM) centered on statically typed object-oriented languages, is presented. The ICOM model is an attempt to elevate common object models (with the advanced features of concurrency) closer to the object models of statically typed object-oriented languages. Specific features of the ICOM object model include: atomic objects and guard methods. The actor model is used to develop a uniform implementation framework for the ICOM object model in C++ and Modula-3.
Assessment of information related to floods
Authors: N. B. Harmancioglu, C. P. Cetinkaya, S. D. Ozkul
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The study presented demonstrates the use of the entropy concept, as defined in information theory, to assess the regional uncertainty and indirectly the regional information available about floods. The method is used to describe the total uncertainty related to floods in a basin, together with the joint information provided by observed data of existing streamflow gages. The contribution of each gage to this total information is assessed eventually to arrive at a better combination of stations in transferring flood information from one space point to another. This is realized by a priority listing of stations in order of their contribution to the decrease in regional uncertainty. The application of the method is demonstrated in the case of a Turkish river basin, where coping with floods is a major problem. The strengths and shortcomings of the method are discussed, with recommendations for future research on the application of the entropy principle in evaluating regional transfer of information about floods.
An Efficient Solution to Traffic Characterization of VBR Video in Quality-of-Service Networks
Authors: Jorg Liebeherr, Dallas E. Wrege
Venue:  (1996)

A network that offers deterministic, i.e., worst-case, quality-of-service (QoS) guarantees to variable-bit-rate (VBR) video must provide a resource reservation mechanism that allocates bandwidth, buffer space, and other resources for each video connection. Such a resource reservation scheme must be carefully designed, otherwise network resources are wasted. A key issue for the design of a resource reservation scheme is the selection of a traffic characterization that specifies the traffic arrivals on a video connection. The traffic characterization should accurately describe the actual arrivals so that a large number of connections can be supported, but it must also map directly into efficient traffic policing mechanisms that monitor arrivals on each connection. In this study, we present a fast and accurate traffic characterization method for stored VBR video in networks with a deterministic service. Our characterization approach approximates the so-called empirical envelope of a video sequence. We use this approximation to obtain a traffic characterization that can be efficiently policed by a small number of leaky buckets. We present a case study where we apply our characterization method to networks that employ a dynamic resource reservation scheme with renegotiation. We use traces from a set of 25-30 minute MPEG sequences to evaluate our method against other characterization schemes from the literature.
Advances in Predictive Wavelet Transform Image Coding
Authors: I. Levy, R. Wilson
Venue:  (1996)

In this work, it is shown that a fractal image coding can be placed in a conventional predictive framework by using a wavelet representation. This has the significant advantage of simplifying decoding by avoiding iteration and of relating the technique to traditional coding methods. The resulting coder is a combination of transform and predictive techniques. A novel frequency domain subblock search is presented along with a tree-structures vector quantizer. Some results are prsented for a variety of images and bit-rates followed by some speculation on further research.
Power to the people
Authors: Meg McGinity
Venue: Communications of the ACM (2003)

Broadband access gets electrified.
PREDICTING {0,1}-FUNCTIONS ON RANDOMLY DRAWN POINTS
Authors: D. Haussler, N. Littlestone, M. K. Warmuth
Venue:  (1990)

We consider the problem of predicting {0,1}-valued functions on R^n and smaller domains, based on their values on randomly drawn points. Our model is related to Valiant''s PAC learning model, but does not require the hypotheses used for prediction to be represented in any specified form. In our main result we show how to construct prediction strategies that are optimal to within a constant factor for any reasonable class F of target functions. This result is based on new combinatorial results about classes of functions of finite VC dimension. We also discuss more computationally efficient algorithms for predicting indicator functions of axis-parallel rectangles, more general intersection closed concept classes, and halfspaces in R^n . These are also optimal to within a constant factor. Finally, we compare the general performance of prediction strategies derived by our method to those derived from methods in PAC learning theory.
Staged implementation of E-business networks through ERP: a case study of Siemens (1998-2001)
Authors: Colin G. Ash, Janice M. Burn
Venue: Enterprise information systems IV (2003)

Internet technologies offer an ERP based organisation the opportunity to build interactive relationships with its business partners. The Siemens case of e-Business evolution is viewed in terms of buy-side and sell-side solutions and services that inter-relate. e-Business solutions were seen to evolve in six stages with increasing business value and network complexity; from infrastructure to e-marketplaces. By viewing the Siemens case as a staged implementation, it may easily be evaluated in terms of the attributes of the "virtual organizing" model.
Numeration Models of $\lambda$-Calculus
Authors: K, Akira a
Venue:  (1983)

Models of $\lambda$-calculus have been studied by Church [2] and Scott [7]. In these studies, finding solutions to the isomorphic equations \(S \approx [S \rightarrow S] \) where \( [S \rightarrow S] \) is a certain set of functions from $S$ to $S$ is the main issue. In this paper, we present an example of such solutions which fails to be a model of $\lambda$-calculus. This example indicates the necessity of careful consideration of the syntax of $\lambda$-calculus, especially for the study of constructive models of $\lambda$-calculus. Taking this into account, we axiomatically show when a numeration of Er\u{s}ov [3] forms a model of $\lambda$-calculus. This serves as a general framework for countable models of $\lambda$-calculus. Various examples of such numerations are studied. An algebraic characterization of this class of numerations is also given.