ppxscal/embedding_network huggingface dataset:
Requirements Documentation: Why a Formal Basis is Essential
Authors: David Lorge Parnas
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

Unless you have a precise description of your product's requirements, it is very unlikely that you will satisfy them. Only if the implementer already has a deep understanding of the problem can you hope to come close without documenting the requirements. Even in that case, potential disagreements make producing a requirements document worthwhile.
Generalized ultrametric spaces: completion, topology, and powerdomains via the Yoneda embedding
Authors: Marcello M. Bonsangue, Franck Breugel, J. J.M.M. Rutten
Venue:  (1995)

Generalized ultrametric spaces are a common generalization of preorders and ordinary ultrametric spaces (Lawvere 1973, Rutten 1995). Combining Lawvere''s (1973) enriched-categorical and Smyth'' (1987, 1991) topological view on generalized (ultra)metric spaces, it is shown how to construct 1. completion, 2. topology, and 3. powerdomains for generalized ultrametric spaces. Restricted to the special cases of preorders and ordinary ultrametric spaces, these constructions yield, respectively: 1. chain completion and Cauchy completion; 2. the Alexandroff and the Scott topology, and the epsilon-ball topology; 3. lower, upper, and convex powerdomains, and the powerdomain of compact subsets. Interestingly, all constructions are formulated in terms of (an ultrametric version of) the Yoneda (1954) lemma.
Equivalence of Julesz and Gibbs Texture Ensembles
Authors: Ying Nian Wu, Song Chun Zhu, Xiuwen Liu
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Research on texture has been pursued along two different lines. The first line of research, pioneered by Julesz (1962), seeks the essential ingredients in terms of features and statistics in human texture perception. This leads us to a mathematical definition of texture as a Julesz ensemble. A Julesz ensemble is the maximum set of images that share the same value of some basic feature statistics as the image \math, or equivalently it is a uniform distribution on this set. The second line of research studies statistical models, in particular, Markov random field (MRF) and FRAME models (Zhu, Wu, and Mumford 1997), to characterize texture patterns locally.In this article, we bridge the two lines by the fundamental principle of equivalence of ensembles in statistical mechanics (Gibbs, 1902). We prove that 1). The conditional probability of an arbitrary image patch given its environment, under the Julesz ensemble or the uniform model, is inevitably a FRAME (MRF) model, and 2). The limit of the FRAME (MRF) model, which we called the Gibbs ensemble, is equivalent to a Julesz ensemble as \math. Thus the advantages of the two methodologies can be fully utilized.
Formal grammars for intermolecular structure
Authors: D. B. Searls
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

Formal grammars can be used to model general forms of intramolecular structure, such as secondary structure of nucleic acids. A new formalism, called cut grammar, is shown to model intermolecular assemblages such as hybridization products, as well. Formal grammars themselves can be modelled by sets of oligonucleotides, and derivations from any context-free grammar can in theory be simulated by hybridization experiments.
The Reliability of Life-Critical Computer Systems
Authors: M R Geist, K M Smotherman, S K Trivedi, B J Dugan
Venue:  (1985)

In order to aid the designers of fault-tolerant life-critical systems, accurate and efficient methods for reliability prediction are needed. The accuracy requirement implies the need to model the system in great detail and hence the need to address the problems of large state space, non-exponential distributions, and error analysis. The efficiency requirement leads us to the use of decomposition/aggregation in the context of a hybrid model. Specifically, our model is partitioned into fault occurrence and fault/error handling submodels, which are represented by non-homogeneous Markov and extended stochastic Petri net (ESPN) models, respectively. The overall aggregated model is an unusual stochastic process that is solved by numerical techniques. Furthermore, we have developed methods to analyze the effects of variations in input parameters on the resulting reliability prediction. These topics are discussed in detail, and illustrative examples are provided.
Fine Grain Concurrent Computations
Authors: William C. Athas
Venue:  (1987)

