ppxscal/embedding_network huggingface dataset:
Standardization and Japanese Information Service Industry
Authors: Fumihiko Kamijo
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

Propagation and Harmonization are two key issues of standardization. A task force was set up in an industry organization to work for propagation of international standards. The name of the team was the Standard Committee, as part of the Japan Information Services Association (JISA).The activity to propagate standards provides little business profits in the short run. With this demerit, the committee could persuade member company management in specific topics. One example was the acceptance of ISO 9000. The recent activities are centered around Software Life Cycle Process (SLCP) and its practice guideline, Japan Common Frame (JCF). Such management-oriented standards may cause problems in Japan.Harmonization is a systematic problem solved by keeping concordance between International Standard Organization (ISO) standards and the official Japan Industrial Standard (JIS), as a governmental policy.
A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays
Authors:  I, L A Rosenberg
Venue:  (1984)

We study here a formal version of a strategy for constructing fault-tolerant VLSI processor arrays in an environment of wafer-scale integration. The strategy achieves tolerance to faults by running buses past the implemented PEs and interconnecting the fault-free ones into an array of the desired structure by having PEs tap into the bank of buses. Earlier studies [12] have shown this strategy to be competitive with more familiar strategies, particularly given the availability of laser-welding technology. We study here fault-tolerant implementations of linear arrays and tree-structured arrays, deriving both upper and lower bounds on the area required to lay out the fault-tolerant arrays. We also consider briefly the issue of wire lengths.
Kleene algebra with tests and commutativity conditions
Authors: Dexter Kozen
Venue:  (1996)

We give an equational proof, using Kleene algebra with tests and commutativity conditions, of the following classical result: every while program can be simulated by a while program with at most one while loop. The proof illustrates the use of Kleene algebra with extra conditions in program equivalence proofs. We also show, using a construction of Cohen, that the universal Horn theory of *-continuous Kleene algebras is not finitely axiomatizable. 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
Pre-Route Noise Estimation in Deep Submicron Integrated Circuits
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

One of the critical challenges in today's high performance IC design is to take noise into account as early as possibe in the design cycle. Current noise analysis tools [1,7] are effective at analyzing and identifying noise in the post-route design stage when detailed parasitic information is available. However, noise problems identified at this stage of design cycle are very difficult to fix due to the limited flexibility in the design and may cause additional iterations of routing and placement, adding costly delays to time-to-market. In this paper, we introduce an estimated, congestion-based pre-route noise analysis approach to identify post-route noise failures before the actual detailed route is completed. We introduce new methods to estimate the RC characteristics of victim and aggressor lines, their coupling capacitances and the aggressor transition times before routing is performed. The approach is based on congestion information obtained from a global router. Since the exact location and relative position of wires in the design is not yet available at this point, we propose a novel probabilistic method for capacitance extraction. We present results on two high performance microprocessors in 0.18 micron technology that demonstate the effectiveness of the proposed approach.
PANDORA: A Multi-Agent System Using Paraconsistent Logic
Authors: Elaini S. Angelotti, Edson E. Scalabrin, Braulio C. Ávila
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This work is part of the Multicheck Project that defines architecture of cognitive andindependents agents for the automatic treatment of handwritten Brazilian bank checks.Theconcept of autonomous agents allows us to organize the application knowledge and bringsseveral own benefits to the approach.The choice of this approach is supported in a triplehypothesis.First, the nature of the problem in question allows decomposition in well-definedtasks, and each of them can be encapsulated in an independent agent.Second, thenatural capability of interaction of the agents makes the check treatment process morerobust, solving situations apparently difficult.Third, the natural parallelism between theagents can contribute to implement an application with high performance.
Developing Microsoft.NET Controls with Microsoft Visual Basic.NET
Authors: John Connell
Venue:  (2003)

Create compelling and effective program interfaces that best suit your users' needs-and make your products more competitive and useful-by customizing the intrinsic controls in the Microsoft .NET Framework and building your own controls from scratch.
Packet Loss Detection Scheme for Retransmission-Based Realtime Data Transfer
Authors: Masanobu Yamaguchi, Katsuyoshi Ito, Yoshitaka Takasaki
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Since retransmission-based error control for realtime communication will be feasible in the future high-speed network environment, we have proposed R3TP (Retransmission based Reliable Realtime data Transfer Protocol). R3TP is a transport layer protocol, which provides high quality realtime data transfer by adopting ATM Block Transfer (ABT) and retransmission-based error control. Fast and accurate packet loss detection scheme is indispensable for retransmission based error control in realtime communication. In this article, a novel packet loss detection scheme for R3TP and its evaluation results in comparison with other loss detection schemes are described.
Algorithms for program dependence graph production
Authors: G. Canfora, A. Cimitile
Venue: Proceedings of the International Conference on Software Maintenance (1995)

