ppxscal/embedding_network huggingface dataset:
Hybrid Adaptation: Integration of Adaptive Classification with Adaptive Context Processing
Authors: Naomi Iwayama, Katsuhiko Akiyama, Kazushi Ishigaki
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We propose a new method of adaptation in on-line handwriting character recognition. The method, called "hybrid adaptation," integrates adaptive classification with adaptive context processing. Hybrid adaptation includes a mechanism that minimizes the negative effects of adaptation that might be caused by the integratoin. On-line handwriting character recognition software with hybrid adaptation can be loaded on terminals having low memory capacity since our implementation of both adaptive classification and adaptive context processing does not require much memory. In our experiments, under the condition that all input strings have been input previously, the first-hit rate of hybrid adaptation was 99.0%, while that of non-adaptation was 93.3%, that of adaptive classification was 95.3% and that of adaptive context processing was 97.9%. In addition, we confirmed that hybrid adaptation enhanced the level of usersatisfaction of the individual user.
An Accurate Short-Time Green Function for Diffusion Monte Carlo
Authors: Cyrus J. Umrigar, K. J. Runge, M. P. Nightingale
Venue:  (1991)

Modifications are proposed to reduce the time-step error of the diffusion Monte Carlo algorithm. Within the fixed-node approximation, we address two sources of time-step errors: (1) the failure of the standard algorithm to deal accurately with important features of the wavefunction, viz. the cusps at the nucleus and the nodes; and (2) its failure to sample the exact probability distribution even in the ideal limit that the groundstate wavefunction is known exactly. The large time steps made possible by the proposed improvements yield and an algorithm considerably more efficient than domain Green function Monte Carlo as commonly used. The proposed algorithm used in conjunction with a good wavefunction yields an exceedingly accurate energy for Be.
Towards a formal model of hardware synthesized from Verilog
Authors: M. Arnold, A. Wallace, J. Cupal, J. Cowles, F. Engineer
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

Formal verification offers a way to prevent costly design errors that are impractical to detect with simulation alone. Successful formal verification of hardware requires using automated theorem provers. Optimal synthesis requires providing high level (behavioral) Verilog to commercial synthesis tools, such as PLDesigner and Synopsys. The paper presents a novel approach, known as the volley technique, that allows a design to be coded in an analogous way both in Verilog HDL and in the LISP like syntax of the Boyer Moore theorem (R.S. Boyer and J.S. Moore, 1988). To illustrate the technique, a simple machine that computes Fibbonaci numbers is designed in Verilog and fabricated as an AMD MACH 210 CPLD.
Efficient Compilation of Array Statements for Private Memory Multicomputers
Authors: James M. Stichnoth
Venue:  (1993)

One of the core constructs of High Performance Fortran (HPF) is the array-slice assignment statement, combined with the rich choice of data distribution options available to the programmer. On a private memory multicomputer, the HPF compiler writer faces the difficult task of automatically generating the necessary communication for assignment statements involving arrays with arbitrary block-cyclic data distributions. In this paper we present a framework for representing array slices and block-cyclic distributions, and we derive efficient algorithms for sending and receiving the necessary data for array-slice assignment statements. The algorithms include a memory-efficient method of managing the layout of the distributed arrays in each processor''s local memory. We also provide a means of converting the user''s TEMPLATE, ALIGN, and DISTRIBUTE statements into a convenient ''array ownership descriptor''. In addition, we present several optimizations for common distributions and easily-recognized communication patterns. The work presented makes minimal assumptions regarding the processor architecture, the communication architecture, or the underlying language being compiled.
Input/Output considerations in look-ahead processing
Authors: William M. Conner, Edward R. Dirling
Venue: ACM SIGARCH Computer Architecture News (1977)

The problems associated with input/output instructions in a look-ahead processing environment are discussed. The results of an empirical study which shows the detrimental effects of such instructions on the performance of a look-ahead central processor are presented.
A Method for Deriving Systolic Algorithms
Authors: A R Wagner, D M Landis
Venue:  (1992)

