ppxscal/embedding_network huggingface dataset:
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks
Authors: K. Futatsugi, A. Nakagawa
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

CAFE is the name of a network based environment now under development for supporting systematic creation, checking, verification, and maintenance of formal specifications. CAFE has an algebraic specification language called CafeOBJ as its main specification language, and adopts an algebraic specification paradigm as its foundation. CafeOBJ is a successor of the OBJ language, and has important new features for concurrency and behavioral specifications. Concurrency and behavior are specified based on rewriting logic and behavioral (hidden sorted) algebra respectively. These new features make it possible to provide powerful language constructs for formal object oriented specifications. CAFE is designed to be a network based environment. For sharing specification documents systematically over networks, a new document formatting language called Forsdonnet (FORmal Specification Document ON NETwork) is designed by extending HTML. Forsdonnet includes constructs for formal and informal specifications, commands for executing (prototyping) and cheeking/verifying CafeOBJ specifications, etc. Forsdonnet is designed to be based on already established standard network infrastructure components like HTML and Netscape Navigator. The paper gives an overview and design considerations of the CAFE environment, featuring mainly CafeOBJ and Forsdonnet languages.
An Improved CMOS BICS for On-Line Testing
Authors: Y. Maidon, Y. Deval, J. B. Begueret
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

Dedicated to a wide range of power supplies current monitoring, a new version of a CMOS built-in current sensor is proposed. It takes advantage of the classical parasitic resistor attached to an interconnection layer, as well as to a feedback circuit with high static gain capability. Analysis and simulation reveal that the transducer is accurate, linear and transparent. Process dependencies are taken into account. The sensor was designed in a 0.6µm technology and its simulated characteristics are reported in this paper.
Push-Pull Messaging: A High-Performance Communication Mechanism for Commodity SMP Clusters
Authors: Kwan-Po Wong, Cho-Li Wang
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Push-Pull Messaging is a novel messaging mechanism for high-speed Inter-process communication in a cluster of symmetric multi-processors (SMP) machines. This messaging mechanism exploits the parallelism in SMP nodes by allowing the execution of communication stages of a messaging event on different processors to achieve maximum performance. Push-Pull Messaging facilitates further improvement on communication performance by employing three optimizing techniques in our design: (1) Cross-Space Zero Buffer provides a unified buffer management mechanism to achieve a copy-less communication for the data transfer among processes within a SMP node. (2) Address Translation Overhead Masking removes the address translation overhead from the critical path in the inter-node communication. (3) Push-and-Acknowledge Overlapping overlaps the push and acknowledge phases to hide the acknowledge latency. Overall, Push-Pull Messaging effectively utilizes the system resources and improves the communication speed. It has been implemented to support high-speed communication for connecting quad Pentium Pro SMPs with 100Mbit/s Fast Ethernet.
TOAD Handbook, 1 edition
Authors: Bert Scalzo, Dan Hotka, Jim McDaniel
Venue:  (2003)

:The book shows how to debug and profile PL/SQL code, perform routine and non-routine DBA tasks, use TOAD for database reporting, and export or print table data. It also covers working with TOAD's SQL editors, Schema Browser, and numerous other windows and wizards. Every chapter includes dozens of lesser known TOAD features.
Modeling of Substrate Noise Injected by Digital Libraries
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Switching noise is one of the major sources of timing errors and functional hazards in logic circuits. It is caused by the cumulative effect of microscopic spurious currents arising in all devices during logic transitions. These currents are injected into the substrate and in supply lines, resulting in significant ripple noise. Individually, such micro-currents do not usually cause catastrophic failures. However, cumulatively, they can impact power supply and substrate potential across the chip. Thus, the electrical behavior of sensitive digital and analog circuits can be significantly changed, hence limiting circuit performance. The analysis of switching noise at a macroscopic level requires one to accurately compute models for all microscopic spurious currents, known as noise signatures. The challenge is to simultaneously account for a myriad of parameters and their process variations in a compact and accurate model. To address this problem, a new methodology based on Response Surface Methodology and Orthogonal Polynomials approximation is being proposed. Experimental results on a 0:35µm library show that the methodology is capable of accurately approximating noise signatures with a single analytical formula. A library of such formulae has been created and it is being used to accurately characterize switching noise at a macroscopic level.
A comparative assessment of some reengineering techniques
Authors: M. L. Wilson
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Generally it is no easy task to compare various tools and select the best for a given situation. Also, when only a single tool seems to exist which addresses a given issue, it is not always obvious that it will perform as expected. Several translation tools have been developed to translate code written in the CMS-2 programming language into Ada code. Some initial trials have been made with these tools in the past. Ongoing attempts to further characterize and evaluate these tools are described and some initial results of this effort date are presented. In addition some generalizations about tool evaluation, and some general lessons learned in the planning and execution of this effort are also presented. This is largely an experience report and describes work currently underway or planned for the near future, along with some preliminary results.
Extended group communication algorithm for updating distributed programs
Authors: H. Higaki
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Large-scale distributed systems are not always stable because the environments and the user requirements are changeable. The author has discussed the receptive platform to make distributed systems flexible and reliable. In order to achieve the receptive platform, it is essential to discuss how to update the distributed programs. Since conventional updating methods require that multiple processes be suspended simultaneously, the availability of the system becomes lower. A new method called the dynamic updating has been proposed. The key idea is that multiple versions of processes are allowed to co-exist temporarily while the old-version processes are not used anymore. If such protocol errors as the unspecified receptions and the dead-locks caused by the co-existence occurs, the suspended old-version processes are restarted from the consistent state. An algorithm, has been designed for treating the unspecified receptions. This paper proposes an extended group communication algorithm that can detect and resolve the deadlocks. By using the algorithm, the dynamic updating can be applied to more general distributed application programs.
Supplying High Availability with a Standard Network File System
Authors: Keith Marzullo, Frank B. Schmuck
Venue:  (1987)

