ppxscal/embedding_network huggingface dataset:
A Multi-Agent System to the Common Management of a Renewable Resource: Application to Water Sharing
Authors: M. Le Bars, M. Attonaty
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

Water sharing has become an important problem in France. A lot of negotiations are taking place at a local level between farmers, water suppliers, public services and environmentalists to allocate water resources between users. The problem is to share water with respect of different criteria like economic (global output) ethical (disparities between actors) environmental (water savings). Different approaches have been already taken using linear programming or game theory, but they are always based on the hypothesis that decision-makers are completely rational, take into account few players and are often monoperiodic. We suggest that an Agent-Based Modelling (ABM) built with a Multi-Agent approach could help negotiations between different players by showing the consequences of water allocation rules and taking in consideration the players 'respective attitudes and their ability to change their behaviour. In this paper we will first present the model structure with the different types of agents modelled, how the model runs over a number of years and the first results of simulations.Keywords. Distributed Artificial Intelligence; Multi-Agent Systems
Simulation and augmentation: Issues of wearable computers
Authors: Ana Viseu
Venue: Ethics and Information Technology (2003)

As the physical and digital worlds interact, some fields of technoscience have started to shift from an approach emphasizing simulation &ndash; in which the physical is replicated in the digital &ndash; to one focusing on augmentation, in which the digital is utilized to enhance the physical. A good place to study the implications this shift has on the individual is the field of personal wearable technologies. Here, the body is not simply extended by information and communication technologies (ICTs), but also becomes their intimate host. This represents a new step in the conceptualization of the synergy between individual (body) and technology (environment), and also affects the ways in which the role and character of each actor are defined. This paper explores some of the theoretical re-orientations underpinning the development of wearable computers and how these shape the relationship between body and environment.
A Tool for Object-Oriented Dynamic Modeling
Authors: Andrew A. Hanish, Tharam S. Dillon
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

The commonly recognized weakness of modern object-oriented design and implementation methodologies lies in their superficial treatment of inter-object dynamics. This paper describes a software toolbox called ODYMOT that integrates a number of approaches to the problem of behavior modeling. In order to achieve design flexibility, a two-layer object design architecture is used that blends together object-oriented design concepts with those of high-level Petri nets. The Petri net representation creates an additional access layer of object architecture, providing meta-level object control with the sequencing of method execution. This modeling approach allows one, both mathematically and pragmatically, to achieve a more precise and flexible description and implementation of real-time and distributed models.
Factory Automation Support Technology (FAST): A New Paradigm of Continuous Learning and Support Using a Wearable
Authors: Chris Thompson, Jennifer J. Ockerman, Lawrence J. Najjar, Erika Rogers
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

A new paradigm of continuous learning and support using a wearable computer is presented. The features of a Wearable Electronic Performance Support System (WEPSS) are contrasted with more traditional training and support approaches. Our goal is to support mobile factory personnel in accomplishing complex technical tasks. Such a system allows workers to ask for advice, receive instruction, access productivity tools, communicate with others, and assess their knowledge on a continuous basis in a mobile environment. We call this concept Factory Automation Support Technology (FAST). Using a wearable computer, workers interact with local and remote learning and support resources as they move throughout a facility. An architecture is described embodying the concepts presented and initial efforts to realize the system are described.
Fast blind equalization using higher-order-spectra channel-estimation in the presence of severe ISI
Authors: S. E. El-Khamy, A. F. Ali, H. M. EL-Ragal
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The blind equalization of data distorted in dispersive channels with considerable ISI is investigated. The blind channel estimation is realized without using training sequences. Two methods based on the higher order spectra and polycepstra are considered. The estimated channel response is used to adaptively equalize the distorted data. The speed of convergence of the adaptive equalizer is highly increased by suitable filtration of the estimated channel impulse response before adaptive equalization. This is done by providing smart initial weights for the adaptive equalizer through inverse filtering or matched filtering of the estimated channel response. The addition of a deconvolving filter to the matched filter is suggested to cancel the effects of the high offset correlation values of the channel impulse response that is characteristic of channels with severe ISI.
wxWindows for cross-platform coding
Authors: Taran Rampersad
Venue: Linux Journal (2003)

A fast, stable toolkit for apps that run on any OS with a native look. 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
Unification and ML Type Reconstruction
Authors: Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell
Venue:  (1990)

