ppxscal/embedding_network huggingface dataset:
Reusing software process models in E/sup 3/
Authors: M. L. Jaccheri
Venue: Proceedings of the 10th International Software Process Workshop (1996)

E/sup 3/ (Environment for Experimenting and Evolving software processes) provides a process modeling language (PML) and a support tool. The PML is an object-oriented language extended with associations that has been designed for process elicitation, specification, and reuse of high level process fragments. The tool enables its users to create, modify, reuse and store process models. It offers a graphical user interface and it is supported by an object-oriented database for fragment storage and consistency management. A general description of the E/sup 3/ project can be found in http://www.polito.it/-e3maint. This position paper is about software process model reuse. Reuse requirements and reuse oriented E/sup 3/ features are introduced.
High Performance Distributed Objects for Cluster Computing
Authors: Lionel Brunie, Laurent Lefevre, Olivier Reymann
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

With the development of cluster computing, Distributed Shared Memory (DSM) systems have a new role to play by providing easiness of programming a shared space combined with the performance of high speed network.In this paper, we show that, by combining high performance network with low latency communication protocols and multithreading, DSM systems on top of clusters can be an efficient alternative programming model to message passing.We will present the DOSMOS system and experiments made on a Myrinet network based cluster. Raw performance of DOSMOS and results obtained with several kind of applications are also described.
The Inefficiency of Batch Training for Large Training Sets
Authors: D. Randall Wilson, Tony R. Martinez
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Multilayer perceptrons are often trained using error backpropagation (BP). BP training can be done in either a batch or continuous manner. Claims have frequently been made that batch training is faster and/or more ¿correct¿ than continuous training because it uses a better approximation of the true gradient for its weight updates. These claims are often supported by empirical evidence on very small data sets. These claims are untrue, however, for large training sets. This paper explains why batch training is much slower than continuous training for large training sets. Various levels of semi-batch training used on a 20,000-instance speech recognition task show a roughly linear increase in training time required with an increase in batch size.
The Cornell Program Synthesizer: A Microcomputer Implementation of PL/CS
Authors: Tim Teitelbaum
Venue:  (1979)

NO SUPPLIED
Spatial Temporal Analysis and Graph Layout From Clan Hierarchies
Authors: D. H. Gill
Venue:  (1991)

This report presents a graph analysis technique that summarizes the two-dimensional geometric properties of a labelled directed acyclic graph (DAG). The analysis uses a hierarchy of subgraphs (clans), which have the hereditary property. This property assures that the interior of the subgraph can be analyzed independently of the rest of the graph, to which it is related only by sources and sinks. A simple algebra of bounding rectangles is developed to support the analysis. Applications to clan layout and to the spatial-temporal analysis of a computation graph are described.
An Idea of the Agent-Based Information Recommending System Using the Statistical Information
Authors: Kouichi Abe, Toshihiro Taketa, Hiroshi Nunokawa
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

The agent-based information recommending system we propose is based on the statistical information and has the aim to provide the following information for users: (1) the information user is interested in, and (2) the information user potentially needs. The recommendation of the information user is interested in is a service that the system recommends the selected information by user's interest, concern and preference. The recommendation of the potential information user needs is a service that the system watches the user's daily browsing and the searching, and deduces the in-formation user needs and recommends the new information user seems to want. In this paper, we describe an idea of the information recommending system and consider the design and the implementation.
Fast compression of transportable Tcl scripts
Authors: Robert S. Gray
Venue:  (1996)

An information agent is charged with the task of searching a collection of electronic resources for information that is relevant to the user''s current needs. These resources are often distributed across a network and can contain tremendous quantities of data. One of the paradigms that has been suggested for allowing efficient access to such resources is transportable agents -- the agent is sent to the machine that maintains the information resource; the agent executes on this remote machine and then returns its results to the local machine. We have implemented a transportable agent system that uses the Tool Command Language (Tcl) as the agent language. Each Tcl script can suspend its execution at an arbitrary point, transport itself to another machine and resume execution on the new machine. The execution state of the script -- which includes the commands that have not been executed -- must be transmitted to the new machine. Although the execution state tends to be small, there will be a large number of agents moving across the network in a large-scale system. Thus it is desirable to compress the execution state as much as possible. Furthermore any compression scheme must be fast so that it does not become a bottleneck between the transportable agent system and the network routines. In this paper we explore several fast compression methods. 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
GraphXML -- An XML based graph interchange format
Authors: Ivan Herman, M. S Marshall
Venue:  (2000)

