ppxscal/embedding_network huggingface dataset:
Creating Value with Knowledge: Insights from the IBM Institute for Knowledge-Based Organizations
Authors: Lawrence Prusak, Eric Lesser
Venue:  (2003)

:"The mid-1990s saw the rise of an important movement: a recognition that organizational knowledge, in its various forms and attributes, could be an important source of competitive advantage in the marketplace. Knowledge management has become one of the core competencies in today's competitive environment, where so much value in companies resides in their people, systems, and processes. Creating Value with Knowledge: Insights from the IBM Institute for Knowledge-based Organization examines a variety of important knowledge-related topics, some of which has been previously published in such journals as the Harvard Business Review, the California Management Review, and the Sloan Management Review, such as the use of informal networks, communities of practice, the impact of knowledge on successful alliances, social capital and trust, narrative and storytelling and the use of human intermediaries in the knowledge management process. It includes contributions from such leading thinkers as Lawrence Prusak, Dorothy Leonard, Eric Lesser, Rob Cross, and David Snowden. This book synthesizes some of the best thinking by the IBM Institute for Knowledge-Based Organizations, a think tank whose research agenda focuses on the management methods for deriving tangible business value from knowledge management and their real-world application."
Visage: a user interface environment for exploring information
Authors: S. F. Roth, P. Lucas, J. A. Senn, C. C. Gomberg, M. B. Burks, P. J. Stroffolino, A. J. Kolojechick, C. Dunmire
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

Visage is a prototype user interface environment for exploring and analyzing information. It represents an approach to coordinating multiple visualizations, analysis and presentation tools in data-intensive domains. Visage is based on an information-centric approach to user interface design which strives to eliminate impediments to direct user access to information objects across applications and visualizations. Visage consists of a set of data manipulation operations, an intelligent system for generating a wide variety of data visualizations (SAGE) and a briefing tool that supports the conversion of visual displays used during exploration into interactive presentation slides. This paper presents the user interface components and styles of interaction that are central to Visage's information-centric approach.
Security Management Against Cloned Cellular Telephones
Authors: Mirela Sechi Moretti Annoni Notare, Fernando Augusto da Silva Cruz, Bernardo Gonçalves Riso, Carlos Becker Westphall
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

The present work describes a security management system against the frauds related with the cloning of cellular phones. The system intends to make this fraud a nonlucrative business, and then, to finish with it. The system uses of three main techniques: (1) The ISO 8807 Technique (FDT LOTOS) is used to specify and validate the system through the Eucalyptus software employment; (2) A Pattern Recognition Technique is used to classify the telephone users into classes in order to identify if a call does not correspond to the patterns of a specific user -through MatLab software employment; and (3) CORBA Technique is used for the implementation of this distributed system (i.e., manager and agents), by VisiBroker software employment.
Mobility Tolerant Maintenance of Multi-Cast Tree in Mobile Multi-Hop Radio Networks
Authors: Sandeep K. S. Gupta, Pradip K. Srimani
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

When the nodes in a mobile ad hoc network move, existing links often no longer exist and/or new links are created. Any communication protocol designed for such multi-hop ad hoc networks must be able to tolerate such change in network topology that can occur anywhere in the network. Another characteristics of such networks is that bandwidth is a comparatively precious resource and needs to be conserved.Our purpose in the present paper is to explore the possibilities of applying the relatively new paradigm of self-stabilization in distributed fault tolerant algorithm design to tackle the problem of topology change in mobile networks. Self-stabilizing distributed algorithms converge to a global legitimate state in presence of any number of intermittent faults and still use only local knowledge for actions at each node.Our objective is to view the topology change as a change in the node adjacency information at one or more nodes and utilize the tools of self-stabilization to converge to a stable global state in the new network graph. We illustrate the concept by designing a new efficient distributed algorithm for multi-cast in a mobile network that can accommodate any change in the network topology due to node mobility.
On Parity and Near-Testability: $P^{A} \neq NT^{A}$ With Probability 1
Authors: Lane A. Hemachandra
Venue:  (1987)

The class of near-testable sets, NT, was defined by Goldsmith, Joseph, and Young. They noted that $P \subseteq NT \subseteq PSPACE$, and asked whether P=NT. This note shows that NT shares the same $m$-degree as the parity-based complexity class $\bigoplus P$ (i.e., $NT\equiv^{p}_{m} \oplus P$) and uses this to prove that relative to a random oracle $A, P^{A} \neq NT^{A}$ with probability one. Indeed, with probability one, $NT^{A} (NP^{A} \bigcup coNP^{A}) \neq 0$.
Procedural Analog Design (PAD) Tool
Authors: Danica Stefanovic, Maher Kayal, Marc Pastre, Vanco B. Litovski
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