One of the greatest difficulties of setting up a software maintenance workbench is the definition of an internal representation of programs from which different external representations can be automatically constructed. This is because many techniques and tools exist that support and automate individual maintenance activities, and each of these techniques and tools operates on its own specific representation of the program. This paper presents our program representation, called F(p), and shows how it can be used as an index to access program information. This allows many existing representations to be derived from F(p). The paper presents two novel algorithms to derive two existing program representations, namely the control dependence graph and the sets of uses that can be reached from each variable definition (which provide the additional information needed to draw the program dependence graph).
Computing Prime Implicants by Integer Programming
Authors: Clara Pizzuti
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

An enumerative approach for selective generation of prime implicants of a theory in conjunctive normal form is presented. The method is based on 0-1 programming. Optimal solutions of the integer linear program associated with the theory correspond to prime implicants. All prime implicants can be obtained by augmenting the integer program with new constraints which discard the already obtained solutions. The method allows to implement preference criteria in the choice of the prime implicants to find. Keywords. Integer programming, prime implicants, hypothetical reasoning, explanations.
Runtime Parallel Incremental Scheduling of DAGs
Authors: Min-You Wu, Wei Shu, Yong Chen
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

A runtime parallel incremental DAG scheduling approach is described in this paper. A DAG is expanded incrementally, scheduled, and executed on a parallel machine. A DAG scheduling algorithm is parallelized to scale to large systems. In this approach, a large DAG can be executed without consuming large amount of memory space. Inaccurate estimation of task execution time and communication time can be tolerated. This runtime approach can also execute dynamic DAGs. Implementation of this parallel incremental system demonstrates the feasibility of this approach. Preliminary results show that it is superior to other approaches.
Business Without Borders: A Strategic Guide to Global Marketing
Authors: Donald A. DePalma
Venue:  (2002)

:Before the Web, only giants such as Ford, McDonald's, Volkswagen, and Sony had the resources and infrastructure to serve and market to a global community. Now, thanks to the power of the Internet to transcend space, time, and borders, virtually any company can market its products or services anywhere in the world. However, as global Web-marketing expert Don DePalma explains in this groundbreaking guide, just having a Web site isn't enough - in order to make your company a global player, you've got to think globally and interact locally. In Business Without Borders, he shows you how. 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
Python library reference
Authors: Guido Rossum
Venue:  (1995)

Python is an extensible, interpreted, object-oriented programming language. It supports a wide range of applications, from simple text processing scripts to interactive WWW browsers. While the Python Reference Manual describes the exact syntax and semantics of the language, it does not describe the standard library that is distributed with the language, and which greatly enhances its immediate usability. This library contains built-in modules (written in C) that provide access to system functionality such as file I/O that would otherwise be inaccessible to Python programmers, as well as modules written in Python that provide standardized solutions for many problems that occur in everyday programming. Some of these modules are explicitly designed to encourage and enhance the portability of Python programs. This library reference manual documents Python''s standard library, as well as many optional library modules (which may or may not be available, depending on whether the underlying platform supports them and on the configuration choices made at compile time). It also documents the standard types of the language and its built-in functions and exceptions, many of which are not or incompletely documented in the Reference Manual. This manual assumes basic knowledge about the Python language. For an informal introduction to Python, see the Python Tutorial; the Python Reference Manual remains the highest authority on syntactic and semantic questions. Finally, the manual entitled Extending and Embedding the Python Interpreter describes how to add new extensions to Python and how to embed it in other applications.
MIAOW: An Object Oriented Multimedia DB application on the WWW for the stone market
Authors: Benedetto Biagi, Donatella Castelli, Filippo Niccolini, Serena Pisani
Venue:  (1997)