GraphXML is a graph description language in XML that can be used as an interchange format for graph drawing and visualization packages. The generality and rich features of XML make it possible to define an interchange format that not only supports the pure, mathematical description of a graph, but also the needs of information visualization applications that use graph-based data structures.
The Locust Swarm: An Environmentally-Powered, Networkless Location and Messaging System
Authors: T. Starner, D. Kirsch, S. Assefa
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

The Locust infared system provides inexpensive messaging and location information without batteries and without its own network. The system is ``privacy aware'' in that it supplies information to the wearable computer user who can then control how much of this information is shared with others or the installed infrastructure. By combining the abilities of Locusts with an appropriately equipped wearable computer, the user can interact with web-like hyperlinks, graphics, and sounds virtually associated with objects in the physical world. In addition the user can annotate and change these links as desired.
Hiding a Logo Watermark into the Multiwavelet Domain Using Neural Networks
Authors: Jun Zhang, Nengchao Wang, Feng Xiong
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper proposes a novel watermarking scheme for an image, in which a logo watermark is embedded into the multiwavelet domain of the image using neural networks. The multiwavelet domain provides us with a multiresolution representation of the image like the scalar wavelet case. However, there are four subblocks in the coarsest level of the multiwavelet domain, where there is only one in that of the scalar wavelet domain, and also there is a great similarity among these subblocks. According to these characteristics of the multiwavelet domain, we embed a bit of the watermark by adjusting the polarity between the coefficient in one subblock and the mean value of the corresponding coefficients in other three subblocks. Furthermore, we use a back-propagation neural network (BPN) to learn the characteristics of relationship between the watermark and the watermarked image. Due to the learning and adaptive capabilities of the BPN, the false recovery of the watermark can be greatly reduced by thetrained BPN. Experimental results show that the proposed method has good imperceptibility and high robustness to common image processing operators.
Simulating Switch-Level Networks with Uncertain Transistor Strengths and Node Sizes
Authors: Cheryl L. Harkness, Daniel P. Lopresti
Venue:  (1989)

Numerous techniques for performing switch-level simulation have been developed in recent years. Without exception, these simulators require that the relative conductances, or strengths, of all transistors be precisely specified. We explore the problem of simulating networks with uncertain transistor strength. To solve this problem, we examine the underlying mathematical structure of an existing switch-level simulation algorithm, MOSSIM II, and extend this structure to generate an algorithm for simulating networks with uncertain transistor strengths and node sizes. Such an algorithm may be useful in an integrated design-simulation environment, where designers test circuits while creating them.
MIAOW Multimedia Database: Revised Design and Implementation
Authors: Donatella Castelli, Benedetto Biagi, Serena Pisani
Venue:  (1996)

This document contains a revised version of the design and implementation phases of the MIAOW database described in the Report Design Document of the MIAOW Multimedia Database. This review is a consequence of a better understanding of requirements and of a critical evaluation of the E-R approach applied to the design of an Illustra database. This enhanced understanding of requirements has led to an enrichment of the conceptual schema in order to include information that previously had not been considered significant. For the review, of both the conceptual and logical design, the Object Modelling Technique (OMT) was employed. This methodology was chosen to overcome the intrinsic restrictions of the entity-relationship modelling approach used previously, which did not allow full exploitation of the Illustra modelling capabilities. The schema, obtained after the revised database design phase, was implemented using the Illustra structures.
The Use of Negative Curvature in Minimization Algorithms
Authors: Donald Goldfarb
Venue:  (1980)

IN this paper we examine existiing algorithms for minimizing a nonlinear function of many variables which make use of negative curvature. These algorithms can all be viewed as modified versions of Newton''s method and their merits and drawbacks are discussed to help identify new and more promising methods. The algorithms considered include ones which compute and search along nonascent directions of negative curvature and ones which search along curvi-linear paths generated by these directions and descent directions. Versions of the Goldfield-Quandt-Trotter method, or equivalently, methods based upon a trust region strategy, and gradient path methods are also considered. When combined with the numerically stable Bunch-Parlett factorization of a symmetric indefinite matrix the latter two approaches give rise to new, and what appears to be, efficient and robust minimization methods which can take advantage of negative curvature when it is encountered. Several suggestions are made for further research in this area.
Synaptically distributed memory vs. synaptically localized memory
Authors: Lipo Wang
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