This paper presents a new Procedural Analog Designtool called PAD. It is a chart-based design environmentdedicated to the design of analog circuits aiming tooptimise design and quality by finding good tradeoffs.This interactive tool allows step-by-step design ofanalog cells by using guidelines for each analog topology.At each step, the user modifies interactively one subset ofdesign parameters and observes the effect on other circuitparameters. At the end, an optimised design is ready forsimulation (verification and fine-tuning). Furthermore,PAD provides a layout generator for matchedsubstructures such as current mirror, cascode stage,differential pair, etc.The analog basic structures calculator embedded inPAD uses the complete set of equations of the EKV MOSmodel, which links the equations for weak and stronginversion in a continuous way[1,2].The present version of PAD covers the proceduraldesign of transconductance amplifiers (OTAs) anddifferent operational amplifiers topologies.
Generating Weighted Transversals of a Hypergraph
Authors: Boros Endre, Gurvich Vladimir, Khachiyan Leonid, Makino Kazuhisa
Venue:  (2000)

We consider a generalization of the notion of transversal to a finite hypergraph, so called {\em weighted transversals}. Given a non-negative weight vector assigned to each hyperedge of the input hypergraph, we define a weighted transversal as a minimal vertex set which intersects a collection of hypereredges of sufficiently large total weight. We show that the hypergraph of all weighted transversals is dual-bounded, i.e, the size of its dual hypergraph is polynomial in the number of weighted transversals and the size of the input hypergraph. Our bounds are based on new inequalities of extremal set theory and threshold Boolean logic, which may be of independent interest. For instance, we show that for any threshold frequency, the number of maximal frequent sets of columns in a binary matrix is bounded by the number of minimal infrequent sets of columns in the same matrix multiplied by the number of its rows. We also prove that the problem of generating all weighted transversals for a given hypergraph is polynomial-time reducible to the generation of all ordinary transversals for another hypergraph, i.e., to the well-known hypergraph dualization problem. As a corollary, we obtain an incremental quasi-polynomial-time algorithm for generating all weighted transversals for a given hypergraph. This result includes as special cases the generation of all the minimal Boolean solutions to a given system of non-negative linear inequalities and the generation of all minimal infrequent sets of columns for a given binary matrix.
Capturing functional requirements through object interactions
Authors: D. A. Rawsthorne
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

The author introduces transaction based analysis (TBA), an object-oriented analysis methodology that is a blend of use-case analysis and responsibility driven design. The author shows how a user's functional requirements can be captured in a hierarchy of transaction diagrams-this hierarchy is one of the primary models generated using TBA. Transaction diagrams show how responsibilities within the system are carried out-they capture the control flow between objects in the system, as well as indicate which object responsibilities are being invoked. These diagrams also capture patterns of interactions that are intrinsic in the user's conceptual model. The notation for transaction diagrams is robust and easily communicated to the user.
Design by continuous collaboration between manual and automatic optimization
Authors: Kamran E Shahroudi
Venue:  (1997)

Numerical optimization is traditionally viewed as a machine centric activity. This view dominates the majority of numerical optimization packages today, where user interaction is normally limited to the problem definition phase or visualization of the results with little or no interaction at design or run time. Surprisingly we are surrounded by many examples of successful engineering systems which allow human interaction at run time, e.g. automobiles, aircraft etc. In fact, Integrated Human Machine Systems (IHMS) and dedicated engineering design groups have already shown that the distribution of the intelligent function between the human and artificial agents at design time leads to a more effective utilization of their complementary capabilities. This paper discusses the implementation of a generic semi-automatic optimization concept in which the human designer continuously collaborates with a numerical agent to navigate the design space and modify it when necessary. The concept allows human interaction at various levels of automation. The potential of this approach is shown by way of three human-in-the-loop optimization examples: . conceptual design optimization of subsonic aircraft; . optimization of trajectory of a Mars rover vehicle; . configuration optimization of a multistage rocket. This technique is located in a multidisciplinary area formed by the cross section of Visualization, Numerical Optimization and Computational Steering.
The many faces of publish/subscribe
Authors: Patrick Th. Eugster, Pascal A. Felber, Rachid Guerraoui, Anne-Marie Kermarrec
Venue: ACM Computing Surveys (CSUR) (2003)

