ppxscal/embedding_network huggingface dataset:
A pretty-printer for every occasion
Authors: M. Jonge
Venue:  (2001)

Tool builders dealing with many different languages, and language designers require sophisticated pretty-print techniques to minimize the time needed for constructing and adapting pretty-printers. We combined new and existing pretty-print techniques in a generic pretty-printer that satisfies modern pretty-print requirements. Its features include language independence, customization, and incremental pretty-printer generation. Furthermore, we emphasize that the recent acceptance of {\sc xml} as international standard for the representation of structured data demands flexible pretty-print techniques, and we demonstrate that our pretty-printer provides such technology.
Reduction of Adjusting Weights Space Dimension in Feedforward Artificial Neural Networks Training
Authors: Sam L. Blyumin, Paul V. Saraev
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This report provides an approach to reduction of adjusting weights space dimension in two-layer multioutput feedforward artificial neural networks training. Our approach is based on linear-nonlinear network structure with respect to weights. Two training algorithms based on the Newton and Gauss method with pseudo-inversion for optimization were deduced. Trainingalgorithms are extended to multilayer networks. The report carries the information about the analysis of proposing training algorithms. Results of numerical experiments are also included.
Using Games for Benchmarking and Representing the Complete Solution Space using Symbolic Techniques
Authors: Görschwin Fey, Sebastian Kinder, Rolf Drechsler
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Games often are inherently multi-valued problems andtheir wide variety offers different graduations of complexity.Moreover a lot of games have a parameter, like boardsizethat allows to generate differently sized instances of thesame problem. All this makes them perfectly suitable forbenchmarking in the multi-valued domain. So far the lack ofbenchmarks in this area often was compensated by transferringproblems from binary to multi-valued, but for severalapplication domains this is not adequate.This paper focuses on three games, that we consider suitablefor benchmarking. We show the differences in complexityof the games and compare two coding schemes for oneof them. All three problems are modeled by symbolic techniques,namely decision diagrams, leading to a completerepresentation of the solution space. This representationfinds several applications, e.g. in objectively analyzing theefficiency of different heuristics on a solution space or tospeed up learning algorithms.
On the use of Asynchrony in achieving Extensibility and High Performance in an object Storage System
Authors: David E. Langworthy
Venue:  (1995)

An object store provides persistence for an object-oriented database or a special-purpose application such as CAD or hypermedia. In this thesis we examine the architecture of an object store in light of the following developments: the cost of network latency is increasing rapidly in relation to other I/O costs, users demand increased availability without the added cost of redundancy, and new application domains require specialized secondary search structures for high performance. We determined that these problems could not be solved within any existing object store architecture: solving all of them required fundamental changes in the design of the object store. We present a novel architecture which takes advantage of asynchrony to alleviate latency problems, increase availability, and enable extensibility. We analyze the performance of our prototype to demonstrate the feasibility of such an approach. Our asynchronous cache-coherency protocol in combination with client disk caching greatly reduces the cost of network latency. However, without the correct invalidation protocol, an unacceptable number of aborts results. We experimentally evaluate several invalidation protocols and introduce a new protocol that provides both low network overhead and fewer aborts. We introduce a recovery algorithm that improves on the popular and efficient write-ahead logging. No-undo, no-redo write-ahead logging requires no updates to the database partition during recovery, reducing recovery to a single analysis scan of the log. The redos are applied on demand as the objects are read or asynchronously after recovery. Our novel architecture allows new secondary storage structures to extend the client interface. The new structure is encapsulated in a storage class. The storage class abstraction integrates the new structure with transaction management to provide semantically consistent atomic transactions.
A Theory of Temporal-Spatial Flow Control: The Case of Single Bottleneck Link
Authors: Jordi Ros, Wei K. Tsai
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

This paper presents a theory of Spatial-Temporal Flow Control, the case of single bottleneck link, for a network with dynamic available bandwidth. For this class of flow control, when the sources receive the feedback from the network, they schedule their rates considering both the amount of available resources as well as a timely allocation of these resources. With the theory developed in this paper, a protocol which ensures maximal utilization of the bandwidth, minimal queue size in the link and fairness among the sources is proposed. With this protocol, the sources estimate the amount of congestion they are producing at the bottleneck and the queue size at the bottleneck can be remotely controlled.
A Programmer's Guide to Java Certification, 2 edition
Authors: Khalid Azim Mughal, Rolf Rasmussen
Venue:  (2003)