We clarify that the only essential difference between the two major "categories" of unsupervised learning rules discussed in theories of artificial neural networks-the competitive learning and the Hebbian learning rules-is that lateral inhibition is present in the former and is absent in the later. We demonstrate analytically that a competitive learning neural network, which has synaptically localized memory, shows better tolerance over noise in training patterns in comparison with the Hopfield neural network, which uses a Hebbian-type learning rule without any lateral inhibition and has synaptically distributed memory.
The Cornell Parallel Supercomputing Effort
Authors: Alexandru Nicolau
Venue:  (1986)

Since the first electronic computers appeared, in the mid-1940''s, their potential for revolutionizing most areas of human endeavor has been recognized. Computers have been seen as instrumental in achieving scientific and technological breakthroughs, and in dramatically improving industrial productivity and efficiency through automation and simulation. Despite this promise, and despite the already formidable achievements attributable to the fast development of computer science and engineering, the field is believed by many to be in its infancy. In fact it appears that estimates of the potential impact of computers has been conservative. Each improvement in the speed and storage capabilities of computers, coupled with the dramatic decrease in cost, opens up whole new application areas. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On simple algorithms for dynamic load balancing
Authors: M. Alanyali, B. Hajek
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

The paper focuses on the dynamic resource allocation problem. In communication networks such as wireless or circuit switching networks, resources correspond to base stations or links, and the load corresponds to the calls in the network. The principle of load balancing is examined for dynamic resource allocation. The question of interest is the performance of simple allocation strategies which can be implemented online. Either finite capacity constraints on resources or mobility of users can be incorporated into the setup. The load balancing problem is formulated as an optimal control problem, and variants of a simple "least loaded routing" policy are shown to be asymptotically optimal for large call arrival rates.
ON THE GIBBS PHENOMENON III: RECOVERING EXPONENTIAL ACCURACY IN A SUB-INTERVAL FROM A SPECTRAL PARTIAL SUM OF A PIECEWISE ANALYTIC FUNCTION
Authors: David Gottlieb, Wang Chi-Shu
Venue:  (1993)

We continue the investigation of overcoming Gibbs phenomenon, i.e., obtaining exponential accuracy at all points including at the discontinuities themselves, from the knowledge of a spectral partial sum of a discontinuous but piecewise analytic function. We show that if we are given the first N expansion coefficients of an L_2 function f(x) in terms of either the trigonometrical polynomials or the Chebyshev or Legendre polynomials, we can construct an exponentially convergent approximation to the point values of f(x) in any sub-interval in which it is analytic.
Coordinated network scheduling: a framework for end-to-end services
Authors: Chengzhi Li, E. W. Knightly
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly when packets incur low delays at upstream nodes, downs stream nodes can reduce priority and schedule other packets first. The goal of this paper is to define a framework for design and analysis of coordinated network scheduling (CNS) which exploit such inter-node coordination. The first provide a general CNS definition which enables us to classify a number of schedulers from the literature including, FIFO+, CEDF and work-conserving CJVC as examples of CNS schedulers. We then develop a distributed theory of traffic envelopes which enables us to derive end-to-end statistical admission control conditions for CNS schedulers. We show that CNS schedulers are able to limit traffic distortion to within a narrow range resulting in improved end-to-end performance and more efficient resource utilization.
Implementing Replicated Services in Open Systems Using a Reflective Approach
Authors: J. Fraga, C. Maziero, L. C. Lung, O. G. Loques Filho
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

In this paper we evaluate the use of an object-oriented open platform based on the CORBA standard for the implementation of replicated services. To improve the flexibility of the implementation, we use a reflective approach, which allows for separation of aspects related to the replication model from those related exclusively to the service being replicated. This separation makes it possible to modify the replication protocol according to the fault tolerance level desired, without any implications for the application code.
A Proposed Initial Approach to Distributed Real-Time Java
Authors: E. Douglas Jensen
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The process of defining requirements for "real-time Java," and subsequently the two competing specifications for it, began with considerable thought by the participants about what the term "real-time Java" could and should mean. Now two corresponding requirements and specification processes have begun for "distributed real-time Java."This paper summarizes some ideas about that term and an approach to an initial specification. The approach is based on providing a natural and minimal mechanistic extension to Remote Method Invocation (RMI) that facilitates real-time distributed computing in general and real-time distributed (in the sense of trans-node) programming in particular. Here, "real-time RMI" is not defined as "real fast" or even "real predictable" RMI (although those are both important attributes). Instead, it means that the timeliness properties of computational entities are preserved when the entities perform RMI's and RETURN's that span physical nodes. A similar approach has been proven effective in several other distributed real-time contexts, and is a primary feature of the unified proposal to OMG for dynamic real-time CORBA.
Iterative Methods for p-Version Finite Elements: Preconditioning Thin Solids
Authors: Jan Mandel
Venue:  (1994)