This paper describes the design of a network file service that is tolerant to fail-stop failures and can be run on top of a standard network file service. The fault-tolerance is completely transparent, so the resulting file system can support the same set of heterogeneous workstations and applications as the chosen standard supports. To demonstrate that our design can provide the benefit of highly available files at a reasonable cost to the user, we implemented a prototype based on the Sun NFS protocol. Our approach is not limited to being used with NFS, however. The methodology we used should apply to any network file service built along the client-server model.
Efficient Regression Testing of Multi-Panel Systems
Authors: Clay Williams, Amit Paradkar
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Multi-panel systems are systems that interact with a user via multiple input panels. The flow through the panels is influenced by the interaction. Multi-panel systems are ubiquitous, and include panel-based legacy applications, automated teller machines, and web-based systems. Finding regression test suites which efficiently cover the functionality of these systems is difficult, because it requires covering interactions between input fields within a panel as well as flows between panels. Previous approaches to covering input field interactions include partitioning methods and combinatorial design methods. State machines and decision tables have been used to cover flow between panels. None of these techniques produce a conceptually simple, unified model that supports both intra- and inter-panel coverage. Our new method for capturing and representing test specifications provides such a model. This model is then used to generate a locally minimal set of test cases which completely covers the model. We applied this technique in a pilot study for regression testing, and this pilot had promising results which we discuss. We conclude by presenting our plans for generalizing the technique beyond multi-panel systems and regression testing.
The software maintenance project effort estimation model based on function points
Authors: Yunsik Ahn, Jungseok Suh, Seungryeol Kim, Hyunsoo Kim
Venue: Journal of Software Maintenance: Research and Practice (2003)

In this study, software maintenance size is discussed and the software maintenance project effort estimation model (SMPEEM) is proposed. The SMPEEM uses function points to calculate the volume of the maintenance function. Ten value adjustment factors (VAF) are considered and grouped into three categories of maintenance characteristics, that is the engineer's skill (people domain), its technical characteristics (product domain) and the maintenance environment (process domain). Finally, we suggest an exponential function model which can show the relationships among the maintenance efforts, maintenance environment factors, and function points of the software maintenance project. Regression analysis of some small maintenance projects demonstrates the significance of the SMPEEM model.
Como Programar Videojuegos En Windows
Authors: Antonio Ruiz Fernandez
Venue:  (2002)