We can solve several problems, in particular the recognition of strings in context free grammars in Chomsky Normal Form, using dynamic programming methods in ${\rm O(n^3)}$ sequential time. Partial methods exist for mapping these algorithms onto systolic arrays that run in ${\rm O(2n)}$ time, similar to Kosaraju''s implementation of CNF recognition. These methods only accomplish a portion of the mapping; they involve pipelining steps that can require considerable insight and have a critical effect on the speed and complexity of the resulting algorithm. We present an alternative method for the derivation of a systolic implementation of these problems. We represent the algorithms as directed acyclic graphs (DAGs), where nodes represent specific computations and arcs indicate dependencies between these computations. The original DAG for an algorithm may have nodes of unlimited in-degree and out-degree, and thus captures all inherent parallelism in the algorithm. Then, we schedule the DAG by imposing two constraints: the maximum number of copies of any one operand that can exist at one time and the maximum number of operands that any one computation can accept in one timestep. By varying these constraints, we can derive a family of schedules of the computation. We then map these schedules into recurrence equations which represent systolic implementations that run at various speeds on different architectures. We derive a CNF-recognition implementation that runs in $n$ communication steps, roughly twice as fast as Kosaraju''s implementation $(2n -2)$.
Combinatorial Design of Tolerant Communicaiton Structures, with Applications to Non-Blocking Switches
Authors: David L Schweizer
Venue:  (1991)

This thesis is an investigation into structures and strategies for fault-tolerant communication. We assume the existence of some set of nodes -- people, telephones, processors -- with a need to pass messages -- telephone calls, signals on a wire, data packet-- amongstthemselves. In Part I, our goal is to create a structure, that is, a pattern of interconnection, in which a designated source node can broadcast a message to (and through) a group of recipient nodes. We seek a structure in which every node has tightly limited fanout, but which is nonetheless able to function reliably even when challenged with significant numbers of node failures. The structures are described only in terms of their connectivity, and we therefore use the language of graph theory. Part 11 is based on the observation that certain transformations of the graphs in Part I produce graphs that look like previously studied structures called nonblocking switches. We show that these transformations, when applied to other graphs, yield new, easier approaches to, and proofs of, some known theorems. Part III is an independent body of work describing some investigations into possible extensions of the theory of Kolmogorov-Chaitin complexity into the foundations of pattern recognition. We prove the existence of an information theoretic metric on strings in which the distance between two strings is a measure of the amount of specification required for a universal computer to interconvert the strings. We also prove two topological theorems about this metric.
A new cluster algorithm for graphs
Authors: Stijn Dongen
Venue:  (1998)

A new cluster algorithm for graphs called the \emph{Markov Cluster algorithm} ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a canonical way with a Markov graph $G_1$. Flow is then alternatingly expanded and contracted, leading to a row of Markov Graphs $G_{(i)}$. The expansion step is done by computing higher step transition probabilities ($TP$''s), the contraction step creates a new Markov graph by favouring high $TP$''s and demoting low $TP$''s in a specific way. The heuristic underlying this approach is the expectation that flow between dense regions which are sparsely connected will evaporate. The stable limits of the process are easily derived and in practice the algorithm converges very fast to such a limit, the structure of which has a generic interpretation as an overlapping clustering of the graph~$G$. Overlap is limited to cases where the input graph has a symmetric structure inducing it. The contraction and expansion parameters of the algorithm influence the granularity of the output. The algorithm is space and time efficient with a space$+$quality/time trade--off, works very well for a wide range of test cases, and lends itself to drastic scaling. Experiments with a scaled $C$--implementation have been conducted on graphs having several tens of thousands of nodes. This report describes the algorithm, its complexity, and experimental results. The algorithm is introduced by first considering a generalization of generic single link clustering for graphs called $k$--path clustering.
Combining Stabilized Finite Element Methods
Authors: Frederic G. C. Valentin, Leopoldo P. Franca
Venue:  (1995)

We combine the Galerkin-least-squares (GLS) and the Galerkin-gradient-least-squares (GGLS) methods to simulate scalar linear second order partial differential equations which include second, first and zero order terms. Assuming a strictly positive coefficient for the second order term, the resulting method is proven convergent for a wide range of the coefficients multiplying each term. The stability parameters are designed to take into account the presence of both modifications to the Galerkin method. Numerical results atest the good stability characteristics of the method.
Systems maintenance and development methodologies
Authors: M. Bailey, R. J. Whiddett
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Summary form only given, as follows. Systems maintenance consumes a major proportion of the resources of information systems departments in most organisations. It is often argued that these resource requirements can be reduced by the adoption of particular technologies or methodologies, such as structured analysis or more recently object oriented technologies. The paper reviews these claims by examining some of the more basic issues of systems maintenance such as: (1) the basic definition of maintenance and the various types that can be identified; (2) the methods required for the effective management of maintenance; (3) design issues that favour maintainability; and (4) issues of measurement. Consideration of these issues leads to the conclusion that the most significant impact on systems maintenance costs are more likely to be derived from general improvements in the management tools rather than in the technical tools. Some progress towards evaluating these issues is then discussed.
The 2-SAT Problem of Regular Signed CNF Formulas
Authors: Bernhard Beckert, Reiner Hähnle, Felip Manyà
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the form S: p, where p is a classical atom and S, its sign, is a subset of a domain N. The informal meaning is ¿p takes one of the values in S¿.Applications for deduction in signed logics derive from those of annotated logic programming (e.g., mediated deductive databases), constraint programming (e.g., scheduling), and many-valued logics (e.g., natural language processing). The central role of signed CNF justifies a detailed study of its subclasses, including algorithms for and complexities of associated SAT problems. In this paper we present new results on the complexity of the signed 2-SAT problem; i.e., the case in which all clauses of a signed CNF formula have at most two literals.
Biomorphic Analog Devices based on Reaction-Diffusion Systems
Authors: Tetsuya ASAI, Yoshihito AMEMIYA
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