We present new preconditioning strategy for 3D p-version elements used to model plate and shell structures as well as the microstructure of composite materials. The strategy is incorporated in an adaptive preconditioner suitable for large real-world problems. The method is shown to perform well for several large real world problems, including a model of the skin on an aircraft with over 1.6 million degrees of freedom, and a highly accurate model of a 28 ply laminated fiber plate.
Design of an I/O Balancing File System on Web Server Clusters
Authors: Wei Liu, Min Wu, Xinming Ou, Weimin Zheng, Meiming Shen
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The paper presents the design of an I/O balancing file system on Web server clusters. High-speed networks allow machines to access remote data nearly as quickly as they can access local data. This trend motivates the introduction of I/O balancing mechanism into cluster file systems. Two effective approaches are issued in the paper: file migration and unique cache. The former is to migrate the files from congested nodes to those un-congested ones to balance the I/O load among the cluster system. In addition, the latter is to integrate the memory and disk cache to form a global memory-disk file cache. It extracts the ideas of cooperative cache and file replication to improve the file system performance. In addition, unique cache balances the I/O load in file cache level. We can conclude that TH-CluFS is a suitable file system for Web server cluster.
A network of dynamic keystone species
Authors: Takashi Ikegami, Tomoharu Iwata, Koh Hashimoto
Venue: Proceedings of the eighth international conference on Artificial life (2002)

A concept of dynamic keystone species is proposed based on simulation studies of replicator equations. We report that the variables of this equation can be categorized into three groups based on their individual dynamic behaviour. They are dominant, neutral and recessive phenotypes. Because the growth rates are small in average, they are termed neutral phenotypes.Especially with a chaotic attractor, neutral phenotypes work as keystone species to control the stability of the system. The removal of neutral phenotypes may be a subtle perturbation, but it can have a large effect compared with its relative abundance, as it triggers an attractor switch. We also report that these neutral phenotypes form a network that can provide combinatorial effects on the attractor switch. A mere topological structure of the interacting matrix is not sufficient for determining which may be a keystone species; instead, it is determined by the kind of the attractors they organize.
Water Dome - An Augmented Environment
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The purpose of this research is to demonstrate the influence that a water dome has on a person. The following approach was used for this study: (1) A water display was used as a projection screen;(2) The illusion of being under water was created; and(3) Experiments with water domes of various sizes were carried out.Water Display is a Head Mounted type water membrane. When the display is projected, the inside surface acts as a concave mirror that can reflect the hand and face of a participant. Water Dome is a hemisphere eight meters in diameter. Participants were allowed to see the real world through a transparent wall of water on which computer-generated images were projected. A water dome has the advantage of engaging a participant's five senses as it enhances the surrounding environment. We developed a water dome that incorporates the points of view of both the artist and the engineer.
MedLan: a Logic-based Mediator Language
Authors: Domenico Aquilino, Patrizia Asirelli
Venue:  (1997)

In this paper we focus on the construction of a declarative mediator language. The lan- guage provides the ability to handle multiple logic theories, extended with program expres- sions. Two motivating examples are presented. The denotational and operational semantics of the language are introduced and a bottom-up ecient implementation is dened and proved correct with respect to the given semantics. EMAIL:: asirelli@iei.pi.cnr.it
Software Development Process Standards: Challenges for Process Assurance
Authors: R. Craig Smith
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

During 1992-94 the Cellular Infrastructure Group of Motorola implemented a set of common software development process specifications using the IEEE Std 1074 as a process architecture guideline and the SEI Capability Maturity Model (CMM) for process requirements. In late 1993 the Software Quality Assurance group implemented a process assurance program of auditing against these process specifications for process compliance and process improvement. The IEEE Std 1028 was chosen as the basic standard for development of the audit program. In June 1996, the Cellular Infrastructure Group became ISO 9001 certified. This paper will discuss challenges and lessons learned from working with these three major quality system and software development process standards from a process assurance perspective.