To pass the Sun Certified Programmer for Java 2 Platform 1.4 exam (SCPJ2 1.4) you need this book. It is written for any experienced programmer (with or without previous knowledge of Java) interested in mastering the Java programming language and passing the SCPJ2 1.4 exam.A Programmer's Guide to Java™ Certification, Second Edition, contains detailed coverage of all exam topics and objectives, helpful code examples, exercises, review questions, and several full practice exams. In addition, as a comprehensive primer to the Java programming language, this book is an invaluable reference tool for the reader.This new edition has been thoroughly updated to focus on the latest version of the exam (CX-310-035). In particular, it contains more in-depth explanations of the syntax and usage of core language features that are now emphasized on the exam. The accompanying CD contains a version of the SCPJ2 1.4 Exam Simulator developed by Whizlabs Software, which includes several mock exams and simulates the exam-taking experience. The CD also contains the complete source code for all the examples, and solutions to the programming exercises.What you will find in this book: Extensive coverage of all the objectives defined for the Sun Certified Programmer for Java 2 Platform 1.4 exam Easy-to-follow structure with chapters organized according to the exam objectives as laid out by Sun Microsystems Summaries that clearly state and differentiate the exam objectives and the supplementary objectives to be covered in each chapter A list of Sun's objectives for the SCPJ2 1.4 exam, and a guide to taking the exam A complete mock exam with new questions (not repeats of review questions) A CD that includes several mock exams and a version of the SCJP 1.4 Exam Simulator by Whizlabs Software, which simulates the exam-taking experience Numerous exam-relevant review questions to test your understanding of each major topic, with annotated answers Programming exercises and solutions at the end of each chapter Copious code examples illustrating concepts where the code has been compiled and thoroughly tested on multiple platforms Program output demonstrating expected results from running the examples Extensive use of UML (Unified Modeling Language) for illustration purposes An introduction to basic terminology and concepts in object-oriented programming Advice on how to avoid common pitfalls in mastering the language and taking the exam Platform-independent coverage--platform-specific details are provided where relevant Information about the SCPJ2 Upgrade exam 0201728281B07152003
On the Effect of Link Failures in Fibre Channel Storage Area Networks
Authors: X. Molero, F. Silla, V. Santonja, J. Duato
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

The fast growth of data intensive applications has caused a change in the traditional storage model. The server-to-disk approach is being replaced by storage area net-works (SANs), which enable storage to be externalized from servers, thus allowing storage devices to be shared among multiple servers. The prominent technology for implementing SANs is Fibre Channel, due to its suitability for storage networking.Although the probability of a link failure for individual links in a SAN is very low, this probability dramatically increases as the network size becomes larger. Moreover, there are external factors, such as accidental link disconnections, that also can affect the overall SAN reliability, Until the faulty element is replaced, the SAN is functioning in a degraded mode.In this paper we analyze by simulation the performance degradation of Fibre Channel storage area networks when failures in links occur, quantifying how much the global SAN performance is reduced during the time the system remains in the degraded state. We perform this analysis by using both synthetic and real I/0 traffic. Simulation results show that performance degradation mainly depends on the routing algorithm and the switch architecture used.
Recovering Sequential Circuits from Temporary Faults: The Survival Capability of Scan-Cells
Authors: Jose Miguel Vieira dos Santos
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

The recovery technique introduced in this paper can be implemented in new designs and may allow sequential circuits to recover from many temporary faults. It is assumed that errors will be detected by other means. The memory elements of the mission circuit are implemented with standard, slightly enhanced, scan-cells that work as stand-alone, needing no external control or support.
Passive testing and applications to network management
Authors: D. Lee, A. N. Netravali, K. K. Sabnani, B. Sugla, A. John
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

An important aspect of network management is fault management-determining, locating, isolating and correcting faults in the network. The paper deals with the algorithms for detecting faults, i.e., behavior of the network different from specifications. It is important for communication networks to detect faults "in-process" i.e., while the network is in its normal operation. Thus, we detect faults by examining the input-output behavior without forcing the system to specialized inputs explicitly for testing. Such testing is commonly called passive testing. We model the network as a finite state machine and develop procedures for passive testing including the required data structure, efficient implementations and the complexity of our procedures. We start with fully observable and deterministic machines and then study more realistic models: partially observable and nondeterministic machines. We also discuss extensions to communicating finite state machines and machines extended with parameters and variables. We apply our techniques to management of a signaling network operating under the Signaling System 7 (SS7) and report experimental results, which show the feasibility of applying passive testing to practical systems.
Shadow Puppetry
Authors: Matthew Brand
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