This paper presents the MIAOW system, a comprehensive information system now available on the Internet. This system acts as the main component in a reorganization of the marble business process aimed at rendering the exchange of information widespread, up-to-date, timely, reliable and cost-effective. It consists of an Illustra DB and a WWW application on top of it. The former stores both technical data and visual characteristics of the stony materials. The latter supports browsing, information retrieval and data storage on the underlying database by offering the most sophisticated functionalities for architects, consultants and suppliers. TEL:: +39 050 593406 EMAIL:: castelli@iei.pi.cnr.it
Piecewise Differentiable Minimization for Ill-posed Inverse Problems
Authors: Yuying Li
Venue:  (1996)

Based on minimizing a piecewise differentiable lp function subject to a single inequality constraint, this paper discusses algorithms for a discretized regularization problem for ill-posed inverse problems. We examine computational challenges of solving this regularization problem. Possible minimization algorithms such as the steepest descent method, iteratively weighted least squares (IRLS) method and a recent globally convergent affine scaling Newton approach are considered. Limitations and efficiency of these algorithms are demonstrated using the geophysical traveltime tomographic inversion and image restoration applications. 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
Linux/SimOS - A Simulation Environment for Evaluating High-Speed Communication Systems
Authors: Chulho Won, Ben Lee, Chansu Yu, Sangman Moh, Yong-Youn Kim, Kyoung Park
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

This paper presents Linux/SimOS, a Linux operating system port to SimOS, which is a complete machine simulator from Stanford. The motivation for Linux/SimOS is to alleviate the limitations of SimOS, which only supports proprietary operating systems. The contributions made in this paper are two-fold: First, the major modifications that were necessary to run Linux on SimOS are described. Second, a detailed analysis of the UDP/IP protocol and M-VIA is performed to demonstrate the capabilities of Linux/SimOS. The simulation study shows thatLinux/SimOS is capable of capturing all aspects of communication performance, including the effects of the kernel, device drivers, and network interface.
Computer Generated Intelligent Companions for Distributed Virtual Environments
Authors: M. Edwards, E. Santos Jr, S. B. Banks, M. R. Stytz
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The employment of Computer Generated Forces (CGFs) within Distributed Virtual Environments (DVEs) dramatically increases the number of entities in a simulated training environment. However, current CGF limitations produce behaviors that can be defeated using methods ineffective against humans. Our research focuses on developing aircraft CGFs. It is necessary to deal with uncertainty, ambiguity and approximation. The Fuzzy Wingman (FW) relies on fuzzy logic to provide these abilities. In this manner, the FW presents a reasonable approach to effectively populating the simulated training environment with low-cost CGFs while maintaining the realism of training with human-controlled entities.
New visions of human-computer interaction: making affect compute
Authors: Michael D. McNeese
Venue: International Journal of Human-Computer Studies (2003)

Looking at the intersection of cognition, emotion, computing, and context reveals various historical gaps that are important to understand in order to progress in applying affective computing technologies to real-world problems involving human-computer interaction (HCI). The paper reviews several streams of research along these lines while striving for a philosophical and conceptual understanding of what affecting computing means for new visions of HCI. In turn this provides a foundational structure for positioning the special issue and sets up the papers to provide readers with a broad exposure to the potential (and hazards) involved with affective computing as it impacts cognate areas of emphasis. Finally, the hope is put forth that affective computing must be developed as a user-centered technology to be of value for unexplored frontiers of the digital global economy.
Loop Alignment for Memory Accesses Optimization
Authors: Antoine Fraboulet, Guillaume Huard, Anne Mignotte
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Portable or embedded systems allow more and more complex applications like multimedia today. These applications and submicronic technologies have made the power consumption criterium crucial. We propose new techniques thanks to which we can optimize the behavioral description of an integrated system before the hardware/software partitioning (Codesign). These transformations are performed on "for" loops that constitute the main parts of the multimedia code which handle the arrays. We present in this paper two new (polynomial) techniques for minimizing memory accesses in loop nests by data temporal locality optimization.
Formalizing System Structure
Authors: Matthias Radestock, Susan Eisenbach
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

Darwin is a language designed for configuring distributed systems. A system is modelled as a decompositional hierarchy of components with interfaces. Connections are represented as bindings between interfaces. Darwin programs define component types. Configurations of a system are obtained by instantiating these types. Configurations have to comply with a number of constraints on the system structure. It is therefore intuitive to express these constraints in the domain of configurations rather than on the language level. To succeed in this endeavour we need to precisely express the relation between Darwin programs and configurations. We do this in terms of a first-order logic theory of Darwin programs and configurations. Models of the theory provide a straightforward mapping from Darwin programs to configurations and vice versa. Most of the constraints on configurations as well as structural transformations can be specified by adding just a few axioms to the theory. Also the theory enables us to generate Darwin programs from configurations thus allowing for the inclusion of existing systems into new programs.
On Derivation of MLP Backpropagation from the Kelley-Bryson Optimal-Control Gradient Formula and Its Application
Authors: Eiji Mizutani, Stuart E. Dreyfus, Kenichi Nishio
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