:Programming video games can be easy. This how-to computer book with simple explanations and numerous examples teaches all the tools and necessary elements step-by step. It provides all the reference one needs to execute any and all special effects including sprites and floating space ships. Includes CD-ROMEste libro muestra como se programan los videojuegos en Windows por medio de sencillas explicaciones y numerosos ejemplos desarrollados paso a paso ira descubriendo los elementos y herramientas que componen un videojuego. Encontrara los listados fuente de los programas que podra ejecutar desde cualquier compilador de C/C++; desde crear un punto en la pantalla, pasando por los sprites, hasta la creacion y manejo de una nave espacial con el teclado."Antonio Ruíz is a computer programmer. 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
Pipelined Transmission Scheduling in All-Optical TDM/WDM Rings
Authors: Xijun Zhang, Chunming Qiao
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Two properties of optical transmissions, namely, unidirectional propagation and predictable propagation delay, make it possible to pipeline packet transmissions in all-optical networks. In this paper, we study the problem of scheduling All-to-All Personalized Communication (AAPC) in unidirectional TDM/WDM rings with pipelined transmissions, which can achieve a much higher bandwidth utilization than non-pipelined transmissions. For a given number of wavelengths, K, and number of transmitter-receiver pairs per node, T, the theoretical lower bound (TLB) on the schedule lengths is derived, and scheduling methods which can achieve near optimal results are proposed for three different cases, namely, T=K, 2
Network Calculus and Service Curve Scheduling in Heterogeneous Networks
Authors: Robert A. Malaney, Glynn Rogers
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

We describe a generalized framework for analyzing the delay and backlog bounds in lossless packet networks using the techniques of Network Calculus. We outline Network Calculus in terms of matrix operators acting on functions, and couple these operations with the concept of Service-Curve scheduling. We describe how this combined framework is used to determine delay bounds imposed on packets as they traverse example networks, and compare the results with standard FIFO and Virtual Clock scheduling algorithms. This comparison highlights the QoS advantages to be gained from the use of Network Calculus and Service-Curve scheduling.
Resilient Communication Structures for Local Area Networks
Authors: Amr El Abbadi, Thomas Rauchle
Venue:  (1984)

Reliable communication is crucial to the correct functioning of distributed systems. We propose a multi-ring communication structure and a reconfiguration algorithm that tolerate multiple link failures before the network divides into more than one partition. In case of partitioning, each partition is reconfigured to allow communication among the sites within the partition. The algorithm handles recovery of links and merges partitions once links become operational again. The algorithm itself is fault-tolerant, and it is fully distributed and does not require global knowledge about the status of the network at any one site.
Boosting a Simple Weak Learner For Classifying Handwritten Digits
Authors: Matthew P. Carter
Venue:  (1998)

A weak PAC learner is one which takes labeled training examples and produces a classifier which can label test examples more accurately than random guessing. A strong learner (also known as a PAC learner), on the other hand, is one which takes labeled training examples and produces a classifier which can label test examples arbitrarily accurately. Schapire has constructively proved that a strong PAC learner can be derived from a weak PAC learner. A performance boosting algorithm takes a set of training examples and a weak PAC learning algorithm and generates a strong PAC learner. Our research attempts to solve the problem of learning a multi-valued function and then boosting the performance of this learner. We implemented the AdaBoost.M2 boosting algorithm. We developed a problem-general weak learning algorithm, capable of running under AdaBoost.M2, for learning a multi-valued function of uniform length bit sequences. We applied our learning algorithms to the problem of classifying handwritten digits. For training and testing data, we used the MNIST dataset. Our experiments demonstrate the underlying weak learner''s ability to achieve a fairly low error rate on the testing data, as well as the boosting algorithm''s ability to reduce the error rate of the weak learner.
COREFDRAW: A Tool for Annotation and Visualization of Coreference Data
Authors: Sanda M. Harabagiu, Razvan C. Bunescu, Stefan Trausan-Matu
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

In Natural Language Processing, coreference resolution involves finding antecedents of referential expressions (e.g. pronouns or some definite nominals). The resolution of coreference depends on a combination of salience, syntactic, semantic and discourse constraints. The acquisition of such knowledge is difficult and could certainly benefit from a visualization tool, enabling the linguist researcher to find examples of coreference relations. Furthermore, an alternative knowledge-minimalist technique for resolving coreference can be developed by relying on text corpora an-notated with coreference data. In this paper we present COREFDRAW, a tool that enables both the annotation of coreference data and its visualization from large text corpora. The resulting annotations enable enhanced coreference resolution methods.
Percolation Scheduling: A Parallel Compilation Technique
Authors: Alexandru Nicolau
Venue:  (1985)

