ppxscal/embedding_network huggingface dataset:
Workflow-based Authorization Service in Grid
Authors: Seung-Hyun Kim, Jong Kim, Sung-Je Hong, Sangwan Kim
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

In a distributed environment, specific rights may berequired while a task is controlled and processed. A usershould delegate enough rights to a task for processing.Tasks cannot work correctly if delegated rights areinsufficient, or security threats may occur if delegatedrights are excessive. Restricted delegation is the step thatdelegates proper rights to a task, and that enables fine-grainedauthorization in Grid. In this paper, we proposeWAS architecture as the method for supporting restricteddelegation and rights management. In contrast totraditional architecture, WAS architecture uses aworkflow that describes the sequence of rights requiredfor normal execution of a task. By using the workflow,WAS architecture is able to check whether the taskexercises allowed rights. WAS architecture isimplemented on Globus toolkit 2.0.
Some combinatorial identities via Fibonacci numbers
Authors: Gwang-Yeon Lee, Jin-Soo Kim, Seong-Hoon Cho
Venue: Discrete Applied Mathematics (2003)

The Pascal matrix and the Stirling matrices of the first kind and the second kind obtained from the Fibonacci matrix are studied, respectively. Also, we obtain combinatorial identities from the matrix representation of the Pascal matrix, the Stirling matrices of the first kind and the second kind and the Fibonacci matrix.
World wide web site design and use in public management
Authors: Carmine Scavo
Venue: Public information technology: policy and management issues (2003)

The World Wide Web (Web) has been widely adopted by local governments as a way to interact with local residents. The promise and reality of Web applications are explored in this chapter. Four types of Web utilizations are analyzed--bulletin board applications; promotion applications; service delivery applications; and citizen input applications. A survey of 145 municipal and county government websites originally conducted in 1998 was replicated in 2002. These data are used to examine how local governments are actually using the Web and to examine the evolution of Web usage over the four years between the first and second survey. The chapter concludes that local governments have made progress in incorporating many of the features of the Web but that they have a long way to go in realizing its full promise.
Design and analysis of ALE schemes with provable second-order time-accuracy for inviscid and viscous flow simulations
Authors: Philippe Geuzaine, Céline Grandmont, Charbel Farhat
Venue: Journal of Computational Physics (2003)

We consider the solution of inviscid as well as viscous unsteady flow problems with moving boundaries by the arbitrary Lagrangian-Eulerian (ALE) method. We present two computational approaches for achieving formal second-order time-accuracy on moving grids. The first approach is based on flux time-averaging, and the second one on mesh configuration time-averaging. In both cases, we prove that formally second-order time-accurate ALE schemes can be designed. We illustrate our theoretical findings and highlight their impact on practice with the solution of inviscid as well as viscous, unsteady, nonlinear flow problems associated with the AGARD Wing 445.6 and a complete F-16 configuration.
Review of "Advances in software maintenance management: Technologies and solutions" by Macario Polo, Mario Piattini and Francisco Ruiz, Idea Group Publishing, Idea Group, Inc., U.S.A. 2003
Venue: Journal of Software Maintenance: Research and Practice (2003)

Here is a new offering, now available both as a hardcover and as an e-book, in the much-neglected category of comprehensive texts on software maintenance. It is especially welcome for those of us struggling to provide our students with a text for learning the basics of software maintenance, in preparation for their inevitable first maintenance assignments as junior software engineers. This new book, Advances in Software Maintenance Management: Technologies and Solutions, edited by Macario Polo, Mario Piattini, and Francisco Ruiz at the University of Castilla-La Mancha in Spain, is not intended to be an academic textbook and so is lacking in some areas for that purpose. However, it has some important advantages over the few other choices in this area. It also is a useful volume for managers and others interested in getting an up-to-date understanding of some of the major issues in software maintenance.
On Communication and Computation
Authors: Paul Bohan Broderick
Venue: Minds and Machines (2004)

Comparing technical notions of communication and computation leads to a surprising result, these notions are often not conceptually distinguishable. This paper will show how the two notions may fail to be clearly distinguished from each other. The most famous models of computation and communication, Turing Machines and (Shannon-style) information sources, are considered. The most significant difference lies in the types of state-transitions allowed in each sort of model. This difference does not correspond to the difference that would be expected after considering the ordinary usage of these terms. However, the natural usage of these terms are surprisingly difficult to distinguish from each other. The two notions may be kept distinct if computation is limited to actions within a system and communications is an interaction between a system and its environment. Unfortunately, this decision requires giving up much of the nuance associated with natural language versions of these important terms.
Pathways database system: an integrated set of tools for biological pathways
Authors: L. Krishnamurthy, J. Nadeau, G. Ozsoyoglu, M. Ozsoyoglu, G. Schaeffer, M. Tasan, W. Xu
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

