ppxscal/embedding_network huggingface dataset:
An Admission Control Paradigm for Real-Time Databases
Authors: Azer Bestavros, Sue Nagy
Venue:  (1996)

Abstract We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task, and a recovery block. The execution requirements of the primary task are not known a priori, whereas those of the recovery block are known a priori. Upon the submission of a transaction, an Admission Control Mechanism is employed to decide whether to admit or reject that transaction. Once admitted, a transaction is guaranteed to finish executing before its deadline. A transaction is considered to have finished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its recovery block is completed (safe termination). Committed transactions bring a profit to the system, whereas a terminated transaction brings no profit. The goal of the admission control, and scheduling protocols (e.g., concurrency control, I/O scheduling, memory management) employed in the system is to maximize system profit. We describe a number of admission control strategies and contrast (through simulations) their relative performance.
RUSPACE(log n) is contained in DSPACE(log^2 n / loglog n)
Authors: Eric Allender, Klaus Lange
Venue:  (1997)

We present a deterministic algorithm running in space O(log^2 n/ loglog n) solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.
An Operation Placement and Scheduling Scheme for Cache and Communication Localities in Fine-Grain Parallel Architectures
Authors: Yen-Kuang Chen, S. Y. Kung
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

With increasing on-chip hardware, concurrency is a way to bridge the gap between the computational power demanded by the applications and that afforded by the computer platforms. Although parallel systems are increasingly popular, they remain very difficult to program. In fact, most compilers require the programmer to specify how to partition data or map program code to the system's processors. To ensure an effective program, cache locality is important because of the large speed gap between microprocessors and memory systems. It is also important to make use of local communication whenever possible, since it is cheaper, faster, and less power hungry than global communication. In order to exploit these locality properties, we present a systematic operation placement and scheduling scheme for fine-grain parallel architectures. The key advantages are two folds: (1) This multiprojection method, which deals with multidimensional parallelism systematically, can alleviate the burden of the programmer in coding and data partitioning. (2) It addresses the memory/communication bandwidth bottleneck, and can lead to faster program execution. On a special design example of the motion estimation block-matching algorithm, which requires the most intensive computation and memory accesses in video coding, our method leads to a reduction of external memory accesses by two to three orders of magnitude.
A proof for lack of starvation in DQDB with and without slot reuse
Authors: O. Sharon
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

DQDB is the IEEE 802.6 MAC standard protocol for metropolitan area networks. It is designed for the slotted, dual BUS configuration. A simple way to improve the performance of DQDB is to perform slot reuse and many methods have been suggested in the past to efficiently incorporate slot reuse with DQDB. However, some of them can lead to starvation. The authors improve one of these previous suggestions and the main contribution of the paper is that for the first time they also provide a proof that the improved scheme ensures lack of starvation. They also specify this proof for the important case of DQDB without slot reuse.
Interpretation of dynamic pile load tests using neural networks
Authors: A. S. Dyminski, C. Romanel, E. Parente Ribeiro
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Dynamic load tests are commonly used in geotechnical engineering for estimates of the bearing capacity of piles. Mathematical methods based on the wave propagation theory have been developed to interpreted the experimental results, such as the known CAPWAP method. In this paper, a different approach is presented, using neural networks, considering several architectures with variable number of input parameters, to predict the mechanical behaviour of either steel or concrete piles. Two data files were assembled by collecting information from more than one hundred Brazilian dynamic test reports. The results obtained in this research indicate that neural networks can yield satisfactory predictions, with analysis and interpretation being carried out simultaneously with the data acquisition in the field tests.
Relaxed multi-way trees with group updates
Authors: Kim S. Larsen
Venue: Journal of Computer and System Sciences (2003)