This thesis develops a computational model, a programming notation, and a set of programming principles to further and to demonstrate the practicality of programming fine grain concurrent computers. Programs are expressed in the computational model as a collection of definitions of autonomous computing agents called objects. In the execution of a program, the objects communicate data and synchronize their actions exclusively by message-passing. An object executes its definition only in response to receiving a message, and its actions may include sending messages, creating new objects, and modifying its own internal state. The number of actions that occur in response to a message is finite; Turing computability is achieved not within a single object, but through the interaction of objects. A new concurrent programming notation Cantor is used to demonstrate the cognitive process of writing programs using the object model. Programs for numerical sieves, sorting, the eight queens problem, and Gaussian elimination are fully described. Each of these programs involve up to thousands of objects in their execution. The general programming strategy is to first partition objects by their overall behavior and then to program the behaviors to be self-organizing. The semantics of Cantor are made precise through the definition of a formal semantics for Cantor and the object model. Objects are modelled as finite automata. The formal semantics is useful for proving program properties and for building frameworks to capture specific properties of object programs. The mathematical frameworks are constructed for building object graphs independently of program execution and for systematically removing objects that are irrelevant to program execution (garbage collection). The formal semantics are complemented by experiments that allow one to study the dynamics of the execution of Cantor programs on fine grain concurrent computers. The clean semantics of Cantor suggests simple metrics for evaluating the execution of concurrent programs for an ideal, abstract implementation. Program performance is also evaluated for environments where computing resources are limited. Prom the results of these experiments, hardware and software architectures for organizing fine grain message-passing computations is proposed, including support for fault tolerance and for garbage collection.
Synthesis of Selectively Clocked Skewed Logic Circuits
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Skewed logic circuits with selective clocking scheme have performance comparable to that of Domino logic, but consume much lower power. Unlike Domino, the reconvergent path problem in skewed logic circuits may be overcome without logic duplication due to the static nature of skewed logic. In this paper, we propose a novel approach that alleviates the need for logic duplication when dealing with reconvergent paths in skewed logic circuits. We also propose a dynamic programming-based heuristic to determine a low-power clocking scheme for skewed logic circuits. Experimental results show that 32% of gates in a skewed logic circuit are duplicated, whereas 69% of gates in a Domino logic circuit are duplicated. The total power saving of skewed logic over Domino logic is 32.6% on average.
Advances in ATM Network Management and Control
Venue:  (1995)