The mapping between 3D body poses and 2D shadows is fundamentally many-to-many and defeats regression methods, even with windowed context. We show how to learn a function between paths in the two systems, resolving ambiguities by integrating information over the entire length of a sequence.The basis of this function is a configurable and dynamical manifold that summarizes the target system's behavior. This manifold can be modeled from data with a hidden Markov model having special topological properties that we obtain via entropy minimization. Inference is then a matter of solving for the geodesic on the manifold that best explains the evidence in the cue sequence. We give a closed-form maximum a posteriori solution for geodesics through the learned density space, thereby obtaining optimal paths over the dynamical manifold.These methods give a completely general way to perform inference over time-series; in vision they support analysis, recognition, classification and synthesis of behaviors in linear time. We demonstrate with a prototype that infers 3D from monocular monochromatic sequences (e.g., back-subtractions), without using any articulatory body model. The framework readily accommodates multiple cameras and other sources of evidence such as optical flow or feature tracking.
Backup Group Multiplexing: An Integrated Restoration Strategy for IP over WDM Optical Networks
Authors: Dong Zhou, Ten-Hwang Lai
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper proposes a novel restoration strategy called "Backup Group Multiplexing" for fast restoration in IP over optical networks. It groups optical nodes by connecting them using switched multi-fiber 10-Gigabit Ethernet rings. It uses MPLS as the base technology to implement an integrated two-layer path-restoration scheme. It solves the problem of "failure propagation" by coordinating the backup path selection. It also takes advantage of the labelstacking capability of MPLS to groom IP flows to minimize the number of backup lightpaths. MPLS signaling protocols are applied across the IP layer and the optical layer in a coordinated manner. Our integrated scheme overcomes the shortcomings of uncoordinated protocols such as fail-over racing and double booking of backup bandwidth. The proposed solution is bandwidth efficient and cost effective.
On the Effectiveness of a Message-Driven Confidence-Driven Protocol for Guarded Software Upgrading
Authors: Ann T. Tai, Kam S. Tso, Leon Alkalai, Savio N. Chau, William H. Sanders
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

In order to accomplish dependable onboard evolution, we develop a methodology, which is called "guarded software upgrading" (GSU). The core of the methodology is a low-cost error containment and recovery protocol that escorts an upgraded software component through onboard validation and guarded operation, safeguarding mission functions. The message-driven confidence-driven (MDCD) nature of the protocol eliminates the need for costly process coordination or atomic action, yet guarantees that the system will reach a consistent global state upon the completion of the rollback or roll-forward actions carried out by individual processes during error recovery.To validate the ability of the MDCD protocol to enhance system reliability when a software component undergoes onboard upgrading in a realistic, non-ideal environment, we conduct a stochastic activity network model based analysis. The results confirm the effectiveness of the protocol as originally surmised. Moreover, the model-based analysis provides useful insight about the system behavior resulting from the use of the protocol under various conditions in its execution environment, facilitating effective use of the protocol.
The Design and Simulation of a Hybrid Replication Control Protocol
Authors: Wanlei Zhou, Robert Holmes
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Replica control protocols in distributed database systems are responsible for the management and maintenance of replicated (redundant) data. Maintaining replicated data improves performance and increases availability. Keeping the replicated data consistent and available during the presence of failures can however become quite difficult. This paper presents the design of a hybrid replica control protocol that attempts to maximise availability and minimise communication overhead, by combining the advantages of two common replica control protocols into one. The protocol was simulated using SimJava, a process-based discrete event simulation package. The results from the simulations showed that not only did the hybrid algorithm maintain a high level of availability, it did so while minimising communication overheads.
Minimizing communication cost in a distributed Bayesian network using a decentralized MDP
Authors: Jiaying Shen, Victor Lesser, Norman Carver
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a two layer Bayesian Network. Instead of merely providing a statistical view, we propose a satisficing approach to predict the minimum expected communication needed to reach a desired solution quality. The problem is modelled with a decentralized MDP, and two approximate algorithms are developed to find the near optimal communication strategy for a given problem structure and a required solution quality.
An Iterative Substructuring Method with Nonconforming Elements
Authors: Jin Gu, Zian Hu
Venue:  (1995)