During the next phase of the Human Genome Project, research will focus on functional studies of attributing functions to genes, their regulatory elements, and other DNA sequences. To facilitate the use of genomic information in such studies, a new modeling perspective is needed to examine and study genome sequences in the context of many kinds of biological information. Pathways are the logical format for modeling and presenting such information in a manner that is familiar to biological researchers. In this paper we present an integrated system, called Pathways Database System, with a set of software tools for modeling, storing, analyzing, visualizing, and querying biological pathways data at different levels of genetic, molecular, biochemical and organismal detail. The novel features of the system include: a) genomic information integrated with other biological data and presented from a pathway, rather than from the DNA sequence, perspective; b) design for biologists who are possibly unfamiliar with genomics, but whose research is essential for annotating gene and genome sequences with biological functions; c) database design, implementation and graphical tools which enable users to visualize pathways data in multiple abstraction levels, and to pose predetermined queries; and d) an implementation that allows for web(XML)-based dissemination of query outputs (i.e., pathways data) to researchers in the community, giving them control on the use of pathways data.
Microprocessor applications in the nuclear industry
Authors: C. Dwayne Ethiridge
Venue: ACM SIGCAS Computers and Society (1980)

Microprocessors in the nuclear industry, particularly at the los Al amos Scientific Laboratory, have been and are being utilized in a wide variety of applications ranging from data acquistion and control for basic physics research to monitoring special nuclear material in long-term storage. Microprocessor systems have been developed to support weapons diagnostics measurements during undergorund weapons testing at the Nevada Test Site. Multiple single-component microcomputers are now controlling the measurement and recording of nuclear reactor operating power levels. The CMOS microprocess data-acquisition instrumentation has operated on ballon flights to monitor power plant emissions. Target chamber mirror-positioning equipment for laser fusion facilities employs microprocessors.
Combining Optical Holograms with Interactive Computer Graphics
Authors: Oliver Bimber
Venue: Computer (2004)

Holograms can reconstruct complete optical wavefronts, capturing images that have a three-dimensional appearance and can be observed from different perspectives. Museum exhibits often use optical hologram technology because it permits presentation of 3D objects with almost no loss in visualquality. Optical holograms are static, however, and lack interactivity. Combining 3D computer graphical elements with stereoscopic presentation techniques provides an alternative that allows interactivity.
Evolutionary local search of fuzzy rules through a novel neuro-fuzzy encoding method
Authors: A. Carrascal, D. Manrique, J. Ríos, C. Rossi
Venue: Evolutionary Computation (2003)

This paper proposes a new approach for constructing fuzzy knowledge bases using evolutionary methods. We have designed a genetic algorithm that automatically builds neuro-fuzzy architectures based on a new indirect encoding method. The neurofuzzy architecture represents the fuzzy knowledge base that solves a given problem; the search for this architecture takes advantage of a local search procedure that improves the chromosomes at each generation. Experiments conducted both on artificially generated and real world problems confirm the effectiveness of the proposed approach.
Renaissance: a cross-platform development tool for Linux and Mac OS X
Authors: Ludovic Marcotte
Venue: Linux Journal (2004)

Use this XML-based tool to build the same software on Linux andMac OS X.
Performing Interpolation and Anterpolation Entirely by Fast Fourier Transform in the 3-D Multilevel Fast Multipole Algorithm
Authors: Jukka Sarvas
Venue: SIAM Journal on Numerical Analysis (2003)

The fast multipole methods are used for solving a scalar acoustic or vector electromagnetic wave equation by integral equation methods with a large number of unknowns. In this paper a new method is presented for performing interpolation and anterpolation in both spherical coordinates $\theta$ and $\phi$ by FFT in the three-dimensional (3-D) multilevel fast multipole algorithm (MLFMA). The key idea is to approximate functions on the unit sphere by truncated Fourier series in two variables rather than by the usual spherical harmonics.The proposed method is exact in interpolating and anterpolating and has the high numerical efficiency of FFT. The method is numerically compared to the method of performing interpolation and anterpolation using Lagrangian interpolation, which presently is probably the fastest method for those operations, and the results suggest that the proposed new method is equally or more efficient, depending on the desired accuracy.
Computational science in high schools: defining curricula and environments
Authors: Paolo Mori, Laura Ricci
Venue: Future Generation Computer Systems (2003)