Data structures with relaxed balance differ from standard structures in that rebalancing can be delayed and interspersed with updates. This gives extra flexibility in both sequential and parallel, applications. We study the version of multi-way trees called (a, b)-trees (which includes B-trees) with the operations insertion, deletion, and group insertion. The latter has applications in for instance document databases, WWW search engines, and differential indexing. We prove that we obtain the optimal asymptotic rebalancing complexities of amortized constant time for insertion and deletion and amortized logarithmic time in the size of the group for group insertion. These results hold even for the relaxed version. This is an improvement over the existing results in the most interesting cases.
Using Application Specific Knowledge for Configuring Object Replicas
Authors: Mark C. Little, Santosh K. Shrivastava
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Indistributed systems, object replication is used to improve the availability and performance of applications in the presence of failures. When determining the configuration of a replicated object (i.e., number and location of replicas), a number of often conflicting factors need to be considered, e.g., the availability and performance requirements of the object. However, application specific knowledge about the objects, such as any inter-dependencies, is typically not accounted for. In many applications this information can affect an object's availability. Distributed systems which support replication typically give users only basic control over the configuration of a replicated object, such as the number or location of individual replicas. Expressing application specific knowledge is not possible. We have designed and implemented a replication sub-system allowing applications to control these aspects of replication. This system allows the efficient replication of an arbitrary number of objects with arbitrary inter-dependencies.
Building Reliable Interoperable Distributed Objects with The Maestro Tools
Authors: Alexey Vaysburd
Venue:  (1998)

This work presents the Maestro Tools for development of reliable interoperable object-oriented distributed applications. We discuss the three fundamental parts of Maestro -the object group tools, the client/object interoperability tools, and the group protocols which implement state machine replication of distributed objects -with a special focus on practical usability and system integration issues.
Structuring Integrated Web Applications for Fault Tolerance
Authors: Alexander Romanovsky, Panos Periorellis, Avelino F. Zorzo
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

This paper shows how modern structuring techniques can be employed in integrating complex web applications such as Travel Agency systems. The main challenges the developers of such systems face are dealing with legacy web services and incorporating means for tolerating errors. Because of the very nature of such systems, exception handling is the main recovery technique to be applied in their development. We employ Coordinated Atomic actions to allow disciplined handling of such abnormal situations by recursively structuring the integrated system and by associating handlers with such actions. We use protective wrappers in such a way that each operation on legacy components is transformed into an atomic action with a well-defined interface. To accommodate a combined use of several ready-made environments (such as communication packages, services and run-time supports), we employ a multilevel exception handling. We believe that these techniques are generally applicable for both: structuring integrated web applications and providing their fault tolerance.
Formalizing Properties of Agents
Authors: Richard Goodwin
Venue:  (1993)

There is a wide gulf between the formal logics used by logicians to describe agents and the informal vocabulary used by people who actually build robotic or software agents. In an effort to help bridge the gap, this report applies techniques borrowed from the field of formal software methods to develop a common vocabulary. Terms useful for discussing agents are given formal definitions. A framework for describing agents, tasks and environments is developed using the Z specification language. The terms successful, capable, reactive, reflexive, perceptive, predictive, interpretive, rational and sound are then defined in terms of this framework. In addition, a hierarchy for characterizing tasks is given. The aim of this report is to develop a precise vocabulary for discussing and comparing agents.
Learning to Identify Interesting Links in Intelligent Information Discovery
Authors: D. Fragoudis, S. D. Likothanassis
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In the age of information overload, intelligent agents have proven themselves as a very useful tool for discovering information of interest on the Web. The information seeking process may be either static, by utilizing existing search engines or using collaborative techniques, or dynamic, by actively browsing the Web. In the second case, agents need to evaluate encountered hyperlinks and choose the promising ones for continuing their autonomous navigation. In this paper we describe a new learning method for identifying interesting links in autonomous information discovery and we present the preliminary results from applying the new method into difficult query domains.
Distributing requirements specifications on Basic Splice
Authors: S. M. Orzan
Venue:  (2001)

This is an extension of work presented in [Jaco van de Pol-Expressiveness of Basic Splice. Report SEN-R0033, December 2000]. It is proved that the seemingly weak architecture Basic Splice introduced there --in which the coordination of processes is done using only a global set with read/write primitives-- can support a distributed implementation of a large class of requirements specifications, namely LPEs (a muCRL intermediate representation of specifications). 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
On the containment of conjunctive queries
Authors: Georg Lausen, Fang Wei
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Testing containment of conjunctive queries is the question whether for any such queries Q1, Q2, for any database instance D, the set of answers of one query is contained in the set of answers of the other. In this paper, we first introduce into the general approach for testing for the case, when both queries do not contain negation. Based on these techniques we discuss the question for the case of queries with negation. We propose a new method and compare with the currently known approach. Instead of always testing the exponential number of possible canonical databases, our algorithm will terminate once a certain canonical database is constructed. However, in the worst case, still an exponential number of canonical databases has to be checked.
CODEX: content-oriented data EXchange model on CORBA
Authors: Yue-Shan Chang, Ruey-Shyang Wu, Kai-Chih Liang, Shyan-Ming Yuan, Magic Yang
Venue: Computer Standards Interfaces (2003)

