ppxscal/embedding_network huggingface dataset:
Linear and circular splicing systems
Authors: D. Pixton
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

Considers closure properties of classes of languages under the operation of iterated splicing. The main result is that full abstract families of languages are closed under splicing using a regular set of splicing rules. The author has the same result for families of circular strings, with two extra assumptions: the languages in the abstract family must be closed under cyclic permutations and the splicing scheme must be reflective. In both cases the hypotheses are satisfied by the families of regular languages and of context-free languages.
Avalanches, Scaling, and Coherent Noise
Authors: M. E. J. Newman, Kim Sneppen
Venue:  (1996)

We present a simple model of a dynamical system driven slowly by externally-imposed coherent noise. Although the system never bcomes critical in the sense of possessing spatial correlations of arbitrarily long range, it does organize into a stationary state characterized by avalanches with a universal power-law size distribution. We explain the behavior of the model within a time-averaged approximation, and discuss its connection to the dynamics of earthquakes, the Gutenberg-Richter law, and to recent experiments on avalanches in rice piles.
Techniques for Handling Inference Complexity in Dynamic Belief Networks
Authors: Ann Nicholson, Stuart Russell
Venue:  (1993)

Dynamic belief networks (DBNs) have been of interest recently as modelling tools for environments that change over time. In such networks, sets of nodes may be added automatically over time to represent current and future states. DBNs are typically multiply connected, and inference complexity is the biggest barrier to successful use. In this paper, we present both exact and heuristic techniques for state space reduction, thresholding and backtracking that can dramatically reduce inference costs without significantly reducing accuracy. We illustrate this in the domain of continuous monitoring of mobile robots. In order to control the costs and benefits of our heuristic methods, the system requires a good model of inference cost for any given network structure. We therefore also present results showing that Kanazawa''s ``join-tree cost'''' model gives a very good fit to actual inference costs in large networks.
TCP Boston: A Fragmentation-tolerant TCP Protocol for ATM Networks
Authors: Azer Bestavros, Gitae Kim
Venue:  (1996)

Abstract The popularity of TCP/IP coupled with the premise of high speed communication using Asynchronous Transfer Mode (ATM) technology have prompted the network research community to propose a number of techniques to adapt TCP/IP to ATM network environments. ATM offers Available Bit Rate (ABR) and Unspecified Bit Rate (UBR) services for best-effort traffic, such as conventional file transfer. However, recent studies have shown that TCP/IP, when implemented using ABR or UBR, leads to serious performance degradations, especially when the utilization of network resources (such as switch buffers) is high. Proposed techniques---switch-level enhancements, for example---that attempt to patch up TCP/IP over ATMs have had limited success in alleviating this problem. The major reason for TCP/IP''s poor performance over ATMs has been consistently attributed to packet fragmentation, which is the result of ATM''s 53-byte cell-oriented switching architecture. In this paper, we present a new transport protocol, TCP Boston, that turns ATM''s 53-byte cell-oriented switching architecture into an advantage for TCP/IP. At the core of TCP Boston is the Adaptive Information Dispersal Algorithm (AIDA), an efficient encoding technique that allows for dynamic redundancy control. AIDA makes TCP/IP''s performance less sensitive to cell losses, thus ensuring a graceful degradation of TCP/IP''s performance when faced with congested resources. In this paper, we introduce AIDA and overview the main features of TCP Boston. We present detailed simulation results that show the superiority of our protocol when compared to other adaptations of TCP/IP over ATMs. In particular, we show that TCP Boston improves TCP/IP''s performance over ATMs for both network-centric metrics (e.g., effective throughput) and application-centric metrics (e.g., response time).
Functional Size Measurement for Real Time and Embedded Software
Authors: A. Abran
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

Measures can be used to quantify software products as well as the process by which they are developed. Once these measures are obtained they can be used to build cost estimation models and productivity models. Through this perspective, a key measure is the size of a software product. There are basically two kinds of size measures: Technical size measures are used to quantify software products and processes from a developer's point of view. These can be used in efficiency analysis to improve the performance of the design. Functional measures are used to quantify software products and services from a user's perspective. Being independent of technical development and implementation decisions, functional measures can thus be used to compare the productivity of different techniques and technologies. In this context, organizations frequently use functional size measurement methods to quantify software products included in their outsourcing contracts. Function Points Analysis (FPA), first introduced in 1979 by Allan Albrecht of IBM (Albrecht, 1979), is an example of a functional size measure. FPA measures the size of software in terms of its delivered functionality to the end-users by quantifying such objects as inputs, outputs and files. Since FPA was developed for an MIS 1 environment, its concepts, rules and guidelines are adapted to software typical of that environment. FPA has been criticized as not being universally applicable to all types of software (Conte, 1986; Galea, 1995; Grady, 1992; Hetzel, 1993; Ince, 1991; Jones, 1988; Jones, 1991; Kan, 1993; Whitmire, 1992). Ã problem with the function point approach is that it assumes a limited band of application types: typically, large file-based systems produced by agencies such as banks, building societies and retail organizations, and is unable to cope with hybrid systems such as the stock control system with a heavy communication component. (Ince, 1991, page 283) When FPA is applied to such software, the measurement results do not constitute an adequate size measurement.In 1997, a new extension to Function Points (Full Function Points - FFP) was developed for measuring the functional size of real-time software to address weaknesses of IFPUG's Function Points. The International Software Benchmarking Standards Group recently accepted FFP as a new measurement standard for real-time software.This mini-tutorial will present the key concepts of this extension as well as the results of the measurement field tests in different organizations. The ability of FFP to adequately capture the functional size of real-time software will be illustrated by FFP and FPA measurements taken on the same software products.
New Algorithms for Modeling of Curves and Surfaces
Authors: Michael Zuev
Venue:  (1997)

This article concerns some aspects of curves and surfaces modeling field with regards to spline - interpolation problems. Derivatives computation methods are discussed, such as Modified - Lagrange technique, and Spline-Matrix inversion methodologies for Degrees = 3 and 5. Spline - curve fitting algorithm is proposed, based on the new analytical method for segment fitting with polynomials. New analytical technique for arc-length fast computation is described. Spline - Curves'' converters between Hermit, Bezier, B-spline and Power - basis representations are discussed. Spline- Surfaces'' construction and evaluation algorithms are presented, such as: evaluation technique for the single u-v patch, conversion between various Spline - representations and partial derivatives'' computation algorithms. New Loft - Surfaces'' construction and re-parametrization algorithm, free from false loops appearance is proposed, instead of conventional iso-curves lofting approach. New methodology is discussed to create a universal converter from any parametrical surface to the optimized Spline, which keeps tolerance specified and minimizes the amount of u-v patches. New Local Surface Deformation approach is presented. 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
A Memory Management Architecture for a Mobile Computing Environment
Authors: S. Yokoyama, T. Okuda, T. Mizuno, T. Watanabe
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In recent years, the rapid progress of hardware technology has enabled people to use mobile terminals away from the office or home with the use of cellular phones. However there are not a little remaining issues which are narrow bandwidth of wireless communications, the limited battery duration of mobile terminals, and others. This paper proposes a common memory management mechanism for mobile terminals and servers called Memory Management Architecture for Mobile Computing Environment (MMM). MMM allocates a part of the memory of a mobile terminal and a part of the memory of a server as common memory and maintains the consistency of the common memory areas. We evaluate MMM using sample application program models against traditional memory. The result shows that MMM can reduce wireless traffic to maintain consistency, and that depending on the charge policy, a different prefetching scheme is efficient in minimizing communication cost.
PFS: a distributed and customizable file system
Authors: P. Bosch, S. Mullender
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

In this paper we present our ongoing work on the Pegasus File System (PFS), a distributed and customizable file system that can be used for off-line file system experiments and on-line file system storage. PFS is best described as an object-oriented component library from which either a true file system or a file-system simulator can be constructed. Each of the components in the library is easily replaced by another implementation to accommodate a wide range of applications.
The stable central limit theorem for local martingales with bounded jumps via Skorohod embedding
Authors: J. H Zanten
Venue:  (2000)

The stable central limit theorem for properly normalized local martingales with bounded jumps is proved. Instead of the usual characteristic function-type methods we use an embedding technique in combination with a result on nested Brownian motions. In this approach, the stability of the CLT is explained by the fact that nested Brownian motions are asymptotically independent of any other random element. As was previously shown in the special case of continuous local martingales, the embedding technique leads to short and transparent arguments. In the conclusion we discuss the direction in which further research is needed to make the embedding method applicable in an even larger number of situations.
Requirements for abnormal conditions and events analysis
Authors: J. R. Matras
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The Department of Defence has identified the need to analyze safety systems to eliminate or reduce the associated risk of personnel injury, equipment damage, and environmental damage; Mil-Std-882B, "System Safety Program Requirements" was developed to guide this analysis. The IEEE Computer Society further realized that when software was part of the safety system design software specific additional requirements to Mil-Std-882B were required. The IEEE Computer Society developed IEEE Std 1228, "IEEE Software Safety Plans", which addresses the planning of the management and technical aspects of the safety system software development process to identify, hazards associated with the software design. The nuclear industry, relying on the techniques identified in the above standards, felt a need for the analysis of abnormal conditions and events (ACE) when a digital computer is used in the design of safety systems in nuclear power plants. The paper identifies the requirements for performing an ACE analysis during or after completion of a computer system design and the methodologies that could be used when preforming the analysis.
Formal Verification of a Complex Pipelined Processor
Authors: Ravi Hosabettu, Ganesh Gopalakrishnan, Mandayam Srivas
Venue: Formal Methods in System Design (2003)

This paper addresses the problem of formally verifying the correctness of a complex pipelined microprocessor at the micro-architectural level of abstraction. The design verified is an example out-of-order execution processor with a reorder buffer, a store buffer, branch prediction, speculative execution and exceptions. We propose a systematic approach called the Completion Functions Approach to decompose and incrementally build its proof of correctness. The central idea is to construct the abstraction function using completion functions, one per unfinished instruction, each of which specifies the effect on the programmer visible state components of completing the instruction. This construction of the abstraction function leads to a very natural decomposition of the proof into proving a series of verification conditions. The approach prescribes a systematic way to generate these verification conditions which can then be discharged with a high degree of automation using techniques based on decision procedures and rewriting. The verification was completed in 34 person days, which we believe, is a modest investment in return for the significant benefits of formal verification.
Baseline Estimation For Arabic Handwritten Words
Authors: M. Pechwitz, V. Märgner
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Baseline information has been used for diverse purposes in handwriting research. The baseline represents a first orientation in a word and it is often a precondition for subsequentalgorithms, including preprocessing tasks, segmentation and feature extraction for recognition systems. Approaches based on the horizontal projection histogram are used for Arabic printed text but they are ill-suited for Arabic handwritten words. In this paper we present a method thatis completely based on polygonally approximated skeleton processing. The central algorithm is concerned with finding features in the skeleton and processing linear regression analysis. Our method performs very well as long as the model assumption of one straight line applies. We tested the method on 26459 isolated Tunisian town names written by 411 writers (IFN/ENIT-database).
designing web graphics.4: the definitive guide to web design & development, 4 edition
Authors: Lynda Weinman, Ali Karp
Venue:  (2002)

:The most influential web design book ever written, completely updated to cover motion graphics, broadband interactive design, and more. Since it was first published in 1995, designing web graphics has been the seminal resource for web designers to learn the basics and then the nuances of solid design for the web. Lynda Weinman has been updating the book to reflect changes in the technologies affecting web design, but dwg.4 has been largely rewritten from the ground up. Included is coverage of motion graphics made possible by the Flash phenomenon, broadband-enabled graphics issues, usability, and more. Lynda is rewriting the book so that all coverage of specific tools is focused on the essential functionality of these programs (Photoshop, Dreamweaver, Flash, etc.) and not on version-specific attributes of the software, making the book relevant longer for more users.
Preparing Measurements of Legacy Software for Predicting Operational Faults
Authors: Taghi M. Khoshgoftaar, Edward B. Allen, Xiaojing Yuan, Wendell D. Jones, John P. Hudepohl
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Software quality modeling can be used by a software maintenance project to identify a limited set of software modules that probably need improvement. A model's goal is to recommend a set of modules to receive special treatment. The purpose of this paper is to report our experiences modeling software quality with classification trees, including necessary preprocessing of data.We conducted a case study on two releases of a very large legacy telecommunications system. A module was considered fault-prone if any faults were discovered by customers, and not fault-prone otherwise. Software product, process, and execution metrics were the basis for predictors.The treedisc algorithm for building classification trees was investigated, because it emphasizes statistical significance. Numeric data, such as software metrics, are not suitable for treedisc . Consequently, we transformed measurements into discrete ordinal predictors by grouping. This case study investigated the sensitivity of modeling results to various groupings. We found that robustness, accuracy, and parsimony of the mod- els were influenced by the maximum number of groups. Models based on two sets of candidate predictors had similar sensitivity.
Intranet Security with Micro-Firewalls and Mobile Agents for Proactive Intrusion Response
Authors: Muralidaran Gangadharan, Kai Hwang Hwang
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

We propose a distributed multi-level architecture to solve the Intranet security problem. The basic idea is to build micro firewalls on all hosts in the Intranet, as a second line of defense behind the gateway firewall. A distributed intrusion detection system (IDS) is developed to achieve proactive intrusion responses with dynamic policy changes. Mobile agents, CORBA,and RMI are evaluated for dynamic policy update. We find that mobile agents are most scalable and robust for policy update, but prone to attacks by other agents and hosts. CORBA has the best speed performance. The Java-based RMI has the highest security based onthe sandbox model. Key concepts, preliminary results, and continued research challenges are presented.
Extending RMI to Support Dynamic Reconfiguration of Distributed Systems
Authors: Xuejun Chen
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

By the use of the ability of dynamic reconfiguration, the flexibility, adaptability, and extensibility of distributed systems are enhanced. How to treat interactions among components during a dynamic reconfiguration is still one of the most crucial problems in this research area. Thischallenge should be met by middleware design and development. However, the current standard middleware offers little support for dynamic reconfiguration of distributed systems. In this paper, we describe an extended Java RMI that supports efficiently dynamic reconfiguration of distributed systems. This extended Java RMI can automatically monitor and manipulate invocations between components during a dynamic reconfiguration. Moreover, theextended Java RMI can automatically switch invocations from remote to local and vice versa.
Efficient Parallel Algorithms on Restartable Fail-stop Processors
Authors: Paris C. Kanellakis, Alex A. Shvartsman
Venue:  (1991)

We study efficient deterministic execution of parallel algorithms on restartable fail-stop CRCW PRAMs. We allow the PRAM processors to be subject to {\em arbitrary stop failures} {\bf and} {\em restarts} that are determined by an on-line adversary and result in loss of private memory but do not affect shared memory. For this model, we define and justify the complexity measures of {\em completed work}, where processors are charged for completed fixed-size update cycles, and {\em overhead ratio}, which amortizes the work over necessary work and failures. This framework is a nontrivial extension of the fail-stop no-restart model of [KS~89]. We present a simulation strategy for any $N$-processor PRAM on a restartable fail-stop $P$-processor CRCW PRAM such that: it guarantees a terminating execution of each simulated $N$ processor step, with $O(\log^2 N)$ overhead ratio, and $O(\min \{N +P \log^2 N+ M \log N$, $N \cdot P^{0.6}\})$ (sub-quadratic) completed work, where $M$ is the number of failures during this step''s simulation. This strategy is work-optimal when the number of simulating processors is $P \leq N/\log^2 N$ and the total number of failures per each simulated $N$-processor step is $O(N/\log N)$. These results are based on a new algorithm for the $WA$ problem ``$P$ processors write 1''s in an array of size $N$'''', together with a modification of the main algorithm of [KS~89] and with the techniques in [KPS~90, Shv~89]. We observe that, on $P=N$ restartable fail-stop processors, the $WA$ problem requires $\Omega(N \log N)$ completed work, and this lower bound holds even under the additional assumption that processors can read and locally process the entire shared memory at unit cost. Under this unrealistic assumption we have a matching upper bound. The lower bound also applies to the expected completed work of randomized algorithms that are subject to on-line adversaries. Finally, we describe a simple on-line adversary that causes inefficiency in many randomized algorithms.
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
Authors: K P Agarwal, Micha Sharir
Venue:  (1993)