The paper presents a new approach for the introduction of computational science into high level school curricula. It also discusses a set of real life problems that are appropriate for these curricula because they can be described through simple models. The computer based simulation of these systems require an ad hoc environment, including a programming language, suitable for this target age. The paper proposes a new environment, the ORESPICS environment, including a new programming language. The sequential part of the language integrates the classical imperative constructs with a simple set of graphical primitives, mostly taken from the LOGO language. The concurrent part of the language is based on the message passing paradigm. The solutions of some classical problems through ORESPICS are shown.
The Laplace Image of Random Processes and Nonparametric Identification of Continuous Systems
Authors: B. O. Kachanov
Venue: Automation and Remote Control (2004)

The Laplace image of stationary random normal processes is studied. The covariance function of the Laplace image of white noise is converted by a linear shaping filter into the covariance function of the Laplace image of the filter output process. The relationship between the covariance function of the Laplace image of a random process and the autocovariance function and spectral density is determined. The covariance function of the Laplace image of measurement errors of a transition process in a stationary linear system is applied in optimal nonparametric identification of the transfer function.
Interactive information retrieval from XML documents represented by attribute grammars
Authors: Alda Lopes Gançarski, Pedro Rangel Henriques
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

In this paper, we describe a system to interactively accede to XML documents represented by attribute grammars. The system has two main components: (1) the query editor/processor, where the user interactively specifies his needs; (2) the document analyzer, which performs operations for query evaluation that accede directly to the documents. The interactive construction of queries is based on the manipulation of intermediate results during query construction and evaluation. We believe this helps the user to achieve the desired result.
Fast surface rendering from raster data by voxel traversal using chessboard distance
Authors: Miloš Šrámek
Venue: Proceedings of the conference on Visualization '94 (1994)

The increasing distinguishing capability of tomographic and other 3D scanners as well as the new voxelization algorithms place new demands on visualization techniques aimed at interactivity and rendition quality. Among others, triangulation on a subvoxel level based on the marching cube algorithm has gained popularity in recent years. However, without graphics hardware support, rendering many small triangles could be awkward.We present a surface rendering approach based on ray tracing of segmented volumetric data. We show that if a proper interpolation scheme and voxel traversal alogorithm are used, high quality images can be obtained within an acceptable time and without hardware support.
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
Authors: Josep Díaz, Mathew D. Penrose, Jordi Petit, María Serna
Venue: Combinatorics, Probability and Computing (2000)

This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, Vertex Separation, Edge Bisection and Vertex Bisection. For full square lattices, we give optimal layouts for the problems still open. For arbitrary lattice graphs, we present best possible bounds disregarding a constant factor. We apply percolation theory to the study of lattice graphs in a probabilistic setting. In particular, we deal with the subcritical regime that this class of graphs exhibits and characterize the behaviour of several layout measures in this space of probability. We extend the results on random lattice graphs to random geometric graphs, which are graphs whose nodes are spread at random in the unit square and whose edges connect pairs of points which are within a given distance. We also characterize the behaviour of several layout measures on random geometric graphs in their subcritical regime. Our main results are convergence theorems that can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidean TSP on random points in the unit square.
A theory-model formalization of FlexOr
Authors: Gunnar Gotshalks
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

This report is a description of a part of 4Thought, a collection of software design tools and methods for assisting software designers. One of the tools in 4Thought is FlexOr, which combines literate programming and frame adaptation to create and document software designs. One of the fundamental methods in using 4Thought is the theory-model paradigm, in which are created a formal theory for a class of software design problems and then the designs that satisfy the formal theory are created. This report presents a formal theory using Z notation, entity-relationship diagrams, and GraphLog to specify the formal theory for the literate programming part of FlexOr frames.
Equilibriating instructional media for cognitive styles
Authors: James A. Redmond, Cathal Walsh, Adrian Parkinson
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Two types of instructional (Text and Web) that had been used in a previous study [1] were adapted to accommodate Cognitive Style preferences for Witkin's Field-dependent [2] and Riding's Imager [3]. Ninety six Information Systems students were randomly allocated to each of these environments and their Cognitive Styles were assessed. The students studied an Introductory Course in Artificial Intelligence one hour per week for six weeks after which they were assessed by a one hour exam. It was found that Field-dependents and Field-independents performed similarly in both environments as indicated by their examination scores demonstrating the success of the adaption of both environments for Field-dependents. The adaptation for Imagers as measured by Riding's CSA [3] was not successful as Verbalisers performed better than Imagers in both Text and Web. This raises questions about the stability of Riding's Verbaliser/Imager dimension. People performed significantly better in the Text environment than in the Web environment.
Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
Authors: Valeria Simoncini, Daniel B. Szyld
Venue: SIAM Journal on Scientific Computing (2003)