Due to limited buffers and highly unpredictable traffic loads, the design of effective buffer management policies that minimize cell loss is critical to ATM networks. This thesis presents a complete characterization of optimal buffer control policies for a single network node. Using a dynamic programming formulation for a simple two-node network, we gain insights into the much harder general multi-node problem. The key result we present is that simple non-work conserving policies which use limited feedback from adjacent nodes can reduce cell loss significantly. We construct a feedback-based control that uses simple ``stop-and-go'''' rules. This control is then enhanced to react to rapidly changing network conditions. This new control is called the {\it Adaptive HILO} policy. Simulation studies of complex networks with large delay-bandwidth products show that the {\it Adaptive HILO} policy performs impressively under diverse conditions. Using intuitive arguments, we demonstrate that this policy effectively utilizes unused buffer capacity in upstream buffers during periods of heavy load in downstream buffers. Buffer management can also be used to reduce {\em block loss} in ATM networks. Traditional approaches to guaranteeing Quality-of-Service (QoS) in ATM networks have focused on performance metrics such as cell loss probability, end-to-end cell delay and delay jitter. However, the {\em block loss rate} is a more meaningful metric for high-level protocols such as IP which will use ATM as the transport mechanism. A block is defined as a group of consecutive ATM cells. For instance, a block may correspond to an IP datagram. A block loss occurs when a single cell from a block is lost. Consequently, we propose a technique for reducing block loss in ATM networks. Our method combines two well-studied approaches for minimizing the impact of information loss during transport over ATM networks which have been considered independently of each other in the past: {\em priority-based cell discarding} and {\em forward error correction} (FEC). We present analysis and simulation results which show that our scheme reduces the block loss rate significantly for many cases of interest. Then, we formulate and solve a related constrained optimization problem that can be used by a call admission control mechanism to determine optimal operating parameters. We also propose and study a buffer management algorithm which we call Adaptive Pushout (ADP) that accounts for correlations between cell losses. The ADP algorithm reduces block loss rates to near-optimal levels. We consider further performance enhancements to the ADP policy that deliver excellent performance even under very heavy load. Practical implementation issues for the various schemes suggested in this thesis are also addressed. 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
Adobe GoLive 6.0 Classroom in a Book
Authors: Adobe Creative Team
Venue:  (2002)

:UntitledWhen it comes to mastering Adobe GoLive, Adobe GoLive 6.0 Classroom in a Book puts you in a class of your own. This hands-on workbook leads you through a series of lessons that teach you everything you need to know to quickly get to work with the latest version of GoLive, but you learn on your own time, at your own pace. And here's something else that sets it apart from the other GoLive books out there: Adobe's Classroom in a Book is the only one that gives you the official training course created by the company's own team and tested in its classrooms and labs. Adobe GoLive 6.0 Classroom in a Book makes it easy to learn what you want to know when you need to know it. The Adobe Creative Team breaks down GoLive and Web publishing into clear, step-by-step lessons that cover key concepts such as toolbars, palettes, layout design, the collaborative Adobe Web WorkGroup Server, site architecture, dynamic content creation, wireless-device authoring, Cascading Style Sheets, image maps, and more. You'll never feel overwhelmed by the information. At the end of each chapter, review questions wrap up and reinforce what you've learned, and the accompanying CD-ROM gives you customized files and images designed for use in conjunction with the book's hands-on exercises.
Mastering Resin, 1 edition
Authors: Richard Hightower, Joseph D. Gradecki
Venue:  (2003)

:The official guide to Resin, authorized by the company that invented the product, Caucho Technology Offers a comprehensive tutorial and reference on how to use all flavors of Resin, including the basic Resin server, Resin-CMP, and Resin-Enterprise Demonstrates how to build enterprise Java applications, optimize performance, and use other tools with Resin Illustrates how to configure Resin for various commercial and open source hardware platforms, maintain high availability of the server, and use all of the advanced features Companion Web site includes updates on the technology and links to useful resources and tools
Compact Layout Rule Extraction for Latchup Prevention in a 0.25-µm Shallow-Trench-Isolation Silicided Bulk CMOS Process
Authors: Howard Tang
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

An experimental extraction to find the area-efficient compact layout rules to prevent latchup in bulk CMOS IC's is proposed. The layout rules are extracted from the test patterns with different layout spacings or distances. A new efficient latchup prevention design, by adding the additional internal guard rings between the I/O cells and the internal core circuits, has been successfully proven in a 0.25-mm shallow-trench-isolation (STI) silicided bulk CMOS process. Through detailed experimental verification including temperature effect, the proposed extraction method to define compact layout rules has been established to save the silicon area of CMOS IC's, but still to maintain high enough latchup immunity in bulk CMOS IC's. 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
Monotonicity and Partial Results Protection for Mobile Agents
Authors: Bennet Yee
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Remotely executing mobile code introduces a plethora ofsecurity problems. This paper examines the "external agentreplay" attack, identifies the notion of one-way programstate transitions, describes the use of monotonic variablesas a practical method for detecting these attacks, examinesthe more general problem state modification attacks, and introducesthe use of "results verification vectors" to protectagents from attack.
Recovery Support for Internet-Based Real-Time Collaborative Editing Systems
Authors: Xiao Qin, Chengzheng Sun
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

For reliability, recovery support must be employed in the Internet-based real-time collaborative editing systems. This paper describes a recovery scheme in which each site maintains a local document state (LDS) that is generated periodically. Thus, if a failure occurs in the Internet links or at the site, the site can rejoin the collaborative editing system by loading the LDS instead of obtaining the state from the remote sites. This is a much faster process than the traditional approach the recovery of regaining the system's document state from other peersites. Consistency between the local state and remote state during the recovery procedure is maintained in a recovery algorithm for which the proof is provided. The performance of our recovery scheme is assessed by generating the elapsed time between a failed site joiningand leaving the systems.
Sums of heights of algebraic numbers
Authors: Gregory P. Dresden
Venue: Mathematics of Computation (2003)

For At(x) = f(x) - tg(x), we consider the set {ΣAt(α)=0 h(α) : t ∈ Q}. The polynomials f(x), g(x) are in Z[x], with only mild restrictions, and h(α) is the Weil height of α. We show that this set is dense in [d, ∞) for some effectively computable limit point d.
Agents and Autonomous Distributed Systems
Authors: Tolety Siva Perraju
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

An Autonomous Distributed System (ADS) is a collection of autonomous entities, which realize a given function through mutual interactions. This concept of ADS allows the development of systems, which involves a large number of independent entities and dynamically changing structure to meet the evolving userrequirements. Agents are characterised by the concepts of situatedness, exibility and autonomy. A multi agent system is a group of interacting agents. In this position paper, we explore the relevance of agent technology to the design and implementation of autonomous distributed systems.
Requirements interaction management
Authors: William N. Robinson, Suzanne D. Pawlowski, Vecheslav Volkov
Venue: ACM Computing Surveys (CSUR) (2003)

Requirements interaction management (RIM) is the set of activities directed toward the discovery, management, and disposition of critical relationships among sets of requirements, which has become a critical area of requirements engineering. This survey looks at the evolution of supporting concepts and their related literature, presents an issues-based framework for reviewing processes and products, and applies the framework in a review of RIM state-of-the-art. Finally, it presents seven research projects that exemplify this emerging discipline.
The 1986-1987 Taulbee Survey Report: The Computing Research Board''s Survey on the Production and Employment of Ph.D.''s and Faculty in Computer Science and Engineering
Authors: David Gries, Dorothy Marsh
Venue:  (1988)

NOT AVAILABLE
Frequency-Based Selective Caching Strategy in a Continuous Media Server
Authors: Yong Woon Park, Jong Hyun Kim, Ki Dong Chung
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In this paper, we propose a frequency-based selective caching scheme where the buffer allocation unit varies with the access frequency of the requested object. With this scheme, buffer allocation works at either the distance level or object level. Once a request is admitted, it is sent to the disk(s) directly if the average arrival rate for the requested object does not exceeds the marginal arrival rate. A distance between the requested stream and the preceding one accessing the same object is cached as a function of the length of the distance and the size of the buffer cache. An object is cached in its entirety, i.e., its caching mode can be changed into object mode if the average distance among the current streams for that object exceeds the average distance of the total number of current cached streams in the buffer cache. Our conclusion derived from the simulation is that our proposed caching scheme is more effective than other caching policies such as LRU and interval when it is applied to continuous media data.
NC Algorithms for Comparability Graphs, Interval Graphs, and Unique Perfect Matchings
Authors: Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani
Venue:  (1986)

Laszlo Lovasz recently posed the following problem: ``Is there an NC algorithm for testing if a given graph has a unique perfect matching?'''' We present such an algorithm for bipartite graphs. We also give NC algorithms for obtaining a transitive orientation of a comparability graph, and an interval representation of an interval graph. These enable us to obtain an NC algorithm for finding a maximum matching in an incomparability graph.
De-aliasing Undersampled Volume Images for Visualization
Authors: Galen G. Gornowicz, David H. Laidlaw, Jerry W. Shan, Daniel B. Lang, Paul E. Dimotakis
Venue:  (1997)