When the red-black subdivisions are satisfied, an iterative substructuring methods proposed to solve the algebraic system of equations arising from the discretization of symmetric elliptic problems via nonconforming finite elements which are only continuous at the quasi-uniform mesh nodes. Theoretical analysis is given and the results of numerical experiments are reported.
Introduction to the user requirements notation: learning by example
Authors: Daniel Amyot
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Recognizing the need for a notation that would be used in the very first and often informal stages of the development cycle, the International Telecommunication Union (ITU-T) initiated a question on a User Requirements Notation (URN), which will be standardized as the Z.150 series of Recommendations. URN supports the development, description, and analysis of requirements for telecommunications systems and services, as well as for other types of complex reactive, distributed, and dynamic systems. Through a wireless telephony example, this paper gives an overview of the core elements and typical usage of the two complementary notations comprised in URN. The Goal-oriented Requirement Language (GRL) is used to describe business goals, non-functional requirements, alternatives, and rationales, whereas Use Case Map (UCM) enables the description of functional requirements as causal scenarios. This paper also briefly explores methodology elements and the complementarity between URN and the existing ITU-T languages.
Architecture and Compiler Co-Optimization for High Performance Computing
Authors: Hiroshi Nakamura, Masaaki Kondo, Taku Ohneda, Motonobu Fujita, Shigeru Chiba, Mitsuhisa Sato, Taisuke Boku
Venue: Proceedings of the International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'02) (2002)

The performance gap etween processor and memory is very serious problem in high-performance computing because effective performance is limited by memory ability. In order to overcome this problem, it is indispensable to make good use of wide on-chip memory bandwidth. For this purpose, architecture and compiler co-optimization is a promising approach because most of data access is regular and/or predictable in high-performance computing.Thus, we propose a new VLSI architecture called SCIMA as a platform of the co-optimization. SCIMA integrates software controllable memory (SCM) into a processor chip in addition to ordinary data cache. SCM and cache can be reconfigured by software during computation. Hence, memory hierarchy itself is the target of compiler optimization. In this sense, architecture and compiler co-optimization is realized in SCIMA.Towards the co-optimization, we have developed a directive-based compiler and an algorithm of SCM usage to insert directives automatically. In this paper, we present the directives and the outline of the algorithm for automatic optimization.
An Algorithm for On-Line Strokes Verification of Chinese Characters Using Discrete Features
Authors: Chwee Keng Tan
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Existing Chinese educational software tools teach the students at the primary or kindergarten levels the stroke movements and the stroke order of each Chinese character by animating the individual strokes of the whole character, one stroke at a time. In this paper the author will present an algorithm which allows the student to handwrite a specified character on-line through the computer, and which checks if the individual stroke movements and the strokes' order are correct. The algorithm proposed here uses low-integer-valuedcoding to represent two categories of features -primitive-stroke features and character features. The proposed algorithm is capable of identifying the typical errors as incorrect movement for the primitivestroke, incorrect stroke type, incorrect relative lengths, incorrect position of a stroke from the rest, incorrect character which looks similar in appearance, incorrect order of strokes and insufficient or extra strokes.
Visible Volume: A Robust Measure for Protein Structure Characterization
Authors: Loredana LoConte, Temple F. Smith
Venue:  (1997)

Abstract We propose a new characterization of protein structure based on the natural tetrahedral geometry of the beta carbon and a new geometric measure of structural similarity, called visible volume. In our model, the side-chains are replaced by an ideal tetrahedron, the orientation of which is fixed with respect to the backbone and corresponds to the preferred rotamer directions. Visible volume is a measure of the non-occluded empty space surrounding each residue position after the side-chains have been removed. It is a robust, parameter-free, locally-computed quantity that accounts for all spatial constraints that are of relevance to the corresponding position in the native structure. When computing visible volume, we ignore the nature of both the residue observed at each site and the ones surrounding it. We focus instead on the space that, together, these residues could occupy. By doing so, we are able to quantify a new kind of invariance beyond the apparent variations in a protein family, namely, the conservation of the physical space that is available at structurally equivalent positions for 3-D side-chain packing. Visible volume has the unique property of estimating how much space can be used at each site for different combinations of side-chains to fit in. This property, and the relation of visible volume to the degree of exposure of a residue position, qualify it as a powerful tool in a variety of applications, from the detailed analysis of protein structure to the definition of better scoring functions for threading purpose.