We study the complexity of type reconstruction for a core fragment of ML with lambda abstraction, function application, and the polymorphic let declaration. We derive exponential upper and lower bounds on recognizing the typable core ML expressions. Our primary technical tool is unification of succinctly represented type expressions. After observing that core ML expressions, of size $n$, can be typed in $ DTIME( 2^n) $, we exhibit two different families of programs whose principal types grow exponentially. We show how to exploit the expressiveness of the let-polymorphism in these constructions to derive lower bounds on deciding typability: one leads naturally to NP-hardness and the other to $ DTIME( 2 ^ {n ^ k} )$-hardness of each integer $k~\geq~1$. Our generic simulation of any exponential-time Turing machine by ML type reconstruction may be viewed as a nonstandard way of computing with types. Our worst-case lower bounds stand in contrast to practical experience, which suggests that commonly used algorithms for type reconstruction do not slow compilation substantially.
Task Queues: A General Model for the Implementation of Communications Protocols
Authors: Ann Kratzer
Venue:  (1986)

When any computer communications network is built, its communications protocol must always be implemented. The protocol is implementetd on the switching nodes of the network. The node software must respond in real time to events generated external to the switching node. Thus, the software running on a switching node constitutes a concurrent program; this complicates the design, implementation and testing of the switching node software. The task queue model presented in this paper defines a structure for this software that facilitates the design, implementation and testing of communications protocols.
Safety of computerized I&C systems: projects of IEC standards with emphasis on power plant sector
Authors: E. Leret
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The paper discusses standards under development at international level, concerning safety aspects of computerized instrumentation and control (I&C) systems. An overview of the surveyed standards projects is provided, followed by a brief discussion on typical matters dealt with, and a comparison with other standards also under development on these topics. Our purpose is to highlight typical matters which are discussed in standardization bodies, because they can be deemed as representative of a certain evolution of the state of the art/practices in the area of safety critical software.
Distributing MPEG Movies Over the Internet using Programmable Networks
Authors: Dan He, Gilles Muller, Julia L. Lawall
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Distributing video over the Internet is an increasingly important application. Nevertheless, the real-time and high bandwidth requirements of video make video distribution over today's Internet a challenge. Adaptive approaches can be used to respond to changes in bandwidth availability while limiting the effect of such changes on perceptual quality and resource consumption. Nevertheless, most existing adaptation mechanisms have limited scalability and do not effectively exploit the heterogeneity of the Internet.In this paper, we describe the design and implementation of a MPEG video broadcasting service based on active networks. In an active network, routers can be programmed to make routing decisions based on local conditions. Because decisions are made locally, adaptation reacts rapidly to changing conditions and is unaffected by conditions elsewhere in the network.Programmability allows the adaptation policy to be tuned to the structure of the transmitted data, and to the properties of local clients. We use the PLAN-P domain-specific language for programming active routers; this language provides high-level abstractions andsafety guarantees that allow complex protocols to be developed rapidly and reliably. Our experiments show that our approach to video distribution permits the decoding of up to 9 times as many frames in a heavily loaded network as distribution using standard routers.
The Chebyshev Polynomials of a Matrix
Authors: Kim Toh, Lloyd N. Trefethen
Venue:  (1996)

A Chebyshev polynomial of a square matrix A is a monic polynomial of specified degree that minimizes ||p(A)||(sub2). The study of such polynomials is motivated by the analysis of Krylov subspace iterations in numerical linear algebra. An algorithm is presented for computing these polynomials based on reduction to a semidefinite program which is then solved by a primal-dual interior point method. Examples of Chebyshev polynomials of matrices are presented, and it is noted that if A is far from normal, the lemniscates of these polynomials tend to approximate pseudospectra of A.
Modified Sakurai-Newton Current Model and its Applications to CMOS Digital Circuit Design
Authors: Makram M. Mansour, Mohammad M. Mansour, Amit Mehrotra
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper presents a model for estimating the rain current in deep submicron CMOS devices. The model presented is an extension of Sakurai and Newton's model (SN-model)[1,2 ],and hence is referred to as the modi ?ed SN-model (MSN-model). The proposed model preserves the simplicity of the SN-model while providing accurate drain current estimates for varying device widths. The transistor drain current values predicted by the proposed model are compared with HSPICE level 49 simulations for 0.25 µm and 0.18 µm CMOS processes. Manually computed current values for inverter circuits via the proposed model match HSPICE simulations on average to within 1.2%(3% maximum)over a wide range of transistor widths, fanouts, and input rise/fall times. Further, this model is accurate in estimating the current in series-connected transistors having arbitrary widths, where the previous SN-model requires a delay degradation factor with transistors of equal sizes in order to work [3 ]. The proposed model has been successfully incorporated into a senior level circuit design course at the University of Illinois at Urbana-Champaign.
Link Accessibility in Electronic Journal Articles
Authors: donna bergmark
Venue:  (2000)