In this paper, we introduce new analog devices that emulatenatural chemical systems, called the reaction-diffusion(RD) system. The RD system gives us a lot of clues andinsights into developing new architectures based on a newparadigm in computing. We exhibit hardware RD devicesand their typical operation, including the production oftravelling and spiral waves in two-dimensional RD devices.
E-Support: How Cisco Systems Saves Millions While Improving Customer Support
Authors: Andrew Connan, Vince Russell
Venue:  (2002)

:Learn how the eSupport system at Cisco works and can help an organization save money Learn how Cisco created its eSupport strategy from the team that implemented it Learn how your company can save through eSupport Understand the internetworking issues crucial to implementing an eSupport system Gain advice on how to keep your eSupport system current The eSupport system at Cisco Systems offers a web-based self-service approach to providing answers and tips for customers. It benefits the customer by saving them time from not waiting on hold for phone-based technical support, and it helps support organizations scale to handle more customers per support resource. Each year eSupport at Cisco helps 500,000 customers, and that reduces Cisco's costs by millions. eSupport: How Cisco Systems Saves Millions While Improving Customer Support offers what Cisco has learned on its way to making a successful eSupport system, showing what eSupport is and how it can help a business; how to develop and implement an eSupport strategy; and finally providing advice on how to evolve an eSupport strategy. The knowledge and benefits gained from this book come from interviews with the Cisco Systems personnel who helped conceive, plan, and implement Cisco's eSupport strategy. These interviews provide an unparalleled view into the process by which Cisco developed its eSupport system.
Theoretical Studies of Inorganic and Organometallic Reaction Mechanisms. 4. The oxidative Addition of Dihydrogen to d8 Square-Planar Iridium Complexes with Trans Phosphines
Authors: Andrew L. Sargent, Michael B. Hall
Venue:  (1991)

The oxidative addition of H2 to Vaska-type complexes, transIrX(CO)(PR3)2, are investigated with ab initio quantum chemical calculations. The direction of addition in these complexes is controlled by how the ligands in the plane od addition react to a close encounter with concentrations of charge density around the metal center as the complex evolves from a four-coordinate to a six-coordinate species. Strong electron donating ligands destabilize the five-coordinate transition state while electron withdrawing ligands stabilize the transition state. When X is a weak electron donor ligand such as Cl-, H2 adds in the Cl-Ir-Co plane. When X=Hor Ph-, however, H2 adds in the PR3-IR-PR3 plane; the destabilizing influence of these strong electron donating ligands on the transition state outweigh those of the PR3 ligands. The electronic contribution to the relative stabilities of the six-coordinate final products can be predicted based on the relative orientations of the strongest trans-influence ligands. The isomers in which these ligands are facial are lower in energy than those in which they are meridional.
On Learning Counting Functions With Queries
Authors: Zhixiang Chen, Steven Homer
Venue:  (1994)

Abstract We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number $p$, the class of disjunctions of integer-weighted counting functions with modulus $p$ over the domain $Z^{n}_{q}$ (or $Z^{n}$) for any given integer $q \ge 2$ is polynomial time learnable using at most $n+1$ equivalence queries, where the hypotheses issued by the learner are disjunctions of at most $n$ counting functions with weights from $Z_{p}$. The result is obtained through learning linear systems over an arbitrary field. In general a counting function may have a composite modulus. We prove that, for any given integer $q \ge 2$, over the domain $Z_{2}^{n}$, the class of read-once disjunctions of Boolean-weighted counting functions with modulus $q$ is polynomial time learnable with only one equivalence query, and the class of disjunctions of $\log \log n$ Boolean-weighted counting functions with modulus $q$ is polynomial time learnable.tions, which are general cases Finally, we present an algorithm for learning graph-based counting functions.ies.
Power and Performance Fitting in Nanometer Design
Authors: Toshinori Sato, Takenori Koushiro, Akihiro Chiyonobu, Itsujiro Arita
Venue: Proceedings of the International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'02) (2002)