We provide a general framework for the understanding of inexact Krylov subspace methods for the solution of symmetric and nonsymmetric linear systems of equations, as well as for certain eigenvalue calculations. This framework allows us to explain the empirical results reported in a series of CERFACS technical reports by Bouras, Frayssé, and Giraud in 2000. Furthermore, assuming exact arithmetic, our analysis can be used to produce computable criteria to bound the inexactness of the matrix-vector multiplication in such a way as to maintain the convergence of the Krylov subspace method. The theory developed is applied to several problems including the solution of Schur complement systems, linear systems which depend on a parameter, and eigenvalue problems. Numerical experiments for some of these scientific applications are reported.
Stability vs optimality tradeoff in game theoretic mechanisms for QoS provision
Authors: Andrew Lomonosov, Meera Sitharam, Kihong Park
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We study noncooperative games whose players are selfish, distributed users of a network and the game's objective is to optimize Quality of Service (QoS). Our classes of games are based on generally accepted realistic microeconomic market models of QoS provision, and unlike most other games that have been recently studied in this context, stability is not guaranteed for our class of games. Stability here refers to whether the game reaches a Nash equilibrium. Optimality is a measure of how close a Nash equilibrium is to optimizing a given objective function defined on game configuration. The overall goal is to determine a minimal set of static game rules based on pricing that result in stable and optimal QoS provision. The combination of stability and optimality opens an interesting direction of investigation. We give a new and general technique to establish stability and demonstrate a close trade-off between stability and optimality for our game classes. Additionally, these results directly give a simple, computationally efficient, self-organizing mechamism for stable and optimal QoS provision in natural cases.
A New Scheme for IP-based Internet-Mobility
Authors: Thomas Dreibholz, Andreas Jungmaier, Michael Tüxen
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this contribution we present a new type of mobility managementfor IP-based networks that, contrary to conventionalapproaches, does not focus on the network layer, buton the transport and session layers.At the heart of this new mobility concept is the reliabletransport protocol SCTP, with an enhancement for dynamicaddress reconfiguration. The reliable server pooling (RSer-Pool)protocol suite provides a service for session monitoringand control. The suggested solution is transparent forapplications, requires no changes in the network infrastructure,and is evaluated with a real-world implementation.Finally, we present first results from the application of thismobility concept to different mobility scenarios. These wereobtained from working SCTP and RSerPool implementationsthat have been developed within our group.
Toward program representation and program understanding using process algebras
Authors: Kostas Kontogiannis
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

In this paper, we investigate the use of process algebras for program representation and program understanding. Process algebras can be used not only to represent process behaviour, but also to reason about, it by defining equivalence and partial order relations. In our approach, the programming language constructs are denoted as communicating agents, and the program semantics are given in a compositional way in terms of the semantics of the program's subcomponents. Semantic equivalences between code fragments and process algebra descriptions of standard programming plans can he derived in this formalism. This paper illustrates these ideas and identifies relevant. research issues.
RoboCupRescue System and Arian: A Flexible Infrastructure for Multi-Agent Research and Education
Authors: Mazda Ahmadi, Tomoichi Takahashi, Jafar Habibi, Tetuchiko Koto
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

One of the main requisites for multi agent researchers is a multi-purpose infrastructure that enables them to create, test and evaluate protocols, methods and algorithms. RoboCupRescue simulation environment is a flexible and configurable environment that can fill this gap. With changes in its configuration files, it will gain different features, so different methods can be designed, implemented, and tested. This environment is actually suitable for most multi-agent research issues such as cooperation, coordination, agent communication languages, and agent micro level issues. Sensible roles and tasks in the system motivate more research and make this environment a suitable infrastructure for educational purposes.Arian is a set of implemented agents for RoboCupRescue system. Using Arian agents will speed up implementing agents for this environment.In this paper we will introduce RoboCupRescue simulation environment and Arian agents along with some examples of research issues in this environment. We will also present some of RoboCupRescue sub-problems for specific research goals. Although RoboCupRescue can be considered as an application of multi-agent research, in this paper we will focus on the suitability of this environment as an infrastructure for multi-agent research and education.