D-Lib is an electronic journal which has been available since 1995. Many of the articles in D-Lib contain references that are accompanied by URLs. Of interest is how valid these URLs are after some time goes by. An analysis of all the references within D-Lib articles shows that 85% of the 5 1/2 years of references remain accessible. However, by plotting the % accessible against date of the article, it is clear that link rot increases with age.
A Comparison Between Manual and Automatic Indexing Methods
Authors: Gerard Salton
Venue:  (1968)

The effectiveness of conventional document indexing is compared with that achievable by fully-automatic text processing methods. Evaluation results are given for a comparison between the MEDLARS search system used at the National Library of Medicine, and the experimental SMART system, and conclusions are reached concerning the design of future automatic information systems. 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
Database Querying Tool
Authors: Vasudev V. Yendapally
Venue:  (1995)

This project deals with the development of the back-end for a querying tool and the communication between the client and the server. The data retrieval and manipulation from an oracle database was done dynamically using the pro*c SQL precompiler and the communication between the client and the server was achieved with the help of stream sockets. 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
Future SOC Design Challenges and Solutions
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

SOC (System on a Chip) design creates tremendous design challenges to the traditional VLSI ASIC design. It covers not only the traditional DSM (Deep Sub-Micron) issues but also the integration issues such as IP and signal integrity especially for integrated digital/analog system such as Bluetooth. Besides, power consumption and power delivery are also impose huge design constraints to the already difficult situation especially for the portable and mobile devices. This talk will introduce and analysis the potential SoC issues and potential solutions from the architecture level to the circuit level.
On the convergence of entropy consistent schemes for lubrication type equations in multiple space dimensions
Authors: Günther Grün
Venue: Mathematics of Computation (2003)