Power consumption is becoming one of the most important constraints for microprocessor design in nanometer-scale technologies. Device engineers, circuit designers, and system architects are faced with many challenges. In the area of mobile and embedded computer platforms, power has already been a major design constraint. However, it is also a limiting factor in general-purpose microprocessors. In order to manage the impact of increasing microprocessor power consumption, some architectural-Ievel techniques are required as well as circuit-Ievel design improvements. This paper proposes criticality-based instruction scheduling and Contrail processor architecture, which utilize the criticality of instructions, anddemonstrates their effectiveness.
Axiomatic Proof Techniques for Parallel Programs
Authors: Susan S. Owicki
Venue:  (1975)

This thesis presents an axiomatic method for proving certain correctness properties of parallel programs. Axioms and inference rules for partial correctness are given for two parallel programming languages: The General Parallel Language and the Restricted Parallel Language. The General Language is flexible enough to represent most standard synchronizers (e.g. semaphores, events), so that programs using these synchronizers may be verified using the GPL deductive system. However, proofs for GPL programs are in general quite complex. The Restricted Language reduces this complexity by requiring shared variables to be protected by critical sections, so that only one process at a time has access to them. This discipline does not significantly reduce the power of the language, and it greatly simplifies the process of program verification. Although the axioms and inference rules are primarily intended for proofs of partial correctness, there are a number of other important properties of parallel programs. We give some practical techniques which use information obtained from a partial correctness proof to derive other correctness properties, including program termination, mutual exclusion, and freedom from deadlock. A number of examples of such proofs are given. Finally, the axioms and inference rules are shown to be consistent and complete (in a special sense) with respect to an interpretive model of parallel execution. Thus the deductive system gives an accurate description of program execution and is powerful enough to yield a proof of any true partial correctness formula.
One Approach to Analog System Design Problem Formulation
Authors: Alexander Zemliak
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

The formulation of the process of analog system design has been done on the basis of the control theory application. This approach generalizes the design process and produces many different design trajectories inside the same optimization procedure. The problem of the optimal design algorithm construction is defined as the minimal-time problem of the control theory. This idea was tested with different optimization procedures. Numerical results of some simple electronic circuit design demonstrate the efficiency of the proposed approach. These examples show that the traditional design strategy is not time-optimal and the computer time gain of the optimal design strategy with respect to the traditional design strategy increases when the size and complexity of the system increase.
Managing IP Networks: Challenges and Opportunities
Authors: Salah Aidarous, Paul Levine, Thomas Plevyak, Javier Aracil, Burkhard Stiller
Venue:  (2003)

:An essential resource on the future of IP networksEveryone agrees that Internet Protocol (IP) has played and will play a major role in the evolution of networks and services. The exact nature and scope of that role, however, remains a point of discussion. Assembling the foremost experts in their respective fields, editors Salah Aidarous and Thomas Plevyak present the community with an invaluable resource for research and development in Managing IP Networks: Challenges and Opportunities.Issues related to end-to-end network and service management, for example, will dramatically impact the future of IP networks, yet there remains a scholarly deficit between the significance of these topics and their presence in the current literature. Aidarous and Plevyak make up this difference, addressing these and other critical challenges affecting the growth of IP networks, with contributions from: Paul LevineJoberto MartinsBurkhard StillerMostafa Hashem SherifAndrea FumagalliJavier AracilLuca ValcarenghiNetwork operations engineers, computer scientists, and management software vendors, as well as professionals in the continuing education and research and development communities, will find Managing IP Networks to be an invaluable addition to their professional libraries. IP has a major role in the evolution of networks and services. Issues relating to end-to-end network and service management which offers advanced services, are addressed in this book; making it a defining work on this topic. Author Biography: The late Dr. SALAH AIDAROUS worked in the Network Management Division of NEC America on the planning and development of integrated network management systems. Prior to his association with NEC, he was with Nortel Technology (formerly BNR), working on a broad range of assignments in telecommunications networks and services planning and development. THOMAS PLEVYAK is Editor in Chief of IEEE Communications magazine and a past president and director of publications of the IEEE Communications Society (ComSoc). An IEEE Fellow, he is currently employed at Verizon Communications in Arlington, Virginia, in the field of operations and network management standards.