Percolation Scheduling (PS) is a new technique for compiling programs into parallel code. It attempts to overcome problems that limit the effectiveness and applicability of currently available techniques. PS globally rearranges code past basic block boundaries. Its core is a small set of simple, primitive program transformations defined in terms of adjacent nodes in a program graph. These transformations constitute the lowest level in a system of transformations and guidance rules. Higher levels of this hierarchy control and enhance the applicability of the core transformations and enable us to exploit both fine grained and coarse parallelism. Unlike other, more ad hoc approaches, PS is based on rigorous definitions of the computational model and of the core transformations. The correctness and termination of the transformations is proven here. The completeness of the transformations is also discussed. As a result our implementation, which is now underway, can proceed on a sound basis. In particular, PS enjoys greater adaptability and independence between the levels than would be possible otherwise. This paper describes PS in detail. The correctness aspects as well as illustrations of the effectiveness of our techniques are presented. Architectures which may benefit from the use of PS are also discussed.
Bandwidth-delay constrained routing algorithms
Authors: Yi Yang, Lei Zhang, Jogesh K. Muppala, Samuel T. Chanson
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The development of technologies like Multi-Protocol Label Switching (MPLS) and Differentiated Services has laid the foundation for Internet to support multimedia applications like Voice over IP. Although much work has been done on laying MPLS paths to optimize performance, most has focused on satisfying bandwidth requirements. Relatively little research has been done on laying paths with both bandwidth and delay constraints. In this paper, we present bandwidth-delay constrained routing algorithms that use knowledge of the ingress-egress node pairs in the network in reducing the rejection rates for setting up new paths. Simulation is used to evaluate the algorithms and compare their performance against some existing algorithms for bandwidth constraints that have been modified to handle delay constraints. The results show that the proposed algorithms outperform all others under a wide range of workload, topology and system parameters.
Linguistic Integration Information in the AABATAS Arabic Text Analysis System
Authors: Slim Kanoun, Adellatif Ennaji, Yves LeCourtier, Adel M. Alimi
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

An Arabic text analysis system called AABATAS (affixal approach-based Arabic text analysis system) is proposed. AABATAS recognizes and categorizes the words while identifying their morphological and grammatical characteristics. It is based on a new approach for Arabic word recognition called affixal approach. This affixal approach is guided by the structural properties of language. A dynamic decomposition-recognition mechanism is used in our system and leads to generate a set of reliable solutions for each word. This mechanism attempts to identify the word basic morphemes: the prefix, the infix, the suffix and the root contrary to the existing approaches that are usually based on the recognition of the whole word or the pseudo-word or the letter. In this paper, we briefly present the general characteristics of Arabic texts as wellas a succinct survey of the existing approaches used for their recognition. We then describe the structural properties of the Arabic language and the two systems based on these last properties. The first one concerns a word recognition process and the second is devoted totext analysis. We finally show two experimental results; one on a data set of 545 words and another on a text example.
Agent-based approach for information gathering on highly distributed and heterogeneous environment
Authors: R. Okada, Eun-Seok Lee, N. Shiratori
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

The core of the problem of Information Gathering is how to generate a concise, high-quality response to the information needs of a user. However, this task is becoming difficult due to the explosion in the amount of electronic information. Agent-based solutions have become an popular approach for locating information in an growing distributed heterogeneous environment like Internet. We first survey the existing non-agent and partially agent-based solutions; then to overcome their drawbacks we propose a completely agent-based solutions, when the different types of agents introduced-named user agent, machine agent, manager-cooperate to decrease user load and gain efficiency in the retrieval process.
Identifying salient learning experiences: a scenario-based method enabling industry-university partnerships in IT
Authors: Nicola J. Bidwell, Mia B. O'Brien, Simon M. Kaplan
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

A generalisable method to inform the design of learning experiences responsive to, and empathetically located within, relevant contexts is described. The purpose of the method's preliminary implementation was to design a postgraduate program for mid-career IT professionals which acknowledges the inherently situated nature of knowledge, skills and behaviours and authentically reflects the field of IT practice. The method frames its activities by creating scenarios and exploring a company's responses to challenges within it. The scenario-based framework is conceptualised as a four stage progression which begins with a company creating a brief description of its own business context and specific situations that arise in it. The second stage draws upon a more extensive range of perspectives to discover alternative responses to challenges in the scenario and articulate some of the values that influence these responses. The third stage identifies the professional understandings required for each response and potential learning goals and indicators of attainment for these. The final stage enables one-to-one or one-to-many mapping of professional understandings to learning goals and attainment-indicators across the set of responses. The scenario-based method proved to be an effective tool for identifying and articulating industry-situated gaps in the understandings of mid-career IT professionals. The educational bridges required to foster better involvement of technological expertise in the evolution and execution of business decisions became more apparent to curriculum designers by immersion in the company's responses to the genuine challenges it faces.