Asynchronous Data Exchange (ADE) is useful in Electronic Data Interchange (EDI). It needs a well-defined mechanism to support data buffing, dispatching, and filtering. ADE is more flexible, extensible and scalable than the synchronous one. CORBA Event Service, announced by OMG, offers an easy-to-use, abstract and generic communication mechanism, while providing message delivering, dispatching and buffering by way of introducing the concept of event channels. However, it lacks some practical data exchange functions.This paper proposes the design and implementation of a system named CODEX (stand for Content-Oriented Data EXchange system), which combines the XML features and the functionality of CORBA (which stands for Common Object Request Broker Architecture) Event Service. The CODEX system equips functions of primitive data type checking, message classification, content filtering and source/destination screening. Application developers can focus more on business functions, instead of earing about the detail of data exchange. The concept and architecture of the content-oriented data exchange, provided by CODEX, can be applied to other practical computing fields in the large-scale, loosely coupled distributed computing environments.
Finding Small Sets of Essential Attributes in Binary Data
Authors: Boros Endre, Horiyama Takashi, Ibaraki Toshihide, Makino Kazuhisa, Yagiura Mutsunori
Venue:  (2000)

We consider the problem of finding support sets (i.e., sets of essential attributes) in a given data set, which consists of n-dimensional binary vectors of positive examples and negative examples. A set of attributes is a support set if positive examples and negative examples can be separated by using only the attributes in the set. Finding small support sets is an important topic in such fields as knowledge discovery, data mining, learning theory and logical analysis of data. Based on several measures of separation, we discuss why finding small support sets is important, and how to find such sets, together with results of some computational experiment. Theoretical analysis of the approximation ratios of the proposed algorithms is also provided.
ASIC design validation in a system context
Authors: J. Bartlett
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

The paper describes a methodology for ASIC design validation in a system simulation context. The methodology is based on using a single system level testbench across all levels of model abstraction and throughout the entire product development cycle. Topics covered include how to design a system simulation for ASIC validation, elements of a good validation plan, writing a Verilog system level testbench and testing at different model abstraction levels. The paper uses Verilog design examples from two different projects to illustrate validation of both single and multiple ASIC systems. The benefits of following this methodology to a project's quality, time to market and predictability are shown.
Interoperability Beyond Design: Sharing Knowledge between Design and Manufacturing
Authors: D. R. Cottrell, T. J. Grebinski
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

The nature of IC design has is necessarily evolving toa more data-centric design flow in which EDA tools sharea common information in a design database without thenegative cost and quality impacts of data translation fromsequential files. In support of this new paradigm, acollection of mainstream companies within the IC supplychain have sponsored the development of an openindustry data model and application program interfacefor IC design tools, along with a database that fullyimplements this. This technology, called OpenAccess, isnow available and being adopted by the IC designcommunity.Another industry effort is in operation with the goalof greatly improving the cost and efficiency for ICphotomasks. That effort is exploring a new paradigmsimilar in nature to OpenAccess in that a common datamodel and data access language is proposed. This datamodel would span both the design and mask-makingcommunities, and possibly expand into wafer fabricationover time. Thus, it has become known as the UniversalData Model (UDM).This paper discusses some of the rationale for theUDM and highlights the attributes of the OpenAccesstechnology that make it the ideal base on which to buildan open industry UDM.
Applications of Parametric Searching in Geometric Optimization
Authors: K P Agarwal, Micha Sharir, Sivan Toledo
Venue:  (1992)

We present several applications in computational geometry of Megiddo''s parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance in the Euclidean metric between two polygonal regions under translation; (2) Computing the biggest line segment that can be placed inside a simple polygon; (3) Computing the smallest width annulus that contains a given set of given points in the plane; (4) Given a set of {\em n} points in 3-space, finding the largest radius {\em r} such that if we place a ball of radius {\em r} around each point, no segment connecting a pair of points is intersected by a third ball. Besides obtaining efficient solutions to all these problems (which, in every case, either improve considerably previous solutions or are the first non-trivial solutions to these problems), our goal is to demonstrate the versatility of the parametric searching technique.
A Space-Optimized Tree Visualization
Authors: Quang Vinh Nguyen, Mao Lin Huang
Venue: Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02) (2002)