We present and illustrate a new technique, Image Correlation Supersampling (ICS), for resampling volume data that are undersampled in one dimension. The resulting data satisfies the sampling theorem, and, therefore, many visualization algorithms that assume the theorem is satisfied can be applied to the data. Without the supersampling the visualization algorithms create artifacts due to aliasing. The assumptions made in developing the algorithm are often satisfied by data that is undersampled temporally. Through this supersampling we can completely characterize phenomena with measurements at a coarser temporal sampling rate than would otherwise be necessary. This can save acquisition time and storage space, permit the study of faster phenomena, and allow their study without introducing aliasing artifacts. The resampling technique relies on a priori knowledge of the measured phenomenon, and applies, in particular, to scalar concentration measurements of fluid flow. Because of the characteristics of fluid flow, an image deformation that takes each slice image to the next can be used to calculate intermediate slice images at arbitrarily fine spacing. We determine the deformation with an automatic, multi-resolution algorithm.
Performability Analysis: Measures, An Algorithm, and A Case Study
Authors: M R Smith, S K Trivedi, V A Ramesh
Venue:  (1987)

Multi-processor systems can provide higher performance and higher reliability/availability than single-processor systems. In order to properly assess the effectiveness of multi-processor systems, measures that combine performance and reliability are needed. We describe the behavior of the multi-processor system as a continuous-time Markov chain and associate a reward rate (performance measure) with each state. We evaluate the distribution of performability for analytical models of a multi-processor system using a new polynomial-time algorithm that obtains the distribution of performability for repairable, as well as non-repairable, systems with heterogeneous components with a substantial speedup over earlier work. Numerical results indicate that distributions of cumulative performance measures over finite intervals reveal behavior of multi-processor systems not indicated by either steady-state or expected values alone.
Detecting failed processes using fault signatures
Authors: A. Avritzer, E. J. Weyuker
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

A strategy is presented for automatically identifying processes that have failed. A determination is made of the types of data that need to be collected, and circumstances under which the approach is likely to be useful. The strategy is applied to generate signatures for three different types of workloads, and several different resources. A typical failure is injected into the process, and the associated signatures are presented for the same workloads and resources. A measure as defined that is used to determine whether or not a signature is likely to be indicative of a faulty process.