We present nonnegativity-preserving finite element schemes for a general class of thin film equations in multiple space dimensions. The equations are fourth order degenerate parabolic, and may contain singular terms of second order which are to model van der Waals interactions. A subtle discretization of the arising nonlinearities allows us to prove discrete counterparts of the essential estimates found in the continuous setting. By use of the entropy estimate, strong convergence results for discrete solutions are obtained. In particular, the limit of discrete fluxes Mh(Uh)∇Ph will be identified with the flux M(u)∇(W'(u) - Δu) in the continuous setting. As a by-product, first results on existence and positivity almost everywhere of solutions to equations with singular lower order terms can be established in the continuous setting.
Oracle Administration and Management, 1 edition
Authors: Michael Ault
Venue:  (2002)

:A complete guide to the best techniques, tips, and tools for managing Oracle databasesOracle is the leading database worldwide, providing companies with fast access to critical business data. Oracle Administration and Management shows database administrators and managers how to keep Oracle databases running reliably and at peak performance. With the help of numerous real-world examples and scenarios, you'll gain valuable insight into all phases of Oracle database administration and management. From the initial installation and daily maintenance to backup and recovery procedures, you'll learn everything you need to know to become a successful Oracle DBA. Thoroughly updated for Oracle Release 9i, this book also provides complete coverage of Releases 8 and 8i, and shows you how to:Manage your Oracle database using best practices tested at operational Oracle sitesEfficiently monitor and manage your Oracle8, 8i, or 9i database using more than 400 automated scriptsAvoid pitfalls in the installation, upgrade, and migration to Oracle9i technologyUtilize Oracle's undocumented parameters and events to more effectively manage your Oracle databaseUse Oracle Enterprise Manager to help monitor and manage your databaseTune the database and troubleshoot problems using field-tested techniquesUnderstand Oracle9i Real Application Clusters and their implementationThe companion Web site includes all the scripts from the book, plus links to demo and lite versions of database management software and other DBA tools.
Search Engine Visibility
Authors: Shari Thurow, Danny Sullivan
Venue:  (2002)

:Search Engine Visibility is not about merely obtaining top positions in search search results. Rather, Search Engine Visibility is about designing, writing, and creating a web site primarily for your site's visitors, adn helping them find what they are searching for via the major search engines, directories, and industry-related sites. This book teaches developers, designers, programmers, and online marketers what pitfalls to avoid from the beginning so they can provide their clients with more effective site designs.
Dynamic behavior of feedback congestion control schemes
Authors: G. Pecelli, B. G. Kim
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

The paper examines the asymptotic behavior of solutions of a simple network model using feedback control under the presence of delays. It shows numerically the existence of complex asymptotic behavior dependent on both parameter values and initial conditions. The presence of multiple asymptotic periodic orbits of different characteristics at the same parameter values indicates that the interaction of asymptotic behavior with parameter ranges and initial histories is an extremely delicate matter.
Compiling Joy Into Silicon: a Formally Verified Compiler for Delay-Insensitive Circuits
Authors: Sam Weber, Bard Bloom, Geoffrey Brown
Venue:  (1996)

Manually designing delay-insensitive electronic circuits has proven to be difficult in practice. As an alternative, we designed and implemented a compiler that automatically produces such circuits. The source language for the compiler is a language called ``Joy'''', which is a simple but complete parallel language with a syntax similar to that of many procedural languages. The compiler''s output is a netlist suitable for input into standard place-and-route tools. In this paper, we present the highlights of the compilation algorithm, and the proof of correctness for it. This is among the first formally verified algorithms for compiling a general language into circuits.
On Seitz'' Arbiter
Authors: Alain J. Martin
Venue:  (1986)

No Abstract.
The Functional Decomposition of Polynomials
Authors: Matthew T. Dickerson
Venue:  (1989)

Let $f(\vec{x}), h_{1}(\vec{x}),...,h_{d}(\vec{x})$ and $g(\vec{x})$ be elements of the polynomial ring $K [\vec{x}]$ (or ``polynomials over $K$''''). If $f(\vec{x}) = g(h_{1}(\vec({x}),..., h_{d}(\vec{x})),$ then we call $g, h_{1},..., h{d}$ a functional decomposition of $f$. Polynomial decomposition is an important and interesting problem with a number of applications in computer scinece and computational algebra. Problems related to the decomposition of polynomials have received much attention in the past five years [AT85, BZ85, KL86, Dic87, vzGKL87, vzG87, vzG88, Dic88, KL89] as well as in the less recent past [Rit22, Eng41, Lev41, FM69, DW74]. In fact, the decomposition of polynomials is considered important enough that most major computational algebra systems (SCRATCHPAD II, MAPLE, MATHEMATICA) support polynomial decomposition for univariate polynomials. In this thesis, we examine various problems related to the functional decomposition of polynomials. We will give a brief history of polynomial decomposition, and then give a number of new results, including the first polynomial time algorithms for two important decomposition problems and a proof of the NP-completeness of another interesting polynomial decomposition problem. We will also discuss some ot the applications of polynomial decomposition to problems such as polynomial factorization and computing the inverse of an automorphism over a multivariate polynomial ring. For the latter, we will give the first known polyomial time algorithm.
Efficient Query Result Retrieval over the Web
Authors: Edward P. F. Chan, Koji Ueda
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Consider a geographic information system (GIS), which is set up as a Web server that allows users to query the database with a Web browser. As the query result may be huge and the network delay could be significant, we investigate the fundamental problem of how to deliver the query result efficiently over the network. In a conventional client-server database system, the commonly used application programming interface (API) is the so-called iterator-based interface in which a client queries the server with an ISQL statement and the result, which is called a result or active set, is generated. To retrieve the query result, multiple calls are made to the server and objects in the result set are retrieved sequentially. To enhance system performance, objects in a result set can also be retrieved in bulk by storing them in an array. In the Web environment, a database server is commonly implemented with a distributed object technology such as Java or CORBA. As network delay could be significant, the client memory spaces are limited, and varying, neither multiple calls nor bulk retrieval is a viable solution to this problem. We propose a technique by caching and piping the result set through a socket connection without forfeiting the iterator-based interface. We show that the proposed method is superior in delivering a query result in a LAN and in the Web environment. We then investigate how to retrieve and display geometric data in a map efficiently in a network environment. We show by experiments that, compared to other R-tree variants, the class of Multi-scale R-tree is an excellent indexing structure for supporting the display functionality in a GIS, especially when the system is set up as a Web server.
2003 editors' choice awards
Authors: Linux Journal Staff
Venue: Linux Journal (2003)

With all the great Linux stuff introduced in the past year, these are some of the hardest decisions we've ever made.
Harvard Business Review on Advances in Strategy
Authors: Robert Kaplan, James Gilbert, David Norton, Peter Tufano
Venue:  (2002)

:In today's ever-changing economic landscape, strategy has become even more of a key factor influencing business planning. This important volume will help the reader recognize and seize strategic opportunities. Featuring all new articles from the likes of Michael Porter, Kathleen Eisenhardt, and Robert Kaplan, Harvard Business Review on Advances in Strategy presents the latest breakthroughs in strategic planning from some of the most preeminent names in the field.