Well adapted to the loosely coupled nature of distributed interaction in large-scale applications, the publish/subscribe communication paradigm has recently received increasing attention. With systems based on the publish/subscribe interaction scheme, subscribers register their interest in an event, or a pattern of events, and are subsequently asynchronously notified of events generated by publishers. Many variants of the paradigm have recently been proposed, each variant being specifically adapted to some given application or network model. This paper factors out the common denominator underlying these variants: full decoupling of the communicating entities in time, space, and synchronization. We use these three decoupling dimensions to better identify commonalities and divergences with traditional interaction paradigms. The many variations on the theme of publish/subscribe are classified and synthesized. In particular, their respective benefits and shortcomings are discussed both in terms of interfaces and implementations.
Path-Based Edge Activation for Dynamic Run-Time Scheduling
Authors: Vincent J. Mooney Iii
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

We present a tool that performs real-time analysis and dynamic execution of software tasks in a mixed hardware-software system with a custom run-time scheduler. The tasks in hardware and software have control-flow constraints (precedence and alternative execution), resource constraints, relative timing constraints, and a rate constraint. The custom run-time scheduler dynamically executes tasks in different orders, based on the conditional execution path, such that a hard real-time rate constraint can be predictably met.We describe the task modeling, run-time scheduler implementation, and real-time analysis. We introduce the concept of path-based edge activation utilizing conditional edges. We show how our approach fits into an overall tool flow and target architecture. Finally, we conclude with a sample application of the system to a design example.
Improvements in Parallel Job Scheduling Using Gang Service
Authors: Fabricio Alves Barbosa da Silva, Isaac D. Scherson
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all available processors. Non allocated processors go idle for the duration of the time quantum assigned to the threads. In this paper we propose a class of scheduling policies, dubbed Concurrent Gang, that is a generalization of gang-scheduling, and allows for the flexible simultaneous scheduling of multiple parallel jobs, thus improving the space sharing characteristics of gang scheduling. However, all the advantages of gang scheduling such as responsiveness, efficient sharing of resources, ease of programming, etc., are maintained.
A Java Internet Computing Environment with Effective Configuration Method
Authors: Chun-Mok Chung, Pil-Sup Shin, Shin-Dug Kim
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

For an effective Internet-based distributed parallel computing platform, Java-Internet Computing Environment (JICE) is designed and implemented with multithreading and remote method invocation mechanisms provided in Java. Specifically, JICE supports a shared memory system model for communication between any two nodes. Under the JICE, communication time is a major candidate of performance bottleneck. To reduce this communication over-head, a method of grouping is designed based on the optimal communication time. Communication performance given by grouping is evaluated through the analysis of execution time and verified via experiments. The results show that communication time can be reduced about 80% from executing some Java benchmarks on JICE.
Residual-Free Bubbles for the Helmholtz Equation
Authors: Leopoldo P. Franca, Charbel Farhat, Antonini P. Macedo, Michel Lesoinne
Venue:  (1996)

The Galerkin method enriched with residual-free bubbles is considered for approximating the solution of the Helmholtz equation. Two-dimensional tests demonstrate the improvement over the standard Galerkin method and the Galerkin-least-squares method using piecewise bilinear interpolations.
Preliminary quantity estimate of highway bridges using neural networks
Authors: G. Morcous, M. M. Bakhoum, M. A. Taha, M. El-Said
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Current models for preliminary quantity estimate of highway bridges are not successful in preparing a quick and economic bill of quantity with sufficient accuracy for bidding purposes. Moreover, most of these models have serious problems in their development and update. In this paper, an effort to develop an Artificial Neural Network (ANN) model that eliminates the shortcomings of the current models is presented. An ANN with back-propagation learning algorithm was trained to estimate the concrete volume and prestressing weight in bridge superstructure. A set of 22 prestressed concrete bridges constructed in Egypt over the Nile was used in training and testing the network. Testing results indicated that ANNs are sufficient tools for the preliminary quantity estimate of highway bridges.
Privacy conscious brokering in personalised location-aware applications
Authors: Leonid Titkov, Stefan Poslad
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