This paper describes a new method for the visualization of tree structured relational data. It can be used especially for the display of very large hierarchies in a 2-dimensional space. We discuss the advantages and limitations of current techniques of tree visualization. Our strategy is to optimize the drawing of trees in a geometrical plane and maximize the utilization of displayspace by allowing more nodes and links to be displayed at a limit screen resolution. We use the concept of enclosure to partition the entire display space into a collection of local regions that are assigned to all nodes in tree T for the display of their sub-trees and themselves. To enable the exploration of large hierarchies, we use a modified semantic zooming technique to view the detail of a particular part of the hierarchy at a time based on user's interest. Layout animation is also provided to preserve the mental map while the user is exploring the hierarchy by changing zoomed views.
The Conference Assistant: Combining Context-Awareness with Wearable Computing
Authors: Anind K. Dey, Daniel Salber, Gregory D. Abowd, Masayasu Futakawa
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

We describe the Conference Assistant, a prototype mobile, context-aware application that assists conference attendees. We discuss the strong relationship between context-awareness and wearable computing and apply this relationship in the Conference Assistant. The application uses a wide variety f context and enhances user interactions with both the environment and other users. We describe how the application is used and the context-aware architecture on which it is based.
Building a System Failure Rate Estimator by Identifying Component Failure Rates
Authors: Silke Kuball, John May, Gordon Hughes
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Following the current trend towards an increased use of Commercial Off The Shelf (COTS) components in safety critical systems, the need arises to address safety issues related to COTS--based systems. In this paper we introduce a hierarchical model to estimate the probability of failure on demand of a software system consisting of components.Thereby evidence available on the components' failure behaviour is combined using a Bayesian approach. An additive term is proposed to model the changes in the component prior reliability once a component is transferred from the operational environment assumed by the software developer into the actual operating environment. Statistical system test (SST) data are incorporated to calculate the estimator of the system failure rate. This approach involves prior knowledge at the level where it is most likely to be available: the component level.
Improving On-Line BIST-Based Diagnosis for Roving STARs
Authors: Miron Abramovici, Charles Stroud, Brandon Skaggs, John Emmert
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

We present improvements to our on-line BIST-based diagnosis technique originally used in the roving STARs approach [1]. The enhanced technique starts with a new method of analyzing the BIST results, and employs the original divide-and-conquer method as a second phase only when the first phase fails or it does not achieve maximum diagnostic resolution. The combined technique significantly reduces the diagnosis time, improves the resolution in several cases, and requires less fault-free resources.
XHTML Essentials
Authors: Michael Sauers, R. Allen Wyke
Venue:  (2002)

:With Web access becoming available through TV, handheld devices, and even phones, developers need to create sites that can be viewed from different environments, not just from the desktop. Introducing XHTML, the next generation HTML, this practical guide jumpstarts Web developers on the technology that ensures that their Web pages stay true-to-form on any available platform. Using extensive code and real-world examples, XML expert Michael Sauers teaches readers how to apply XHTML quickly and effectively without having to become XML programmers first. Readers will learn how to migrate legacy HTML documents to XHTML and create documents and applications for a variety of platforms. Like the other books in the series, an appendix listing will feature where to find updated information, a source code index, and other handy features.
Stack Package Implementing Tasks and Coroutines for TML Pascal on the Macintosh
Authors: Mark Sherman
Venue:  (1986)

This disk contains the necessary TML Pascal and MDS Assembler files for implementing tasking and coroutines in TML Pascal Programs. Two example programs and brief documentation are provided. MDS format disk.
Crear Paginas Web Para Dummies, 6 edition
Authors: Bud E. Smith, Arthur Bebak
Venue:  (2003)

:* What it is: There are a number of technologies and tasks that go into building Web pages - HTML coding, creating graphics, securing a URL/Web space, posting, etc. This book shows readers the simple way to handle all. * What's the market: Web page creation is one of the many technologies that used to be the property of professionals that has now simplified to the point most general Internet users can handle the task. Most ISPs, including AOL, MSN, and Earthlink, offer free Web space for users. * What's up with the upgrade: New versions of many popular Web design and graphics tools have become available since the last edition of the book. This update covers the latest tools.