We consider the problem of ray shooting in a 3-dimensional scene consisting of $m$ (possibly intersecting) convex polyhedra or polyhedral terrains with a total of $n$ faces, i.e., we want to preprocess them into a data structure, so that the first intersection point of a query ray and the given polyhedra can be determined quickly. We present a technique that requires $O((mn)^{2+\epsilon})$ preprocessing time and storage, and can answer ray shooting queries in $O(\log n)$ time. This is a significant improvement over previously known techniques (which require $O(n^{4+\epsilon})$ space and preprocessing) if $m$ is much smaller than $n$, which is often the case in practice. Next, we present a variant of the technique that requires $O(n^{1+\epsilon})$ space and preprocessing, and answers queries in time $O(m^{1/4}n^{1/2+\epsilon})$, again a significant improvement over previous techniques when $m \ll n$.
Buckling of long, sandwich cylindrical shells under pressure
Authors: G. A. Kardomateas, G. J. Simitses
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper deals with the theoretical prediction of buckling loads for sandwich long cylindrical shells with laminated facings and foam core. The loading is a uniform hydrostatic pressure, which means that the loading remains normal to the deflected surface during the buckling process. Several fiber materials are used in the laminated facings. The materials are: Boron/Epoxy, Graphite/Epoxy and Kevlar/Epoxy laminates with 0° orientation with respect to the hoop direction. These various materials are employed to provide comparative data that can be used in design. Shell theory results are generated with and without accounting for the transverse shear effect. Moreover, results based on three-dimensional elasticity are also generated for comparison purposes. The effect of the ratio of radius to thickness is assessed.