With the advent of powerful portable devices that allow people to always stay connected everywhere, there is a growing demand for location-aware services. Location tracking of moving objects or location-aware services (LAS) is becoming increasingly prevalent in numerous aspects of daily life. The ability to collect location data has raised various privacy issues due to the potential for misuse of location data. Privacy concerns may prevent us from developing these advanced spatial technologies to their maximum potential. The work presented here, is part of the CRUMPET project and employs intelligent agents and the use of brokering in order to protect personal privacy within LAS domains.
On the computational complexity of hierarchical radiosity
Authors: Robert Garmann, Heinrich Müller
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization and the refinement of links between the scene's patches based upon a user-specified error parameter ε. They state that the number of links is linear in the number of elements if ε is assumed to be a constant. We present a result based upon the assumption that the geometry is constant and ε approaches 0 in a multigridding-procedure. Then the algorithm generates L = Θ (N2) links where N denotes the number of elements generated by the algorithm.
HYDRANET-FT: Network Support for Dependable Services
Authors: Gurudatt Shenoy, Suresh K. Satapati, Riccardo Bettati
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

With the Internet increasingly being used as access medium for a variety of critical services, there is a growing need to provide fault tolerant services over internetworks, in a completely client-transparent fashion. We present HYDRANET-FT, an infrastructure to dynamically replicate services across an internetwork and have the replicas provide a single fault tolerant service access point to clients. HYDRANET-FT uses the TCP communication protocol with a few modifications on the server side to allow one-to-many message delivery from a client to service replicas and many-to-one message delivery from the replicas to the client. A communication channel between the replicas provides atomicity and message ordering. A low-latency failure estimator is used to detect failures of servers in the system and initiate fail-over mechanisms. An implementation and measurements on a local testbed show that the overhead of our scheme is reasonably small.
Collaborative Visual Data Navigation on the Web
Venue: Proceedings of the International Conference on Information Visualisation (2000)

2D and 3D visualization technologies developed for the Web are taking the world by storm. Companies now see the Internet/Intranet and the Web as key mechanisms for distributing information internally and among their customers.With the evolution of standard Web-based visualization components, the opportunity to provide interactive electronic documents has become practicable. The author of a scientific, engineering or business analysis, can distribute electronic documents with embedded interactive 3D visualization viewers to colleagues.The quickest way to move from data to insights to action is to make the data analysis a shared experience. Visual data navigators embedded in electronic documents can act as a key enabler of geographically distributed teams, allowing team members to analyze, communicate and share information as though they are collocated. Economic globalization and competition drive the formation of geographically distributed teams that span different sites within the same company and sometimes cross-corporate boundaries.This paper will show you how to deliver interactive visual data navigation in an electronic document through the Web based on Microsoft's ActiveX/COM industry standard. How you develop and deploy solutions that provide rich data analysis and 3D visualization capabilities. How you can deploy electronic documents with richer visual user interfaces. The proposed solution is called ¿SmartDoc¿, where an analytical event comes to life in the document. This may be the starting point for new visual solutions to problems that have proved very difficult to communicate. 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
I/O Efficient Scientific Computation Using TPIE
Authors: Erik D Vengroff, Scott J Vitter
Venue:  (1995)

In recent years, I/O-efficient algorithms for a wide variety of problems have appeared in the literature. Thus far, however, systems specifically designed to assist programmers in implementing such algorithms have remained scarce. TPIE is a system designed to fill this void. It supports I/O-efficient paradigms for problems from a variety of domains, including computational geometry, graph algorithms, and scientific computation. The TPIE interface frees programmers from having to deal not only of explicit read and write calls, but also the complex memory management that must be performed for I/O-efficient computation. In this paper, we discuss applications of TPIE to problems in scientific computation. We discuss algorithmic issues underlying the design and implementation of the relevant components of TPIE and present performance results of programs written to solve a series of benchmark problems using our current TPIE prototype. Some of the benchmarks we present are based on the NAS parallel benchmarks, while others are of our own creation. We demonstrate that the CPU overhead required to manage I/O is small and that even with just a single disk the I/O overhead of I/O-efficient computation ranges from negligible to the same order of magnitude as CPU time. We conjecture that if we use a number of disks in parallel this overhead can be all but eliminated.
A formal compositional model of multiagent interaction
Authors: Sea Ling, Seng Wai Loke
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Interaction protocols for multiagent systems have been described diagrammatically in an extension of UML called AUML (Agent UML). In this paper, we show how to translate these protocols to equivalent Petri net specifications. A novelty of our approach is that the Petri nets are modular, clearly separating the protocol from the interaction behaviour of agents induced by their participation in the protocol, yet compositional. We contend that compositionality is useful since multiagent systems and their interactions are inherently modular, and so that mission-critical parts of a system can be analysed separately. Our model can serve at least two purposes in multigent systems engineering: firstly, specification and verification, and secondly, as a basis for synthesising skeleton code of interacting agents from specifications in the spirit of interaction-oriented programming.