The well-known backpropagation (BP) derivative computation process for multilayer perceptrons (MLP) learning can be viewed as a simplified version of the Kelley-Bryson gradient formula in the classical discrete-time optimal control theory [1]. We detail the derivation in the spirit of dynamic programming, showing how they can serve to implement more elaborate learning whereby teacher signals can be presented to any nodes at any hidden layers, as well as at the terminal output layer. We illustrate such an elaborate training scheme using a small-scale industrial problem as a concrete example, in which some hidden nodes are taught to produce specified target values. In this context, part of the hidden layer is no longer ¿hidden¿.
Using traffic regulation to meet end-to-end deadlines in ATM LANs
Authors: A. Raha, S. Kamat, W. Zhao
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

This paper considers the support of hard real-time connections in ATM networks. In an ATM network, a set of hard real-time connections can be admitted only if the worst case end-to-end delays of cells belonging to individual connections are less than their deadlines. Although there are several approaches to manage the network resources in order to meet the delay requirements of connections, we focus on the use of traffic regulation to achieve this objective. Leaky buckets provide simple and user-programmable means of traffic regulation. We design and analyse an efficient optimal algorithm for selecting the burst parameters of leaky buckets to meet connections' deadlines. Our algorithm is optimal in the sense that it always selects burst parameters to meet the delay requirements of hard real-time connections whenever some such assignment exists. The exponential size of the search space makes this problem a challenging one. Our algorithm is efficient and we observe a dramatic improvement in the system performance in terms of the connection admission probability when traffic is regulated using our algorithm
Partial Redundancy Elimination Driven by a Cost-Benefit Analysis
Authors: R. Nigel Horspool, H. C. Ho
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

Partial redundancy elimination has become a major compiler optimization that subsumes various ad hoc code motion optimizations. However, partial redundancy elimination is extremely conservative, failing to take advantage of many opportunities for optimization. We describe a new formulation of partial redundancy elimination based on a cost-benefit analysis of the flowgraph. Costs and benefits are measured by the number of evaluations of an expression. For that reason, our technique requires estimates for the execution frequency of every edge in the flowgraph. The new technique is much more agressive, performing more code motion and thereby reducing the number of expression evaluations as compared to the standard optimization.
The Compositional C++ Language Definition
Authors: Peter Carlin, K. M Chandy, Carl Kesselman
Venue:  (1993)

This document gives a concise definition of the syntax and semantics of CC++. Knowledge of the C++ language definition and the C++ language reference manual is assumed.
Statistical properties of a kernel type estimator of the intensity function of a cyclic Poisson process
Authors: Roelof Helmers, I. W. Mangku, Ricardas Zitikis
Venue:  (2001)

We consider a kernel-type nonparametric estimator of the intensity function of a cyclic Poisson process when the period is unknown. We assume that only a single realization of the Poisson process is observed in a bounded window which expands in time. We compute the asymptotic bias, variance, and the mean squared error of the estimator when the window indefinitely expands.
Extensible Markup Language (XML) 1.0 (italian version)
Authors: Andrea Marchetti
Venue:  (1998)

The Extensible Markup Language (XML) is a subset of SGML that is completely described in this document. Its goal is to enable generic SGML to be served, received, and processed on the Web in the way that is now possible with HTML. XML has been designed for ease of implementation and for interoperability with bot SGML and HTML.
Escalation in IT Projects: Can We Afford to Quit or do We Have to Continue?
Authors: Urban Nulden
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Many information technology (IT) projects fail. These projects are not within budget, not on time or do not deliver what was promised. Failures in IT projects are more common than failures in any other aspect of modern business. Whereas a large number of projects are obvious failures, some are not. A model of escalation-increasing commitment to a failing course of action-is used to analyze and explain one type of project failure, namely, those projects that seem to take on a life of their own, wasting scarce resources and in many cases never reaching the objectives they were set to fulfill. This paper argues that escalation as a cause of IT project failure has received too little attention in both practice and education. A small case is used to illustrate escalation in an IT project.